简介:Thispaperpresentsaconcurrentobject-orientedmodelinglanguagebasedonPetrinets:OMNets,whichhelpsgreatlytoavoidtheinheritanceanomalyproblemappearedinconcurrentOOlanguages.OMNetsseparatesthefunctionalpartandthesynchronizationpartofobjectsandusesPetrinetstodescribethesynchronizationpart.Bothpartsarereusablethroughinheritance.
简介:In1971,thefamousmathematicianGeorgePolya,introducedfourbasicstepsorphasesforsolvingproblems:Step1UnderstandtheProblemStep2DecideonaPlanStep3CarryoutthePlanStep4LookBack
简介:WeconsideraclassofABStypealgorithmsforsolvingsystemoflinearinequalities,wherethenumberofinequalitiesdoesnotexceedthenumberofvariables.
简介:IntheprocessofsolvingEulervectorsbasedonGNSShorizontalmovementfield,thenumberofestimatedparameterscanaffectEulervectorresults.Thisissueisanalyzedthroughtheoreticaldeductionandpracticalexampleinthispaper.Firstly,thedifferencebetweentheresultsofEulervectorsindifferentsolvingmodelsisdeduced.Meanwhile,basedonGNSShorizontalmovementfieldintheChinesemainlandfrom2004to2007,twocommonmodels(RRMandREHSM)areusedtodiscusstheimpactofsolvingmodelsonEulervectorsandthefollow-upstudy.Theresultshowsthatthemaximumvalueofthedifferenceinablock’sentirerotationcanreach2.6mm/a,andshouldnotbeignored.Therefore,theresultsofhorizontalmovementaredifferentusingdifferentkinematicblockmodels,andthisshouldbepaidmoreattentionintheanalysisofcrustalhorizontalmovement.
简介:
简介:Weintroducemultilevelaugmentationmethodsforsolvingoperatorequationsbasedondirectsumdecompositionsoftherangespaceoftheoperatorandthesolutionspaceoftheoperatorequationandamatrixsplittingscheme.Weestablishageneralsettingfortheanalysisofthesemethods,showingthatthemethodsyieldapproximatesolutionsofthesameconvergenceorderasthebestapproximationfromthesubspace.Theseaugmentationmethodsallowustodevelopfast,accurateandstablenonconventionalnumericalalgorithmsforsolvingoperatorequations.Inparticular,forsecondkindequations,specialsplittingtechniquesareproposedtodevelopsuchalgorithms.Thesealgorithmsarethenappliedtosolvethelinearsystemsresultingfrommatrixcompressionschemesusingwavelet-likefunctionsforsolvingFredholmintegralequationsofthesecondkind.Forthisspecialcase,acompleteanalysisforcomputationalcomplexityandconvergenceorderispresented.Numericalexamplesareincludedtodemonstratetheefficiencyandaccuracyofthemethods.IntheseexamplesweusetheproposedaugmentationmethodtosolvelargescalelinearsystemsresultingfromtherecentlydevelopedwaveletGalerkinmethodsandfastcollocationmethodsappliedtointegralequationsofthesecondkind.Ournumericalresultsconfirmthatthisaugmentationmethodisparticularlyefficientforsolvinglargescalelinearsystemsinducedfromwaveletcompressionschemes.
简介:Assetallocationisanimportantissueinfinance,andbothriskandreturnareitsfundamentalingredients.Ratherthanthereturn,themeasureoftheriskiscomplicatedandofcontroversy.Inthispaper,weproposeanappropriateriskmeasurewhichispreciselyaconvexcombinationofmeansemi-deviationandconditionalvalue-at-risk.Basedonthisriskmeasure,investorscantrade-offflexiblybetweenthevolatilityandthelosstotackletheincurringriskbychoosingdifferentconvexcoefficients.Asthepresentedriskmeasurecontainsnonsmoothterm,theassetallocationmodelbasedonitisnonsmooth.Toemploytraditionalgradientalgorithms,wedevelopauniformsmoothapproximationoftheplusfunctionandconvertthemodelintoasmoothone.Finally,anillustrativeempiricalstudyisgiven.Theresultsindicatethatinvestorscancontrolriskefficientlybyadjustingtheconvexcoefficientandtheconfidencelevelsimultaneouslyaccordingtotheirperceptions.Moreover,theeffectivenessofthesmoothingfunctionproposedinthepaperisverified.
简介:ASUCCESSIVEAPPROXIMATIONMETHODFORSOLVINGPROBABILISTICCONSTRAINEDPROGRAMSWANGJINDE(王金德)(DepartmentofMathematics,NanjingUnivers...
简介:TheBjorckandPereyraalgorithmsusedforsolvingVandermondesystemofequationaremodifiedforthecasewherethepointsaresymmetriclysituatedaroundzero.Theworkingoperationissavedabouthalf.Aforwarderroranalysisispresentedforthemodifiedalgorithms,andit'sshownthatifthepointsaresituatedinsomeorder,theerrorboundareasgoodasHigham'sresultin1987.
简介:Basedonelementarygrouptheory,theblockpivotmethodsforsolv-ingtwo-dimensionalelasticfrictionalcontactproblemsarepresentedinthispaper.Itisprovedthatthealgorithmsconvergewithinafinitenumberofstepswhenthefrictioncoefficientis'relativesmall'.Unlikemostmathematicalprogrammingmeth-odsforcontactproblems,theblockpivotmethodspermitmultipleexchangesofbasicandnonbasicvariables.
简介:在源于监视的统计模型和错误不安处理的水坝指向multicollinearity问题,我们用截断的单个价值分解(TSVD)造了一个调整回归模型。在中国的一个地球岩石水坝作为一个例子被介绍并且讨论。分析由三步组成:当模特儿并且预报的multicollinearity察觉,规则化参数选择,和裂缝洞。概括交叉验证(GCV)功能和L曲线标准两个都在规则化参数选择被采用。部分最少平方的回归(PLSR)和逐步的回归也为比较被包括。结果显示TSVD能有希望地解决水坝回归模型的multicollinearity问题。然而,当TSVD由于规则化参数选择问题比逐步的回归和PLSR优异时,没有一般规则是可得到的作决定。当评估模型可靠性时,恰当的精确性和系数reasonability应该被考虑。
简介:Thearticleisaboutsolvingthelastmiledeliveryprobleminruraltownorvillage.Wewanttotestthedrone’spotentialinparceldelivery.Theobjectivesare1)tointroducetheclusterandtruck-droneintandemdeliverymethod,2)tocomparethenewmethodwiththetraditionalTSPmethodinaspectoftruckrunningdistance,energyusingandtimeoccupation.Theparceldeliverydemandissparse,soitisnotdenseenoughforatrucktocarryondelivery.Wetrytoidentifythebestrouteforthedronetodeliverthegoods.Weusek-meanmethodtocarryonclustering,thenweuseenumerationmethodtofulfillthecentroidsdelivery,whichcomesfromthedepot.Wedesignamodelandcalculatetheenergy,timeanddistancesavingbetweendroneusingmethod(DTSP)andtraditionalTSPmethod.Thedroneattendeddeliverysavestruckdeliverydistance,energyconsumptionandtime.ThetruckrunningdistanceofDTSPmethodsaves91.87%,thetruckrunningdistanceisshortenedfrom189.69kmto15.4252km.TheDTSPmethodsaves90.45%ofenergy.TheDTSPmethodbringsa29.75%cutoffintimeaspectwhentherearetwodroneinrunning.TheresearchintroducestheclusterandTSPcombinationmethod,whichisagoodwaytocarryonlastmiledelivery.Theresultshowsabrightfuturefordronetoattendparceldelivery.Thee-commercecorporationcanapplythismethodinpractice.
简介:Membranealgorithms(MAs),whichinheritfromPsystems,constituteanewparallelanddistributeframeworkforapproximatecomputation.Inthepaper,amembranealgorithmisproposedwiththeimprovementthattheinvolvedparameterscanbeadaptivelychosen.Inthealgorithm,somemembranescanevolvedynamicallyduringthecomputingprocesstospecifythevaluesoftherequestedparameters.Thenewalgorithmistestedonawell-knowncombinatorialoptimizationproblem,thetravellingsalesmanproblem.Theempiricalevidencesuggeststhattheproposedapproachisefficientandreliablewhendealingwith11benchmarkinstances,particularlyobtainingthebestoftheknownsolutionsineightinstances.Comparedwiththegeneticalgorithm,simulatedannealingalgorithm,neuralnetworkandafine-tunednon-adaptivemembranealgorithm,ouralgorithmperformsbetterthanthem.Inpractice,todesigntheairlinenetworkthatminimizethetotalroutingcostontheCABdatawithtwenty-fiveUScities,wecanquicklyobtainhighqualitysolutionsusingouralgorithm.
简介:ThispaperintroducesamethodforsolvingDOAestimationambiguityinESPRITalgorithmwiththeconventionalbeamformer.Withthehelpofit,foranyspaceoftwosubarrays,thesignalDOAin[-π/2,π/2]canbeestimatedeffectivelybyusingESPRITalgorithm.Finally,somesimulationresultstoverifythetheoreticalanalysesarepresented.