Loschmidt Echo and Berry phase of the quantum system coupled to the XY spin chain: Proximity to quantum phase transition

We study the Loschmidt echo (LE) of a coupled system consisting of a central spin and its surrounding environment described by a general XY spin-chain model. The quantum dynamics of the LE is shown to be remarkably influenced by the quantum criticality of the spin chain. In particular, the decaying behavior of the LE is found to be controlled by the anisotropy parameter of the spin chain. Furthermore, we show that due to the coupling to the spin chain, the ground-state Berry phase for the central spin becomes nonanalytical and its derivative with respect to the magnetic parameter $\lambda$ in spin chain diverges along the critical line $\lambda=1$, which suggests an alternative measurement of the quantum criticality of the spin chain.Comment: 15 pages, 5 figure

Compacting points-to sets through object clustering

Inclusion-based set constraint solving is the most popular technique for whole-program points-to analysis whereby an analysis is typically formulated as repeatedly resolving constraints between points-to sets of program variables. The set union operation is central to this process. The number of points-to sets can grow as analyses become more precise and input programs become larger, resulting in more time spent performing unions and more space used storing these points-to sets. Most existing approaches focus on improving scalability of precise points-to analyses from an algorithmic perspective and there has been less research into improving the data structures behind the analyses. Bit-vectors as one of the more popular data structures have been used in several mainstream analysis frameworks to represent points-to sets. To store memory objects in bit-vectors, objects need to mapped to integral identifiers. We observe that this object-to-identifier mapping is critical for a compact points-to set representation and the set union operation. If objects in the same points-to sets (co-pointees) are not given numerically close identifiers, points-to resolution can cost significantly more space and time. Without data on the unpredictable points-to relations which would be discovered by the analysis, an ideal mapping is extremely challenging. In this paper, we present a new approach to inclusion-based analysis by compacting points-to sets through object clustering. Inspired by recent staged analysis where an auxiliary analysis produces results approximating a more precise main analysis, we formulate points-to set compaction as an optimisation problem solved by integer programming using constraints generated from the auxiliary analysis's results in order to produce an effective mapping. We then develop a more approximate mapping, yet much more efficiently, using hierarchical clustering to compact bit-vectors. We also develop an improved representation of bit-vectors (called core bit-vectors) to fully take advantage of the newly produced mapping. Our approach requires no algorithmic change to the points-to analysis. We evaluate our object clustering on flow sensitive points-to analysis using 8 open-source programs (>3.1 million lines of LLVM instructions) and our results show that our approach can successfully improve the analysis with an up to 1.83× speed up and an up to 4.05× reduction in memory usage

Flow-sensitive type-based heap cloning

By respecting program control-flow, flow-sensitive pointer analysis promises more precise results than its flow-insensitive counterpart. However, existing heap abstractions for C and C++ flow-sensitive pointer analyses model the heap by creating a single abstract heap object for each memory allocation. Two runtime heap objects which originate from the same allocation site are imprecisely modelled using one abstract object, which makes them share the same imprecise points-to sets and thus reduces the benefit of analysing heap objects flow-sensitively. On the other hand, equipping flow-sensitive analysis with context-sensitivity, whereby an abstract heap object would be created (cloned) per calling context, can yield a more precise heap model, but at the cost of uncontrollable analysis overhead when analysing larger programs. This paper presents TypeClone, a new type-based heap model for flow-sensitive analysis. Our key insight is to differentiate concrete heap objects lazily using type information at use sites within the program control-flow (e.g., when accessed via pointer dereferencing) for programs which conform to the strict aliasing rules set out by the C and C++ standards. The novelty of TypeClone lies in its lazy heap cloning: an untyped abstract heap object created at an allocation site is killed and replaced with a new object (i.e. a clone), uniquely identified by the type information at its use site, for flow-sensitive points-to propagation. Thus, heap cloning can be performed within a flow-sensitive analysis without the need for context-sensitivity. Moreover, TypeClone supports new kinds of strong updates for flow-sensitive analysis where heap objects are filtered out from imprecise points-to relations at object use sites according to the strict aliasing rules. Our method is neither strictly superior nor inferior to context-sensitive heap cloning, but rather, represents a new dimension that achieves a sweet spot between precision and efficiency. We evaluate our analysis by comparing TypeClone with state-of-the-art sparse flow-sensitive points-to analysis using the 12 largest programs in GNU Coreutils. Our experimental results also confirm that TypeClone is more precise than flow-sensitive pointer analysis and is able to, on average, answer over 15% more alias queries with a no-alias result

