简介：讨论了年龄相关的半线性时变种群系统的最优捕获控制问题.根据微积分方程及泛函分析的知识证明了最优捕获控制的存在性,得到了捕获控制为最优的必要条件.

简介：Inthispaper,wefirstdeterminetherelationsamongthebestboundsAandBoftheg-frame,theg-frameoperatorSandthepre-frameoperatorQandgiveanecessaryandsufficientconditionforag-framewithboundsAandBinacomplexHilbertspace.Wealsointroducethedefinitionofag-framesequenceandobtainanecessaryandsufficientconditionforag-framesequencewithboundsAandBinacomplexHilbertspace.Lastly,weconsiderthestabilityofag-framesequenceforacomplexHilbertspaceunderperturbation.

简介：在这份报纸，我们与安装时间和多重假期认为BMAP/G/1是G队列。积极顾客和否定顾客的到达分别地跟随一个批Markovian到达过程(BMAP)和Markovian到达过程(地图)。当服务者正在工作时，一个否定顾客的到达在系统移开所有顾客。一旦系统倒空，服务器为一个假期离开并且被允许拿重复(多重)假期。由使用增补变量方法和审查技术，我们获得队列长度分布。我们也基于更新理论获得忙时期的平均数。

简介：A(k;g)-graphisak-regulargraphwithgirthg.A(k;g)-cageisa(k;g)-graphwiththeleastpossiblenumberofvertices.Letf(k;g)denotethenumberofverticesina(k;g)-cage.Thegirthpairofagraphgivesthelengthofashortestoddandashortestevencycle.Afc-regulargraphwithgirthpair(g,h)iscalleda(k;g,h)-graph.A(k;g,h)-cageisa(k;g,h)-graphwiththeleastpossiblenumberofvertices.Letf(k;g,h)denotethenumberofverticesina(k;g,h)-cage.Inthispaper,weprovethefollowingstrictinequalityf(k;h-1,h)

简介：In[1],ShenGuangyuconstructedseveralclassesofnewsimpleLiealgebrasofcharacteristic2,whicharecalledthevariationsofG2.Inthispaper,theauthorsinvestigatetheirderivationalgebras.ItisshownthatG2anditsvariationsallpossessuniquenondegenerateassociativeforms.TheauthorsalsofindsomenonsingularderivationsofViGfori=3,4,5,6,andtherebyconstructsomeleft-symmetricstructuresonViGfori=3,4,5,6.Someerrorsaboutthevariationsofsi(3,F)in[1]arecorrected.

简介：Thispaperprovesthat,underthehypothesisg(t,0,0)≡0andsomenaturalassumptions,thegeneratorgofabackwardstochasticdifferentialequationcanbeuniquelydeterminedbythecorrespondingg-expectationswithallterminalconditions.ThemainresultofthispaperalsoconfirmsandextendsPengShige'sconjecture.

简介：Inthispaper,asufficientconditionforboundednessandpersistenceofthesolu1/ofthefollowingdelaydifferenceequationisobtained.AconjecturebyG.Ladasisprovedherexn-1=A/x^pn+B/x^qn-1,n=0,1,...whereA,B,p,q,x-1,xo∈(0,∞).

简介：

简介：利用g-函数和弱g-函数给出了度量空间的新刻划，回答了Nagata的问题．

简介：LetGbealocallycompactAbeliangroupwithHaarmeasure.TheauthorsdiscusssomebasicpropertiesofL_(w_1)~r(G)∩L(p,q,w_2dμ)(G)spaces.ThenthenecessaryconditionsforcompactembeddingsofthespacesL_(w_1)~r(R~d)∩L(p,q,w_2dμ)(R~d)areshowed.

简介：Withthehelpofalimitpropertyofsolutionsofbackwardstochasticdifferentialequations(BSDEs),thispaperestablishesaconversecomparisontheoremfordeterministicgeneratorsgofBSDEsundertheassumptiong(t,y,0)≡0.

简介：Inthispaper,theauthorsstudysomepropertiesofLittlewood-Paleyg-functionsg_ψ(f),LusinareafunctionsS_(ψ,α)(f)andLittlewood-Paleyg_(ψ,λ)~*(f)functionsdefinedonH~n,whereα,λ>0andψ,faresuitablefunctions.TheyarethegeneralizationofthecorrespondingoperatorsonR~n.

简介：结合自己的工作，对Gowers-Maurey系列成果获Fields奖以来的研究的新动态作一综述。本文是上篇，主要讨论含遗传不可分解空间在内的G－M型空间的若干品种。

简介：Alooplessgraphonnverticesinwhichverticesareconnectedatleastbyaandatmostbybedgesiscalleda(a,b,n)-graph.A(b,b,n)-graphiscalled(b,n)-graphandisdenotedbyKbn(itisacompletegraph),itscomplementbyKbn.Anonincreasingsequencep=(d1,…,dn)ofnonnegativeintegersissaidtobe(a,b,n)graphicifitisrealizablebyan(a,b,n)-graph.Wesayasimplegraphicsequencep=(d1,…,dn)ispotentiallyK4—K2[K2-graphicifithasaarealizationcontaininganK4—K2[K2asasubgraphwhereK4isacompletegraphonfourverticesandK2[K2isasetofindependentedges.Inthispaper,wefindthesmallestdegreesumsuchthateveryn-termgraphicalsequencecontainsK4—K2[K2assubgraph.

简介：P1(G)是指这样的图：G中的所有k路作为P1(G)的顶点集，两个不同的顶点在Pk(G)中邻接当且仅当它们所对应的两条k路的并为G中的(k+1)路或k圈，那么，完美图猜想对于路图P3（G)是成立的。

简介：Itisprovedthataprobabilitymeasureisdominatedbyg-expectationεμ[·]ifandonlyifitcanbegeneratedbyGirsanovtransformationviaaprocesswhichisuniformlyboundedbyμ.

简介：结合自己的工作,对Gowers-Maurey系列成果获Fields奖以来的研究的新动态作一综述.本文是上篇,主要讨论含遗传不可分解空间在内的G-M型空间的若干品种.

简介：让N是组G的正常亚群。假定积极整数m>n是N与的二种最长非中央的G-conjugacy班尺寸(m，n)=1。这份报纸的目的是决定N的结构并且在m是方形的那个假设下面在N给N-conjugacy元素的班尺寸免费。

简介：关于GI／G／1排队系统队长的极限分布存在的一个充分条件被建立．

简介：让G是有非中央的Sylowr亚群R的一个有限的组，Z(G)G的中心，和NG的正常亚群。这篇论文的目的是在N包含的假设下面决定N的结构R和N的每个元素的G-conjugacy班尺寸是任何一个1或m。特别地，如果，N是Abelian，这被显示出N∩Z(G)=1并且N的每个元素的G-conjugacy班尺寸是任何一个1或m。