关于C++高级培训课程。它非常有用的人谁想要提高…

UML基础案例与应用。对你学习UML专业理论知识来说无疑是个好帮手，赶快动手吧！-UML case basis and applications. You learn UML professional theoretical knowledge is undoubtedly a good helper, hurry hands!

Convert Motorola & Intel Hex file to Binary file

一些常用的代码，包括文件输入输出，还有排序和搜索的一些代码-Some commonly used code, including file input and output, as well as sort and search a number of code

OFDM系统，子载波数目1024，前缀数目256，循环数目256，加入了高斯白噪声-OFDM system, the number of subcarriers 1024, the number prefix 256, the cycle number of 256, by adding a Gaussian white noise

台讯企业全站管理系统V2006 供下载时经过了严格的测试，但是这是一个复杂的程序，我们并不能保证程序没有BUG。 当然，如果您在使用本程序时发现了BUG和漏洞，请及时与我们联系。 本系统版权归HECHENn所有，您可以把这个程序应用于商业或者个人网站。 请不要修改程序的版权信息，也不要以任何形式发表所谓的修改版本。 admin/admin-Taiwan enterprises appear station management system available for downloading at V2006 after rigorous tests, But this is a complex process, we can not guarantee that procedures were not BUG. Of course, if you use this procedure and found a loophole BUG, please contact us promptly. HECHENn property of the system all, you can use the procedures used in commercial or personal websites. Please do not amend the copyright information, and not to any form of the so-called revised version. Admin/admin

csharp中异步变同步的基础类库,可以用来把大量的异步过程在同步过程中实现，可以参考相关的文章，因为原文章中这段代码都不完整，此处做了整理，把关键的代码补齐了-AsyncEnumerator and interlock source

该软件用于研究周期信号的混沌检测，通过Duffing方程，检测极微弱信号，非常有用。-software for the study of the cycle of chaotic signal detection through Duffing equation, detect very weak signal, very useful.

估计模型阶次的很有效的方法，调试通过，没有任何问题。-Estimated model order is very effective way to debug is passed, there is no problem.

显示地震剖面对地震专业的学生来说显示地震剖面特别重要本程序实现了地震剖面的绘制-Seismic profiles show that the earthquake professional students who show the seismic profiles of particular importance to realize this process of mapping the seismic profiles

编写筛选查找素数函数： void sieve(bool isPrime[], int n) 其中isPrime[ ]为一个布尔型数组，n为数组大小。由于2是第一个素数， 所以设置isPrime[0]和isPrime[1]的值为false，并设置其余的元素初值为true。 然后对从4到n－1的每一个i，判断i是否能够被2整除，如果i能够被2整除，则设置isPrime[i]为false。 对从2到n/2的每一个可能的数值重复以上处理，当操作结束时，所有值为true的isPrime[i]所对应的i就是素数，它们将是从筛子中掉下来的。-Find prime numbers prepared by screening the function: void sieve (bool isPrime [], int n) which isPrime [] as a Boolean array, n is the size of the array. Because 2 is the first prime number, so set the isPrime [0], and isPrime [1] a value of false, and set the initial value of the remaining elements of true. And then from 4 to n-1 for each i, to determine whether i can be divisible by 2, if i can be divisible by 2, then set the isPrime [i] is false. From 2 to n/2 possible values for each one to repeat the above processing, when the operation ended, all the true value of the isPrime [i] corresponding to i is a prime number, they will be falling from the sieve in the past.