2024-03-29T13:21:11Z
http://www.sciencepubco.com/index.php/JACST/oai
oai:ojs.pkp.sfu.ca:article/4
2014-11-13T03:03:39Z
JACST:ART
Performance analysis of CO2/NH3 cascade refrigeration system using artificial neural networks
Rashidi, Mohammad Mehdi
In this study, artificial neural networks (ANNs) have been used for performance analysis of a CO2/NH3 cascade refrigeration system. Energy and exergy analysis of the system is firstly investigated using a computer code implemented in EES. It is well known that four main variables, including condensing temperature of ammonia, evaporating temperature of carbon dioxide, condensing temperature of carbon dioxide and temperature difference in cascade condenser affect the coefficient of performance (COP) and the exergetic efficiency. In this study, these two parameters in addition to certain useful values such as mass flow rate of high and low temperature circuits, power consumption of each compressor and also total exergy destruction are estimated in terms of the above temperatures. Feed-forward backpropagation learning algorithm was used in the network. A set of calculated data obtained from EES was used as training and test data. The computer program has been performed under MATLAB environment using neural network toolbox. New formulation obtained from ANN for this couple of refrigerants is presented for the calculation of abovementioned target values. The R value obtained when unknown data were used to the networks was 0.999992 which is very satisfactory. As an alternative method, it can be easily implemented in all programming languages with the aims of simulation or optimization. It can also be used where a very accurate and fast estimation of the system performance is of interest to engineers.
Science Publishing Corporation
2012-03-24
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/4
10.14419/jacst.v1i1.4
Journal of Advanced Computer Science & Technology; Vol. 1 No. 1 (2012); 1-17
2227-4332
10.14419/jacst.v1i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/4/438
oai:ojs.pkp.sfu.ca:article/6
2014-11-13T03:03:40Z
JACST:ART
E6 Addressing Scheme and Network Architecture
Zaitsev, Dmitry Anatolyevich
Bolshakov, Sergey Ivanovich
The paper describes new E6 addressing scheme for the creation of world-wide networks totally constructed on the base of Ethernet technology. Hierarchic E6 addresses with the length of 6 octets are used instead of both Ethernet MAC-addresses and IP-addresses that allows the routing within world-wide networks and cuts overhead of TCP, IP headers; the address space is extended in 16K times regarding IP addresses. Standard Ethernet LLC2 facilities are employed for guaranteed delivery of information. E6 Network Architecture simplifies packets processing algorithms that improves the network performance and QoS.
Science Publishing Corporation
2012-03-22
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/6
10.14419/jacst.v1i1.6
Journal of Advanced Computer Science & Technology; Vol. 1 No. 1 (2012); 18-31
2227-4332
10.14419/jacst.v1i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/6/437
oai:ojs.pkp.sfu.ca:article/10
2014-11-13T03:03:42Z
JACST:ART
Shelf Life Estimation of Processed Cheese by Artificial Neural Network Expert Systems
GOYAL, SUMIT
Goyal, Gyanendra Kumar
Time –delay artificial neural network (ANN) single layer and multilayer artificial models were developed for predicting the shelf life of processed cheese stored at 7-8o C. Soluble nitrogen, pH; standard plate count, yeast & mould count, and spore count were input variables, and sensory score was output variable. The results showed excellent agreement between training and validation data with high coefficient of determination and nash - sutcliffo coefficient, thus suggesting that the developed models are good for predicting the shelf life of processed cheese.
Science Publishing Corporation
2012-03-30
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/10
10.14419/jacst.v1i1.10
Journal of Advanced Computer Science & Technology; Vol. 1 No. 1 (2012); 32-41
2227-4332
10.14419/jacst.v1i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/10/439
oai:ojs.pkp.sfu.ca:article/21
2014-11-13T03:03:43Z
JACST:ART
Economic Load Dispatch Problem with Reduce Power Losses using Firefly Algorithm, “This paper has been withdrawn”
Swarnkar, Kuldeep
This paper has been withdrawn.
Science Publishing Corporation
2012-05-10
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
http://www.sciencepubco.com/index.php/JACST/article/view/21
10.14419/jacst.v1i2.21
Journal of Advanced Computer Science & Technology; Vol. 1 No. 2 (2012); 42-56
2227-4332
10.14419/jacst.v1i2
oai:ojs.pkp.sfu.ca:article/84
2014-11-13T03:03:44Z
JACST:ART
Particle Swarm Optimization For N-Queens Problem
Shaikh, Aftab Ahmed
Shah, Atiq
Ali, Kamran
Shah Bukhari, Abdul Hussain
The N-Queen is one of the prominent toy problems for performance assessment in the domain of Computational Intelligence. The problem can examine the diverse aspects of solving techniques, counting the potential of obtaining feasible solution and time & space complexity. The well-defined set of constraint sketches out the overall problem. The Queen has various attacking options over the chessboard. In point of fact, it can walk off across the column, row and two diagonal. The feasible solution of N-Queens demands the non-attacking placements over the chessboard. This research inspects the effectiveness of Particle Swarm Optimization in order to solve the problem. In PSO, the particle contains a structured set of Queen Placements. Current position of particle is well directed by the pbest and gbest parameters, each new generation obtains more converged set of particles. The partial but improved outcome promotes and furnishes to succeeding generation while the substandard may be discarded. The investigational results make known the dynamic features of PSO and eventually validate the effectiveness of research direction. Keywords: N-Queens problem, PSO, Constraints.
Science Publishing Corporation
2012-05-28
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/84
10.14419/jacst.v1i2.84
Journal of Advanced Computer Science & Technology; Vol. 1 No. 2 (2012); 57-63
2227-4332
10.14419/jacst.v1i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/84/69
oai:ojs.pkp.sfu.ca:article/92
2014-11-13T03:03:46Z
JACST:ART
Dynamic Vision Sensor Camera Based Bare Hand Gesture Recognition
khedkkar safaya, kashmera ashish
Lathi, Rekha
This Paper proposes a method to recognize bare hand gestures using dynamic vision sensor (DVS) camera. DVS camera only responds asynchronously to pixels that have temporal changes in intensity which different from conventional camera. This paper attempts to recognize three different hand gestures rock, paper and scissors and using those hand gestures design mouse free interface. Keywords: Dynamic vision sensor camera, Hand gesture recognition
Science Publishing Corporation
2012-05-31
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/92
10.14419/jacst.v1i2.92
Journal of Advanced Computer Science & Technology; Vol. 1 No. 2 (2012); 64-72
2227-4332
10.14419/jacst.v1i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/92/74
oai:ojs.pkp.sfu.ca:article/109
2014-11-13T03:03:48Z
JACST:ART
Artificial Neural Networks for Dairy Industry: A Review
Goyal, Sumit
Artificial Neural Networks (ANNs) have been implemented in almost every field, viz., science, technology, medicine and engineering as they have proved useful tools for obtaining the desired output including the analyses and shelf life prediction in case of food products. This review discusses the systematic information available in the literature concerning the implementation of ANN models for shelf life determination of milk, various dairy products, viz., yoghurt, chocolate, butter, cheese, kalakand, dairy confections and milk based coffee drinks, which would be very useful for dairy industry, consumers, wholesalers, retailers, regulatory agencies, food researchers and academicians.
Science Publishing Corporation
2012-06-29
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/109
10.14419/jacst.v1i3.109
Journal of Advanced Computer Science & Technology; Vol. 1 No. 3 (2012); 101-115
2227-4332
10.14419/jacst.v1i3
eng
http://www.sciencepubco.com/index.php/JACST/article/view/109/109
oai:ojs.pkp.sfu.ca:article/135
2014-11-13T03:03:47Z
JACST:ART
Content-based navigation within virtual museums
Koutsoudis, Anestis
Makarona, Christina
Pavlidis, George
The ongoing evolution of the Internet has enabled web applications that use real time three-dimensional (3D) graphics and virtual environments. Moreover, in recent years, cultural technology has also flourished notably. Virtual museums represent one significant application that combines culture with modern technologies and the internet, requiring an interdisciplinary approach aiming both at dissemination and education. We present our approach to enhance virtual museums by incorporating content-based retrieval that refers to 3D objects. In this context, a virtual visitor is able to navigate within the museum, examine the exhibited artifacts and perform queries-by-example in order to locate the position of related artifacts. The retrieval mechanism responds to the visitor’s queries by indicating similar artifacts, which are ranked according to their similarity scores. This way, the visitor is able to navigate within a virtual museum not only by means of a virtual walkthrough but also by means of the context
Science Publishing Corporation
2012-06-20
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/135
10.14419/jacst.v1i2.135
Journal of Advanced Computer Science & Technology; Vol. 1 No. 2 (2012); 73-81
2227-4332
10.14419/jacst.v1i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/135/100
oai:ojs.pkp.sfu.ca:article/136
2014-11-13T03:03:49Z
JACST:ART
Identifying aspects of Ambient Intelligence through a review of recent developments
Charalampidou, Maria
Mouroutsos, Spyridon
Pavlidis, George
It has already been realized by the scientific and technical community that a new form of technology is going to lead the future technological developments. This technology will be more human-centric and will be more and more “hidden” within everyday-life objects. It will be smarter, personalized, pervasive and ubiquitous. This technology includes what is called Ambient Intelligence (AmI). In this paper, we identify the main aspects of AmI through a review of the recent developments that have been achieved in these aspects of AmI and Ambient Intelligence Environments (AmIEs), as well as point out the problems yet to be solved and the visions of the future.
Science Publishing Corporation
2012-06-20
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/136
10.14419/jacst.v1i3.136
Journal of Advanced Computer Science & Technology; Vol. 1 No. 3 (2012); 82-100
2227-4332
10.14419/jacst.v1i3
eng
http://www.sciencepubco.com/index.php/JACST/article/view/136/102
oai:ojs.pkp.sfu.ca:article/212
2014-11-13T03:03:51Z
JACST:ART
DFT domain Feature Extraction using Edge-based Scale Normalization for Enhanced Face Recognition
K., Manikantan
S., Ramachandran
This paper proposes a novel preprocessing technique in order to improve the performance of a Face Recognition (FR) system. The proposed Edge-based Scale Normalization (ESN) process involves the use of scale normalization along with edge detection as a preprocessing technique in order to eliminate unwanted background details in face images. Feature extraction is performed on the preprocessed image using Discrete Fourier Transform (DFT). The DFT spectrums of these images extract the low frequency coefficients required for face recognition. These important features are selected through a rhombus-shaped mask around the center of the DFT spectrum. Further optimization in feature selection is achieved through Binary Particle Swarm Optimization (BPSO) technique. Experimental results, obtained by applying the proposed algorithm on Cambridge ORL and Extended YaleB face databases, show that the proposed system outperforms other FR systems. A significant increase in the recognition rate and a substantial reduction in the number of features are observed. Significant dimensionality reduction by more than 98.5% and improved recognition rate of 98% are achieved for both datasets.
Science Publishing Corporation
2012-08-15
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/212
10.14419/jacst.v1i3.212
Journal of Advanced Computer Science & Technology; Vol. 1 No. 3 (2012); 134-166
2227-4332
10.14419/jacst.v1i3
eng
http://www.sciencepubco.com/index.php/JACST/article/view/212/207
oai:ojs.pkp.sfu.ca:article/230
2014-11-13T03:03:55Z
JACST:ART
Introducing Software-Based Fault Handling Mechanism to Cope with Electromagnetic Interference (EMI) in Digital Electronic Circuits
Olayinka, Jinadu
Arobieke, Oluwole Olusegun
Idowu, Kayode
Samuel, Osafehiniti
Digital circuits operating under radiation are subject to different kinds of permanent and transient effects. Most electromagnetic (EM) environment in which electronic systems have to operate is becoming increasingly hostile while dependence on electronics is widespread and increasing. The need for digital architectures to survive faults and remain dependable despite the multiple-fault injection nature of the electromagnetic interference (EMI) in microprocessors calls for the introduction of a software-based fault handling mechanism.Redundancy, which is a common answer to increasing error-coverage in most safety-critical applications offers higher dependability but for most low-cost computer based systems (including Digital Signal Processors), another technique is implemented for effectiveness. This paper implements the duplicate j-instruction rule on high-level programming to detect faulty jumps. Code redundancy and consistency checks covers the fault to increase system reliability
Science Publishing Corporation
2012-08-26
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/230
10.14419/jacst.v1i4.230
Journal of Advanced Computer Science & Technology; Vol. 1 No. 4 (2012); 187-194
2227-4332
10.14419/jacst.v1i4
eng
http://www.sciencepubco.com/index.php/JACST/article/view/230/264
oai:ojs.pkp.sfu.ca:article/237
2014-11-13T03:03:52Z
JACST:ART
Different Synchronization schemes for chaotic Rikitake systems
Khan, Mohammad Ali
This paper presents the chaos synchronization by designing different type of controller. Firstly, we propose the synchronization of bi-directional coupled chaotic Rikitake systems via hybrid feedback control. Secondly we study the synchronization of unidirectionally coupled Rikitake systems using hybrid feedback control. Lastly, we investigate the synchronization of unidirectionally coupled Rikitake chaotic systems using tracking control. Comparing with all results finally we conclude that tracking control is more effective than feedback control. Simulation results are presented to show the efficiency of synchronization schemes.
Science Publishing Corporation
2012-08-18
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/237
10.14419/jacst.v1i3.237
Journal of Advanced Computer Science & Technology; Vol. 1 No. 3 (2012); 167-175
2227-4332
10.14419/jacst.v1i3
eng
http://www.sciencepubco.com/index.php/JACST/article/view/237/213
oai:ojs.pkp.sfu.ca:article/248
2014-11-13T03:03:56Z
JACST:ART
Detail Preserving Fast Median Based Filter
Hanji, Geeta
Latte, Mrutunjaya
In this paper, a new nonlinear median based filtering technique is introduced for the enhancement of grey scale images that are highly contaminated by impulse noise. The proposed Detail Preserving Fast Median Filtering (DPFMF) technique is more effective in eliminating fixed value impulse noise and preserving the image details. The filter replaces a corrupted pixel by the median value of the fast median filter or by the value computed based on a unique criterion applied to the processed neighboring pixel values. The uncorrupted pixels are left undisturbed. Simulation studies show that the proposed filter can eliminate impulse noise of densities up to 80% while preserving the edges and fine details satisfactorily. The performance is evaluated by applying the proposed filter on various grey scale images and the superior results obtained in terms of subjective and objective evaluation are presented. Index Terms—Impulse Noise, Fast Median Filtering, Nonlinear Filter, Order Statistics Filter, Detail preservation, Image Enhancement
Science Publishing Corporation
2012-08-29
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/248
10.14419/jacst.v1i4.248
Journal of Advanced Computer Science & Technology; Vol. 1 No. 4 (2012); 195-206
2227-4332
10.14419/jacst.v1i4
eng
http://www.sciencepubco.com/index.php/JACST/article/view/248/244
oai:ojs.pkp.sfu.ca:article/269
2014-12-20T03:25:08Z
JACST:ART
Study of error control capability for the new moduli set \({2^{2n+1}+2^{n}-1, 2^{2n+1}-1, 2^{n}-1, 2^{3n},2^{3n+1}-1}\)
Modiri, Samira
Movaghar, Ali
Barati, Ali
In this paper, a new 3-moduli set {22n+1+2n-1, 22n+1-1, 2n-1} with an efficient residue-to-binary converter using mixed radix conversion algorithm is presented. Moreover, by adding two redundant modulus {23n, 23n+1-1}, a new moduli set in redundant residue number system is provided that can correct up to (2n+2) error bits. Simulation results of the error control algorithm's functionality with C++ programming language for 10'000 different error bits states show that the average percent of error detection capability using the proposed moduli set by setting n=2 is equal to 77.97%.
Science Publishing Corporation
2012-08-26
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/269
10.14419/jacst.v1i4.269
Journal of Advanced Computer Science & Technology; Vol. 1 No. 4 (2012); 176-186
2227-4332
10.14419/jacst.v1i4
eng
http://www.sciencepubco.com/index.php/JACST/article/view/269/315
oai:ojs.pkp.sfu.ca:article/274
2014-11-13T03:03:53Z
JACST:ART
Implementing Stack E6 via OS Linux Sockets
Zaitsev, Dmitry A
M.A., Kharsun
New software implementation of Ukrainian national stack of networking protocols E6 was presented. Within operating system Linux kernel, families of E6 protocols and addresses were created as well as functions of their processing, in the form of a loadable module. Application of socket technology gives a series of considerable advantages among which unified with other stacks application interface, reuse of the kernel resources facilitating the further development and enterprise implementation of stack E6, engineering corresponding networking devices.
Science Publishing Corporation
2012-07-24
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
application/x-zip-compressed
http://www.sciencepubco.com/index.php/JACST/article/view/274
10.14419/jacst.v1i3.274
Journal of Advanced Computer Science & Technology; Vol. 1 No. 3 (2012); 116-133
2227-4332
10.14419/jacst.v1i3
eng
http://www.sciencepubco.com/index.php/JACST/article/view/274/165
http://www.sciencepubco.com/index.php/JACST/article/view/274/16906
oai:ojs.pkp.sfu.ca:article/301
2014-11-13T03:03:59Z
JACST:ART
Gradient Based Control and Synchronization of Lorenz System with Periodic Parametric Forcing
Khan, Mohammad Ali
Several important properties of chaos synchronization with gradientbased control of chaotic system with periodic parametric forcing remainstill unexplored. This paper investigates the behavior of the Lorenz systemto change from chaotic to periodic, parametric forcing also entrainsthe system output with the forcing frequency. Secondly synchronizationof two identically chaotic Lorenz systems are derived by linear feedbackcontrol and then discussed the gradient based control method for Lorenzsystem with periodic parametric forcing. Finally numerical simulationresults are presented to show the feasibility and effectiveness of the approach.
Science Publishing Corporation
2012-09-04
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
application/postscript
application/postscript
application/postscript
application/postscript
application/postscript
application/postscript
http://www.sciencepubco.com/index.php/JACST/article/view/301
10.14419/jacst.v1i4.301
Journal of Advanced Computer Science & Technology; Vol. 1 No. 4 (2012); 222-231
2227-4332
10.14419/jacst.v1i4
eng
http://www.sciencepubco.com/index.php/JACST/article/view/301/285
http://www.sciencepubco.com/index.php/JACST/article/view/301/16912
http://www.sciencepubco.com/index.php/JACST/article/view/301/16913
http://www.sciencepubco.com/index.php/JACST/article/view/301/16914
http://www.sciencepubco.com/index.php/JACST/article/view/301/16915
http://www.sciencepubco.com/index.php/JACST/article/view/301/16916
http://www.sciencepubco.com/index.php/JACST/article/view/301/16917
oai:ojs.pkp.sfu.ca:article/318
2014-11-13T03:04:00Z
JACST:ART
Computer Virus: Their Problems & Major at-tacks in Real Life
Joshi, Milind. J.
patil, Bhaskar Vijayrao
Today's enterprise networks are distributed to different geographical locations and applications are more centrally located, information represents the most important asset. With the growing number of data communication services, channels and available software applications, data are processed in large quantities and in a more efficient manner. This technological enhancement offers new flexible opportunities also measure security threats poses in the networks. These threats can external or Internal, external threats divided as hacking, virus attack, Trojans, worms etc. There are thousand and thousand of different viruses these days which improve every day. Although the wild spread of new and strong viruses, it still infects and spread only with user's permission. This research paper highlights the phases of computer virus, computer virus, history of worst computer attack, type of computer virus with effect on computer & few examples of virus on their types, working of computer virus, and problem occur due to virus in computers.
Science Publishing Corporation
2012-11-08
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/318
10.14419/jacst.v1i4.318
Journal of Advanced Computer Science & Technology; Vol. 1 No. 4 (2012); 316-324
2227-4332
10.14419/jacst.v1i4
eng
http://www.sciencepubco.com/index.php/JACST/article/view/318/448
oai:ojs.pkp.sfu.ca:article/366
2014-11-13T03:04:01Z
JACST:ART
An adaptive Power controlled routing in Wireless Ad hoc Networks, “This paper has been withdrawn”
Ramalingam, Madhanmohan
Kannabiran, Selvakumar
This paper has been withdrawn.
Science Publishing Corporation
2012-08-30
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
http://www.sciencepubco.com/index.php/JACST/article/view/366
10.14419/jacst.v1i4.366
Journal of Advanced Computer Science & Technology; Vol. 1 No. 4 (2012); 207-221
2227-4332
10.14419/jacst.v1i4
oai:ojs.pkp.sfu.ca:article/384
2014-11-13T03:04:03Z
JACST:ART
New Periodic and Soliton Solutions of (2 + 1)-Dimensional Soliton Equation
Arbabi, Somayeh
Najafi, Mohammad
Najafi, Malihe
By using the sine-cosine method proposed recently, we give the exact periodic and soliton solutions of the (2 + 1)-dimensional soliton equation in this paper. Many new families of exact traveling wave solutions of the (2 + 1)-dimensional soliton equation are successfully obtained. The computation for the method appears to be easier and faster by generalmathematical software.
Science Publishing Corporation
2012-09-07
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/384
10.14419/jacst.v1i4.384
Journal of Advanced Computer Science & Technology; Vol. 1 No. 4 (2012); 232-239
2227-4332
10.14419/jacst.v1i4
eng
http://www.sciencepubco.com/index.php/JACST/article/view/384/321
oai:ojs.pkp.sfu.ca:article/385
2014-11-13T03:04:04Z
JACST:ART
Hybrid Synchronization of Lorenz-Stenflo System with Delay
Khan, Mohammad Ali
This paper presents the hybrid-synchronization between two hyperchaoticLorenz-Stenflo system with delay. Here we design active controllersso that two pairs of states are synchronized and other two pairof states are anti-synchronized. Numerical results verify that both synchronizationand anti-synchronization can co-exist in the hyperchaoticLorenz stenflo system.
Science Publishing Corporation
2012-09-07
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
application/x-tex
application/postscript
application/postscript
application/postscript
application/postscript
application/postscript
application/postscript
application/postscript
application/postscript
application/postscript
http://www.sciencepubco.com/index.php/JACST/article/view/385
10.14419/jacst.v1i4.385
Journal of Advanced Computer Science & Technology; Vol. 1 No. 4 (2012); 240-249
2227-4332
10.14419/jacst.v1i4
eng
http://www.sciencepubco.com/index.php/JACST/article/view/385/312
http://www.sciencepubco.com/index.php/JACST/article/view/385/16935
http://www.sciencepubco.com/index.php/JACST/article/view/385/16936
http://www.sciencepubco.com/index.php/JACST/article/view/385/16937
http://www.sciencepubco.com/index.php/JACST/article/view/385/16938
http://www.sciencepubco.com/index.php/JACST/article/view/385/16939
http://www.sciencepubco.com/index.php/JACST/article/view/385/16940
http://www.sciencepubco.com/index.php/JACST/article/view/385/16941
http://www.sciencepubco.com/index.php/JACST/article/view/385/16942
http://www.sciencepubco.com/index.php/JACST/article/view/385/16943
http://www.sciencepubco.com/index.php/JACST/article/view/385/16944
oai:ojs.pkp.sfu.ca:article/410
2014-11-13T03:04:05Z
JACST:ART
Incidences of the improvement of the interactions between MAC and routing protocols on MANET performance
Hamrioui, Sofiane
Daoui, Mehammed
Chamek, Linda
Lalam, Mustapha
Lorenz, Pascal
In this paper, we present an improvement for the interactions between MAC and routing protocols to better energy consumption in MANET (Mobile Ad hoc Networks) and show its incidences on the performance of the network. We propose a new approach called IMR-EE (Improvement of the Interactions between MAC and Routing protocol for Energy Efficient) which exploits tow communication environment parameters. The first one is the number of nodes; our approach reduces the additional energy used to transmit the lost data by making the size of the backoff interval of MAC protocol adaptable to the nodes number in the network. The second parameter is the mobility of nodes; IMR-EE uses also the mobility of nodes to calculate a fairness threshold in order to guarantee the same level of the residual energy for each node in the network. We evaluate our IMR-EE solution with NS (Networks Simulator) and study its incidences on data lost and energy consumption in the network under varied network conditions such as load and mobility. The results showed that IMR-EE outperform MAC standard and allows significant energy saving and an increase in average lifetime of a mobiles nodes in the network.
Science Publishing Corporation
2012-09-14
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/410
10.14419/jacst.v1i4.410
Journal of Advanced Computer Science & Technology; Vol. 1 No. 4 (2012); 250-265
2227-4332
10.14419/jacst.v1i4
eng
http://www.sciencepubco.com/index.php/JACST/article/view/410/349
oai:ojs.pkp.sfu.ca:article/484
2014-11-13T03:04:06Z
JACST:ART
Face Recognition using Block-Based DCT Feature Extraction
K, MANIKANTAN
Govindarajan, Vaishnavi
V V S, Sasi Kiran
S, Ramachandran
Face recognition (FR) with reduced number of features is challenging and energy based feature extraction is an effective approach to solve this problem. However, existing methods are hard to extract only the required low frequency features, which is important for capturing the intrinsic features of a face image. This paper proposes a novel Block-Based Discrete Cosine Transform (BBDCT) for feature extraction wherein each 8x8 DCT block is of adequate size to collect the information within that block without any compromise. Individual stages of FR system are examined and an attempt is made to improve each stage. A Binary Particle Swarm Optimization (BPSO)-based feature selection algorithm is used to search the feature vector space for the optimal feature subset. Experimental results show the promising performance of BBDCT for face recognition on 4 benchmark face databases, namely, ORL, Cropped UMIST, Extended Yale B and Color FERET databases. A significant increase in the overall recognition rate and a substantial reduction in the number of features, are observed.
Science Publishing Corporation
2012-10-12
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/484
10.14419/jacst.v1i4.484
Journal of Advanced Computer Science & Technology; Vol. 1 No. 4 (2012); 266-283
2227-4332
10.14419/jacst.v1i4
eng
http://www.sciencepubco.com/index.php/JACST/article/view/484/414
oai:ojs.pkp.sfu.ca:article/509
2014-11-13T03:04:08Z
JACST:ART
INAPSAC: A New Robust Inlier Identification Technique
Myilsamy, Radha
Muthukrishnan, R.
Robust statistical methods were first adopted in computer vision to improve the performance of feature extraction algorithms at the bottom level of the vision hierarchy. These methods tolerate the presence of data points that do not obey the assumed model such points are typically called “outlier”. Recently, various robust statistical methods have been developed and applied to computer vision tasks. Random Sample Consensus (RANSAC) estimators are one of the widely applied to tackle such problems due to its simple implementation and robustness. There have been a number of recent efforts aimed at increasing the efficiency of the basic RANSAC algorithm. N Adjacent Points Sample Consensus (NAPSAC) is one of the RANSAC method used in computer vision task. In this paper a new algorithm is proposed which is the modified version of NAPSAC with 2-sphere method. The accuracy of the proposed algorithm has been studied through a simulation study along with the existing algorithms in the context of RANSAC techniques.
Science Publishing Corporation
2012-10-31
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/509
10.14419/jacst.v1i4.509
Journal of Advanced Computer Science & Technology; Vol. 1 No. 4 (2012); 284-290
2227-4332
10.14419/jacst.v1i4
eng
http://www.sciencepubco.com/index.php/JACST/article/view/509/422
oai:ojs.pkp.sfu.ca:article/512
2014-11-13T03:04:09Z
JACST:ART
An Image Steganography Scheme using Randomized Algorithm and Context-Free Grammar
Bassil, Youssef
Currently, cryptography is in wide use as it is being exploited in various domains from data confidentiality to data integrity and message authentication. Basically, cryptography shuffles data so that they become unreadable by unauthorized parties. However, clearly visible encrypted messages, no matter how unbreakable, will arouse suspicions. A better approach would be to hide the very existence of the message using steganography. Fundamentally, steganography conceals secret data into innocent-looking mediums called carriers which can then travel from the sender to the receiver safe and unnoticed. This paper proposes a novel steganography scheme for hiding digital data into uncompressed image files using a randomized algorithm and a context-free grammar. Besides, the proposed scheme uses two mediums to deliver the secret data: a carrier image into which the secret data are hidden into random pixels, and a well-structured English text that encodes the location of the random carrier pixels. The English text is generated at runtime using a context-free grammar coupled with a lexicon of English words. The proposed scheme is stealthy, and hard to be noticed, detected, and recovered. Experiments conducted showed how the covering and the uncovering processes of the proposed scheme work. As future work, a semantic analyzer is to be developed so as to make the English text medium semantically correct, and consequently safer to be transmitted without drawing any attention.
Science Publishing Corporation
2012-10-31
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/512
10.14419/jacst.v1i4.512
Journal of Advanced Computer Science & Technology; Vol. 1 No. 4 (2012); 291-305
2227-4332
10.14419/jacst.v1i4
eng
http://www.sciencepubco.com/index.php/JACST/article/view/512/424
oai:ojs.pkp.sfu.ca:article/518
2014-11-13T03:04:10Z
JACST:ART
Reconfigurable Architectures
Waza, Abida Yousuf
Mir, Roohie Naaz
Najeeb-ud-din, Hakim
In the area of computer architecture, designers are faced with the trade-of between flexibility and performance. The architectural choices span a wide spectrum, with general-purpose processors and application specific integrated circuits (ASICs) at opposite ends. General-purpose processors are not optimized to specific applications; they are flexible due to their versatile instruction sets that allow the implementation of every computable task. ASICs are dedicated hardware devices that can achieve higher performance, require less silicon area, and are less power-consuming than instruction-level programmable processors. However, they lack in flexibility. Reconfigurable computer architectures promise to overcome this traditional trade-off and achieve both, the high performance of ASICs and the flexibility of general-purpose processors.
Science Publishing Corporation
2012-11-08
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/518
10.14419/jacst.v1i4.518
Journal of Advanced Computer Science & Technology; Vol. 1 No. 4 (2012); 337-346
2227-4332
10.14419/jacst.v1i4
eng
http://www.sciencepubco.com/index.php/JACST/article/view/518/451
oai:ojs.pkp.sfu.ca:article/519
2014-11-13T03:04:11Z
JACST:ART
Effective Minimization of Nonsmooth Functions in the Limit Analysis Problem for Dielectrics in Powerful Electric Fields
Brigadnov, Igor Albertovich
Fedotova, Ekaterina M.
The problem of minimization of ill-conditioned functions is considered. This problem arises as a result of finite-element approximation of the limit analysis problem for dielectrics in powerful electric fields. The objective function is nonsmooth therefore a smooth regularization of finite-dimensional problem is used. As a result distinct ravine of objective function is acquired. Convergence of the gradient and the heave-ball methods in relation to its internal and optimization parameters are studied inside the numerical computing environment and fourth-generation programming language Matlab.
Science Publishing Corporation
2012-11-08
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/519
10.14419/jacst.v1i4.519
Journal of Advanced Computer Science & Technology; Vol. 1 No. 4 (2012); 325-336
2227-4332
10.14419/jacst.v1i4
eng
http://www.sciencepubco.com/index.php/JACST/article/view/519/450
oai:ojs.pkp.sfu.ca:article/522
2014-11-13T03:04:14Z
JACST:ART
Optimal Power flow with valve point loading effects of cost function and mixed-integer control variables using Big-Bang and Big-Crunch optimization.
Rao, Chatti venkata Gopala krishna
Yesuratnam, G.
This paper presents application of Big Bang and Big crunch(BB-BC) a nature inspired optimization method which is developed from the concepts of universal evolution to solve complex static optimal power flow (OPF) with an aim to obtain minimum cost of thermal power generating units whose cost functions are non-convex due to valve point loading effects. Control variables to optimize cost functions by satisfying usual constraints of OPF are of continuous and discrete type (mixed- integer control variables). Mathematical programming approaches presents problem in solving non-convex OPF.Nature inspired heuristic methods can be applied to solve such non-convex optimization problems. One of the requirements of heuristic methods are numerical simplicity without trial parameters in update equation of optimization along with reliability and ease in developing computer code for implementation. Most of the nature inspired methods search efficiency and reliability depends on choice of trial parameters to update control variables as optimization advances in search of optimal control variables.BB-BC optimization has search ability on par with other popular heuristic methods but free from choice of trial parameters is applied to obtain OPF solutions on two typical power systems networks and results are compared with MATLAB-7.0 pattern random search optimization tool box .Digital simulation results indicates a promising nature of the BB-BC to deal with non-convex optimization requirements of power system situations .
Science Publishing Corporation
2012-11-24
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/522
10.14419/jacst.v2i1.522
Journal of Advanced Computer Science & Technology; Vol. 2 No. 1 (2013); 1-8
2227-4332
10.14419/jacst.v2i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/522/466
oai:ojs.pkp.sfu.ca:article/536
2014-11-13T03:04:13Z
JACST:ART
Computer Simulation of Sandwich Sheet Metal Forming
Brigadnov, Igor Albertovich
Large elastic-plastic deformations of sandwich composite sheets are computer simulated. Within a framework of the shell theory, the elastic-plastic constitutive relation for transversely anisotropic sandwich sheet taking into account of the Bauschinger effect is discussed. Results of the computer simulation of a hemispherical punch stretching operation are demonstrated.
Science Publishing Corporation
2012-11-02
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/536
10.14419/jacst.v1i4.536
Journal of Advanced Computer Science & Technology; Vol. 1 No. 4 (2012); 306-315
2227-4332
10.14419/jacst.v1i4
eng
http://www.sciencepubco.com/index.php/JACST/article/view/536/427
oai:ojs.pkp.sfu.ca:article/538
2014-11-13T03:04:16Z
JACST:ART
Identifying the Effect of Model Modifications in State-Based Models and Systems
Tahat, Luay
Almasri, Nada
System modeling is a widely used technique to model state-based systems. System models are often used during the development of a software system, e.g., in partial code generation and in test generation. Several modeling languages have been developed to model state-based software systems, e.g., EFSM, SDL, and State Charts. Although state-based modeling is very useful, system models are usually large and complex, and they are frequently modified because of specification changes. Identifying the effect of these changes on the model and consequently on the underlying system is usually challenging and time-consuming. In this paper, we present an approach to automatically identify the effect of modifications made to the model. The goal is to identify those parts of the model that may exhibit different behaviors because of the modification. These are usually critical parts of the system that should be carefully tested. In this approach, the difference between the original model and the modified model is identified, and then the affected parts of the model are computed based on model dependence analysis. An empirical study on different EFSM models is performed in order to identify the affected parts of the model after a modification. The results of the study suggest that our approach could considerably reduce the amount of time and efforts the spent to validate the model after a modification.
Science Publishing Corporation
2012-11-24
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/538
10.14419/jacst.v2i1.538
Journal of Advanced Computer Science & Technology; Vol. 2 No. 1 (2013); 9-27
2227-4332
10.14419/jacst.v2i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/538/467
oai:ojs.pkp.sfu.ca:article/545
2014-11-13T03:04:17Z
JACST:ART
Securing and Managing the Data with efficient Architecture in Cloud Computing Environment
log, kartheesan
Srivatsa, S. K.
Cloud computing technology and services has become an important issue in the recent years. Cloud Computing needs lot of attention, time and innovative concepts for the technology to mature over a period of time. Many organizations show interest in adopting cloud computing technology and services because of its socio economic and time factor. Cloud computing is nothing but virtual centralization of different computers where the software and memory space is provided by the vendor and the data is managed by them. This leaves the client/customer unaware of where the process is running or where the data is stored. Security of the data is highly dependent on the vendor who has to provide an assurance to the customer on security issues by making service level agreements. This paper focus on security issues, requirements for providing a secured data in cloud computing environment by giving a standard service oriented cloud computing Architecture and management tools that can be used by the organizations for authentication, confidentiality and integrity. Thus providing secured data access and transfer.
Science Publishing Corporation
2013-01-16
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/545
10.14419/jacst.v2i1.545
Journal of Advanced Computer Science & Technology; Vol. 2 No. 1 (2013); 38-43
2227-4332
10.14419/jacst.v2i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/545/504
oai:ojs.pkp.sfu.ca:article/547
2014-11-13T03:04:18Z
JACST:ART
Digital Hardware Pulse-Mode RBFNN with Hybrid On-chip Learning Algorithm Based Edge Detection.
Gargouri, Amir
Masmoudi, Dorra Sellami
A hardware implementation of pulse mode Radial Basis Function Neural Network (RBFNN) with on-chip learning ability is proposed in this paper. Pulse mode presents an emerging technology in digital implementation of neural networks thanks to its higher density of integration. However, hardware on-chip learning is a difficult issue, since the back-propagation algorithm is the most used, which requires a large number of logic gates in the hardware. To overcome this problem, we apply a hybrid process, which is split into two stages. In the first one, the K-means algorithm is used to update the centers of gaussian activation functions. Thereafter, the connection weights are adjusted using the back-propagation algorithm. Details of important aspects concerning the hardware implementation are given. As illustration of the efficiency and scalability of the proposed design, we consider edge detection operation which is a very important step in image processing. In the learning step, the RBFNN was taught the Canny operator behavior. Experiential results show good approximation features. The proposed design was implemented on a virtex II PRO FPGA platform and synthesis results showed higher performances when benchmarked against conventional techniques and neural ones.
Science Publishing Corporation
2012-11-27
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/547
10.14419/jacst.v2i1.547
Journal of Advanced Computer Science & Technology; Vol. 2 No. 1 (2013); 28-37
2227-4332
10.14419/jacst.v2i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/547/472
oai:ojs.pkp.sfu.ca:article/580
2014-11-13T03:04:20Z
JACST:ART
Adaptation and research development in the spectrum of methods with advanced access in the area of communication and computer system
Zeqiri, Nderim
In some models that set new principles of work, there appears to require the implementation and adaptation of computer resources in terms of hardware and software adaptation. This method entails the extension of the current system versus research perspectives in the context of programs, models and restructuring in line with other development, hardware or software, or adjustment to learning in electronic form; the interaction of many processes, to create a sustainable system through increased research and adoption of safety and suitability. So in this paper we present models and alternative approaches to achieve a better perspective in the field of restructuring and adjustment of the model with the program and hardware resources. In many cases is needed a quick access method which is specified in the context of generating appropriate values ??for digital systems
Science Publishing Corporation
2013-02-28
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/580
10.14419/jacst.v2i1.580
Journal of Advanced Computer Science & Technology; Vol. 2 No. 1 (2013); 50-58
2227-4332
10.14419/jacst.v2i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/580/564
oai:ojs.pkp.sfu.ca:article/666
2014-11-13T03:04:21Z
JACST:ART
Spatial-region classi?cation by Min-Connected algorithm for unsupervised segmentation
Rachid, Alaoui
Abdeslam, Jakimi
Lahcen, Elbermi
This work lies within the scope of color image segmentation by spatial-region classification. The spatial distribution of objects in each region of image is difficult to be identified when the region are non-connected clusters. A standard of color identification by conventional methods of segmentation remains weak for capturing the spatial dispersion of the various objects of the same color region. We propose to apply a spatial classification to characterize geographical connected sets that represent the same regions. The originality of this paper lies in our new min-connected algorithm which is derived from a spatial-color compactness model. Our work is a hybrid segmentation that takes into account the distribution of colors in the color space and the spatial location of colors in the image plane. Experimental tests on synthetic and real images show that our technique leads to promising results for segmentation.
Science Publishing Corporation
2013-02-27
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/666
10.14419/jacst.v2i1.666
Journal of Advanced Computer Science & Technology; Vol. 2 No. 1 (2013); 44-49
2227-4332
10.14419/jacst.v2i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/666/561
oai:ojs.pkp.sfu.ca:article/718
2014-11-13T03:04:22Z
JACST:ART
Automation of the interpolation of pre-processor basic data for program complex “press 3D URAL”
Brigadnov, Igor Albertovich
Sidorov, Dmitry V.
Mozer, Sergey P.
To automate the process of forming the baseline data pre-processing software package block PRESS 3D URAL [1], designed to solve engineering problems of Mining Geomechanics encouraged to use triangulation objects 2D space mining plans and their subsequent transformation into a 3D computational model.
Science Publishing Corporation
2013-03-22
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/718
10.14419/jacst.v2i2.718
Journal of Advanced Computer Science & Technology; Vol. 2 No. 2 (2013); 59-67
2227-4332
10.14419/jacst.v2i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/718/603
oai:ojs.pkp.sfu.ca:article/1194
2014-11-13T03:04:23Z
JACST:ART
Computer–aided diagnosis of diabetes using least square support vector machine
Almasi, Behnaz Naghash
Almasi, Omid Naghash
Kavousi, Mina
Sharifinia, Amirhossein
Diabetes incidence is one of the most serious health challenges in both industrial and developing countries; however, it is for sure that the early detection and accurate diagnosis of this disease can decrease the risk of affiliation to other relevant disease in diabetes patients. Because of the effective classification and high diagnostic capability, expert systems and machine learning techniques are now gaining popularity in this field. In this study, Least square support vector machine (LS-SVM) was used for diabetes diagnosis. The effectiveness of the LS-SVM is examined on Pima Indian diabetes dataset using k-fold cross validation method. Compared to thirteen well-known methods for the diabetes diagnosis in the literature, the study results showed the effectiveness of the proposed method.
Science Publishing Corporation
2013-11-13
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
application/msword
http://www.sciencepubco.com/index.php/JACST/article/view/1194
10.14419/jacst.v2i2.1194
Journal of Advanced Computer Science & Technology; Vol. 2 No. 2 (2013); 68-76
2227-4332
10.14419/jacst.v2i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/1194/917
http://www.sciencepubco.com/index.php/JACST/article/view/1194/17033
oai:ojs.pkp.sfu.ca:article/1583
2014-11-13T03:04:24Z
JACST:ART
A survey on architectures, protocols, applications, and management in wireless sensor networks
Kalantary, Samira
Taghipour, Sara
With the recent technological advances in wireless communications, integrated digital circuits, and micro electro mechanical systems (MEMS); development of wireless sensor networks has been enabled and become dramatically feasible. Wireless sensor networks (WSNs) are large networks made of a numerous number of sensor nodes with sensing, computation, and wireless communications capabilities. Many various routing, power management, and data dissemination protocols have been designed for wireless sensor networks (WSNs) dependent on both the network architecture and the applications that it is designed for. In this paper, we present the state of the art of wireless sensor networks’ architecture and design features. Also, in this paper, we introduce recent work on routing protocols for WSNs and their design goals and challenges. Also, an overview of the application that WSNs assist in is presented. Finally, several open research questions of wireless sensor networks management and issues are suggested and put forward. Keywords: application, architecture, management, protocol, wireless sensor network.
Science Publishing Corporation
2014-01-14
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/1583
10.14419/jacst.v3i1.1583
Journal of Advanced Computer Science & Technology; Vol. 3 No. 1 (2014); 1-11
2227-4332
10.14419/jacst.v3i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/1583/980
oai:ojs.pkp.sfu.ca:article/1753
2014-11-13T03:04:26Z
JACST:ART
VSS SPU-EBP: Variable step size sequential partial update error back propagation algorithm
Rahmaninia, Maryam
In MLP networks with hundreds of thousands of weights which must be trained on millions of samples, the time and space complexity may become greatly large and sometimes the training of network by EBP algorithm may be impractical. Sequential Partial Updating is an effective method to reduce computational load and power consumption in implementation. This new approach is very useful for the MLP networks with large number of weights in each layer that updating of each weight in each round of execution of EBP algorithm will be costly. Although this idea reduces computational cost and elapsed CPU time in each round but sometimes maybe increases number of epochs required to convergence and this leads to increase time of convergence. That is, to speed up more the convergence rate of the SPU?EBP algorithm, we propose a Variable Step Size (VSS) approach. In VSS SPU?EBP algorithm, we use a gradient based learning rate in SPU-EBP algorithm to speed up the convergence of training algorithm. In this method we derive an upper bound for the step size of SPU_EBP algorithm. Keywords: Neural Network, Error Back Propagation, MLP (Multi-Layered Perceptron), Sequential Partial Update Algorithm.
Science Publishing Corporation
2014-02-28
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/1753
10.14419/jacst.v3i1.1753
Journal of Advanced Computer Science & Technology; Vol. 3 No. 1 (2014); 18-27
2227-4332
10.14419/jacst.v3i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/1753/1040
oai:ojs.pkp.sfu.ca:article/1783
2014-11-13T03:04:27Z
JACST:ART
Optimal design of T–S fuzzy controller for a nonlinear system using a new adaptive particle swarm optimization algorithm
Naghash Almasi, Omid
Ahmadi Naghedi, Ali
Tadayoni, Ebrahim
Zare, Assef
Designing an optimal Takagi–Sugeno (T–S) fuzzy system for real–world non–linear control problems is a challenging problem. Complex non–linear system produces large fuzzy rule–based and requires large amount of memory. To overcome these problems, this paper proposes a hybrid approach to generate the optimal T–S fuzzy system. First, the Fuzzy Clustering Method (FCM) is employed to partitioning the input space and extracting initial fuzzy rule–based. Moreover, a new Adaptive Particle Swarm Optimization (APSO) technique is suggested to determine the optimal number of clusters in FCM, which is the same as the number of fuzzy rules. Finally, Recursive Least Square (RLS) method based on the Mean Square Errors (MSE) criterion is used to regulate the coefficients of the consequent part of initial fuzzy rules. Some simulations are conducted on a Non–Linear Inverted Pendulum (NLIP) system to support the efficiency of the proposed approach in designing compact and accurate T–S fuzzy systems. Keywords: Adaptive PSO, FCM, Non–Linear Systems Optimal Design; Takagi Sugeno Fuzzy System.
Science Publishing Corporation
2014-03-25
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/1783
10.14419/jacst.v3i1.1783
Journal of Advanced Computer Science & Technology; Vol. 3 No. 1 (2014); 37-47
2227-4332
10.14419/jacst.v3i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/1783/1072
http://www.sciencepubco.com/index.php/JACST/article/view/1783/17083
oai:ojs.pkp.sfu.ca:article/1805
2014-11-13T03:04:28Z
JACST:ART
Passive markers as a low-cost method of enriching cultural visits on user’s demand
Koutsoudis, Anestis
Arnaoutoglou, Fotis
Pavlidis, George
The idea of enriching a cultural heritage visitor’s experience by employing mobile devices such as smartphones and tablets is an active research domain. This is mainly due to the worldwide user penetration of such devices along with their continuous hardware performance enhancement. This work presents the experience and feedback gained by one year of operation of an experimental information system that aims in enhancing the experience of a visitor on his/her demand. The evaluated system is based on the use case-scenario where the a mobile device is used to capture and decode passive markers (such as QR-codes) that are located on facades of selected important buildings in the old town of Xanthi, Greece, in order to enrich the visitor’s experience through a broad context of historical and architectural information delivered over the Web. Keywords: On-demand information, Passive marker, QR-code, Smartphone, Visit enrichment.
Science Publishing Corporation
2014-02-24
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/1805
10.14419/jacst.v3i1.1805
Journal of Advanced Computer Science & Technology; Vol. 3 No. 1 (2014); 12-17
2227-4332
10.14419/jacst.v3i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/1805/1034
oai:ojs.pkp.sfu.ca:article/2018
2014-11-13T03:04:30Z
JACST:ART
The new candidate IPV6 address size prediction
Batiha, Khaldoun
IPv4 protocol is now no more sufficient due to its limited address space where this protocol uses only 32-bit for addressing. IPv6 protocol is the next protocol which was introduced as a new protocol that provide a huge address space .In This paper we discussed the significant overhead in the IPv6 standard packet due to its 128 bits address size, so we develop three different studies in order to generate a prediction of exhibition date for several address sizes so we can suggest another size for address size in IPv6 to improve the overall performance of the internet and tolerate the overhead by reducing the address size. In the same time this size should accommodate the accelerated growth in needs for unassigned blocks of addresses for very long time. Keywords: Ipv4 Protocol, Ipv6 Protocol, Addressing Types, Ipv6 Header, Exhibition Date, Address Pool.
Science Publishing Corporation
2014-03-17
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/2018
10.14419/jacst.v3i1.2018
Journal of Advanced Computer Science & Technology; Vol. 3 No. 1 (2014); 28-36
2227-4332
10.14419/jacst.v3i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/2018/1059
oai:ojs.pkp.sfu.ca:article/2138
2014-11-13T03:04:31Z
JACST:ART
Modelizing a non-linear system: a computational effcient adaptive neuro-fuzzy system tool based on matlab
Bosque, Guillermo
del Campo, Inés Juliana
Echanobe, Javier
In a great diversity of knowledge areas, the variables that are involved in the behavior of a complex system, perform normally, a non-linear system. The search of a function that express those behavior, requires techniques as mathematics optimization techniques or others. The new paradigms introduced in the soft computing, as fuzzy logic, neuronal networks, genetics algorithms and the fusion of them like the neuro-fuzzy systems, and so on, represent a new point of view to deal this kind of problems due to the approximation properties of those systems (universal approximators).This work shows a methodology to develop a tool based on a neuro-fuzzy system of ANFIS (Adaptive Neuro-Fuzzy Inference System) type with piecewise multilinear (PWM) behaviour (introducing some restrictions on the membership functions -triangular- chosen in the ANFIS system). The obtained tool is named PWM-ANFIS Tool, that allows modelize a n-dimensional system with one output and, also, permits a comparison between the neuro-fuzzy system modelized, a purely PWM-ANFIS model, with a generic ANFIS (Gaussian membership functions) modelized with the same tool. The proposed tool is an efficient tool to deal non-linearly complicated systems.Keywords: ANFIS model, Function approximation, Matlab environment, Neuro-Fuzzy CAD tool, Neuro-Fuzzy modelling.
Science Publishing Corporation
2014-04-16
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/2138
10.14419/jacst.v3i1.2138
Journal of Advanced Computer Science & Technology; Vol. 3 No. 1 (2014); 61-89
2227-4332
10.14419/jacst.v3i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/2138/1106
oai:ojs.pkp.sfu.ca:article/2153
2014-11-13T03:04:32Z
JACST:ART
Register-allocated paging for big data calculations
Thomas, David
Software to support the Monte Carlo method generates large vectors of pseudo-random numbers and uses these as operands in complex mathematical expressions. When such software is run on standard PC-based hardware, the volume of data involved often exceeds the physical RAM available. To address this problem, vectors must be paged out to disk and paged back in when required. This paging is often the performance bottleneck limiting the execution speed of the software. Because the mathematical expressions are specified in advance of execution, predictive solutions are possible – for instance, by treating the problem similarly to register allocation. The problem of allocating scalar variables to processor registers is a widely studied aspect of compiler implementation. A register allocation algorithm decides which variable is held in which register, when the value in a register can be overwritten, and when a value is stored in, or later retrieved from, main memory. In this paper, register allocation techniques are used to plan the paging of vectors in Monte Carlo software. Two register allocation algorithms are applied to invented vector programs written in a prototype low-level vector language and the results are compared. Keywords: Big Data, Compiler, Monte Carlo, Paging, Performance, Register Allocation.
Science Publishing Corporation
2014-04-09
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/2153
10.14419/jacst.v3i1.2153
Journal of Advanced Computer Science & Technology; Vol. 3 No. 1 (2014); 48-60
2227-4332
10.14419/jacst.v3i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/2153/1094
oai:ojs.pkp.sfu.ca:article/2258
2014-11-13T03:04:34Z
JACST:ART
Strategic business rules for business process intelligence : An oracle prototype
Kaula, Rajeev
Business process intelligence aims to provide timely information to improve business process effectiveness and align it with business objectives in order to compete successfully in the marketplace. Generally such information not only improves an organizations ability to accomplish business objectives, but may also lead to the identification of information that could facilitate competitive advantage. This paper outlines an approach to develop an information flow model that involves the specification of activity dimensions during business process modeling to develop dimensional models to identify process metrics through strategic business rules that aligns a business process with business objectives. The paper illustrates the concepts through a marketing business process Lead to forecast prototype which is implemented in Oracle’s PL/SQL language. Keywords: Business Intelligence, Business Process, Business Process Metrics, Business Process Intelligence, Business Rules.
Science Publishing Corporation
2014-04-19
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/2258
10.14419/jacst.v3i1.2258
Journal of Advanced Computer Science & Technology; Vol. 3 No. 1 (2014); 90-100
2227-4332
10.14419/jacst.v3i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/2258/1111
oai:ojs.pkp.sfu.ca:article/2514
2014-12-18T01:02:01Z
JACST:ART
A federated approach for global village services interaction
Mollahoseini Ardakani, Mohammad Reza
Hashemi, Seyyed Mohsen
In the global village ecosystem, enterprises need collaborating using Information Technology (IT) and other tools to succeed in this dynamic and heterogeneous business environment. The Global Village Services Reference Model (GVSRM) is a reference model based on SOSA (Service Oriented Strategies and Architectures) ontology for global village services Realization. In this model, three architectural abstraction layers have been considered for global village: ‘infrastructure for global village services’, ‘global village services provisioning’, and ‘using global village services’. Despite relative completeness of this model, one of its obvious shortcomings is lack of attention to the crucial issue of interoperability in the global village. Based on this model, the grid of global village is comprised of VHGs (Virtual Holding Governance). The VHG is a temporary, scalable, dynamic cluster/association comprising of existing or newly service provider organizations which its objective is satisfying the requirements of global village actors through electronic processes. In this paper, we will propose a federated approach for interoperability among the VHGs of the global village. Keywords: Collaboration, Global Village, GVSRM, Interoperability, Virtual Holding Governance (VHG).
Science Publishing Corporation
2014-06-14
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/2514
10.14419/jacst.v3i2.2514
Journal of Advanced Computer Science & Technology; Vol. 3 No. 2 (2014); 113-119
2227-4332
10.14419/jacst.v3i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/2514/1196
oai:ojs.pkp.sfu.ca:article/2746
2014-12-18T01:02:01Z
JACST:ART
Information visualization by dimensionality reduction: a review
Najim, Safa
Information visualization can be considered a process of transforming similarity relationships between data points to a geometric representation in order to see unseen information. High-dimensionality data sets are one of the main problems of information visualization. Dimensionality Reduction (DR) is therefore a useful strategy to project high-dimensional space onto low-dimensional space, which it can be visualized directly. The application of this technique has several benefits. First, DR can minimize the amount of storage needed by reducing the size of the data sets. Second, it helps to understand the data sets by discarding any irrelevant features, and to focus on the main important features. DR can enable the discovery of rich information, which assists the task of data analysis. Visualization of high-dimensional data sets is widely used in many fields, such as remote sensing imagery, biology, computer vision, and computer graphics. The visualization is a simple way to understand the high-dimensional space because the relationship between original data points is incomprehensible. A large number of DR methods which attempt to minimize the loss of original information. This paper discuss and analys some DR methods to support the idea of dimensionality reduction to get trustworthy visualization.Keywords: Dimensionality Reduction, Information visualization, Information retrieval.
Science Publishing Corporation
2014-06-02
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
application/x-zip-compressed
http://www.sciencepubco.com/index.php/JACST/article/view/2746
10.14419/jacst.v3i2.2746
Journal of Advanced Computer Science & Technology; Vol. 3 No. 2 (2014); 101-112
2227-4332
10.14419/jacst.v3i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/2746/1176
http://www.sciencepubco.com/index.php/JACST/article/view/2746/17110
oai:ojs.pkp.sfu.ca:article/2818
2014-12-18T01:02:01Z
JACST:ART
Optimized design for controlling LED display matrix by an FPGA board
Khalid, MATEUR
Rachid, EL GOURI
Hamad, DAHOU
Laâmari, HLOU
The very important objective of the digital designer when using discrete gates for implement a Boolean function is to keep the number of used gates to a minimum and win a memory space without lost the original information. In this sense, the Simplification is very important and could be achieved by a purely algebraic process, but it can be tedious when it arrived to a very large number of variables. In this paper we describe an automat solution based on finite state machine (FSM) for simplify and practically optimize the complex logical functions. This method is programmed and tested on a display system which is based on light emitting diodes (LED) matrix and programmable platform with Field Programmable Gate Array (FPGA). The module is implemented in Spartan 3E family XC3S500E FPGA board. Keywords: Display Board, FPGA, FSM, LED, LED-Driver, Logic Simplification, Multiplex.
Science Publishing Corporation
2014-07-11
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/2818
10.14419/jacst.v3i2.2818
Journal of Advanced Computer Science & Technology; Vol. 3 No. 2 (2014); 120-128
2227-4332
10.14419/jacst.v3i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/2818/1245
oai:ojs.pkp.sfu.ca:article/3004
2014-12-18T01:02:01Z
JACST:ART
RLBM model: modeling of Manet’s routing protocols based on restoration links break
Abdoly, Zahra
Mirabedini, Seyyed Javad
Arebi, Peyman
Mobile ad hoc network is a temporary network that consists of a set of mobile nodes with wireless communication. There are several problems in the relationship between the components of these networks. Some of these problems are related to the routing problem. The main challenge in routing protocols of mobile ad hoc networks is links break phenomenon. This phenomenon has many negative impacts on the performance of routing protocols. In this paper, we attempted to study 10 routing protocols in mobile ad hoc networks that try to improve the performance of standard protocols of this type of network using the Restoration Links Break. By studying the behavior of these protocols, a common model used by all these protocols was introduced as Restoration Links Break model. Then the performance of each of the protocols was described based on the proposed model. On the other hand, we divided them into two categories according to protocol functions in Restoration Links Break. First category provides alternate routes before the Links Break event and the second category performs the replacement of route after the links break. Finally, the simulation of results revealed that the first category of protocols has a better delivery rate than the second category but the routing overhead of the second category is less than the first category. Keywords: Mobile ADHOC Network, Routing Protocols, Restoration Links Break, Transmission.
Science Publishing Corporation
2014-07-30
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/3004
10.14419/jacst.v3i2.3004
Journal of Advanced Computer Science & Technology; Vol. 3 No. 2 (2014); 129-135
2227-4332
10.14419/jacst.v3i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/3004/1279
oai:ojs.pkp.sfu.ca:article/3196
2014-12-18T01:02:01Z
JACST:ART
Effective staff line detection, restoration and removal approach for different quality of scanned handwritten music sheets
Alirezazadeh, Fatemeh
Ahmadzadeh, Mohammad Reza
Musical staff detection and removal is one of the most important preprocessing steps of an Optical Music Recognition (OMR) system. This paper proposes a new method for detecting and restoring staff lines from global information of music sheets. First of all the location of staff lines is determined. Therefore, music staff is sliced. The staff line segments are recognized at each slice and then with adequate knowledge of staff line locations, the deformed, interrupted or partly removed staff lines can be rebuilt. A new approach for staff removal algorithm is suggested in this paper fundamentally based on removing all detected staff lines. At last, the Fourier transform and Gaussian lowpass filter will help to reconstruct the separated and interrupted symbols. It has been tested on the dataset of the musical staff removal competition held under ICDAR 2012. The experimental results show the effectiveness of this method under various kinds of deformations in staff lines. Keywords: Fourier Transform, Gaussian Low Pass Filter, Optical Music Recognition, Run Length Coding, Staff Line Removal.
Science Publishing Corporation
2014-08-24
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/3196
10.14419/jacst.v3i2.3196
Journal of Advanced Computer Science & Technology; Vol. 3 No. 2 (2014); 136-142
2227-4332
10.14419/jacst.v3i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/3196/1313
oai:ojs.pkp.sfu.ca:article/3270
2014-12-18T01:02:01Z
JACST:ART
The (a, q) data modeling in probabilistic reasoning
Douglas, Richard
This article considers a critical and experimental approach on the attributive and qualitative AI data modeling and data retrieval in computational probabilistic reasoning. The mathematical correlation of X?Y in the d=dx/dy differentiations and its point based locations and matrix based predictions in Markov Models, Bayesian fields, and Rete’s algorithms, with the further development of non-linear ‘human-type’ reasoning in AI. The new approach in the ternary system transition (decimal-binary) of Brusentsov-Bergman principle by its bound allocation in the ‘mirror-based’ system in tn-1… tn+1 powers, and hereon considers its further data retrieval for suitable matching and translation of probabilistic data differentiation. The causation/probability matrix of this paper regards not only bound/free variable in x1, x2, x3, xn variables, but discovers and explains its further subsets in anXqn formula, where the supposition of d=X/Y regarded not as a mathematical placement of the variable X, but as its attributive (a) and qualitative (q) allocation in a certain value/relevance cell of the Probability Triangle of the ternary system. From where the automated differentiation retrieves only the most relevant/objective anXqn data cell, not the closest by the pre-set context, making the AI selections more assertive and preference based than linear. Keywords: probability reasoning, artificial intelligence, computational logic, cognitive selection, AI computation.
Science Publishing Corporation
2014-10-20
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/3270
10.14419/jacst.v3i2.3270
Journal of Advanced Computer Science & Technology; Vol. 3 No. 2 (2014); 179-201
2227-4332
10.14419/jacst.v3i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/3270/1434
oai:ojs.pkp.sfu.ca:article/3321
2014-12-18T01:02:01Z
JACST:ART
Denial-of-Service attacks on 6LoWPAN-RPL networks: Issues and practical solutions
RGHIOUI, Anass
KHANNOUS, Anass
BOUHORMA, Mohammed
RPL (Routing Protocol for Low-power and lossy networks) is a specific routing protocol designed to optimize 6LoWPAN (IPv6 over Low power Wireless Personal Area Network) operation. As 6LoWPAN suffers from resource constraints on battery, processor, memory and bandwidth, it affects the performance of the RPL protocol. From security point of view, this will make RPL vulnerable to several threats directly or indirectly. Thus, cryptographic systems are not sufficient to protect the RPL from internal attacks; a compromised node from the network may cause undesired operation without being detected by these systems. An intrusion detection system (IDS) should be used, but it is not easy given the nature of 6LoWPAN; on a side its resource constraints, and on the other side its opening to the outside world through the Internet. In this paper we focus on denial of service (DoS) attacks, we determine the elements to be taken into account in selecting a compatible IDS and we give some solutions that we consider effective and valid for 6LoWPAN-RPL based networks Keywords: RPL, ROLL, 6LoWPAN, IDS, DoS, Network security.
Science Publishing Corporation
2014-09-15
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/3321
10.14419/jacst.v3i2.3321
Journal of Advanced Computer Science & Technology; Vol. 3 No. 2 (2014); 143-153
2227-4332
10.14419/jacst.v3i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/3321/1360
oai:ojs.pkp.sfu.ca:article/3404
2014-12-18T01:02:01Z
JACST:ART
A new high capacity steganography based on bit-inverting method in DWT domain
Azaminezhad, Mahnoosh Sadat
Bidgoli, Amir Massoud
Steganography is a technique which embeds the secret messages in the cover image and transmitted in such a way that the existence of information is undetectable. In this paper, we present a new technique that consists of two encoding algorithm such as Huffman encoding and bit inverting algorithm. In this technique, we proposed a modified secure and high capacity based steganography scheme of hiding a secret message such as text or image into a cover image. Our simulation results show that the algorithm has a good perceptual invisibility and high capacity in addition to be secure. Keywords: Bus Inverting, Discrete Wavelet Transform (DWT), Huffman Coding, Steganography, Wavelet.
Science Publishing Corporation
2014-10-17
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
application/vnd.openxmlformats-officedocument.wordprocessingml.document
http://www.sciencepubco.com/index.php/JACST/article/view/3404
10.14419/jacst.v3i2.3404
Journal of Advanced Computer Science & Technology; Vol. 3 No. 2 (2014); 169-178
2227-4332
10.14419/jacst.v3i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/3404/1427
http://www.sciencepubco.com/index.php/JACST/article/view/3404/17193
oai:ojs.pkp.sfu.ca:article/3573
2017-09-10T08:32:37Z
JACST:ART
Range of outputs precise of digits rounding in SPSS and MS Excel
Al-Hashami, Zaher
The statistical operations done by many specialist programs, by them can do these operations fluently and precisely. There are many functions in such programs can calculate in SAS, STAT and the analytical program SPSS. There is Microsoft Excel program that is calculate like these functions. The level of some programs may be different than others within these functions they are calculating. From these functions are Sum, Average, Maximum and Minimum. Round function is also from these functions that can measure it's accuracy through this research. In this research i chose ten digits numbers and I also chose three criteria under, equal and more than 5. According to that the rounding operations are done based on if wanted decimal place is less, equal or higher than 5. Rounding applied on ten digits using SPSS and MS Excel programs. The outputs findings are the same except that Microsoft Excel is truncating the last zeroes of the digit after the decimal point. Wherever the decimal place specified in the digit is want it will truncate after the decimal point. The SPSS is more precise than MS Excel based on the decimal place in the digit number wanted statistically and analytically.Keywords: Decimal Place, Digit, Excel, Function, Round.
Science Publishing Corporation
2014-10-03
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/3573
10.14419/jacst.v3i2.3573
Journal of Advanced Computer Science & Technology; Vol. 3 No. 2 (2014); 154-159
2227-4332
10.14419/jacst.v3i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/3573/2846
oai:ojs.pkp.sfu.ca:article/3588
2014-12-18T01:02:01Z
JACST:ART
Securing the Cloud: Threats, Attacks and Mitigation Techniques
Alani, Mohammed M.
This paper is aimed to present information about the most current threats and attacks on cloud computing, as well as security measures. The paper discusses threats and attacks that are most effective on cloud computing such as data breach, data loss, service traffic hijacking..etc. The severity and effect of these attacks are discussed along with real-life examples of these attacks. The paper also suggests mitigation techniques that can be used to reduce or eliminate the risk of the threats discussed. In addition, general cloud security recommendations are given.Keywords: cloud, cloud computing, security, threats, attacks, SaaS, PaaS, IaaS.
Science Publishing Corporation
2014-10-21
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/3588
10.14419/jacst.v3i2.3588
Journal of Advanced Computer Science & Technology; Vol. 3 No. 2 (2014); 202-213
2227-4332
10.14419/jacst.v3i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/3588/1437
oai:ojs.pkp.sfu.ca:article/3602
2014-12-18T01:02:01Z
JACST:ART
Cloud computing: use cases & various applications
Hashemi, Seyyed Mohsen
Hanani, Ali
As Cloud Computing has become more and more famous and popular, various Cloud Computing architectures, models and infrastructures have been defined, given their specific circumstances for the applications. Currently, many Cloud definitions, applications and samples can be helpful as a reference for using a Cloud Computing service. As Cloud Computing technology is being used to minimize the cost of computing resources, many enterprises gained interest of migrating their old system to the Cloud Computing system. This further illustrates the importance the usage of Cloud Computing, therefore, this paper investigates some distributed computing model especially cloud computing to clarify which definition, usage, applications and use-cases are more useful. Further, this article attempts to introduce various models of cloud computing, services, use-cases and applications. Finally, we made a comparison between various companies that are providing Cloud Computing facilities. Keywords: Cloud Computing, E-Services, Service Computing, UML, RUP.
Science Publishing Corporation
2014-10-17
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
application/msword
http://www.sciencepubco.com/index.php/JACST/article/view/3602
10.14419/jacst.v3i2.3602
Journal of Advanced Computer Science & Technology; Vol. 3 No. 2 (2014); 160-168
2227-4332
10.14419/jacst.v3i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/3602/1426
http://www.sciencepubco.com/index.php/JACST/article/view/3602/17198
oai:ojs.pkp.sfu.ca:article/3663
2014-12-18T01:02:01Z
JACST:ART
Reliability evaluation of a payment model in mobile e-commerce using colored Petri net
Pourali, Abdolghader
Malakooti, Mohammad V
Yektaie, Muhammad Hussein
In general, a mobile payment system in mobile e-commerce must have high security so that the user can trust it for doing business deals, sales, paying financial transactions, etc. in the mobile payment system. Since an architecture or payment model in e-commerce only shows the way of interaction and collaboration among users and mortgagers and does not present any evaluation of effectiveness and confidence about financial transactions to stakeholders, in this paper we try to present a detailed assessment of the reliability of a mobile payment model in the mobile e-commerce using formal models and colored Petri nets. Finally, we demonstrate that the reliability of this system has high value (case study: a secure payment model in mobile commerce presented at the International Conference) [18]. Keywords: Reliability, Colored Petri Net, Assessment, Payment Models, M-Commerce.
Science Publishing Corporation
2014-11-09
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/3663
10.14419/jacst.v3i2.3663
Journal of Advanced Computer Science & Technology; Vol. 3 No. 2 (2014); 221-231
2227-4332
10.14419/jacst.v3i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/3663/1468
oai:ojs.pkp.sfu.ca:article/3696
2014-12-18T01:02:01Z
JACST:ART
A neural network based congestion control algorithm for content-centric networks
Bazmi, Parisa
Keshtgary, Manijeh
Communication across the Internet has transformed over the years, generated primarily by changes in the importance of content distribution. In the twenty-first century, people are more concerned with the content rather than the location of the information. Content-Centric Networking (CCN) is a new Internet architecture, which aims to access content by a name rather than the IP address of a host. Having the content, CCN which is natively pull-based functions based on the requests received from customers. It is also combined with the availability of in-network chaching. Because of the availability of in-network caching in CCN, chunks may be served by multiple sources. This multi-path transfer in CCN makes TCP-based congestion control mechanisms inefficient for CCN. In this paper a new congestion control algorithm is proposed, which is based on Neural Network prediction over content-centric networks. The designed NN is implemented in each router to predict adaptively the existence of the congestion on link given the current status of the network. The results demonstrate that the proposed congestion control algorithm can effectively improve throughput by 85.53%. This improvement is done by preventing queue overflow from happening, which will result in reductions in packet drop in the network. Keywords: Content-Centric Network, Congestion Control, Drop Prediction, Named Data Networking, Neural Network.
Science Publishing Corporation
2014-10-23
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/3696
10.14419/jacst.v3i2.3696
Journal of Advanced Computer Science & Technology; Vol. 3 No. 2 (2014); 214-220
2227-4332
10.14419/jacst.v3i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/3696/1442
oai:ojs.pkp.sfu.ca:article/3754
2014-12-18T01:02:01Z
JACST:ART
A survey on SDN, the future of networking
Rowshanrad, Shiva
Namvarasl, Sahar
Abdi, Vajihe
Hajizadeh, Maryam
Keshtgary, Manijeh
Control Plane
Data Plane
Programmable Network
OpenFlow
Software Defined Network.
Software Defined Networking (SDN) is an emerging architecture which decouples networks control plane and data plane physically. It makes control plane programmable trough a centralized controller, and builds intelligent and flexible networks. The OpenFlow is one of the most famous SDN protocols, which acts as a southbound interface between control plane and data plane. In this survey, SDN implementation approaches and different southbound interfaces, beside different version of OpenFlow, are introduced. In addition to general architecture of SDN, different wireless architectures are discussed. Here, also potential SDN’s applications and research areas including hot topics such as Information Centric Networks, Cloud and datacenters, multimedia, wireless and mobile networks over SDN are reviewed.
Science Publishing Corporation
2014-11-29
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/3754
10.14419/jacst.v3i2.3754
Journal of Advanced Computer Science & Technology; Vol. 3 No. 2 (2014); 232-248
2227-4332
10.14419/jacst.v3i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/3754/1489
Copyright (c) 2014 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/3800
2014-12-18T01:02:01Z
JACST:ART
Fuzzy spanners
Farshi, Mohammad
Networks
Graphs
Fuzzy Spanners
Greedy Algorithm
Fuzzy Weighted Graphs.
Graphs have wide applications in variety of applications, especially network analysis. Spanners give a sparse approximation of any graph as well as complete graph, which has wide applications so far. Because of its applications, graph definitions generalized to fuzzy sets and fuzzy weighted graph defined and studied vastly in past and has applications in several fields. In this paper, we define spanners for fuzzy weighted graphs and well as points come from a fuzzy metric space. We propose some algorithm to compute such a spanner. Finally, we pose some open problem that can be considered for future works.
Science Publishing Corporation
2014-12-06
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/3800
10.14419/jacst.v3i2.3800
Journal of Advanced Computer Science & Technology; Vol. 3 No. 2 (2014); 249-252
2227-4332
10.14419/jacst.v3i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/3800/1502
Copyright (c) 2014 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/3922
2015-05-27T14:06:09Z
JACST:ART
A hybrid KNN-MLP algorithm to diagnose bipolar disorder
Mohammad Ghasemi, Mozhgan
Khalili, Mehdi
Bipolar Disorder
MLP
KNN.
In this paper an attempt has been made to the other corner of the power of neural networks. According to the neural network in the diagnosis of diseases, we use neural network models for diagnosing bipolar disorder; bipolar disorder is the common disorder of depression mood. We have used two neural network models: MLP & KNN. With different percentages of the implementation of neural network models is discussed. And the error was calculated for each model. We can by using the MLP model achieve an error of 16% for the diagnosis of bipolar disorder.
Science Publishing Corporation
2014-12-25
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/3922
10.14419/jacst.v4i1.3922
Journal of Advanced Computer Science & Technology; Vol. 4 No. 1 (2015); 1-5
2227-4332
10.14419/jacst.v4i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/3922/1529
Copyright (c) 2014 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/3935
2015-05-27T14:06:09Z
JACST:ART
Strategies and scenarios of CSRF attacks against the CAPTCHA forms
Moradi, Hossein
Moghaddam, Hossein Kardan
CAPTCHA
CSRF
HTTPS
CSRF Attacks.
In this article, we’ve tried to examine the hypothesis of the robustness of a form by using CAPTCHA against CSRF and login CSRF attacks. Our investigations showed that unlike public opinion, common attacks to bypass CAPTCHAs such as Optical Character Recognition (OCR) and 3rd party human attacks are not applicable in the CSRF case and instead, Clickjacking is the most important scenario of CSRF and login CSRF attacks against a secure session-dependent CAPTCHA form. Remember that the Clickjacking is also applicable to bypass the well-known CSRF protections, such as the secret token and the Referer header. Therefore, although the frequent application of CAPTCHA on every page of a website negatively impacts the user experience, but the robustness of a robust session-dependent CAPTCHA against the CSRF and login CSRF attacks is almost the same as the session-dependent security token. Moreover, when a website is using a session-independent or week pattern of CAPTCHA, attackers can bypass the CAPTCHAs and launch the CSRF or login CSRF attacks by using XSS, session hijacking, replay attacks or submitting a random response.
Science Publishing Corporation
2015-01-14
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/3935
10.14419/jacst.v4i1.3935
Journal of Advanced Computer Science & Technology; Vol. 4 No. 1 (2015); 15-22
2227-4332
10.14419/jacst.v4i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/3935/1569
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/3958
2015-05-27T14:06:09Z
JACST:ART
Coset decomposition method for storing and decoding fingerprint data
Sayed, Mohamed
Biometrics
Coset Decomposition
Fingerprints Matching
Syndrome Decoding.
Biometrics such as fingerprints, irises, faces, voice, gait and hands are often used for access control, authentication and encryption instead of PIN and passwords. In this paper a syndrome decoding technique is proposed to provide a secure means of storing and matching various biometrics data. We apply an algebraic coding technique called coset decomposition to the model of fingerprint biometrics. The algorithm which reveals the matching between registered and probe fingerprints is modeled and implemented using MATLAB.
Science Publishing Corporation
2014-12-26
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/3958
10.14419/jacst.v4i1.3958
Journal of Advanced Computer Science & Technology; Vol. 4 No. 1 (2015); 6-11
2227-4332
10.14419/jacst.v4i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/3958/1532
Copyright (c) 2014 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/3979
2015-05-27T14:06:09Z
JACST:ART
A novel adaptive tolerance filter for random valued impulse noise suppression in digital grey and color images
Hanji, Geeta
Latte, M. V.
Adaptive Tolerance
Denoising
Detection-Estimation Based Strategy
Neighborhood Statistics
Random Valued Impulse Noise (RVIN)
Peak-Signal-To-Noise Ratio (PSNR)
Mean Square Error (MSE)
Structural Similarity (SSIM) Index.
During acquisition, transmission, storage and retrieval, quite often digital images become noised and mask the important details of an image and also present themselves with an ugly look. Such images if not processed properly, become useless for subsequent image processing operations like segmentation, classification etc. Hence the quality improvement (through denoising) of such noisy images becomes an important operation in the field of image processing. This paper proposes a two stage detection-estimation based filtering system to suppress random valued impulse noise from digital grey and color images based on neighborhood statistics of pixels of the working window under consideration. An adaptive working window and the adaptive tolerance computed from the pixels belonging to the current filtering window facilitates an appropriate detection of noisy pixels in the first phase, followed by the simple and computationally efficient restoration strategy in the second stage. The Simulation results prove that the proposed scheme exhibits much superior performance in comparison with other state of art image filtering methods in suppressing the random valued impulse noise from the digital grey and color images.
Science Publishing Corporation
2015-02-13
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/3979
10.14419/jacst.v4i1.3979
Journal of Advanced Computer Science & Technology; Vol. 4 No. 1 (2015); 43-52
2227-4332
10.14419/jacst.v4i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/3979/1613
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/3982
2015-05-27T14:06:09Z
JACST:ART
Presentation of an executable model for evaluation of software architecture using blackboard technique and formal models
Majidi, Fatemeh
Harounabadi, Ali
Considering the promotion and complexities of software systems and need to services for repair and updating, success of this system is extremely dependent to its architecture and design. Architectural techniques due to being used by the architectures frequently have specified effect on qualitative characteristics. If this effect is quantitative and measurable for each technique will enable the architect to have more care and convenience for evaluation of design and architectural designs. In this study, at first to show the structure and behavior of software architecture using blackboard technique, component diagram and unified modeling language activity diagram together with required data in relation to nonfunctional needs as stereotypes and labels were used. Later, upon converting the actual model to the formal model, requirements for system performance evaluation on the formal model is provided. Upon analyzing the results, it is observed that the offered method can evaluate the performance of software architecture based on blackboard technique at the design age.
Science Publishing Corporation
2015-01-16
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/3982
10.14419/jacst.v4i1.3982
Journal of Advanced Computer Science & Technology; Vol. 4 No. 1 (2015); 23-31
2227-4332
10.14419/jacst.v4i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/3982/1573
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/3994
2015-05-27T14:06:09Z
JACST:ART
Using of SVM for diagnosis of major depressive disorder
Ansari, Abdollah
Khalili, Mehdi
Major Depressive
Neural Network
SVM.
artificial neural networks are used extensively in diagnosis are used and the system is able to detect a variety of conditions used in this study for diagnosis of major depressive disorder, 45 parameters were considered Implementation and operation using SVM model the use of different network error checked Education.
Science Publishing Corporation
2015-01-11
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
application/msword
http://www.sciencepubco.com/index.php/JACST/article/view/3994
10.14419/jacst.v4i1.3994
Journal of Advanced Computer Science & Technology; Vol. 4 No. 1 (2015); 12-14
2227-4332
10.14419/jacst.v4i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/3994/1561
http://www.sciencepubco.com/index.php/JACST/article/view/3994/17222
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/4009
2015-05-27T14:06:10Z
JACST:ART
A four-phase data replication algorithm for data grid
Saleh, Alireza
Javidan, Reza
FatehiKhajeh, Mohammad Taghi
Data Grid
Data replication
Geographical Locality
Replica Placement
Temporal Locality.
Nowadays, scientific applications generate a huge amount of data in terabytes or petabytes. Data grids currently proposed solutions to large scale data management problems including efficient file transfer and replication. Data is typically replicated in a Data Grid to improve the job response time and data availability. A reasonable number and right locations for replicas has become a challenge in the Data Grid. In this paper, a four-phase dynamic data replication algorithm based on Temporal and Geographical locality is proposed. It includes: 1) evaluating and identifying the popular data and triggering a replication operation when the popularity data passes a dynamic threshold; 2) analyzing and modeling the relationship between system availability and the number of replicas, and calculating a suitable number of new replicas; 3) evaluating and identifying the popular data in each site, and placing replicas among them; 4) removing files with least cost of average access time when encountering insufficient space for replication. The algorithm was tested using a grid simulator, OptorSim developed by European Data Grid Projects. The simulation results show that the proposed algorithm has better performance in comparison with other algorithms in terms of job execution time, effective network usage and percentage of storage filled.
Science Publishing Corporation
2015-04-12
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/4009
10.14419/jacst.v4i1.4009
Journal of Advanced Computer Science & Technology; Vol. 4 No. 1 (2015); 163-174
2227-4332
10.14419/jacst.v4i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/4009/1704
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/4012
2015-05-27T14:06:09Z
JACST:ART
A new approach for finding semantic similar scientific articles
Islami Nasab, Masumeh
Javidan, Reza
Similarities
Semantic Similarities
Text Preprocessing
WordNet.
Calculating article similarities enables users to find similar articles and documents in a collection of articles. Two similar documents are extremely helpful for text applications such as document-to-document similarity search, plagiarism checker, text mining for repetition, and text filtering. This paper proposes a new method for calculating the semantic similarities of articles. WordNet is used to find word semantic associations. The proposed technique first compares the similarity of each part two by two. The final results are then calculated based on weighted mean from different parts. Results are compared with human scores to find how it is close to Pearson’s correlation coefficient. The correlation coefficient above 87 percent is the result of the proposed system. The system works precisely in identifying the similarities.
Science Publishing Corporation
2015-02-16
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/4012
10.14419/jacst.v4i1.4012
Journal of Advanced Computer Science & Technology; Vol. 4 No. 1 (2015); 53-59
2227-4332
10.14419/jacst.v4i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/4012/1616
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/4016
2015-10-29T12:42:19Z
JACST:ART
A study on incorporating ICT in teaching methodologies at universities of Quetta
Saeed, Nausheen
Nasim, Farrukh
Hussain, Walayat
Azeem, Samina
Human Computer Interaction
Teaching Methodology
Universities
Quetta
Information and Communication Technology (ICT).
This paper presents a study on the use of ICT in teaching methodology by the faculty of universities in Quetta, Pakistan. A Survey about the impact of ICT usage was conducted in three major public universities of Quetta - University Of Balochistan, Sardar Bahadur Khan Women University, and Balochistan University of Information Technology, Engineering and Management Sciences, focusing the faculty and the students. The study shows that ample ICT facilities are available to the faculties in these universities and the teachers incorporate different ICT tools in their teaching methodologies. Teachers and students believe that ICT has played a vital role in improving the quality of education while there remain some areas of improvement like University web portals, access to digital libraries for the students and online student management systems.
Science Publishing Corporation
2015-08-12
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/4016
10.14419/jacst.v4i2.4016
Journal of Advanced Computer Science & Technology; Vol. 4 No. 2 (2015); 260-264
2227-4332
10.14419/jacst.v4i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/4016/1941
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/4035
2016-05-22T11:56:22Z
JACST:ART
Irrelevant frame removal for scene analysis using video hyperclique pattern and spectrum analysis
Chang, Yuchou
Lin, Hong
Content-Based Video Retrieval
Fibonacci Lattice
Hyperclique Pattern
Irrelevant Removal
Log Spectrum.
Video often include frames that are irrelevant to the scenes for recording. These are mainly due to imperfect shooting, abrupt movements of camera, or unintended switching of scenes. The irrelevant frames should be removed before the semantic analysis of video scene is performed for video retrieval. An unsupervised approach for automatic removal of irrelevant frames is proposed in this paper. A novel log-spectral representation of color video frames based on Fibonacci lattice-quantization has been developed for better description of the global structures of video contents to measure similarity of video frames. Hyperclique pattern analysis, used to detect redundant data in textual analysis, is extended to extract relevant frame clusters in color videos. A new strategy using the k-nearest neighbor algorithm is developed for generating a video frame support measure and an h-confidence measure on this hyperclique pattern based analysis method. Evaluation of the proposed irrelevant video frame removal algorithm reveals promising results for datasets with irrelevant frames.
Science Publishing Corporation
2016-02-06
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/4035
10.14419/jacst.v5i1.4035
Journal of Advanced Computer Science & Technology; Vol. 5 No. 1 (2016); 1-7
2227-4332
10.14419/jacst.v5i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/4035/2121
Copyright (c) 2016 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/4038
2015-05-27T14:06:09Z
JACST:ART
An optimized MLP model to diagnosis the bipolar disorder
Mohammad Ghasemi, Mozhgan
Khalili, Mehdi
ANN
MLP
BD.
The use of artificial neural networks in different areas of engineering science is growing by the day. The significant proportions of research in medical engineering, Therefore in this paper have tried to implemented MLP model with 47 parameters for diagnosis of bipolar disorder. Parameters such as: lack of pleasure, feelings of guilt, worthlessness, lack of success, mental anxiety, somatic anxiety disorder, the disorder of interest, etc. in next part, we done the manipulation structure of MLP model, for this work switching the function in layers. And comparing the error of manipulation structure with previous manipulation. We concluded with using purelin function in layers, the error of diagnosis reduces 4% and this value is an acceptable value.
Science Publishing Corporation
2015-01-20
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/4038
10.14419/jacst.v4i1.4038
Journal of Advanced Computer Science & Technology; Vol. 4 No. 1 (2015); 32-36
2227-4332
10.14419/jacst.v4i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/4038/1580
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/4094
2015-05-27T14:06:09Z
JACST:ART
Solving optimization problems using black hole algorithm
Farahmandian, Masoum
Hatamlou, Abdolreza
Optimization
Meta-Heuristic Optimization
Black Hole Algorithm
Particle Swarm Optimization
Genetic Algorithm.
Various meta-heuristic optimization approaches have been recently created and applied in different areas. Many of these approaches are inspired by swarm behaviors in the nature. This paper studies the solving optimization problems using Black Hole Algorithm (BHA) which is a population-based algorithm. Since the performance of this algorithm was not tested in mathematical functions, we have studied this issue using some standard functions. The results of the BHA are compared with the results of GA and PSO algorithms which indicate that the performance of BHA is better than the other two mentioned algorithms.
Science Publishing Corporation
2015-02-18
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/4094
10.14419/jacst.v4i1.4094
Journal of Advanced Computer Science & Technology; Vol. 4 No. 1 (2015); 68-74
2227-4332
10.14419/jacst.v4i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/4094/1621
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/4100
2015-05-27T14:06:09Z
JACST:ART
A cluster based approach for wormhole attack detection in wireless sensor networks
Shahryari, Maliheh
Reza Naji, Hamid Reza
Wireless Sensor Network
Wormhole Attack
Clustering
Attack Detection.
Due to the need of cooperation among nodes to relay packets, wireless sensor networks are very vulnerable to attacks in all layers of the network. One of these severe attacks is the wormhole attack. Detection of wormhole attack is hard, because it can be easily implemented by attacker without having knowledge of nodes in the network or it can be compromised by any legal node in the network. To date, the most of proposed protocols to defend against wormhole attacks are made by adopting synchronized clocks, directional antennas or strong assumptions in order to detect wormhole attacks.A method based on clustering is presented in this paper to detect this type of attacks. This method is implemented in static and mobile networks. The superiority of our protocol is that during the attack prevention or attack detection, the malicious nodes are detected and requires no additional hardware or complex calculations. Simulation results are perused with the NS-2 simulator and the protocol has been evaluated in terms of packet drop ratio, throughput, delay and energy consumption compared to a network without or under attack. Simulation results show that our protocol is practical and effective in improving resilience against wormhole attacks.
Science Publishing Corporation
2015-02-27
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/4100
10.14419/jacst.v4i1.4100
Journal of Advanced Computer Science & Technology; Vol. 4 No. 1 (2015); 95-102
2227-4332
10.14419/jacst.v4i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/4100/1635
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/4129
2015-05-27T14:06:09Z
JACST:ART
An approach to implement interactive teaching in blended learning environments
Sayed, Mohamed
Blended Active Learning
Classrooms Technology
Computer-Marked Assessment
E-Instructions.
The use of electronic response systems in classrooms can be effective, especially when coupled with a method allowing a question to be broken into manageable interactive questions. This paper develops the use of electronic response systems as a part of leading assessment delivery and data collection solutions in a blended learning environment. The technology that is the subject of this research consists of thirty-button response cards that transmit student responses to a receiver connected to the instructor laptop. The electronic response systems are proven to enhance the effective instructions, increase retentions, engage participants, and immediately assess understanding.
Science Publishing Corporation
2015-02-06
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/4129
10.14419/jacst.v4i1.4129
Journal of Advanced Computer Science & Technology; Vol. 4 No. 1 (2015); 37-42
2227-4332
10.14419/jacst.v4i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/4129/1602
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/4149
2015-05-27T14:06:09Z
JACST:ART
An evaluation of business models in e-mobile payment by using multiple criteria decision making
Pourali, Abdolghader
Hashempour, Elham
Business Model
Mobile Payment
Multiple Criteria Decision Making
TOPSIS Method.
Due to the significant growth in the usage of cell phone by customers and its availability, this tool can be considered such the best tool. For e-payment for implementing the mobile payment service, other objects and players should be considered such as banks, operators, service providers and the used technology as the effective interaction role. In addition, for effective optimization of parameters for implementing the mobile payment solution a proper model of business should be used. First of all, in this experiment, different business models in the field of mobile payment and the role of each stakeholder in these models and their positive and negative points are discussed. Moreover, by using method of Multiple Criteria Decision Making, four famous business models of the world are evaluated and the result of this evaluation highlights that the cooperation model is the most Appropriate Model in terms of mobile payment methods.
Science Publishing Corporation
2015-02-28
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/4149
10.14419/jacst.v4i1.4149
Journal of Advanced Computer Science & Technology; Vol. 4 No. 1 (2015); 103-115
2227-4332
10.14419/jacst.v4i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/4149/1636
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/4156
2015-05-27T14:06:09Z
JACST:ART
Strategies for enhancing the accuracy and security in ad hoc networks
Delijani, Behnam Rahmani
Tavakoli, Hassan
Ad Hoc Networks
Accuracy
Security
Forwarding A Virtual Package
Backbone.
Ad Hoc networks are a type of mobile wireless networks composed of mobile and stationary nodes which are moving freely and independently or they are stable. Setting up Ad Hoc networks is very simple and as these networks do not need a standard fixed infrastructure and central legal license, their setting up cost is very low. So, in specials, temporary or short-term situations such as flood, earthquake and fire as well as in military environments where all telecommunication platforms are destroyed, these networks are used as a new solution for creating communications between network elements. As Ad Hoc networks have a limited energy and nodes are continuously displacing, consequently, the accuracy of these networks is important. Nodes can be easily added to the network at any time or leave the network. It not only leads to easy creation of a network and its fast, easy and low-cost expansion, but also makes it possible for an enemy to enter the network. Therefore, the security of these networks must also be considered. In this paper, using a new method and imposing limitations on some network nodes, we created a more reliable network with higher accuracy and security.
Science Publishing Corporation
2015-03-04
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/4156
10.14419/jacst.v4i1.4156
Journal of Advanced Computer Science & Technology; Vol. 4 No. 1 (2015); 116-121
2227-4332
10.14419/jacst.v4i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/4156/1640
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/4162
2015-05-27T14:06:09Z
JACST:ART
The distributed parallel genetic algorithm on the ad hoc network
Afifi, Nima
Tavakoli, Hassan
Ad Hoc Networks
Distributed Algorithm
Parallel Computations
Genetic Algorithm
Optimization.
Today, mobile computing is one of the important issues in computer and network sciences. Using the processing power of mobile devices purposefully for solving complex issues is one of the research fields for researchers. One of the important issues in the optimization which needs a high processing power for finding the best possible answer is travelling salesman problem. In this paper, by providing a method based on the distributed parallel genetic algorithm on a number of mobile nodes in the Ad Hoc network, it was attempted to increase the speed of finding the best answer for the travelling salesman algorithm.
Science Publishing Corporation
2015-02-20
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/4162
10.14419/jacst.v4i1.4162
Journal of Advanced Computer Science & Technology; Vol. 4 No. 1 (2015); 75-83
2227-4332
10.14419/jacst.v4i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/4162/1623
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/4163
2015-05-27T14:06:09Z
JACST:ART
New method for combining the channel coding with polar coding-based encryption
Kenarkouhi, Mohammad
Tavakoli, Hassan
Encryption
Channel Coding
the Combination of Encryption and Coding
Polar Code
Complexity.
In this paper, polar codes recently presented by Arikan are introduced. Polar codes have a number of channels with high capacity where information is located. In addition, these codes are composed of a number of channels with low capacity called frozen bits. In the first proposed design, we optimally use frozen and useless bits of the polar code and insert the encryption key on all the bits of the design (information bits and frozen bits). In fact, in Arkian’s proposed 8-bit design, we use 8 encryption keys. Then, in the rest of the article, a method is presented through which the number of encryption keys applied can be reduced. Because, the encryption system is effective and desired in which in addition to the high complexity and the lack of correlation between bits, the minimum number of encryption keys are used.
Science Publishing Corporation
2015-02-25
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/4163
10.14419/jacst.v4i1.4163
Journal of Advanced Computer Science & Technology; Vol. 4 No. 1 (2015); 90-94
2227-4332
10.14419/jacst.v4i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/4163/1630
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/4173
2015-10-29T12:42:19Z
JACST:ART
Assessing quality in software development: An agile methodology approach
RodrÃguez-Hernández, V.
Espino-Gudiño, M.C.
González-Pérez, J.L.
Gudiño-Bazaldúa, J.
Castano, Victor
Software Develoment
Quality Assesment
Agile Technology
Education
Software Training.
A novel methodology, result of 10 years of in-field testing, which makes possible the convergence of different types of models and quality standards for Engineering and Computer Science Faculties, is presented. Since most software-developing companies are small and medium sized, the projects developed must focuson SCRUM and Extreme Programming (XP), opposed to a RUP, which is quite heavy, as well as on Personal Software Process (PSP) and Team Software Process (TSP), which provide students with competences and a structured framework. ISO 90003:2004 norm is employed to define the processes by means of a quality system without new requirements or changing the existing ones. Also, the model is based on ISO/IEC 25000 (ISO (IEC 9126 – ISO/IEC 14598)) to allow comparing software built by different metrics.
Science Publishing Corporation
2015-06-09
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/4173
10.14419/jacst.v4i2.4173
Journal of Advanced Computer Science & Technology; Vol. 4 No. 2 (2015); 225-230
2227-4332
10.14419/jacst.v4i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/4173/1854
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/4194
2015-05-27T14:06:09Z
JACST:ART
Forecasting about EURJPY exchange rate using hidden Markova model and CART classification algorithm
Haeri, Abdorrahman
Hatefi, Seyed Morteza
Rezaie, Kamran
CART Classification Algorithm
EURJPY Exchange Rate
Forecasting
Foreign Exchange Market
Hidden Markov Model
Indicators
Neural Network.
The goal of this paper is forecasting direction (increase or decrease) of EURJPY exchange rate in a day. For this purpose five major indicators are used. The indicators are exponential moving average (EMA), stochastic oscillator (KD), moving average convergence divergence (MACD), relative strength index (RSI) and Williams %R (WMS %R). Then a hybrid approach using hidden Markov models and CART classification algorithms is developed. Proposed approach is used for forecasting direcation (increase or decrease) of Euro-Yen exchange rates in a day. Also the approach is used for forecasting differnece between intial and maximum exchange rates in a day. As well as it is used for forecasting differnece between intial and minimum exchange rates in a day. Reslut of proposed method is compared with CART and neural network. Comparison shows that the forecasting with proposed method has higher accuracy.
Science Publishing Corporation
2015-02-22
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/4194
10.14419/jacst.v4i1.4194
Journal of Advanced Computer Science & Technology; Vol. 4 No. 1 (2015); 84-89
2227-4332
10.14419/jacst.v4i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/4194/1626
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/4211
2015-05-27T14:06:09Z
JACST:ART
Taxonomy of intelligence software reliability model
Ahmadluei, Saeed
Genetic Algorithm
Intelligence System
Neural Network
Software Engineering
Software Reliability.
The probability of failure free software operation for a specified period of time in a specified environment is called Reliability, it is one of the attributes of software quality and study about it come back to 1384. Exposition and spreading of new software systems and profound effect of it to human life emphasize the importance of software reliability analysis, until it poses formal definition at 1975. First race of reliability analysis methods that we called classic methods has stochastic process approach and in this way, attempt to predict the software behavior in future. Due to the ambiguity in fruitfulness of these solutions the challenge about reliability analysis continued till now. Great tendency in applying intelligence systems at variety of applications can be seen at 90 decade, and software reliability attracts some research direction to itself. Until now variety of methods in reliability analysis on the base of intelligence systems approach exhibited. In this survey the taxonomy of these methods represented with brief description of each one. Also comparison between these methods can be seen at the end of survey.
Science Publishing Corporation
2015-02-16
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/4211
10.14419/jacst.v4i1.4211
Journal of Advanced Computer Science & Technology; Vol. 4 No. 1 (2015); 60-67
2227-4332
10.14419/jacst.v4i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/4211/1617
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/4283
2015-05-27T14:06:10Z
JACST:ART
Comparison criteria between matching algorithms texts application on (horspool's and brute force algorithms)
Ibrahim, Amin Mubark Alamin
Mustafa, Mustafa Elgili
Space and Time Tradeoffs
Put Enhancement in String Matching
Horspool's and Brute Force Algorithms.
The subject of matching text or search the texts is important topics in the field of computer science and is used in many programs such as Microsoft word program in correct spelling mistakes and search &replace, and other uses. The aim of this study was to learn how to trade-off texts matching algorithms, which are very much where we have the application on Horspool's and Brute Force algorithms. According to the standard number of comparisons and time of execution. The study pointed on preference Horspool's algorithm.
Science Publishing Corporation
2015-04-12
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
application/vnd.openxmlformats-officedocument.wordprocessingml.document
http://www.sciencepubco.com/index.php/JACST/article/view/4283
10.14419/jacst.v4i1.4283
Journal of Advanced Computer Science & Technology; Vol. 4 No. 1 (2015); 175-179
2227-4332
10.14419/jacst.v4i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/4283/1706
http://www.sciencepubco.com/index.php/JACST/article/view/4283/17232
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/4307
2015-05-27T14:06:09Z
JACST:ART
A novel authentication and access control framework in wireless sensor networks
Nouri-Moghaddam, Babak
Naji, Hamid Reza
Wireless Sensor Network
Authentication
Access Control
Kerberos
Bloom Filter
Elliptic Curve Deffie-Hellman.
Wireless Sensor Networking continues to evolve as one of the most challenging research areas. Considering the insecure nature of these networks and the fact that sensor nodes are distributed in a hostile environment, having a well-implemented security scheme is absolutely essential. Bearing in mind the important security services like authentication and access control, we have proposed a novel security framework for these networks. The new framework is based on Kerberos authentication and access control system. The Kerberos has been adopted for WSNs by utilizing Bloom Filter data structure and Elliptic Curve cryptography. In the proposed scheme, Bloom Filter data structure is used in a novel way; we have used this data structure to get rid of Public Key’s certificates. By combining Bloom Filter data structure and Elliptic Curve cryptography, we achieved a very light robust security framework that offers Authentication, Access Control, and key sharing services. The analysis results showed that our scheme provides more security services and is more robust in the presence of attacks compared to the previous schemes. In contrast, simulation results indicated that our system had significant improvements over the other schemes in many aspects such as power and time expenditure.
Science Publishing Corporation
2015-03-09
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/4307
10.14419/jacst.v4i1.4307
Journal of Advanced Computer Science & Technology; Vol. 4 No. 1 (2015); 122-135
2227-4332
10.14419/jacst.v4i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/4307/1651
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/4309
2015-05-27T14:06:09Z
JACST:ART
Data integration of cost materials needs through a service oriented architecture (study case: pt x garment ungaran)
Christianto, Erwien
Utomo, Wiranto
Sulistyo, Wiwin
Soa
Ws
Bpel
Integration
Cost of Materials Information Systems.
Data processing is an important part of a garment company. With increasingly complex and developing a garment company, data processing and integration became a very important requirement. The need for data integration in determining the cost of materials becomes a very important part in the garment industry. Data distribution or dissemination from one to another section gives results in data duplication, so that it may cause the data to be inconsistent. In addition, the efficiency of the process in determining the cost of materials is highly needed to achieve the selling price determination target. Nowadays, there is web-based technology, which is capable of handle data integration service, called SOA (Service Oriented Architecture). Business processes (work flows) involving the supplier need to go back to the supplier with the output price that has been determined by the system, can be integrated with Web service with concentration of BPELSOA. By utilizing the SOA technology then data processing and integration problems that occurred in the garment industry could be made into an integrated information system, so that the problems in the garment industry can be solved.
Science Publishing Corporation
2015-03-18
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/4309
10.14419/jacst.v4i1.4309
Journal of Advanced Computer Science & Technology; Vol. 4 No. 1 (2015); 136-147
2227-4332
10.14419/jacst.v4i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/4309/1668
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/4343
2015-10-29T12:42:19Z
JACST:ART
Fingerprint pattern recognition from bifurcations: An alternative approach
Castañeda-Miranda, A.
Castañeda-Miranda, R.
Castano, Victor
Fingerprints
Dactiloscopy
Pattern Recognition
Pc-Based Software
Segmentation.
A pc-based automatic system for fingerprints recording and classification is described, based on the vector analysis of bifurcations. The system consists of a six-step process: a) acquisition, b) preprocessing, c) fragmentation, d) representation, e) description, and f) recognition. Details of each stage, along with actual examples of fingerprints recognition are provided.
Science Publishing Corporation
2015-05-31
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/4343
10.14419/jacst.v4i2.4343
Journal of Advanced Computer Science & Technology; Vol. 4 No. 2 (2015); 220-224
2227-4332
10.14419/jacst.v4i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/4343/1797
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/4348
2015-05-27T14:06:10Z
JACST:ART
Problem solving of container loading using genetic algorithm based on modified random keys
Arefi, Mohammad Sadegh
Rezaei, Hassan
Container Loading
Evolutionary Algorithms
Genetic Algorithm
Random Keys.
This article presents a solution to the container loading problem. Container loading problem deals with how to put the cube boxes with different sizes in a container. Our proposed method is based on a particular kind of genetic algorithm based on biased random keys. In the proposed algorithm, we will face generations' extinction. Population decreases with time and with the staircase changes in the rate of elitism, the algorithm is guided towards the global optimum. Biased random keys in the proposed method are provided as discrete. The algorithm also provides the chromosomes that store more than one ability. In order to solve container loading using a placement strategy, due to the size of the boxes and containers, the containers are classified as small units and equal unites in size. Finally the algorithm presented in this paper was compared with three other methods that are based on evolutionary algorithms. The results show that the proposed algorithm has better performance in terms of results and performance time in relation to other methods.
Science Publishing Corporation
2015-04-15
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/4348
10.14419/jacst.v4i1.4348
Journal of Advanced Computer Science & Technology; Vol. 4 No. 1 (2015); 190-197
2227-4332
10.14419/jacst.v4i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/4348/1709
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/4353
2015-05-27T14:06:09Z
JACST:ART
New method for rapid diagnosis of Hepatitis disease based on reduction feature and machine learning
Khorashadizade, Nahid
Rezaei, Hassan
Classification
Dimensionality reduction
Error minimized extreme learning machine
Hepatitis disease
Principal component analysis.
Hepatitis disease is caused by liver injury. Rapid diagnosis of this disease prevents its development and suffering to cirrhosis of the liver. Data mining is a new branch of science that helps physicians for proper decision making. In data mining using reduction feature and machine learning algorithms are useful for reducing the complexity of the problem and method of disease diagnosis, respectively. In this study, a new algorithm is proposed for hepatitis diagnosis according to Principal Component Analysis (PCA) and Error Minimized Extreme Learning Machine (EMELM). The algorithm includes two stages; in reduction feature phase, missing records were deleted and hepatitis dataset was normalized in [0,1] range. Thereafter, analysis of the principal component was applied for reduction feature. In classification phase, the reduced dataset is classified using EMELM. For evaluation of the algorithm, hepatitis disease dataset from UCI Machine Learning Repository (University of California) was selected. The features of this dataset reduced from 19 to 6 using PCA and the accuracy of the reduced dataset was obtained using EMELM. The results revealed that the proposed hybrid intelligent diagnosis system reached the higher classification accuracy and shorter time compared with other methods.
Science Publishing Corporation
2015-03-31
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/4353
10.14419/jacst.v4i1.4353
Journal of Advanced Computer Science & Technology; Vol. 4 No. 1 (2015); 148-155
2227-4332
10.14419/jacst.v4i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/4353/1684
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/4365
2015-05-27T14:06:10Z
JACST:ART
ANN-based modeling of third order runge kutta method
Dehghanpour, M.
Rahati, A.
Dehghanian, E.
Differential Equations
Artificial Neural Network
Runge Kutta Method.
The world's common rules (Quantum Physics, Electronics, Computational Chemistry and Astronomy) find their normal mathematical explanation in language of differential equations, so finding optimum numerical solution methods for these equations are very important. In this paper, using an artificial neural network (ANN) a numerical approach is designed to solve a specific system of differential equations such that the training process of the ANN calculates the optimal values for the coefficients of third order Runge Kutta method. To validate our approach, we performed some experiments by solving two body problem using coefficients obtained by ANN and also two other well-known coefficients namely Classical and Heun. The results show that the ANN approach has a better performance in compare with two other approaches.
Science Publishing Corporation
2015-04-12
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/4365
10.14419/jacst.v4i1.4365
Journal of Advanced Computer Science & Technology; Vol. 4 No. 1 (2015); 180-189
2227-4332
10.14419/jacst.v4i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/4365/1707
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/4398
2015-05-27T14:06:09Z
JACST:ART
Using the interestingness measure lift to generate association rules
Hussein, Nada
Alashqur, Abdallah
Sowan, Bilal
Data Mining
Knowledge Discovery in Database (KDD)
Association Rule Mining
Interestingness Measures.
In this digital age, organizations have to deal with huge amounts of data, sometimes called Big Data. In recent years, the volume of data has increased substantially. Consequently, finding efficient and automated techniques for discovering useful patterns and relationships in the data becomes very important. In data mining, patterns and relationships can be represented in the form of association rules. Current techniques for discovering association rules rely on measures such as support for finding frequent patterns and confidence for finding association rules. A shortcoming of confidence is that it does not capture the correlation that exists between the left-hand side (LHS) and the right-hand side (RHS) of an association rule. On the other hand, the interestingness measure lift captures such as correlation in the sense that it tells us whether the LHS influences the RHS positively or negatively. Therefore, using Lift instead of confidence as a criteria for discovering association rules can be more effective. It also gives the user more choices in determining the kind of association rules to be discovered. This in turn helps to narrow down the search space and consequently, improves performance. In this paper, we describe a new approach for discovering association rules that is based on Lift and not based on confidence.
Science Publishing Corporation
2015-04-06
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/4398
10.14419/jacst.v4i1.4398
Journal of Advanced Computer Science & Technology; Vol. 4 No. 1 (2015); 156-162
2227-4332
10.14419/jacst.v4i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/4398/1698
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/4518
2015-05-27T14:06:10Z
JACST:ART
Study of transient phenomena using NI-USB data acquisition systems in Matlab-Simulink medium on 64 bit operating systems
Titu, Niculescu
Capacitive Circuit
Data Acquisition
Diagrams
Differential Equation
Electrical Diagram
Matlab- Simulink
NI-USB.
The paper presents a new and modern method for study the transient phenomena appeared to connect the capacitive charges to an AC power source, using the MATLAB-SIMULINK software package. It is known that NI-USB data-acquisition systems manufactured by National Instruments are not seen by Simulink software package in 64-bit systems. For this is obligatory for use a 32-bit system. From this point of view, the article presents a method by which this disadvantage is eliminated, making possible the data acquisition process in Simulink software package.
Science Publishing Corporation
2015-04-24
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/4518
10.14419/jacst.v4i1.4518
Journal of Advanced Computer Science & Technology; Vol. 4 No. 1 (2015); 198-203
2227-4332
10.14419/jacst.v4i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/4518/1725
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/4564
2015-05-27T14:06:10Z
JACST:ART
A taxonomy of : The reviews on Cloud Computing Direction (CCD)
Yassin, Alla Talal
Alnidawy, Ban Kassim
Cloud Services
Cloud Computing
Survey.
The manufacturing industry is undergoing a major transformation enabled by IT and related smart technologies. The main thrust of Cloud computing is to provide on-demand computing services with high reliability, scalability and availability in a distributed environment. This paper summarizes our taxonomy of the CC review direction. The goals of this taxonomy were (i) clarify the needs and the directions of the use of the CC, (ii) define the academic and practical issues involved in CC , (iii) learn the state of the directions on methodologies of the CC , (iv) identify future research directions, which benefit the short and long terms. The taxonomy has concluded that (i) CC is advantageous in dealing with changes and uncertainties in the every-changing environment. (ii)It has been found that few existing CC can achieve the objective of security. (iii) The obstacles of the development of CC include the difficulties to identify and generalize the requirement of CC security, the lake of effective technologies that can be used to support the clouding use, and no international origination that serves for standardizing the modular components for cloud computing processes. In this paper, we use the IVSL(The Iraq Virtual Science Library) to select the free, full-text access to papers from major publishers as well as a large collection of on-line educational materials.
Science Publishing Corporation
2015-05-01
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/4564
10.14419/jacst.v4i1.4564
Journal of Advanced Computer Science & Technology; Vol. 4 No. 1 (2015); 204-211
2227-4332
10.14419/jacst.v4i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/4564/1742
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/4656
2015-05-29T09:36:01Z
JACST:ART
Study of transitory phenomena at connecting the capacitive loads to an AC power source
Niculescu, Titu
Marcu, Marius
Popescu, Florin Gabriel
Capacitive Circuit
Data's Acquisition
Diagrams
Differential Equation
Labview
Simulation Model
Simulink.
This paper presents a new and a modern method for study the inductive-capacitive circuits which are connected to an AC power source, using modern methods based on digital technology and software used in engineering applications. The capacitive circuits which are switched on an AC power source at the initial moment are presented below. We can determine the capacitor current variation forms, the capacitor voltage in a transient regime by using virtual mediums, in two different regimes: the oscillating regime and the-periodic regime. Each presented case contains an analytical presentation of the phenomenon, but it also contains the diagrams of current and voltage capacitors. The diagrams were obtained by two methods, which use MATLAB package. These diagrams are compared with experimental measurements obtained with a data-acquisition system produced by National Instruments using LABVIEW software.
Science Publishing Corporation
2015-05-27
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/4656
10.14419/jacst.v4i1.4656
Journal of Advanced Computer Science & Technology; Vol. 4 No. 1 (2015); 212-219
2227-4332
10.14419/jacst.v4i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/4656/1784
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/4749
2015-10-29T12:42:19Z
JACST:ART
AK-means: an automatic clustering algorithm based on K-means
Kettani, Omar
Ramdani, Faical
Tadili, Benaissa
Automatic Clustering
G-Means
K-Means
Parameter-Free Clustering.
In data mining, K-means is a simple and fast algorithm for solving clustering problems, but it requires that the user provides in advance the exact number of clusters (k), which is often not obvious. Thus, this paper intends to overcome this problem by proposing a parameter-free algorithm for automatic clustering. It is based on successive adequate restarting of K-means algorithm. Experiments conducted on several standard data sets demonstrate that the proposed approach is effective and outperforms the related well known algorithm G-means, in terms of clustering accuracy and estimation of the correct number of clusters.
Science Publishing Corporation
2015-06-13
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
application/zip
http://www.sciencepubco.com/index.php/JACST/article/view/4749
10.14419/jacst.v4i2.4749
Journal of Advanced Computer Science & Technology; Vol. 4 No. 2 (2015); 231-236
2227-4332
10.14419/jacst.v4i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/4749/1860
http://www.sciencepubco.com/index.php/JACST/article/view/4749/17266
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/4857
2015-10-29T12:42:19Z
JACST:ART
Design and implementing a software tool to ensure undeadlock state by perfect distribution of resources' instances among competing processes
Bakko, Imad Matti
Yas, Ruwaida Mohammed
Operating Systems Deadlock
Software Tool
Safety Algorithm
Processes
Resources.
In computer operating systems books, they explain and solve deadlock problems by declaring in advance the maximum needs of resources and their instances for each process, the total number of resources' instances, and the allocation of the resources' instances for each process. In this paper, we introduce an effective software tool to prove that it is not necessary to declare in advance the allocation of resources' instances for each process since we suggested and implement in the tool some equations to calculate and discover a suitable allocation of resources' instances to be distributed among competing processes in such a way that the computer system will never enter a deadlock state. In fact, the only necessary and sufficient conditions to solve deadlock problems are the total number of resources and their instances besides the maximum needs of resources and their instances for each process. The theory and details are explained with some examples in the contents.
Science Publishing Corporation
2015-07-03
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/4857
10.14419/jacst.v4i2.4857
Journal of Advanced Computer Science & Technology; Vol. 4 No. 2 (2015); 237-247
2227-4332
10.14419/jacst.v4i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/4857/1915
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/4880
2015-11-04T12:49:58Z
JACST:ART
Design and development of intelligent electronic tutorial software for GSM maintenance in Nigeria
Nwabueze, Ekwonwune Emmanuel
Ngozi, Nwachukwu Catherine Ada
Obiageli J., Anyaduba
Fortune, Obikwere
Software
Tutorial
Desig
Communications
Telecommunications
GSM
Technology.
The Global System of Mobile communication (GSM) technology has permeated every facet of human existence ,that man can no longer do away with it. This piece of work was motivated by the nagging problems, which include poor quality of service by telecom service providers, which attempts to negate the value of this revolution, inaccurate and interrupted service delivery which have resulted to delayed and aborted calls, traffic congestion, low bandwidth and oversubscription errors, inter alia. So the primary objective of this article therefore, is to design and develop intelligent electronic tutorial GSM software that would be capable of providing relevant answers to some GSM-based service challenges raised above. The Structured Systems Analysis and Design Methodology (SSADM) was employed as research methodology. The expected results shall include, among others, broadened scope of knowledge in GSM tutorial software engineering, provision of user friendly environment and cost effective communication system for a happy customer and a better society; provide an effective and feasible solution for a reliable and accurate GSM management system that would improve the efficiency and productivity of Nigerian information and communication infrastructure.
Science Publishing Corporation
2015-07-26
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/4880
10.14419/jacst.v4i2.4880
Journal of Advanced Computer Science & Technology; Vol. 4 No. 2 (2015); 248-259
2227-4332
10.14419/jacst.v4i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/4880/2038
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/5225
2016-05-22T11:56:22Z
JACST:ART
A review on data stream classification approaches
Homayoun, Sajad
Ahmadzadeh, Marzieh
Data Stream
Data Stream Classification
Ensemble
Semi-Supervised Learning
Active Learning.
Stream data is usually in vast volume, changing dynamically, possibly infinite, and containing multi-dimensional features. The attention towards data stream mining is increasing as regards to its presence in wide range of real-world applications, such as e-commerce, banking, sensor data and telecommunication records. Similar to data mining, data stream mining includes classification, clustering, frequent pattern mining etc. techniques; the special focus of this paper is on classification methods invented to handle data streams. Early methods of data stream classification needed all instances to be labeled for creating classifier models, but there are some methods (Semi-Supervised Learning and Active Learning) in which unlabeled data is employed as well as labeled data. In this paper, by focusing on ensemble methods, semi-supervised and active learning, a review on some state of the art researches is given.
Science Publishing Corporation
2016-02-07
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/5225
10.14419/jacst.v5i1.5225
Journal of Advanced Computer Science & Technology; Vol. 5 No. 1 (2016); 8-13
2227-4332
10.14419/jacst.v5i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/5225/2123
Copyright (c) 2016 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/5310
2015-10-31T10:50:06Z
JACST:ART
Colour sorting of translucent samples
Pavlidis, George
Colour Sorting
Quality Control
Computer Vision
Translucent Samples
Transparency
Mechatronics
Automated quality control and sorting based on computer vision techniques has been a long celebrated practice in industrial processes and production. Among the surface characteristics that guide the decision making in such systems, the colour holds a prominent position. This gets somehow complicated in cases dealing with translucent samples or samples with a significant amount of transparency and yet distinctive colour hues. The scope of this paper is to provide a method to tackle with such cases and presents a successful application to the world-renowned mastiha of Chios, a natural aromatic translucent resin extracted from the mastic tree that grows on the island of Chios, Greece.
Science Publishing Corporation
2015-10-29
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/5310
10.14419/jacst.v4i2.5310
Journal of Advanced Computer Science & Technology; Vol. 4 No. 2 (2015); 265-272
2227-4332
10.14419/jacst.v4i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/5310/2033
Copyright (c) 2015 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/5861
2016-07-19T19:55:07Z
JACST:ART
Performance trends for operational intelligence through value chain model
Kaula, Rajeev
Business Intelligence
Business Process
Operational Intelligence
Business Process Intelligence
Business Rules.
Value chain is a successful management model for improving business competitiveness. A value chain based analytic approach facilitates meaningful grouping of business processes such that appropriate value from business operations can be derived. As organizations focus on competitive advantage and growth, a value chain derived operational intelligence provides insight to compete successfully in the marketplace. This paper outlines an approach to develop performance based value metrics in the form of analytic business rules for operational intelligence through the value chain model. The paper illustrates the concepts through a University value chain prototype which is implemented in Oracle’s PL/SQL language.
Science Publishing Corporation
2016-06-28
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/5861
10.14419/jacst.v5i2.5861
Journal of Advanced Computer Science & Technology; Vol. 5 No. 2 (2016); 34-41
2227-4332
10.14419/jacst.v5i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/5861/2311
Copyright (c) 2016 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/5951
2016-07-19T19:55:07Z
JACST:ART
Managing a computer system and interface, performance and applications
Zeqiri, Nderim
Computer System
Management
Arduino
Performance.
Computer system has important command under various objects. To have a stable system, there is a need to create the model and functionality in terms of management and programming. The purpose of this paper is to present computer system as a central source, and other systems management interface for external management facilities. The logic of interaction of various objects is to create structures with universal purposes. In the paper presented the functioning of the computer system with microcontrollers and especially with Arduino Uno device. Also, is analyzed the performance of computer system, and are given the perspective and other question in the context of problem-solving. So, finally is given the comparisons with other systems.
Science Publishing Corporation
2016-06-07
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
application/vnd.openxmlformats-officedocument.wordprocessingml.document
http://www.sciencepubco.com/index.php/JACST/article/view/5951
10.14419/jacst.v5i2.5951
Journal of Advanced Computer Science & Technology; Vol. 5 No. 2 (2016); 23-27
2227-4332
10.14419/jacst.v5i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/5951/2286
http://www.sciencepubco.com/index.php/JACST/article/view/5951/17295
Copyright (c) 2016 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/6079
2016-07-19T19:55:07Z
JACST:ART
Survey of the use of genetic algorithm for multiple sequence alignment
Ben Othman, Mohamed Tahar
Genetic Algorithms
Multiple Sequence Alignment
Representation Closeness
Representativeness
Sequence Invariance.
Multiple Sequence Alignment (MSA) is used in genomic analysis, such as the identification of conserved sequence motifs, the estimation of evolutionary divergence between sequences, and the genes’ historical relationships inference. Several researches were conducted to determine the level of similarity of a set of sequences. Due to the problem of the NP-complete class property, a number of researches use genetic algorithms (GA) to find a solution to the multiple sequence alignment. However, the nature of genetic algorithms makes the complexity extremely high due to the redundancy provided by the different operators. The aim of this paper is to study some proposed GA solutions provided for MSA and to compare them using some criteria which we believe any solution should comply with in matters of representativeness, closeness and original sequence invariance.
Science Publishing Corporation
2016-06-08
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/6079
10.14419/jacst.v5i2.6079
Journal of Advanced Computer Science & Technology; Vol. 5 No. 2 (2016); 28-33
2227-4332
10.14419/jacst.v5i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/6079/2288
Copyright (c) 2016 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/6181
2016-05-24T11:54:10Z
JACST:ART
Cybersecurity Snapshot: Google, Twitter, and Other Online Databases
S Rawal, Bharat
Eberhardt, Gabrielle
Lee, Jaein
Cyber-Attack
Availability
Vulnerability
Mandelbug
Heisenbug.
Every day, millions of attacks are carried out on the networks and computer systems. In recent years, these numbers have increased dramatically. All it requires is one success for a hacker to gain unauthorized access and data, but for administrators, it is a constant battle to protect what is rightfully theirs. In this paper, we look into how these attacks have increased, what the studies of various databases and reports say on how and what types of data are being breached, who is breaching them, and how they are breaching the systems. Also, we propose various unconventional ways to prevent these attacks from happening in the future. Furthermore, this paper lists the top 26 bug-fix times reported in the Google Security Research Project (GSRP). This article brings to light reoccurring cyber threats, challenges associated with these threats, and emerging trends in the domain of cyber security.
Science Publishing Corporation
2016-05-22
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/6181
10.14419/jacst.v5i1.6181
Journal of Advanced Computer Science & Technology; Vol. 5 No. 1 (2016); 14-22
2227-4332
10.14419/jacst.v5i1
eng
http://www.sciencepubco.com/index.php/JACST/article/view/6181/2254
Copyright (c) 2016 Journal of Advanced Computer Science & Technology
oai:ojs.pkp.sfu.ca:article/6217
2016-07-21T12:10:42Z
JACST:ART
Effect of subcooling and superheating on performance of a cascade refrigeration system with considering thermo- economic analysis and multi-objective optimization
Keshtkar, Mohammad Mehdi
Subcooling
Superheating
Cascade
Thermoeconomic Optimization
TOPSIS Method.
In present work, effect of degrees of subcooling and superheating based on thermoeconomic optimization is investigated in two stage-cascade refrigeration system (TS-CRS). At the first step, by using R717 and R744 as refrigerants, a thermoeconomic analysis is applied to TS-CRS. Based on results of the first section and using the genetic algorithm (GA) optimizer implemented in MATLAB, the optimum operative conditions of a specific TS-CRS is determined. Finally, based on the Pareto frontier obtained from the GA optimization, a decision-making strategy is then used to determine a final solution by TOPSIS method. Two single-objective optimization strategies (SOS), i.e. exergetic optimization and cost optimization, are applied on TS-CRS. The aim of the first strategy is to maximize the exergetic efficiency and the aim of the second strategy is minimizing the total annual cost of the system. The case study results show that, compared to the base design, the use of SOS for maximizing of exergetic efficiency can be increases the exergetic efficiency 94.5%. In addition, the use of the second SOS can decrease the total system cost by 11%. Using MOS compared to base design, exergetic efficiency and the total system cost can be increase by 99.1% and 28.6% respectively.
Science Publishing Corporation
2016-07-19
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
application/pdf
http://www.sciencepubco.com/index.php/JACST/article/view/6217
10.14419/jacst.v5i2.6217
Journal of Advanced Computer Science & Technology; Vol. 5 No. 2 (2016); 42-47
2227-4332
10.14419/jacst.v5i2
eng
http://www.sciencepubco.com/index.php/JACST/article/view/6217/2327
Copyright (c) 2016 Journal of Advanced Computer Science & Technology
958c5a160634b28506dd7771a9c180e6