Accurate, high-order representation of complex three-dimensional surfaces via Fourier continuation analysis

We present a new method for construction of high-order parametrizations of surfaces: starting from point clouds, the method we propose can be used to produce full surface parametrizations (by sets of local charts, each one representing a large surface patch – which, typically, contains thousands of the points in the original point-cloud) for complex surfaces of scientific and engineering relevance. The proposed approach accurately renders both smooth and non-smooth portions of a surface: it yields super-algebraically convergent Fourier series approximations to a given surface up to and including all points of geometric singularity, such as corners, edges, conical points, etc. In view of their C^∞ smoothness (except at true geometric singularities) and their properties of high-order approximation, the surfaces produced by this method are suitable for use in conjunction with high-order numerical methods for boundary value problems in domains with complex boundaries, including PDE solvers, integral equation solvers, etc. Our approach is based on a very simple concept: use of Fourier analysis to continue smooth portions of a piecewise smooth function into new functions which, defined on larger domains, are both smooth and periodic. The “continuation functions” arising from a function f converge super-algebraically to f in its domain of definition as discretizations are refined. We demonstrate the capabilities of the proposed approach for a number of surfaces of engineering relevance.     

基于CCD的无接触式的物体测量

基于CCD的物体测量平台，首先对物体图像进行预处理，继而利用Canny算子提取物体边缘，再通过本文改进的Hough变换实现对被测物体边界直线检测和重构，最后通过多项式插值算法实现物体像素尺寸到物体实际尺寸的转换．实验证明，此方法能够实现无接触式物体尺寸较高精度的测量．     

A bound on the total size of a cut cover

A cycle cover (cut cover) of a graph G is a collection of cycles (cuts) of G that covers every edge of G at least once. The total size of a cycle cover (cut cover) is the sum of the number of edges of the cycles (cuts) in the cover.We discuss several results for cycle covers and the corresponding results for cut covers. Our main result is that every connected graph on n vertices and e edges has a cut cover of total size at most 2e-n+1 with equality precisely when every block of the graph is an odd cycle or a complete graph (other than K₄ or K₈). This corresponds to the result of Fan [J. Combin. Theory Ser. B 74 (1998) 353-367] that every graph without cut-edges has a cycle cover of total size at most e+n-1.     

一种复杂车辆图像中的多车牌定位方法

针对复杂背景中多个车牌的定位问题,提出一种新的定位方法.该方法综合利用边缘检测、连通域分析、倾斜矫正等多种方法,解决了复杂背景中定位难的问题.能够准确定位杂乱背景中的车牌,对天气、光照变化、车牌在图像中的移动和旋转等,具有良好的适应能力.该方法为后续的字符分割和字符识别提供旋转角度、字符区域定位信息.     

强激光远场焦斑重构算法研究

 通过CCD图像采集单元结合传统的列阵相机测量高功率固体激光器的远场焦斑分布，采用图像处理技术的边缘算子提取焦斑的几何中心，提出通过几何中心对心的焦斑嵌套重构算法，解决了光斑饱和时的对心难题，实现了快捷准确测量激光焦斑，为激光器的实时控制提供参考数据。     

点可迁图的限制边连通性

3限制边割是连通图的一个边割, 它将此图分离成阶不小于3的连通分支. 图G的最小3限制边割所含的边数称为此图的3限制边连通度, 记作λ\-3(G). 它以图G的3阶连通点导出 子图的余边界的最小基数ξ_3(G)为上界. 如果λ_3(G)=ξ_3(G), 则称图G是极大3限制边连通的 . 已知在某种程度上,3限制边连通度较大的网络有较好的可靠性. 作者在文中证明: 如果k正则连通点可迁图的 围长至少是5, 那么它是是极大3限制边连通的.     

Using graphs for some discrete tomography problems

Given a rectangular array whose entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each color in every column and in every row. The complexity of this problem is still open when there are just three colors in the image. We study some special cases where the number of occurrences of each color is limited to small values. Formulations in terms of edge coloring in graphs and as timetabling problems are used; complexity results are derived from the model.     

Structure of propagating edge diffusion flames in hydrocarbon fuel jets

Direct numerical simulations with a C₃-chemistry model have been performed to investigate the transient behavior and internal structure of flames propagating in an axisymmetric fuel jet of methane, ethane, ethylene, acetylene, or propane in normal earth gravity (1g) and zero gravity (0g). The fuel issued from a 3-mm-i.d. tube into quasi-quiescent air for a fixed mixing time of 0.3 s before it was ignited along the centerline where the fuel–air mixture was at stoichiometry. The edge of the flame formed a vigorously burning peak reactivity spot, i.e., reaction kernel, and propagated through a flammable mixture layer, leaving behind a trailing diffusion flame. The reaction kernel broadened laterally across the flammable mixture layer and possessed characteristics of premixed flames in the direction of propagation and unique flame structure in the transverse direction. The reaction kernel grew wings on both fuel and air sides to form a triple-flame-like structure, particularly for ethylene and acetylene, whereas for alkanes, the fuel-rich wing tended to merge with the main diffusion flame zone, particularly methane. The topology of edge diffusion flames depend on the properties of fuels, particularly the rich flammability limit, and the mechanistic oxidation pathways. The transit velocity of edge diffusion flames, determined from a time series of calculated temperature field, equaled to the measured laminar flame speed of the stoichiometric fuel–air mixtures, available in the literature, independent of the gravity level.     

Improved Lower Bounds for the Critical Probability of Oriented Bond Percolation in Two Dimensions

We present a coupled decreasing sequence of random walks on Z that dominate the edge process of oriented bond percolation in two dimensions. Using the concept of random walk in a strip, we describe an algorithm that generates an increasing sequence of lower bounds that converges to the critical probability of oriented percolation p_c. From the 7th term on, these lower bounds improve upon 0.6298, the best rigorous lower bound at present, establishing 0.63328 as a rigorous lower bound for p_c. Finally, a Monte Carlo simulation technique is presented; the use thereof establishes 0.64450 as a non-rigorous five-digit-precision (lower) estimate for p_c. Mathematics Subject Classification (1991): 60K35 Supported by CNPq (grant N.301637/91-1). Supported by a grant from CNPq.     

剖面不变性与非局部扰动电子温度响应

在ＴＦＴＲ及ＴＥＸＦ等装置上观测到的边界电子冷脉冲的输运现象是通常基于局部热导的瞬态输运理论所无法解释的。利用一个与电子温度剖面不变性相「容的且与在ρ＝ρＬ（ρＬ≈０．７～０．８）处的局部电子热导相关的非局部电子热导模型来描述边界冷脉冲引起的电子温度变化的瞬态过程，发现此模型可定性地解释边界冷脉冲实验现象的几乎所有主要特征。