简介：Thispapersetupaclassofnonlinearsemi-discreteage-structuredmodelofpopulationevolutionsystem,byusingtheconceptofcriticalproliferationrate,itdiscussedthestabilityoflinearandnonlinearpopulationsystem,anditobtainthesufficiencyconditionsofthestablefornonlinearsemi-discretesystem.

简介：Inarecentarticle,theauthorsprovidedaneffectivealgorithmforbothcomputingtheglobalinfimumof/anddecidingwhetherornottheinfimumof/isattained,where/isamultivariatepolynomialoverthefieldRofrealnumbers.Asacomplement,theauthorsinvestigatethesemialgebraicallyconnectedcomponentsofminimumpointsofapolynomialfunctioninthispaper.Foragivenmultivariatepolynomial/overR,itisshownthattheabove-mentionedalgorithmcanfindatleastonepointineachsemi-algebraicallyconnectedcomponentofminimumpointsof/whenever/hasitsglobalminimum.

简介：Thispaperconsiderstheconvergenceratesfornonparametricestimatorsoftheerrordistributioninsemi-parametricregressionmodels.Byestablishingsomegenerallawsoftheiteratedlogarithm,itshowsthattheratesofconvergenceofeithertheempiricaldistributionorasmoothedversionoftheempiricaldistributionfunctionmatchesexactlytheratesobtainedforanindependentsamplefromtheerrordistribution.

简介：这份报纸认为nonsmooth是半无限的得最高分的战略局部地包含Lipschitzinvex的部分编程问题(SIMFP)工作。作者为SIMFP建立必要optimality条件。作者建立在SIMFP的SIMFP的一个最佳的解决方案和分级的Lagrange功能的僵绳点之间的关系。进一步，作者学习为SIMFP定义的向量Lagrange功能的僵绳点标准。

简介：

简介：

简介：在这篇论文，我们在二一致machinesM_i上认为半是联机版本，i=1,2，在最大的工作的处理时间预先被知道的地方。速度s_i(s_1=1,1≤s_2=s)与机器M_i被联系。我们的目标是最大化C_(min)。我们给C_(min2)算法并且证明它的竞争比率是至多(2s+1)/(s+1)。我们也宣称C_(min2)算法是紧张的并且在C_的竞争比率之间的差距(min2)算法和最佳的价值不比0.555大。我们的结果与一致，那给由，是明显的他为s=1。

简介：Usingthesemi-tensorproductofmatrices,thispaperinvestigatescyclesofgraphswithapplicationtocut-edgesandtheminimumspanningtree,andpresentsanumberofnewresultsandalgorithms.Firstly,bydefiningacharacteristiclogicalvectorandusingthematrixexpressionoflogicalfunctions,analgebraicdescriptionisobtainedforcyclesofgraph,basedonwhichanewnecessaryandsufficientconditionisestablishedtofindallcyclesforanygraph.Secondly,usingthenecessaryandsufficientconditionofcycles,twoalgorithmsareestablishedtofindallcut-edgesandtheminimumspanningtree,respectively.Finally,thestudyofanillustrativeexampleshowsthattheresults/algorithmspresentedinthispaperareeffective.