一个小程序的画，不完善，请给精上传，谢谢大家

Newton插值多项式,这里才用6组数据进行测试.每步详细记录计算过程-Newton interpolation polynomial, here only six sets of data used for testing. Detailed records of each step calculation process

一个ASP.NET操作Excel文档的类,CSharp实现-ASP.NET operate a type of Excel document, CSharp realize

Simple address book written in c-Simple address book written in c++

Rotating shafts experience a an elliptical motion called whirl. It is important to decompose this motion into a forward and backward whil orbits. The current function makes use of two sensors to generate a bi-directional spectrogram. The method can be extended to any time-frequency distribution ％ ％ compute the forward/backward Campbell/specgtrogram ％ ％ INPUT: ％ y (n x 2) each column is measured from a different sensor ％ /////// ％ __ ％ |s1| y(:,1) ％ |__| ％ __ ％ / ________|/ ％ | | | s2 |/ y(:,2) ％ \____/ --------|/ ％ ％ Fs Sampling frequnecy ％ ％ OUTPUT: ％ B spectrogram/Campbel diagram ％ x x-axis coordinate vector (time or Speed) ％ y y-axis coordinate vector (frequency [Hz]) -an experience a elliptica l motion called whirl. It is important to decomp Rose this motion into a forward and backward whil orbits. The current function makes use of two se nsors to generate a bi-directional spectrogra m. The method can be extended to any time-freque ncy di

C6000DSP的C语言程序示例 一共有3个 内容不错，希望能对有需要的朋友有帮助。-C6000DSP C language program an example of a total of three as well, the hope is to have a friend in need of help.

清华大学足球机器人大赛程序。-Qinghua University soccer robot competition procedures.

课程设计，SQL写的一些说明，大家看看有需要没有。-curriculum design, SQL to write some note, we see no need.

很好的一段源码 ，并具有加强难度等功能。-For some very good source, and has features such as strengthening the degree of difficulty.

防火墙和网络安全方面的测试规范和国家标准，主要是将硬件防火墙。-Core 墙 kite out false 全 She determined the source of fermentation试Master lonesome cavity mode范和disadvantages Catalpol准Corrections lynx Did Wei ，硬glass out kite 墙 。

最佳适应算法是动态内存分区分配算法的一种。所谓“最佳”是指每次为作业分配内存时，总是把能满足要求、又是最小的空闲分区分配给作业，避免“大材小用”。为了加速寻找，该算法要求将所有的空闲分区按其内容以从小到大的顺序形成一空闲分区链。这样，第一次找到的能满足要求的空闲区，必然是最佳的。-best adaptation algorithm is a dynamic memory allocation through an algorithm. The so-called "best" means the operation of each memory allocation, always meet requirements, and also the smallest area allocated to idle operations, to avoid "a waste of talent." To speed up the search, the algorithm requires that all leisure district according to content from small to large order of the formation of a regional chain idle. So, the first found to meet the requirements of the free zone will be the best.