Showing papers in "Information Sciences in 1976"

TL;DR: This paper provides a fairly complete list of information and distance measures including a new average conditional cubic entropy proposed by the author and major problem areas such as computation with these measures are examined and methods of approach for the unresolved problems are suggested.

TL;DR: A graph-theoretic static analysis of the board arrangement which determines unconditional life or its lack is presented, together with proofs of its equivalency to look ahead, and it is argued that it is the preferable method for computer Go play.

TL;DR: A cost function is developed, based on information-theoretic concepts, that measures the complexity of a stochastic context-free grammar, as well as the discrepancy between its language and a given stoChastic language sample.

TL;DR: It is shown that a planned subdivision of the physical data base can yield noticeable operating cost improvements over conventional data base designs.

TL;DR: A new class of configurations called ''flower graphs'' is presented whose synchronization is useful to reduce synchronization time for any graph, valid for several classes of graphs.

TL;DR: In this paper, a general formulation of fuzzy programs or fuzzy algorithms is introduced and the relationship between this formulation and other existing formulations is studied.

TL;DR: The Kalman-Bucy filter is derived for both the discrete-time and the continuous-time systems by an application of the information theory and the information structures of the optimal filter for a continuous- time nonlinear system are made clear.

TL;DR: The fundamental and all encompassing nature of the generalized partitioned algorithms (hereon denoted GPA) is clearly demonstrated by showing that the GPA contain as special cases important generalizations of past well-known linear estimation algorithms, as well as whole families of such algorithms, of which all previously obtained major filtering and smoothing algorithms are special cases.

TL;DR: The results obtained in this paper may contribute to processing a picture from the polygonal approximation stage to the final classification stage in order to recognize a picture.

TL;DR: This paper introduces a mathematical structure called transition systems, developed as a result of the study of Petri nets and vector addition systems, to model concurrent and asynchronous events.

TL;DR: The use of heuristic strategies for searching problem spaces of various types of problem representations is discussed, and geometric analysis provides an intuitive alternative to the algebraic analysis which appears in the literature.

TL;DR: A convergence theorem for the vector version of the Robbins-Monro procedure with adaptive gain matrices is established and applied to obtain a recursive estimator of the quartiles of a distribution using adaptive gainMatrices and batch processing of the samples.

TL;DR: A model system for generation, access, and control of a shared database by casual users in their own terminology, which achieves this goal by planning a dialog which hierarchically defines the possible universe of discourse where casual users can communicate with the database.

TL;DR: The paper concludes that subsumption and factoring should not be used (at least, in this implementation), set of support and P1-deduction should be used, the choice between breadth-first and unit preference searching is highly problem dependent, and merge and linear strategies have little effect on the proof process.

TL;DR: A more general arrangement—a tree—structured arrangement of the trees is considered and it is shown to give no improvement in the problem of finding an optimal sequential order of scanning the trees for evaluation of F.

TL;DR: Two convergence theorems for the robustized scalar versions of the Robbins-Monro and the Kiefer-Wolfowitz procedures are presented and two information processing oriented examples are included which illustrate these recursive estimators and their robustness.

TL;DR: The paper presents a procedure for selecting the appropriate set of filter coefficients by classifying the autocorrelation function of the received clutter so as to realize a prescribed false alarm probability, with the widest visible target space possible.

TL;DR: The paper describes the generation of three types of artificial data and their use as test material in pattern recognition research, providing a powerful tool for the objective evaluation of a learning classifier, operating on a realistic problem.

TL;DR: The optimal open-loop strategies are obtained for linear systems with unknown parameters in the system matrix with a quadratic performance index through the use of the Hamilton-Jacobi theory.

TL;DR: In this article, a linear preprocessing of observations of a random space-time signal preparatory to transmission over a sampled-data channel is partitioned into a conventional ''state-variable'' filter operating on all current and past observations available to the primary transducer, and a linear coder which selects the combination of state estimates to be transmitted at each sampling instant.

TL;DR: It is shown that a one-dimensional bounded cellular automaton can simulate a linear-bounded automaton (LBA) in essentially real time, and that an LBA can simulate an BCA, on an input of length n, in just n transitions of the LBA per BCA transition.

TL;DR: The Basic ATN is defined, a limited class of ATN, and it is shown that the languages accepted by this class are exactly those generated by a single top-down finite-state tree transducer, as defined by Rounds and Thatcher.

TL;DR: Deterministic two-head automata are described that accept the languages a n b n (or, more generally, the strings on a,b having the same number of a 's as b 's); ww; ww R ; and a kn for any fixed k.

TL;DR: Two new types of observers are introduced, termed initial- and lagging-state observers, which are useful for exact state reconstruction during the transient period of an identity observer where the latter is not able to accurately reconstruct the state.

TL;DR: This paper treats the problem of assessing utilities and worths over multi-attributed alternatives and the role of hierarchies in worth assessment, a systematic approach for evaluating complex alternatives under certainty.

TL;DR: This paper presents an optimal realizable solution for a general class of replacement problems in demand-paging systems, and the resulting algorithm subsumes others (including ''A"0'') as special cases.

TL;DR: This paper presents some formal generative specifications for describing the graph languages consisting of the sets of directed graphs with labeled arcs for applications to specification technique for data structures and complexity measure of computer software.

TL;DR: A property is given which permits the construction of a sequence (nxλ), n ϵ[− N, + N] ⊂ Z of pseudostochastically independent sequences nxλ, λ ϵ [− Λ, + Λ] ⍂ Z.

TL;DR: The domain of validity of approximations that are linear in the input pattern are examined, and it is shown that they are valid in the regions of target parameter space.