Bug propagation and debugging in asymmetric software structures

Software dependence networks are shown to be scale-free and asymmetric. We then study how software components are affected by the failure of one of them, and the inverse problem of locating the faulty component. Software at all levels is fragile with respect to the failure of a random single component. Locating a faulty component is easy if the failures only affect their nearest neighbors, while it is hard if the failures propagate further.Comment: 4 pages, 4 figure

The meta book and size-dependent properties of written language

Evidence is given for a systematic text-length dependence of the power-law index gamma of a single book. The estimated gamma values are consistent with a monotonic decrease from 2 to 1 with increasing length of a text. A direct connection to an extended Heap's law is explored. The infinite book limit is, as a consequence, proposed to be given by gamma = 1 instead of the value gamma=2 expected if the Zipf's law was ubiquitously applicable. In addition we explore the idea that the systematic text-length dependence can be described by a meta book concept, which is an abstract representation reflecting the word-frequency structure of a text. According to this concept the word-frequency distribution of a text, with a certain length written by a single author, has the same characteristics as a text of the same length pulled out from an imaginary complete infinite corpus written by the same author.Comment: 7 pages, 6 figures, 1 tabl

Dissociation of CH4 by electron impact: Production of metastable hydrogen and carbon fragments

Metastable fragments produced by electron impact excitation of CH4 have been investigated for incident electron energies from threshold to 300 eV. Only metastable hydrogen and carbon atoms were observed. Onset energies for the production of metastable hydrogen atoms were observed at electron impact energies of 22.0 + or - .5 eV, 25.5 + or - .6 eV, 36.7 + or - .6 eV and 66 + or - 3 eV, and at 26.6 + or - .6 eV for the production of metastable carbon atoms. Most of the fragments appear to have been formed in high-lying Rydberg states. The total metastable hydrogen cross section reaches a maximum value of approximately 1 X 10 to the minus 18th power sq cm at 100 eV. At the same energy, the metastable carbon cross section is 2 x 10 to the minus 19th power sq cm

Universality of Zipf's Law

We introduce a simple and generic model that reproduces Zipf's law. By regarding the time evolution of the model as a random walk in the logarithmic scale, we explain theoretically why this model reproduces Zipf's law. The explanation shows that the behavior of the model is very robust and universal.Comment: 5 eps files included. To be published in J. Phys. Soc. Jp

Network properties of written human language

We investigate the nature of written human language within the framework of complex network theory. In particular, we analyse the topology of Orwell's \textit{1984} focusing on the local properties of the network, such as the properties of the nearest neighbors and the clustering coefficient. We find a composite power law behavior for both the average nearest neighbor's degree and average clustering coefficient as a function of the vertex degree. This implies the existence of different functional classes of vertices. Furthermore we find that the second order vertex correlations are an essential component of the network architecture. To model our empirical results we extend a previously introduced model for language due to Dorogovtsev and Mendes. We propose an accelerated growing network model that contains three growth mechanisms: linear preferential attachment, local preferential attachment and the random growth of a pre-determined small finite subset of initial vertices. We find that with these elementary stochastic rules we are able to produce a network showing syntactic-like structures

One Table to Count Them All: Parallel Frequency Estimation on Single-Board Computers

Sketches are probabilistic data structures that can provide approximate results within mathematically proven error bounds while using orders of magnitude less memory than traditional approaches. They are tailored for streaming data analysis on architectures even with limited memory such as single-board computers that are widely exploited for IoT and edge computing. Since these devices offer multiple cores, with efficient parallel sketching schemes, they are able to manage high volumes of data streams. However, since their caches are relatively small, a careful parallelization is required. In this work, we focus on the frequency estimation problem and evaluate the performance of a high-end server, a 4-core Raspberry Pi and an 8-core Odroid. As a sketch, we employed the widely used Count-Min Sketch. To hash the stream in parallel and in a cache-friendly way, we applied a novel tabulation approach and rearranged the auxiliary tables into a single one. To parallelize the process with performance, we modified the workflow and applied a form of buffering between hash computations and sketch updates. Today, many single-board computers have heterogeneous processors in which slow and fast cores are equipped together. To utilize all these cores to their full potential, we proposed a dynamic load-balancing mechanism which significantly increased the performance of frequency estimation.Comment: 12 pages, 4 figures, 3 algorithms, 1 table, submitted to EuroPar'1

Excitation of the auroral green line by dissociative recombination of O plus over 2 - Analysis of two rocket experiments

Excitation of auroral green line by dissociative recombination of oxygen ion

Time-Varying Priority Queuing Models for Human Dynamics

Queuing models provide insight into the temporal inhomogeneity of human dynamics, characterized by the broad distribution of waiting times of individuals performing tasks. We study the queuing model of an agent trying to execute a task of interest, the priority of which may vary with time due to the agent's "state of mind." However, its execution is disrupted by other tasks of random priorities. By considering the priority of the task of interest either decreasing or increasing algebraically in time, we analytically obtain and numerically confirm the bimodal and unimodal waiting time distributions with power-law decaying tails, respectively. These results are also compared to the updating time distribution of papers in the arXiv.org and the processing time distribution of papers in Physical Review journals. Our analysis helps to understand human task execution in a more realistic scenario.Comment: 8 pages, 6 figure

Zipf's law in Nuclear Multifragmentation and Percolation Theory

We investigate the average sizes of the $n$ largest fragments in nuclear multifragmentation events near the critical point of the nuclear matter phase diagram. We perform analytic calculations employing Poisson statistics as well as Monte Carlo simulations of the percolation type. We find that previous claims of manifestations of Zipf's Law in the rank-ordered fragment size distributions are not born out in our result, neither in finite nor infinite systems. Instead, we find that Zipf-Mandelbrot distributions are needed to describe the results, and we show how one can derive them in the infinite size limit. However, we agree with previous authors that the investigation of rank-ordered fragment size distributions is an alternative way to look for the critical point in the nuclear matter diagram.Comment: 8 pages, 11 figures, submitted to PR

Interacting Individuals Leading to Zipf's Law

We present a general approach to explain the Zipf's law of city distribution. If the simplest interaction (pairwise) is assumed, individuals tend to form cities in agreement with the well-known statisticsComment: 4 pages 2 figure