最简练的记忆游戏

数值分析三角直接分解法-Numerial Analyse: Doolittle Analyze Arithmetic

孟吉通selisih angka dengan bahasa C.Inputan berupa angka。输出yang dihasilkan berupa angka selisih dari inputan yang dimasukan。

应用背景JPHide 和JPSeek 的源代码！JPHide&JPSeek是一个JPEG图像的信息隐藏软件！-JPHide and JPSeek source code! JPHide & JPSeek is a JPEG image information hidden software!关键技术JPHIDE and JPSEEK are programs which allow you to hide a file in a jpeg visual image. There are lots of versions of similar programs available on the internet but JPHIDE and JPSEEK are rather special. The design objective was not simply to hide a file but rather to do this in such a way that it is impossible to prove that the host file contains a hidden file. Given a typical visual image, a low insertion rate (under 5%) and the absence of the original file, it is not possible to conclude with any worthwhile certainty that the host file contains inserted data. As the insertion percentage increases the statistical nature of the jpeg coefficients differs from "normal" to the extent that it raises suspicion. Above 15% the e

已知电压信号序列，利用FFT计算该电压信号的各次谐波及其RMS值。-As the voltage signal sequence is known, FFT is used to calculate the value of harmonics and the voltage RMS value.

本程序采用循环单链表的算法来解决约瑟夫环问题：建立一个循环单链表，按顺序查找指定结点，找到后删除，最后打印删除的编号序列。- This procedure uses circulates Shan Lianbiao algorithm to solve the Joseph link problem: Establishes to circulate Shan Lianbiao, assigns the point according to the smooth search, after found deletes, finally prints the serial number sequence which deletes.

vc下实现的最优化程序代码-vc achieve the optimal code

大家请多指教-you please enlighten!

资源描述自己包装的openssl库自己包装的openssl库自己包装的openssl库自己包装的openssl库自己包装的openssl库

利用Gauss积分公式进行数值积分，将区间 细分成n个相等的子区间，然后在每个上使用经过修改适用于不同子区间的三点Gauss公式计算积分的值，然后求和。-Using Gauss integral formula for numerical integration, will be subdivided into n-equal interval sub-intervals, and then apply to each use of a modified three-point range in different sub-Gauss formula to calculate the value of points, and then summed.

一种好的改进遗传算法function [opy,optimy]=GA(pt,gennum,psize)% 输入参数：% pt       m*n的加工时间矩阵（n是工件数目，m是机器数目）由已知给的T矩阵，可得n=100,m=10% gennum   迭代的次数（代数）% psize    种群的规模大小%输出参数：% opy       最优的Makespan值pc=0.9;%交叉因子pm=0.1;%变异因子[m,n]=size(pt);current_gen=1;%current_gen means the current generationnewgen=zeros(psize,n+1); %mewgen is the new generation of the populationnewgen(1:psize,1:n)=rand(psize,n);%主种群初始化，0-1之间的随机数 %Generalize the initial groupfather=zeros(2,n); %father is used to store the two genes for crossover and mutation avgen=zeros(1,gennum); %avgen is the matrix of the average of all the generationsoptimx=zeros(1,n);optimy=ones(1,gennum);%Generalize the initial groupfor i=1:psize    [Ya,pop(i,1:n)]=sort(newgen(i,1:n));%种群排序，实数编码转换为自然数编码 随机生成的0-1之间的小数进行排序然后取每个从小到大数对应的位置    newg