Results 221 to 230 of about 708,407 (265)
Some of the next articles are maybe not open access.
On the Uniformity of Distribution of the ElGamal Signature
Applicable Algebra in Engineering, Communication and Computing, 2002We show that, under some natural conditions, the pairs \((r,s)\) produced by the ElGamal signature scheme are uniformly distributed. In particular this implies that values of \(r\) and \(s\) are not correlated. The result is based on some new estimates of exponential sums.
openaire +1 more source
CORRELATIONS AND CHARACTERIZATIONS OF THE UNIFORM DISTRIBUTION
Australian Journal of Statistics, 1986SummaryTwo characterizations of the uniform distribution on a suitable compact space are proved. These characterizations are applied to a number of particular examples of which the most interesting is the following: if X, Y and Z are independent n‐vectors whose components are independent and identically distributed within a vector, then the pairwise ...
Brown, Timothy C. +2 more
openaire +1 more source
Uniform distribution and Voronoĭ convergence
Sbornik: Mathematics, 2005Udgivelsesdato: SEP ...
Kozlov, V.V., Madsen, Tatiana Kozlova
openaire +2 more sources
Distributional Chaos on Uniform Spaces
Qualitative Theory of Dynamical Systems, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sejal Shah, Tarun Das, Ruchi Das
openaire +2 more sources
A theorem on uniform distribution
1963Es sei \(\{I_j\}^\infty_{j=1}\) eine Folge von paarweise elementfremden Intervallen \(I_j = (x_j,y_j)\) derart, daß \(0 \leq x_1 < y_1 < x_2 < y_2 < \cdots\) und \(\lim_{j \to \infty} x_j = \infty\) gilt. Für \(Z>0\) sei \(I(Z)\) das Lebesguesche Maß der Punktmenge \(\cup_{j=1}^{\infty} I_j \cap (0,Z)\). Für \(\alpha > 0\) und für jede natürliche Zahl \
Davenport, H., Erdős, P.
openaire +1 more source
The Uniform Distribution as a Universal Prior
IEEE Transactions on Information Theory, 2004In this correspondence, we discuss the properties of the uniform prior as a universal prior, i.e., a prior that induces a mutual information that is simultaneously close to the capacity for all channels. We determine bounds on the amount of the mutual information loss in using the uniform prior instead of the capacity-achieving prior. Specifically, for
Nadav Shulman, Meir Feder
openaire +1 more source
Uniform representations of bivariate distributions
Communications in Statistics, 1975This paper explores the representation of bivariate distributions in terms of their bivariate uniform trsnslates. It is shown that this natural rapresentation in terms of bivariate distributions whose marginals are uniform allows us to study easily cartain properties of bivariate distributions.
Kimeldorf, George, Sampson, Allan
openaire +1 more source
1998
Abstract Definitions. The sequence α,b and normal numbers. Uniform distribution and Riemann integration. Koksma’s inequality. Fourier analysis. The Erdős-Turán theorem and the Wey/ criterion. The sequence nα. Very slowly growing sequences. Metrical theory.
openaire +2 more sources
Abstract Definitions. The sequence α,b and normal numbers. Uniform distribution and Riemann integration. Koksma’s inequality. Fourier analysis. The Erdős-Turán theorem and the Wey/ criterion. The sequence nα. Very slowly growing sequences. Metrical theory.
openaire +2 more sources
Uniform Distribution in Model Sets
Canadian Mathematical Bulletin, 2002AbstractWe give a new measure-theoretical proof of the uniform distribution property of points in model sets (cut and project sets). Each model set comes as a member of a family of related model sets, obtained by joint translation in its ambient (the ‘physical’) space and its internal space. We prove, assuming only that the window defining themodel set
openaire +1 more source
On the Uniform Distribution of Strings.
2008In this paper, we propose the definition of a measure for sets of strings, over a finite alphabet, that have a length not greater than a given number. This measure leads to an instanciation of the uniform distribution definition in sets of such limited-size strings, for which we provide a linear time complexity generative algorithm.Some ideas could ...
Rebecchi, Sébastien +1 more
openaire +2 more sources

