Abstract: Facility location is a complex real-world problem
which needs a strategic management decision. This paper provides a
general review on studies, efforts and developments in Facility
Location Problems which are classical optimization problems having
a wide-spread applications in various areas such as transportation,
distribution, production, supply chain decisions and
telecommunication. Our goal is not to review all variants of different
studies in FLPs or to describe very detailed computational techniques
and solution approaches, but rather to provide a broad overview of
major location problems that have been studied, indicating how they
are formulated and what are proposed by researchers to tackle the
problem. A brief, elucidative table based on a grouping according to
“General Problem Type” and “Methods Proposed” used in the studies
is also presented at the end of the work.
Abstract: In this paper, the problem of stability and stabilization
for neutral delay-differential systems with infinite delay is
investigated. Using Lyapunov method, new delay-independent
sufficient condition for the stability of neutral systems with infinite
delay is obtained in terms of linear matrix inequality (LMI).
Memory-less state feedback controllers are then designed for the
stabilization of the system using the feasible solution of the resulting
LMI, which are easily solved using any optimization algorithms.
Numerical examples are given to illustrate the results of the proposed
methods.
Abstract: In this article, we deal with a variant of the classical
course timetabling problem that has a practical application in many
areas of education. In particular, in this paper we are interested in
high schools remedial courses. The purpose of such courses is to
provide under-prepared students with the skills necessary to succeed
in their studies. In particular, a student might be under prepared in
an entire course, or only in a part of it. The limited availability
of funds, as well as the limited amount of time and teachers at
disposal, often requires schools to choose which courses and/or which
teaching units to activate. Thus, schools need to model the training
offer and the related timetabling, with the goal of ensuring the
highest possible teaching quality, by meeting the above-mentioned
financial, time and resources constraints. Moreover, there are some
prerequisites between the teaching units that must be satisfied. We
first present a Mixed-Integer Programming (MIP) model to solve
this problem to optimality. However, the presence of many peculiar
constraints contributes inevitably in increasing the complexity of
the mathematical model. Thus, solving it through a general-purpose
solver may be performed for small instances only, while solving
real-life-sized instances of such model requires specific techniques
or heuristic approaches. For this purpose, we also propose a heuristic
approach, in which we make use of a fast constructive procedure
to obtain a feasible solution. To assess our exact and heuristic
approaches we perform extensive computational results on both
real-life instances (obtained from a high school in Lecce, Italy) and
randomly generated instances. Our tests show that the MIP model is
never solved to optimality, with an average optimality gap of 57%.
On the other hand, the heuristic algorithm is much faster (in about the
50% of the considered instances it converges in approximately half of
the time limit) and in many cases allows achieving an improvement
on the objective function value obtained by the MIP model. Such an
improvement ranges between 18% and 66%.
Abstract: In this paper, a new SMC (Sliding Mode Control)
method with MP (Model Predictive Control) integral action for the
slip suppression of EV (Electric Vehicle) under braking is proposed.
The proposed method introduce the integral term with standard SMC
gain , where the integral gain is optimized for each control period by
the MPC algorithms. The aim of this method is to improve the safety
and the stability of EVs under braking by controlling the wheel slip
ratio. There also include numerical simulation results to demonstrate
the effectiveness of the method.
Abstract: Localization of nodes is one of the key issues of
Wireless Sensor Network (WSN) that gained a wide attention in
recent years. The existing localization techniques can be generally
categorized into two types: range-based and range-free. Compared
with rang-based schemes, the range-free schemes are more costeffective,
because no additional ranging devices are needed. As a
result, we focus our research on the range-free schemes. In this paper
we study three types of range-free location algorithms to compare the
localization error and energy consumption of each one. Centroid
algorithm requires a normal node has at least three neighbor anchors,
while DV-hop algorithm doesn’t have this requirement. The third
studied algorithm is the amorphous algorithm similar to DV-Hop
algorithm, and the idea is to calculate the hop distance between two
nodes instead of the linear distance between them. The simulation
results show that the localization accuracy of the amorphous
algorithm is higher than that of other algorithms and the energy
consumption does not increase too much.
Abstract: Voting algorithms are extensively used to make
decisions in fault tolerant systems where each redundant module
gives inconsistent outputs. Popular voting algorithms include
majority voting, weighted voting, and inexact majority voters. Each
of these techniques suffers from scenarios where agreements do not
exist for the given voter inputs. This has been successfully overcome
in literature using fuzzy theory. Our previous work concentrated on a
neuro-fuzzy algorithm where training using the neuro system
substantially improved the prediction result of the voting system.
Weight training of Neural Network is sub-optimal. This study
proposes to optimize the weights of the Neural Network using
Artificial Bee Colony algorithm. Experimental results show the
proposed system improves the decision making of the voting
algorithms.
Abstract: Based on application requirements, nodes are static or
mobile in Wireless Sensor Networks (WSNs). Mobility poses
challenges in protocol design, especially at the link layer requiring
mobility adaptation algorithms to localize mobile nodes and predict
link quality to be established with them. This study implements
XMAC and Berkeley Media Access Control (BMAC) routing
protocols to evaluate performance under WSN’s static and mobility
conditions. This paper gives a comparative study of mobility-aware
MAC protocols. Routing protocol performance, based on Average
End to End Delay, Average Packet Delivery Ratio, Average Number
of hops, and Jitter is evaluated.
Abstract: Most of the existing video streaming protocols
provide video services without considering security aspects in
decentralized mobile ad-hoc networks. The security policies adapted
to the currently existing non-streaming protocols, do not comply with
the live video streaming protocols resulting in considerable
vulnerability, high bandwidth consumption and unreliability which
cause severe security threats, low bandwidth and error prone
transmission respectively in video streaming applications. Therefore
a synergized methodology is required to reduce vulnerability and
bandwidth consumption, and enhance reliability in the video
streaming applications in MANET. To ensure the security measures
with reduced bandwidth consumption and improve reliability of the
video streaming applications, a Secure Low-bandwidth Video
Streaming through Reliable Multipath Propagation (SLVRMP)
protocol architecture has been proposed by incorporating the two
algorithms namely Secure Low-bandwidth Video Streaming
Algorithm and Reliable Secure Multipath Propagation Algorithm
using Layered Video Coding in non-overlapping zone routing
network topology. The performances of the proposed system are
compared to those of the other existing secure multipath protocols
Sec-MR, SPREAD using NS 2.34 and the simulation results show
that the performances of the proposed system get considerably
improved.
Abstract: Live video streaming is one of the most widely used
service among end users, yet it is a big challenge for the network
operators in terms of quality. The only way to provide excellent
Quality of Experience (QoE) to the end users is continuous
monitoring of live video streaming. For this purpose, there are several
objective algorithms available that monitor the quality of the video in
a live stream. Subjective tests play a very important role in fine
tuning the results of objective algorithms. As human perception is
considered to be the most reliable source for assessing the quality of a
video stream subjective tests are conducted in order to develop more
reliable objective algorithms. Temporal impairments in a live video
stream can have a negative impact on the end users. In this paper we
have conducted subjective evaluation tests on a set of video
sequences containing temporal impairment known as frame freezing.
Frame Freezing is considered as a transmission error as well as a
hardware error which can result in loss of video frames on the
reception side of a transmission system. In our subjective tests, we
have performed tests on videos that contain a single freezing event
and also for videos that contain multiple freezing events. We have
recorded our subjective test results for all the videos in order to give a
comparison on the available No Reference (NR) objective
algorithms. Finally, we have shown the performance of no reference
algorithms used for objective evaluation of videos and suggested the
algorithm that works better. The outcome of this study shows the
importance of QoE and its effect on human perception. The results
for the subjective evaluation can serve the purpose for validating
objective algorithms.
Abstract: Human beings have the ability to make logical
decisions. Although human decision - making is often optimal, it is
insufficient when huge amount of data is to be classified. Medical
dataset is a vital ingredient used in predicting patient’s health
condition. In other to have the best prediction, there calls for most
suitable machine learning algorithms. This work compared the
performance of Artificial Neural Network (ANN) and Decision Tree
Algorithms (DTA) as regards to some performance metrics using
diabetes data. WEKA software was used for the implementation of
the algorithms. Multilayer Perceptron (MLP) and Radial Basis
Function (RBF) were the two algorithms used for ANN, while
RegTree and LADTree algorithms were the DTA models used. From
the results obtained, DTA performed better than ANN. The Root
Mean Squared Error (RMSE) of MLP is 0.3913 that of RBF is
0.3625, that of RepTree is 0.3174 and that of LADTree is 0.3206
respectively.
Abstract: DNA Barcode provides good sources of needed
information to classify living species. The classification problem has
to be supported with reliable methods and algorithms. To analyze
species regions or entire genomes, it becomes necessary to use the
similarity sequence methods. A large set of sequences can be
simultaneously compared using Multiple Sequence Alignment which
is known to be NP-complete. However, all the used methods are still
computationally very expensive and require significant computational
infrastructure. Our goal is to build predictive models that are highly
accurate and interpretable. In fact, our method permits to avoid the
complex problem of form and structure in different classes of
organisms. The empirical data and their classification performances
are compared with other methods. Evenly, in this study, we present
our system which is consisted of three phases. The first one, is called
transformation, is composed of three sub steps; Electron-Ion
Interaction Pseudopotential (EIIP) for the codification of DNA
Barcodes, Fourier Transform and Power Spectrum Signal Processing.
Moreover, the second phase step is an approximation; it is
empowered by the use of Multi Library Wavelet Neural Networks
(MLWNN). Finally, the third one, is called the classification of DNA
Barcodes, is realized by applying the algorithm of hierarchical
classification.
Abstract: The lifetime of a wireless sensor network can be
effectively increased by using scheduling operations. Once the
sensors are randomly deployed, the task at hand is to find the largest
number of disjoint sets of sensors such that every sensor set provides
complete coverage of the target area. At any instant, only one of these
disjoint sets is switched on, while all other are switched off. This
paper proposes a heuristic search method to find the maximum
number of disjoint sets that completely cover the region. A
population of randomly initialized members is made to explore the
solution space. A set of heuristics has been applied to guide the
members to a possible solution in their neighborhood. The heuristics
escalate the convergence of the algorithm. The best solution explored
by the population is recorded and is continuously updated. The
proposed algorithm has been tested for applications which require
sensing of multiple target points, referred to as point coverage
applications. Results show that the proposed algorithm outclasses the
existing algorithms. It always finds the optimum solution, and that
too by making fewer number of fitness function evaluations than the
existing approaches.
Abstract: Artificial neural networks have gained a lot of interest
as empirical models for their powerful representational capacity,
multi input and output mapping characteristics. In fact, most feedforward
networks with nonlinear nodal functions have been proved to
be universal approximates. In this paper, we propose a new
supervised method for color image classification based on selforganizing
feature maps (SOFM). This algorithm is based on
competitive learning. The method partitions the input space using
self-organizing feature maps to introduce the concept of local
neighborhoods. Our image classification system entered into RGB
image. Experiments with simulated data showed that separability of
classes increased when increasing training time. In additional, the
result shows proposed algorithms are effective for color image
classification.
Abstract: This paper is focused on the reference current
calculation in the compensation mode of the active DC traction
substations. The so-called p-q theory of the instantaneous reactive
power is used as theoretical foundation. The compensation goal of
total compensation is taken into consideration for the operation under
both sinusoidal and nonsinusoidal voltage conditions, through the
two objectives of unity power factor and perfect harmonic
cancelation. Four blocks of reference current generation implement
the conceived algorithms and they are included in a specific Simulink
library, which is useful in a DSP dSPACE-based platform working
under Matlab/Simulink. The simulation results validate the
correctness of the implementation and fulfillment of the
compensation tasks.
Abstract: Several parameters are established in order to measure
biodiesel quality. One of them is the iodine value, which is an
important parameter that measures the total unsaturation within a
mixture of fatty acids. Limitation of unsaturated fatty acids is
necessary since warming of higher quantity of these ones ends in
either formation of deposits inside the motor or damage of lubricant.
Determination of iodine value by official procedure tends to be very
laborious, with high costs and toxicity of the reagents, this study uses
artificial neural network (ANN) in order to predict the iodine value
property as an alternative to these problems. The methodology of
development of networks used 13 esters of fatty acids in the input
with convergence algorithms of back propagation of back
propagation type were optimized in order to get an architecture of
prediction of iodine value. This study allowed us to demonstrate the
neural networks’ ability to learn the correlation between biodiesel
quality properties, in this caseiodine value, and the molecular
structures that make it up. The model developed in the study reached
a correlation coefficient (R) of 0.99 for both network validation and
network simulation, with Levenberg-Maquardt algorithm.
Abstract: In recent years, multi-antenna techniques are being considered as a potential solution to increase the flow of future wireless communication systems. The objective of this article is to study the emission and reception system MIMO (Multiple Input Multiple Output), and present the different reception decoding techniques. First we will present the least complex technical, linear receivers such as the zero forcing equalizer (ZF) and minimum mean squared error (MMSE). Then a nonlinear technique called ordered successive cancellation of interferences (OSIC) and the optimal detector based on the maximum likelihood criterion (ML), finally, we simulate the associated decoding algorithms for MIMO system such as ZF, MMSE, OSIC and ML, thus a comparison of performance of these algorithms in MIMO context.
Abstract: Today, there is a large number of political transcripts
available on the Web to be mined and used for statistical analysis,
and product recommendations. As the online political resources are
used for various purposes, automatically determining the political
orientation on these transcripts becomes crucial. The methodologies
used by machine learning algorithms to do an automatic classification
are based on different features that are classified under categories
such as Linguistic, Personality etc. Considering the ideological
differences between Liberals and Conservatives, in this paper, the
effect of Personality traits on political orientation classification is
studied. The experiments in this study were based on the correlation
between LIWC features and the BIG Five Personality traits. Several
experiments were conducted using Convote U.S. Congressional-
Speech dataset with seven benchmark classification algorithms. The
different methodologies were applied on several LIWC feature sets
that constituted by 8 to 64 varying number of features that are
correlated to five personality traits. As results of experiments,
Neuroticism trait was obtained to be the most differentiating
personality trait for classification of political orientation. At the same
time, it was observed that the personality trait based classification
methodology gives better and comparable results with the related
work.
Abstract: The new era of digital communication has brought up
many challenges that network operators need to overcome. The high
demand of mobile data rates require improved networks, which is a
challenge for the operators in terms of maintaining the quality of
experience (QoE) for their consumers. In live video transmission,
there is a sheer need for live surveillance of the videos in order to
maintain the quality of the network. For this purpose objective
algorithms are employed to monitor the quality of the videos that are
transmitted over a network. In order to test these objective algorithms,
subjective quality assessment of the streamed videos is required, as the
human eye is the best source of perceptual assessment. In this paper we
have conducted subjective evaluation of videos with varying spatial
and temporal impairments. These videos were impaired with frame
freezing distortions so that the impact of frame freezing on the quality
of experience could be studied. We present subjective Mean Opinion
Score (MOS) for these videos that can be used for fine tuning the
objective algorithms for video quality assessment.
Abstract: This paper presents the performance of Integrated
Bacterial Foraging Optimization and Particle Swarm Optimization
(IBFO_PSO) technique in MANET routing. The BFO is a bio-inspired
algorithm, which simulates the foraging behavior of bacteria.
It is effectively applied in improving the routing performance in
MANET. In results, it is proved that the PSO integrated with BFO
reduces routing delay, energy consumption and communication
overhead.
Abstract: In addition to environmental parameters like rain,
temperature diseases on crop is a major factor which affects
production quality & quantity of crop yield. Hence disease
management is a key issue in agriculture. For the management of
disease, it needs to be detected at early stage. So, treat it properly &
control spread of the disease. Now a day, it is possible to use the
images of diseased leaf to detect the type of disease by using image
processing techniques. This can be achieved by extracting features
from the images which can be further used with classification
algorithms or content based image retrieval systems. In this paper,
color image is used to extract the features such as mean and standard
deviation after the process of region cropping. The selected features
are taken from the cropped image with different image size samples.
Then, the extracted features are taken in to the account for
classification using Fuzzy Inference System (FIS).