The virial expansion of a classical interacting system

We consider N particles interacting pairwise by an inverse square potential in one dimension (Calogero-Sutherland-Moser model). For a system placed in a harmonic trap, its classical partition function for the repulsive regime is recognised in the literature. We start by presenting a concise re-derivation of this result. The equation of state is then calculated both for the trapped and the homogeneous gas. Finally, the classical limit of Wu's distribution function for fractional exclusion statistics is obtained and we re-derive the classical virial expansion of the homogeneous gas using this distribution function.

Boson-fermion duality in SU(m vertical bar n) supersymmetric Haldane-Shastry spin chain

By using the Y(gl(m|n)) super Yangian symmetry of the SU(m|n) supersymmetric Haldane-Shastry spin chain, we show that the partition function of this model satisfies a duality relation under the exchange of bosonic and fermionic spin degrees of freedom. As a byproduct of this study of the duality relation, we find a novel combinatorial formula for the super Schur polynomials associated with some irreducible representations of the Y(gl(m|n)) Yangian algebra. Finally, we reveal an intimate connection between the global SU(m|n) symmetry of a spin chain and the boson-fermion duality relation. (C) 2007 Elsevier B.V. All rights reserved.

Low energy properties of the SU(m|n) supersymmetric Haldane–Shastry spin chain

The ground state and low energy excitations of the SU(m|n) supersymmetric Haldane–Shastry spin chain are analyzed. In the thermodynamic limit, it is found that the ground state degeneracy is finite only for the SU(m|0) and SU(m|1) spin chains, while the dispersion relation for the low energy and low momentum excitations is linear for all values of m and n. We show that the low energy excitations of the SU(m|1) spin chain are described by a conformal field theory of m non-interacting Dirac fermions which have only positive energies; the central charge of this theory is m/2. Finally, for ngreater-or-equal, slanted1, the partition functions of the SU(m|n) Haldane–Shastry spin chain and the SU(m|n) Polychronakos spin chain are shown to be related in a simple way in the thermodynamic limit at low temperatures.

On a Special Co-cycle Basis of Graphs

In this paper we consider the problems of computing a minimum co-cycle basis and a minimum weakly fundamental co-cycle basis of a directed graph G. A co-cycle in G corresponds to a vertex partition (S,V ∖ S) and a { − 1,0,1} edge incidence vector is associated with each co-cycle. The vector space over ℚ generated by these vectors is the co-cycle space of G. Alternately, the co-cycle space is the orthogonal complement of the cycle space of G. The minimum co-cycle basis problem asks for a set of co-cycles that span the co-cycle space of G and whose sum of weights is minimum. Weakly fundamental co-cycle bases are a special class of co-cycle bases, these form a natural superclass of strictly fundamental co-cycle bases and it is known that computing a minimum weight strictly fundamental co-cycle basis is NP-hard. We show that the co-cycle basis corresponding to the cuts of a Gomory-Hu tree of the underlying undirected graph of G is a minimum co-cycle basis of G and it is also weakly fundamental.

Assessment of crop insect damage using unmanned aerial systems: A machine learning approach

Agricultural pests are responsible for millions of dollars in crop losses and management costs every year. In order to implement optimal site-specific treatments and reduce control costs, new methods to accurately monitor and assess pest damage need to be investigated. In this paper we explore the combination of unmanned aerial vehicles (UAV), remote sensing and machine learning techniques as a promising technology to address this challenge. The deployment of UAVs as a sensor platform is a rapidly growing field of study for biosecurity and precision agriculture applications. In this experiment, a data collection campaign is performed over a sorghum crop severely damaged by white grubs (Coleoptera: Scarabaeidae). The larvae of these scarab beetles feed on the roots of plants, which in turn impairs root exploration of the soil profile. In the field, crop health status could be classified according to three levels: bare soil where plants were decimated, transition zones of reduced plant density and healthy canopy areas. In this study, we describe the UAV platform deployed to collect high-resolution RGB imagery as well as the image processing pipeline implemented to create an orthoimage. An unsupervised machine learning approach is formulated in order to create a meaningful partition of the image into each of the crop levels. The aim of the approach is to simplify the image analysis step by minimizing user input requirements and avoiding the manual data labeling necessary in supervised learning approaches. The implemented algorithm is based on the K-means clustering algorithm. In order to control high-frequency components present in the feature space, a neighbourhood-oriented parameter is introduced by applying Gaussian convolution kernels prior to K-means. The outcome of this approach is a soft K-means algorithm similar to the EM algorithm for Gaussian mixture models. The results show the algorithm delivers decision boundaries that consistently classify the field into three clusters, one for each crop health level. The methodology presented in this paper represents a venue for further research towards automated crop damage assessments and biosecurity surveillance.

