A Formalism for Scattering of Complex Composite Structures. 2 Distributed Reference Points

Recently we developed a formalism for the scattering from linear and acyclic branched structures build of mutually non-interacting sub-units.{[}C. Svaneborg and J. S. Pedersen, J. Chem. Phys. 136, 104105 (2012){]} We assumed each sub-unit has reference points associated with it. These are well defined positions where sub-units can be linked together. In the present paper, we generalize the formalism to the case where each reference point can represent a distribution of potential link positions. We also present a generalized diagrammatic representation of the formalism. Scattering expressions required to model rods, polymers, loops, flat circular disks, rigid spheres and cylinders are derived. and we use them to illustrate the formalism by deriving the generic scattering expression for micelles and bottle brush structures and show how the scattering is affected by different choices of potential link positions.Comment: Paper no. 2 of a serie

Diffraction limited optics for single atom manipulation

We present an optical system designed to capture and observe a single neutral atom in an optical dipole trap, created by focussing a laser beam using a large numerical aperture N.A.=0.5 aspheric lens. We experimentally evaluate the performance of the optical system and show that it is diffraction limited over a broad spectral range (~ 200 nm) with a large transverse field (+/- 25 microns). The optical tweezer created at the focal point of the lens is able to trap single atoms of 87Rb and to detect them individually with a large collection efficiency. We measure the oscillation frequency of the atom in the dipole trap, and use this value as an independent determination of the waist of the optical tweezer. Finally, we produce with the same lens two dipole traps separated by 2.2 microns and show that the imaging system can resolve the two atoms.Comment: 8 pages, 9 figures; typos corrected and references adde

Static Safety for an Actor Dedicated Process Calculus by Abstract Interpretation

The actor model eases the definition of concurrent programs with non uniform behaviors. Static analysis of such a model was previously done in a data-flow oriented way, with type systems. This approach was based on constraint set resolution and was not able to deal with precise properties for communications of behaviors. We present here a new approach, control-flow oriented, based on the abstract interpretation framework, able to deal with communication of behaviors. Within our new analyses, we are able to verify most of the previous properties we observed as well as new ones, principally based on occurrence counting

Compiling Pattern Matching in Join-Patterns

We propose an extension of the join-calculus with pattern matching on algebraic data types. Our initial motivation is twofold: to provide an intuitive semantics of the interaction between concurrency and pattern matching; to define a practical compilation scheme from extended join-definitions into ordinary ones plus (ML) pattern matching. To assess the correctness of our compilation scheme, we develop a theory of the applied join-calculus, a calculus with value-passing and value matching

Intermittent dislocation flow in viscoplastic deformation

The viscoplastic deformation (creep) of crystalline materials under constant stress involves the motion of a large number of interacting dislocations. Analytical methods and sophisticated `dislocation-dynamics' simulations have proved very effective in the study of dislocation patterning, and have led to macroscopic constitutive laws of plastic deformation. Yet, a statistical analysis of the dynamics of an assembly of interacting dislocations has not hitherto been performed. Here we report acoustic emission measurements on stressed ice single crystals, the results of which indicate that dislocations move in a scale-free intermittent fashion. This result is confirmed by numerical simulations of a model of interacting dislocations that successfully reproduces the main features of the experiment. We find that dislocations generate a slowly evolving configuration landscape which coexists with rapid collective rearrangements. These rearrangements involve a comparatively small fraction of the dislocations and lead to an intermittent behavior of the net plastic response. This basic dynamical picture appears to be a generic feature in the deformation of many other materials. Moreover, it should provide a framework for discussing fundamental aspects of plasticity, that goes beyond standard mean-field approaches that see plastic deformation as a smooth laminar flow

Orchestrating Tuple-based Languages

The World Wide Web can be thought of as a global computing architecture supporting the deployment of distributed networked applications. Currently, such applications can be programmed by resorting mainly to two distinct paradigms: one devised for orchestrating distributed services, and the other designed for coordinating distributed (possibly mobile) agents. In this paper, the issue of designing a pro- gramming language aiming at reconciling orchestration and coordination is investigated. Taking as starting point the orchestration calculus Orc and the tuple-based coordination language Klaim, a new formalism is introduced combining concepts and primitives of the original calculi. To demonstrate feasibility and effectiveness of the proposed approach, a prototype implementation of the new formalism is described and it is then used to tackle a case study dealing with a simplified but realistic electronic marketplace, where a number of on-line stores allow client applications to access information about their goods and to place orders

Gopi: compiling linear and static channels in go

PTDC/CCI-COM/32166/2017We identify two important features to enhance the design of communication protocols specified in the pi-calculus, that are linear and static channels, and present a compiler, named GoPi, that maps high level specifications into executable Go programs. Channels declared as linear are deadlock-free, while the scope of static channels, which are bound by a hide declaration, does not enlarge at runtime; this is enforced statically by means of type inference, while specifications do not include annotations. Well-behaved processes are transformed into Go code that supports non-deterministic synchronizations and race-freedom. We sketch two main examples involving protection against message forwarding, and forward secrecy, and discuss the features of the tool, and the generated code. We argue that GoPi can support academic activities involving process algebras and formal models, which range from the analysis and testing of concurrent processes for research purposes to teaching formal languages and concurrent systems.publishersversionpublishe

Robust modeling of human contact networks across different scales and proximity-sensing techniques

The problem of mapping human close-range proximity networks has been tackled using a variety of technical approaches. Wearable electronic devices, in particular, have proven to be particularly successful in a variety of settings relevant for research in social science, complex networks and infectious diseases dynamics. Each device and technology used for proximity sensing (e.g., RFIDs, Bluetooth, low-power radio or infrared communication, etc.) comes with specific biases on the close-range relations it records. Hence it is important to assess which statistical features of the empirical proximity networks are robust across different measurement techniques, and which modeling frameworks generalize well across empirical data. Here we compare time-resolved proximity networks recorded in different experimental settings and show that some important statistical features are robust across all settings considered. The observed universality calls for a simplified modeling approach. We show that one such simple model is indeed able to reproduce the main statistical distributions characterizing the empirical temporal networks