Showing papers in "Information Sciences in 1977"

TL;DR: The purpose of this paper is to propose a new type acceptor called the “two-dimensional on-line tessellation acceptor” (denoted by “2-ota”) and to examine several properties of the 2-ota, which might be considered as a real-time mode of rectangular array bounded cellular space.

TL;DR: A modified theorem concerned with the convergence of the random optimization method is given and it is shown that the assumptions used in these proofs are too severe.

TL;DR: It is shown here that a properly truncated SPRT can eliminate this undesirable feature of the sequential probability ratio test, and truncating the SPRT at the sample size needed for the corresponding FSS test serves as a remedy.

TL;DR: The paper describes three extensions of a conceptual model and system into a practical tool for evaluation of existing or proposed database designs: batched transactions, multi-access interference due to shared secondary storage, and variable record size.

TL;DR: This paper presents the first practical general method for constructing LR ( k ) parsers, and a method is provided whereby the work required for phase 1 when k = 1 is at most a linear function of the number of configurations.

TL;DR: The modified version of the definition of fuzzy consensus is used to find the set of all fuzzy prime implicants of a fuzzy switching function as defined previously.

TL;DR: The Bhattacharyya distance for linear gaussian systems is developed and the resulting optimization problem is formulated and the solution is given.

TL;DR: A duality theory for convex functionals is developed and is considered, as an illustration, an entropy maximising model associated with information science.

TL;DR: An algorithm is described which finds all essential prime implicants of a fuzzy function in disjunctive form which does not require expansion of the function before minimization is performed and yields a function representation containing only fuzzy prime implICants of the original function.

TL;DR: The optimal time for trees with a bounded number of nodes is obtained in extending the Firing Squad Synchronization problem to the case of tree connected networks and applying the controlled synchronization of linear arrays.

TL;DR: These results represent the most complete solution to date for the zero crossing statistics of any nontrivial random process.

TL;DR: A new technique for representing complex data structures as labeled graphs and matrices instead of the conventional tree representation is described, giving a generalized and effective means of understanding, visualizing, and analyzing data systems.

TL;DR: A transformation on the automaton is described which makes it amenable to calculations of the probability of deadlock, and it is indicated that the procedures described can also be applied to other types of probabilistic automata modeling other deadlock situations.

TL;DR: This survey reviews the most significant literature on problems concerning characteristic measures of switching functions, and in particular, measures of circuit complexity, formula complexity or length, and delay time required to realize switching functions.

TL;DR: It is shown that the addition of noiseless feedback links from the receivers to the transmitter does not increase the capacity region of strongly degraded two-component DMBCs.

TL;DR: Mathematical properties of the class of TIL systems and of theclass of languages generated by them are investigated.

TL;DR: An unitary formal model is proposed, comprehensive of both the classical state-space and problem-reduction approaches, in order to define a new structure of problem solver that is primarily intended to allow the problem Solver to choose, at each step during the solution process, the best representation for the problem and, hence, the optimal expected search strategy.

TL;DR: It is shown that a simple generalization of time-delayed OL languages gives rise to exactly the EOL languages.

TL;DR: The optimal adaptive estimator structures for a class of doubly stochastic Poisson processes (DSPP) are presented and the structure is used along with a moment assumption to obtain implementable estimators for wavefront estimation in adaptive optics.

TL;DR: An expansion is used in solving for the transition density using concepts of eigenfunctions and eigenvalues, and this reduces the Fokker-Planck equation to a two point boundary value problem.

TL;DR: It is shown that, unlike the case for R 1, monotonicity of g (.) is not a sufficient condition for R 2 (.) to have a global maximum at s = 0 independently of the choice of filter characteristic k .

TL;DR: Three evaluation models are presented, along with a special-case model for estimating related probability distributions, for treating information updating interval in an aspect of systems design termed the “information updating interval.”

TL;DR: It is shown that a stable smoother can be realized as a cascade of two blocks: a discrete smoother producing discrete smoothed estimates and a continuous element reconstructing a continuous estimate.

TL;DR: The random Banach fixed-point theorem is used to establish the existence and uniqueness of solutions of the Volterra integral equation system in some general Banach spaces, and results are used to study the LP(R0) (p ⩾ 1) stability in the mean m (m ⩽ 1) of the system.

TL;DR: It is shown that for the detection and decision criteria chosen for the analysis, the system exhibits a threshold effect determined by the received signal-to-noise ratio, the number of receiving elements in the array, and thenumber of pulses integrated at the envelope-detector output.

TL;DR: It is proved that the optimal cost obtained for the system with the nonobservable parameter is the same as for the Markovian system.

TL;DR: It turns out that if the underlying L structure is strong enough (such as a TOL structure), then all of these definitional mechanisms are of equal power, whereas uncomparability and strict inclusion results are obtained for weaker underlying L structures.

TL;DR: The authors considered the model which is the simultaneously amplitude- and frequency-modulated version of the periodic model and obtained the average spectrum of the more comprehensive model.

TL;DR: Experimental results indicate that the optimal testing sequence can be selected by this procedure, and the least cost testing sequence problem has been considered under the assumption that costs and rejecting probabilities are completely known a priori.

TL;DR: It is shown that there exists a linear algorithm for constructing a Hamiltonian circuit in a connected (3, 1) graph and an n 4 -algorithm for finding a minimum coloring in a (3-1) graph.