Automatic Road Extraction using High Resolution Satellite Image Based on Texture Progressive Analysis and Normalized Cut Method

In this paper the approach for automatic road extraction for an urban region using structural, spectral and geometric characteristics of roads has been presented. Roads have been extracted based on two levels: Pre-processing and road extraction methods. Initially, the image is pre-processed to improve the tolerance by reducing the clutter (that mostly represents the buildings, parking lots, vegetation regions and other open spaces). The road segments are then extracted using Texture Progressive Analysis (TPA) and Normalized cut algorithm. The TPA technique uses binary segmentation based on three levels of texture statistical evaluation to extract road segments where as, Normalizedcut method for road extraction is a graph based method that generates optimal partition of road segments. The performance evaluation (quality measures) for road extraction using TPA and normalized cut method is compared. Thus the experimental result show that normalized cut method is efficient in extracting road segments in urban region from high resolution satellite image.

Doing marriage and parenthood: The division of household labour across two life course events

The current study is a longitudinal investigation into changes in the division of household labour across transitions to marriage and parenthood in the UK. Previous research has noted a more traditional division of household labour, with women performing the majority of housework, amongst spouses and couples with children. However, the bulk of this work has been cross-sectional in nature. The few longitudinal studies that have been carried out have been rather ambiguous about the effect of marriage and parenthood on the division of housework. Theoretically, this study draws on gender construction theory. The key premise of this theory is that gender is something that is performed and created in interaction, and, as a result, something fluid and flexible rather than fixed and stable. The idea that couples ‘do gender’ through housework has been a major theoretical breakthrough. Gender-neutral explanations of the division of household labour, positing rational acting individuals, have failed to explicate why women continue to perform an unequal share of housework, regardless of socio-economic status. Contrastingly, gender construction theory situates gender as the key process in dividing household labour. By performing and avoiding certain housework chores, couples fulfill social norms of what it means to be a man and a woman although, given the emphasis on human agency in producing and contesting gender, couples are able to negotiate alternative gender roles which, in turn, feed back into the structure of social norms in an ever-changing societal landscape. This study adds extra depth to the doing gender approach by testing whether or not couples negotiate specific conjugal and parent roles in terms of the division of household labour. Both transitions hypothesise a more traditional division of household labour. Data comes from the British Household Panel Survey, a large, nationally representative quantitative survey that has been carried out annually since 1991. Here, data tracks the same 776 couples at two separate time points – 1996 and 2005. OLS regression is used to test whether or not transitions to marriage and parenthood have a significant impact on the division of household labour whilst controlling for host of relevant socio-economic factors. Results indicate that marriage has no significant effect on how couples partition housework. Those couples making the transition from cohabitation to marriage do not show significant changes in housework arrangements from those couples who remain cohabiting in both waves. On the other hand, becoming parents does lead to a more traditional division of household labour whilst controlling for socio-economic factors which accompany the move to parenthood. There is then some evidence that couples use the site of household labour to ‘do parenthood’ and generate identities which both use and inform socially prescribed notions of what it means to be a mother and a father. Support for socio-economic explanations of the division of household labour was mixed although it remains clear that they, alone, cannot explain how households divide housework.

Two-Phase Thermodynamic Model for Efficient and Accurate Absolute Entropy of Water from Molecular Dynamics Simulations

