In this paper, we present an algorithm to find a sequence of top-down edit operations with minimum cost that transforms an XML document such that it conforms to a schema. It is shown that the algorithm runs in O(p ...
详细信息
ISBN:
(纸本)1595931082
In this paper, we present an algorithm to find a sequence of top-down edit operations with minimum cost that transforms an XML document such that it conforms to a schema. It is shown that the algorithm runs in O(p × log p × n), where p is the size of the schema(grammar) and n is the size of the XML document (tree). We have also shown that edit distance with restricted top-down edit operations can be computed the same way. We will also show how to use the edit distances in document classification. Experimental studies have shown that our methods are effective in structure-oriented classification for both real and synthesized data sets. Copyright 2006 acm.
Grid has been focused in a distributed computing community. There has been a lot of research in these areas, especially for design and development of Grid middleware. More recently, the service-oriented architecture b...
详细信息
ISBN:
(纸本)1595931082
Grid has been focused in a distributed computing community. There has been a lot of research in these areas, especially for design and development of Grid middleware. More recently, the service-oriented architecture based on Web Services rapidly became a major issue. The service-oriented architecture provides a modularized functionality to Grid applications. However, this new technology has some limitations. Web Services basically works with the SOAP protocol, but it is not suitable for masaive scientific data. In this paper, we propose MAGE, Modular and Adaptive Grid Environment, which is uses dynamically reconfigurable component architecture with interfaces. MAGE provides several level of transparency to the Grid application development, and it can dynamically reconfigure its architecture to adapt to heterogeneous Grid environments. Copyright 2006 acm.
In this paper, we propose a novel data mining algorithm for reconstructing gene regulatory networks (GRNs) from microarray data. By making use of the proposed probabilistic measure, it is able to mine noisy, high dime...
详细信息
ISBN:
(纸本)1595931082
In this paper, we propose a novel data mining algorithm for reconstructing gene regulatory networks (GRNs) from microarray data. By making use of the proposed probabilistic measure, it is able to mine noisy, high dimensional expression data for interesting association patterns of genes without the need for additional feature selection procedures. Moreover, it can make explicit hidden patterns discovered for possible biological interpretation and also predict gene expression patterns in the unseen tissue samples. Experimental results on real expression data show that it is very effective and the discovered association patterns reveal biologically meaningful regulatory relationships of genes that could help users reconstructing the underlying structures of GRNs. Copyright 2006 acm.
In our research we investigate how applications can be conceived, designed, and implemented that fit into people's home environments. In particular we describe our method of how user centred design and participato...
详细信息
ISBN:
(纸本)1595931082
In our research we investigate how applications can be conceived, designed, and implemented that fit into people's home environments. In particular we describe our method of how user centred design and participatory design can be appropriated to find users' requirements and design ideas for ubiquitous computing applications for the home. In our example we focus on information presentation and display appliances. In the process we go from individual solutions, fitting a single persona each, to more generic prototypes. Based on this we provide a set of guidelines for the design of display appliances in the home environment. Copyright 2006 acm.
Similarity-based retrieval of images is an important task in many image database applications. Interactive similarity retrieval is one way to resolve the fuzzy area involving psychological and physiological factors of...
详细信息
ISBN:
(纸本)1595931082
Similarity-based retrieval of images is an important task in many image database applications. Interactive similarity retrieval is one way to resolve the fuzzy area involving psychological and physiological factors of individuals during the retrieval process. A good interactive similarity system is not only dependent on a good measure system, but also closely related to the structure of the image database and the retrieval process based on the respective image database structure. In this paper, we propose to use a dynamic similarity measure on top of the enhanced digraph index structure for interactive iconic image similarity retrieval. Our approach makes use of the multiple feedbacks from the user to get the hidden subjective information during the retrieval process, and avoids the high cost of re-computation of an interactive retrieval algorithm. Copyright 2006 acm.
In this study, an adaptive image segmentation algorithm based on a modified Dynamic Window-based gray-level Run-Length Coding (DW-RLC) is developed. We propose an adaptive method for determining the range which is use...
详细信息
ISBN:
(纸本)1595931082
In this study, an adaptive image segmentation algorithm based on a modified Dynamic Window-based gray-level Run-Length Coding (DW-RLC) is developed. We propose an adaptive method for determining the range which is used in the (DW-RLC) algorithm for image segmentation. First, the modes are estimated and identified from the image histogram automatically. Secondly, the adaptive range (R) is calculated using the statistics estimated from the mode distribution. Then, the actual interval for the segmentation is updated based on the seed pixel value and the adaptive range (R). The proposed adaptive algorithm can be categorized as a region growing method. The proposed method is compared with the mean shift and K-means algorithms. This method improves the DW-RLC algorithm by making it less dependent on the randomly chosen range for segmentation, hence more stable. Copyright 2006 acm.
In this work we present a novel architecture for distributed computing in a peer-to-peer network. In particular, we realize the Paderborn University BSP-based Web computing Library (PUBWCL), which was formerly used as...
详细信息
ISBN:
(纸本)0769526977
In this work we present a novel architecture for distributed computing in a peer-to-peer network. In particular, we realize the Paderborn University BSP-based Web computing Library (PUBWCL), which was formerly used as a centralized client-server architecture for scheduling and load balancing, as a pure peer-to-peer system. By using distributed heterogeneous hash tables (DHHT), our architecture-features scheduling and load balancing of tightly coupled, massively parallel algorithms in the bulk-synchronous (BSP) style with a minimal number of migrations. Furthermore, our architecture is capable of heterogeneous BSP programs whereas the former version of PUBWCL could only handle homogeneous BSP programs.
The co-allocation architecture was developed in order to enable parallel downloading of datasets from multiple servers. Several co-allocation strategies have been coupled and used to exploit rate differences among var...
详细信息
ISBN:
(纸本)1595931082
The co-allocation architecture was developed in order to enable parallel downloading of datasets from multiple servers. Several co-allocation strategies have been coupled and used to exploit rate differences among various client-server links and to address dynamic rate fluctuations by dividing files into multiple blocks of equal sizes. However, a major obstacle, the idle time of faster servers having to wait for the slowest server to deliver the final block, makes it important to reduce differences in finishing time among replica servers. In this paper, we propose a dynamic coallocation scheme, namely Recursive-Adjustment Co-Allocation scheme, to improve the performance of data transfer in Data Grids. Our approach reduces the idle time spent waiting for the slowest server and decreases data transfer completion time. We also provide an effective scheme for reducing the cost of reassembling data blocks. Copyright 2006 acm.
A fundamental problem in peer-to-peer networks is how to locate appropriate peers efficiently to answer a specific query request. This paper proposes a model in which semantically similar peers form a semantic overlay...
详细信息
ISBN:
(纸本)1595931082
A fundamental problem in peer-to-peer networks is how to locate appropriate peers efficiently to answer a specific query request. This paper proposes a model in which semantically similar peers form a semantic overlay network and a query can be routed or forwarded to appropriate peers instead of broadcasting or random selection. We apply Latent Semantic Indexing (LSI) in information retrieval to reveal semantic subspaces of feature spaces from documents stored on peers. After producing semantic vectors through LSI, we train a support vector machine (SVM) to classify the peers into different categories based on the extracted vectors. Peers with close categories are defined as semantic similarity and form a semantic overlay. Experimental results show the model is efficient and performs better than other non-semantic retrieval models with respect to accuracy. In addition, our approach improves the recall rate nearly 100% while reducing message traffic dramatically compared with Gnutella. Copyright 2006 acm.
In pervasive-computing scenarios users may wish to achieve some degree of security in their interaction with other people or equipment, in contexts where they cannot be confident of the others' long-term identitie...
详细信息
ISBN:
(纸本)1595931082
In pervasive-computing scenarios users may wish to achieve some degree of security in their interaction with other people or equipment, in contexts where they cannot be confident of the others' long-term identities and where there may be no reliable PKI. We examine the problem of bootstrapping security in an ad-hoc network formed by a group of users. In [4] a number of protocols using low-bandwidth channels involving the human agent(s) "in the loop" to bootstrap secure communication over an untrusted infrastructure were presented, the point being that the attacker's powers are more limited with regard to these empirical channels in one or more respects than in the standard Dolev-Yao view. The two-party protocols proved easy to verify [3] (relative to those weakened powers) by adapting the CSP/FDRbased approach of Casper [9], but the multi-party networkformation protocol (based on a combination of low bandwidth non-forgeable channels and an ordinary Dolev-Yao communication medium) proved more problematic. Addressing the verification of this protocol [11] led to consideration of a number of simplified variants, which appear interesting in their own right. Copyright 2006 acm.
暂无评论