Speeding up the FMMR perfect sampling algorithm: A case study revisited

In a previous paper by the second author, two Markov chain Monte Carlo perfect sampling algorithms—one called coupling from the past (CFTP) and the other (FMMR) based on rejection sampling—are compared using as a case study the move‐to‐front (MTF) self‐organizing list chain. Here we revisit that case study and, in particular, exploit the dependence of FMMR on the user‐chosen initial state. We give a stochastic monotonicity result for the running time of FMMR applied to MTF and thus identify the initial state that gives the stochastically smallest running time; by contrast, the initial state used in the previous study gives the stochastically largest running time. By changing from worst choice to best choice of initial state we achieve remarkable speedup of FMMR for MTF; for example, we reduce the running time (as measured in Markov chain steps) from exponential in the length n of the list nearly down to n when the items in the list are requested according to a geometric distribution. For this same example, the running time for CFTP grows exponentially in n. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2003     

具有非负Fourier系数的Fourier和逼近的一个注记

给出了具有非负Fourier系数的连续周期偶函数的Fourier和的逼近达到其最佳逼近阶的一个充分条件。     

A HIGH ORDER METHOD FOR NON-SMOOTH FREDHOLM EQUATIONS

1.IntroductionConsidertheequationwherek(s,t)=k(f)tandf(s)aregiven,uistheunknownsolution.SinceitisrelatedcloselytoWiener-Hopfequationsandisveryimportantinpractice,therearemanynumericalresultsaboutit(e.g.[1--11]).Itiswellknownthattheaccuracyoftheapproximati…     

基于L~1度量分析的图象分解与重构算法

Mallat‘s decompositon and reconstruction algorithms are very important in the the field of wavelet theory and its applications to signal processing.Wavelet Anal-ysis,which is based on L^2(R) space,can eliminate redundancy of signals with the help of orthogonality and characterize the processing precision with the meansquare error.In the recent years,it is understood that the mean square measuredoes not match human visual sensitivity well.From the point of view,R.DeVore studied L^1 measure instead.Similarly,considering the principles of image com-pression,Yang introduced and dealt with orthogonality in L^1 space based on thebest approximation theory,and consequently established the corresponding decom-position and reconstruction algorithms for signals.In this paper,error analyses for the algorithms above are taken and the selection of the best parameters in the algorithms are discussed in detail.Finally,the algorithms are compared with the classical Haar and Daubechies‘‘s orthogonal wavelets based on the singal-to-noiseratio data computed.     

Derivation of the Hydrodynamic Equations in the Framework of the Bogoliubov Functional Hypothesis

We generalize the Bogoliubov functional hypothesis to the case of multiparticle interaction depending on both the coordinates and momenta of particles. We illustrate this with the examples of two weakly relativistic models: the Darwin model in the theory of charged particles and the Fock model in the general theory of relativity. For these models, based on the chain of the BBGKY equations, we calculate weakly relativistic corrections to the classical transport coefficients and find the conditions under which there is no bijective relation between the parameters of the local equilibrium distribution and the hydrodynamic variables.     

等距算子的延拓、逼近及相关问题

本文介绍了等距算子从单位球面、从区域及从保距离1等条件下的各种等距廷拓问题；并介绍了(线性与非线性算子)等距算子的弱扰动、强扰动及渐近等距算子等问题．文中从历史到现状，概括了重要的研究结果，并指出了一些尚未解决的遗留问题．     

On the Approximation of Irrationals by Rationals

Let ξ be a real irrational number, and a ≧ 0, b ≧ 0, s > 1 be integers. A theorem of S. UCHIYAMA states that there are infinitely many pairs of integers u and v ≠ 0 such that OVBARξ?u/vOVBAR ≤ s²/4v² and u ? a, v ? b mod s, provided that it is not a ? 6 ? 0 mod s. It is shown that this result is best-possible for all integers s > 1.     

Best Approximation and Perturbation Property in Hilbert Spaces

We study the perturbation property of best approximation to a set defined by an abstract nonlinear constraint system. We show that, at a normal point, the perturbation property of best approximation is equivalent to an equality expressed in terms of normal cones. This equality is related to the strong conical hull intersection property. Our results generalize many known results in the literature on perturbation property of best approximation established for a set defined by a finite system of linear/nonlinear inequalities. The connection to minimization problem is considered.The authors thank the referees for valuable suggestions.K.F. Ng - This author was partially supported by Grant A0324638 from the National Natural Science Foundation of China and Grants (2001) 01GY051-66 and SZD0406 from Sichuan Province. Y.R. He -This author was supported by a Direct Grant (CUHK) and an Earmarked Grant from the Research Grant Council of Hong Kong.     

Meyer-KnigandZeller算子的保形问题

讨论了 Meyer-Knig and Zeller算子的保形逼近问题 ,我们用基于算子特殊结构的分析方法得到了该算子的保单调性 .保凸性以及保形逆定理等保形性质 .     

The problem of processing time series: Extending possibilities of the local approximation method using singular spectrum analysis

We present algorithms for singular spectrum analysis and local approximation methods used to extrapolate time series. We analyze the advantages and disadvantages of these methods and consider the peculiarities of applying them to various systems. Based on this analysis, we propose a generalization of the local approximation method that makes it suitable for forecasting very noisy time series. We present the results of numerical simulations illustrating the possibilities of the proposed method.Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 142, No. 1, pp. 148–159, January, 2005.