Abstract: In this paper optimal capacitor placement problem has
been formulated in a restructured distribution network. In this
scenario the distribution network operator can consider reactive
energy also as a service that can be sold to transmission system. Thus
search for optimal location, size and number of capacitor banks with
the objective of loss reduction, maximum income from selling
reactive energy to transmission system and return on investment for
capacitors, has been performed. Results is influenced with economic
value of reactive energy, therefore problem has been solved for
various amounts of it. The implemented optimization technique is
genetic algorithm. For any value of reactive power economic value,
when reverse of investment index increase and change from zero or
negative values to positive values, the threshold value of selling
reactive power has been obtained. This increasing price of economic
parameter is reasonable until the network losses is less than loss
before compensation.
Abstract: This paper attempts to explore a new method to
improve the teaching of algorithmic for beginners. It is well known
that algorithmic is a difficult field to teach for teacher and complex to
assimilate for learner. These difficulties are due to intrinsic
characteristics of this field and to the manner that teachers (the
majority) apprehend its bases. However, in a Technology Enhanced
Learning environment (TEL), assessment, which is important and
indispensable, is the most delicate phase to implement, for all
problems that generate (noise...). Our objective registers in the
confluence of these two axes. For this purpose, EASEL focused
essentially to elaborate an assessment approach of algorithmic
competences in a TEL environment. This approach consists in
modeling an algorithmic solution according to basic and elementary
operations which let learner draw his/her own step with all autonomy
and independently to any programming language. This approach
assures a trilateral assessment: summative, formative and diagnostic
assessment.
Abstract: One of the most growing areas in the embedded community is multimedia devices. Multimedia devices incorporate a number of complicated functions for their operation, like motion estimation. A multitude of different implementations have been proposed to reduce motion estimation complexity, such as spiral search. We have studied the implementations of spiral search and identified areas of improvement. We propose a modified spiral search algorithm, with lower computational complexity compared to the original spiral search. We have implemented our algorithm on an embedded ARM based architecture, with custom memory hierarchy. The resulting system yields energy consumption reduction up to 64% and performance increase up to 77%, with a small penalty of 2.3 dB, in average, of video quality compared with the original spiral search algorithm.
Abstract: This paper describes a novel method for automatic
estimation of the contours of weld defect in radiography images.
Generally, the contour detection is the first operation which we apply
in the visual recognition system. Our approach can be described as a
region based maximum likelihood formulation of parametric
deformable contours. This formulation provides robustness against
the poor image quality, and allows simultaneous estimation of the
contour parameters together with other parameters of the model.
Implementation is performed by a deterministic iterative algorithm
with minimal user intervention. Results testify for the very good
performance of the approach especially in synthetic weld defect
images.
Abstract: Medical services are usually provided in hospitals; however, in developing country, some rural residences have fewer opportunities to access in healthcare services due to the limitation of transportation communication. Therefore, in Thailand, there are charitable organizations operating to provide medical treatments to these people by shifting the medical services to operation sites; this is commonly known as mobile medical service. Operation routing is important for the organization to reduce its transportation cost in order to focus more on other important activities; for instance, the development of medical apparatus. VRP is applied to solve the problem of high transportation cost of the studied organization with the searching techniques of saving algorithm to find the minimum total distance of operation route and satisfy available time constraints of voluntary medical staffs.
Abstract: This research paper designs a unique motion planner
of multiple platoons of nonholonomic car-like robots as a feasible
solution to the lane changing/merging maneuvers. The decentralized
planner with a leaderless approach and a path-guidance principle
derived from the Lyapunov-based control scheme generates collision
free avoidance and safe merging maneuvers from multiple lanes to a
single lane by deploying a split/merge strategy. The fixed obstacles
are the markings and boundaries of the road lanes, while the moving
obstacles are the robots themselves. Real and virtual road lane
markings and the boundaries of road lanes are incorporated into a
workspace to achieve the desired formation and configuration of the
robots. Convergence of the robots to goal configurations and the
repulsion of the robots from specified obstacles are achieved by
suitable attractive and repulsive potential field functions,
respectively. The results can be viewed as a significant contribution
to the avoidance algorithm of the intelligent vehicle systems (IVS).
Computer simulations highlight the effectiveness of the split/merge
strategy and the acceleration-based controllers.
Abstract: An accurate procedure to determine free vibrations of
beams and plates is presented.
The natural frequencies are exact solutions of governing vibration
equations witch load to a nonlinear homogeny system.
The bilinear and linear structures considered simulate a bridge.
The dynamic behavior of this one is analyzed by using the theory of
the orthotropic plate simply supported on two sides and free on the
two others. The plate can be excited by a convoy of constant or
harmonic loads. The determination of the dynamic response of the
structures considered requires knowledge of the free frequencies and
the shape modes of vibrations. Our work is in this context. Indeed,
we are interested to develop a self-consistent calculation of the Eigen
frequencies.
The formulation is based on the determination of the solution of
the differential equations of vibrations. The boundary conditions
corresponding to the shape modes permit to lead to a homogeneous
system. Determination of the noncommonplace solutions of this
system led to a nonlinear problem in Eigen frequencies.
We thus, develop a computer code for the determination of the
eigenvalues. It is based on a method of bisection with interpolation
whose precision reaches 10 -12. Moreover, to determine the
corresponding modes, the calculation algorithm that we develop uses
the method of Gauss with a partial optimization of the "pivots"
combined with an inverse power procedure. The Eigen frequencies
of a plate simply supported along two opposite sides while
considering the two other free sides are thus analyzed. The results
could be generalized with the case of a beam by regarding it as a
plate with low width.
We give, in this paper, some examples of treated cases. The
comparison with results presented in the literature is completely
satisfactory.
Abstract: This paper presents a simple and effective method for approximate indexing of instances for instance based learning. The method uses an interval tree to determine a good starting search point for the nearest neighbor. The search stops when an early stopping criterion is met. The method proved to be very effective especially when only the first nearest neighbor is required.
Abstract: This paper shows the results obtained in the analysis
of the impact of distributed generation (DG) on distribution losses
and presents a new algorithm to the optimal allocation of distributed
generation resources in distribution networks. The optimization is
based on a Hybrid Genetic Algorithm and Particle Swarm
Optimization (HGAPSO) aiming to optimal DG allocation in
distribution network. Through this algorithm a significant
improvement in the optimization goal is achieved. With a numerical
example the superiority of the proposed algorithm is demonstrated in
comparison with the simple genetic algorithm.
Abstract: The Far From Most Strings Problem (FFMSP) is to obtain a string which is far from as many as possible of a given set of strings. All the input and the output strings are of the same length, and two strings are said to be far if their hamming distance is greater than or equal to a given positive integer. FFMSP belongs to the class of sequences consensus problems which have applications in molecular biology. The problem is NP-hard; it does not admit a constant-ratio approximation either, unless P = NP. Therefore, in addition to exact and approximate algorithms, (meta)heuristic algorithms have been proposed for the problem in recent years. On the other hand, in the recent years, hybrid algorithms have been proposed and successfully used for many hard problems in a variety of domains. In this paper, a new metaheuristic algorithm, called Constructive Beam and Local Search (CBLS), is investigated for the problem, which is a hybridization of constructive beam search and local search algorithms. More specifically, the proposed algorithm consists of two phases, the first phase is to obtain several candidate solutions via the constructive beam search and the second phase is to apply local search to the candidate solutions obtained by the first phase. The best solution found is returned as the final solution to the problem. The proposed algorithm is also similar to memetic algorithms in the sense that both use local search to further improve individual solutions. The CBLS algorithm is compared with the most recent published algorithm for the problem, GRASP, with significantly positive results; the improvement is by order of magnitudes in most cases.
Abstract: Conceptualization strengthens intelligent systems in generalization skill, effective knowledge representation, real-time inference, and managing uncertain and indefinite situations in addition to facilitating knowledge communication for learning agents situated in real world. Concept learning introduces a way of abstraction by which the continuous state is formed as entities called concepts which are connected to the action space and thus, they illustrate somehow the complex action space. Of computational concept learning approaches, action-based conceptualization is favored because of its simplicity and mirror neuron foundations in neuroscience. In this paper, a new biologically inspired concept learning approach based on the probabilistic framework is proposed. This approach exploits and extends the mirror neuron-s role in conceptualization for a reinforcement learning agent in nondeterministic environments. In the proposed method, instead of building a huge numerical knowledge, the concepts are learnt gradually from rewards through interaction with the environment. Moreover the probabilistic formation of the concepts is employed to deal with uncertain and dynamic nature of real problems in addition to the ability of generalization. These characteristics as a whole distinguish the proposed learning algorithm from both a pure classification algorithm and typical reinforcement learning. Simulation results show advantages of the proposed framework in terms of convergence speed as well as generalization and asymptotic behavior because of utilizing both success and failures attempts through received rewards. Experimental results, on the other hand, show the applicability and effectiveness of the proposed method in continuous and noisy environments for a real robotic task such as maze as well as the benefits of implementing an incremental learning scenario in artificial agents.
Abstract: This paper describes a novel approach for deriving
modules from protein-protein interaction networks, which combines
functional information with topological properties of the network.
This approach is based on weighted clustering coefficient, which
uses weights representing the functional similarities between the
proteins. These weights are calculated according to the semantic
similarity between the proteins, which is based on their Gene
Ontology terms. We recently proposed an algorithm for identification
of functional modules, called SWEMODE (Semantic WEights for
MODule Elucidation), that identifies dense sub-graphs containing
functionally similar proteins. The rational underlying this approach is
that each module can be reduced to a set of triangles (protein triplets
connected to each other). Here, we propose considering semantic
similarity weights of all triangle-forming edges between proteins. We
also apply varying semantic similarity thresholds between
neighbours of each node that are not neighbours to each other (and
hereby do not form a triangle), to derive new potential triangles to
include in module-defining procedure. The results show an
improvement of pure topological approach, in terms of number of
predicted modules that match known complexes.
Abstract: In this paper, the innovative intelligent fuzzy weighted
input estimation method (FWIEM) can be applied to the inverse heat
transfer conduction problem (IHCP) to estimate the unknown
time-varying heat flux efficiently as presented. The feasibility of this
method can be verified by adopting the temperature measurement
experiment. We would like to focus attention on the heat flux
estimation to three kinds of samples (Copper, Iron and Steel/AISI 304)
with the same 3mm thickness. The temperature measurements are then
regarded as the inputs into the FWIEM to estimate the heat flux. The
experiment results show that the proposed algorithm can estimate the
unknown time-varying heat flux on-line.
Abstract: In this study four Holstein steers with rumen fistula
fed 7 kg of dry matter (DM) of diets differing in concentrate to
alfalfa hay ratios as 60:40, 70:30, 80:20, and 90:10 in a 4 × 4 latin
square design. The pH of the ruminal fluid was measured before
the morning feeding (0.0 h) to 8 h post feeding. In this study, a
two-layered feed-forward neural network trained by the
Levenberg-Marquardt algorithm was used for modelling of ruminal
pH. The input variables of the network were time, concentrate to
alfalfa hay ratios (C/F), non fiber carbohydrate (NFC) and neutral
detergent fiber (NDF). The output variable was the ruminal pH.
The modeling results showed that there was excellent agreement
between the experimental data and predicted values, with a high
determination coefficient (R2 >0.96). Therefore, we suggest using
these model-derived biological values to summarize continuously
recorded pH data.
Abstract: As a popular rank-reduced vector space approach,
Latent Semantic Indexing (LSI) has been used in information
retrieval and other applications. In this paper, an LSI-based content
vector model for text classification is presented, which constructs
multiple augmented category LSI spaces and classifies text by their
content. The model integrates the class discriminative information
from the training data and is equipped with several pertinent feature
selection and text classification algorithms. The proposed classifier
has been applied to email classification and its experiments on a
benchmark spam testing corpus (PU1) have shown that the approach
represents a competitive alternative to other email classifiers based
on the well-known SVM and naïve Bayes algorithms.
Abstract: In this paper, we present a novel approach to accurately
detect text regions including shop name in signboard images with
complex background for mobile system applications. The proposed
method is based on the combination of text detection using edge
profile and region segmentation using fuzzy c-means method. In the
first step, we perform an elaborate canny edge operator to extract all
possible object edges. Then, edge profile analysis with vertical and
horizontal direction is performed on these edge pixels to detect
potential text region existing shop name in a signboard. The edge
profile and geometrical characteristics of each object contour are
carefully examined to construct candidate text regions and classify the
main text region from background. Finally, the fuzzy c-means
algorithm is performed to segment and detected binarize text region.
Experimental results show that our proposed method is robust in text
detection with respect to different character size and color and can
provide reliable text binarization result.
Abstract: This paper describes a blind algorithm for estimating a time varying and frequency selective fading channel. In order to identify blindly the impulse response of these channels, we have used Higher Order Statistics (HOS) to build our algorithm. In this paper, we have selected two theoretical frequency selective channels as the Proakis-s 'B' channel and the Macchi-s channel, and one practical frequency selective fading channel called Broadband Radio Access Network (BRAN A). The simulation results in noisy environment and for different data input channel, demonstrate that the proposed method could estimate the phase and magnitude of these channels blindly and without any information about the input, except that the input excitation is i.i.d (Identically and Independent Distributed) and non-Gaussian.
Abstract: An inverse problem of doubly center matrices is discussed. By translating the constrained problem into unconstrained problem, two iterative methods are proposed. A numerical example illustrate our algorithms.
Abstract: A new dynamic clustering approach (DCPSO), based
on Particle Swarm Optimization, is proposed. This approach is
applied to unsupervised image classification. The proposed approach
automatically determines the "optimum" number of clusters and
simultaneously clusters the data set with minimal user interference.
The algorithm starts by partitioning the data set into a relatively large
number of clusters to reduce the effects of initial conditions. Using
binary particle swarm optimization the "best" number of clusters is
selected. The centers of the chosen clusters is then refined via the Kmeans
clustering algorithm. The experiments conducted show that
the proposed approach generally found the "optimum" number of
clusters on the tested images.
Abstract: This paper represents four unsupervised clustering algorithms namely sIB, RandomFlatClustering, FarthestFirst, and FilteredClusterer that previously works have not been used for network traffic classification. The methodology, the result, the products of the cluster and evaluation of these algorithms with efficiency of each algorithm from accuracy are shown. Otherwise, the efficiency of these algorithms considering form the time that it use to generate the cluster quickly and correctly. Our work study and test the best algorithm by using classify traffic anomaly in network traffic with different attribute that have not been used before. We analyses the algorithm that have the best efficiency or the best learning and compare it to the previously used (K-Means). Our research will be use to develop anomaly detection system to more efficiency and more require in the future.