Communication in membrana Systems with symbol Objects.

Esta tesis está dedicada a los sistemas de membranas con objetos-símbolo como marco teórico de los sistemas paralelos y distribuidos de procesamiento de multiconjuntos.Una computación de parada puede aceptar, generar o procesar un número, un vector o una palabra; por tanto el sistema define globalmente (a través de los resultados de todas sus computaciones) un conjunto de números, de vectores, de palabras (es decir, un lenguaje), o bien una función. En esta tesis estudiamos la capacidad de estos sistemas para resolver problemas particulares, así como su potencia computacional. Por ejemplo, las familias de lenguajes definidas por diversas clases de estos sistemas se comparan con las familias clásicas, esto es, lenguajes regulares, independientes del contexto, generados por sistemas 0L tabulados extendidos, generados por gramáticas matriciales sin chequeo de apariciones, recursivamente enumerables, etc. Se prestará especial atención a la comunicación de objetos entre regiones y a las distintas formas de cooperación entre ellos.Se pretende (Sección 3.4) realizar una formalización los sistemas de membranas y construir una herramienta tipo software para la variante que usa cooperación no distribuida, el navegador de configuraciones, es decir, un simulador, en el cual el usuario selecciona la siguiente configuración entre todas las posibles, estando permitido volver hacia atrás. Se considerarán diversos modelos distribuidos. En el modelo de evolución y comunicación (Capítulo 4) separamos las reglas tipo-reescritura y las reglas de transporte (llamadas symport y antiport). Los sistemas de bombeo de protones (proton pumping, Secciones 4.8, 4.9) constituyen una variante de los sistemas de evolución y comunicación con un modo restrictivo de cooperación. Un modelo especial de computación con membranas es el modelo puramente comunicativo, en el cual los objetos traspasan juntos una membrana. Estudiamos la potencia computacional de las sistemas de membranas con symport/antiport de 2 o 3 objetos (Capítulo 5) y la potencia computacional de las sistemas de membranas con alfabeto limitado (Capítulo 6).El determinismo (Secciones 4.7, 5.5, etc.) es una característica especial (restrictiva) de los sistemas computacionales. Se pondrá especial énfasis en analizar si esta restricción reduce o no la potencia computacional de los mismos. Los resultados obtenidos para sistemas de bombeo del protones están transferidos (Sección 7.3) a sistemas con catalizadores bistabiles. Unos ejemplos de aplicación concreta de los sistemas de membranas (Secciones 7.1, 7.2) son la resolución de problemas NP-completos en tiempo polinomial y la resolución de problemas de ordenación.This thesis deals with membrane systems with symbol objects as a theoretical framework of distributed parallel multiset processing systems.A halting computation can accept, generate or process a number, a vector or a word, so the system globally defines (by the results of all its computations) a set of numbers or a set of vectors or a set of words, (i.e., a language), or a function. The ability of these systems to solve particular problems is investigated, as well as their computational power, e.g., the language families defined by different classes of these systems are compared to the classical ones, i.e., regular, context-free, languages generated by extended tabled 0L systems, languages generated by matrix grammars without appearance checking, recursively enumerable languages, etc. Special attention is paid to communication of objects between the regions and to the ways of cooperation between the objects.An attempt to formalize the membrane systems is made (Section 3.4), and a software tool is constructed for the non-distributed cooperative variant, the configuration browser, i.e., a simulator, where the user chooses the next configuration among the possible ones and can go back. Different distributed models are considered. In the evolution-communication model (Chapter 4) rewriting-like rules are separated from transport rules. Proton pumping systems (Sections 4.8, 4.9) are a variant of the evolution-communication systems with a restricted way of cooperation. A special membrane computing model is a purely communicative one: the objects are moved together through a membrane. We study the computational power of membrane systems with symport/antiport of 2 or 3 objects (Chapter 5) and the computational power of membrane systems with a limited alphabet (Chapter 6).Determinism (Sections 4.7, 5.5, etc.) is a special property of computational systems; the question of whether this restriction reduces the computational power is addressed. The results on proton pumping systems can be carried over (Section 7.3) to the systems with bi-stable catalysts. Some particular examples of membrane systems applications are solving NP-complete problems in polynomial time, and solving the sorting problem

