Showing papers in "Information Sciences in 1986"
••
TL;DR: A new nonprobabilistic entropy measure is introduced in the context of fuzzy sets or messages and the theory of subsethood is shown to solve one of the major problems with Bayes-theorem learning and its variants—the problem of requiring that the space of alternatives be partitioned into disjoint exhaustive hypotheses.
605 citations
••
TL;DR: This short note comments on the interpretation of weighted minimum and maximum operations introduced in a previous paper as medians, and corrects a misleading statement about it.
239 citations
••
TL;DR: In this paper, the authors present a VLSI implementation of an inference mechanism to cope with uncertainty and to perform approximate reasoning, which is based on the max-min operation of fuzzy set theory for effective and real-time use.
108 citations
••
TL;DR: Results involving the concepts of order of a fuzzy subgroup of a finite group, a fuzzy Abelian group, and a fuzzy solvable group are obtained, and analogs of two basic theorems of group theory are proved.
76 citations
••
TL;DR: A new approach to database access suitable for browsing is described, which consists of certain subsets of keywords and objects shown to form a lattice that grows linearly with the number of objects.
72 citations
••
TL;DR: Using the concept of possibility distribution, a formula is derived for the possibility induced by a statement containing imprecise quantifiers to derive the rule representation in expert systems when quantifiers are present.
56 citations
••
TL;DR: An algorithm is presented to compute the minimum distance associated with editing X to Y subject to the specified constraint and the technique to computed the optimal transformation is presented.
51 citations
••
TL;DR: It is argued that human cognitive reference frames are structured as such dynamically induced algebraic decompositions G 1 .
33 citations
••
TL;DR: An analysis of simple lists, either sorted or unsorted, under the set of all their possible histories of length n shows that for the simplest structures variance estimates can also be obtained.
30 citations
••
TL;DR: A method for describing a shape the boundary of which is represented by a contour composed of primitives from a specified set by means of a sequence of descriptors, each consisting of two characters, and their meaning allows to extract regions and to characterize them exactly.
25 citations
••
TL;DR: Borders on the redundancy of degree α are obtained by applying Johnsen's approach by assuming the most likely source letter to be α.
••
TL;DR: A method for constructing a membership function for the fuzzy sets that expert systems deal with and the systematic methodology presented will facilitate effective use of expert systems is put forth.
••
TL;DR: It is proved that there exists a fuzzy subgroup of G whose level subgroups are exactly the subgroups of this chain of subgroups, and an interpretation of the number of chains of sub groups of a group G in which a subgroup H is a member.
••
TL;DR: The minimized-average-error bilevel display algorithm is extended to a general n -level error-feedback filter for picture display and a low-pass filter impulse response is used in the spatial domain to define a more reasonable distortion measure based on the concept of error diffusion.
••
TL;DR: This measure is a generalization of the weighted information energy given by Theodorescu and studied extensively by Pardo, and some properties and an axiomatic treatment of the measure are given.
••
[...]
TL;DR: Two concepts of convergence for sequences of elements of a set X with respect to a fuzzy topology on X are examined by interpreting in a multivalued logic two different first order formulas expressing the classical convergence.
••
TL;DR: The complementary process to Sanchez's fuzzy diagnosis process is introduced by reinterpreting the clinical data on the domains of negated propositions, which consist of two fuzzy relations on aSet of patients and a set of propositions that represent symptoms or diagnoses.
••
TL;DR: The average time required by backtracking is analyzed over four models of random conjunctive normal form formulas and indicates that the analysis methods used are insensitive to small changes in the random model.
••
TL;DR: It is shown that the direction-independent restriction does not affect the generative powers of MAG, but it does, however, affect theGenerative power of a restricted version of ∗AG, i.e., connected ∗-array grammars.
••
TL;DR: The key to the design approach is the presentation of a distributed processing component (DPC) partitioning algorithm for clustering functional modules in order to derive a set of distributed processing components.
••
TL;DR: A branch and bound scheme is described for tackling a linear program under discrete possibilistic data and it is shown that solutions yielded are satisfying, i.e. possibly and/or necessarily feasible, and optimal to a great extent.
••
TL;DR: An approach to choice theory from the viewpoint of statistical sequential analysis to a new generalized version of the familiar best-choice problem, related to the well-known collective-choice-theory conception of choice function.
••
TL;DR: It is proved that no one-pebble acceptor can detect interlocking components in a 3D digital picture.
••
TL;DR: A method to be used for the organization and retrieving data and another minimal perfect hashing scheme based upon number theory, with the function h(k) = [CT(k)] mod n.
••
TL;DR: A simple method is proposed to construct the minimal perfect hashing function, which has applied successfully to many of pascal's reserved words, the set of algol 60's reserved Words, theSet of keywords in c, etc.
••
TL;DR: This paper shows that the extension to support functions can be carried out whether or not the weight-of-conflict conjecture is true.
••
TL;DR: The machine model that is concerned with is a tree-structured parallel computer which combines SIMD and systolic computers in a treelike manner and has an O(n2dp + n log p)-time algorithm for finding fundamental cycles and bridges in a connected, undirected graph G with n vertices.
••
TL;DR: It is shown how the concept of Boolean difference, which is well understood in the case of stuck-type fault situations, can be employed to generate the complete test set for bridging faults in combinational networks.
••
TL;DR: It is shown that m log m space (m2 space) is necessary and sufficient for deterministic three-way two-dimensional Turing machines to simulate deterministic (nondeterministic) three- way two- dimensional finite automata with rotated inputs.
••
TL;DR: Known theorems on the error detecting, identifying, and correcting capacity of such codes are generalized and application to brain modeling is touched upon.