COMPLEX GEODESICS, THEIR BOUNDARY REGULARITY, AND A HARDY-LITTLEWOOD-TYPE LEMMA

We begin by giving an example of a smoothly bounded convex domain that has complex geodesics that do not extend continuously up to partial derivative D. This example suggests that continuity at the boundary of the complex geodesics of a convex domain Omega (sic) C-n, n >= 2, is affected by the extent to which partial derivative Omega curves or bends at each boundary point. We provide a sufficient condition to this effect (on C-1-smoothly bounded convex domains), which admits domains having boundary points at which the boundary is infinitely flat. Along the way, we establish a Hardy-Littlewood-type lemma that might be of independent interest.

Maximal regularity for second order non-autonomous Cauchy problems

We consider some non-autonomous second order Cauchy problems of the form u + B(t)(u) over dot + A(t)u = f (t is an element of [0, T]), u(0) = (u) over dot(0) = 0. We assume that the first order problem (u) over dot + B(t)u = f (t is an element of [0, T]), u(0) = 0, has L-p-maximal regularity. Then we establish L-p-maximal regularity of the second order problem in situations when the domains of B(t(1)) and A(t(2)) always coincide, or when A(t) = kappa B(t).

Boundary regularity of correspondences in C-n

Let M, M' be smooth, real analytic hypersurfaces of finite type in C-n and f a holomorphic correspondence (not necessarily proper) that is defined on one side of M, extends continuously up to M and maps M to M-t. It is shown that f must extend across M as a locally proper holonnorphic correspondence. This is a version for correspondences of the Diederich-Pinchuk extension result for CR maps.

On the Nash-Williams′ Lemma in Graph Reconstruction Theory

A generalization of Nash-Williams′ lemma is proved for the Structure of m-uniform null (m − k)-designs. It is then applied to various graph reconstruction problems. A short combinatorial proof of the edge reconstructibility of digraphs having regular underlying undirected graphs (e.g., tournaments) is given. A type of Nash-Williams′ lemma is conjectured for the vertex reconstruction problem.

An interior penalty method for a sixth-order elliptic equation

We derive and study a C(0) interior penalty method for a sixth-order elliptic equation on polygonal domains. The method uses the cubic Lagrange finite-element space, which is simple to implement and is readily available in commercial software. After introducing some notation and preliminary results, we provide a detailed derivation of the method. We then prove the well-posedness of the method as well as derive quasi-optimal error estimates in the energy norm. The proof is based on replacing Galerkin orthogonality with a posteriori analysis techniques. Using this approach, we are able to obtain a Cea-like lemma with minimal regularity assumptions on the solution. Numerical experiments are presented that support the theoretical findings.

Extended histories: improving regularity and performance in correlation prefetchers

Data Prefetchers identify and make use of any regularity present in the history/training stream to predict future references and prefetch them into the cache. The training information used is typically the primary misses seen at a particular cache level, which is a filtered version of the accesses seen by the cache. In this work we demonstrate that extending the training information to include secondary misses and hits along with primary misses helps improve the performance of prefetchers. In addition to empirical evaluation, we use the information theoretic metric entropy, to quantify the regularity present in extended histories. Entropy measurements indicate that extended histories are more regular than the default primary miss only training stream. Entropy measurements also help corroborate our empirical findings. With extended histories, further benefits can be achieved by triggering prefetches during secondary misses also. In this paper we explore the design space of extended prefetch histories and alternative prefetch trigger points for delta correlation prefetchers. We observe that different prefetch schemes benefit to a different extent with extended histories and alternative trigger points. Also the best performing design point varies on a per-benchmark basis. To meet these requirements, we propose a simple adaptive scheme that identifies the best performing design point for a benchmark-prefetcher combination at runtime. In SPEC2000 benchmarks, using all the L2 accesses as history for prefetcher improves the performance in terms of both IPC and misses reduced over techniques that use only primary misses as history. The adaptive scheme improves the performance of CZone prefetcher over Baseline by 4.6% on an average. These performance gains are accompanied by a moderate reduction in the memory traffic requirements.

Some regularity theorems for CR mappings

The purpose of this article is to study Lipschitz CR mappings from an h-extendible (or semi-regular) hypersurface in . Under various assumptions on the target hypersurface, it is shown that such mappings must be smooth. A rigidity result for proper holomorphic mappings from strongly pseudoconvex domains is also proved.

Error analysis of discontinuous Galerkin methods for the Stokes problem under minimal regularity

In this article, we analyse several discontinuous Galerkin (DG) methods for the Stokes problem under minimal regularity on the solution. We assume that the velocity u belongs to H-0(1)(Omega)](d) and the pressure p is an element of L-0(2)(Omega). First, we analyse standard DG methods assuming that the right-hand side f belongs to H-1(Omega) boolean AND L-1(Omega)](d). A DG method that is well defined for f belonging to H-1(Omega)](d) is then investigated. The methods under study include stabilized DG methods using equal-order spaces and inf-sup stable ones where the pressure space is one polynomial degree less than the velocity space.

Regimes of nonlinear depletion and regularity in the 3D Navier-Stokes equations

The periodic 3D Navier-Stokes equations are analyzed in terms of dimensionless, scaled, L-2m-norms of vorticity D-m (1 <= m <= infinity). The first in this hierarchy, D-1, is the global enstrophy. Three regimes naturally occur in the D-1-D-m plane. Solutions in the first regime, which lie between two concave curves, are shown to be regular, owing to strong nonlinear depletion. Moreover, numerical experiments have suggested, so far, that all dynamics lie in this heavily depleted regime 1]; new numerical evidence for this is presented. Estimates for the dimension of a global attractor and a corresponding inertial range are given for this regime. However, two more regimes can theoretically exist. In the second, which lies between the upper concave curve and a line, the depletion is insufficient to regularize solutions, so no more than Leray's weak solutions exist. In the third, which lies above this line, solutions are regular, but correspond to extreme initial conditions. The paper ends with a discussion on the possibility of transition between these regimes.

