Let 2 be a finite set of join dependencies (JDs), multivalued dependencies (MVDs) and functional dependencies (IDS). To test whether .% implies an MVD X -+ Y or an PD X -+ A, the procedure in [ 31 first generates the dependency basis DEP( X) of X with respect to 2. Then, X + Y if and only if Y is the union of some elements in DEP( X) , and X -+ A if and only if A E DEP( X), and there is an PD V...

We present a complete finite axiomatization of the unrestricted implication problem for inclusion and conditional independence atoms in the context of dependence logic. For databases, our result implies a finite axiomatization of the unrestricted implication problem for inclusion, functional, and embedded multivalued dependencies in the unirelational case.

There is a well-known algorithm for determining when a decomposition ˆ {R1,R2, . . . ,Rm} of a database relation scheme has a lossless join with respect to a set of functional dependencies. We ®rst present a reformulation of this algorithm in terms of set closures. For the special case of mˆ 2, there is a well-known explicit condition for losslessness. Our formulation extends this result for ge...

Consider a relation schema with a set of dependency constraints. A fundamental question is what is the minimum space where the possible instances of the schema can be ”stored”. We study the following model. Encode the instances by giving a function which maps the set of possible instances into the set of words of a given length over the binary alphabet in a decodable way. The problem is to find...

This paper introduces a new definition of fuzzy multivalued dependency, called α-fmvd, on the basis of the αequality of tuples as defined in [1]. Next the definition is shown to be consistent, i.e., it reduces to that of classical multivalued dependency (mvd) when the choice parameter takes the value one. Finally, a set of sound and complete inference axioms have been designed and proved for th...

The existence of approximate fixed points and approximate endpoints of the multivalued almost I-contractions is established. We also develop quantitative estimates of the sets of approximate fixed points and approximate endpoints for multivalued almost I-contractions. The proved results unify and improve recent results of Amini-Harandi 2010 , M. Berinde and V. Berinde 2007 , Ćirić 2009 , M. Păc...

We introduce in this paper a notion of continuity in digital spaces which extends the usual notion of digital continuity. Our approach uses multivalued maps. We show how the multivalued approach provides a better framework to define topological notions, like retractions, in a far more realistic way than by using just single-valued digitally continuous functions. In particular, we characterize t...

Let (X, z) be a topological space, and (Y, d) a metric space. A mapping F: X -+ 2’ which associates with every x E X a non-empty subset F(x) OF Y is said to be lower semi-continuous (I.s.c.) (respectively, upper semi-continuous (u.s.c.)) if, for each open set % in Y, the set (X E X: F(x) n %f # @ > (respectively, the set (X E X: F(x) c @ )) is open in X A mapping f: X-a Y is a selection for F i...

It has been found that the response of acupuncture point on the human meridian line exhibits nonlinear dynamic behavior when excitation of electroacupuncture is implemented on another meridian point. This nonlinear phenomenon is in fact a hysteretic phenomenon. In order to explore the characteristic of human meridian and finally find a way to improve the treatment of diseases via electro-acupun...

This paper describes an efficient simulator for state transition analysis of multivalued continuous-time neural networks, where the multivalued transfer function of neuron is regarded as a stepwise constant one. Use of stepwise constant method enables to analyse the state transition of the network without solving explicitly the differential equations. This method also enables to select the opti...