Higher physical fitness levels are associated with less language decline in healthy ageing

Healthy ageing is associated with decline in cognitive abilities such as language. Aerobic fitness has been shown to ameliorate decline in some cognitive domains, but the potential benefits for language have not been examined. In a cross-sectional sample, we investigated the relationship between aerobic fitness and tip-of-the-tongue states. These are among the most frequent cognitive failures in healthy older adults and occur when a speaker knows a word but is unable to produce it. We found that healthy older adults indeed experience more tip-of-the-tongue states than young adults. Importantly, higher aerobic fitness levels decrease the probability of experiencing tip-of-the-tongue states in healthy older adults. Fitness-related differences in word finding abilities are observed over and above effects of age. This is the first demonstration of a link between aerobic fitness and language functioning in healthy older adults

A computational group theoretic symmetry reduction package for the SPIN model checker

Symmetry reduced model checking is hindered by two problems: how to identify state space symmetry when systems are not fully symmetric, and how to determine equivalence of states during search. We present TopSpin, a fully automatic symmetry reduction package for the Spin model checker. TopSpin uses the Gap computational algebra system to effectively detect state space symmetry from the associated Promela specification, and to choose an efficient symmetry reduction strategy by classifying automorphism groups as a disjoint/wreath product of subgroups. We present encouraging experimental results for a variety of Promela examples

Strong-Segregation Theory of Bicontinuous Phases in Block Copolymers

We compute phase diagrams for $A_nB_m$ starblock copolymers in the strong-segregation regime as a function of volume fraction $\phi$, including bicontinuous phases related to minimal surfaces (G, D, and P surfaces) as candidate structures. We present the details of a general method to compute free energies in the strong segregation limit, and demonstrate that the gyroid G phase is the most nearly stable among the bicontinuous phases considered. We explore some effects of conformational asymmetry on the topology of the phase diagram.Comment: 14 pages, latex, 21 figures, to appear in Macromolecule

Coinductive interpreters for process calculi

This paper suggests functional programming languages with coinductive types as suitable devices for prototyping process calculi. The proposed approach is independent of any particular process calculus and makes explicit the different ingredients present in the design of any such calculi. In particular structural aspects of the underlying behaviour model (e.g. the dichotomies such as active vs reactive, deterministic vs nondeterministic) become clearly separated from the interaction structure which defines the synchronisation discipline. The approach is illustrated by the detailed development in Charity of an interpreter for a family of process languages.(undefined

Bigraphical Refinement

We propose a mechanism for the vertical refinement of bigraphical reactive systems, based upon a mechanism for limiting observations and utilising the underlying categorical structure of bigraphs. We present a motivating example to demonstrate that the proposed notion of refinement is sensible with respect to the theory of bigraphical reactive systems; and we propose a sufficient condition for guaranteeing the existence of a safety-preserving vertical refinement. We postulate the existence of a complimentary notion of horizontal refinement for bigraphical agents, and finally we discuss the connection of this work to the general refinement of Reeves and Streader.Comment: In Proceedings Refine 2011, arXiv:1106.348

Interfaces in Diblocks: A Study of Miktoarm Star Copolymers

We study AB$_n$ miktoarm star block copolymers in the strong segregation limit, focussing on the role that the AB interface plays in determining the phase behavior. We develop an extension of the kinked-path approach which allows us to explore the energetic dependence on interfacial shape. We consider a one-parameter family of interfaces to study the columnar to lamellar transition in asymmetric stars. We compare with recent experimental results. We discuss the stability of the A15 lattice of sphere-like micelles in the context of interfacial energy minimization. We corroborate our theory by implementing a numerically exact self-consistent field theory to probe the phase diagram and the shape of the AB interface.Comment: 12 pages, 11 included figure

On the Behaviour of General-Purpose Applications on Cloud Storages

Managing data over cloud infrastructures raises novel challenges with respect to existing and well studied approaches such as ACID and long running transactions. One of the main requirements is to provide availability and partition tolerance in a scenario with replicas and distributed control. This comes at the price of a weaker consistency, usually called eventual consistency. These weak memory models have proved to be suitable in a number of scenarios, such as the analysis of large data with Map-Reduce. However, due to the widespread availability of cloud infrastructures, weak storages are used not only by specialised applications but also by general purpose applications. We provide a formal approach, based on process calculi, to reason about the behaviour of programs that rely on cloud stores. For instance, one can check that the composition of a process with a cloud store ensures `strong' properties through a wise usage of asynchronous message-passing

SCC: A Service Centered Calculus

We seek for a small set of primitives that might serve as a basis for formalising and programming service oriented applications over global computers. As an outcome of this study we introduce here SCC, a process calculus that features explicit notions of service definition, service invocation and session handling. Our proposal has been influenced by Orc, a programming model for structured orchestration of services, but the SCC’s session handling mechanism allows for the definition of structured interaction protocols, more complex than the basic request-response provided by Orc. We present syntax and operational semantics of SCC and a number of simple but nontrivial programming examples that demonstrate flexibility of the chosen set of primitives. A few encodings are also provided to relate our proposal with existing ones

Modelling and Analysis Mobile Systems Using �pi-calculus (EFCP)

Reference passing systems, like mobile and recon�gurable systems are common nowadays. The common feature of such systems is the possibility to form dynamic logical connections between the individual modules. However, such systems are very di�cult to verify, as their logical structure is dynamic. Traditionally, decidable fragments of pi-calculus, e.g. the well-known Finite Control Processes (FCP), are used for formal modelling of reference passing systems. Unfortunately, FCPs allow only `global' concurrency between processes, and thus cannot naturally express scenarios involving `local' concurrency inside a process, such as multicast. In this paper we propose Extended Finite Control Processes (EFCP), which are more convenient for practical modelling. Moreover, an almost linear translation of EFCPs to FCPs is developed, which enables e�cient model checking of EFCPs