A preliminary analysis of low-energy e+e− collision data produced via initial state radiation (ISR) has been performed using 22f b−1 of BaBar data. The selection of data samples corresponding to the μ+μ−, π+π−, K+K−, pp̄, K+K−π0, 3π , 4π , 5π , 6π , 7π final states accompanied by the emitted ISR hard photon has been demonstrated. The invariant mass of the hadronic final state defines the effecti...

Let SCRc = {σ ∈ 2n : K(σ) ≥ n + K(n) − c}, where K denotes prefix-free Kolmogorov complexity. These are the strings with essentially maximal prefix-free complexity. We prove that SCRc is not a Π1 set for sufficiently large c. This implies Solovay’s result that strings with maximal plain Kolmogorov complexity need not have maximal prefix-free Kolmogorov complexity, even up to a constant. We show...

This paper continues the study of gaps in sequences of geometrically distributed random variables, as started by Hitczenko and Knopfmacher [9], who concentrated on sequences which were gap-free. Now we allow gaps, and count some related parameters. Our notation of gaps just means empty “urns” (within the range of occupied urns). This might be called weak gaps, as opposed to maximal gaps, as in ...

A biclique is a maximal bipartite complete induced subgraph of G. Bicliques have been studied in the last years motivated by the large number of applications. In particular, enumeration of the maximal bicliques has been of interest in data analysis. Associated with this issue, bounds on the maximum number of bicliques were given. In this paper we study bounds on the minimun number of bicliques ...

This chapter describes methods to increase the accuracy of mathematical handwriting analysis by using context information. Our approach is based on the assumption that likely expression continuations can be derived from a database of mathematical expressions and then can be used to rank the candidates of isolated symbol recognition. We present how predicted continuations for an expressions are ...

In this paper, we describe an approach to modelling contextaware systems starting on the knowledge level. We make use of ideas from Activity Theory to structure the general context model and to assess empirical data. We further on describe how the data-driven and the model-driven aspects of our approach are combined into a single knowledge model. We outline the design of an empirical study cond...

We consider the goodness of fit testing problem for ergodic diffusion processes. The basic hypothesis is supposed to be simple. The diffusion coefficient is known and the alternatives are described by the different trend coefficients. We study the asymptotic distribution of the Cramer-von Mises type tests based on the empirical distribution function and local time estimator of the invariant den...

As for any model/theory, a probabilistic seismic hazard analysis (PSHA) model is best tested by comparing its predictions with observations that are independent, e.g. which have not been used for creating the model. Arguably, the most valuable information in the context of seismic hazard analysis is information on long-term hazard, namely maximum intensities (or magnitudes) occuring over time i...

We show that any concurrent program that is amenable to compositional reasoning can be effectively translated to a sequential program. More precisely, we give a reduction from the verification problem for concurrent programs against safety specifications to the verification of sequential programs against safety specifications, where the reduction is parameterized by a set of auxiliary variables...

The scale-fee networks, having connectivity distribution P (k) ∼ k−α (where k is the site connectivity), is very resilient to random failures but fragile to intentional attack. The purpose of this paper is to find the network design guideline which can make the robustness of the network to both random failures and intentional attack maximum while keeping the average connectivity < k > per node ...