简介：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.

简介：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.