New Solutions to the Firing Squad Synchronization Problems for Neural and Hyperdag P Systems

We propose two uniform solutions to an open question: the Firing Squad Synchronization Problem (FSSP), for hyperdag and symmetric neural P systems, with anonymous cells. Our solutions take e_c+5 and 6e_c+7 steps, respectively, where e_c is the eccentricity of the commander cell of the dag or digraph underlying these P systems. The first and fast solution is based on a novel proposal, which dynamically extends P systems with mobile channels. The second solution is substantially longer, but is solely based on classical rules and static channels. In contrast to the previous solutions, which work for tree-based P systems, our solutions synchronize to any subset of the underlying digraph; and do not require membrane polarizations or conditional rules, but require states, as typically used in hyperdag and neural P systems

A Minimal Time Solution to the Firing Squad Synchronization Problem with Von Neumann Neighborhood of Extent 2

Cellular automata provide a simple environment in which to study global behaviors. One example of a problem that utilizes cellular automata is the Firing Squad Synchronization Problem, first proposed in 1957. This paper provides an overview of the standard Firing Squad Synchronization Problem and a commonly used technique in solving it. This paper also provides a statement of a new extension of the Standard Firing Squad Synchronization Problem to a different neighborhood definition - a Von Neumann neighborhood of extent 2. An 8 state 651 rule minimal time solution to the extended problem is described, presented and proven, along with Python code used in running simulations of the solution

A Simple Optimum-Time FSSP Algorithm for Multi-Dimensional Cellular Automata

The firing squad synchronization problem (FSSP) on cellular automata has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed for not only one-dimensional arrays but two-dimensional arrays. In the present paper, we propose a simple recursive-halving based optimum-time synchronization algorithm that can synchronize any rectangle arrays of size m*n with a general at one corner in m+n+max(m, n)-3 steps. The algorithm is a natural expansion of the well-known FSSP algorithm proposed by Balzer [1967], Gerken [1987], and Waksman [1966] and it can be easily expanded to three-dimensional arrays, even to multi-dimensional arrays with a general at any position of the array.Comment: In Proceedings AUTOMATA&JAC 2012, arXiv:1208.249

Distributed algorithms for hard real-time systems

viii+124hlm.;24c

Achieving consensus in fault-tolerant distributed computer systems : protocols, lower bounds, and simulations

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1987.Vita.Bibliography: p. 145-149.by Brian A. Coan.Ph.D

Proceedings of JAC 2010. Journées Automates Cellulaires

The second Symposium on Cellular Automata “Journ´ees Automates Cellulaires” (JAC 2010) took place in Turku, Finland, on December 15-17, 2010. The first two conference days were held in the Educarium building of the University of Turku, while the talks of the third day were given onboard passenger ferry boats in the beautiful Turku archipelago, along the route Turku–Mariehamn–Turku. The conference was organized by FUNDIM, the Fundamentals of Computing and Discrete Mathematics research center at the mathematics department of the University of Turku. The program of the conference included 17 submitted papers that were selected by the international program committee, based on three peer reviews of each paper. These papers form the core of these proceedings. I want to thank the members of the program committee and the external referees for the excellent work that have done in choosing the papers to be presented in the conference. In addition to the submitted papers, the program of JAC 2010 included four distinguished invited speakers: Michel Coornaert (Universit´e de Strasbourg, France), Bruno Durand (Universit´e de Provence, Marseille, France), Dora Giammarresi (Universit` a di Roma Tor Vergata, Italy) and Martin Kutrib (Universit¨at Gie_en, Germany). I sincerely thank the invited speakers for accepting our invitation to come and give a plenary talk in the conference. The invited talk by Bruno Durand was eventually given by his co-author Alexander Shen, and I thank him for accepting to make the presentation with a short notice. Abstracts or extended abstracts of the invited presentations appear in the first part of this volume. The program also included several informal presentations describing very recent developments and ongoing research projects. I wish to thank all the speakers for their contribution to the success of the symposium. I also would like to thank the sponsors and our collaborators: the Finnish Academy of Science and Letters, the French National Research Agency project EMC (ANR-09-BLAN-0164), Turku Centre for Computer Science, the University of Turku, and Centro Hotel. Finally, I sincerely thank the members of the local organizing committee for making the conference possible. These proceedings are published both in an electronic format and in print. The electronic proceedings are available on the electronic repository HAL, managed by several French research agencies. The printed version is published in the general publications series of TUCS, Turku Centre for Computer Science. We thank both HAL and TUCS for accepting to publish the proceedings.Siirretty Doriast

The Brigade Combat Team (BCT): A Revolution in Organizational Structure

This paper explores the U.S. Army’s force reorganization around the Brigade Combat Team (BCT), which began in 2002. The BCT shifted how various army units interacted by changing the echelon at which different types of units report to a single commander, essentially creating self-sufficient units of about 2,500 soldiers instead of the previous self-sufficient units of about 15,000 soldiers. This paper utilizes existing organizational theories and research to better understand the implications for such a dramatic change in organizational structure. It contextualizes the army’s reorganization by applying the Rational Actor, Political, and Bureaucratic Models outlined in Essence of Decision by Graham Allison and Philip Zelikow. These models help explain why the army found the restructuring necessary. In changing the organizational structure of the U.S. Army, some processes that existed prior to the BCT became less effective and arguably outdated, such as the army’s decision-making process and personnel management system. At the same time, the army instituted a new communications system which was designed to better integrate disparate units, but was also stymied by the outdated decision-making processes. After understanding these factors, this paper asserts that various new technologies have failed to meet their full potential within the BCT due to ongoing implications related to not satisfactorily adjusting decision-making, communications systems, and personnel management based on the BCT reorganization. These technologies include unmanned aerial vehicles, integrated communications networks, and a particular armored vehicle (known as the Mine Resistant Ambush Protected Vehicle). This paper has implications for non-military organizations which have undergone or are examining the effects of structural reorganization