Spiral model, jamming percolation and glass-jamming transitions

The Spiral Model (SM) corresponds to a new class of kinetically constrained models introduced in joint works with D.S. Fisher [8,9]. They provide the first example of finite dimensional models with an ideal glass-jamming transition. This is due to an underlying jamming percolation transition which has unconventional features: it is discontinuous (i.e. the percolating cluster is compact at the transition) and the typical size of the clusters diverges faster than any power law, leading to a Vogel-Fulcher-like divergence of the relaxation time. Here we present a detailed physical analysis of SM, see [5] for rigorous proofs. We also show that our arguments for SM does not need any modification contrary to recent claims of Jeng and Schwarz [10].Comment: 9 pages, 7 figures, proceedings for StatPhys2

Spatial Structure of Stationary Nonequilibrium States in the Thermostatted Periodic Lorentz Gas

We investigate analytically and numerically the spatial structure of the non-equilibrium stationary states (NESS) of a point particle moving in a two dimensional periodic Lorentz gas (Sinai Billiard). The particle is subject to a constant external electric field E as well as a Gaussian thermostat which keeps the speed |v| constant. We show that despite the singular nature of the SRB measure its projections on the space coordinates are absolutely continuous. We further show that these projections satisfy linear response laws for small E. Some of them are computed numerically. We compare these results with those obtained from simple models in which the collisions with the obstacles are replaced by random collisions.Similarities and differences are noted.Comment: 24 pages with 9 figure

Assessing direct contributions of morphological awareness and prosodic sensitivity to children’s word reading and reading comprehension

We examined the independent contributions of prosodic sensitivity and morphological awareness to word reading, text reading accuracy, and reading comprehension. We did so in a longitudinal study of English-speaking children (N = 70). At 5 to 7 years of age, children completed the metalinguistic measures along with control measures of phonological awareness and vocabulary. Children completed the reading measures two years later. Morphological awareness, but not prosodic sensitivity made a significant independent contribution to word reading, text reading accuracy and reading comprehension. The effects of morphological awareness on reading comprehension remained after controls for word reading. These results suggest that morphological awareness needs to be considered seriously in models of reading development and that prosodic sensitivity might have primarily indirect relations to reading outcomes. Keywords: Morphological Awareness; Prosody; Word Reading; Reading Comprehension

Matroid and Knapsack Center Problems

In the classic $k$-center problem, we are given a metric graph, and the objective is to open $k$ nodes as centers such that the maximum distance from any vertex to its closest center is minimized. In this paper, we consider two important generalizations of $k$-center, the matroid center problem and the knapsack center problem. Both problems are motivated by recent content distribution network applications. Our contributions can be summarized as follows: 1. We consider the matroid center problem in which the centers are required to form an independent set of a given matroid. We show this problem is NP-hard even on a line. We present a 3-approximation algorithm for the problem on general metrics. We also consider the outlier version of the problem where a given number of vertices can be excluded as the outliers from the solution. We present a 7-approximation for the outlier version. 2. We consider the (multi-)knapsack center problem in which the centers are required to satisfy one (or more) knapsack constraint(s). It is known that the knapsack center problem with a single knapsack constraint admits a 3-approximation. However, when there are at least two knapsack constraints, we show this problem is not approximable at all. To complement the hardness result, we present a polynomial time algorithm that gives a 3-approximate solution such that one knapsack constraint is satisfied and the others may be violated by at most a factor of $1+\epsilon$. We also obtain a 3-approximation for the outlier version that may violate the knapsack constraint by $1+\epsilon$.Comment: A preliminary version of this paper is accepted to IPCO 201

Evidence: Biofilter performance and operation as related to commercial composting

This report provides a critical review of available evidence as to how effectively the various categories and configurations of biofilter reduce bioaerosol and odour emissions from composting facilities

Multi-Informant Predictors of Social Inclusion for Students with Autism Spectrum Disorders Attending Mainstream School

