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

2009 International Conference on Intelligent Networking and Collaborative Systems最新文献

筛选
英文 中文
Architecture of EHARP Routing Protocols in Ad Hoc Wireless Networks Ad Hoc无线网络中EHARP路由协议的体系结构
2009 International Conference on Intelligent Networking and Collaborative Systems Pub Date : 2009-11-04 DOI: 10.1109/INCOS.2009.82
S. N. Al-Otaibi, F. Siewe
{"title":"Architecture of EHARP Routing Protocols in Ad Hoc Wireless Networks","authors":"S. N. Al-Otaibi, F. Siewe","doi":"10.1109/INCOS.2009.82","DOIUrl":"https://doi.org/10.1109/INCOS.2009.82","url":null,"abstract":"Ad hoc wireless networks consist of a number of nodes roaming freely, interconnecting with each other by wireless connection without relying on a predefined infrastructure. When comparing ad hoc wireless networks with fixed networks or infrastructure wireless networks, ad hoc wireless networks base on the nodes that work as host and as router. In this paper, we present a new routing protocol for an ad hoc wireless network which is called Enhanced Heading direction Angle Routing Protocol (EHARP). It base on counter of the stability of link (SL) and acknowledge message to provide stability and availability of the network along select route path.","PeriodicalId":145328,"journal":{"name":"2009 International Conference on Intelligent Networking and Collaborative Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129767832","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 Round-Based Cover Traffic Algorithm for Anonymity Systems 一种基于轮的匿名系统覆盖流量算法
2009 International Conference on Intelligent Networking and Collaborative Systems Pub Date : 2009-11-04 DOI: 10.1007/978-3-642-16793-5_12
M. Rybczynska
{"title":"A Round-Based Cover Traffic Algorithm for Anonymity Systems","authors":"M. Rybczynska","doi":"10.1007/978-3-642-16793-5_12","DOIUrl":"https://doi.org/10.1007/978-3-642-16793-5_12","url":null,"abstract":"","PeriodicalId":145328,"journal":{"name":"2009 International Conference on Intelligent Networking and Collaborative Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114585650","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
Combining Syntactic Structured and Flat Features for Relation Extraction Using Co-training 结合句法结构化与平面特征的协同训练关系提取
2009 International Conference on Intelligent Networking and Collaborative Systems Pub Date : 2009-11-04 DOI: 10.1109/INCOS.2009.15
Jing Qiu, L. Liao, Peng Li
{"title":"Combining Syntactic Structured and Flat Features for Relation Extraction Using Co-training","authors":"Jing Qiu, L. Liao, Peng Li","doi":"10.1109/INCOS.2009.15","DOIUrl":"https://doi.org/10.1109/INCOS.2009.15","url":null,"abstract":"A parse tree contains rich syntactic structured information, and the structured features have been proved effective in relation extraction. In this paper, we proposed another way to efficiently utilize structured features but in a weakly learning way. Co-training algorithm was chosen by us, the structured features were set to be one view of it, and the flat features were set to be the other. Through using co-training algorithm, we can combine both flat and structured information for relation extraction.","PeriodicalId":145328,"journal":{"name":"2009 International Conference on Intelligent Networking and Collaborative Systems","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125175037","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
Traffic Engineering by Polynomially Solvable Link Metric Optimization 基于多项式可解链路度量优化的交通工程
2009 International Conference on Intelligent Networking and Collaborative Systems Pub Date : 2009-11-04 DOI: 10.1109/INCOS.2009.38
Akira Noguchi, Takeshi Fujimura, H. Miwa
{"title":"Traffic Engineering by Polynomially Solvable Link Metric Optimization","authors":"Akira Noguchi, Takeshi Fujimura, H. Miwa","doi":"10.1109/INCOS.2009.38","DOIUrl":"https://doi.org/10.1109/INCOS.2009.38","url":null,"abstract":"Open Shortest Path First (OSPF) is the most commonly used intra-domain internet routing protocol. As the routes of paths are determined by basically only the link metrics, many paths may pass a link with small metric; therefore, there is high possibility that it causes the congestion of the link. It is essential that the number of the paths with large traffic in a link is limited to avoid a congestion; therefore, it is important to determine the link metrics so as to limit the number of the paths in a link. In this paper, we define this link metric decision problem, and we prove that it is NP-complete. In addition, when we restricted this problem to determine the metric of only a link, we show that it can be solved in polynomial time.","PeriodicalId":145328,"journal":{"name":"2009 International Conference on Intelligent Networking and Collaborative Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121079724","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
A Simple Scheme for Relative Time Synchronization in Delay Tolerant MANETs 一种简单的容延迟manet相对时间同步方案
2009 International Conference on Intelligent Networking and Collaborative Systems Pub Date : 2009-11-04 DOI: 10.1109/INCOS.2009.20
Masahiro Sasabe, T. Takine
{"title":"A Simple Scheme for Relative Time Synchronization in Delay Tolerant MANETs","authors":"Masahiro Sasabe, T. Takine","doi":"10.1109/INCOS.2009.20","DOIUrl":"https://doi.org/10.1109/INCOS.2009.20","url":null,"abstract":"In mobile ad hoc networks (MANETs), time synchronization can be achieved by distributing time information among nodes. This type of time synchronization, however, does not work well under considerable long delay caused by sparse population. In this paper, we propose a simple yet effective scheme for relative time synchronization. When two mobile nodes meet, they exchange their clock information and adjust their own clocks to the average. Through simulation experiments, we show that the variance of the difference between the local and reference times remains within a certain finite range that depends on the frequency of nodes' meetings.","PeriodicalId":145328,"journal":{"name":"2009 International Conference on Intelligent Networking and Collaborative Systems","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125763751","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
Modeling a VGSCL System to Analyze Collaboration 基于VGSCL系统的协作分析建模
2009 International Conference on Intelligent Networking and Collaborative Systems Pub Date : 2009-11-04 DOI: 10.1109/INCOS.2009.10
N. Zea, N. Medina-Medina, F. G. Vela, P. Paderewski
{"title":"Modeling a VGSCL System to Analyze Collaboration","authors":"N. Zea, N. Medina-Medina, F. G. Vela, P. Paderewski","doi":"10.1109/INCOS.2009.10","DOIUrl":"https://doi.org/10.1109/INCOS.2009.10","url":null,"abstract":"Several studies claim for the benefits that collaborative learning has to the students’ comprehensive development as well as many benefit of introducing new technologies into the educational field. By other hand, interaction analysis in collaborative learning processes has become an important research field. Starting from these two realities, this work presents the modeling of a Video Game Supported Collaborative Learning System (VGSCL). By using these models, we will be able to analyze the quality of collaboration occurred during this process and to make the players’ learning processes better.","PeriodicalId":145328,"journal":{"name":"2009 International Conference on Intelligent Networking and Collaborative Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127024075","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
Relation Extraction from Chinese News Web Documents Based on Weakly Supervised Learning 基于弱监督学习的中文新闻网络文档关系提取
2009 International Conference on Intelligent Networking and Collaborative Systems Pub Date : 2009-11-04 DOI: 10.1109/INCOS.2009.14
Jing Qiu, L. Liao, Peng Li
{"title":"Relation Extraction from Chinese News Web Documents Based on Weakly Supervised Learning","authors":"Jing Qiu, L. Liao, Peng Li","doi":"10.1109/INCOS.2009.14","DOIUrl":"https://doi.org/10.1109/INCOS.2009.14","url":null,"abstract":"Extracting instances of a given target relation from a given Web page corpus seems to be the basic work to exploit nearly endless source of knowledge which provided by the World Wide Web. Supervised learning requires a large amount of labeled data, but the data labeling process can be expensive and time consuming.In this paper we present a kernel-based weakly supervised machine learning algorithm for relation extraction. It takes a small set of target relations as input. The goal is to automatically extract arbitrary binary relations from Web documents in the domain of football games. Bootstrapping is used to improve the performance of the system. We also compare the performances on different input example sizes.Experimental results show the effectiveness and benefits of our approach.","PeriodicalId":145328,"journal":{"name":"2009 International Conference on Intelligent Networking and Collaborative Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131073053","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
The New Genetic Based Method with Optimum Number of Super Node in Heterogeneous Wireless Sensor Network for Fault Tolerant System 基于遗传的异构无线传感器网络最优超级节点数容错方法
2009 International Conference on Intelligent Networking and Collaborative Systems Pub Date : 2009-11-04 DOI: 10.1109/INCOS.2009.86
N. J. Navimipour, A. Rahmani
{"title":"The New Genetic Based Method with Optimum Number of Super Node in Heterogeneous Wireless Sensor Network for Fault Tolerant System","authors":"N. J. Navimipour, A. Rahmani","doi":"10.1109/INCOS.2009.86","DOIUrl":"https://doi.org/10.1109/INCOS.2009.86","url":null,"abstract":"In this paper the new method for determining the number of super node in heterogeneous wireless sensor network based on evolutionary algorithms are presented. The network consisting of several resourcerich supernodes, used for data relaying, and a large number of energy-constrained wireless sensor nodes. The main contribution of this paper is to reach an optimum trade off between number of super node and efficiency. Simulation results show that our algorithm can quickly find a good solution.","PeriodicalId":145328,"journal":{"name":"2009 International Conference on Intelligent Networking and Collaborative Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131042105","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
Low Area Implementation of the Hash Function “Blue Midnight Wish 256” for FPGA Platforms 基于FPGA平台的哈希函数“Blue Midnight Wish 256”的低面积实现
2009 International Conference on Intelligent Networking and Collaborative Systems Pub Date : 2009-11-04 DOI: 10.1109/INCOS.2009.22
Mohamed El-Hadedy, D. Gligoroski, S. J. Knapskog
{"title":"Low Area Implementation of the Hash Function “Blue Midnight Wish 256” for FPGA Platforms","authors":"Mohamed El-Hadedy, D. Gligoroski, S. J. Knapskog","doi":"10.1109/INCOS.2009.22","DOIUrl":"https://doi.org/10.1109/INCOS.2009.22","url":null,"abstract":"in cryptography and information security, hash functions are considered as the \"Swiss army knife\" - they are used in countless protocols and algorithms. In 2005, we witnessed a significant theoretical breakthrough in breaking the current cryptographic standard SHA-1. Although there is another family of standardized hash functions called SHA-2, ready to replace SHA-1 hash function, at the end of 2007, the National Institute of Standards and Technology (NIST) decided to start a 4 year world-wide development process, including a competition for the superior algorithm design, for choosing the next cryptographic hash standard SHA-3. Blue Midnight Wish is one of the proposed new designs in the SHA-3 competition that continues in the Second Round of the competition. In this paper, we describe the architecture and an FPGA implementation in several different Xilinx devices for the compression function of the Blue Midnight Wish hash function with a digest size of 256 bits(BMW-256). The main goal of this work is to implement the compression function of BMW-256 with as small as possible area.The proposed design synthesized for Xilinx FPGA Virtex \"XCV300pq240\" uses 2147 slices including the internal memory and just 1354 slices for the design that uses external memory. For comparison, SHA-256 Xilinx FPGA Virtex \"XCV200pq240\" design uses 4768 slices.","PeriodicalId":145328,"journal":{"name":"2009 International Conference on Intelligent Networking and Collaborative Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125425728","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
Map Similarity Testing Using Matrix Decomposition 基于矩阵分解的地图相似性测试
2009 International Conference on Intelligent Networking and Collaborative Systems Pub Date : 2009-11-04 DOI: 10.1109/INCOS.2009.74
J. Dvorský, V. Snás̃el, V. Voženílek
{"title":"Map Similarity Testing Using Matrix Decomposition","authors":"J. Dvorský, V. Snás̃el, V. Voženílek","doi":"10.1109/INCOS.2009.74","DOIUrl":"https://doi.org/10.1109/INCOS.2009.74","url":null,"abstract":"The similarity of two maps can be most easily compared visually. In this case, the degree of similarity is very subjective. It is therefore necessary to find an objective method for measuring similarity. This paper presents a method based on Singular Value Decomposition (SVD).","PeriodicalId":145328,"journal":{"name":"2009 International Conference on Intelligent Networking and Collaborative Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126353977","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}
引用次数: 22
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信