Object Versioning for Flow-Sensitive Pointer Analysis

Flow-sensitive points-to analysis provides better precision than its flow-insensitive counterpart. Traditionally performed on the control-flow graph, it incurs heavy analysis overhead. For performance, staged flow-sensitive analysis (SFS) is conducted on a pre-computed def-use (value-flow) graph where points-to sets of variables are propagated across def-use chains sparsely rather than across control-flow in the control-flow graph. SFS makes the propagation of different objects' points-to sets sparse (multiple-object sparsity), however, it suffers from redundant propagation between instructions of the same object's points-to sets (single-object sparsity). The points-to set of an object is often duplicated, resulting in redundant propagation and storage, especially in real-world heap-intensive programs. We notice that a simple graph prelabelling extension can identify much of this redundancy in a pre-analysis. With this pre-analysis, multiple nodes (instructions) in the value-flow graph can share an individual memory object's points-to set rather than each node maintaining its own points-to set for that single object. We present object versioning for flow-sensitive points-to analysis, a finer single-object sparsity technique which maintains the same precision while allowing us to avoid much of the redundancy present in propagating and storing points-to sets. Our experiments conducted on 15 open-source programs, when compared with SFS, show that our approach runs up to 26.22× faster (5.31× on average), and reduces memory usage by up to 5.46× (2.11 × on average)

Learning with simulations: Influence of a computer simulation with hand- on activities on students' learning of the physics capacitors' concepts

The persistence of this study was to investigate the contribution of a computer simulation to students' learning of physics concepts (charging and discharging of capacitors). Interactive computer simulation (Crocodile simulation) was used to spread over the aim of this study. This attempt assesses the progress in understanding the concepts by grade 11 Scientific section after four complete periods (200 minutes) in two different situations: 1- using only a computer simulation; 2-using computer simulation with hands-on activities. The progress was measured through post-test. The results of both descriptive and inferential statistics show that the learners' understanding of capacitors' concepts that can be enhanced and were highly achieved when learners used the computer simulation combined with hands- on activities. The use of Hands-on activities was identified as the cause of this differentiation

Phase diagram of the S=1/2 quantum spin chain with bond alternation

We study the ground state properties of the bond alternating $S=1/2$ quantum spin chain whose Hamiltonian is H=\sum_j (S_{2j}^x S_{2j+1}^x +S_{2j}^y S_{2j+1}^y +\lambda S_{2j}^z S_{2j+1}^z ) +\beta \sum_j {\bf S}_{2j-1} \cdot {\bf S}_{2j} . When $\beta=0$, the ground state is a collection of local singlets with a finite excitation gap. In the limit of strong ferromagnetic coupling $\beta \to - \infty$, this is equivalent to the $S=1 \ XXZ$ Hamiltonian. It has several ground state phases in the $\lambda$-$\beta$ plane including the gapful Haldane phase. They are characterized by a full breakdown, partial breakdowns and a non-breakdown of the hidden discrete $Z_2 \times Z_2$ symmetry. The ground state phase diagram is obtained by series expansions.Comment: 25 pages, RevTex 2.0, 9 Figures available on request, Tec.rep. of ISSP No.A265

Population structure of the predatory mite Neoseiulus womersleyi in a tea field based on an analysis of microsatellite DNA markers

The predatory mite Neoseiulus womersleyi (Schicha) (Acari: Phytoseiidae) is an important natural enemy of the Kanzawa spider mite, Tetranychus kanzawaki Kishida (Acari: Tetranychidae), in tea fields. Attraction and preservation of natural enemies by habitat management to reduce the need for acaricide sprays is thought to enhance the activity of N. womersleyi. To better conserve N. womersleyi in the field, however, it is essential to elucidate the population genetic structure of this species. To this end, we developed ten microsatellite DNA markers for N. womersleyi. We then evaluated population structure of N. womersleyi collected from a tea field, where Mexican sunflower, Tithonia rotundifolia (Mill.), was planted to preserve N. womersleyi. Seventy-seven adult females were collected from four sites within 200 m. The fixation indexes FST among subpopulations were not significantly different. The kinship coefficients between individuals did not differ significantly within a site as a function of the sampling dates, but the coefficients gradually decreased with increasing distance. Bayesian clustering analysis revealed that the population consisted of three genetic clusters, and that subpopulations within 100 m, including those collected on T. rotundifolia, were genetically similar to each other. Given the previously observed population dynamics of N. womersleyi, it appears that the area inhabited by a given cluster of the mite did not exceed 100 m. The estimation of population structure using microsatellite markers will provide valuable information in conservation biological control