The Experts below are selected from a list of 321 Experts worldwide ranked by ideXlab platform

Alexis Baratoff - One of the best experts on this subject based on the ideXlab platform.

  • Theory of single atom manipulation with a scanning probe tip: Force signatures, Constant-Height, and Constant-force scans
    Physical Review B, 2003
    Co-Authors: Laurent Pizzagalli, Alexis Baratoff
    Abstract:

    International audienceWe report theoretical results predicting the atomic manipulation of a silver atom on a Si(001) surface by a scanning probe tip, and providing insight into the manipulation phenomena. A molecular mechanics technique has been used, the system being described by a quantum chemistry method for the short-range interactions and an analytical model for the long-range ones. Taking into account several shapes, orientations, and chemical natures of the scanning tip, we observed four different ways to manipulate the deposited atom in a Constant-Height mode. In particular, the manipulation is predicted to be possible with a Si(111) tip for different tip shapes and adatom locations on the silicon surface. The calculation of the forces during the manipulation revealed that specific variations can be associated with each kind of process. These force signatures, such as the tip Height signatures observed in scanning tunneling microscope experiments, could be used to deduce the process involved in an experiment. Finally, we present preliminary results about the manipulation in Constant-force mode

  • Theory of single atom manipulation with a scanning probe tip: Force signatures, Constant-Height, and Constant-force scans
    Physical Review B: Condensed Matter and Materials Physics (1998-2015), 2003
    Co-Authors: Laurent Pizzagalli, Alexis Baratoff
    Abstract:

    We report theoretical results predicting the atomic manipulation of a silver atom on a Si(001) surface by a scanning probe tip, and providing insight into the manipulation phenomena. A molecular mechanics technique has been used, the system being described by a quantum chemistry method for the short-range interactions and an analytical model for the long-range ones. Taking into account several shapes, orientations, and chemical natures of the scanning tip, we observed four different ways to manipulate the deposited atom in a Constant-Height mode. In particular, the manipulation is predicted to be possible with a Si(111) tip for different tip shapes and adatom locations on the silicon surface. The calculation of the forces during the manipulation revealed that specific variations can be associated with each kind of process. These force signatures, such as the tip Height signatures observed in scanning tunneling microscope experiments, could be used to deduce the process involved in an experiment. Finally, we present preliminary results about the manipulation in Constant-force mode.

Laurent Pizzagalli - One of the best experts on this subject based on the ideXlab platform.

  • Theory of single atom manipulation with a scanning probe tip: Force signatures, Constant-Height, and Constant-force scans
    Physical Review B, 2003
    Co-Authors: Laurent Pizzagalli, Alexis Baratoff
    Abstract:

    International audienceWe report theoretical results predicting the atomic manipulation of a silver atom on a Si(001) surface by a scanning probe tip, and providing insight into the manipulation phenomena. A molecular mechanics technique has been used, the system being described by a quantum chemistry method for the short-range interactions and an analytical model for the long-range ones. Taking into account several shapes, orientations, and chemical natures of the scanning tip, we observed four different ways to manipulate the deposited atom in a Constant-Height mode. In particular, the manipulation is predicted to be possible with a Si(111) tip for different tip shapes and adatom locations on the silicon surface. The calculation of the forces during the manipulation revealed that specific variations can be associated with each kind of process. These force signatures, such as the tip Height signatures observed in scanning tunneling microscope experiments, could be used to deduce the process involved in an experiment. Finally, we present preliminary results about the manipulation in Constant-force mode

  • Theory of single atom manipulation with a scanning probe tip: Force signatures, Constant-Height, and Constant-force scans
    Physical Review B: Condensed Matter and Materials Physics (1998-2015), 2003
    Co-Authors: Laurent Pizzagalli, Alexis Baratoff
    Abstract:

    We report theoretical results predicting the atomic manipulation of a silver atom on a Si(001) surface by a scanning probe tip, and providing insight into the manipulation phenomena. A molecular mechanics technique has been used, the system being described by a quantum chemistry method for the short-range interactions and an analytical model for the long-range ones. Taking into account several shapes, orientations, and chemical natures of the scanning tip, we observed four different ways to manipulate the deposited atom in a Constant-Height mode. In particular, the manipulation is predicted to be possible with a Si(111) tip for different tip shapes and adatom locations on the silicon surface. The calculation of the forces during the manipulation revealed that specific variations can be associated with each kind of process. These force signatures, such as the tip Height signatures observed in scanning tunneling microscope experiments, could be used to deduce the process involved in an experiment. Finally, we present preliminary results about the manipulation in Constant-force mode.

Dominique Barchiesi - One of the best experts on this subject based on the ideXlab platform.

