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 note first we define the notion of dual positive implicative hyper Kideal of type 4, where for simplicity is written by DPIHKI − T4. Then we give some related results. Finally we determine all of hyper K-algebras of order 3, which have D1 = {1}, D2 = {1, 2} or D3 = {0, 1} as a DPIHKI − T4.

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...

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...

We propose the Hyper-Kamiokande (Hyper-K) detector as a next generation underground water Cherenkov detector [1]. It will serve as a far detector of a long baseline neutrino oscillation experiment envisioned for the upgraded J-PARC beam, and as a detector capable of observing, far beyond the sensitivity of the Super-Kamiokande (Super-K) detector, proton decays, atmospheric neutrinos, and neutri...

hyper-tubes consisting of hyper-cubes of n-dimensions were designed and formulas for substructures of vary dimensions established.

Local consistency techniques such as k-consistency are a key component of specialised solvers for constraint satisfaction problems. In this paper we show that the power of using k-consistency techniques on a constraint satisfaction problem is precisely captured by using a particular inference rule, which we call negative-hyper-resolution, on the standard direct encoding of the problem into Bool...