Preliminary comparison of natural versus model-predicted recovery of vessel-generated seagrass injuries in Florida Keys National Marine Sanctuary

Each year, more than 500 motorized vessel groundings cause widespread damage to seagrasses in Florida Keys National Marine Sanctuary (FKNMS). Under Section 312 of the National Marine Sanctuaries Act (NMSA), any party responsible for the loss, injury, or destruction of any Sanctuary resource, including seagrass, is liable to the United States for response costs and resulting damages. As part of the damage assessment process, a cellular automata model is utilized to forecast seagrass recovery rates. Field validation of these forecasts was accomplished by comparing model-predicted percent recovery to that which was observed to be occurring naturally for 30 documented vessel grounding sites. Model recovery forecasts for both Thalassia testudinum and Syringodium filiforme exceeded natural recovery estimates for 93.1% and 89.5% of the sites, respectively. For Halodule wrightii, the number of over- and under-predictions by the model was similar. However, where under-estimation occurred, it was often severe, reflecting the well-known extraordinary growth potential of this opportunistic species. These preliminary findings indicate that the recovery model is consistently generous to Responsible Parties in that the model forecasts a much faster recovery than was observed to occur naturally, particularly for T. testudinum, the dominant seagrass species in the region and the species most often affected. Environmental setting (i.e., location, wave exposure) influences local seagrass landscape pattern and may also play a role in the recovery dynamics for a particular injury site. An examination of the relationship between selected environmental factors and injury recovery dynamics is currently underway. (PDF file contains 20 pages.)

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.

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]

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

Reliable Cellular Automata with Self-Organization

In a probabilistic cellular automaton in which all local transitions have positive probability, the problem of keeping a bit of information for more than a constant number of steps is nontrivial, even in an infinite automaton. Still, there is a solution in 2 dimensions, and this solution can be used to construct a simple 3-dimensional discrete-time universal fault-tolerant cellular automaton. This technique does not help much to solve the following problems: remembering a bit of information in 1 dimension; computing in dimensions lower than 3; computing in any dimension with non-synchronized transitions. Our more complex technique organizes the cells in blocks that perform a reliable simulation of a second (generalized) cellular automaton. The cells of the latter automaton are also organized in blocks, simulating even more reliably a third automaton, etc. Since all this (a possibly infinite hierarchy) is organized in "software", it must be under repair all the time from damage caused by errors. A large part of the problem is essentially self-stabilization recovering from a mess of arbitrary-size and content caused by the faults. The present paper constructs an asynchronous one-dimensional fault-tolerant cellular automaton, with the further feature of "self-organization". The latter means that unless a large amount of input information must be given, the initial configuration can be chosen to be periodical with a small period.

Exploratory analysis of spatiotemporal patterns of cellular automata by clustering compressibility

In this paper we study the classification of spatiotemporal pattern of one-dimensional cellular automata (CA) whereas the classification comprises CA rules including their initial conditions. We propose an exploratory analysis method based on the normalized compression distance (NCD) of spatiotemporal patterns which is used as dissimilarity measure for a hierarchical clustering. Our approach is different with respect to the following points. First, the classification of spatiotemporal pattern is comparative because the NCD evaluates explicitly the difference of compressibility among two objects, e.g., strings corresponding to spatiotemporal patterns. This is in contrast to all other measures applied so far in a similar context because they are essentially univariate. Second, Kolmogorov complexity, which underlies the NCD, was used in the classification of CA with respect to their spatiotemporal pattern. Third, our method is semiautomatic allowing us to investigate hundreds or thousands of CA rules or initial conditions simultaneously to gain insights into their organizational structure. Our numerical results are not only plausible confirming previous classification attempts but also shed light on the intricate influence of random initial conditions on the classification results.

Design of quantum-dot cellular automata circuits using cut-set retiming

As a potential alternative to CMOS technology, QCA provides an interesting paradigm in both communication and computation. However, QCAs unique four-phase clocking scheme and timing constraints present serious timing issues for interconnection and feedback. In this work, a cut-set retiming design procedure is proposed to resolve these QCA timing issues. The proposed design procedure can accommodate QCAs unique characteristics by performing delay-transfer and time-scaling to reallocate the existing delays so as to achieve efficient clocking zone assignment. Cut-set retiming makes it possible to effectively design relatively complex QCA circuits that include feedback. It utilizes the similar characteristics of synchronization, deep pipelines and local interconnections common to both QCA and systolic architectures. As a case study, a systolic Montgomery modular multiplier is designed to illustrate the procedure. Furthermore, a nonsystolic architecture, an S27 benchmark circuit, is designed and compared with previous designs. The comparison shows that the cut-set retiming method achieves a more efficient design, with a reduction of 22%, 44%, and 46% in terms of cell count, area, and latency, respectively.

Analysis of the compressive behaviour of the three-dimensional printed porous titanium for dental implants using a modified cellular solid model

A set of cylindrical porous titanium test samples were produced using the three-dimensional printing and sintering method with samples sintered at 900 °C, 1000 °C, 1100 °C, 1200 °C or 1300 °C. Following compression testing, it was apparent that the stress-strain curves were similar in shape to the curves that represent cellular solids. This is despite a relative density twice as high as what is considered the threshold for defining a cellular solid. As final sintering temperature increased, the compressive behaviour developed from being elastic-brittle to elastic-plastic and while Young's modulus remained fairly constant in the region of 1.5 GPa, there was a corresponding increase in 0.2% proof stress of approximately 40-80 MPa. The cellular solid model consists of two equations that predict Young's modulus and yield or proof stress. By fitting to experimental data and consideration of porous morphology, appropriate changes to the geometry constants allow modification of the current models to predict with better accuracy the behaviour of porous materials with higher relative densities (lower porosity).

Bit erasure analysis of binary adders in quantum-dot cellular automata

As a post-CMOS technology, the incipient Quantum-dot Cellular Automata technology has various advantages. A key aspect which makes it highly desirable is low power dissipation. One method that is used to analyse power dissipation in QCA circuits is bit erasure analysis. This method has been applied to analyse previously proposed QCA binary adders. However, a number of improved QCA adders have been proposed more recently that have only been evaluated in terms of area and speed. As the three key performance metrics for QCA circuits are speed, area and power, in this paper, a bit erasure analysis of these adders will be presented to determine their power dissipation. The adders to be analysed are the Carry Flow Adder (CFA), Brent-Kung Adder (B-K), Ladner-Fischer Adder (L-F) and a more recently developed area-delay efficient adder. This research will allow for a more comprehensive comparison between the different QCA adder proposals. To the best of the authors' knowledge, this is the first time power dissipation analysis has been carried out on these adders.