A Bloom filter is a space-efficient data structure used for concisely representing a set as well as membership queries at the expense of introducing false positive. In this paper, we propose the L-priorities Bloom fil...
详细信息
A Bloom filter is a space-efficient data structure used for concisely representing a set as well as membership queries at the expense of introducing false positive. In this paper, we propose the L-priorities Bloom filter （LPBF） as a new member of the Bloom filter （BF） family, it uses a limited multidimensional bit space matrix to replace the bit vector of standard bloom filters in order to support different priorities for the elements of a set. We demonstrate the time and space complexity, especially the false positive rate of LPBF. Furthermore, we also present a detailed practical evaluation of the false positive rate achieved by LPBF. The results show that LPBF performs better than standard BFs with respect to false positive rate.
engineering systems have become quite complicated in recent days. The requirements of design are complex and it is hard to meet them by considering only one discipline. In this paper, we suggest a hybrid Multi-objecti...
详细信息
In the fields of social network analysis and knowledge graph, many semi-supervised learning algorithms based on graph convolutional neural network (GCN) have been widely used. Most of these algorithms usually improve ...
详细信息
In the real world, data describing the same learning task may be distributed in different institutions (called participants), and these participants cannot share their own data due to the need of privacy protection. H...
详细信息
This paper concerns the existence of affine-periodic solutions for perturbed affine-periodic *** kind of affine-periodic solutions has the form of x(t+T)≡Qx(t) with some nonsingular matrix Q,which may be quasi-period...
详细信息
This paper concerns the existence of affine-periodic solutions for perturbed affine-periodic *** kind of affine-periodic solutions has the form of x(t+T)≡Qx(t) with some nonsingular matrix Q,which may be quasi-periodic when Q is an orthogonal matrix. It can be even unbounded but x(t)/|x(t)| is quasi-periodic,like a helical line. for example x(t)=e^(at)(cos ωt, sin ωt), when Q is not an orthogonal matrix. The averaging method of higher order for finding affine-periodic solutions is given by topological degree.
Petri Nets is a powerful mathematical modeling tool for system description and analysis, with which we can describe the relationship among entities efficiently. The present thesis puts forward the modeling of the dist...
详细信息
In order to distinguish and extract the topic information from other interferential information on the BBC news website for the study in social computing, the BBC News Hunter was proposed in this paper. The whole syst...
详细信息
To solve the problem of searching for an optimal elimination ordering of Bayesian networks, a novel effective heuristic, MinSumWeight, and an ACS approach incorporated with multi-heuristic mechanism are proposed. The ...
详细信息
The utilization of expert knowledge to construct Bayesian Network (BN) is one of the key issues of uncertain inference. In this paper the learning procedure of BN is simplified by applying data dependencies in relatio...
详细信息
The utilization of expert knowledge to construct Bayesian Network (BN) is one of the key issues of uncertain inference. In this paper the learning procedure of BN is simplified by applying data dependencies in relational database, which help to remove extraneous attributes and build the initial network structure. The final classification model named FM-NB inherits the simplicity of Naive Bayes (NB) and the ability to maintain inter-dependencies among attributes of Tree augmented NB(TAN). The inter-dependencies are expressed by Functional dependencies (FDs) and Local Multivalued dependencies (LMVDs), which relaxed the precondition about attribute sets of Multivalued dependency (MVD) and solved the problem related to conditional independence of Embedded Multivalued dependencies (EMVDs). Experimental results are presented to show the effectiveness and efficiency of the proposed approach.
作者：
LI YONG XU LUCollege of Mathematics
Key Laboratory of Symbolic computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012
In this paper, we study the persistence of lower dimensional tori for random Hamiltonian systems, which shows that majority of the unperturbed tori persist as Cantor fragments of lower dimensional ones under small per...
详细信息
In this paper, we study the persistence of lower dimensional tori for random Hamiltonian systems, which shows that majority of the unperturbed tori persist as Cantor fragments of lower dimensional ones under small perturbation. Using this result, we can describe the stability of the non-autonomous dynamic systems.
暂无评论