An ideal tentacle manipulator is a non-conventional robotic arm with an infinite mobility. It has the capability of taking sophisticated shapes and of achieving any position and orientation in a 3D space. A tentacle manipulator is a hyper redundant or hyper degree of freedom manipulator. Hyper redundant robots produce changes of configuration using a continuous backbone made of sections which b...

There were two kinds of methods in information retrieval, based on content and based on hyper-link. The quantity of computation in systems based on content was very large and the precision in systems based on hyper-link only was not ideal. It was necessary to develop a technique combining the advantages of two systems. In this paper, we drew up a framework by using the two methods. We set up th...

An analvtic techniaue is Dresented for comwhere Q, is the channel rrain. and w, is an additive Gaus" I puting the performance of trellis coded q-ary PSK in Rayleigh fading. A contour-integral expression for the pairwise error probability (PEP) is used to define a transfer function, enabling the union bound to be evaluated exactly for the ideal CSI (channel state information) case and imperfect-...

A unifying semantic framework for different reasoning approaches provides an ideal tool to compare these competing alternatives. A historic example is Kripke’s possible world semantics that provided a unifying framework for different systems of modal logic. More recently, Shoham’s work on preferential semantics similarly provided a much needed framework to uniformly represent and compare a vari...

This note announces that a simple approximation property, known to hold in large classes of partially ordered locally convex spaces whose duals are lattice ordered (e.g., [Banach or] Fréchet spaces with closed, normal, generating positive cones possessing the Riesz decomposition property), actually characterizes spaces with lattice-ordered duals. Some very mild and natural assumptions about the...

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