简介：Assetallocationisanimportantissueinfinance,andbothriskandreturnareitsfundamentalingredients.Ratherthanthereturn,themeasureoftheriskiscomplicatedandofcontroversy.Inthispaper,weproposeanappropriateriskmeasurewhichispreciselyaconvexcombinationofmeansemi-deviationandconditionalvalue-at-risk.Basedonthisriskmeasure,investorscantrade-offflexiblybetweenthevolatilityandthelosstotackletheincurringriskbychoosingdifferentconvexcoefficients.Asthepresentedriskmeasurecontainsnonsmoothterm,theassetallocationmodelbasedonitisnonsmooth.Toemploytraditionalgradientalgorithms,wedevelopauniformsmoothapproximationoftheplusfunctionandconvertthemodelintoasmoothone.Finally,anillustrativeempiricalstudyisgiven.Theresultsindicatethatinvestorscancontrolriskefficientlybyadjustingtheconvexcoefficientandtheconfidencelevelsimultaneouslyaccordingtotheirperceptions.Moreover,theeffectivenessofthesmoothingfunctionproposedinthepaperisverified.

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

简介：这份报纸处理包含批处理机器的安排问题，它是在文学的也已知的同样平行的batching。介绍混合整数编程明确的表达首先在学习下面为这个问题提供一个高雅的模型。而且，它在到目前为止开发的准确方法的能力以外启用答案到问题例子。以便减轻计算负担，作者建议平衡答案质量和计算时间的基于MIP的启发式的途径。

简介：ThispaperanalyzesthequeuingproblemthatwasexperiencedduringtheShanghaiWorldExpoof2010.Thequeuingproblemwillbediscussedatthreelevels.Thethreelevelsincludethephysical,psychological,andsocialaspectsofthequeuingproblem.Thecollectivebehaviorofvisitorsisstudiedthroughanalyzingtheinformationfromthedifferentsources,suchas,thenetworkofelectroniceyes,theevaluationplatformbasedonmobilephonesystemandtheInternet.Ahybridinformationnetworktechnologyisimplemented.BasedontheWuli-Shili-Renli(WSR)systemmethodology,anewtheoreticalanalysisframeworkforthequeuingproblemisproposed.

简介：Aparallelalgorithmforsolvingblock-diagonalstructuredlargelinearsystemispresented.Thisalgorithmisbasedonthe"gradient-simplex"method.Itpartitionsalargelinearsystemintoseveralsmalllinearsubsystemssothattheycanbesolvedinparallel.Thealgorithmhasthemeritofhighspeedandissuitableforthelargelinearsystemswithlesscouplingconstrains.Theefficiencyandapplicabilityofthemethodisalsoanalyzed.

简介：这篇论文论述一个统一框架非单调凸的联合算法(例如Frank-Wolfe算法)为解决交通任务问题。Globalconvergence结果在温和条件下面被建立。在我们的算法使用的线搜索过程包括非，单调Armijo统治，非单调Goldstein规则和nonmonotoneWolfe统治同样特殊的情况。那么，新算法能被看作常规凸的联合算法的归纳。

简介：perspective-three-point(P3P)的一个完全的答案分类问题被使用Gr给?bner基础方法。P3P问题推出的多项式系统的解决方案空格的结构能被计算全面Gr获得?bner系统。与概括判别式的性质结合定序，作者给明确的条件决定P3P问题的不同真实积极答案的数字。几个例子被提供说明建议条件的有效性。

简介：

简介：Thispaperproposesasufficientcondition,ifthepropertiesofthebilevelprogrammingsatisfiedthecondition,wecansolvethebilevelprogrammingbysolvingsinglelevelprogramming.Itbecomeseasyandsimpletosolvethebilevelprogramming.

简介：ThispaperaddressestheintegratedEarthobservationsatelliteschedulingproblem.Itisacomplicatedproblembecauseobservinganddownloadingoperationsarebothinvolved.Weuseanacyclicdirectedgraphmodeltodescribetheobservinganddownloadingintegratedschedulingproblem.Basedonthemodelwhichconsideringenergyconstraintsandstoragecapacityconstraints,wedevelopanefficientsolvingmethodusinganovelquantumgeneticalgorithm.Wedesignanewencodinganddecodingschemethatcangeneratefeasiblesolutionandincreasethediversityofthepopulation.TheresultsofthesimulationexperimentsshowthattheproposedmethodsolvestheintegratedEarthobservationsatelliteschedulingproblemwithgoodperformanceandoutperformsthegeneticalgorithmandgreedyalgorithmonallinstances.

简介：Forill-posedbilevelprogrammingproblem,theoptimisticsolutionisalwaysthebestdecisionfortheupperlevelbutitisnotalwaysthebestchoiceforbothlevelsiftheauthorsconsiderthemodel'ssatisfactorydegreeinapplication.Toacquireamoresatisfyingsolutionthantheoptimisticonetorealizethetwolevels'mostprofits,thispaperconsidersbothlevels'satisfactorydegreeandconstructsaminimizationproblemofthetwoobjectivefunctionsbyweightedsummation.Then,usingthedualitygapofthelowerlevelasthepenaltyfunction,theauthorstransferthesetwolevelsproblemtoasingleoneandproposeacorrespondingalgorithm.Finally,theauthorsgiveanexampletoshowamoresatisfyingsolutionthantheoptimisticsolutioncanbeachievedbythisalgorithm.

简介：