199 research outputs found

    Capital process and optimality properties of a Bayesian Skeptic in coin-tossing games

    Full text link
    We study capital process behavior in the fair-coin game and biased-coin games in the framework of the game-theoretic probability of Shafer and Vovk (2001). We show that if Skeptic uses a Bayesian strategy with a beta prior, the capital process is lucidly expressed in terms of the past average of Reality's moves. From this it is proved that the Skeptic's Bayesian strategy weakly forces the strong law of large numbers (SLLN) with the convergence rate of O(\sqrt{\log n/n})$ and if Reality violates SLLN then the exponential growth rate of the capital process is very accurately described in terms of the Kullback divergence between the average of Reality's moves when she violates SLLN and the average when she observes SLLN. We also investigate optimality properties associated with Bayesian strategy

    Contribution of diet to the composition of the human gut microbiota

    Get PDF
    This paper is part of the Proceedings from the 2013 ENGIHR Conference in Valencia, Spain. More papers from this supplement can be found at http://www.microbecolhealthdis.net Microbial Ecology in Health & Disease 2015. © 2015 Daniela Graf et al. This is an Open Access article distributed under the terms of the Creative Commons Attribution-Noncommercial 3.0 Unported License (http://creativecommons.org/licenses/by-nc/3.0/), permitting all non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited. ACKNOWLEDGEMENTS The authors acknowledge the support of the European Science Foundation (ESF), in the framework of the Research Networking Programe, The European Network for Gastrointestinal Health Research.Peer reviewedPublisher PD

    NEW HIDING TECHNIQUE IN DIGITAL SIGNATURE BASED ON ZIGZAG TRANSFORM AND CHAOTIC MAPS

    Get PDF
    Abstract This paper presents a novel approach to digital signature by integrating the ElGamal or Schnorr digital signature algorithms, chaotic systems, and scanning techniques. Briefly, ZZBCRP is a zigzag transformation that is used firstly to construct a permuted transaction, which technique starts from any random position and intersects in both directions, which is more complex than zigzag transform techniques. Then using ElGamal or Schnorr signature schemes based on chaotic maps. This modification aims to make private key and random number dependent on discrete chaotic maps. Even if the private key chosen is small, it is easy by using the huge amount of points in chaotic maps 2-D or 3-D to extract strong and unique key. This change complicates the relationship between the private key, public key and the transaction signature. A two-dimensional trigonometric discrete chaotic map is used that integrated Logistic-sine-cosine maps, and a three-dimensional hyperchaotic map (3-D SCC) which are based on a sine map. Our performance analysis shows that compared to schemes; this scheme not only improves the level of efficiency but also assures safety. The performance analysis shows that our scheme is not only more efficient compared to other related systems, but also safer

    Une brÚve introduction à la théorie effective de l'aléatoire

    Get PDF
    National audienceCet article est une introduction à théorie algorithmique de l'aléatoire et de la complexité de Kolmogorov

    APLIKASI SIMULASI AUTENTIKASI DATA MENGGUNAKAN METODE SCHNORR AUTHENTICATION DAN DIGITAL SIGNATURE SCHEME

    Get PDF
    Pada situasi kurangnya memahami dan mempelajari kerja metode Schnorr Authentication dan Digital Signature Scheme maka diperlukan suatu alat bantu yang dapat mensimulasikan atau menggambarkan proses Autentikasi data. Metode Schnorr Authentication dan Digital Signature Scheme adalah suatu metode yang menerangkan tentang bagaimana mengidentifikasi dan menjamin integritas sumber dari sebuah pesan oleh masing – masing pihak yang saling berkomunikasi. Metode Schnorr Authentication dan Digital Signature Scheme menggunakan bilangan prima dan perpangkatan modulo dalam proses pembentukan kunci, sedangkan proses pembentukan Kunci Privat dan Publik menggunakan Skema Otentikasi yang ditambahkan dengan sebuah fungsi Hash. Dalam simulasi autentikasi data dilakukan oleh 2 orang pengguna yaitu pengirim dan penerima. Proses simulasi antara pengirim dan penerima dilakukan dengan 3 proses yaitu proses Pembentukan Kunci, Autentikasi, dan Tanda Tangan Digital. Dari hasil pengujian aplikasi simulasi dapat membantu pemahaman terhadap pemahaman Metode Schnorr Authentication dan Digital Signature Scheme. Aplikasi simulasi dapat digunakan untuk mendukung kegiatan belajar mengajar, terutama dalam mata kuliah kriptografi. Kata kunci : Authentication, Digital signature, Metode schnor

    From Marvels of Nature to Inmates of Asylums: Imaginations of Natural Folly

    Get PDF
    In medieval and Renaissance times European courts kept fools, who were placed into one of two categories: artificial fools (or jesters) and natural fools. The present study examines natural fools. Extant studies generally treat natural fools as both mentally and physically ill and/or disabled. This study contributes to the discussion of natural folly by examining two sources about the Ernestinian Saxon court fool Claus Narr. According to the documents natural fools were seen as permanently mentally changed people and classified as so-called "wonder men." Therefore they were kept and collected at courts. When permanent mental difference and psychiatric disease amalgamated at the beginning of the 18th century, however, the natural fool became an object of education and medicine. This paper argues that the changing meaning of the natural fool nevertheless retained components of its initial medieval conception

    The invertibility of the XOR of rotations of a binary word

    Get PDF
    We prove the following result regarding operations on a binary word whose length is a power of two: computing the exclusive-or of a number of rotated versions of the word is an invertible (one-to-one) operation if and only if the number of versions combined is odd. (This result is not new; there is at least one earlier proof, due to Thomsen [Cryptographic hash functions, PhD thesis, Technical University of Denmark, 28 November 2008]. Our proof may be new.
    • 

    corecore