• Citations Per Year
Learn More
A public key cryptosystem scheme is proposed that are based on conic curves over the ring Zn. Our scheme is motivated by KMOV scheme on elliptic curves, but our scheme remove some restrictive condition from KMOV scheme and constructed on conic curves. Its security bases on the difficulty of factoring a composite number n, just like RSA. It can resist some(More)
In this paper, we propose a new solution for dynamic task scheduling in distributed environment. We argue that a function is existed in the items: execution time, the size of data and the algorithm, therefore we can deduce the execution time of a data mining task from the corresponding the size of data and algorithm. We adopt the sampling method for process(More)
The computation of the Hausdorff measure of fractals is the basic problem in fractal geometry. However, this is very difficult. The genetic algorithm is one of optimization algorithms to resolve complicated problems of wide scope, and has great capabilities in self-organizing, self-adaptation and self-learning. Lifeng Xi professor put forward to the thought(More)
Based on sampling likelihood and feature intensity, in this paper, a feature-preserving denoising algorithm for point-sampled surfaces is proposed. In terms of moving least squares surface, the sampling likelihood for each point on point-sampled surfaces is computed, which measures the probability that a 3D point is located on the sampled surface. Based on(More)
Based on sampling likelihood and feature intensity, in this paper, a feature-preserving denoising algorithm for point-sampled surfaces is proposed. In terms of moving least squares surface, the sampling likelihood for each point on point-sampled surfaces is computed, which measures the probability that a 3D point is located on the sampled surface. Based on(More)
A denoising algorithm for point-sampled geometry is proposed based on noise intensity. The noise intensity of each point on point-sampled geometry (PSG) is first measured by using a combined criterion. Based on mean shift clustering, the PSG is then clustered in terms of the local geometry-features similarity. According to the cluster to which a sample(More)