Polyharmonic and Related Kernels on Manifolds: Interpolation and Approximation

This article is devoted to developing a theory for effective kernel interpolation and approximation in a general setting. For a wide class of compact, connected C ^∞ Riemannian manifolds, including the important cases of spheres and SO(3), and using techniques involving differential geometry and Lie groups, we establish that the kernels obtained as fundamental solutions of certain partial differential operators generate Lagrange functions that are uniformly bounded and decay away from their center at an algebraic rate, and in certain cases, an exponential rate. An immediate corollary is that the corresponding Lebesgue constants for interpolation as well as for L ₂ minimization are uniformly bounded with a constant whose only dependence on the set of data sites is reflected in the mesh ratio, which measures the uniformity of the data. The kernels considered here include the restricted surface splines on spheres, as well as surface splines for SO(3), both of which have elementary closed-form representations that are computationally implementable. In addition to obtaining bounded Lebesgue constants in this setting, we also establish a “zeros lemma” for domains on compact Riemannian manifolds—one that holds in as much generality as the corresponding Euclidean zeros lemma (on Lipschitz domains satisfying interior cone conditions) with constants that clearly demonstrate the influence of the geometry of the boundary (via cone parameters) as well as that of the Riemannian metric.     

Heavy-traffic limits for many-server queues with service interruptions

We establish many-server heavy-traffic limits for G/M/n+M queueing models, allowing customer abandonment (the +M), subject to exogenous regenerative service interruptions. With unscaled service interruption times, we obtain a FWLLN for the queue-length process, where the limit is an ordinary differential equation in a two-state random environment. With asymptotically negligible service interruptions, we obtain a FCLT for the queue-length process, where the limit is characterized as the pathwise unique solution to a stochastic integral equation with jumps. When the arrivals are renewal and the interruption cycle time is exponential, the limit is a Markov process, being a jump-diffusion process in the QED regime and an O–U process driven by a Levy process in the ED regime (and for infinite-server queues). A stochastic-decomposition property of the steady-state distribution of the limit process in the ED regime (and for infinite-server queues) is obtained.     

Sobolev bounds on functions with scattered zeros, with applications to radial basis function surface fitting

In this paper we discuss Sobolev bounds on functions that vanish at scattered points in a bounded, Lipschitz domain that satisfies a uniform interior cone condition. The Sobolev spaces involved may have fractional as well as integer order. We then apply these results to obtain estimates for continuous and discrete least squares surface fits via radial basis functions (RBFs). These estimates include situations in which the target function does not belong to the native space of the RBF.

     

Group automorphisms with few and with many periodic points

For each a compact group automorphism is constructed with the property that

This may be interpreted as a combinatorial analogue of the (still open) problem of whether compact group automorphisms with any given topological entropy exist.

     

Gold codes,Hadamard partitions and the security of CDMA systems

Let V = {1, 2, . . . , M} and let be a set of Hadamard matrices with the property that the magnitude of the dot product of any two rows of distinct matrices is bounded above. A Hadamard partition is any partition of the set of all rows of the matrices H _i into Hadamard matrices. Such partitions have an application to the security of quasi-synchronous code-division multiple-access radio systems when loosely synchronized (LS) codes are used as spreading codes. A new generation of LS code can be used for each information bit to be spread. For each generation, a Hadamard matrix from some partition is selected for use in the code construction. This code evolution increases security against eavesdropping and jamming. One security aspect requires that the number of Hadamard partitions be large. Thus the number of partitions is studied here. If a Kerdock code construction is used for the set of matrices, the Hadamard partition constructed is shown to be unique. It is also shown here that this is not the case if a Gold (or Gold-like) code construction is used. In this case the number of Hadamard partitions can be enumerated, and is very large.      

A review ofL=λW and extensions

A fundamental principle of queueing theory isL=W (Little's law), which states that the time-average or expected time-stationary number of customers in a system is equal to the product of the arrival rate and the customer-average or expected customer-stationary time each customer spends in the system. This principle is now well known and frequently applied. However, in recent years there have been extensions, such as H=G and the continuous, distributional, ordinal and central-limit-theorem versions, which show that theL=W relation, when viewed properly, has much more power than was previously realized. Moreover, connections have been established between H=G and other fundamental relations, such as the rate conservation law and PASTA (Poisson arrivals see time averages), which show that there is a much greater unity in the overall theory than was previously realized. This paper provides a review.This paper is dedicated to the memory of our colleague Professor Peter Franken (1937–1989), who contributed greatly to the subject of this paper and to queueing theory more generally.     

Approximation properties of zonal function networks using scattered data on the sphere

A zonal function (ZF) network is a function of the form x↦∑ _k=1 ⁿ c _k (x · y _k), where x and the y _k's are on the unit sphere in q+1 dimensional Euclidean space, and where the y _k's are scattered points. In this paper, we study the degree of approximation by ZF networks. In particular, we compare this degree of approximation with that obtained with the classical spherical harmonics. In many cases of interest, this is the best possible for a given amount of information regarding the target function. We also discuss the construction of ZF networks using scattered data. Our networks require no training in the traditional sense, and provide theoretically predictable rates of approximation. This revised version was published online in June 2006 with corrections to the Cover Date.     

锂离子电池硅基负极材料的研究进展

硅基材料是新一代高容量锂离子蓄电池负极材料的典型代表,近年来已成为理论研究和应用研究的热点.本文介绍了锂离子电池硅基负极材料的制备方法、电化学性能及其研究现状,分析了硅材料作为锂离子电池负极材料存在的问题;讨论了硅材料作为锂离子电池负极材料的研究前景.并指出若能克服目前存在问题,将有望成为新一代锂离子电池负极材料.     

A constructive proof by elementary transformations of Roth's removal theorems in the theory of matrix equations

W. E. Roth gave necessary and sufficient conditions for the existence of solution(s) of certain types of linear matrix equations. Proofs were based on invariant factors and were long and complicated. Other shorter but non-constructive proofs have since been provided by later authors. We present here very brief constructive proofs based on the simplest of mathematical techniques, namely row- and column-reduction of a matrix.     

A composite Level Set and Extended-Domain-Eigenfunction Method for simulating 2D Stokes flow involving a free surface

In this paper, the Extended-Domain-Eigenfunction-Method (EDEM) is combined with the Level Set Method in a composite numerical scheme for simulating a moving boundary problem. The liquid velocity is obtained by formulating the problem in terms of the EDEM methodology and solved using a least square approach. The propagation of the free surface is effected by a narrow band Level Set Method. The two methods both pass information to each other via a bridging process, which allows the position of the interface to be updated. The numerical scheme is applied to a series of problems involving a gas bubble submerged in a viscous liquid moving subject to both an externally generated flow and the influence of surface tension.