The label“posthumanism”identifies neither a doctrine,nor an intellectual or analytical approach with a defining set of protocols.Rather,we may take“posthumanism”as a term loosely applied to a range of contribution...The label“posthumanism”identifies neither a doctrine,nor an intellectual or analytical approach with a defining set of protocols.Rather,we may take“posthumanism”as a term loosely applied to a range of contributions and approaches,on the basis of a generally under-specified collection of sympathies and commitments.Approximately stated,these sympathies and commitments would entail the claim that—with due allowance for historical variation—the category of“the human”has long played a key role at the centre of Western thought;that this role has included serving to justify the promotion of human beings above other forms of being,and indeed within this,over its history,the violent oppression of the great majority of human beings themselves;and that,in league with the effects of various recent technological developments,it is therefore important to decentre,relativize,critique,and perhaps even move beyond“the human”.In this article,I will accordingly not look to define the term“posthumanism”:rather,I will present some of the background to and influences on the range of contributions and approaches that have come to be assembled under this label;delineate two principles which may be discerned within these contributions and approaches;and consider some of the critiques which these“posthumanist”interventions have attracted.Ultimately,I will argue that the label itself matters less than the impulses behind the contributions it has come to identify.展开更多
In order to reduce the costs of the ontology construction, a general ontology learning framework (GOLF) is developed. The key technologies of the GOLF including domain concepts extraction and semantic relationships ...In order to reduce the costs of the ontology construction, a general ontology learning framework (GOLF) is developed. The key technologies of the GOLF including domain concepts extraction and semantic relationships between concepts and taxonomy automatic construction are proposed. At the same time ontology evaluation methods are also discussed. The experimental results show that this method produces better performance and it is applicable across different domains. By integrating several machine learning algorithms, this method suffers less ambiguity and can identify domain concepts and relations more accurately. By using generalized corpus WordNet and HowNet, this method is applicable across different domains. In addition, by obtaining source documents from the web on demand, the GOLF can produce up-to-date ontologies.展开更多
To enable representation and reasoning for fuzzy ontologies with expressive fuzzy knowledge on the semantic web, a new fuzzy extension of description logics called the fuzzy description logics with comparison expressi...To enable representation and reasoning for fuzzy ontologies with expressive fuzzy knowledge on the semantic web, a new fuzzy extension of description logics called the fuzzy description logics with comparison expressions (FCDLs) is presented. The syntax and semantics of FCDLs are formally defined, and the forms of axioms and assertions in FCDLs knowledge bases are specified. FCDLs combine both fuzzy concepts from the fuzzy description logics (FDLs) and cut concepts from the extended fuzzy description logics (EFDLs) in the same theory. Furthermore, cut concepts are extended into comparison cut concepts in FCDLs to represent comparison expressions between fuzzy membership degrees, which are often used in practice but not supported by the other fuzzy extensions of description logics. FCDLs have more expressive power than FDLs and EFDLs, and are able to represent expressive fuzzy knowledge and to perform reasoning tasks based on them. Therefore, FCDLs can enable representation and reasoning for fuzzy ontologies with expressive fuzzy knowledge on the semantic web.展开更多
A semantic analysis approach is proposed, by which semantic relationships between concepts are identified and defined, and then mapped or transformed to OWL (web ontology language) ontology. The most common abstract...A semantic analysis approach is proposed, by which semantic relationships between concepts are identified and defined, and then mapped or transformed to OWL (web ontology language) ontology. The most common abstractions (namely, inclusion, aggregation and association) and their implication in ontology are discussed; then the OWL implementation for three abstractions are analyzed and illustrated. Taxonomies, constraints on properties for each class, and the relations between taxonomies in OWL ontology are established after all the semantic relationships are identified and described. This research is the basis for the development of the ontology conceptual model (OCM) and the mapping from OCM to OWL ontology.展开更多
Services discovery based on syntactic matching cannot adapt to the open and dynamic environment of the web. To select the proper one from the web services candidate set provided by syntactic matching, a service select...Services discovery based on syntactic matching cannot adapt to the open and dynamic environment of the web. To select the proper one from the web services candidate set provided by syntactic matching, a service selection method based on semantic similarity is proposed. First, this method defines a web services ontology including QoS and context as semantic supporting, which also provides a set of terms to describe the interfaces of web services. Secondly, the similarity degree of two web services is evaluated by computing the semantic distances of those terms used to describe interfaces. Compared with existing methods, interfaces of web services can be interpreted under ontology, because it provides a formal and semantic specification of conceptualization. Meanwhile, efficiency and accuracy of services selection are improved.展开更多
In order to achieve adaptive and efficient service composition, a task-oriented algorithm for discovering services is proposed. The traditional process of service composition is divided into semantic discovery and fun...In order to achieve adaptive and efficient service composition, a task-oriented algorithm for discovering services is proposed. The traditional process of service composition is divided into semantic discovery and functional matching and makes tasks be operation objects. Semantic similarity is used to discover services matching a specific task and then generate a corresponding task-oriented web service composition (TWC) graph. Moreover, an algorithm for the new service is designed to update the TWC. The approach is applied to the composition model, in which the TWC is searched to obtain an optimal path and the final service composition is output. Also, the model can implement realtime updating with changing environments. Experimental results demonstrate the feasibility and effectiveness of the algorithm and indicate that the maximum searching radius can be set to 2 to achieve an equilibrium point of quality and quantity.展开更多
In order to solve the problem of information retrieval on the semantic web, a new semantic information retrieval (SIR) model for searching ontologies on the semantic web is proposed. First, SIR transformed domain on...In order to solve the problem of information retrieval on the semantic web, a new semantic information retrieval (SIR) model for searching ontologies on the semantic web is proposed. First, SIR transformed domain ontologies into global ontologies. Then semantic index terms were extracted from these global ontologies. Based on semantic index terms, logical inferences can be performed and the logical views of the concept can be obtained. These logical views represent the expanded meaning of the concept. Using logical views, SIR can perform the information retrieval and inferences based on the semantic relationships in the documents, not only on the syntactic analysis of the documents. SIR can significantly enhance the recall and precision of the information retrieval by the semantic inference. Finally, the practicability of the SIR model is analyzed.展开更多
A new algorithm for automated ontology mapping based on linguistic similarity and structure similarity is presented. First, the concept of WordNet is turned into a vector, then the similarity of two entities is calcul...A new algorithm for automated ontology mapping based on linguistic similarity and structure similarity is presented. First, the concept of WordNet is turned into a vector, then the similarity of two entities is calculated according to the cosine of the angle between the corresponding vectors. Secondly, based on the linguistic similarity, a weighted function and a sigmoid function can be used to combine the linguistic similarity and structure similarity to compute the similarity of an ontology. Experimental results show that the matching ratio can reach 63% to 70% and it can effectively accomplish the mapping between ontologies.展开更多
A Kullback-Leibler(KL)distance based algorithm is presented to find the matches between concepts from different ontologies. First, each concept is represented as a specific probability distribution which is estimate...A Kullback-Leibler(KL)distance based algorithm is presented to find the matches between concepts from different ontologies. First, each concept is represented as a specific probability distribution which is estimated from its own instances. Then, the similarity of two concepts from different ontologies is measured by the KL distance between the corresponding distributions. Finally, the concept-mapping relationship between different ontologies is obtained. Compared with other traditional instance-based algorithms, the computing complexity of the proposed algorithm is largely reduced. Moreover, because it proposes different estimation and smoothing methods of the concept distribution for different data types, it is suitable for various concepts mapping with different data types. The experimental results on real-world ontology mapping illustrate the effectiveness of the proposed algorithm.展开更多
To integrate reasoning and text retrieval, the architecture of a semantic search engine which includes several kinds of queries is proposed, and the semantic search engine Smartch is designed and implemented. Based on...To integrate reasoning and text retrieval, the architecture of a semantic search engine which includes several kinds of queries is proposed, and the semantic search engine Smartch is designed and implemented. Based on a logical reasoning process and a graphic user-defined process, Smartch provides four kinds of search services. They are basic search, concept search, graphic user-defined query and association relationship search. The experimental results show that compared with the traditional search engine, the recall and precision of Smartch are improved. Graphic user-defined queries can accurately locate the information of user needs. Association relationship search can find complicated relationships between concepts. Smartch can perform some intelligent functions based on ontology inference.展开更多
To alleviate the amount of work involved in constructing a domain ontology, starting with the base of an existing terminological-rich thesaurus is better than starting from scratch. With a case study of reengineering ...To alleviate the amount of work involved in constructing a domain ontology, starting with the base of an existing terminological-rich thesaurus is better than starting from scratch. With a case study of reengineering the Defense Science and Technology Thesaurus into a prototype military aircraft ontology, a four-phase thesaurus-based methodology is introduced and investigated, which consists of identifying the application purpose, overall design, designing in detail and evaluation. Designing in detail is the core step, converting the terms and semantic relationships of the thesaurus into an ontology and supplementing richer semantic relationships. The resulting prototype ontology includes 87 concepts and 34 relationships, and can be extended and scaled up to a full-fledged domain ontology in the future. Eight universal genres of relationships of this ontology are preliminarily summarized and analyzed, including equivalent relationships, approximate relationships, generic/abstract relationships, part/whole relationships, cause/effect relationships, entity/location relationships etc., and the normalization of semantic relationships is critical to the merging and reusing of follow-up multiple ontologies.展开更多
In order to solve the problem of semantic heterogeneity in information integration, an ontology based semantic information integration (OSII) model and its logical framework are proposed. The OSII adopts the hybrid ...In order to solve the problem of semantic heterogeneity in information integration, an ontology based semantic information integration (OSII) model and its logical framework are proposed. The OSII adopts the hybrid ontology approach and uses OWL (web ontology language) as the ontology language. It obtains unified views from multiple sources by building mappings between local ontologies and the global ontology. A tree- based multi-strategy ontology mapping algorithm is proposed. The algorithm is achieved by the following four steps: pre-processing, name mapping, subtree mapping and remedy mapping. The advantages of this algorithm are: mapping in the compatible datatype categories and using heuristic rules can improve mapping efficiency; both linguistic and structural similarity are used to improve the accuracy of the similarity calculation; an iterative remedy is adopted to obtain correct and complete mappings. A challenging example is used to illustrate the validity of the algorithm. The OSII is realized to effectively solve the problem of semantic heterogeneity in information integration and to implement interoperability of multiple information sources.展开更多
An association rules mining method based on semantic relativity is proposed to solve the problem that there are more candidate item sets and higher time complexity in traditional association rules mining.Semantic rela...An association rules mining method based on semantic relativity is proposed to solve the problem that there are more candidate item sets and higher time complexity in traditional association rules mining.Semantic relativity of ontology concepts is used to describe complicated relationships of domains in the method.Candidate item sets with less semantic relativity are filtered to reduce the number of candidate item sets in association rules mining.An ontology hierarchy relationship is regarded as a directed acyclic graph rather than a hierarchy tree in the semantic relativity computation.Not only direct hierarchy relationships,but also non-direct hierarchy relationships and other typical semantic relationships are taken into account.Experimental results show that the proposed method can reduce the number of candidate item sets effectively and improve the efficiency of association rules mining.展开更多
文摘The label“posthumanism”identifies neither a doctrine,nor an intellectual or analytical approach with a defining set of protocols.Rather,we may take“posthumanism”as a term loosely applied to a range of contributions and approaches,on the basis of a generally under-specified collection of sympathies and commitments.Approximately stated,these sympathies and commitments would entail the claim that—with due allowance for historical variation—the category of“the human”has long played a key role at the centre of Western thought;that this role has included serving to justify the promotion of human beings above other forms of being,and indeed within this,over its history,the violent oppression of the great majority of human beings themselves;and that,in league with the effects of various recent technological developments,it is therefore important to decentre,relativize,critique,and perhaps even move beyond“the human”.In this article,I will accordingly not look to define the term“posthumanism”:rather,I will present some of the background to and influences on the range of contributions and approaches that have come to be assembled under this label;delineate two principles which may be discerned within these contributions and approaches;and consider some of the critiques which these“posthumanist”interventions have attracted.Ultimately,I will argue that the label itself matters less than the impulses behind the contributions it has come to identify.
基金The National Basic Research Program of China(973Program)(No.2003CB317000),the Natural Science Foundation of Zhejiang Province (No.Y105625).
文摘In order to reduce the costs of the ontology construction, a general ontology learning framework (GOLF) is developed. The key technologies of the GOLF including domain concepts extraction and semantic relationships between concepts and taxonomy automatic construction are proposed. At the same time ontology evaluation methods are also discussed. The experimental results show that this method produces better performance and it is applicable across different domains. By integrating several machine learning algorithms, this method suffers less ambiguity and can identify domain concepts and relations more accurately. By using generalized corpus WordNet and HowNet, this method is applicable across different domains. In addition, by obtaining source documents from the web on demand, the GOLF can produce up-to-date ontologies.
基金The National Natural Science Foundation of China(No.60373066,60425206,90412003),the National Basic Research Pro-gram of China (973Program)(No.2002CB312000),the Innovation Plan for Jiangsu High School Graduate Student, the High TechnologyResearch Project of Jiangsu Province (No.BG2005032), and the Weap-onry Equipment Foundation of PLA Equipment Ministry ( No.51406020105JB8103).
文摘To enable representation and reasoning for fuzzy ontologies with expressive fuzzy knowledge on the semantic web, a new fuzzy extension of description logics called the fuzzy description logics with comparison expressions (FCDLs) is presented. The syntax and semantics of FCDLs are formally defined, and the forms of axioms and assertions in FCDLs knowledge bases are specified. FCDLs combine both fuzzy concepts from the fuzzy description logics (FDLs) and cut concepts from the extended fuzzy description logics (EFDLs) in the same theory. Furthermore, cut concepts are extended into comparison cut concepts in FCDLs to represent comparison expressions between fuzzy membership degrees, which are often used in practice but not supported by the other fuzzy extensions of description logics. FCDLs have more expressive power than FDLs and EFDLs, and are able to represent expressive fuzzy knowledge and to perform reasoning tasks based on them. Therefore, FCDLs can enable representation and reasoning for fuzzy ontologies with expressive fuzzy knowledge on the semantic web.
基金The Natural Science Foundation of Hubei Province(No.2004ABA040).
文摘A semantic analysis approach is proposed, by which semantic relationships between concepts are identified and defined, and then mapped or transformed to OWL (web ontology language) ontology. The most common abstractions (namely, inclusion, aggregation and association) and their implication in ontology are discussed; then the OWL implementation for three abstractions are analyzed and illustrated. Taxonomies, constraints on properties for each class, and the relations between taxonomies in OWL ontology are established after all the semantic relationships are identified and described. This research is the basis for the development of the ontology conceptual model (OCM) and the mapping from OCM to OWL ontology.
基金The National Natural Science Foundation of China(No.70471090,70472005),the Natural Science Foundation of Jiangsu Province(No.BK2004052,BK2005046).
文摘Services discovery based on syntactic matching cannot adapt to the open and dynamic environment of the web. To select the proper one from the web services candidate set provided by syntactic matching, a service selection method based on semantic similarity is proposed. First, this method defines a web services ontology including QoS and context as semantic supporting, which also provides a set of terms to describe the interfaces of web services. Secondly, the similarity degree of two web services is evaluated by computing the semantic distances of those terms used to describe interfaces. Compared with existing methods, interfaces of web services can be interpreted under ontology, because it provides a formal and semantic specification of conceptualization. Meanwhile, efficiency and accuracy of services selection are improved.
基金The National Key Technology R&D Program of Chinaduring the 11th Five-Year Plan Period(No2007BAF23B0302)the Major Research Plan of the National Natural Science Foundation of China(No90818028)
文摘In order to achieve adaptive and efficient service composition, a task-oriented algorithm for discovering services is proposed. The traditional process of service composition is divided into semantic discovery and functional matching and makes tasks be operation objects. Semantic similarity is used to discover services matching a specific task and then generate a corresponding task-oriented web service composition (TWC) graph. Moreover, an algorithm for the new service is designed to update the TWC. The approach is applied to the composition model, in which the TWC is searched to obtain an optimal path and the final service composition is output. Also, the model can implement realtime updating with changing environments. Experimental results demonstrate the feasibility and effectiveness of the algorithm and indicate that the maximum searching radius can be set to 2 to achieve an equilibrium point of quality and quantity.
基金The National Natural Science Foundation of China (No.60273072),the National High Technology Research and Development Program of China (863Program)(No.2002AA423450).
文摘In order to solve the problem of information retrieval on the semantic web, a new semantic information retrieval (SIR) model for searching ontologies on the semantic web is proposed. First, SIR transformed domain ontologies into global ontologies. Then semantic index terms were extracted from these global ontologies. Based on semantic index terms, logical inferences can be performed and the logical views of the concept can be obtained. These logical views represent the expanded meaning of the concept. Using logical views, SIR can perform the information retrieval and inferences based on the semantic relationships in the documents, not only on the syntactic analysis of the documents. SIR can significantly enhance the recall and precision of the information retrieval by the semantic inference. Finally, the practicability of the SIR model is analyzed.
基金The High Technology Research and Development Program of Jiangsu Province (No.BG2004034).
文摘A new algorithm for automated ontology mapping based on linguistic similarity and structure similarity is presented. First, the concept of WordNet is turned into a vector, then the similarity of two entities is calculated according to the cosine of the angle between the corresponding vectors. Secondly, based on the linguistic similarity, a weighted function and a sigmoid function can be used to combine the linguistic similarity and structure similarity to compute the similarity of an ontology. Experimental results show that the matching ratio can reach 63% to 70% and it can effectively accomplish the mapping between ontologies.
文摘A Kullback-Leibler(KL)distance based algorithm is presented to find the matches between concepts from different ontologies. First, each concept is represented as a specific probability distribution which is estimated from its own instances. Then, the similarity of two concepts from different ontologies is measured by the KL distance between the corresponding distributions. Finally, the concept-mapping relationship between different ontologies is obtained. Compared with other traditional instance-based algorithms, the computing complexity of the proposed algorithm is largely reduced. Moreover, because it proposes different estimation and smoothing methods of the concept distribution for different data types, it is suitable for various concepts mapping with different data types. The experimental results on real-world ontology mapping illustrate the effectiveness of the proposed algorithm.
基金The National Natural Science Foundation of China(No60403027)
文摘To integrate reasoning and text retrieval, the architecture of a semantic search engine which includes several kinds of queries is proposed, and the semantic search engine Smartch is designed and implemented. Based on a logical reasoning process and a graphic user-defined process, Smartch provides four kinds of search services. They are basic search, concept search, graphic user-defined query and association relationship search. The experimental results show that compared with the traditional search engine, the recall and precision of Smartch are improved. Graphic user-defined queries can accurately locate the information of user needs. Association relationship search can find complicated relationships between concepts. Smartch can perform some intelligent functions based on ontology inference.
文摘To alleviate the amount of work involved in constructing a domain ontology, starting with the base of an existing terminological-rich thesaurus is better than starting from scratch. With a case study of reengineering the Defense Science and Technology Thesaurus into a prototype military aircraft ontology, a four-phase thesaurus-based methodology is introduced and investigated, which consists of identifying the application purpose, overall design, designing in detail and evaluation. Designing in detail is the core step, converting the terms and semantic relationships of the thesaurus into an ontology and supplementing richer semantic relationships. The resulting prototype ontology includes 87 concepts and 34 relationships, and can be extended and scaled up to a full-fledged domain ontology in the future. Eight universal genres of relationships of this ontology are preliminarily summarized and analyzed, including equivalent relationships, approximate relationships, generic/abstract relationships, part/whole relationships, cause/effect relationships, entity/location relationships etc., and the normalization of semantic relationships is critical to the merging and reusing of follow-up multiple ontologies.
文摘In order to solve the problem of semantic heterogeneity in information integration, an ontology based semantic information integration (OSII) model and its logical framework are proposed. The OSII adopts the hybrid ontology approach and uses OWL (web ontology language) as the ontology language. It obtains unified views from multiple sources by building mappings between local ontologies and the global ontology. A tree- based multi-strategy ontology mapping algorithm is proposed. The algorithm is achieved by the following four steps: pre-processing, name mapping, subtree mapping and remedy mapping. The advantages of this algorithm are: mapping in the compatible datatype categories and using heuristic rules can improve mapping efficiency; both linguistic and structural similarity are used to improve the accuracy of the similarity calculation; an iterative remedy is adopted to obtain correct and complete mappings. A challenging example is used to illustrate the validity of the algorithm. The OSII is realized to effectively solve the problem of semantic heterogeneity in information integration and to implement interoperability of multiple information sources.
基金The National Natural Science Foundation of China(No.50674086)Specialized Research Fund for the Doctoral Program of Higher Education(No.20060290508)the Science and Technology Fund of China University of Mining and Technology(No.2007B016)
文摘An association rules mining method based on semantic relativity is proposed to solve the problem that there are more candidate item sets and higher time complexity in traditional association rules mining.Semantic relativity of ontology concepts is used to describe complicated relationships of domains in the method.Candidate item sets with less semantic relativity are filtered to reduce the number of candidate item sets in association rules mining.An ontology hierarchy relationship is regarded as a directed acyclic graph rather than a hierarchy tree in the semantic relativity computation.Not only direct hierarchy relationships,but also non-direct hierarchy relationships and other typical semantic relationships are taken into account.Experimental results show that the proposed method can reduce the number of candidate item sets effectively and improve the efficiency of association rules mining.