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

2008 International Conference on Internet Computing in Science and Engineering最新文献

筛选
英文 中文
The Ontology Relation Extraction for Semantic Web Annotation 语义Web标注的本体关系提取
2008 International Conference on Internet Computing in Science and Engineering Pub Date : 2008-01-28 DOI: 10.1109/ICICSE.2008.95
Li Dong, Huang Linpeng
{"title":"The Ontology Relation Extraction for Semantic Web Annotation","authors":"Li Dong, Huang Linpeng","doi":"10.1109/ICICSE.2008.95","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.95","url":null,"abstract":"The idea of the Semantic Web (SW) is based on metadata. We have proposed an architecture needed to generate metadata for the SW. Our proposed architecture is designed to generate metadata from HTML Web Pages from the domain of our interest. The domain model is represented by using domain ontology. The focus of the paper is to investigate the automatic generation of metadata for the SW by relation extraction techniques. Our assumption is that any two web pages that have some kind of relationship must be connected by a link or a path. Our algorithm exploits the link structure of web using breadth first search for relation extraction. Relation extraction results show that hyperlink structure of the Web can be used for relation extraction.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"224 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132427849","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}
引用次数: 7
A Self-Recovery Model for Distributed Applications Based on Microreboot 基于微重启的分布式应用自恢复模型
2008 International Conference on Internet Computing in Science and Engineering Pub Date : 2008-01-28 DOI: 10.1109/ICICSE.2008.52
Huiqiang Wang, Haizhi Ye, Liang Ying
{"title":"A Self-Recovery Model for Distributed Applications Based on Microreboot","authors":"Huiqiang Wang, Haizhi Ye, Liang Ying","doi":"10.1109/ICICSE.2008.52","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.52","url":null,"abstract":"Automatic and fast recovery from failure is the important way of guaranteeing high availability for distributed application systems. On the base of microreboot techniques and autonomic computing ideas, key issues of realizing self-recovery for distributed application are analyzed in this paper, and then a novel model of self-recovery for distributed application based on microreboot is presented. The construction of the model are expatiated in detail from several perspectives, such as behavior monitoring, failure management and recovery policy, and the principles of realizing self- recovery for distributed application are explained. The established model aims to solve the problems of common failures in large distributed applications, and can recovery itself effectively without human interventions.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132959886","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
Finding the WDB's Query Interface in Deep Web Automatically 自动查找深度网络中WDB的查询接口
2008 International Conference on Internet Computing in Science and Engineering Pub Date : 2008-01-28 DOI: 10.1109/ICICSE.2008.77
Peiguang Lin, Ru-zhi Xu, Zhimin Hong, Yan Zhang
{"title":"Finding the WDB's Query Interface in Deep Web Automatically","authors":"Peiguang Lin, Ru-zhi Xu, Zhimin Hong, Yan Zhang","doi":"10.1109/ICICSE.2008.77","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.77","url":null,"abstract":"Web search engines work well for finding crawlable pages, but not for finding datasets hidden behind Web search forms. On this deep Web, many sources are structured by providing structured query interfaces and results. Organizing such structured sources into a domain hierarchy that users can browse to find these valuable resources and is one of the critical steps toward the large-scale integration of heterogeneous deep Web sources. We propose an automatic classification of structured deep Web sources based on the features available on the search interfaces. Our experimental data shows that the method presented by this paper has good practicability and provides fine prerequisite for further research of deep Web.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129180339","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
Short-Term and Long-Term Computing Models of Internet Diameter 互联网直径的短期和长期计算模型
2008 International Conference on Internet Computing in Science and Engineering Pub Date : 2008-01-28 DOI: 10.1109/ICICSE.2008.92
Ye Xu, Zhuo Wang, Wen-bo Zhang
{"title":"Short-Term and Long-Term Computing Models of Internet Diameter","authors":"Ye Xu, Zhuo Wang, Wen-bo Zhang","doi":"10.1109/ICICSE.2008.92","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.92","url":null,"abstract":"Internet Diameter is an Internet property defined in this paper being of great significance in measuring Internet performance. Approaches in short-term and long-term computing of Internet Diameter were mainly discussed. In short-term part, the computing approach was based on a composite mathematical model made up of a fundamental framework - logistic model, together with additional adjustment models. Parameters in the composite model were finally confirmed through rounds of calculation by Genetic Algorithm. Approach in long-term computing is somewhat more complicated compared with the short-term one. It has a preliminary requirement that the variation of Internet Diameter should have primary features of dynamic Chaos system. Then, a property of Internet Diameter in Chaos point of view, e.g., correlation dimension, was calculated. And it helped construct a system of 3-dimension equations providing practical approaches for the computation of the long-term Internet Diameter.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124817102","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 Strategy Selection Model for Network Survivability 网络生存能力的策略选择模型
2008 International Conference on Internet Computing in Science and Engineering Pub Date : 2008-01-28 DOI: 10.1109/ICICSE.2008.87
Huiqiang Wang, Guo-sheng Zhao, Jian Wang
{"title":"A Strategy Selection Model for Network Survivability","authors":"Huiqiang Wang, Guo-sheng Zhao, Jian Wang","doi":"10.1109/ICICSE.2008.87","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.87","url":null,"abstract":"Survivability has emerged as a new phase for the development of network security technique, and how to improve the system survivability using effective strategy is an important problem. In this paper, by analyzing the fuzzy matrix game (FMG) theory and network survivability mechanism, a novel strategy selection model for network survivability based on FMG theory and its dynamic analysis method are presented from the macroscopically view. The analysis result shows that the proposed method can provide guarantee conditions for network survivability effectively.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127039849","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
Combined Partial Test Vector Reuse and FDR Coding for Two Dimensional SoC Test Compression 结合部分测试向量重用和FDR编码的二维SoC测试压缩
2008 International Conference on Internet Computing in Science and Engineering Pub Date : 2008-01-28 DOI: 10.1109/ICICSE.2008.93
Guangsheng Ma, Jingbo Shao, Ruixue Zhang
{"title":"Combined Partial Test Vector Reuse and FDR Coding for Two Dimensional SoC Test Compression","authors":"Guangsheng Ma, Jingbo Shao, Ruixue Zhang","doi":"10.1109/ICICSE.2008.93","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.93","url":null,"abstract":"This paper proposes a novel approach to core based SoC test compression. Research works show that almost all the test vectors have the same part in common. Therefore there exists such a vector, from which parts of each test vector from the different test sets can be sought. Based on this, first we attempt to find a vector named overlapped vector which contains parts of each test vector and has shorter length than that of the sum of each test vector's length. Second the overlapped test vectors are further compressed utilizing frequency-directed run-length (FDR) coding. Due to the fact that the test application time is proportional to the length of test vector, our proposal achieves as short test time as possible. Experimental results demonstrate that the proposed method obtains reduced test application time and significant test data compression rate.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126601838","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
Model of Controlling the Hubs in P2P Network P2P网络中集线器控制模型
2008 International Conference on Internet Computing in Science and Engineering Pub Date : 2008-01-28 DOI: 10.4304/jnw.4.4.236-243
Yuhua Liu, Chun Yang, Kaihua Xu, N. Xiong
{"title":"Model of Controlling the Hubs in P2P Network","authors":"Yuhua Liu, Chun Yang, Kaihua Xu, N. Xiong","doi":"10.4304/jnw.4.4.236-243","DOIUrl":"https://doi.org/10.4304/jnw.4.4.236-243","url":null,"abstract":"Research into the hubs in P2P network, and present a new method to avoid generating the hubs in the network by controlling the logical topology structure of P2P network. We firstly introduce the controlling ideas about hierarchizing the hubs. Then, we disclose and interpret the controlling model, and give out the concrete method to carry it out. Finally, we validate our controlling model via simulations and the simulation results demonstrate that our work is effective to control the hubs in P2P network. Thus, this model can improve the network competence to defend against coordinated attacks, promote the network robustness, and ensure the network would develop continually and healthily.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128901288","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}
引用次数: 7
An Energy-Efficient Routing Algorithm for Wireless Sensor Networks 一种无线传感器网络的节能路由算法
2008 International Conference on Internet Computing in Science and Engineering Pub Date : 2008-01-28 DOI: 10.1109/ICICSE.2008.76
Guisheng Yin, Guang Yang, Wu Yang, Bingyang Zhang, Wenjin Jin
{"title":"An Energy-Efficient Routing Algorithm for Wireless Sensor Networks","authors":"Guisheng Yin, Guang Yang, Wu Yang, Bingyang Zhang, Wenjin Jin","doi":"10.1109/ICICSE.2008.76","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.76","url":null,"abstract":"Since the nodes of wireless sensor networks are in the condition of a highly-limited and unreplenishable energy resource such as battery power, computation, and storage space, the energy efficiency is the most important key- point of the network routing designing. In this paper, A novel routing algorithm which combines with hierarchical routing and geographical routing is proposed. Based on the hierarchical network architecture, the process of forwarding packets between the source nodes in the target region and the base station consists of two phases-inter- cluster routing and intra-cluster routing, a greedy algorithm is adopted in the process of the inter-cluster routing and an multi-hop routing algorithm based on the forwarding restriction angle is designed for the intra- cluster routing. The analysis and simulation results show that our routing algorithm has better performance in terms of energy consumption and delay, it is suitable for the data transmission in a high-density wireless sensor network.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128421837","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
Research on Ontology Matching Approach in Semantic Web 语义Web中本体匹配方法研究
2008 International Conference on Internet Computing in Science and Engineering Pub Date : 2008-01-28 DOI: 10.1109/ICICSE.2008.51
Rubo Zhang, Ying Wang, Jing Wang
{"title":"Research on Ontology Matching Approach in Semantic Web","authors":"Rubo Zhang, Ying Wang, Jing Wang","doi":"10.1109/ICICSE.2008.51","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.51","url":null,"abstract":"The major purpose of applying ontology is to share and reuse knowledge. However, a large amount of heterogeneous ontologies are constructed in semantic Web, because there is not a common criterion for building ontology. Under the background, an ontology matching approach is put forward. It converts the ontology matching to the problem of building RDF (resource description framework) graph matching tree. Moreover, the approach presents a structural similarity measure based on the entities of nodes from the matching tree, compensating the inadequacies of the linguistic similarity measure. Our implementation and experimental results are given to demonstrate the effectiveness of the matching approach.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"182 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133350096","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
An Efficiency Method for Visual Scene Building 一种高效的视觉场景构建方法
2008 International Conference on Internet Computing in Science and Engineering Pub Date : 2008-01-28 DOI: 10.1109/ICICSE.2008.31
Hailing Wang, J. Zhang
{"title":"An Efficiency Method for Visual Scene Building","authors":"Hailing Wang, J. Zhang","doi":"10.1109/ICICSE.2008.31","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.31","url":null,"abstract":"This paper put forward a concept and method for representing and modeling game scene based on dream of the red chamber in 3DS MAX. The scene is essential objects of virtual games, which serve as role for integrated, handsome information. Existing concepts for the representation of scene are restricted to computer performance such as complex and massive models. The presented unifies the representation of model sets of scene, which occur in most virtual game scene. In our method, the search main on three parts: structure optimization, model optimization, scene optimization.The scene is structured on a basis: close shot and perspective, for the perspective, to specify the appearance projective textures across model. Application-specific data can be associated similar to appearance information.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123817868","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
首页 上一页
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学术官方微信