time 
The wellposedness for the timedependent neutron transport equation with integral boundary conditions is established inL1 space.


In the present paper, we deal with the longtime behavior of dissipative partial differential equations, and we construct the approximate inertial manifolds for the nonlinear Schr?dinger equation with a zero order dissipation.


Spatial discretization can be performed by either Galerkin spectral method or nonlinear Galerkin spectral method; time discretization is done by Euler scheme which is explicit or implicit in the nonlinear terms.


A system receives shocks at successive random points of discrete time, and each shock causes a positive integervalued random amount of damage which accumulates on the system one after another.


In previous work, under some assumptions, we specified a replacement rule which minimizes the longrun (expected) average cost per unit time and possesses control limit property.


We present a new algorithm, with computational evidence to suggest an expected runtime growth rate belowO(n3).


In a life test with 20 sets of bearings, only one set failed within the specified time, and none of the remainder failed even after the time of test has been extended.


With a set of testing data like that in Table 1, it is required to estimate the reliability at the mission time.


Exact bounds of the modified lpt algorithms applying to parallel machines scheduling with nonsimultaneous machine available time


In this paper, we consider Parallel Machines Scheduling with nonsimultaneous machine available time.


The design that is subject to this criterion satisfies many kinds of linear optimal criterion and Doptimal criterion on several experiment models at the same time.


The wellposedness and validity of formal approximations on a long time scale of order ∣ε∣1 are discussed in the classical sense of C2.


79 competitive online algorithm for two processor realtime systems with uniform value density


We consider the problem of competitive online scheduling in two processor realtime systems.


Each task has a release time, an execution time and a deadline.


Continuoustime procedure is introduced and analysed.


It is proved that when the solution is blowup in a finite time s(uo), and u0(x) is not a constant, then the free boundary will not be blowup and the blowup set is contained in the interval [0,l0).


It is shown that under certain conditions the solution blows up at a finite time and the blowup only occurs on the boundary.


The result shows that most inverse network optimization problems with l∞ objective function can be solved in the polynomial time.


However, in many practical situations, a manager may control processing time by reallocating resources.

