XML Schema lacks sufficient semantics and it becomes an obstacle to integration and sharing of heterogeneous XML data. In order to resolve these problems in well engineering domain, this paper proposes an ontology-based method to build a XML knowledge base called WeKB. In this method, a series of semantic views are defined between domain ontology and XML paths, and each node of XML data is mapped with some semantic views by which all elements of XML data are transformed to OWL instances and populated to WeKB. In addition, by axioms and inference rules, WeKB is also equipped with certain reasoning functions. By practical application, it can provide effective support for decision making in oilfield production.
{"title":"A Method of Building Domain Knowledge Base from XML Based on Semantic Views","authors":"Huayu Li, Jiuyun Xu","doi":"10.1109/SKG.2011.11","DOIUrl":"https://doi.org/10.1109/SKG.2011.11","url":null,"abstract":"XML Schema lacks sufficient semantics and it becomes an obstacle to integration and sharing of heterogeneous XML data. In order to resolve these problems in well engineering domain, this paper proposes an ontology-based method to build a XML knowledge base called WeKB. In this method, a series of semantic views are defined between domain ontology and XML paths, and each node of XML data is mapped with some semantic views by which all elements of XML data are transformed to OWL instances and populated to WeKB. In addition, by axioms and inference rules, WeKB is also equipped with certain reasoning functions. By practical application, it can provide effective support for decision making in oilfield production.","PeriodicalId":184788,"journal":{"name":"2011 Seventh International Conference on Semantics, Knowledge and Grids","volume":"109 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":"128616426","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 agent based framework to incorporating distributed semantics and reasoning into a conventional distributed system, to support intelligent decisions and behaviours of distributed nodes of the system. In the framework, service agents which reside in distributed nodes provide semantic services specific to the local environment, and mobile agents provide semantic services to applications that use the underlying distributed system.
{"title":"Towards Intelligent Distributed Applications Based on Distributed Semantics and Reasoning","authors":"W. Du","doi":"10.1109/SKG.2011.27","DOIUrl":"https://doi.org/10.1109/SKG.2011.27","url":null,"abstract":"This paper proposes an agent based framework to incorporating distributed semantics and reasoning into a conventional distributed system, to support intelligent decisions and behaviours of distributed nodes of the system. In the framework, service agents which reside in distributed nodes provide semantic services specific to the local environment, and mobile agents provide semantic services to applications that use the underlying distributed system.","PeriodicalId":184788,"journal":{"name":"2011 Seventh International Conference on Semantics, Knowledge and Grids","volume":"19 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":"126871295","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 propose a methodology whereby we semantically align heterogeneous databases without changing the databases. The alignment achieved is on the data instance level, which does not require the semantics of the data at the type level. We first introduce semantic alignment in the context of our databases research project then discuss in details how heterogeneous databases that are semantically aligned may be integrated. In general, we align heterogeneous databases with 'Global as View'. We show that by drawing on Barwise-Seligman's information flow channel theory and making use of Enhanced Entity-Relationship model, semantically aligned heterogeneous databases can be successfully integrated, which enables non-conventional queries on constituting databases. We show that without modifying databases our methodology integrates any chosen databases on data instances level without loss of information, which is our contribution over existing works. Furthermore, Barwise-Seligman's information flow channel theory represents a novel and mathematically sound approach to linking independent systems. As we use this theory as a theoretical basis of our work and therefore we believe that our ideas presented here have a general applicability in talking issues in distributed systems.
{"title":"Integration of Semantically Aligned Heterogeneous Databases","authors":"Yi Yang, Junkang Feng","doi":"10.1109/SKG.2011.30","DOIUrl":"https://doi.org/10.1109/SKG.2011.30","url":null,"abstract":"In this paper we propose a methodology whereby we semantically align heterogeneous databases without changing the databases. The alignment achieved is on the data instance level, which does not require the semantics of the data at the type level. We first introduce semantic alignment in the context of our databases research project then discuss in details how heterogeneous databases that are semantically aligned may be integrated. In general, we align heterogeneous databases with 'Global as View'. We show that by drawing on Barwise-Seligman's information flow channel theory and making use of Enhanced Entity-Relationship model, semantically aligned heterogeneous databases can be successfully integrated, which enables non-conventional queries on constituting databases. We show that without modifying databases our methodology integrates any chosen databases on data instances level without loss of information, which is our contribution over existing works. Furthermore, Barwise-Seligman's information flow channel theory represents a novel and mathematically sound approach to linking independent systems. As we use this theory as a theoretical basis of our work and therefore we believe that our ideas presented here have a general applicability in talking issues in distributed systems.","PeriodicalId":184788,"journal":{"name":"2011 Seventh International Conference on Semantics, Knowledge and Grids","volume":"9 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":"129141407","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 surveys research on the Resource Space Model RSM. RSM is a classification-based, multi-dimensional and content-based space model for efficiently and effectively managing various resources. As a non-relational data model, it has a rather complete theoretical basis and has significant applications in faceted search and the future cyber-physical society. Applications in picture resources and email resources are introduced.
{"title":"A Survey on the Resource Space Model","authors":"Jingqiang Chen","doi":"10.1109/SKG.2011.43","DOIUrl":"https://doi.org/10.1109/SKG.2011.43","url":null,"abstract":"This paper surveys research on the Resource Space Model RSM. RSM is a classification-based, multi-dimensional and content-based space model for efficiently and effectively managing various resources. As a non-relational data model, it has a rather complete theoretical basis and has significant applications in faceted search and the future cyber-physical society. Applications in picture resources and email resources are introduced.","PeriodicalId":184788,"journal":{"name":"2011 Seventh International Conference on Semantics, Knowledge and Grids","volume":"11 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":"122457192","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 introduces a research on Semantic Web technology and adaptive learning system. The research is part of a current research project in the Distance Education College at Renmin University of China, and the project is supported by the National Social Science Foundation Grant (No. 10BTQ009). The paper describes the general system model and adaptive learning process model for adaptive learning system based on Semantic Web technology.
{"title":"A Conceptual Model for Adaptive Learning System Based on Semantic Web Technology","authors":"Chunyan Liu, Zonglian Gu, Xin Sun","doi":"10.1109/SKG.2011.18","DOIUrl":"https://doi.org/10.1109/SKG.2011.18","url":null,"abstract":"This paper introduces a research on Semantic Web technology and adaptive learning system. The research is part of a current research project in the Distance Education College at Renmin University of China, and the project is supported by the National Social Science Foundation Grant (No. 10BTQ009). The paper describes the general system model and adaptive learning process model for adaptive learning system based on Semantic Web technology.","PeriodicalId":184788,"journal":{"name":"2011 Seventh International Conference on Semantics, Knowledge and Grids","volume":"83 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":"124045404","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}
As the collaborative tagging systems such as Delicious, Flickr and Last. fm become more and more popular, a large amount of resources produced by publishers, together with rich semantic metadata, become available. There are lots of ways to make use of tag information and so far the most discussed usage is for searching. The distribution of tag types differs greatly across different systems. Also the distribution shows large difference between publishers and searchers. In order to expand tags of resources for publishers and keywords for searchers reasonable, this paper shows a comparison of the distributions of both kinds of users and proposes an approach which could calculate the recommendation level of types. The level of types could be used to describe whether the type is valuable to the corresponding users. The distribution of different combination of types has also been investigated, and with such information we analysed the most popular combination of types in query log across different collections. We compare the searching accuracy on original datasets against the datasets with resources after being expanded tags by our proposed methods. Experimental results show that our method could improve searching accuracy.
{"title":"Improving Search by Extending Tags According to Recommendation Level and Combinations of Types","authors":"J. Tian, Kening Gao, Yin Zhang, Bin Zhang","doi":"10.1109/SKG.2011.17","DOIUrl":"https://doi.org/10.1109/SKG.2011.17","url":null,"abstract":"As the collaborative tagging systems such as Delicious, Flickr and Last. fm become more and more popular, a large amount of resources produced by publishers, together with rich semantic metadata, become available. There are lots of ways to make use of tag information and so far the most discussed usage is for searching. The distribution of tag types differs greatly across different systems. Also the distribution shows large difference between publishers and searchers. In order to expand tags of resources for publishers and keywords for searchers reasonable, this paper shows a comparison of the distributions of both kinds of users and proposes an approach which could calculate the recommendation level of types. The level of types could be used to describe whether the type is valuable to the corresponding users. The distribution of different combination of types has also been investigated, and with such information we analysed the most popular combination of types in query log across different collections. We compare the searching accuracy on original datasets against the datasets with resources after being expanded tags by our proposed methods. Experimental results show that our method could improve searching accuracy.","PeriodicalId":184788,"journal":{"name":"2011 Seventh International Conference on Semantics, Knowledge and Grids","volume":"12 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":"127539304","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}
MapReduce programming model has been used in various kinds of intensive data processing and analysis projects for its ease of use and good scalability. In this paper, we discuss about the execution mechanism of cyclic workflow on top of MapReduce framework. A novel cycle elimination algorithm is proposed to decompose the cyclic workflow to DAG (Directed Acyclic Graph) sub-workflows. It dynamically and recursively searches for the maximum DAG sub-workflow according to current decision result of the decision node in each iteration. DAG sub-workflow scheduling strategy, which is comprised of DAG grouping mechanism and MapReduce task mapping, is also presented. Finally, we propose an intermediate data transmission mechanism named Partition Pushing, which can improve the possible parallelism between the executions of dependent jobs. Experiments show that our proposed workflow execution mechanism can schedule the cyclic workflow efficiently by improving the parallelism between dependent jobs and consequently reduce the workflow make span by 20%-60%.
{"title":"Cyclic Workflow Execution Mechanism on Top of MapReduce Framework","authors":"Rong Wu, Liang Shuai, Huaming Liao","doi":"10.1109/SKG.2011.46","DOIUrl":"https://doi.org/10.1109/SKG.2011.46","url":null,"abstract":"MapReduce programming model has been used in various kinds of intensive data processing and analysis projects for its ease of use and good scalability. In this paper, we discuss about the execution mechanism of cyclic workflow on top of MapReduce framework. A novel cycle elimination algorithm is proposed to decompose the cyclic workflow to DAG (Directed Acyclic Graph) sub-workflows. It dynamically and recursively searches for the maximum DAG sub-workflow according to current decision result of the decision node in each iteration. DAG sub-workflow scheduling strategy, which is comprised of DAG grouping mechanism and MapReduce task mapping, is also presented. Finally, we propose an intermediate data transmission mechanism named Partition Pushing, which can improve the possible parallelism between the executions of dependent jobs. Experiments show that our proposed workflow execution mechanism can schedule the cyclic workflow efficiently by improving the parallelism between dependent jobs and consequently reduce the workflow make span by 20%-60%.","PeriodicalId":184788,"journal":{"name":"2011 Seventh International Conference on Semantics, Knowledge and Grids","volume":"6 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":"114935942","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}
With the decrease of hardware production costs, putting connection capabilities to appliances has become affordable. At the same time, the widespread adoption of the Web has gained on Internet users. At the convergence of these two facts the idea of a ``Web of Things" has emerged, unleashing the current Internet of Things solutions by exposing connected objects as Web resources. While quite promising - now appliances are able to interoperate whatever their hardware or Operating Systems, using Web protocols stack - this vision still needs practical mechanisms to allow applications or users to interact with connected objects. In this paper, we propose an approach supporting the use of a ``Web of Things" through the creation of ontological models describing connected objects in order to make them ``speak the same language". In addition, we present a framework that processes such semantic models to allow seamless integration and use of such connected objects within Web applications.
{"title":"Semantic Profiles to Model the \"Web of Things\"","authors":"B. Christophe","doi":"10.1109/SKG.2011.29","DOIUrl":"https://doi.org/10.1109/SKG.2011.29","url":null,"abstract":"With the decrease of hardware production costs, putting connection capabilities to appliances has become affordable. At the same time, the widespread adoption of the Web has gained on Internet users. At the convergence of these two facts the idea of a ``Web of Things\" has emerged, unleashing the current Internet of Things solutions by exposing connected objects as Web resources. While quite promising - now appliances are able to interoperate whatever their hardware or Operating Systems, using Web protocols stack - this vision still needs practical mechanisms to allow applications or users to interact with connected objects. In this paper, we propose an approach supporting the use of a ``Web of Things\" through the creation of ontological models describing connected objects in order to make them ``speak the same language\". In addition, we present a framework that processes such semantic models to allow seamless integration and use of such connected objects within Web applications.","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":"129665401","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 propose a LexOnt, a semi-automatic ontology creation tool for high-level service ontology. LexOnt uses the Programmable Web directory of services as its corpus of data along with Internet sources such as Wikipedia in order to generate common terms within a service domain and determine generic properties for classification. Currently, Programmable Web classifies services in a flat categorization where each service is manually classified within a single category. Search is limited to attributes that are not related to the semantics of the service, such as protocol or messaging type. When using an ontology for the service API descriptions, services can be automatically classified and queried for according to their attributes. Additionally, services can then be distributed in an ontology-based service discovery system such as GloServ so that semantic registration and querying of services becomes possible.
{"title":"Semi-automated Ontology Creation for High-Level Service Classification","authors":"Knarig Arabshian, Peter J. Danielsen","doi":"10.1109/SKG.2011.39","DOIUrl":"https://doi.org/10.1109/SKG.2011.39","url":null,"abstract":"In this paper, we propose a LexOnt, a semi-automatic ontology creation tool for high-level service ontology. LexOnt uses the Programmable Web directory of services as its corpus of data along with Internet sources such as Wikipedia in order to generate common terms within a service domain and determine generic properties for classification. Currently, Programmable Web classifies services in a flat categorization where each service is manually classified within a single category. Search is limited to attributes that are not related to the semantics of the service, such as protocol or messaging type. When using an ontology for the service API descriptions, services can be automatically classified and queried for according to their attributes. Additionally, services can then be distributed in an ontology-based service discovery system such as GloServ so that semantic registration and querying of services becomes possible.","PeriodicalId":184788,"journal":{"name":"2011 Seventh International Conference on Semantics, Knowledge and Grids","volume":"8 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":"129428754","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}
Analyzing and contracting of E-Business service processes is a crucial step between discovery and execution of Semantic Web Services. This paper proposes a service modelling framework consists of constraint-based service contract, agent style communication messages and service process specification. Service contract is used as shared knowledge between participants and instrument for advertising and requesting of services. The Constraint Process S pecification proposed is capable of describing complex data and control-flow restrictions as well as data content restrictions. A state transition based operational semantic for this framework is given. A virtual machine is built for analyzing and contracting of services. We illustrate the expressiveness of this framework within an online shopping scenario.
{"title":"Contracting of E-business Services in a Constraint-Based Process Modeling Framework","authors":"Ruoyu Chen, L. Liao, Zhi Fang","doi":"10.1109/SKG.2011.12","DOIUrl":"https://doi.org/10.1109/SKG.2011.12","url":null,"abstract":"Analyzing and contracting of E-Business service processes is a crucial step between discovery and execution of Semantic Web Services. This paper proposes a service modelling framework consists of constraint-based service contract, agent style communication messages and service process specification. Service contract is used as shared knowledge between participants and instrument for advertising and requesting of services. The Constraint Process S pecification proposed is capable of describing complex data and control-flow restrictions as well as data content restrictions. A state transition based operational semantic for this framework is given. A virtual machine is built for analyzing and contracting of services. We illustrate the expressiveness of this framework within an online shopping scenario.","PeriodicalId":184788,"journal":{"name":"2011 Seventh International Conference on Semantics, Knowledge and Grids","volume":"9 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":"128409381","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
扫码关注我们
求助内容：
应助结果提醒方式：