Membrane computing: traces, neural inspired models, controls

Membrane Computing:Traces, Neural Inspired Models, ControlsAutor: Armand-Mihai IonescuDirectores: Dr. Victor Mitrana (URV)Dr. Takashi Yokomori (Universidad Waseda, Japón)Resumen Castellano:El presente trabajo está dedicado a una área muy activa del cálculo natural (que intenta descubrir la odalidad en la cual la naturaleza calcula, especialmente al nivel biológico), es decir el cálculo con membranas, y más preciso, a los modelos de membranas inspirados de la funcionalidad biológica de la neurona.La disertación contribuye al área de cálculo con membranas en tres direcciones principales. Primero, introducimos una nueva manera de definir el resultado de una computación siguiendo los rastros de un objeto especificado dentro de una estructura celular o de una estructura neuronal. A continuación, nos acercamos al ámbito de la biología del cerebro, con el objetivo de obtener varias maneras de controlar la computación por medio de procesos que inhiben/de-inhiben. Tercero, introducimos e investigamos en detallo - aunque en una fase preliminar porque muchos aspectos tienen que ser clarificados - una clase de sistemas inspirados de la manera en la cual las neuronas cooperan por medio de spikes, pulsos eléctricos de formas idénticas.English summary:The present work is dedicated to a very active branch of natural computing (which tries to discover the way nature computes, especially at a biological level), namely membrane computing, more precisely, to those models of membrane systems mainly inspired from the functioning of the neural cell.The present dissertation contributes to membrane computing in three main directions. First, we introduce a new way of defining the result of a computation by means of following the traces of a specified object within a cell structure or a neural structure. Then, we get closer to the biology of the brain, considering various ways to control the computation by means of inhibiting/de-inhibiting processes. Third, we introduce and investigate in a great - though preliminary, as many issues remain to be clarified - detail a class of P systems inspired from the way neurons cooperate by means of spikes, electrical pulses of identical shapes

Membrane systems with limited parallelism

Membrane computing is an emerging research field that belongs to the more general area of molecular computing, which deals with computational models inspired from bio-molecular processes. Membrane computing aims at defining models, called membrane systems or P systems, which abstract the functioning and structure of the cell. A membrane system consists of a hierarchical arrangement of membranes delimiting regions, which represent various compartments of a cell, and with each region containing bio-chemical elements of various types and having associated evolution rules, which represent bio-chemical processes taking place inside the cell. This work is a continuation of the investigations aiming to bridge membrane computing (where in a compartmental cell-like structure the chemicals to evolve are placed in compartments defined by membranes) and brane calculi (where one considers again a compartmental cell-like structure with the chemicals/proteins placed on the membranes themselves). We use objects both in compartments and on membranes (the latter are called proteins), with the objects from membranes evolving under the control of the proteins. Several possibilities are considered (objects only moved across membranes or also changed during this operation, with the proteins only assisting the move/change or also changing themselves). Somewhat expected, computational universality is obtained for several combinations of such possibilities. We also present a method for solving the NP-complete SAT problem using P systems with proteins on membranes. The SAT problem is solved in O(nm) time, where n is the number of boolean variables and m is the number of clauses for an instance written in conjunctive normal form. Thus, we can say that the solution for each given instance is obtained in linear time. We succeeded in solving SAT by a uniform construction of a deterministic P system which uses rules involving objects in regions, proteins on membranes, and membrane division. Then, we investigate the computational power of P systems with proteins on membranes in some particular cases: when only one protein is placed on a membrane, when the systems have a minimal number of rules, when the computation evolves in accepting or computing mode, etc. This dissertation introduces also another new variant of membrane systems that uses context-free rewriting rules for the evolution of objects placed inside compartments of a cell, and symport rules for communication between membranes. The strings circulate across membranes depending on their membership to regular languages given by means of regular expressions. We prove that these rewriting-symport P systems generate all recursively enumerable languages. We investigate the computational power of these newly introduced P systems for three particular forms of the regular expressions that are used by the symport rules. A characterization of ET0L languages is obtained in this context

