Particle Computation: Complexity, Algorithms, and Logic

We investigate algorithmic control of a large swarm of mobile particles (such as robots, sensors, or building material) that move in a 2D workspace using a global input signal (such as gravity or a magnetic field). We show that a maze of obstacles to the environment can be used to create complex systems. We provide a wide range of results for a wide range of questions. These can be subdivided into external algorithmic problems, in which particle configurations serve as input for computations that are performed elsewhere, and internal logic problems, in which the particle configurations themselves are used for carrying out computations. For external algorithms, we give both negative and positive results. If we are given a set of stationary obstacles, we prove that it is NP-hard to decide whether a given initial configuration of unit-sized particles can be transformed into a desired target configuration. Moreover, we show that finding a control sequence of minimum length is PSPACE-complete. We also work on the inverse problem, providing constructive algorithms to design workspaces that efficiently implement arbitrary permutations between different configurations. For internal logic, we investigate how arbitrary computations can be implemented. We demonstrate how to encode dual-rail logic to build a universal logic gate that concurrently evaluates and, nand, nor, and or operations. Using many of these gates and appropriate interconnects, we can evaluate any logical expression. However, we establish that simulating the full range of complex interactions present in arbitrary digital circuits encounters a fundamental difficulty: a fan-out gate cannot be generated. We resolve this missing component with the help of 2x1 particles, which can create fan-out gates that produce multiple copies of the inputs. Using these gates we provide rules for replicating arbitrary digital circuits.Comment: 27 pages, 19 figures, full version that combines three previous conference article

Liquid marble interaction gate for collision-based computing

© 2017 Elsevier Ltd Liquid marbles are microliter droplets of liquid, encapsulated by self-organized hydrophobic particles at the liquid/air interface. They offer an efficient approach for manipulating liquid droplets and compartmentalizing reactions in droplets. Digital fluidic devices employing liquid marbles might benefit from having embedded computing circuits without electronics and moving mechanical parts (apart from the marbles). We present an experimental implementation of a collision gate with liquid marbles. Mechanics of the gate follows principles of Margolus’ soft-sphere collision gate. Boolean values of the inputs are given by the absence (FALSE) or presence (TRUE) of a liquid marble. There are three outputs: two outputs are trajectories of undisturbed marbles (they only report TRUE when just one marble is present at one of the inputs), one output is represented by trajectories of colliding marbles (when two marbles collide they lose their horizontal momentum and fall), this output reports TRUE only when two marbles are present at inputs. Thus the gate implements AND and AND-NOT logical functions. We speculate that by merging trajectories representing AND-NOT output into a single channel one can produce a one-bit half-adder. Potential design of a one-bit full-adder is discussed, and the synthesis of both a pure nickel metal and a hybrid nickel/polymer liquid marble is reported

BSim: an agent-based tool for modeling bacterial populations in systems and synthetic biology.

Open Access ArticleLarge-scale collective behaviors such as synchronization and coordination spontaneously arise in many bacterial populations. With systems biology attempting to understand these phenomena, and synthetic biology opening up the possibility of engineering them for our own benefit, there is growing interest in how bacterial populations are best modeled. Here we introduce BSim, a highly flexible agent-based computational tool for analyzing the relationships between single-cell dynamics and population level features. BSim includes reference implementations of many bacterial traits to enable the quick development of new models partially built from existing ones. Unlike existing modeling tools, BSim fully considers spatial aspects of a model allowing for the description of intricate micro-scale structures, enabling the modeling of bacterial behavior in more realistic three-dimensional, complex environments. The new opportunities that BSim opens are illustrated through several diverse examples covering: spatial multicellular computing, modeling complex environments, population dynamics of the lac operon, and the synchronization of genetic oscillators. BSim is open source software that is freely available from http://bsim-bccs.sf.net and distributed under the Open Source Initiative (OSI) recognized MIT license. Developer documentation and a wide range of example simulations are also available from the website. BSim requires Java version 1.6 or higher.Engineering and Physical Sciences Research Council (EPSRC)Biotechnology and Biological Sciences Research Council (BBSRC

Quantum modeling of uncertainty in classical rule-based systems

