This paper proposes a novel idea of reducing the complexity of processing magnanimous information in content services by making use of user behaviour information. A practical approach and an empirical case are elaborated as a pilot and instructive demonstration.
{"title":"Get Twice the Result with Half the Effort: A Practical Approach to Reducing the Complexity of Processing Magnanimous Information","authors":"Feng Ge, Xiaoming Lu, Sha Hu, Jin Liu","doi":"10.1109/SKG.2011.48","DOIUrl":"https://doi.org/10.1109/SKG.2011.48","url":null,"abstract":"This paper proposes a novel idea of reducing the complexity of processing magnanimous information in content services by making use of user behaviour information. A practical approach and an empirical case are elaborated as a pilot and instructive demonstration.","PeriodicalId":184788,"journal":{"name":"2011 Seventh International Conference on Semantics, Knowledge and Grids","volume":"205 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":"133810846","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}
Wided Ben Abid, Mohamed Graiet, Mourad Kmimech, Mohamed Tahar Bhiri, Walid Gaaloul, Eric Cariou
Service Component Architecture (SCA) aims to simplify the construction of service oriented architecture (SOA) to encourage better the reuse and to be independent from used technologies. In the other hand, UML is a standard for modeling especially in industrial environments. To face this situation we recommend an adaptation of UML2.0 to SCA. It is in this context that we have defined a profile UML2.0 for SCA contain a set of stereotypes applied to metaclasses stemming from the metamodel UML2.0. These stereotypes are completed by formal constraints in OCL. Our profile introduces new elements to reflect the architectural concepts of SCA.
{"title":"Profile UML2.0 for Specification of the SCA Architectures","authors":"Wided Ben Abid, Mohamed Graiet, Mourad Kmimech, Mohamed Tahar Bhiri, Walid Gaaloul, Eric Cariou","doi":"10.1109/SKG.2011.36","DOIUrl":"https://doi.org/10.1109/SKG.2011.36","url":null,"abstract":"Service Component Architecture (SCA) aims to simplify the construction of service oriented architecture (SOA) to encourage better the reuse and to be independent from used technologies. In the other hand, UML is a standard for modeling especially in industrial environments. To face this situation we recommend an adaptation of UML2.0 to SCA. It is in this context that we have defined a profile UML2.0 for SCA contain a set of stereotypes applied to metaclasses stemming from the metamodel UML2.0. These stereotypes are completed by formal constraints in OCL. Our profile introduces new elements to reflect the architectural concepts of SCA.","PeriodicalId":184788,"journal":{"name":"2011 Seventh International Conference on Semantics, Knowledge and Grids","volume":"31 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":"124880303","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}
Based on Halliday's concept and reclassifications of grammatical metaphor, and the theory of reading processes, this paper explores the cognition of grammatical metaphor and its application in EFL reading in China. It aims at testifying the influence of cognition of grammatical metaphor on EFL reading comprehension, and the research can help improve natural language processing from the perspective of grammatical metaphor.
{"title":"Cognition of Grammatical Metaphor and Reading Comprehension","authors":"Yuhua Li","doi":"10.1109/SKG.2011.20","DOIUrl":"https://doi.org/10.1109/SKG.2011.20","url":null,"abstract":"Based on Halliday's concept and reclassifications of grammatical metaphor, and the theory of reading processes, this paper explores the cognition of grammatical metaphor and its application in EFL reading in China. It aims at testifying the influence of cognition of grammatical metaphor on EFL reading comprehension, and the research can help improve natural language processing from the perspective of grammatical metaphor.","PeriodicalId":184788,"journal":{"name":"2011 Seventh International Conference on Semantics, Knowledge and Grids","volume":"22 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":"129819510","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}
Metaphor is the result of human mind conceptualizing the world. In many previous studies about metaphor, space and time are thought to be the two most fundamental concepts in cognition, by which other concepts are constructed. Nevertheless, discussion of the metaphoric structuring of time in natural language is rare, not to mention the time concept in Chinese. This paper aims to evaluate whether the concept of time in Chinese is metaphorically structured, thus in turn, trying to discover the means adopted by Chinese people to understand SHIJIAN.
{"title":"A Cognitive Study of the Metaphoric Structuring of SHIJIAN","authors":"Li Ma","doi":"10.1109/SKG.2011.16","DOIUrl":"https://doi.org/10.1109/SKG.2011.16","url":null,"abstract":"Metaphor is the result of human mind conceptualizing the world. In many previous studies about metaphor, space and time are thought to be the two most fundamental concepts in cognition, by which other concepts are constructed. Nevertheless, discussion of the metaphoric structuring of time in natural language is rare, not to mention the time concept in Chinese. This paper aims to evaluate whether the concept of time in Chinese is metaphorically structured, thus in turn, trying to discover the means adopted by Chinese people to understand SHIJIAN.","PeriodicalId":184788,"journal":{"name":"2011 Seventh International Conference on Semantics, Knowledge and Grids","volume":" 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120825936","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}
Activity instance oriented handling is a new means for vertical optimization of process cases. Unlike our previous batch processing mechanism in workflows, it focuses on the data characteristics of activity instances and utilizes explicit knowledge for planning. This paper introduces its concept and proposes activity instance pattern to model and represent the knowledge for execution optimization. A flexible and intelligent workflow enactment framework for activity instance oriented handling is also proposed and investigated.
{"title":"Activity Instance Oriented Handling to Support Run-Time Optimization of Process Cases","authors":"Yiping Wen, Zhigang Chen, Jianxun Liu","doi":"10.1109/SKG.2011.7","DOIUrl":"https://doi.org/10.1109/SKG.2011.7","url":null,"abstract":"Activity instance oriented handling is a new means for vertical optimization of process cases. Unlike our previous batch processing mechanism in workflows, it focuses on the data characteristics of activity instances and utilizes explicit knowledge for planning. This paper introduces its concept and proposes activity instance pattern to model and represent the knowledge for execution optimization. A flexible and intelligent workflow enactment framework for activity instance oriented handling is also proposed and investigated.","PeriodicalId":184788,"journal":{"name":"2011 Seventh International Conference on Semantics, Knowledge and Grids","volume":"10 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":"128202740","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}
Lin Li, Guandong Xu, Zhenglu Yang, Yanchun Zhang, M. Kitsuregawa
The task of topical classification of Web queries is to classify Web queries into a set of target categories. Machine learning based conventional approaches usually rely on external sources of information to obtain additional features for Web queries and training data for target categories. Unfortunately, these approaches are known to suffer from inability to adapt to different target categories which may be caused by the dynamic changes observed in both Web topic taxonomy and Web content. In this paper, we propose a feature-free flexible approach to topical classification of Web queries. Our approach analyzes queries and topical categories themselves and utilizes the number of Web pages containing both a query and a category to determine their similarity. The most attractive feature of our approach is that it only utilizes the Web page counts estimated by a search engine to provide the Web query classification with respectable accuracy. We conduct experimental study on the effectiveness of our approach using a set of rank measures and show that our approach performs competitively to some popular state-of-the-art solutions which, however, make frequent use of external sources and are inherently insufficient in flexibility.
{"title":"A Feature-Free Flexible Approach to Topical Classification of Web Queries","authors":"Lin Li, Guandong Xu, Zhenglu Yang, Yanchun Zhang, M. Kitsuregawa","doi":"10.1109/SKG.2011.23","DOIUrl":"https://doi.org/10.1109/SKG.2011.23","url":null,"abstract":"The task of topical classification of Web queries is to classify Web queries into a set of target categories. Machine learning based conventional approaches usually rely on external sources of information to obtain additional features for Web queries and training data for target categories. Unfortunately, these approaches are known to suffer from inability to adapt to different target categories which may be caused by the dynamic changes observed in both Web topic taxonomy and Web content. In this paper, we propose a feature-free flexible approach to topical classification of Web queries. Our approach analyzes queries and topical categories themselves and utilizes the number of Web pages containing both a query and a category to determine their similarity. The most attractive feature of our approach is that it only utilizes the Web page counts estimated by a search engine to provide the Web query classification with respectable accuracy. We conduct experimental study on the effectiveness of our approach using a set of rank measures and show that our approach performs competitively to some popular state-of-the-art solutions which, however, make frequent use of external sources and are inherently insufficient in flexibility.","PeriodicalId":184788,"journal":{"name":"2011 Seventh International Conference on Semantics, Knowledge and Grids","volume":"27 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":"125306397","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 Semantic Web (also known as Web of Data) is growing fast and becoming a decentralized knowledge platform for publishing and sharing information. The web ontologies promote the establishment of a shared understanding between data providers and data consumers, allowing for automated information processing and effective and efficient information retrieval. The majority of existing research efforts is focused around ontology engineering, ontology evaluation and ontology evolution. This work goes a step further and evaluates the ontology usage. In this paper, we present an Ontology USage Analysis Framework (OUSAF) and a set of metrics used to measure the ontology usage. The implementation of the proposed framework is illustrated using the example of Good Relations ontology (GRO). GRO has been well adopted by the semantic ecommerce community, and the OUSAF approach has been used to analyse GRO usage in the dataset comprised of RDF data collected from the web.
{"title":"Domain Ontology Usage Analysis Framework","authors":"Jamshaid Ashraf, M. Hadzic","doi":"10.1109/SKG.2011.33","DOIUrl":"https://doi.org/10.1109/SKG.2011.33","url":null,"abstract":"The Semantic Web (also known as Web of Data) is growing fast and becoming a decentralized knowledge platform for publishing and sharing information. The web ontologies promote the establishment of a shared understanding between data providers and data consumers, allowing for automated information processing and effective and efficient information retrieval. The majority of existing research efforts is focused around ontology engineering, ontology evaluation and ontology evolution. This work goes a step further and evaluates the ontology usage. In this paper, we present an Ontology USage Analysis Framework (OUSAF) and a set of metrics used to measure the ontology usage. The implementation of the proposed framework is illustrated using the example of Good Relations ontology (GRO). GRO has been well adopted by the semantic ecommerce community, and the OUSAF approach has been used to analyse GRO usage in the dataset comprised of RDF data collected from the web.","PeriodicalId":184788,"journal":{"name":"2011 Seventh International Conference on Semantics, Knowledge and Grids","volume":"23 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":"114761203","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 presents a method of how to produce a calculate and express spatial relations by a set of parameters. A new set of parameters more easily to understand and use is proposed based on two semantic meanings. Also the Voronoi diagram's application in neighbor relations is discussed. By using the new set of metric parameters, complex spatial and topological relations can be easily expressed. And these relations can be stored together with the original data now.
{"title":"Geographical Expression of Semantic Relations","authors":"Chengming Liang, Weifeng Lv, S. Ma","doi":"10.1109/SKG.2011.26","DOIUrl":"https://doi.org/10.1109/SKG.2011.26","url":null,"abstract":"This paper presents a method of how to produce a calculate and express spatial relations by a set of parameters. A new set of parameters more easily to understand and use is proposed based on two semantic meanings. Also the Voronoi diagram's application in neighbor relations is discussed. By using the new set of metric parameters, complex spatial and topological relations can be easily expressed. And these relations can be stored together with the original data now.","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":"124352376","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}
Relationships between entities in a Knowledge Base (KB) are not always explicitly expressed. In addition, entities may implicitly exist within explicit ones. These phenomena are very common when it comes to large-scale KBs. Finding implicit relationships in a KB can make the original KB more meaningful and enhance its potential in real world applications. In this paper, we focus on the problem of finding implicit-relationship networks in large-scale KBs. Since a network can be mathematically expressed as a matrix, the process of reasoning for implicit relationship finding can be transformed to matrix computation. Considering that there are many advantages for matrix computation instead of logic based and graph based reasoning (such as scalability for storing and processing relationships), by realizing the mathematical nature of KBs, we use matrix transformation and computation to investigate the problem of implicit relationship finding. We give several illustrative real world examples using large-scale KBs to validate this framework. In addition, we also investigate the potential problems of scalability on matrix storage, as well as the cost for computation and time. Based on the proposed approach and the consideration on the scalability issue, we develop the MIRF and MIRF-L algorithms which can efficiently process this kind of problem if the rules in concrete cases can be clearly expressed.
{"title":"A Matrix Approach to Implicit Relationship Finding in Large-Scale Knowledge Bases","authors":"Yan Wang, Yi Zeng, N. Zhong, Zhisheng Huang","doi":"10.1109/SKG.2011.34","DOIUrl":"https://doi.org/10.1109/SKG.2011.34","url":null,"abstract":"Relationships between entities in a Knowledge Base (KB) are not always explicitly expressed. In addition, entities may implicitly exist within explicit ones. These phenomena are very common when it comes to large-scale KBs. Finding implicit relationships in a KB can make the original KB more meaningful and enhance its potential in real world applications. In this paper, we focus on the problem of finding implicit-relationship networks in large-scale KBs. Since a network can be mathematically expressed as a matrix, the process of reasoning for implicit relationship finding can be transformed to matrix computation. Considering that there are many advantages for matrix computation instead of logic based and graph based reasoning (such as scalability for storing and processing relationships), by realizing the mathematical nature of KBs, we use matrix transformation and computation to investigate the problem of implicit relationship finding. We give several illustrative real world examples using large-scale KBs to validate this framework. In addition, we also investigate the potential problems of scalability on matrix storage, as well as the cost for computation and time. Based on the proposed approach and the consideration on the scalability issue, we develop the MIRF and MIRF-L algorithms which can efficiently process this kind of problem if the rules in concrete cases can be clearly expressed.","PeriodicalId":184788,"journal":{"name":"2011 Seventh International Conference on Semantics, Knowledge and Grids","volume":"30 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":"121440222","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}
Service Component Architecture specification (SCA) is an emerging and promising technology for the development, deployment and integration of Internet applications. This technology supports the management of dynamic availability and treats the heterogeneity between the components of distributed applications. However, this technology is not able to solve all problems. Currently, software systems are evolving. This factor makes development and maintenance of systems more complex than before. One solution to remedy this was the use of the Model Driven Engineering (MDE) approach in the development process. The aim of this paper is to apply an MDE automation type ensuring the passage from an UML 2.0 model to SCA model. To achieve this, we study two metamodels: the UML 2.0 component metamodel and the SCA meta-model. To ensure trace ability between these two meta-models, we have defined transformation rules in ATL language.
{"title":"ATL Transformation for the Generation of SCA Model","authors":"Soumaya Louhichi, Mohamed Graiet, Mourad Kmimech, Mohamed Tahar Bhiri, Walid Gaaloul, Eric Cariou","doi":"10.1109/SKG.2011.37","DOIUrl":"https://doi.org/10.1109/SKG.2011.37","url":null,"abstract":"Service Component Architecture specification (SCA) is an emerging and promising technology for the development, deployment and integration of Internet applications. This technology supports the management of dynamic availability and treats the heterogeneity between the components of distributed applications. However, this technology is not able to solve all problems. Currently, software systems are evolving. This factor makes development and maintenance of systems more complex than before. One solution to remedy this was the use of the Model Driven Engineering (MDE) approach in the development process. The aim of this paper is to apply an MDE automation type ensuring the passage from an UML 2.0 model to SCA model. To achieve this, we study two metamodels: the UML 2.0 component metamodel and the SCA meta-model. To ensure trace ability between these two meta-models, we have defined transformation rules in ATL language.","PeriodicalId":184788,"journal":{"name":"2011 Seventh International Conference on Semantics, Knowledge and Grids","volume":"59 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":"115688865","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
扫码关注我们
求助内容：
应助结果提醒方式：