By Topic

[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications

27-30 March 1991

Filter Results

Displaying Results 1 - 25 of 121
  • Tenth Annual International Phoenix Conference on Computers and Communications (Cat. No.91CH2959-5)

    Publication Year: 1991
    Request permission for commercial reuse | PDF file iconPDF (19 KB)
    Freely Available from IEEE
  • Universal frequency reuse: the CDMA advantage in capacity for digital cellular radio

    Publication Year: 1991
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (28 KB)

    Summary form only given, as follows. Interference among simultaneous users presents the primary limitation on capacity of all multiple access communication systems. In frequency-division-multiple-access (FDMA) and time-division-multiple-access (TDMA) cellular systems, interference is controlled by assigning disjoint frequency or time slots to all users in the same cell and disjoint frequency bands... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation of analog neural networks

    Publication Year: 1991, Page(s):32 - 38
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (532 KB)

    The topics discussed are: architectures of analog neural networks; multilevel or analog DRAM synapses; and a continuous time neural network using a high performance multilevel DRAM system. Neural networks must be implemented in hardware to achieve real time performance. The size and performance of the synapse element play a critical role in the overall system performance. In addition, a long term ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A dynamic token-based distributed mutual exclusion algorithm

    Publication Year: 1991, Page(s):240 - 246
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    The authors present a dynamic token-based mutual exclusion algorithm for distributed systems. In the algorithm, a site invoking mutual exclusion sends token request messages to a set of sites possibly holding the token as opposed to all the sites as in the algorithm proposed by I. Suzuki and T. Kasami (1985). A request set is used to record the identifiers of such a set of sites in the system. The... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A stepwise recognition method of library cataloging cards on the basis of various kinds of knowledge

    Publication Year: 1991, Page(s):821 - 827
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    An experimental method is proposed for extracting individual data items from library cataloging cards and classify them into the cataloging item classes automatically. The basic idea for the recognition strategy is to utilize various kinds of knowledge stepwise on the basis the generation/verification process of object hypotheses. In this approach, such knowledge as layout information of card stru... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resilient memory-resident data objects

    Publication Year: 1991, Page(s):145 - 151
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (692 KB)

    The authors investigate the feasibility of replicated data objects consisting of several memory-resident replicas backed-up by a single append-only long maintained on disk. First, it is shown that such objects can be managed by simple variants of the most popular replication control protocols for disk-resident replicated objects. Second, under standard Markovian hypotheses, the availability of rep... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A variable round-robin arbiter for high speed buses and statistical multiplexers

    Publication Year: 1991, Page(s):23 - 29
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    The author presents the design of a high speed VLSI arbiter than is capable of performing round-robin scheduling for N requests with P possible priority levels. To improve the time and space complexities, the author proposes a centralized variable priority arbiter based on tree-structured cellular automata. Centralized implementation is permitted by the increasing wiring density ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Switching-circuit-free point-to-point audio/data signal transmission through optical fiber

    Publication Year: 1991, Page(s):520 - 528
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    The authors describe a novel switching-circuit-free point-to-point audio/data signal transmission system established by using a sender, optical fibers, and receivers. Each of these is specified by its own address consisting of a single or multiple frequency signals. During the time of transmitting the audio/data signal from the sender to the receivers, a single or multiple frequency address signal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load balancing using semi-private memory

    Publication Year: 1991, Page(s):167 - 173
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB)

    The author introduces the concept of semi-private memory as an architectural means of load balancing. In distributed, message-passing systems, each processing element is typically associated with a private input queue and a private local memory. The semi-private memory concept, however, allows each processing element to service a small, unique subset of the queues and memories that overlaps with t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SERQL: an ER query language supporting temporal data retrieval

    Publication Year: 1991, Page(s):272 - 279
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    A database query language, SERQL (structured entity-relationship query language), which has been developed for production use in telephone network services provisioning systems is described. The language is based on a database model extended from the basic entity-relationship model. These extensions include structured attributes, class hierarchy, and incorporation of the temporal dimension. The au... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rapid upper bounding of margin loss in CP digital systems due to rain-induced XPI

    Publication Year: 1991, Page(s):472 - 475
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (196 KB)

    Simple engineering approximations are given for the loss in margin incurred when, circularly polarized digital signals propagate through rain and some of the signal on each polarization leaks into the channel of opposite polarization to produce cross polarization interference. Good agreement with laboriously derived prior results for typical phase-shift-keyed (PSK) and quadrature-amplitude-modulat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tuning computer communications networks and protocols

    Publication Year: 1991, Page(s):573 - 579
    Cited by:  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB)

    The objective is to adjust the protocol parameters and network elements to achieve maximum data throughput over a certain circuit or set of circuits (a network path) subject to certain constraints, such as: delay-bandwidth product, error rate, and tuning parameter limits and accessibility. To provide optimal performance from the user's perspective, which is application to application, all peer lay... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the validity of assumptions used to model local area networks

    Publication Year: 1991, Page(s):651 - 657
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    The accuracy of analytical and simulation models of local area networks (LANs) is dependent on underlying assumptions about traffic characteristics, and protocols. The authors present a comparison of some of these assumptions about LAN behavior against empirical data on the actual behavior of several LANs. Data concerning the packet size distribution, interarrival distribution, and traffic pattern... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simulating shared memory in message passing model

    Publication Year: 1991, Page(s):232 - 238
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    The authors present an algorithm to simulate shared memory primitives in a message passing system with synchronous processors and synchronous communication. This implies that it is possible to construct emulators that translate algorithms for the shared memory model to that of the message passing model. Also, the results imply that the existence of the solution for a problem in one model guarantee... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Embedding constraint satisfaction in deductive reasoning

    Publication Year: 1991, Page(s):785 - 791
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB)

    The authors describe the Logos reasoning systems and present examples of its advantages. Logos merges two different problem-solving paradigms (constraint propagation and deductive reasoning) into a unified, declarative framework. Constraints are expressed in a declarative language and results of constraint propagation are maintained through a truth maintenance system. Constraint relaxation strateg... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The effect of AI on other fields of research

    Publication Year: 1991, Page(s):848 - 849
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (120 KB)

    The author suggests that artificial intelligence (AI) has brought about an integration of various, apparently unrelated enterprises and has contributed to the enrichment of a number of fields. Topics of interest to AI include reasoning about knowledge, belief and modalities, temporal reasoning, non-monotonic reasoning, reasoning about vagueness, reasoning about uncertainty, and legal reasoning. Th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal end-to-end sliding window flow control in high-speed networks

    Publication Year: 1991, Page(s):601 - 607
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    The performance of the end-to-end sliding window flow control mechanism on a single virtual circuit in the high-speed, wide-area network environment is investigated. The propagation delay is taken into consideration as the dominant delay in the analysis of the sliding window flow control mechanism. A closed queuing network is used to model a single virtual circuit in high-speed networks. Three dif... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new concept learning approach applied in diagnostic systems

    Publication Year: 1991, Page(s):814 - 820
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB)

    The authors first discuss some important issues that should be considered when designing a good learning system and then investigate a concept learning strategy called the MA (memory aggregate) approach. To improve the performance of MA and also to take the important issues into account, a novel version of MA which is more suitable for real world applications is then proposed. To evaluate the perf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Derivation of executable code from formal protocol specifications written in LOTOS

    Publication Year: 1991, Page(s):346 - 352
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB)

    A novel tool for generating implementation prototypes of communication protocols and concurrent systems specified using the ISO LOTOS language is presented. LOTOS specifications are analyzed and translated into C functions that are executed by cooperating processes in the UNIX environment. The set of LOTOS process definitions is first translated into a suitable number of extended finite state mach... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The support for a dynamic parallel object model on a transputer-based architecture

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

    It is shown how a parallel object model can be used as a support environment for massively parallel architectures based on transputer technology. The intention is to verify that parallelism integrates well with such properties of the object paradigm as abstraction, uniformity, and dynamicity. The authors also present the guidelines to build prototypes by an approach based on primitives. In particu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A model for the performance of locking algorithms in distributed database systems

    Publication Year: 1991, Page(s):137 - 144
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (796 KB)

    A method to approximate the mean value of various performance parameters in distributed database systems using locking for concurrency control is proposed. The main contribution of this approach is its ability to model the interactions between resource and data contention and their effects on system performance. The system performance is evaluated at a point where the interaction between these two... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • VLSI-implementable scheme for invariant object recognition

    Publication Year: 1991, Page(s):17 - 22
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB)

    The authors describe the development of a VLSI smart sensor which borrows some mechanisms used by the human eye to generate abstractions of simple line drawings which are invariant with respect to scale and position. It is demonstrated by simulation that a corner-based abstraction method is suitable for generating signatures invariant with respect to scale and position. It is shown that such a sen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Direct-detection APD-based optical CDMA using orthogonal signalings

    Publication Year: 1991, Page(s):513 - 519
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    Direct-detection optical, code-division multiple-access (CDMA) communication systems with avalanche photodiode (APD) photodetectors are investigated. Chernoff upper bound, modified Chernoff upper bound, and Gaussian approximation of the probability of bit error (pbe) are presented for general APDs and {0, 1}-valued optical signature sequences. Multiple-user interference, shot-noise, and receiver t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Continuous phase-coded direct-sequence spread-spectrum multiple-access communications

    Publication Year: 1991, Page(s):441 - 447
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB)

    Performance measures for a class of continuous phase-coded spread-spectrum systems are considered. The error probability can be evaluated if the distributions of the multiple-access interferences (MAI) are available. A method of characterization is used to obtain the conditional distributions of random variables that characterize the MAI given the time delays. Then, these conditional distributions... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed algorithm for resource deadlock detection

    Publication Year: 1991, Page(s):252 - 256
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB)

    A simple algorithm for the problem of deadlock detection in distributed systems is presented. In the proposed algorithm, the authors do not use probe messages to detect deadlock. Instead the authors use the update message whose function is twofold: first to modify the wait-for variables and second to check the occurrence of deadlock. The proposed algorithm ensures that only one process in the dead... View full abstract»

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