资源列表
VC_Kalman
- 这是用vc来写的卡尔曼滤波程序，可以运行，不需要解压密码，谢谢！-This is used to write vc Kalman filtering process can run without extracting passwords, Thank you!
zixiangsifenxing
- 自相似分形的MATLAB程序,来源于物理系学生,请广大读者给于批评与指正.-self-similar fractal MATLAB, students from the Department of Physics, to the readers to criticism and correction.
MiniPascalCompiler
- 用mfc编的一个mini pascal compiler，有交互界面，方便用户操作，对于学编译原理以及正在研究mfc的同学来说，是相当不错的参考源码。-mfc series with a mini pascal compiler, interactive interface user-friendly operation, the compiler theory and science is studying mfc students, it is a fairly good reference
wsUpload-2.1.1.tar
- goahead公司的web服务器源代码中关于文件上传的补丁代码-goahead to the company web server source code on the file upload code patch
lessonresouse
- 程序代码说明 P0301：数字图像矩阵数据的显示及其傅立叶变换 P0302：二维离散余弦变换的图像压缩 P0303：采用灰度变换的方法增强图像的对比度 P0304：直方图均匀化 P0305：模拟图像受高斯白噪声和椒盐噪声的影响 P0306：采用二维中值滤波函数medfilt2对受椒盐噪声干扰的图像滤波 P0307：采用MATLAB中的函数filter2对受噪声干扰的图像进行均值滤波 P0308：图像的自适应魏纳滤波
Wumpus
- 人工智能中的有关Wumpus世界的源程序 功能非常强大-artificial intelligence of the Wumpus source in the world is very powerful
456456413786
- 数据结构课程设计打包下载，包括两个1.约瑟夫环 2.最小生成树问题！！！我已经交给老师，发给大家参考一下-data structure course design package download, including two one. Josephus 2. The minimum spanning tree problem! ! ! I was handed over to the teachers, to your reference! !
456456415
- 题目：若要在n个城市之间建立通信网络，只需要假设n－1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题。-topics : n if the city between communication networks, need only assume that n-1 line can be. How the lowest economic cost of building the communications network, the network is a minim
nasm-0.98.39-src
- nasm assembly language assembler.Hope everybody can use it wondfully.-NASM assembly language assembler.Hope ev erybody can use it wondfully.
ReadCh16
- 从16x16字库中读内容的小程序,使用visual C++开发。仅供初学者使用-from 16x16 character read as a small, the use of visual C development. Only beginners
PocketWine_arm
- A wine database for Pocket Windows-A wine database for Windows Pocket
printdamp
- 控制工具箱的一点应用，希望对大家有所帮助，希望大家可以互相交流-toolbox control point applications, we want to help, we can hope that mutual exchanges