聪明文档网
最新最全的文档下载
当前位置：
首页> 正在进行安全检测...
正在进行安全检测...
时间：2023-11-17 10:00:54 下载该word文档
竭诚为您提供优质文档/双击可除
sci论文写作模板(葵花宝典 .pdf
篇一：sci论文模板Runningtitle:lietal.on….
animprovedshuffledfrog-leapingalgorithmforknapsackp roblem authors’name
affiliation correspondenceautuor(通讯作者：:tel/faxxxx;e-mail:xxxabstract
shuffledfrog-leapingalgorithm(sFlahaslongbeenconsideredasnewevolutionaryalgorithmofgroupevolution,andhasahighcomputingperformanceandexcellentabilityforg lobalsearch.knapsackproblemisatypicalnp-completepro
117
blem.Forthediscretesearchspace,thispaperpresentstheimprovedsFla,andsolvestheknapsackproblembyusingthealgorithm.experimentalresultsshowthefeasibilityandeffectivenessofthismethod.
keywords:shuffledfrog-leapingalgorithm;knapsackproblem;optimizationproblem0introduction
knapsackproblem(kpisaverytypicalnp-hardproblemincomputerscience,whichwasfirstproposedandstudiedbydantzinginthe1950s.therearemanyalgorithmsforsolvingtheknapsackproblem.classicalalgorithmsforkparethebranchandboundmethod(babm,dynamicprogrammingmethod（分支 界定法和动态规划 法）,etc.however,mostofsuchalgorithmsareover-relianceonthefeaturesofproblemitself,thecomputationalvolumeofthealgorithmincreasesbyexponentially,andthealgorithmneedsmoresearchingtimewiththeexpansionoftheproblem.intelligentoptimizationproblemforsolvingnparetheantcolonyalgorithm,greedyalgorithm,etc.suchalgori thmsdonotdependonthecharacteristicsoftheproblemitse
217
lf,andhavethestrongglobalsearchability.Relatedstudieshaveshownthatitcaneffectivelyimprovetheabilitytosearchfortheoptimalsolutionbycombiningtheintelligentoptimizationalgorithmwiththelocalheuristicsearchingalgorithm.
shuffledfrog-leapingalgorithmisanewintelligentoptimizationalgorithm,itcombinestheadvantagesofmemealgorithmbasedongeneticevolutionandparticleswarmalgorithmbasedongroupbehavior.ithasthefollowingcharacteristics:simpleinconcept,fewparameters,thecalculationspeed,globaloptimizationability,easytoimplement,etc.andhasbeeneffectivelyusedinpracticalengineeringproblems,suchasresourceallocation,jobshopprocessarrangements,travelingsalesmanproblem,0/1knapsackproblem,etc.however,thebasicleapfrogalgorithmiseasytoblendintolocaloptimum,andthusthispaperimprovedtheshuffledfrog-leapingalgorithmtosolvecombinatorialoptimizationproblemssuchasknapsackproblem.experimentalresultssho wthatthealgorithmis effectiveinsolvingsuchproblems.
1themathematicalmodelofknapsackproblem
317
knapsackproblemisanp-completeproblemaboutcombinatorialoptimization,whichisusuallydividedinto0/1knapsackproblem,completeknapsackproblem,multipleknapsackproblem,mixedknapsackproblem,thelatterthreekindscanbetransformedintothefirst,therefore,thepaperonlydiscussedthe0/1knapsackproblem.themathematicalmodelof0/1 knapsackproblemcanbedescribedas: nmaxxivii0nxwc(x1or0,i1,2,...,niiii0
where:nisthenumberofobjects;wiistheweightoftheithobject(i=1,2 … n;viisthevalueoftheithobject;xiisthechoicestatusoftheithobject;whentheithobjectisselectedintoknapsack,definingvariablexi=1,otherwisexi=0;cisthemaximumca pacityofknapsack. 2thebasicshuffledfrog-leapingalgorithm
itgeneratespfrogsrandomly,eachfrogrepresentsasolutionoftheproblem,denotedbyui,whichisseenastheinitialpopulation.calculatingthefitnessofallthefrogsinthepo pulation,andarrangingthefrogaccordingtothedescendin
417
goffitness.thendividingthefrogsoftheentirepopulationintomsub-groupof,eachsub-groupcontainsnfrogs,sop=m*n.allocationmethod:inaccordancewiththeprincipleofequalremainder.thatis,byorderofthescheduled,the1,2,...,nfrogswereassignedtothe1,2,....,nsub-groups
separately,then+1frogwasassignedtothefirstsub-group,andsoon,untilallthefrogswereallocated.
Foreachsub-group,settingubisthesolutionhavingthebestfitness,uwisthesolutionhavingtheworstfitness,ugisthesolutionhavingthebestfitnessintheglobalgroups.then,searchingaccordingtothelocaldepthwithineachsub-group,andupdatingthelocaloptimalsolution,updatingstrategyis:
minint(rand(ubuw,smax,ubuw0smaxint(rand(ubuw,smax,ubuw0uquws
where,sistheadjustmentvectorofindividualfrog,smaxis thelargeststepsizethatisallowedtochangebythefrogind
517
ividual.Randisarandomnumberbetween0and1. 3theimprovedshuffledfrog-leapingalgorithmforkp
afrogisonbehalfofasolution,whichisexpressedbythechoicestatusvectorofobject,thenfrogu=(x1,x2,…,xn,where,xiisthechoicestatusofthei-thobject;whenthei-thobjectisselectedintoknapsack,definingvariablexi=1,oth erwisexi=0;f(i,thefitness functionofindividualfrogcanbedefinedas:3.1thelocalupdatestrategyoffrog
thepurposeofimplementingthelocalsearchinthefrogsub-groupistosearchthelocaloptimalsolutionindifferentsearchdirections,aftersearchinganditeratingacertainnu mber 篇二：「新约」约翰23书
「新约」约翰23书.txt鲜花往往不属于赏花的人，而属于牛粪。。。道德常常能弥补智慧的缺陷，然而智慧却永远填补不了道德空白人生有三样东西无法掩盖：咳嗽贫穷和爱，越隐瞒，就越欲盖弥彰。这“作长老的”，是何许人也？1:1“作长老的”是约翰，耶稣十二位门徒之一，也是约翰福音、约翰书信和启示录的作者（参约13章人物介绍） 。这封信在
617
约翰一书之后不久写成，为要警告信徒防备假教师。收信人是“蒙拣选的太太和她的儿女”，所以可能是写给某位妇人，或者某所教会的。这信大概写于以弗所。“真理”，是
1:1-4“真理”是指耶稣基督的真理，与假教师的错谬理论相对（参约壹2:21-23）。相爱又岂是要说出来的！这我同意，相爱当然不可以只“说”，还要你会如何实践？1:5-6基督徒彼此相爱是新约中常常出现的主题，而爱邻舍却是一项古老的命令，早在摩西五经中就已提到（参利19:18）。有许多方法可以表达我们的爱心，例如排除偏见和歧视、接纳别人、聆听、扶助、施予、服事和不论断别人等。我们只知道神的命令是不够的，还要把命令付诸行动（参太22:37-39；约壹2:7-8）。假教师对耶稣的看法通常是
1:7当时，很多假教师说灵界是良善的，物质是丑恶的。因此他们推论，耶稣不可能同时是神又是人。约翰强烈地警告信徒要提防这等教导。今天仍然有好些假教师，他们对耶稣的看法并不合乎圣经。他们是危险人物，因为他们歪曲真理，损害基督教信仰的根基。他们可能使用一些原来的字词，却篡改了原来的意思。你的教师的生活方式更能显示他们心里的信念。（有关检验真教师的方法，请参约壹4:1。）满足的恩赐，很吸引人的呢！我也可以得到？真的？
717
1:8约翰所指的“满足的赏赐”并不是救恩，而是忠心事奉的奖赏。所有看重真理、坚持真理的人，都会得到满足的赏赐；那些为自己而活，教导错误道理的人，则将失去赏赐（参太7:21-23）。
面对传异端的人，就要拒绝？这
1:10约翰吩咐信徒，不要接待假教师，