发布求助
文献互助 智能选刊 最新文献

2010 5th International Conference on Future Information Technology最新文献

筛选
英文 中文
Intrusion Investigations with Data-Hiding for Computer Log-File Forensics 计算机日志文件取证中数据隐藏的入侵调查
2010 5th International Conference on Future Information Technology Pub Date : 2010-05-21 DOI: 10.1109/FUTURETECH.2010.5482741
Yang Fan, Shiuh-Jeng Wang
{"title":"Intrusion Investigations with Data-Hiding for Computer Log-File Forensics","authors":"Yang Fan, Shiuh-Jeng Wang","doi":"10.1109/FUTURETECH.2010.5482741","DOIUrl":"https://doi.org/10.1109/FUTURETECH.2010.5482741","url":null,"abstract":"In most of companies or organizations, logs play important role in information security. However, the common security mechanism only backup logs, it is not able to find out traces of intruders because the hacker who is able to intrudes the security mechanism of organization would try to alter logs or destroy important intrusion evidences making it impossible to preserve evidence using traditional log security strategies. Thus, logs are not considered as evidence to prove the damage. In that case, digital evidence lacks in terms of completeness which makes it difficult to perform computer forensics operations. In order to maintain the completeness and reliability of evidence for later forensic procedures and intrusion detection, the study applies concepts of steganography to logs forensics, for which even intrusion altered records will be kept as well. Comparing to traditional security strategies, this study proposes a better logging mechanism to ensure the completeness of logs. Furthermore, the study will assist in intrusion detection through alteration behavior, and help in forensic operations.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129560259","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}
引用次数: 19
A Novel Scheme of Multi-View Video Coding for Low-Delay View Random Access 一种基于低延迟随机存取的多视点视频编码新方案
2010 5th International Conference on Future Information Technology Pub Date : 2010-05-21 DOI: 10.1109/FUTURETECH.2010.5482742
Huayi Lv, Li-ni Ma, Hai Liu
{"title":"A Novel Scheme of Multi-View Video Coding for Low-Delay View Random Access","authors":"Huayi Lv, Li-ni Ma, Hai Liu","doi":"10.1109/FUTURETECH.2010.5482742","DOIUrl":"https://doi.org/10.1109/FUTURETECH.2010.5482742","url":null,"abstract":"In Multi-view Video Coding Scheme, the ability of view random access is an important performance to evaluate an encoding scheme's interactivity. At present, Multi-view Video Coding scheme based on H.264 standard makes data compression coding with both temporal and inter-view correlations. So, an efficient method to fetch the requested frame of view and time at small cost is needed, while making view random access. A novel scheme of Multi-view Video Coding which is based on dual-channel elementary streams with hierarchical B pictures is proposed, after analysis of the method of view random access and scheme of Multi-view Video Coding. Experimental results show that the proposed coding scheme can effectively improve the ability to view random access and it can reduce calculation complexity. Furthermore, the new scheme is also improve the coding efficiency to a certain exrent.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129814162","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}
引用次数: 2
Supporting Composite Smart Home Services with Semantic Fault Management 支持语义故障管理的复合智能家居服务
2010 5th International Conference on Future Information Technology Pub Date : 2010-05-21 DOI: 10.1109/FUTURETECH.2010.5482708
Zohar Etzioni, J. Keeney, Rob Brennan, D. Lewis
{"title":"Supporting Composite Smart Home Services with Semantic Fault Management","authors":"Zohar Etzioni, J. Keeney, Rob Brennan, D. Lewis","doi":"10.1109/FUTURETECH.2010.5482708","DOIUrl":"https://doi.org/10.1109/FUTURETECH.2010.5482708","url":null,"abstract":"The proliferation of smart home technologies providing home users with digital services presents an interoperability problem. This paper asserts that the value of these services can be greatly extended by enabling technology-neutral compositions of these home services, and furthermore that the reliability of such composite services will be of paramount importance to ensuring widespread deployment. Therefore fault management capabilities must accompany the composition capabilities in order to increase the robustness and reliability of such services. This paper proposes a web services-based abstraction layer for home area network service composition and a semantically informed fault management system for composed services, which can assist in diagnosis and correction of problems with composite services in smart homes of the future. Prototyping work and use cases are also described and initial metrics are presented that investigate the overhead of introducing the technology neutral abstraction layer.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130656829","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}
引用次数: 16
Phishing in Finance 金融网络钓鱼
2010 5th International Conference on Future Information Technology Pub Date : 2010-05-21 DOI: 10.1109/FUTURETECH.2010.5482704
Kristofer Beck, J. Zhan
{"title":"Phishing in Finance","authors":"Kristofer Beck, J. Zhan","doi":"10.1109/FUTURETECH.2010.5482704","DOIUrl":"https://doi.org/10.1109/FUTURETECH.2010.5482704","url":null,"abstract":"Phishing is continually shown to be a problem in network security. Phishing is trickery towards the user believing that he or she is communicating with a trusted source. Most phishing attacks are focused on the financial infrastructure such as financial institutions like banks and services like Paypal. We proposed a different interface than the traditional browsers which prove through past research are prone to fail in complete security. A thin client instead will be created to allow a secure connection between a client and the institution. We believe that this is a better way to prevent people from losing their private information due to phishing.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"464 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130974832","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}
引用次数: 5
Architecture-Aware Graph-Covering Algorithm for Custom Instruction Selection 自定义指令选择的体系结构感知图覆盖算法
2010 5th International Conference on Future Information Technology Pub Date : 2010-05-21 DOI: 10.1109/FUTURETECH.2010.5482719
A. Yazdanbakhsh, M. Salehi, S. M. Fakhraie
{"title":"Architecture-Aware Graph-Covering Algorithm for Custom Instruction Selection","authors":"A. Yazdanbakhsh, M. Salehi, S. M. Fakhraie","doi":"10.1109/FUTURETECH.2010.5482719","DOIUrl":"https://doi.org/10.1109/FUTURETECH.2010.5482719","url":null,"abstract":"Application-specific extensions to the computational capabilities of a processor provide an efficient mechanism to meet the growing performance demands of embedded applications. In recent customized processors, hardware in the form of new function units and the corresponding custom instructions are added to a core processor to meet the critical computational demands of a target application. This paper presents a new method for automatic selection of application-specific processor extensions. We demonstrate the effectiveness of this system across a range of application domains. Our investigations show that considering the architectural constraints in the custom instruction selection leads to improvements in the total performance of the application. Simulations based on domain-specific application benchmark suites show that with the proposed technique, up to 10% performance improvement can be achieved over the traditional graph covering method.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125512285","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
Story Board Based Video Manufacture System 基于分镜的视频制作系统
2010 5th International Conference on Future Information Technology Pub Date : 2010-05-21 DOI: 10.1109/FUTURETECH.2010.5482737
Youngeun An, Taeyeun Kim, Jimin Lee, SungJin Lim, Jongan Park
{"title":"Story Board Based Video Manufacture System","authors":"Youngeun An, Taeyeun Kim, Jimin Lee, SungJin Lim, Jongan Park","doi":"10.1109/FUTURETECH.2010.5482737","DOIUrl":"https://doi.org/10.1109/FUTURETECH.2010.5482737","url":null,"abstract":"With the significant increase in the number of Internet users of recent times, more digital content is being made and managed. Currently, digital content systems make videos utilizing key words and a content based retrieval process. This study proffers the concept of an automatic creation of story board by extracting emotional and content based data. Unlike previous systems, it provides a story board based content editing intelligence using various multimedia features for both general users and professionals. It extracts content and emotional information from video automatically and uses this data for story board, which supports quick decision making in planning, with reduced repetition and therefore less time required for the making of story board, and, it thereby improves the quality of the actual product.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126201774","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}
引用次数: 0
Bloom Filter-Based Data Hiding Algorithm in Wireless Sensor Networks 基于Bloom滤波器的无线传感器网络数据隐藏算法
2010 5th International Conference on Future Information Technology Pub Date : 2010-05-21 DOI: 10.1109/FUTURETECH.2010.5482761
Ji-yun Yang, Xingming Sun, Baowei Wang, Xiangrong Xiao, Xiaoliang Wang, Dong Luo
{"title":"Bloom Filter-Based Data Hiding Algorithm in Wireless Sensor Networks","authors":"Ji-yun Yang, Xingming Sun, Baowei Wang, Xiangrong Xiao, Xiaoliang Wang, Dong Luo","doi":"10.1109/FUTURETECH.2010.5482761","DOIUrl":"https://doi.org/10.1109/FUTURETECH.2010.5482761","url":null,"abstract":"Sensor networks hold the promise of facilitating large-scale and real-time data processing in complex environments. Data security is an extremely crucial issue for many sensor network applications. Data hiding technique, which is considered less consumptive than cryptology, is introduced to guarantee the security of the sensitive data in wireless sensor networks. However, the low invisibility of such schemes has always been the most fatal weaknesses. In this paper, we propose an innovative data hiding method. Sensitive data are uniformly and randomly embedded into the ordinary data by using the space-efficient randomized data structure characteristic of Bloom Filter. Full embedding and simple fixed embedding laws are avoided. Any intermediate nodes of the network and eavesdroppers are more difficult to detect the existence of sensitive data. Experimental results and performance analysis demonstrate that the proposed scheme can efficiently protect the sensitive data, without affecting the transmission and usability of the ordinary data. At the same time，this method also has little additional energy consumption.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"176 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123764735","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}
引用次数: 3
Localization Algorithm Design and Implementation to Utilization RSSI and AOA of Zigbee 利用Zigbee RSSI和AOA的定位算法设计与实现
2010 5th International Conference on Future Information Technology Pub Date : 2010-05-21 DOI: 10.1109/FUTURETECH.2010.5482710
Chulyoung Park, Dae-Heon Park, Jangwoo Park, Yangsun Lee, Youngeun An
{"title":"Localization Algorithm Design and Implementation to Utilization RSSI and AOA of Zigbee","authors":"Chulyoung Park, Dae-Heon Park, Jangwoo Park, Yangsun Lee, Youngeun An","doi":"10.1109/FUTURETECH.2010.5482710","DOIUrl":"https://doi.org/10.1109/FUTURETECH.2010.5482710","url":null,"abstract":"In this paper, we has implemented the localization algorithm through RSSI and AOA of Zigbee. The RSSI (Received Signal Strength Indicator) method is used for the localization of Zigbee and affected a lot by intensity, distance and interruption of signals. The combined algorithm of AOA (Angle of Arrival) and RSSI has been designed and implemented to make up the weaknesses of RSSI. As long as we knew, although the previous system has been implemented and used through the UWB (Ultra Wide-Band) or CSS communication methods, the firstly implemented system is the location recognition algorithm through RSSI and AOA of Zigbee. In this paper has obtained the result from the repeated tests to achieve the measurement of location with the accuracy of average 35 ~ 36 cm when the suggested system was placing the beacon on the four corners of 2 dimensional rectangular space with 4m wide and 2m long, and the receiver on the random space.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131160496","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}
引用次数: 25
Comparative Analysis of Low-Level Visual Features for Affective Determination of Video Clips 视频片段情感判断的低层次视觉特征对比分析
2010 5th International Conference on Future Information Technology Pub Date : 2010-05-21 DOI: 10.1109/FUTURETECH.2010.5482649
R. M. A. Teixeira, T. Yamasaki, K. Aizawa
{"title":"Comparative Analysis of Low-Level Visual Features for Affective Determination of Video Clips","authors":"R. M. A. Teixeira, T. Yamasaki, K. Aizawa","doi":"10.1109/FUTURETECH.2010.5482649","DOIUrl":"https://doi.org/10.1109/FUTURETECH.2010.5482649","url":null,"abstract":"Many algorithms and works have helped in the understanding and development of affective analysis of films. In spite of the progress made up to now, it is still not very precise how the low-level features of movies shape the resulting affective state of the viewer. In this work we evaluate different visual features and investigate how they impact the emotional evaluation under two paradigms: the dimensional approach (in terms of Pleasure, Arousal and Dominance) and the categorial approach. The analysis is conducted by using Dynamic Bayesian Networks (DBN) in the following topologies: a Hidden Markov Model network and Auto Regressive Hidden Markov Model network. Different combinations of feature vectors were used in order to check the performance of the proposed methods. The ground truth was created from an extensive user experiment, which was also used to create models that could map Pleasure, Arousal and Dominance values into affective categories.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131466780","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
On Building a Self-Organizing Search System for Multimedia Retrieval 构建自组织多媒体检索系统的研究
2010 5th International Conference on Future Information Technology Pub Date : 2010-05-21 DOI: 10.1109/FUTURETECH.2010.5482652
J. Sedmidubský, Vlastislav Dohnal, P. Zezula
{"title":"On Building a Self-Organizing Search System for Multimedia Retrieval","authors":"J. Sedmidubský, Vlastislav Dohnal, P. Zezula","doi":"10.1109/FUTURETECH.2010.5482652","DOIUrl":"https://doi.org/10.1109/FUTURETECH.2010.5482652","url":null,"abstract":"We focus on content-based retrieval in unstructured P2P networks consisting of thousands of peers that unpredictably join and leave the network. Such environments with permanent churning of peers require self-organizing mechanisms that should deal with sudden peer failures, arrivals of new peers, and continual changes of data or network topology. In this paper, we build a self-organizing search system that operates in an unstructured P2P network and allows users to search for multimedia data by their content. In order to efficiently route queries to relevant peers, we define and evaluate several techniques for joining new peers to the existing network. These techniques create new relationships between peers -- on the basis of answers returned to queries -- so that a new peer will be able to efficiently forward queries and other peers will be immediately informed about its data. In addition, we demonstrate resilience of the system to sudden peer failures by studying system performance and quality of returned answers after a large number of peers is disconnected. The experiments, evaluated on a synthetic and real-life multimedia dataset, confirm that the proposed techniques are suitable for dynamic environments.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121774272","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}
引用次数: 3
首页 上一页 下一页 尾页
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学术官方微信