混凝土配料控制中的控制.

增加访问量 广告制作的共略密集略密集-Increase traffic advertising produced a total of slightly abbreviated intensive-intensive

哈尔滨工业大学的一个经典的DSP课件，做的非常好 与大家分享-Harbin Institute of Technology, a classic DSP courseware, to do the very good to share with you

搜索算法搜索算法搜索算法搜索算法搜索算法

给定一个正整数 n，计算有多少个不同的连续自然数段，其和恰为 n。例如，当 n=27 时，有4个不同的连续自然数段的和恰为27：2+3+4+5+6+7；8+9+10；13+14；27。 -Given a positive integer n, calculate the number of consecutive natural number of different paragraph, and its and exactly n. For example, when n = 27 when the four have a different section of consecutive natural numbers and exactly 27:22 B! 3+ 4+ 5+ 6+ 7 8+ 9+ 10 13+ 14 27.

Effective C++ Third Edition 55 Specific Ways to Improve Your Programs and Designs By Scott Meyers ............................................... Publisher: Addison Wesley Professional Pub Date: May 12, 2005 Print ISBN: 0-321-33487-6 Pages: 320 -Effective C Third Edition 55 Specific Ways to Improve Your Programs and Designs By Scott Me yers .............................. ........... Publisher : Addison Wesley Professional Pub Date : May 12, 2005 Print ISBN : 0-321-33487-6 Pages : 320

信息论与编码教程的课后练习答案。原书为傅祖芸老师编写。-Information Theory and Coding tutorial answers to the exercises. Zu Yun Fu originally written for the preparation of teachers.

图论 二分图匹配匈牙利算法 ppt 希望对大家有帮助-Graph theory, two sub-graph matching algorithm ppt Hungary want to help everyone

“突破邮箱附件大小限制”是一遍文章，它教你如何解决邮件附件大小的限制，- "The breakthrough mailbox appendix size limit" is an article, how does it teach you to solve the mail appendix size limit,

如何编写structured VHDL代码.(英文)-how to prepare structured VHDL code. (English)

Vc.Net入门与提高源码-Vc.Net entry and increase FOSS