Survey on Vision-based Path Prediction

Path prediction is a fundamental task for estimating how pedestrians or vehicles are going to move in a scene. Because path prediction as a task of computer vision uses video as input, various information used for prediction, such as the environment surrounding the target and the internal state of the target, need to be estimated from the video in addition to predicting paths. Many prediction approaches that include understanding the environment and the internal state have been proposed. In this survey, we systematically summarize methods of path prediction that take video as input and and extract features from the video. Moreover, we introduce datasets used to evaluate path prediction methods quantitatively.Comment: DAPI 201

Probing nuclear expansion dynamics with π−/π+\pi^-/\pi^+-spectra

We study the dynamics of charged pions in the nuclear medium via the ratio of differential $\pi^-$- and $\pi^+$-spectra in a coupled-channel BUU (CBUU) approach. The relative energy shift of the charged pions is found to correlate with the pion freeze-out time in nucleus-nucleus collisions as well as with the impact parameter of the heavy-ion reaction. Furthermore, the long-range Coulomb force provides a 'clock' for the expansion of the hot nuclear system. Detailed comparisons with experimental data for $Au + Au$ at 1 GeV/A and $Ni + Ni$ at 2.0 GeV/A are presented.Comment: 21 pages, latex, figures include

Methodological framework for an integrated multi-scale vulnerability and resilience assessment

The deliverable illustrates the methodological framework to assess vulnerability and resilience across different temporal and spatial scales, acknowledging the different domains where the latter may manifest, and in particular in the natural and the built environment, allocating a large importance to the so called “critical infrastructures”, in social and economic systems. A set of four matrices has been developed to identify what aspects should be looked at before the impact, that is to say what shows the potential ability or inability to cope with an extreme; at the impact, addressing in particular the capacity (or incapacity) to sustain various types of stresses (in the form of acceleration, pressure, heat…); in the time immediately after the impact, as the ability (or inability) to suffer losses and still continue functioning; and in the longer term of recovery, as the capacity to find a new state of equilibrium in which the fragilities manifested during and after the impact are addressed. Developing the framework, a particular attention has been paid to the relationships among systems within the same matrix and among matrices, across spatial and temporal scales. A set of matrices has been developed for different natural hazards, including in particular landslides and floods, trying to include as much as possible what past cases, the international literature and prior experience of involved partners have indicated as relevant parameters and factors to look at. In this regard, the project builds on the state of the art, embedding what has been learned until now in terms of response capacity to a variety of stresses and in the meantime identifying gaps to be addressed by future research

Dynamics of Transformation from Segregation to Mixed Wealth Cities

We model the dynamics of the Schelling model for agents described simply by a continuously distributed variable - wealth. Agents move to neighborhoods where their wealth is not lesser than that of some proportion of their neighbors, the threshold level. As in the case of the classic Schelling model where segregation obtains between two races, we find here that wealth-based segregation occurs and persists. However, introducing uncertainty into the decision to move - that is, with some probability, if agents are allowed to move even though the threshold level condition is contravened - we find that even for small proportions of such disallowed moves, the dynamics no longer yield segregation but instead sharply transition into a persistent mixed wealth distribution. We investigate the nature of this sharp transformation between segregated and mixed states, and find that it is because of a non-linear relationship between allowed moves and disallowed moves. For small increases in disallowed moves, there is a rapid corresponding increase in allowed moves, but this tapers off as the fraction of disallowed moves increase further and finally settles at a stable value, remaining invariant to any further increase in disallowed moves. It is the overall effect of the dynamics in the initial region (with small numbers of disallowed moves) that shifts the system away from a state of segregation rapidly to a mixed wealth state. The contravention of the tolerance condition could be interpreted as public policy interventions like minimal levels of social housing or housing benefit transfers to poorer households. Our finding therefore suggests that it might require only very limited levels of such public intervention - just sufficient to enable a small fraction of disallowed moves, because the dynamics generated by such moves could spur the transformation from a segregated to mixed equilibrium.Comment: 12 pages, 7 figure

A Fast Algorithm Finding the Shortest Reset Words

In this paper we present a new fast algorithm finding minimal reset words for finite synchronizing automata. The problem is know to be computationally hard, and our algorithm is exponential. Yet, it is faster than the algorithms used so far and it works well in practice. The main idea is to use a bidirectional BFS and radix (Patricia) tries to store and compare resulted subsets. We give both theoretical and practical arguments showing that the branching factor is reduced efficiently. As a practical test we perform an experimental study of the length of the shortest reset word for random automata with $n$ states and 2 input letters. We follow Skvorsov and Tipikin, who have performed such a study using a SAT solver and considering automata up to $n=100$ states. With our algorithm we are able to consider much larger sample of automata with up to $n=300$ states. In particular, we obtain a new more precise estimation of the expected length of the shortest reset word $\approx 2.5\sqrt{n-5}$.Comment: COCOON 2013. The final publication is available at http://link.springer.com/chapter/10.1007%2F978-3-642-38768-5_1

Massively parallel computing on an organic molecular layer

Current computers operate at enormous speeds of ~10^13 bits/s, but their principle of sequential logic operation has remained unchanged since the 1950s. Though our brain is much slower on a per-neuron base (~10^3 firings/s), it is capable of remarkable decision-making based on the collective operations of millions of neurons at a time in ever-evolving neural circuitry. Here we use molecular switches to build an assembly where each molecule communicates-like neurons-with many neighbors simultaneously. The assembly's ability to reconfigure itself spontaneously for a new problem allows us to realize conventional computing constructs like logic gates and Voronoi decompositions, as well as to reproduce two natural phenomena: heat diffusion and the mutation of normal cells to cancer cells. This is a shift from the current static computing paradigm of serial bit-processing to a regime in which a large number of bits are processed in parallel in dynamically changing hardware.Comment: 25 pages, 6 figure