This paper presents a reference framework, called BUD, to manage a large shared bank of unstructured data. This paper lists several important issues on managing or maintaining the unstructured data in BUD. BUD stores ...
详细信息
in this paper, we analyse the data access characteristics of a typical XML information retrieval system and propose a new query aware buffer replacement algorithm based on prediction of Minimum Reuse Distance (MRD for...
详细信息
Internetware can be formed through aggregation of Internetware entities bottom-up to satisfy the user's requirements. In the process, capability description of Internetware entity plays an important role. This pap...
详细信息
Internetware can be formed through aggregation of Internetware entities bottom-up to satisfy the user's requirements. In the process, capability description of Internetware entity plays an important role. This paper proposes a capability description of Internetware entity based on environment ontology. The environment ontology includes environment entities and possible interactions with the environment entities in a particular domain. Tree-like hierarchical state machines are also included in the ontology to describe domain life-cycle of the environment entities. On the basis of the ideas, the capability of Internetware entity is embodied by interacting with environment entities and the changes of the environment entities during the interactions. Finally, this paper describes the matchmaking between capability descriptions of Internetware entities to support the discovery of Internetware entity. An example of online education course is given to illustrate the ideas.
This paper presents a reference framework, called BUD, to manage a large shared bank of unstructured data. This paper lists several important issues on managing or maintaining the unstructured data in BUD. BUD stores ...
详细信息
This paper presents a reference framework, called BUD, to manage a large shared bank of unstructured data. This paper lists several important issues on managing or maintaining the unstructured data in BUD. BUD stores and manages the ever-growing unstructured data by introducing a novel technique called free-table, which is a conceptual view for end-users and a physical entity maintained by transactional storage manager of BUD. Free-table is cell-oriented but not column-oriented as relational table. It can store various types of unstructured data in cell with different versions. Additionally, we study two cases, VMP and PXRDB, to show that our proposal is feasible and tractable.
XML Retrieval is becoming the focus study of the field of Information Retrieval and database. Summarization of the results which come from the XML search engines will alleviate the read burden of user's. However, ...
详细信息
knowledge management (KM) technologies and applications are fundamental to the success of KM programs. This paper aims to find out linkages between newly-developed KM theories and various technologies and their releva...
详细信息
In this paper, we address the interference and power constrained broadcast/multicast routing problem (D-IPCB/M) in wireless ad hoc networks using directional antenna as a starting point, which jointly considers low-in...
详细信息
Web applications become more and more important, and the corresponding security problems have been concerned about. This paper presents TASA, an ASP static analyzer, which employs a path-sensitive, inter-procedural an...
详细信息
Numerous algorithms on geometric networks has been studied, and most of them were based on 2-dimensional networks. But 2-dimensional geometric routing algorithms cannot be directly adapted to the 3-dimensional network...
详细信息
Numerous algorithms on geometric networks has been studied, and most of them were based on 2-dimensional networks. But 2-dimensional geometric routing algorithms cannot be directly adapted to the 3-dimensional networks. In this paper, we propose routing algorithms based on the iteration of specific angles on the networks of Delaunay Triangulation in 3D space, and prove the certainty of data transmission of our routing algorithms. In the algorithms, the messages only need to carry information of O(1) nodes and each node just keeps 1-hop neighbors' information.
With rapid advances in video processing technologies, video data increased rapidly and becomes popular in our daily life for both professional and consumer applications, e.g., surveillance, education, entertainment. S...
详细信息
暂无评论