In this paper we characterize hyper MV -algebras in which 0 or1 are scalar elements . We prove that any nite hyper MV -algebra that 0is a scaler element in it, is an MV -algebra. Finally we characterize hyperMV -algebras of order 2 and order 3.

False matching due to errors in feature extraction and changes in illumination between frames may occur in feature tracking in image sequences. False matching leads to outliers in feature motion trajectory. One way of reducing the effect of outliers is stochastic filtering using a state space model for motion trajectory. Hyper-parameters in the state space model, e.g., variances of noise distri...

Link invariants, for 3-manifolds, are defined in the context of the RozanskyWitten theory. To each knot in the link one associates a holomorphic bundle over a holomorphic symplectic manifold X . The invariants are evaluated for b1(M) ≥ 1 and X Hyper-Kähler. To obtain invariants of Hyper-Kähler X one finds that the holomorphic vector bundles must be hyper-holomorphic. This condition is derived a...

The objective of the present paper is to study real hyper surfaces of a complex projective space with generalized recurrent second fundamental tensor and it is shown that such type real hyper surface exist. Also, we study real hyper surfaces of a complex projective space with generalized recurrent Ricci tensor. It is proved that a real hyper surfaces of complex projective space is generalized R...

We improve a recent result [A. Badr: Hyper-Minimization in O(n). In Proc. CIAA, LNCS 5148, 2008] for hyper-minimized finite automata. Namely, we present an O(n logn) algorithm that computes for a given finite deterministic automaton (dfa) an almost equivalent dfa that is as small as possible—such an automaton is called hyper-minimal. Here two finite automata are almost equivalent if and only if...

Markov distributions are used to describe multivariate data with conditional independence structure. Applications of Markov distributions arise in many fields including demography, flood prediction, and telecommunications. A hyper Markov law is a distribution over the space of all Markov distributions; such laws have been used as prior distributions for various types of graphical models. Dirich...

As hypertext systems become widely available and their popularity increases, attention has turned to converting existing textual documents into hypertextual form. An important issue in this area is the fully automatic production of hypertext for learning, teaching, training, or self-referencing. Although many studies have addressed the problem of producing hy-per-books, either manually or semi-...

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