79,158 research outputs found

    Machine learning assembly landscapes from particle tracking data

    Get PDF
    Bottom-up self-assembly offers a powerful route for the fabrication of novel structural and functional materials. Rational engineering of self-assembling systems requires understanding of the accessible aggregation states and the structural assembly pathways. In this work, we apply nonlinear machine learning to experimental particle tracking data to infer low-dimensional assembly landscapes mapping the morphology, stability, and assembly pathways of accessible aggregates as a function of experimental conditions. To the best of our knowledge, this represents the first time that collective order parameters and assembly landscapes have been inferred directly from experimental data. We apply this technique to the nonequilibrium self-assembly of metallodielectric Janus colloids in an oscillating electric field, and quantify the impact of field strength, oscillation frequency, and salt concentration on the dominant assembly pathways and terminal aggregates. This combined computational and experimental framework furnishes new understanding of self-assembling systems, and quantitatively informs rational engineering of experimental conditions to drive assembly along desired aggregation pathways. © 2015 The Royal Society of Chemistryope

    On microelectronic self-learning cognitive chip systems

    Get PDF
    After a brief review of machine learning techniques and applications, this Ph.D. thesis examines several approaches for implementing machine learning architectures and algorithms into hardware within our laboratory. From this interdisciplinary background support, we have motivations for novel approaches that we intend to follow as an objective of innovative hardware implementations of dynamically self-reconfigurable logic for enhanced self-adaptive, self-(re)organizing and eventually self-assembling machine learning systems, while developing this new particular area of research. And after reviewing some relevant background of robotic control methods followed by most recent advanced cognitive controllers, this Ph.D. thesis suggests that amongst many well-known ways of designing operational technologies, the design methodologies of those leading-edge high-tech devices such as cognitive chips that may well lead to intelligent machines exhibiting conscious phenomena should crucially be restricted to extremely well defined constraints. Roboticists also need those as specifications to help decide upfront on otherwise infinitely free hardware/software design details. In addition and most importantly, we propose these specifications as methodological guidelines tightly related to ethics and the nowadays well-identified workings of the human body and of its psyche

    Modelling and analyzing adaptive self-assembling strategies with Maude

    Get PDF
    Building adaptive systems with predictable emergent behavior is a challenging task and it is becoming a critical need. The research community has accepted the challenge by introducing approaches of various nature: from software architectures, to programming paradigms, to analysis techniques. We recently proposed a conceptual framework for adaptation centered around the role of control data. In this paper we show that it can be naturally realized in a reflective logical language like Maude by using the Reflective Russian Dolls model. Moreover, we exploit this model to specify and analyse a prominent example of adaptive system: robot swarms equipped with obstacle-avoidance self-assembly strategies. The analysis exploits the statistical model checker PVesta

    Optimal self-assembly of finite shapes at temperature 1 in 3D

    Full text link
    Working in a three-dimensional variant of Winfree's abstract Tile Assembly Model, we show that, for an arbitrary finite, connected shape XZ2X \subset \mathbb{Z}^2, there is a tile set that uniquely self-assembles into a 3D representation of a scaled-up version of XX at temperature 1 in 3D with optimal program-size complexity (the "program-size complexity", also known as "tile complexity", of a shape is the minimum number of tile types required to uniquely self-assemble it). Moreover, our construction is "just barely" 3D in the sense that it only places tiles in the z=0z = 0 and z=1z = 1 planes. Our result is essentially a just-barely 3D temperature 1 simulation of a similar 2D temperature 2 result by Soloveichik and Winfree (SICOMP 2007)

    Self-Replicating Strands that Self-Assemble into User-Specified Meshes

    Get PDF
    It has been argued that a central objective of nanotechnology is to make products inexpensively, and that self-replication is an effective approach to very low-cost manufacturing. The research presented here is intended to be a step towards this vision. In previous work (JohnnyVon 1.0), we simulated machines that bonded together to form self-replicating strands. There were two types of machines (called types 0 and 1), which enabled strands to encode arbitrary bit strings. However, the information encoded in the strands had no functional role in the simulation. The information was replicated without being interpreted, which was a significant limitation for potential manufacturing applications. In the current work (JohnnyVon 2.0), the information in a strand is interpreted as instructions for assembling a polygonal mesh. There are now four types of machines and the information encoded in a strand determines how it folds. A strand may be in an unfolded state, in which the bonds are straight (although they flex slightly due to virtual forces acting on the machines), or in a folded state, in which the bond angles depend on the types of machines. By choosing the sequence of machine types in a strand, the user can specify a variety of polygonal shapes. A simulation typically begins with an initial unfolded seed strand in a soup of unbonded machines. The seed strand replicates by bonding with free machines in the soup. The child strands fold into the encoded polygonal shape, and then the polygons drift together and bond to form a mesh. We demonstrate that a variety of polygonal meshes can be manufactured in the simulation, by simply changing the sequence of machine types in the seed

    Molecular Screening for Terahertz Detection with Machine-Learning-Based Methods

    Get PDF
    The molecular requirements are explored for achieving efficient signal up-conversion in a recently developed technique for terahertz (THz) detection based on molecular optomechanics. We discuss which molecular and spectroscopic properties are most important for predicting efficient THz detection and outline a computational approach based on quantum-chemistry and machine-learning methods for calculating these properties. We validate this approach by bulk and surface-enhanced Raman scattering and infrared absorption measurements. We develop a virtual screening methodology performed on databases of millions of commercially available compounds. Quantum-chemistry calculations for about 3000 compounds are complemented by machine-learning methods to predict applicability of 93 000 organic molecules for detection. Training is performed on vibrational spectroscopic properties based on absorption and Raman scattering intensities. Our top molecules have conversion intensity two orders of magnitude higher than an average molecule from the database. We also discuss how other properties like molecular shape and self-assembling properties influence the detection efficiency. We identify molecular moieties whose presence in the molecules indicates high activity for THz detection and show an example where a simple modification of a frequently used self-assembling compound can enhance activity 85-fold. The capabilities of our screening method are demonstrated on narrow-band and broadband detection examples, and its possible applications in surface-enhanced spectroscopy are also discussed

    Natural Variation and Neuromechanical Systems

    Get PDF
    Natural variation plays an important but subtle and often ignored role in neuromechanical systems. This is especially important when designing for living or hybrid systems \ud which involve a biological or self-assembling component. Accounting for natural variation can be accomplished by taking a population phenomics approach to modeling and analyzing such systems. I will advocate the position that noise in neuromechanical systems is partially represented by natural variation inherent in user physiology. Furthermore, this noise can be augmentative in systems that couple physiological systems with technology. There are several tools and approaches that can be borrowed from computational biology to characterize the populations of users as they interact with the technology. In addition to transplanted approaches, the potential of natural variation can be understood as having a range of effects on both the individual's physiology and function of the living/hybrid system over time. Finally, accounting for natural variation can be put to good use in human-machine system design, as three prescriptions for exploiting variation in design are proposed

    Optimal Staged Self-Assembly of General Shapes

    Get PDF
    We analyze the number of tile types tt, bins bb, and stages necessary to assemble n×nn \times n squares and scaled shapes in the staged tile assembly model. For n×nn \times n squares, we prove O(logntbtlogtb2+loglogblogt)\mathcal{O}(\frac{\log{n} - tb - t\log t}{b^2} + \frac{\log \log b}{\log t}) stages suffice and Ω(logntbtlogtb2)\Omega(\frac{\log{n} - tb - t\log t}{b^2}) are necessary for almost all nn. For shapes SS with Kolmogorov complexity K(S)K(S), we prove O(K(S)tbtlogtb2+loglogblogt)\mathcal{O}(\frac{K(S) - tb - t\log t}{b^2} + \frac{\log \log b}{\log t}) stages suffice and Ω(K(S)tbtlogtb2)\Omega(\frac{K(S) - tb - t\log t}{b^2}) are necessary to assemble a scaled version of SS, for almost all SS. We obtain similarly tight bounds when the more powerful flexible glues are permitted.Comment: Abstract version appeared in ESA 201
    corecore