Weak and Strong Solutions for the Stokes Approximation of Non-homogeneous Incompressible Navier-Stokes Equations

In this paper,the Dirichlet problem of Stokes approximate of non-homogeneous incompressibleNavier-Stokes equations is studied.It is shown that there exist global weak solutions as well as global andunique strong solution for this problem,under the assumption that initial density ρ_0(x)is bounded away from0 and other appropriate assumptions(see Theorem 1 and Theorem 2).The semi-Galerkin method is applied toconstruct the approximate solutions and a prior estimates are made to elaborate upon the compactness of theapproximate solutions.     

The measure of a translated ball in uniformly convex spaces

Let (E, ¦·¦) be a uniformly convex Banach space with the modulus of uniform convexity of power type. Let be the convolution of the distribution of a random series inE with independent one-dimensional components and an arbitrary probability measure onE. Under some assumptions about the components and the smoothness of the norm we show that there exists a constant such that |{·<t}–{·+r<t}|r ^q , whereq depends on the properties of the norm. We specify it in the case ofL spaces, >1.     

The complexity of many cells in arrangements of planes and related problems

We consider several problems involving points and planes in three dimensions. Our main results are: (i) The maximum number of faces boundingm distinct cells in an arrangement ofn planes isO(m ^2/3 n logn +n ²); we can calculatem such cells specified by a point in each, in worst-case timeO(m ^2/3 n log³ n+n ² logn). (ii) The maximum number of incidences betweenn planes andm vertices of their arrangement isO(m ^2/3 n logn+n ²), but this number is onlyO(m ^3/5– n ^4/5+2 +m+n logm), for any>0, for any collection of points no three of which are collinear. (iii) For an arbitrary collection ofm points, we can calculate the number of incidences between them andn planes by a randomized algorithm whose expected time complexity isO((m ^3/4– n ^3/4+3 +m) log² n+n logn logm) for any>0. (iv) Givenm points andn planes, we can find the plane lying immediately below each point in randomized expected timeO([m ^3/4– n ^3/4+3 +m] log² n+n logn logm) for any>0. (v) The maximum number of facets (i.e., (d–1)-dimensional faces) boundingm distinct cells in an arrangement ofn hyperplanes ind dimensions,d>3, isO(m ^2/3 n ^d/3 logn+n ^d–1). This is also an upper bound for the number of incidences betweenn hyperplanes ind dimensions andm vertices of their arrangement. The combinatorial bounds in (i) and (v) and the general bound in (ii) are almost tight.Work on this paper by the first author has been supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and by NSF Grant CCR-8714565. Work by the third author has been supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grant DCR-82-20085, by grants from the Digital Equipment Corporation, and the IBM Corporation, and by a research grant from the NCRD—the Israeli National Council for Research and Development. An abstract of this paper has appeared in theProceedings of the 13th International Mathematical Programming Symposium, Tokyo, 1988, p. 147.     

Implicitly representing arrangements of lines or segments

Anarrangement ofn lines (or line segments) in the plane is the partition of the plane defined by these objects. Such an arrangement consists ofO(n ²) regions, calledfaces. In this paper we study the problem of calculating and storing arrangementsimplicitly, using subquadratic space and preprocessing, so that, given any query pointp, we can calculate efficiently the face containingp. First, we consider the case of lines and show that with (n) space¹ and (n ^3/2) preprocessing time, we can answer face queries in (n)+O(K) time, whereK is the output size. (The query time is achieved with high probability.) In the process, we solve three interesting subproblems: (1) given a set ofn points, find a straight-edge spanning tree of these points such that any line intersects only a few edges of the tree, (2) given a simple polygonal path , form a data structure from which we can find the convex hull of any subpath of quickly, and (3) given a set of points, organize them so that the convex hull of their subset lying above a query line can be found quickly. Second, using random sampling, we give a tradeoff between increasing space and decreasing query time. Third, we extend our structure to report faces in an arrangement of line segments in (n ^1/3)+O(K) time, given(n ^4/3) space and (n ^5/3) preprocessing time. Lastly, we note that our techniques allow us to computem faces in an arrangement ofn lines in time (m ^2/3 n ^2/3+n), which is nearly optimal.The first author is pleased to acknowledge the support of Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and National Science Foundation Grant CCR-8714565. Work on this paper by the fifth author has been supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grant NSF-DCR-83-20085, by grants from the Digital Equipment Corporation, and the IBM Corporation, and by a research grant from the NCRD—the Israeli National Council for Research and Development. The sixth author was supported in part by a National Science Foundation Graduate Fellowship. This work was begun while the non-DEC authors were visiting at the DEC Systems Research Center.     

Kaon production in\bar pp interactions at c.m. energies from 200 to 900 GeV