Trehalose Toxicity in Cuscuta refexal Correlation With low Trehalase Activity

A toxic effect of a,a-trehalose in an angiospermic plant, Cuscuta reflexa (dodder), Is described. This disaccharide and Its analogs, 2-aminotrehalose and 4-aminotbhakose, induced a raid blackening of the terminal region of the vine which is Involved in elongation growth. From the results of in vitro growth of several angkiopermic plants and determination of trehalase activity in them, it is concluded that the toxic effect of trehalose in Cucaa is because of the very low trehalas activity In the vine. As a result, trehalose accumulates In the vine and interferes with some process closely associated with growth. The growth potential of Lemma (a duckweed) in a medium containing trehalose as the carbon source was ihreversibly lost upon addition of trealosamine, an Inhibitor of trehalase activity. It is concluded that, if allowed to accumulate within the tissue, trehalose may be potentiaMly toxic or inhibitory to higher plants in generaL The presence of trhalase actvity in plants, where Its substrate has not been found to occur, is envisged to relieve the plant from the toxic effects of trehalose which it may encounter in soil or during association with fungi or insects.

A simplified approach to a three-part Wiener-Hopf problem arising in diffraction theory

A direct and simple approach, utilizing Watson's lemma, is presented for obtaining an approximate solution of a three-part Wiener-Hopf problem associated with the problem of diffraction of a plane wave by a soft strip.

Resonances, scattering theory, and rigged Hilbert spaces

The problem of decaying states and resonances is examined within the framework of scattering theory in a rigged Hilbert space formalism. The stationary free,''in,'' and ''out'' eigenvectors of formal scattering theory, which have a rigorous setting in rigged Hilbert space, are considered to be analytic functions of the energy eigenvalue. The value of these analytic functions at any point of regularity, real or complex, is an eigenvector with eigenvalue equal to the position of the point. The poles of the eigenvector families give origin to other eigenvectors of the Hamiltonian: the singularities of the ''out'' eigenvector family are the same as those of the continued S matrix, so that resonances are seen as eigenvectors of the Hamiltonian with eigenvalue equal to their location in the complex energy plane. Cauchy theorem then provides for expansions in terms of ''complete'' sets of eigenvectors with complex eigenvalues of the Hamiltonian. Applying such expansions to the survival amplitude of a decaying state, one finds that resonances give discrete contributions with purely exponential time behavior; the background is of course present, but explicitly separated. The resolvent of the Hamiltonian, restricted to the nuclear space appearing in the rigged Hilbert space, can be continued across the absolutely continuous spectrum; the singularities of the continuation are the same as those of the ''out'' eigenvectors. The free, ''in'' and ''out'' eigenvectors with complex eigenvalues and those corresponding to resonances can be approximated by physical vectors in the Hilbert space, as plane waves can. The need for having some further physical information in addition to the specification of the total Hamiltonian is apparent in the proposed framework. The formalism is applied to the Lee–Friedrichs model and to the scattering of a spinless particle by a local central potential. Journal of Mathematical Physics is copyrighted by The American Institute of Physics.

Systematic study on crystal-contact engineering of diphthine synthase: influence of mutations at crystal-packing regions on X-ray diffraction quality

It is well known that protein crystallizability can be influenced by site-directed mutagenesis of residues on the molecular surface of proteins, indicating that the intermolecular interactions in crystal-packing regions may play a crucial role in the structural regularity at atomic resolution of protein crystals. Here, a systematic examination was made of the improvement in the diffraction resolution of protein crystals on introducing a single mutation of a crystal-packing residue in order to provide more favourable packing interactions, using diphthine synthase from Pyrococcus horikoshii OT3 as a model system. All of a total of 21 designed mutants at 13 different crystal-packing residues yielded almost isomorphous crystals from the same crystallization conditions as those used for the wild-type crystals, which diffracted X-rays to 2.1 angstrom resolution. Of the 21 mutants, eight provided crystals with an improved resolution of 1.8 angstrom or better. Thus, it has been clarified that crystal quality can be improved by introducing a suitable single mutation of a crystal-packing residue. In the improved crystals, more intimate crystal-packing interactions than those in the wild-type crystal are observed. Notably, the mutants K49R and T146R yielded crystals with outstandingly improved resolutions of 1.5 and 1.6 angstrom, respectively, in which a large-scale rearrangement of packing interactions was unexpectedly observed despite the retention of the same isomorphous crystal form. In contrast, the mutants that provided results that were in good agreement with the designed putative structures tended to achieve only moderate improvements in resolution of up to 1.75 angstrom. These results suggest a difficulty in the rational prediction of highly effective mutations in crystal engineering.

Automatic text block separation in document images

Separation of printed text blocks from the non-text areas, containing signatures, handwritten text, logos and other such symbols, is a necessary first step for an OCR involving printed text recognition. In the present work, we compare the efficacy of some feature-classifier combinations to carry out this separation task. We have selected length-nomalized horizontal projection profile (HPP) as the starting point of such a separation task. This is with the assumption that the printed text blocks contain lines of text which generate HPP's with some regularity. Such an assumption is demonstrated to be valid. Our features are the HPP and its two transformed versions, namely, eigen and Fisher profiles. Four well known classifiers, namely, Nearest neighbor, Linear discriminant function, SVM's and artificial neural networks have been considered and efficiency of the combination of these classifiers with the above features is compared. A sequential floating feature selection technique has been adopted to enhance the efficiency of this separation task. The results give an average accuracy of about 96.