Presented here is the two-phase thermodynamic (2PT) model for the calculation of energy and entropy of molecular fluids from the trajectory of molecular dynamics (MD) simulations. In this method, the density of state (DoS) functions (including the normal modes of translation, rotation, and intramolecular vibration motions) are determined from the Fourier transform of the corresponding velocity autocorrelation functions. A fluidicity parameter (f), extracted from the thermodynamic state of the system derived from the same MD, is used to partition the translation and rotation modes into a diffusive, gas-like component (with 3Nf degrees of freedom) and a nondiffusive, solid-like component. The thermodynamic properties, including the absolute value of entropy, are then obtained by applying quantum statistics to the solid component and applying hard sphere/rigid rotor thermodynamics to the gas component. The 2PT method produces exact thermodynamic properties of the system in two limiting states: the nondiffusive solid state (where the fluidicity is zero) and the ideal gas state (where the fluidicity becomes unity). We examine the 2PT entropy for various water models (F3C, SPC, SPC/E, TIP3P, and TIP4P-Ew) at ambient conditions and find good agreement with literature results obtained based on other simulation techniques. We also validate the entropy of water in the liquid and vapor phases along the vapor-liquid equilibrium curve from the triple point to the critical point. We show that this method produces converged liquid phase entropy in tens of picoseconds, making it an efficient means for extracting thermodynamic properties from MD simulations.

The heat kernel on AdS(3) and its applications

We derive the heat kernel for arbitrary tensor fields on S-3 and (Euclidean) AdS(3) using a group theoretic approach. We use these results to also obtain the heat kernel on certain quotients of these spaces. In particular, we give a simple, explicit expression for the one loop determinant for a field of arbitrary spin s in thermal AdS(3). We apply this to the calculation of the one loop partition function of N = 1 supergravity on AdS(3). We find that the answer factorizes into left- and right-moving super Virasoro characters built on the SL(2, C) invariant vacuum, as argued by Maloney and Witten on general grounds.

Molecular Caches: A caching structure for dynamic creation of application-specific Heterogeneous cache regions

CMPs enable simultaneous execution of multiple applications on the same platforms that share cache resources. Diversity in the cache access patterns of these simultaneously executing applications can potentially trigger inter-application interference, leading to cache pollution. Whereas a large cache can ameliorate this problem, the issues of larger power consumption with increasing cache size, amplified at sub-100nm technologies, makes this solution prohibitive. In this paper in order to address the issues relating to power-aware performance of caches, we propose a caching structure that addresses the following: 1. Definition of application-specific cache partitions as an aggregation of caching units (molecules). The parameters of each molecule namely size, associativity and line size are chosen so that the power consumed by it and access time are optimal for the given technology. 2. Application-Specific resizing of cache partitions with variable and adaptive associativity per cache line, way size and variable line size. 3. A replacement policy that is transparent to the partition in terms of size, heterogeneity in associativity and line size. Through simulation studies we establish the superiority of molecular cache (caches built as aggregations of molecules) that offers a 29% power advantage over that of an equivalently performing traditional cache.

Parallel circuit partitioning on a reduced array architecture

The physical design of a VLSI circuit involves circuit partitioning as a subtask. Typically, it is necessary to partition a large electrical circuit into several smaller circuits such that the total cross-wiring is minimized. This problem is a variant of the more general graph partitioning problem, and it is known that there does not exist a polynomial time algorithm to obtain an optimal partition. The heuristic procedure proposed by Kernighan and Lin1,2 requires O(n2 log2n) time to obtain a near-optimal two-way partition of a circuit with n modules. In the VLSI context, due to the large problem size involved, this computational requirement is unacceptably high. This paper is concerned with the hardware acceleration of the Kernighan-Lin procedure on an SIMD architecture. The proposed parallel partitioning algorithm requires O(n) processors, and has a time complexity of O(n log2n). In the proposed scheme, the reduced array architecture is employed with due considerations towards cost effectiveness and VLSI realizability of the architecture.The authors are not aware of any earlier attempts to parallelize a circuit partitioning algorithm in general or the Kernighan-Lin algorithm in particular. The use of the reduced array architecture is novel and opens up the possibilities of using this computing structure for several other applications in electronic design automation.

Integrating strong and weak discontinuities without integration subcells and example applications in an XFEM/GFEM framework

