Showing papers in "Information Sciences in 1970"

TL;DR: In this paper, the authors considered the problem of decomposition of the probability density function of the original set into the weighted sum of the component fuzzy set densities, which is done by optimization of some functional defined over all possible fuzzy classifications.

TL;DR: Algorithms are developed to test whether a pattern has a (strongly) well-formed structure with respect to a given structure specification scheme, which is applicable to the analysis of two-dimensional mathematical expressions and the format of printed material.

TL;DR: Nessary and sufficient conditions are obtained for the system parameters to be identifiable in the deterministic sense and stochastically identifiable and these conditions are shown to be significant in studying the asymptotic properties of maximum likelihood estimators.

TL;DR: The effect of substitution in families of languages, especially an AFL (i.e., abstract family of languages), is considered and the main results shown are the following: The substitution of one AFL into another is an AFL.

TL;DR: This research presents a new generation of artificial intelligence programs which perform tasks which are similar to tasks that increasingly younger human beings can perform.

TL;DR: Existence theorems for optimal control problems are obtained using the duality theory and a direct relationship between duality and Pontryagin's Maximum Principle is exhibited.

TL;DR: This paper derives nonlinear sequential filter algorithms for conditional mean estimation of a Gauss Markov process when there is uncertainty as to the presence of the GaussMarkov process (signal process) in the observation.

TL;DR: The theorem below shows that there exists a Cauchy problem whose solution satisfies a family of Fredholm integral equations with displacement kernels.

TL;DR: This paper describes an alternative approach in which the locates do not necessarily represent real patterns, and the training procedure consists of adjusting the positions of the locate so as to optimise the decision surface.

TL;DR: The performance of a signal detection system by means of counting the number of times a level is crossed by the input function is derived.

TL;DR: A stochastic approximation algorithm is proposed for the on-line estimation of the parameters in an assumed approximate response of a class of distributed systems minimizing a mean-square error criterion.

TL;DR: A pseudo Bayes approach to likelihood ratio determination for discrete time random processes imbedded in Gaussian noise is presented, suggesting an estimator-correlator type structure for the optimum digital detector.

TL;DR: It is shown that under mild conditions on a tape function f, the AFL generated by the languages accepted by f-tape-bounded (deterministic) Turing acceptors is generated by a single language i.e., is principal.

TL;DR: Results of this experiment have shown significant improvement over an ordinary linear algorithm in handling character samples with various imperfections due to the poor quality in writing or printing encountered in practice.

TL;DR: A deterministic approach to the reconstruction of convex polyhedra from two perspective images is presented, and the complications introduced by a quantization effect on such images are examined.

TL;DR: Two distinct series representations are derived for the class of second order, mean-square continuous, weakly stationary multivariate stochastic processes.

TL;DR: The object of this paper is to characterize binary relations by their consistent composite formation properties by the use of reduction theorems and by the construction of example systems.

TL;DR: This work generalizes that circuit construction method for group multiplication requiring time at most one unit greater than the lower bound so as to render it applicable to any function f:X"1 x X"2 -> Y, where X"1 andX"2 are finite sets.

TL;DR: It is shown that, under certain restrictions, two-person inverse poker and two- person ordinary poker are isomorphic games.

TL;DR: A sequential estimation computation for the state of a system given noisy observations is made more complicated by the presence of random forcing of the system and by uncertain parameters, even if the uncertain parameters are not estimated.

TL;DR: This work constructs a mathematical code system, MCS, as a machine solvable language, and gives expandability of the thesaurus by giving a formal procedure of translation from an input language to MCS to retrieve a solution using it as an index.

TL;DR: An applied lambdagamma calculus with a successor function as the only primitive function is described in the paper as a fully formal theory with axioms and rules of deduction.

TL;DR: The prediction problem requires solution of the filtering problem plus extrapolation of the last filter output through the nonlinear system dynamics, and it is shown that the conditional density function of the system state during the extrapolation operation satisfies the Fokker-Planck-Kolmogorov-Feller equation.