GA多目标优化问题

说明：  通过ETHERNET建立SIMATIC NET OPC 服务器与PLC 的S7连接(agsrjt7glohy8uihjnkvhmjfukydt5erfuygt7lo86o8lio)

tc下图形编程精彩的演示程序源代码-tc under graphical programming wonderful demonstration program source code

用WinAPI写的定时关机的小程序的源码，比较简单，作为参考。(Shutdown using WinAPI write a small program source code is relatively simple, as a reference.)

计算两个时间序列X和Y的传递熵，x2y是X到Y的传递熵，y2x是Y到X的传递熵(calculate transfer entropy)

说明：  tytyfere43779rtrtrtrtrt

一种很好的风玫瑰图画法，含测试数据。。。。。(Plot wind rose map in matlab and Excel)

Swarm,由圣塔菲研究所开发,用于复杂适应系统(CAS)仿真及其他(Swarm, developed by the Santa Fe Institute for Complex Adaptive System (CAS) simulation and other)

用C语言地震合成记录 里面包括计算反射系数 生成雷克子波 等部分 有点长 希望有用(Synthetic seismic records using C language, including calculation of the reflection coefficient which generate Leike Zi Bo and some other little long hoped that a useful)

3100 Tenx MCU Firmware -3100 Tenx MCU Firmware

编写筛选查找素数函数： 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.