Intersections of -ary perfect codes.
Invariance groups of finite functions and orbit equivalence of permutation groups
Which subgroups of the symmetric group Sn arise as invariance groups of n-variable functions defined on a k-element domain? It appears that the higher the difference n-k, the more difficult it is to answer this question. For k ≤ n, the answer is easy: all subgroups of Sn are invariance groups. We give a complete answer in the cases k = n-1 and k = n-2, and we also give a partial answer in the general case: we describe invariance groups when n is much larger than n-k. The proof utilizes Galois connections...
Invariant resistive networks in Euclidean spaces and their relation to geometry
Geometric properties of finite systems of homogeneous resistive wire segments in a Euclidean -space are studied in the case that the absorption of energy of such a system in an arbitrary linear electrical field is invariant under any orthogonal transformation of the system.
Inverse problem for networks of laser interferometers
Estimation of the parameters of the gravitational-wave signal from a coalescing binary by a network of laser interferometers is considered. A generalization of the solution of the inverse problem found previously for the network of 3 detectors to the network of N detectors is given. Maximum likelihood and least squares estimators are applied to obtain the solution. Accuracy of the estimation of the parameters is assessed from the inverse of the Fisher information matrix. The results of the Monte...
Inversion of square matrices in processors with limited calculation abillities
An iterative inversion algorithm for a class of square matrices is derived and tested. The inverted matrix can be defined over both real and complex fields. This algorithm is based only on the operations of addition and multiplication. The numerics of the algorithm can cope with a short number representation and therefore can be very useful in the case of processors with limited possibilities, like different neuro-computers and accelerator cards. The quality of inversion can be traced and tested....
Irrationality and codes.
Irregular Sampling and the Inverse Spectral Problem.
Irregular Sampling in Wavelet Subspaces.
Isomorphism of measure preserving transformations
Isosceles sets.
Iterates of Volterra operators and indeterminate forms.
Iterative Reconstructions in Irregular Sampling With Derivates.
Iterative sinc-convolution method for solving radiosity equation in computer graphics.
Joint queue-perturbed and weakly coupled power control for wireless backbone networks
Wireless Backbone Networks (WBNs) equipped with Multi-Radio Multi-Channel (MRMC) configurations do experience power control problems such as the inter-channel and co-channel interference, high energy consumption at multiple queues and unscalable network connectivity. Such network problems can be conveniently modelled using the theory of queue perturbation in the multiple queue systems and also as a weak coupling in a multiple channel wireless network. Consequently, this paper proposes a queue perturbation...
Joint Range of Rényi entropies
The exact range of the joined values of several Rényi entropies is determined. The method is based on topology with special emphasis on the orientation of the objects studied. Like in the case when only two orders of the Rényi entropies are studied, one can parametrize the boundary of the range. An explicit formula for a tight upper or lower bound for one order of entropy in terms of another order of entropy cannot be given.
K teorii telegrafního přenosu
K3M: a universal algorithm for image skeletonization and a review of thinning techniques
This paper aims at three aspects closely related to each other: first, it presents the state of the art in the area of thinning methodologies, by giving descriptions of general ideas of the most significant algorithms with a comparison between them. Secondly, it proposes a new thinning algorithm that presents interesting properties in terms of processing quality and algorithm clarity, enriched with examples. Thirdly, the work considers parallelization issues for intrinsically sequential algorithms...
Konische Codes auf eigenen Überdeckungskurven.
Konvergenzverhalten der konjugierten Shannonschen Abtastreihe
Kouzlo Fibonacciho kódování