Exponential dichotomies of evolution operators in Banach spaces

This paper considers three dichotomy concepts (exponential dichotomy, uniform exponential dichotomy and strong exponential dichotomy) in the general context of non-invertible evolution operators in Banach spaces. Connections between these concepts are illustrated. Using the notion of Green function, we give necessary conditions and sufficient ones for strong exponential dichotomy. Some illustrative examples are presented to prove that the converse of some implication type theorems are not valid

A model for adapting 3D graphics based on scalable coding, real-time simplification and remote rendering

Most current multiplayer 3D games can only be played on dedicated platforms, requiring specifically designed content and communication over a predefined network. To overcome these limitations, the OLGA (On-Line GAming) consortium has devised a framework to develop distributive, multiplayer 3D games. Scalability at the level of content, platforms and networks is exploited to achieve the best trade-offs between complexity and quality

Choreographies in Practice

Choreographic Programming is a development methodology for concurrent software that guarantees correctness by construction. The key to this paradigm is to disallow mismatched I/O operations in programs, called choreographies, and then mechanically synthesise distributed implementations in terms of standard process models via a mechanism known as EndPoint Projection (EPP). Despite the promise of choreographic programming, there is still a lack of practical evaluations that illustrate the applicability of choreographies to concrete computational problems with standard concurrent solutions. In this work, we explore the potential of choreographies by using Procedural Choreographies (PC), a model that we recently proposed, to write distributed algorithms for sorting (Quicksort), solving linear equations (Gaussian elimination), and computing Fast Fourier Transform. We discuss the lessons learned from this experiment, giving possible directions for the usage and future improvements of choreography languages

The Paths to Choreography Extraction

Choreographies are global descriptions of interactions among concurrent components, most notably used in the settings of verification (e.g., Multiparty Session Types) and synthesis of correct-by-construction software (Choreographic Programming). They require a top-down approach: programmers first write choreographies, and then use them to verify or synthesize their programs. However, most existing software does not come with choreographies yet, which prevents their application. To attack this problem, we propose a novel methodology (called choreography extraction) that, given a set of programs or protocol specifications, automatically constructs a choreography that describes their behavior. The key to our extraction is identifying a set of paths in a graph that represents the symbolic execution of the programs of interest. Our method improves on previous work in several directions: we can now deal with programs that are equipped with a state and internal computation capabilities; time complexity is dramatically better; we capture programs that are correct but not necessarily synchronizable, i.e., they work because they exploit asynchronous communication

Distributed information consensus filters for simultaneous input and state estimation

This paper describes the distributed information filtering where a set of sensor networks are required to simultaneously estimate input and state of a linear discrete-time system from collaborative manner. Our research purpose is to develop a consensus strategy in which sensor nodes communicate within the network through a sequence of Kalman iterations and data diffusion. A novel recursive information filtering is proposed by integrating input estimation error into measurement data and weighted information matrices. On the fusing process, local system state filtering transmits estimation information using the consensus averaging algorithm, which penalizes the disagreement in a dynamic manner. A simulation example is provided to compare the performance of the distributed information filtering with optimal Gillijins–De Moor’s algorithm

Adaptive estimation in circular functional linear models

We consider the problem of estimating the slope parameter in circular functional linear regression, where scalar responses Y1,...,Yn are modeled in dependence of 1-periodic, second order stationary random functions X1,...,Xn. We consider an orthogonal series estimator of the slope function, by replacing the first m theoretical coefficients of its development in the trigonometric basis by adequate estimators. Wepropose a model selection procedure for m in a set of admissible values, by defining a contrast function minimized by our estimator and a theoretical penalty function; this first step assumes the degree of ill posedness to be known. Then we generalize the procedure to a random set of admissible m's and a random penalty function. The resulting estimator is completely data driven and reaches automatically what is known to be the optimal minimax rate of convergence, in term of a general weighted L2-risk. This means that we provide adaptive estimators of both the slope function and its derivatives

Spin alignment of K∗(892)±K^*(892)^\pm mesons produced in neutron-carbon interactions

A new precise measurements of spin density matrix element $\rho_{00}$ of $K^*(892)^{\pm}$ mesons produced inclusively in neutron-carbon interactions at \~60 GeV have been carried out in the EXCHARM experiment at the Serpukhov accelerator. The values of $\rho_{00}$ obtained in the transversity frame are $0.424\pm0.011(stat)\pm0.018(sys)$ for $K^*(892)^+$ and $0.393\pm0.025(stat)\pm0.018(sys)$ for $K^*(892)^-$. Significant $P_T$ dependence of $\rho_{00}$ has been observed in $K^*(892)^+$ production.Comment: 8 pages, LaTeX, 3 eps figure

Replication, refinement & reachability: complexity in dynamic condition-response graphs

We explore the complexity of reachability and run-time refinement under safety and liveness constraints in event-based process models. Our study is framed in the DCR? process language, which supports modular specification through a compositional operational semantics. DCR?encompasses the “Dynamic Condition Response (DCR) graphs” declarative process model for analysis, execution and safe run-time refinement of process-aware information systems;including replication of sub-processes. We prove that event-reachability and refinement are np-hard for DCR? processes without replication, and that these finite state processes recognise exactly the languages that are the union of a regular and an ω-regular language. Moreover, we prove that eventreachability and refinement are undecidable in general for DCR? processes with replication and local events, and we provide a tractable approximation for refinement. A prototype implementation of the DCR ⋆ language is available at http://dcr.tools/acta16<br/

Highlights from the Pierre Auger Observatory

The Pierre Auger Observatory is the world's largest cosmic ray observatory. Our current exposure reaches nearly 40,000 km$^2$ str and provides us with an unprecedented quality data set. The performance and stability of the detectors and their enhancements are described. Data analyses have led to a number of major breakthroughs. Among these we discuss the energy spectrum and the searches for large-scale anisotropies. We present analyses of our X$_{max}$ data and show how it can be interpreted in terms of mass composition. We also describe some new analyses that extract mass sensitive parameters from the 100% duty cycle SD data. A coherent interpretation of all these recent results opens new directions. The consequences regarding the cosmic ray composition and the properties of UHECR sources are briefly discussed.Comment: 9 pages, 12 figures, talk given at the 33rd International Cosmic Ray Conference, Rio de Janeiro 201

Measurement of shower development and its Moli\`ere radius with a four-plane LumiCal test set-up

A prototype of a luminometer, designed for a future e+e- collider detector, and consisting at present of a four-plane module, was tested in the CERN PS accelerator T9 beam. The objective of this beam test was to demonstrate a multi-plane tungsten/silicon operation, to study the development of the electromagnetic shower and to compare it with MC simulations. The Moli\`ere radius has been determined to be 24.0 +/- 0.6 (stat.) +/- 1.5 (syst.) mm using a parametrization of the shower shape. Very good agreement was found between data and a detailed Geant4 simulation.Comment: Paper published in Eur. Phys. J., includes 25 figures and 3 Table