各位大神，在这里谢过了！！！！_iphone4s吧_百度贴吧
&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&签到排名：今日本吧第个签到，本吧因你更精彩，明天继续来努力！
本吧签到人数：0成为超级会员，使用一键签到本月漏签0次！成为超级会员，赠送8张补签卡连续签到：天&&累计签到：天超级会员单次开通12个月以上，赠送连续签到卡3张
关注：552,951贴子：
各位大神，在这里谢过了！！！！收藏
手机进水了，后来放在防潮珠里一晚又好了可是不知为何屏幕两边老有白色两条杠，玩热了又没了，这是怎么回事呢？谢谢！！
排线问题吧应该
屏幕有水气，关机拆后盖，用风筒吹，然后放进米缸，第二天拿出来就没事了
换个屏幕。
登录百度帐号推荐应用
为兴趣而生，贴吧更懂你。或求人工蜂群算法的c程序源代码``````谢谢各位大神了``````_百度知道
求人工蜂群算法的c程序源代码``````谢谢各位大神了``````
因为毕业设计要用到这方面的东西`````求各位大神了
提问者采纳
phi_{ij}*(x_{kj}-x_{ij}) *&#47, 108-132;}void SendEmployedBees(){
for(j=0;sqrt((double)(j+1)))*M_PI)/double GlobalM
for(j=0;i++)
GlobalParams[i]=Foods[0][i];
neighbour=(int)(r*FoodNumber).5)*2;
if (solution[param2change]&lt, it is shifted onto the boundaries*/
/*if generated parameter value
/*if the solution i
} for (i=0;j++)
solution[j]=Foods[i][j];}}/j&D;
fitness[i]=FitnessS*C
double maxfit.tr)*/
for(j=0;&double FitnessSol.;
while(neighbour==i)
(double)rand() /* A food source is chosen with the probability which is proportioal to its quality*/srand(time(NULL));
neighbour=(int)(r*FoodNumber);
/double top=0;
result=1+fabs(fun), } double Rastrigin(double sol[D]) {
f[i]=ObjValSol. The number of rows of Foods matrix equals to the FoodNumber*/*The number of food sources equals the half of the colony size*/* Counters of food sources are also initialized in this function*/j++){top=top+100*pow((sol[j+1]-pow((sol[j]);j++)
Foods[i][j]=solution[j]: %f\ &#47. Karaboga, 214;
if (FitnessSol&*GlobalMins holds the GlobalMin of each run in multiple runs*/ fitness[index]=CalculateFitness(f[index]);j&i++)
if (trial[i]&gt:3;*if generated parameter value
if (i==FoodNumber-1)
i=0;*Foods is the population of food sources, Intelligent Systems Research Gi& /D.h&&#47,(double)2). K*if */}return top.9*(fitness[i]/
SendScoutBees();
}}void SendOnlookerBees(){D;%d;FunctionCallback function = & trial[index]=0;/j++)
(double)rand() /*Write your own objective function name instead of sphere*/j++){top=top+sol[j]*sol[j].edu, Erciyes Usum(fitness)*/*while*/j&
}if(trial[maxtrialindex]&D, only one scout is allowed to occur in each cycle*&#47, ub[j] instead of lb and ub */for(run=0, AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION. Kfor (iter=0;i++)
top1=top1+pow((sol[j]); /
(double)rand() /FoodNi&
if (solution[param2change]&
if(fun&math: %e\maxfit)
maxfit=fitness[i]; &#47.*/D;j++)
solution[j]=Foods[i][j];/* Problem specific variables*/*Algorithm can be run many times in order to see its robustness*/
} } }&#47, it is shifted onto the boundaries*&#47.h&maxtrialindex=0;void CalculateProbabilities(){FoodNmaxC*param2change corrresponds to j. *&#47&#47.;
trial[i]=0;for(j=0;
for (i=0;* The number of colony size (employed bees+onlooker bees)*&#47,ISSN;/*If your function takes additional arguments then change function pointer definition and lines calling &
/double ObjValS/for(j=0;* Referance Papers*/ /
ObjValSol=function(solution);*Fitness function*/#include &lt.h&/ub)
solution[param2change]=ub, param2change, A powerful and Efficient Algorithm for Numerical Function O
for(j=0. */i&lt,(double)2)-10*cos(2*M_PI*sol[j])+10);
/ ((double)(RAND_MAX)+(double)(1)) );FoodN#include &
Foods[index][j]=r*(ub-lb)+i&* ABC algorithm coded using C programming language *//
CalculateProbabilities(),*D;j&#define runtime 30
param2change=(int)(r*D);*prob is a vector holding probabilities of food sources (solutions) to be chosen*/iter++)
SendEmployedBees();#define D 100 /void MemorizeBestSource(){double Rosenbrock(double sol[D]); 2009 Erciyes University, replace the solution with the mutant and reset the trial counter of solution i*/#define limit 100
/*The parameter to be changed is determined randomly*//
trial[i]=trial[i]+1;*Variables are initialized in the range [lb, Pages 687-697;j&#include &*If the mutant solution is better than th=limit){ init(maxtrialindex);(double)4000)*top1-top2+1, B, A Comparative Study of Artificial Bee Colony Algorithm, On The Performance Of Artificial Bee Colony (ABC) A* Artificial Bee Colony (ABC) is one of the most recently defined algorithms by Dervis Karaboga in 2005;GlobalMins[run]=GlobalM*a greedy selection is applied between the current solution i and its mutant*/j++)
Foods[i][j]=solution[j];=0)
result=1/#include &lt,top2;}/
t=0;*v_{ij}=x_{ij}+\*All food sources are initialized */
prob[i]=(0;mean=0:Dervis Karaboga (karaboga@*Different schemes can be used to calculate the probability values*/*Copyright ©*The parameter to be changed is determined randomly*/
t++,j;#define NP 20 /
solution[param2change]=Foods[i][param2change]+(Foods[i][param2change]-Foods[neighbour][param2change])*(r-0,j;
} f[index]=function(solution);
if(r&lt, Applied Soft Computing,i&lt.1007/
/ in the code*/*New solution (neighbour) produced by v_{ij}=x_{ij}+\*end of employed bee phase*/ /double CalculateFitness(double fun) {
double result=0;mean=mean+GlobalMj&double fitness[FoodNumber], B;
(double)rand() /*benchmark functions */fitness[i])
r = ((double)rand() &#47, The D trials is abandoned by its employed bee*/
MemorizeBestSource(): , ((double)(RAND_MAX)+(double)(1)) );
fitness[i]=FitnessSi++) { init(i);lb)
solution[param2change]=double sphere(double sol[D]);
for(j=0;j&
(double)rand() /void SendScoutBees(){int maxtrialindex. In Basic ABC; ((double)(RAND_MAX)+(double)(1)) );D;*Fitness value of new solution*&#47, Computer Engineering Department 2005;limit&j&(fun+1); /*fitness is a vector holding fitness (quality) values associated with food sources*/*The best food source is memorized*/prob[i]) &#47,Volume 8;*determine the food sources whose trial counter exceeds the &
neighbour=(int)(r*FoodNumber);,1)*&#47. of Computer Engineering*/*Optimum solution obtained by ABC algorithm*/n&GlobalParam[%d];double prob[FoodNumber];limit&
solution[j]=Foods[index][j];double GlobalMins[runtime];;/phi_{ij}*(x_{kj}-x_{ij})*/#define maxCycle 2500 /
double top1;
maxfit=fitness[0];2 &#47, increase its trial counter*/typedef double (*FunctionCallback)(double sol[D]);
top=(1/*If the mutant solution is better than th
f[i]=ObjValS
FitnessSol=CalculateFitness(ObjValSol). Basturk,(double)2)+pow((sol[j]-1);*trial is a vector holding trial numbers through which solutions can not be improved*/*D;max(fitness)+b*/
if (FitnessSol&
/*The number of cycles for foraging {a stopping criteria}*/*onlooker Bee Phase*/180);phi_{ij}*(x_{kj}-x_{ij}) j is a randomly chosen parameter and k is a randomlu chosen solution different from i*/D,(double)2); } GlobalMin=f[0];*A food source which could not be improved through &#define lb -100 /fitness[i])
/;&#47,ub],GlobalMin), Engineering F&#47.h&gt. BGlobalMin)
GlobalMin=f[i];*The number of parameters of the problem to be optimized*/j&
if (solution[param2change]&*a random number in the range [0, replace the solution with the mutant and reset the trial counter of solution i*/FoodNumber, B;D;
neighbour=(int)(r*FoodNumber);
for(i=0, I ((double)(RAND_MAX)+(double)(1)) ), January 2008;
FitnessSol=CalculateFitness(ObjValSol), /
(double)rand() //
SendOnlookerBees();*probability values are calculated by using fitness values and normalized by dividing maximum fitness value*/*or in a way used in the metot below prob(i)=a*fitness(i)/j++)
printf(&double Rastrigin(double sol[D]);double Foods[FoodNumber][D];*Randomly selected solution must be different from the solution i*/* Control Parameters of ABC algorithm*/i++) { if (f[i]&lt, November 2007; ((double)(RAND_MAX)+(double)(1)) );i&j++)
top=top+(pow(sol[j]; for(i=0;*Randomly selected solution must be different from the solution i*&#47,i;run++){initial();;double top=0. Ai++)
if (fitness[i]& / }&#47,run+1.void init(int index){*A randomly chosen solution is used in producing a mutant solution of the solution i*/
/ ((double)(RAND_MAX)+(double)(1)) ); &#47: Artificial Bee Colony (ABC) A
double top=0,
Applied Mathematics and C*choose a food source depending on its probability to be chosen*/}&#47, motivated by the intelligent be*end of onlooker bee phase
solution[param2change]=Foods[i][param2change]+(Foods[i][param2change]-Foods[neighbour][param2change])*(r-0;double GlobalParams[D];/
i++;*Objective function value of new solution*/
trial[i]=trial[i]+1;*a greedy selection is applied between the current solution i and its mutant*/*f is a vector holding objective function values associated with food sources */i&
param2change=(int)(r*D), use arrays lb[j];j++)
GlobalParams[j]=Foods[i][j];#define FoodNumber NP/ub)
solution[param2change]=
top1=0;double solution [D];#include &*A randomly chosen solution is used in producing a mutant solution of the solution i*/getch();double f[FoodNumber];
&#47. If each parameter
top=0;*D,(double)2));}&#47.5)*2;
}printf(&quot, Vtrial[maxtrialindex])
maxtrialindex=i;*D;/*upper bou/for (i=1; ((double)(RAND_MAX)+(double)(1)) );
top2=top2*cos((((sol[j])/*if the solution i can not be improved: 10;
}&#47, 2009. */
ObjValSol=function(solution),TECHNICAL REPORT-TR06;}double sphere(double sol[D]){
while(neighbour==i)
(double)rand() /Means of %#define ub 100 /*a function pointer returning double and taking a D-dimensional array as argument *&#47,j;*Employed Bee Phase*/iter&} ((double)(RAND_MAX)+(double)(1)) );MemorizeBestSource(). KD:459-171.1, Journal of Global On&quot,GlobalParams[j]);
/}double Rosenbrock(double sol[D]){FoodN*Main program of the ABC algorithm*/D-1,mean): %e &#92, neighbour corresponds to k in equation v_{ij}=x_{ij}+&#92.tr )Bahriye Basturk Akay (bahriye@erciyes:39; ((double)(RAND_MAX)+(double)(1)) );lb)
solution[param2change]= ((double)(RAND_MAX)+(double)(1)) );D;printf(&
if (solution[param2change]&*lower bouphi_{ij}*(x_{kj}-x_{ij}) */*For example prob(i)=fitness(i)/
trial[i]=0;}mean=mean&#47.h&gt. Each row of Foods matrix is a vector holding D parame//maxfit))+0;D;
r = ((double)rand() /int main(){int iter, increase its trial counter*&#47, Issue 1;void initial(){ int i.=function(solution);
}double Griewank(double sol[D]);FoodNumber)
(double)rand() /*Parameters of the optimum solution*/j&lt,j;j&/
return top. lb and ub can be defined as arrays for the problems of which parameters have different bounds*/ /
/*v_{ij}=x_{ij}+\} double Griewank(double sol[D]) {double trial[FoodNumber]
提问者评价
谢谢大神了哦`````非常感谢你哈
其他类似问题
为您推荐：
工蜂的相关知识
等待您来回答
下载知道APP
随时随地咨询
出门在外也不愁拜托各位大神帮忙看下手相，万分感谢(^_^)？
女，92年7月17，想知道今后事业爱情方面，尤其是要继续学业或者开始工作？谢谢了 &img src=&/1bbc6bc475bf1bf4f1a306a8d0002973_b.jpg& data-rawheight=&1440& data-rawwidth=&1080& class=&origin_image zh-lightbox-thumb& width=&1080& data-original=&/1bbc6bc475bf1bf4f1a306a8d0002973_r.jpg&&&img src=&/b664ada56cc_b.jpg& data-rawheight=&1440& data-rawwidth=&1080& class=&origin_image zh-lightbox-thumb& width=&1080& data-original=&/b664ada56cc_r.jpg&&&img src=&/d2fbe98ffded0a9efa3f_b.jpg& data-rawheight=&1440& data-rawwidth=&1080& class=&origin_image zh-lightbox-thumb& width=&1080& data-original=&/d2fbe98ffded0a9efa3f_r.jpg&&
女，92年7月17，想知道今后事业爱情方面，尤其是要继续学业或者开始工作？谢谢了 …
按投票排序
谢邀。很多东西不是三言两语就能说的清楚的。就才能而言，你有能力读书读下去，你现在的运气是利读书的，一直到24岁为止，24岁之前靠上研究生问题应该不大。但是事实上工作可能是一个更佳的选择。如果你选择工作，那么要看你是做哪一行了，如果是打算在大企业工作的话，24-34这10年就是你提升的最好时间。如果你有创业的打算，这10年也是最好的光景，成功的概率也比较高，34岁之后就要保守一些了。过后之后未必有这样的机会。因为你在过去的过去的这些时间除了读书之外，其实整体运气是不行的，现在又站在了转运的点上，肯定是会比较迷茫的。明年开始好转，但是不会一步到位的，但会慢慢的好起来。姻缘这方面的回答不了你。只是你性格个性很强，容易伤到另一半，首先要提升自己的修养，其次的话可以选择异路姻缘以降低影响。
人不错的女孩，看着斯文女孩，其实批一根筋，比较固执倔强，而且理想主义的女孩，做事很仗义，不喜欢麻烦别人，做事能自己吃亏，都不不会让朋友吃亏的女孩，但是死要面子活受罪。一方面丢三落四，另一方面细致敏锐，反正比较纠结的一个人，。而且稍微不自信，比较敏感的了，很在意别人的看法
不知道你问什么问题，没法细致看，看手纹要双手，而且要要看到手腕。如果需要的话可以找我，。双手给我然后八字给我，我给你细致看看感情流年，工作事业财运这些的
男左女右，女的看右手。求助贴！谢谢各位大神了_新化吧_百度贴吧
&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&签到排名：今日本吧第个签到，本吧因你更精彩，明天继续来努力！
本吧签到人数：0成为超级会员，使用一键签到本月漏签0次！成为超级会员，赠送8张补签卡连续签到：天&&累计签到：天超级会员单次开通12个月以上，赠送连续签到卡3张
关注：23,635贴子：
求助贴！谢谢各位大神了收藏
想问新化东方文武学校怎么样呢？有没有在校的学生呀进来解答下十分感谢！在线等！急！
有没有附近的老乡的？
东方和南北合并了，现在旧址正在重建东方广场
出来几年了，还可以
现在在南北那里学，实力大了
学校招初中没读完的嘛？
我姐姐在里面教书
可以联系我
登录百度帐号推荐应用
为兴趣而生，贴吧更懂你。或求一个迅雷铂金会员账号！ 谢谢各位大神了，改密码死全家_百度知道
求一个迅雷铂金会员账号！ 谢谢各位大神了，改密码死全家
提问者采纳
表示就连迅雷云端都下不下来，高速。&nbsp。这个并不是迅雷所谓的“破解版”;&nbsp.迅雷会员提高你的下载速度只能达到你宽带的物理上线，因为是多人在用这一个账号，云播; 2，网游加速器等都可以使用;&&&&nbsp，本人一直在续费。此资源绝对无毒，就是说如果你1M的宽带想靠迅雷会员达到10M的速度！。&nbsp，附件一次也只能传一个，如果需要请追问索要，进度一直为零，有的资源你点击离线下载之后在离线空间里看，否则会出现掉线情况，担心有毒可以不下，不会过期;&nbsp！若密码万一不慎被改。<file fsid="" link="/share/link，永久分享，通过百度安全监测。&nbsp，解决一些服务器和资源热度问题，请在百度知道向我提问或私信联系我改回！，而且是白金会员，这个是包含本人自用迅雷白金会员账号和防踢补丁。请亲千万不要改密，登录使用。采纳满意答案哦，我也在使用，会造成很大的困扰;&nbsp，视频教程有100多兆，非常感谢，离线，会面临很大的封号危险！：1;若对本资源满意请采纳为满意答案，而是直接给你提供迅雷会员账号！如有不懂的请追问.迅雷会员并不能完美解决所有资源的下载，记得一定要按照说明复制那个文件（防踢补丁）到两个位置！！补充说明您好，那是不可能的。附;&nbsp！?shareid=&uk=" name="白金会员迅雷（自用号），就先不传了。里面有简单的使用说明和视频教程; 以上两点为所有迅雷会员的特征，一经发现必投诉举报，不用每次都求迅雷会员账号的;&&nbsp：抄袭本人答案和盗用本人资源者望三思，因为有很多人在使用，并不是说本资源有什么特别的缺陷，奉劝还是换一个资源
你号不是会员
白金会员，你肯定是看错了
提问者评价
其他类似问题
为您推荐：
铂金的相关知识
其他3条回答
你先发个全家福, 然后我给你迅雷会员号.
哈哈哈 已发，采纳
等待您来回答
下载知道APP
随时随地咨询
出门在外也不愁