Lexical Scope and Statistical Computing

Abstract

Programming environments such as S and Lisp-Stat have languages for performing computations, data storage mechanisms, and a graphical interface. These languages provide an interactive interface to data analysis that is invaluable. To take full advantage of these programming environments, statisticians must understand the differences between them. Ihaka and Gentleman introduced R, a version of S which uses a different scoping regimen. In some ways this makes R behave more like Lisp-Stat. This article discusses the concept of scoping rules and shows how lexical scope can enhance the functionality of a language.     

Compactness of Iterated Commutators on Weighted Bergman Spaces

Compactness of Iterated Commutators on Weighted Bergman Spaces@刘永民&&     

模糊分析计算中的结构元方法

提出模糊结构元的概念，研究模糊结构元的性质，给出模糊数和模糊值函数的结构元表现定理。利用模糊数和模糊值函数的结构元表现形式，使得过去必须依赖扩张原理和表现定理来刻画的模糊数运算、模糊值函数的微积分运算等变得更加简单与直观。     

Some variant of Newton’s method with third-order convergence

We present a new modification of the Newton’s method which produces iterative methods with order of convergence three. A general error analysis providing the higher order of convergence is given, and the best efficiency, in term of function evaluations, of two of this new methods is provided.     

Denumerable controlled Markov chains with average reward criterion: Sample path optimality

We consider discrete-time nonlinear controlled stochastic systems, modeled by controlled Makov chains with denumerable state space and compact action space. The corresponding stochastic control problem of maximizing average rewards in the long-run is studied. Departing from the most common position which usesexpected values of rewards, we focus on a sample path analysis of the stream of states/rewards. Under a Lyapunov function condition, we show that stationary policies obtained from the average reward optimality equation are not only average reward optimal, but indeed sample path average reward optimal, for almost all sample paths.Research supported by a U.S.-México Collaborative Research Program funded by the National Science Foundation under grant NSF-INT 9201430, and by CONACyT-MEXICO.Partially supported by the MAXTOR Foundation for applied Probability and Statistics, under grant No. 01-01-56/04-93.Research partially supported by the Engineering Foundation under grant RI-A-93-10, and by a grant from the AT&T Foundation.     

André-Quillen cohomology and rational homotopy of function spaces

We develop a simple theory of André-Quillen cohomology for commutative differential graded algebras over a field of characteristic zero. We then relate it to the homotopy groups of function spaces and spaces of homotopy self-equivalences of rational nilpotent CW-complexes. This puts certain results of Sullivan in a more conceptual framework.     

Parallel radial basis function methods for the global optimization of expensive functions

We introduce a master–worker framework for parallel global optimization of computationally expensive functions using response surface models. In particular, we parallelize two radial basis function (RBF) methods for global optimization, namely, the RBF method by Gutmann [Gutmann, H.M., 2001a. A radial basis function method for global optimization. Journal of Global Optimization 19(3), 201–227] (Gutmann-RBF) and the RBF method by Regis and Shoemaker [Regis, R.G., Shoemaker, C.A., 2005. Constrained global optimization of expensive black box functions using radial basis functions, Journal of Global Optimization 31, 153–171] (CORS-RBF). We modify these algorithms so that they can generate multiple points for simultaneous evaluation in parallel. We compare the performance of the two parallel RBF methods with a parallel multistart derivative-based algorithm, a parallel multistart derivative-free trust-region algorithm, and a parallel evolutionary algorithm on eleven test problems and on a 6-dimensional groundwater bioremediation application. The results indicate that the two parallel RBF algorithms are generally better than the other three alternatives on most of the test problems. Moreover, the two parallel RBF algorithms have comparable performances on the test problems considered. Finally, we report good speedups for both parallel RBF algorithms when using a small number of processors.     

Infrared Image Series Automatic Registration and a History & Tendency Analysis

Infrared camera has been widely used in electrical power systems for predictive and preventive thermal fault diagnosis. Without historical IR images being considered, most thermograph analysis used at present are concerned with static image. The dynamic history and tendency analysis which compares the newly taken image with historical images is particularly attractive. Conclusions can be drawn from temperature variations rather than just from anomalous thermal pattern. However the spatial distortions prevent such dynamic analysis from being practicable. So the need to register infrared images arises. This paper proposes an automatic registration algorithm based on closed temperature contour matching for infrared image series of a target equipment taken at different times. Centroid Distance Function is used in image registration for the first time. The algorithm can remove spatial distortions, bring temperature variations into prominence and endow infrared camera with dynamic analysis ability. Experiment shows that the algorithm is simple, effective and extensible.     

非齐次线性差分方程的Cm解[英文]

设c0,c1,…,cn均为实的常数，F（x)是个从R到R的C^m映射。本文讨论了非齐次线性差分方程∑i=1ncif(x i)=F(x)的C^m(m≥0）的存在性和唯一性。     

The Interpolation Problem on the Maximal Ideal Space of H~∞

ＴｈｅＩｎｔｅｒｐｏｌａｔｉｏｎＰｒｏｂｌｅｍｏｎｔｈｅＭａｘｉｍａｌＩｄｅａｌＳｐａｃｅｏｆＨ~∞￥ＧｕｏＫｕｎｇｕ（郭坤宇）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＳｉｃｈｕａｎＵｎｉｖｅｒｓｉｔｙ，Ｃｈｅｎｇｄｕ，６１００６４）Ａｂｓ?..