altera ubs blaster 原理图

本人正需要用MSP430F149实现多种滤波功能。这是一些参考资料和程序代码，均为txt文档，希望有共同爱好者可以参看。-I now need to achieve a variety of filtering MSP430F149. These are reference materials and program code, both txt document, want to have a common fans can see.

仿真实现802.16 System-802.16 System Simulation

C 语言的学习，查询资料，可以温故而知新。初学者也可以用他来学习，效果会不错！- This is about C programming langrage .

Fortran常用算法程序集-徐士良间：第三章所有的源程序，欢迎寻找此书源程序的朋友下载使用　-Fortran algorithm commonly used procedures set- between徐士良: Chapter III of the source of all, welcome to the book to find friends to download the source code to use

MCI虽然调用简单，功能强大，可以满足声音文件处理的基本需要，但是MCI也有它的缺点，那就是它一次只能播放一个WAVE文件，有时在实际应用中，为了实现混音效果，需要同时播放两个或两个以上的WAVE文件时，就需要使用微软DirectX技术中的DirectSound了，该技术直接操作底层声卡设备，可以实现八个以上WAV文件的同时播放。-simple, powerful, voice processing documents to meet the basic needs, but MCI also has its shortcomings, it is only once a player WAVE documents, sometimes in practical application, in order to achieve mixing effects, need to play two or more WAVE documents, it is necessary to use Microsoft"s DirectX technology DirectSound, and the technology underlying direct audio equipment operation can be achieved over eight WAV files at the same time players.

what do you want to? an fox-what do you want to an fox

JDK开发工具安装过程和基本输入输出程序的运行结果及实验心得-JDK development tools, the installation process and basic input-output program running results and experimental experience

Can总线控制器sja1000的源程序,很有参考价值-Can Bus Controller sja1000 source, great reference value

The articular about PLSA

换乘次数最少是乘客出行时考虑的首要因素。描述了传 统的Dijkstra 算法,并分析了Dijkstra 算法不适合公交网络最优路径选择的原因。最后根据公交乘客可以步行小段 距离再转车的实际情况,提出一种基于换乘次数最少的公交最短路径改进算-takes the least number of passenger trips is considered the primary factor. Description of the traditional Dijkstra algorithm. and analysis of the Dijkstra algorithm is not suitable for transit network optimal path of choice. Finally, according to transit passengers will be able to walk away from a transfer above the actual situation, A proposed change to the least number of public transport operators to improve the shortest path