HHT

说明：  旅行商问题(TravelingSalesmanProblem，TSP)是一个经典的组合优化问题。经典的TSP可以描述为：一个商品推销员要去若干个城市推销商品，该推销员从一个城市出发，需要经过所有城市后，回到出发地。应如何选择行进路线，以使总的行程最短。从图论的角度来看，该问题实质是在一个带权完全无向图中，找一个权值最小的Hamilton回路。由于该问题的可行解是所有顶点的全排列，随着顶点数的增加，会产生组合爆炸，它是一个NP完全问题。(Traveling Salesman Problem (TSP) is a classic combinatorial optimization problem. The classic TSP can be described as: a merchandiser sells goods to several cities. The salesman starts from a city and needs to go through all the cities and return to the starting point. How to choose the route of travel so that the total journey is the shortest. From the point of view of graph theory, the essence of the problem is to find a Hamilton loop with the smallest weight in a completely undirected graph with weights. Since the feasible solution to this problem is the full permutation of all vertices, as the number of vertices increases, a combinatorial explosion occurs, which is an NP-complete problem.)

多项式的计算问题，这个小程序实现了多项式求积的算法-Polynomial computational problems, this small program to achieve a polynomial quadrature algorithm

用c语言实现艺术清屏- Realizes the artistic clear screen with the c language

Bouc-wen模型python程序，考虑了12个参数，没有考虑刚度退化。(Bouc-wen model python program. Twelve parameters are considered, and stiffness degradation is not considered.)

说明：  低通滤波，运用fft快速傅里叶变换，测试文件，已搭构框架(Low-pass filtering, FFT fast Fourier transform, test files, has been constructed framework)

黑客攻防实战技术完全手册：扫描、嗅探、入侵与防御(Technology is completely offensive and defensive combat hackers Manual: scanning, sniffing, and intrusion prevention)

实现混沌序列的产生于归一化，提供混沌时间序列预测的初始数据(The realization of the normalization of chaotic sequence)

说明：  // set_euler_xyz expects a vector containing the Euler angles in the format // (ax,ay,az), where ax is the angle of rotation around x axis, // and similar for other axes. // This implementation uses XYZ convention (Z is the first rotation).

Windows XP 下使用 VMware Workstation 安装和使用 Fedora 8-Windows XP using VMware Workstation to install and use Fedora 8

说明：  在Linux下用Gcc 4.3.1进行STM32开发入门(In Linux using Gcc 4.3.1 for the development of entry-STM32)