Abstract: Economic dispatch problem is an optimization problem where objective function is highly non linear, non-convex, non-differentiable and may have multiple local minima. Therefore, classical optimization methods may not converge or get trapped to any local minima. This paper presents a comparative study of four different evolutionary algorithms i.e. genetic algorithm, bacteria foraging optimization, ant colony optimization and particle swarm optimization for solving the economic dispatch problem. All the methods are tested on IEEE 30 bus test system. Simulation results are presented to show the comparative performance of these methods.
Abstract: Optimization plays an important role in most real
world applications that support decision makers to take the right
decision regarding the strategic directions and operations of the
system they manage. Solutions for traffic management and traffic
congestion problems are considered major problems that most
decision making authorities for cities around the world are looking
for. This review paper gives a full description of the traffic problem
as part of the transportation planning process and present a view as a
framework of urban transportation system analysis where the core of
the system is a transportation network equilibrium model that is
based on optimization techniques and that can also be used for
evaluating an alternative solution or a combination of alternative
solutions for the traffic congestion. Different transportation network
equilibrium models are reviewed from the sequential approach to the
multiclass combining trip generation, trip distribution, modal split,
trip assignment and departure time model. A GIS-Based intelligent
decision support system framework for urban transportation system
analysis is suggested for implementation where the selection of
optimized alternative solutions, single or packages, will be based on
an intelligent agent rather than human being which would lead to
reduction in time, cost and the elimination of the difficulty, by
human being, for finding the best solution to the traffic congestion
problem.
Abstract: Real-time object tracking is a problem which involves extraction of critical information from complex and uncertain imagedata. In this paper, we present a comprehensive methodology to design an artificial neural network (ANN) for a real-time object tracking application. The object, which is tracked for the purpose of demonstration, is a specific airplane. However, the proposed ANN can be trained to track any other object of interest. The ANN has been simulated and tested on the training and testing datasets, as well as on a real-time streaming video. The tracking error is analyzed with post-regression analysis tool, which finds the correlation among the calculated coordinates and the correct coordinates of the object in the image. The encouraging results from the computer simulation and analysis show that the proposed ANN architecture is a good candidate solution to a real-time object tracking problem.
Abstract: Linear approximation of point spread function (PSF) is a new method for determining subpixel translations between images. The problem with the actual algorithm is the inability of determining translations larger than 1 pixel. In this paper a multiresolution technique is proposed to deal with the problem. Its performance is evaluated by comparison with two other well known registration method. In the proposed technique the images are downsampled in order to have a wider view. Progressively decreasing the downsampling rate up to the initial resolution and using linear approximation technique at each step, the algorithm is able to determine translations of several pixels in subpixel levels.
Abstract: The scientific community has invested a great deal of effort in the fields of discrete wavelet transform in the last few decades. Discrete wavelet transform (DWT) associated with the vector quantization has been proved to be a very useful tool for the compression of image. However, the DWT is very computationally intensive process requiring innovative and computationally efficient method to obtain the image compression. The concurrent transformation of the image can be an important solution to this problem. This paper proposes a model of concurrent DWT for image compression. Additionally, the formal verification of the model has also been performed. Here the Symbolic Model Verifier (SMV) has been used as the formal verification tool. The system has been modeled in SMV and some properties have been verified formally.
Abstract: Acoustic Imaging based sound localization using microphone
array is a challenging task in digital-signal processing.
Discrete Fourier transform (DFT) based near-field acoustical holography
(NAH) is an important acoustical technique for sound source
localization and provide an efficient solution to the ill-posed problem.
However, in practice, due to the usage of small curtailed aperture
and its consequence of significant spectral leakage, the DFT could
not reconstruct the active-region-of-sound (AROS) effectively, especially
near the edges of aperture. In this paper, we emphasize the
fundamental problems of DFT-based NAH, provide a solution to
spectral leakage effect by the extrapolation based on linear predictive
coding and 2D Tukey windowing. This approach has been tested to
localize the single and multi-point sound sources. We observe that
incorporating extrapolation technique increases the spatial resolution,
localization accuracy and reduces spectral leakage when small curtail
aperture with a lower number of sensors accounts.
Abstract: This article proposes a novel Pareto-based multiobjective
meta-heuristic algorithm named non-dominated ranking
genetic algorithm (NRGA) to solve multi-facility location-allocation
problem. In NRGA, a fitness value representing rank is assigned to
each individual of the population. Moreover, two features ranked
based roulette wheel selection including select the fronts and choose
solutions from the fronts, are utilized. The proposed solving
methodology is validated using several examples taken from the
specialized literature. The performance of our approach shows that
NRGA algorithm is able to generate true and well distributed Pareto
optimal solutions.
Abstract: In the last decades, the problem of perforation
damage has been considered as the major factor for the
reduction of oil productivity. Underbalance perforation is
considered as one of the best means to minimize or overcome
this problem. By maintaining wellbore pressure lower than
formation pressure, perforation damage could be minimize or
eliminated. This can be achieved by the use of nontraditional
lightweight completion fluid. This paper presents the effect of
natural clay in formulating nontraditional completion fluid to
ensure successful perforation job and increase of production
rate. Natural clay is used as homogenizing agent to create a
stable and non-damaging low-density completion fluid.
Results indicate that the addition of natural clay dramatically
increase the stability of the final fluids. In addition, field test
has shown that the application of nontraditional completion
fluid increases oil production by three folds.
Abstract: With the development of technology, the growing
trend of fast and safe passenger transport, air pollution, traffic
congestion, increase in problems such as the increasing population
and the high cost of private vehicle usage made many cities around
the world with a population of more or less, start to build rail systems
as a means of urban transport in order to ensure the economic and
environmental sustainability and more efficient use of land in the
city. The implementation phase of rail systems costs much more than
other public transport systems. However, social and economic returns
in the long term made these systems the most popular investment tool
for planned and developing cities.
In our country, the purpose, goals and policies of transportation
plans are away from integrity, and the problems are not clearly
detected. Also, not defined and incomplete assessment of
transportation systems and insufficient financial analysis are the most
important cause of failure. Rail systems and other transportation
systems to be addressed as a whole is seen as the main factor in
increasing efficiency in applications that are not integrated yet in our
country to come to this point has led to the problem.
Abstract: A lot of Scientific and Engineering problems require the solution of large systems of linear equations of the form bAx in an effective manner. LU-Decomposition offers good choices for solving this problem. Our approach is to find the lower bound of processing elements needed for this purpose. Here is used the so called Omega calculus, as a computational method for solving problems via their corresponding Diophantine relation. From the corresponding algorithm is formed a system of linear diophantine equalities using the domain of computation which is given by the set of lattice points inside the polyhedron. Then is run the Mathematica program DiophantineGF.m. This program calculates the generating function from which is possible to find the number of solutions to the system of Diophantine equalities, which in fact gives the lower bound for the number of processors needed for the corresponding algorithm. There is given a mathematical explanation of the problem as well. Keywordsgenerating function, lattice points in polyhedron, lower bound of processor elements, system of Diophantine equationsand : calculus.
Abstract: This article is based on the technique which is called
Discrete Parameter Tracking (DPT). First introduced by A. A. Azab
[8] which is applicable for less order reference model. The order of
the reference model is (n-l) and n is the number of the adjustable
parameters in the physical plant.
The technique utilizes a modified gradient method [9] where the
knowledge of the exact order of the nonadaptive system is not
required, so, as to eliminate the identification problem. The
applicability of the mentioned technique (DPT) was examined
through the solution of several problems.
This article introduces the solution of a third order system with
three adjustable parameters, controlled according to second order
reference model. The adjustable parameters have great initial error
which represent condition.
Computer simulations for the solution and analysis are provided
to demonstrate the simplicity and feasibility of the technique.
Abstract: The Connection Admission Control (CAC) problem is formulated in this paper as a discrete time optimal control problem. The control variables account for the acceptance/ rejection of new connections and forced dropping of in-progress connections. These variables are constrained to meet suitable conditions which account for the QoS requirements (Link Availability, Blocking Probability, Dropping Probability). The performance index evaluates the total throughput. At each discrete time, the problem is solved as an integer-valued linear programming one. The proposed procedure was successfully tested against suitably simulated data.
Abstract: Inter-symbol interference if not taken care off may cause severe error at the receiver and the detection of signal becomes difficult. An adaptive equalizer employing Recursive Least Squares algorithm can be a good compensation for the ISI problem. In this paper performance of communication link in presence of Least Mean Square and Recursive Least Squares equalizer algorithm is analyzed. A Model of communication system having Quadrature amplitude modulation and Rician fading channel is implemented using MATLAB communication block set. Bit error rate and number of errors is evaluated for RLS and LMS equalizer algorithm, due to change in Signal to Noise Ratio (SNR) and fading component gain in Rician fading Channel.
Abstract: This paper presents the identification of the impact
force acting on a simply supported beam. The force identification is
an inverse problem in which the measured response of the structure is
used to determine the applied force. The identification problem is
formulated as an optimization problem and the genetic algorithm is
utilized to solve the optimization problem. The objective function is
calculated on the difference between analytical and measured
responses and the decision variables are the location and magnitude
of the applied force. The results from simulation show the
effectiveness of the approach and its robustness vs. the measurement
noise and sensor location.
Abstract: Number of breakdowns experienced by a machinery is a highly under-dispersed count random variable and its value can be attributed to the factors related to the mechanical input and output of that machinery. Analyzing such under-dispersed count observations as a function of the explanatory factors has been a challenging problem. In this paper, we aim at estimating the effects of various factors on the number of breakdowns experienced by a passenger car based on a study performed in Mauritius over a year. We remark that the number of passenger car breakdowns is highly under-dispersed. These data are therefore modelled and analyzed using Com-Poisson regression model. We use quasi-likelihood estimation approach to estimate the parameters of the model. Under-dispersion parameter is estimated to be 2.14 justifying the appropriateness of Com-Poisson distribution in modelling under-dispersed count responses recorded in this study.
Abstract: In distributed resource allocation a set of agents must assign their resources to a set of tasks. This problem arises in many real-world domains such as distributed sensor networks, disaster rescue, hospital scheduling and others. Despite the variety of approaches proposed for distributed resource allocation, a systematic formalization of the problem, explaining the different sources of difficulties, and a formal explanation of the strengths and limitations of key approaches is missing. We take a step towards this goal by using a formalization of distributed resource allocation that represents both dynamic and distributed aspects of the problem. In this paper we present a new idea for target tracking in sensor networks and compare it with previous approaches. The central contribution of the paper is a generalized mapping from distributed resource allocation to DDCSP. This mapping is proven to correctly perform resource allocation problems of specific difficulty. This theoretical result is verified in practice by a simulation on a realworld distributed sensor network.
Abstract: SoftBoost is a recently presented boosting algorithm,
which trades off the size of achieved classification margin and
generalization performance. This paper presents a performance
evaluation of SoftBoost algorithm on the generic object recognition
problem. An appearance-based generic object recognition
model is used. The evaluation experiments are performed using
a difficult object recognition benchmark. An assessment with respect
to different degrees of label noise as well as a comparison to
the well known AdaBoost algorithm is performed. The obtained
results reveal that SoftBoost is encouraged to be used in cases
when the training data is known to have a high degree of noise.
Otherwise, using Adaboost can achieve better performance.
Abstract: Traffic Management and Information Systems, which rely on a system of sensors, aim to describe in real-time traffic in urban areas using a set of parameters and estimating them. Though the state of the art focuses on data analysis, little is done in the sense of prediction. In this paper, we describe a machine learning system for traffic flow management and control for a prediction of traffic flow problem. This new algorithm is obtained by combining Random Forests algorithm into Adaboost algorithm as a weak learner. We show that our algorithm performs relatively well on real data, and enables, according to the Traffic Flow Evaluation model, to estimate and predict whether there is congestion or not at a given time on road intersections.
Abstract: The group mutual exclusion (GME) problem is an
interesting generalization of the mutual exclusion problem. In the
group mutual exclusion, multiple processes can enter a critical
section simultaneously if they belong to the same group. In the
extended group mutual exclusion, each process is a member of
multiple groups at the same time. As a result, after the process by
selecting a group enter critical section, other processes can select the
same group with its belonging group and can enter critical section at
the moment, so that it avoids their unnecessary blocking. This paper
presents a quorum-based distributed algorithm for the extended
group mutual exclusion problem. The message complexity of our
algorithm is O(4Q ) in the best case and O(5Q) in the worst case,
where Q is a quorum size.
Abstract: Perspective of food security in 21 century showed
shortage of food that production is faced to vital problem. Food
security strategy is applied longtime method to assess required food.
Meanwhile, nanotechnology revolution changes the world face.
Nanotechnology is adequate method utilize of its characteristics to
decrease environmental problems and possible further access to food
for small farmers. This article will show impact of production and
adoption of nanocrops on food security. Population is researchers of
agricultural research center of Esfahan province. The results of study
show that there was a relationship between uses, conversion,
distribution, and production of nanocrops, operative human
resources, operative circumstance, and constrains of usage of
nanocrops and food security. Multivariate regression analysis by
enter model shows that operative circumstance, use, production and
constrains of usage of nanocrops had positive impact on food security
and they determine in four steps 20 percent of it.