Showing papers in "Information Sciences in 1981"

TL;DR: A function to help in the ordering of fuzzy subsets of the unit interval is introduced, which is the integral of the mean of the level sets associated with the fuzzy subset.

TL;DR: Epistemic probabilities are better described by belief functions and their definition is extended in order to apply them to fuzzy events.

TL;DR: Using dynamic programming principles, an algorithm is presented which yields X+ without computing individually the distances between every word of H and Y, and it can be shown that it is, in general, computationally less complex than all other existing algorithms which perform the same task.

TL;DR: An algorithm is presented that calculates the distance from the center of each black node to the border of the nearest white node, and the worst-case average execution time is shown to be proportional to the product of the logarithm of the image diameter and the number of blocks in the image.

TL;DR: Using the theory of uniformly distributed sequences, a sufficient condition for a one-letter language to be nonstochastic is presented and among the applications is the result that {ap¦p is a prime} is nonStochastic.

TL;DR: Conditions under which a decision criterion is a satisficing one or not, from given information about preference ordering and choice set are shown, under the conditions represented by six axioms.

TL;DR: A class of lower bounds is considered which unifies and extends some well-known bounds on the Bayesian probability of error by considering the ƒ-divergence between two hypotheses.

TL;DR: The author has extended Shannon's entropy to subsets of n-dimensional Euclidean space, n = 1,2,3,….

TL;DR: The fundamental period of the sequence of outputs of the cascade machine β ← a consisting of β driven by α's outputs is no larger than AB, and if every output of α is smaller than B and S is relatively prime to B, then the fundamentalperiod of the output sequence of this cascade machine is exactly AB.

TL;DR: This paper deals with the problem of estimating an unknown transmitted string Xs belonging to a finite dictionary H from its observable noisy version Y, and develops an algorithm to find the string X+H which minimizes the generalized Levenshtein distance D(XY).

TL;DR: It is shown that there exists a deterministic array-bounded PDA which can traverse any simply connected pattern and halt when the traversal is complete.

TL;DR: It is shown that all languages defined by polynomials whose coefficients are natural numbers are in M∩(prod)—the smallest intersection-closed semiAFL containing the language prod, which implies that the corresponding full semiAflM∩ (prod) is equal to the smallest intersections-closed full semi aFL containing all recursively enumerable bounded languages.

TL;DR: Selective substitution array grammars are introduced, which abstract the notions of rewriting rules, direct derivation steps, derivations and rewriting in a sequential or parallel way to provide a unified framework for many of the two-dimensional array Grammars in the literature.

TL;DR: The assessment of the relative extent to which a given member of a designated set of objects exhibits a characteristic of interest which is determined qualitatively through pairwise comparisons between the objects in question is considered.

TL;DR: An algorithm is described which builds the asymptotic decision tree in breadth-first order, node by node, starting at the root, starting from the root of the DTs.

TL;DR: The real and continuous solutions of the generalized functional equations have been obtained and two new generalized measures of useful information have been characterized and their particular cases have been studied.

TL;DR: The joint gray-level probability density for pairs of points at given separations is used to derive various second-order image statistics, including the autocorrelation, edge density, and variogram, which can be used for fitting models to a given ensemble of images.

TL;DR: Digital patterns generated by a class of random geometric processes proposed as models for images are dealt with and expressions for the expected area and width of a connected component, the expected number of components, and the expected total perimeter are derived.

TL;DR: Necessary and sufficient conditions for a general class of learning algorithms to be an absorbing-barrier algorithm are given and examples of absorbing- barrier learning algorithms whose asymptotic behavior is so far unknown are described.

TL;DR: A method is presented for the parallel evaluation of optimal-control problems using an iterative method of dynamic programming based on the application of the interaction prediction principle by which the global optimal- control problem is reduced to the optimization of subproblems.

TL;DR: The classical sampling series of a non-band-limited harmonizable second order random signal is shown to converge to the signal in quadratic mean and in certain cases with probability one, and rates of convergence are derived.

TL;DR: The class of basic linear systems is introduced as the meaningful subclass of time systems, and their properties and representation theory are discussed in terms of category theory.

TL;DR: Digital patterns generated by a class of random geometric processes proposed as models for images are derived by derives expressions for the expected area and width of a connected component, the expected number of components, and the expected total perimeter in such patterns.

TL;DR: The definitions and properties of well-known network topology for the three-dimensional case are extended and its network dual and retrieval dual, as defined later, are interesting and useful.

TL;DR: A model of ultrafuzzy team decision in a dynamic environment with real-time constraints is proposed and some results on fuzzy sets of type 2 induced by mappings are given.

TL;DR: An alternate proof is provided for the extension of Berger's Theorems 2.5.2 and 4.2.2 to abstract spaces originally discovered by Csiszar, which follows closely the original arguments of Berger.

TL;DR: The authors have axiomatically characterized the Shannon entropy using cyclic symmetry and found that Shannon entropy is determined by the inequality of the following type: the number of bits in a solution to the identity problem.

TL;DR: The implementation is based on using the associative memories for storing various tables that are maintained by the assembler during different phases of assembling, which results in less assembling time and main storage requirements than its software counterpart.

TL;DR: It is shown that the class of languages accepted by the first type of OPSA is incomparable with the 2-D finite-state languages, whereas theclass of languages Accepted by the second type contains the2-D infinite- state languages.

TL;DR: This paper quantifies the “filtering” capabilities of a filter by three measures and characterizes two forms of universal filter bases and establishes a distance measure (a metric) between filters.