Sari Branch, Islamic Azad University
Journal of Advances in Computer Research
2345-606X
2345-6078
3
4
2012
11
01
Modeling and Evaluation of Stochastic Discrete-Event
Systems with RayLang Formalism
1
16
EN
Ali
Khalili
School of Computer Engineering,
Iran University of Science and Technology, Tehran, Iran
Mohammad
Abdollahi Azgomi
School of Computer Engineering,
Iran University of Science and Technology, Tehran, Iran
azgomi@iust.ac.ir
In recent years, formal methods have been used as an important tool for performance evaluation and verification of a wide range of systems. In the view points of engineers and practitioners, however, there are still some major difficulties in using formal methods. In this paper, we introduce a new formal modeling language to fill the gaps between object-oriented programming languages (OOPLs) used by engineers and the formalisms used for evaluation and verification purposes. We propose the syntax and semantics of a new object-oriented modeling language for discrete-event systems called RayLang. We have designed the syntax of RayLang similar to OOPLs. In RayLang models, objects that are instantiated from classes, run concurrently and can communicate with each other by requesting services. Every object in RayLang models has some internal state variables and some service handlers for executing the requests of other objects. We have shown that Markovian RayLang models can be transformed into continuous-time Markov chains (CTMCs) and then can be solved by existing solution techniques. For modeling, discrete-event simulation and analytic solution of RayLang models, we have implemented these models in the PDETool framework.
Formal Modeling Language,Object-Oriented Modeling,Discrete-Event
Systems,Performance and Dependability Evaluation
http://jacr.iausari.ac.ir/article_2452.html
http://jacr.iausari.ac.ir/article_2452_d4701e8fb6bb2b1e5581f158eeb76476.pdf
Sari Branch, Islamic Azad University
Journal of Advances in Computer Research
2345-606X
2345-6078
3
4
2012
11
01
A Hybrid Genetic Algorithm for the Open Shop
Scheduling with Makespan and Total Completion Time
17
24
EN
Behnam
Barzegar
Department of Computer Engineering, Nowshahr Branch, Islamic Azad University, Nowshahr, Iran
barzegar.behnam@yahoo.com
Homayun
Motameni
Department of Computer Engineering, Sari Branch, Islamic Azad University, Sari, Iran
Ali
Khosrozadeh ghomi
Department of Computer Engineering, Science and Research Ayatollah Amoli Branch, Islamic Azad
University, Amol, Iran
Azadeh
Divsalar
Department of Computer Engineering, Sari Branch, Islamic Azad University, Sari, Iran
Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified machines so that makespan can be minimized. Open shop scheduling problem has very large and complex solution space and so is one of NP-Problems. Till now, different algorithms have been presented for open shop scheduling problem. In this paper, we have used combined genetics algorithm as a strategy for solving scheduling open shop problem and compared proposed algorithm with DGA algorithm. Results show that the proposed algorithm has better effectiveness than DGA algorithm.
Open shop,Genetics algorithm,scheduling
http://jacr.iausari.ac.ir/article_2458.html
http://jacr.iausari.ac.ir/article_2458_c41c473f232712a0d26c916e49b563d0.pdf
Sari Branch, Islamic Azad University
Journal of Advances in Computer Research
2345-606X
2345-6078
3
4
2012
11
01
Automatic Lane Extraction in Hemoglobin and Serum Protein Electrophoresis Using Image Processing
25
31
EN
Samira
Khodabakhshi
Department of computer engineering, Shahrood university of technology,
shahrood, Iran
s.khodabakhshi.s@gmail.com
Hamid
Hassanpour
Department of computer engineering, Shahrood university of technology,
shahrood, Iran
<em>Image analysis is an image processing technique that aims to extract features or information from images. Image analysis in medicine has a special place because is a basis for disease diagnosis for physicians. Electrophoresis is a laboratory separating technique. Electrophoresis images are created during the electrophoresis process. Serum protein and hemoglobin electrophoresis test are the most common test in Laboratory. Each lane represents a patient's blood sample. Lane extraction is one of the most important steps in analyzing of electrophoresis images. This paper, proposed automatic lane extraction method based on Otsu thresholding and Savitzky-Golay smoothing. The results show the proposed method has 98% accurate.</em><em></em>
electrophoresis,Lane Extraction,Otsu,Savitzky-Golay
http://jacr.iausari.ac.ir/article_2462.html
http://jacr.iausari.ac.ir/article_2462_382bdc47cf536b57f2fcc2511cb390ef.pdf
Sari Branch, Islamic Azad University
Journal of Advances in Computer Research
2345-606X
2345-6078
3
4
2012
11
01
Solving Fuzzy Equations Using Neural Nets with a New Learning Algorithm
33
45
EN
Ahmad
Jafarian
Department of Mathematics, Urmia Branch, Islamic Azad University, Urmia, Iran
Safa
Measoomy nia
Department of Mathematics, Urmia Branch, Islamic Azad University, Urmia, Iran
Raheleh
Jafari
Department of Mathematics, science and research Branch, Islamic Azad University, Arak, Iran
<em>Artificial neural networks have the advantages such as learning, adaptation, fault-tolerance, parallelism and generalization. This paper mainly intends to offer a novel method for finding a solution of a fuzzy equation that supposedly has a real solution. For this scope, we applied an architecture of fuzzy neural networks such that the corresponding connection weights are real numbers. The suggested neural net can adjust the weights using a learning algorithm that based on the gradient descent method. The proposed method is illustrated by several examples with computer simulations.</em><em></em>
Fuzzy equations,Fuzzy feed-forward neural network (FFNN),Cost function,Learning algorithm
http://jacr.iausari.ac.ir/article_2489.html
http://jacr.iausari.ac.ir/article_2489_1933bd5e13b82ae33fb6bd1fec3a277e.pdf
Sari Branch, Islamic Azad University
Journal of Advances in Computer Research
2345-606X
2345-6078
3
4
2012
11
01
Computing of the Burnt Forest Regions Area Using Digital Image Processing
47
54
EN
Hamidreza
Gorgani Firouzjaee
Department of Information Technology, University Of Guilan, Rasht, Iran
gorgani_hamidreza@yahoo.com
Hamid
Hassanpour
School of Computer Engineering & Information Technology, Shahrood University of Technology, Shahrood, Iran
Asadollah
Shahbahrami
Department of Computer Engineering, University Of Guilan, Rasht, Iran
<em>At present, there is no conventional scientific method to evaluate the area of the burnt regions of forests and in this field, the related organizations use different methods and variables. Also, the speed in performing the processes of area computing and damage evaluation, especially in the extensive damaged forest regions is very slow; consequently, the expression of results takes more time. Now, one of the most important parameters to evaluate the forests fire damages is computing the area of the burnt forest regions. In this research, an aerial digital image from a forest region after fire occurrence is used and the primary area of the burnt region is calculated in two methods of; integration and interconnected components extraction, by using image processing techniques. Also, in order to estimate the real area, a coefficient "m" is calculated to obtain real area based an measuring the forest land surface by exerting the imaging scale on the primary area. The methods which are introduced to calculate real area of the burnt regions, are dependent on some secondary tools such as aerial camera and special plane, but in the extensive forest regions damaged by fire, they cause to decrease in the evaluation costs and faster notification of the results.</em>
Forest fire,image processing,Real Area,the Burnt Regions
http://jacr.iausari.ac.ir/article_2505.html
http://jacr.iausari.ac.ir/article_2505_f35633bb05bbf8a0e701e9bc56420042.pdf
Sari Branch, Islamic Azad University
Journal of Advances in Computer Research
2345-606X
2345-6078
3
4
2012
11
01
An Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery
55
66
EN
Majid
Yousefikhoshbakht
Mathematics and Computer Science, Young Researchers club, Hamedan Branch, Islamic Azad University, Hamedan, Iran
khoshbakht@iauh.ac.ir
Farzad
Didehvar
Department of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran
Farhad
Rahmati
Department of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran
<em>The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VRPSPD cannot be solved by exact solution methodologies within acceptable computational time. Our interest was therefore focused on meta-heuristic solution approaches. For this reason, a modified tabu search (PA) is proposed for solving the VRPSPD in this paper. tComputational results on several standard instances of VRPSPD show the efficiency of the PA compared with other meta-heuristic algorithms.</em>
Vehicle routing problem,Tabu Search,NP-hard Problems,Simultaneous Pickup and Delivery
http://jacr.iausari.ac.ir/article_2506.html
http://jacr.iausari.ac.ir/article_2506_56653b19910b3e1a0bcf2aa8122df82c.pdf
Sari Branch, Islamic Azad University
Journal of Advances in Computer Research
2345-606X
2345-6078
3
4
2012
11
01
An Improvement in WRP Block Replacement Policy with Reviewing and Solving its Problems
67
75
EN
Davood
Akbari Bengar
Department of Computer Sciences, Science and Research Branch, Islamic Azad University, Khouzestan, Iran
akbari.b1980@gmail.com
Hoshang
Jazayeri Rad
Department of Computer Sciences, Mahshahr Branch, Islamic Azad University, Mahshahr, Iran
Golnaz
Berenjian
Tabari Institute of Higher Education
<em>One of the most important items for better file system performance is efficient buffering of disk blocks in main memory. Efficient buffering helps to reduce the widespeed gap between main memory and hard disks. In this buffering system, the block replacement policy is one of the most important design decisions that determines which disk block should be replaced when the buffer is full. To overcome the problem of performance gap between hard disks and main memory, there have been lots of proposed policies. Most of these policies are the development of the Least-Recently-Used (LRU) and Least-Frequently-Used (LFU) models. WRP(Weighting Replacement Policy) is a replacement algorithm that its performance is better than the LRU and LFU. The most advantage of this model is it’s similarity to both LRU and LFU, which means it has the benefits of both. This research proposes a new block replacement Policy namely, DWRP (Developed Weighting Replacement Policy) which solves the problems of WRPalgorithm and retains its advantages.</em><em></em>
Block replacement policy,System performance,Main memory,Buffering system,Speed gap
http://jacr.iausari.ac.ir/article_2507.html
http://jacr.iausari.ac.ir/article_2507_6537fae160095b8d37f5d50f6750e659.pdf
Sari Branch, Islamic Azad University
Journal of Advances in Computer Research
2345-606X
2345-6078
3
4
2012
11
01
Energy Efficient Routing in Mobile Ad Hoc Networks by Using Honey Bee Mating Optimization
77
87
EN
Sajjad
Jahanbakhsh Gudakahriz
Department of Computer Engineering, Germi Branch, Islamic Azad University, Germi, Iran
sa_jahanbakhsh@yahoo.com
SHahram
Jamali
Computer Engineering Department, University of Mohaghegh Ardabili, Ardabil, Iran
Mina
Vajed Khiavi
Young Researchers Club, Ardabil Branch, Islamic Azad University, Ardabil, Iran
<em>Mobile Ad hoc networks (MANETs) are composed of mobile stations communicating through wireless links, without any fixed backbone support. In these networks, limited power energy supply, and frequent topology changes caused by node mobility, makes their routing a challenging problem. TORA is one of the routing protocols that successfully copes with the nodes’ mobility side effects, but it doesn’t take into the nodes’ energy level. To solve this problem, this paper employs Honey Bee Mating Optimization (HBMO) principles to present a new routing protocol, called HBMO-TORA algorithm. Simulation results show that HBMO-TORA outperforms TORA in terms of packet delivery ratio, network life time, system life time and end-to-end delay.</em><em></em>
MANET,TORA,HBMO,Energy-aware,Routing
http://jacr.iausari.ac.ir/article_2508.html
http://jacr.iausari.ac.ir/article_2508_0af30e855d4777b9fca381d20eb4765d.pdf