Abstract: This work presents a new phonetic transcription system based on a tree of hierarchical pronunciation rules expressed as context-specific grapheme-phoneme correspondences. The tree is automatically inferred from a phonetic dictionary by incrementally analyzing deeper context levels, eventually representing a minimum set of exhaustive rules that pronounce without errors all the words in the training dictionary and that can be applied to out-of-vocabulary words. The proposed approach improves upon existing rule-tree-based techniques in that it makes use of graphemes, rather than letters, as elementary orthographic units. A new linear algorithm for the segmentation of a word in graphemes is introduced to enable outof- vocabulary grapheme-based phonetic transcription. Exhaustive rule trees provide a canonical representation of the pronunciation rules of a language that can be used not only to pronounce out-of-vocabulary words, but also to analyze and compare the pronunciation rules inferred from different dictionaries. The proposed approach has been implemented in C and tested on Oxford British English and Basic English. Experimental results show that grapheme-based rule trees represent phonetically sound rules and provide better performance than letter-based rule trees.
Abstract: A transient finite element model has been developed
to study the heat transfer and fluid flow during spot Gas Tungsten
Arc Welding (GTAW) on stainless steel. Temperature field, fluid
velocity and electromagnetic fields are computed inside the cathode,
arc-plasma and anode using a unified MHD formulation. The
developed model is then used to study the influence of different
helium-argon gas mixtures on both the energy transferred to the
workpiece and the time evolution of the weld pool dimensions. It is
found that the addition of helium to argon increases the heat flux
density on the weld axis by a factor that can reach 6.5. This induces
an increase in the weld pool depth by a factor of 3. It is also found
that the addition of only 10% of argon to helium decreases
considerably the weld pool depth, which is due to the electrical
conductivity of the mixture that increases significantly when argon is
added to helium.
Abstract: Snake bite cases in Malaysia most often involve the
species Naja-naja and Calloselasma rhodostoma. In keeping with the
need for a rapid snake venom detection kit in a clinical setting, plate
and dot-ELISA test for the venoms of Naja-naja sumatrana,
Calloselasma rhodostoma and the cobra venom fraction V antigen
was developed. Polyclonal antibodies were raised and further used to
prepare the reagents for the dot-ELISA test kit which was tested in
mice, rabbit and virtual human models. The newly developed dot-
ELISA kit was able to detect a minimum venom concentration of
244ng/ml with cross reactivity of one antibody type. The dot-ELISA
system was sensitive and specific for all three snake venom types in
all tested animal models. The lowest minimum venom concentration
detectable was in the rabbit model, 244ng/ml of the cobra venom
fraction V antigen. The highest minimum venom concentration was
in mice, 1953ng/ml against a multitude of venoms. The developed
dot-ELISA system for the detection of three snake venom types was
successful with a sensitivity of 95.8% and specificity of 97.9%.
Abstract: This research deals with a flexible flowshop
scheduling problem with arrival and delivery of jobs in groups and
processing them individually. Due to the special characteristics of
each job, only a subset of machines in each stage is eligible to
process that job. The objective function deals with minimization of
sum of the completion time of groups on one hand and minimization
of sum of the differences between completion time of jobs and
delivery time of the group containing that job (waiting period) on the
other hand. The problem can be stated as FFc / rj , Mj / irreg which
has many applications in production and service industries. A
mathematical model is proposed, the problem is proved to be NPcomplete,
and an effective heuristic method is presented to schedule
the jobs efficiently. This algorithm can then be used within the body
of any metaheuristic algorithm for solving the problem.
Abstract: The objective of the presented work is to implement the Kalman Filter into an application that reduces the influence of the environmental changes over the robot expected to navigate over a terrain of varying friction properties. The Discrete Kalman Filter is used to estimate the robot position, project the estimated current state ahead at time through time update and adjust the projected estimated state by an actual measurement at that time via the measurement update using the data coming from the infrared sensors, ultrasonic sensors and the visual sensor respectively. The navigation test has been performed in a real world environment and has been found to be robust.
Abstract: The prevalence of non organic constipation differs
from country to country and the reliability of the estimate rates is
uncertain. Moreover, the clinical relevance of subdividing the
heterogeneous functional constipation disorders into pre-defined
subgroups is largely unknown.. Aim: to estimate the prevalence of
constipation in a population-based sample and determine whether
clinical subgroups can be identified. An age and gender stratified
sample population from 5 Italian cities was evaluated using a
previously validated questionnaire. Data mining by cluster analysis
was used to determine constipation subgroups. Results: 1,500
complete interviews were obtained from 2,083 contacted households
(72%). Self-reported constipation correlated poorly with symptombased
constipation found in 496 subjects (33.1%). Cluster analysis
identified four constipation subgroups which correlated to subgroups
identified according to pre-defined symptom criteria. Significant
differences in socio-demographics and lifestyle were observed
among subgroups.
Abstract: This article explores the sociological perspectives on
social problems and the role of the media which has a delicate role to
tread in balancing its duty to the public and the victim Whilst social
problems have objective conditions, it is the subjective definition of
such problems that ensure which social problem comes to the fore
and which doesn-t. Further it explores the roles and functions of
policymakers when addressing social problems and the impact of the
inception of media profiling as well as the advantages and
disadvantages of media profiling towards social problems. It focuses
on the inception of media profiling due to its length and a follow up
article will explore how current media profiling towards social
problems have evolved since its inception.
Abstract: This paper explores university course timetabling
problem. There are several characteristics that make scheduling and
timetabling problems particularly difficult to solve: they have huge
search spaces, they are often highly constrained, they require
sophisticated solution representation schemes, and they usually
require very time-consuming fitness evaluation routines. Thus
standard evolutionary algorithms lack of efficiency to deal with
them. In this paper we have proposed a memetic algorithm that
incorporates the problem specific knowledge such that most of
chromosomes generated are decoded into feasible solutions.
Generating vast amount of feasible chromosomes makes the progress
of search process possible in a time efficient manner. Experimental
results exhibit the advantages of the developed Hybrid Genetic
Algorithm than the standard Genetic Algorithm.
Abstract: This paper presented a modified efficient inductive
powering link based on ASK modulator and proposed efficient class-
E power amplifier. The design presents the external part which is
located outside the body to transfer power and data to the implanted
devices such as implanted Microsystems to stimulate and monitoring
the nerves and muscles. The system operated with low band
frequency 10MHZ according to industrial- scientific – medical (ISM)
band to avoid the tissue heating. For external part, the modulation
index is 11.1% and the modulation rate 7.2% with data rate 1 Mbit/s
assuming Tbit = 1us. The system has been designed using 0.35-μm
fabricated CMOS technology. The mathematical model is given and
the design is simulated using OrCAD P Spice 16.2 software tool and
for real-time simulation, the electronic workbench MULISIM 11 has
been used.
Abstract: TUSAT is a prospective Turkish
Communication Satellite designed for providing mainly data
communication and broadcasting services through Ku-Band
and C-Band channels. Thermal control is a vital issue in
satellite design process. Therefore, all satellite subsystems and
equipments should be maintained in the desired temperature
range from launch to end of maneuvering life. The main
function of the thermal control is to keep the equipments and
the satellite structures in a given temperature range for various
phases and operating modes of spacecraft during its lifetime.
This paper describes the thermal control design which uses
passive and active thermal control concepts. The active
thermal control is based on heaters regulated by software via
thermistors. Alternatively passive thermal control composes of
heat pipes, multilayer insulation (MLI) blankets, radiators,
paints and surface finishes maintaining temperature level of
the overall carrier components within an acceptable value.
Thermal control design is supported by thermal analysis using
thermal mathematical models (TMM).
Abstract: Thanks to the interdisciplinary nature of crises, the
position of researchers in that field is rather difficult. Very often the
traditional methods of research cannot be applied there. The article is
aimed at the changes in crises research. It describes the substance of
individual changes and emphasizes the shift in research approaches
to the crisis.
Abstract: Scheduling of diversified service requests in
distributed computing is a critical design issue. Cloud is a type of
parallel and distributed system consisting of a collection of
interconnected and virtual computers. It is not only the clusters and
grid but also it comprises of next generation data centers. The paper
proposes an initial heuristic algorithm to apply modified ant colony
optimization approach for the diversified service allocation and
scheduling mechanism in cloud paradigm. The proposed optimization
method is aimed to minimize the scheduling throughput to service all
the diversified requests according to the different resource allocator
available under cloud computing environment.
Abstract: Least Significant Bit (LSB) technique is the earliest
developed technique in watermarking and it is also the most simple,
direct and common technique. It essentially involves embedding the
watermark by replacing the least significant bit of the image data with
a bit of the watermark data. The disadvantage of LSB is that it is not
robust against attacks. In this study intermediate significant bit (ISB)
has been used in order to improve the robustness of the watermarking
system. The aim of this model is to replace the watermarked image
pixels by new pixels that can protect the watermark data against
attacks and at the same time keeping the new pixels very close to the
original pixels in order to protect the quality of watermarked image.
The technique is based on testing the value of the watermark pixel
according to the range of each bit-plane.
Abstract: This paper presents a new circuit arrangement for a
current-mode Wheatstone bridge that is suitable for low-voltage
integrated circuits implementation. Compared to the other proposed
circuits, this circuit features severe reduction of the elements number,
low supply voltage (1V) and low power consumption (
Abstract: Bagging and boosting are among the most popular resampling ensemble methods that generate and combine a diversity of classifiers using the same learning algorithm for the base-classifiers. Boosting algorithms are considered stronger than bagging on noisefree data. However, there are strong empirical indications that bagging is much more robust than boosting in noisy settings. For this reason, in this work we built an ensemble using a voting methodology of bagging and boosting ensembles with 10 subclassifiers in each one. We performed a comparison with simple bagging and boosting ensembles with 25 sub-classifiers, as well as other well known combining methods, on standard benchmark datasets and the proposed technique was the most accurate.
Abstract: An experimental campaign of measurements for a
Darrieus vertical-axis wind turbine (VAWT) is presented for open
field conditions. The turbine is characterized by a twisted bladed
design, each blade being placed at a fixed distance from the rotational
shaft. The experimental setup to perform the acquisitions is described.
The results are lower than expected, due to the high influence of the
wind shear.
Abstract: This paper deals with the helical flow of a Newtonian
fluid in an infinite circular cylinder, due to both longitudinal and
rotational shear stress. The velocity field and the resulting shear
stress are determined by means of the Laplace and finite Hankel
transforms and satisfy all imposed initial and boundary conditions.
For large times, these solutions reduce to the well-known steady-state
solutions.
Abstract: In the present work, we propose a new technique to
enhance the learning capabilities and reduce the computation
intensity of a competitive learning multi-layered neural network
using the K-means clustering algorithm. The proposed model use
multi-layered network architecture with a back propagation learning
mechanism. The K-means algorithm is first applied to the training
dataset to reduce the amount of samples to be presented to the neural
network, by automatically selecting an optimal set of samples. The
obtained results demonstrate that the proposed technique performs
exceptionally in terms of both accuracy and computation time when
applied to the KDD99 dataset compared to a standard learning
schema that use the full dataset.
Abstract: Decrease in hardware costs and advances in computer
networking technologies have led to increased interest in the use of
large-scale parallel and distributed computing systems. One of the
biggest issues in such systems is the development of effective
techniques/algorithms for the distribution of the processes/load of a
parallel program on multiple hosts to achieve goal(s) such as
minimizing execution time, minimizing communication delays,
maximizing resource utilization and maximizing throughput.
Substantive research using queuing analysis and assuming job
arrivals following a Poisson pattern, have shown that in a multi-host
system the probability of one of the hosts being idle while other host
has multiple jobs queued up can be very high. Such imbalances in
system load suggest that performance can be improved by either
transferring jobs from the currently heavily loaded hosts to the lightly
loaded ones or distributing load evenly/fairly among the hosts .The
algorithms known as load balancing algorithms, helps to achieve the
above said goal(s). These algorithms come into two basic categories -
static and dynamic. Whereas static load balancing algorithms (SLB)
take decisions regarding assignment of tasks to processors based on
the average estimated values of process execution times and
communication delays at compile time, Dynamic load balancing
algorithms (DLB) are adaptive to changing situations and take
decisions at run time.
The objective of this paper work is to identify qualitative
parameters for the comparison of above said algorithms. In future this
work can be extended to develop an experimental environment to
study these Load balancing algorithms based on comparative
parameters quantitatively.
Abstract: This paper simulates the ad-hoc mesh network in rural areas, where such networks receive great attention due to their cost, since installing the infrastructure for regular networks in these areas is not possible due to the high cost. The distance between the communicating nodes is the most obstacles that the ad-hoc mesh network will face. For example, in Terranet technology, two nodes can communicate if they are only one kilometer far from each other. However, if the distance between them is more than one kilometer, then each node in the ad-hoc mesh networks has to act as a router that forwards the data it receives to other nodes. In this paper, we try to find the critical number of nodes which makes the network fully connected in a particular area, and then propose a method to enhance the intermediate node to accept to be a router to forward the data from the sender to the receiver. Much work was done on technological changes on peer to peer networks, but the focus of this paper will be on another feature which is to find the minimum number of nodes needed for a particular area to be fully connected and then to enhance the users to switch on their phones and accept to work as a router for other nodes. Our method raises the successful calls to 81.5% out of 100% attempt calls.