This study examined differential profiles of behavioural characteristics predictive of successful inclusion in mainstream education for children with autism spectrum disorders (ASD) and comparison students. Multiple regression analyses using behavioural ratings from parents, teachers and peers found some evidence for differential profiles predicting peer acceptance and rejection. High levels of peer-rated shyness significantly predicted social rejection in comparison students only. Parent-rated prosocial behaviour also differentially predicted social acceptance; high-levels of prosocial behaviour predicted acceptance in comparison students, but low-levels were predictive for students with ASD. These findings suggest that schools may seek to augment traditional social skills programmes with awareness raising about ASD among mainstream pupils to utilise peers’ apparent willingness to discount characteristics such as ‘shyness’

Approximation algorithms for maximally balanced connected graph partition

Given a simple connected graph $G = (V, E)$, we seek to partition the vertex set $V$ into $k$ non-empty parts such that the subgraph induced by each part is connected, and the partition is maximally balanced in the way that the maximum cardinality of these $k$ parts is minimized. We refer this problem to as {\em min-max balanced connected graph partition} into $k$ parts and denote it as {\sc $k$-BGP}. The general vertex-weighted version of this problem on trees has been studied since about four decades ago, which admits a linear time exact algorithm; the vertex-weighted {\sc $2$-BGP} and {\sc $3$-BGP} admit a $5/4$-approximation and a $3/2$-approximation, respectively; but no approximability result exists for {\sc $k$-BGP} when $k \ge 4$, except a trivial $k$-approximation. In this paper, we present another $3/2$-approximation for our cardinality {\sc $3$-BGP} and then extend it to become a $k/2$-approximation for {\sc $k$-BGP}, for any constant $k \ge 3$. Furthermore, for {\sc $4$-BGP}, we propose an improved $24/13$-approximation. To these purposes, we have designed several local improvement operations, which could be useful for related graph partition problems.Comment: 23 pages, 7 figures, accepted for presentation at COCOA 2019 (Xiamen, China

Exploring the longitudinal association between interventions to support the transition to secondary school and child anxiety

School transition at around 11-years of age can be anxiety-provoking for children, particularly those with special educational needs (SEN). The present study adopted a longitudinal design to consider how existing transition strategies, categorized into cognitive, behavioral or systemic approaches, were associated with post-transition anxiety amongst 532 typically developing children and 89 children with SEN. Multiple regression analysis indicated that amongst typically developing pupils, systemic interventions were associated with lower school anxiety but not generalized anxiety, when controlling for prior anxiety. Results for children with SEN differed significantly, as illustrated by a Group × Intervention type interaction. Specifically, systemic strategies were associated with lower school anxiety amongst typically developing children and higher school anxiety amongst children with SEN. These findings highlight strategies that schools may find useful in supporting typically developing children over the transition period, whilst suggesting that children with SEN might need a more personalized approach

Mode-coupling theory for multiple-time correlation functions of tagged particle densities and dynamical filters designed for glassy systems

The theoretical framework for higher-order correlation functions involving multiple times and multiple points in a classical, many-body system developed by Van Zon and Schofield [Phys. Rev. E 65, 011106 (2002)] is extended here to include tagged particle densities. Such densities have found an intriguing application as proposed measures of dynamical heterogeneities in structural glasses. The theoretical formalism is based upon projection operator techniques which are used to isolate the slow time evolution of dynamical variables by expanding the slowly-evolving component of arbitrary variables in an infinite basis composed of the products of slow variables of the system. The resulting formally exact mode-coupling expressions for multiple-point and multiple-time correlation functions are made tractable by applying the so-called N-ordering method. This theory is used to derive for moderate densities the leading mode coupling expressions for indicators of relaxation type and domain relaxation, which use dynamical filters that lead to multiple-time correlations of a tagged particle density. The mode coupling expressions for higher order correlation functions are also succesfully tested against simulations of a hard sphere fluid at relatively low density.Comment: 15 pages, 2 figure