Pub Date : 1999-08-22DOI: 10.1109/PACRIM.1999.799610
A. Fellah, M. Abaza
We introduce the concept of working set-based page block in distributed virtual memory systems. We show that hit ratio is significantly better than that of conventional systems, where page blocks are formed from neighboring contiguous pages on the disk. Moreover, the choice of some relevant virtual memory parameters, which is usually made by the system manager and is riskier and may affect the efficiency of the system. We show that such choice becomes more reliable by using page blocks.
{"title":"On page blocks in distributed virtual memory systems","authors":"A. Fellah, M. Abaza","doi":"10.1109/PACRIM.1999.799610","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799610","url":null,"abstract":"We introduce the concept of working set-based page block in distributed virtual memory systems. We show that hit ratio is significantly better than that of conventional systems, where page blocks are formed from neighboring contiguous pages on the disk. Moreover, the choice of some relevant virtual memory parameters, which is usually made by the system manager and is riskier and may affect the efficiency of the system. We show that such choice becomes more reliable by using page blocks.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"19 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":"121343170","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}
Pub Date : 1999-08-22DOI: 10.1109/PACRIM.1999.799539
T. Hinamoto, T. Maeda
This paper treats noise reduction in state-space digital filters using high-order error feedback. A technique is developed for obtaining the optimal error feedback coefficients that minimize the variance at the filter output. This is done by minimizing a quadratic form subject to the coefficients of the error feedback being symmetric or antisymmetric. The optimal solution can be characterized in a closed form by applying the Lagrange multiplier method. In an unconstrained case, the optimal error feedback corresponds to a special case of the above optimal solution. Finally, a numerical example is given to illustrate the utility of the proposed technique.
{"title":"Noise reduction in state-space digital filters using high-order error feedback","authors":"T. Hinamoto, T. Maeda","doi":"10.1109/PACRIM.1999.799539","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799539","url":null,"abstract":"This paper treats noise reduction in state-space digital filters using high-order error feedback. A technique is developed for obtaining the optimal error feedback coefficients that minimize the variance at the filter output. This is done by minimizing a quadratic form subject to the coefficients of the error feedback being symmetric or antisymmetric. The optimal solution can be characterized in a closed form by applying the Lagrange multiplier method. In an unconstrained case, the optimal error feedback corresponds to a special case of the above optimal solution. Finally, a numerical example is given to illustrate the utility of the proposed technique.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"15 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":"116742648","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}
Pub Date : 1999-08-22DOI: 10.1109/PACRIM.1999.799476
Y. Nakamura, H. Dekihara
A spatio-temporal data structure, called the PMD-tree (persistent multi-dimensional tree), has been proposed for managing the live intervals and locations of spatial objects. In the paper, novel concepts of time space bounding box (TSBB) and motion list are introduced to the PMD-tree to manage moving spatial objects efficiently. TSBB is an extended bounding box for a moving object that covers the trajectory of the object. As an object moves, a TSBB corresponding to the object is enlarged to enclose the trajectory of the object. A TSBB is divided when it becomes greater than a limit. An object and corresponding TSBBs are managed by a doubly connected linked list, called a motion list. TSBBs are also managed by the PMD-tree. By introducing the concept of TSBB and motion list to the PMD-tree, moving objects can be efficiently managed and quickly found for spatio-temporal queries. By carrying out a series of simulation tests, the storage requirements and search performances are evaluated for several types of moving objects.
{"title":"An efficient management method of moving spatial objects","authors":"Y. Nakamura, H. Dekihara","doi":"10.1109/PACRIM.1999.799476","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799476","url":null,"abstract":"A spatio-temporal data structure, called the PMD-tree (persistent multi-dimensional tree), has been proposed for managing the live intervals and locations of spatial objects. In the paper, novel concepts of time space bounding box (TSBB) and motion list are introduced to the PMD-tree to manage moving spatial objects efficiently. TSBB is an extended bounding box for a moving object that covers the trajectory of the object. As an object moves, a TSBB corresponding to the object is enlarged to enclose the trajectory of the object. A TSBB is divided when it becomes greater than a limit. An object and corresponding TSBBs are managed by a doubly connected linked list, called a motion list. TSBBs are also managed by the PMD-tree. By introducing the concept of TSBB and motion list to the PMD-tree, moving objects can be efficiently managed and quickly found for spatio-temporal queries. By carrying out a series of simulation tests, the storage requirements and search performances are evaluated for several types of moving objects.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"36 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":"127778349","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}
Pub Date : 1999-08-22DOI: 10.1109/PACRIM.1999.799536
Mitchell A. Thornton, J. D. Gaiche, J. V. Lemieux
Integer multiplication is a necessary operation for performing many tasks relevant to multimedia and telecommunications processes. Here, we discuss the results of an investigation into the effectiveness of automated synthesis tools as related to a sample of modern Programmable Logic Devices (PLDs). Although it is generally accepted that superior results in terms of required area and circuit delay can generally be obtained through manual implementation of such circuits, the exclusive use of automated synthesis tools based upon an original specification in terms of a Hardware Description Language (HDL) is presented here. The results of several different approaches to multiplier architectures are presented.
{"title":"Tradeoff analysis of integer multiplier circuits implemented in FPGAs","authors":"Mitchell A. Thornton, J. D. Gaiche, J. V. Lemieux","doi":"10.1109/PACRIM.1999.799536","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799536","url":null,"abstract":"Integer multiplication is a necessary operation for performing many tasks relevant to multimedia and telecommunications processes. Here, we discuss the results of an investigation into the effectiveness of automated synthesis tools as related to a sample of modern Programmable Logic Devices (PLDs). Although it is generally accepted that superior results in terms of required area and circuit delay can generally be obtained through manual implementation of such circuits, the exclusive use of automated synthesis tools based upon an original specification in terms of a Hardware Description Language (HDL) is presented here. The results of several different approaches to multiplier architectures are presented.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"25 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":"126331398","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}
Pub Date : 1999-08-22DOI: 10.1109/PACRIM.1999.799508
D. Sasmal, W. Lu, D. Shpak, A. Antoniou
A nonuniform interpolation technique for use in a LIDAR profiler system is presented. The technique has been implemented to obtain the ground and canopy cover profiles from LIDAR profiling data containing ground and vegetation information, and it entails a two-stage process. In the first stage, the irregularly spaced data points are interpolated to regularise the data points. In the second stage, uniform interpolation is applied to the regularized data points to obtain the required profiles.
{"title":"Interpolation techniques for a LIDAR profiler system","authors":"D. Sasmal, W. Lu, D. Shpak, A. Antoniou","doi":"10.1109/PACRIM.1999.799508","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799508","url":null,"abstract":"A nonuniform interpolation technique for use in a LIDAR profiler system is presented. The technique has been implemented to obtain the ground and canopy cover profiles from LIDAR profiling data containing ground and vegetation information, and it entails a two-stage process. In the first stage, the irregularly spaced data points are interpolated to regularise the data points. In the second stage, uniform interpolation is applied to the regularized data points to obtain the required profiles.","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":"130034564","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}
We discuss the design issues of a high performance RAID prototype in a real-time system, called HUST RAID. Based on the architecture and the real-time process model of HUST RAID, a multiple queue real-time I/O scheduling algorithm and new buffer management policy are proposed. We also introduce the software design issues of the control system. From the performance measurement results of HUST RAID, we can see that the performance of the HUST RAID system is excellent.
{"title":"HUST RAID: high performance RAID in real-time system","authors":"Peng Cheng, Hai-juan Jin, Xinrong Zhou, Qiong Chen, Jiangling Zhang","doi":"10.1109/PACRIM.1999.799477","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799477","url":null,"abstract":"We discuss the design issues of a high performance RAID prototype in a real-time system, called HUST RAID. Based on the architecture and the real-time process model of HUST RAID, a multiple queue real-time I/O scheduling algorithm and new buffer management policy are proposed. We also introduce the software design issues of the control system. From the performance measurement results of HUST RAID, we can see that the performance of the HUST RAID system is excellent.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"10 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":"134389978","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}
Pub Date : 1999-08-22DOI: 10.1109/PACRIM.1999.799487
Shengli Wu, N. Hamada
To estimate moving objects velocity in an image sequence is useful for a variety of applications, such as computer vision and monitoring systems. An effective way is to approach it in the transform/spatiotemporal mixed domain (MixeD), but it remains a problem how to select several 2-D spatial frequency points in MixeD domain which may influence the accuracy of velocity estimation and object detection. We propose a method to approach the velocity estimation problem by automatically selecting only two appropriate points in 2-D spatial frequency domain, the selection is achieved by using the established evaluation function together with a threshold. The simulation results show that the proposed method is effective on the selection of spatial frequency points.
{"title":"Moving object velocity estimation by appropriately choosing spatial frequencies in the MixeD domain","authors":"Shengli Wu, N. Hamada","doi":"10.1109/PACRIM.1999.799487","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799487","url":null,"abstract":"To estimate moving objects velocity in an image sequence is useful for a variety of applications, such as computer vision and monitoring systems. An effective way is to approach it in the transform/spatiotemporal mixed domain (MixeD), but it remains a problem how to select several 2-D spatial frequency points in MixeD domain which may influence the accuracy of velocity estimation and object detection. We propose a method to approach the velocity estimation problem by automatically selecting only two appropriate points in 2-D spatial frequency domain, the selection is achieved by using the established evaluation function together with a threshold. The simulation results show that the proposed method is effective on the selection of spatial frequency points.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"54 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":"128957243","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}
Pub Date : 1999-08-22DOI: 10.1109/PACRIM.1999.799517
Chi-Chun Lo, Yu-Jen Chen
With the advance of wireless communications technology, mobile communications has become more convenient than ever. However, because of the openness of wireless communications, how to protect the privacy between communication parties is becoming a very important issue. In this paper, we focus on the security of the Global System for Mobile communication (GSM) networks. A secure communication architecture for the GSM network is proposed. In the proposed architecture, we use public-key cryptography for user authentication and a stream cipher for message encryption and decryption. This architecture significantly improves the security of today's GSM networks.
{"title":"A secure communication architecture for GSM networks","authors":"Chi-Chun Lo, Yu-Jen Chen","doi":"10.1109/PACRIM.1999.799517","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799517","url":null,"abstract":"With the advance of wireless communications technology, mobile communications has become more convenient than ever. However, because of the openness of wireless communications, how to protect the privacy between communication parties is becoming a very important issue. In this paper, we focus on the security of the Global System for Mobile communication (GSM) networks. A secure communication architecture for the GSM network is proposed. In the proposed architecture, we use public-key cryptography for user authentication and a stream cipher for message encryption and decryption. This architecture significantly improves the security of today's GSM networks.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"32 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":"133598734","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}
Pub Date : 1999-08-22DOI: 10.1109/PACRIM.1999.799544
L. Wolfe
This paper suggests a simple method for solving source matching problems wherein the problem is to find the minimax codes which minimize the maximum redundancies over classes of sources where relative entropy (cross entropy; discrimination information) is adopted as a criterion to measure the redundancy. An efficient algorithm is presented which relies upon and extends a vector quantization result first presented at IEEE PacRim '97 at Victoria BC Canada. A computational complexity analysis and a numerical study demonstrate the efficiency of the suggested method.
{"title":"On the solution of source matching problems","authors":"L. Wolfe","doi":"10.1109/PACRIM.1999.799544","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799544","url":null,"abstract":"This paper suggests a simple method for solving source matching problems wherein the problem is to find the minimax codes which minimize the maximum redundancies over classes of sources where relative entropy (cross entropy; discrimination information) is adopted as a criterion to measure the redundancy. An efficient algorithm is presented which relies upon and extends a vector quantization result first presented at IEEE PacRim '97 at Victoria BC Canada. A computational complexity analysis and a numerical study demonstrate the efficiency of the suggested method.","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":"130558054","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}
Pub Date : 1999-08-22DOI: 10.1109/PACRIM.1999.799463
Lichen Zhang, P. Yuan
In ATM networks, congestion usually results in cell loss. In this paper, an arbiter method for congestion control is proposed. Based on the time limit and priority, the cells that compete for the same output line could be lined according to the character of real-time services. We define /spl Pi//sub ij/ as the transmission probability of a cell to be transmitted from the input line i to the output line j. So each cell can be described clearly and the congestion control arbiters (include internal arbiter and external arbiter) could classify the cells that in competition. Experiments show that this method is effective in improving cell loss rate.
{"title":"Congestion control for ATM real-time service","authors":"Lichen Zhang, P. Yuan","doi":"10.1109/PACRIM.1999.799463","DOIUrl":"https://doi.org/10.1109/PACRIM.1999.799463","url":null,"abstract":"In ATM networks, congestion usually results in cell loss. In this paper, an arbiter method for congestion control is proposed. Based on the time limit and priority, the cells that compete for the same output line could be lined according to the character of real-time services. We define /spl Pi//sub ij/ as the transmission probability of a cell to be transmitted from the input line i to the output line j. So each cell can be described clearly and the congestion control arbiters (include internal arbiter and external arbiter) could classify the cells that in competition. Experiments show that this method is effective in improving cell loss rate.","PeriodicalId":176763,"journal":{"name":"1999 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 1999). Conference Proceedings (Cat. No.99CH36368)","volume":"45 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":"127996993","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：