Abstract: In this paper, a new recursive strategy is proposed for determining $\frac{(n-1)!}{2}$ of $n$th order diagrams. The generalization of $n$th diagram for cross multiplication method were proposed by Pavlovic and Bankier but the specific rule of determining $\frac{(n-1)!}{2}$ of the $n$th order diagrams for square matrix is yet to be discovered. Thus using combinatorial approach, $\frac{(n-1)!}{2}$ of the $n$th order diagrams will be presented as $\frac{(n-1)!}{2}$ starter sets. These starter sets will be generated based on exchanging one element. The advantages of this new strategy are the discarding process was eliminated and the sign of starter set is alternated to each others.
Abstract: All climate models agree that the temperature in
Greece will increase in the range of 1° to 2°C by the year 2030 and
mean sea level in Mediterranean is expected to rise at the rate of 5
cm/decade. The aim of the present paper is the estimation of the
coastline displacement driven by the climate change and sea level
rise. In order to achieve that, all known statistical and non-statistical
computational methods are employed on some Greek coastal areas.
Furthermore, Kalman filtering techniques are for the first time
introduced, formulated and tested. Based on all the above, shoreline
change signals and noises are computed and an inter-comparison
between the different methods can be deduced to help evaluating
which method is most promising as far as the retrieve of shoreline
change rate is concerned.
Abstract: In this work a software simulation model has been
proposed for two driven wheels mobile robot path planning; that can
navigate in dynamic environment with static distributed obstacles.
The work involves utilizing Bezier curve method in a proposed N
order matrix form; for engineering the mobile robot path. The Bezier
curve drawbacks in this field have been diagnosed. Two directions:
Up and Right function has been proposed; Probability Recursive
Function (PRF) to overcome those drawbacks.
PRF functionality has been developed through a proposed;
obstacle detection function, optimization function which has the
capability of prediction the optimum path without comparison
between all feasible paths, and N order Bezier curve function that
ensures the drawing of the obtained path.
The simulation results that have been taken showed; the mobile
robot travels successfully from starting point and reaching its goal
point. All obstacles that are located in its way have been avoided.
This navigation is being done successfully using the proposed PRF
techniques.
Abstract: The householder RLS (HRLS) algorithm is an O(N2)
algorithm which recursively updates an arbitrary square-root of the
input data correlation matrix and naturally provides the LS weight
vector. A data dependent householder matrix is applied for such
an update. In this paper a recursive estimate of the eigenvalue
spread and misalignment of the algorithm is presented at a very low
computational cost. Misalignment is found to be highly sensitive to
the eigenvalue spread of input signals, output noise of the system and
exponential window. Simulation results show noticeable degradation
in the misalignment by increase in eigenvalue spread as well as
system-s output noise, while exponential window was kept constant.
Abstract: The intelligent fuzzy input estimator is used to estimate
the input force of the rigid bar structural system in this study. The
fuzzy Kalman filter without the input term and the fuzzy weighting
recursive least square estimator are two main portions of this method.
The practicability and accuracy of the proposed method were verified
with numerical simulations from which the input forces of a rigid bar
structural system were estimated from the output responses. In order to
examine the accuracy of the proposed method, a rigid bar structural
system is subjected to periodic sinusoidal dynamic loading. The
excellent performance of this estimator is demonstrated by comparing
it with the use of difference weighting function and improper the
initial process noise covariance. The estimated results have a good
agreement with the true values in all cases tested.
Abstract: This essay endeavors to read Ama Ata Aidoo-s Our Sister Killjoy with a postocolonially-inflected consciousness. It aims at demonstrating how her work could be read as a sophisticated postcolonial revision of the colonial travel narrative whereby the protagonist-s black-eyed squint operates as 'the all-seeing-eye' to subvert the historically unbroken legacy of the Orientalist ideology. It tries to demonstrate how Sissie assumes authority and voice in an act that destabilizes the traditionally established modes of western representation. It is also an investigation into how Aidoo-s text adopts processes which disengage the Eurocentric view produced by the discursive itineraries of western institutions through diverse acts of resistance and 'various strategies of subversion and appropriation'. Her counter discursive strategies of resistance are shaped up in various ways by a feminist consciousness that attempts to articulate a distinct African version of identity and preserve cultural distinctiveness.
Abstract: Number Link is a Japanese logic puzzle where pairs of same numbers are connected using lines. Number Link can be regarded as a dynamic multiple travelers, multiple entries and exits maze, where the walls and passages are dynamically changing as the travelers move. In this paper, we apply the Tremaux’s algorithm to solve Number Link puzzles of size 8x8, 10x10 and 15x20. The algorithm works well and produces a solution for puzzles of size 8x8 and 10x10. However, solving a puzzle of size 15x20 requires high computer processing power and is time consuming.
Abstract: This work presents a recursive identification algorithm. This algorithm relates to the identification of closed loop system with Variable Structure Controller. The approach suggested includes two stages. In the first stage a genetic algorithm is used to obtain the parameters of switching function which gives a control signal rich in commutations (i.e. a control signal whose spectral characteristics are closest possible to those of a white noise signal). The second stage consists in the identification of the system parameters by the instrumental variable method and using the optimal switching function parameters obtained with the genetic algorithm. In order to test the validity of this algorithm a simulation example is presented.
Abstract: In this paper the optimal control strategy for
Permanent Magnet Synchronous Motor (PMSM) based drive system
is presented. The designed full optimal control is available for speed
operating range up to base speed. The optimal voltage space-vector
assures input energy reduction and stator loss minimization,
maintaining the output energy in the same limits with the
conventional PMSM electrical drive. The optimal control with three
components is based on the energetically criteria and it is applicable
in numerical version, being a nonrecursive solution. The simulation
results confirm the increased efficiency of the optimal PMSM drive.
The properties of the optimal voltage space vector are shown.
Abstract: Accurate demand forecasting is one of the most key
issues in inventory management of spare parts. The problem of
modeling future consumption becomes especially difficult for lumpy
patterns, which characterized by intervals in which there is no
demand and, periods with actual demand occurrences with large
variation in demand levels. However, many of the forecasting
methods may perform poorly when demand for an item is lumpy.
In this study based on the characteristic of lumpy demand patterns
of spare parts a hybrid forecasting approach has been developed,
which use a multi-layered perceptron neural network and a
traditional recursive method for forecasting future demands. In the
described approach the multi-layered perceptron are adapted to
forecast occurrences of non-zero demands, and then a conventional
recursive method is used to estimate the quantity of non-zero
demands. In order to evaluate the performance of the proposed
approach, their forecasts were compared to those obtained by using
Syntetos & Boylan approximation, recently employed multi-layered
perceptron neural network, generalized regression neural network
and elman recurrent neural network in this area. The models were
applied to forecast future demand of spare parts of Arak
Petrochemical Company in Iran, using 30 types of real data sets. The
results indicate that the forecasts obtained by using our proposed
mode are superior to those obtained by using other methods.
Abstract: Binary Decision Diagrams (BDDs) are useful data
structures for symbolic Boolean manipulations. BDDs are used in
many tasks in VLSI/CAD, such as equivalence checking, property
checking, logic synthesis, and false paths. In this paper we describe a
new approach for the realization of a BDD package. To perform
manipulations of Boolean functions, the proposed approach does not
depend on the recursive synthesis operation of the IF-Then-Else
(ITE). Instead of using the ITE operation, the basic synthesis
algorithm is done using Boolean NOR operation.
Abstract: Using state space technique and GF(2) theory, a
simulation model for external exclusive NOR type LFSR structures is
developed. Through this tool a systematic procedure is devised for
computing pseudo-random binary sequences from such structures.
Abstract: This paper proposes a method that discovers sequential patterns corresponding to user-s interests from sequential data. This method expresses the interests as constraint patterns. The constraint patterns can define relationships among attributes of the items composing the data. The method recursively decomposes the constraint patterns into constraint subpatterns. The method evaluates the constraint subpatterns in order to efficiently discover sequential patterns satisfying the constraint patterns. Also, this paper applies the method to the sequential data composed of stock price indexes and verifies its effectiveness through comparing it with a method without using the constraint patterns.
Abstract: In order to accelerate the similarity search in highdimensional database, we propose a new hierarchical indexing method. It is composed of offline and online phases. Our contribution concerns both phases. In the offline phase, after gathering the whole of the data in clusters and constructing a hierarchical index, the main originality of our contribution consists to develop a method to construct bounding forms of clusters to avoid overlapping. For the online phase, our idea improves considerably performances of similarity search. However, for this second phase, we have also developed an adapted search algorithm. Our method baptized NOHIS (Non-Overlapping Hierarchical Index Structure) use the Principal Direction Divisive Partitioning (PDDP) as algorithm of clustering. The principle of the PDDP is to divide data recursively into two sub-clusters; division is done by using the hyper-plane orthogonal to the principal direction derived from the covariance matrix and passing through the centroid of the cluster to divide. Data of each two sub-clusters obtained are including by a minimum bounding rectangle (MBR). The two MBRs are directed according to the principal direction. Consequently, the nonoverlapping between the two forms is assured. Experiments use databases containing image descriptors. Results show that the proposed method outperforms sequential scan and SRtree in processing k-nearest neighbors.
Abstract: In this paper, we present two new ranking and unranking
algorithms for k-ary trees represented by x-sequences in Gray
code order. These algorithms are based on a gray code generation algorithm
developed by Ahrabian et al.. In mentioned paper, a recursive
backtracking generation algorithm for x-sequences corresponding to
k-ary trees in Gray code was presented. This generation algorithm
is based on Vajnovszki-s algorithm for generating binary trees in
Gray code ordering. Up to our knowledge no ranking and unranking
algorithms were given for x-sequences in this ordering. we present
ranking and unranking algorithms with O(kn2) time complexity for
x-sequences in this Gray code ordering
Abstract: Employing a recently introduced unified adaptive filter
theory, we show how the performance of a large number of important
adaptive filter algorithms can be predicted within a general framework
in nonstationary environment. This approach is based on energy conservation
arguments and does not need to assume a Gaussian or white
distribution for the regressors. This general performance analysis can
be used to evaluate the mean square performance of the Least Mean
Square (LMS) algorithm, its normalized version (NLMS), the family
of Affine Projection Algorithms (APA), the Recursive Least Squares
(RLS), the Data-Reusing LMS (DR-LMS), its normalized version
(NDR-LMS), the Block Least Mean Squares (BLMS), the Block
Normalized LMS (BNLMS), the Transform Domain Adaptive Filters
(TDAF) and the Subband Adaptive Filters (SAF) in nonstationary
environment. Also, we establish the general expressions for the
steady-state excess mean square in this environment for all these
adaptive algorithms. Finally, we demonstrate through simulations that
these results are useful in predicting the adaptive filter performance.
Abstract: Optical character recognition of cursive scripts
presents a number of challenging problems in both segmentation and
recognition processes in different languages, including Persian. In
order to overcome these problems, we use a newly developed Persian
word segmentation method and a recognition-based segmentation
technique to overcome its segmentation problems. This method is
robust as well as flexible. It also increases the system-s tolerances to
font variations. The implementation results of this method on a
comprehensive database show a high degree of accuracy which meets
the requirements for commercial use. Extended with a suitable pre
and post-processing, the method offers a simple and fast framework
to develop a full OCR system.
Abstract: We present a discussion of three adaptive filtering
algorithms well known for their one-step termination property, in
terms of their relationship with the minimal residual method. These
algorithms are the normalized least mean square (NLMS), Affine
Projection algorithm (APA) and the recursive least squares algorithm
(RLS). The NLMS is shown to be a result of the orthogonality
condition imposed on the instantaneous approximation of the Wiener
equation, while APA and RLS algorithm result from orthogonality
condition in multi-dimensional minimal residual formulation. Further
analysis of the minimal residual formulation for the RLS leads to
a triangular system which also possesses the one-step termination
property (in exact arithmetic)
Abstract: This paper focuses on the development of bond graph
dynamic model of the mechanical dynamics of an excavating mechanism
previously designed to be used with small tractors, which are
fabricated in the Engineering Workshops of Jomo Kenyatta University
of Agriculture and Technology. To develop a mechanical dynamics
model of the manipulator, forward recursive equations similar to
those applied in iterative Newton-Euler method were used to obtain
kinematic relationships between the time rates of joint variables
and the generalized cartesian velocities for the centroids of the
links. Representing the obtained kinematic relationships in bondgraphic
form, while considering the link weights and momenta as
the elements led to a detailed bond graph model of the manipulator.
The bond graph method was found to reduce significantly the number
of recursive computations performed on a 3 DOF manipulator for a
mechanical dynamic model to result, hence indicating that bond graph
method is more computationally efficient than the Newton-Euler
method in developing dynamic models of 3 DOF planar manipulators.
The model was verified by comparing the joint torque expressions
of a two link planar manipulator to those obtained using Newton-
Euler and Lagrangian methods as analyzed in robotic textbooks. The
expressions were found to agree indicating that the model captures
the aspects of rigid body dynamics of the manipulator. Based on
the model developed, actuator sizing and valve sizing methodologies
were developed and used to obtain the optimal sizes of the pistons
and spool valve ports respectively. It was found that using the pump
with the sized flow rate capacity, the engine of the tractor is able to
power the excavating mechanism in digging a sandy-loom soil.
Abstract: Sensor networks are often deployed in unattended
environments, thus leaving these networks vulnerable to false data
injection attacks in which an adversary injects forged reports into the
network through compromised nodes, with the goal of deceiving the
base station or depleting the resources of forwarding nodes. Several
research solutions have been recently proposed to detect and drop such
forged reports during the forwarding process. Each design can provide
the equivalent resilience in terms of node compromising. However,
their energy consumption characteristics differ from each other. Thus,
employing only a single filtering scheme for a network is not a
recommendable strategy in terms of energy saving. It's very important
the threshold determination for message authentication to identify. We
propose the recursive contract net protocols which less energy level of
terminal node in wireless sensor network.