Results 31 to 40 of about 76,162 (262)
Perceptual accessible image encryption scheme conjugating multiple chaotic maps
IET Image Processing, 2020 In the recent decade, chaos‐based image encryption algorithms gained attention due to their pros and cons. The authors suggest one such algorithm of image encryption for different colour space using feed forward initial condition to pursue random ...
Ram Chandra Barik, Suvamoy Changder
doaj +1 more source
Measuring the complexity of securities’ time series in VN30 index: A permutation entropy approach
Tạp chí Khoa học Đại học Mở Thành phố Hồ Chí Minh - Kinh tế và Quản trị kinh doanh, 2020 The paper applies the Bandt and Pompe (2002) method to measure the complexity of daily close price and daily return of VN30’s stocks during the period from January 2000 to August 2018.
Trần Thị Tuấn Anh
doaj +1 more source
In-place random list permutations [PDF]
Information Processing Letters, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wen-Ping Hwang, Ching-Lin Wang
openaire +1 more source
Spherically symmetric random permutations
Random Structures & Algorithms, 2019 We consider random permutations which are spherically symmetric with respect to a metric on the symmetric group Sn and are consistent as n varies. The extreme infinitely spherically symmetric permutation‐valued processes are identified for the Hamming, Kendall‐tau and Cayley metrics. The proofs in all three cases are based on a unified approach through
Gnedin, Alexander, Gorin, Vadim
openaire +6 more sources
MCPerm: a Monte Carlo permutation method for accurately correcting the multiple testing in a meta-analysis of genetic association studies. [PDF]
PLoS ONE, 2014 Traditional permutation (TradPerm) tests are usually considered the gold standard for multiple testing corrections. However, they can be difficult to complete for the meta-analyses of genetic association studies based on multiple single nucleotide ...
Yongshuai Jiang +9 more
doaj +1 more source
Generating a random cyclic permutation [PDF]
BIT, 1988 We prove correct an algorithm that, given \(n>0\), stores in array b[0..n- 1] a random cyclic permutation of the integers in 0..n-1, with each cyclic permutation having equal probability of being stored in b. The algorithm was developed by Sattolo; our contribution is to present a more convincing proof using standard program-proving methods.
David Gries, Jinyun Xue
openaire +2 more sources
Probability problems on random permutation
Tongxin xuebao, 2006 Based on selecting permutations on 0,1,…n?1randomly,a probability model were built.In sense of selecting permutations randomly,the distribution of distance which was between one point and its neighbor in Zn（called distance for short）and the mathematic ...
ZHANG Zhi-qiang +2 more
doaj +2 more sources
Random permutations and Brownian motion [PDF]
Pacific Journal of Mathematics, 1985 Let \(X_{ns}=X_{ns}(\sigma)\) denote the random number of cycles of length s in the permutation \(\sigma\) of a set \(\{\) 1,2,...,n\(\}\) selected randomly according to the uniform distribution and let \(Y_ n(t)=(\sum_{1\leq s\leq n^ t}X_{ns}-t \ln n)/\ln^{1/2} n\), \(0\leq t\leq 1\). The main theorem of the paper states that for each functional f: D\(
DeLaurentis, J. M., Pittel, B. G.
openaire +3 more sources
Improved security analysis of PMAC
Journal of Mathematical Cryptology, 2008 In this paper we provide a simple, concrete and improved security analysis of Parallelizable Message Authentication Code or PMAC. In particular, we show that the advantage of any distinguisher at distinguishing PMAC from a random function is at most ...
Nandi Mridul, Mandal Avradip
doaj +1 more source
The permutation class Av(4213,2143) [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 We determine the structure of permutations avoiding the patterns 4213 and 2143. Each such permutation consists of the skew sum of a sequence of plane trees, together with an increasing sequence of points above and an increasing sequence of points to its ...
David Bevan
doaj +1 more source