1,300 research outputs found

    Hospital Sector Reform in Estonia. Summary

    Get PDF

    Detecting Sockpuppets in Deceptive Opinion Spam

    Full text link
    This paper explores the problem of sockpuppet detection in deceptive opinion spam using authorship attribution and verification approaches. Two methods are explored. The first is a feature subsampling scheme that uses the KL-Divergence on stylistic language models of an author to find discriminative features. The second is a transduction scheme, spy induction that leverages the diversity of authors in the unlabeled test set by sending a set of spies (positive samples) from the training set to retrieve hidden samples in the unlabeled test set using nearest and farthest neighbors. Experiments using ground truth sockpuppet data show the effectiveness of the proposed schemes.Comment: 18 pages, Accepted at CICLing 2017, 18th International Conference on Intelligent Text Processing and Computational Linguistic

    Quasi regular concentric waves in heterogeneous lattices of coupled oscillators

    Full text link
    We study the pattern formation in a lattice of coupled phase oscillators with quenched disorder. In the synchronized regime concentric waves can arise, which are induced and increase in regularity by the disorder of the system. Maximal regularity is found at the edge of the synchronization regime. The emergence of the concentric waves is related to the symmetry breaking of the interaction function. An explanation of the numerically observed phenomena is given in a one-dimensional chain of coupled phase oscillators. Scaling properties, describing the target patterns are obtained.Comment: 4 pages, 3 figures, submitted to PR

    Genome-Wide Association Analysis and Genomic Prediction for Adult-Plant Resistance to Septoria Tritici Blotch and Powdery Mildew in Winter Wheat

    Get PDF
    Septoria tritici blotch (STB) caused by the fungal pathogen Zymoseptoria tritici and powdery mildew (PM) caused by Blumeria graminis f.sp tritici (Bgt) are among the forefront foliar diseases of wheat that lead to a significant loss of grain yield and quality. Resistance breeding aimed at developing varieties with inherent resistance to STB and PM diseases has been the most sustainable and environment-friendly approach. In this study, 175 winter wheat landraces and historical cultivars originated from the Nordic region were evaluated for adult-plant resistance (APR) to STB and PM in Denmark, Estonia, Lithuania, and Sweden. Genome-wide association study (GWAS) and genomic prediction (GP) were performed based on the adult-plant response to STB and PM in field conditions using 7,401 single-nucleotide polymorphism (SNP) markers generated by 20K SNP chip. Genotype-by-environment interaction was significant for both disease scores. GWAS detected stable and environment-specific quantitative trait locis (QTLs) on chromosomes 1A, 1B, 1D, 2B, 3B, 4A, 5A, 6A, and 6B for STB and 2A, 2D, 3A, 4B, 5A, 6B, 7A, and 7B for PM adult-plant disease resistance. GP accuracy was improved when assisted with QTL from GWAS as a fixed effect. The GWAS-assisted GP accuracy ranged within 0.53-0.75 and 0.36-0.83 for STB and PM, respectively, across the tested environments. This study highlights that landraces and historical cultivars are a valuable source of APR to STB and PM. Such germplasm could be used to identify and introgress novel resistance genes to modern breeding lines

    Algorithmic statistics: forty years later

    Full text link
    Algorithmic statistics has two different (and almost orthogonal) motivations. From the philosophical point of view, it tries to formalize how the statistics works and why some statistical models are better than others. After this notion of a "good model" is introduced, a natural question arises: it is possible that for some piece of data there is no good model? If yes, how often these bad ("non-stochastic") data appear "in real life"? Another, more technical motivation comes from algorithmic information theory. In this theory a notion of complexity of a finite object (=amount of information in this object) is introduced; it assigns to every object some number, called its algorithmic complexity (or Kolmogorov complexity). Algorithmic statistic provides a more fine-grained classification: for each finite object some curve is defined that characterizes its behavior. It turns out that several different definitions give (approximately) the same curve. In this survey we try to provide an exposition of the main results in the field (including full proofs for the most important ones), as well as some historical comments. We assume that the reader is familiar with the main notions of algorithmic information (Kolmogorov complexity) theory.Comment: Missing proofs adde
    corecore