Abstract: Many Asian languages, such as Korean and Japanese, are well-known for their wide use of sound symbolic words or ideophones. This is a very particular characteristic which enriches its lexicon hugely. Ideophones are a class of sound symbolic words that utilize sound symbolism to express aspects, states, emotions, or conditions that can be experienced through the senses, such as shape, color, smell, action or movement. Ideophones have very particular characteristics in terms of sound symbolism and morphology, which distinguish them from other words. The phonological characteristics of ideophones are vowel ablaut or vowel gradation and consonant mutation. In the case of Korean, there are light vowels and dark vowels. Depending on the type of vowel that is used, the meaning will slightly change. Consonant mutation, also known as consonant ablaut, contributes to the level of intensity, emphasis, and volume of an expression. In addition to these phonological characteristics, there is one main morphological singularity, which is reduplication and it carries the meaning of continuity, repetition, intensity, emphasis, and plurality. All these characteristics play an important role in both linguistics and literature as they enhance the meaning of what is trying to be expressed with incredible semantic detail, expressiveness, and rhythm. The following study will analyze the ideophones used in a single paragraph of a Korean novel, which add incredible yet subtle detail to the meaning of the words, and advance the expressiveness and rhythm of the text. The results from analyzing one paragraph from a novel, after presenting the phonological and morphological characteristics of Korean ideophones, will evidence the important role that ideophones play in literature.
Abstract: A total of 100 primary caregivers (mothers, fathers, grandparents) with at least one child or grandchild with a diagnosis of congenital bilateral profound deafness were assessed in order to evaluate the functionality of families with a deaf member, who was evaluated by specialists in audiology, molecular biology, genetics and psychology. After confirmation of the clinical diagnosis, DNA from the patients and parents were analyzed in search of the 35delG deletion of the GJB2 gene to determine who possessed the mutation. All primary caregivers were provided psychological support, regardless of whether or not they had the mutation, and prior and subsequent, the family APGAR test was applied. All parents, grandparents were informed of the results of the genetic analysis during the psychological intervention. The family APGAR, after psychological and genetic counseling, showed that 14% perceived their families as functional, 62% moderately functional and 24% dysfunctional. This shows the importance of psychological support in family functionality that has a direct impact on the quality of life of these families.
Abstract: In recent years, increasing usage of electrical energy provides a widespread field for investigating new methods to produce clean electricity with high reliability and cost management. Fuel cells are new clean generations to make electricity and thermal energy together with high performance and no environmental pollution. According to the expansion of fuel cell usage in different industrial networks, the identification and optimization of its parameters is really significant. This paper presents optimization of a proton exchange membrane fuel cell (PEMFC) parameters based on modified particle swarm optimization with real valued mutation (RVM) and clonal algorithms. Mathematical equations of this type of fuel cell are presented as the main model structure in the optimization process. Optimized parameters based on clonal and RVM algorithms are compared with the desired values in the presence and absence of measurement noise. This paper shows that these methods can improve the performance of traditional optimization methods. Simulation results are employed to analyze and compare the performance of these methodologies in order to optimize the proton exchange membrane fuel cell parameters.
Abstract: The power converter that feeds high-frequency, highvoltage
transformers must be carefully designed due to parasitic
components, mainly the secondary winding capacitance and the
leakage inductance, that introduces resonances in relatively lowfrequency
range, next to the switching frequency. This paper
considers applications in which the load (resistive) has an
unpredictable behavior, changing from open to short-circuit condition
faster than the output voltage control loop could react. In this context,
to avoid overvoltage and over current situations, that could damage
the converter, the transformer or the load, it is necessary to find an
operation point that assure the desired output voltage in spite of the
load condition. This can done adjusting the frequency response of the
transformer adding an external inductance, together with selecting the
switching frequency to get stable output voltage independently of the
load.
Abstract: This paper presents an efficient approach to feeder
reconfiguration for power loss reduction and voltage profile
imprvement in unbalanced radial distribution systems (URDS). In
this paper Genetic Algorithm (GA) is used to obtain solution for
reconfiguration of radial distribution systems to minimize the losses.
A forward and backward algorithm is used to calculate load flows in
unbalanced distribution systems. By simulating the survival of the
fittest among the strings, the optimum string is searched by
randomized information exchange between strings by performing
crossover and mutation. Results have shown that proposed algorithm
has advantages over previous algorithms The proposed method is
effectively tested on 19 node and 25 node unbalanced radial
distribution systems.
Abstract: The presented work is motivated by a French law
regarding nuclear waste management. A new conceptual Accelerator
Driven System (ADS) designed for the Minor Actinides (MA)
transmutation has been assessed by numerical simulation. The
MUltiple Spallation Target (MUST) ADS combines high thermal power (up to 1.4 GWth) and high specific power. A 30 mA and 1
GeV proton beam is divided into three secondary beams transmitted on three liquid lead-bismuth spallation targets. Neutron and thermalhydraulic
simulations have been performed with the code MURE, based on the Monte-Carlo transport code MCNPX. A methodology has been developed to define characteristic of the MUST ADS concept according to a specific transmutation scenario. The reference
scenario is based on a MA flux (neptunium, americium and curium)
providing from European Fast Reactor (EPR) and a plutonium multireprocessing
strategy is accounted for. The MUST ADS reference
concept is a sodium cooled fast reactor. The MA fuel at equilibrium is mixed with MgO inert matrix to limit the core reactivity and
improve the fuel thermal conductivity. The fuel is irradiated over five
years. Five years of cooling and two years for the fuel fabrication are
taken into account. The MUST ADS reference concept burns about 50% of the initial MA inventory during a complete cycle. In term of
mass, up to 570 kg/year are transmuted in one concept. The methodology to design the MUST ADS and to calculate fuel
composition at equilibrium is precisely described in the paper. A detailed fuel evolution analysis is performed and the reference scenario is compared to a scenario where only americium transmutation is performed.
Abstract: This paper presents a comparative study of Ant Colony and Genetic Algorithms for VLSI circuit bi-partitioning. Ant colony optimization is an optimization method based on behaviour of social insects [27] whereas Genetic algorithm is an evolutionary optimization technique based on Darwinian Theory of natural evolution and its concept of survival of the fittest [19]. Both the methods are stochastic in nature and have been successfully applied to solve many Non Polynomial hard problems. Results obtained show that Genetic algorithms out perform Ant Colony optimization technique when tested on the VLSI circuit bi-partitioning problem.
Abstract: This paper proposes a new approach for image encryption
using a combination of different permutation techniques.
The main idea behind the present work is that an image can be
viewed as an arrangement of bits, pixels and blocks. The intelligible
information present in an image is due to the correlations among the
bits, pixels and blocks in a given arrangement. This perceivable information
can be reduced by decreasing the correlation among the bits,
pixels and blocks using certain permutation techniques. This paper
presents an approach for a random combination of the aforementioned
permutations for image encryption. From the results, it is observed
that the permutation of bits is effective in significantly reducing the
correlation thereby decreasing the perceptual information, whereas
the permutation of pixels and blocks are good at producing higher
level security compared to bit permutation. A random combination
method employing all the three techniques thus is observed to be
useful for tactical security applications, where protection is needed
only against a casual observer.
Abstract: A novel method of individual level adaptive mutation rate control called the rank-scaled mutation rate for genetic algorithms is introduced. The rank-scaled mutation rate controlled genetic algorithm varies the mutation parameters based on the rank of each individual within the population. Thereby the distribution of the fitness of the papulation is taken into consideration in forming the new mutation rates. The best fit mutate at the lowest rate and the least fit mutate at the highest rate. The complexity of the algorithm is of the order of an individual adaptation scheme and is lower than that of a self-adaptation scheme. The proposed algorithm is tested on two common problems, namely, numerical optimization of a function and the traveling salesman problem. The results show that the proposed algorithm outperforms both the fixed and deterministic mutation rate schemes. It is best suited for problems with several local optimum solutions without a high demand for excessive mutation rates.
Abstract: Every 2-3 years the influenza B virus serves
epidemics. Neuraminidase (NA) is an important target for influenza
drug design. Although, oseltamivir, an oral neuraminidase drug, has
been shown good inhibitory efficiency against wild-type of influenza
B virus, the lower susceptibility to the R152K mutation has been
reported. Better understanding of oseltamivir efficiency and
resistance toward the influenza B NA wild-type and R152K mutant,
respectively, could be useful for rational drug design. Here, two
complex systems of wild-type and R152K NAs with oseltamivir
bound were studied using molecular dynamics (MD) simulations.
Based on 5-ns MD simulation, the loss of notable hydrogen bond and
decrease in per-residue decomposition energy from the mutated
residue K152 contributed to drug compared to those of R152 in wildtype
were found to be a primary source of high-level of oseltamivir
resistance due to the R152K mutation.
Abstract: The Block Sorting problem is to sort a given
permutation moving blocks. A block is defined as a substring
of the given permutation, which is also a substring of the
identity permutation. Block Sorting has been proved to be
NP-Hard. Until now two different 2-Approximation algorithms
have been presented for block sorting. These are the best known
algorithms for Block Sorting till date. In this work we present
a different characterization of Block Sorting in terms of a
transposition cycle graph. Then we suggest a heuristic,
which we show to exhibit a 2-approximation performance
guarantee for most permutations.
Abstract: Random Forests are a powerful classification technique, consisting of a collection of decision trees. One useful feature of Random Forests is the ability to determine the importance of each variable in predicting the outcome. This is done by permuting each variable and computing the change in prediction accuracy before and after the permutation. This variable importance calculation is similar to a one-factor-at a time experiment and therefore is inefficient. In this paper, we use a regular fractional factorial design to determine which variables to permute. Based on the results of the trials in the experiment, we calculate the individual importance of the variables, with improved precision over the standard method. The method is illustrated with a study of student attrition at Monash University.
Abstract: Optimal reactive power flow is an optimization problem
with one or more objective of minimizing the active power losses for
fixed generation schedule. The control variables are generator bus
voltages, transformer tap settings and reactive power output of the
compensating devices placed on different bus bars. Biogeography-
Based Optimization (BBO) technique has been applied to solve
different kinds of optimal reactive power flow problems subject
to operational constraints like power balance constraint, line flow
and bus voltages limits etc. BBO searches for the global optimum
mainly through two steps: Migration and Mutation. In the present
work, BBO has been applied to solve the optimal reactive power
flow problems on IEEE 30-bus and standard IEEE 57-bus power
systems for minimization of active power loss. The superiority of the
proposed method has been demonstrated. Considering the quality of
the solution obtained, the proposed method seems to be a promising
one for solving these problems.
Abstract: Evolutionary robotics is concerned with the design of
intelligent systems with life-like properties by means of simulated
evolution. Approaches in evolutionary robotics can be categorized
according to the control structures that represent the behavior and the
parameters of the controller that undergo adaptation. The basic idea
is to automatically synthesize behaviors that enable the robot to
perform useful tasks in complex environments. The evolutionary
algorithm searches through the space of parameterized controllers
that map sensory perceptions to control actions, thus realizing a
specific robotic behavior. Further, the evolutionary algorithm
maintains and improves a population of candidate behaviors by
means of selection, recombination and mutation. A fitness function
evaluates the performance of the resulting behavior according to the
robot-s task or mission. In this paper, the focus is in the use of
genetic algorithms to solve a multi-objective optimization problem
representing robot behaviors; in particular, the A-Compander Law is
employed in selecting the weight of each objective during the
optimization process. Results using an adaptive fitness function show
that this approach can efficiently react to complex tasks under
variable environments.
Abstract: Bioinformatics and computational biology involve
the use of techniques including applied mathematics,
informatics, statistics, computer science, artificial intelligence,
chemistry, and biochemistry to solve biological problems
usually on the molecular level. Research in computational
biology often overlaps with systems biology. Major research
efforts in the field include sequence alignment, gene finding,
genome assembly, protein structure alignment, protein structure
prediction, prediction of gene expression and proteinprotein
interactions, and the modeling of evolution. Various
global rearrangements of permutations, such as reversals and
transpositions,have recently become of interest because of their
applications in computational molecular biology. A reversal is
an operation that reverses the order of a substring of a permutation.
A transposition is an operation that swaps two adjacent
substrings of a permutation. The problem of determining the
smallest number of reversals required to transform a given
permutation into the identity permutation is called sorting by
reversals. Similar problems can be defined for transpositions
and other global rearrangements. In this work we perform a
study about some genome rearrangement primitives. We show
how a genome is modelled by a permutation, introduce some
of the existing primitives and the lower and upper bounds
on them. We then provide a comparison of the introduced
primitives.
Abstract: Evolutionary Programming (EP) represents a
methodology of Evolutionary Algorithms (EA) in which mutation is
considered as a main reproduction operator. This paper presents a
novel EP approach for Artificial Neural Networks (ANN) learning.
The proposed strategy consists of two components: the self-adaptive,
which contains phenotype information and the dynamic, which is
described by genotype. Self-adaptation is achieved by the addition of
a value, called the network weight, which depends on a total number
of hidden layers and an average number of neurons in hidden layers.
The dynamic component changes its value depending on the fitness
of a chromosome, exposed to mutation. Thus, the mutation step size
is controlled by two components, encapsulated in the algorithm,
which adjust it according to the characteristics of a predefined ANN
architecture and the fitness of a particular chromosome. The
comparative analysis of the proposed approach and the classical EP
(Gaussian mutation) showed, that that the significant acceleration of
the evolution process is achieved by using both phenotype and
genotype information in the mutation strategy.
Abstract: Brand name plays a vital role for in-shop buying
behavior of consumers and mutated brand name may affect the
selling of leading branded products. In Indian market, there are many
products with mutated brand names which are either orthographically
or phonologically similar. Due to presence of such products, Indian
consumers very often fall under confusion when buying some
regularly used stuff. Authors of the present paper have attempted to
demonstrate relationship between less attention and false recognition
of mutated brand names during a product selection process. To
achieve this goal, visual attention study was conducted on 15 male
college students using eye-tracker against a mutated brand name and
errors in recognition were noted using questionnaire. Statistical
analysis of the acquired data revealed that there was more false
recognition of mutated brand name when less attention was paid
during selection of favorite product. Moreover, it was perceived that
eye tracking is an effective tool for analyzing false recognition of
brand name mutation.