scispace - formally typeset
Search or ask a question

Showing papers in "Information Sciences in 1987"


Journal ArticleDOI
Ronald R. Yager1
TL;DR: The basic concepts of the Dempster-Shafer approach, basic probability assignments, belief functions, and probability functions are discussed, and how to represent various types of knowledge in this framework is discussed.

1,480 citations


Journal ArticleDOI
TL;DR: A new algebraic structure called the conditional closure LL of a Boolean logic L is defined, consisting of the ordered pairs (q¦p) of all propositions of L excluding those for which the condition p is equivalent to 0, that is, impossible.

106 citations


Journal ArticleDOI
TL;DR: The necessary and sufficient condition for such distance functions to satisfy the properties of a metric has been derived and certain practical and efficient methods to check for metric properties are presented.

88 citations


Journal ArticleDOI
TL;DR: It is shown that lower dimension distance measures presently used in digital geometry can easily be derived as special cases from generalized distance measure called m-neighbor distance in n-D quantized space.

61 citations


Journal ArticleDOI
TL;DR: It is shown that none of the existing algorithms can perform in the most general type of hierarchical problem, and an algorithm for learning the globally optimal path in this general setting is presented, and its convergence is established.

59 citations


Journal ArticleDOI
TL;DR: The complexity of the algorithm for two-dimensional pattern matching in the presence of errors is O, where the pattern is an n 1 × n 2 array, the text is an m 1 × m 2 array and k is the number of mismatches allowed.

42 citations


Journal ArticleDOI
TL;DR: A divide-and-conquer algorithm is developed which solves the problem directly rather than by solving two subproblems, treats special cases elegantly, and has a simple implementation.

40 citations


Journal ArticleDOI
Ronald R. Yager1
TL;DR: This work studies the use of different set operators to implement different semantic operations and makes a careful distinction between conjunctive and disjunctive type information.

34 citations


Journal ArticleDOI
TL;DR: All problem sets for which p( v) or t(v) grows extremely rapidly or extremely slowly can be solved in polynomial average time and it is shown that backtracking requires exponential average time.

32 citations


Journal ArticleDOI
TL;DR: Using a geometry defined by the second derivative matrix of the information-theoretic entropy function, a bound on the number of excess channel symbols (the redundancy) sent by a retrospective encoder during a fixed time interval is derived.

18 citations


Journal ArticleDOI
TL;DR: The method of stochastic high level Petri nets (SHLPN) is applied to model the performance of these PDE splitting algorithms on a Multi- flex machine to project potential speedup of 300 for 2D problems and more for 3D problems along with processor utilization of over 99 percent.

Journal ArticleDOI
TL;DR: A simple recursive algorithm for the generalized Towers of Hanoi contest with arbitrary starting and ending n-configurations is presented, which always finds a shortest path between a pair of n- configuration, and is therefore optimal.

Journal ArticleDOI
TL;DR: The divide-and-conquer strategy and a pipelining discipline are applied to theorem proving in propositional logic and it is shown that the processing time to solve such an NP-complete problem is of O ( mn).

Journal ArticleDOI
TL;DR: It is shown that Shannon's coding theorem allows one to precisely define the sense in which information is transmitted by an economic market, and that the natural extension of the multiple agent market is the multiple access information channel.

Journal ArticleDOI
TL;DR: It is shown that a reasonably flexible interprocess communication can be supported with only a small increase in complexity and overhead.

Journal ArticleDOI
TL;DR: This paper presents distributed algorithms for some graph problems on a network model of computation, including breadth-first and breadth-depth searches of graphs, recognition of directed acyclic graphs and strong connectedness, finding weights of all the shortest paths from a single source to all other nodes in a weighted directed acYclic graph, and analyzing activity networks.

Journal ArticleDOI
TL;DR: An approach to database analysis and design, utilizing predicate calculus in the “infospace,” i.e. in the space of the attributes, which underlies the "projection-solid infospatial approach” to the decomposition of noncanonical-query retrieval into steps enjoying the consecutive-retrieval property.

Journal ArticleDOI
TL;DR: A general solution of the problem of diagnosability of a system under this model is presented with the assumption that all failures in the system are of permanent kind.

Journal ArticleDOI
TL;DR: A new method of specifying the syntax of programming languages, known as hierarchical language specifications (HLS), is proposed, and efficient parallel algorithms for parsing languages generated by HLS are presented.

Journal ArticleDOI
TL;DR: This approach provides a practical solution to the modeling of real-world problems using first the extended ER model and then its refinement into the relational model.

Journal ArticleDOI
TL;DR: The characterization of random-context array grammars and random- Context structure grammARS by two-dimensional random- context array automata and three-dimensionalrandom-context structure automata respectively is investigated.

Journal ArticleDOI
TL;DR: Concepts of contextual preserved deformations (CPD) and contextual variant deformation (CVD) are proposed, as are algorithms for optimal pattern matching under CPD and CVD conditions.

Journal ArticleDOI
TL;DR: Reliability and performance availability are used to characterize and evaluate the dependability of these architectures and the reliability-and-CCA model for the multicomputer graph accepts the adjacency matrix as the input and hence is suitable for all types of networks.

Journal ArticleDOI
TL;DR: Two new algorithms for the direct parallel solution of systems of linear equations using a novel recursive doubling technique to obtain solutions to an nth-order system in n steps with no more than 2n(n −1) processors are presented.

Journal ArticleDOI
TL;DR: The generalized theory of marginal certainty and information measures, as introduced by Van der Lubbe et al.

Journal ArticleDOI
TL;DR: The notion of an FD system on a semilattice as a generalization of the concept of a closed set of functional dependencies is introduced, and lattice-theoretical properties of those objects are studied.

Journal ArticleDOI
TL;DR: This work considers generalized additive models which under the sum property get transformed into a generalized functional equation that characterize the generalized information measures with preference order β.

Journal ArticleDOI
TL;DR: This algorithm is the fastest iterative algorithm for solving the cyclic towers of Hanoi problem and is bounded by a constant per disc move.

Journal ArticleDOI
TL;DR: New passability condition is defined which includes the now well-known condition of passability of permutations as a special case and it is shown that the base-line network is very robust in the sense that it can pass a variety of random inputs in much the same way as it handles the set of passable permutations.

Journal ArticleDOI
TL;DR: This work provides an algorithm to compute the orthogonal-convex-hull partition of a set of p Orthogonal polygons in O ( n log p ) time and O (n ) space, where n is the total number of vertices of the p polygons.