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     

Solved and unsolved problems in surface structure determination

The range of surface structural problems of interest in understanding the physics and chemistry of solid surfaces is reviewed with reference to the available methods and their strengths and limitations. Key challenges being addressed currently concern the achievable precision of measurements and their physical and chemical significance, and the complexity of the problems which may be solved. Past progress and future problems are illustrated with a series of examples ranging from the relaxation of simple clean metal surfaces through complex semiconductor reconstructions to large molecular adsorption and coadsorption systems and complex adsorbate-induced reconstructions. The strengths and limitations of scanning tunnelling microscopy as a complement to true quantitative structural methods are discussed, as is the role of chemical state specificity and elemental specificity in solving complex molecular adsorbate systems.     

Comparison of Two Reformulation-Linearization Technique Based Linear Programming Relaxations for Polynomial Programming Problems

In this paper, we compare two strategies for constructing linear programmingrelaxations for polynomial programming problems using aReformulation-Linearization Technique (RLT). RLT involves an automaticreformulation of the problem via the addition of certain nonlinear impliedconstraints that are generated by using the products of the simple boundingrestrictions (among other products), and a subsequent linearization based onvariable redefinitions. We prove that applying RLT directly to the originalpolynomial program produces a bound that dominates in the sense of being atleast as tight as the value obtained when RLT is applied to the jointcollection of all equivalent quadratic problems that could be constructed byrecursively defining additional variables as suggested by Shor.     

RESTRICTION RESPECTUEUSE ET RECONSTRUCTION DES CHAINES ET DES RELATIONS INFINITES

We show a faithful restriction theorem among infinite chains which implies a reconstructibility conjecture of Halin. This incite us to study the reconstructibility in the sense of Fraïssé and to prove it for orders of cardinality infinite or ≥ 3 and for multirelations of cardinality infinite or ≥ 7, what improves the theory obtained by G. Lopez in the finite case. For this work we had to study the infinite classes of difference which have to be a linear order of type ω, ω* or ω* + ω; this complete the theory made by G. Lopez for the finite case ([13]). We show also Ulam-reconstructibility for linear orders which have a fixed point.     

On accurate boundary conditions for a shape sensitivity equation method

This paper studies the application of the continuous sensitivity equation method (CSEM) for the Navier–Stokes equations in the particular case of shape parameters. Boundary conditions for shape parameters involve flow derivatives at the boundary. Thus, accurate flow gradients are critical to the success of the CSEM. A new approach is presented to extract accurate flow derivatives at the boundary. High order Taylor series expansions are used on layered patches in conjunction with a constrained least‐squares procedure to evaluate accurate first and second derivatives of the flow variables at the boundary, required for Dirichlet and Neumann sensitivity boundary conditions. The flow and sensitivity fields are solved using an adaptive finite‐element method. The proposed methodology is first verified on a problem with a closed form solution obtained by the Method of Manufactured Solutions. The ability of the proposed method to provide accurate sensitivity fields for realistic problems is then demonstrated. The flow and sensitivity fields for a NACA 0012 airfoil are used for fast evaluation of the nearby flow over an airfoil of different thickness (NACA 0015). Copyright © 2005 John Wiley & Sons, Ltd.     

PERIODIC BOUNDARY VALUE PROBLEM FOR SECOND ORDER FUNCTIONAL DIFFERENTIAL EQUATIONS

This paper investigates the periodic boundary value problems for a class of second order functional differential equations. The monotone iterative technique and the maximum principle are applied to obtain the existence of maximal and minimal solutions.     

二阶椭圆型微分方程解的振动定理

考虑二阶非线性椭圆型微分方程∑^n_{i,j}∂/∂x_i{A_{i,j}(x,y)∂/∂x_j}+q(x)f(y)=0 (E)，其中q(x)在外区域 Ω∈R\+n上变号. 利用偏Riccati变换和积分平均技巧, 建立了方程(E)所有解振动的充分准则.     

Navier-Stokes方程带Backtracking技巧的两重网格算法

1 引 言考虑二维不可压 Navier-Stokes方程:     

Sulfur adsorption on Fe(1 1 0): a DFT study

The adsorption of atomic S on the Fe(1 1 0) surface is examined using density functional theory (DFT). Three different adsorption sites are considered, including the atop, hollow and bridge sites and the S is adsorbed at a quarter monolayer coverage in a p(2 × 2) arrangement. The hollow site is found to be the most stable, followed by the bridge and atop sites. At all three sites, S adsorption results in relatively minor surface reconstruction, with the most significant being that for the hollow site, with lateral displacements of 0.09 Å. Comparisons between S-adsorbed and pure Fe surfaces revealed reductions in the magnetic moments of surface-layer Fe atoms in the vicinity of the S. At the hollow site, the presence of S causes an increase in the surface Fe d-orbital density of states between 4 and 5 eV. However, S adsorption has no significant effect on the structure and magnetic properties of the lower substrate layers.     

Implementation and experimental study on fast object modeling based on multiple structured stripes

In this paper, a practical structured light-based system for fast object modeling and reconstruction is reported. The system consists of an off-the-shelf digital projector, a video camera and a turntable. The system calibration is implemented accurately and automatically by taking a single image of an illuminated calibration template. The multiple color light stripes emitted by the projector adopt only three colors and the color can be modified easily according to the surface texture of the object. This makes the system widely applicable in many situations, and the assumption about color neutrality, which is a limitation to other similar systems, can be largely relaxed. The registration and merging algorithm is greatly simplified by employing a turntable. The validity and high accuracy of the method are demonstrated by extensive real experiments.