Showing papers in "Information Sciences in 1972"

TL;DR: Global inverse function theorems, applicable to the observability question, are presented and extensions to the noisy measurement case are made.

TL;DR: By extracting the basic properties common to the formal grammars appeared in existing literatures, a general formulation of formal Grammar is developed, which derives the well-known probabilistic, fuzzy Grammars and so on.

TL;DR: The game of Go is believed to have originated in China about four thousand years ago and has been intensely cultivated in Japan for more than a thousand years and is now played throughout the world.

TL;DR: An approach to the artificial recognition of events of a nonsymbolic nature, such as the bidimensional perspective views of scenes of the authors' everyday world, based on a sequential cognitive algorithm that proceeds from general to specific, thereby achieving efficient tree-pruning (contextual elimination).

TL;DR: In this article, a survey of techniques to solve ATS + SA + Q = 0 is presented, and nine algorithms are coded and tested on a batch of examples, which algorithm to recommend depends mainly on the order of the system.

TL;DR: Two optimal non- linear reinforcement schemes for the two-state automaton functioning in a stationary random environment are considered and very simple conditions of symmetry of the non-linear function figuring in the reinforcement scheme are shown to be necessary and sufficient for optimality.

TL;DR: The concept of fuzzy set, introduced by L. A. Zadeh, is extended to a time dependent setting and fuzzy relations are defined and discussed.

TL;DR: Some results on the existence of a satisfactory control are given and such questions as sensitivity and feedback are considered.

TL;DR: Using V-resolution, it is guaranteed that the empty clause @?

TL;DR: Properties of the moments of string and derivation lengths of stochastic context-free grammars are examined and it is shown that, if the first moment exists and is finite, then all higher moments are finite.

TL;DR: The algorithm described is the first step of an automatic fingerprint classification system, whose motivation is to permit correlation studies between fingerprints and congenital diseases.

TL;DR: A family of new methods for the storage and reconstruction of binary patterns by means of block-projections is proposed, achieving more flexibility and less ambiguity.

TL;DR: Stochastic differential equations are obtained describing the temporal evolution of the sufficient statistic for the minimum Bayes' risk detection and the optimal mean-square error estimate of the signal state vector.

TL;DR: A priori and a posteriori identification algorithms are described and synthesized for both the perfect and noisy measurement situations and applied to the identification of aerodynamic parameters of a high-performance, aerodynamically controlled aerospace vehicle.

TL;DR: The use of a set of digital matched filters is presented as an alternative to direct computation of the likelihood-ratio, for the problem of detecting a random signal in random noise.

TL;DR: A general K -th order filter is derived which approximates the conditional means and covariances of the states of an N -dimensional nonlinear system subjected to stochastic disturbances and having as observed outputs M N nonlinear functions of theStates which are also corrupted by measurement noise.

TL;DR: The author shows that this new algorithm does not require the Boolean function to be in conjunctive normal form and is complete in the sense that it generates all the prime implicants, and can be used to efficiently solve the selection problem.

TL;DR: The filtering results are in agreement with those obtained by other derivations whereas it is believed that the fixed-interval and fixed-point smoothing algorithms for space-time systems are new.

TL;DR: It is proved in this section that the first player may optimize his winnings by choosing the T i 's proportional to the respective values of the objects.

TL;DR: There are two principal stability notions in the theory of difference equations: the root condition and the resolvent condition.

TL;DR: The explicit inclusion of a mixture as a separate category in pattern recognition problems is studied and plausible forms for the mixing densities in such problems are derived.