包括:JavaScript技术讲座 JAVASCRIPT语言教程 JavaScript源代码集

使用MFC的书籍,为你使用MFC打下基础-use MFC books, as you lay the foundation for the use of MFC

数字信号处理及MATLAB实现 IIR digital filter-IIR digital filter

5美分标签的实现(RFID低成本实现的关键)-5 cents labeling the realization (RFID key to the realization of low-cost)

详细介绍JPEG2000的编码原理和建议了FPGA实现结构-Detailed introduction JPEG2000 coding principles and recommendations of the FPGA structure

informix不错的书籍,适宜本部错的学系书籍-good books, appropriate headquarters wrong faculties books

IEEE 802.11b-1999 Supplement to 802.11-1999,Wireless LAN MAC and PHY specifications: Higher speed Physical Layer (PHY) extension in the 2.4 GHz band -IEEE 802.11b-1999 Supplement to 802.11-1999, Wireless LAN MAC and PHY specifications: Higher speed Physical Layer (PHY) extension in the 2.4 GHz band

蚁群算法的演示程序用vc++开发的,希望对大家有帮助，这是我费了半天才下载的-use vc++ develop

Java图形界面开发：SWT全接触 -The development of Java graphical interface: SWT Keys development of Java graphical interface: SWT Keys

8051教程默罕默德第二版台湾成功大学内部教材-8051 Tutorial Mohammed Cheng Kung University in Taiwan within the second edition of textbooks

舞伴问题假定在一舞会上，男士排成一队，女士排成一队。跳舞开始时，依次从男队和女队的队头各出一人配成舞伴。若两队初始人数不相同，则较长的那一队中未配对者等待下一轮舞曲。设计要求：模拟上述舞伴系统，并能计算对于任何男士A和女士B在哪一轮舞曲中的k次跳舞？ -Question assumes that a dance partner, the men line up a team, ladies and line up a team. Dancing began, followed by men" s and women" s team from the team dubbed the first one from each partner. If the initial number of teams is not the same, then the longer of that team who is not waiting for the next round of the dance pairs. Design requirements: Analog the partner system, and can calculate for any men" s A and women dance in B in which a k-dance?