Random functions

Xem 1-20 trên 95 kết quả Random functions
  • Tuyển tập các báo cáo nghiên cứu khoa học ngành toán học tạp chí toán học quốc tế đề tài: Compositions of Random Functions on a Finite Set...

    pdf7p thulanh4 11-09-2011 23 2   Download

  • In this paper we solve this open problem and show that the Feistel construction with 6 rounds is enough to obtain an ideal cipher; we also show that 5 rounds are insufficient by providing a simple attack. This contrasts with the classical Luby-Rackoff result that 4 rounds are necessary and sufficient to obtain a (strong)pseudo-random permutation from a pseudo-random function.

    pdf26p tai_lieu2014 11-04-2014 10 0   Download

  • This chapter is of an introductory nature, its purpose being to indicate some concepts and results from the theory of probability which are used in later chapters . Most of these are contained in Chapters 1-9 of Gnedenko [47], and will therefore be cited without proof. The first section is somewhat isolated, and contains a series of results from the foundations of the theory of probability. A detailed account may be found in [76], or in Chapter I of [31] . Some of these will not be needed in the first part of the book, in which attention is confined to independent random variables ....

    pdf0p denngudo 21-06-2012 33 5   Download

  • We take a critical look at the relationship between the security of cryptographic schemes in the Random Oracle Model, and the security of the schemes that result from implementing the random oracle by so called \cryptographic hash functions". The main result of this paper is a negative one: There exist signature and encryption schemes that are secure in the Random Oracle Model, but for which any implementation of the random oracle results in insecure schemes.

    pdf37p tai_lieu2014 11-04-2014 27 4   Download

  • Tham khảo sách 'probability examples c-3 random variables ii', khoa học tự nhiên, toán học phục vụ nhu cầu học tập, nghiên cứu và làm việc hiệu quả

    pdf116p sn_buon 29-11-2012 28 3   Download

  • Tham khảo sách 'probability examples c-4 random variables iii', khoa học tự nhiên, toán học phục vụ nhu cầu học tập, nghiên cứu và làm việc hiệu quả

    pdf113p sn_buon 29-11-2012 30 3   Download

  • In this paper, we explore the power of randomized algorithm to address the challenge of working with very large amounts of data. We apply these algorithms to generate noun similarity lists from 70 million pages. We reduce the running time from quadratic to practically linear in the number of elements to be computed.

    pdf8p bunbo_1 17-04-2013 21 2   Download

  • Functions are "the central objects of investigation" in most fields of modern mathematics. There are many ways to describe or represent a function. Some functions may be defined by a formula or algorithm that tells how to compute the output for a given input. Others are given by a picture, called the graph of the function.

    ppt92p sakuraphuong 04-06-2013 20 2   Download

  • Chương 3 gồm có những nội dung chính sau: Program components in C++, math library functions, functions, function definitions, function prototypes, header files, random number generation, example: a game of chance and introducing enum, storage classes, scope rules, recursion, example using recursion: the fibonacci series, recursion vs. iteration, functions with empty parameter lists.

    pdf78p tangtuy14 03-06-2016 19 2   Download

  • Let us consider the composed random variable η = k=1 ξk , where ξ1 , ξ2 , ... are independent identically distributed random variables and ν is a positive value random, independent of all ξk . In [1] and [2], we gave some the stabilities of the distribution function of η in the following sense: the small changes in the distribution function of ξ k only lead to the small changes in the distribution function of η. In the paper, we investigate the distribution function of η when we have the small changes of the distribution of ν. ...

    pdf6p tuanlocmuido 19-12-2012 22 1   Download

  • We propose a succinct randomized language model which employs a perfect hash function to encode fingerprints of n-grams and their associated probabilities, backoff weights, or other parameters. The scheme can represent any standard n-gram model and is easily combined with existing model reduction techniques such as entropy-pruning. We demonstrate the space-savings of the scheme via machine translation experiments within a distributed language modeling framework. h

    pdf9p hongphan_1 15-04-2013 25 1   Download

  • This paper proposes a framework for training Conditional Random Fields (CRFs) to optimize multivariate evaluation measures, including non-linear measures such as F-score. Our proposed framework is derived from an error minimization approach that provides a simple solution for directly optimizing any evaluation measure. Specifically focusing on sequential segmentation tasks, i.e. text chunking and named entity recognition, we introduce a loss function that closely reflects the target evaluation measure for these tasks, namely, segmentation F-score. ...

    pdf8p hongvang_1 16-04-2013 23 1   Download

  • Lecture Programming in C++ - Chapter 7: Functions. On completion of this chapter students will know how to: Define and call functions, determine the scope of a variable, pass values by reference, overload functions, create random numbers.

    ppt30p nhanmotchut_3 19-10-2016 9 1   Download

  • This is the standard textbook for courses on probability and statistics, not substantially updated. While helping students to develop their problem-solving skills, the author motivates students with practical applications from various areas of ECE that demonstrate the relevance of probability theory to engineering practice. Included are chapter overviews, summaries, checklists of important terms, annotated references, and a wide selection of fully worked-out real-world examples.

    pdf0p hiepkhach_1006 10-09-2013 87 17   Download

  • This is the third in a series of short books on probability theory and random processes for biomedical engineers. This book focuses on standard probability distributions commonly encountered in biomedical engineering. The exponential, Poisson and Gaussian distributions are introduced, as well as important approximations to the Bernoulli PMF and Gaussian CDF. Many important properties of jointly Gaussian random variables are presented. The primary subjects of the final chapter are methods for determining the probability distribution of a function of a random variable.

    pdf109p chuyenphimbuon 21-07-2012 58 16   Download

  • Strengthening functioning systems to improve health outcomes will, in some cases, require new ways of thinking about health investments and greater dialogue with partner countries about constraints and opportunities.

    pdf8p le_minh_nha 20-12-2012 32 15   Download

  • Chapter 2 STABLE DISTRIBUTIONS ; ANALYTICAL PROPERTIES AND DOMAINS OF ATTRACTION § 1. Stable distributions Definition . A distribution function F is called stable if, for any a 1 , a2 0 and any b1 , b2 , there exist constants a 0 and b such that F(a l x+b l ) * F(a 2 x+b2) = F(ax+b) . (2.1 .1)

    pdf57p dalatngaymua 30-09-2010 56 8   Download

  • Chapter 5 LIMIT THEOREMS IN Lp SPACES § 1 . Statement of the problem Consider the sequence X1 , X2 , . . . of independent random variables with the same distribution F. If F belongs to the domain of attraction of a stable law G« with exponent a, then the distribution functions Fn of the normalised sums Zn = (X1 + X2+ . . . + Xn - An)/Bn satisfy lim Fn (x) = G a (x)

    pdf15p dalatngaymua 30-09-2010 42 8   Download

  • Chapter 11 NARROW ZONES OF NORMAL ATTRACTION 1 . Classification of narrow zones by the function h We retain the notation of the last two chapters, and record here some new terminology. The narrow zones [0, A (n)] and [ -A (n), 0], where A (n) is continuous and increasing and A (n) = o (n b),

    pdf28p dalatngaymua 30-09-2010 101 8   Download

  • Chapter 14 INTEGRAL THEOREMS HOLDING ON THE WHOLE LINE 1 . Formulation In the preceding chapters we have studied theorems of a collective type concerning large deviations in zones of the form [0, 0 (n)] and [ - (n), 0], where 0 (n) = o (n 2) . The role of the linear functionals a j, bj was played by moments of the random variables XX .

    pdf13p dalatngaymua 30-09-2010 55 8   Download


Đồng bộ tài khoản