{"title":"An Energy-Aware Distributed Algorithm for Sensor Nodes Clustering","authors":"S. Bagchi","doi":"10.1109/MUE.2008.81","DOIUrl":"https://doi.org/10.1109/MUE.2008.81","url":null,"abstract":"The sensor devices of wireless sensor networks (WSN) are severely resource constrained having limited operational lifetime. The clustering of sensor nodes provides longer operational lifetime of the nodes and facilitates data aggregation. This paper proposes a distributed algorithm for clustering of sensor nodes based on the one-hop-neighbours of the nodes. The cluster heads of the clusters are elected based on the local energy levels of the nodes without involving any distributed messaging. This paper presents the model, design and analysis of the algorithm.","PeriodicalId":203066,"journal":{"name":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","volume":"6 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":"129014217","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":"Detecting Clusters and Outliers for Multi-dimensional Data","authors":"Yong Shi","doi":"10.1109/MUE.2008.19","DOIUrl":"https://doi.org/10.1109/MUE.2008.19","url":null,"abstract":"Nowadays many data mining algorithms focus on clustering methods. There are also a lot of approaches designed for outlier detection. We observe that, in many situations, clusters and outliers are concepts whose meanings are inseparable to each other, especially for those data sets with noise. Thus, it is necessary to treat clusters and outliers as concepts of the same importance in data analysis. In this paper, we present a cluster-outlier iterative detection algorithm, tending to detect the clusters and outliers in another perspective for noisy data sets. In this algorithm, clusters are detected and adjusted according to the intra-relationship within clusters and the inter-relationship between clusters and outliers, and vice versa. The adjustment and modification of the clusters and outliers are performed iteratively until a certain termination condition is reached. This data processing algorithm can be applied in many fields such as pattern recognition, data clustering and signal processing.","PeriodicalId":203066,"journal":{"name":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","volume":"63 1-3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132394413","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":"FBBM: A New Backup Method with Data De-duplication Capability","authors":"Tianming Yang, D. Feng, Jingning Liu, Yaping Wan","doi":"10.1109/MUE.2008.33","DOIUrl":"https://doi.org/10.1109/MUE.2008.33","url":null,"abstract":"Data de-duplication eliminates multiple copies of the same file and repeated chunks or segments of data within those files, thus reduces disk capacity and bandwidth required for backups. Recently, driven by the needs of large-capacity/high performance data backup, data de-duplication is becoming a new research focus of the storage industry. In this paper, we present a fingerprint-based backup method named FBBM which performs data de-duplication in the backup. FBBM breaks files into variable sized chunks using anchor-based chunking scheme for the purpose of duplication detection. Chunks are stored on a write-once RAID (Redundant Array of Inexpensive Disks) and indexed and addressed by the hash of their content, this leads to intrinsically single instance storage. FBBM outperforms traditional backup methods in terms of storage and bandwidth saving. This makes it a promising tool for modern enterprises to backup or archive their ever-growing valuable data with low storage and bandwidth cost.","PeriodicalId":203066,"journal":{"name":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","volume":"9 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":"127940395","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":"TCP-Based Dynamic Media Stream Adaptation in Ubiquitous Environment","authors":"Gergely Hományi, G. Paller","doi":"10.1109/MUE.2008.70","DOIUrl":"https://doi.org/10.1109/MUE.2008.70","url":null,"abstract":"More and more media material is consumed in ubiquitous environment where the service can be experienced over different devices, network conditions, network bearers, etc. Unlike in traditional wireless environments where at least changes of the QoS parameters are controlled by the network, ubiquitous networks are characterized by abrupt changes. Transition from complete disconnectivity to low- cost, high-bandwidth connection can happen in a relatively short time span. Media consumption over such networks are influenced by two, contradictory user requirements. The first requirement is that the users would not like to see quality changes in the media stream. The second requirement is that the user would like to consume the media with the best available quality. This paper presents an adaptation algorithm that aims to reconcile these requirements. Architecture variants of the media adaptation problem and prototyping experiences are also presented.","PeriodicalId":203066,"journal":{"name":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","volume":"28 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":"114254103","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}
Yu-Ren Liao, Yu-Cheng Chen, Kuan-Chung Chen, Wei-Guang Teng
{"title":"Supporting Landmark Image Retrieval with Skyline Extraction Techniques","authors":"Yu-Ren Liao, Yu-Cheng Chen, Kuan-Chung Chen, Wei-Guang Teng","doi":"10.1109/MUE.2008.95","DOIUrl":"https://doi.org/10.1109/MUE.2008.95","url":null,"abstract":"The problem of image retrieval is much more challenging than that of text retrieval since significant features for representing and searching an arbitrary image vary with the image content. In this work, we focus on processing images containing landmarks which are easily recognizable by human users. Our observations show that through the use of proper techniques for skyline extraction, the retrieval task of landmark images can be feasible. Specifically, after conducting edge detection on an image, an approach which works in the similar fashion as depth-first search is proposed to extract the corresponding skyline precisely. In addition to theoretical analysis of relevant issues, empirical studies show that our approach is advantageous to be utilized in practical applications due to its high efficiency, effectiveness and scalability.","PeriodicalId":203066,"journal":{"name":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","volume":"5 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":"131276742","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":"Personalized Information Retrieval Using the User History","authors":"Taehwan Kim, Hochul Jeon, Joongmin Choi","doi":"10.1109/MUE.2008.60","DOIUrl":"https://doi.org/10.1109/MUE.2008.60","url":null,"abstract":"Many search algorithms have been implemented by many researchers on the world wide web. One of the best algorithms is Google using PageRank technology. PageRank approach computes the number of Mink of each documents then ranks documents in the order of Mink members. But it is difficult to find the results that user needs, because this method finds documents not valueable for a person but valueable for the public. This paper proposes a personalized search engine that emphasizes both the public worth such as page rank using the Mink of each documents and the personal worth.","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":"131371006","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 Trust Management Model for P2P File Sharing System","authors":"Huafeng Wu, C. Shi, Haiguang Chen, Chuanshan Gao","doi":"10.1109/MUE.2008.76","DOIUrl":"https://doi.org/10.1109/MUE.2008.76","url":null,"abstract":"Peer-to-peer (P2P) network systems have an open and dynamic nature for sharing files and real-time data transmission. While P2P systems have already many existing and envisioned applications, the security issue of P2P systems is still worth deeply researching. Some traditional approaches mainly rely on cryptography to ensure data authentication and integrity. These approaches, however, only addressed part of the security issues in P2P systems. In this paper, we propose a trust management model for P2P file-sharing systems. We use the incomplete experience to get the trust rating in P2P systems, and use aggregation mechanism to indirectly combine and obtain other node's trust rating. Simulation results and analysis show that our proposed trust management model can quickly detect the misbehavior peers and limit the impacts of them in a P2P file-sharing system.","PeriodicalId":203066,"journal":{"name":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","volume":"28 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":"133116862","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}
Won-Hee Han, Eun-Ha Song, L. Yang, J. Park, Y. Jeong
{"title":"ACE: Active Emergence Call Service System for u-Lifecare","authors":"Won-Hee Han, Eun-Ha Song, L. Yang, J. Park, Y. Jeong","doi":"10.1109/MUE.2008.55","DOIUrl":"https://doi.org/10.1109/MUE.2008.55","url":null,"abstract":"This paper establishes ACE system that supports active emergency call service. ACE system is physically composed of E-device (emergency mobile device) for the handicapped, single elderly, and children, and E-server (emergency server) with realtime monitoring management feature. E-device reports emergency situation to emergency institutions and the user's guardian through Internet or CDMA. Therefore, E-device is devised to be affordable, light- weighted, and small enough for the minorities including the handicapped, the elders, and children could carry around. E-server is developed as a comprehensive control system which provides realtime monitoring feature in order to manage E-devices efficiently and guarantee quality service.","PeriodicalId":203066,"journal":{"name":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","volume":"142 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":"114837399","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":"Design and Implementation of a FAT File System for Reduced Cluster Switching Overhead","authors":"Moon-Bok Choi, Heemin Park, Jae-Hun Jeon","doi":"10.1109/MUE.2008.42","DOIUrl":"https://doi.org/10.1109/MUE.2008.42","url":null,"abstract":"In this paper, we present design and implementation of a New FAT file system (NFAT) for mobile multimedia devices. Conventional file system which has been used for personal computers is the FAT and it is still adopted for most of current portable devices. The major problem of the FAT is overhead due to cluster switching which involves retrieving and updating of cluster connection information saved on the file allocation table. Because of this overhead, response time of file read and write operation cannot be guaranteed in the FAT. This paper proposes the NFAT which guarantees expected response time by reducing cluster switching overhead when it reads and writes data for portable multimedia devices. To verify our proposal, we have implemented a prototype NFAT file system on ARM9 development board and a Secure Digital Card. The experimental results show that the NFAT does not have irregular response time when performing read/write operations. Therefore, the NFAT is suitable file system for mobile devices which have real-time requirements in reading and writing multimedia data.","PeriodicalId":203066,"journal":{"name":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","volume":"23 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":"121889739","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. Bandyopadhyay, D. Bhattacharyya, P. Das, D. Debnath
{"title":"Handwritten Signature Authentication Using Statistical Estimation","authors":"S. Bandyopadhyay, D. Bhattacharyya, P. Das, D. Debnath","doi":"10.1109/MUE.2008.12","DOIUrl":"https://doi.org/10.1109/MUE.2008.12","url":null,"abstract":"In this paper we propose a new handwritten signature authentication scheme. The scheme consists of two main rule set algorithms and one authentication algorithm. The Algorithms are based on extensive statistical analysis, Mean variance and theory of estimation. This is an extension work of handwritten signature identification. This scheme supports the application environment and we strongly believe that \"user authentication\" could be a solid platform for future research and study.","PeriodicalId":203066,"journal":{"name":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","volume":"28 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":"122078143","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}