We view hyper-graphs as incidence graphs, i.e. bipartite graphs with a set of nodes representing vertices and a set of nodes representing hyper-edges, with two nodes being adjacent if the corresponding vertex belongs to the corresponding hyper-edge. It defines a random hyper-multigraph specified by two distributions, one for the degrees of the vertices, and one for the sizes of the hyper-edges....

For disjunctive logic programs (DLPs) there are several proposals for deening interpreters, There have also been diierent approaches to assign least xpoints to DLPs. This paper proves that there exist an eecient proof procedure, namely hyper tableaux, which can be understood as a direct implementation of some of the well known xpoint iteration techniques. We show how a hyper tableaux refutation...

In this paper, we selected three different CPU architectures for performance analysis: single-core, dualcore and hyper-threading CPU’s. Four kinds of operations are executed on these architectures. After analyzing all the data, we found that the single-core and dual-core act as usually expected: the execution times of combined operations are very close to the sum of that of compounding operatio...

In this thesis we study the problems of distance approximation to monotonicity and distance approximation to convexity. Namely, we are interested in (randomized) sublinear algorithms that approximate the Hamming distance between a given function and the closest monotone/convex function. For the monotonicity property, we focus on functions over the d-dimensional hyper-cube, [n]d, with any finite...

We investigate the rigidity of hyperbolic cone metrics on 3-manifolds which are isometric gluing of ideal and hyper-ideal tetrahedra in hyperbolic spaces. These metrics will be called ideal and hyperideal hyperbolic polyhedral metrics. It is shown that a hyper-ideal hyperbolic polyhedral metric is determined up to isometry by its curvature and a decorated ideal hyperbolic polyhedral metric is d...

Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study binary linear complementary dual [n, k] codes with the largest minimum weight among all binary linear complementary dual [n, k] codes. We characterize binary linear complementary dual codes with the largest minimum weight for small dimensions. A complete ...

In the field of speech adaptability to environmental conditions, the intelligibility of hyper auditory and visual speech versus normal speech was investigated. The « Lombard » reflex was used to obtain auditory sequences produced with vocal effort for a set of French /b, d, g, p, t, k/ plosives. Analysis of plosive identifications showed an improvement with the auditory hyper condition in the p...

In this paper, we characterize the computational power of dynamical systems with piecewise constant derivatives (PCD) considered as computational machines working on a continuous real space with a continuous real time: we prove that piecewise constant derivative systems recognize precisely the languages of the ω th (respectively: ω + 1 th ) level of the hyper-arithmetical hierarchy in dimension...