Search results for " algorithm"
showing 10 items of 2538 documents
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…
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.
Slowing down in the three-dimensional three-state Potts glass with nearest neighbor exchange : A Monte Carlo study
1998
,Static and dynamic properties of the Potts model on the simple cubic lattice with nearest neighbor ±Ĵ-interaction are obtained from Monte Carlo simulations in a temperature range where full thermal equilibrium still can be achieved (T/Ĵ ≥ 0.6). For a lattice size L = 16, in this range finite size effects are still negligible, but the data for the spin glass susceptibility agree with previous extrapolations based on finite size scaling of very small lattices. While the static properties are compatible with a zero temperature transition, they certainly do not prove it. Unlike the Ising spin glass, the decay of the time-dependent order parameter is compatible with a simple Kohlrausch function…
Direct Observation in 3d of Structural Crossover in Binary Hard Sphere Mixtures
2016
For binary fluid mixtures of spherical particles in which the two species are sufficiently different in size, the dominant wavelength of oscillations of the pair correlation functions is predicted to change from roughly the diameter of the large species to that of the small species along a sharp crossover line in the phase diagram [C. Grodon, M. Dijkstra, R. Evans & R. Roth, J.Chem.Phys. 121, 7869 (2004)]. Using particle-resolved colloid experiments in 3d we demonstrate that crossover exists and that its location in the phase diagram is in quantitative agreement with the results of both theory and our Monte-Carlo simulations. In contrast with previous work [J. Baumgartl, R. Dullens, M. …
New Development of Monte Carlo Techniques for Studying Bottle-brush Polymers
2011
Due to the complex characteristics of bottle-brush polymers, it became a challenge to develop an efficient algorithm for studying such macromolecules under various solvent conditions or some constraints in the space by using computer simulations. In the limit of a bottle-brush polymer with a rather stiff backbone (straight rigid backbone), we generalize the variant of the biased chain growth algorithm, the pruned-enriched Rosenbluth method, for simulating polymers with complex architecture, from star polymers to bottle-brush polymers, on the simple cubic lattice. With the high statistics of our Monte Carlo results, we check the theoretical predictions of side chain behavior and radial monom…
Simulation of matrix product states for dissipation and thermalization dynamics of open quantum systems
2020
Abstract We transform the system/reservoir coupling model into a one-dimensional semi-infinite discrete chain through unitary transformation to simulate the open quantum system numerically with the help of time evolving block decimation (TEBD) algorithm. We apply the method to study the dynamics of dissipative systems. We also generate the thermal state of a multimode bath using minimally entangled typical thermal state (METTS) algorithm, and investigate the impact of the thermal bath on an empty system. For both cases, we give an extensive analysis of the impact of the modeling and simulation parameters, and compare the numerics with the analytics.