经典的C++学习

这是别人写的编程经验,现传上来与大家共享-This is written by someone else programming experience, and now onto Chuan share

ASP.NET 行家入门实务是本人看的第一本.net 书-Introduction to ASP.NET expert practice is the first book I look. Net book

cop2000文件一点很好 ] 可以 能够用 哈哈 哈哈哈啊-A LITTLE cop2000 document good] to be able to use哈哈哈哈哈ah

提出了一种计算Mel频倒谱参数特征的改进算法, 该算法采用了加权滤波器分析技术来提高语音信号低频部分的频谱分辨率,使之更符合人类听觉系统的特性。-Proposed a method for calculating parameters of Mel-frequency cepstral features improve the algorithm, which uses a weighted filter analysis techniques to improve the voice signal low-frequency part of the spectrum resolution, to make it more in line with the characteristics of the human auditory system.

Prentice Hall - Multithreaded Programming with JAVA Technology-Prentice Hall- Multithreaded Programming with JAVA Technology

S. Haykin：自适应滤波器原理第四版的matlab代码-S. Haykin: Adaptive Filter principle of the fourth edition of the matlab code

Photoshop教程介绍使用，共有九章，非常透彻

文件上传下载系统源码，-file upload download source code.

一个Visual,C,MFC,的简明教程,还不错哦,可值得选择一看- Visual, C, MFC, concise course, but also is good oh, may be worth choosing as soon as looked

约瑟夫（Joeph）问题的一种描述是：编号为1,2,…,n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始任选一个正整数作为报数上限值m，从第一个人开始按顺时针方向自1开始顺序报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止。试设计一个程序求出出列顺序。-Joseph (Joeph) a description of the problem is: numbered 1,2, ..., n, n individuals sitting clockwise circle, each holding a password (positive integer). An optional start a positive integer as the number of reported upper limit of m, from the first person to embark on the clockwise direction starting from a reported sequence number, to report the number of m stop reported. Those who reported m out of the column, his password as the new m value, from his home in a clockwise direction on the next person started to re-reported from a few, and so on, until all of the column until all the up. Try a program designed to find out the column order.