Showing papers in "Information Sciences in 1982"

TL;DR: A new approach to the summarization of data based upon the theory of fuzzy subsets allows for a linguistic summary of the data and is useful for both numeric and nonnumeric data.

TL;DR: Under the condition of Bayesian belief structure a whole family of possible definitions for the probability of fuzzy sets is obtained and a procedure for including belief qualification in pruf is suggested.

TL;DR: It is shown that the strong law of large numbers holds also for fuzzy random variables and this result is used to give a consistent estimator for the expectation of a fuzzy random variable.

TL;DR: Rational inference procedures are described in this paper on the basis of established Bayesian theory and Dempster and Shafer's theory of evidence to include fuzzy knowledge.

TL;DR: It is shown how one can obtain probabilistic statements about the forecasted variables using a linguistic variable to represent imprecise information to be inserted in regression models used for prediction.

TL;DR: The main result is that element-dependent operations are not compatible with the preservation of the intersection and union under the inverse image of a function.

TL;DR: It is found that when ∗ is the operation Λ of the lattice, that the arithmetical mean of Λ-independent fuzzy numbers does not converge, and it is thought that this case could be a limit one.

TL;DR: First reduction of irreflexive and transitive matrices is examined and then the results are applied to nilpotent matrices, which are useful for simplification of various systems with fuzzy transitivity.

TL;DR: It is shown that the majority of fuzzy inference methods for a fuzzy conditional proposition “If x is A then y is B ,” with A and B fuzzy concepts, can infer very reasonable consequences which fit the intuition with respect to several criteria.

TL;DR: Conditions of e-optimality of a general class of strongly absolutely expedient learning algorithms are derived and are applied to reinforcement learning.

TL;DR: It is shown that slight technical changes in the definition transform the probability of fuzzy events introduced by R. R. Yager into a new concept of such probabilities having nice properties, both from an intuitive and from a mathematical point of view: monotonicity, additivity, and continuity.

TL;DR: A new method is used to construct coefficients a kn such that any band-limited signal function with highest frequency Π W can be reconstituted from its samples from the past via ƒ(t)= lim n→∞ σ k=1 n a kn Ɠ t− kT W.

TL;DR: The main results are: n2log n (n3) space is necessary and sufficient for deterministic 5WTM's to simulate deterministic (nondeterministic) 3-FA's.

TL;DR: The MDECP allows the use of an optimization technique to speed up the parsing, and the MLECP of the attributed tree grammar takes both the structure errors and the semantic errors into consideration, and has a high parsing efficiency.

TL;DR: The basis of the paper is the result that any λ-free principal semiAFL M ( L ) can be presented in the form M (L) = (h 4 h 3 −1 h 2 h 1 −1 (L§)¦ each h 1, a homomorphism, h 2 and h 3 λ -free, h 4 length-preserving).

TL;DR: This paper presents a new analysis of the reliability of majority voting in terms of the conditional reliabilities of voters, where conditioning is with respect to correct outputs.

TL;DR: Csiszar's work on the topological properties of ƒ-divergences enables one to identify strong distances and provides a justification for the experimental findings of previous investigators.

TL;DR: A nonparametric procedure using the multiple Fourier series for Bayes risk consistency is presented and examined and the rates at which the probability of misclassification converges to the Bayes probability of error are presented.

TL;DR: An algorithm for generating the impossible pair (IP) constrained path in a program, if any, is described, the complexity of the algorithm is polynomial in the number of vertices and thenumber of IP constrained paths actually existing in the program when the program digraph is acyclic.

TL;DR: An improved version of this algorithm together with a new strategy for preprocessing the digraph, in order to simplify the cycle enumeration process, is presented.

TL;DR: A general scheme which constructs connected skeleton models from digital images is presented and an algorithm to extract the connected skeleton is described, followed by the definition of a formal skeleton model and the model construction algorithm.

TL;DR: It is shown that non-additive entropy of order α and type β satisfies this inequality for binary symmetric channels for certain probability distributions.

TL;DR: F fuzzy systems described by means of fuzzy relational equations and Λ-fuzzy systems are discussed and some ideas of clustering techniques and probabilistic sets are discussed.

TL;DR: It is shown that there exists a context-free language not accepted by any nondeterministic rebound automaton, and closure properties of the class of rebound automata are investigated.

TL;DR: A simple and direct dynamic data structure, the parenthesis tree, to represent a set of nested intervals using O(n) space to provide a simpler alternative to the “treap” when solving the connected component problem.

TL;DR: A problem of reducing rectangular fuzzy matrices is considered, and some interesting results are obtained, which are applied to a fuzzy retrieval model and played an important role in the reduction.

TL;DR: The satisfaction process in terms of extended topology is defined and demonstrates the existence and fundamental importance of a balancing principle, i.e., a balance between the decision set and value set, that is key to “convergence” in a satisfactory sense.

TL;DR: The sampling with such transforms for functions on the whole real line is not possible, as the parabolic cylinder function is not square integrable there and the sampling function does not exist in the usual finite form.

TL;DR: It is shown that the generative power of k - linear ( k ⩾ 1) grammars is increased by composition, and it is of interest to note that the families of compound linear and compound k -linear languages are equal.

TL;DR: A combinatorial approach to the study of addressable machines is proposed, where the set of instructions defining the machine is the union of the sets of the generators of a free group and of theSet of their inverses together with the identity.