Showing papers in "Information Sciences in 1991"

TL;DR: Some propertes of fuzzy ideals and fuzzy biideals of a semigroup are given and a regular semigroup is characterized that is a semilattice of groups in terms of fuzzy left, right and two-sided ideals and biideal.

TL;DR: The regularity and the spread are defined for describing the algebraic properties of extended fuzzy numbers and A − A = θ, which is a natural extension from the nonfuzzy field, is proved.

TL;DR: The main purpose of this paper is to survey several properties of alternating, nondeterministic, and deterministic two-dimensional Turing machines (including two- dimension finite automata and marker automata), and to briefly survey cellular types of two- dimensional automata.

TL;DR: The stubborn use of one model is inappropriate as ignorance, uncertainty and vagueness are really different concepts and random usage usually leads to inappropriate matching.

TL;DR: It is conjecture that, indeed, the thickness of any graph of degree not exceeding 6 is never more than 2; and that, more generally, T = roof { (D + 2) 4 )} .

TL;DR: It is shown that a fuzzy left (right) ideal A of a ring R is a fuzzy maximal ideal if and only A(0) = 1 and A∗ = {x ϵ R:A(x) = A( 0)} is a maximal left ( right) ideal of R.

TL;DR: A model of the development of the information sciences is described and is used to account for past events and predict future trends, particularly fifth- and sixth-generation priorities, which are natural developments in the foci of attention indicated by the model.

TL;DR: The generalized fuzzy number defined in this paper is a general name for fuzzy numbers, fuzzy intervals, crisp numbers, and interval numbers as well as three important properties of the generalized fuzzy numbers with continuous membership functions as the basis for deriving the solvability criterion.

TL;DR: The necessary and sufficient condition for a kind of logical operators on [0,1] which are consistent is obtained and it is shown that such a concept is inherent.

TL;DR: It is shown that the fuzzy intersection of two fuzzy inner product spaces is also a fuzzy outer product space and some results on these are proved.

TL;DR: It is argued that, far from being mere approximations of logically correct procedures, approximate reasoning methods are also sound techniques that describe the properties of a set of conceivable states of a real-world system.

TL;DR: Hquel is designed as a minimal extension to quel, which is the query language of the database management system ingres, and includes new range declarations, set theoretic expressions, and conditions.

TL;DR: A variant of program-length complexity is used to formally define the structure of a binary string, where theructure of an object is taken to mean the aggregate of its projectible properties.

TL;DR: The concept of fuzzy freeness of a fuzzy subset X of V is introduced and it is characterized in terms of linear independence in the usual sense.

TL;DR: It is shown that the retrieve statement of T QUEL is weaker than its counterpart in TCAL, and it is argued that TQUEL is not as user friendly as TCAL .

TL;DR: An algorithm to construct a pr t net model for a robot planning system represented in a STRIPS-like specification language by applying a linear search algorithm to the pr tNet model, which can obtain a plan in which parallel actions are explicitly shown.

TL;DR: A close examination of the expression for minimum mean-square-error, or Wiener-matrix, restoration from parallel image-gathering channels reveals a method for unscrambling the within-passband and aliased signal components to restore spatial frequencies beyond the sampling passband out to the spatial-frequency response cutoff of the optical aperture.

TL;DR: Joint and conditional unified (r, s)-entropy are defined for bivariate distributions and some properties of these generalized entropies are studied.

TL;DR: Every fuzzy ideal A of R such that A (0) = 1 has a fuzzy primary representation if and only if R is artinian.

TL;DR: This paper survey research on scheduling algorithms, review previous classifications of scheduling problems and present a broader classification scheme, using a uniform terminology for scheduling strategies and the new classification scheme.

TL;DR: The restricted-oriented analogs of some basic properties of convex sets are proved and a decomposition theorem is presented for them.

TL;DR: In this article, a quantitative-qualitative measure of inaccuracy is defined by assuming a set of intuitive postulates and with the help of functional equations, and the measure is characterized by assuming the assumption that the postulates can be expressed as functional equations.

TL;DR: An O(log(min(m,n,j)-time sequential algorithm to select the jth-smallest element of an array resulting from the merging of two sorted arrays A and B of sizes m and n is presented.

TL;DR: A generalization of the ranking function approach to fuzzy numbers is proposed, permitting the definition of different kinds of dominance conferring a degree on the order relation, and provides an improved indifference relation in comparison with previous models.

TL;DR: A unifying theoretical construct corresponding to the idea of a calculus (or formal system) in traditional approaches to knowledge representation is proposed here, and its basic properties are explored.

TL;DR: This work has analyzed the behavior of a new deadlock-free two-phase locking mechanism, called Cautious Waiting, and has compared its performance with other well-known mechanisms and shown that this mechanism performs consistently better under a wide range of parameter values than the other mechanisms investigated here.

TL;DR: This contribution investigates the relationships between cognitive sciences, decision theory, artificial intelligence, operations research, and fuzzy set theory and tries to explore inheritage, common features and basic differences.

TL;DR: This paper proposes to use the equivalence relation for modus ponens of the inference in fuzzy expert systems instead of fuzzy implication and introduces the concept of coimplication as a new approach to approximate reasoning of expert systems using the new concept of modusponens.

TL;DR: In this paper several problems concerning three-way two-dimensional multicounter automata are solved and it is shown that the class of languages accepted by L(m) counter-bounded k-counter automata is equal to the class to be accepted by log L (m) space-bounding Turing machines for any natural function L( m).

TL;DR: An extension and generalizations to sparse distributed memory introduced by Kanerva are introduced, concerning both the manner in which information is stored and techniques for improving the reading mechanism.