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

2009 Sixth International Conference on Information Technology: New Generations最新文献

筛选
英文 中文
Attacks on a Block Based SVD Watermarking Scheme 基于块的奇异值分解水印方案的攻击
2009 Sixth International Conference on Information Technology: New Generations Pub Date : 2009-04-27 DOI: 10.1109/ITNG.2009.37
H. Ling, Swee-Huay Heng, B. Goi
{"title":"Attacks on a Block Based SVD Watermarking Scheme","authors":"H. Ling, Swee-Huay Heng, B. Goi","doi":"10.1109/ITNG.2009.37","DOIUrl":"https://doi.org/10.1109/ITNG.2009.37","url":null,"abstract":"One major application of a watermarking scheme is to protect the copyright of a content owner by embedding the owner's watermark into the content. Recently, a block based watermarking scheme was proposed by Ghazy et al., which is dependent on singular value decomposition (SVD). In the proposed scheme, the cover image is divided into blocks, and then the watermark is embedded in the singular values of each block separately. In this paper, we present attacks on this watermarking scheme and show how the designers' security claims can be invalidated, namely related to robustness and protection of rightful ownership.","PeriodicalId":347761,"journal":{"name":"2009 Sixth International Conference on Information Technology: New Generations","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115687417","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
An Optimization Model for IO Jitter in Device-Level RTOS 设备级RTOS中IO抖动的优化模型
2009 Sixth International Conference on Information Technology: New Generations Pub Date : 2009-04-27 DOI: 10.1109/ITNG.2009.112
Zheng Liu, Hai Zhao, Peng Li, Jialiang Wang
{"title":"An Optimization Model for IO Jitter in Device-Level RTOS","authors":"Zheng Liu, Hai Zhao, Peng Li, Jialiang Wang","doi":"10.1109/ITNG.2009.112","DOIUrl":"https://doi.org/10.1109/ITNG.2009.112","url":null,"abstract":"In order to reduce the influence of the jitter of hard real-time task caused by scheduling to the stability and reliability of device-level operation system, a model with preemption segment threshold-RJPS is presented. According to the effect on jitter and latency brought by threshold and the analysis of the scheduling on this model, two minimum threshold assigned algorithms are designed. One of them is used for fixed-priority scheduling, and the other is for dynamic-priority scheduling. To test the performance of the threshold segmentation scheduling model, a simulation experiment is carried on. After comparing the simulation results with other three strategies which can reduce the IO jitter from many angles, it is found that the threshold segmentation scheduling model can effectively reduce the IO jitter of tasks caused by scheduler in the typical scheduling algorithm.","PeriodicalId":347761,"journal":{"name":"2009 Sixth International Conference on Information Technology: New Generations","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114745321","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
Experiences Using New Technologies in a Computer Organization Course 在计算机组织课程中运用新技术的经验
2009 Sixth International Conference on Information Technology: New Generations Pub Date : 2009-04-27 DOI: 10.1109/ITNG.2009.266
Prem Uppulur, M. Htay
{"title":"Experiences Using New Technologies in a Computer Organization Course","authors":"Prem Uppulur, M. Htay","doi":"10.1109/ITNG.2009.266","DOIUrl":"https://doi.org/10.1109/ITNG.2009.266","url":null,"abstract":"In this paper, we present our experiences in using online lectures (screencasts), online office hours and blogging to enhance on-campus as well as distance education courses in Computer Organization in the Department of Information Technology at Radford University. We discuss our experiences mainly in terms of the effort required to incorporate them into our existing courses on Computer Organization.","PeriodicalId":347761,"journal":{"name":"2009 Sixth International Conference on Information Technology: New Generations","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121953715","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
Hierarchical Intelligent Agent Based Wireless Body Sensor Mesh Networks 基于分层智能代理的无线身体传感器网状网络
2009 Sixth International Conference on Information Technology: New Generations Pub Date : 2009-04-27 DOI: 10.1109/ITNG.2009.150
S. Sankaranarayanan
{"title":"Hierarchical Intelligent Agent Based Wireless Body Sensor Mesh Networks","authors":"S. Sankaranarayanan","doi":"10.1109/ITNG.2009.150","DOIUrl":"https://doi.org/10.1109/ITNG.2009.150","url":null,"abstract":"Wireless Sensor Networks (WSN) is a significant technology that has a considerable attraction in many areas, particularly in health sector. On the other hand wireless mesh networks, which are an extension of LAN, have far better range and also reduce the amount of cabling needed to connect to the backbone network. In this paper a scheme viz., Wireless Sensor based Mesh Networks, which is an integration of the above two technologies has been proposed. This scheme also incorporates agent technology in its functioning. A hierarchical agent based layered architecture of this scheme, meant for health applications, have also been discussed.","PeriodicalId":347761,"journal":{"name":"2009 Sixth International Conference on Information Technology: New Generations","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125919916","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
A New Algorithm for Frequent Itemset Generation in Non-Binary Search Space 非二分搜索空间中频繁项集生成的新算法
2009 Sixth International Conference on Information Technology: New Generations Pub Date : 2009-04-27 DOI: 10.1109/ITNG.2009.36
G. P. Kumar, A. Sarkar, N. Debnath
{"title":"A New Algorithm for Frequent Itemset Generation in Non-Binary Search Space","authors":"G. P. Kumar, A. Sarkar, N. Debnath","doi":"10.1109/ITNG.2009.36","DOIUrl":"https://doi.org/10.1109/ITNG.2009.36","url":null,"abstract":"Association rule induction is a powerful data mining method, used to analyze the regularities in data trends by finding the frequent itemset and association between items or set of items. Several research attempts have been done for the purpose based on the binary data space. In this paper an algorithm has been proposed for the same purpose but based on the non-binary data space. The algorithm is capable to generate the frequent itemset more close to the real life situations as it consider the Strength of Presence of each items implicitly. Also the algorithm can be directly applicable to the real time data repository for finding the frequent itemset.","PeriodicalId":347761,"journal":{"name":"2009 Sixth International Conference on Information Technology: New Generations","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129351372","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 Idle Mode Mobility State Detection in Evolved UTRAN 演化型UTRAN中空闲模式迁移状态检测
2009 Sixth International Conference on Information Technology: New Generations Pub Date : 2009-04-27 DOI: 10.1109/ITNG.2009.254
J. Puttonen, Niko Kolehmainen, T. Henttonen, J. Kaikkonen
{"title":"On Idle Mode Mobility State Detection in Evolved UTRAN","authors":"J. Puttonen, Niko Kolehmainen, T. Henttonen, J. Kaikkonen","doi":"10.1109/ITNG.2009.254","DOIUrl":"https://doi.org/10.1109/ITNG.2009.254","url":null,"abstract":"In this paper we present different idle mode mobility state detection mechanisms targeted for 3GPP Evolved UTRAN. The purpose is to study the reliability of the mobility state detection mechanism specified in 3GPP TS 36.304 for 3GPP Release 8 in varying conditions, such as different re-selection thresholds, UE velocities and inter-site distances. Three mobility states have been defined in TS 36.304 based on occurred cell re-selections in a certain time window. According to small inter-site distance simulations, pedestrian speeds (normal mobility state) can be detected with a quite satisfactory accuracy but distinguishing the medium and high mobility states is quite challenging, since UEs are experiencing quite large variance in number of re-selections with the same UE velocities. Simulations with large inter-site distances show similar results.","PeriodicalId":347761,"journal":{"name":"2009 Sixth International Conference on Information Technology: New Generations","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129966331","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}
引用次数: 17
Variable Block Size Architecture for Programs 程序的可变块大小体系结构
2009 Sixth International Conference on Information Technology: New Generations Pub Date : 2009-04-27 DOI: 10.1109/ITNG.2009.88
S. Subha
{"title":"Variable Block Size Architecture for Programs","authors":"S. Subha","doi":"10.1109/ITNG.2009.88","DOIUrl":"https://doi.org/10.1109/ITNG.2009.88","url":null,"abstract":"Cache reconfiguration is well studied topic in recent time. This paper proposes an algorithm to determine variable block size for variables in a program at some predetermined points called decision points based on their access pattern. The whole program is divided into segments by the decision points. Rules to decide the decision points are developed. The algorithm identifies the decision points, formulates optimization function to determine the average memory access time for the variables involved at these decision points. Solving the optimization function with constraints gives the optimal block size. The algorithm is simulated for a chosen example and an improvement of 78% in AMAT was observed for the chosen example. The chosen example performed better than prefetching by 28%.","PeriodicalId":347761,"journal":{"name":"2009 Sixth International Conference on Information Technology: New Generations","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130174437","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
A Methodology for Mobile Network Security Risk Management 移动网络安全风险管理方法
2009 Sixth International Conference on Information Technology: New Generations Pub Date : 2009-04-27 DOI: 10.1109/ITNG.2009.321
Mahdi Seify, Shahriar Bijani
{"title":"A Methodology for Mobile Network Security Risk Management","authors":"Mahdi Seify, Shahriar Bijani","doi":"10.1109/ITNG.2009.321","DOIUrl":"https://doi.org/10.1109/ITNG.2009.321","url":null,"abstract":"Based on the risk analysis done in the GSM network of Iran a methodology for cellular mobile network risk management is established. Primarily we focus on the importance of risk management in the GSM Network and then introduce very briefly the suggested method for managing risk in Iranian GSM security. GSM Security risk evaluation is a method for increasing the efficiency of security policy in the manner that security threats and vulnerabilities against the mobile network is identified and prioritized. Keywords: Risk Management, Mobile Security, Mobile Network, GSM, M-Commerce, Telecommunication.","PeriodicalId":347761,"journal":{"name":"2009 Sixth International Conference on Information Technology: New Generations","volume":"391 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130202680","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
Fault-Tolerant Maximal Local-Connectivity on the Bubble-Sort Graphs 冒泡排序图上的容错最大局部连通性
2009 Sixth International Conference on Information Technology: New Generations Pub Date : 2009-04-27 DOI: 10.1109/ITNG.2009.51
Lun-Min Shih, Jimmy J. M. Tan
{"title":"Fault-Tolerant Maximal Local-Connectivity on the Bubble-Sort Graphs","authors":"Lun-Min Shih, Jimmy J. M. Tan","doi":"10.1109/ITNG.2009.51","DOIUrl":"https://doi.org/10.1109/ITNG.2009.51","url":null,"abstract":"An interconnection network is usually modeled as a graph, in which vertices and edges correspond to processor and communication links, respectively. The local connectivity of two vertices is defined as the maximum number of internally vertex-disjoint paths between them. In this paper, we define two vertices to be maximally local-connected, if the maximum number of internally vertex-disjoint paths between them equals the minimum degree of these two vertices. Moreover, we introduce the one-to-many version of connectivity. We show that an n-dimensional Bubble-sort Graph is maximally local-connected, even if there are at most n − 3 faulty vertices in it, and prove that it is also (n − 1)-fault-tolerant one-to-many maximally local-connected.","PeriodicalId":347761,"journal":{"name":"2009 Sixth International Conference on Information Technology: New Generations","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130535201","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
An Algorithm for Secure Deletion in Flash Memories 一种闪存安全删除算法
2009 Sixth International Conference on Information Technology: New Generations Pub Date : 2009-04-27 DOI: 10.1109/ICCSIT.2009.5234575
S. Subha
{"title":"An Algorithm for Secure Deletion in Flash Memories","authors":"S. Subha","doi":"10.1109/ICCSIT.2009.5234575","DOIUrl":"https://doi.org/10.1109/ICCSIT.2009.5234575","url":null,"abstract":"Data deletion in flash memories involves erasing the bits and making the memory free. As contents get deleted in the flash memory, time is consumed in deleting the data on the flash permanently. This paper proposes a method to make the contents of the deleted blocks in the flash memory unreliable by suitably introducing errors in the error correcting code bits of the block and randomly changing bits in each page of the block. This method saves the time to erase a block completely on deletion. The algorithm was simulated on a sample file. It gave a performance improvement of 92.88% over zero overwriting and 92.98% over block erasure methods.","PeriodicalId":347761,"journal":{"name":"2009 Sixth International Conference on Information Technology: New Generations","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130693302","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学术官方微信