98年全国大学生数学建模竞赛B题"水灾巡视问题"模拟退火算法。...

ACM的一些比较简单题目，可以稍微锻炼编程能力。-ACM subject of a number of relatively simple, can be a little programming exercise capacity.

用vb写的有关科学计算方面的，包括求最大值，积分，统计，概率，矩阵运算等-used to write the relevant scientific computing, including seeking maximum points, statistics, probability, matrix operations, etc.

资源描述基于9轴传感器融合，串口输出姿态欧拉角。

标准dft，是标准的dft，虽然没有特别的地方，但对于了解其内涵或许有一定的帮助-normal dft

数字滤波器IIR设计C源代码,包括绘图.-Use IIR method to design the digit filter,realized by C language,and mapping is also included.

The program simulates a Nondeterministic Multitape Turing Machine. It works as ordinary (Deterministic) Turing Machine as well.

北京合众大公司的dsp开发板例子程序（关于矩阵运算)-Beijing UCO big companies example dsp development board (on the matrix)

B样条绘制，根据鼠标点击确定形值点，计算控制点然后绘制样条

二叉树后序遍历的非递归算法-binary tree traversal sequence of non- recursive algorithm

旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem) is a well-known field of mathematics problems. Assuming there is a travel business to visit n cities, he must choose which path to go, via the restriction is to visit each city only once and the last to go back to the original departure city. Path selection objective is to get the path distance for all paths are the minimum.