Results 11 to 20 of about 595,374 (265)
The weighted words collector [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We consider the word collector problem, i.e. the expected number of calls to a random weighted generator before all the words of a given length in a language are generated. The originality of this instance of the non-uniform coupon collector lies in the,
Jérémie Du Boisberranger +2 more
doaj +1 more source
Mathematics, 2020 The capacity is a powerful tool with exponential coefficients to represent the interaction phenomenon among decision criteria, but its random generation becomes a tough issue for dealing with the monotonicity with all inclusion subsets as well as the ...
Li Huang, Jian-Zhang Wu, Rui-Jie Xi
doaj +1 more source
Images Encryption Using Chaos and Random Generation [PDF]
Engineering and Technology Journal, 2016 Due to the network and multimedia application development information security become important since information can be attacked over the transmission channels and the combination of cryptography and chaotic become important filed of information ...
Yossra Hussain Ail, Zahraa A.H. Alobaidy
doaj +1 more source
Journal of Telecommunications and Information Technology, 2003 Bent functions, having the highest possible nonlinearity, are among the best candidates for construction of S-boxes. One problem with bent functions is the fact that they are hard to find among randomly generated set of Boolean functions already for 6 ...
Anna Grocholewska-Czuryło
doaj +1 more source
Reflecting on Random Generation
Proceedings of the ACM on Programming Languages, 2023 Expert users of property-based testing often labor to craft random generators that encode detailed knowledge about what it means for a test input to be valid and interesting. Fortunately, the fruits of this labor can also be put to other uses. In the bidirectional programming literature, for example, generators have been repurposed as validity checkers,
Harrison Goldstein +3 more
openaire +2 more sources
A new generation tree for permutations, preserving the number of fixed points [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 We describe a new uniform generation tree for permutations with the specific property that, for most permutations, all of their descendants in the generation tree have the same number of fixed points.
Philippe Duchon, Romaric Duvignau
doaj +1 more source
Discrete Mathematics & Theoretical Computer Science, 2007 Let a and b be two positive integers. A culminating path is a path of Z^2 that starts from (0,0), consists of steps (1,a) and (1,-b), stays above the x-axis and ends at the highest ordinate it ever reaches.
Mireille Bousquet-Mélou, Yann Ponty
doaj +1 more source
Holonomic equations and efficient random generation of binary trees [PDF]
Discrete Mathematics & Theoretical Computer ScienceHolonomic equations are recursive equations which allow computing efficiently numbers of combinatoric objects. Rémy showed that the holonomic equation associated with binary trees yields an efficient linear random generator of binary trees.
Pierre Lescanne
doaj +1 more source
Frontiers in Psychology, 2014 We investigate the number preferences of children and adults when generating random digit sequences. Previous research has shown convincingly that adults prefer smaller numbers when randomly choosing between responses 1-6.
John Nicholas Towse +2 more
doaj +1 more source
Multiplexed Quantum Random Number Generation [PDF]
Quantum, 2019 Fast secure random number generation is essential for high-speed encrypted communication, and is the backbone of information security. Generation of truly random numbers depends on the intrinsic randomness of the process used and is usually limited by ...
Ben Haylock +4 more
doaj +1 more source