This resource contains eight sets of the classic mouse static, dynamic cursor an...

intrusiton detection system

目前，人工智能及其火爆，这个程序是基本的神经网络架构，适合刚刚入门的同学，而且是在tf架构搭建，tf是目前非常热门的神经网络平台。

它是一个基于web的应用程序，主要目的是使这个过程易于管理学校的运作

这是通过SIFT实现图像拼接的代码，首先通过SIFT算法检测出特征点，然后欧式距离匹配点对，然后用RANSAC来去除误配点。最后用加权平均法来融合图像。本人已测，绝对好用。

操作系统的 自己一看就知道-its own operating system a person would know

遗传算法是基于达尔文进化论的一种智能优化算法,一种可用于复杂系统优化的具有鲁棒性的搜索算法，适用于解决传统方法难以解决的复杂的、非线性问题，可广泛应用于组合优化、离散优化、工程优化等领域。旅行商问题是一种NP难的组合优化问题，具有重要的理论研究价值和实际应用背景。然而，传统遗传算法中存在有不足，需要提出新的改进的遗传算法，并应用于旅行商问题的求解。-Genetic algorithm is based on Darwin" s theory of evolution of an intelligent optimization algorithm, a complex system can be used to optimize the robustness of the search algorithm, the application of traditional methods to solve difficult and complex, nonlinear problems, can be widely used in combination optimization, discrete optimization, engineering, optimization and other fields. Traveling Salesman Problem is a NP hard combinatorial optimization problem, has important theoretical value and practical application of research background. However, the traditional genetic algorithm, there is less than the need to introduce new improved genetic algorithm, and applied for solving the traveling salesman problem.

求圆周率的C#原代码 在数值计算中，一般的牛顿迭代法得到的数值具有截断误差，因此，用C#编写的可是实现任意精度的圆周率的计算程序-seeking ratio of the circumference C# source in numerical calculation, the general Newton iterative numerical method with the truncation error and therefore C# prepared But to achieve any degree of accuracy the circumference of the rate calculation procedures

参考文章 遗传算法是基于达尔文进化论的一种智能优化算法,一种可用于复杂系统优化的具有鲁棒性的搜索算法，适用于解决传统方法难以解决的复杂的、非线性问题，可广泛应用于组合优化、离散优化、工程优化等领域。旅行商问题是一种NP难的组合优化问题，具有重要的理论研究价值和实际应用背景。然而，传统遗传算法中存在有不足，需要提出新的改进的遗传算法，并应用于旅行商问题的求解。-Genetic Algorithm article reference Darwin" s theory of evolution is based on an intelligent optimization algorithm, a complex system can be used to optimize the robustness of the search algorithm, the application of traditional methods to solve difficult and complex, nonlinear problems, can be widely applied in combinatorial optimization, discrete optimization, engineering, optimization and other fields. Traveling Salesman Problem is a NP hard combinatorial optimization problem, has important theoretical value and practical application of research background. However, the traditional genetic algorithm, there is less than the need to introduce new improved genetic algorithm, and applied for solving the traveling salesman problem.

Delphi编写的点对点传文件程序-Delphi peer-to-peer file-procedures

详细阐述了网络中的最大流量的实现方法，并编写了实现算法。-Elaborated in detail on the largest network flow method and the preparation of the algorithm.