Let s denote a compact convex object in IR. The f-width of s is the perpendicular distance between two distinct parallel lines of support of s with direction f . A set of disjoint convex compact objects in IR is of equal f -width if there exists a direction f such that every pair of objects have equal f -width. A visibility matching, for a set of equal f -width objects is a matching using non-c...

The tuning curves, angular and spectral phase-matching widths are calculated for all possible kinds of OPG in the principal planes of biaxial KTP crystal with Nd:YAG laser pumping at 1.064 μ wavelength. The plots presented enable the maximal nonmonochromaticity and radiation divergence to be found for any value of the signal wave and different interaction types. A particular emphasis has been p...

We present some new and explicit error bounds for the approximation of distributions. The is quantified by maximal density ratio distribution $Q$ to be approximated its proxy $P$. This non-symmetric measure more informative than implies total variation distance. Explicit problems include, among others, hypergeometric binomial distributions, Poisson beta gamma In many cases we provide both upper...

The edge domination number γe(G) of a graph G is the minimum size maximal matching in G. It well known that this parameter computationally very hard, and several approximation algorithms heuristics have been studied. In present paper, we provide best possible upper bounds on for regular non-regular graphs terms their order maximum degree. Furthermore, discuss algorithmic consequences our result...

We investigated maximal Prym varieties on finite fields by attaining their upper bounds on the number of rational points. This concept gave us a motivation for defining a generalized definition of maximal curves i.e. maximal morphisms. By MAGMA, we give some non-trivial examples of maximal morphisms that results in non-trivial examples of maximal Prym varieties.

In this article we study statistical properties of a commonly used network model – an Erdős–Rényi random graph G(n, p). We are interested in the performance of distributed algorithms on large networks, which might be represented by G(n, p). We concentrate on classical problems from the field of distributed algorithms such as: finding a maximal independent set, a vertex colouring, an approximati...

We present and analyse Las Vegas distributed algorithms which compute a MIS or a maximal matching for anonymous rings. Their bit complexity and time complexity are O( √ logn) with high probability. These algorithms are optimal modulo a multiplicative constant. Beyond the complexity results, the interest of this work stands in the description and the analysis of these algorithms which may be eas...

ÐThis paper investigates whether surface topography information extracted from intensity images using a recently reported shape-from-shading (SFS) algorithm can be used for the purposes of 3D object recognition. We consider how curvature and shape-index information delivered by this algorithm can be used to recognize objects based on their surface topography. We explore two contrasting object r...

In this paper, we consider the following variant of the matroid intersection problem. We are given two matroids M1,M2 on the same ground set E and a subset A of E. Our goal is to find a common independent set I of M1,M2 such that |I ∩A| is maximum among all common independent sets of M1,M2 and such that (secondly) |I| is maximum among all common independent sets of M1,M2 satisfying the first co...