Low temperature scanning tunneling microscopy measurements on the adsorption of single Pb adatoms on Si(111)-(square root 3 x square root 3)-Pb surfaces reveal the vertical displacement patterns induced on the substrate by these Pb adatoms as well as a novel adatom-adatom interaction. The origin of both can be traced back to the (square root 3 x square root 3)<-->(3 x 3) phase transition taking...

Graph G is the square of graph H if two vertices x, y have an edge in G if and only if x, y are of distance at most two in H. Given H it is easy to compute its square H. Determining if a given graph G is the square of some graph is not easy in general. Motwani and Sudan [11] proved that it is NP-complete to determine if a given graph G is the square of some graph. The graph introduced in their ...

A graph H is a square root of a graph G if two vertices are adjacent in G if and only if they are at distance one or two in H . Computing a square root of a given graph is NP-hard, even when the input graph is restricted to be chordal. In this paper, we show that computing a square root can be done in linear time for a well-known subclass of chordal graphs, the class of trivially perfect graphs...

Methods. A population of horizontal visually guided saccades in a range of amplitudes from 1.5° to 30° was recorded by means of electro-oculography in eight normal adult subjects. The peak velocity-amplitude data of this population were fitted to four models: inverse linear, exponential, power law, and square root. To approximate the duration-amplitude relation, the square root was tested again...

Abstract. Precise efforts in theoretical astrophysics are needed to fully understand the mechanisms that govern the structure, stability, dynamics, formation, and evolution of differentially rotating stars. Direct computation of the physical attributes of a star can be facilitated by the use of highly compact azimuthal and separation angle Fourier formulations of the Green’s functions for the l...

We propose a novel approach to the problem of simultaneous localization and mapping (SLAM) based on incremental smoothing, that is suitable for real-time applications in large-scale environments. The main advantages over filter-based algorithms are that we solve the full SLAM problem without the need for any approximations, and that we do not suffer from linearization errors. We achieve efficie...

This paper describes a self-timed integrated circuit for division and square-root extraction. First it concentrates on the development and the proof of a new mathematical algorithm. Then the design methodology and the architecture of a self-timed circuit implementing a simplified version of the algorithm is presented. The algorithm relies on two functional blocks, each simple enough to be fully...

of the Dissertation Low Power Division and Square Root by Alberto Nannarelli Doctor of Philosophy in Engineering University of California, Irvine, 1999 Professor Tomás Lang, Chair The general objective of our work is to develop methods to reduce the energy consumption of arithmetic modules while maintaining the delay unchanged and keeping the increase in the area to a minimum. Here, we present ...

Abstract. Let L be an elliptic differential operator with bounded measurable coefficients, acting in Bochner spaces Lp(Rn;X) of X-valued functions on Rn. We characterize Kato’s square root estimates ‖ √ Lu‖p h ‖∇u‖p and the H-functional calculus of L in terms of R-boundedness properties of the resolvent of L, when X is a Banach function lattice with the UMD property, or a noncommutative Lp spac...