Partition of unity methods, such as the extended finite element method, allows discontinuities to be simulated independently of the mesh (Int. J. Numer. Meth. Engng. 1999; 45:601-620). This eliminates the need for the mesh to be aligned with the discontinuity or cumbersome re-meshing, as the discontinuity evolves. However, to compute the stiffness matrix of the elements intersected by the discontinuity, a subdivision of the elements into quadrature subcells aligned with the discontinuity is commonly adopted. In this paper, we use a simple integration technique, proposed for polygonal domains (Int. J. Nuttier Meth. Engng 2009; 80(1):103-134. DOI: 10.1002/nme.2589) to suppress the need for element subdivision. Numerical results presented for a few benchmark problems in the context of linear elastic fracture mechanics and a multi-material problem show that the proposed method yields accurate results. Owing to its simplicity, the proposed integration technique can be easily integrated in any existing code. Copyright (C) 2010 John Wiley & Sons, Ltd.

Neural network based approach to standard cell placement

We propose a novel algorithm for placement of standard cells in VLSI circuits based on an analogy of this problem with neural networks. By employing some of the organising principles of these nets, we have attempted to improve the behaviour of the bipartitioning method as proposed by Kernighan and Lin. Our algorithm yields better quality placements compared with the above method, and also makes the final placement independent of the initial partition.

Doing marriage and parenthood: The division of household labour across two life course events

The current study is a longitudinal investigation into changes in the division of household labour across transitions to marriage and parenthood in the UK. Previous research has noted a more traditional division of household labour, with women performing the majority of housework, amongst spouses and couples with children. However, the bulk of this work has been cross-sectional in nature. The few longitudinal studies that have been carried out have been rather ambiguous about the effect of marriage and parenthood on the division of housework. Theoretically, this study draws on gender construction theory. The key premise of this theory is that gender is something that is performed and created in interaction, and, as a result, something fluid and flexible rather than fixed and stable. The idea that couples 'do gender' through housework has been a major theoretical breakthrough. Gender-neutral explanations of the division of household labour, positing rational acting individuals, have failed to explicate why women continue to perform an unequal share of housework, regardless of socioeconomic status. Contrastingly, gender construction theory situates gender as the key process in dividing household labour. By performing and avoiding certain housework chores, couples fulfill social norms of what it means to be a man and a woman although, given the emphasis on human agency in producing and contesting gender, couples are able to negotiate alternative gender roles which, in turn, feed back into the structure of social norms in an ever-changing societal landscape. This study adds extra depth to the doing gender approach by testing whether or not couples negotiate specific conjugal and parent roles in terms of the division of household labour. Both transitions hypothesise a more traditional division of household labour. Data comes from the British Household Panel Survey, a large, nationally representative quantitative survey that has been carried out annually since 1991. Here, data tracks the same 776 couples at two separate time points - 1996 and 2005. OLS regression is used to test whether or not transitions to marriage and parenthood have a significant impact on the division of household labour whilst controlling for host of relevant socio-economic factors. Results indicate that marriage has no significant effect on how couples partition housework. Those couples making the transition from cohabitation to marriage do not show significant changes in housework arrangements from those couples who remain cohabiting in both waves. On the other hand, becoming parents does lead to a more traditional division of household labour whilst controlling for socio-economic factors which accompany the move to parenthood. There is then some evidence that couples use the site of household labour to 'do parenthood' and generate identities which both use and inform socially prescribed notions of what it means to be a mother and a father. Support for socio-economic explanations of the division of household labour was mixed although it remains clear that they, alone, cannot explain how households divide housework.

Circuit layout through an analogy with neural networks

Standard-cell design methodology is an important technique in semicustom-VLSI design. It lends itself to the easy automation of the crucial layout part, and many algorithms have been proposed in recent literature for the efficient placement of standard cells. While many studies have identified the Kerninghan-Lin bipartitioning method as being superior to most others, it must be admitted that the behaviour of the method is erratic, and that it is strongly dependent on the initial partition. This paper proposes a novel algorithm for overcoming some of the deficiencies of the Kernighan-Lin method. The approach is based on an analogy of the placement problem with neural networks, and, by the use of some of the organizing principles of these nets, an attempt is made to improve the behavior of the bipartitioning scheme. The results have been encouraging, and the approach seems to be promising for other NP-complete problems in circuit layout.