Abstract: One of the major problems in genomic field is to perform sequence comparison on DNA and protein sequences. Executing sequence comparison on the DNA and protein data is a computationally intensive task. Sequence comparison is the basic step for all algorithms in protein sequences similarity. Parallel computing is an attractive solution to provide the computational power needed to speedup the lengthy process of the sequence comparison. Our main research is to enhance the protein sequence algorithm using dynamic programming method. In our approach, we parallelize the dynamic programming algorithm using multithreaded program to perform the sequence comparison and also developed a distributed protein database among many PCs using Remote Method Interface (RMI). As a result, we showed how different sizes of protein sequences data and computation of scoring matrix of these protein sequence on different number of processors affected the processing time and speed, as oppose to sequential processing.
Abstract: Several optimization algorithms specifically applied to
the problem of Operation Planning of Hydrothermal Power Systems
have been developed and are used. Although providing solutions to
various problems encountered, these algorithms have some
weaknesses, difficulties in convergence, simplification of the original
formulation of the problem, or owing to the complexity of the
objective function. Thus, this paper presents the development of a
computational tool for solving optimization problem identified and to
provide the User an easy handling. Adopted as intelligent
optimization technique, Genetic Algorithms and programming
language Java. First made the modeling of the chromosomes, then
implemented the function assessment of the problem and the
operators involved, and finally the drafting of the graphical interfaces
for access to the User. The program has managed to relate a coherent
performance in problem resolution without the need for
simplification of the calculations together with the ease of
manipulating the parameters of simulation and visualization of output
results.
Abstract: The Cluster Dimension of a network is defined as, which is the minimum cardinality of a subset S of the set of nodes having the property that for any two distinct nodes x and y, there exist the node Si, s2 (need not be distinct) in S such that ld(x,s1) — d(y, s1)1 > 1 and d(x,s2) < d(x,$) for all s E S — {s2}. In this paper, strictly non overlap¬ping clusters are constructed. The concept of LandMarks for Unique Addressing and Clustering (LMUAC) routing scheme is developed. With the help of LMUAC routing scheme, It is shown that path length (upper bound)PLN,d < PLD, Maximum memory space requirement for the networkMSLmuAc(Az) < MSEmuAc < MSH3L < MSric and Maximum Link utilization factor MLLMUAC(i=3) < MLLMUAC(z03) < M Lc
Abstract: In order to monitor for traffic traversal, sensors can be
deployed to perform collaborative target detection. Such a sensor
network achieves a certain level of detection performance with the
associated costs of deployment and routing protocol. This paper
addresses these two points of sensor deployment and routing algorithm
in the situation where the absolute quantity of sensors or total energy
becomes insufficient. This discussion on the best deployment system
concluded that two kinds of deployments; Normal and Power law
distributions, show 6 and 3 times longer than Random distribution in
the duration of coverage, respectively. The other discussion on routing
algorithm to achieve good performance in each deployment system
was also addressed. This discussion concluded that, in place of the
traditional algorithm, a new algorithm can extend the time of coverage
duration by 4 times in a Normal distribution, and in the circumstance
where every deployed sensor operates as a binary model.
Abstract: Most of the collision warning systems currently
available in the automotive market are mainly designed to warn
against imminent rear-end and lane-changing collisions. No collision
warning system is commercially available to warn against imminent
turning collisions at intersections, especially for left-turn collisions
when a driver attempts to make a left-turn at either a signalized or
non-signalized intersection, conflicting with the path of other
approaching vehicles traveling on the opposite-direction traffic
stream. One of the major factors that lead to left-turn collisions is the
human error and misjudgment of the driver of the turning vehicle
when perceiving the speed and acceleration of other vehicles
traveling on the opposite-direction traffic stream; therefore, using a
properly-designed collision warning system will likely reduce, or
even eliminate, this type of collisions by reducing human error. This
paper introduces perceptual framework for a proposed collision
warning system that can detect imminent left-turn collisions at
intersections. The system utilizes a commercially-available detection
sensor (either a radar sensor or a laser detector) to detect approaching
vehicles traveling on the opposite-direction traffic stream and
calculate their speeds and acceleration rates to estimate the time-tocollision
and compare that time to the time required for the turning
vehicle to clear the intersection. When calculating the time required
for the turning vehicle to clear the intersection, consideration is given
to the perception-reaction time of the driver of the turning vehicle,
which is the time required by the driver to perceive the message
given by the warning system and react to it by engaging the throttle.
A regression model was developed to estimate perception-reaction
time based on age and gender of the driver of the host vehicle.
Desired acceleration rate selected by the driver of the turning vehicle,
when making the left-turn movement, is another human factor that is
considered by the system. Another regression model was developed
to estimate the acceleration rate selected by the driver of the turning
vehicle based on driver-s age and gender as well as on the location
and speed of the nearest approaching vehicle along with the
maximum acceleration rate provided by the mechanical
characteristics of the turning vehicle. By comparing time-to-collision
with the time required for the turning vehicle to clear the intersection,
the system displays a message to the driver of the turning vehicle
when departure is safe. An application example is provided to
illustrate the logic algorithm of the proposed system.
Abstract: The Resource-Constrained Project Scheduling
Problem (RCPSP) is concerned with single-item or small batch
production where limited resources have to be allocated to dependent
activities over time. Over the past few decades, a lot of work has
been made with the use of optimal solution procedures for this basic
problem type and its extensions. Brucker and Knust[1] discuss, how
timetabling problems can be modeled as a RCPSP. Authors discuss
high school timetabling and university course timetabling problem as
an example. We have formulated two mathematical formulations of
course timetabling problem in a new way which are the prototype of
single-mode RCPSP. Our focus is to show, how course timetabling
problem can be transformed into RCPSP. We solve this
transformation model with genetic algorithm.
Abstract: Supply chain consists of all stages involved, directly
or indirectly, includes all functions involved in fulfilling a customer
demand. In two stage transportation supply chain problem,
transportation costs are of a significant proportion of final product
costs. It is often crucial for successful decisions making approaches
in two stage supply chain to explicit account for non-linear
transportation costs. In this paper, deterministic demand and finite
supply of products was considered. The optimized distribution level
and the routing structure from the manufacturing plants to the
distribution centres and to the end customers is determined using
developed mathematical model and solved by proposed particle
swarm optimization based genetic algorithm. Numerical analysis of
the case study is carried out to validate the model.
Abstract: In the modern manufacturing systems, the use of
thermal cutting techniques using oxyfuel, plasma and laser have
become indispensable for the shape forming of high quality complex
components; however, the conventional chip removal production
techniques still have its widespread space in the manufacturing
industry. Both these types of machining operations require the
positioning of end effector tool at the edge where the cutting process
commences. This repositioning of the cutting tool in every machining
operation is repeated several times and is termed as non-productive
time or airtime motion. Minimization of this non-productive
machining time plays an important role in mass production with high
speed machining. As, the tool moves from one region to the other by
rapid movement and visits a meticulous region once in the whole
operation, hence the non-productive time can be minimized by
synchronizing the tool movements. In this work, this problem is
being formulated as a general travelling salesman problem (TSP) and
a genetic algorithm approach has been applied to solve the same. For
improving the efficiency of the algorithm, the GA has been
hybridized with a noble special heuristic and simulating annealing
(SA). In the present work a novel heuristic in the combination of GA
has been developed for synchronization of toolpath movements
during repositioning of the tool. A comparative analysis of new Meta
heuristic techniques with simple genetic algorithm has been
performed. The proposed metaheuristic approach shows better
performance than simple genetic algorithm for minimization of nonproductive
toolpath length. Also, the results obtained with the help of
hybrid simulated annealing genetic algorithm (HSAGA) are also
found better than the results using simple genetic algorithm only.
Abstract: A real time image-guided electroplating system is
proposed in this paper. Unlike previous electroplating systems, instead
of using the intermittent mode to electroplate 500um long copper
specimen, a CCD camera and a motion controller are used to adjust
anode-cathode distance to obtain better results. Since the image of the
gap distance is highly deteriorated due to complex chemical-electrical
operation inside the electrolyte, to determine the gap distance, an
image processing algorithm is developed and mainly based on the
entropy and energy values. In addition, the color and incidence
direction of light source are also discussed to help the image process in
this paper. From the experiment results, the specimens created by the
proposed system show better structure, better uniformity and better
finishing surface compared to those by previous intermittent
electroplating setup.
Abstract: In this paper we present an extension to Vision Based
LRTA* (VLRTA*) known as Vision Based Moving Target Search
(VMTS) for capturing unknown moving target in unknown territory
with randomly generated obstacles. Target position is unknown to the
agents and they cannot predict its position using any probability
method. Agents have omni directional vision but can see in one
direction at some point in time. Agent-s vision will be blocked by the
obstacles in the search space so agent can not see through the
obstacles. Proposed algorithm is evaluated on large number of
scenarios. Scenarios include grids of sizes from 10x10 to 100x100.
Grids had obstacles randomly placed, occupying 0% to 50%, in
increments of 10%, of the search space. Experiments used 2 to 9
agents for each randomly generated maze with same obstacle ratio.
Observed results suggests that VMTS is effective in locate target
time, solution quality and virtual target. In addition, VMTS becomes
more efficient if the number of agents is increased with proportion to
obstacle ratio.
Abstract: In intensity modulated radiation therapy (IMRT)
treatment planning, beam angles are usually preselected on the basis of
experience and intuition. Therefore, getting an appropriate beam
configuration needs a very long time. Based on the present situation,
the paper puts forward beam orientation optimization using ant colony
optimization (ACO). We use ant colony optimization to select the
beam configurations, after getting the beam configuration using
Conjugate Gradient (CG) algorithm to optimize the intensity profiles.
Combining with the information of the effect of pencil beam, we can
get the global optimal solution accelerating. In order to verify the
feasibility of the presented method, a simulated and clinical case was
tested, compared with dose-volume histogram and isodose line
between target area and organ at risk. The results showed that the
effect was improved after optimizing beam configurations. The
optimization approach could make treatment planning meet clinical
requirements more efficiently, so it had extensive application
perspective.
Abstract: With the widespread growth of applications of
Wireless Sensor Networks (WSNs), the need for reliable security
mechanisms these networks has increased manifold. Many security
solutions have been proposed in the domain of WSN so far. These
solutions are usually based on well-known cryptographic
algorithms.
In this paper, we have made an effort to survey well known
security issues in WSNs and study the behavior of WSN nodes that
perform public key cryptographic operations. We evaluate time
and power consumption of public key cryptography algorithm for
signature and key management by simulation.
Abstract: In this paper, we present a novel objective nonreference
performance assessment algorithm for image fusion. It takes
into account local measurements to estimate how well the important
information in the source images is represented by the fused image.
The metric is based on the Universal Image Quality Index and uses
the similarity between blocks of pixels in the input images and the
fused image as the weighting factors for the metrics. Experimental
results confirm that the values of the proposed metrics correlate well
with the subjective quality of the fused images, giving a significant
improvement over standard measures based on mean squared error
and mutual information.
Abstract: Transmission network expansion planning (TNEP) is an important component of power system planning that its task is to minimize the network construction and operational cost while satisfying the demand increasing, imposed technical and economic conditions. Up till now, various methods have been presented to solve the static transmission network expansion planning (STNEP) problem. But in all of these methods, the lines adequacy rate has not been studied after the planning horizon, i.e. when the expanded network misses its adequacy and needs to be expanded again. In this paper, in order to take transmission lines condition after expansion in to account from the line loading view point, the adequacy of transmission network is considered for solution of STNEP problem. To obtain optimal network arrangement, a decimal codification genetic algorithm (DCGA) is being used for minimizing the network construction and operational cost. The effectiveness of the proposed idea is tested on the Garver's six-bus network. The results evaluation reveals that the annual worth of network adequacy has a considerable effect on the network arrangement. In addition, the obtained network, based on the DCGA, has lower investment cost and higher adequacy rate. Thus, the network satisfies the requirements of delivering electric power more safely and reliably to load centers.
Abstract: In this paper we used data mining techniques to
identify outlier patients who are using large amount of drugs over a
long period of time. Any healthcare or health insurance system
should deal with the quantities of drugs utilized by chronic diseases
patients. In Kingdom of Bahrain, about 20% of health budget is spent
on medications. For the managers of healthcare systems, there is no
enough information about the ways of drug utilization by chronic
diseases patients, is there any misuse or is there outliers patients. In
this work, which has been done in cooperation with information
department in the Bahrain Defence Force hospital; we select the data
for Cardiac patients in the period starting from 1/1/2008 to
December 31/12/2008 to be the data for the model in this paper. We
used three techniques for finding the drug utilization for cardiac
patients. First we applied a clustering technique, followed by
measuring of clustering validity, and finally we applied a decision
tree as classification algorithm. The clustering results is divided into
three clusters according to the drug utilization, for 1603 patients, who
received 15,806 prescriptions during this period can be partitioned
into three groups, where 23 patients (2.59%) who received 1316
prescriptions (8.32%) are classified to be outliers. The classification
algorithm shows that the use of average drug utilization and the age,
and the gender of the patient can be considered to be the main
predictive factors in the induced model.
Abstract: The Algorithm 2 for a n-link manipulator movement amidst arbitrary unknown static obstacles for a case when a sensor system supplies information about local neighborhoods of different points in the configuration space is presented. The Algorithm 2 guarantees the reaching of a target position in a finite number of steps. The Algorithm 2 is reduced to a finite number of calls of a subroutine for planning a trajectory in the presence of known forbidden states. The polynomial approximation algorithm which is used as the subroutine is presented. The results of the Algorithm2 implementation are given.
Abstract: Computation of facility location problem for every
location in the country is not easy simultaneously. Solving the
problem is described by using cluster computing. A technique is to
design parallel algorithm by using local search with single swap
method in order to solve that problem on clusters. Parallel
implementation is done by the use of portable parallel programming,
Message Passing Interface (MPI), on Microsoft Windows Compute
Cluster. In this paper, it presents the algorithm that used local search
with single swap method and implementation of the system of a
facility to be opened by using MPI on cluster. If large datasets are
considered, the process of calculating a reasonable cost for a facility
becomes time consuming. The result shows parallel computation of
facility location problem on cluster speedups and scales well as
problem size increases.
Abstract: In this paper we present a new method for over-height
vehicle detection in low headroom streets and highways using digital
video possessing. The accuracy and the lower price comparing to
present detectors like laser radars and the capability of providing
extra information like speed and height measurement make this
method more reliable and efficient. In this algorithm the features are
selected and tracked using KLT algorithm. A blob extraction
algorithm is also applied using background estimation and
subtraction. Then the world coordinates of features that are inside the
blobs are estimated using a noble calibration method. As, the heights
of the features are calculated, we apply a threshold to select overheight
features and eliminate others. The over-height features are
segmented using some association criteria and grouped using an
undirected graph. Then they are tracked through sequential frames.
The obtained groups refer to over-height vehicles in a scene.
Abstract: Ant Colony Algorithms have been applied to difficult
combinatorial optimization problems such as the travelling salesman
problem and the quadratic assignment problem. In this paper gridbased
and random-based ant colony algorithms are proposed for
automatic 3D hose routing and their pros and cons are discussed. The
algorithm uses the tessellated format for the obstacles and the
generated hoses in order to detect collisions. The representation of
obstacles and hoses in the tessellated format greatly helps the
algorithm towards handling free-form objects and speeds up
computation. The performance of algorithm has been tested on a
number of 3D models.
Abstract: Designing, implementing, and debugging concurrency
control algorithms in a real system is a complex, tedious, and errorprone
process. Further, understanding concurrency control
algorithms and distributed computations is itself a difficult task.
Visualization can help with both of these problems. Thus, we have
developed an exploratory environment in which people can prototype
and test various versions of concurrency control algorithms, study
and debug distributed computations, and view performance statistics
of distributed systems. In this paper, we describe the exploratory
environment and show how it can be used to explore concurrency
control algorithms for the interactive steering of distributed
computations.