223 research outputs found

    Numerical Study of Competing Spin-Glass and Ferromagnetic Order

    Full text link
    Two and three dimensional random Ising models with a Gaussian distribution of couplings with variance JJ and non-vanishing mean value J0J_0 are studied using the zero-temperature domain-wall renormalization group (DWRG). The DWRG trajectories in the (J0,JJ_0,J) plane after rescaling can be collapsed on two curves: one for J0/J>rcJ_0/J > r_c and other for J0/J<rcJ_0/J < r_c. In the first case the DWRG flows are toward the ferromagnetic fixed point both in two and three dimensions while in the second case flows are towards a paramagnetic fixed point and spin-glass fixed point in two and three dimensions respectively. No evidence for an extra phase is found.Comment: a bit more data is taken, 5 pages, 4 eps figures included, to appear in PR

    Modular Synthesis of Sketches Using Models

    Get PDF
    One problem with the constraint-based approaches to synthesis that have become popular over the last few years is that they only scale to relatively small routines, on the order of a few dozen lines of code. This paper presents a mechanism for modular reasoning that allows us to break larger synthesis problems into small manageable pieces. The approach builds on previous work in the verification community of using high-level specifications and partially interpreted functions (we call them models) in place of more complex pieces of code in order to make the analysis modular. The main contribution of this paper is to show how to combine these techniques with the counterexample guided synthesis approaches used to efficiently solve synthesis problems. Specifically, we show two new algorithms; one to efficiently synthesize functions that use models, and another one to synthesize functions while ensuring that the behavior of the resulting function will be in the set of behaviors allowed by the model. We have implemented our approach on top of the open-source Sketch synthesis system, and we demonstrate its effectiveness on several Sketch benchmark problems.National Science Foundation (U.S.) (Grant NSF-1116362)National Science Foundation (U.S.) (Grant NSF-1139056)United States. Dept. of Energy (Grant DE-SC0005372

    The molecular epidemiology of human immunodeficiency virus type 1 in six cities in Britain and Ireland

    Get PDF
    The authors sequenced the p17 coding regions of the gag gene from 211 patients infected either through injecting drug use (IDU) or by sexual intercourse between men from six cities in Scotland, N. England, N. Ireland, and the Republic of Ireland. All sequences were of subtype 5. Phylogenetic analysis revealed substantial heterogeneity in the sequences from homosexual men. In contrast, sequence from over 80% of IDUs formed a relatively tight cluster, distinct both from those of published isolates and of the gay men. There was no large-scale clustering of sequences by city in either risk group, although a number of close associations between pairs of individuals were observed. From the known date of the HIV-1 epidemic among IDUs in Edinburgh, the rate of sequence divergence at synonymous sites is estimated to be about 0.8%. On this basis it has been estimated that the date of divergence of the sequences among homosexual men to be about 1975, which may correspond to the origin of the B subtype epidemic

    Subsumer-First: Steering Symbolic Reachability Analysis

    Full text link
    Abstract. Symbolic reachability analysis provides a basis for the veri-fication of software systems by offering algorithmic support for the ex-ploration of the program state space when searching for proofs or coun-terexamples. The choice of exploration strategy employed by the anal-ysis has direct impact on its success, whereas the ability to find short counterexamples quickly and—as a complementary task—to efficiently perform the exhaustive state space traversal are of utmost importance for the majority of verification efforts. Existing exploration strategies can optimize only one of these objectives which leads to a sub-optimal reach-ability analysis, e.g., breadth-first search may sacrifice the exploration ef-ficiency and chaotic iteration can miss minimal counterexamples. In this paper we present subsumer-first, a new approach for steering symbolic reachability analysis that targets both minimal counterexample discovery and efficiency of exhaustive exploration. Our approach leverages the re-sult of fixpoint checks performed during symbolic reachability analysis to bias the exploration strategy towards its objectives, and does not require any additional computation. We demonstrate how the subsumer-first ap-proach can be applied to improve efficiency of software verification tools based on predicate abstraction. Our experimental evaluation indicates the practical usefulness of the approach: we observe significant efficiency improvements (median value 40%) on difficult verification benchmarks from the transportation domain.

    Electron-phonon interaction in C70

    Full text link
    The matrix elements of the deformation potential of C70_{70} are calculated by means of a simple, yet accurate solution of the electron-phonon coupling problem in fullerenes, based on a parametrization of the ground state electronic density of the system in terms of sp2+xsp^{2+x} hybridized orbitals. The value of the calculated dimensionless total electron-phonon coupling constant is λ≈0.1\lambda\approx0.1, an order of magnitude smaller than in C60_{60}, consistent with the lack of a superconducting phase transition in C70_{70}A3_3 fullerite, and in overall agreement with measurements of the broadening of Raman peaks in C70_{70}K4_4. We also calculate the photoemission cross section of C70−_{70}^-, which is found to display less structure than that associated with C60−_{60}^-, in overall agreement with the experimental findings.Comment: To be published in Phys. Rev.

    Theory of asymmetric non-additive binary hard-sphere mixtures

    Full text link
    We show that the formal procedure of integrating out the degrees of freedom of the small spheres in a binary hard-sphere mixture works equally well for non-additive as it does for additive mixtures. For highly asymmetric mixtures (small size ratios) the resulting effective Hamiltonian of the one-component fluid of big spheres, which consists of an infinite number of many-body interactions, should be accurately approximated by truncating after the term describing the effective pair interaction. Using a density functional treatment developed originally for additive hard-sphere mixtures we determine the zero, one, and two-body contribution to the effective Hamiltonian. We demonstrate that even small degrees of positive or negative non-additivity have significant effect on the shape of the depletion potential. The second virial coefficient B2B_2, corresponding to the effective pair interaction between two big spheres, is found to be a sensitive measure of the effects of non-additivity. The variation of B2B_2 with the density of the small spheres shows significantly different behavior for additive, slightly positive and slightly negative non-additive mixtures. We discuss the possible repercussions of these results for the phase behavior of binary hard-sphere mixtures and suggest that measurements of B2B_2 might provide a means of determining the degree of non-additivity in real colloidal mixtures

    Classical capacity of quantum channels with general Markovian correlated noise

    Get PDF
    The classical capacity of a quantum channel with arbitrary Markovian correlated noise is evaluated. For the general case of a channel with long-term memory, which corresponds to a Markov chain which does not converge to equilibrium, the capacity is expressed in terms of the communicating classes of the Markov chain. For an irreducible and aperiodic Markov chain, the channel is forgetful, and one retrieves the known expression for the capacity

    Metastable States in Spin Glasses and Disordered Ferromagnets

    Full text link
    We study analytically M-spin-flip stable states in disordered short-ranged Ising models (spin glasses and ferromagnets) in all dimensions and for all M. Our approach is primarily dynamical and is based on the convergence of a zero-temperature dynamical process with flips of lattice animals up to size M and starting from a deep quench, to a metastable limit. The results (rigorous and nonrigorous, in infinite and finite volumes) concern many aspects of metastable states: their numbers, basins of attraction, energy densities, overlaps, remanent magnetizations and relations to thermodynamic states. For example, we show that their overlap distribution is a delta-function at zero. We also define a dynamics for M=infinity, which provides a potential tool for investigating ground state structure.Comment: 34 pages (LaTeX); to appear in Physical Review

    Variable Reuse for Efficient Image Computation

    Get PDF
    Image computation, that is, computing the set of states reachable from a given set in one step, is a crucial component in typical tools for BDD-based symbolic reachability analysis. It has been shown that the size of the intermediate BDDs during image computation can be dramatically reduced via conjunctive partitioning of the transition relation and ordering the conjuncts for facilitating early quantification. In this paper, we propose to enhance the effectiveness of these techniques by reusing the quantified variables. Given an ordered set of conjuncts, if the last conjunct that uses a variable u appears before the first conjunct that uses another variable v, then v can be renamed to u, assuming u will be quantified immediately after its last use. In general, multiple variables can share the same identifier so the BDD nodes that are inactive but not garbage collected may be activated. We give a polynomial-time algorithm for generating the optimum number of variables that are required for image computation and show how to modify the image computation accounting for variable reuse. The savings for image computation are demonstrated on ISCAS\u2789 and Texas\u2797 benchmark models
    • 

    corecore