Abstract: Wireless channels are characterized by more serious
bursty and location-dependent errors. Many packet scheduling
algorithms have been proposed for wireless networks to guarantee
fairness and delay bounds. However, most existing schemes do not
consider the difference of traffic natures among packet flows. This
will cause the delay-weight coupling problem. In particular, serious
queuing delays may be incurred for real-time flows. In this paper, it
is proposed a scheduling algorithm that takes traffic types of flows
into consideration when scheduling packets and also it is provided
scheduling flexibility by trading off video quality to meet the
playback deadline.
Abstract: In this paper, an innovative watermarking scheme for audio signal based on genetic algorithms (GA) in the discrete wavelet transforms is proposed. It is robust against watermarking attacks, which are commonly employed in literature. In addition, the watermarked image quality is also considered. We employ GA for the optimal localization and intensity of watermark. The watermark detection process can be performed without using the original audio signal. The experimental results demonstrate that watermark is inaudible and robust to many digital signal processing, such as cropping, low pass filter, additive noise.
Abstract: This paper presents an efficient emission constrained
economic dispatch algorithm that deals with nonlinear cost function
and constraints. It is then incorporated into the dynamic
programming based hydrothermal coordination program. The
program has been tested on a practical utility system having 32
thermal and 12 hydro generating units. Test results show that a slight
increase in production cost causes a substantial reduction in
emission.
Abstract: We introduce an algorithm based on the
morphological shared-weight neural network. Being nonlinear and
translation-invariant, the MSNN can be used to create better
generalization during face recognition. Feature extraction is
performed on grayscale images using hit-miss transforms that are
independent of gray-level shifts. The output is then learned by
interacting with the classification process. The feature extraction and
classification networks are trained together, allowing the MSNN to
simultaneously learn feature extraction and classification for a face.
For evaluation, we test for robustness under variations in gray levels
and noise while varying the network-s configuration to optimize
recognition efficiency and processing time. Results show that the
MSNN performs better for grayscale image pattern classification
than ordinary neural networks.
Abstract: Extended Kalman Filter (EKF) is probably the most
widely used estimation algorithm for nonlinear systems. However,
not only it has difficulties arising from linearization but also many
times it becomes numerically unstable because of computer round off
errors that occur in the process of its implementation. To overcome
linearization limitations, the unscented transformation (UT) was
developed as a method to propagate mean and covariance
information through nonlinear transformations. Kalman filter that
uses UT for calculation of the first two statistical moments is called
Unscented Kalman Filter (UKF). Square-root form of UKF (SRUKF)
developed by Rudolph van der Merwe and Eric Wan to
achieve numerical stability and guarantee positive semi-definiteness
of the Kalman filter covariances. This paper develops another
implementation of SR-UKF for sequential update measurement
equation, and also derives a new UD covariance factorization filter
for the implementation of UKF. This filter is equivalent to UKF but
is computationally more efficient.
Abstract: In this paper developed and realized absolutely new
algorithm for solving three-dimensional Poisson equation. This
equation used in research of turbulent mixing, computational fluid
dynamics, atmospheric front, and ocean flows and so on. Moreover in
the view of rising productivity of difficult calculation there was
applied the most up-to-date and the most effective parallel
programming technology - MPI in combination with OpenMP
direction, that allows to realize problems with very large data
content. Resulted products can be used in solving of important
applications and fundamental problems in mathematics and physics.
Abstract: In this paper, a neural tree (NT) classifier having a
simple perceptron at each node is considered. A new concept for
making a balanced tree is applied in the learning algorithm of the
tree. At each node, if the perceptron classification is not accurate and
unbalanced, then it is replaced by a new perceptron. This separates
the training set in such a way that almost the equal number of patterns
fall into each of the classes. Moreover, each perceptron is trained only
for the classes which are present at respective node and ignore other
classes. Splitting nodes are employed into the neural tree architecture
to divide the training set when the current perceptron node repeats
the same classification of the parent node. A new error function based
on the depth of the tree is introduced to reduce the computational
time for the training of a perceptron. Experiments are performed to
check the efficiency and encouraging results are obtained in terms of
accuracy and computational costs.
Abstract: Wireless location is to determine the mobile station (MS) location in a wireless cellular communications system. When fewer base stations (BSs) may be available for location purposes or the measurements with large errors in non-line-of-sight (NLOS) environments, it is necessary to integrate all available heterogeneous measurements to achieve high location accuracy. This paper illustrates a hybrid proposed schemes that combine time of arrival (TOA) at three BSs and angle of arrival (AOA) information at the serving BS to give a location estimate of the MS. The proposed schemes mitigate the NLOS effect simply by the weighted sum of the intersections between three TOA circles and the AOA line without requiring a priori information about the NLOS error. Simulation results show that the proposed methods can achieve better accuracy when compare with Taylor series algorithm (TSA) and the hybrid lines of position algorithm (HLOP).
Abstract: To minimize power losses, it is important to
determine the location and size of local generators to be placed in
unbalanced power distribution systems. On account of some inherent
features of unbalanced distribution systems, such as radial structure,
large number of nodes, a wide range of X/R ratios, the conventional
techniques developed for the transmission systems generally fail on
the determination of optimum size and location of distributed
generators (DGs). This paper presents a simple method for
investigating the problem of contemporaneously choosing best
location and size of DG in three-phase unbalanced radial distribution
system (URDS) for power loss minimization and to improve the
voltage profile of the system. Best location of the DG is determined
by using voltage index analysis and size of DG is computed by
variational technique algorithm according to available standard size
of DGs. This paper presents the results of simulations for 25-bus and
IEEE 37- bus Unbalanced Radial Distribution system.
Abstract: A novel direction-of-arrival (DOA) estimation technique, which uses a conventional multiple signal classification (MUSIC) algorithm with periodic signals, is applied to a single RF-port parasitic array antenna for direction finding. Simulation results show that the proposed method gives high resolution (1 degree) DOA estimation in an uncorrelated signal environment. The novelty lies in that the MUSIC algorithm is applied to a simplified antenna configuration. Only one RF port and one analogue-to-digital converter (ADC) are used in this antenna, which features low DC power consumption, low cost, and ease of fabrication. Modifications to the conventional MUSIC algorithm do not bring much additional complexity. The proposed technique is also free from the negative influence by the mutual coupling between elements. Therefore, the technique has great potential to be implemented into the existing wireless mobile communications systems, especially at the power consumption limited mobile terminals, to provide additional position location (PL) services.
Abstract: Let n ≥ 3 be an integer and G2(n) be the subgroup
of square roots of 1 in (Z/nZ)*. In this paper, we give an algorithm
that computes a generating set of this subgroup.
Abstract: In this study, the Multi-Layer Perceptron (MLP)with Back-Propagation learning algorithm are used to classify to effective diagnosis Parkinsons disease(PD).It-s a challenging problem for medical community.Typically characterized by tremor, PD occurs due to the loss of dopamine in the brains thalamic region that results in involuntary or oscillatory movement in the body. A feature selection algorithm along with biomedical test values to diagnose Parkinson disease.Clinical diagnosis is done mostly by doctor-s expertise and experience.But still cases are reported of wrong diagnosis and treatment. Patients are asked to take number of tests for diagnosis.In many cases,not all the tests contribute towards effective diagnosis of a disease.Our work is to classify the presence of Parkinson disease with reduced number of attributes.Original,22 attributes are involved in classify.We use Information Gain to determine the attributes which reduced the number of attributes which is need to be taken from patients.The Artificial neural networks is used to classify the diagnosis of patients.Twenty-Two attributes are reduced to sixteen attributes.The accuracy is in training data set is 82.051% and in the validation data set is 83.333%.
Abstract: In this paper we use exponential particle swarm
optimization (EPSO) to cluster data. Then we compare between
(EPSO) clustering algorithm which depends on exponential variation
for the inertia weight and particle swarm optimization (PSO)
clustering algorithm which depends on linear inertia weight. This
comparison is evaluated on five data sets. The experimental results
show that EPSO clustering algorithm increases the possibility to find
the optimal positions as it decrease the number of failure. Also show
that (EPSO) clustering algorithm has a smaller quantization error
than (PSO) clustering algorithm, i.e. (EPSO) clustering algorithm
more accurate than (PSO) clustering algorithm.
Abstract: We propose a downlink multiple-input multipleoutput
(MIMO) multi-carrier code division multiple access (MCCDMA)
system with adaptive beamforming algorithm for smart
antennas. The algorithm used in this paper is based on the Least
Mean Square (LMS), with pilot channel estimation (PCE) and the
zero forcing equalizer (ZFE) in the receiver, requiring reference
signal and no knowledge channel. MC-CDMA is studied in a
multiple antenna context in order to efficiently exploit robustness
against multipath effects and multi-user flexibility of MC-CDMA and
channel diversity offered by MIMO systems for radio mobile
channels. Computer simulations, considering multi-path Rayleigh
Fading Channel, interference inter symbol and interference are
presented to verify the performance. Simulation results show that the
scheme achieves good performance in a multi-user system.
Abstract: Much time series data is generally from continuous dynamic system. Firstly, this paper studies the detection of the nonlinearity of time series from continuous dynamics systems by applying the Phase-randomized surrogate algorithm. Then, the Delay Vector Variance (DVV) method is introduced into nonlinearity test. The results show that under the different sampling conditions, the opposite detection of nonlinearity is obtained via using traditional test statistics methods, which include the third-order autocovariance and the asymmetry due to time reversal. Whereas the DVV method can perform well on determining nonlinear of Lorenz signal. It indicates that the proposed method can describe the continuous dynamics signal effectively.
Abstract: Rapid advancement in computing technology brings
computers and humans to be seamlessly integrated in future. The
emergence of smartphone has driven computing era towards
ubiquitous and pervasive computing. Recognizing human activity has
garnered a lot of interest and has raised significant researches-
concerns in identifying contextual information useful to human
activity recognition. Not only unobtrusive to users in daily life,
smartphone has embedded built-in sensors that capable to sense
contextual information of its users supported with wide range
capability of network connections. In this paper, we will discuss the
classification algorithms used in smartphone-based human activity.
Existing technologies pertaining to smartphone-based researches in
human activity recognition will be highlighted and discussed. Our
paper will also present our findings and opinions to formulate
improvement ideas in current researches- trends. Understanding
research trends will enable researchers to have clearer research
direction and common vision on latest smartphone-based human
activity recognition area.
Abstract: This paper considers the development of a two-point
predictor-corrector block method for solving delay differential
equations. The formulae are represented in divided difference form
and the algorithm is implemented in variable stepsize variable order
technique. The block method produces two new values at a single
integration step. Numerical results are compared with existing
methods and it is evident that the block method performs very well.
Stability regions of the block method are also investigated.
Abstract: RC4 was used as an encryption algorithm in WEP(Wired Equivalent Privacy) protocol that is a standardized for 802.11 wireless network. A few attacks followed, indicating certain weakness in the design. In this paper, we proposed a new variant of RC4 stream cipher. The new version of the cipher does not only appear to be more secure, but its keystream also has large period, large complexity and good statistical properties.
Abstract: Although backpropagation ANNs generally predict
better than decision trees do for pattern classification problems, they
are often regarded as black boxes, i.e., their predictions cannot be
explained as those of decision trees. In many applications, it is
desirable to extract knowledge from trained ANNs for the users to
gain a better understanding of how the networks solve the problems.
A new rule extraction algorithm, called rule extraction from artificial
neural networks (REANN) is proposed and implemented to extract
symbolic rules from ANNs. A standard three-layer feedforward ANN
is the basis of the algorithm. A four-phase training algorithm is
proposed for backpropagation learning. Explicitness of the extracted
rules is supported by comparing them to the symbolic rules generated
by other methods. Extracted rules are comparable with other methods
in terms of number of rules, average number of conditions for a rule,
and predictive accuracy. Extensive experimental studies on several
benchmarks classification problems, such as breast cancer, iris,
diabetes, and season classification problems, demonstrate the
effectiveness of the proposed approach with good generalization
ability.
Abstract: As the majority of faults are found in a few of its
modules so there is a need to investigate the modules that are
affected severely as compared to other modules and proper
maintenance need to be done in time especially for the critical
applications. As, Neural networks, which have been already applied
in software engineering applications to build reliability growth
models predict the gross change or reusability metrics. Neural
networks are non-linear sophisticated modeling techniques that are
able to model complex functions. Neural network techniques are
used when exact nature of input and outputs is not known. A key
feature is that they learn the relationship between input and output
through training. In this present work, various Neural Network Based
techniques are explored and comparative analysis is performed for
the prediction of level of need of maintenance by predicting level
severity of faults present in NASA-s public domain defect dataset.
The comparison of different algorithms is made on the basis of Mean
Absolute Error, Root Mean Square Error and Accuracy Values. It is
concluded that Generalized Regression Networks is the best
algorithm for classification of the software components into different
level of severity of impact of the faults. The algorithm can be used to
develop model that can be used for identifying modules that are
heavily affected by the faults.