Tracking performance evaluation on PETS 2015 Challenge datasets

This paper presents a quantitative evaluation of a tracking system on PETS 2015 Challenge datasets using well-established performance measures. Using the existing tools, the tracking system implements an end-to-end pipeline that include object detection, tracking and post- processing stages. The evaluation results are presented on the provided sequences of both ARENA and P5 datasets of PETS 2015 Challenge. The results show an encouraging performance of the tracker in terms of accuracy but a greater tendency of being prone to cardinality error and ID changes on both datasets. Moreover, the analysis show a better performance of the tracker on visible imagery than on thermal imagery.

Large deviations of Rouse polymer chain: first passage problem

The purpose of this paper is to investigate several analytical methods of solving first passage (FP) problem for the Rouse model, a simplest model of a polymer chain. We show that this problem has to be treated as a multi-dimensional Kramers' problem, which presents rich and unexpected behavior. We first perform direct and forward-flux sampling (FFS) simulations, and measure the mean first-passage time $\tau(z)$ for the free end to reach a certain distance $z$ away from the origin. The results show that the mean FP time is getting faster if the Rouse chain is represented by more beads. Two scaling regimes of $\tau(z)$ are observed, with transition between them varying as a function of chain length. We use these simulations results to test two theoretical approaches. One is a well known asymptotic theory valid in the limit of zero temperature. We show that this limit corresponds to fully extended chain when each chain segment is stretched, which is not particularly realistic. A new theory based on the well known Freidlin-Wentzell theory is proposed, where dynamics is projected onto the minimal action path. The new theory predicts both scaling regimes correctly, but fails to get the correct numerical prefactor in the first regime. Combining our theory with the FFS simulations lead us to a simple analytical expression valid for all extensions and chain lengths. One of the applications of polymer FP problem occurs in the context of branched polymer rheology. In this paper, we consider the arm-retraction mechanism in the tube model, which maps exactly on the model we have solved. The results are compared to the Milner-McLeish theory without constraint release, which is found to overestimate FP time by a factor of 10 or more.

Finality revived: powers and intentionality

Proponents of physical intentionality argue that the classic hallmarks of intentionality highlighted by Brentano are also found in purely physical powers. Critics worry that this idea is metaphysically obscure at best, and at worst leads to panpsychism or animism. I examine the debate in detail, finding both confusion and illumination in the physical intentionalist thesis. Analysing a number of the canonical features of intentionality, I show that they all point to one overarching phenomenon of which both the mental and the physical are kinds, namely finality. This is the finality of ‘final causes’, the long-discarded idea of universal action for an end to which recent proponents of physical intentionality are in fact pointing whether or not they realise it. I explain finality in terms of the concept of specific indifference, arguing that in the case of the mental, specific indifference is realised by the process of abstraction, which has no correlate in the case of physical powers. This analysis, I conclude, reveals both the strength and weakness of rational creatures such as us, as well as demystifying (albeit only partly) the way in which powers work.

Proxy re-encryption schemes for IoT and crowd sensing

IoT, crowd sensing and smart cities will be a traffic challenge. New communication paradigms as asynchronous messaging carry and forward, scheduled delivery and temporary storage will be needed to manage network resources dynamically. Since traditional end to end security will require keeping security associations among devices for a long time draining valuable resources, we propose and evaluate the use of proxy re-encryption protocols in these scenarios as a solution for reliable and flexible security.