Results 1  10
of
756,874
Localization on the Boundary of Blowup for Reaction–Diffusion Equations with Nonlinear Boundary Conditions
"... In this work we analyze the existence of solutions that blowup in finite time for a reaction–diffusion equation ut Du fðx; uÞ in a smooth domain O with nonlinear boundary conditions @u=@n gðx; uÞ. We show that, if locally around some point of the boundary, we have fðx; uÞ bup, b 0, and gðx; u ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
In this work we analyze the existence of solutions that blowup in finite time for a reaction–diffusion equation ut Du fðx; uÞ in a smooth domain O with nonlinear boundary conditions @u=@n gðx; uÞ. We show that, if locally around some point of the boundary, we have fðx; uÞ bup, b 0, and gðx
Lower bound on the blowup rate . . .
, 2008
"... Consider axisymmetric strong solutions of the incompressible Navier–Stokes equations in R3 with nontrivial swirl. Such solutions are not known to be globally defined, but it is shown in ([1], Partial regularity of suitable weak solutions of the Navier–Stokes equations. Communications on Pure and App ..."
Abstract
 Add to MetaCart
and Applied Mathematics, 35 (1982), 771–831) that they could only blow up on the axis of symmetry. Let z denote the axis of symmetry and r measure the distance to the zaxis. Suppose the solution satisfies the pointwise scale invariant bound v(x, t)  ≤C∗(r 2 − t) −1/2 for −T0 ≤ t < 0and0< C ∗ <
Where the REALLY Hard Problems Are
 IN J. MYLOPOULOS AND R. REITER (EDS.), PROCEEDINGS OF 12TH INTERNATIONAL JOINT CONFERENCE ON AI (IJCAI91),VOLUME 1
, 1991
"... It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard p ..."
Abstract

Cited by 681 (1 self)
 Add to MetaCart
problems occur at a critical value of such a parameter. This critical value separates two regions of characteristically different properties. For example, for Kcolorability, the critical value separates overconstrained from underconstrained random graphs, and it marks the value at which the probability
A Scheme for RealTime Channel Establishment in WideArea Networks
 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
, 1990
"... Multimedia communication involving digital audio and/or digital video has rather strict delay requirements. A realtime channel is defined in this paper as a simplex connection between a source and a destination characterized by parameters representing the performance requirements of the client. A r ..."
Abstract

Cited by 710 (31 self)
 Add to MetaCart
realtime service is capable of creating realtime channels on demand and guaranteeing their performance. These guarantees often take the form of lower bounds on the bandwidth allocated to a channel and upper bounds on the delays to be experienced by a packet on the channel. In this paper
Blowup with logarithmic nonlinearities
, 2007
"... We study the asymptotic behaviour of nonnegative solutions of the nonlinear diffusion equation in the halfline with a nonlinear boundary condition, ut = uxx − λ(u+ 1) log p(u+ 1) (x, t) ∈ R+ × (0, T), −ux(0, t) = (u+ 1) logq(u+ 1)(0, t) t ∈ (0, T), u(x, 0) = u0(x) x ∈ R+, with p, q, λ> 0. We ..."
Abstract
 Add to MetaCart
. We describe in terms of p, q and λ when the solution is global in time and when it blows up in finite time. For blowup solutions we find the blowup rate and the blowup set and we describe the asymptotic behaviour close to the blowup time, showing that a phenomenon of asymptotic simplification
Alternatingtime Temporal Logic
 Journal of the ACM
, 1997
"... Temporal logic comes in two varieties: lineartime temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branchingtime temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general var ..."
Abstract

Cited by 615 (55 self)
 Add to MetaCart
a certain state. Also the problems of receptiveness, realizability, and controllability can be formulated as modelchecking problems for alternatingtime formulas.
Internet time synchronization: The network time protocol
, 1989
"... This memo describes the Network Time Protocol (NTP) designed to distribute time information in a large, diverse internet system operating at speeds from mundane to lightwave. It uses a returnabletime architecture in which a distributed subnet of time servers operating in a selforganizing, hierarchi ..."
Abstract

Cited by 617 (15 self)
 Add to MetaCart
organizing, hierarchical, masterslave configuration synchronizes local clocks within the subnet and to national time standards via wire or radio. The servers can also redistribute time information within a network via local routing algorithms and time daemons. The architectures, algorithms and protocols which have
Results 1  10
of
756,874