[Resumo] A incerteza é un dos obstáculos cardinais cando se traballa con intelixencia artificial - é dicir, a información xestionada pode ser incompleta, incorrecta ou imprecisa. É particularmente un dos temas máis esenciais e relacionados cos sistemas baseados en regras. Aínda que a estatística foi historicamente o principal formalismo para representar a ambigüidade, existen métodos numéricos alternativos para cuantificalo (por exemplo, conxuntos difusos ou funcións de crenza). A incerteza asociada a unha hipótese pódese considerar consecuencia da propagación da imprecisión a través das distintas lóxicas inferenciais dun sistema. Tendo en conta isto, é posible modelar a ambigüidade? propón unha solución a este problema. O obxectivo principal deste traballo é reunir e avaliar a fondo un sistema cuántico baseado en regras que funciona de xeito análogo ao seu predecesor convencional. Este novo sistema trata a incerteza como un efecto positivo do carácter probabilístico inherente da mecánica cuántica. Trátase dun traballo de AI que usa técnicas de computación cuántica para resolver o problema de incerteza nos sistemas baseados en regras.[Abstract] Uncertainty is one of the cardinal obstacles when working with artificial intelligence — i.e., the managed information may be incomplete, incorrect or imprecise. It is particularly one of rule-based systems’ (RBS) most essential and convoluted issues. Albeit statistics has been historically the leading formalism to represent ambiguity, there exist alternative numerical methods to quantify it (e.g., fuzzy sets or belief functions). The associated uncertainty of a hypothesis can be considered a consequence of the propagation of imprecision through the different inferential logics of a system. Considering this, is it possible to model ambiguity? A solution to this problem is proposed by. The main goal of this work is to assemble and evaluate thoroughly a QRBS that works analogously to its conventional predecessor. This new system treats uncertainty as an innate aftereffect of the inherent probabilistic nature of QM. It is a work of AI that uses QC techniques to solve the problem of uncertainty in RBSs.Traballo fin de grao (UDC.FIC). Enxeñaría informática. Curso 2018/201

Cellular Automata

Modelling and simulation are disciplines of major importance for science and engineering. There is no science without models, and simulation has nowadays become a very useful tool, sometimes unavoidable, for development of both science and engineering. The main attractive feature of cellular automata is that, in spite of their conceptual simplicity which allows an easiness of implementation for computer simulation, as a detailed and complete mathematical analysis in principle, they are able to exhibit a wide variety of amazingly complex behaviour. This feature of cellular automata has attracted the researchers' attention from a wide variety of divergent fields of the exact disciplines of science and engineering, but also of the social sciences, and sometimes beyond. The collective complex behaviour of numerous systems, which emerge from the interaction of a multitude of simple individuals, is being conveniently modelled and simulated with cellular automata for very different purposes. In this book, a number of innovative applications of cellular automata models in the fields of Quantum Computing, Materials Science, Cryptography and Coding, and Robotics and Image Processing are presented

Novel pneumatic circuit for the computational control of soft robots

Soft robots are of significant research interest in recent decades due to their adaptability to unstructured environments and safe interaction with humans. Soft pneumatic robots, one of the most dominant subsets of soft robots, utilize the interaction between soft elastomeric materials and pressurized air to achieve desired functions. However, the systems currently used for signal computation and pneumatic regulation often make use of rigid valves, pumps, syringe drivers, microcontrollers et al. These bulky and non-integrable devices limit the performance of pneumatically-driven soft robots, carrying challenges for the robot to be miniaturized, untethered, and agile. This DPhil aims to develop pneumatic circuits that can be integrated into the soft robot bodies while performing both onboard computation and control. This thesis presents our contributions towards the aforementioned objective step by step. Firstly, we designed a 3D-printable bistable valve with tunable behaviours for controlling soft pneumatic robots. As an integrable control device, the valve stores one bit of binary information without requiring a constant energy supply and correspondingly controls a pneumatic chamber. Secondly, in order to reduce the number of valves required to control multi-chamber soft robots, we introduced a modular approach to design multi-channel bistable valves based on the previous work. Thirdly, in order to achieve continuous pressure modulation with integrable devices, we designed a soft proportional valve, utilizing the continuous deformation of Magnetorheological Elastomer (MRE) under magnetic flux. Apart from the analogue activation manner, this design also ensures a fast response time, operating at a time scale of tens of milliseconds, much shorter than the mechanical response time of most soft pneumatic actuators. Fourthly, to achieve onboard proportional control of multi-chamber soft robots, we developed an MRE valve array with an embedded cooling chamber. Physical experiments showed that our MRE valve array ensured the independence and accuracy of each valve unit within it, with a significantly lowered temperature of 73.9 $^o$C under 5 minutes of operation. Lastly, we developed an open-source software toolbox supporting the design of integrable pneumatic logic circuits to enhance their accessibility and performance. The toolbox comes with a graphical user interface (GUI) to take users' desired logic functions in the form of a truth table and a set of 2D space constraints related to the available space onboard the robot. It then schedules the pneumatic circuit which performs the desired computation within the space constraints and produces a 3D-printable CAD file that can be fabricated and used directly. The work presented in this thesis enables the community to simplify the process of integrating control devices into soft pneumatic robots, thereby paving the way for a new generation of fully untethered and autonomous soft robots

