Abstract: This paper presents an algebraic approach to optimize
queries in domain-specific database management system
for protein structure data. The approach involves the introduction of
several protein structure specific algebraic operators to query the
complex data stored in an object-oriented database system. The
Protein Algebra provides an extensible set of high-level Genomic
Data Types and Protein Data Types along with a comprehensive
collection of appropriate genomic and protein functions. The paper
also presents a query translator that converts high-level query
specifications in algebra into low-level query specifications in
Protein-QL, a query language designed to query protein structure
data. The query transformation process uses a Protein Ontology that
serves the purpose of a dictionary.
Abstract: Internet is without any doubt the fastest and effective mean of communication making it possible to reach a great number of people in the world. It draws its base from exchange points. Indeed exchange points are used to inter-connect various Internet suppliers and operators in order to allow them to exchange traffic and it is with these interconnections that Internet made its great strides. They thus make it possible to limit the traffic delivered via the operators of transits. This limitation allows a significant improvement of the quality of service, a reduction in the latency time just as a reduction of the cost of connection for the final subscriber. Through this article we will show how the installation of an IXP allows an improvement and a diversification of the services just as a reduction of the Internet connection costs.
Abstract: Parallel Prefix addition is a technique for improving
the speed of binary addition. Due to continuing integrating intensity
and the growing needs of portable devices, low-power and highperformance
designs are of prime importance. The classical parallel
prefix adder structures presented in the literature over the years
optimize for logic depth, area, fan-out and interconnect count of logic
circuits. In this paper, a new architecture for performing 8-bit, 16-bit
and 32-bit Parallel Prefix addition is proposed. The proposed prefix
adder structures is compared with several classical adders of same
bit width in terms of power, delay and number of computational
nodes. The results reveal that the proposed structures have the least
power delay product when compared with its peer existing Prefix
adder structures. Tanner EDA tool was used for simulating the adder
designs in the TSMC 180 nm and TSMC 130 nm technologies.
Abstract: We present an operator for a propositional linear temporal logic over infinite schedules of iterated transactions, which, when applied to a formula, asserts that any schedule satisfying the formula is serializable. The resulting logic is suitable for specifying and verifying consistency properties of concurrent transaction management systems, that can be defined in terms of serializability, as well as other general safety and liveness properties. A strict form of serializability is used requiring that, whenever the read and write steps of a transaction occurrence precede the read and write steps of another transaction occurrence in a schedule, the first transaction must precede the second transaction in an equivalent serial schedule. This work improves on previous work in providing a propositional temporal logic with a serializability operator that is of the same PSPACE complete computational complexity as standard propositional linear temporal logic without a serializability operator.
Abstract: A cell-centered finite volume scheme for discretizing diffusion operators on distorted quadrilateral meshes has recently been designed and added to APMFCG to enable that code to be used as a tool for studying explosive magnetic flux compression generators. This paper describes this scheme. Comparisons with analytic results for 2-D test cases are presented, as well as 2-D results from a test of a "realistic" generator configuration.
Abstract: A systematic and exhaustive method based on the group
structure of a unitary Lie algebra is proposed to generate an enormous
number of quantum codes. With respect to the algebraic structure,
the orthogonality condition, which is the central rule of generating
quantum codes, is proved to be fully equivalent to the distinguishability
of the elements in this structure. In addition, four types of
quantum codes are classified according to the relation of the codeword
operators and some initial quantum state. By linking the unitary Lie
algebra with the additive group, the classical correspondences of some
of these quantum codes can be rendered.
Abstract: Wind farms (WFs) with high level of penetration are
being established in power systems worldwide more rapidly than
other renewable resources. The Independent System Operator (ISO),
as a policy maker, should propose appropriate places for WF
installation in order to maximize the benefits for the investors. There
is also a possibility of congestion relief using the new installation of
WFs which should be taken into account by the ISO when proposing
the locations for WF installation. In this context, efficient wind farm
(WF) placement method is proposed in order to reduce burdens on
congested lines. Since the wind speed is a random variable and load
forecasts also contain uncertainties, probabilistic approaches are used
for this type of study. AC probabilistic optimal power flow (P-OPF)
is formulated and solved using Monte Carlo Simulations (MCS). In
order to reduce computation time, point estimate methods (PEM) are
introduced as efficient alternative for time-demanding MCS.
Subsequently, WF optimal placement is determined using generation
shift distribution factors (GSDF) considering a new parameter
entitled, wind availability factor (WAF). In order to obtain more
realistic results, N-1 contingency analysis is employed to find the
optimal size of WF, by means of line outage distribution factors
(LODF). The IEEE 30-bus test system is used to show and compare
the accuracy of proposed methodology.
Abstract: In two studies we tested the hypothesis that the
appropriate linguistic formulation of a deontic rule – i.e. the
formulation which clarifies the monadic nature of deontic operators
- should produce more correct responses than the conditional
formulation in Wason selection task. We tested this assumption by
presenting a prescription rule and a prohibition rule in conditional
vs. proper deontic formulation. We contrasted this hypothesis with
two other hypotheses derived from social contract theory and
relevance theory. According to the first theory, a deontic rule
expressed in terms of cost-benefit should elicit a cheater detection
module, sensible to mental states attributions and thus able to
discriminate intentional rule violations from accidental rule
violations. We tested this prevision by distinguishing the two types
of violations. According to relevance theory, performance in
selection task should improve by increasing cognitive effect and
decreasing cognitive effort. We tested this prevision by focusing
experimental instructions on the rule vs. the action covered by the
rule. In study 1, in which 480 undergraduates participated, we
tested these predictions through a 2 x 2 x 2 x 2 (type of the rule x
rule formulation x type of violation x experimental instructions)
between-subjects design. In study 2 – carried out by means of a 2 x
2 (rule formulation x type of violation) between-subjects design -
we retested the hypothesis of rule formulation vs. the cheaterdetection
hypothesis through a new version of selection task in
which intentional vs. accidental rule violations were better
discriminated. 240 undergraduates participated in this study.
Results corroborate our hypothesis and challenge the contrasting
assumptions. However, they show that the conditional formulation
of deontic rules produces a lower performance than what is
reported in literature.
Abstract: In this paper we define generalized differential operators from some well-known operators on the class A of analytic functions in the unit disk U = {z ∈ C : |z| < 1}. New classes containing these operators are investigated. Also univalence of integral operator is considered.
Abstract: A geothermal power plant multiple simulator for
operators training is presented. The simulator is designed to be
installed in a wireless local area network and has a capacity to train
one to six operators simultaneously, each one with an independent
simulation session. The sessions must be supervised only by one
instructor. The main parts of this multiple simulator are: instructor
and operator-s stations. On the instructor station, the instructor
controls the simulation sessions, establishes training exercises and
supervises each power plant operator in individual way. This station
is hosted in a Main Personal Computer (NS) and its main functions
are: to set initial conditions, snapshots, malfunctions or faults,
monitoring trends, and process and soft-panel diagrams. On the other
hand the operators carry out their actions over the power plant
simulated on the operator-s stations; each one is also hosted in a PC.
The main software of instructor and operator-s stations are executed
on the same NS and displayed in PCs through graphical Interactive
Process Diagrams (IDP). The geothermal multiple simulator has been
installed in the Geothermal Simulation Training Center (GSTC) of
the Comisi├│n Federal de Electricidad, (Federal Commission of
Electricity, CFE), Mexico, and is being utilized as a part of the
training courses for geothermal power plant operators.
Abstract: This research work is concerned with the eigenvalue problem for the integral operators which are obtained by linearization of a nonlocal evolution equation. The purpose of section II.A is to describe the nature of the problem and the objective of the project. The problem is related to the “stable solution" of the evolution equation which is the so-called “instanton" that describe the interface between two stable phases. The analysis of the instanton and its asymptotic behavior are described in section II.C by imposing the Green function and making use of a probability kernel. As a result , a classical Theorem which is important for an instanton is proved. Section III devoted to a study of the integral operators related to interface dynamics which concern the analysis of the Cauchy problem for the evolution equation with initial data close to different phases and different regions of space.
Abstract: At present, intelligent planning in the Graphplan framework is a focus of artificial intelligence. While the Creating or Destroying Objects Planning (CDOP) is one unsolved problem of this field, one of the difficulties, too. In this paper, we study this planning problem and bring forward the idea of transforming objects to propositions, based on which we offer an algorithm, Creating or Destroying Objects in the Graphplan framework (CDOGP). Compared to Graphplan, the new algorithm can solve not only the entire problems that Graphplan do, but also a part of CDOP. It is for the first time that we introduce the idea of object-proposition, and we emphasize the discussion on the representations of creating or destroying objects operator and an algorithm in the Graphplan framework. In addition, we analyze the complexity of this algorithm.
Abstract: Kernel function, which allows the formulation of nonlinear variants of any algorithm that can be cast in terms of dot products, makes the Support Vector Machines (SVM) have been successfully applied in many fields, e.g. classification and regression. The importance of kernel has motivated many studies on its composition. It-s well-known that reproducing kernel (R.K) is a useful kernel function which possesses many properties, e.g. positive definiteness, reproducing property and composing complex R.K by simple operation. There are two popular ways to compute the R.K with explicit form. One is to construct and solve a specific differential equation with boundary value whose handicap is incapable of obtaining a unified form of R.K. The other is using a piecewise integral of the Green function associated with a differential operator L. The latter benefits the computation of a R.K with a unified explicit form and theoretical analysis, whereas there are relatively later studies and fewer practical computations. In this paper, a new algorithm for computing a R.K is presented. It can obtain the unified explicit form of R.K in general reproducing kernel Hilbert space. It avoids constructing and solving the complex differential equations manually and benefits an automatic, flexible and rigorous computation for more general RKHS. In order to validate that the R.K computed by the algorithm can be used in SVM well, some illustrative examples and a comparison between R.K and Gaussian kernel (RBF) in support vector regression are presented. The result shows that the performance of R.K is close or slightly superior to that of RBF.
Abstract: We consider different types of aggregation operators
such as the heavy ordered weighted averaging (HOWA) operator and
the fuzzy ordered weighted averaging (FOWA) operator. We
introduce a new extension of the OWA operator called the fuzzy
heavy ordered weighted averaging (FHOWA) operator. The main
characteristic of this aggregation operator is that it deals with
uncertain information represented in the form of fuzzy numbers (FN)
in the HOWA operator. We develop the basic concepts of this
operator and study some of its properties. We also develop a wide
range of families of FHOWA operators such as the fuzzy push up
allocation, the fuzzy push down allocation, the fuzzy median
allocation and the fuzzy uniform allocation.
Abstract: Reactiondiffusion systems are mathematical models that describe how the concentration of one or more substances distributed in space changes under the influence of local chemical reactions in which the substances are converted into each other, and diffusion which causes the substances to spread out in space. The classical representation of a reaction-diffusion system is given by semi-linear parabolic partial differential equations, whose general form is ÔêétX(x, t) = DΔX(x, t), where X(x, t) is the state vector, D is the matrix of the diffusion coefficients and Δ is the Laplace operator. If the solute move in an homogeneous system in thermal equilibrium, the diffusion coefficients are constants that do not depend on the local concentration of solvent and of solutes and on local temperature of the medium. In this paper a new stochastic reaction-diffusion model in which the diffusion coefficients are function of the local concentration, viscosity and frictional forces of solvent and solute is presented. Such a model provides a more realistic description of the molecular kinetics in non-homogenoeus and highly structured media as the intra- and inter-cellular spaces. The movement of a molecule A from a region i to a region j of the space is described as a first order reaction Ai k- → Aj , where the rate constant k depends on the diffusion coefficient. Representing the diffusional motion as a chemical reaction allows to assimilate a reaction-diffusion system to a pure reaction system and to simulate it with Gillespie-inspired stochastic simulation algorithms. The stochastic time evolution of the system is given by the occurrence of diffusion events and chemical reaction events. At each time step an event (reaction or diffusion) is selected from a probability distribution of waiting times determined by the specific speed of reaction and diffusion events. Redi is the software tool, developed to implement the model of reaction-diffusion kinetics and dynamics. It is a free software, that can be downloaded from http://www.cosbi.eu. To demonstrate the validity of the new reaction-diffusion model, the simulation results of the chaperone-assisted protein folding in cytoplasm obtained with Redi are reported. This case study is redrawing the attention of the scientific community due to current interests on protein aggregation as a potential cause for neurodegenerative diseases.
Abstract: Optical Character Recognition (OCR) is a very old and of great interest in pattern recognition field. In this paper we introduce a very powerful approach to recognize Persian text. We have used morphological operators, especially Hit/Miss operator to descript each sub-word and by using a template matching approach we have tried to classify generated description. We used just one font in two different sizes to verify our approach. We achieved a very good rate, up to 99.9%.
Abstract: This paper addresses the stabilization issues for a class of uncertain switched neutral systems with nonlinear perturbations. Based on new classes of piecewise Lyapunov functionals, the stability assumption on all the main operators or the convex combination of coefficient matrices is avoid, and a new switching rule is introduced to stabilize the neutral systems. The switching rule is designed from the solution of the so-called Lyapunov-Metzler linear matrix inequalities. Finally, three simulation examples are given to demonstrate the significant improvements over the existing results.
Abstract: Echocardiography imaging is one of the most common diagnostic tests that are widely used for assessing the abnormalities of the regional heart ventricle function. The main goal of the image enhancement task in 2D-echocardiography (2DE) is to solve two major anatomical structure problems; speckle noise and low quality. Therefore, speckle noise reduction is one of the important steps that used as a pre-processing to reduce the distortion effects in 2DE image segmentation. In this paper, we present the common filters that based on some form of low-pass spatial smoothing filters such as Mean, Gaussian, and Median. The Laplacian filter was used as a high-pass sharpening filter. A comparative analysis was presented to test the effectiveness of these filters after being applied to original 2DE images of 4-chamber and 2-chamber views. Three statistical quantity measures: root mean square error (RMSE), peak signal-to-ratio (PSNR) and signal-tonoise ratio (SNR) are used to evaluate the filter performance quantitatively on the output enhanced image.
Abstract: In this paper, a mathematical model of human immunodeficiency
virus (HIV) is utilized and an optimization problem is
proposed, with the final goal of implementing an optimal 900-day
structured treatment interruption (STI) protocol. Two type of commonly
used drugs in highly active antiretroviral therapy (HAART),
reverse transcriptase inhibitors (RTI) and protease inhibitors (PI), are
considered. In order to solving the proposed optimization problem an
adaptive memetic algorithm with population management (AMAPM)
is proposed. The AMAPM uses a distance measure to control the
diversity of population in genotype space and thus preventing the
stagnation and premature convergence. Moreover, the AMAPM uses
diversity parameter in phenotype space to dynamically set the population
size and the number of crossovers during the search process.
Three crossover operators diversify the population, simultaneously.
The progresses of crossover operators are utilized to set the number
of each crossover per generation. In order to escaping the local optima
and introducing the new search directions toward the global optima,
two local searchers assist the evolutionary process. In contrast to
traditional memetic algorithms, the activation of these local searchers
is not random and depends on both the diversity parameters in
genotype space and phenotype space. The capability of AMAPM in
finding optimal solutions compared with three popular metaheurestics
is introduced.
Abstract: This paper describes the development of a control
system model using a graphical software tool. This control system is
part of an operator training simulator developed for the National
Training Center for Operators of Ixtapantongo (CNCAOI, acronym
according to its name in Spanish language) of the Mexico-s Federal
Commission of Electricity, CFE). The Department of Simulation of
the Electrical Research Institute (IIE) developed this simulator using
as reference the Unit I of the Combined Cycle Power Plant El Sauz,
located at the centre of Mexico. The first step in the project was the
developing of the Gas Turbine System and its control system
simulator. The Turbo Gas simulator was finished and delivered to
CNCAOI in March 2007 for commercial operation. This simulator is
a high-fidelity real time dynamic simulator built and tested for
accurate operation over the entire load range. The simulator was used
primarily for operator training although it has been used for
procedure development and evaluation of plant transients.