A detailed analysis ofK _s ⁰ production in \(\bar pp\) |<2.5 the average transverse momentum is found to be 0.53±0.07 GeV/c at 200 GeV and 0.62±0.08 GeV/c at 900 GeV, which is an increase with respect to data at c.m. energies below 60 GeV. TheK _s ⁰ production cross sections in inelastic collisions are 29±4 mb at 200 GeV and 63±6 mb at 900 GeV, showing an increase compared to lower energy data. The central kaon density is found to increase as a logarithmic function of energy. At 900 GeV, where statistics are sufficient to allow one to draw conclusions, the average transverse momentum is higher in events with large charged multiplicity than in events with low multiplicity.     

Phase space dependence of the multiplicity distribution in π+ andpp collisions at 250 GeV/c

The charged particle multiplicity distribution has been studied for non-single-diffractive π⁺ p andpp collisions at \(\sqrt s = 22\) GeV, for full phase space as well as for intervals in rapidity, azimuthal angle and transverse momentum. In general, the multiplicity distribution is well described by a negative binomial. From comparison of the distribution for negative or positive particles to that of all charged particles, cascading is favoured as an interpretation over stimulated emission. Interesting consequences follow from a comparison of our results to those at collider energies and toe ⁺ e ^? data at comparable energy. Furthermore, evidence is given that the multiplicity distribution is not exactly of negative binomial type in every (connected or disconnected) phase space region.     

Forward-backward multiplicity correlations in σ+ p,K + p andpp collisions at 250 GeV/c

Forward-backward multiplicity correlations in σ⁺,K ⁺ p andpp collisions at 250 GeV/c ( \(\sqrt s \) =22 GeV) are given for all charges and for the different charge combinations. The correlations are found to be caused predominantly by centrally produced particles. It is demonstrated that this result is an agreement with observations at the ISR and the CERNp \(\bar p\) -Collider. The results are compared to expectations from LUND, DPM and FRITIOF Monte Carlo models and a geometrical picture relating correlations in hadron-hadron collisions toe ⁺ e ^? data in terms of impact parameters is tested.     

Energetic ion bombardment of Ag surfaces by C<Stack><Subscript>60</Subscript><Superscript>+</Superscript></Stack> and Ga<Superscript>+</Superscript> projectiles

The ion bombardment-induced release of particles from a metal surface is investigated using energetic fullerene cluster ions as projectiles. The total sputter yield as well as partial yields of neutral and charged monomers and clusters leaving the surface are measured and compared with corresponding data obtained with atomic projectile ions of similar impact kinetic energy. It is found that all yields are enhanced by about one order of magnitude under bombardment with the C60+ cluster projectiles compared with Ga+ ions. In contrast, the electronic excitation processes determining the secondary ion formation probability are unaffected. The kinetic energy spectra of sputtered particles exhibit characteristic differences which reflect the largely different nature of the sputtering process for both types of projectiles. In particular, it is found that under C60+ impact (1) the energy spectrum of sputtered atoms peaks at significantly lower kinetic energies than for Ga+ bombardment and (2) the velocity spectra of monomers and dimers are virtually identical, a finding which is in pronounced contrast to all published data obtained for atomic projectiles. The experimental findings are in reasonable agreement with recent molecular dynamics simulations.     

Application of stir bar sorptive extraction for wine analysis

Stir bar sorptive extraction (SBSE) coupled with gas chromatography/mass spectrometry (GC/MS) was used to analyse wine samples for three applications: flavour and compositional analysis; 2,4,6-trichloroanisole (TCA), a common off-aroma in wine; and agrochemicals. SBSE was found to be orders of magnitude more sensitive than modern conventional methodology, allowing for lower detection and quantitation levels, and improved confirmation of identity; SBSE often gave better signal to noise in scan mode than other methods in selective ion monitoring (SIM) mode. With the help of their characteristic mass spectra all agrochemicals could be identified unambiguously at concentrations of 10 microg L(-1) in wine and a further 100 constituents were detected in a Cabernet Sauvignon sample. Thus it is now possible to analyse complex samples such as wine by scan mode, with better confirmation of identity, and without sacrificing sensitivity, where previously SIM methodology had to be used.     

Underpotential deposition of tin(II) on a gold disc electrode and determination of tin in a tin plate sample

This work describes a study of the underpotential deposition (UPD) of Sn²⁺ on a polycrystalline gold disc electrode using cyclic voltammetry (CV) and chronocoulometry (CC). Sn²⁺ ions showed well-defined peaks from UPD and UPD stripping (UPD-S) in 1 mol/L HCl solutions, while bulk deposition (BD) and BD stripping (BD-S) of the ions were also observed. The measured UPD shifts, E_UPD, between the UPD-S and the BD-S peaks were more than 200 mV. The UPD charge and the surface coverage of tin were measured by CC. A new method for determining Sn²⁺ was therefore developed, based on the excellent electrochemical properties of the Au/Sn UPD system. A plot of the UPD-DPASV (differential pulse anodic stripping voltammetry) signal versus the Sn(II) concentration was obtained for [Sn(II)] of 1.98×10^–7 to 3.64×10^–5 M. The method developed here has been applied to determine the tin in a tin plate sample.