Search results for "Algorithm"
showing 10 items of 4887 documents
A Cluster Monte Carlo Algorithm for 2-Dimensional Spin Glasses
2001
A new Monte Carlo algorithm for 2-dimensional spin glasses is presented. The use of clusters makes possible global updates and leads to a gain in speed of several orders of magnitude. As an example, we study the 2-dimensional +/-J Edwards-Anderson model. The new algorithm allows us to equilibrate systems of size 100^2 down to temperature T = 0.1. Our main result is that the correlation length diverges as an exponential and not as a power law as T -> Tc = 0.
Multicanonical Simulations of the Tails of the Order-Parameter Distribution of the Two-Dimensional Ising Model
2005
We report multicanonical Monte Carlo simulations of the tails of the order-parameter distribution of the two-dimensional Ising model for fixed boundary conditions. Clear numerical evidence for "fat" stretched exponential tails is found below the critical temperature, indicating the possible presence of fat tails at the critical temperature.
Computing absolute free energies of disordered structures by molecular simulation
2009
We present a Monte Carlo simulation technique by which the free energy of disordered systems can be computed directly. It is based on thermodynamic integration. The central idea is to construct an analytically solvable reference system from a configuration which is representative for the state of interest. The method can be applied to lattice models (e.g., the Ising model) as well as off-lattice molecular models. We focus mainly on the more challenging off-lattice case. We propose a Monte Carlo algorithm, by which the thermodynamic integration path can be sampled efficiently. At the examples of the hard sphere liquid and a hard disk solid with a defect, we discuss several properties of the …
Theory of Computation, Fuzziness and a physics of the immaterial
2013
In this paper we advance three clear-cut proposals as a contribution to the discussion on the role of notions of Computation and Fuzziness as a bridge between Hard and Soft Sciences. We suggest that an important difference between the two great fami- lies of science lies in their subject or research having a grounding in nature or not, and that Theory of Computation is a glaring exception to this classifi- cation, being a textbook hard science but dealing with the immaterial. We further advance that such unicity is strongly connected with Church-Turing thesis, and discuss about the role of Computation and Fuzziness as pillars of immaterial sciences
A global descriptor of spatial pattern interaction in the galaxy distribution
1997
We present the function J as a morphological descriptor for point patterns formed by the distribution of galaxies in the Universe. This function was recently introduced in the field of spatial statistics, and is based on the nearest neighbor distribution and the void probability function. The J descriptor allows to distinguish clustered (i.e. correlated) from ``regular'' (i.e. anti-correlated) point distributions. We outline the theoretical foundations of the method, perform tests with a Matern cluster process as an idealised model of galaxy clustering, and apply the descriptor to galaxies and loose groups in the Perseus-Pisces Survey. A comparison with mock-samples extracted from a mixed d…
Improved measurement of the CKM angleγinB∓→D(*)K(*)∓decays with a Dalitz plot analysis ofDdecays toKS0π+π−andKS0K+K−
2008
We report on an improved measurement of the Cabibbo-Kobayashi-Maskawa CP-violating phase {gamma} through a Dalitz plot analysis of neutral D meson decays to K{sub s}{sup 0}{pi}{sup +}{pi}{sup -} and K{sub s}{sup 0}K{sup +}K{sup -} produced in the processes B{sup {-+}} {yields} DK{sup {-+}}, B{sup {-+}} {yields} D* K{sup {-+}} with D* {yields} D{pi}{sup 0}, D{gamma}, and B{sup {-+}} {yields} DK*{sup {-+}} with K8{sup {-+}} {yields} K{sub S}{sup 0}{pi}{sup {-+}}. Using a sample of 383 million B{bar B} pairs collected by the BABAR detector, we measure {gamma} = (76 {+-} 22 {+-} 5{+-} 5){sup o} (mod 180{sup o}), where the first error is statistical, the second is the experimental systematic unc…
Orbit determination and errors of a star catalogue
1995
Abstract We obtain Ceres orbit taking into account all perturbations and applying correction of phase effect to observations. More than 3000 observations have been used and the results agree with other determinations. We have also investigated the influence of systematic errors of a star catalogue on the observations and its effect on final elements. To that aim, a simulation procedure has been applied to Ceres observations, including different laws for errors of star catalogue versus spherical coordinates. The best relations have been applied to real observations of Ceres, in order to obtain elements and star catalogue corrections. Preliminary results of these calculations are presented.
Clustering statistics in cosmology
2002
The main tools in cosmology for comparing theoretical models with the observations of the galaxy distribution are statistical. We will review the applications of spatial statistics to the description of the large-scale structure of the universe. Special topics discussed in this talk will be: description of the galaxy samples, selection effects and biases, correlation functions, Fourier analysis, nearest neighbor statistics, Minkowski functionals and structure statistics. Special attention will be devoted to scaling laws and the use of the lacunarity measures in the description of the cosmic texture.
Quantum Computing: A Way to Break Complexity?
2003
The perception of time is given by the happening of some events that determines a variation in the state of the observed system. In this sense a computation, i.e. a set of well defined transformations that, starting from an initial state (the input) brings to a final state (the output), can be considered a time generator. Each ticking of the clock corresponds to the computer changes of its states. The speed of computation leads to a different perception of time as well as traveling by airplanes changed the perception of spatial distances.
N-string vertices in string field theory.
1993
We give the general form of the vertex corresponding to the interaction of an arbitrary number of strings. The technique employed relies on the ``comma" representation of String Field Theory where string fields and interactions are represented as matrices and operations between them such as multiplication and trace. The general formulation presented here shows that the interaction vertex of N strings, for any arbitrary N, is given as a function of particular combinations of matrices corresponding to the change of representation between the full string and the half string degrees of freedom.