protel 　　ＤＸＰ　　　实 例 ３

基于平面波展开 传输矩阵计算2维矩形光子晶体模型 计算可得出相关图谱 handbook中除了参数说明还有参考文献等-Plane wave expansion based on the transfer matrix calculation of 2-D model calculation of rectangular photonic crystal patterns can be drawn from the relevant handbook of parameters except that there are references such as

介绍ar，和dtw两种算法，包含一个实际应用的例子-introduced ar, and two algorithms dtw, including a practical application examples

去除块效应的图像后处理算法文章，用adobe reader打开，详述编码块效应的去除-Removal of blocking the image post-processing algorithm article, using adobe reader to open, detailed coding block effect removal

file tokenizar in php simple program for indexing files

protel dxp 实 例 5- protel dxp 实 例 5

一款经典的小游戏，用C语言编写而成，内容不多，但是包括了全部的功能。-A classic game, by using C language, which few, but include all the features.

可以打开图片-Can open the picture

大学人事管理系统 大学人事管理系统-University of the University System of Personnel Management Personnel Management System University Personnel Management System

遗传算法求解函数的最大值，且函数只有一个变量。求函数f(x)=x+10*sin(5x)+7*cos(4x)，x∈[0,9]。染色体长度为20，交叉概率为0.95，变异概率为0.08，迭代次数为25。 程序修改后可以用于多参数函数的求解。

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