Determining Material Structures and Surface Chemistry by Genetic Algorithms and Quantum Chemical Simulations

With the advent of modern computing, the use of simulation in chemistry has become just as important as experiment. Simulations were originally only applicable to small molecules, but modern techniques, such as density functional theory (DFT) allow extension to materials science. While there are many valuable techniques for synthesis and characterization in chemistry laboratories, there are far more materials possible than can be synthesized, each with an entire host of surfaces. This wealth of chemical space to explore begs the use of computational chemistry to mimic synthesis and experimental characterization. In this work, genetic algorithms (GA), for the former, and DFT calculations, for the latter, are developed and used for the in silico exploration of materials chemistry. Genetic algorithms were first theorized in 1975 by John Holland and over the years subsequently expanded and developed for a variety of purposes. The first application to chemistry came in the early 1990’s and surface chemistry, specifically, appeared soon after. To complement the ability of a GA to explore chemical space is a second algorithmic technique: machine learning (ML) wherein a program is able to categorize or predict properties of an input after reviewing many, many examples of similar inputs. ML has more nebulous origins than GA, but applications to chemistry also appeared in the 1990’s. A history perspective and assessment of these techniques towards surface chemistry follows in this work. A GA designed to find the crystal structure of layered chemical materials given the material’s X-ray diffraction pattern is then developed. The approach reduces crystals into layers of atoms that are transformed and stacked until they repeat. In this manner, an entire crystal need only be represented by its base layer (or two, in some cases) and a set of instructions on how the layers are to be arranged and stacked. Molecules that may be present may not quite behave in this fashion, and so a second set of descriptors exist to determine the molecule’s position and orientation. Finally, the lattice of the unit cell is specified, and the structure is built to match. The GA determines the structure’s X-ray diffraction pattern, compares it against a provided experimental pattern, and assigns it a fitness value, where a higher value indicates a better match and a more fit individual. The most fit individuals mate, exchanging genetic material (which may mutate) to produce offspring which are further subjected to the same procedure. This GA can find the structure of bulk, layered, organic, and inorganic materials. Once a material’s bulk structure has been determined, surfaces of the material can be derived and analyzed by DFT. In this thesis, DFT is used to validate results from the GA regarding lithium-aluminum layered double hydroxide. Surface chemistry is more directly explored in the prediction of adsorbates on surfaces of lithiated nickel-manganese-cobalt oxide, a common cathode material in lithium-ion batteries. Surfaces are evaluated at the DFT+U level of theory, which reduces electron over-delocalization, and the energies of the surfaces both bare and with adsorbates are compared. By applying first-principles thermodynamics to predict system energies under varying temperatures and pressures, the behavior of these surfaces in experimental conditions is predicted to be mostly pristine and bare of adsorbates. For breadth, this thesis also presents an investigation of the electronic and optical properties of organic semiconductors via DFT and time-dependent DFT calculations

In Memoriam, Solomon Marcus

This book commemorates Solomon Marcus’s fifth death anniversary with a selection of articles in mathematics, theoretical computer science, and physics written by authors who work in Marcus’s research fields, some of whom have been influenced by his results and/or have collaborated with him

Law and Policy for the Quantum Age

Law and Policy for the Quantum Age is for readers interested in the political and business strategies underlying quantum sensing, computing, and communication. This work explains how these quantum technologies work, future national defense and legal landscapes for nations interested in strategic advantage, and paths to profit for companies

Uselessness in Reserve? An exploration of the laugh track, “media” and the frivolous

