نتایج جستجو برای: permutation array
تعداد نتایج: 148491 فیلتر نتایج به سال:
MOTIVATION The parametric F-test has been widely used in the analysis of factorial microarray experiments to assess treatment effects. However, the normality assumption is often untenable for microarray experiments with small replications. Therefore, permutation-based methods are called for help to assess the statistical significance. The distribution of the F-statistics across all the genes on...
Let X = {Xij : 1 ≤ i, j ≤ n} be an n× n array of independent random variables where n ≥ 2. Let π be a uniform random permutation of {1,2, . . . , n}, independent of X, and let W =∑ni=1 Xiπ(i). Suppose X is standardized so that EW = 0,Var(W)= 1. We prove that the Kolmogorov distance between the distribution of W and the standard normal distribution is bounded by 451 ∑n i,j=1 E|Xij |3/n. Our appr...
In [1], the author provided a Gray code for the set of n-length permutations with a given number of left-to-right minima in inversion array representation. In this paper, we give the first Gray code for the set of n-length permutations with a given number of left-to-right minima in one-line representation. In this code, each permutation is transformed into its successor by a product with a tran...
Pattern of data access is independent of data values. • Server holds n items, encrypted. • Client has W = O(log n) working storage. • No Random-Oracles. • Best DO RAM simulation: O(log3 n) overhead [2]. • Using compressed-scanning: only O(log n) overhead. Compressed-Scanning In t rounds: • Read batch of Bin < W items from input. Each item of input read exactly once. Permutation π hides access p...
A permutation array(or code) of length n and distance d, denoted by (n, d) PA, is a set of permutations C from some fixed set of n elements such that the Hamming distance between distinct members x,y ∈ C is at least d. Let P (n, d) denote the maximum size of an (n, d) PA. New upper bounds on P (n, d) are given. For constant α, β satisfying certain conditions, whenever d = βn, the new upper boun...
In this paper, we present a novel framework of distributed microphone array for blind source separation (BSS), where stereo microphones or proximately-placed microphone pairs are distributed. Unlike distributing all microphones individually, the time difference of arrival (TDOA) in the paired channels can be robustly estimated without suffering spatial aliasing. Based on it, sound sources are s...
SUMMARY With the increasing availability of high-density methylation microarrays, there has been growing interest in analysis of DNA methylation data. We have developed CpGassoc, an R package that can efficiently perform the statistical analysis needed for increasingly large methylation datasets. CpGassoc is a modular, expandable package with functions to perform rapid analyses of DNA methylati...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید