简介：

简介：Thetrendofresearchinggroupradiofrequencyidentificationdevices(RFID)authenticationprotocolhasbecomeincreasinglypopularinrecentyears.OneofthenewestworkinthisareaisfromBatinaandLee,theypresentedaprivacy-preservingmulti-playersgrouping-proofprotocolbasedontheellipticcurvecryptography(ECC),andclaimedtheirprotocolhavetheabilitytoresistfivepotentialattacks,includingcompromisedtagattack,man-in-the-middleattack,colludingtagsattack,etc.Inthispaper,wefirsttakeacounterexampletodemonstratetheirprotocolisvulnerabletocompromisedtagattack.ThenweproposeanovelsecureRFIDauthenticationprotocol,andanalyzeitssecuritybymergingformalanalysis,provablesecurity,andmathematicalinductivemethod,soastosolvetheweaknessofBatinaandLee'swork.Furthermore,comparedwithanothertwoclassicprotocols(secureownershiptransferprotocol(SOTP)andsecuremultiplegroupownershiptransferprotocol(SMGOTP)),theperformanceanalysisshowthatourprotocolprovidesnotonlyalowertags'communicationcostatabout50.0%and14.3%,butalsoalowerreader'scomputationcost(approximate14.5%and55.1%respectively),whentransferringalargenumberoftags.

简介：Intheenvironmentofheterogeneouswirelessnetworks,itisvitaltoselectacurrentlyoptimalnetworkforapplicationsandsubscribers.Theuseofmultipleattributedecisionmaking(MADM)forheterogeneousnetworkselectioncanprovidesubscriberswithsatisfactoryservicequality.ConvertingheterogeneousnetworkselectionintoaMADMproblem,theauthorspresentanimprovedalgorithmforMADMbasedongroupdecisiontheory.Thealgorithmcombinesweightvectorsofmultipleattributedecisionmakingtoobtainacombinationalweightvector.Thentheresults’compatibilitywillbeassessed.Iftheydonotmeettherequirementsofcompatibility,thejudgmentmatrixwillbemodifieduntilacomprehensivevectorthatsatisfiescompatibilityrequirementsisproduced.Thevectoriscombinedwithsimpleweightingmethod(SAW)fornetworkselection.Simulationshowsthatthealgorithmcanprovideuserswithsatisfactoryqualityofservice(QoS).

简介：Timeefficiencyofkeyestablishmentandupdateisoneofthemajorproblemscontributorykeymanagementsstrivetoaddress.Toachievebettertimeefficiencyinkeyestablishment,weproposeaLocation-basedHuffman(L-Huffman)scheme.First,usersareseparatedintoseveralsmallgroupstominimizecommunicationcostwhentheyaredistributedoverlargenetworks.Second,bothuser'scomputationdifferenceandmessagetransmissiondelayaretakenintoconsiderationwhenHuffmancodingisemployedtoformingtheoptimalkeytree.Third,thecombinedweightsinHuffmantreearelocatedinahigherplaceofthekeytreetoreducethevarianceoftheaveragekeygenerationtimeandminimizethelongestkeygenerationtime.SimulationsdemonstratethatL-HuffmanhasmuchbetterperformanceinwideareanetworksandisalittlebetterinlocalareanetworkthanHuffmanscheme.

简介：Inthispaper,alocal-learningalgorithmformulti-agentispresentedbasedonthefactthatindividualagentperformslocalperceptionandlocalinteractionundergroupenvironment.Asforin-dividual-learning,agentadoptsgreedystrategytomaximizeitsrewardwheninteractingwithenvi-ronment.Ingroup-learning,localinteractiontakesplacebetweeneachtwoagents.Alocal-learningalgorithmtochooseandmodifyagents'actionsisproposedtoimprovethetraditionalQ-learningalgorithm,respectivelyinthesituationsofzero-sumgamesandgeneral-sumgameswithuniqueequi-libriumormulti-equilibrium.Andthislocal-learningalgorithmisprovedtobeconvergentandthecomputationcomplexityislowerthantheNash-Q.Additionally,throughgrid-gametest,itisindicatedthatbyusingthislocal-learningalgorithm,thelocalbehaviorsofagentscanspreadtoglobe.

简介：Anovelbroadcastencryptionschemeforgroupcommunicationscenariosindistributednetworksispresented.Inthescheme,anyoneisallowedtoencryptamessageanddistributeittoadesignatedgroup.Eachmemberinthedesignatedgrouphastheabilitytoindependentlydecryptaciphertext.Incontrasttotraditionalbroadcastencryption,allthevalidreceiversintheproposedschemecomposethedesignatedgroup.Totakeadvantageofthisproperty,atabforthegroupissetandthematchingprivatekeyforeachmemberisgenerated.Inaddition,beforedecryptingaciphertext,anyoneintheschemecanverifytheciphertext,toensurethattheciphertextiscorrect.Thispropertyisveryimportantforlarge-scalegroupcommunication,asthegatewaycanfilterincorrectciphertextandalleviatethereceiver'sworkload.Finally,aproofintherandomoraclemodelisgiven,toshowthattheproposedschemeissecureagainsttheadaptivelychosenciphertextattack.

