Abstract: This paper summaries basic principles and concepts of
intelligent controls, implemented in humanoid robotics as well as
recent algorithms being devised for advanced control of humanoid
robots. Secondly, this paper presents a new approach neuro-fuzzy
system. We have included some simulating results from our
computational intelligence technique that will be applied to our
humanoid robot. Subsequently, we determine a relationship between
joint trajectories and located forces on robot-s foot through a
proposed neuro-fuzzy technique.
Abstract: Method of multiple scales is used in the paper in order
to derive an amplitude evolution equation for the most unstable mode
from two-dimensional shallow water equations under the rigid-lid
assumption. It is assumed that shallow mixing layer is slightly curved
in the longitudinal direction and contains small particles. Dynamic
interaction between carrier fluid and particles is neglected. It is
shown that the evolution equation is the complex Ginzburg-Landau
equation. Explicit formulas for the computation of the coefficients of
the equation are obtained.
Abstract: Protein-protein interactions (PPI) play a crucial role in many biological processes such as cell signalling, transcription, translation, replication, signal transduction, and drug targeting, etc. Structural information about protein-protein interaction is essential for understanding the molecular mechanisms of these processes. Structures of protein-protein complexes are still difficult to obtain by biophysical methods such as NMR and X-ray crystallography, and therefore protein-protein docking computation is considered an important approach for understanding protein-protein interactions. However, reliable prediction of the protein-protein complexes is still under way. In the past decades, several grid-based docking algorithms based on the Katchalski-Katzir scoring scheme were developed, e.g., FTDock, ZDOCK, HADDOCK, RosettaDock, HEX, etc. However, the success rate of protein-protein docking prediction is still far from ideal. In this work, we first propose a more practical measure for evaluating the success of protein-protein docking predictions,the rate of first success (RFS), which is similar to the concept of mean first passage time (MFPT). Accordingly, we have assessed the ZDOCK bound and unbound benchmarks 2.0 and 3.0. We also createda new benchmark set for protein-protein docking predictions, in which the complexes have experimentally determined binding affinity data. We performed free energy calculation based on the solution of non-linear Poisson-Boltzmann equation (nlPBE) to improve the binding mode prediction. We used the well-studied thebarnase-barstarsystem to validate the parameters for free energy calculations. Besides,thenlPBE-based free energy calculations were conducted for the badly predicted cases by ZDOCK and ZRANK. We found that direct molecular mechanics energetics cannot be used to discriminate the native binding pose from the decoys.Our results indicate that nlPBE-based calculations appeared to be one of the promising approaches for improving the success rate of binding pose predictions.
Abstract: In Blind Source Separation (BSS) processing, taking
advantage of scaling factor indetermination and based on the floatingpoint
representation, we propose a scaling technique applied to the
separation matrix, to avoid the saturation or the weakness in the
recovered source signals. This technique performs an Automatic Gain
Control (AGC) in an on-line BSS environment. We demonstrate
the effectiveness of this technique by using the implementation of
a division free BSS algorithm with two input, two output. This
technique is computationally cheaper and efficient for a hardware
implementation.
Abstract: Iris-based biometric authentication is gaining importance
in recent times. Iris biometric processing however, is a complex
process and computationally very expensive. In the overall processing
of iris biometric in an iris-based biometric authentication system,
feature processing is an important task. In feature processing, we extract
iris features, which are ultimately used in matching. Since there
is a large number of iris features and computational time increases
as the number of features increases, it is therefore a challenge to
develop an iris processing system with as few as possible number of
features and at the same time without compromising the correctness.
In this paper, we address this issue and present an approach to feature
extraction and feature matching process. We apply Daubechies D4
wavelet with 4 levels to extract features from iris images. These
features are encoded with 2 bits by quantizing into 4 quantization
levels. With our proposed approach it is possible to represent an
iris template with only 304 bits, whereas existing approaches require
as many as 1024 bits. In addition, we assign different weights to
different iris region to compare two iris templates which significantly
increases the accuracy. Further, we match the iris template based on
a weighted similarity measure. Experimental results on several iris
databases substantiate the efficacy of our approach.
Abstract: Most HWRs currently use natural uranium fuel. Using enriched uranium fuel results in a significant improvement in fuel cycle costs and uranium utilization. On the other hand, reactivity changes of HWRs over the full range of operating conditions from cold shutdown to full power are small. This reduces the required reactivity worth of control devices and minimizes local flux distribution perturbations, minimizing potential problems due to transient local overheating of fuel. Analyzing heavy water effectiveness on neutronic parameters such as enrichment requirements, peaking factor and reactivity is important and should pay attention as primary concepts of a HWR core designing. Two nuclear nuclear reactors of CANDU-type and hexagonal-type reactor cores of 33 fuel assemblies and 19 assemblies in 1.04 P/D have been respectively simulated using MCNP-4C code. Using heavy water and light water as moderator have been compared for achieving less reactivity insertion and enrichment requirements. Two fuel matrixes of (232Th/235U)O2 and (238/235U)O2 have been compared to achieve more economical and safe design. Heavy water not only decreased enrichment needs, but it concluded in negative reactivity insertions during moderator density variations. Thorium oxide fuel assemblies of 2.3% enrichment loaded into the core of heavy water moderator resulted in 0.751 fission to absorption ratio and peaking factor of 1.7 using. Heavy water not only provides negative reactivity insertion during temperature raises which changes moderator density but concluded in 2 to 10 kg reduction of enrichment requirements, depend on geometry type.
Abstract: We present a numerical study of the sensitivity of the so called time relaxation family of models of fluid motion with respect to the time relaxation parameter χ on the two dimensional cavity problem. The goal of the study is to compute and compare the sensitivity of the model using finite difference method (FFD) and sensitivity equation method (SEM).
Abstract: In this paper, an intelligent algorithm for optimal
document archiving is presented. It is kown that electronic archives
are very important for information system management. Minimizing
the size of the stored data in electronic archive is a main issue to
reduce the physical storage area. Here, the effect of different types of
Arabic fonts on electronic archives size is discussed. Simulation
results show that PDF is the best file format for storage of the Arabic
documents in electronic archive. Furthermore, fast information
detection in a given PDF file is introduced. Such approach uses fast
neural networks (FNNs) implemented in the frequency domain. The
operation of these networks relies on performing cross correlation in
the frequency domain rather than spatial one. It is proved
mathematically and practically that the number of computation steps
required for the presented FNNs is less than that needed by
conventional neural networks (CNNs). Simulation results using
MATLAB confirm the theoretical computations.
Abstract: In this paper we are interested in classification problems
with a performance constraint on error probability. In such
problems if the constraint cannot be satisfied, then a rejection option
is introduced. For binary labelled classification, a number of SVM
based methods with rejection option have been proposed over the
past few years. All of these methods use two thresholds on the SVM
output. However, in previous works, we have shown on synthetic data
that using thresholds on the output of the optimal SVM may lead to
poor results for classification tasks with performance constraint. In
this paper a new method for supervised classification with rejection
option is proposed. It consists in two different classifiers jointly
optimized to minimize the rejection probability subject to a given
constraint on error rate. This method uses a new kernel based linear
learning machine that we have recently presented. This learning
machine is characterized by its simplicity and high training speed
which makes the simultaneous optimization of the two classifiers
computationally reasonable. The proposed classification method with
rejection option is compared to a SVM based rejection method
proposed in recent literature. Experiments show the superiority of
the proposed method.
Abstract: This paper proposes a novel hybrid algorithm for feature selection based on a binary ant colony and SVM. The final subset selection is attained through the elimination of the features that produce noise or, are strictly correlated with other already selected features. Our algorithm can improve classification accuracy with a small and appropriate feature subset. Proposed algorithm is easily implemented and because of use of a simple filter in that, its computational complexity is very low. The performance of the proposed algorithm is evaluated through a real Rotary Cement kiln dataset. The results show that our algorithm outperforms existing algorithms.
Abstract: We propose a new approach on how to obtain the approximate solutions of Hamilton-Jacobi (HJ) equations. The process of the approximation consists of two steps. The first step is to transform the HJ equations into the virtual time based HJ equations (VT-HJ) by introducing a new idea of ‘virtual-time’. The second step is to construct the approximate solutions of the HJ equations through a computationally iterative procedure based on the VT-HJ equations. It should be noted that the approximate feedback solutions evolve by themselves as the virtual-time goes by. Finally, we demonstrate the effectiveness of our approximation approach by means of simulations with linear and nonlinear control problems.
Abstract: The problem of lot sizing, sequencing and scheduling
multiple products in flow line production systems has been studied
by several authors. Almost all of the researches in this area assumed
that setup times and costs are sequence –independent even though
sequence dependent setups are common in practice. In this paper we
present a new mixed integer non linear program (MINLP) and a
heuristic method to solve the problem in sequence dependent case.
Furthermore, a genetic algorithm has been developed which applies
this constructive heuristic to generate initial population. These two
proposed solution methods are compared on randomly generated
problems. Computational results show a clear superiority of our
proposed GA for majority of the test problems.
Abstract: One of the most important parameters to develop and
manage urban areas is appropriate selection of land surface to
develop green spaces in these areas. In this study, in order to identify
the most appropriate sites and areas cultivated for ornamental species
in Jiroft, Landsat Enhanced Thematic Mapper Plus (ETM+) images
due to extract the most important effective climatic and adaphic
parameters for growth ornamental species were used. After geometric
and atmospheric corrections applied, to enhance accuracy of multi
spectral (XS) bands, the fusion of Landsat XS bands by IRS-1D
panchromatic band (PAN) was performed. After field sampling to
evaluate the correlation between different factors in surface soil
sampling location and different bands digital number (DN) of ETM+
sensor on the same points, correlation tables formed using the best
computational model and the map of physical and chemical
parameters of soil was produced. Then the accuracy of them was
investigated by using kappa coefficient. Finally, according to
produced maps, the best areas for cultivation of recommended
species were introduced.
Abstract: Artificial Immune System (AIS) is relatively naive paradigm for intelligent computations. The inspiration for AIS is derived from natural Immune System (IS). Classically it is believed that IS strives to discriminate between self and non-self. Most of the existing AIS research is based on this approach. Danger Theory (DT) argues this approach and proposes that IS fights against danger producing elements and tolerates others. We, the computational researchers, are not concerned with the arguments among immunologists but try to extract from it novel abstractions for intelligent computation. This paper aims to follow DT inspiration for intelligent data processing. The approach may introduce new avenue in intelligent processing. The data used is system calls data that is potentially significant in intrusion detection applications.
Abstract: This paper introduces a new instantaneous frequency
computation approach -Counting Instantaneous Frequency for a
general class of signals called simple waves. The classsimple wave
contains a wide range of continuous signals for which the concept
instantaneous frequency has a perfect physical sense. The concept of
-Counting Instantaneous Frequency also applies to all the discrete data.
For all the simple wave signals and the discrete data, -Counting
instantaneous frequency can be computed directly without signal
decomposition process. The intrinsic mode functions obtained through
empirical mode decomposition belongs to simple wave. So
-Counting instantaneous frequency can be used together with
empirical mode decomposition.
Abstract: The indoor airflow with a mixed natural/forced convection
was numerically calculated using the laminar and turbulent
approach. The Boussinesq approximation was considered for a simplification
of the mathematical model and calculations. The results
obtained, such as mean velocity fields, were successfully compared
with experimental PIV flow visualizations. The effect of the distance
between the cooled wall and the heat exchanger on the temperature
and velocity distributions was calculated. In a room with a simple
shape, the computational code OpenFOAM demonstrated an ability to
numerically predict flow patterns. Furthermore, numerical techniques,
boundary type conditions and the computational grid quality were
examined. Calculations using the turbulence model k-omega had a
significant effect on the results influencing temperature and velocity
distributions.
Abstract: This paper presents a simple approach for load
flow analysis of a radial distribution network. The proposed
approach utilizes forward and backward sweep algorithm
based on Kirchoff-s current law (KCL) and Kirchoff-s voltage
law (KVL) for evaluating the node voltages iteratively. In this
approach, computation of branch current depends only on the
current injected at the neighbouring node and the current in
the adjacent branch. This approach starts from the end nodes
of sub lateral line, lateral line and main line and moves
towards the root node during branch current computation. The
node voltage evaluation begins from the root node and moves
towards the nodes located at the far end of the main, lateral
and sub lateral lines. The proposed approach has been tested
using four radial distribution systems of different size and
configuration and found to be computationally efficient.
Abstract: Frequently a group of people jointly decide and authorize
a specific person as a representative in some business/poitical
occasions, e.g., the board of a company authorizes the chief executive
officer to close a multi-billion acquisition deal. In this paper, an
integrated proxy multi-signature scheme that allows anonymously
vetoable delegation is proposed. This protocol integrates mechanisms
of private veto, distributed proxy key generation, secure transmission
of proxy key, and existentially unforgeable proxy multi-signature
scheme. First, a provably secure Guillou-Quisquater proxy signature
scheme is presented, then the “zero-sharing" protocol is extended
over a composite modulus multiplicative group, and finally the above
two are combined to realize the GQ proxy multi-signature with
anonymously vetoable delegation. As a proxy signature scheme, this
protocol protects both the original signers and the proxy signer.
The modular design allows simplified implementation with less
communication overheads and better computation performance than
a general secure multi-party protocol.
Abstract: The paper attempts to contribute to the largely
neglected social and anthropological discussion of technology development on the one hand, and to redirecting the emphasis in
anthropology from primitive and exotic societies to problems of high
relevance in contemporary era and how technology is used in
everyday life. It draws upon multidimensional models of intelligence
and ideal type formation. It is argued that the predominance of
computational and cognitive cosmovisions have led to technology alienation. Injection of communicative competence in artificially
intelligent systems and identity technologies in the coming
information society are analyzed
Abstract: In this paper, the construction of fast algorithms for the computation of Periodic Walsh Piecewise-Linear PWL transform and the Periodic Haar Piecewise-Linear PHL transform will be presented. Algorithms for the computation of the inverse transforms are also proposed. The matrix equation of the PWL and PHL transforms are introduced. Comparison of the computational requirements for the periodic piecewise-linear transforms and other orthogonal transforms shows that the periodic piecewise-linear transforms require less number of operations than some orthogonal transforms such as the Fourier, Walsh and the Discrete Cosine transforms.