Displaying 361 – 380 of 961

Showing per page

Generalized information criteria for Bayes decisions

Domingo Morales, Igor Vajda (2012)

Kybernetika

This paper deals with Bayesian models given by statistical experiments and standard loss functions. Bayes probability of error and Bayes risk are estimated by means of classical and generalized information criteria applicable to the experiment. The accuracy of the estimation is studied. Among the information criteria studied in the paper is the class of posterior power entropies which include the Shannon entropy as special case for the power α = 1 . It is shown that the most accurate estimate is in this...

Generalized minimizers of convex integral functionals, Bregman distance, Pythagorean identities

Imre Csiszár, František Matúš (2012)

Kybernetika

Integral functionals based on convex normal integrands are minimized subject to finitely many moment constraints. The integrands are finite on the positive and infinite on the negative numbers, strictly convex but not necessarily differentiable. The minimization is viewed as a primal problem and studied together with a dual one in the framework of convex duality. The effective domain of the value function is described by a conic core, a modification of the earlier concept of convex core. Minimizers...

Generalized synchronization and control for incommensurate fractional unified chaotic system and applications in secure communication

Hongtao Liang, Zhen Wang, Zongmin Yue, Ronghui Lu (2012)

Kybernetika

A fractional differential controller for incommensurate fractional unified chaotic system is described and proved by using the Gershgorin circle theorem in this paper. Also, based on the idea of a nonlinear observer, a new method for generalized synchronization (GS) of this system is proposed. Furthermore, the GS technique is applied in secure communication (SC), and a chaotic masking system is designed. Finally, the proposed fractional differential controller, GS and chaotic masking scheme are...

Generating quasigroups for cryptographic applications

Czesław Kościelny (2002)

International Journal of Applied Mathematics and Computer Science

A method of generating a practically unlimited number of quasigroups of a (theoretically) arbitrary order using the computer algebra system Maple 7 is presented. This problem is crucial to cryptography and its solution permits to implement practical quasigroup-based endomorphic cryptosystems. The order of a quasigroup usually equals the number of characters of the alphabet used for recording both the plaintext and the ciphertext. From the practical viewpoint, the most important quasigroups are of...

GLS: New class of generalized Legendre sequences with optimal arithmetic cross-correlation

Huijuan WANG, Qiaoyan WEN, Jie ZHANG (2013)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

The Legendre symbol has been used to construct sequences with ideal cross-correlation, but it was never used in the arithmetic cross-correlation. In this paper, a new class of generalized Legendre sequences are described and analyzed with respect to their period, distributional, arithmetic cross-correlation and distinctness properties. This analysis gives a new approach to study the connection between the Legendre symbol and the arithmetic cross-correlation. In the end of this paper, possible application...

Gravitational waves from coalescing binaries: a hierarchical signal detection strategy

S. Mohanty, S. Dhurandhar (1997)

Banach Center Publications

The detection of gravitational waves from coalescing compact binaries would be a computationally intensive process if a single bank of template waveforms (i.e., a one step search) is used. We present, in this paper, an alternative method which is a hierarchical search strategy involving two template banks. We show that the computational power required by such a two step search, for an on-line detection of the one parameter family of Newtonian signals, is 1/8 of that required when an on-line one...

Grid and Simulation of Digital Communication Systems

Manev, Nikolai (2010)

Serdica Journal of Computing

The purpose of this paper is to turn researchers' attention to the use of grid computing for simulating digital communications and its large potential for decreasing significantly the duration of the experiments and for improving the statistical representativeness and reliability of the obtained results.* This work is partly supported by the National Science Fund of Bulgaria under Grant No. D002-146/16.12.2008.

Hermite functions and uncertainty principles for the Fourier and the windowed Fourier transforms.

Aline Bonami, Demange, Bruno, Jaming, Philippe (2003)

Revista Matemática Iberoamericana

We extend an uncertainty principle due to Beurling into a characterization of Hermite functions. More precisely, all functions f on Rd which may be written as P(x)exp(-(Ax,x)), with A a real symmetric definite positive matrix, are characterized by integrability conditions on the product f(x)f(y). We then obtain similar results for the windowed Fourier transform (also known, up to elementary changes of functions, as the radar ambiguity function or the Wigner transform). We complete the paper with...

Currently displaying 361 – 380 of 961