Scholarly

Hierarchies Based On the Number of Cooperating Systems of Finite Automata on Four-Dimensional Input Tapes

Year: 2012 Volume: 6 Issue: 12 1683 - 1688 Pages

Abstract: In theoretical computer science, the Turing machine has played a number of important roles in understanding and exploiting basic concepts and mechanisms in computing and information processing [20]. It is a simple mathematical model of computers [9]. After that, M.Blum and C.Hewitt first proposed two-dimensional automata as a computational model of two-dimensional pattern processing, and investigated their pattern recognition abilities in 1967 [7]. Since then, a lot of researchers in this field have been investigating many properties about automata on a two- or three-dimensional tape. On the other hand, the question of whether processing fourdimensional digital patterns is much more difficult than two- or threedimensional ones is of great interest from the theoretical and practical standpoints. Thus, the study of four-dimensional automata as a computasional model of four-dimensional pattern processing has been meaningful [8]-[19],[21]. This paper introduces a cooperating system of four-dimensional finite automata as one model of four-dimensional automata. A cooperating system of four-dimensional finite automata consists of a finite number of four-dimensional finite automata and a four-dimensional input tape where these finite automata work independently (in parallel). Those finite automata whose input heads scan the same cell of the input tape can communicate with each other, that is, every finite automaton is allowed to know the internal states of other finite automata on the same cell it is scanning at the moment. In this paper, we mainly investigate some accepting powers of a cooperating system of eight- or seven-way four-dimensional finite automata. The seven-way four-dimensional finite automaton is an eight-way four-dimensional finite automaton whose input head can move east, west, south, north, up, down, or in the fu-ture, but not in the past on a four-dimensional input tape.

Swarm Navigation in a Complex Environment

Year: 2012 Volume: 6 Issue: 12 1676 - 1682 Pages

Abstract: This paper proposes a solution to the motion planning and control problem of car-like mobile robots which is required to move safely to a designated target in a priori known workspace cluttered with swarm of boids exhibiting collective emergent behaviors. A generalized algorithm for target convergence and swarm avoidance is proposed that will work for any number of swarms. The control laws proposed in this paper also ensures practical stability of the system. The effectiveness of the proposed control laws are demonstrated via computer simulations of an emergent behavior.

An Incomplete Factorization Preconditioner for LMS Adaptive Filter

Year: 2012 Volume: 6 Issue: 12 1670 - 1675 Pages

Abstract: In this paper an efficient incomplete factorization preconditioner is proposed for the Least Mean Squares (LMS) adaptive filter. The proposed preconditioner is approximated from a priori knowledge of the factors of input correlation matrix with an incomplete strategy, motivated by the sparsity patter of the upper triangular factor in the QRD-RLS algorithm. The convergence properties of IPLMS algorithm are comparable with those of transform domain LMS(TDLMS) algorithm. Simulation results show efficiency and robustness of the proposed algorithm with reduced computational complexity.

Modeling and Verification for the Micropayment Protocol Netpay

Year: 2012 Volume: 6 Issue: 12 1661 - 1669 Pages

Abstract: There are many virtual payment systems available to conduct micropayments. It is essential that the protocols satisfy the highest standards of correctness. This paper examines the Netpay Protocol [3], provide its formalization as automata model, and prove two important correctness properties, namely absence of deadlock and validity of an ecoin during the execution of the protocol. This paper assumes a cooperative customer and will prove that the protocol is executing according to its description.

Numerical Approximation to the Performance of CUSUM Charts for EMA (1) Process

Year: 2012 Volume: 6 Issue: 12 1656 - 1660 Pages

Abstract: These paper, we approximate the average run length (ARL) for CUSUM chart when observation are an exponential first order moving average sequence (EMA1). We used Gauss-Legendre numerical scheme for integral equations (IE) method for approximate ARL0 and ARL1, where ARL in control and out of control, respectively. We compared the results from IE method and exact solution such that the two methods perform good agreement.

Applying Tabu Search Algorithm in Public Transport: A Case Study for University Students in Mauritius

Year: 2012 Volume: 6 Issue: 12 1651 - 1655 Pages

