A Bacterial Foraging Optimization and Learning Automata Based Feature Selection for Motor Imagery EEG Classification

Selection of relevant features is an open problem in Brain-computer interfacing (BCI) research. Sometimes, features extracted from brain signals are high dimensional which in turn affects the accuracy of the classifier. Selection of the most relevant features improves the performance of the classifier and reduces the computational cost of the system. In this study, we have used a combination of Bacterial Foraging Optimization and Learning Automata to determine the best subset of features from a given motor imagery electroencephalography (EEG) based BCI dataset. Here, we have employed Discrete Wavelet Transform to obtain a high dimensional feature set and classified it by Distance Likelihood Ratio Test. Our proposed feature selector produced an accuracy of 80.291% in 216 seconds.

An efficient design of serial and parallel memory using Quantum dot cellular automata

Quantum cellular automata (QCA) is a new technology in the nanometer scale and has been considered as one of the alternative to CMOS technology. In this paper, we describe the design and layout of a serial memory and parallel memory, showing the layout of individual memory cells. Assuming that we can fabricate cells which are separated by 10nm, memory capacities of over 1.6 Gbit/cm2 can be achieved. Simulations on the proposed memories were carried out using QCADesigner, a layout and simulation tool for QCA. During the design, we have tried to reduce the number of cells as well as to reduce the area which is found to be 86.16sq mm and 0.12 nm2 area with the QCA based memory cell. We have also achieved an increase in efficiency by 40%.These circuits are the building block of nano processors and provide us to understand the nano devices of the future.

Room temperature magnetic quantum cellular automata

All computers process information electronically. A processing method based on magnetism is reported here, in which networks of interacting submicrometer magnetic dots are used to perform logic operations and propagate information at room temperature. The logic states are signaled by the magnetization direction of the single-domain magnetic dots; the dots couple to their nearest neighbors through magnetostatic interactions. Magnetic solitons carry information through the networks, and an applied oscillating magnetic field feeds energy into the system and serves as a clock. These networks offer a several thousandfold increase in integration density and a hundredfold reduction in power dissipation over current microelectronic technology.

Detector-induced dephasing in quantum-dot cellular automata qubit

We investigate the quantum dynamics of the quantum-dot cellular automata qubit in the presence of a quantum point contact detector by modified rate equations. It is demonstrated that the qubit information can be resolved by measuring the detector current variation. Furthermore, we show that this oscillating current and the electron occupation probabilities in states \b> and \c> decay drastically as the dephasing rate increases, clearly revealing the influence of the dephasing induced by the detector. Moreover, it is shown that the operation speed of the quantum-dot cellular automata qubit may be adjusted by varying the interdot coupling strength. (C) 2003 American Institute of Physics.

On equations for regular languages, finite automata, and sequential networks

We consider systems of equations of the form where A is the underlying alphabet, the Xi are variables, the Pi,a are boolean functions in the variables Xi, and each δi is either the empty word or the empty set. The symbols υ and denote concatenation and union of languages over A. We show that any such system has a unique solution which, moreover, is regular. These equations correspond to a type of automation, called boolean automation, which is a generalization of a nondeterministic automation. The equations are then used to determine the language accepted by a sequential network; they are obtainable directly from the network.

An automata theoretic decision procedure for the propositional mu-calculus

The propositional mu-calculus is a propositional logic of programs which incorporates a least fixpoint operator and subsumes the propositional dynamic logic of Fischer and Ladner, the infinite looping construct of Streett, and the game logic of Parikh. We give an elementary time decision procedure, using a reduction to the emptiness problem for automata on infinite trees. A small model theorem is obtained as a corollary.

Modeling of Hillslope Runoff and Soil Erosion at Rainfall Events Using Cellular Automata Approach

National Science Fund for Distinguished Young Scholars of China [40225004]; National Natural Science Foundation of China [40471048]

Cellular automata: Simulating alpine tundra vegetation dynamics in response to global warming

This study attempts to model alpine tundra vegetation dynamics in a tundra region in the Qinghai Province of China in response to global warming. We used Raster-based cellular automata and a Geographic Information System to study the spatial and temporal vegetation dynamics. The cellular automata model is implemented with IDRISI's Multi-Criteria Evaluation functionality to simulate the spatial patterns of vegetation change assuming certain scenarios of global mean temperature increase over time. The Vegetation Dynamic Simulation Model calculates a probability surface for each vegetation type, and then combines all vegetation types into a composite map, determined by the maximum likelihood that each vegetation type should distribute to each raster unit. With scenarios of global temperature increase of I to 3 degrees C, the vegetation types such as Dry Kobresia Meadow and Dry Potentilla Shrub that are adapted to warm and dry conditions tend to become more dominant in the study area.

Information Processing and Transmission in Cellular Automata

A cellular automaton is an iterative array of very simple identical information processing machines called cells. Each cell can communicate with neighboring cells. At discrete moments of time the cells can change from one state to another as a function of the states of the cell and its neighbors. Thus on a global basis, the collection of cells is characterized by some type of behavior. The goal of this investigation was to determine just how simple the individual cells could be while the global behavior achieved some specified criterion of complexity ??ually the ability to perform a computation or to reproduce some pattern. The chief result described in this thesis is that an array of identical square cells (in two dimensions), each cell of which communicates directly with only its four nearest edge neighbors and each of which can exist in only two states, can perform any computation. This computation proceeds in a straight forward way. A configuration is a specification of the states of all the cells in some area of the iterative array. Another result described in this thesis is the existence of a self-reproducing configuration in an array of four-state cells, a reduction of four states from the previously known eight-state case. The technique of information processing in cellular arrays involves the synthesis of some basic components. Then the desired behaviors are obtained by the interconnection of these components. A chapter on components describes some sets of basic components. Possible applications of the results of this investigation, descriptions of some interesting phenomena (for vanishingly small cells), and suggestions for further study are given later.

Cellular automata and non-static image processing for embodied robot systems on a massively parallel processor array

Huelse, M, Barr, D R W, Dudek, P: Cellular Automata and non-static image processing for embodied robot systems on a massively parallel processor array. In: Adamatzky, A et al. (eds) AUTOMATA 2008, Theory and Applications of Cellular Automata. Luniver Press, 2008, pp. 504-510. Sponsorship: EPSRC