Generalised filtering.
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 . It is shown that the most accurate estimate is in this...
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...
Schauder frames were introduced by Han and Larson [9] and further studied by Casazza, Dilworth, Odell, Schlumprecht and Zsak [2]. In this paper, we have introduced approximative Schauder frames as a generalization of Schauder frames and a characterization for approximative Schauder frames in Banach spaces in terms of sequence of non-zero endomorphism of finite rank has been given. Further, weak* and weak approximative Schauder frames in Banach spaces have been defined. Finally, it has been proved...
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...
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...