Abstract: In this paper, the Tabu search algorithm is used to solve a transportation problem which consists of determining the shortest routes with the appropriate vehicle capacity to facilitate the travel of the students attending the University of Mauritius. The aim of this work is to minimize the total cost of the distance travelled by the vehicles in serving all the customers. An initial solution is obtained by the TOUR algorithm which basically constructs a giant tour containing all the customers and partitions it in an optimal way so as to produce a set of feasible routes. The Tabu search algorithm then makes use of a search procedure, a swapping procedure and the intensification and diversification mechanism to find the best set of feasible routes.

The Performance of Predictive Classification Using Empirical Bayes

Year: 2012 Volume: 6 Issue: 12 1647 - 1650 Pages

Abstract: This research is aimed to compare the percentages of correct classification of Empirical Bayes method (EB) to Classical method when data are constructed as near normal, short-tailed and long-tailed symmetric, short-tailed and long-tailed asymmetric. The study is performed using conjugate prior, normal distribution with known mean and unknown variance. The estimated hyper-parameters obtained from EB method are replaced in the posterior predictive probability and used to predict new observations. Data are generated, consisting of training set and test set with the sample sizes 100, 200 and 500 for the binary classification. The results showed that EB method exhibited an improved performance over Classical method in all situations under study.

Distribution Sampling of Vector Variance without Duplications

Year: 2012 Volume: 6 Issue: 12 1643 - 1646 Pages

Abstract: In recent years, the use of vector variance as a measure of multivariate variability has received much attention in wide range of statistics. This paper deals with a more economic measure of multivariate variability, defined as vector variance minus all duplication elements. For high dimensional data, this will increase the computational efficiency almost 50 % compared to the original vector variance. Its sampling distribution will be investigated to make its applications possible.

The Integrated Studies of Infectious Disease Using Mathematical Modeling and Computer Simulation

Year: 2012 Volume: 6 Issue: 12 1635 - 1642 Pages

Abstract: In this paper we develop and analyze the model for the spread of Leptospirosis by age group in Thailand, between 1997 and 2010 by using mathematical modeling and computer simulation. Leptospirosis is caused by pathogenic spirochetes of the genus Leptospira. It is a zoonotic disease of global importance and an emerging health problem in Thailand. In Thailand, leptospirosis is a reportable disease, the top three age groups are 23.31% in 35-44 years olds group, 22.76% in 25-34 year olds group, 17.60% in 45-54 year olds group from reported leptospirosis between 1997 and 2010, with a peak in 35-44 year olds group. Our paper, the Leptosipirosis transmission by age group in Thailand is studied on the mathematical model. Some analytical and simulation results are presented.

Motion Control of a 2-link Revolute Manipulator in an Obstacle-Ridden Workspace

Year: 2012 Volume: 6 Issue: 12 1629 - 1634 Pages

Abstract: In this paper, we propose a solution to the motion control problem of a 2-link revolute manipulator arm. We require the end-effector of the arm to move safely to its designated target in a priori known workspace cluttered with fixed circular obstacles of arbitrary position and sizes. Firstly a unique velocity algorithm is used to move the end-effector to its target. Secondly, for obstacle avoidance a turning angle is designed, which when incorporated into the control laws ensures that the entire robot arm avoids any number of fixed obstacles along its path enroute the target. The control laws proposed in this paper also ensure that the equilibrium point of the system is asymptotically stable. Computer simulations of the proposed technique are presented.

Dynamical Network Transmission of H1N1 Virus at the Local Level Transmission Model

Year: 2012 Volume: 6 Issue: 12 1623 - 1628 Pages

Authors:
P. Pongsumpun

Abstract: A new strain of Type A influenza virus can cause the transmission of H1N1 virus. This virus can spread between the people by coughing and sneezing. Because the people are always movement, so this virus can be easily spread. In this study, we construct the dynamical network model of H1N1 virus by separating the human into five groups; susceptible, exposed, infectious, quarantine and recovered groups. The movement of people between houses (local level) is considered. The behaviors of solutions to our dynamical model are shown for the different parameters.

International Journal of Engineering, Mathematical and Physical Sciences

Archive

Last Issue

Top Journal

SUGGEST A JOURNAL