Showing papers in "Information Sciences in 1971"

TL;DR: An extended version of Szpilrajn's theorem is proved and various properties of similarity relations and fuzzy orderings are investigated and, as an illustration, a fuzzy preordering is investigated which is reflexive and antisymmetric.

TL;DR: In this paper, the authors define a language, L, as a fuzzy relation from a set of terms, T = x, to a universe of discourse, U = y, and define a fuzzy set, M(x), in U whose membership function is given by @m"M" ("x")(y) =@m"L(x,y).

TL;DR: In this article, the Riccati equation with quadratic loss was studied for nonnegative definite and positive definite matrices Q"1 and Q"2 and the results were used to study the possible number of stationary solutions.

TL;DR: In this paper, the phrase-structure grammar scheme used for specifying string languages is extended to structures called plexes composed of symbols with an arbitrary number of attaching points, which are used to specify the interconnection of encoded geometric curves to form mesh-like line patterns.

TL;DR: A recursive, fading memory filter for time-continuous and time-discrete systems is presented as a means for overcoming the destructive influence of model errors in Kalman filter applications that lead to the occurrence of divergence.

TL;DR: A method for the description of the hierarchical structure of two-dimensional pictures is proposed, and a picture analysis program is described that accepts picture-processing grammar in tabular form and processes pictures using that grammar.

TL;DR: Optimal and suboptimal estimator algorithms, which can be computed recursively, are developed and digital computer simulations of the estimators are also presented and their performances evaluated.

TL;DR: The optimum maximum likelihood receiver for estimating the information sequence that passes through a convolutional encoder and a channel with a known finite memory part followed by a noisy memoryless part is derived using control theoretic concepts.

TL;DR: Properties of normalized stochastic languages are discussed and alternative procedures for constructing the Chomsky and Greibach normal forms for normalized Stochastic context-free grammar (nscfg) are presented.

TL;DR: Artificial intelligence programs in the areas of theorem proving, problem solving (including analogies), concept formation, and pattern recognition are viewed as particularizations of a generalized means-ends analysis schema.

TL;DR: Two distinct orthogonal series representations are derived for the entire class of weakly continuous stochastic processes over a broad class of Lebesgue sets of the real line, and a constructive procedure to obtain them explicitly is given.

TL;DR: The concepts of the higher order transition in the automata and the partition of the domain of objective function are introduced to the method of optimizing control, and the control systems can hold the true optimum at small hunting loss without keeping any local optimum.

TL;DR: The concepts of natural state and past-determinism are given for general time systems, i.e., systems whose input-output pairs are ordered pairs of abstract functions defined on a linearly ordered set and are shown to be unique up to an isomorphism and characterized by equivalence classes of input- output pairs.

TL;DR: The Proving Program (PP) as mentioned in this paper has been used to find resolution principle proofs of theorems in predicate calculus with functions and individual constants, which can be easily extended to become a deductive question answering program.

TL;DR: The work reported here is motivated by that of Rabin [I] which asks implicitly about the computational power of n tape vs. n+1 tape real time Turing machines and that of Hartmanis [2], who attempts a complexity measure for Turing machines in terms of reversals.

TL;DR: The optimal differential equation can always be discretized in time and phase, to obtain the system of difference equations u-skk+1/*=F"i(u"k^*) for u"k*@?I"i, an interval in the phase space.

TL;DR: Hierarchies of functions based on approximate behavior are defined and their complexities compared and the success of approximation of a function f is investigated with respect to the complexity of the approximating function g.

TL;DR: This paper uses optimization theory and continuous invariant imbedding in order to derive computationally efficient sequential algorithms for the maximum likelihood estimation of bias errors in recursive filtering with noise corrupted input observations and correlated plant and measurement noise.

TL;DR: If the states of a finite-state Markov chain can be identified with designated subintervals of the unit interval, and if the transition probabilities are numerically specified, then the chainCan be represented by a piecewise-linear difference equation.

TL;DR: It is shown that there exists an elementary permutation of the natural numbers whose inverse is not provably recursive in formal number theory.