In this paper, we give the p-adic measures of algebraic independence for the values of Ramanujan functions and Klein modular functions at algebraic points.
In this paper, we give the p-adic measures of algebraic independence for the values of Ramanujan functions and Klein modular functions at algebraic points.
Protection of users' privacy has been a central issue for location-based services (LBSs). In this paper, we classify two kinds of privacy protection requirements in LBS: location anonymity and identifier anonymity...
详细信息
We study the problem of answering queries given a set of mappings between peer ontologies. In addition to the schema mapping between peer ontologies, there are axioms to give constraints to classes and properties. We ...
详细信息
On-chip communication architectures can have a great influence on the speed and area of System-on-Chip (SOC) designs. A new chip design paradigm called Network-on-Chip (NOC) offers a promising architectural choice for...
详细信息
Activity-based personalized eLearning involves delivering to a learner a learning experience that is tailored to their individual needs. Traditionally, these needs have been met through the personalized selection of c...
详细信息
Activity-based personalized eLearning involves delivering to a learner a learning experience that is tailored to their individual needs. Traditionally, these needs have been met through the personalized selection of content that fits the learner's preferences. However, by coupling this approach with the possibilities of interactive services a more engaging form of personalized education may be realized. This paper describes the design principles for producing activity-based personalized distance learning offerings.
The use of formal knowledge representation structures, or ontologies, has found immense applicability for the interoperability of software systems, e.g., alignment of software and business process models. Toward the m...
详细信息
The use of formal knowledge representation structures, or ontologies, has found immense applicability for the interoperability of software systems, e.g., alignment of software and business process models. Toward the management of such knowledge structures, an important foundational problem is that of ontology reuse - it is uncommon for new applications or for different components within one application to use an already available ontology in its entirety. Depending on component specific requirements, typical re-usages are restricted to refined versions of an existing ontology, with the refinement taking the form of a contraction of the knowledge contained therein. Furthermore, when the ontology is used to ascribe meaning to independently existing 'resources' (e.g., documents collections, source code, software manuals, process template repositories) by way of meta-data, there exists a direct mapping between different views/re-uses of an ontology and their respective semantic scopes within an annotated resource repository thereby leading to the concept of view/reuse dependent resource retrieval. We implement a framework that supports ontology reuse by way of a requirement driven sub-ontology extraction methodology. Additionally, based on this concept of a sub-ontology, we implement the idea of a user/component 'requirement profile' consisting of semantic descriptions of the user's interest within a 'resource repository' that has been annotated with semantic types from the ontology under consideration. A generic framework that implements these ideas and its application in the domains of medical information retrieval systems and business process management systems (BPMS) is presented.
This paper is devoted to the discussion of transitive uncertainty mapping in general approximation space. It is proved that the best low-approximation mapping exist if the uncertainty mapping is transitive. Furthermor...
详细信息
In this paper, we take into account the set of all cutting plans in a special cutting problem. Being given proper partial order, the set of all cutting plans forms an ideal of a chain-product. We get a strategy of fin...
详细信息
In this paper, we take into account the set of all cutting plans in a special cutting problem. Being given proper partial order, the set of all cutting plans forms an ideal of a chain-product. We get a strategy of finding maximal cutting plans by Boundary algorithm which proposes a general method of finding all maximal elements of an ideal. In this paper, we do not care about the process of getting cutting plans, but which cutting plan is maximal and the strategy of how to find the maximum.
Edge detection based on multiscale wavelet transform is one of the important algorithms in images edge detection. In Large scale it is strongly anti-noise, and in small one it can accurately locate edge based on wavel...
详细信息
Edge detection based on multiscale wavelet transform is one of the important algorithms in images edge detection. In Large scale it is strongly anti-noise, and in small one it can accurately locate edge based on wavelet transform. In order to give attention to both, an edge detection method was developed using finite element method (FEM) edge fusion. Firstly, the effective edge envelope of different edge models based on compact symmetry and smooth function were discussed. Secondly, in the range of effective envelope of different edge model, a new edge detection, that was FEM edge fusion, was adopted for edge detection. In theory, the algorithm is superset of the classical image fusion one. The validly of the algorithm is proved by experiment for artificial and real images.
A new chip design paradigm called Network-on-Chip (NOC) offers a promising architectural choice for future SOC (System-on-Chip). Triple-based Hierarchical Interconnection Network (THIN) was proposed that aims to decre...
详细信息
A new chip design paradigm called Network-on-Chip (NOC) offers a promising architectural choice for future SOC (System-on-Chip). Triple-based Hierarchical Interconnection Network (THIN) was proposed that aims to decrease the node degree, reduce the links and shorten the diameter. The topology of THIN is very simple and it has obviously hierarchical, symmetric and scalable characteristic. In this paper, the network properties and zero-load latency are studied and compared with 2-D mesh. The compare results show that THIN is a better candidate for constructing the NOC than 2-D Mesh, when there are not too many nodes.
暂无评论