2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)最新文献

筛选
英文 中文
Recovery of Damaged Compressed Files for Digital Forensic Purposes 恢复损坏的压缩文件的数字取证目的
Bora Park, Antonio Savoldi, P. Gubian, Jungheum Park, Seokhee Lee, Sangjin Lee
{"title":"Recovery of Damaged Compressed Files for Digital Forensic Purposes","authors":"Bora Park, Antonio Savoldi, P. Gubian, Jungheum Park, Seokhee Lee, Sangjin Lee","doi":"10.1109/MUE.2008.49","DOIUrl":"https://doi.org/10.1109/MUE.2008.49","url":null,"abstract":"Nowadays compressed files are very widespread and can be considered, without any doubt, with regard to the Digital Forensic realm, an important and precious source of probatory data. This is especially true when in a digital investigation the examiner has to deal with corrupted compressed files, which have been gathered in the collection phase of the investigative process. Therefore, in the computer forensic field, data recovery technologies are very important for acquiring useful pieces of data which can become, in a court of low, digital evidence. This kind of technology is used not only by law enforcement, but also by the multitude of users in their daily activities, which justify the relevant presence of tools in the software market which are devoted to rescue data from damaged compressed files. However, state-of-the-art data recovery tools have many limitations with regard to the capability of recovering the original data, especially in the case of damaged compressed files. So far, such recovery tools have been based on a which controls the signature/header of the file and, thus, provides the offset to the raw compressed data block. As a result, they cannot recover the compressed files if the first part of the raw compressed data block, which pertains to the header, is damaged or the signature/header block is corrupted. Therefore, in order to deal with this issue, we have developed a new tool capable of rescuing damaged compressed files, according to the DEFLATE compression scheme, even though the header block is missing or corrupted. This represents a new interesting opportunity for the digital forensic discipline.","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":"114604788","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}
引用次数: 9
The Adaptive Heartbeat Design of High Availability RAID Dual-Controller 高可用性RAID双控制器自适应心跳设计
Yaping Wan, D. Feng, Tianming Yang, Ze Deng, Li Liu
{"title":"The Adaptive Heartbeat Design of High Availability RAID Dual-Controller","authors":"Yaping Wan, D. Feng, Tianming Yang, Ze Deng, Li Liu","doi":"10.1109/MUE.2008.31","DOIUrl":"https://doi.org/10.1109/MUE.2008.31","url":null,"abstract":"Designing storage systems to provide high availability in the face of failures needs the use of various data protection techniques, such as dual-controller RAID. The failure of RAID controller may cause RAID storage system to fail to respond to ongoing requests and to no longer be available to new requests. Heartbeat is used to detect controllers whether survival. So, the heartbeat cycle's impact on the high availability of a dual-controller hot-standby system has become the key of current research. To address the problem of fixed setting heartbeat in building high availability system currently, a self-adaptive heartbeat model of dual-controller, which can adjust heartbeat cycle based on the frequency of data read-write request, is designed to improve the high availability of dual-controller RAID storage system. Based on this model, the high availability stochastic Petri net model of fault detection was established and used to evaluate the effect of the availability. In addition, we define a SHA (self-adaptive heart ability) parameter to scale the ability of system heartbeat cycle to adapt to the environment when high availability system is at a changing environment of read and write requests. The results show that, relatively speaking with fixed configuration, the design can enhance dual controller RAID system high availability.","PeriodicalId":203066,"journal":{"name":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","volume":"19 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":"125262733","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}
引用次数: 8
DG-Based Active Defense Strategy to Defend against DDoS 基于dg的DDoS主动防御策略
R. Guo, G. Chang, Yuhai Qin, Baojing Sun, An Liu, Bencheng Zhang, Dan Peng
{"title":"DG-Based Active Defense Strategy to Defend against DDoS","authors":"R. Guo, G. Chang, Yuhai Qin, Baojing Sun, An Liu, Bencheng Zhang, Dan Peng","doi":"10.1109/MUE.2008.53","DOIUrl":"https://doi.org/10.1109/MUE.2008.53","url":null,"abstract":"In this paper, it is advocated that defenders should take active action to stop DDoS attacks. We propose a new model based on differential games theory. Four main actors are included, attacker, defender, victim, and botnet. It is our belief that victims who experience an attack should cooperate with defender to defend for a DDoS-attack. The model indicates the minimum number of Bots that should blocked by defender. A differential games model is used to determine how a defender combats an attacker and protect the servers. The feasibility and effectiveness of our approach is validated by measuring the performance of an experimental prototype against a series of attacks. The advantages of the scheme are discussed and further research directions are given.","PeriodicalId":203066,"journal":{"name":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","volume":"79 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":"131870792","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}
引用次数: 4
Validating Secure Connections between Wireless Devices in Pervasive Computing Using Data Matrix 使用数据矩阵验证普适计算中无线设备之间的安全连接
Seunghyun Im
{"title":"Validating Secure Connections between Wireless Devices in Pervasive Computing Using Data Matrix","authors":"Seunghyun Im","doi":"10.1109/MUE.2008.108","DOIUrl":"https://doi.org/10.1109/MUE.2008.108","url":null,"abstract":"This paper describes the techniques for establishing secure associations between mobile devices in pervasive computing where the communications are often established with minimal priori knowledge. An improved method for securing the association by comparing a hashed key using Data Matrix will be presented. A Data Matrix displayed or printed on another device in the association is captured with a built-in digital camera. The image is then used to validate the device's public key.","PeriodicalId":203066,"journal":{"name":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","volume":"66 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":"116544547","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}
引用次数: 1
Analyzing Maximum Length of Instruction Sequence in Network Packets for Polymorphic Worm Detection 基于多态蠕虫检测的网络数据包指令序列最大长度分析
K. Tatara, Y. Hori, K. Sakurai
{"title":"Analyzing Maximum Length of Instruction Sequence in Network Packets for Polymorphic Worm Detection","authors":"K. Tatara, Y. Hori, K. Sakurai","doi":"10.1109/MUE.2008.119","DOIUrl":"https://doi.org/10.1109/MUE.2008.119","url":null,"abstract":"The importance of the method for finding out the worms that are made through the modification of parts of their original worms increases. It is difficult to detect these worms by comparing with the simple definition that past anti-virus software adapts. Moreover, if it is not an already-known worm, it is not possible to detect it. In this paper, we pay attention to the Toth et al.'s method to extract the executable code included in the dataflows on the network and detect the attack by measuring the length of them. The importance of the method for finding out the worms that are made through the modification of parts of their original worms increases. It is difficult to detect these worms by comparing with the simple definition that past anti-virus software adapts. Moreover, if it is not an already- known worm, it is not possible to detect it. In this paper, we pay attention to the Toth et al.'s method to extract the executable code included in the dataflows on the network and detect the attack by measuring the length of them. Then, we describe the problem of their method and how to solve it.Then, we describe the problem of their method and how to solve it.","PeriodicalId":203066,"journal":{"name":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","volume":"29 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":"133224868","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}
引用次数: 4
Image Retrieval Using Maximum Frequency of Local Histogram Based Color Correlogram 基于颜色相关图的局部直方图最大频率图像检索
Waqas Rasheed, Youngeun An, S. Pan, Ilhoe Jeong, Jong-An Park, Jin-Suk Kang
{"title":"Image Retrieval Using Maximum Frequency of Local Histogram Based Color Correlogram","authors":"Waqas Rasheed, Youngeun An, S. Pan, Ilhoe Jeong, Jong-An Park, Jin-Suk Kang","doi":"10.1109/AMS.2008.76","DOIUrl":"https://doi.org/10.1109/AMS.2008.76","url":null,"abstract":"Color histogram is widely used for image indexing in content-based image retrieval (CBIR). A color histogram describes the global color distribution of an image. It is very easy to compute and is insensitive to small changes in viewing positions. However, the histogram is not robust to large appearance changes. Moreover, the histogram might give similar results for different kinds of images if the distributions of colors are same in the images. On the other hand, color correlogram is efficiently used for image indexing in content-based image retrieval. Color correlogram extracts not only the color distribution of pixels in images like color histogram, but also extracts the spatial information of pixels in the images. The characteristic of the color Correlogram to take into account the spatial information as well as the distribution of color pixels greatly attracts the researcher for content based image retrieval. In this paper, we propose the image bin (histogram value divisions) separation technique followed by extracting maxima of frequencies and plotting a correlogram. At first, the histogram is first calculated for an image. After that, it is subdivided into four equal bins. Each bin is subdivided into four more bins and for every such subdivision the maxima of frequencies s calculated. This information is stored in the form of a correlogram. The distance between correlogram of the query image with the corresponding correlogram of database images is calculated. The proposed algorithm is tested on a database comprising a large number of images.","PeriodicalId":203066,"journal":{"name":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","volume":"66 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":"133363841","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}
引用次数: 26
Efficient Compression of Multi-view Video Using Hierarchical B Pictures 使用分层B图的多视点视频有效压缩
Li-ni Ma, F. Pan
{"title":"Efficient Compression of Multi-view Video Using Hierarchical B Pictures","authors":"Li-ni Ma, F. Pan","doi":"10.1109/MUE.2008.103","DOIUrl":"https://doi.org/10.1109/MUE.2008.103","url":null,"abstract":"3D and free viewpoint video are new types of natural video media that expand the user's sensation far beyond what is offered by traditional media. As video compression is a key issue in traditional video communications and the use of multi video streams makes it even more important for such applications. In this paper, we presented an investigation of the multi- view video coding structures with focus on exploiting hierarchical B pictures. We demonstrate hierarchical B pictures prediction structures, and present the advantage of several multi-view video coding prediction schemes. This demonstration will show the benefits of using hierarchical B pictures based on H.264/AVC. The simulation results demonstrate that the objective quality can be improved with the advanced MVC prediction structures in comparison to the simulcast coding structures.","PeriodicalId":203066,"journal":{"name":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","volume":"48 2 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":"129810247","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}
引用次数: 12
Reconfigurable Depth Buffer Compression Design for 3D Graphics System 三维图形系统的可重构深度缓冲压缩设计
Tzung-Rung Jung, Lan-Da Van, W. Fang, Teng-Yao Sheu
{"title":"Reconfigurable Depth Buffer Compression Design for 3D Graphics System","authors":"Tzung-Rung Jung, Lan-Da Van, W. Fang, Teng-Yao Sheu","doi":"10.1109/MUE.2008.64","DOIUrl":"https://doi.org/10.1109/MUE.2008.64","url":null,"abstract":"Depth buffer bandwidth reduction is one of the most important issues in bandwidth-limited 3D computer graphics system. In this paper, we propose a reconfigurable algorithm for depth buffer compression. For 8times8 tile size and 16-bit depth values, the proposed algorithm can achieve 1.91:1 compression ratio on average and improve 76.9% and 39.4% compared with HA in Hasselgren, J, (2006) and DDPCM in DeRoo, J. (2002), respectively. Furthermore, the devised algorithm supports one-plane and two-plane compression modes and manipulates break points more efficiently.","PeriodicalId":203066,"journal":{"name":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","volume":"33 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132831027","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}
引用次数: 1
Investigating Wireless Sensor Network Lifetime Using a Realistic Radio Communication Model 利用真实无线电通信模型研究无线传感器网络寿命
M. Mallinson, S. Hussain, J. Park
{"title":"Investigating Wireless Sensor Network Lifetime Using a Realistic Radio Communication Model","authors":"M. Mallinson, S. Hussain, J. Park","doi":"10.1109/MUE.2008.62","DOIUrl":"https://doi.org/10.1109/MUE.2008.62","url":null,"abstract":"Investigating realistic simulations in wireless sensor networks has been an area which has drawn a lot of research interest. These simulations are used to predict the lifetime of wireless sensor networks, evaluation of network performance and data dissemination algorithms. A discrete radio model can be used for calculating more realistic power consumption and determining which links between sensor motes are available for transmission. In this work, we apply a discrete power dissipation model to investigate performance of a few data dissemination algorithms and techniques. We also define an upper bound upon network lifetime which is derived from the discrete radio model.","PeriodicalId":203066,"journal":{"name":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","volume":"89 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":"114216105","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}
引用次数: 24
A User-Perceived Freshness Clustering Method to Identify Three Subgroups in Mobile Internet Users 一种用户感知新鲜度聚类方法识别移动互联网用户的三个子群
T. Yamakami
{"title":"A User-Perceived Freshness Clustering Method to Identify Three Subgroups in Mobile Internet Users","authors":"T. Yamakami","doi":"10.1109/MUE.2008.110","DOIUrl":"https://doi.org/10.1109/MUE.2008.110","url":null,"abstract":"The user behavior analysis of the mobile Internet is still to be explored. This increases importance in research and business as the mobile Internet penetration becomes visible. The author performs a preparatory survey to identify the user behavior scenarios during a day. It indicates that there are three distinguished mobile Internet behavior patterns: (a) always active, (b) irregular, (c) prime time use. This gives a novel perspective to understand user interactions in the mobile Internet. Intelligent mobile services require addressing these differences in order to improve user experience. The author proposes a user-perceived freshness method to cluster users with the content access logs in order to utilize this three-subgroup-based view. The revisit ratio in the following month is used to characterize the user clusters and the middle users show a high revisit ratio. The author discusses the characteristics of this middle user segment.","PeriodicalId":203066,"journal":{"name":"2008 International Conference on Multimedia and Ubiquitous Engineering (mue 2008)","volume":"81 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":"114819505","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}
引用次数: 6
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信