Beatrice Palano - One of the best experts on this subject based on the ideXlab platform.

  • Boolean language operations on nondeterministic automata with a pushdown of Constant Height
    Journal of Computer and System Sciences, 2017
    Co-Authors: Zuzana Bednarova, Viliam Geffert, Carlo Mereghetti, Beatrice Palano
    Abstract:

    We study the size-cost of Boolean operations on Constant Height nondeterministic pushdown automata, i.e. on pushdown automata with a Constant limit on the size of the pushdown. For intersection, we show an exponential simulation and prove that the exponential blow-up is necessary. For union, instead, we provide a linear trade-off while, for complement, we show a double-exponential simulation and prove a single-exponential lower bound.

  • removing nondeterminism in Constant Height pushdown automata
    Information & Computation, 2014
    Co-Authors: Zuzana Bednarova, Viliam Geffert, Carlo Mereghetti, Beatrice Palano
    Abstract:

    We study the descriptional cost of removing nondeterminism in Constant Height pushdown automata-i.e., pushdown automata with a built-in Constant limit on the Height of the pushdown. We show a double-exponential size increase when converting a Constant Height nondeterministic pushdown automaton into an equivalent deterministic device. Moreover, we prove that such a double-exponential blow-up cannot be avoided by certifying its optimality. As a direct consequence, we get that eliminating nondeterminism in classical finite state automata is single-exponential even with the help of a Constant Height pushdown store.

  • DCFS - Queue Automata of Constant Length
    Descriptional Complexity of Formal Systems, 2013
    Co-Authors: Sebastian Jakobi, Carlo Mereghetti, Katja Meckel, Beatrice Palano
    Abstract:

    We introduce and study the notion of Constant length queue automata, as a formalism for representing regular languages. We show that their descriptional power outperforms that of traditional finite state automata, of Constant Height pushdown automata, and of straight line programs for regular expressions, by providing optimal exponential and double-exponential size gaps. Moreover, we prove that Constant Height pushdown automata can be simulated by Constant length queue automata paying only by a linear size increase, and that removing nondeterminism in Constant length queue automata requires an optimal exponential size blow-up, against the optimal double-exponential cost for determinizing Constant Height pushdown automata.

  • removing nondeterminism in Constant Height pushdown automata
    Descriptional Complexity of Formal Systems, 2012
    Co-Authors: Zuzana Bednarova, Viliam Geffert, Carlo Mereghetti, Beatrice Palano
    Abstract:

    We study the descriptional cost of converting Constant Height nondeterministic pushdown automata into equivalent deterministic devices. We show a double-exponential upper bound for this conversion, together with a super-exponential lower bound.

  • The size-cost of Boolean operations on Constant Height deterministic pushdown automata
    Theoretical Computer Science, 2012
    Co-Authors: Zuzana Bednarova, Viliam Geffert, Carlo Mereghetti, Beatrice Palano
    Abstract:

    We study the size-cost of Boolean operations on Constant Height deterministic pushdown automata, i.e., on the traditional pushdown automata with a built-in Constant limit on the Height of the pushdown. We design a simulation showing that a complement can be obtained with a polynomial tradeoff. For intersection and union, we show an exponential simulation, and prove that the exponential blow-up cannot be avoided.

Andrew Winslow - One of the best experts on this subject based on the ideXlab platform.

  • size dependent tile self assembly Constant Height rectangles and stability
    International Symposium on Algorithms and Computation, 2015
    Co-Authors: Sándor P. Fekete, Robert T. Schweller, Andrew Winslow
    Abstract:

    We introduce a new model of algorithmic tile self-assembly called size-dependent assembly. In previous models, supertiles are stable when the total strength of the bonds between any two halves exceeds some Constant temperature. In this model, this Constant temperature requirement is replaced by an nondecreasing temperature function\(\tau : \mathbb {N} \rightarrow \mathbb {N}\) that depends on the size of the smaller of the two halves. This generalization allows supertiles to become unstable and break apart, and captures the increased forces that large structures may place on the bonds holding them together.

  • ISAAC - Size-Dependent Tile Self-Assembly: Constant-Height Rectangles and Stability
    Algorithms and Computation, 2015
    Co-Authors: Sándor P. Fekete, Robert T. Schweller, Andrew Winslow
    Abstract:

    We introduce a new model of algorithmic tile self-assembly called size-dependent assembly. In previous models, supertiles are stable when the total strength of the bonds between any two halves exceeds some Constant temperature. In this model, this Constant temperature requirement is replaced by an nondecreasing temperature function\(\tau : \mathbb {N} \rightarrow \mathbb {N}\) that depends on the size of the smaller of the two halves. This generalization allows supertiles to become unstable and break apart, and captures the increased forces that large structures may place on the bonds holding them together.

  • Size-Dependent Tile Self-Assembly: Constant-Height Rectangles and Stability
    arXiv: Computational Geometry, 2015
    Co-Authors: Sándor P. Fekete, Robert T. Schweller, Andrew Winslow
    Abstract:

    We introduce a new model of algorithmic tile self-assembly called size-dependent assembly. In previous models, supertiles are stable when the total strength of the bonds between any two halves exceeds some Constant temperature. In this model, this Constant temperature requirement is replaced by an nondecreasing temperature function $\tau : \mathbb{N} \rightarrow \mathbb{N}$ that depends on the size of the smaller of the two halves. This generalization allows supertiles to become unstable and break apart, and captures the increased forces that large structures may place on the bonds holding them together. We demonstrate the power of this model in two ways. First, we give fixed tile sets that assemble Constant-Height rectangles and squares of arbitrary input size given an appropriate temperature function. Second, we prove that deciding whether a supertile is stable is coNP-complete. Both results contrast with known results for fixed temperature.