By Topic

Proceedings ICCI `92: Fourth International Conference on Computing and Information

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
  • An efficient parallel algorithm for the assignment problem on the plane

    Publication Year: 1992, Page(s):110 - 113
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB)

    The authors consider a parallel algorithm for minimum weight perfect matching on complete bipartite graphs induced by two disjoint sets of points on the plane. The algorithm is designed for the EREW PRAM or EREW RPRAM model of parallel computation with p (a function of n) processors. For points on the Euclidean plane, the algorithm executes in O(n3/p... 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.
  • Efficient directory management for distributed naming

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

    In a distributed system, accesses to an object may come from many nodes. The name of an object may need to be resolved at those nodes. To improve the efficiency and availability of name resolution, a directory file is often replicated at several nodes. Consistency control of data replicas becomes an important issue in such systems. By using the special consistency requirements of naming services a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing the time cost of parallel structures by scheduling parallel processes to access the critical section

    Publication Year: 1992, Page(s):123 - 127
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB)

    In a shared-memory parallel processing environment there are a number of inherent hardware and software bottlenecks. One of these bottlenecks is the exclusive accesses that are needed to the shared variables within a critical section. The time cost of synchronization of processes which require access to the critical section can be minimized by using optimal scheduling methods. This paper presents ... 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.
  • Space efficient parallel buddy memory management

    Publication Year: 1992, Page(s):128 - 132
    Cited by:  Papers (2)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB)

    Shared memory multiprocessor systems need efficient dynamic storage allocators, both for system purposes and to support parallel programs. Memory managers are often based on the buddy system, which provides fast allocation and release. Previous parallel buddy memory managers made no attempt to coordinate the allocation, splitting and release of blocks, and as a result needlessly fragment memory. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Knowledge elicitation and integration from multiple experts

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

    The idea of this paper is based upon the belief that each person has his (or her) own habitual domain, in which he (or she) used to solve problems by his (or her) own way. If a person's habitual domain can not cover the problem to be solved, he (or she) will feel diffident and uneasy, and incorrect decisions may be made. For an expert to solve a problem within his (or her) habitual domain, overcon... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Global snapshots for distributed debugging

    Publication Year: 1992, Page(s):436 - 440
    Cited by:  Papers (2)  |  Patents (52)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    The widespread adoption of distributed computing has accentuated the need for an effective set of support tools to facilitate debugging and monitoring. In providing such support, one fundamental problem is that of constructing a global snapshot or global state of a distributed computation. This paper examines global snapshot algorithms from a distributed debugging perspective, and proposes an abst... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A data-parallel language and its compilation to a formally defined intermediate language

    Publication Year: 1992, Page(s):133 - 134
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB)

    Is it possible to design a language based on concepts well known to most programmers that can be used as a tool for efficient parallel programming? The goal is to use a basically serial language in which inherent parallelism is expressed precisely enough for a compiler to generate very efficient code. The authors believe that a good starting point is the data parallel programming style, which heav... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of expert system to the evaluation of project alternatives

    Publication Year: 1992, Page(s):212 - 215
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (260 KB)

    This paper presents an application of the knowledge based expert system to the evaluation of environmental project alternatives, based on Saaty's analytic-hierarchical process. Priorities of criteria and the degree of criterion fulfilment of the alternative were obtained by calculating eigenvectors of matrices, filled by interdisciplinary group of experts. To obtain the overall ranking of environm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation of Futurebus+ for a GMMP multiprocessor

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

    One of the most popular approaches for increasing computer performance is parallel computations using specialized hardware. Clearly, the authors would like to use standardized technology wherever possible in such multiprocessors, in order to minimize the number of unique components that must be (re)designed for each generation of the machine. This paper presents the result of a modelling study tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shortest m-watchmen routes for histograms: the minmax case

    Publication Year: 1992, Page(s):30 - 33
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB)

    The authors consider the problem of computing an optimum set of watchmen routes in a histogram. A watchman, in the terminology of art galleries, is a mobile guard and in this version one wants to minimize the length of the longest route in the solution. The authors give an O(n2 log n) time algorithm to compute the MinMax optimum set of m watchmen in a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient algorithms for computing matching and chromatic polynomials on series-parallel graphs

    Publication Year: 1992, Page(s):42 - 45
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB)

    The authors present efficient algorithms for computing the matching polynomial and chromatic polynomial of a series-parallel graph in O(n3) and O(n2) time respectively. Their algorithm for computing the matching polynomial generalizes an existing result from Lovasz, Plummer (1986) and the chromatic polynomial algorithm improves the result given by Hunt, Ravi, Stearn (1988) fr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-checking against formal specifications

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

    The authors use an algebraic technique of formally specifying a module that implements an abstract data type, with a C++ implementation. An explicit mapping from implementation states to abstract values is added to the C++ code. The form of specification allows mechanical checking of desirable properties such as consistency and completeness, particularly when operations are a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • AI in real time: is this feasible?

    Publication Year: 1992, Page(s):286 - 289
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB)

    The paper tackles the problem from the real-time engineer's perspective. It analyses, first, AI requirements of real-time control systems, then presents available solutions and discusses their suitability. Finally, it outlines two preferable approaches: advance computations and triggered computations, illustrated by an implementation of the radiation detection system View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hyper Petersen network: a fault-tolerant multiprocessor topology

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

    The authors propose and analyze a new hypercube-like topology, called the hyper Petersen (HP) network, which is constructed from the cartesian product of a binary hypercube and the Petersen graph. The properties of HP topology include regularity, high degree of symmetry and connectivity, and small diameter. For example, an n-dimensional HP network with N=1.25*2n nodes is a regular graph... 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.
  • Visual database interface for end user computing

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

    This paper proposes a new interface, visual database interface (VDI), for the novice end users to design, implement and query the database systems. The semantic data model used by VDI is an enhanced ER model (EER) with the inclusion of generalization/specialization, aggregation and categorization abstractions. The tools available in VDI include a graphical EER diagrammer for conceptual design and ... 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.
  • Questionnaire analysis by decision algorithm generation

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

    With the growing importance of marketing in Poland, questionnaire studies of companies are becoming more common. The results of such studies can be presented in table form, where firms are characterized by a set of attributes and by classifications made by experts. An important practical problem is to develop a representation of this system which is free from redundant information. The rough sets ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of latency tolerant architectures

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

    The authors analyze a single processor multithreaded architecture using stochastic timed Petri net (STPN) model to study the effects of various parameters such as memory latency and thread runlength, on processor utilization. They first perform a simple analysis of the basic model with constant values for the parameters. This is followed by an extension with stochastic parameters. A detailed simul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A graph testing concurrency control protocol for object bases

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

    Presents a protocol for concurrency control in object bases. The object bases model of Hadzilacos and Hadzilacos (1991) is used as a framework to describe the protocol and to derive a proof of correctness. The protocol accepts all correct executions. A definition of order preserving serializability suitable for the model is also presented. A slight modification of the protocol ensures that the pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 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.
  • User modeling and control in Adele system

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

    Development and maintenance of large software involves teams where each person has specific responsibilities and capacities in the software process. Software engineering environments (SEE) should provide ways of controlling human responsibilities and capacities. These characteristics are often modeled in terms of roles. People may play different roles at different times, and a given role may be pl... View full abstract»

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