Reconstruction in time-warped weighted shift-invariant spaces with application to spline subspaces.
Using the techniques of approximation and factorization of convolution operators we study the problem of irregular sampling of band-limited functions on a locally compact Abelian group . The results of this paper relate to earlier work by Feichtinger and Gröchenig in a similar way as Kluvánek’s work published in 1969 relates to the classical Shannon Sampling Theorem. Generally speaking we claim that reconstruction is possible as long as there is sufficient high sampling density. Moreover, the iterative...
Criteria of recursive differentiability of quasigroups are given. Complete recursive codes which attains the Joshibound are constructed using recursively differentiable -ary quasigroups.
Two methods are proposed targeted at reduction in the number of look-up table elements in logic circuits of compositional microprogram control units (CMCUs) with code sharing. The methods assume the application of field-programmable gate arrays for the implementation of the combinational part of the CMCU, whereas embedded-memory blocks are used for implementation of its control memory. Both methods are based on the existence of classes of pseudoequivalent operational linear chains in a microprogram...
In this paper we give a refinement of Jensen’s integral inequality and its generalization for linear functionals. We also present some applications in Information Theory.
A survey of local image contrast measures is presented and a new contrast measure for measuring the local contrast of regions of interest is proposed. The measures validation is based on the gradual objective contrast decreasing on medical test images in both grayscale and color. The performance of the eleven most frequented contrast measures is mutually compared and their robustness to different types of image degradation is analyzed. Since the contrast measures can be both global, regional and...
In this study, we are concerned with a two-objective development of information granules completed on a basis of numeric data. The first goal of this design concerns revealing and representing a structure in a data set. As such it is very much oriented towards coping with the underlying it relational aspects of the experimental data. The second goal deals with a formation of a mapping between information granules constructed in two spaces (thus it concentrates on the it directional aspect of information...
The problem of energy transfer in an -ladder network is considered. Using the maximum principle, an algorithm for constructing optimal control is proposed, where the cost function is the energy delivered to the network. In the case considered, optimal control exists. Numerical simulations were performed using Matlab.