On the impact of overlapping access points in detecting node encounters

Data traces, consisting of logs about the use of mobile and wireless networks, have been used to study the statistics of encounters between mobile nodes, in an attempt to predict the performance of opportunistic networks. Understanding the role and potential of mobile devices as relaying nodes in message dissemination and delivery depends on the knowledge about patterns and number of encounters among nodes. Data traces about the use of WiFi networks are widely available and can be used to extract large datasets of encounters between nodes. However, these logs only capture indirect encounters between nodes, and the resulting encounters datasets might not realistically represent the spatial and temporal behaviour of nodes. This paper addresses the impact of overlapping between the coverage areas of different Access Points of WiFi networks in extracting encounters datasets from the usage logs. Simulation and real-world experimental results show that indirect encounter traces extracted directly from these logs strongly underestimate the opportunities for direct node-to- node message exchange in opportunistic networks.

Performance of the ATLAS muon trigger in pp collisions at s√=8 TeV

The performance of the ATLAS muon trigger system has been evaluated with proton--proton collision data collected in 2012 at the Large Hadron Collider at a centre-of-mass energy of 8 TeV. The performance was primarily evaluated using events containing a pair of muons from the decay of Z bosons. The efficiency is measured for the single-muon trigger for a kinematic region of the transverse momentum pT between 25 and 100 GeV, with a statistical uncertainty of less than 0.01% and a systematic uncertainty of 0.6%. The performance is also compared in detail to the predictions from simulation. The efficiency was measured over a wide pT range (a few GeV to several hundred GeV) by using muons from J/ψ mesons,W bosons, and top and antitop quarks. It showed highly uniform and stable performance.

An algorithmic approach to estimating the minimal number of periodic points for smooth self-maps of simply-connected manifolds

For a given self-map f of M, a closed smooth connected and simply-connected manifold of dimension m ≥ 4, we provide an algorithm for estimating the values of the topological invariant Dm r [f], which equals the minimal number of r-periodic points in the smooth homotopy class of f. Our results are based on the combinatorial scheme for computing Dm r [f] introduced by G. Graff and J. Jezierski [J. Fixed Point Theory Appl. 13 (2013), 63–84]. An open-source implementation of the algorithm programmed in C++ is publicly available at http://www.pawelpilarczyk.com/combtop/.