简介：TheconventionaltransmitantennaselectionforVerticalBellLaboratoriesLayeredSpaceTime(V-BLAST)systemisverycomplexbecauseitneedstocomputetheinverseofchannelmatricestimeaftertime.Inthispaper,anewgrouptransmitantennaselectionschemeforV-BLASTsystemisproposed.The1stgrouptransmitantennasaredecidedaccordingtoacertainselectioncriterionamongtheavailableantennas.Then,withGroupInterferenceSuppression(GIS)technology,theinterferencesofthetransmitsymbolsfromtheselectedantennascanbesuppressed.Finally,the2ndgrouptransmitantennasaredecidedamongtheresidualavailableantennas.Simulationsshowthatitsperformanceislowerthanthatoftheconventionalselectionscheme.However,thenewselectionschemehaslowercomplexitythantheconventionalone.

简介：Inthispaper,wepresentasimplebutpowerfulensembleforrobusttextureclassification.Theproposedmethodusesasingletypeoffeaturedescriptor,i.e.scale-invariantfeaturetransform(SIFT),andinheritsthespiritofthespatialpyramidmatchingmodel(SPM).Inaflexiblewayofpartitioningtheoriginaltextureimages,ourapproachcanproducesufficientinformativelocalfeaturesandtherebyformareliablefeaturepondortrainanewclass-specificdictionary.Totakefulladvantageofthisfeaturepond,wedevelopagroup-collaborativelyrepresentation-basedstrategy(GCRS)forthefinalclassification.Itissolvedbythewell-knowngrouplasso.Butwegobeyondofthisandproposealocality-constraintmethodtospeedupthis,namedlocalconstraint-GCRS(LC-GCRS).Experimentalresultsonthreepublictexturedatasetsdemonstratetheproposedapproachachievescompetitiveoutcomesandevenoutperformsthestate-of-the-artmethods.Particularly,mostofmethodscannotworkwellwhenonlyafewsamplesofeachcategoryareavailablefortraining,butourapproachstillachievesveryhighclassificationaccuracy,e.g.anaverageaccuracyof92.1%fortheBrodatzdatasetwhenonlyoneimageisusedfortraining,significantlyhigherthananyothermethods.

简介：Uncertainandhesitantinformation,widelyexistinginthereal-worldqualitativedecisionmakingproblems,bringsgreatchallengestodecisionmakers.Hesitantfuzzylinguistictermsets(HFLTSs),aneffectivelinguisticcomputationaltoolinmodelingandelicitingsuchinformation,havehencearousedmanyscholars’interestsandsomeextensionshavebeenintroducedrecently.However,thesemethodsarebasedonthediscretelinguistictermframeworkwiththelimitedexpressiondomain,whichactuallydepictqualitativeinformationusingseveralsinglevalues.Therefore,itishardtoensuretheintegrityofthesemanticsrepresentationandtheaccuracyofthecomputationresults.Todealwiththisproblem,asemanticsbasisframeworkcalledcompletelinguistictermset(CLTS)isdesigned,whichadoptsaseparationstructureoflinguisticscaleandexpressiondomain,enrichingsemanticsrepresentationofdecisionmakers.Onthisbasistheconceptoffuzzyintervallinguisticsets(FILSs)isputforwardthatemploystheintervallinguistictermwithprobabilitytoincreasetheflexibilityofelicitingandrepresentinguncertainandhesitantqualitativeinformation.Forpracticalapplications,afuzzyintervallinguistictechniquefororderpreferencebysimilaritytoidealsolution(FILTOPSIS)methodisdevelopedtodealwithmulti-attributegroupdecisionmaking(MAGDM)problems.Throughthecasesofmovieandenterpriseresourceplanning(ERP)systemselection,theeffectivenessandvalidityoftheproposedmethodareillustrated.

简介：层2网络技术在它的传统的本地区域实现以外正在延长并且在数据中心联网的供应商大主教区域网络和大规模云发现更宽的接受。这主要由于它的plug-and-play能力和本国的活动性支持。许多努力被放了在层2网络增加两断带宽，它被层2网络使用阻止循环的跨越的树协议(STP)抑制了。最近的趋势是把层3s路由途径合并到层2网络以便多重路径能被用于提交在任何来源目的地(S-D)之间的交通节点对。相等的费用multipath(ECMP)是一个如此的例子。然而，ECMP可以仍然在由于它的最短的路径(最低费用)产生多重路径被限制要求。在这份报纸，我们考虑一条non-shortest-path路由途径，基于订的半组理论叫了相等的偏爱multipath(EPMP)，它能比ECMP产生更多的路径。在EPMP路由，有不同传统地定义的费用的所有路径，例如跳跃，带宽，等等，现在能同等地被决定，因此，他们成为相等的候选人路径。由有ECMP的比较测试，EPMP路由不仅产生更多的路径，提供15%更高的两断带宽，而且当不同交通模式被使用时，识别在一个层次网络的瓶颈连接。EPMP在控制multipath产生的数字和长度是更灵活的。模拟结果显示建议算法的有效性。它是为大datacenter网络的非阻塞的跑的一本好参考书。

