Pure adaptive search in monte carlo optimization

Pure adaptive search constructs a sequence of points uniformly distributed within a corresponding sequence of nested regions of the feasible space. At any stage, the next point in the sequence is chosen uniformly distributed over the region of feasible space containing all points that are equal or superior in value to the previous points in the sequence. We show that for convex programs the number of iterations required to achieve a given accuracy of solution increases at most linearly in the dimension of the problem. This compares to exponential growth in iterations required for pure random search.     

响应变量随机缺失下的半参变系数模型的均值估计

在响应变量随机缺失时,研究了半参数变系数模型响应变量均值的借补估计.首先利用完整个体估计模型中的参数与非参数部分,然后再用借补方法与加权借补方法估计响应变量的均值.最后求出了估计的渐近偏差与渐近方差,研究了所得到的估计的渐近性质,并进行模拟比较.     

Determination of a control parameter in a one-dimensional parabolic equation using the method of radial basis functions

In this work, the method of radial basis functions is used for finding the solution of an inverse problem with source control parameter. Because a much wider range of physical phenomena are modelled by nonclassical parabolic initial-boundary value problems, theoretical behavior and numerical approximation of these problems have been active areas of research. The radial basis functions (RBF) method is an efficient mesh free technique for the numerical solution of partial differential equations. The main advantage of numerical methods which use radial basis functions over traditional techniques is the meshless property of these methods. In a meshless method, a set of scattered nodes are used instead of meshing the domain of the problem. The results of numerical experiments are presented and some comparisons are made with several well-known finite difference schemes.     

浅析用图像法处理实验数据

指出了图像法在解决物理问题中的优势及应注意的问题,并对用图像法处理实验数据的考题进行了归类．     

Multiscale kernels

This paper reconstructs multivariate functions from scattered data by a new multiscale technique. The reconstruction uses standard methods of interpolation by positive definite reproducing kernels in Hilbert spaces. But it adopts techniques from wavelet theory and shift-invariant spaces to construct a new class of kernels as multiscale superpositions of shifts and scales of a single compactly supported function φ. This means that the advantages of scaled regular grids are used to construct the kernels, while the advantages of unrestricted scattered data interpolation are maintained after the kernels are constructed. Using such a multiscale kernel, the reconstruction method interpolates at given scattered data. No manipulations of the data (e.g., thinning or separation into subsets of certain scales) are needed. Then, the multiscale structure of the kernel allows to represent the interpolant on regular grids on all scales involved, with cheap evaluation due to the compact support of the function φ, and with a recursive evaluation technique if φ is chosen to be refinable. There also is a wavelet-like data reduction effect, if a suitable thresholding strategy is applied to the coefficients of the interpolant when represented over a scaled grid. Various numerical examples are presented, illustrating the multiresolution and data compression effects.     

Transformations in optics: Novel perspectives,approaches, applications and implementations

This paper summarizes a set of novel techniques for obtaining optical transformations, which are useful tools for signal processing. Then the paper focuses on deriving several interesting discrete transformations. The discussed transforms include continuous fractional transformations, hybrid transforms and discrete transform kernels.     

Resolvent estimates in W−1,p related to strongly coupled‐linear parabolic systems with coupled nonsmooth capacities

We investigate linear parabolic systems with coupled nonsmooth capacities and mixed boundary conditions. We prove generalized resolvent estimates in W^{?1, p} spaces. The method is an appropriate modification of a technique introduced by Agmon to obtain L^p estimates for resolvents of elliptic differential operators in the case of smooth boundary conditions. Moreover, we establish an existence and uniqueness result. Copyright © 2007 John Wiley & Sons, Ltd.     

运用反例基于识别的手写数字串分割

采用基于识别的分割方法进行手写数字串分割.在识别的过程中,运用反例样本估计分类器参数,实验数据表明,这种运用反例样本训练的分类器与没有经过反例样本训练的分类器相比,将提高拒识率到19%左右,从而保证了较高的识别率,验证了只有经过反例训练的分类器的输出结果才是可信赖的.     

Learning Markov chains in fractal compression of image data

In a recent paper [17] we proposed a stochastic algorithm which generates optimal probabilities for the decompression of an image represented by the fixed point of an IFS system (SAOP). We show here that such an algorithm is in fact a non trivial example of Generalized Random System with Complete Connections. We also exhibit a generalization which could represent the solution to the inverse problem for an image with grey levels, if a fixed set of contraction maps is available. Received: 1 July 2002