Suppose G = (V,E) is a graph and D = (V,F) is a strong orientation of G. Let u,v ∈ V, the strong distance sd(u,v) is the minimum size of strong subdigraph of D containing u and v, the strong eccentricity se(u) is the maximum strong distance sd(u,v) between u and v for all v ∈ V. The strong radius and strong diameter of D is defined as the minimum and maximum se(u) for all u ∈ V, respectively. A...

This paper presents a model-based approach to monocular tracking of human body using a non-calibrated camera. The tracking in monocular images is realized using a particle filter and an articulated 3D model with a cylinder-based representation of the body. In modeling the visual appearance of the person we employ appearance-adaptive models. The predominant orientation of the gradient combined w...

The Merino-Welsh conjecture asserts that the number of spanning trees of a graph is no greater than the maximum of the numbers of totally cyclic orientations and acyclic orientations of that graph. We prove this conjecture for the class of series-parallel graphs.

FreeLing is an open-source multilingual language processing library providing a wide range of analyzers for several languages. It offers text processing and language annotation facilities to NLP application developers, lowering the cost of building those applications. FreeLing is customizable, extensible, and has a strong orientation to real-world applications in terms of speed and robustness. ...

For two vertices u, v in a strong digraph D, the strong distance sd(u, v) between u and v is the minimum size of a strong subdigraph of D containing u and v. The upper (lower) orientable strong radius SRAD(G) of a graph G is the maximum (minimum) strong radius over all strong orientations of G. The upper (lower) orientable strong diameter SDIAM(G) of a graph G is the maximum (minimum) strong di...

We study the (1 : b) Maker–Breaker component game, played on the edge set of a d-regular graph. MAKER’s aim in this game is to build a large connected component, while BREAKER’s aim is to not let him do so. For all values of BREAKER’s bias b, we determine whether BREAKER wins (on any d-regular graph) or MAKER wins (on almost every d-regular graph) and provide explicit winning strategies for bot...

A k?coloring of an oriented graph G = (V; A) is an assignment c of one of the colors 1; 2; : : :; k to each vertex of the graph such that, for every arc (x; y) of G, c(x) 6 = c(y). The k?coloring is good if for every arc (x; y) of G there is no arc (z; t) 2 A such that c(x) = c(t) and c(y) = c(z). A k?coloring is said to be semi?strong if for every vertex x of G, c(z) 6 = c(t) for any pair fz; ...

A robust and versatile method is demonstrated to maintain, for an arbitrary time, quasiconstant and strong orientation for molecules with minute dipole moments. The procedure is based on submitting molecules in cyclic wave packets to periodic trains of nonresonant pulses in an electrostatic field. We show that approximate cyclic states can be created by suddenly switching off a long laser pulse...

Strong restricted-orientation convexity is a generalization of standard convexity. We explore the properties of strongly convex sets in multidimensional Euclidean space and identify major properties of standard convex sets that also hold for strong convexity. We characterize strongly convex flats and halfspaces, and establish the strong convexity of the affine hull of a strongly convex set. We ...

The international literature on active labour market programmes has generated inconsistent and confusing, but generally pessimistic, conclusions regarding their impact on the employment prospects of participants. This paper argues that much of this confusion is due to a general lack of attention to qualitative differences between programmes. The paper develops a typology of active labour market...