Abstract: This paper presents the prediction of kidney
dysfunction using different neural network (NN) approaches. Self
organization Maps (SOM), Probabilistic Neural Network (PNN) and
Multi Layer Perceptron Neural Network (MLPNN) trained with Back
Propagation Algorithm (BPA) are used in this study. Six hundred and
sixty three sets of analytical laboratory tests have been collected from
one of the private clinical laboratories in Baghdad. For each subject,
Serum urea and Serum creatinin levels have been analyzed and tested
by using clinical laboratory measurements. The collected urea and
cretinine levels are then used as inputs to the three NN models in
which the training process is done by different neural approaches.
SOM which is a class of unsupervised network whereas PNN and
BPNN are considered as class of supervised networks. These
networks are used as a classifier to predict whether kidney is normal
or it will have a dysfunction. The accuracy of prediction, sensitivity
and specificity were found for each type of the proposed networks
.We conclude that PNN gives faster and more accurate prediction of
kidney dysfunction and it works as promising tool for predicting of
routine kidney dysfunction from the clinical laboratory data.
Abstract: Color image segmentation can be considered as a
cluster procedure in feature space. k-means and its adaptive
version, i.e. competitive learning approach are powerful tools
for data clustering. But k-means and competitive learning suffer
from several drawbacks such as dead-unit problem and need to
pre-specify number of cluster. In this paper, we will explore to
use competitive and cooperative learning approach to perform
color image segmentation. In competitive and cooperative
learning approach, seed points not only compete each other, but
also the winner will dynamically select several nearest
competitors to form a cooperative team to adapt to the input
together, finally it can automatically select the correct number
of cluster and avoid the dead-units problem. Experimental
results show that CCL can obtain better segmentation result.
Abstract: The Maximum Weighted Independent Set (MWIS)
problem is a classic graph optimization NP-hard problem. Given an
undirected graph G = (V, E) and weighting function defined on the
vertex set, the MWIS problem is to find a vertex set S V whose total
weight is maximum subject to no two vertices in S are adjacent. This
paper presents a novel approach to approximate the MWIS of a graph
using minimum weighted vertex cover of the graph. Computational
experiments are designed and conducted to study the performance
of our proposed algorithm. Extensive simulation results show that
the proposed algorithm can yield better solutions than other existing
algorithms found in the literature for solving the MWIS.
Abstract: In this paper, we study the application of Extreme
Learning Machine (ELM) algorithm for single layered feedforward
neural networks to non-linear chaotic time series problems. In this
algorithm the input weights and the hidden layer bias are randomly
chosen. The ELM formulation leads to solving a system of linear
equations in terms of the unknown weights connecting the hidden
layer to the output layer. The solution of this general system of
linear equations will be obtained using Moore-Penrose generalized
pseudo inverse. For the study of the application of the method we
consider the time series generated by the Mackey Glass delay
differential equation with different time delays, Santa Fe A and
UCR heart beat rate ECG time series. For the choice of sigmoid,
sin and hardlim activation functions the optimal values for the
memory order and the number of hidden neurons which give the
best prediction performance in terms of root mean square error are
determined. It is observed that the results obtained are in close
agreement with the exact solution of the problems considered
which clearly shows that ELM is a very promising alternative
method for time series prediction.
Abstract: The physical methods for RNA secondary structure prediction are time consuming and expensive, thus methods for computational prediction will be a proper alternative. Various algorithms have been used for RNA structure prediction including dynamic programming and metaheuristic algorithms. Musician's behaviorinspired harmony search is a recently developed metaheuristic algorithm which has been successful in a wide variety of complex optimization problems. This paper proposes a harmony search algorithm (HSRNAFold) to find RNA secondary structure with minimum free energy and similar to the native structure. HSRNAFold is compared with dynamic programming benchmark mfold and metaheuristic algorithms (RnaPredict, SetPSO and HelixPSO). The results showed that HSRNAFold is comparable to mfold and better than metaheuristics in finding the minimum free energies and the number of correct base pairs.
Abstract: This paper presents the work of signal discrimination
specifically for Electrocardiogram (ECG) waveform. ECG signal is
comprised of P, QRS, and T waves in each normal heart beat to
describe the pattern of heart rhythms corresponds to a specific
individual. Further medical diagnosis could be done to determine any
heart related disease using ECG information. The emphasis on QRS
Complex classification is further discussed to illustrate the
importance of it. Pan-Tompkins Algorithm, a widely known
technique has been adapted to realize the QRS Complex
classification process. There are eight steps involved namely
sampling, normalization, low pass filter, high pass filter (build a band
pass filter), derivation, squaring, averaging and lastly is the QRS
detection. The simulation results obtained is represented in a
Graphical User Interface (GUI) developed using MATLAB.
Abstract: This paper presents an Extended Kaman Filter
implementation of a single-camera Visual Simultaneous Localization
and Mapping algorithm, a novel algorithm for simultaneous
localization and mapping problem widely studied in mobile robotics
field. The algorithm is vision and odometry-based, The odometry
data is incremental, and therefore it will accumulate error over time,
since the robot may slip or may be lifted, consequently if the
odometry is used alone we can not accurately estimate the robot
position, in this paper we show that a combination of odometry and
visual landmark via the extended Kalman filter can improve the robot
position estimate. We use a Pioneer II robot and motorized pan tilt
camera models to implement the algorithm.
Abstract: Bioinformatics and Cheminformatics use computer as disciplines providing tools for acquisition, storage, processing, analysis, integrate data and for the development of potential applications of biological and chemical data. A chemical database is one of the databases that exclusively designed to store chemical information. NMRShiftDB is one of the main databases that used to represent the chemical structures in 2D or 3D structures. SMILES format is one of many ways to write a chemical structure in a linear format. In this study we extracted Antimicrobial Structures in SMILES format from NMRShiftDB and stored it in our Local Data Warehouse with its corresponding information. Additionally, we developed a searching tool that would response to user-s query using the JME Editor tool that allows user to draw or edit molecules and converts the drawn structure into SMILES format. We applied Quick Search algorithm to search for Antimicrobial Structures in our Local Data Ware House.
Abstract: This paper presents a new approach for the prob-ability density function estimation using the Support Vector Ma-chines (SVM) and the Expectation Maximization (EM) algorithms.In the proposed approach, an advanced algorithm for the SVM den-sity estimation which incorporates the Mean Field theory in the learning process is used. Instead of using ad-hoc values for the para-meters of the kernel function which is used by the SVM algorithm,the proposed approach uses the EM algorithm for an automatic optimization of the kernel. Experimental evaluation using simulated data set shows encouraging results.
Abstract: In this paper, we consider the control of time delay system
by Proportional-Integral (PI) controller. By Using the Hermite-
Biehler theorem, which is applicable to quasi-polynomials, we seek
a stability region of the controller for first order delay systems. The
essence of this work resides in the extension of this approach to
second order delay system, in the determination of its stability region
and the computation of the PI optimum parameters. We have used
the genetic algorithms to lead the complexity of the optimization
problem.
Abstract: Caching was suggested as a solution for reducing bandwidth utilization and minimizing query latency in mobile environments. Over the years, different caching approaches have been proposed, some relying on the server to broadcast reports periodically informing of the updated data while others allowed the clients to request for the data whenever needed. Until recently a hybrid cache consistency scheme Scalable Asynchronous Cache Consistency Scheme SACCS was proposed, which combined the two different approaches benefits- and is proved to be more efficient and scalable. Nevertheless, caching has its limitations too, due to the limited cache size and the limited bandwidth, which makes the implementation of cache replacement strategy an important aspect for improving the cache consistency algorithms. In this thesis, we proposed a new cache replacement strategy, the Least Unified Value strategy (LUV) to replace the Least Recently Used (LRU) that SACCS was based on. This paper studies the advantages and the drawbacks of the new proposed strategy, comparing it with different categories of cache replacement strategies.
Abstract: The proper design of RF pulses in magnetic resonance imaging (MRI) has a direct impact on the quality of acquired images, and is needed for many applications. Several techniques have been proposed to obtain the RF pulse envelope given the desired slice profile. Unfortunately, these techniques do not take into account the limitations of practical implementation such as limited amplitude resolution. Moreover, implementing constraints for special RF pulses on most techniques is not possible. In this work, we propose to develop an approach for designing optimal RF pulses under theoretically any constraints. The new technique will pose the RF pulse design problem as a combinatorial optimization problem and uses efficient techniques from this area such as genetic algorithms (GA) to solve this problem. In particular, an objective function will be proposed as the norm of the difference between the desired profile and the one obtained from solving the Bloch equations for the current RF pulse design values. The proposed approach will be verified using analytical solution based RF simulations and compared to previous methods such as Shinnar-Le Roux (SLR) method, and analysis, selected, and tested the options and parameters that control the Genetic Algorithm (GA) can significantly affect its performance to get the best improved results and compared to previous works in this field. The results show a significant improvement over conventional design techniques, select the best options and parameters for GA to get most improvement over the previous works, and suggest the practicality of using of the new technique for most important applications as slice selection for large flip angles, in the area of unconventional spatial encoding, and another clinical use.
Abstract: The Neuro-Fuzzy hybridization scheme has become
of research interest in pattern classification over the past decade. The
present paper proposes a novel Modified Adaptive Fuzzy Inference
Engine (MAFIE) for pattern classification. A modified Apriori
algorithm technique is utilized to reduce a minimal set of decision
rules based on input output data sets. A TSK type fuzzy inference
system is constructed by the automatic generation of membership
functions and rules by the fuzzy c-means clustering and Apriori
algorithm technique, respectively. The generated adaptive fuzzy
inference engine is adjusted by the least-squares fit and a conjugate
gradient descent algorithm towards better performance with a
minimal set of rules. The proposed MAFIE is able to reduce the
number of rules which increases exponentially when more input
variables are involved. The performance of the proposed MAFIE is
compared with other existing applications of pattern classification
schemes using Fisher-s Iris and Wisconsin breast cancer data sets and
shown to be very competitive.
Abstract: The shortest path routing problem is a multiobjective nonlinear optimization problem with constraints. This problem has been addressed by considering Quality of service parameters, delay and cost objectives separately or as a weighted sum of both objectives. Multiobjective evolutionary algorithms can find multiple pareto-optimal solutions in one single run and this ability makes them attractive for solving problems with multiple and conflicting objectives. This paper uses an elitist multiobjective evolutionary algorithm based on the Non-dominated Sorting Genetic Algorithm (NSGA), for solving the dynamic shortest path routing problem in computer networks. A priority-based encoding scheme is proposed for population initialization. Elitism ensures that the best solution does not deteriorate in the next generations. Results for a sample test network have been presented to demonstrate the capabilities of the proposed approach to generate well-distributed pareto-optimal solutions of dynamic routing problem in one single run. The results obtained by NSGA are compared with single objective weighting factor method for which Genetic Algorithm (GA) was applied.
Abstract: Dynamic location referencing method is an important technology to shield map differences. These method references objects of the road network by utilizing condensed selection of its real-world geographic properties stored in a digital map database, which overcomes the defections existing in pre-coded location referencing methods. The high attributes completeness requirements and complicated reference point selection algorithm are the main problems of recent researches. Therefore, a dynamic location referencing algorithm combining intersection points selected at the extremities compulsively and road link points selected according to link partition principle was proposed. An experimental system based on this theory was implemented. The tests using Beijing digital map database showed satisfied results and thus verified the feasibility and practicability of this method.
Abstract: This paper is focused on issues of process modeling
and two model based control strategies of a fed-batch sugar
crystallization process applying the concept of artificial neural
networks (ANNs). The control objective is to force the operation into
following optimal supersaturation trajectory. It is achieved by
manipulating the feed flow rate of sugar liquor/syrup, considered as
the control input. The control task is rather challenging due to the
strong nonlinearity of the process dynamics and variations in the
crystallization kinetics. Two control alternatives are considered –
model predictive control (MPC) and feedback linearizing control
(FLC). Adequate ANN process models are first built as part of the
controller structures. MPC algorithm outperforms the FLC approach
with respect to satisfactory reference tracking and smooth control
action. However, the MPC is computationally much more involved
since it requires an online numerical optimization, while for the FLC
an analytical control solution was determined.
Abstract: MANEMO is the integration of Network Mobility
(NEMO) and Mobile Ad Hoc Network (MANET). A MANEMO
node has an interface to both a MANET and NEMO network, and
therefore should choose the optimal interface for packet delivery,
however such a handover between interfaces will introduce packet
loss. We define the steps necessary for a MANEMO handover,
using Mobile IP and NEMO to signal the new binding to the
relevant Home Agent(s). The handover steps aim to minimize the
packet loss by avoiding waiting for Duplicate Address Detection
and Neighbour Unreachability Detection. We present expressions for
handover delay and packet loss, and then use numerical examples to
evaluate a MANEMO handover. The analysis shows how the packet
loss depends on level of nesting within NEMO, the delay between
Home Agents and the load on the MANET, and hence can be used
to developing optimal MANEMO handover algorithms.
Abstract: This paper proposes a balance control scheme for a biped robot to trace an arbitrary path using image information. While moving, it estimates the zero moment point(ZMP) of the biped robot in the next step using a Kalman filter and renders an appropriate balanced pose of the robot. The ZMP can be calculated from the robot's pose, which is measured from the reference object image acquired by a CCD camera on the robot's head. For simplifying the kinematical model, the coordinates systems of individual joints of each leg are aligned and the robot motion is approximated as an inverted pendulum so that a simple linear dynamics, 3D-LIPM(3D-Linear Inverted Pendulum Mode) can be applied. The efficiency of the proposed algorithm has been proven by the experiments performed on unknown trajectory.
Abstract: This work has been conducted to study on comfort level of drivers of suspended cabin tractor semitrailer. Some drivers suffer from low back pain caused by vibration. The practical significance of applying suspended cabin type of tractor semi trailer was tested at different road conditions, different speed as well as different load conditions for comfortable driver seat interface (x, y, z ) and the process parameters have been prioritized using Taguchi-s L27 orthogonal array. Genetic Algorithm (GA) is used to optimize the human comfort vibration of suspended cabin tractor semitrailer drivers. The practical significance of applying GA to human comfort to reaction of suspended cabin tractor semitrailer has been validated by means of computing the deviation between predicted and experimentally obtained human comfort to vibration. The optimized acceleration data indicate a little uncomfortable ride for suspended cabin tractor semitrailer.
Abstract: In most cases, it is considerably difficult to directly measure structural vibration with a lot of sensors because of complex
geometry, time and equipment cost. For this reason, this paper deals
with the problem of locating sensors on a plate model by four advanced sensor placement optimization (S.P.O) techniques. It also
suggests the evaluation index representing the characteristic of orthogonal between each of natural modes. The index value provides the assistance to selecting of proper S.P.O technique and optimal
positions for monitoring of dynamic systems without the experiment.