Inspection games for selfish network environments

Current distributed information system consider only typical fault-tolerance techniques for re-liability issues. Selfish peers, which deviate from the collaborative protocol to increase personal benefit, may also harmfully affect the goals of networked architectures. Securing the collaborative protocol would be an option, however, this may not be always possible or wanted. Then, a post-hoc assessment, deployed by the system designer, could monitor the correct behaviour of the participants without affecting the actual system\u2019s functioning. Due to limited resources, a complete monitoring is not possible: typically monitoring is done by sampling by sampling so that misbehaviour in some case can go undetected. At the same time, a selfish peer\u2019s decision to violate also depends also on the monitoring rate of the inspecting parties. This forms an interdependent interaction landscape, which corresponds to a class of games known as Inspection Games. In this paper, we discuss the practicability of Inspection Games for networked architectures for system analysis and design. To this end, develop generalized Inspection Game versions up to m inspectors and n inspectees, starting from a simple two-player game; we further provide solutions (i.e. Nash equilibria) for all games. Afterwards, these games and solutions are adapted towards an application to networked architectures. This is done by extending them to the possibility of false negatives (the performed inspection on a player\u2019s behaviour does not detect a deviation from the protocol which has actually occurred, due to the intrinsic failability of the inspection technique)

A delay and cost balancing protocol for message routing in mobile delay tolerant networks

The increasing pervasiveness of mobile devices with networking capabilities has led to the emergence of Mobile Delay Tolerant Networks (MDTNs). The characteristics of MDTNs, which include frequent and long-term partitions, make message routing a major challenge in these networks. Most of the existing routing protocols either allocate an unlimited number of message copies or use a xed number of message copies to route a message towards its destination. While the first approach unnecessarily oods the network, the rigidity of the second approach makes it ine cient from the viewpoint of message replication. Hence, the question that we address in this paper is: "How to dynamically allocate message copies in order to strike a balance between the delay and cost of message delivery?". We present a novel adaptive multi-step routing protocol for MDTNs. In each routing step, our protocol reasons on the remaining time-tolive of the message in order to allocate the minimum number of copies necessary to achieve a given delivery probability. Experiment results demonstrate that our protocol has a higher delivery ratio and a lower delivery cost compared to the state-of-the-art Spray-and-Wait and Bubble protocols

Restabelecimento funcional do tendão extensor digital longo em equinos submetidos a tenectomia parcial

O artigo não apresenta resumo

Two-fermion relativistic bound states in Light-Front Dynamics

In the Light-Front Dynamics, the wave function equations and their numerical solutions, for two fermion bound systems, are presented. Analytical expressions for the ladder one-boson exchange interaction kernels corresponding to scalar, pseudoscalar, pseudovector and vector exchanges are given. Different couplings are analyzed separately and each of them is found to exhibit special features. The results are compared with the non relativistic solutions.Comment: 40 pages, to be published in Phys. Rev. C, .tar.gz fil

Cumulant to Factorial Moment Ratio and Multiplicity Data

The ratio of cumulant to factorial moments of experimental multiplicity distributions has been calculated for $e^{+}e^{-}$ and $hh$ interactions in a wide range of energies. As a function of the rank it exhibits an initial steep decrease and a series of oscillations around zero. Those features cannot be reproduced by the Negative Binomial Distribution. A comparable behaviour is instead predicted in high-energy perturbative QCD. The presence of a qualitatively similar behaviour for different processes and in wide energy intervals suggests speaking of an approximate scaling of the cumulant to factorial moment ratio.Comment: Submitted to Phys.Lett.B; Latex document, 11 pages, 4 PostScript figures appended. Preprint number FIAN/TD-15/93 also FNT/AE 93-2

Search for CP Violation in the decays D+ -> K_S pi+ and D+ -> K_S K+

A high statistics sample of photo-produced charm from the FOCUS(E831) experiment at Fermilab has been used to search for direct CP violation in the decays D+->K_S pi+ and D+ -> K_S K+. We have measured the following asymmetry parameters relative to D+->K-pi+pi+: A_CP(K_S pi+) = (-1.6 +/- 1.5 +/- 0.9)%, A_CP(K_S K+) = (+6.9 +/- 6.0 +/- 1.5)% and A_CP(K_S K+) = (+7.1 +/- 6.1 +/- 1.2)% relative to D+->K_S pi+. The first errors quoted are statistical and the second are systematic. We also measure the relative branching ratios: \Gamma(D+->\bar{K0}pi+)/\Gamma(D+->K-pi+pi+) = (30.60 +/- 0.46 +/- 0.32)%, \Gamma(D+->\bar{K0}K+)/\Gamma(D+->K-pi+pi+) = (6.04 +/- 0.35 +/- 0.30)% and \Gamma(D+->\bar{K0}K+)/\Gamma(D+->\bar{K0}pi+) = (19.96 +/- 1.19 +/- 0.96)%.Comment: 4 pages, 3 figure