简介:ThispapershowsanumberofproblemsinpureandappliedmathematicsthataresolvedbyconstructingtransportationnetworksMoreover,italsoshowsthatallthesolutionsarecharacterizedbyforbiddenconfiguratlozzwhicharenotminors.However,allthecharacterisationsaremuchrelatedtothegraphicmethodwhichwasfoundbyChineseforsolvingakindofthetransportationprobleminthefifties.
简介:为一家企业建模匹配它的顾客察觉了(并且需要的顾客)结果,仍然是一项进行中的任务。这篇论文考虑表演网络(SVN)接近的服务价值可能怎么样,答应当模特儿,;交付,前端企业理解;它与的直接约会它的立即(或前端)顾客。这些前端顾客可以是任何一个:(1)它的离线,在里面店顾客—与企业出售职员一起直接从事(或代表),或(2)它的联机、虚拟顾客—经由因特网或遥远的存取与企业从事。处于这种状况,两企业,;顾客利用他们的各自的观点,;双方影响相互作用。对这些企业外部;顾客影响是捕获的另外的因素立即;更宽广的全球效果—称为的环境效果。影响的这三个生意顾客约会区域被一条SVNSEM途径捕获。没有一个生意顾客,某类型遇到一家服务企业的可能性,;一个勘探顾客,成功地从事一个交换过程被减少。这交换可以是一物理,;/or服务交换,;/or一个信息;/or想法交换。到企业,实际上,这相遇是一项贸易,;作为结果,企业指向获得将最终交付一张网的经济交换积极经济结果。到顾客,外部;内部信息喂,满足,察觉的价值,;满足,是关键相遇司机。SVN提供一个新方法理解生意顾客相遇,;为了然后利用,这获得了知识到也:(1)造一个战略管理模型,或(2)reengineer它的企业网络,;然后创造重新定位的、更排列顾客的企业操作—能够交付胜利的—赢,竞争生意顾客答案。
简介:Inanactivenetwork,userscaninsertcustomizedactivecodesintoactivenodestoexecute.Thusitneedsmoreresourcesthanthoserequiredbyconventionalnetworks,andtheseresourcesmustbeeffectivelymonitoredandmanaged.ManagementpoliciesinexistingOSsaretoocomplicatedtoapplytosimpleactivepackets.Inthispaper,wepresentnewresourcesmanagementpoliciesthataremainlyadopedtomanageCPU,storageandtransmissionbandwidth.Namely,weuseSPFalgorithmtoscheduleandprocessactivepackets,andimportanintervalqueuemethodtoallocatetransmissionbandwidth,andusefeedbackmechanismtocontrolcongestion.Atthesametime,wedesignsomeexperimentsonprototypesystemswithandwithoutresourcesmanagementpoliciesrespectively.Theexperimentsresultsshowthatmanagementpoliciespresentedbyuscaneffectivelymanageresourcesinactivenodesandcanimprovetheperformanceofactivenetworks.
简介:Inthispaper,weproposetwoweightedlearningmethodsfortheconstructionofsinglehiddenlayerfeedforwardneuralnetworks.Bothmethodsincorporateweightedleastsquares.Ourideaistoallowthetraininginstancesnearertothequerytoofferbiggercontributionstotheestimatedoutput.Byminimizingtheweightedmeansquareerrorfunction,optimalnetworkscanbeobtained.Theresultsofanumberofexperimentsdemonstratetheeffectivenessofourproposedmethods.
简介: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.
简介:Inthispaper,weintroduceatypeofapproximationoperatorsofneuralnetworkswithsigmodalfunctionsoncompactintervals,andobtainthepointwiseanduniformestimatesoftheapproximation.Toimprovetheapproximationrate,wefurtherintroduceatypeofcombinationsofneuralnetworks.Moreover,weshowthatthederivativesoffunctionscanalsobesimultaneouslyapproximatedbythederivativesofthecombinations.Wealsoapplyourmethodtoconstructapproximationoperatorsofneuralnetworkswithsigmodalfunctionsoninfiniteintervals.
简介:Theweightedreliabilityofnetworkisdefinedasthesumofthemultiplicationoftheprobabilityofeachnetworkstatebyitsnormalizedweightingfactor.Underacertainstate,whenthecapacityformsourcestosinktislargerthanthegivenrequiredcapacityCr,thenthenormalizedweightingfactoris1,otherwise,itistheratioofthecapacitytotherequiredcapacityCr.Thispaperproposesanewalgorithmfortheweightedreliabilityofnet-works,putsforwardtheconceptofsaturatedstateofcapacity,andsuggestsarecursiveformulaforexpandingtheminimalpathstobethesumofqualifyingsubsets.Inthenewalgorithm,theexpansionsoftheminimalpathsdon'tcreatetheirrelevantqualifyingsubsets,thusdecreasingtheunnecessaryexpandingcalculation.Comparedwiththecurrentalgorithms,thisalgorithmhastheadvantageofasmallamountofcomputationsforcomputerimplementa-tion.
简介:ThispaperdescribestheimplementationofasizablesubsetofOpenMPonnetworksofworkstations(NOWs)andthesource-to-sourceOpenMPcompiler(AutoPar)isusedfortheJIAJIAhome-basedsharedvirtualmemorysystem(SVM).ThepapersuggestssomesimplemodificationsandextensionstotheOpenMPstandardforthedifferencebetweenSVMandSMP(symmetricmultiprocessor),atwhichtheOpenMPspecificationisaimed.TheOpenMPtranslatorisbasedonanautomaticparallelizationcompiler,soitispossibletocheckthecorrectnessofthesemanticsofOpenMPprogramswhichisnotrequiredinanOpenMP-compliantimplementation.AutoParismeasuredforfiveapplicationsincludingbothprogramsfromNASParallelBenchmarksandrealapplicationsonaclusterofeightPentiumIIPCsconnectedbya100MbpsswitchedEthernet.TheevaluationshowsthattheparallelizationbyannotatingOpenMPdirectivesissimpleandtheperformanceofgeneratedJIAJIAcodeisstillacceptableonNOWs.
简介:Biologicalelementsusuallyexerttheirfunctionsthroughinteractionswithotherstoformvarioustypesofbiologicalnetworks.Theabilityofcontrollingthedynamicsofbiologicalnetworksisofenormousbenefitstopharmaceuticalandmedicalindustryaswellasscientificresearch.Thoughtherearemanymathematicalmethodsforsteeringdynamicsystemstowardsdesiredstates,themethodsareusuallynotfeasibleforapplyingtocomplexbiologicalnetworks.Thedifficultiescomefromthelackofaccuratemodelthatcancapturethedynamicsofinteractionsbetweenbiologicalelementsandthefactthatmanymathematicalmethodsarecomputationallyintractableforlarge-scalenetworks.Recently,aconceptincontroltheory--controllability,hasbeenappliedtoinvestigatethedynamicsofcomplexnetworks.Inthisarticle,recentadvancesonthecontrollabilityofcomplexnetworksandapplicationstobiologicalnetworksarereviewed.Developingdynamicmodelsisthepriorconcernforanalyzingdynamicsofbiologicalnetworks.First,weintroduceawidelyuseddynamicmodelforinvestigatingcontrollabilityofcomplexnetworks.Thenrecentstudiesoftheoremsandalgorithmsforhavingcomplexbiologicalnetworkscontrollableingeneralorspecificapplicationscenariosarereviewed.Finally,applicationstorealbiologicalnetworksmanifestthatinvestigatingthecontrollabilityofbiologicalnetworkscanshedlightsonmanycriticalphysiologicalormedicalproblems,suchasrevealingbiologicalmechanismsandidentifyingdrugtargets,fromasystematicperspective.
简介:Thispaperstudiesasimpleasymmetricallyevolvedcommunitynetworkwithacombinationofpreferentialattachmentandrandomproperties.Animportantissueaboutcommunitynetworksistodiscoverthedifferentutilityincrementsoftwonodes,wheretheutilityisintroducedtoinvestigatetheasymmetricaleffectofconnectingtwonodes.Ontheotherhand,theconnectionoftwonodesincommunitynetworkscanbeclassifiedastwonodesbelongingtothesameortodifferentcommunities.Thesimulationresultsshowthatthemodelcanreproduceapower-lawutilitydistributionP(u)~uσ,σ=2+1p,whichcanbeobtainedbyusingmean-fieldapproximationmethods.Furthermore,themodelexhibitsexponentialbehaviourwithrespecttosmallvaluesofaparameterdenotingtherandomeffectinourmodelatthelow-utilityregionandapower-lawfeaturewithrespecttobigvaluesofthisparameteratthehigh-utilityregion,whichisingoodagreementwiththeoreticalanalysis.Thiskindofcommunitynetworkcanreproduceauniqueutilitydistributionbytheoreticalandnumericalanalysis.
简介:Averyinexpensiverecive-onlysatellitereceiverhighbandwidthtrafficfromafeeder.Thereforetheconnectionbetweenthefeederandthereceiverisuni-directional.Theexistingroutingprotocols,suchasLink-StateandDistance-Vector,aredesignedonthepremisethatanylinksarebidirectionalandtheycannothandletheuni-directionallinks.Inthispaper,adynamicmulticastroutingprotocolisproposed,whichcanhandleuni-directionalnetworks,Thisprotocolcanalsoadapttothedynamicchangeofthetopolgoyofthenetworkandhasgoodscalability.AformaldescriptionoftheprotocolbyPetrinetisgiven.Liveness,deadlockfreeandotherpropertiesoftheprotocolarepreoved.