Shengtao Sun, Dingsheng Liu, Guoqing Li, Wenyang Yu, Lv Pang
Ontology Model and Semantic Link Network (SLN) are two important semantic data models in Semantic Web. Ontology Model can describe network resource in concept space, while SLN can describe various links and relations between network resources. Combination of Ontology Model and SLN can help to improve the effect of network resource retrieval, but data transfer and exchange between ontological knowledge base and SLN knowledge base are needed. This paper presents semantic relationship tree (SRT) to realize the information transfer from Ontology Model to SLN, and also gives an example of network resource retrieval based on ontology knowledge base and SLN knowledge base.
本体模型(Ontology Model)和语义链路网络(Semantic Link Network, SLN)是语义Web中两个重要的语义数据模型。本体模型可以在概念空间中描述网络资源，而语言网络可以描述网络资源之间的各种联系和关系。本体模型与语言网络的结合有助于提高网络资源检索的效果，但需要本体知识库与语言网络知识库之间的数据传递和交换。本文提出了语义关系树(SRT)来实现本体模型到语言网络的信息传递，并给出了一个基于本体知识库和语言网络知识库的网络资源检索实例。
{"title":"Combination of Ontology Model and Semantic Link Network in Web Resource Retrieval","authors":"Shengtao Sun, Dingsheng Liu, Guoqing Li, Wenyang Yu, Lv Pang","doi":"10.1109/SKG.2010.41","DOIUrl":"https://doi.org/10.1109/SKG.2010.41","url":null,"abstract":"Ontology Model and Semantic Link Network (SLN) are two important semantic data models in Semantic Web. Ontology Model can describe network resource in concept space, while SLN can describe various links and relations between network resources. Combination of Ontology Model and SLN can help to improve the effect of network resource retrieval, but data transfer and exchange between ontological knowledge base and SLN knowledge base are needed. This paper presents semantic relationship tree (SRT) to realize the information transfer from Ontology Model to SLN, and also gives an example of network resource retrieval based on ontology knowledge base and SLN knowledge base.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134428310","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}
Labeled datasets are essential for text categorization. They are used to train a classifier, or as a benchmark collection to evaluate categorization algorithms. However, labeling a large-scale document set is extremely expensive because it involves much human labour, and the labeling process itself is subjective rather than objective. Therefore, labels assigned to documents by only one human editor in some existing labeled document sets may be of limited use and may prove problematic for training a classifier or evaluating categorization algorithms. This research explores socially constructed Web directory, the Open Directory Project (ODP), to generate a series of labeled document sets by extracting semantic characteristics from the ODP categories which are annotated by a list of indexed Websites. The generated document sets are used to classify Web search results and the results are encouraging.
{"title":"Characteristics and Uses of Labeled Datasets - ODP Case Study","authors":"Dengya Zhu, H. Dreher","doi":"10.1109/SKG.2010.84","DOIUrl":"https://doi.org/10.1109/SKG.2010.84","url":null,"abstract":"Labeled datasets are essential for text categorization. They are used to train a classifier, or as a benchmark collection to evaluate categorization algorithms. However, labeling a large-scale document set is extremely expensive because it involves much human labour, and the labeling process itself is subjective rather than objective. Therefore, labels assigned to documents by only one human editor in some existing labeled document sets may be of limited use and may prove problematic for training a classifier or evaluating categorization algorithms. This research explores socially constructed Web directory, the Open Directory Project (ODP), to generate a series of labeled document sets by extracting semantic characteristics from the ODP categories which are annotated by a list of indexed Websites. The generated document sets are used to classify Web search results and the results are encouraging.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125982787","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}
Resource Space Model (RSM) is a semantic data model for specifying, organizing, and retrieving resources based on classification of resources. An efficient index mechanism is critical for its implementation. However, traditional index mechanisms are not well suitable to resource spaces because the spaces are discrete and hierarchical. This paper proposes a new multidimensional index structure C*-tree. It employs boxes to represent resources so that the containment of boxes can reflect the hierarchical structure of resources. The metric function defined in the C*-tree is able to gather close resources in the index structure. To avoid overlap between bounding boxes, a new restricted bounding box is further introduced. Moreover, the insertion algorithms based on the data partition approach can fully utilize characteristics of RSM. The C*-tree is scalable and efficient on both the number of dimension and the amount of data for different distributions.
资源空间模型(Resource Space Model, RSM)是一种语义数据模型，用于根据资源分类指定、组织和检索资源。有效的索引机制对其实现至关重要。然而，由于资源空间的离散性和层次性，传统的索引机制并不适用于资源空间。本文提出了一种新的多维索引结构C*-tree。它使用盒子来表示资源，这样盒子的包含可以反映资源的层次结构。在C*-tree中定义的度量函数能够收集索引结构中的封闭资源。为了避免边界框之间的重叠，进一步引入了新的限制边界框。此外，基于数据划分方法的插入算法可以充分利用RSM的特性。对于不同的分布，C*树在维数和数据量上都是可伸缩和高效的。
{"title":"C*-tree: A Multi-Dimensional Index Structure for Resource Space Model","authors":"Qiang Zeng, H. Zhuge","doi":"10.1109/SKG.2010.16","DOIUrl":"https://doi.org/10.1109/SKG.2010.16","url":null,"abstract":"Resource Space Model (RSM) is a semantic data model for specifying, organizing, and retrieving resources based on classification of resources. An efficient index mechanism is critical for its implementation. However, traditional index mechanisms are not well suitable to resource spaces because the spaces are discrete and hierarchical. This paper proposes a new multidimensional index structure C*-tree. It employs boxes to represent resources so that the containment of boxes can reflect the hierarchical structure of resources. The metric function defined in the C*-tree is able to gather close resources in the index structure. To avoid overlap between bounding boxes, a new restricted bounding box is further introduced. Moreover, the insertion algorithms based on the data partition approach can fully utilize characteristics of RSM. The C*-tree is scalable and efficient on both the number of dimension and the amount of data for different distributions.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"360 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122774388","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}
Data gathering is a major function of many applications in wireless sensor networks (WSNs). In this paper, An Effective Data Gathering scheme for heterogeneous energy WSNs (EDGA) is proposed. EDGA achieves a good performance in terms of lifetime by minimizing energy consumption for in-network communications and balancing the energy load. EDGA adopt a simple but efficient method to solve the area coverage problem in a cluster range, namely intra-cluster coverage. Finally, the simulation results demonstrate that the proposed EDGA significantly outperforms LEACH, HEED in terms of network lifetime and the amount of data gathered in the heterogeneous energy network.
{"title":"Data Gathering in Wireless Sensor Networks","authors":"Z. Liu, Zhigang Chen","doi":"10.1109/SKG.2010.57","DOIUrl":"https://doi.org/10.1109/SKG.2010.57","url":null,"abstract":"Data gathering is a major function of many applications in wireless sensor networks (WSNs). In this paper, An Effective Data Gathering scheme for heterogeneous energy WSNs (EDGA) is proposed. EDGA achieves a good performance in terms of lifetime by minimizing energy consumption for in-network communications and balancing the energy load. EDGA adopt a simple but efficient method to solve the area coverage problem in a cluster range, namely intra-cluster coverage. Finally, the simulation results demonstrate that the proposed EDGA significantly outperforms LEACH, HEED in terms of network lifetime and the amount of data gathered in the heterogeneous energy network.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130813269","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}
Shengtao Sun, Dingsheng Liu, Guoqing Li, Wenyang Yu, Lv Pang
The proposal and development of semantic web make ontology, as a new knowledge organization and semantic description method, get attention in various fields. The building of ontology is a basic and important task in semantic web. The construction method and organizational structure of ontology will directly affect the application of ontology. Based on the analysis of hierarchical characters existing in domain knowledge representation and organization and also the process of ontology building, this paper puts forwards a hierarchical construction method of ontology and gives the hierarchical construction principles in different ontology levels, which pays much attention to the hierarchical relationships in every stage of ontology building. And then based on this hierarchical construction method, this paper designs and builds a three-level geographical ontology applied in spatial information service. And also, this paper presents a description mechanism of ontology class metainformation to extend the description capability of OWL, which can help to well represent the difference and relationship between concept and term. The hierarchical identification in class meta-information can help to realize quick retrieving and matching of concepts based on hierarchical relationship.
{"title":"The Research on Hierarchical Construction Method of Domain Ontology","authors":"Shengtao Sun, Dingsheng Liu, Guoqing Li, Wenyang Yu, Lv Pang","doi":"10.1109/SKG.2010.31","DOIUrl":"https://doi.org/10.1109/SKG.2010.31","url":null,"abstract":"The proposal and development of semantic web make ontology, as a new knowledge organization and semantic description method, get attention in various fields. The building of ontology is a basic and important task in semantic web. The construction method and organizational structure of ontology will directly affect the application of ontology. Based on the analysis of hierarchical characters existing in domain knowledge representation and organization and also the process of ontology building, this paper puts forwards a hierarchical construction method of ontology and gives the hierarchical construction principles in different ontology levels, which pays much attention to the hierarchical relationships in every stage of ontology building. And then based on this hierarchical construction method, this paper designs and builds a three-level geographical ontology applied in spatial information service. And also, this paper presents a description mechanism of ontology class metainformation to extend the description capability of OWL, which can help to well represent the difference and relationship between concept and term. The hierarchical identification in class meta-information can help to realize quick retrieving and matching of concepts based on hierarchical relationship.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132814283","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}
Recently semantic technology have been popular in the spatial information area, but this semantic ability can only support for its own system, cannot fulfils other system’s need. So a semantic service middleware taking place of original semantic system, will give a free semantic service without change the system’s internal structure.
{"title":"Research on Ontology Based Semantic Service Middleware within Spatial Information System","authors":"Lv Pang, Guoqing Li, Wenyang Yu, Shengtao Sun","doi":"10.1109/SKG.2010.62","DOIUrl":"https://doi.org/10.1109/SKG.2010.62","url":null,"abstract":"Recently semantic technology have been popular in the spatial information area, but this semantic ability can only support for its own system, cannot fulfils other system’s need. So a semantic service middleware taking place of original semantic system, will give a free semantic service without change the system’s internal structure.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"15 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114102548","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}
This Paper deeply analyzes and studies the existing problems in the any cast communication models in an IPv6 network and proposes a k-Any cast routing schemes for IPv6 network which are fault tolerance, load balancing, security, and improvement in system performance. In addition, this paper proposes a concrete scheme on how to implement this k-Any cast communication model in an IPv6 network which is applied to the distributed-file downloading service in an IPv6 emulation environment. The experimental data prove the k-Any cast communication model’s validity, feasibility and practicability.
{"title":"Research on K-Anycast Routing Schemes for IPv6","authors":"Chun Zhu, Hanzhong Liu","doi":"10.1109/SKG.2010.52","DOIUrl":"https://doi.org/10.1109/SKG.2010.52","url":null,"abstract":"This Paper deeply analyzes and studies the existing problems in the any cast communication models in an IPv6 network and proposes a k-Any cast routing schemes for IPv6 network which are fault tolerance, load balancing, security, and improvement in system performance. In addition, this paper proposes a concrete scheme on how to implement this k-Any cast communication model in an IPv6 network which is applied to the distributed-file downloading service in an IPv6 emulation environment. The experimental data prove the k-Any cast communication model’s validity, feasibility and practicability.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114790473","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}
This paper proposes an image encryption algorithm based on a progression, which scrambles the pixel and changes the value of the pixel using the progression. The experiments illustrate the new algorithm can adapt almost all the images and it is more secure.
{"title":"An Image Encryption Algorithm Based on Sequence","authors":"Qili Xiao, Bencheng Chai, Qimin Xiao","doi":"10.1109/SKG.2010.69","DOIUrl":"https://doi.org/10.1109/SKG.2010.69","url":null,"abstract":"This paper proposes an image encryption algorithm based on a progression, which scrambles the pixel and changes the value of the pixel using the progression. The experiments illustrate the new algorithm can adapt almost all the images and it is more secure.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127815925","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}
Recently, the Storage Networking Industry Association (SNIA) has released the first standard for cloud interoperability. With more and more standards for interoperability emerging, it can be expected that a global cloud resource exchange market will form. In such a market, it is challenging to present a dynamic pricing scheme to meet different requirements. To cope with the challenge, in this paper we first present a framework for constructing global cloud resource markets and then propose a knowledge-based continuous double auction (CDA) model that determines the price of cloud resources using a learning algorithm based on historical trading information. Experimental result shows that our model can attain high market efficiency as well as stable trading price.
{"title":"A Knowledge-based Continuous Double Auction Model for Cloud Market","authors":"Shifeng Shang, Jinlei Jiang, Yongwei Wu, Guangwen Yang, Weimin Zheng","doi":"10.1109/SKG.2010.22","DOIUrl":"https://doi.org/10.1109/SKG.2010.22","url":null,"abstract":"Recently, the Storage Networking Industry Association (SNIA) has released the first standard for cloud interoperability. With more and more standards for interoperability emerging, it can be expected that a global cloud resource exchange market will form. In such a market, it is challenging to present a dynamic pricing scheme to meet different requirements. To cope with the challenge, in this paper we first present a framework for constructing global cloud resource markets and then propose a knowledge-based continuous double auction (CDA) model that determines the price of cloud resources using a learning algorithm based on historical trading information. Experimental result shows that our model can attain high market efficiency as well as stable trading price.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129410503","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}
Semantic Link Network (SLN) consists of semantic nodes, semantic links between semantic nodes, and rules for reasoning. The semantic communities of SLN reflect not only the tightly knit structure but also different aspects of semantics embedded in SLN. Traditional community discovery approaches are not suitable for discovering semantic communities. This paper investigates an approach to discovering dynamic semantic communities by evaluating every semantic node and semantic link according to Semantic Reasoning Closure’s semantic importance, Semantic node’s structure value and Semantic node’s reasoning times.
语义链路网络(Semantic Link Network, SLN)由语义节点、语义节点之间的语义链接和推理规则组成。语言网络的语义社区不仅反映了语言网络紧密结合的结构，而且反映了语言网络中嵌入的语义的不同方面。传统的社区发现方法不适合发现语义社区。本文研究了一种根据语义推理闭包的语义重要性、语义节点的结构值和语义节点的推理次数对每个语义节点和语义链接进行评价，从而发现动态语义社区的方法。
{"title":"Discovery Dynamic Communities in Semantic Link Network","authors":"Bei Xu, H. Zhuge","doi":"10.1109/SKG.2010.82","DOIUrl":"https://doi.org/10.1109/SKG.2010.82","url":null,"abstract":"Semantic Link Network (SLN) consists of semantic nodes, semantic links between semantic nodes, and rules for reasoning. The semantic communities of SLN reflect not only the tightly knit structure but also different aspects of semantics embedded in SLN. Traditional community discovery approaches are not suitable for discovering semantic communities. This paper investigates an approach to discovering dynamic semantic communities by evaluating every semantic node and semantic link according to Semantic Reasoning Closure’s semantic importance, Semantic node’s structure value and Semantic node’s reasoning times.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126295454","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：