{"title":"A 3D Model Retrieval System Based on the Cylindrical Projection Descriptor","authors":"Jau-Ling Shih, Chang-Hsing Lee, Chih-Hsun Chou, Hsiang-Yuen Chang","doi":"10.1109/BWCCA.2010.130","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.130","url":null,"abstract":"In recent years, the demand for a content-based 3D model retrieval system becomes an important issue. In this paper, the cylindrical projection descriptor (CPD) will be proposed for 3D model retrieval. To derive better retrieval results, the CPD will be combined with the radial distance descriptor (RDD). The experiments are conducted on the Princeton Shape Benchmark (PSB) database. Experiment results show that our proposed method is superior to others.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123110668","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":"Comments on a One-Way Hash Chain Based Authentication for FMIPv6","authors":"I. You, Jong‐Hyouk Lee","doi":"10.1109/BWCCA.2010.84","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.84","url":null,"abstract":"In this paper, we analyze a one-way hash chain based authentication scheme proposed by Haddad and Krishnan. The authentication scheme has been introduced for improving handover performance in Fast Mobile IPv6 (FMIPv6), but as we argue in this paper the authentication scheme is vulnerable to redirect and DoS attacks. We present strengths and weaknesses of the authentication scheme. In addition, a possible extension to Network Mobility (NEMO) is suggested.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128777099","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 Zone Based Routing Protocol for Ad Hoc Networks and Its Performance Improvement by Reduction of Control Packets","authors":"Yuki Sato, A. Koyama, L. Barolli","doi":"10.1109/BWCCA.2010.43","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.43","url":null,"abstract":"In recent years, there are many research works on ad hoc networks. In the future, we will see many ad hoc network applications, which are very important for realizing ubiquitous environments. The topology of ad hoc networks may change. For this reason, the routing protocols play an important role for construction of ad hoc networks. In this paper, we propose a new zone based routing protocol, which reduces the number of control packets. In the conventional routing protocols, the control packets are transmitted periodically. However, in the proposed protocol, the control packets are only transmitted when nodes are moving. The performance evaluation via simulations shows that the proposed protocol has a good performance and power consumption characteristics than conventional protocols.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128993840","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}
Chih-Ta Yen, H. Liaw, N. Lo, Ting-Chun Liu, J. Stu
{"title":"Transparent Digital Rights Management System with Superdistribution","authors":"Chih-Ta Yen, H. Liaw, N. Lo, Ting-Chun Liu, J. Stu","doi":"10.1109/BWCCA.2010.110","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.110","url":null,"abstract":"Digital rights management allows content providers to control the distribution and usage of digital contents for their e-commerce applications. Most of previously proposed digital rights management mechanisms focus on the protection mechanisms for digital contents and pay less attention to the discussion on business models and users’ convenience. It will decrease effective distribution for digital contents and the intentions of users’ usage. With the super distribution model, we first propose a digital rights management system that increases distribution channels to increase the efficiency of distribution for digital contents. Then, we implement the proposed digital rights management system by using the API Hook with Microsoft Foundation Classes (MFC) as a wrapper. The implemented digital rights management system can achieve content protection without sacrificing user’s convenience. In addition, the proposed digital rights management system satisfies the following requirements: description, identification, transaction, protection, monitoring, tracing, super distribution, transparency, and portability.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115952681","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":"Particle Swarm Optimization on DSI Method for PAPR Reduction in OFDM Systems","authors":"Shu-Hong Lee, Ho-Lung Hung","doi":"10.1109/BWCCA.2010.147","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.147","url":null,"abstract":"Dummy sequence insertion (DSI) structure is a method without side information and changing signal shape to reduce peak-to-average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) signal. The key to enhance its performance is creating more qualified dummy sequence. In this paper, particle swarm optimization (PSO) algorithm is applied to DSI scheme to more effectively mitigate the PAPR problem in OFDM systems. Simulation results show that the proposed method is superior to that of adopting complementary sequence as dummy sequence one.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125965937","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. Uchida, J. Honda, S. Nakashima, Kwang-Yeol Yoon
{"title":"Back Scattering from Target above Random Rough Surface","authors":"K. Uchida, J. Honda, S. Nakashima, Kwang-Yeol Yoon","doi":"10.1109/BWCCA.2010.133","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.133","url":null,"abstract":"This paper is concerned with an analysis of the back scattering of an electromagnetic wave by a target moving along just above a random rough surface such as desert, hilly terrain, sea surface and so on. First we introduce the discrete ray tracing method (DRTM) for the field analysis of back scattering. Second we investigate the effect of clutter due to back scattering from the random rough surface on the radar cross section (RCS) of the target. Finally we show some numerical examples for back scattering from a target above a Gaussian type of random rough surface with arbitrary height deviation and correlation length. It is demonstrated that the clutter is predominant in the back scattering and it is mainly caused by the diffraction related to reflection from the random rough surface.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128244432","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 Parallel Skyline Solver for Coarse Grid Correction of BDD Pre-conditioning in Domain Decomposition Method","authors":"H. Kawai, M. Ogino, R. Shioya, S. Yoshimura","doi":"10.1109/BWCCA.2010.88","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.88","url":null,"abstract":"To shorten the computational time of the coarse grid correction stage of BDD pre-conditioner, we developed a parallel skyline solver based on a blocking algorithm. Performance benchmark of the solver shows 30 - 50 times speed up.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"334 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133528249","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":"Multiagent Architecture of Knowledge Based Network Management Support System","authors":"K. Sasai, G. Kitagata, Tetsuo Kinoshita","doi":"10.1109/BWCCA.2010.172","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.172","url":null,"abstract":"To reduce the loads of network administrators and to ensure the tasks, we have proposed AIR-NMS, which is a network management support system (NMS) based on Active Information Resource (AIR). In AIR-NMS, various information resources (e.g., state information of a network, practical knowledge of network management) are combined with software agents which have the knowledge and functions for supporting the utilization of the resources, and thus individual resources are given activities as Airs. Through the organization and cooperation of Airs, AIR-NMS provides the administrators with practical measures against a wide range of network faults. In this paper, we present the way to install network management knowledge as Airs and its multi-agent architecture of AIR utilization, which is AIR-NMS.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134564948","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 Approximation for Fresnel Function to Reduce Computation Time Based on DRTM","authors":"K. Uchida, J. Honda, Yuuki Kimura","doi":"10.1109/BWCCA.2010.92","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.92","url":null,"abstract":"This paper is concerned with an approximation for diffraction function composed of a complex type of Fresnel function. The diffraction function is often used when we analyze the electromagnetic diffraction problems by using the discrete ray tracing method (DRTM). In this paper we introduce an approximate expression for the diffraction function in the form of simplified polynomial series resulting in saving much computation time. Numerical examples are carried out for the well-known three diffraction problems, and it is shown that both the accurate and approximate solutions are in good agreement. It is also described that the computation time based on the proposed approximation is about 13% in comparison with the computation time based on the accurate formulation.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132683384","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":"Redundancy and Defense Resource Allocation Algorithms to Assure Service Continuity against Natural Disasters and Intelligent Attackers","authors":"F. Lin, Yu-Shun Wang, Po-Hao Tsang, Jui-Pin Lo","doi":"10.1109/BWCCA.2010.72","DOIUrl":"https://doi.org/10.1109/BWCCA.2010.72","url":null,"abstract":"In this paper, we discuss Redundancy Allocation Problem (RAP) in network environments. By efficiently combining redundancy with extra defense mechanisms, we attempt to ensure the continuity of a network service, and enhance its survivability against malicious attackers that utilize accumulated experience. We construct an attack/defense scenario, in which an attacker and a defender compete against each other, and formulate it as a two-phase nonlinear integer programming problem. We adopt a Lagrange an Relaxation-based solution approach to resolve the above problem, and further prove the efficacy of our approach by computer experiments. The result shows LR-Based attack algorithm is better than other strategies we compared. Further, no matter what kind of attack/defense cost function is adopted, the LR-Based allocation algorithm can always provide a much better defense capability than others.","PeriodicalId":196401,"journal":{"name":"2010 International Conference on Broadband, Wireless Computing, Communication and Applications","volume":"356 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132883561","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}