级数小于1的亚纯函数的Borel例外值

证明了当超越亚纯函数的级小于1时，其Norel例外值最多只有一个．由于存在任何级的整函数，因此一个例外值总可达到，故所得结果不能再改进。     

A Dominated Theorem on 5L(2, R) and Its Application

In this paper, we give the following dominated theorem: Let φ(g) ∈ L1(G//K),φε(t)=ε> 0, and the least radical decreasing dominatedfunction φ(t) = sup |φ(y)| ∈L1(G//K). If shtφ(t) is monotonically decreasingon (0, ∞), then for any f∈L1loc(G//K) , the following inequality holds:sup |φε * f(x)| ≤ Cmf(x),where mf(x) is the Hardy-Littlewood maximal function of f, and C = ||φ||1.An application of this dominated theorem is also given.     

On Brennan's Conjecture for a Special Class of Functions

In this paper, we prove Brennan's conjecture for conformal mappings f of the disk {z : | z| < 1} assuming that the Taylor coefficients of the function log(zf′(z)/f(z)) at zero are nonnegative. We also obtain inequalities for the integral means over the circle |z| = r of the squared modulus of the function zf′(z)/f(z).     

Finding finer functions for partially characterized proteins by protein-protein interaction networks

Based on high-throughput data, numerous algorithms have been designed to find functions of novel proteins. However, the effectiveness of such algorithms is currently limited by some fundamental factors, including (1) the low a-priori probability of novel proteins participating in a detailed function; (2) the huge false data present in high-throughput datasets; (3) the incomplete data coverage of functional classes; (4) the abundant but heterogeneous negative samples for training the algorithms; and (5) the lack of detailed functional knowledge for training algorithms. Here, for partially characterized proteins, we suggest an approach to finding their finer functions based on protein interaction sub-networks or gene expression patterns, defined in function-specific subspaces. The proposed approach can lessen the above-mentioned problems by properly defining the prediction range and functionally filtering the noisy data, and thus can efficiently find proteins’ novel functions. For thousands of yeast and human proteins partially characterized, it is able to reliably find their finer functions (e.g., the translational functions) with more than 90% precision. The predicted finer functions are highly valuable both for guiding the follow-up wet-lab validation and for providing the necessary data for training algorithms to learn other proteins.     

Besov-Morrey spaces: Function space theory and applications to non-linear PDE

This paper is devoted to the analysis of function spaces modeled on Besov spaces and their applications to non-linear partial differential equations, with emphasis on the incompressible, isotropic Navier-Stokes system and semi-linear heat equations. Specifically, we consider the class, introduced by Hideo Kozono and Masao Yamazaki, of Besov spaces based on Morrey spaces, which we call Besov-Morrey or BM spaces. We obtain equivalent representations in terms of the Weierstrass semigroup and wavelets, and various embeddings in classical spaces. We then establish pseudo-differential and para-differential estimates. Our results cover non-regular and exotic symbols. Although the heat semigroup is not strongly continuous on Morrey spaces, we show that its action defines an equivalent norm. In particular, homogeneous BM spaces belong to a larger class constructed by Grzegorz Karch to analyze scaling in parabolic equations. We compare Karch's results with those of Kozono and Yamazaki and generalize them by obtaining short-time existence and uniqueness of solutions for arbitrary data with subcritical regularity. We exploit pseudo-differential calculus to extend the analysis to compact, smooth, boundaryless, Riemannian manifolds. BM spaces are defined by means of partitions of unity and coordinate patches, and intrinsically in terms of functions of the Laplace operator.

     

具有控制系数的高阶线性微分方程复振荡的一个结果

该文考虑具有控制系数 A\-0 和系数仅有有限个极点的高阶线性齐次微分方程（1.1）。得到了一个复振荡结果，该结果是J. K. Langley［11］等作者在整系数下相应结果的推广。     

广义C-R组的性质及两个边值问题

本文考虑广义C-R组^[1](H)的解f=u iv jw∈C^2的一些性质，提出与之相关的两个边值问题，用积分方程方法和调和函数性质证明了边值问题解的存在唯一性，并写出解的积分表达式．     

Computing Zeta Functions of Kummer Curves via Multiplicative Characters

We present a practical polynomial-time algorithm for computing the zeta function of a Kummer curve over a finite field of small characteristic. Such algorithms have recently been obtained using a method of Kedlaya based upon Monsky–Washnitzer cohomology, and are of interest in cryptography. We take a different approach. The problem is reduced to that of computing the L-function of a multiplicative character sum. This latter task is achieved via a cohomological formula based upon the work of Dwork and Reich. We show, however, that our method and that of Kedlaya are very closely related.Dedicated to the memory of Gian-Carlo Rota     

Integrability of subdifferentials of directionally Lipschitz functions

Using a quantitative version of the subdifferential characterization of directionally Lipschitz functions, we study the integrability of subdifferentials of such functions over arbitrary Banach space.

     

A subdomain boundary element method for high‐Reynolds laminar flow using stream function‐vorticity formulation

The paper presents a new formulation of the integral boundary element method (BEM) using subdomain technique. A continuous approximation of the function and the function derivative in the direction normal to the boundary element (further ‘normal flux’) is introduced for solving the general form of a parabolic diffusion‐convective equation. Double nodes for normal flux approximation are used. The gradient continuity is required at the interior subdomain corners where compatibility and equilibrium interface conditions are prescribed. The obtained system matrix with more equations than unknowns is solved using the fast iterative linear least squares based solver. The robustness and stability of the developed formulation is shown on the cases of a backward‐facing step flow and a square‐driven cavity flow up to the Reynolds number value 50 000. Copyright © 2004 John Wiley & Sons, Ltd.