Programmeerimiskeeled turvalise ühisarvutuse rakenduste arendamiseks

Turvaline ühisarvutus on tehnoloogia, mis lubab mitmel sõltumatul osapoolel oma andmeid koos töödelda neis olevaid saladusi avalikustamata. Kui andmed on esitatud krüpteeritud kujul, tähendab see, et neid ei dekrüpteerita arvutuse käigus kordagi. Turvalise ühisarvutuse teoreetilised konstruktsioonid on teada olnud juba alates kaheksakümnendatest, kuid esimesed praktilised teostused ja rakendused, mis päris andmeid töötlesid, ilmusid alles natuke enam kui kümme aastat tagasi. Nüüdseks on turvalist ühisarvutust kasutatud mitmes praktilises rakenduses ning sellest on kujunenud oluline andmekaitsetehnoloogia. Turvalise ühisarvutuse rakenduste arendamine on keerukas. Vahendid, mis aitavad kaasa arendusprotsessile, on veel väga uued, ning raamistikud on sageli liiga aeglased praktiliste rakenduste jaoks. Rakendusi on endiselt võimelised arendama ainult krüptograafiaeksperdid. Käesoleva töö eesmärk on teha turvalise ühisarvutuse raamistikke paremaks ning muuta ühisarvutusrakenduste arendamist kergemaks. Väidame, et valdkon- naspetsiifiliste programmeerimiskeelte kasutamine võimaldab turvalise ühisarvu- tuse rakenduste ja raamistike ehitamist, mis on samaaegselt lihtsasti kasutatavad, hea jõudlusega, hooldatavad, usaldusväärsed ja võimelised suuri andmemahtusid töötlema. Peamise tulemusena esitleme kahte uut programmeerimiskeelt, mis on mõeldud turvalise ühisarvutuse jaoks. SecreC 2 on mõeldud turvalise ühisarvutuse rakendus- te arendamise lihtsustamiseks ja aitab kaasa sellele, et rakendused oleks turvalised ja efektiivsed. Teine keel on loodud turvalise ühisarvutuse protokollide arenda- miseks ning selle eesmärk on turvalise ühisarvutuse raamistikke paremaks muuta. Protokollide keel teeb raamistikke kiiremaks ja usaldusväärsemaks ning lihtsustab protokollide arendamist ja haldamist. Kirjeldame mõlemad keeled nii formaalselt kui mitteformaalselt. Näitame, kuidas mitmed rakendused ja prototüübid saavad neist keeltest kasu.Secure multi-party computation is a technology that allows several independent parties to cooperatively process their private data without revealing any secrets. If private inputs are given in encrypted form then the results will also be encrypted, and at no stage during processing are values ever decrypted. As a theoretical concept, the technology has been around since the 1980s, but the first practical implementations arose a bit more than a decade ago. Since then, secure multi-party computation has been used in practical applications, and has been established as an important method of data protection. Developing applications that use secure multi-party computation is challenging. The tools that help with development are still very young and the frameworks are often too slow for practical applications. Currently only experts in cryptography are able to develop secure multi-party applications. In this thesis we look how to improve secure multy-party computation frame- works and make the applications easier to develop. We claim that domain-specific programming languages enable to build secure multi-party applications and frame- works that are at the same time usable, efficient, maintainable, trustworthy, and practically scalable. The contribution of this thesis is the introduction of two new programming languages for secure multi-party computation. The SecreC 2 language makes secure multi-party computation application development easier, ensuring that the applications are secure and enabling them to be efficient. The second language is for developing low-level secure computation protocols. This language was created for improving secure multi-party computation frameworks. It makes the frameworks faster and more trustworthy, and protocols easier to develop and maintain. We give give both a formal and an informal overview of the two languages and see how they benefit multi-party applications and prototypes

Mathematics Yearbook 2021

The Deakin University Mathematics Yearbook publishes student reports and articles in all areas of mathematics with an aim of promoting interest and engagement in mathematics and celebrating student achievements. The 2021 edition includes 7 coursework articles, where students have extended upon submissions in their mathematics units, as well as 4 articles based on student research projects conducted throughout 2020 and 2021