Beyond Counting: New Perspectives on the Active IPv4 Address Space

In this study, we report on techniques and analyses that enable us to capture Internet-wide activity at individual IP address-level granularity by relying on server logs of a large commercial content delivery network (CDN) that serves close to 3 trillion HTTP requests on a daily basis. Across the whole of 2015, these logs recorded client activity involving 1.2 billion unique IPv4 addresses, the highest ever measured, in agreement with recent estimates. Monthly client IPv4 address counts showed constant growth for years prior, but since 2014, the IPv4 count has stagnated while IPv6 counts have grown. Thus, it seems we have entered an era marked by increased complexity, one in which the sole enumeration of active IPv4 addresses is of little use to characterize recent growth of the Internet as a whole. With this observation in mind, we consider new points of view in the study of global IPv4 address activity. Our analysis shows significant churn in active IPv4 addresses: the set of active IPv4 addresses varies by as much as 25% over the course of a year. Second, by looking across the active addresses in a prefix, we are able to identify and attribute activity patterns to network restructurings, user behaviors, and, in particular, various address assignment practices. Third, by combining spatio-temporal measures of address utilization with measures of traffic volume, and sampling-based estimates of relative host counts, we present novel perspectives on worldwide IPv4 address activity, including empirical observation of under-utilization in some areas, and complete utilization, or exhaustion, in others.Comment: in Proceedings of ACM IMC 201

The Vampire and the FOOL

This paper presents new features recently implemented in the theorem prover Vampire, namely support for first-order logic with a first class boolean sort (FOOL) and polymorphic arrays. In addition to having a first class boolean sort, FOOL also contains if-then-else and let-in expressions. We argue that presented extensions facilitate reasoning-based program analysis, both by increasing the expressivity of first-order reasoners and by gains in efficiency

Reachability in Parametric Interval Markov Chains using Constraints

Parametric Interval Markov Chains (pIMCs) are a specification formalism that extend Markov Chains (MCs) and Interval Markov Chains (IMCs) by taking into account imprecision in the transition probability values: transitions in pIMCs are labeled with parametric intervals of probabilities. In this work, we study the difference between pIMCs and other Markov Chain abstractions models and investigate the two usual semantics for IMCs: once-and-for-all and at-every-step. In particular, we prove that both semantics agree on the maximal/minimal reachability probabilities of a given IMC. We then investigate solutions to several parameter synthesis problems in the context of pIMCs -- consistency, qualitative reachability and quantitative reachability -- that rely on constraint encodings. Finally, we propose a prototype implementation of our constraint encodings with promising results

Constraining Nonstandard Neutrino-Electron Interactions

We present a detailed analysis on nonstandard neutrino interactions (NSI) with electrons including all muon and electron (anti)-neutrino data from existing accelerators and reactors, in conjunction with the ``neutrino counting'' data (e- e+ -> nu nu gamma) from the four LEP collaborations. First we perform a one-parameter-at-a-time analysis, showing how most constraints improve with respect to previous results reported in the literature. We also present more robust results where the NSI parameters are allowed to vary freely in the analysis. We show the importance of combining LEP data with the other experiments in removing degeneracies in the global analysis constraining flavor-conserving NSI parameters which, at 90 % and 95 % C.L., must lie within unique allowed regions. Despite such improved constraints, there is still substantial room for improvement, posing a big challenge for upcoming experiments.Comment: 19 pages, 4 figures. Final version to appear in Phys. Rev.

Nambu monopoles interacting with lattice defects in two-dimensional artificial square spin ice

The interactions between an excitation (similar to a pair of Nambu monopoles) and a lattice defect are studied in an artificial two-dimensional square spin ice. This is done by considering a square array of islands containing only one island different from all others. This difference is incorporated in the magnetic moment (spin) of the "imperfect" island and several cases are studied, including the special situation in which this distinct spin is zero (vacancy). We have shown that the two extreme points of a malformed island behave like two opposite magnetic charges. Then, the effective interaction between a pair of Nambu monopoles with the deformed island is a problem involving four magnetic charges (two pairs of opposite poles) and a string. We also sketch the configuration of the field lines of these four charges to confirm this picture. The influence of the string on this interaction decays rapidly with the string distance from the defect.Comment: 7 pages, 13 figure

Compostos bioativos e atividade antioxidante de pitangas em função de diferentes estádios de maturação e espaçamentos de plantio.

bitstream/item/79715/1/Comunicado-268.pd