In this paper, we propose a novel queue-based privacy-preserving data aggregation scheme for additive aggregation function. In the scheme, sensor nodes are divided into clusters in a distributed way first, and then, i...
详细信息
ISBN:
(纸本)9781845649302
In this paper, we propose a novel queue-based privacy-preserving data aggregation scheme for additive aggregation function. In the scheme, sensor nodes are divided into clusters in a distributed way first, and then, in each cluster, cluster members will form a queue and adopt a new queue-based privacy-preserving scheme to send data for aggregation upon the cluster head's request. We evaluate our scheme in terms of overheads, capacity of privacy-preservation, and data aggregation accuracy. The results show that our scheme is efficient and reasonable.
Locally linear embedding(LLE)algorithm has a distinct deficiency in practical *** requires users to select the neighborhood parameter,k,which denotes the number of nearest neighbors.A new adaptive method is presented ...
详细信息
Locally linear embedding(LLE)algorithm has a distinct deficiency in practical *** requires users to select the neighborhood parameter,k,which denotes the number of nearest neighbors.A new adaptive method is presented based on supervised LLE in this article.A similarity measure is formed by utilizing the Fisher projection distance,and then it is used as a threshold to select *** samples will produce different k adaptively according to the density of the data *** method is applied to classify plant *** experimental results show that the average classification rate of this new method is up to 92.4%,which is much better than the results from the traditional LLE and supervised LLE.
As an important global geometric quantity, edge betweennesses can reflect the impact of corresponding edges in the entire network, which have a very strong practical significance. However, edge betweenness ignores the...
详细信息
Random walk on heterogeneous networks is a recently emerging approach to effective disease gene prioritization. Laplacian normalization is a technique capable of normalizing the weight of edges in a network. We use th...
详细信息
Random walk on heterogeneous networks is a recently emerging approach to effective disease gene prioritization. Laplacian normalization is a technique capable of normalizing the weight of edges in a network. We use this technique to normalize the gene matrix and the phenotype matrix before the construction of the heterogeneous network, and also use this idea to define the transition matrices of the heterogeneous network. Our method has remarkably better performance than the existing methods for recovering known gene-phenotype relationships. The Shannon information entropy of the distribution of the transition probabilities in our networks is found to be smaller than the networks constructed by the existing methods, implying that a higher number of top-ranked genes can be verified as disease genes. In fact, the most probable gene-phenotype relationships ranked within top 3 or top 5 in our gene lists can be confirmed by the OMIM database for many cases. Our algorithms have shown remarkably superior performance over the state-of-the-art algorithms for recovering gene-phenotype relationships. All Matlab codes can be available upon email request.
Community structure analysis is a hot research spot in social networks and complex networks. In order to summarize recent research progress, this paper reviews the background, the motivation, the advantages and disadv...
详细信息
This paper is concerned with the problem of the full-order observer design for a class of fractional-order Lipschitz nonlinear systems. By introducing a continuous frequency distributed equivalent model and using an i...
详细信息
This paper is concerned with the problem of the full-order observer design for a class of fractional-order Lipschitz nonlinear systems. By introducing a continuous frequency distributed equivalent model and using an indirect Lyapunov approach, the sufficient condition for asymptotic stability of the full-order observer error dynamic system is presented. The stability condition is obtained in terms of LMI, which is less conservative than the existing one. A numerical example demonstrates the validity of this approach.
The elliptic problem with nonlocal boundary condition is widely applied in the field of science and engineering. Firstly, we construct a linear finite element scheme for the nonlocal boundary problem, and derive the o...
详细信息
The elliptic problem with nonlocal boundary condition is widely applied in the field of science and engineering. Firstly, we construct a linear finite element scheme for the nonlocal boundary problem, and derive the optimal L 2 error estimate. Then, based on the quadratic finite element and the extrapolation linear finite element methods, we present a composite scheme, and prove that it is convergent order three. Furthermore, we design an upper triangular preconditioning algorithm for the linear finite element discrete system. Finally, numerical results not only validate that the new algorithm is efficient, but also show that the new scheme is convergent order three, furthermore order four on uniform grids.
Many studies have shown that we can gain additional information on time series by investigating their accompanying complex networks. In this work, we investigate the fundamental topological and fractal properties of r...
详细信息
Many studies have shown that we can gain additional information on time series by investigating their accompanying complex networks. In this work, we investigate the fundamental topological and fractal properties of recurrence networks constructed from fractional Brownian motions (FBMs). First, our results indicate that the constructed recurrence networks have exponential degree distributions; the average degree exponent 〈λ〉 increases first and then decreases with the increase of Hurst index H of the associated FBMs; the relationship between H and 〈λ〉 can be represented by a cubic polynomial function. We next focus on the motif rank distribution of recurrence networks, so that we can better understand networks at the local structure level. We find the interesting superfamily phenomenon, i.e., the recurrence networks with the same motif rank pattern being grouped into two superfamilies. Last, we numerically analyze the fractal and multifractal properties of recurrence networks. We find that the average fractal dimension 〈dB〉 of recurrence networks decreases with the Hurst index H of the associated FBMs, and their dependence approximately satisfies the linear formula 〈dB〉≈2−H, which means that the fractal dimension of the associated recurrence network is close to that of the graph of the FBM. Moreover, our numerical results of multifractal analysis show that the multifractality exists in these recurrence networks, and the multifractality of these networks becomes stronger at first and then weaker when the Hurst index of the associated time series becomes larger from 0.4 to 0.95. In particular, the recurrence network with the Hurst index H=0.5 possesses the strongest multifractality. In addition, the dependence relationships of the average information dimension 〈D(1)〉 and the average correlation dimension 〈D(2)〉 on the Hurst index H can also be fitted well with linear functions. Our results strongly suggest that the recurrence network inherits the basic characteristic
In this paper, the Crank-Nicolson (CN) difference scheme for the coupled nonlinear Schrödinger equations with the Riesz space fractional derivative is studied. The existence of this difference solution is proved ...
详细信息
In this paper, the fractional variational integrators for fractional variational problems depending on indefinite integrals in terms of the Caputo derivative are developed. The corresponding fractional discrete Euler-...
详细信息
暂无评论