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

Linear–dendrite copolymers containing hyper branched poly(citric acid) and linear poly(ethylene glycol) blocks PCA–PEG–PCA are promising nonmaterial to use  in nanomedicine. To investigate their potential application in biological systems (especially for drug carries) ONIOM2 calculations were applied to study the nature of particular interactions between drug and the polymeric nanoparticle...

We consider the problem of learning a distance metric from a limited amount of pairwise information as effectively as possible. The proposed SERAPH (SEmi-supervised metRic leArning Paradigm with Hyper sparsity) is a direct and substantially more natural approach for semi-supervised metric learning, since the supervised and unsupervised parts are based on a unified information theoretic framewor...

Recently, much attention has been drawn on exact typechecking for non-Turing-complete XML transformation languages, such as XSLT and XML-QL. Milo, Suciu, and Vianu proposed a notion of k-pebble tree transducers, a powerful and general framework that can express most of transformations in such languages, and showed that its exact typechecking is decidable in time hyper-exponential to the number ...

Let R be a commutative integral domain with quotient field K and let P be a nonzero strongly prime ideal of R. We give several characterizations of such ideals. It is shown that (P : P) is a valuation domain with the unique maximal ideal P. We also study when P^{&minus1} is a ring. In fact, it is proved that P^{&minus1} = (P : P) if and only if P is not invertible. Furthermore, if P is invertib...

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.

The general Meshless Local Petrov-Galerkin (MLPG) type weak-forms of the displacement & traction boundary integral equations are presented, for solids undergoing small deformations. Using the directly derived non-hyper singular integral equations for displacement gradients, simple and straight-forward derivations of weakly singular traction BIE's for solids undergoing small deformations are als...

We prove that the theory of EXPTIME degrees with respect to polynomial time Turing and many-one re-ducibility is undecidable. To do so we use a coding method based on ideal lattices of Boolean algebras which was introduced in 7]. The method can be applied in fact to all hyper-polynomial time classes.