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

ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.最新文献

筛选
英文 中文
Remote monitoring and control of PC clusters using mobile phones with J2ME 利用手机对PC集群进行远程监控与J2ME
ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005. Pub Date : 2005-06-27 DOI: 10.1109/ITRE.2005.1503128
Chao-Tung Yang, Man-Kit Kou
{"title":"Remote monitoring and control of PC clusters using mobile phones with J2ME","authors":"Chao-Tung Yang, Man-Kit Kou","doi":"10.1109/ITRE.2005.1503128","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503128","url":null,"abstract":"In this paper, we describe the integration of one of these applications, cluster monitoring, and control, in the incoming mobile Internet, by developing access interfaces for handheld devices. To achieve this goal, we propose a design model for a PC cluster access from handheld mobile phones. We present two methods to perform motoring and control for PC clusters from mobile cell phones by using J2ME. The system model and demonstrated results are also presented in this paper.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130614012","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
Active quotation authentication in Microsoft Word documents using block signatures Microsoft Word文档中使用块签名的主动报价认证
ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005. Pub Date : 2005-06-27 DOI: 10.1109/ITRE.2005.1503118
Tsung-Yuan Liu, Wen-Hsiang Tsai
{"title":"Active quotation authentication in Microsoft Word documents using block signatures","authors":"Tsung-Yuan Liu, Wen-Hsiang Tsai","doi":"10.1109/ITRE.2005.1503118","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503118","url":null,"abstract":"Traditional message authentication does not verify the integrity and the claimed source of quotations in an anonymous message. A new active quotation authentication framework is proposed that allows a reader to authenticate the content and origin of the quotations in a citing document. A block signature method is proposed that generates context-sensitive block signatures for an authoritative message, and allows quotation signatures to be generated on-the-fly for arbitrary sub passages by an anonymous author. The block signature method requires a small initial computational effort and storage requirement for block signature generation; has a small quotation signature overhead; and is efficient for quotation authentication.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126413251","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
Notice of Violation of IEEE Publication PrinciplesEfficient query routing in peer-to-peer networks 违反IEEE发布原则的通知点对点网络中有效的查询路由
ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005. Pub Date : 2005-06-27 DOI: 10.1109/ITRE.2005.1503150
L. Gatani, Giuseppe Lo, Noto
{"title":"Notice of Violation of IEEE Publication PrinciplesEfficient query routing in peer-to-peer networks","authors":"L. Gatani, Giuseppe Lo, Noto","doi":"10.1109/ITRE.2005.1503150","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503150","url":null,"abstract":"In peer-to-peer (P2P) networks, efficient and scalable data retrieval represents a key problem. Unstructured P2P networks avoid the limitations of centralized systems and the drawbacks of structured approaches. However, their search algorithms are usually based on simple flooding schemes, showing severe inefficiencies. In this paper, in order to address this major limitation, we propose the adoption of a local adaptive routing protocol, that uses a smart neighbor selection process such that nodes with similar interest are likely to be grouped together as neighbors. Extensive simulations prove that the approach is able to dynamically adapt the topology to peer interests, organizing them into a small world network. The results also show that our algorithm has a very good impact on the successful rate, allowing to retrieve the resources searched even when they are sparse.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116204229","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 simple resource advertisement and discovery protocol for large and dense MANETs 一个简单的面向大型密集网的资源发布和发现协议
ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005. Pub Date : 2005-06-27 DOI: 10.1109/ITRE.2005.1503056
Jean-Lien C. Wu, Shun-Te Wang, Chun-Yen Hsu
{"title":"A simple resource advertisement and discovery protocol for large and dense MANETs","authors":"Jean-Lien C. Wu, Shun-Te Wang, Chun-Yen Hsu","doi":"10.1109/ITRE.2005.1503056","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503056","url":null,"abstract":"With remarkable advances in wireless technologies, applications of mobile ad hoc networks will be in widespread use in the near future. Thus, the geographical network environments may become large and dense. In such network environments, a large number of resource discovery queries may be generated when specific resources or services are needed. In this paper, we propose a simple resource advertisement and discovery (SRAD) protocol for applications in mobile ad hoc networks. The SRAD protocol self-organizes a proximity network and works in a fully distributed architecture without centralized control and management. The simulation results show that the SRAD protocol can achieve the same level of performance as in the broadcast-based protocols while generating fewer transmitted messages in large and dense mobile ad hoc networks.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113978198","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
A token-based h-out of-k distributed mutual exclusion algorithm for mobile ad hoc networks 移动自组网中基于令牌的h-out -k分布式互斥算法
ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005. Pub Date : 2005-06-27 DOI: 10.1109/ITRE.2005.1503069
Cheng-Zen Yang
{"title":"A token-based h-out of-k distributed mutual exclusion algorithm for mobile ad hoc networks","authors":"Cheng-Zen Yang","doi":"10.1109/ITRE.2005.1503069","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503069","url":null,"abstract":"Distributed mutual exclusion is a challenging problem in mobile ad hoc networks (MANETs). Due to the dynamic characteristics of MANETs, only a few algorithms have been proposed. Until recent years, these studies do not consider the more general h-out of-k mutual exclusion problem. In this paper we propose a distributed algorithm to solve the h-out of-k mutual exclusion problem in MANETs. The proposed algorithm has three benefits: (1) it improves the CS execution time by allowing at most k tokens to be concurrently dispatched; (2) it employs logical ring construction to adapt the token navigation to the system requirements; (3) it is designed with the consideration of the dynamical link formation characteristics in MANETs and is thus suitable for mobile environments. This paper shows its correctness. The proposed algorithm is also flexible for different token navigation policies to meet versatile MANET needs.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131503443","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
Congestion management of self similar IP traffic using normal and exponential marking RED 使用正常和指数标记RED的自相似IP流量的拥塞管理
ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005. Pub Date : 2005-06-27 DOI: 10.1109/ITRE.2005.1503086
S. Suresh, Ö. Göl
{"title":"Congestion management of self similar IP traffic using normal and exponential marking RED","authors":"S. Suresh, Ö. Göl","doi":"10.1109/ITRE.2005.1503086","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503086","url":null,"abstract":"Schemes described in the literature on network congestion management are in general based on queue management. It is widely accepted that Poisson model is not sufficient to characterize the traffic in current Internet. In this paper, we present an alternate RED (Random Early Detection) algorithm for traffic congestion management in IP networks having self-similar (SS) input. We first discuss the basic scheme of Normal and Gentle RED as proposed by Floyd et.al., for the Poisson input model, and then explain piecewise RED, an extension of Gentle RED and Exponential RED - a new AQM proposed by us. We then explain the modification to these algorithms that we propose for the self-similar IP traffic input. Our modification takes into consideration probability values corresponding to the average queue lengths for computing the marking/dropping probability. Verification of the algorithms proposed viz., Normal SS RED and Exponential SS RED, vis-a-vis that of Floyd has been done using simulated self-similar traffic. Results of the verification have been discussed in the paper.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132314739","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
QoS contention control for optical coarse packet switched IP-over-WDM network 光粗分组交换IP-over-WDM网络的QoS争用控制
ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005. Pub Date : 2005-06-27 DOI: 10.1109/ITRE.2005.1503104
M. Yuang, P. Tien, J. Shih, Steven S. W. Lee, Yu-Min Lin, Yuan Chen, Frank Tsai, Alice Chen
{"title":"QoS contention control for optical coarse packet switched IP-over-WDM network","authors":"M. Yuang, P. Tien, J. Shih, Steven S. W. Lee, Yu-Min Lin, Yuan Chen, Frank Tsai, Alice Chen","doi":"10.1109/ITRE.2005.1503104","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503104","url":null,"abstract":"In this paper, we first introduce an optical coarse packet switching (OCPS) paradigm. In principle, OCPS advocates the enforcement of traffic engineering and control to realize bandwidth-on-demand on sub-wavelength basis while circumventing optical packet switching limitations. Based on OCPS, we have constructed an experimental optical IP-over-WDM network testbed, referred to as OPSINET. In the paper, we present the architectural design of OPSINET and its Hybrid Contention Control (HCC) mechanism aiming to satisfy various classes of loss QoS guarantees. The mechanism preventively adopts appropriate burst sizes for different traffic classes during packet burstification at ingress routers. It also reactively performs prioritized contention resolution at OLSRs in the presence of contention. Experimental results show that HCC invariantly achieves low loss probability as a result of burstification-based traffic shaping. Moreover, it provides satisfied loss guarantees for high-priority classes while incurring minimal loss degradation for lower-priority classes.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"182 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133435487","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
Bluetooth scatternet formation for supporting device mobility 支持设备移动性的蓝牙散射网形成
ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005. Pub Date : 2005-06-27 DOI: 10.1109/ITRE.2005.1503153
Chorng-Horng Yang, Yi-Sheng Chen
{"title":"Bluetooth scatternet formation for supporting device mobility","authors":"Chorng-Horng Yang, Yi-Sheng Chen","doi":"10.1109/ITRE.2005.1503153","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503153","url":null,"abstract":"Since most of the Bluetooth devices are portable, the user may bring the Bluetooth devices and roams in the range of a scatternet. Thus, the capability of formatting Bluetooth scatternet under device mobility impacts on the survivability and feasibility of the Bluetooth network. In this paper, we propose a formation algorithm that can construct the Bluetooth scatternet subject to device mobility on basis of our proposed mobility model. The proposed algorithms deal with the moving of a single device, which may be a slave, bridge, or master. Moreover, the proposed algorithms can be extended to support group mobility easily. We also conduct the simulation study to evaluate the performance of the proposed algorithms and discuss some interesting topics for further study.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133473007","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}
引用次数: 10
Adaptive content model for distance education 远程教育的自适应内容模式
ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005. Pub Date : 2005-06-27 DOI: 10.1109/ITRE.2005.1503136
Ming-Chih Lu, L. Deng, Hsi-Chien Yu, Yi-Jen Liu
{"title":"Adaptive content model for distance education","authors":"Ming-Chih Lu, L. Deng, Hsi-Chien Yu, Yi-Jen Liu","doi":"10.1109/ITRE.2005.1503136","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503136","url":null,"abstract":"Multimedia presentation systems require flexible support for the modeling of multimedia content models. Many presentation systems provide the synchronized, sequential or concurrent, and possible interactive, transfer of streams multimedia data such as audio, video, text and annotations using with network facilities. However, our through investigation of exist standards and applications for multimedia documents models such as HTML, MHEG, SMTL, HyTime, RealPlay and MS Windows Media let us to find that these standards and applications models do not provide adequate support for reuse and adaptation. Consequently, we propose a new approach for the modeling of reusable and adaptable multimedia content. We developed a comprehensive system for advanced multimedia content production: support for recording the presentation, retrieving the content, summarizing the presentation, weaving the presentation and customizing the representation. This approach significantly impacts and supports the multimedia presentation authoring processes in terms of methodology and commercial aspects.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132135932","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
An FP-split method for fast association rules mining 一种快速关联规则挖掘的FP-split方法
ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005. Pub Date : 2005-06-27 DOI: 10.1109/ITRE.2005.1503165
Chin-Feng Lee, Tsung-Hsien Shen
{"title":"An FP-split method for fast association rules mining","authors":"Chin-Feng Lee, Tsung-Hsien Shen","doi":"10.1109/ITRE.2005.1503165","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503165","url":null,"abstract":"Recently, most of the studies on association rules mining focused on improving the efficiency of frequent itemsets generation. To our best knowledge, the FP-growth algorithm, which is based on the FP-tree to generate frequent itemsets is time-efficient. Currently, relevant studies are introduced to improve the FP-growth algorithm. However, they ignore the fact that the FP-tree construction may spend much time. Therefore, the goal of our research is to propose a fast algorithm called frequent pattern split, simply FP-split, for improving the process of the FP-tree construction. The proposed FP-split algorithm contains two main steps. The first step is to scan a transaction database only once for generating equivalence classes of frequent items. The second step is to sort these equivalence classes of frequent items in descending order so as to construct the FP-split tree. Through detailed experimental evaluations under various system conditions, our method shows excellent performance in terms of execution efficiency and scalability.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123171857","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}
引用次数: 14
首页 上一页 下一页 尾页
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学术官方微信