简介:Thispaperstudiesrestrictedfaultdiameterofthen-dimensionalhypercubenetworksQn(n≥2).ItisshownthatforarbitrarytwoverticesxandywiththedistancedinQnandanysetFwithatmost2n-3verticesinQn-{x,y},ifFcontainsneitherofneighbor-setsofxandyinQn,thenthedistancebetweenxandyinQn-FisgivenbyD(Qn-F;x,y){=1,for=1;≤d+4,for2≤d≤n-2,n≥4;≤n+1,ford=n-1,n≥3;=n,ford=n.Furthermore,theupperboundsaretight.Asanimmediatelyconsequence,Qncantolerateupto2n-3verticesfailuresandremaindiameter4ifn=3andn+2ifn≥4providedthatforeachvertexxinQn,alltheneighborsofxdonotfailatthesametime.ThisimprovesEsfahanian'sresult.
简介:LetG=(V,E)beaconnectedgraphandmbeapositiveinteger,theconditionaledgeconnectivityλδmistheminimumcardinalityofasetofedges,ifitexists,whosedeletiondisconnectsGandleaveseachremainingcomponentwithminimumdegreeδnolessthanm.Thisstudyshowsthatλδ1(Qn,k)=2n,λδ2(Qn,k)=4n-4(2≤k≤n-1,n≥3)forn-dimensionalenhancedhypercubeQn,k.Meanwhile,anothereasyproofaboutλδ2(Qn)=4n-8,forn≥3isproposed.Theresultsofenhancedhypercubeincludethecasesoffoldedhypercube.
简介:Inthispaper,wefocusonthevertex-fault-tolerantcyclesembeddingonenhancedhypercube,whichisanattractivevariantofhypercubeandisobtainedbyaddingsomecomplementaryedgesfromhypercube.LetFvbethesetoffaultyverticesinthen-dimensionalenhancedhypercubeQn,k(1≤k≤n-1).When|Fv|=2,weshowedthatQn,k-Fvcontainsafault-freecycleofeveryevenlengthfrom4to2n-4wheren(n≥3)andfchavethesameparity;andcontainsafault-freecycleofeveryevenlengthfrom4to2n-4,simultaneously,containsacycleofeveryoddlengthfromn—fc+2to2n-3wheren(≥3)andfchavethedifferentparity.Furthermore,when|Fv|=fv≤n-2,weproofthatthereexiststhelongestfault-freecycle,whichisofevenlength2n-2fvwhethern(n>3)andfehavethesameparityornot;andthereexiststhelongestfault-freecycle,whichisofoddlength2n-2fv-1inQn,k—Fvwheren(≥3)andfchavethedifferentparity.
简介:Inthispaper,theproblemoffault-tolerantroutingsinfault-tolerantnetworksisconsidered.Aroutinginanetworkassignstoeachorderedpairofnodesafixedpath.Allcommunicationamongnodesmustgoonthisrouting.Wheneitheranodeoralinkinafault-tolerantnetwork{ails,thecommunicationfromonenodetoanotherusingthisfaultyelementmustbesentviaoneormoreintermediatenodesalongasequenceofpathsdeterminedbythisrouting.Animportantandpracticalproblemishowtochoosearoutinginthenetworksuchthatintermediatenodestoensurecommunicationaresmallforanyfault-set,LetCdbeadirectedcycleoforderd.Inthispaper.Theauthor{irstdiscussesconnectivityofCartesianproductdigraphs,thenprovesthattheCartesianproductdigraphCd1×Cd2×…×Cdn(di≥2,1≤i≤n)hasaroutingsuchthatatmostoneintermediatenodeisneededtoensuretransmissionofmessagesamongallnon-faultynodessolongasthenumberoffaultsislessthann,ThisisageneralizationofDolevetal'sresultforthen-dimensionalcuhe.
简介:ThedesignofnewSatelliteLaunchVehicle(SLV)isofinterest,especiallywhenacombinationofSolidandLiquidPropulsionisincluded.ProposedisaconceptualdesignandoptimizationtechniqueformultistageLowEarthOrbit(LEO)boundSLVcomprisingofsolidandliquidstageswiththeuseofGeneticAlgorithm(GA)asglobaloptimizer.ConvergenceofGAisimprovedbyintroducinginitialpopulationbasedontheDesignofExperiments(DOE)Technique.LatinHypercubeSampling(LHS)-DOEisusedforitsgoodspacefillingproperties.LHSisastratifiedrandomprocedurethatprovidesanefficientwayofsamplingvariablesfromtheirmultivariatedistributions.InSLVdesignminimumGrossLiftoffWeight(GLOW)conceptistraditionallybeingsought.SincethedevelopmentcoststendtovaryasafunctionofGLOW,thisminimumGLOWisconsideredasaminimumdevelopmentcostconcept.Thedesignapproachismeaningfultoinitialdesignsizingpurposeforitscomputationalefficiencygivesaquickinsightintothevehicleperformancepriortodetaileddesign.
简介:〔摘要〕用新课标理念中的发展学生的数学应用意识来指导教学。学生已学习了随机抽样的方法,在此基础上结合具体问题情境,进行抽样调查,突出统计在日常生活中的应用。达到了巩固运用的目的,达到了学习的终极目标。
简介:Comparedwithaccuratediagnosis,thesystem’sselfdiagnosingcapabilitycanbegreatlyincreasedthroughthet/kdiagnosisstrategyatmostkvertexestobemistakenlyidentifiedasfaultyunderthecomparisonmodel,wherekistypicallyasmallnumber.BasedonthePreparata,Metze,andChien(PMC)model,then-dimensionalhypercubenetworkisprovedtobet/kdiagnosable.Inthispaper,basedontheMaengandMalek(MM)?model,anovelt/k-faultdiagnosis(1k4)algorithmofndimensionalhypercube,calledt/k-MM?-DIAG,isproposedtoisolateallfaultyprocessorswithinthesetofnodes,amongwhichthenumberoffault-freenodesidentifiedwronglyasfaultyisatmostk.ThetimecomplexityinouralgorithmisonlyO(2nn2).