6814190
Adapting to Application Workflow in Processing Data Integration Queries
Data integration has evolved to provide efficient data management across distributed and heterogeneous data sources in grid environment. However, existing works in data integration consider little knowledge about the above applications. In such settings, queries from the same application are processed independently. In this paper, application properties are noticed in order to improve query performance for data integration. We present a general-purpose and well-modular architecture for addressing data integration in grid (DIG) environment first, the modules of which can be flexibly deployed to adapt specific application. Moreover, special attention has been paid on query processing to accommodate application workflow with the component of query flow processor. It introduces multi-query optimization techniques to speed up overall response time for DIG.
116588251
On-line evolutionary exponential family mixture
This paper deals with evolutionary clustering, which refers to the problem of clustering data with distribution drifting along time. Starting from a density estimation view to clustering problems, we propose two general on-line frameworks. In the first framework, i.e., historical data dependent (HDD), current model distribution is designed to approximate both current and historical data distributions. In the second framework, i.e., historical model dependent (HMD), current model distribution is designed to approximate both current data distribution and historical model distribution. Both frameworks are based on the general exponential family mixture (EFM) model. As a result, all conventional clustering algorithms based on EFMs can be extended to evolutionary setting under the two frameworks. Empirical results validate the two frameworks.
5747087
Efficient Processing of Warping Time Series Join of Motion Capture Data
Discovering non-trivial matching subsequences from two time series is very useful in synthesizing novel time series. This can be applied to applications such as motion synthesis where smooth and natural motion sequences are often required to be generated from existing motion sequences. We first address this problem by defining it as a problem of l-e-join over two time series. Given two time series, the goal of l-e-join is to find those non-trivial matching subsequences by detecting maximal l-connections from the e-matching matrix of the two time series. Given a querying motion sequence, the l-e-join can be applied to retrieve all connectable motion sequences from a database of motion sequences. To support efficient l-e-join of time series, we propose a two-step filter-and-refine algorithm, called Warping Time Series Join (WTSJ) algorithm. The filtering step serves to prune those sparse regions of the e-matching matrix where there are no maximal l-connections without incurring costly computation. The refinement step serves to detect closed l-connections within regions that cannot be pruned by the filtering step. To speed up the computation of e-matching matrix, we propose a block-based time series summarization method, based on which the block-wise e-matching matrix is first computed. Lots of pairwise distance computation of elements can then be avoided by applying the filtering algorithm on the block-wise e-matching matrix.Extensive experiments on l-e-join of motion capture sequences are conducted. The results confirm the efficiency and effectiveness of our proposed algorithm in processing l-e-join of motion capture time series.
8051159
A Web-based Framework For On-line Collaborative Learning
This paper presents a framework for design of online courses and collaborative learning based on Web technologies. It provides the following features: construction of structured learning materials in a distributed environment; personalization of course contents in the run-time that adapts to the progress of individual students; it can supply relevant Web resources to the students by analyzing the learning history dynamically; students in a group could exchange their learning experiences and discover relevant knowledge via the communication channels provided by the framework. The proposed techniques could be deployed to a variety of online computer-assisted modules to improve the effectiveness of Web-based e-learning
8340253
UGE4B: An Universal Grid Environment for Bioinformatics Research
Recent years, grid technology has been used widely in the fields of scientific research. In this paper, we present a universal grid environment for bioinformatics research (UGE4B). Although there have been several similar projects successfully constructed in the world, we need to meet some unique requirements from bioinformatics research in China. UGE4B consists of 6 components, including portal, task management, data management, information server, security and computing node. As a national-wide bioinformatics research platform, UGE4B is built through interconnecting multiple sub grids provided by each bioinformatics institutes. Besides provides a universal portal to end users for bioinformatics computing and data accessing, UGE4B also supported some special bioinformatics applications
26669443
Bottom-up discovery of frequent rooted unordered subtrees
In the past decade, XML has emerged as the standard language for information exchanging over the Internet. Due to its tree-structure paradigm, XML is superior for its capability of storing, querying, and manipulating complex data. Therefore, discovering frequent tree patterns over tree-structured data has become an interesting topic for XML data management. In this paper, we propose a tree mining algorithm, named BUXMiner, for finding a special class of frequent trees, called rooted unordered trees, from a tree-structured database. BUXMiner employs an efficient bottom-up approach to enumerate all candidate trees over a compact global tree guide and computes the frequent trees based on the tree guide. In addition to BUXMiner, we also propose a mining approach called BUMXMiner to discover the maximal frequent rooted unordered trees. We compare BUXMiner with previous tree-structure mining algorithms, namely XQPMinerTID and FastXMiner, which were also proposed to discover rooted unordered trees. The experimental results show that our algorithm outperforms XQPMinerTID and FastXMiner in terms of efficiency. The performance results from real-world applications also indicate the usefulness of our proposed tree mining algorithms in a variety of web applications, such as analysis of web page access patterns and mining frequent XML query patterns for caching.
25276326
Web-Based Service Management of Distributed Learning
This paper tries to design structure of Web-Based Service Management of Distributed Learning (WSMDL). The structure integrating IT service and Educational Auxiliary System service flow. Help desk becomes only interface for all levels of users according to their individual demands. Though analysis of service events and user’s feedback in service flow, it also provides the decision-making to improve the quality of Web-based Service Management of Distributed Learning Service Management. The paper also depicts the functions of WSMDL.
110367358
Unified synthesis techniques for high performance fpga designs
As the device geometry keeps shrinking in today's deep sub-micron technologies, interconnect delay dominates the critical path. In the current FPGA design flow, there are two major drawbacks: the separation of technology-independent optimization and technology mapping in the traditional logic synthesis flow, and the separation of logic synthesis and physical implementation in the traditional implementation flow. Such drawbacks result in sub-optimal performance and a long timing closure cycle. In this thesis we propose the utilization of unified synthesis techniques in the context of FPGAs to address these issues and improve the overall design performance. In Chapter 3 we bridge the gap between technology-independent optimization and technology mapping by combining logic decomposition and mapping. In Chapter 4, we introduce a novel algorithm named SCPlace [17] to perform simultaneous clustering during placement. In Chapter 5 we introduce an algorithm named SPD to perform logic duplication during placement. In Chapter 6 we build the first complete academic CAD flow, which can be easily plugged in to a state-of-the-art commercial tool, Altera's Quartus 4.0 software. Our unified synthesis and placement tool, SPCD, combines both the clustering and duplication techniques. Our experimental results show up to over 30% improvement in performance compared with the current state-of-the-art academic flow.
537363
Change propagation algorithm in a unified feature modeling scheme
Product lifecycle stages are inter-related and mutually constraining. Due to the sequential nature of the product development processes, some constraints or conflicts may emerge in a later stage and require modifications to the decisions made in earlier stages. The iterations between stages are hence unavoidable and must be managed carefully to maintain the consistency, integrity and validity of product information models. Due to the inter- or intra-stage relations, a chain of changes is very likely to occur as the consequence of an initial change. Modeling and maintaining these relations are important in collaborative engineering to evolve the state of the whole product model in a consistent manner. This paper introduces a new method of modeling associative engineering relations in a unified feature modeling scheme and elaborates a change propagation algorithm for the information consistency control among multiple applications of product lifecycle stages. The algorithm is established on a JTMS-based dependency network. Two case studies are used to illustrate the proposed dependency network and change propagation algorithm.
15935457
A Design of Data Rebuilding for Decision Support in E-Government System
The E-Government System is composed of three networks and one database. The business network within government offices (the Internal Net), the resource network in central and local administrations and departments (the External Net), the public information network (PIN) relying on the Internet. It is necessary to rebuild data in the three networks of the system in order to construct an effective electronic information database. In data rebuilding, a data exchange platform is set up to enable data sharing between the three networks. The data exchange platform is implemented in a structure that combines the intelligent decision support system (IDSS) and data warehouse (DW).
30040964
Agent-Mediated Genetic Super-Scheduling in Grid Environments
Super-scheduling in a dynamic grid environment is a very challenging issue that remains to be solved before a grid can be deployed and effectively utilized. In this paper we investigate a paradigm based on genetic algorithms (GA) to efficiently solve the scheduling problem. This GA paradigm is architecturally combined with the multiagent system (MAS) paradigm to form a flexible super-scheduling system. A three-layered scheduling architecture is presented and the corresponding realization of a multiagent-based system is described. The experiment shows that the better scheduling results are obtained for the adopted metrics of flow time and job stretch.