-valuations of graphs
Baire classification and infinite perceptrons
Balanced Gray codes.
Balancing cyclic -ary Gray codes.
Balancing cyclic -ary Gray codes. II.
Basic equations for source coding with side information at the decoder and encoder
Basic relations valid for the Bernstein spaces and their extensions to larger function spaces via a unified distance concept
Some basic theorems and formulae (equations and inequalities) of several areas of mathematics that hold in Bernstein spaces are no longer valid in larger spaces. However, when a function f is in some sense close to a Bernstein space, then the corresponding relation holds with a remainder or error term. This paper presents a new, unified approach to these errors in terms of the distance of f from . The difficult situation of derivative-free error estimates is also covered.
Bezpečnostní kódy v železničních zabezpečovacích zařízeních
Bifurcation analysis of a van der Pol-Duffing circuit with parallel resistor.
Bi-infinitary codes
Binary codes and partial permutation decoding sets from the odd graphs
For k ≥ 1, the odd graph denoted by O(k), is the graph with the vertex-set Ωk, the set of all k-subsets of Ω = 1, 2, …, 2k +1, and any two of its vertices u and v constitute an edge [u, v] if and only if u ∩ v = /0. In this paper the binary code generated by the adjacency matrix of O(k) is studied. The automorphism group of the code is determined, and by identifying a suitable information set, a 2-PD-set of the order of k 4 is determined. Lastly, the relationship between the dual code from O(k)...
Binomial-Poisson entropic inequalities and the M/M/∞ queue
This article provides entropic inequalities for binomial-Poisson distributions, derived from the two point space. They appear as local inequalities of the M/M/∞ queue. They describe in particular the exponential dissipation of Φ-entropies along this process. This simple queueing process appears as a model of “constant curvature”, and plays for the simple Poisson process the role played by the Ornstein-Uhlenbeck process for Brownian Motion. Some of the inequalities are recovered by semi-group ...
Bivariate hahn moments for image reconstruction
Blind deconvolution for jump-preserving curve estimation.
Blind deconvolution of the aortic pressure waveform using the Malliavin calculus.
Boolean functions represented by random formulas
Border figure detection using a phase oscillator network with dynamical coupling.
Bound on extended -divergences for a variety of classes
The concept of -divergences was introduced by Csiszár in 1963 as measures of the ‘hardness’ of a testing problem depending on a convex real valued function on the interval . The choice of this parameter can be adjusted so as to match the needs for specific applications. The definition and some of the most basic properties of -divergences are given and the class of -divergences is presented. Ostrowski’s inequality and a Trapezoid inequality are utilized in order to prove bounds for an extension...
Bounded expansion in web graphs
In this paper we study various models for web graphs with respect to bounded expansion. All the deterministic models even have constant expansion, whereas the copying model has unbounded expansion. The most interesting case turns out to be the preferential attachment model --- which we conjecture to have unbounded expansion, too.
Bounds for digital nets and sequences