M. S. Benning, A. Kapur, B. Till, G. Tzanetakis, P. Driessen
{"title":"A Comparative Study on Wearable Sensors for Signal Processing on the North Indian Tabla","authors":"M. S. Benning, A. Kapur, B. Till, G. Tzanetakis, P. Driessen","doi":"10.1109/PACRIM.2007.4313313","DOIUrl":"https://doi.org/10.1109/PACRIM.2007.4313313","url":null,"abstract":"This paper describes experimentation using a variety of sensor techniques to capture body gestures and train a student performing the North Indian hand drums known as the Tabla. A comparative study of motion capture systems, wearable accelerometer units, and wireless inertial sensor packages, is described. Each acquisition method has it advantages and disadvantages which are explored through trial and error. The paper describes a number of applications using real-time signal processing techniques for analysis, performance, performer posture detection and machine perception of human interaction.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128555607","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":"Analysis of Multiple Trees on Path Discovery for Beacon-Based Routing Protocols","authors":"B. Awerbuch, D. Holmer, H. Rubens, R. Cole","doi":"10.1109/PACRIM.2007.4313168","DOIUrl":"https://doi.org/10.1109/PACRIM.2007.4313168","url":null,"abstract":"Routing in Mobile Ad-hoc Networks (MANETS) has proved to be an extremely challenging research problem due to the high frequency of link changes in wireless mobile environments. Most known routing protocols struggle to maintain complex routing structures, e.g., N spanning trees, or use expensive (from the perspective of communications cost) methods for path discovery. These methods incur extreme communications costs in most MANET deployments. In this paper, we investigate the performance of a relatively unstudied class of routing protocols which we refer to as Beacon-Based Routing Protocols. This class of protocols maintain minimum routing structures and use these structures to boot strap path discovery. In a well defined sense, this class of routing protocols achieves optimal performance with respect to minimizing the communications costs associated with on-demand routing. We specifically investigate the impact of multiple tree implementations for path discovery and analyze their impact on the effectiveness of optimal path discovery.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127935220","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}
S. Najafzadeh, M. R. Ghajar, A. Nassery, B. Forouzandeh
{"title":"Evaluation of Optimum Multi-Channel Implementation of CS-ACELP Codec on TMS320C6205","authors":"S. Najafzadeh, M. R. Ghajar, A. Nassery, B. Forouzandeh","doi":"10.1109/PACRIM.2007.4313261","DOIUrl":"https://doi.org/10.1109/PACRIM.2007.4313261","url":null,"abstract":"Today, voice over IP applications and mobile communications require low-cost, low-delay and high-efficient speech coders. Conjugate-Structure Algebraic CELP (CS-ACELP) is a type of voice coding algorithm that compresses speech signal based on model parameters of human voice. Real time DSP (Digital Signal Processor) implementation and optimization of this codec, described in this paper, is done on TMS320C6205. Also multi-channel implementation of the algorithm is evaluated.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126562669","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":"Turbo Detection for the Uplink of CP-Assisted DS-CDMA Systems","authors":"Paulo Silva, R. Dinis","doi":"10.1109/PACRIM.2007.4313204","DOIUrl":"https://doi.org/10.1109/PACRIM.2007.4313204","url":null,"abstract":"In this paper we consider the use of CP-assisted (Cyclic Prefix) DS-CDMA schemes (Direct Sequence Code Division Multiple Access) in the uplink of broadband wireless systems. We present frequency-domain receivers that combine turbo equalization and multiuser detection. The performance of the proposed receiver can be close to the single-user MFB (Matched Filter Bound), even for fully loaded systems and severely time-dispersive channels. Moreover, our receivers can also cope with overloaded scenarios.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114073604","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 Dynamic Layer Management Scheme for a Superpeer Ring with a Loosely-Consistent DHT","authors":"Saeyoung Han, Sungyong Park","doi":"10.1504/IJCNDS.2008.020262","DOIUrl":"https://doi.org/10.1504/IJCNDS.2008.020262","url":null,"abstract":"We propose a dynamic layer management scheme for superpeer ring with a loosely-consistent DHT, where high capacity peers are selected as superpeers based on the capacity data colleted by mobile agents. The benchmarking results show that our scheme outperforms the static superpeer systems in terms of search latency at the expense of overhead.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123834868","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":"H.264 Intra Frame Coding and JPEG 2000-based Predictive Multiple Description Image Coding","authors":"Jing Wang, Jie Liang","doi":"10.1109/PACRIM.2007.4313300","DOIUrl":"https://doi.org/10.1109/PACRIM.2007.4313300","url":null,"abstract":"In this paper, two prediction compensated multiple description coding algorithms are proposed based on H.264 intra frame coding and JPEG 2000, respectively. The image is split into two parts. Each forms the base layer of one description. The prediction residual of the other part is encoded in each description as the enhancement layer. In the H.264-based approach, we use the H.264 intra frame prediction to estimate the other description, and we investigate the performances of different partitions of the image. In the JPEG 2000-based approach, the least-squares algorithm is used for inter-description prediction. Image coding results show that performances of the proposed methods are comparable with that of the latest MDC results while the complexity is reduced.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"94 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114009718","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":"Detection of HTTP-GET flood Attack Based on Analysis of Page Access Behavior","authors":"T. Yatagai, T. Isohara, I. Sasase","doi":"10.1109/PACRIM.2007.4313218","DOIUrl":"https://doi.org/10.1109/PACRIM.2007.4313218","url":null,"abstract":"Recently, there are many denial-of-service (DoS) attacks by computer viruses or botnet. DoS attacks to Web services are called HTTP-GET flood attack and threats of them increase day by day. In this type of attacks, malicious clients send a large number of HTTP-GET requests to the target Web server automatically. Since these HTTP-GET requests have legitimate formats and are sent via normal TCP connections, an intrusion detection system (IDS) can not detect them. In this paper, we propose HTTP-GET flood detection techniques based on analysis of page access behavior. We propose two detection algorithms, one is focusing on a browsing order of pages and the other is focusing on a correlation with browsing time to page information size. We implement detection techniques and evaluate attack detection rates, i.e., false positive and false negative. The results show that our techniques can detect the HTTP-GET flood attack effectively.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122396288","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":"Adaptive Equalization of Space-Time Coded MC-CDMA Systems","authors":"A. Trivedi, M. Bansal","doi":"10.1109/PACRIM.2007.4313208","DOIUrl":"https://doi.org/10.1109/PACRIM.2007.4313208","url":null,"abstract":"This paper considers applying the well known least-mean-square (LMS) adaptive algorithm on the detection for space-time coded multicarrier CDMA (STC-MC-CDMA) systems in frequency selective environments. In particular, we consider the Alamouti's space-time coding scheme that involves two transmit antennas. The performance of the LMS detector is evaluated with computer simulations. The performance of the LMS detector is compared with minimum mean-square error (MMSE) detector and the performances of both the schemes are found to be almost identical.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131568980","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 Improved Multiscale Normal-Mesh-Based Image Coder","authors":"Di Xu, M. Adams","doi":"10.1109/PACRIM.2007.4313174","DOIUrl":"https://doi.org/10.1109/PACRIM.2007.4313174","url":null,"abstract":"Three modifications to the normal-mesh-based image coder of Jansen, Baraniuk, and Lavu are proposed, namely, the use of a data-dependent base mesh, an alternative representation for normal/vertical offsets, and a different scan-conversion scheme based on bicubic interpolation. Experimental results show that our proposed changes lead to improved coding performance in terms of both objective and subjective image quality measures.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121784220","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 Local Timestamp Based Adaptive Clock Method FOR TDM over Ethernet","authors":"Dai Jin-you, Yu Shao-hua","doi":"10.1109/PACRIM.2007.4313195","DOIUrl":"https://doi.org/10.1109/PACRIM.2007.4313195","url":null,"abstract":"Clock methods for TDM over Ethernet network are introduced. A new adaptive clock method is presented. The method is a kind of timestamp based adaptive method, but no timestamp needs transporting over Ethernet network. By using the local oscillator and a counter, the timestamp information (local timestamp) related to the service clocks of the two PEs (provide edge) can be attained. By statistic computing, the timestamp information can be converted into a random data sequence that accords with the Karlman filter equations. By using Karlman filter algorithm, the noise caused by Ethernet network can be filtered and the useful timestamp can be extracted out. With the timestamp and a voltage-controlled oscillator, clock frequency of local PE can be adjusted the same as clock frequency of the remote PE. Experimental results verify that the proposed method is better than the present congener methods.","PeriodicalId":395921,"journal":{"name":"2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133995939","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}