Chip firing and all-terminal network reliability bounds

The (all-terminal) reliability of a graph G is the probability that all vertices are in the same connected component, given that vertices are always operational but edges fail independently each with probability p. Computing reliability is #P-complete, and hence is expected to be intractable. Consequently techniques for efficiently (and effectively) bounding reliability have been the major thrust of research in the area. We utilize a deep connection between reliability and chip firings on graphs to improve previous bounds for reliability.     

A unifying approach to integration for bounded positive charges

This paper deals with n-monotone functionals, which constitute a generalisation of n-monotone set functions. Using the notion of exactness of a functional, we introduce a new notion of lower and upper integral which subsumes as particular cases most of the approaches to integration in the literature. As a consequence, we can characterise which types of integrals can be used to calculate the natural extension (the lower envelope of all linear extensions) of a positive bounded charge.     

Highly monodisperse crosslinked polymethylmethacrylate microparticles by dispersion polymerization

Highly monodisperse polymethylmethacrylate (PMMA) microparticles crosslinked with carboxylic group-containing urethane acrylates (CUA) were produced by simple dispersion polymerization in methanol solution. In contrast to conventional crosslinkers, the CUA employed as a crosslinker was excellent for maintaining the monodispersity of PMMA microparticles even at moderate crosslinker concentrations (to about 5 wt%). It was believed that the CUA helped form the monomer-swellable surface of primary particles, because of the structurally long tetramethylene oxide groups in the molecule. Carboxylic groups in the molecular backbone resulted in larger primary particles by increasing the solubility of the monomer mixture in the medium. Owing to these larger primary particles, the crosslinked PMMA particles showed lower polymerization rates than the linear ones during particle growth. However, at high CUA concentrations (about 10 wt%), bimodal distributions were observed. This was attributed to the high crosslinking density of the primary particle surfaces. Therefore, monomer diffusion toward the polymer phase was restricted, resulting in more favorable secondary nucleation in the medium. Received: 12 May 1998 Accepted: 19 August 1998     

On Overlays and Minimization Diagrams

The overlay of 2≤m≤d minimization diagrams of n surfaces in ℝ ^d is isomorphic to a substructure of a suitably constructed minimization diagram of mn surfaces in ℝ ^d+m−1. This elementary observation leads to a new bound on the complexity of the overlay of minimization diagrams of collections of d-variate semi-algebraic surfaces, a tight bound on the complexity of the overlay of minimization diagrams of collections of hyperplanes, and faster algorithms for constructing such overlays. Further algorithmic implications are discussed. Work by V. Koltun was supported by NSF CAREER award CCF-0641402. Work by M. Sharir was supported by NSF Grants CCR-00-98246 and CCF-05-14079, by a grant from the Israeli Academy of Sciences for a Center of Excellence in Geometric Computing at Tel Aviv University, and by the Hermann Minkowski Minerva Center for Geometry at Tel Aviv University.     

Vector-valued perturbed equilibrium problems

The goal of this paper is to prove some general vector-valued perturbed equilibrium principles and some existence results of vector equilibrium points for bifunctions satisfying a new natural notion of lower semi-continuity. We obtain these results by going through a new concept of approximative equilibrium point.     

Lower bounds for blow-up time in a nonlinear parabolic problem

For a parabolic problem with a gradient nonlinearity which was introduced by Chipot and Weissler [M. Chipot, F.B. Weissler, Some blow up results for a nonlinear parabolic problem with a gradient term, SIAM J. Math. Anal. 20 (1989) 886-907] (see also [B. Kawohl, L.A. Peletier, Observations on blow up and dead cores for nonlinear parabolic equations, Math. Z. 202 (1989) 207-217]), the question of blow-up is investigated. Specifically, if the solution blows up, a lower bound for the time of blow-up is derived     

Randomized approximation of Sobolev embeddings, III

We continue the study of randomized approximation of embeddings between Sobolev spaces on the basis of function values. The source space is a Sobolev space with nonnegative smoothness order; the target space has negative smoothness order. The optimal order of approximation (in some cases only up to logarithmic factors) is determined. Extensions to Besov and Bessel potential spaces are given and a problem recently posed by Novak and Woźniakowski is partially solved. The results are applied to the complexity analysis of weak solution of elliptic PDE.     

基于非协调有限元方法的特征值的下界逼近

本文将文献提出的非协调元方法用于二阶椭圆特征值问题,证明了最优的误差估计.并且证明了当网格充分细时,近似特征值总是比真解小.     

On the Hausdorff Dimension of Regular Points of Inviscid Burgers Equation with Stable Initial Data

Consider an inviscid Burgers equation whose initial data is a Lévy α-stable process Z with α>1. We show that when Z has positive jumps, the Hausdorff dimension of the set of Lagrangian regular points associated with the equation is strictly smaller than 1/α, as soon as α is close to 1. This gives a partially negative answer to a Conjecture of Janicki and Woyczynski (J. Stat. Phys. 86(1–2):277–299, 1997). Along the way, we contradict a recent Conjecture of Z. Shi () about the lower tails of integrated stable processes.     

On the Dirac equation in the algebraic approximation

It is shown that the restrictive conditions of Wood et al. [1] are not necessary to reach the conclusion that the Dirac hamiltonian, projected onto the space of the large component, exhibits variational properties. The eigenvalue spectrum of matrix approximations to the partitioned hamiltonian (obtained by matrix partitioning) converges to the exact spectrum in the limit of infinite order (assuming completeness) but not necessarily from above as for true matrix representations (obtained from operator partitioning). Optimization of non-linear parameters is shown not to cause variational instabilities.Control Data Corporation PACER fellow 1984–1986