12282317
A note on “a mapping algorithm for computer-assisted exploration in the design of embedded systems”
The scaling of autoclave and leaching-equipment surfaces during the high pressure leaching of nickeliferous oxide and silicate ores is controlled during leaching to favor the formation of scale containing substantial amounts of magnesium sulfate that is more easily removed by chemical dissolution using water or dilute sulfuric acid at temperatures ranging from about 50 DEG C. to 250 DEG C. than scale containing substantial amounts of alunite.
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
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.
1107258
Improving image clustering: An unsupervised feature weight learning framework
We address the problem of feature weight learning for image clustering. In practice, before clustering data, we generally normalize all data features between 0 and 1, because we cannot determine which features are more important. In this paper, we provide a feature weight learning framework for clustering which can obtain the feature weights and cluster labels simultaneously. An alternative optimization algorithm is adopted to solve this problem. Empirical studies on the toy data and real image data demonstrate our algorithm's effectiveness in improving the clustering performance.
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.
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.
7031383
Image retrieval based on Sugeno fuzzy integral
In this paper, we propose a fuzzy similarity measure based on the Sugeno fuzzy integral and apply it to the content-based image retrieval. Fuzzy measure is used to formulate the subjective feedback information. Experimental results show that the proposed method can improve the efficiency and reliability of image retrieval system. Our method of formulating the subjective feedback information performs better than the weighted average operator (WAO) and a Choquet-integral-based similarity measure.
10184304
A New Rapid and Effective Chemistry Space Filter in Recognizing a Druglike Database
To develop a new chemistry space filter with high efficiency and accuracy, an analysis on distributions of as many as 50 structural and physicochemical properties was carried out on both druglike and nondruglike databases, viz. MACCS-II Drug Data Report (MDDR), Comprehensive Medicinal Chemistry (CMC), and Available Chemicals Directory (ACD). Based on the analysis results, a chemistry space filter was developed that can effectively discriminate a druglike database from a nondruglike database. The filter is composed of two descriptors: one is a molecular saturation related descriptor, and the other is associated with the proportion of heteroatoms in a molecule. Both are molecular size independent. Therefore, the profiles of a druglike database could be characterized as proper molecular saturation and proper percentage of heteroatoms, revealing direct indices for designing and optimizing combinatorial libraries. The application of the new filter on the Chinese Natural Product Database (CNPD) suggested that CNPD is, as expected, a potential druglike database, testifying that the new filter is reliable. Therefore, this newly developed chemistry space filter should be a potent tool for identifying druglike molecules, thus, it would have potential applications in the research of combinatorial library design and virtual high throughput screening using computational approaches for drug discovery.
16070632
Prototyping system of codec for novel 2-D continuous barcode
To address the limits of capacity and the disadvantages of motional scanning capability of traditional two-dimensional (2-D) barcodes, a novel 2- D continuous barcode (2-D CoBe) with improving the structure of traditional 2-D barcodes is proposed. The novel barcode not only enable to store a large mount of data with indefinitive capacity, but also support realtime decoding. Furthermore, a prototyping system of codec including encoding sub-system and decoding sub-system is examined and implemented. In this codec system, 2-D CoBe can be generated and printed on papers by encoding software sub-system. Besides, it can be recognized and decoded by a hand-held device with decoding sub-system in real-time. Based on the experimental results of encoding binary voice data into 2-D CoBe and decoding it with a hand-held device, it is verified that the codec system for 2-D CoBe is practical and effective.
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.
16143751
Portrait video phone
As the Internet and wirless networks are developed rapidly, the demand of communicating anywhere, anytime on any device emerges. However, most of the current wireless networks still work in low bandwidths, and mobile devices still suffer from weak computational power, short battery lifetime and limited display capability. We developed portrait video phone systems that can run on Pcs and Pocket Pcs at very low bit rates through the Internet. The core technology that portrait video phones employ is the so-called portrait video (or bi-level video) codec. Portrait video codec first converts a full-color video into a black/white image sequence and then compresses it into a black/white portrait-like video. Portrait video processes clearer shape, smoother motion, shorter initial latency, and cheaper computational cost than MPEG2, MPEG4 and H.263 for low bandwidths. Typically the portrait video phone provides QCIF-size video with a frame rate of 5-15 fps for a 9.6 Kbps video bandwidth. The portrait video is so small that it can even be transmitted through an HTTP proxy as text. Experiments show that the portrait video phones work well on ordinary GSM wireless telecommunication networks.