By Topic

Communications, Computers and Signal Processing, 1997. 10 Years PACRIM 1987-1997 - Networking the Pacific Rim. 1997 IEEE Pacific Rim Conference on

Date 20-22 Aug. 1997

Go

Filter Results

Displaying Results 1 - 25 of 127
  • 1997 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing [front matter]

    Publication Year: 1997, Page(s):i - xxiii
    Request permission for commercial reuse | PDF file iconPDF (1060 KB)
    Freely Available from IEEE
  • Reed-Solomon coding and GMSK modulation for digital cellular packet data systems

    Publication Year: 1997, Page(s):745 - 748 vol.2
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB)

    The structure of a digital cellular packet data (CDPD) network is briefly explained with the aid of a general block diagram. The air-interface represents the most error-prone portion of the CDPD network. To protect user's data, CDPD employs Reed-Solomon (RS) codes. RS codes and their single burst error correcting capabilities are described. A parameter that measures how efficiently the random erro... View full abstract»

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

    Publication Year: 1997, Page(s):0_2 - 0_5
    Request permission for commercial reuse | PDF file iconPDF (233 KB)
    Freely Available from IEEE
  • Designing meta-interfaces for object-oriented operating systems

    Publication Year: 1997, Page(s):989 - 992 vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    Modern multimedia applications place ever-growing performance and flexibility demands on operating systems. Unfortunately, many existing operating systems are inflexible; because of their monolithic nature, they cannot be easily changed to accommodate these demands. Some flexibility can be gained by decomposing such monolithic systems into microkernels and user-level components. Creating and modif... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of an object-oriented methodology for automatic software production: OO-method

    Publication Year: 1997, Page(s):985 - 988 vol.2
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    The object-oriented paradigm is currently the subject matter of many research groups. With the purpose of developing information systems that are closer to real environments as a reliable alternative to the traditional techniques of structured analysis of Yourdon and DeMarco, the object-oriented model has become an analysis, design and implementation method that is gaining more and more importance... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Negation and duality in reduced ordered binary decision diagrams

    Publication Year: 1997, Page(s):692 - 696 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    The use of input and output negation in reducing the size of ROBDDs has been well investigated. We consider duality, a fundamental property of Boolean functions, and how it can be used to reduce ROBDD size. Dual markers are added to certain edges in an ROBDD and we show this can be done with effectively no storage overhead and a very small increase in per node processing cost. Using dual markers i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Object-oriented programming as the end of history in programming languages

    Publication Year: 1997, Page(s):981 - 984 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB)

    In the past, the invention of a new programming paradigm led to new programming languages. We show that C++ is a perfectly adequate dataflow programming language, given some suitable definitions. Reasons are mentioned for believing that this is also the case for logic and functional programming. We conclude that object-oriented programming may remove the need for languages motivated by specific pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the relation between disjunctive decomposition and ROBDD variable ordering

    Publication Year: 1997, Page(s):688 - 691 vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB)

    The relation between disjunctive decomposition of functions and a variable ordering minimizing the size of a ROBDD (Reduced Ordered Binary Decision Diagram) is considered. We show that a best ordering for a function with a disjunctive decomposition cannot always be directly determined from the best orderings for the component functions. We also demonstrate that keeping the variables from a bound s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-level priority transmission of images over a turbo-coded channel

    Publication Year: 1997, Page(s):904 - 907 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB)

    The application of turbo codes (TC) for multi-level priority transmission of image signals over an AWGN channel is presented. The unequal error protection property of the turbo codes is introduced and matched to the unequal error protection requirement for the transmission of coded image signals. Compared to simply distributing the source bits across the TC block bit positions, the proposed method... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A model of nested transaction with fine granularity of concurrency control

    Publication Year: 1997, Page(s):977 - 980 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 KB)

    Proposes a new model of nested transactions which achieves higher concurrency of transactions than the traditional model. Most of the previously proposed concurrency control algorithms for nested transactions were based on two-phase locking (2PL). In such algorithms, however, the concurrency of transactions is not so high. To achieve high concurrency, it was decided to apply serialization graph te... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applications of circuit probability computation using decision diagrams

    Publication Year: 1997, Page(s):683 - 687 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    Digital circuit output probabilities provide meaningful information regarding the behavior of combinational logic circuits. The computation of the probability values can be computationally expensive when Boolean equations or netlists are used. When the circuits are represented by compact decision diagrams (DD), efficient algorithms exist for determining the probability values. The use of the proba... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identifying fault-prone function blocks using the neural networks an empirical study

    Publication Year: 1997, Page(s):790 - 793 vol.2
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    An empirical study was carried out at ETRI to investigate the relationship between several metrics and the number of change requests associated with function blocks. For this, we propose the software metrics of CHILL language, which are used to develop the telecommunication software. We present the identification method of fault-prone function blocks of telecommunication software based on neural-n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of several buffering schemes using RCP

    Publication Year: 1997, Page(s):900 - 903 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB)

    We use rotation counter protocol (RCP) for integrated services on a backbone network. The RCP is a token ring protocol that has in its token a special field for counting down of the number of packets transmitted in one cycle. By correlating the queuing performance of each station through the counter, the delay of the high-priority data can be made almost independent and the delay jitter made small... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An ATM switch simulation tool based on the C++ object oriented programming language

    Publication Year: 1997, Page(s):972 - 976 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB)

    A software package to simulate ATM switches, written in the C++ programming language, is presented and its main modules and objects are described. The core element of our design is a so-called “switch element” object that performs the basic operations of point-to-point routing and provides additional functionality such as buffering and multicasting. The simulator has been designed to a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation method for a voice recognition system modeled with discrete Markov chain

    Publication Year: 1997, Page(s):600 - 602 vol.2
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB)

    In this paper, we suggest an evaluation method for a voice recognition system modeled with discrete Markov chain. Our evaluations are mainly dependent on two characteristics of a system: 1) correctness of recognition for input data and 2) number of utterances. The main frame of the voice recognition system is composed of: 1) a voice input unit, 2) a voice recognition unit and 3) an output unit. Ge... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal hardware verification with BDDs: an introduction

    Publication Year: 1997, Page(s):677 - 682 vol.2
    Cited by:  Papers (14)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB)

    This paper is a brief introduction to the main paradigms for using BDDs (binary decision diagrams) in formal hardware verification. The paper addresses two audiences: for people doing theoretical BDD research, the paper gives a glimpse of the problems in the main application area; and for people building hardware, the paper gives a peek under the hood of the formal verification technologies that a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the selection of nodes in linear-in-the-weight neural networks

    Publication Year: 1997, Page(s):786 - 789 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB)

    In this paper, we propose algorithms for selecting the regressor terms in linear-in-the-weight neural networks. These algorithms are accompanied by appropriate learning algorithms for adjusting the weights of the neural network. By analyzing an appropriate error functional, we investigate the convergence properties of the proposed algorithms; moreover, we investigate the optimality of these algori... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A packet scheduling discipline for supporting real-time applications

    Publication Year: 1997, Page(s):895 - 899 vol.2
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB)

    Packet scheduling is lone of the key mechanisms that will be employed in the network nodes (routers and switches) for supporting real-time applications in a high-speed networking environment. We propose a new frame-based packet scheduling algorithm which calculates and keeps an index for each flow in order to keep track of instantaneous bursts. With this approach, flows with small bandwidth shares... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling algorithms for parallel real-time systems

    Publication Year: 1997, Page(s):968 - 971 vol.2
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    The potential speedup of applications has motivated the widespread use of multiprocessors in recent years. Future real-time systems are likely to be built on multiprocessor architectures. Efficient scheduling algorithms for multiprocessors are needed so that tasks will have predictable behaviors. In this paper, recent results on multiprocessor real-time scheduling algorithms are reviewed. The revi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Active shape control of a deformable mirror in an adaptive optics system

    Publication Year: 1997, Page(s):581 - 584 vol.2
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB)

    A new control methodology for active shape control of dynamic flexible structures is presented. This method is based on the direct optimal control approach developed for discrete systems. In this method, the algebraic equations of motion of a flexible structure are derived and used for the controller design. The algebraic optimal control laws are derived in an explicit form for a general time vary... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Converting images to pseudo random dots: performance evaluation

    Publication Year: 1997, Page(s):1018 - 1021 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    Applications of Moire patterns have been reported in stereo matching (disparity measurement) and in developing a binary similarity measure. Matching based on Moire patterns requires that the images be converted to pseudo random dot representation. Two classes of algorithms for converting images to random dots are presented: (i) high pass filtering, and (ii) bit slicing. Parameters which influence ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A speaker-independent Thai polysyllabic word recognition using hidden Markov model

    Publication Year: 1997, Page(s):593 - 599 vol.2
    Cited by:  Papers (6)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (552 KB)

    This correspondence presents a speech recognition system of speaker-independent Thai polysyllabic words. This development is based on the discrete hidden Markov model in conjunction with vector quantization algorithm, endpoint detection algorithm for syllable endpoint detection and separation, and time normalization algorithm. The 70-Thai word vocabulary is subdivided into four sets comprising sin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A test cases generation method for FSM with counters and its fault coverage evaluation using a mutant generator

    Publication Year: 1997, Page(s):555 - 559 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 KB)

    In this paper, we propose a test cases generation method for communication protocols modeled as finite-state machines (FSMs) with counters, which is a subclass of EFSM (extended finite-state machines). We also evaluate the fault coverage of the test suite generated by the proposed method. For evaluating the fault coverage, we suppose that the protocol specifications are implemented in C language a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The card-box metaphor for human spatial database communication

    Publication Year: 1997, Page(s):669 - 676 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1128 KB)

    This paper proposes a card query language (CQL) which allows the end user to retrieve visually entities in a spatial database by means of a card-box metaphor. The semantics of an end user query is expressed by a combination of cards. For manipulating the representation of query results, we offer various modes: graphical, text and temporary object or all at the same time View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic recognition of map symbols for GIS input module

    Publication Year: 1997, Page(s):543 - 546 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB)

    A GIS input method that automatically recognizes may symbols is proposed. First, a map image is separated into numerals, map symbols and contour lines. Then the numerals are merged into number strings and the map symbols are recognized. The map symbols are recognized using a back propagation neural network. The recognition rate is 94.44% for 11 kinds of symbols extracted from commercial maps View full abstract»

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