A modified screen-printed carbon electrode was prepared and manufactured by using ionic liquid, nano-Fe3O4 and in situ plating bismuth film methods, which were used to detect heavy metal ions of cadmium and lead by st...
详细信息
3-SPS+RRS+PS is a new type of mechanism. There is good application prospect in the field of aerospace. Especially some key kinetic characteristic calculation algorithms are implemented, which makes its calculation mec...
详细信息
The existing collaborative recommendation algorithms have lower robustness against shilling *** this problem in mind,in this paper we propose a robust collaborative recommendation algorithm based on k-distance and Tuk...
详细信息
The existing collaborative recommendation algorithms have lower robustness against shilling *** this problem in mind,in this paper we propose a robust collaborative recommendation algorithm based on k-distance and Tukey ***,we propose a k-distancebased method to compute user suspicion degree(USD).The reliable neighbor model can be constructed through incorporating the user suspicion degree into user neighbor *** influence of attack profiles on the recommendation results is reduced through adjusting similarities among ***,Tukey M-estimator is introduced to construct robust matrix factorization model,which can realize the robust estimation of user feature matrix and item feature matrix and reduce the influence of attack profiles on item feature ***,a robust collaborative recommendation algorithm is devised by combining the reliable neighbor model and robust matrix factorization *** results show that the proposed algorithm outperforms the existing methods in terms of both recommendation accuracy and robustness.
In this paper, we focus on efficient processing of XML keyword queries based on smallest lowest common ancestor （SLCA） semantics. For a given query Q with m keywords, we propose to use stable matches as the basis fo...
详细信息
In this paper, we focus on efficient processing of XML keyword queries based on smallest lowest common ancestor （SLCA） semantics. For a given query Q with m keywords, we propose to use stable matches as the basis for SLCA computation, where each stable match M consists of m nodes that belong to the m distinct keyword inverted lists of Q. M satisfies that no other lowest common ancestor （LCA） node of Q can be found to be located after the first node of M and be a descendant of the LCA of M, based on which the operation of locating a stable match can skip more useless nodes. We propose two stable match based algorithms for SLCA computation, i.e., BSLCA and HSLCA. BSLCA processes two keyword inverted lists each time from the shortest to the longest, while HSLCA processes all keyword inverted lists in a holistic way to avoid the problem of redundant computation invoked by BSLCA. Our extensive experimental results verify the performance advantages of our methods according to various evaluation metrics.
An electrode for the detection of rutin in tea and pill was produced and fabricated, which was modified by the glass carbon electrode (GCE) surface by graphene (GR) nanometer materials and n-octylpyridinum hexafluorop...
详细信息
To improve the accuracy of paper metadata extraction, a paper metadata extraction approach based on meta-learning is presented. Firstly, we propose a construction method of base-classifiers, which combines the Support...
详细信息
Several dynamic junction over-constrained parallel-parallel mechanisms are proposed in this paper with a new method based on graph theory synthesis. This kind of mechanism is the pivotal part of the equivalent mechani...
详细信息
Based on the centralized channel allocation strategy in the Cognitive Radio Networks, considering the opportunistic channel access for Secondary Users, a discretetime queueing model with a general transmission time an...
详细信息
Most of the traditional outlier mining algorithms are not suitable for high dimensional datasets. However, the dimensionality of the dataset in the field of the Internet of Things is high. Therefore, Hypergraph-based ...
详细信息
There are two critical questions in the Wu-Huberman algorithm: one is picking two poles and the other is setting the threshold. By further studying the two questions, we present a method that makes the discovery of co...
详细信息
暂无评论