Showing papers in "Information Sciences in 1985"

TL;DR: This paper picks up key points in applying fuzzy control and shows very recent results in industrial applications and points out some interesting and important problems to be solved.

TL;DR: An extensive survey on fuzzy set-theoretic operations is provided, and the relevance of the theory of functional equations in the axiomatical construction of classes of such operations and the derivation of functional representations is emphasized.

TL;DR: This paper surveys major models and theories in this area of fuzzy set theory and offers some indication on future developments which can be expected.

TL;DR: A new model of diagnostic problem solving based on a generalization of the set-covering problem is introduced, which directly addresses the issue of multiple simultaneous causative disorders, and can serve as a theoretical basis for expert systems for diagnostic problems solving.

TL;DR: The fuzzy relational data base (FRDB) model presented in this paper is based on research in the fields of relational data bases and theories of fuzzy sets and possibility and is designed to satisfy the need for individualization and imprecise information processing.

TL;DR: A method is proposed to estimate the fuzzy membership function for pattern recognition purposes using a rational function approximation to the probability density function obtained from the histogram of a finite number of samples.

TL;DR: The characteristics which make them suitable for representing knowledge and control strategies in expert systems are analyzed.

TL;DR: It is proved that if σ is a fuzzy subset of S and μσ is the strongest fuzzy relation on S that is a fuzzier relation on σ, then μσ are a fuzzy subgroup if and only if �x is a furry subgroup.

TL;DR: The purpose of this paper is to improve results on fuzzy partial orderings obtained by Zadeh, and introduces the category LUS, which can be considered as a mathematical model of fuzzy equality, and specifies the axioms of (L-fuzzy) partial ordering with respect to the frame given by LUS.

TL;DR: It is shown that the Riemannian metric on the probability simplex ∑xi = 1 defined by (ds) 2 = ∑(dx i ) 2 x i has an invariance property under certain probabilistically natural mappings.

TL;DR: The motivation for and the basic concepts on which relational-product architectures are built are outlined, and the approach presents a much wider repertory of structures and algorithms for their manipulation.

TL;DR: The generalized set-covering (GSC) model is used as the basis for algorithms modeling the “hypothesize-and-test” nature of diagnostic problem solving, and the utility of the GSC model is illustrated by using it to describe and analyze some recent abductive expert systems for diagnostic problems solving.

TL;DR: The emergency orientation of the expert system considered has the following two basic implications: speed of operation (handling the soft information involved) and a safety-first attitude to be reflected.

TL;DR: It is first show that linguistically quantified propositions provide a framework in which to aggregate the opinions, and two methodologies for implementing the aggregation in terms of quantified statements are provided.

TL;DR: Two different types of imprecision—fuzziness and uncertainty—are identified in this paper, using an example domain of automobile problem diagnosis to demonstrate the need to represent this distinction and interaction between the two types.

TL;DR: It is suggested that FST and ESs are not just mathematical and technological advances but also represent major paradigm shifts in system theory.

TL;DR: This paper characterize new trigonometric entropies, and some information-theoretic properties are studied, and bounds on the Bayesian probability of error in terms of trig onometric entropy and Jensen difference divergence measures have been obtained.

TL;DR: The relative information generating function whose derivatives give well-known statistical indices such as the Kullback-Leibler divergence between two probability distributions and Watanabe's measure of interdependence is introduced.

TL;DR: Necessary conditions for the languages recognized by three-way automata on tapes over a one-letter alphabet are obtained and nondeterministic three- way automata are proved to be more powerful than deterministic automata.

TL;DR: It is shown that theset of absolutely expedient schemes and the set of schemes which possess ergodicity of the mean are mutually disjoint.

TL;DR: Several ways of using fuzzy set theory and fuzzy logic in expert systems to take into account different forms of uncertainty are discussed, including a treatment of a theory of dispositions, Baysian decision theory applied to expert systems, incomplete knowledge representation, and evidence theory.

TL;DR: Diabeto as mentioned in this paper is an expert system, accessible from the French videotex network teletel, which is a decision-aid tool for the treatment of diabetes and the present state of development of the system is described.

TL;DR: It is shown that there exists a dense hierarchy for the classes of sets accepted by these Turing machines with spaces of size less than or equal to log m.

TL;DR: This is a paper exhibiting some old and some new ideas that have been formulated over the last ten years while new mathematical theories, involving fuzzy sets, emerged everywhere.

TL;DR: An extended version of the parallel/sequential table matrix models called extended table matrix grammars (Ex-TMG), generating arrays of symbols, is proposed, and the notion of assigning “terminal weights” to matrix Grammars for describing parquet deformations is extended to Ex-TMGs.

TL;DR: Using weak-convergence concepts it is shown that for large time and small values of parameters in the algorithm, the evolution of the optimal path probability can be represented by a diffusion whose parameters can be computed explicitly.

TL;DR: It is concluded that specialized speech is the most common use of human language; thus its rules have to be the guidelines for development of any language expert system.

TL;DR: It is shown that for every n ≥ 1 and p ≥ 2 there exist multiple Boolean algebras of order p and cardinality p n, and the new theoretical construct can be applied to the theory of fuzzy sets.

TL;DR: The fuzzy form of this general problem of diagnosing a fault in a network of interacting components, in which component failure is not all-or-none, is introduced; many important practical diagnosis problems resemble the fuzzy case more closely than the crisp case.

TL;DR: The general framework bimbo, designed for acquiring knowledge on expert systems oriented to pattern analysis, works in a largely automated mode and makes use of a large body of general knowledge and of powerful heuristics.