4,153 research outputs found
Universality in algorithmic self-assembly
Tile-based self-assembly is a model of algorithmic crystal growth in which square tiles represent molecules that bind to each other via specific and variable-strength bonds on their four sides, driven by random mixing in solution but constrained by the local binding rules of the tile bonds. In the late 1990s, Erik Winfree introduced a discrete mathematical model of DNA tile assembly called the abstract Tile Assembly Mode. Winfree proved
that the Tile Assembly Model is computationally universal, i.e., that any Turing machine can be encoded into a finite set of tile types whose self-assembly simulates that Turing machine. In this thesis, we investigate tile-based self-assembly systems that exhibit Turing universality, geometric universality and intrinsic universality.
We first establish a novel characterization of the computably enumerable languages in terms of self-assembly--the proof of which is a novel proof of the Turing-universality of the Tile Assembly Model in which a particular Turing machine is simulated on all inputs in parallel in the two-dimensional discrete Euclidean plane.
Then we prove that the multiple temperature tile assembly model (introduced by Aggarwal, Cheng, Goldwasser, Kao, and Schweller) exhibits a kind of geometric universality in the sense that there is a small (constant-size) universal tile set that can be programmed via deliberate changes in the system temperature to uniquely produce any finite shape.
Just as other models of computation such as the Turing machine and cellular automaton are known to be intrinsically universal, (e.g., Turing machines can simulate other Turing machines, and cellular automata other cellular automata), we show that tile assembly systems satisfying a natural condition known as local consistency are able to simulate other locally consistent tile assembly systems. In other words, we exhibit a particular locally consistent tile assembly system that can simulate the behavior--as opposed to only the final result--of any other locally consistent tile assembly system.
Finally, we consider the notion of universal fault-tolerance in algorithmic self-assembly with respect to the two-handed Tile Assembly Model, in which large aggregations of tiles may attach to each other, in contrast to the seeded Tile Assembly Model, in which tiles aggregate one at a time to a single specially-designated seed assembly. We introduce a new model of fault-tolerance in self-assembly: the fuzzy temperature model of faults having the following informal characterization: the system temperature is normally 2, but may drift down to 1, allowing unintended temperature-1 growth for an arbitrary period of time. Our main construction, which is a tile set capable of uniquely producing an square with log n unique tile types in the fuzzy temperature model, is not universal but presents novel technique that we hope will ultimately pave the way for a universal fuzzy-fault-tolerant tile assembly system in the future
AI and OR in management of operations: history and trends
The last decade has seen a considerable growth in the use of Artificial Intelligence (AI) for operations management with the aim of finding solutions to problems that are increasing in complexity and scale. This paper begins by setting the context for the survey through a historical perspective of OR and AI. An extensive survey of applications of AI techniques for operations management, covering a total of over 1200 papers published from 1995 to 2004 is then presented. The survey utilizes Elsevier's ScienceDirect database as a source. Hence, the survey may not cover all the relevant journals but includes a sufficiently wide range of publications to make it representative of the research in the field. The papers are categorized into four areas of operations management: (a) design, (b) scheduling, (c) process planning and control and (d) quality, maintenance and fault diagnosis. Each of the four areas is categorized in terms of the AI techniques used: genetic algorithms, case-based reasoning, knowledge-based systems, fuzzy logic and hybrid techniques. The trends over the last decade are identified, discussed with respect to expected trends and directions for future work suggested
Industry/University Collaboration at the University of Michigan-Dearborn: A Focus on Relevant Technology
https://deepblue.lib.umich.edu/bitstream/2027.42/154105/1/kampfner1997.pd
A Hierarchical, Fuzzy Inference Approach to Data Filtration and Feature Prioritization in the Connected Manufacturing Enterprise
The current big data landscape is one such that the technology and capability to capture and storage of data has preceded and outpaced the corresponding capability to analyze and interpret it. This has led naturally to the development of elegant and powerful algorithms for data mining, machine learning, and artificial intelligence to harness the potential of the big data environment. A competing reality, however, is that limitations exist in how and to what extent human beings can process complex information. The convergence of these realities is a tension between the technical sophistication or elegance of a solution and its transparency or interpretability by the human data scientist or decision maker. This dissertation, contextualized in the connected manufacturing enterprise, presents an original Fuzzy Approach to Feature Reduction and Prioritization (FAFRAP) approach that is designed to assist the data scientist in filtering and prioritizing data for inclusion in supervised machine learning models. A set of sequential filters reduces the initial set of independent variables, and a fuzzy inference system outputs a crisp numeric value associated with each feature to rank order and prioritize for inclusion in model training. Additionally, the fuzzy inference system outputs a descriptive label to assist in the interpretation of the feature’s usefulness with respect to the problem of interest. Model testing is performed using three publicly available datasets from an online machine learning data repository and later applied to a case study in electronic assembly manufacture. Consistency of model results is experimentally verified using Fisher’s Exact Test, and results of filtered models are compared to results obtained by the unfiltered sets of features using a proposed novel metric of performance-size ratio (PSR)
Industry/University Collaboration at the University of Michigan-Dearborn: A Focus on Relevant Technology
https://deepblue.lib.umich.edu/bitstream/2027.42/154106/1/kampfner1998.pd
Smart Nanostructures and Synthetic Quantum Systems
So far proposed quantum computers use fragile and environmentally sensitive
natural quantum systems. Here we explore the notion that synthetic quantum
systems suitable for quantum computation may be fabricated from smart
nanostructures using topological excitations of a neural-type network that can
mimic natural quantum systems. These developments are a technological
application of process physics which is a semantic information theory of
reality in which space and quantum phenomena are emergent.Comment: LaTex,14 pages 1 eps file. To be published in BioMEMS and Smart
Nanostructures, Proceedings of SPIE Conference #4590, ed. L. B. Kis
Pattern overlap implies runaway growth in hierarchical tile systems
We show that in the hierarchical tile assembly model, if there is a
producible assembly that overlaps a nontrivial translation of itself
consistently (i.e., the pattern of tile types in the overlap region is
identical in both translations), then arbitrarily large assemblies are
producible. The significance of this result is that tile systems intended to
controllably produce finite structures must avoid pattern repetition in their
producible assemblies that would lead to such overlap. This answers an open
question of Chen and Doty (SODA 2012), who showed that so-called
"partial-order" systems producing a unique finite assembly *and" avoiding such
overlaps must require time linear in the assembly diameter. An application of
our main result is that any system producing a unique finite assembly is
automatically guaranteed to avoid such overlaps, simplifying the hypothesis of
Chen and Doty's main theorem
Synthetic Quantum Systems
So far proposed quantum computers use fragile and environmentally sensitive
natural quantum systems. Here we explore the new notion that synthetic quantum
systems suitable for quantum computation may be fabricated from smart
nanostructures using topological excitations of a stochastic neural-type
network that can mimic natural quantum systems. These developments are a
technological application of process physics which is an information theory of
reality in which space and quantum phenomena are emergent, and so indicates the
deep origins of quantum phenomena. Analogous complex stochastic dynamical
systems have recently been proposed within neurobiology to deal with the
emergent complexity of biosystems, particularly the biodynamics of higher brain
function. The reasons for analogous discoveries in fundamental physics and
neurobiology are discussed.Comment: 16 pages, Latex, 1 eps figure fil
Deep Space Network information system architecture study
The purpose of this article is to describe an architecture for the Deep Space Network (DSN) information system in the years 2000-2010 and to provide guidelines for its evolution during the 1990s. The study scope is defined to be from the front-end areas at the antennas to the end users (spacecraft teams, principal investigators, archival storage systems, and non-NASA partners). The architectural vision provides guidance for major DSN implementation efforts during the next decade. A strong motivation for the study is an expected dramatic improvement in information-systems technologies, such as the following: computer processing, automation technology (including knowledge-based systems), networking and data transport, software and hardware engineering, and human-interface technology. The proposed Ground Information System has the following major features: unified architecture from the front-end area to the end user; open-systems standards to achieve interoperability; DSN production of level 0 data; delivery of level 0 data from the Deep Space Communications Complex, if desired; dedicated telemetry processors for each receiver; security against unauthorized access and errors; and highly automated monitor and control
- …