skip to main content
10.1145/131214acmconferencesBook PagePublication PagescscConference Proceedingsconference-collections
CSC '92: Proceedings of the 1992 ACM annual conference on Communications
ACM1992 Proceeding
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
Conference:
CSC92: ACM 20th Annual Computer Science Conference Kansas City Missouri USA March 3 - 5, 1992
ISBN:
978-0-89791-472-7
Published:
01 April 1992
Sponsors:

Bibliometrics
Abstract

No abstract available.

Article
Free
Practical trade-offs for open interconnection

There is increasing market pressure to provide support for the open interconnection of systems via general purpose protocol suites such as OSI and TCP/IP. The complexity of these protocols means that the achievement of acceptable performance is not ...

Article
Free
A vacation model for interconnected FDDI networks

Metropolitan Area Networks (MANs) have the potential to be interconnected in such a way that the resulting wider, composite network will be still capable of managing integrated services such as video, voice and data. In this paper we develop an ...

Article
Free
Synthesizing communication protocol converter: a model and method

A method for synthesizing a protocol converter with a High Level Petri Net (HLPN) model will be presented in this paper. The services provided by the underlying protocols will first be converted, and then the protocol converter will be derived from the ...

Article
Free
A message priority assignment algorithm for CAN based networks

Controller Area Network (CAN) defines a very efficient medium access control protocol. This protocol solve conflict message transmission conflicts through message priorities, and results in a high channel utilization and short message delay for higher ...

Article
Free
Towards an interaction level for object-oriented geographic database systems

Geographic database systems are large and complex systems characterized by a high degree of interactivity. Though the object-oriented approach is powerful enough for the representation of geographic information, the availability of a flexible and easy-...

Article
Free
The *M-ary tree and *Ternary hillsort

Sorting is a significant activity for which better methods are always sought. In many computing scenarios, sorting must be done with the majority of data items remaining on an auxiliary storage device. This paper introduces a new data structure, the *M-...

Article
Free
The DIAMOND security policy for object-oriented databases

A formal data model and integrated multilevel security policy for object-oriented database systems are presented in this paper. The security policy addresses mandatory as well as discretionary security controls. Classes derive security classification ...

Article
Free
An integrated data structure with multiple access paths for database systems

This article presents an integrated data structure which offers multiple access paths for processing different types of queries efficiently. The data structure is developed by fusing the B+ - tree, the grid file and extendible hashing structures using a ...

Article
Free
Computing prime implicates

This paper surveys three methods for computing the prime implicates of a set of propositions (ie., minimizing a boolean function) and performs a comparison between them. Data is provided which suggests that methods based on resolution can be as ...

Article
Free
Automatic program generation using sequent calculus

Program development can be made amenable to formal methods by using a logical framework. A logic specification, whose operational semantics is based on proof theory, provides an abstract and “implementation independent” definition of the problem, the ...

Article
Free
Article
Free
Beyond Turing: a knowledge based model relativistic Cn machine

We extend some Turing notions of computation, from over the integers Z, to computation over complex variables C. Corresponding to scientific problems, we implement knowledge based heuristically developed Prolog databases for visualizing and symbolically ...

Article
Free
Different perspectives of the N-Queens problem

The N-Queens problem is a commonly used example in computer science. There are numerous approaches proposed to solve the problem. We introduce several definitions of the problem, and review some of the algorithms. We classify the algorithms for the N-...

Article
Free
Optimization in a distributed processing environment using genetic algorithms with multivariate crossover

We set out to demonstrate the effectiveness of distributed genetic algorithms using multivariate crossover in optimizing a function of a sizable number of independent variables. Our results show that this algorithm has unique potential in optimizing ...

Article
Free
Self-stabilizing deadlock detection algorithms

A distributed system consists of a set of loosely connected state machines which do not share a global memory. All the possible global states of the system can be split up into legal and illegal states. A self-stabilizing system is a network of ...

Article
Free
A sequential abstract machine for a distributed logic language

Delta Prolog is a concurrent logic programming language founded on the theoretical model of Distributed Logic and extending the Prolog language in order to allow the specification of concurrent systems. This paper describes Delta Prolog, its operational ...

Article
Free
Visualization in network topology optimization

The intrinsic complexity and the geometric nature of network topology optimization lends itself to visual human-computer interaction. We have applied techniques of scientific visualization to all the aspects of network design, and have designed ...

Article
Free
A graphical interface for analysis of communication protocols

In this paper we describe a graphical interface that is an effective tool for displaying and analyzing communication protocols. Asynchronous distributed systems, and communication networks in particular, are often very complex and the interactions ...

Article
Free
Abstract Personal Communications Manager (APCM)

The Abstract Personal Communications Manager (APCM) is an Application programmers Interface (API) for telecommunications, providing simple and powerful interaction between communication applications and protocol software for circuit switched connections ...

Article
Free
The architecture of a heterogeneous distributed database management system: the distributed access view integrated database (DAVID)

This paper describes the architecture of a heterogeneous distributed database management system called the Distributed Access View Integrated Database (DAVID). The DAVID system allows uniform access to distributed data stored in different DBMSs that ...

Article
Free
Concurrency control in real-time database systems

Efficient concurrency control protocols are required in order for it to be possible to schedule real-time database transactions so as to satisfy both real-time constraints and data consistency requirements. In this paper, two new real-time concurrency ...

Article
Free
Multiple object representations
Article
Free
A dual knowledge representation for a domain-independent Intelligent Training System

A dual knowledge representation is discussed which encompasses the instructor's organization of pedagogical knowledge and the domain expert's structuring of conceptual knowledge. This representation forms the basis of the knowledge structures of ITS ...

Article
Free
Knowledge representing schemes for planning

An investigation of recent development of planning systems is performed, with emphasis on issues of knowledge representation, and the possible solutions for representing the effects of actions are pointed out.

Article
Free
Use of genetic algorithms for optimization in digital control of dynamic systems

This paper presents a method to optimize proportional-integral-derivative (PID) control parameters, given a discrete model of the controlled process. This method is based on Holland's genetic algorithm (GA). It does not require a mathematical model of ...

Article
Free
Load balanced deadlock-free deterministic routing of arbitrary networks

This paper provides efficient algorithms to deadlock-free route arbitrary multiprocessor interconnection networks as follows:

  • 1. An algorithm is derived for fixed directory routing on an arbitrary network topology such that messages will be routed via ...

Article
Free
A paradigm for distributed debugging

Three critical problems associated with distributed debugging are controlling the debugging process in the absence of a global clock; maintaining transparency so that the debugger does not change the order or timing of events, and reproducing an ...

Contributors
  • University of Missouri-Kansas City
  • University of Pennsylvania
  • Kansas State University

Index Terms

  1. Proceedings of the 1992 ACM annual conference on Communications

      Recommendations