M. Biafore’s scientific contributions

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (5)


Genetic Algorithms on Structurally Dynamic Lattices
  • Article

October 1997

·

5 Reads

·

2 Citations

·

M. Biafore

·

Paul Halpern

ntional cellular automata, TCA consist of a lattice, a set of site values, and a list of simple rules to determine future site values. They differ from standard automata, however, in the fact that TCA lattice connections are subject to addition or removal, based upon local coupling and decoupling rules. These rules, functions of site values in a given neighborhood, act each time step to alter lattice topology. TCA dynamics have been shown to yield a wide range of behavior, including growth, decay, periodicity and selforganization [9, 6]. Applications of TCA models are diverse, including studies of phase transformations in physical and chemical systems[10, 11]. Das, Crutchfield, Mitchell and Hanson[2] have observed emergent collective behavior by using a genetic algorithm to evolve cellular automata. In the system that we propose, a hybrid between GA and TCA dynamics, we use TCA rules to evolve a set of GA. We have found the link structure flexibility of TCA to aid in the optimization



Figure 1: 
Figure 4: The spectra obtained from [ π/ 2] y k readout pulses on the first (above) and second (below) spins, following a [ π ] y +1 pulse applied to the equilibrium 
Figure 5: 
Figure 6: The spectra obtained from readout pulses on the two spins, following a [XOR ] 1 SC pulse sequence applied to the equilibrium state (see text).
Figure 9: Two experimental NMR spectra of 2 , 3-dibromo-thiophene, which corroborate the creation of the pseudo-pure state I z 1 + I z 2 − 2 I 1 z I 2 z via readout pulses selective for the first (above) and second (below) spins (see text). 

+3

Nuclear Magnetic Resonance Spectroscopy: An Experimentally Accessible Paradigm for Quantum Computing
  • Article
  • Full-text available

August 1997

·

166 Reads

·

61 Citations

·

M. Biafore

·

David G. Cory

·

[...]

·

this paper will describe how basic quantum logic gates can be implemented via NMR spectroscopy, and present experimental results to validate our claims. After submitting the revised version of this abstract, we learned that an analogous approach has also been submitted to this workshop[7]. 2 Basic results from NMR

Download

An early sampler of CAM-8 applications

Cam-8 is parallel, uniform, scalable architecture offering unprecedented performance in the fine-grained modeling of spatially-extended systems. It provides a general-purpose instrument for the systematic exploration of a new band of the computational spectrum. This brochure is a first attempt at putting under one cover some material that would illustrate cam-8's particular orientation. The subject is space, time, and matter---the latter evolving according to an internally consistent dynamics. The stress is on interactive, real-time access to the entire simulation volume through "senses" similar to the ones used in a physical experiment: direct illumination and visualization, counting and weighing, coarse-grained averaging, event detection, and so on. All of the images in the following pages come from real-time simulations performed on a small cam-8 prototype. Using an amount and kind of technology comparable to that of a low-end workstation, this unit is about as good at large cellular automata calculations as any existing supercomputer. Larger units are currently being assembled, and much larger ones will be available soon. We plan to continue expanding and updating this brochure eventually, it will become an illustrated table of contents for a full-size book that we are working on. Perhaps an appropriate title for this book will be Programmable Matter, referring both to cam-8 itself, which is indeed a very flexible computational medium, as well as to the different kinds of concrete and abstract "matters" that will come to life within the machine itself.


Fig. 1: Schematic illustration of a two-space polymer used in two-space polymer dynamics described in the text. Monomers on the upper plane are shown as filled circles, monomers on the lower plane are shown as open circles. Monomers are attached (bonded) only to monomers in the other plane. The 'bonding-neighborhood' of each monomer is a 3x3 region of cells located in the opposite plane. A lightly shaded region indicates the bonding-neighborhood of the black monomer marked with a white dot. Its two nearest neighbors are located in this bonding-neighborhood. Bonds are indicated by line segments between monomers.
Fig 4. In fine-grained simulation one processor is assigned to a site. Assume the processor assigned to X has a monomer in its odd plane that has elected to move westward. In order to make the step, processor X has to determine that there is nothing in the even plane of processors C1, C2 and C3 (to preserve connectivity) and nothing in the even plane of processors V1, V2 and V3 (to preserve excluded volume).
Fig. 7: Comparison of timings on the KSR1 with and without synchronization on 10 4 updates of a 128x128 system containing 1 polymer of length 2. Optimal times of the parallel architecture on this trial system are for 16-32 processors. More processors may be used effectively on larger systems.
Massively Parallel Architectures and Polymer Simulation.

January 1993

·

63 Reads

·

5 Citations

A new approach to polymer simulation well suited to massively parallel architectures is presented. The approach is based on a novel two-space algorithm that enables 50% of the monomers to be updated in parallel. The simplicity of this algorithm enables implementation and comparison of different platforms. Such comparisons are relevant to a wide variety of scientific applications. We tested this algorithm on three commercially available machines, the MP-1, KSR1, and CM-2; and on a prototype of the CAM-8 architecture. Among the commercial machines we found the MP-1 provided the best performance for highly-parallel fine-grained simulations. Effective utilization of the KSR1 was achieved with attention to synchronization requirements. The small (8 node) CAM-8 prototype, with a kind and cost of hardware comparable to an engineering workstation, achieved a performance within a factor of two of the MP-1 for our application.

Citations (3)


... The polymer can coil so as to bring any two monomers into contact, yet, at any particular time, the only possible interactions are between monomers which are nearby in space. 3. Cellular automata for polymer dynamics [1] [13] [15] [17] [18] A CA Margolus dynamics for the simulation of polymers is illustrated in Figs. 1 and 2. Each cell can have two values (ON and OFF). ON cells represent monomers, and a polymer is described by a set of monomers which touch either at corners or on edges of the cells. ...

Reference:

Cellular automata for polymer simulation with application to polymer melts and polymer collapse including implications for protein folding
Massively Parallel Architectures and Polymer Simulation.

... All experiments were carried out on a Bruker AVANCE 400 MHz spectrometer at room temperature. We briefly describe our three experimental steps here and leave the details in the "Methods" section: (i) Initialization: The pseudo-pure state [39][40][41] for being the input of quantum computation 0000 j i is prepared. (More details are provided in the "Methods" section). ...

Nuclear Magnetic Resonance Spectroscopy: An Experimentally Accessible Paradigm for Quantum Computing

... The quantum speed limit (QSL) concept originated from the uncertainty relationship between conjugate variables in quantum mechanics 25,26 . It represents a fundamental constraint set by quantum mechanics on the rate of evolution for any quantum system undergoing a specific dynamical process. ...

The Maximum Speed of Dynamical Evolution
  • Citing Article
  • October 1997