Abstract: Reducing energy consumption of embedded systems requires careful memory management. It has been shown that Scratch- Pad Memories (SPMs) are low size, low cost, efficient (i.e. energy saving) data structures directly managed at the software level. In this paper, the focus is on heuristic methods for SPMs management. A method is efficient if the number of accesses to SPM is as large as possible and if all available space (i.e. bits) is used. A Tabu Search (TS) approach for memory management is proposed which is, to the best of our knowledge, a new original alternative to the best known existing heuristic (BEH). In fact, experimentations performed on benchmarks show that the Tabu Search method is as efficient as BEH (in terms of energy consumption) but BEH requires a sorting which can be computationally expensive for a large amount of data. TS is easy to implement and since no sorting is necessary, unlike BEH, the corresponding sorting time is saved. In addition to that, in a dynamic perspective where the maximum capacity of the SPM is not known in advance, the TS heuristic will perform better than BEH.
Abstract: In field of Computer Science and Mathematics,
sorting algorithm is an algorithm that puts elements of a list in a
certain order i.e. ascending or descending. Sorting is perhaps the
most widely studied problem in computer science and is frequently
used as a benchmark of a system-s performance. This paper
presented the comparative performance study of four sorting
algorithms on different platform. For each machine, it is found that
the algorithm depends upon the number of elements to be sorted. In
addition, as expected, results show that the relative performance of
the algorithms differed on the various machines. So, algorithm
performance is dependent on data size and there exists impact of
hardware also.
Abstract: This paper proposes a bi-objective model for the
facility location problem under a congestion system. The idea of the
model is motivated by applications of locating servers in bank
automated teller machines (ATMS), communication networks, and so
on. This model can be specifically considered for situations in which
fixed service facilities are congested by stochastic demand within
queueing framework. We formulate this model with two perspectives
simultaneously: (i) customers and (ii) service provider. The
objectives of the model are to minimize (i) the total expected
travelling and waiting time and (ii) the average facility idle-time.
This model represents a mixed-integer nonlinear programming
problem which belongs to the class of NP-hard problems. In addition,
to solve the model, two metaheuristic algorithms including nondominated
sorting genetic algorithms (NSGA-II) and non-dominated
ranking genetic algorithms (NRGA) are proposed. Besides, to
evaluate the performance of the two algorithms some numerical
examples are produced and analyzed with some metrics to determine
which algorithm works better.
Abstract: During last decades, developing multi-objective
evolutionary algorithms for optimization problems has found
considerable attention. Flexible job shop scheduling problem, as an
important scheduling optimization problem, has found this attention
too. However, most of the multi-objective algorithms that are
developed for this problem use nonprofessional approaches. In
another words, most of them combine their objectives and then solve
multi-objective problem through single objective approaches. Of
course, except some scarce researches that uses Pareto-based
algorithms. Therefore, in this paper, a new Pareto-based algorithm
called controlled elitism non-dominated sorting genetic algorithm
(CENSGA) is proposed for the multi-objective FJSP (MOFJSP). Our
considered objectives are makespan, critical machine work load, and
total work load of machines. The proposed algorithm is also
compared with one the best Pareto-based algorithms of the literature
on some multi-objective criteria, statistically.
Abstract: This paper describes a concept of stereotype student
model in adaptive knowledge acquisition e-learning system. Defined
knowledge stereotypes are based on student's proficiency level and
on Bloom's knowledge taxonomy. The teacher module is responsible
for the whole adaptivity process: the automatic generation of
courseware elements, their dynamic selection and sorting, as well as
their adaptive presentation using templates for statements and
questions. The adaptation of courseware is realized according to
student-s knowledge stereotype.
Abstract: We suggest a novel method to incorporate longterm
redundancy (LTR) in signal time domain compression
methods. The proposition is based on block-sorting and curve
simplification. The proposition is illustrated on the ECG
signal as a post-processor for the FAN method. Test
applications on the new so-obtained FAN+ method using the
MIT-BIH database show substantial improvement of the
compression ratio-distortion behavior for a higher quality
reconstructed signal.
Abstract: A multilayer self organizing neural neural network
(MLSONN) architecture for binary object extraction, guided by a beta
activation function and characterized by backpropagation of errors
estimated from the linear indices of fuzziness of the network output
states, is discussed. Since the MLSONN architecture is designed to
operate in a single point fixed/uniform thresholding scenario, it does
not take into cognizance the heterogeneity of image information in
the extraction process. The performance of the MLSONN architecture
with representative values of the threshold parameters of the beta
activation function employed is also studied. A three layer bidirectional
self organizing neural network (BDSONN) architecture
comprising fully connected neurons, for the extraction of objects from
a noisy background and capable of incorporating the underlying image
context heterogeneity through variable and adaptive thresholding,
is proposed in this article. The input layer of the network architecture
represents the fuzzy membership information of the image scene to
be extracted. The second layer (the intermediate layer) and the final
layer (the output layer) of the network architecture deal with the self
supervised object extraction task by bi-directional propagation of the
network states. Each layer except the output layer is connected to the
next layer following a neighborhood based topology. The output layer
neurons are in turn, connected to the intermediate layer following
similar topology, thus forming a counter-propagating architecture
with the intermediate layer. The novelty of the proposed architecture
is that the assignment/updating of the inter-layer connection weights
are done using the relative fuzzy membership values at the constituent
neurons in the different network layers. Another interesting feature
of the network lies in the fact that the processing capabilities of
the intermediate and the output layer neurons are guided by a beta
activation function, which uses image context sensitive adaptive
thresholding arising out of the fuzzy cardinality estimates of the
different network neighborhood fuzzy subsets, rather than resorting to
fixed and single point thresholding. An application of the proposed
architecture for object extraction is demonstrated using a synthetic
and a real life image. The extraction efficiency of the proposed
network architecture is evaluated by a proposed system transfer index
characteristic of the network.
Abstract: This paper describes a new algorithm of arrangement
in parallel, based on Odd-Even Mergesort, called division and
concurrent mixes. The main idea of the algorithm is to achieve that
each processor uses a sequential algorithm for ordering a part of the
vector, and after that, for making the processors work in pairs in
order to mix two of these sections ordered in a greater one, also
ordered; after several iterations, the vector will be completely
ordered. The paper describes the implementation of the new
algorithm on a Message Passing environment (such as MPI). Besides,
it compares the obtained experimental results with the quicksort
sequential algorithm and with the parallel implementations (also on
MPI) of the algorithms quicksort and bitonic sort. The comparison
has been realized in an 8 processors cluster under GNU/Linux which
is running on a unique PC processor.
Abstract: The dynamic speckle or biospeckle is an interference
phenomenon generated at the reflection of a coherent light by an
active surface or even by a particulate or living body surface. The
above mentioned phenomenon gave scientific support to a method
named biospeckle which has been employed to study seed viability,
biological activity, tissue senescence, tissue water content, fruit
bruising, etc. Since the above mentioned method is not invasive and
yields numerical values, it can be considered for possible automation
associated to several processes, including selection and sorting.
Based on these preliminary considerations, this research work
proposed to study the interaction of a laser beam with vegetative
samples by measuring the incident light intensity and the transmitted
light beam intensity at several vegetative slabs of varying thickness.
Tests were carried on fifteen slices of apple tissue divided into three
thickness groups, i.e., 4 mm, 5 mm, 18 mm and 22 mm. A diode laser
beam of 10mW and 632 nm wavelength and a Samsung digital
camera were employed to carry the tests. Outgoing images were
analyzed by comparing the gray gradient of a fixed image column of
each image to obtain a laser penetration scale into the tissue,
according to the slice thickness.
Abstract: Global approximation using metamodel for complex
mathematical function or computer model over a large variable
domain is often needed in sensibility analysis, computer simulation,
optimal control, and global design optimization of complex, multiphysics
systems. To overcome the limitations of the existing
response surface (RS), surrogate or metamodel modeling methods for
complex models over large variable domain, a new adaptive and
regressive RS modeling method using quadratic functions and local
area model improvement schemes is introduced. The method applies
an iterative and Latin hypercube sampling based RS update process,
divides the entire domain of design variables into multiple cells,
identifies rougher cells with large modeling error, and further divides
these cells along the roughest dimension direction. A small number
of additional sampling points from the original, expensive model are
added over the small and isolated rough cells to improve the RS
model locally until the model accuracy criteria are satisfied. The
method then combines local RS cells to regenerate the global RS
model with satisfactory accuracy. An effective RS cells sorting
algorithm is also introduced to improve the efficiency of model
evaluation. Benchmark tests are presented and use of the new
metamodeling method to replace complex hybrid electrical vehicle
powertrain performance model in vehicle design optimization and
optimal control are discussed.
Abstract: Data gathering is an essential operation in wireless
sensor network applications. So it requires energy efficiency
techniques to increase the lifetime of the network. Similarly,
clustering is also an effective technique to improve the energy
efficiency and network lifetime of wireless sensor networks. In this
paper, an energy efficient cluster formation protocol is proposed with
the objective of achieving low energy dissipation and latency without
sacrificing application specific quality. The objective is achieved by
applying randomized, adaptive, self-configuring cluster formation
and localized control for data transfers. It involves application -
specific data processing, such as data aggregation or compression.
The cluster formation algorithm allows each node to make
independent decisions, so as to generate good clusters as the end.
Simulation results show that the proposed protocol utilizes minimum
energy and latency for cluster formation, there by reducing the
overhead of the protocol.
Abstract: Home is important for Chinese people. Because the
information regarding the house attributes and surrounding
environments is incomplete in most real estate agency, most house
buyers are difficult to consider the overall factors effectively and only
can search candidates by sorting-based approach. This study aims to
develop a decision support system for housing purchasing, in which
surrounding facilities of each house are quantified. Then, all
considered house factors and customer preferences are incorporated
into Simple Multi-Attribute Ranking Technique (SMART) to support
the housing evaluation. To evaluate the validity of proposed approach,
an empirical study was conducted from a real estate agency. Based on
the customer requirement and preferences, the proposed approach can
identify better candidate house with consider the overall house
attributes and surrounding facilities.
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: Pineapples can be classified using an index with seven
levels of maturity based on the green and yellow color of the skin. As
the pineapple ripens, the skin will change from pale green to a golden
or yellowish color. The issues that occur in agriculture nowadays are
to do with farmers being unable to distinguish between the indexes of
pineapple maturity correctly and effectively. There are several
reasons for why farmers cannot properly follow the guideline provide
by Federal Agriculture Marketing Authority (FAMA) and one of
reason is that due to manual inspection done by experts, there are no
specific and universal guidelines to be adopted by farmers due to the
different points of view of the experts when sorting the pineapples
based on their knowledge and experience. Therefore, an automatic
system will help farmers to identify pineapple maturity effectively
and will become a universal indicator to farmers.
Abstract: Emotion recognition is an important research field that finds lots of applications nowadays. This work emphasizes on recognizing different emotions from speech signal. The extracted features are related to statistics of pitch, formants, and energy contours, as well as spectral, perceptual and temporal features, jitter, and shimmer. The Artificial Neural Networks (ANN) was chosen as the classifier. Working on finding a robust and fast ANN classifier suitable for different real life application is our concern. Several experiments were carried out on different ANN to investigate the different factors that impact the classification success rate. Using a database containing 7 different emotions, it will be shown that with a proper and careful adjustment of features format, training data sorting, number of features selected and even the ANN type and architecture used, a success rate of 85% or even more can be achieved without increasing the system complicity and the computation time
Abstract: Customarily, the LMTD correction factor, FT, is used
to screen alternative designs for a heat exchanger. Designs with
unacceptably low FT values are discarded. In this paper, authors have
proposed a more fundamental criterion, based on feasibility of a
multipass exchanger as the only criteria, followed by economic
optimization. This criterion, coupled with asymptotic energy targets,
provide the complete optimization space in a heat exchanger network
(HEN), where cost-optimization of HEN can be performed with only
Heat Recovery Approach temperature (HRAT) and number-of-shells
as variables.
Abstract: Near-infrared (NIR) spectroscopy is a widely used
method for material identification for laboratory and industrial applications.
While standard spectrometers only allow measurements at
one sampling point at a time, NIR Spectral Imaging techniques can
measure, in real-time, both the size and shape of an object as well as
identify the material the object is made of. The online classification
and sorting of recovered paper with NIR Spectral Imaging (SI)
is used with success in the paper recycling industry throughout
Europe. Recently, the globalisation of the recycling material streams
caused that water-based flexographic-printed newspapers mainly from
UK and Italy appear also in central Europe. These flexo-printed
newspapers are not sufficiently de-inkable with the standard de-inking
process originally developed for offset-printed paper. This de-inking
process removes the ink from recovered paper and is the fundamental
processing step to produce high-quality paper from recovered paper.
Thus, the flexo-printed newspapers are a growing problem for the
recycling industry as they reduce the quality of the produced paper
if their amount exceeds a certain limit within the recovered paper
material.
This paper presents the results of a research project for the
development of an automated entry inspection system for recovered
paper that was jointly conducted by CTR AG (Austria) and PTS
Papiertechnische Stiftung (Germany). Within the project an NIR
SI prototype for the identification of flexo-printed newspaper has
been developed. The prototype can identify and sort out flexoprinted
newspapers in real-time and achieves a detection accuracy
for flexo-printed newspaper of over 95%. NIR SI, the technology the
prototype is based on, allows the development of inspection systems
for incoming goods in a paper production facility as well as industrial
sorting systems for recovered paper in the recycling industry in the
near future.
Abstract: In-place sorting algorithms play an important role in many fields such as very large database systems, data warehouses, data mining, etc. Such algorithms maximize the size of data that can be processed in main memory without input/output operations. In this paper, a novel in-place sorting algorithm is presented. The algorithm comprises two phases; rearranging the input unsorted array in place, resulting segments that are ordered relative to each other but whose elements are yet to be sorted. The first phase requires linear time, while, in the second phase, elements of each segment are sorted inplace in the order of z log (z), where z is the size of the segment, and O(1) auxiliary storage. The algorithm performs, in the worst case, for an array of size n, an O(n log z) element comparisons and O(n log z) element moves. Further, no auxiliary arithmetic operations with indices are required. Besides these theoretical achievements of this algorithm, it is of practical interest, because of its simplicity. Experimental results also show that it outperforms other in-place sorting algorithms. Finally, the analysis of time and space complexity, and required number of moves are presented, along with the auxiliary storage requirements of the proposed algorithm.
Abstract: In this paper, a novel copyright protection scheme for digital images based on Visual Cryptography and Statistics is proposed. In our scheme, the theories and properties of sampling distribution of means and visual cryptography are employed to achieve the requirements of robustness and security. Our method does not need to alter the original image and can identify the ownership without resorting to the original image. Besides, our method allows multiple watermarks to be registered for a single host image without causing any damage to other hidden watermarks. Moreover, it is also possible for our scheme to cast a larger watermark into a smaller host image. Finally, experimental results will show the robustness of our scheme against several common attacks.
Abstract: Sequences of execution of algorithms in an interactive
manner using multimedia tools are employed in this paper. It helps to
realize the concept of fundamentals of algorithms such as searching
and sorting method in a simple manner. Visualization gains more
attention than theoretical study and it is an easy way of learning
process. We propose methods for finding runtime sequence of each
algorithm in an interactive way and aims to overcome the drawbacks
of the existing character systems. System illustrates each and every
step clearly using text and animation. Comparisons of its time
complexity have been carried out and results show that our approach
provides better perceptive of algorithms.