曼彻斯特编解码 Xilinx提供 Verilog代码manchester_verilog

特征值和特征向量的计算,每种算法都用c++以函数形式实现- The characteristic value and the characteristic vector computation, each algorithm all uses c to realize by the function form

辛普生数值积分，已在TC2.0环境中编译通过-Health numerical integration Simpson has been compiled WITH TC 2.0 environment through

如何在weka中加入自己的算法，对于增加新的算法以开发自己的数据挖掘工具。很有用-How to weka add their own algorithms, for adding new algorithms to develop their own data mining tools. Useful

采用了基本的蚁群算法来求解0-1背包问题，该算法不仅可以对0-1背包问题进行求解，还可以对多维背包问题进行求解。-Using the basic ant colony algorithm to solve the 0-1 knapsack problem, the algorithm not only for the 0-1 knapsack problem can be solved, but also multi-dimensional knapsack problem can be solved.

关于阵列信号处理的一个C++代码，关于经典的MVDR波束形成算法。自适应Capon波束形成器(Capon Beamforming)的实现算法，具有MFC界面。该算法是先进的，广泛使用在信号处理和通信领域的有效波束形成算法。一个自适应Capon波束形成器(Capon Beamforming)的实现算法。该算法是先进的，广泛使用在信号处理和通信领域的有效波束形成算法。

自己编写的柏松分布函数算法， Poisson Distribution Util.java 已经经过项目测试了1-20阶乘  1-170的阶乘 都能满足

实习性 动态数组(第二版) 大量数据的管理是很多程序员的心病，很难找到一个速度快、效率高、支持超大规模数据的表动态数组是一个功能强大的列表形数据管理链表，利用它可以轻松实现超大数据量的随机插入、删除、修改等操作，它另外一个特点就是速度极快，内存利用率高。 -Practice of dynamic arrays (Second Edition) a large amount of data management is the heart of many programmers, it is difficult to find a fast, high efficiency, support for ultra-large-scale data table dynamic array is a powerful list of shape data management list using it can easily realize large amount of data random insert, delete, modify, such as operation, it is another feature of this approach is extremely fast, high memory utilization.

输入汉诺塔的总阶数，就可以显示汉诺塔的移动步骤，即每一步的移动，最后显示移动的总次数-Enter the Tower of Hanoi s total order, we can show the movement of Hanoi Tower, that is, to every step of the movement, and finally show the total number of mobile

％1998年全国大学生数学建模竞赛A题：收益与风险 模型求解- In 1998 the national university student mathematics modelling competed the A topic: The income and the risk model solve

Learnin Mathematics with the ABACUS Activity-book part 5