The confining trailing string

We extend the holographic trailing string picture of a heavy quark to the case of a bulk geometry dual to a confining gauge theory. We compute the classical trailing confining string solution for a static as well as a uniformly moving quark. The trailing string is infinitely extended and approaches a confining horizon, situated at a critical value of the radial coordinate, along one of the space-time directions, breaking boundary rotational invariance. We compute the equations for the fluctuations around the classical solutions, which are used to obtain boundary force correlators controlling the Langevin dynamics of the quark. The imaginary part of the correlators has a non-trivial low-frequency limit, which gives rise to a viscous friction coefficient induced by the confining vacuum. The vacuum correlators are used to define finite-temperature dressed Langevin correlators with an appropriate high-frequency behavior.Comment: 63 pages plus appendices, 19 figures; version accepted for publication in JHE

Leave-one-out prediction error of systolic arterial pressure time series under paced breathing

In this paper we show that different physiological states and pathological conditions may be characterized in terms of predictability of time series signals from the underlying biological system. In particular we consider systolic arterial pressure time series from healthy subjects and Chronic Heart Failure patients, undergoing paced respiration. We model time series by the regularized least squares approach and quantify predictability by the leave-one-out error. We find that the entrainment mechanism connected to paced breath, that renders the arterial blood pressure signal more regular, thus more predictable, is less effective in patients, and this effect correlates with the seriousness of the heart failure. The leave-one-out error separates controls from patients and, when all orders of nonlinearity are taken into account, alive patients from patients for which cardiac death occurred

Using a distributed Shapley-value based approach to ensure navigability in a social network of smart objects

The huge number of nodes that is expected to join the Internet of Things in the short term will add major scalability issues to several procedures. A recent promising approach to these issues is based on social networking solutions to allow objects to autonomously establish social relationships. Every object in the resulting Social IoT (SIoT) exchanges data with its friend objects in a distributed manner to avoid the need for centralized solutions to implement major functionalities, such as: node discovery, information search and trustworthiness management. However, the number and types of established friendship affects network navigability. This paper addresses this issue proposing an efficient, distributed and dynamic strategy for the objects to select the right friends for the benefit of the overall network connectivity. The proposed friendship selection model relies on a Shapley-value based algorithm mapping the friendship selection process in the SIoT onto the coalition formation problem in a corresponding cooperative game. The obtained results show that the proposed solution is able to ensure global navigability, measured in terms of average path length among two nodes in the network, by means of a distributed and wise selection of the number of friend objects a node has to handle

Redundant variables and Granger causality

We discuss the use of multivariate Granger causality in presence of redundant variables: the application of the standard analysis, in this case, leads to under-estimation of causalities. Using the un-normalized version of the causality index, we quantitatively develop the notions of redundancy and synergy in the frame of causality and propose two approaches to group redundant variables: (i) for a given target, the remaining variables are grouped so as to maximize the total causality and (ii) the whole set of variables is partitioned to maximize the sum of the causalities between subsets. We show the application to a real neurological experiment, aiming to a deeper understanding of the physiological basis of abnormal neuronal oscillations in the migraine brain. The outcome by our approach reveals the change in the informational pattern due to repetitive transcranial magnetic stimulations.Comment: 4 pages, 5 figures. Accepted for publication in Physical Review

Enhancing the navigability in a social network of smart objects: a Shapley-value based approach

The Internet of Things (IoT) holds the promise to interconnect any possible object capable of providing useful information about the physical world for the benefit of humans' quality of life. The increasing number of heterogeneous objects that the IoT has to manage introduces crucial scalability issues that still need appropriate solutions. In this respect, one promising proposal is the Social IoT (SIoT) paradigm, whose main principle is to enable objects to autonomously establish social links with each other (adhering to rules set by their owners). "Friend" objects exchange data in a distributed manner and this avoids centralized solutions to implement major functions, such as: node discovery, information search, and trustworthiness management. However, the number and types of established friendships affect network navigability. This issue is the focus of this paper, which proposes an efficient, distributed and dynamic solution for the objects to select the right friends for the benefit of the overall network connectivity. The proposed friendship selection mechanism relies on a game theoretic model and a Shapley-value based algorithm. Two different utility functions are defined and evaluated based on either a group degree centrality and an average local clustering parameter. The comparison in terms of global navigability is measured in terms of average path length for the interconnection of any couple of nodes in the network. Results show that the group degree centrality brings to an enhanced degree of navigability thanks to the ability to create a suitable core of hubs

MIFaaS: A Mobile-IoT-Federation-as-a-Service Model for dynamic cooperation of IoT Cloud Providers

In the Internet of Things (IoT) arena, a constant evolution is observed towards the deployment of integrated environments, wherein heterogeneous devices pool their capacities to match wide-ranging user requirements. Solutions for efficient and synergistic cooperation among objects are, therefore, required. This paper suggests a novel paradigm to support dynamic cooperation among private/public local clouds of IoT devices. Differently from . device-oriented approaches typical of Mobile Cloud Computing, the proposed paradigm envisages an . IoT Cloud Provider (ICP)-oriented cooperation, which allows all devices belonging to the same private/public owner to participate in the federation process. Expected result from dynamic federations among ICPs is a remarkable increase in the amount of service requests being satisfied. Different from the Fog Computing vision, the network edge provides only management support and supervision to the proposed Mobile-IoT-Federation-as-a-Service (MIFaaS), thus reducing the deployment cost of peripheral micro data centers. The paper proposes a coalition formation game to account for the interest of rational cooperative ICPs in their own payoff. A proof-of-concept performance evaluation confirms that obtained coalition structures not only guarantee the satisfaction of the players' requirements according to their utility function, but also these introduce significant benefits for the cooperating ICPs in terms of number of tasks being successfully assigned

Coarsening in surface growth models without slope selection

We study conserved models of crystal growth in one dimension [$\partial_t z(x,t) =-\partial_x j(x,t)$] which are linearly unstable and develop a mound structure whose typical size L increases in time ($L = t^n$). If the local slope ($m =\partial_x z$) increases indefinitely, $n$ depends on the exponent $\gamma$ characterizing the large $m$ behaviour of the surface current $j$ ($j = 1/|m|^\gamma$): $n=1/4$ for $1< \gamma <3$ and $n=(1+\gamma)/(1+5\gamma)$ for $\gamma>3$.Comment: 7 pages, 2 EPS figures. To be published in J. Phys. A (Letter to the Editor

Cost functions for pairwise data clustering

Cost functions for non-hierarchical pairwise clustering are introduced, in the probabilistic autoencoder framework, by the request of maximal average similarity between the input and the output of the autoencoder. The partition provided by these cost functions identifies clusters with dense connected regions in data space; differences and similarities with respect to a well known cost function for pairwise clustering are outlined.Comment: 5 pages, 4 figure

Deterministic Annealing as a jet clustering algorithm in hadronic collisions

We show that a general purpose clusterization algorithm, Deterministic Annealing, can be adapted to the problem of jet identification in particle production by high energy collisions. In particular we consider the problem of jet searching in events generated at hadronic colliders. Deterministic Annealing is able to reproduce the results obtained by traditional jet algorithms and to exhibit a higher degree of flexibility.Comment: 13 pages, 6 figure