By Topic

Computing and Information, 1992. Proceedings. ICCI '92., Fourth International Conference on

Date 28-30 May 1992

Filter Results

Displaying Results 1 - 25 of 113
  • Proceedings. ICCI '92. Fourth International Conference on Computing and Information (Cat. No.92TH0448-1)

    Publication Year: 1992
    Request permission for commercial reuse | PDF file iconPDF (20 KB)
    Freely Available from IEEE
  • Search operations on distributed directories

    Publication Year: 1992, Page(s):445 - 448
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB)

    The ISO's X.500 directory service provides agents with information about entities within a distributed environment. The standard identifies information (entry data) to be maintained by the directory as well as information (knowledge) that is used by the directory agents to facilitate cooperative activity, such as searching, updating and manipulating entry data. It does not address the implementati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed production system for problem solving

    Publication Year: 1992, Page(s):245 - 248
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB)

    Much work has been done in improving the efficiency of production systems, but single PS models are not suitable for applications in distributed problem solving. To address such multiagent behaviours problem solving the authors present a distributed asynchronous production system model (DAPS), where multiple production systems (PSs) co-operate to solve a problem. In DAPS the PSs run highly asynchr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Theory of deductive systems for protocol verification

    Publication Year: 1992, Page(s):422 - 425
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    The development of communication protocol is complicated by the fact that it involves the flow control and synchronisation of many processes. To increase the reliability, verification is an important stage of development of communication protocol. A new approach, deductive systems, for the verification of communication protocol, has been investigated. The authors present the theories of deductive ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concurrent use of parallel communication to enable remote visualization

    Publication Year: 1992, Page(s):449 - 452
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB)

    Visualization of scientific data is the subject of much recent research. The computational power needed to produce animated sequences in near real time is great and, while not locally available to many research facilities, can be provided remotely. Significant bandwidth is required to deliver animated images in real time, and is normally not available without dedicated network lines. This paper in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiagent planning using a reason maintenance system

    Publication Year: 1992, Page(s):249 - 252
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB)

    The article presents an application of reason maintenance systems for distributed reasoning about actions in multiagent planning. An important problem in multiagent planning is reasoning about shared resources. An action proposed by one agent on a shared resource may, in general, affect the status of the partial plans of other agents. The article maintains the dependencies of states of resources o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A measure of fault-tolerance for distributed networks

    Publication Year: 1992, Page(s):426 - 429
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (348 KB)

    The authors consider probabilistic networks having links that are perfectly reliable but nodes that fail randomly and independently with known probabilities. They define a fault-tolerance measure of such network that is directly affected by the choice of its underlying graph and the location of its node-components. A state of the network is tolerant if the currently operating nodes comprise a conn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel reduction of a chain query in distributed databases

    Publication Year: 1992, Page(s):453 - 456
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB)

    This paper extends the results of P.A. Bernstein and D.W. Chiu (1981), P.A. Bernstein and N. Goodman (1981), and J.D. Ullman (1988), by constructing a parallel algorithm for a subset of tree queries called chain queries. An efficient parallel algorithm for a construction of full reducers for chain queries is presented and analyzed. The authors claim that the full reduction of a chain query can be ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal allocation for partially replicated database systems on ring networks

    Publication Year: 1992, Page(s):470 - 473
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    The authors consider a distributed database with partial replication of data objects located on a ring network. Certain placements of replicated objects optimize the probability of read-only success and the probability of write-only success. The authors also obtain optimal placements for k-terminal reliability and expected minimal path length for read-only and write-only operations View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Counting and generating integer partitions in parallel

    Publication Year: 1992, Page(s):54 - 57
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB)

    The author presents parallel shared memory algorithms for counting the number of partitions of a given integer N, where the partitions may be subject to restrictions, such as being composed of distinct parts, of a given number of parts, and/or of parts belonging to a specified set. The author shows that this can be done in polylogarithmic parallel time, although the algorithm requires an ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An incremental concept formation approach to acquisition of anaphoric regularity in Mandarin Chinese

    Publication Year: 1992, Page(s):278 - 281
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB)

    A modified version of the incremental learning model of Lebowitz's UNIMEM (1986) is proposed. This new model is called G-UNIMEM which is motivated from natural language acquisition study. It can extract causal relations from a set of training instances annotated with specified cause and goal features. The experiment is carried out on the acquisition of anaphoric regularity in Mandarin Chinese View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SELSYN-C: a self-synchronizing parallel programming language

    Publication Year: 1992, Page(s):143 - 146
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB)

    The authors report their design and implementation of a new self-scheduling parallel programming language, SELSYN-C. Their approach to the challenge of parallel programming language design and implementation is two-fold: (1) the design of simple extensions to C that are both easy to use, and useful for effective compilation, and (2) the design of efficient and effective scheduling strategies that ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A method of processing unknown attribute values by ID3

    Publication Year: 1992, Page(s):253 - 256
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB)

    The original inductive learning algorithm ID3 assumes that all attribute values of all examples are available both within the learning and classification process. Several techniques of processing of unknown attribute values by ID3 have been designed and implemented. The paper firstly briefly surveys these techniques, then discusses the authors' modified technique for unknown value processing and c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effects of network protocols on distributed concurrency control algorithm performance

    Publication Year: 1992, Page(s):301 - 306
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    The paper reports initial findings regarding the performance of a centralized and a distributed concurrency control protocol for distributed DBMS. It was implemented on two network architectures-bus and ring-using their communication protocols-Ethernet CSMA/CD and token ring. The results indicate that there are design decisions regarding the suitability of certain network architectures and protoco... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-tolerance for multistage interconnection networks

    Publication Year: 1992, Page(s):430 - 435
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    A new fault-tolerant multistage interconnection network architecture is proposed. Using k redundant processors and f redundant switching elements per stage, the authors scheme can tolerate any k processor failures and any f switching element failures per stage. A fault-tolerant multistage interconnection network constructed using their scheme can operate as if i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed kernel for virtual time driven applications

    Publication Year: 1992, Page(s):457 - 460
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB)

    The advent of distributed memory parallel machines turns the design and implementation of dedicated environments feasible for distributed applications. This paper addresses such a realization by presenting a distributed kernel, called FLORIA, whose aim is to provide a virtual time environment for application programs (distributed discrete event simulation is the most known of the applications base... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-tolerant CSP

    Publication Year: 1992, Page(s):474 - 477
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB)

    In a network of communicating processes performing a distributed computation, one can replicate some or all of the communicating processes on different nodes to increase successful probability of the distributed computation against node failures. The authors use communicating sequential process (CSP) to express this scheme by appropriately translating the commands which communicate with replicated... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finding strongly connected components of circle cover graph in one-dimensional

    Publication Year: 1992, Page(s):58 - 61
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    Given a set C={c1, c2, . . ., cn} of n circles in the plane, the circle cover graph is the digraph G(C)=(V, E) where a vertex υi in V stands for the center of circle ci, and a directed edge <υi, υj> in E if and only if circle ci covers the center of circle cj. The author... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reduction of constraint networks based on local consistency

    Publication Year: 1992, Page(s):282 - 285
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    The paper proposes a new approach to reduce a constraint network so that a backtrack-free search may be used, based on local consistency. It shows that this approach can be used to solve efficiently a large class of the constraint satisfaction problem View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spinal cellular automata

    Publication Year: 1992, Page(s):18 - 21
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB)

    A special class of two-dimensional cellular automata (spinal automata) is defined. It is shown that the question whether a spinal automaton is injective is decidable, and the question whether a spinal automaton is reversible is decidable. In general those questions for two-dimensional cellular automata are undecidable. As language recognizers, the authors show that spinal automata are much more po... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A visual concurrent LISP environment and its application

    Publication Year: 1992, Page(s):114 - 117
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB)

    In the multiparadigm programming environment VOCOL, an attempt is made to integrate the visual, functional, concurrent and object-oriented programming paradigms. VCLISP, a visual concurrent LISP environment, is developed both as a stepping stone to this multiparadigm environment and as a stand-alone programming environment. The design of the VCLISP system and its various facets, including LISP pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • NLUS-a Prolog based natural language understanding system

    Publication Year: 1992, Page(s):204 - 207
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB)

    NLUS is a Prolog-based natural language understanding system, which exploits multi-knowledge representation formalisms. Sentences input from the user are converted into semantic networks and/or production rules; whereas the grammar rules are represented in predicate logic. After processing a sentence, the software may initiate its inference engine to deduce a response. A question would also be par... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithms for a k-tree core of a tree

    Publication Year: 1992, Page(s):38 - 41
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (268 KB)

    The authors define a generalization of a core which they call a k-tree core. Given a tree T and parameter k, a k-tree core is a subtree T' of T containing exactly k leaves that minimizes d(T')=Συ∈V(T)d (υ, T'), where d(υ, T') is the distance from vertex υ to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic genericity in imperative languages: example in CML

    Publication Year: 1992, Page(s):96 - 99
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB)

    Genericity, a form of polymorphism, is implemented through generic abstract data types (GADTs) generators in most modern programming languages. The GADTs are used for both compile time (static) and run time (dynamic) instantiations of concrete abstract data types. The paper introduces the implementation of a new approach to dynamic genericity which utilizes the polymorphic GADT feature in a secure... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Unraveling mechanisms in vesicular dataflow model

    Publication Year: 1992, Page(s):147 - 152
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB)

    The vesicular dataflow (VDF) model has been proposed as an extension to the classic dataflow (DF) model to strengthen its potential. Vesicles are places where tokens can be stored and retrieved from. State-dependent computations are possible following the dataflow principle. Embedding of the unraveling mechanisms directly to the dataflow programs can be accomplished by employing vesicles. The flex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.