X. Gan, Kui Dai, Libo Huang, Li Shen, Zhiying Wang
{"title":"A New CORDIC Algorithm and Software Implementation Based on Synchronized Data Triggering Architecture","authors":"X. Gan, Kui Dai, Libo Huang, Li Shen, Zhiying Wang","doi":"10.1109/MUE.2008.40","DOIUrl":"https://doi.org/10.1109/MUE.2008.40","url":null,"abstract":"A new CORDIC algorithm based on sign bits prediction is presented. It is an effective method for transforming arbitrary iterations of classic CORDIC to simple matrix multiplications. At the same time, this algorithm is implemented based on synchronized data triggering architecture (SDTA). Experimental results show that the average speed-up of transcendental functions tested based on our version CORDIC compared with mathematic library supported in gcc3.2.2 is up to 283% under the given Neuron microprocessor.","PeriodicalId":203066,"journal":{"name":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121409018","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 Performance-Effective and High-Scalable Grid File System","authors":"C. Chu, Ching-Hsien Hsu","doi":"10.1109/MUE.2008.115","DOIUrl":"https://doi.org/10.1109/MUE.2008.115","url":null,"abstract":"A high-performance file system is normally a key point for large cluster installations, where hundreds or even thousands of nodes frequently need to manage large volumes of data. Distributed Storage Resource Broker (SRB) Server architecture is designed for facilitating reliable file sharing and high-performance distributed and parallel data computing in a Grid across administrative domains by providing a global virtual file system. SRBFS is an attempt to implement a global virtual file system that supports a complete set of standard POSIX APIs, while still retaining the parallel and distributed data computing feature of distributed SRBFS Server architecture. In this paper we investigate the possibilities of a distributed model for the SRB server which is based on SDSC SRB client-server middleware. A prototype has been built upon the user-level SRBFS and a performance evaluation is carried out. We present a comparison of wide-area file transfer performance of the SRBFS and SEMPIAR which is SRB enabled MPIIO library for access to remote storage. On the NCHC cluster, the ROMIO Perf benchmark attained an aggregate write bandwidth of 225 MBbps with 12 clients. The benchmark results are encouraging and show that distributed SRB Server provides applications with scalable, high-bandwidth I/O across wide area networks.","PeriodicalId":203066,"journal":{"name":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","volume":"417 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124188617","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 Imperceptible Watermarking Scheme Using Variation and Modular Operations","authors":"Shu-Fen Tu, Ching-Sheng Hsu","doi":"10.1109/MUE.2008.15","DOIUrl":"https://doi.org/10.1109/MUE.2008.15","url":null,"abstract":"The aim of this paper is to propose an imperceptible wavelet-based watermarking scheme. In our scheme, we use variation to define the degree of transparence of coefficients of LL band and further determine transparent coefficients of HL3 and LH3 bands. Then, the watermark is embedded into those coefficients. In addition, the modular operation is utilized during watermark embedding. In the experimental results, we simulate some common attacks on the watermarked image. It is shown that our scheme is robust against most attacks; moreover, the watermarked image is highly imperceptible.","PeriodicalId":203066,"journal":{"name":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122406323","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 Extension of Software Player for Playing Finalizing-Failure DVD VR Discs","authors":"Chun-Yi Tsai, Tzao-Lin Lee","doi":"10.1109/MUE.2008.26","DOIUrl":"https://doi.org/10.1109/MUE.2008.26","url":null,"abstract":"DVD VR (video recording) is a logic format adopted by most home consumer DVD recorder machines to record real-time TV and multimedia content on DVD+R/RW or DVD-R/RW blank discs. However, DVD VR format can only be recognized and played by the DVD recorder itself. To achieve forward compatibility and play ability, the recorder provides a function called disc finalizing process which closes every tracks and sessions of a DVD VR disc and changes its logic format from DVD VR to DVD-video to make it playable on generic DVD-video compatible players. Unfortunately, disc finalizing process provided by DVD recorder is very unstable and unreliable due to various uncertain reasons. This unreliable finalizing process often and easily produces failure discs which are neither in correct DVD VR format nor in DVD-video format. Thus, these discs become unrecognized, and can no longer be played any more by any DVD players or recorders. This paper proposes an extension of software solution which is capable of reading and playing non-finalized or finalizing-failure DVD VR discs.","PeriodicalId":203066,"journal":{"name":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129257716","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 Very Low Bit Rate Video Coding for Ubiquitous Services","authors":"B. Chow","doi":"10.1109/MUE.2008.25","DOIUrl":"https://doi.org/10.1109/MUE.2008.25","url":null,"abstract":"Shape compensation is proposed in this paper to replace the DCT residue coding used in standard video coding. That is, our binary images are coded by the motion vectors and the class of morphological filters. Therefore the very low bit rate 1 k bps can be easily achieved for the image size 64*64. Our coding procedures are simple: reducing quantization after reducing resolution, and shape compensation after motion compensation. However, the visual quality can be tolerable considering the carrying convenience of the small display and the inexpensive pay rate of communication. Therefore, the proposed coding strategy is suitable for video coding for ubiquitous services.","PeriodicalId":203066,"journal":{"name":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","volume":"170 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125819913","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":"High-Speed Implementations of Block Cipher ARIA Using Graphics Processing Units","authors":"Yongjin Yeom, Yongkuk Cho, M. Yung","doi":"10.1109/MUE.2008.94","DOIUrl":"https://doi.org/10.1109/MUE.2008.94","url":null,"abstract":"The power of graphics processing unit(GPU) has been increasing rapidly more than that of CPU. It is not surprising that many software libraries were developed which enable us to use the power of GPU for general computations especially in parallel data processing. In this paper, we propose implementations of the standard block cipher ARIA of Korea using OpenGL and CUDA libraries on GPU. Since ARIA was announced only 4 years ago, there is no hardware solution yet providing high-speed encryption with ARIA. We make use of GPU as a parallel processors with several grid structures and optimize the encryption speed and the occupancy of shared-memory. As a result, when ARIA is running on GeForce 8800GTS using CUDA library, the speed of the encryption reaches up to 4.8 Gbps which is the fastest implementation of ARIA known to public.","PeriodicalId":203066,"journal":{"name":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126608111","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 Hybrid Congestion Control Algorithm for Structured P2P Networks","authors":"Zhi Chen, Jingdong Xu, Guowei Huang","doi":"10.1109/MUE.2008.20","DOIUrl":"https://doi.org/10.1109/MUE.2008.20","url":null,"abstract":"In structured P2P networks, the heterogeneity of node capacity and the skewness in query pattern could result in load imbalance and even congestion. VS-based migration and indegree adjustment are two typical solutions to address this problem. The former one is effective but incurs a high maintenance overhead, while the latter one is light-weighted but subject to its interior restriction. To combine the merits of these two existing approaches, this paper presents a hybrid congestion control algorithm. The basic idea behind our algorithm is that we first dynamically identify a group of nodes susceptible to congestion and then reallocate loads among them by indegree adjustment, and finally resort to VS-like proxy routing mechanism if the load exceeds the capacity of these nodes. The results of our simulation experiments show that our algorithm could effectively reduce the level of congestion with a low overhead.","PeriodicalId":203066,"journal":{"name":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133101013","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 Study on Composite System Vulnerability through CC Analysis","authors":"Jaegu Song, Seoksoo Kim","doi":"10.1109/MUE.2008.58","DOIUrl":"https://doi.org/10.1109/MUE.2008.58","url":null,"abstract":"In this study, CC Version 3.0 is analyzed to propose a method and a set of standards for evaluating vulnerability of the composite system for conducting the serviceable range per composite product class and TOE analysis, secure protection and guidelines for composite product.","PeriodicalId":203066,"journal":{"name":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122941239","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":"Speaker Independent Phoneme Recognition Based on Fisher Weight Map","authors":"Takashi Muroi, T. Takiguchi, Y. Ariki","doi":"10.1109/MUE.2008.82","DOIUrl":"https://doi.org/10.1109/MUE.2008.82","url":null,"abstract":"We have already proposed a new feature extraction method based on higher-order local auto-correlation and Fisher weight map (FWM) at Interspeech2006. This paper shows effectiveness of the proposed FWM in speaker dependent and speaker independent phoneme recognition. Widely used MFCC (Mel-frequency cepstrum coefficient) features lack temporal dynamics. To solve this problem, local auto-correlation features are computed and accumulated by weighting high scores on the discriminative areas. This score map is called Fisher weight map. From the speaker dependent phoneme recognition, the proposed FWM showed 79.5% recognition rate, by 5.0 points higher than the result by MFCC. Furhermore by combing FWM with MFCC and DeltaMFCC, the recognition rate improved to 88.3%. In the speaker independent phoneme recognition, it showed 84.2% recognition rate, by 11.0 points higher than the result by MFCC. By combining FWM with MFCC and DeltaMFCC, the reecognition rate improved to 89.0%.","PeriodicalId":203066,"journal":{"name":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124031965","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 Flexible Access Control Scheme for JPEG2000 Codestreams","authors":"Yang Ou, C. Jung, Chul Sur, K. Rhee","doi":"10.1109/MUE.2008.44","DOIUrl":"https://doi.org/10.1109/MUE.2008.44","url":null,"abstract":"JPEG2000 is the newest image coding standard which provides flexible scalability. Designing an encryption system for scalable JPEG200 codestream is becoming a new challenge. Wu et al. (2007) proposed a flexible access control scheme for JPEG2000 codestream. However, it needs key regeneration whenever users change the preferred progression order. In this paper, we propose an improved flexible access control scheme for JPEG2000 codestreams based on multi-dimensional hash chains (MDHC), in which the keys need not to be regenerated whenever different progression order of packets is required. In particular, we employ multiple hash chains to generate a series of keys to encrypt each packet in the codestream. Furthermore, users can access the encrypted codestream according to any authorized combinations of resolution, quality layer and precinct with as few as possible keys. Also, our proposed scheme is secure against collusion attack as well as unauthorized access.","PeriodicalId":203066,"journal":{"name":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","volume":"167 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124422614","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}