Pub Date : 2005-10-17DOI: 10.1109/PACRIM.2005.1517353
L. F. Costa, A. Veiga
We present a model for generating a robust JPEG quantization table using the techniques of genetic algorithms at the JPEG image compression process. After several experiments over a range of generations, the final quantization table was obtained. The detection of the best quantization table (Q-table) using genetic algorithms with the JPEG standard is a great tool to obtain the desired quality of recovered image. This method compares the SNR of the quantization tables created during the process, and choose the one with the higher SNR for a group of natural images by the natural selection, the program also give conditions to change anytime the parameters of the program to produce better results.
{"title":"Identification of the best quantization table using genetic algorithms","authors":"L. F. Costa, A. Veiga","doi":"10.1109/PACRIM.2005.1517353","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517353","url":null,"abstract":"We present a model for generating a robust JPEG quantization table using the techniques of genetic algorithms at the JPEG image compression process. After several experiments over a range of generations, the final quantization table was obtained. The detection of the best quantization table (Q-table) using genetic algorithms with the JPEG standard is a great tool to obtain the desired quality of recovered image. This method compares the SNR of the quantization tables created during the process, and choose the one with the higher SNR for a group of natural images by the natural selection, the program also give conditions to change anytime the parameters of the program to produce better results.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114970929","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 : 2005-10-17DOI: 10.1109/PACRIM.2005.1517362
J. R. Dick, K. Kent
A neural network is a massively parallel distributed processor made up of simple processing units known as neurons. These neurons are organized in layers and every neuron in each layer is connected to each neuron in the adjacent layers. This connection architecture makes for an enormous number of communication links between neurons. This is an issue when considering a hardware implementation of a neural network since communication links requires costly hardware space. To overcome this space problem incremental communication for multilayer neural networks has been proposed. Incremental communication works by only communicating the change in value between neurons as opposed to the entire magnitude of the value. This allows for the values to be represented with a fewer number of bits, and thus communicated with narrower communication links. To validate and analyze this technique a neural network is designed and implemented using both an incremental and traditional communication approach.
{"title":"Incremental communication for multilayer neural networks in a field programmable gate array","authors":"J. R. Dick, K. Kent","doi":"10.1109/PACRIM.2005.1517362","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517362","url":null,"abstract":"A neural network is a massively parallel distributed processor made up of simple processing units known as neurons. These neurons are organized in layers and every neuron in each layer is connected to each neuron in the adjacent layers. This connection architecture makes for an enormous number of communication links between neurons. This is an issue when considering a hardware implementation of a neural network since communication links requires costly hardware space. To overcome this space problem incremental communication for multilayer neural networks has been proposed. Incremental communication works by only communicating the change in value between neurons as opposed to the entire magnitude of the value. This allows for the values to be represented with a fewer number of bits, and thus communicated with narrower communication links. To validate and analyze this technique a neural network is designed and implemented using both an incremental and traditional communication approach.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116633078","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 : 2005-10-17DOI: 10.1109/PACRIM.2005.1517357
S. M. Masum, A.A. Ali, M. M. Akbar
Due to brisk expansion of portable computing technology, the classical dilemma of mutual exclusion in mobile ad hoc networks has drawn a substantial attention from the research community in recent years. The problem aims to provide access to shared critical resources among users regardless of their physical locations. To our knowledge, few distributed mutual exclusion algorithms using tokens are available for mobile ad hoc networks in the literature. This paper presents a consensus-based /spl lscr/-exclusion algorithm that explicitly copes with mobility associated with such networks. This paper also presents proofs of correctness and compares this /spl lscr/-exclusion algorithm with existing ones. Moreover, the algorithm is fault-resilient in the sense that it can tolerate loss of messages, link failures, and sudden crash or recovery of mobile nodes.
{"title":"A fault-resilient /spl lscr/-exclusion algorithm for mobile ad hoc networks","authors":"S. M. Masum, A.A. Ali, M. M. Akbar","doi":"10.1109/PACRIM.2005.1517357","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517357","url":null,"abstract":"Due to brisk expansion of portable computing technology, the classical dilemma of mutual exclusion in mobile ad hoc networks has drawn a substantial attention from the research community in recent years. The problem aims to provide access to shared critical resources among users regardless of their physical locations. To our knowledge, few distributed mutual exclusion algorithms using tokens are available for mobile ad hoc networks in the literature. This paper presents a consensus-based /spl lscr/-exclusion algorithm that explicitly copes with mobility associated with such networks. This paper also presents proofs of correctness and compares this /spl lscr/-exclusion algorithm with existing ones. Moreover, the algorithm is fault-resilient in the sense that it can tolerate loss of messages, link failures, and sudden crash or recovery of mobile nodes.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127255816","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 : 2005-10-17DOI: 10.1109/PACRIM.2005.1517261
F. Zhai, Y. Xin, I. Fair
Spectral performance of DC-free codes can be evaluated through performance metrics such as sum variance (SV) and low-frequency spectrum weight (LFSW). In this paper we investigate the spectral performance of integrated DC-free error-control codes. Analytical results for estimating the SV and LFSW of these codes are given.
{"title":"Spectral performance of integrated DC-free error-control codes","authors":"F. Zhai, Y. Xin, I. Fair","doi":"10.1109/PACRIM.2005.1517261","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517261","url":null,"abstract":"Spectral performance of DC-free codes can be evaluated through performance metrics such as sum variance (SV) and low-frequency spectrum weight (LFSW). In this paper we investigate the spectral performance of integrated DC-free error-control codes. Analytical results for estimating the SV and LFSW of these codes are given.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125358357","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 : 2005-10-17DOI: 10.1109/PACRIM.2005.1517359
C. Polprasert, J. Ritcey
We propose a new channel model for investigating the impact of imperfect channel state information (CSI) over Nakagami-m fading channels. A new definition of the phase difference between two correlated Nakagami random variables is proposed and its probability density function, which depends on the fading parameter m and the power correlation coefficients, is developed. Its first order statistical properties are investigated and simplified. This model looks to be a major contender for investigating the impact of imperfect CSI on Nakagami fading channels.
{"title":"Phase difference statistics for Nakagami-m fading channels","authors":"C. Polprasert, J. Ritcey","doi":"10.1109/PACRIM.2005.1517359","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517359","url":null,"abstract":"We propose a new channel model for investigating the impact of imperfect channel state information (CSI) over Nakagami-m fading channels. A new definition of the phase difference between two correlated Nakagami random variables is proposed and its probability density function, which depends on the fading parameter m and the power correlation coefficients, is developed. Its first order statistical properties are investigated and simplified. This model looks to be a major contender for investigating the impact of imperfect CSI on Nakagami fading channels.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129008734","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}
Broadcasting which is a primitive communication problem is to distribute the same message from a source node to all other nodes. This problem appears in applications such as matrix operations, database operation and transitive closure algorithms. The topology considered in this paper is the cube-connected cycle that demonstrates many attractive properties, such as high degree of regularity, symmetry and efficient computation. In this paper, we present a novel distributed broadcasting scheme for the cube-connected cycles, which is much simpler and requires only constant data included in each message and constant time to determine the neighbors to forward the message. Moreover, the time steps (i.e., the height of the broadcasting tree) taken by this algorithm is under diameter, which is optimal.
{"title":"Novel broadcasting schemes on cube-connected cycles","authors":"Jywe-Fei Fang, Chun-Mei Lee, Erh-Ying Yen, Ruei-Xi Chen, Yilin Feng","doi":"10.1109/PACRIM.2005.1517368","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517368","url":null,"abstract":"Broadcasting which is a primitive communication problem is to distribute the same message from a source node to all other nodes. This problem appears in applications such as matrix operations, database operation and transitive closure algorithms. The topology considered in this paper is the cube-connected cycle that demonstrates many attractive properties, such as high degree of regularity, symmetry and efficient computation. In this paper, we present a novel distributed broadcasting scheme for the cube-connected cycles, which is much simpler and requires only constant data included in each message and constant time to determine the neighbors to forward the message. Moreover, the time steps (i.e., the height of the broadcasting tree) taken by this algorithm is under diameter, which is optimal.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129896336","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 : 2005-10-17DOI: 10.1109/PACRIM.2005.1517265
A. Inomata, M. Rahman, Toshio Okamoto, E. Okamoto
We focus on phishing in the mail filtering research. So we define a sender reliance cost by the DNS inquiry and the contents analysis. In this paper, we propose the method to estimate these costs quantitatively. In this proposed method, the cost which characteristics settle Phishing is obtained from the actual proof experiment and we show the Phishing filter calculated from a result of the experiment. Furthermore, we report about the prototype which implemented that mail filter as an extension of MTA, and show the validity of the proposed method from these actual outputted data.
{"title":"A novel mail filtering method against phishing","authors":"A. Inomata, M. Rahman, Toshio Okamoto, E. Okamoto","doi":"10.1109/PACRIM.2005.1517265","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517265","url":null,"abstract":"We focus on phishing in the mail filtering research. So we define a sender reliance cost by the DNS inquiry and the contents analysis. In this paper, we propose the method to estimate these costs quantitatively. In this proposed method, the cost which characteristics settle Phishing is obtained from the actual proof experiment and we show the Phishing filter calculated from a result of the experiment. Furthermore, we report about the prototype which implemented that mail filter as an extension of MTA, and show the validity of the proposed method from these actual outputted data.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123983211","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 : 2005-10-17DOI: 10.1109/PACRIM.2005.1517270
M. Shimamurat, K. Iida, H. Koga, Y. Kadobayashfi, S. Yamaguchi
A strong demand for quality of service (QoS) to subscribers of VPNs has emerged. Weighted proportional fair rate allocation (WPFRA) provides a QoS method for one VPN model, the customer-pipe model. However, constructing large-scale VPNs with the customer-pipe model is difficult because of an exponential increase in required bandwidth. In future VPNs, a new model, the hose model, is useful to improve the scalability. We present an adaptive bandwidth allocation method for providing QoS in the hose model. Our method is evaluated quantitatively through simulations.
{"title":"Performance evaluation of hose bandwidth allocation method using feedback control and class-based queueing for VPNs","authors":"M. Shimamurat, K. Iida, H. Koga, Y. Kadobayashfi, S. Yamaguchi","doi":"10.1109/PACRIM.2005.1517270","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517270","url":null,"abstract":"A strong demand for quality of service (QoS) to subscribers of VPNs has emerged. Weighted proportional fair rate allocation (WPFRA) provides a QoS method for one VPN model, the customer-pipe model. However, constructing large-scale VPNs with the customer-pipe model is difficult because of an exponential increase in required bandwidth. In future VPNs, a new model, the hose model, is useful to improve the scalability. We present an adaptive bandwidth allocation method for providing QoS in the hose model. Our method is evaluated quantitatively through simulations.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"135 25","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114100581","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 : 2005-10-17DOI: 10.1109/PACRIM.2005.1517311
N. Manjikian, J. Reed
This paper presents the results for a prototype hardware implementation in programmable logic of a single-chip cache-coherent multiprocessor based on a split-transaction bus. This implementation provides the basis for further research prototyping to investigate architectures and applications for processor-memory integration. A 4-processor system synthesized for a Xilinx XCV2000E chip consumes only 62% of the available logic resources. Operational results for the implementation collected with a logic analyzer highlight the support for multiple concurrent requests and other features of the split-transaction bus in a multiprocessor.
{"title":"Prototype hardware implementation of a single-chip multiprocessor with a split-transaction bus","authors":"N. Manjikian, J. Reed","doi":"10.1109/PACRIM.2005.1517311","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517311","url":null,"abstract":"This paper presents the results for a prototype hardware implementation in programmable logic of a single-chip cache-coherent multiprocessor based on a split-transaction bus. This implementation provides the basis for further research prototyping to investigate architectures and applications for processor-memory integration. A 4-processor system synthesized for a Xilinx XCV2000E chip consumes only 62% of the available logic resources. Operational results for the implementation collected with a logic analyzer highlight the support for multiple concurrent requests and other features of the split-transaction bus in a multiprocessor.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"194 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114539436","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 : 2005-10-17DOI: 10.1109/PACRIM.2005.1517360
M. Mohajerin, Cheng Chen, E. Abdel-Raheem
A 12-bit, 40 MS/s pipelined analog-to-digital converter (ADC) is designed in 0.18-/spl mu/m CMOS technology with 1.8 V single power supply. The proposed ADC architecture uses a combination of current-mode and voltage-mode stages to, significantly, reduce both power dissipation and area compared to conventional fully differential voltage-mode pipeline ADCs. Simulation results are provided and indicate that the proposed ADC has potential to be deployed in the video analog front-ends.
{"title":"A new 12-b 40 ms/s, low-power, low-area pipeline ADC for video analog front ends","authors":"M. Mohajerin, Cheng Chen, E. Abdel-Raheem","doi":"10.1109/PACRIM.2005.1517360","DOIUrl":"https://doi.org/10.1109/PACRIM.2005.1517360","url":null,"abstract":"A 12-bit, 40 MS/s pipelined analog-to-digital converter (ADC) is designed in 0.18-/spl mu/m CMOS technology with 1.8 V single power supply. The proposed ADC architecture uses a combination of current-mode and voltage-mode stages to, significantly, reduce both power dissipation and area compared to conventional fully differential voltage-mode pipeline ADCs. Simulation results are provided and indicate that the proposed ADC has potential to be deployed in the video analog front-ends.","PeriodicalId":346880,"journal":{"name":"PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124128487","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
扫码关注我们
求助内容：
应助结果提醒方式：