Event processing is a significant evolution in the field of information technology. Semantic link network (SLN) is a semantic data model for managing resources and their semantic relations. This paper proposes a two-layered SLN model for event processing: the matter level and the event level. The event SLN aims to record and manage the evolving process of the matter level. We propose a domain independent schema for the event SLN consisting of a set of primary link types and a set of reasoning rules. The model is useful in data encapsulating, knowledge retrieving, knowledge flow discovery, and intelligent applications for the internet of things.
{"title":"Weaving the Semantic Link Network of Events","authors":"Junsheng Zhang, Yunchuan Sun","doi":"10.1109/SKG.2010.40","DOIUrl":"https://doi.org/10.1109/SKG.2010.40","url":null,"abstract":"Event processing is a significant evolution in the field of information technology. Semantic link network (SLN) is a semantic data model for managing resources and their semantic relations. This paper proposes a two-layered SLN model for event processing: the matter level and the event level. The event SLN aims to record and manage the evolving process of the matter level. We propose a domain independent schema for the event SLN consisting of a set of primary link types and a set of reasoning rules. The model is useful in data encapsulating, knowledge retrieving, knowledge flow discovery, and intelligent applications for the internet of things.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"20 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":"124443237","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}
Modern information network such as Digital Library contain much more data than ever before. These data are globally distributed, become accessible to huge, heterogeneous user groups easily. On the other hand, the enormous amount of information requires powerful tools for the user to find the relevant data. One such tool is thesaurus. The thesaurus as an ontology is playing an increasingly important role in knowledge management and the semantic web. The paper reconsiders the nature of thesaurus from the view of ontology. It proposes a system framework of thesaurus construction. And the approach and ideas of thesaurus construction are also described in the paper.
{"title":"Reconsidering Nature of Thesaurus and Its Automatic Construction in Information Network","authors":"Wen Zeng, Huilin Wang, Junsheng Zhang","doi":"10.1109/SKG.2010.73","DOIUrl":"https://doi.org/10.1109/SKG.2010.73","url":null,"abstract":"Modern information network such as Digital Library contain much more data than ever before. These data are globally distributed, become accessible to huge, heterogeneous user groups easily. On the other hand, the enormous amount of information requires powerful tools for the user to find the relevant data. One such tool is thesaurus. The thesaurus as an ontology is playing an increasingly important role in knowledge management and the semantic web. The paper reconsiders the nature of thesaurus from the view of ontology. It proposes a system framework of thesaurus construction. And the approach and ideas of thesaurus construction are also described in the paper.","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":"126295997","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}
The proliferation of deep Web offers users a great opportunity to search high-quality information from Web. As a necessary step in deep Web data integration, the goal of duplicate entity identification is to discover the duplicate records from the integrated Web databases for further applications(e.g. price-comparison services). However, most of existing works address this issue only between two data sources, which are not practical to deep Web data integration systems. That is, one duplicate entity matcher trained over two specific Web databases cannot be applied to other Web databases. In addition, the cost of preparing the training set for n Web databases is C_n^2 times higher than that for two Web databases. In this paper, we propose a holistic solution to address the new challenges posed by deep Web, whose goal is to build one duplicate entity matcher over multiple Web databases. The extensive experiments on two domains show that the proposed solution is highly effective for deep Web data integration.
{"title":"A Holistic Solution for Duplicate Entity Identification in Deep Web Data Integration","authors":"W. Liu, Xiaofeng Meng","doi":"10.1109/SKG.2010.38","DOIUrl":"https://doi.org/10.1109/SKG.2010.38","url":null,"abstract":"The proliferation of deep Web offers users a great opportunity to search high-quality information from Web. As a necessary step in deep Web data integration, the goal of duplicate entity identification is to discover the duplicate records from the integrated Web databases for further applications(e.g. price-comparison services). However, most of existing works address this issue only between two data sources, which are not practical to deep Web data integration systems. That is, one duplicate entity matcher trained over two specific Web databases cannot be applied to other Web databases. In addition, the cost of preparing the training set for n Web databases is C_n^2 times higher than that for two Web databases. In this paper, we propose a holistic solution to address the new challenges posed by deep Web, whose goal is to build one duplicate entity matcher over multiple Web databases. The extensive experiments on two domains show that the proposed solution is highly effective for deep Web data integration.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"36 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":"126092799","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}
Along with the development of mobile E-commerce, its security problem received more and more attention, and becomed the main factor that affects its development. To address this, we proposed a new Mobile E-commerce system solution that can be used for mobile payment without changing mobile device hardware configuration by connecting to an special and exteral security electronic device. This electronic security device is connected to the mobile device through adaptable interface for enhancing the security ability and storing private data. As an application, we implement a mobile payment system consists of the front end administration module on the mobile device, backend administration module on the server and electronic device as the security module. This solution realizes the high security and low cost of mobile payment, has good applied value and marketable foreground.
{"title":"Research of Mobile E-commerce Security Solution Based on External Electronic Device","authors":"Dechao Sun, Tiejun Pan, Zhong Wan, Haiyan He","doi":"10.1109/SKG.2010.58","DOIUrl":"https://doi.org/10.1109/SKG.2010.58","url":null,"abstract":"Along with the development of mobile E-commerce, its security problem received more and more attention, and becomed the main factor that affects its development. To address this, we proposed a new Mobile E-commerce system solution that can be used for mobile payment without changing mobile device hardware configuration by connecting to an special and exteral security electronic device. This electronic security device is connected to the mobile device through adaptable interface for enhancing the security ability and storing private data. As an application, we implement a mobile payment system consists of the front end administration module on the mobile device, backend administration module on the server and electronic device as the security module. This solution realizes the high security and low cost of mobile payment, has good applied value and marketable foreground.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"84 1 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":"125924189","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}
OOXML (Office Open XML) and ODF (Open Document Format) are the world's two major document format standards. The structure and some main components of the word processing document in OOXML and ODF are analysed and compared in detail. The results are the base of document interoperability between OOXML and ODF. Some valuable conclusions can be gotten that 1) Most components of the word processing document in one format have the logical counterpart in the other one, 2) Some components have no counterpart or some corresponding relationships between OOXML and ODF are very complicated. The latter point is one of the most important obstructions in the interoperability between OOXML and ODF.
OOXML (Office Open XML)和ODF (Open Document Format)是世界上两个主要的文档格式标准。对OOXML和ODF格式的文字处理文档的结构和主要组成部分进行了详细的分析和比较。这些结果是OOXML和ODF之间文档互操作性的基础。可以得出一些有价值的结论:1)一种格式的文字处理文档的大多数组件在另一种格式中具有逻辑对应物;2)一些组件没有对应物或OOXML与ODF之间的某些对应关系非常复杂。后一点是OOXML和ODF之间互操作性中最重要的障碍之一。
{"title":"Comparison of Wordprocessing Document Format in OOXML and ODF","authors":"Xia Hou, Ning Li, Hongbo Yang, Qi Liang","doi":"10.1109/SKG.2010.44","DOIUrl":"https://doi.org/10.1109/SKG.2010.44","url":null,"abstract":"OOXML (Office Open XML) and ODF (Open Document Format) are the world's two major document format standards. The structure and some main components of the word processing document in OOXML and ODF are analysed and compared in detail. The results are the base of document interoperability between OOXML and ODF. Some valuable conclusions can be gotten that 1) Most components of the word processing document in one format have the logical counterpart in the other one, 2) Some components have no counterpart or some corresponding relationships between OOXML and ODF are very complicated. The latter point is one of the most important obstructions in the interoperability between OOXML and ODF.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"63 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":"131713181","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}
Minqi Zhou, Rong Zhang, Dadan Zeng, Weining Qian, Aoying Zhou
The chain join processing which combines records from two or more tables sequentially has been well studied in the centralized databases. However, it has seldom been discussed in the cloud computing era, and remains imperative to be solved, especially where structured (or relational) data are stored in a column (attribute) wise fashion in distributed file systems (e.g., Google File System) over hundreds of or even thousands of commodities PCs. In this paper, we propose a novel method for chain join processing, which is one of the common primitives in the cloud era for column-wise stored data analysis. By effectively selecting the dedicated records (tuples) for the chain join based on the information exploited within bipartite join graph, communication cost for record transmission could be reduced dramatically. A bushy tree structure is deployed to regulate the chain join sequence, which further reduces the number of intermediate results generated and transmitted, and explores higher parallelism in join processing, while results in more efficient join processing. Our extensive performance study confirms the effectiveness and efficiency of our methods.
{"title":"Join Optimization in the MapReduce Environment for Column-wise Data Store","authors":"Minqi Zhou, Rong Zhang, Dadan Zeng, Weining Qian, Aoying Zhou","doi":"10.1109/SKG.2010.18","DOIUrl":"https://doi.org/10.1109/SKG.2010.18","url":null,"abstract":"The chain join processing which combines records from two or more tables sequentially has been well studied in the centralized databases. However, it has seldom been discussed in the cloud computing era, and remains imperative to be solved, especially where structured (or relational) data are stored in a column (attribute) wise fashion in distributed file systems (e.g., Google File System) over hundreds of or even thousands of commodities PCs. In this paper, we propose a novel method for chain join processing, which is one of the common primitives in the cloud era for column-wise stored data analysis. By effectively selecting the dedicated records (tuples) for the chain join based on the information exploited within bipartite join graph, communication cost for record transmission could be reduced dramatically. A bushy tree structure is deployed to regulate the chain join sequence, which further reduces the number of intermediate results generated and transmitted, and explores higher parallelism in join processing, while results in more efficient join processing. Our extensive performance study confirms the effectiveness and efficiency of our methods.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"82 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":"132219093","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}
One of key issues of the Semantic Web applications is the lack of semantic data (ontologies). Although the vast majority of data are stored in the popular relational databases, they are still not easily available for many next generation Web applications. Therefore, one of core challenges of Semantic Web is whether these applications can automatically retrieve semantic information from the existed relational databases. This paper proposes a middle graph-based formal model language, W-graph, a bridge between relational databases and ontologies, which abstracts semantic information from relational database instances semi-automatically and then generates an OWL ontology automatically. This method not only maps relational database schemata to ontologies, but also populates ontologies with data stored in databases. Moreover, a proof of semantic preserving on the mapping is provided, and a case study and an implemented prototype tool are also reported.
{"title":"Mapping Relational Databases into Ontologies through a Graph-based Formal Model","authors":"Shihan Yang, Jinzhao Wu","doi":"10.1109/SKG.2010.33","DOIUrl":"https://doi.org/10.1109/SKG.2010.33","url":null,"abstract":"One of key issues of the Semantic Web applications is the lack of semantic data (ontologies). Although the vast majority of data are stored in the popular relational databases, they are still not easily available for many next generation Web applications. Therefore, one of core challenges of Semantic Web is whether these applications can automatically retrieve semantic information from the existed relational databases. This paper proposes a middle graph-based formal model language, W-graph, a bridge between relational databases and ontologies, which abstracts semantic information from relational database instances semi-automatically and then generates an OWL ontology automatically. This method not only maps relational database schemata to ontologies, but also populates ontologies with data stored in databases. Moreover, a proof of semantic preserving on the mapping is provided, and a case study and an implemented prototype tool are also reported.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"24 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":"115185634","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}
The Multimedia Information Retrieval (MIR) in the P2P networks has been widely studied. In this paper, we propose a new comprehensive similarity function to calculate the similarity of peers in the P2P networks so as to classify these peers. We also apply the relevance feedback in the process of retrieval in order to improve the speed and accuracy of retrieval. In simulation, we compare our algorithm to the traditional method on the basis of the performance of the test which includes four types of thousands of files (text, image, video, and audio). The results show that our algorithm performs better on both speed and accuracy.
{"title":"A Multimedia Information Retrieval Algorithm in P2P Networks Based on the Classification of Peers","authors":"G. Wu, Zhipeng Jiang, Suixiang Gao, Wenguo Yang","doi":"10.1109/SKG.2010.54","DOIUrl":"https://doi.org/10.1109/SKG.2010.54","url":null,"abstract":"The Multimedia Information Retrieval (MIR) in the P2P networks has been widely studied. In this paper, we propose a new comprehensive similarity function to calculate the similarity of peers in the P2P networks so as to classify these peers. We also apply the relevance feedback in the process of retrieval in order to improve the speed and accuracy of retrieval. In simulation, we compare our algorithm to the traditional method on the basis of the performance of the test which includes four types of thousands of files (text, image, video, and audio). The results show that our algorithm performs better on both speed and accuracy.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"24 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":"121576545","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}
Finding knowledge on the Web has long been a hot research issue. Today the Web has become a popular medium for publishing news and opinion articles, which are important carriers of human knowledge, especially of social knowledge. Developing techniques of automatically collecting and analysing these articles on a large scale is thus desirable. In this paper we propose techniques for searching for events on the Web, and our techniques have been tested on a large scale web archive. Given an event, or a news topic cared by many people, the purpose of this paper is to find out near-all news stories related to it. First, a novel domain-independent approach of extracting news stories from web pages is proposed which is based on anchor text and is applicable to most websites. Experiments show our approach performs good and is better than another approach we have found. Second, a domain-based method of representing events is proposed in which hundreds of keywords are used to represent an event and compose the query expression. This situation of retrieval is different from most search engines' in that the number of keywords is large. We then propose several retrieval algorithms based on BM25 for the method. Evaluation show that these algorithms perform better than unmodified BM25 in our situation and the best one is chosen as the algorithm of our system. Finally an experimental system has been built on a collection of 2 billion web pages and the running performance is reported, which shows the effectiveness of our approaches.
{"title":"Searching for Historical Events on a Large-Scale Web Archive","authors":"Lian'en Huang, Wu Lin, Xiaoming Li","doi":"10.1109/SKG.2010.37","DOIUrl":"https://doi.org/10.1109/SKG.2010.37","url":null,"abstract":"Finding knowledge on the Web has long been a hot research issue. Today the Web has become a popular medium for publishing news and opinion articles, which are important carriers of human knowledge, especially of social knowledge. Developing techniques of automatically collecting and analysing these articles on a large scale is thus desirable. In this paper we propose techniques for searching for events on the Web, and our techniques have been tested on a large scale web archive. Given an event, or a news topic cared by many people, the purpose of this paper is to find out near-all news stories related to it. First, a novel domain-independent approach of extracting news stories from web pages is proposed which is based on anchor text and is applicable to most websites. Experiments show our approach performs good and is better than another approach we have found. Second, a domain-based method of representing events is proposed in which hundreds of keywords are used to represent an event and compose the query expression. This situation of retrieval is different from most search engines' in that the number of keywords is large. We then propose several retrieval algorithms based on BM25 for the method. Evaluation show that these algorithms perform better than unmodified BM25 in our situation and the best one is chosen as the algorithm of our system. Finally an experimental system has been built on a collection of 2 billion web pages and the running performance is reported, which shows the effectiveness of our approaches.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"4 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":"126643689","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}
Natural physical space provides material basis for the birth and evolution of human beings and civilization. The progress of human society has created the cyber space. With the rapid development of information technology, the cyber space is connecting physical space, social space and mental space to form a new world — Cyber Physical Society. The way to explore the cyber physical society is different from the way to explore the natural physical space and society. This paper describes the ideal of the Cyber Physical Society, and presents its distinguished characteristics and scientific issues. Research on the Cyber Physical Society could lead to the revolution of society, science and technology.
{"title":"Cyber Physical Society","authors":"H. Zhuge","doi":"10.1109/SKG.2010.7","DOIUrl":"https://doi.org/10.1109/SKG.2010.7","url":null,"abstract":"Natural physical space provides material basis for the birth and evolution of human beings and civilization. The progress of human society has created the cyber space. With the rapid development of information technology, the cyber space is connecting physical space, social space and mental space to form a new world — Cyber Physical Society. The way to explore the cyber physical society is different from the way to explore the natural physical space and society. This paper describes the ideal of the Cyber Physical Society, and presents its distinguished characteristics and scientific issues. Research on the Cyber Physical Society could lead to the revolution of society, science and technology.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"13 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":"121312679","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
扫码关注我们
求助内容：
应助结果提醒方式：