Abstract: The biological function of an RNA molecule depends
on its structure. The objective of the alignment is finding the
homology between two or more RNA secondary structures. Knowing
the common functionalities between two RNA structures allows
a better understanding and a discovery of other relationships
between them. Besides, identifying non-coding RNAs -that is not
translated into a protein- is a popular application in which RNA
structural alignment is the first step A few methods for RNA
structure-to-structure alignment have been developed. Most of these
methods are partial structure-to-structure, sequence-to-structure, or
structure-to-sequence alignment. Less attention is given in the
literature to the use of efficient RNA structure representation and the
structure-to-structure alignment methods are lacking. In this paper,
we introduce an O(N2) Component-based Pairwise RNA Structure
Alignment (CompPSA) algorithm, where structures are given as
a component-based representation and where N is the maximum
number of components in the two structures. The proposed algorithm
compares the two RNA secondary structures based on their weighted
component features rather than on their base-pair details. Extensive
experiments are conducted illustrating the efficiency of the CompPSA
algorithm when compared to other approaches and on different real
and simulated datasets. The CompPSA algorithm shows an accurate
similarity measure between components. The algorithm gives the
flexibility for the user to align the two RNA structures based on
their weighted features (position, full length, and/or stem length).
Moreover, the algorithm proves scalability and efficiency in time and
memory performance.
Abstract: This paper proposes an application of probabilistic technique, namely Gaussian process regression, for estimating an optimal sequence of the single machine with total weighted tardiness (SMTWT) scheduling problem. In this work, the Gaussian process regression (GPR) model is utilized to predict an optimal sequence of the SMTWT problem, and its solution is improved by using an iterated local search based on simulated annealing scheme, called GPRISA algorithm. The results show that the proposed GPRISA method achieves a very good performance and a reasonable trade-off between solution quality and time consumption. Moreover, in the comparison of deviation from the best-known solution, the proposed mechanism noticeably outperforms the recently existing approaches.
Abstract: The paper presents the multi-element synthetic
transmit aperture (MSTA) method with a small number of elements
transmitting and all elements apertures in medical ultrasound
imaging. As compared to the other methods MSTA allows to
increase the system frame rate and provides the best compromise
between penetration depth and lateral resolution.
In the experiments a 128-element linear transducer array with
0.3 mm pitch excited by a burst pulse of 125 ns duration were used.
The comparison of 2D ultrasound images of tissue mimicking
phantom obtained using the STA and the MSTA methods is
presented to demonstrate the benefits of the second approach. The
results were obtained using SA algorithm with transmit and receive
signals correction based on a single element directivity function.
Abstract: In the paper we discuss the influence of the route
flexibility degree, the open rate of operations and the production type
coefficient on makespan. The flexible job-open shop scheduling
problem FJOSP (an extension of the classical job shop scheduling) is
analyzed. For the analysis of the production process we used a
hybrid heuristic of the GRASP (greedy randomized adaptive search
procedure) with simulated annealing algorithm. Experiments with
different levels of factors have been considered and compared. The
GRASP+SA algorithm has been tested and illustrated with results for
the serial route and the parallel one.
Abstract: Honeycomb sandwich panels are increasingly used in the construction of space vehicles because of their outstanding strength, stiffness and light weight properties. However, the use of honeycomb sandwich plates comes with difficulties in the design process as a result of the large number of design variables involved, including composite material design, shape and geometry. Hence, this work deals with the presentation of an optimal design of hexagonal honeycomb sandwich structures subjected to space environment. The optimization process is performed using a set of algorithms including the gravitational search algorithm (GSA). Numerical results are obtained and presented for a set of algorithms. The results obtained by the GSA algorithm are much better compared to other algorithms used in this study.
Abstract: Gas Metal Arc Welding (GMAW) processes is an
important joining process widely used in metal fabrication
industries. This paper addresses modeling and optimization of this
technique using a set of experimental data and regression analysis.
The set of experimental data has been used to assess the influence
of GMAW process parameters in weld bead geometry. The
process variables considered here include voltage (V); wire feed
rate (F); torch Angle (A); welding speed (S) and nozzle-to-plate
distance (D). The process output characteristics include weld bead
height, width and penetration. The Taguchi method and regression
modeling are used in order to establish the relationships between
input and output parameters. The adequacy of the model is
evaluated using analysis of variance (ANOVA) technique. In the
next stage, the proposed model is embedded into a Simulated
Annealing (SA) algorithm to optimize the GMAW process
parameters. The objective is to determine a suitable set of process
parameters that can produce desired bead geometry, considering
the ranges of the process parameters. Computational results prove
the effectiveness of the proposed model and optimization
procedure.
Abstract: Several methods are available for weight and shape
optimization of structures, among which Evolutionary Structural
Optimization (ESO) is one of the most widely used methods. In ESO,
however, the optimization criterion is completely case-dependent.
Moreover, only the improving solutions are accepted during the
search. In this paper a Simulated Annealing (SA) algorithm is used
for structural optimization problem. This algorithm differs from other
random search methods by accepting non-improving solutions. The
implementation of SA algorithm is done through reducing the
number of finite element analyses (function evaluations).
Computational results show that SA can efficiently and effectively
solve such optimization problems within short search time.
Abstract: Blind Signature were introduced by Chaum. In this
scheme, a signer can “sign” a document without knowing the
document contain. This is particularly important in electronic voting.
CryptO-0N2 is an electronic voting protocol which is development of
CryptO-0N. During its development this protocol has not been
furnished with the requirement of blind signature, so the choice of
voters can be determined by counting center. In this paper will be
presented of implementation of blind signature using RSA algorithm.
Abstract: Cryptographic algorithms play a crucial role in the
information society by providing protection from unauthorized
access to sensitive data. It is clear that information technology will
become increasingly pervasive, Hence we can expect the emergence
of ubiquitous or pervasive computing, ambient intelligence. These
new environments and applications will present new security
challenges, and there is no doubt that cryptographic algorithms and
protocols will form a part of the solution. The efficiency of a public
key cryptosystem is mainly measured in computational overheads,
key size and bandwidth. In particular the RSA algorithm is used in
many applications for providing the security. Although the security
of RSA is beyond doubt, the evolution in computing power has
caused a growth in the necessary key length. The fact that most chips
on smart cards can-t process key extending 1024 bit shows that there
is need for alternative. NTRU is such an alternative and it is a
collection of mathematical algorithm based on manipulating lists of
very small integers and polynomials. This allows NTRU to high
speeds with the use of minimal computing power. NTRU (Nth degree
Truncated Polynomial Ring Unit) is the first secure public key
cryptosystem not based on factorization or discrete logarithm
problem. This means that given sufficient computational resources
and time, an adversary, should not be able to break the key. The
multi-party communication and requirement of optimal resource
utilization necessitated the need for the present day demand of
applications that need security enforcement technique .and can be
enhanced with high-end computing. This has promoted us to develop
high-performance NTRU schemes using approaches such as the use
of high-end computing hardware. Peer-to-peer (P2P) or enterprise
grids are proven as one of the approaches for developing high-end
computing systems. By utilizing them one can improve the
performance of NTRU through parallel execution. In this paper we
propose and develop an application for NTRU using enterprise grid
middleware called Alchemi. An analysis and comparison of its
performance for various text files is presented.
Abstract: This paper proposes the authentication method using
ESA algorithm instead of using CAVE algorithm in the CDMA
mobile communication systems including IS-95 and CDMA2000 1x.
And, we analyze to apply ESA mechanism on behalf of CAVE
mechanism without the change of message format and air interface in
the existing CDMA systems. If ESA algorithm can be used as the
substitution of CAVE algorithm, security strength of authentication
algorithm is intensified without protocol change. An algorithm
replacement proposed in this paper is not to change an authentication
mechanism, but to configure input of ESA algorithm and to produce
output. Therefore, our proposal can be the compatible to the existing
systems.
Abstract: This paper undertakes the problem of optimal
capacitor placement in a distribution system. The problem is how to
optimally determine the locations to install capacitors, the types and
sizes of capacitors to he installed and, during each load level,the
control settings of these capacitors in order that a desired objective
function is minimized while the load constraints,network constraints
and operational constraints (e.g. voltage profile) at different load
levels are satisfied. The problem is formulated as a combinatorial
optimization problem with a nondifferentiable objective function.
Four solution mythologies based on algorithms (GA),tabu search
(TS), and hybrid GA-SA algorithms are presented.The solution
methodologies are preceded by a sensitivity analysis to select the
candidate capacitor installation locations.