简介：这篇文章基于新组限制建议改进概括方面脑叶canceller(GSC)接收装置结构，它是合适的消除多重存取的干扰(MAI)，在直接顺序的代码部门的内部标志的干扰(ISI)多重存取(DS/CDMA)downlink多用户系统。新组限制被推出构造组窗帘适应多用户察觉者。分析显示在新限制下面的改进GSC不仅保留压制ISI并且取消从成功的有用信息为需要的用户咬了的MAI，而且罐头摘录的性质。模拟证明改进GSC过滤器能高效地取消MAI无线隧道长度是否短或长，并且比其它完成更好的性能，比较了过滤器。

简介：Astooppositional,multi-objectiveandhierarchicalcharacteristicofairformationtogroundattack-defendscampaign,andusingdynamicspacestatemodelofmilitarycampaign,thisarticleestablishesaprincipalandsubordinatehierarchicalinteractivedecision-makingway,theNash-Stackelberg-Nashmodel,tosolvetheproblemsinmilitaryoperation,andfindouttheassociatedbeststrategyinhierarchicaldynamicdecision-making.Thesimulatingresultindicatethatwhenapplyingthemodeltoairformationtogroundattack-defendsdecision-makingsystem,itcansolvetheproblemsoftwohierarchies'dynamicoppositionaldecision-makingfavorably,andreachpreferableeffectinbattle.Itprovesthatthemodelcanprovideaneffectivewayforanalyzingabattle.

简介：Inordertomeettheneedsofhigh-speeddevelopmentofopticalcommunicationsystem,aconstructionmethodofquasi-cycliclow-densityparity-check(QC-LDPC)codesbasedonmultiplicativegroupoffinitefieldisproposed.TheTannergraphofparitycheckmatrixofthecodeconstructedbythismethodhasnocycleoflength4,anditcanmakesurethattheobtainedcodecangetagooddistanceproperty.Simulationresultsshowthatwhenthebiterrorrate(BER)is10-6,inthesamesimulationenvironment,thenetcodinggain(NCG)oftheproposedQC-LDPC(3780,3540)codewiththecoderateof93.7%inthispaperisimprovedby2.18dBand1.6dBrespectivelycomparedwiththoseoftheRS(255,239)codeinITU-TG.975andtheLDPC(32640,30592)codeinITU-TG.975.1.Inaddition,theNCGoftheproposedQC-LDPC(3780,3540)codeisrespectively0.2dBand0.4dBhighercomparedwiththoseoftheSG-QC-LDPC(3780,3540)codebasedonthetwodifferentsubgroupsinfinitefieldandtheAS-QC-LDPC(3780,3540)codebasedonthetwoarbitrarysetsofafinitefield.Thus,theproposedQC-LDPC(3780,3540)codeinthispapercanbewellappliedinopticalcommunicationsystems.

简介：Amethodofminimizingrankingsinconsistencyisproposedforadecision-makingproblemwithrankingsofalternativesgivenbymultipledecisionmakersaccordingtomultiplecriteria.Foreachcriteria,atfirst,thetotalinconsistencybetweentherankingsofallalternativesforthegroupandtheonesforeverydecisionmakerisdefinedafterthedecisionmakerweightsinrespecttothecriteriaareconsidered.Similarly,thetotalinconsistencybetweentheirfinalrankingsforthegroupandtheonesundereverycriteriaisdeterminedafterthecriteriaweightsaretakenintoaccount.Thentwononlinearintegerprogrammingmodelsminimizingrespectivelythetwototalinconsistenciesabovearedevelopedandthentransformedtotwodynamicprogrammingmodelstoobtainseparatelytherankingsofallalternativesforthegroupwithrespecttoeachcriteriaandtheirfinalrankings.Asupplierselectioncaseillustratedtheproposedmethod,andsomediscussionsontheresultsverifieditseffectiveness.Thisworkdevelopsanewmeasurementofordinalpreferences’inconsistencyinmulti-criteriagroupdecision-making(MCGDM)andextendsthecook-seifordsocialselectionfunctiontoMCGDMconsideringweightsofcriteriaanddecisionmakersandcanobtainuniquerankingresult.

简介：Inthispaper,anextendedKendallmodelforthepriorityschedulinginput-linegroupoutputwithmulti-channelinAsynchronousTransferMode(ATM)exchangesystemisproposedandthenthemeanmethodisusedtomodelmathematicallythenon-typicalnon-anticipativePRiorityservice(PR)model.Comparedwiththetypicalandnon-anticipativePRmodel,itexpressesthecharacteristicsofthepriorityschedulinginput-linegroupoutputwithmulti-channelinATMexchangesystem.ThesimulationexperimentshowsthatthismodelcanimprovetheHOLblockandtheperfonnanceofinput-queuedATMswitchnetworkdramatically.ThismodelhasabetterdevelopingprospectinATMexchangesystem.