{"title":"An improved architecture and implementation of cascaded integrator-comb decimation filters","authors":"Yonghong Gao, Lihong Jia, H. Tenhunen","doi":"10.1109/PACRIM.1999.799540","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799540","url":null,"abstract":"In this paper an improved version of the nonrecursive carry-save-adder-based structure for CIC (cascaded-integrator-comb) decimation filters is proposed for high speed applications. By employing parallel processing techniques, the improved structure can further increase the sampling rate of CIC filters. Low-complexity implementation of the parallel stages is also discussed.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126863775","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A new approach for ATM network traffic modeling and simulation","authors":"D. G. Daut, Ming Yu","doi":"10.1109/PACRIM.1999.799465","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799465","url":null,"abstract":"The main objective of this paper is to develop a tractable model for self-similar traffic and to apply it to ATM networks. We develop a new traffic model derived from the arrival processes of the type M/G//spl infin/. This modeling method not only provides us an explicit and analytical expression for the self-similar traffic processes, but also sets up a connection between the two most popular self-similar processes. This model has a structure similar to that of a fractional ARIMA, with a driven process of fBm (fractional Brownian motion). But the coefficients of the fBm are derived from the Pareto distribution of the active periods of the arrival process. We also derive an explicit buffer level equation based on the proposed traffic model, which matches Norros' (1994) storage model. So this method can be also served as a verification of Norros' assumptions. The queueing behavior of a single server to self-similar input can be analytically investigated with the proposed equation. The effectiveness of these methods has been demonstrated by some practical applications.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126557638","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Flow Initiation and ReServation Tree (FIRST): a new Internet resource reservation protocol","authors":"T. Chung, Henry C. B. Chan, V. Leung","doi":"10.1109/PACRIM.1999.799551","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799551","url":null,"abstract":"The best effort service provided by the current Internet is not suitable for supporting real-time multimedia applications which require quality of service (QoS) guarantees. To provide QoS over the Internet, a reservation mechanism is required to reserve resources along the data-delivery path. In this paper, we give an overview of three Internet reservation protocols: RSVP, ST-2+ and YESSIR, and compare their features. With the aim of combining the advantages of the above reservation protocols, a new reservation protocol called Flow Initiation and ReServation Tree (FIRST) is proposed. The operations of FIRST are explained with a number of examples.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116139979","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Using formal approach to specify distributed multimedia systems","authors":"Lichen Zhang, P. Yuan","doi":"10.1109/PACRIM.1999.799575","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799575","url":null,"abstract":"A formal approach can benefit multimedia in a number of ways. For example, formal system development can aid the development of correct systems. Formal specification and verification techniques have been extensively investigated, but these techniques have generally not addressed the requirement of distributed multimedia computing. The central issue in multimedia is dealing with real-time. In particular, there is a need for software development techniques that support the specification and verification of real-time properties. In this paper, we propose a new approach to the formal specification and verification of distributed multimedia computing. This new approach is based on the extension of LOTOS to incorporate timing in it. Thus, succinct expressions of communicating concurrent processes can be made. Similarly, the emphasis on non-determinism in process algebraic techniques facilitates abstract specification, hiding implementation details. Furthermore, rich and tractable mathematical models of the semantics of process algebra have been developed. The key characteristic of the new approach lies in the specification of behavior, requirements and different types of time in a specification.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131686835","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
T. Yoshikawa, T. Tabe, R. Kishinami, H. Matsuda, A. Hashimoto
{"title":"On the implementation of a phylogenetic tree database","authors":"T. Yoshikawa, T. Tabe, R. Kishinami, H. Matsuda, A. Hashimoto","doi":"10.1109/PACRIM.1999.799473","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799473","url":null,"abstract":"A molecular phylogenetic tree is a tree-structured graph that represents the evolutionary process of genes, and is constructed from sequence data (such as DNA sequences) obtained from several organisms. Although molecular phylogenetic trees are fundamental data structures in evolutionary analysis, no database system is available that can match trees in the database against a user-supplied tree by comparing tree structures. In this paper, we propose a phylogenetic tree database system with a retrieval function that matches trees having similar structure. The tree data stored in the database are transformed from document images published in biological journals using a pattern-recognition program developed by us. To retrieve phylogenetic trees from the database according to their structures, we propose a method of determining the structural similarity between trees that is based on the split distance method. Our structural similarity measure shows high correlation with the log-likelihood difference that is widely used for comparing phylogenetic trees, and the computation time of our measure is much shorter than that of the log-likelihood difference, which relies on sequence comparison.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133248202","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An object oriented approach for the specification of user interfaces","authors":"M. Lozano, I. Ramos","doi":"10.1109/PACRIM.1999.799553","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799553","url":null,"abstract":"The object oriented paradigm is considered as one of the best approaches for systems development. There exists many models, techniques and tools developed following this paradigm. Nevertheless, most of the object-oriented techniques used in the development of systems does not take into account human-computer interaction issues. This is a very important aspect that must be tackled in order to correctly fulfil the user needs and requirements. The main purpose of this paper is to present an object oriented approach for the integration of a user model in an object oriented software production environment.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133254215","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"DS-CDMA systems with polyphase signature sequences in multipath fading channel","authors":"S. Park, I. Song, Jooshik Lee, Seong-Ro Lee","doi":"10.1109/PACRIM.1999.799586","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799586","url":null,"abstract":"Direct sequence code division multiple access (DS-CDMA) communication systems using random polyphase sequences with coherent reception in multipath fading channels are considered. By examining the asymptotic characteristics of the multiple access interference and multipath interference, we show that the DS-CDMA system performance with random m/sub p/-phase sequences of m/sub p//spl ges/3 is better than that with random binary sequences in multipath fading environment.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133354388","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
K. Katagishi, T. Asami, Y. Ebihara, T. Sugiyama, K. Toraichi
{"title":"A public key cryptography-based security enhanced mail gateway with the mailing list function","authors":"K. Katagishi, T. Asami, Y. Ebihara, T. Sugiyama, K. Toraichi","doi":"10.1109/PACRIM.1999.799527","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799527","url":null,"abstract":"When sending corporate secrets by electronic mail (e-mail), care must be taken to protect the security of the information against the various kinds of illicit manipulation that can occur on the Internet. We have developed a security enhanced mail gateway (SEMAIL) that ensures the privacy of e-mail messages without requiring users to install new software or learn complicated operating procedures. The SEMAIL system, in which an encryption program PGP (Pretty Good Privacy) is used, is available for both POP3-based Unix mails and PC-LAN-based ones.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115999693","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Computation/communication balance-point modeling in multiprocessors","authors":"V. Hamacher","doi":"10.1109/PACRIM.1999.799497","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799497","url":null,"abstract":"An analytic model for predicting processor utilization in a CC-NUMA (cache coherent non-uniform memory access) shared-memory multiprocessor is developed. The interconnection network in such systems transfers cache line messages between processor caches and memory modules on read and write misses. The major component of the miss penalty, for the case of large systems, is the network delay. Using only a relatively small number of node parameters (cache miss rate, cache line length, number of outstanding transfer requests allowed, memory access time, proportion of Reads to Writes), along with the bandwidth and delay versus throughput characteristics of the network, the analytic model is shown to give good estimates of the processor utilization values derived from an independent detailed simulation study. In particular, for multiprocessor sizes of 72 and 108 nodes, and for variations in the node parameters, the processor utilization values determined by the analytic model are within 10% of the simulation results. Processor utilizations vary from 0.41 to 0.88. The interconnection network involved is a hierarchical slotted-ring system.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117073925","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A novel intelligent system for defining similar symbols","authors":"M. Ahmed, R. Ward","doi":"10.1109/PACRIM.1999.799511","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799511","url":null,"abstract":"We introduce an expert system for the recognition of any typed or handwritten symbols, then, we describe how a symbol can be represented by another symbol which is formed of only straight line segments. This allows a large number of different styles of handwritten or typed symbols to be mapped into a much smaller number of representations. These representations are used as models for the automatic recognition of symbols. The system uses the structural pattern recognition technique for modeling symbols by a set of straight lines referred to as line segments. The system rotates, scales and thins the symbol, then extracts the symbol strokes. Each stroke is then mapped into line segments. The system is shown to be able to map similar styles of the symbol to the same representation. When the system had some stored models for each symbol (an average of 97 models/symbol), the recognition rate was 95%, and the rejection rate was 16.1%. The system was tested by 5726 handwritten English characters from the Center of Excellence for Document Analysis and Recognition (CEDAR) database.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121945671","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}