19 research outputs found

    Random databases with correlated data

    Get PDF
    A model of random databases is given, with arbitrary correlations among the data of one individual. This is given by a joint distribution function. The individuals are chosen independently, their number m is considered to be (approximately) known. The probability of the event that a given functional dependency A → b holds (A is a set of attributes, b is an attribute) is determined in a limiting sense. This probability is small if m is much larger than and is large if m is much smaller than 2 H 2(A→b)/ 2 where H 2(A→b) is an entropy like functional of the probability distribution of the data. © 2012 Springer-Verlag Berlin Heidelberg

    On weak convergence of functionals on smooth random functions

    Get PDF
    The numbers of level crossings and extremes for random processes and fields play an important role in reliability theory and many engineering applications. In many cases for Gaussian processes the Poisson approximation for their asymptotic distributions is used. This paper extends an approach proposed in Rusakov and Seleznjev (1988) for smooth random processes on a finite interval. It turns out that a number of functionals (including some integervalued ones) become continuous on the space of smooth functions and weak convergence results for the sequences of such continuous functionals are applicable. Examples of such functionals for smooth random processes on infinite intervals and for random fields are studied

    Approach to Evaluating Characteristics of Multichannel Loss System with FCFD Preempted Priority Discipline

    Full text link
    In the paper we consider a multichannel loss preemptive priority system with a Poisson input and general service time distribution depending on the priority of job. Jobs of the same priority are preempted according with First Come First Displaced (FCFD) protocol. Approximate formulas are obtained for the loss probability of a prescribed priority job and some other characteristics of the system. It particular cases, the obtained formulas are exact.Comment: 6 pages, no figures. arXiv admin note: text overlap with arXiv:2206.0926

    Boundary non-crossing probabilities for fractional Brownian motion with trend

    Get PDF
    In this paper, we investigate the boundary non-crossing probabilities of a fractional Brownian motion considering some general deterministic trend function. We derive bounds for non-crossing probabilities and discuss the case of a large trend function. As a by-product, we solve a minimization problem related to the norm of the trend function

    Approximation of a random process with variable smoothness

    Get PDF
    This Festschrift in honour of Paul Deheuvels’ 65th birthday compiles recent research results in the area between mathematical statistics and probability theory with a special emphasis on limit theorems. The book brings together contributions from invited international experts to provide an up-to-date survey of the field. Written in textbook style, this collection of original material addresses researchers, PhD and advanced Master students with a solid grasp of mathematical statistics and probability theory

    On scrimshaw precursors: a 13th-century carved and engraved sperm whale tooth

    Get PDF
    In der einschlägigen Forschung zur Walfängervolkskunst des "Scrimshaw" - den seit den 1820er Jahren populär gewordenen Seemannsarbeiten speziell auf und aus Pottwal- und Walroßzahn, Barten und Walknochen - werden künstlerisch bearbeitete Gegenstände anderer Kulturen aus denselben Materialien als "Scrimshaw"-Vorläufer bezeichnet. Aus dem europäischen Mittelalter sind zwar zahlreiche Beispiele von Schnitzereien aus Walroßzahn und Walknochen bekannt, nicht jedoch aus Pottwalzahn, dem beinah stereotypen Werkstoff der "Scrimshander" des 19. und 20. Jahrhunderts. Der "Königsspiegel", ein um 1250/60 in Norwegen geschriebener pädagogischer Text, erwähnt gleichwohl Schnitzereien aus Pottwalzahn. Auch aus dem 16. und 17. Jahrhundert sind textliche Hinweise auf skandinavisches Kunstgewerbe aus den Zähnen dieses Meeressäugers bekannt. Im Anschluß an die Präsentation dieser Quellen wird ein konkretes Beispiel vorgestellt: Es handelt sich um ein beschnitztes und graviertes Salbenhorn aus Pottwalzahn, das sich in der Sammlung christlicher Kunst und Kultur des Museums der Universität Bergen, Norwegen, lnv. MA 437, befindet. Aus dem massiven Dentin wurde ein Greif herausgeschnitzt, der Ausguß wurde wie der Kopf eines gotischen Wasserspeiers gestaltet. Auf einer glatten Seitenfläche wurde später ein kleines Tondo mit Pflanzen- und Vogelmotiv eingraviert. Es trägt eine Inschrift, die vom Bergenser Museum als griechisch, hier aber als russisch identifiziert wurde, deren Sinn aber unklar bleibt. Anlass, die vom Museum vorgenommene Datierung des Zahns in das 13. Jahrhundert zu revidieren, besteht allerdings nicht

    Testing Functional Connection between Two Random Variables

    No full text

    Asymptotic properties of keys and functional dependencies in random databases

    Get PDF
    AbstractPractical database applications give the impression that sets of constraints are rather small and that large sets are unusual and are caused by bad design decisions. Theoretical investigations, however, show that minimal constraint sets are potentially very large. Their size can be estimated to be exponential in terms of the number of attributes. The gap between observation in practice and theory results in the rejection of theoretical results. However, practice is related to average cases and is not related to worst cases.The theory used until now considered the worst-case complexity. This paper aims to develop a theory for the average-case complexity. Several probabilistic models and asymptotics of corresponding probabilities are investigated for random databases formed by independent random tuples with a common discrete distribution. Poisson approximations are studied for the distributions of some characteristics for such databases where the number of tuples is sufficiently large. We intend to prove that the exponential complexity of key sets and sets of functional dependencies is rather unusual and almost all minimal keys in a relation have a length which depends mainly on the size of the relation
    corecore