Uselessness in Reserve? An exploration of the laugh track, “media” and the frivolous Dylan Cree, PhD Concordia University, 2017 Within contemporary media studies the notion uselessness is either under-examined or given short-play as representing quantifiable loss. Registered as material waste or as mechanical deficiency measured by what is useful that which is useless gets categorically parsed and dismissed as an irrelevant by-product of a medium’s operations. However, by definition, uselessness resists being instrumentalized and assigned a knowable role. Furthermore, as the thesis argues, when considered materially, what is deemed useless to the optimal workings of a technological medium, whether wanted or not, surreptitiously impacts the reserve of procedures that delimit the workings of a media formation. Though the notion uselessness, as informed by Jacques Derrida’s deconstruction of Etienne Bonnot de Condillac’s account of the frivolous/uselessness, is paradoxical in kind and indeterminate in effect, the thesis proposes that uselessness is far more integral to media formations than contemporary discourse permit. Accordingly, media theorists need to foster other approaches that allow engaging such an aporia. For directly exploring uselessness in media, the laugh track holds promise as an instance in which a media formation makes useless its production. However, to examine the laugh track by how it may be illogically constituted – as opposed to conventional examinations of how the laugh track functions or serves broader interests – requires deployment of certain expansive methods and discursive tools. Accordingly, Siegfried Zielinski’s media anarchaeology permits exploring the laugh track as its own paradoxical system. His approach helps to investigate the operational attributes that re-codify the laugh track’s material registry as a redundant system of archivation, a uselessness in reserve. Ultimately, Zielinski’s anarchic approach permits drawing radical implications beyond technological and communicative-governed formulations of media. The laugh track may be explored much like how Giorgio Agamben speculates about the gesture. For Agamben the gesture may be experienced as a “pure means” or an activity liberated from content and purpose dictated by apophantic principles. Accordingly, independently of means/end instrumentalist thinking the laugh track may be encountered by how it, integral to its mediatic operations, paradoxically maintains its productivity through a gesture – of never-ending archival actions – that renders its product useless

Chemical programming to eploit chemical Reaction systems for computation

This thesis is on programming approaches to exploit the computational capabilities of chemical systems, consisting of two parts. In the first part, constructive design, research activities on theoretical development of chemical programming are reported. As results of the investigations, general programming principles, named organization-oriented programming, are derived. The idea is to design reaction networks such that the desired computational outputs correspond to the organizational structures within the networks. The second part, autonomous design, discusses on programming strategies without human interactions, namely evolution and exploration. Motivations for this programming approach include possibilities to discover novelty without rationalization. Regarding first the evolutionary strategies, we rather focused on how to track the evolutionary processes. Our approach is to analyze these dynamical processes on a higher level of abstraction, and usefulness of distinguishing organizational evolution in space of organizations from actual evolution in state space is emphasized. As second strategy of autonomous chemical programming, we suggest an explorative approach, in which an automated system is utilized to explore the behavior of the chemical reaction system as a preliminary step. A specific aspect of the system's behavior becomes ready for a programmer to be chosen for a particular computational purpose. In this thesis, developments of autonomous exploration techniques are reported. Finally, we discuss combining those two approaches, constructive design and autonomous design, titled as a hybrid approach. From our perspective, hybrid approaches are ideal, and cooperation of constructive design and autonomous design is fruitful

Engineering derivatives from biological systems for advanced aerospace applications

The present study consisted of a literature survey, a survey of researchers, and a workshop on bionics. These tasks produced an extensive annotated bibliography of bionics research (282 citations), a directory of bionics researchers, and a workshop report on specific bionics research topics applicable to space technology. These deliverables are included as Appendix A, Appendix B, and Section 5.0, respectively. To provide organization to this highly interdisciplinary field and to serve as a guide for interested researchers, we have also prepared a taxonomy or classification of the various subelements of natural engineering systems. Finally, we have synthesized the results of the various components of this study into a discussion of the most promising opportunities for accelerated research, seeking solutions which apply engineering principles from natural systems to advanced aerospace problems. A discussion of opportunities within the areas of materials, structures, sensors, information processing, robotics, autonomous systems, life support systems, and aeronautics is given. Following the conclusions are six discipline summaries that highlight the potential benefits of research in these areas for NASA's space technology programs