非●梵高

此文件为《web开发那些事儿》http://blog.csdn.net/deltatang/article/details/38274747 的代码内容，谢绝他用：）

在本文中，我们提出了一种流形聚类算法，称为基于流形距离的全局原型聚 类算法(Global Prototypical Clustering Algorithm based—on Mallifold Distance，GPMC)。 在新算法中，聚类中心选自数据集本身，在选择每个聚类的聚类中心时，依据一 种新的基于流形距离的相似性度量，该度量计算的是数据点间沿着流形的测地线 距离。在确定初始聚类中心时，GPMC从优化的角度出发，使用全局的方法进行选 择。对于部分人工数据集和UCI数据集的实验表明，从聚类性能和鲁棒性的角度来 看，新算法在处理复杂、非凸的数据聚类问题时有效可行。

基于Intel_RNG的真随机数生成器研究

针对传统遗传算法易陷入早熟收敛等问题，提出一种改进的元胞自动机遗传算法(CGA)，并将其应用于云环境下的资源调度。分 析云计算环境中处理用户群请求的庞大任务数及资源合理分配的问题，利用CGA 算法寻求一组最优的资源调度方案。在CloudSim 仿真平 台上进行实验，结果表明，CGA 算法能缩短任务完成时间，降低用户总成本，满足云环境下的资源调度要求。

SLSB Improving the Steganographic Algorithm LSB

Linear Canonical Transform.docx

We present a method for identifying a partial match for twice differentiable curves. The method uses equal arc-length interval correspondences when comparing points on one curve to another. We use the square of difference in curvatures at each point to compare two curves, and find it to be fast enough for querying a large database of curves.

The process of classifying objects is a fundamental fea- ture of most human pursuits, and the idea that people clas- sify together those things that people ¯nd similar is both intuitive and popular across a wide range of disciplines. Es- timation of di®erence between curves (curve matching) is an useful and often necessary technique in many applica- tions, including: pattern recognition, image object recogni- tion, robotic applications, computational geometry, etc. In this paper, three methods for curve matching using turning functions are presented. While the ¯rst two, called plain and polygonal method, are based on a simple adapta- tion of the existing approaches, the third one, called penalty method, is a new one and tries to overcome some important problems from the ¯rst two. The advantages and essential problems of the proposed methods are also discussed. A number of examples are presented to show major di®erences among the methods and their potential usefulness.

This chapter provides an introduction to curve fitting. It includes information on the following topics: • The purpose of performing curve fits. • The types of curve fits that are available in KaleidaGraph. • Choosing an appropriate curve fit model.

A motif is a pair of non-overlapping sequences with very similar shapes in a time series. We study the online top- k most similar motif discovery problem. A special case of this problem corresponding to k = 1 was investigated in the literature by Mueen and Keogh [2]. We generalize the problem to any k and propose space-ecient algorithms for solving it. We show that our algorithms are optimal in term of space. In the particular case when k = 1, our algorithms achieve better performance both in terms of space and time consumption than the algorithm of Mueen and Keogh. We demonstrate our results by both theoretical analysis and extensive experiments with both synthetic and real-life data. We also show possible application of the top-k similar motifs discovery problem.

We present an algorithm for answering the following fundamental question: Given two arbitrary (piecewise) polynomial curves, are they the same? This basic CAGD question is answered by first reducing the two curves into canonical irreducible forms. This is done by reversing the processes of knot refinement, degree raising, and composition. The two curves are then compared in their irreducible forms and their shared domains, if any, are identified. The ability to answer this fundamental identity question will be a boon for numerous applications. In this paper, we demonstrate a few such applications. The algorithm allows one to identify two boundary curves (shared as a common seam) between two different surfaces as an identical curve (or not) even when they are represented differently. Moreover, we show that reparameterization is insecure as a watermarking method, which invalidates the proposal of [8].

应用网络可靠性模型，预测灾难事件导致的停机

故障预测与健康管理系统研究和应用现状综述

hough transform sample(java code)

http live streaming document

《erlang程序设计》中文版 图林出版社 高清扫描

Test-Driven Development By Example

14行写成的p2p 应用 python