Showing papers in "Information Sciences in 1979"

TL;DR: The results obtained in part I of the paper are specialized to the case of discrete fuzzy random variables and algorithms are derived for determining expectations, fuzzy probabilities, fuzzy conditional expectations and fuzzy conditional probabilities related to discrete fuzzyrandom variables.

TL;DR: Experimental results show substantial reduction in timings compared with previous algorithms for determining isomorphisms, and a theoretical study of the new path consistency algorithm provides insight into the experimental results.

TL;DR: This definition is compared with Zadeh's definition of using the expected value of A as the probability of A and it is shown that the distinction between these two definitions is based upon the choice of definition for the cardinality of a fuzzy subset.

TL;DR: A formal framework for structuring and embedding the heuristic information is proposed in order to allow an algorithmic computation of the evaluation function ĥ (n) of the classical Hart-Nilsson-Raphael algorithm.

TL;DR: Generalized Chandrasekhar type algorithms are obtained that are applicable to linear time varying as well as time invariant distributed systems and the implications are analyzed.

TL;DR: A three-way tape-bounded two-dimensional Turing machine is introduced, and hierarchical and closure properties of the classes of sets accepted by several types of such machines are investigated.

TL;DR: A minimal-error entropy estimator for linear systems disturbed by Gaussian random processes is easily derived, which is identical to the Kalman filter under non-Gaussian disturbances.

TL;DR: The joint information between a signal at the present and past observation values is calculated in the discrete-time case for a general nonlinear filtering problem and sharp lower bounds for the sensor error covariance are derived.

TL;DR: An objective of this paper is to formulate axioms both for optimizing criteria and the satisficing criterion of this type, and to characterize the latter, without using the aspiration level function and to compare its characterization with those for optimize criteria.

TL;DR: Several basic results on the behavior of learning automata in an environment are shown, which remove some past misunderstandings and give an idea of the automata's behavior.

TL;DR: Algebraic properties of the satisficing decision criterion under a given lattice structure are shown, by the following steps: to embed a partial order, constructed from a vector comparison of payoffs, into some lattice.

TL;DR: It is shown that hierarchies can be obtained by varying the number of counters or the amount of space allowed, for classes of sets accepted by three-way two-dimensional multicounter automata.

TL;DR: It is shown that a language not containing the empty word is recursively enumerable if and only if it is the set of top rows of ( n + 1)-dimensional tapes accepted by an n -DBCA.

TL;DR: This paper investigates closure properties of the classes of sets accepted by four-way and three-way tape-bounded two-dimensional Turing machines whose input tapes are not restricted to square ones.

TL;DR: The categorical setting for patterns and pattern recognition is presented, bringing together several of the previous results and unifying the algebraic syntactic-oriented, automata-theoretical, and topological formalisms.

TL;DR: An axiomatic characterization of the linear weighted sum decision principle is given to find out its essential meaning and whether or not decision principles for the MCDP are applicable to decision making under uncertainty and vice versa.

TL;DR: The simple concept of a well-connected relation (WCR) is defined and then developed into a theory for studying the structure of binary relations and concepts of universal algebra are extended to the family of “prime” relations.

TL;DR: A matrix approach to the solution of the measurement and control problems in synchronous sequential machines is developed, which is very systematic and completely algorithmic, and thus lends itself to easy computer implementation.

TL;DR: A deterministic model for the diffusion of information through a population in which there is continuous replacement by immigration is formulated and studied and criteria are obtained under which the information persists in the population.

TL;DR: The idea of information improvement was introduced by Theil in 1967 to information improvement due to 2 and N revisions is extended to measures characterized by a generalized functional equation.

TL;DR: Extensions of Hamming sphere packing and Varsharmov-Gilbert-Sacks bounds to codes correcting random errors and bursts with weight constraints under the class metric are obtained.

TL;DR: This work has shown that given a “randomly selected” m × n matrix, the probability that it has a saddle point is m!n!

TL;DR: A criterion is developed to verify whether a given real sequence includes a singular part, and an algorithm is given to produce a sequence of random type, having given distribution functions and a correlation function that is stochastically as near as desired to a given one.

TL;DR: Comparative dynamic tests indicate the strong sensitivity of the blue optimal control law and cost-to-go evaluations to the presence of state dependence in the modeling of red activity, underline the importance of incorporating symmetrical rationality into C 3 models if accurate scenario projections are to be obtained.

TL;DR: A clustering procedure is developed, using a combined hierarchical and steepest-descent search procedure in a stepwise algorithm that is shown to be rapidly convergent and both intuitively and comparatively appealing.

TL;DR: A stable bilinear observer is designed, which estimates the state of the system under any constant or even any nonconstant input as long as the input amplitude is bounded below and above.

TL;DR: Much complex decision-making is performed routinely by the software of a computer system, and one of the best opportunities for improving the compiler-produced machine-language program has been in devising efficient policies for assigning quantities to the computer's registers.

TL;DR: The author investigates the hyperstability problem for a broad class of single-control stochastic systems which may be considered as disturbed models of given deterministic systems, and gives conditions for average hyperst stability.

TL;DR: The nearest-neighbor rule and the potential-function classifier are nonparametric discrimination methods that require the storage of a set of sample patterns and an algorithm for establishing identity is introduced.

TL;DR: The class of sets accepted by deterministic on-line n-bounded k-counter machines (k ⩾ 1) is not closed under union, intersection, concatenation, Kleene closure, reversal, or e-free homomorphism.