-
wogefasuanli
涡格法计算机翼的涡强，对不同剖面形状，拱度等进行了比较分析。并且与书籍上对比(Vortex lattice method the computer wing of the vortex is strong, the shape of different profiles, such as camber, a comparative analysis.)
- 2011-07-10 20:40:16下载
- 积分：1
-
win32code2
一个WIN32命令行分析程序的源代码.(a command-line analysis of a program's source code.)
- 2005-01-21 13:00:28下载
- 积分：1
-
STM32_SD
STM32F103VET6下的SD卡驱动，有需要的朋友请下。(rfef fsdfiw )
- 2011-12-02 11:12:43下载
- 积分：1
-
WSAChat
一个漂亮的聊天对话框程序，不错吼，好了，今天传 了这么多了，主人要是再不让我下，我真的要汔死了，所有的好东西都传上去了，(a nice chat dialog procedures, sounds good, a good that today- so many, If the owner did not allow me again, I really want to countries in the death, all the good things- up, and)
- 2007-01-25 14:40:06下载
- 积分：1
-
158012740vrml
说明： 有约束单一尺寸矩形样排的算法研究，非常实用简单供参考(Research on the Algorithm of Single Size Rectangular Spreading)
- 2019-05-01 19:23:12下载
- 积分：1
-
c++
说明： c++简明教程。
还在为看不懂c++书籍烦恼吗？有了这本书，c++不再难！(c++ Concise Guide. Still can not read c++ Books trouble? With this book, c++ Not difficult!)
- 2008-11-26 23:53:30下载
- 积分：1
-
vcvideo
VC++仿电影字幕滚动文字特效，使用了VC++自绘技术，其两个核心文件CreditsCtrl.cpp和CreditsCtrl.h已打包。
(VC++ imitation Subtitles scrolling text effects, using a self-drawn VC++, packaged two the core file CreditsCtrl.cpp and CreditsCtrl.h.)
- 2012-10-01 01:26:05下载
- 积分：1
-
anqn.com
vc++ 经点算法包 vc++所有算法(vc++ )
- 2010-07-22 14:58:42下载
- 积分：1
-
MyLOD
LOD技术显示复杂地形，利用openGL编程，vc6.0开发环境，推荐下载(Terrain LOD technology show, openGL programming, vc6.0 development environment, it is recommended to download)
- 2010-11-15 09:48:32下载
- 积分：1
-
ANN_1.1.2(Newest-Vision-2010-1-27)-
ANN是一个构造数据索引结果的程序，可以实现最近邻、KD树等功能。ANN is designed for data sets that
are small enough that the search structure can be stored in main memory (in contrast to approaches from databases that assume that the data resides in secondary storage). Points are assumed to be represented as coordinate vectors of reals (or integers). The distance between two points can be defi ned in many ways. ANN assumes that distances are measured using any class of distance
functions called Minkowski metrics. These include the well known Euclidean distance, Manhattan distance, and max distance.(One diffi culty with exact nearest neighbor searching is that for virtually all methods other
than brute-force search, the running time or space grows exponentially as a function of dimension.
Consequently these methods are often not signifi cantly better than brute-force search, except in
fairly small dimensions. )
- 2012-05-31 10:11:29下载
- 积分：1
