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.
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
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.
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.
Efficient VLSI architectures for multi-dimensional (m-D) discrete wavelet transform (DWT), e.g. m=2, 3, are presented, in which the lifting scheme of DWT is used to reduce efficiently hardware complexity. The parallel...
详细信息
Efficient VLSI architectures for multi-dimensional (m-D) discrete wavelet transform (DWT), e.g. m=2, 3, are presented, in which the lifting scheme of DWT is used to reduce efficiently hardware complexity. The parallelism of 2 m subbands transforms in lifting-based m-D DWT is explored, which increases efficiently the throughput rate of separable m-D DWT. The proposed architecture is composed of m2m-1 1-D DWT modules working in parallel and pipelined, which is designed to process 2m input samples per clock cycle, and generate 2m subbands coefficients synchronously. The total time of computing one level of decomposition for a 2-D image (3-D image sequence) of size N2 (MN2) is approximately N2/4 (MN2/8) intra- clock cycles (ccs). An efficient line-based architecture framework for both 2D+t and t+2D 3-D DWT is first proposed. Compared with the similar works reported in previous literature, the proposed architecture has good performance in terms of production of computation time and hardware cost. The proposed architecture is simple, regular, scalable and well suited for VLSI implementation.
A formal representation of ontologies is proposed, based on F-logic and O-logic; and the works in the building of ontologies in NKI. An ontology includes class frames, slot frames, class-slot frames, object frames and...
详细信息
A formal representation of ontologies is proposed, based on F-logic and O-logic; and the works in the building of ontologies in NKI. An ontology includes class frames, slot frames, class-slot frames, object frames and axioms. The value restrictions of slots are defined in slot frames. For each slot and each class, there is a class-slot frame representing the specific value restrictions of the slot when defining the class; and the relations between class-slot frames and slot frames are discussed. For a slot in a class frame, its values are inherited to its subclasses without blocking; and its default values are inherited to its subclasses taking overriding, revising and conflict resolution into account. After giving the formal representation of ontologies, the semantics of ontologies are discussed, and main results are presented.
Semi-G2 basis functions are introduced, the degree of which is larger than three. These basis functions are expressed explicitly via matrices decomposition. Based on them, equations for constructing G2 splines can be ...
详细信息
Semi-G2 basis functions are introduced, the degree of which is larger than three. These basis functions are expressed explicitly via matrices decomposition. Based on them, equations for constructing G2 splines can be presented independently of geometric shape parameters' values. It makes the equation's solving easier. Analysis shows that this method may be extended to be applicable for constructing Gn splines.
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.
暂无评论