Showing papers in "Information Sciences in 1978"

TL;DR: Fuzziness is discussed in the context of multivalued logic, and a corresponding view of fuzzy sets is given.

TL;DR: A general type of entropies is introduced (in the sense of De Luca and Termini) for finite fuzzy sets and its properties for the case of the so-called θ- ∗Entropies, which generalize both the logarithmic entropy, and Sugeno's fuzzy integral for finite sets.

TL;DR: A category of fuzzy complemented spaces is defined and necessary and sufficient conditions for subcategories to have properties analogous to those of the category of sets and functions are given.

TL;DR: The problem of labeling a set of units in such a way as to satisfy an order-N compatibility relation is discussed and shown to be NP-complete.

TL;DR: The fstds system, in which 52 fuzzy-set operations are available, is implemented in fortran, and is currently running on a FACOM 230-45S computer.

TL;DR: It is shown that the classes of sets accepted by two-dimensional finite automata, deterministic one-way parallel/sequential array Automata, and two- dimensional deterministic on-line tessellation acceptors are not closed under row or column cyclic closure.

TL;DR: The concept of e-possibility related to fuzzy sets has a formulation that verifies some criteria of minimal uncertainty and is shown how to derive possibility-qualified propositions from the classical translation rules in fuzzy logic.

TL;DR: In this article, the solution to the Riccati equation is given in terms of the partition of the transition matrix and matrix differential equations are derived and solved using methods developed in the fields of free vibration theory and aircraft flutter analysis.

TL;DR: The exact decision-theoretic solution is given for two cases: (1) where the input image is fully known within a specified domain, and (2) where a scanning process gives only partial knowledge of the image.

TL;DR: The paper contains transformations through which m -ary Gray codes can be obtained from the m -adic representation of integers, and a generating procedure for Gray codes of higher dimension from those of lower dimension.

TL;DR: This paper is concerned with letter-rewriting systems in which context-free rewriting productions are equipped with context conditions and situations where the context conditions of several productions are satisfied by a given occurrence of A.

TL;DR: A sampling theorem based on Walsh analysis techniques for not necessarily sequency-limited signals is constructed by using the concept of the so-called dyadic derivative to calculate the error that arises when only a finite number of samples of a signal with discrete values is chosen.

TL;DR: A model for interaction between random environments and random automata is proposed and the theory of (generalized) random systems with complete connections with learning models or dynamic models is applied in order to describe its behavior.

TL;DR: For the classes of sets accepted by several tape-bounded two-dimensional Turing machines, closure properties concerning the operations of taking row catenation, column catenations, row closure, column closure, and projection are examined.

TL;DR: A sequential estimation-detection scheme developed as a suboptimal solution to the state estimation problem for a linear system driven by homogeneous Poisson processes of low intensities in the presence of white Gaussian noise performs considerably better than the linear optimal filter in the sense of MSE when the Poisson intensity is small.

TL;DR: Tomek's preprocessing scheme is discussed for editing the training set prior to analyzing it by Hart's condensed nearest neighbor technique, found to achieve a significant reduction in the storage requirements of the CNN method while maintaining approximately the same error rate, or even improving it.

TL;DR: Methods of quantizing and updating the prediction and filtering densities are derived and the numerical errors associated with the optimal quadrature approximation to Bayesian recursive computations are discussed.

TL;DR: The sampling expansion for a Hermite polynomial and parabolic functions which are orthogonal in the infinite interval is obtained.

TL;DR: An upper bound on the probability of error for list decoding in this case is contained, in which the receiver lists L messages rather than one after receiving a message.

TL;DR: The solution leads to a partial knowledge of the input model, which is then completely derived under various constraints on the nature of the model, using a discrete version of Shannon's sampling theorem and the discrete Fourier transform properties.

TL;DR: The Kalman filter is adapted so that the parameters of stochastic time-invariant systems can be identified by a direct linear process and constants relating to the initial conditions of the unknown system and the characteristics of the noise are determined.

TL;DR: Based on the GPS, a computationally attractive numerical algorithm is obtained for the computation of the steady-state solution of the time-invariant discrete Riccati equation.

TL;DR: Some properties of this entropy of the distribution resulting from such a random deletion of stochastic point process are given, with special reference to the difference between the entropies of the original and the deleted point process.

TL;DR: An outcome of the analysis is that an alternative algorithm, which eliminates the Riccati equation, is suggested and related convergence and stability properties of state observation by the deterministic filter are discussed.

TL;DR: This paper extends the concept of strong connectivity of nonsymmetric graphs to the case of symmetric graphs, and the idea of minimally strongly connected (MSC) and maximal minimally strong connected (M MSC) subgraphs in a symmetric graph is introduced.

TL;DR: This work presents one approach within which the dissimilar developments of the grammar form and the L form theories can be unified and sheds light on the inherent differences of parallel and sequential rewriting.

TL;DR: The fixpoint approach is used in formalizing the equivalence of recursively defined functions within the framework of predicate calculus and the results suggest some general mathematical techniques useful in proving equivalences of recursive programs.

TL;DR: The concept of a sequential network is introduced, and the relationships between combinational networks, sequential networks, and stochastic sequential machines are developed in some detail.

TL;DR: This paper will show the validity of Estes' learning theory using the Tsetlin model (i.e., interaction between random media and automata), and propose to prove the psychological hypothesis.

TL;DR: An analytical and computer simulated parameter-sensitivity study is presented for the optimal feedback-control law and dynamic-programming optimality equations associated with a discrete-time, finite-horizon, linear-quadratic control problem with random state coefficients.