HARMLESS DELAYS FOR UNIFORM PERSISTENCE

1. IntroductionA number of models in ecology can be formulated as systems of differential equations withtime delays. One of the most important problems for this type of systems is to analyze theeffect of time delays on the stability of the systems. This has been done in many papers. In[1], it is shown that if a time delay is incorporated into the resource limitation of the logisticequation, then it will destabilize the system. In [2]--[4], criteria are established under which anequilibrium of…     

THE DOMAIN DECOMPOSITION TECHNIQUES FOR THE FINITE ELEMENT PROBABILITY COMPUTATIONAL METHODS

1. IntroductionWe have discussed probability computational methods of finite element methods in [1,2,3,4].Probability computational methods have many advalltages. The advantages are more obviousin three dimensions for finite element problems. In probability model, the time that the particlemoves from one place to the boundary of the domain and is absorbed by the boundary (whichis called the time of running up to the boundary for short) is only dependent on the averagedistance between the start…     

汽车罩光清漆的固化和降解机理研究(Ⅱ)--用色谱质谱,核磁共振和红外光谱等方法研究罩光清漆的主要成分和结构

罩光清漆的色谱质谱(GC/MS),13C,1H液体高分辨核磁共振(NMR)和红外光谱(IR)等多种方法的综合分析结果表明,新型汽车涂料主要是由丙烯酸丁酯,丙烯酸1,2-丙二醇酯等形成的丙烯酸酯共聚物和部分丁氧基化的三聚氰胺甲醛树酯交联剂所组成,它们溶解在由多种有机溶剂组成的混合溶剂中.     

ON THE CONSTRUCTION OF ALGEBRAIC-GEOMETRIC CODES

1,Illtroduction'SincetheearlypapersbyG0ppa[1-31,algebralc-ge0metriccodeshavebeeninthespotlight0fcodingthe0reticresearchf0rab0uttwodecades.NumerousexcitingresultshavebeenachievedusingGoppa'sconstructi0noflinearcodesfromalgebralccurvesoverfinitefields,bothbyalgebraicge0metorsandcodingtheorists.Becauseofthedifficultyofthesubject,severalexplanatorypaPersandtextbookshaveappeared,seeforinstance[4-8].Inthispaperwepresentaquitedtherentpointofviewconcerningalgebraic-geometriccodes.Itiswellknownthataq…     

NO2分子2B2电子态荧光辐射寿命的实验研究

报道了对NO     

ON-LINE PREEMPTIVE SCHEDULING ON UNIFORM MACHINES

1 IntroductionWe consider the problem of sChedallng a 1ist (J1, J2,' .) of on-line jobs preemPtive1y onm unifornily related machines. In suCh a setting, the jobs arrive one by one. Job Jj becomesknown (with its etistence and its processing time Pj ) only When job Jj--1 has already beenscheduled, which gives rise to the name online schedallng. Job processing can be preemPtive,i.e., the processing of any job can be interruPted and resumed later. The machines are paralleI,which allows any …