Multi-dimensional range queries are fundamental requirements in large scale Internet applications using Distributed Ordered Tables. Apache Cassandra is a Distributed Ordered Table when it employs order-preserving hashing as data partitioner. Cassandra supports multi-dimensional range queries with poor performance and with a limitation that there must be one dimension with an equal operator. Based on the success of CCIndex scheme in Apache HBase, this paper tries to answer the question: Can CCIndex benefit multi-dimensional range queries in DOTs like Cassandra? This paper studies the feasibility of employing CCIndex in Cassandra, proposes a new approach to estimate result size, implements CCIndex in Cassandra including recovery mechanisms and studies the pros and cons of CCIndex for different DOTs. Experimental results show that CCIndex gains 2.4 to 3.7 times efficiency over Cassandra's index scheme with 1% to 50% selectivity for 2 million records. This paper shows that CCIndex is a general approach for DOTs, and could gain better performance for DOTs which perform scan tasks much faster than random read. This paper reveals that Cassandra is optimized for hash tables rather than ordered tables in performing read and range queries.
{"title":"CCIndex for Cassandra: A Novel Scheme for Multi-dimensional Range Queries in Cassandra","authors":"Chen Feng, Yongqiang Zou, Zhiwei Xu","doi":"10.1109/SKG.2011.28","DOIUrl":"https://doi.org/10.1109/SKG.2011.28","url":null,"abstract":"Multi-dimensional range queries are fundamental requirements in large scale Internet applications using Distributed Ordered Tables. Apache Cassandra is a Distributed Ordered Table when it employs order-preserving hashing as data partitioner. Cassandra supports multi-dimensional range queries with poor performance and with a limitation that there must be one dimension with an equal operator. Based on the success of CCIndex scheme in Apache HBase, this paper tries to answer the question: Can CCIndex benefit multi-dimensional range queries in DOTs like Cassandra? This paper studies the feasibility of employing CCIndex in Cassandra, proposes a new approach to estimate result size, implements CCIndex in Cassandra including recovery mechanisms and studies the pros and cons of CCIndex for different DOTs. Experimental results show that CCIndex gains 2.4 to 3.7 times efficiency over Cassandra's index scheme with 1% to 50% selectivity for 2 million records. This paper shows that CCIndex is a general approach for DOTs, and could gain better performance for DOTs which perform scan tasks much faster than random read. This paper reveals that Cassandra is optimized for hash tables rather than ordered tables in performing read and range queries.","PeriodicalId":184788,"journal":{"name":"2011 Seventh International Conference on Semantics, Knowledge and Grids","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122544876","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}
Domain Assets are the domain knowledge constructed according to the common requirements in the domain. In order to reuse the domain assets effectively, a domain assets search algorithm is proposed in this paper. Compared with the keyword search, this algorithm is based on semantic similarity, and the domain assets that closely satisfy the users can be selected so as to alleviate the burden of users when users search the domain assets. In addition, an example in transportation domain is illustrated to validate the effect of this algorithm.
{"title":"Towards Searching Domain Assets Based on Semantic Similarity","authors":"Wei Guo, Jian Wang, K. He, Dunhui Yu, Pengfei Du","doi":"10.1109/SKG.2011.14","DOIUrl":"https://doi.org/10.1109/SKG.2011.14","url":null,"abstract":"Domain Assets are the domain knowledge constructed according to the common requirements in the domain. In order to reuse the domain assets effectively, a domain assets search algorithm is proposed in this paper. Compared with the keyword search, this algorithm is based on semantic similarity, and the domain assets that closely satisfy the users can be selected so as to alleviate the burden of users when users search the domain assets. In addition, an example in transportation domain is illustrated to validate the effect of this algorithm.","PeriodicalId":184788,"journal":{"name":"2011 Seventh International Conference on Semantics, Knowledge and Grids","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127646087","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}
In the cyber-physical society, networks are constructed for information transportation. Among them, power law networks with the scale free property are extensively found in self-organized systems. The dynamicity of the cyber-physical society drives large-scale networks keeping interacting and evolving. Several networks can be integrated or merged into one network during the evolving process of the whole cyber-physical society either because they share the same nodes or because one network is trying to connect to the other. A natural question is that in what way two or more networks will merge with each other so that their previous scale-free properties still hold. In this paper, we conducted a set of simulation experiments to study the effects of different merging processes on the degree distribution of merged networks. The result can be used to understand the merging process of complex networks in the cyber-physical society and also can be used to design an integration strategy for multiple networks.
{"title":"Merging Complex Networks","authors":"Xiaoping Sun, H. Zhuge","doi":"10.1109/SKG.2011.41","DOIUrl":"https://doi.org/10.1109/SKG.2011.41","url":null,"abstract":"In the cyber-physical society, networks are constructed for information transportation. Among them, power law networks with the scale free property are extensively found in self-organized systems. The dynamicity of the cyber-physical society drives large-scale networks keeping interacting and evolving. Several networks can be integrated or merged into one network during the evolving process of the whole cyber-physical society either because they share the same nodes or because one network is trying to connect to the other. A natural question is that in what way two or more networks will merge with each other so that their previous scale-free properties still hold. In this paper, we conducted a set of simulation experiments to study the effects of different merging processes on the degree distribution of merged networks. The result can be used to understand the merging process of complex networks in the cyber-physical society and also can be used to design an integration strategy for multiple networks.","PeriodicalId":184788,"journal":{"name":"2011 Seventh International Conference on Semantics, Knowledge and Grids","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130387398","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}
Ontology, the base of Semantic Web, plays a vital role in knowledge representation and knowledge reasoning. There are many tools providing management interfaces to create, query and edit knowledge of ontology. However, most of them are still arduous time-consuming manual work. Therefore, how to automatically construct ontology has attracted many researchers' attention. With the development of WEB, there is influent information we can take advantage of. According to the structure of Web, An automatically construction method for domain-specific ontology is proposed. Firstly, some special web sites which have relatively structure or semi-structure are selected. Then, web documents are clawed with Jsoap. Secondly, all contained knowledge is extracted and organized together to form the domain-specific ontology. Finally, the Jena platform is employed to create, delete, read, write ontology model in the form of RDF and query by SPARQL. The experimental results in “Entertainment†and “Sport†domain show concept hierarchy structures are reasonable with the overall precision of domain-specific ontology being up to 97%.
{"title":"Domain-Specific Ontology Construction from Hierarchy Web Documents","authors":"Xiaoming Liu, Jinzhong Xu, Fangfang Li","doi":"10.1109/SKG.2011.21","DOIUrl":"https://doi.org/10.1109/SKG.2011.21","url":null,"abstract":"Ontology, the base of Semantic Web, plays a vital role in knowledge representation and knowledge reasoning. There are many tools providing management interfaces to create, query and edit knowledge of ontology. However, most of them are still arduous time-consuming manual work. Therefore, how to automatically construct ontology has attracted many researchers' attention. With the development of WEB, there is influent information we can take advantage of. According to the structure of Web, An automatically construction method for domain-specific ontology is proposed. Firstly, some special web sites which have relatively structure or semi-structure are selected. Then, web documents are clawed with Jsoap. Secondly, all contained knowledge is extracted and organized together to form the domain-specific ontology. Finally, the Jena platform is employed to create, delete, read, write ontology model in the form of RDF and query by SPARQL. The experimental results in “Entertainment†and “Sport†domain show concept hierarchy structures are reasonable with the overall precision of domain-specific ontology being up to 97%.","PeriodicalId":184788,"journal":{"name":"2011 Seventh International Conference on Semantics, Knowledge and Grids","volume":"200 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128610704","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}
It is laborious and time consuming to build domain ontology, which models a specific domain and specifies the concepts in a particular subject. In this paper, a 5W1H-based conceptual modeling framework for domain ontology is proposed, which is used to analysis domain concepts and relations from six aspects including Who, When, Where, What, Why and How. The definition of domain ontology, domain concept and domain relation are also presented. According to the framework, the conceptual model of Science & Technology Project Ontology (STPO) in science and technology domain is designed, in which main concepts and relations within the STPO are clearly described. From the analysis, the 5W1H conceptual modeling framework can be mapped to the class model in Object-Oriented method, which is used to model things in real world. Application shows that the framework is effective to model domain knowledge and scalable to business changes and user requirements.
{"title":"5W1H-based Conceptual Modeling Framework for Domain Ontology and Its Application on STPO","authors":"Liu Yang, Zhi-gang Hu, J. Long, Tao Guo","doi":"10.1109/SKG.2011.31","DOIUrl":"https://doi.org/10.1109/SKG.2011.31","url":null,"abstract":"It is laborious and time consuming to build domain ontology, which models a specific domain and specifies the concepts in a particular subject. In this paper, a 5W1H-based conceptual modeling framework for domain ontology is proposed, which is used to analysis domain concepts and relations from six aspects including Who, When, Where, What, Why and How. The definition of domain ontology, domain concept and domain relation are also presented. According to the framework, the conceptual model of Science & Technology Project Ontology (STPO) in science and technology domain is designed, in which main concepts and relations within the STPO are clearly described. From the analysis, the 5W1H conceptual modeling framework can be mapped to the class model in Object-Oriented method, which is used to model things in real world. Application shows that the framework is effective to model domain knowledge and scalable to business changes and user requirements.","PeriodicalId":184788,"journal":{"name":"2011 Seventh International Conference on Semantics, Knowledge and Grids","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127390450","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}
M. Klusch, Xiaoqi Cao, Patrick Kapahnke, Stefan Warwas
We present the open 3D Internet research platform ISReal for semantic-enabled intelligent 3D simulations of realities in a XML3D web browser. For this purpose, the platform integrates semantic Web technologies, semantic services, intelligent agents, verification and web-based 3D graphics. In addition, we describe our vision of a scalable web-based multiuser 3DI platform for intelligent semantic-enabled collaboration between multiple users and outline selected research challenges of realizing this vision.
{"title":"Semantics and Agents for Intelligent Simulation and Collaboration in the 3D Internet","authors":"M. Klusch, Xiaoqi Cao, Patrick Kapahnke, Stefan Warwas","doi":"10.1109/SKG.2011.40","DOIUrl":"https://doi.org/10.1109/SKG.2011.40","url":null,"abstract":"We present the open 3D Internet research platform ISReal for semantic-enabled intelligent 3D simulations of realities in a XML3D web browser. For this purpose, the platform integrates semantic Web technologies, semantic services, intelligent agents, verification and web-based 3D graphics. In addition, we describe our vision of a scalable web-based multiuser 3DI platform for intelligent semantic-enabled collaboration between multiple users and outline selected research challenges of realizing this vision.","PeriodicalId":184788,"journal":{"name":"2011 Seventh International Conference on Semantics, Knowledge and Grids","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131767376","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}
People often feel the limitation of time to read the continuously increasing articles they need to read. It is a grand challenge to handle the explosion of articles. To understand how humans read articles and get the meaning is the basis of improving the efficiency of reading articles. The underlying semantic links between language units of different granularities reflect some basic semantics. Sentence is the basic language unit for accurately indicating semantics. By defining concepts and the dependent set of sentences, and constructing the semantic link network of dependent sentences and semantic link network of concepts, this paper proposes the textual semantic lens with a set of functions for helping people comprehend articles. Integrating with the semantic link networks of articles, the semantic lens can help people efficiently read large-scale articles.
{"title":"The Textual Semantic Lens","authors":"Bei Xu, H. Zhuge","doi":"10.1109/SKG.2011.50","DOIUrl":"https://doi.org/10.1109/SKG.2011.50","url":null,"abstract":"People often feel the limitation of time to read the continuously increasing articles they need to read. It is a grand challenge to handle the explosion of articles. To understand how humans read articles and get the meaning is the basis of improving the efficiency of reading articles. The underlying semantic links between language units of different granularities reflect some basic semantics. Sentence is the basic language unit for accurately indicating semantics. By defining concepts and the dependent set of sentences, and constructing the semantic link network of dependent sentences and semantic link network of concepts, this paper proposes the textual semantic lens with a set of functions for helping people comprehend articles. Integrating with the semantic link networks of articles, the semantic lens can help people efficiently read large-scale articles.","PeriodicalId":184788,"journal":{"name":"2011 Seventh International Conference on Semantics, Knowledge and Grids","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114131714","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}
Term weighting strategy plays an essential role in the areas related to text processing such as text categorization and information retrieval. In such systems, term frequency, inverse document frequency, and document length normalization are important factors to be considered when a term weighting strategy is developed. Term length normalization is proposed to give equal opportunities to retrieve both lengthy documents and shorter ones. However, terms in very short documents that may be useless for users, especially in the scenario of Web information retrieval, could be assigned very high weights, resulting in a situation where shorter documents are ranked higher than lengthy documents that are more relevant to users information needs. In this research, a new R-tfidf term weighting strategy is proposed to alleviate the side effects of document length normalization. Experimental results demonstrate the proposed approach can to some extent improve the performance of text categorization.
{"title":"R-tfidf, a Variety of tf-idf Term Weighting Strategy in Document Categorization","authors":"Dengya Zhu, Jitian Xiao","doi":"10.1109/SKG.2011.44","DOIUrl":"https://doi.org/10.1109/SKG.2011.44","url":null,"abstract":"Term weighting strategy plays an essential role in the areas related to text processing such as text categorization and information retrieval. In such systems, term frequency, inverse document frequency, and document length normalization are important factors to be considered when a term weighting strategy is developed. Term length normalization is proposed to give equal opportunities to retrieve both lengthy documents and shorter ones. However, terms in very short documents that may be useless for users, especially in the scenario of Web information retrieval, could be assigned very high weights, resulting in a situation where shorter documents are ranked higher than lengthy documents that are more relevant to users information needs. In this research, a new R-tfidf term weighting strategy is proposed to alleviate the side effects of document length normalization. Experimental results demonstrate the proposed approach can to some extent improve the performance of text categorization.","PeriodicalId":184788,"journal":{"name":"2011 Seventh International Conference on Semantics, Knowledge and Grids","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124264470","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}
In this paper we describe an agent-based system for user profiles dynamic share. We address the problem of discovery and construction of distributed user profiles for adapted services recommendation in the context of pervasive applications. The system has to be open and proactive in order to dynamically propose adapted services according to user's situation and contextual profile, while preserving his/her privacy. The objective of this work is to propose an infrastructure for developing pervasive learning environments to dynamically build the most suitable learner profile for a particular service or interaction in real-time. The implemented prototype is also presented, showing in detail how agents communicate.
{"title":"An Agent-Based Service Architecture for User Profiles Dynamic Share","authors":"A. Bouzeghoub, Alda Lopes Gançarski","doi":"10.1109/SKG.2011.51","DOIUrl":"https://doi.org/10.1109/SKG.2011.51","url":null,"abstract":"In this paper we describe an agent-based system for user profiles dynamic share. We address the problem of discovery and construction of distributed user profiles for adapted services recommendation in the context of pervasive applications. The system has to be open and proactive in order to dynamically propose adapted services according to user's situation and contextual profile, while preserving his/her privacy. The objective of this work is to propose an infrastructure for developing pervasive learning environments to dynamically build the most suitable learner profile for a particular service or interaction in real-time. The implemented prototype is also presented, showing in detail how agents communicate.","PeriodicalId":184788,"journal":{"name":"2011 Seventh International Conference on Semantics, Knowledge and Grids","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128260864","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}
OWL-S is designed to support semantic and automated composition of Web services. AFLOW is a composition system, based on OWL-S, combining AI planning and workflow technology. In this paper, we discuss the implementation of the AI planning subsystem in the AFLOW, supporting higher dynamic and automation of composition. And we describe how an AI planning system (SHOP2) can be used with OWL-S Web service type descriptions in AFLOW to automatically compose Web services and support partial concurrency in OWL-S.
{"title":"A Planning Engine Based on SHOP2 for AFLOW","authors":"Xinhuai Tang, Zhaoteng Song, Xiangfeng Luo","doi":"10.1109/SKG.2011.22","DOIUrl":"https://doi.org/10.1109/SKG.2011.22","url":null,"abstract":"OWL-S is designed to support semantic and automated composition of Web services. AFLOW is a composition system, based on OWL-S, combining AI planning and workflow technology. In this paper, we discuss the implementation of the AI planning subsystem in the AFLOW, supporting higher dynamic and automation of composition. And we describe how an AI planning system (SHOP2) can be used with OWL-S Web service type descriptions in AFLOW to automatically compose Web services and support partial concurrency in OWL-S.","PeriodicalId":184788,"journal":{"name":"2011 Seventh International Conference on Semantics, Knowledge and Grids","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126035700","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
扫码关注我们
求助内容：
应助结果提醒方式：