The translation of inheritance nets to default logic has been discussed by Etherington[9],Touretzky[10],*** and inheritance nets are similar in some aspects and based on methods of translating inheritance nets to defa...
详细信息
The translation of inheritance nets to default logic has been discussed by Etherington[9],Touretzky[10],*** and inheritance nets are similar in some aspects and based on methods of translating inheritance nets to default logic,a translation of ontologies to default logic with a priority order on defaults is ***,properties of an ontology and the revision of ontologies can be studied in terms of default *** are assumed to be trees under the subsumption relation between concepts and have deduction rules to infer what are not explicitly *** statements in ontologies are translated to facts of default theories of the ontologies and the default inheritance of properties are represented by normal defaults with a priority order on them due to the intuition that subclasses overriding *** an ontology with a tree structure,it is consistent if and only if the default theory of the ontology has a unique extension.
WWW is a repository of information mainly oriented to human consumption. The lack of explicit and formal expression of data semantics makes the Web increasingly difficult to use and exploit. To remedy it, knowledge ma...
详细信息
WWW is a repository of information mainly oriented to human consumption. The lack of explicit and formal expression of data semantics makes the Web increasingly difficult to use and exploit. To remedy it, knowledge management sphere (KMSphere), taking advantages of semantic Web, Web services and virtual organizations, is proposed to explore important aspects of service-oriented and ontology-driven knowledge management on the grid. By building two kinds of mappings, ontologies construct a knowledge space on top of data repositories. KMSphere, based on OGSA, emphasizes how to organize, discover, utilize, and manage the knowledge resources in that space. This paper describes in detail the architecture of KMSphere.
The positive region in rough set framework and Shannon conditional entropy are two traditional uncertainty measurements, used usually as heuristic metrics in attribute reduction. In this paper first a new information ...
详细信息
The positive region in rough set framework and Shannon conditional entropy are two traditional uncertainty measurements, used usually as heuristic metrics in attribute reduction. In this paper first a new information entropy is systematically compared with Shannon entropy, which shows its competence of another new uncertainty measurement. Then given a decision system we theoretically analyze the variance of these three metrics under two reverse circumstances, Those are when condition (decision) granularities merge while decision (condition) granularities remain unchanged. The conditions that keep these measurements unchanged in the above different situations are also figured out. These results help us to give a new information view of attribute reduction and propose more clear understanding of the quantitative relations between these different views, defined by the above three uncertainty measurements. It shows that the requirement of reducing a condition attribute in new information view is more rigorous than the ones in the latter two views and these three views are equivalent in a consistent decision system.
As a suitable tool for analyzing concept interconnection formally, the theory of Formal Concept Analysis (FCA) is applied. FCA deals with formal mathematical tools and techniques to develop and analyze relationship be...
详细信息
As a suitable tool for analyzing concept interconnection formally, the theory of Formal Concept Analysis (FCA) is applied. FCA deals with formal mathematical tools and techniques to develop and analyze relationship between concepts and to develop concept structures, and concepts are important building blocks in the concept-interconnection. This paper mainly discusses how FCA can be used to support concept-interconnection analysis from an application point of view. In order to introduce our idea, two kinds of concept-interconnection and interconnection measure in detail are discussed. One is based on Concept-Backbone and the other is based on the attributes. It is seen that FCA can support the building of concept-interconnection as a learning technique, but the established concept-interconnection also can be analyzed by using techniques of FCA.
Plenty of structured data existing on the grid need to be managed by databases, but there is little work available on grid-enabled databases. Two problems lie in current research: the first is the deficiency of a unif...
详细信息
ISBN:
(纸本)184000025
Plenty of structured data existing on the grid need to be managed by databases, but there is little work available on grid-enabled databases. Two problems lie in current research: the first is the deficiency of a uniform management and access method to various kinds of databases; the second is that query efficiency decreases rapidly with the increase of the amount of data records. Metadata plays a critical role in grid databases integration, so a layered metadata model is put forward which comprises information of data storage, data properties and relations between data objects. Through the metadata model, the distributed, heterogeneous data resources can be accessed uniformly and efficiently. At last an example of hospital information database system proves the validity and feasibility of our model.
An efficient robust watermarking scheme for digital images is presented, based on the discrete Gabor transforms (DGT), The watermark in digital images is hidden by changing their DGT coefficients to represent special ...
详细信息
An efficient robust watermarking scheme for digital images is presented, based on the discrete Gabor transforms (DGT), The watermark in digital images is hidden by changing their DGT coefficients to represent special low frequencies. In the proposed watermark-checking algorithm, the geometric transforms and corresponding matching method are applied for geometric transformed images in order to recover them for watermark-checking. The proposed scheme was tested by StirMark 4.0, a well-known software for testing watermarking schemes, and it performed successfully in almost all testing cases with high robustness and efficiency.
Based on fuzzy association degree, a new pattern recognition algorithm is set up. First, some new concepts of fuzzy association coefficient (FAC), fuzzy association degree (FAD) and fuzzy relative weight (FRW) have be...
详细信息
Based on fuzzy association degree, a new pattern recognition algorithm is set up. First, some new concepts of fuzzy association coefficient (FAC), fuzzy association degree (FAD) and fuzzy relative weight (FRW) have been proposed for surveying data information. Second, on the basis of the concepts proposed here, a new pattern recognition algorithm has been set up. At last, the algorithm set up here is applied to surveying data. The results of simulation application show that the recognition algorithm presented here is feasible and effective
The key issue of peer data management systems (PDMSs) is how to efficiently organize and manage distributed resources in P2P networks to accurately route queries from the peer initiating the query to appropriate peers...
详细信息
The key issue of peer data management systems (PDMSs) is how to efficiently organize and manage distributed resources in P2P networks to accurately route queries from the peer initiating the query to appropriate peers to avoid network flooding. This paper proposes a semantic-based PDMS model, called R-Chord, by deploying the resource space model above the Chord overlay for uniformly, normally and effectively organizing and managing resources distributed in P2P networks. Experiments show that, compared to the Chord model, the R-Chord model is more flexible to support semantic-based queries and can significantly decrease the average visiting number of and visiting times on peers for answering queries.
Gait is an identifying biometric feature. In recent years, Video-based gait recognition is becoming a new challenging problem in the field of computer vision. In this paper, wavelet reflective symmetry moments (WRSMs)...
详细信息
Gait is an identifying biometric feature. In recent years, Video-based gait recognition is becoming a new challenging problem in the field of computer vision. In this paper, wavelet reflective symmetry moments (WRSMs) have been proposed to describe and recognize gait automatically. WRSMs represent the appearance of people with merits of moments and wavelet analysis and reflect people's symmetrical walking habit. Moments have translation, scale and rotation invariant characteristics;while wavelet analysis is able to extract the multi-resolution features subtly and deal with noise. So combination of wavelet moments and reflective symmetry not only has characteristics of moments and wavelet analysis, but also is in accordance with one of the relative results in psychological researches which state that gait is a type of symmetrical model. Experiments based on USF's database have shown that the application of wavelet reflective symmetry moments in gait recognition leads to relatively high distinguishability of gait with effective noise handling.
暂无评论