The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
If a woman is pregnant, it is important for both her and her doctor/clinician to be aware if there are problems with the developing fetus. There are currently ways to discover problems using both noninvasive and invasive techniques. The University of Arkansas for Medical Sciences (UAMS) has recently developed a noninvasive system called the Squid Array for Reproductive Assessment (SARA) that can be...
With the rapid development of online shopping, the ability to segment e-shoppers basing on their preferences and characteristics has become a key source of competitive advantage for firms. This paper presented the realistic algorithms for clustering e-shoppers in e-commerce applications. Multi-dimensional range search is presented to solve the range-searching problem. This is a multi-level structure...
Frequent itemset mining is a common data mining task for many real-life applications. The mined frequent itemsets can be served as building blocks for various patterns including association rules and frequent sequences. Many existing algorithms mine for frequent itemsets from traditional static transaction databases, in which the contents of each transaction (namely, items) are definitely known and...
Understanding the differences between two datasets is a fundamental data mining question and is also ubiquitously important across many real world scientific applications. In this paper, we propose a tree-based framework to provide a parsimonious explanation of the difference between two distributions based on rigorous two-sample statistical test. We develop two efficient approaches. The first one...
Structural connection is one of the core operations in XML database query processing, and an efficient algorithm is the key to the query processing, which has been greatly concerned by the computer research community. After analyzing some current existed structural connection algorithms, this paper uses orthogonal B+ tree as storage and gives the structural connection algorithm with stack. The algorithm...
In most wireless sensor network applications a large amount of data has been continuously collected for future data query and analysis, so how to store them becomes one important challenge in such wireless sensor networks. Recently a kind of storage node has been introduced as a useful technique to solve the storage challenge, so the placement of storage node becomes an important issue in such wireless...
In many tree-structured parallel computations, the size and shape of a tree that represents a parallel computation is unpredictable at compile-time. The tree evolves gradually during the course of the computation. When such an application is executed on a static network, the dynamic tree evolution problem is to distribute the tree nodes to the processors of the network such that all the processors...
We present a distributed on-line algorithm for detecting conjunctive stable predicates in dynamic systems. The algorithm consists of a virtual network topology to maintain the causality relationships between distributed events and protocols to check the verification of the predicates over consistent global states. A lazy detection protocol has been developed to minimize the number of messages for...
We study the finite-time average-consensus problem for arbitrary connected networks. Viewing this consensus problem as a factorization of 1/n11T by suitable families of matrices, we prove the existence of a finite factorization and provide tight bounds on the size of the minimal factorization by exhibiting finite-time average-consensus algorithms and bounding their runtimes. We also show that basic...
By eliminating the matrix of scaling factors in the transform and quantization, the paper derives the best AVS zero-block detection threshold relating only with the quantization parameter (QP). To improve the low detection capability of the fixed threshold, the paper proposes adaptive threshold for all-zero block detection. The algorithm uses the correlation of neighboring blocks to dynamical change...
The main purpose of the paper is to solve structured instances of the satisfiability problem. The structure of a SAT instance is represented by an hypergraph, whose vertices correspond to the variables and the hyper-edges to the clauses. The proposed method is based on a tree decomposition of this hyper-graph which guides the enumeration process of a DPLL-like method. During the search, the method...
Recent studies have shown mining compressed frequent itemset patterns provides more benefits than mining the closed frequent patterns, since mining compressed frequent itemset patterns leads to more compact and representative result sets. Especially, it is quite meaningful in the environment of data stream where limited memory space and computation quality are major challenges. In this paper, the...
Multiple pattern matching algorithms are essential engines of network intrusion detection systems (NIDSs) to inspect packets for occurrences of malicious patterns. For a set of patterns, the multiple pattern matching algorithms usually build a trie data structure. In this paper, we propose efficient implementations of the multiple pattern matching algorithms widely used in NIDSs by using a linearized...
Query all skyline points in large high-dimension dataset is quite challenging and its space and computation overhead are massive. This paper presents QBHSQ, a novel quad-tree based algorithm for skyline query in large high-dimension dataset. QBHSQ utilizes a partial dimension subset to partition dataset on high dimensional space by means of the configuration characters of quad-tree. Since amount of...
Biogeography-based optimization (BBO) is a recently developed heuristic algorithm which has shown impressive performance on many well known benchmarks. In order to improve BBO, this paper incorporates distinctive features from other successful heuristic algorithms into BBO. In this paper, features from evolutionary strategy (ES) are used for BBO modification. Also, a new immigration refusal approach...
Semantic orientation analysis of sentiment word is to determine its polarity and degree, including original orientation, dynamic orientation and modified orientation. In this paper, we correct the orientation in different contexts through dependency relationship and some rules. The result shows that accuracy and recall rate is improved a lot.
The alert information play very important role in air traffic flow management (ATFM), and is often presented using simple graphics such as histogram or table. These familiar visualizations are effective for providing overview to some extent, but the details related to hierarchy are often neglected. In this paper we present a generalized treemap algorithm that aims to enhance alert information visualization...
Based on the best-worst ant system, an improved best-worst ant system algorithm (IBWAS) is presented in this paper. Mainly, to improve convergence efficiency, the algorithm imported a heuristic crossover operator, which synthesizes the gene of parents and also takes into account connection relationship among each city, the best ant and the second-best ant will be carried out the operator for generating...
Because static materialized views selection algorithm has many shortcomings, such as larger search space, higher time consumption and excluding query probability and distribution, and the changes in data sources can't be reflected in datawarehouse immediately. In view of this, this paper implements dynamic adjustment for static materialized views selection algorithm according to CVLC and IGA, that...
The k-means algorithm is an extremely popular technique for clustering data. One of the major limitations of the k-means is that the time to cluster a given dataset D is linear in the number of clusters, k. In this paper, we employ height balanced trees to address this issue. Specifically, we make two major contributions, (a) we propose an algorithm, RACK (acronym for RApid Clustering using k-means),...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.