Abstract: In this paper, we present some formulas of symbolic operator summation, which involving Generalization well-know number sequences or polynomial sequences, and mean while we obtain some identities about the sequences by employing M-R‘s substitution rule.
Abstract: Force sensor has been used as requisite for knowing information on the amount and the directions of forces on the skin surface. We have developed a four-degrees-of-freedom capacitive force sensor (approximately 20×20×5 mm3) that has a flexible structure and sixteen parallel plate capacitors. An iterative algorithm was developed for estimating four displacements from the sixteen capacitances using fourth-order polynomial approximation of characteristics between capacitance and displacement. The estimation results from measured capacitances had large error caused by deterioration of the characteristics. In this study, effective capacitors had major information were selected on the basis of the capacitance change range and the characteristic shape. Maximum errors in calibration and non-calibration points were 25%and 6.8%.However the maximum error was larger than desired value, the smallness of averaged value indicated the occurrence of a few large error points. On the other hand, error in non-calibration point was within desired value.
Abstract: The problems with high complexity had been the challenge in combinatorial problems. Due to the none-determined and polynomial characteristics, these problems usually face to unreasonable searching budget. Hence combinatorial optimizations attracted numerous researchers to develop better algorithms. In recent academic researches, most focus on developing to enhance the conventional evolutional algorithms and facilitate the local heuristics, such as VNS, 2-opt and 3-opt. Despite the performances of the introduction of the local strategies are significant, however, these improvement cannot improve the performance for solving the different problems. Therefore, this research proposes a meta-heuristic evolutional algorithm which can be applied to solve several types of problems. The performance validates BBEA has the ability to solve the problems even without the design of local strategies.
Abstract: An adaptive Chinese hand-talking system is presented
in this paper. By analyzing the 3 data collecting strategies for new
users, the adaptation framework including supervised and unsupervised
adaptation methods is proposed. For supervised adaptation,
affinity propagation (AP) is used to extract exemplar subsets, and enhanced
maximum a posteriori / vector field smoothing (eMAP/VFS)
is proposed to pool the adaptation data among different models. For
unsupervised adaptation, polynomial segment models (PSMs) are
used to help hidden Markov models (HMMs) to accurately label
the unlabeled data, then the "labeled" data together with signerindependent
models are inputted to MAP algorithm to generate
signer-adapted models. Experimental results show that the proposed
framework can execute both supervised adaptation with small amount
of labeled data and unsupervised adaptation with large amount
of unlabeled data to tailor the original models, and both achieve
improvements on the performance of recognition rate.
Abstract: IP networks are evolving from data communication
infrastructure into many real-time applications such as video
conferencing, IP telephony and require stringent Quality of Service
(QoS) requirements. A rudimentary issue in QoS routing is to find a
path between a source-destination pair that satisfies two or more endto-
end constraints and termed to be NP hard or complete. In this
context, we present an algorithm Multi Constraint Path Problem
Version 3 (MCPv3), where all constraints are approximated and
return a feasible path in much quicker time. We present another
algorithm namely Delay Coerced Multi Constrained Routing
(DCMCR) where coerce one constraint and approximate the
remaining constraints. Our algorithm returns a feasible path, if exists,
in polynomial time between a source-destination pair whose first
weight satisfied by the first constraint and every other weight is
bounded by remaining constraints by a predefined approximation
factor (a). We present our experimental results with different
topologies and network conditions.
Abstract: The problem of N cracks interaction in an isotropic
elastic solid is decomposed into a subproblem of a homogeneous solid
without crack and N subproblems with each having a single crack
subjected to unknown tractions on the two crack faces. The unknown
tractions, namely pseudo tractions on each crack are expanded into
polynomials with unknown coefficients, which have to be determined
by the consistency condition, i.e. by the equivalence of the original
multiple cracks interaction problem and the superposition of the N+1
subproblems. In this paper, Kachanov-s approach of average tractions
is extended into the method of moments to approximately impose the
consistence condition. Hence Kachanov-s method can be viewed as
the zero-order method of moments. Numerical results of the stress
intensity factors are presented for interactions of two collinear cracks,
three collinear cracks, two parallel cracks, and three parallel cracks.
As the order of moment increases, the accuracy of the method of
moments improves.
Abstract: This paper presents comparison among methods of
determination of the characteristic polynomial coefficients. First, the
resultant systems from the methods are compared based on frequency
criteria such as the closed loop bandwidth, gain and phase margins.
Then the step responses of the resultant systems are compared on the
basis of the transient behavior criteria including overshoot, rise time,
settling time and error (via IAE, ITAE, ISE and ITSE integral
indices). Also relative stability of the systems is compared together.
Finally the best choices in regards to the above diverse criteria are
presented.
Abstract: Finding suitable non-supersingular elliptic curves for
pairing-based cryptosystems becomes an important issue for the
modern public-key cryptography after the proposition of id-based
encryption scheme and short signature scheme. In previous work
different algorithms have been proposed for finding such elliptic
curves when embedding degree k ∈ {3, 4, 6} and cofactor h ∈ {1, 2, 3,
4, 5}. In this paper a new method is presented to find more
non-supersingular elliptic curves for pairing-based cryptosystems with
general embedding degree k and large values of cofactor h. In
addition, some effective parameters of these non-supersingular elliptic
curves are provided in this paper.
Abstract: In this paper we present a substantiation of a new
Laguerre-s type iterative method for solving of a nonlinear
polynomial equations systems with real coefficients. The problems of
its implementation, including relating to the structural choice of
initial approximations, were considered. Test examples demonstrate
the effectiveness of the method at the solving of many practical
problems solving.
Abstract: Wireless sensor network can be applied to both abominable
and military environments. A primary goal in the design of
wireless sensor networks is lifetime maximization, constrained by
the energy capacity of batteries. One well-known method to reduce
energy consumption in such networks is data aggregation. Providing
efcient data aggregation while preserving data privacy is a challenging
problem in wireless sensor networks research. In this paper,
we present privacy-preserving data aggregation scheme for additive
aggregation functions. The Cluster-based Private Data Aggregation
(CPDA)leverages clustering protocol and algebraic properties of
polynomials. It has the advantage of incurring less communication
overhead. The goal of our work is to bridge the gap between
collaborative data collection by wireless sensor networks and data
privacy. We present simulation results of our schemes and compare
their performance to a typical data aggregation scheme TAG, where
no data privacy protection is provided. Results show the efficacy and
efficiency of our schemes.
Abstract: We proposed a new class of asymmetric turbo encoder for 3G systems that performs well in both “water fall" and “error floor" regions in [7]. In this paper, a modified (optimal) power allocation scheme for the different bits of new class of asymmetric turbo encoder has been investigated to enhance the performance. The simulation results and performance bound for proposed asymmetric turbo code with modified Unequal Power Allocation (UPA) scheme for the frame length, N=400, code rate, r=1/3 with Log-MAP decoder over Additive White Gaussian Noise (AWGN) channel are obtained and compared with the system with typical UPA and without UPA. The performance tests are extended over AWGN channel for different frame size to verify the possibility of implementation of the modified UPA scheme for the proposed asymmetric turbo code. From the performance results, it is observed that the proposed asymmetric turbo code with modified UPA performs better than the system without UPA and with typical UPA and it provides a coding gain of 0.4 to 0.52dB.
Abstract: A procedure commonly used in Job Shop Scheduling Problem (JSSP) to evaluate the neighborhoods functions that use the non-deterministic algorithms is the calculation of the critical path in a digraph. This paper presents an experimental study of the cost of computation that exists when the calculation of the critical path in the solution for instances in which a JSSP of large size is involved. The results indicate that if the critical path is use in order to generate neighborhoods in the meta-heuristics that are used in JSSP, an elevated cost of computation exists in spite of the fact that the calculation of the critical path in any digraph is of polynomial complexity.
Abstract: One of the essential sectors of Myanmar economy is
agriculture which is sensitive to climate variation. The most
important climatic element which impacts on agriculture sector is
rainfall. Thus rainfall prediction becomes an important issue in
agriculture country. Multi variables polynomial regression (MPR)
provides an effective way to describe complex nonlinear input output
relationships so that an outcome variable can be predicted from the
other or others. In this paper, the modeling of monthly rainfall
prediction over Myanmar is described in detail by applying the
polynomial regression equation. The proposed model results are
compared to the results produced by multiple linear regression model
(MLR). Experiments indicate that the prediction model based on
MPR has higher accuracy than using MLR.
Abstract: Script identification is one of the challenging steps in the development of optical character recognition system for bilingual or multilingual documents. In this paper an attempt is made for identification of English numerals at word level from Punjabi documents by using Gabor features. The support vector machine (SVM) classifier with five fold cross validation is used to classify the word images. The results obtained are quite encouraging. Average accuracy with RBF kernel, Polynomial and Linear Kernel functions comes out to be greater than 99%.
Abstract: This paper deals with a high-order accurate Runge
Kutta Discontinuous Galerkin (RKDG) method for the numerical
solution of the wave equation, which is one of the simple case of a
linear hyperbolic partial differential equation. Nodal DG method is
used for a finite element space discretization in 'x' by discontinuous
approximations. This method combines mainly two key ideas which
are based on the finite volume and finite element methods. The
physics of wave propagation being accounted for by means of
Riemann problems and accuracy is obtained by means of high-order
polynomial approximations within the elements. High order accurate
Low Storage Explicit Runge Kutta (LSERK) method is used for
temporal discretization in 't' that allows the method to be nonlinearly
stable regardless of its accuracy. The resulting RKDG
methods are stable and high-order accurate. The L1 ,L2 and L∞ error
norm analysis shows that the scheme is highly accurate and effective.
Hence, the method is well suited to achieve high order accurate
solution for the scalar wave equation and other hyperbolic equations.
Abstract: The motion planning technique described in this paper has been developed to eliminate or reduce the residual vibrations of belt-driven rotary platforms, while maintaining unchanged the motion time and the total angular displacement of the platform. The proposed approach is based on a suitable choice of the motion command given to the servomotor that drives the mechanical device; this command is defined by some numerical coefficients which determine the shape of the displacement, velocity and acceleration profiles. Using a numerical optimization technique, these coefficients can be changed without altering the continuity conditions imposed on the displacement and its time derivatives at the initial and final time instants. The proposed technique can be easily and quickly implemented on an actual device, since it requires only a simple modification of the motion command profile mapped in the memory of the electronic motion controller.
Abstract: An exact algorithm for a n-link manipulator movement amidst arbitrary unknown static obstacles is presented.
The algorithm guarantees the reaching of a target configuration of the manipulator in a finite number of steps. The algorithm is
reduced to a finite number of calls of a subroutine for planning a trajectory in the presence of known forbidden states. The polynomial approximation algorithm which is used as the subroutine is presented. The results of the exact algorithm
implementation for the control of a seven link (7 degrees of
freedom, 7DOF) manipulator are given.
Abstract: The Helmholtz equation often arises in the study of physical problems involving partial differential equation. Many researchers have proposed numerous methods to find the analytic or approximate solutions for the proposed problems. In this work, the exact analytical solutions of the Helmholtz equation in spherical polar coordinates are presented using the Nikiforov-Uvarov (NU) method. It is found that the solution of the angular eigenfunction can be expressed by the associated-Legendre polynomial and radial eigenfunctions are obtained in terms of the Laguerre polynomials. The special case for k=0, which corresponds to the Laplace equation is also presented.
Abstract: In this paper, a new model order reduction
phenomenon is introduced at the design stage of linear phase digital
IIR filter. The complexity of a system can be reduced by adopting the
model order reduction method in their design. In this paper a mixed
method of model order reduction is proposed for linear IIR filter. The
proposed method employs the advantages of factor division technique
to derive the reduced order denominator polynomial and the reduced
order numerator is obtained based on the resultant denominator
polynomial. The order reduction technique is used to reduce the delay
units at the design stage of IIR filter. The validity of the proposed
method is illustrated with design example in frequency domain and
stability is also examined with help of nyquist plot.
Abstract: Polynomial maps offer analytical properties used to obtain better performances in the scope of chaos synchronization under noisy channels. This paper presents a new method to simplify equations of the Exact Polynomial Kalman Filter (ExPKF) given in [1]. This faster algorithm is compared to other estimators showing that performances of all considered observers vanish rapidly with the channel noise making application of chaos synchronization intractable. Simulation of ExPKF shows that saturation drawn on the emitter to keep it stable impacts badly performances for low channel noise. Then we propose a particle filter that outperforms all other Kalman structured observers in the case of noisy channels.