Refinable subspaces of a refinable space

Local refinable finitely generated shift-invariant spaces play a significant role in many areas of approximation theory and geometric design. In this paper we present a new approach to the construction of such spaces. We begin with a refinable function which is supported on . We are interested in spaces generated by a function built from the shifts of .

     

双频氦氖激光回馈位移测量系统的实验与应用研究

研究了一种全新的纳米尺度位移测量系统。将双折射元件插入He-Ne激光器谐振腔内产生频率分裂效应，使原本单模谐振的激光器输出变成了频差可调的2个正交偏振频率（o光和e光），而形成双频激光器。在激光谐振腔外放置沿激光轴线位移的反射表面，将输出的激光束反射回腔内，以便对激光的光强进行调制，可实现高分辨率非接触式可判向位移测量。提出了一种细分方法，该方法突破了传统干涉系统的衍射极限（1/2波长）。对于633nm波长He-Ne激光，本系统的理想分辨率为1/8波长（约为79nm）。     

基于傅里叶变换的高精度条纹细分方法

针对传统傅里叶变换法在提取条纹图相位中存在的能量泄漏问题,提出了条纹图整周期裁剪的方法,可有效抑制能量泄漏对检相精度的影响,提高傅里叶变换法相位计算的精度。在此基础上,提出了一种基于傅里叶变换时移特性的叠栅条纹细分新方法。与传统傅里叶变换法相比,该方法求取相邻两帧条纹图间的相移,只需经过两次傅里叶变换,不需要截取条纹图的基频再逆变换回空域,因此计算量至少减少了一倍,计算速度大大提高。数值计算结果表明,对两束单色平面波形成的条纹,理想条件下细分精度高达10-12量级;对高斯包络调制的条纹,细分精度至少可达10-3量级。     

The partial inverse minimum spanning tree problem when weight increase is forbidden

In a partial inverse optimization problem there is an underlying optimization problem with a partially given solution. The objective is to find a minimal perturbation of some of the problem’s parameter values, in such a way that the partial solution becomes a part of the optimal solution.     

Effective Relaxations and Partitioning Schemes for Solving Water Distribution Network Design Problems to Global Optimality

In this paper, we address the development of a global optimization procedure for the problem of designing a water distribution network, including the case of expanding an already existing system, that satisfies specified flow demands at stated pressure head requirements. The proposed approach significantly improves upon a previous method of Sherali et al. (1998) by way of adopting tighter polyhedral relaxations, and more effective partitioning strategies in concert with a maximal spanning tree-based branching variable selection procedure. Computational experience on three standard test problems from the literature is provided to evaluate the proposed procedure. For all these problems, proven global optimal solutions within a tolerance of 10^–4% and/or within 1$ of optimality are obtained. In particular, the two larger instances of the Hanoi and the New York test networks are solved to global optimality for the very first time in the literature. A new real network design test problem based on the Town of Blacksburg Water Distribution System is also offered to be included in the available library of test cases, and related computational results are presented.     

曲线的一类非线性多分辨率算法及其收敛性

在曲线的多分辨率分析基础上,构造了一种新的非线性三分多分辨率算法.并研究这个正则三分多分辨率算法的收敛性和稳定性,进一步,证明了小波参数的收敛性精密地依靠这个基本的多分辨率细分算法的收敛性.     

Undirected simple connected graphs with minimum number of spanning trees

We show that for positive integers n, m with n(n−1)/2≥m≥n−1, the graph L_n,m having n vertices and m edges that consists of an (n−k)-clique and k−1 vertices of degree 1 has the fewest spanning trees among all connected graphs on n vertices and m edges. This proves Boesch’s conjecture [F.T. Boesch, A. Satyanarayana, C.L. Suffel, Least reliable networks and reliability domination, IEEE Trans. Commun. 38 (1990) 2004-2009].     

Shape controlled interpolatory ternary subdivision

Ternary subdivision schemes compare favorably with their binary analogues because they are able to generate limit functions with the same (or higher) smoothness but smaller support.In this work we consider the two issues of local tension control and conics reproduction in univariate interpolating ternary refinements. We show that both these features can be included in a unique interpolating 4-point subdivision method by means of non-stationary insertion rules that do not affect the improved smoothness and locality of ternary schemes. This is realized by exploiting local shape parameters associated with the initial polyline edges.     

A unified three point approximating subdivision scheme

In this paper,we propose a three point approximating subdivision scheme,with three shape parameters,that unifies three different existing three point approximating schemes.Some sufficient conditions for subdivision curve C0 to C3 continuity and convergence of the scheme for generating tensor product surfaces for certain ranges of parameters by using Laurent polynomial method are discussed.The systems of curve and surface design based on our scheme have been developed successfully in garment CAD especially for clothes modelling.     

绝对编码光栅的相位细分及其在位移测量中的应用

提出通过光栅条纹相位的精密测量,获取光栅高精度位移信息的方法。具体方法是对光栅图像采用多码道设计,用CCD二维图像传感器获取测量段光栅图像多码道信息。对最低码道图形的周期函数序列进行傅里叶变换、基频滤波和逆傅里叶变换获得光栅截断相位分布,其余码道信息提供相位展开的级次,以此获得测量段光栅的绝对相位分布。用光刻的手段制作了实用的绝对编码光栅,基元码道的尺寸是:27.36μm用于明条纹,27.36μm用于暗条纹,最小基元码道空间周期为54.72μm,光栅长度为14008.32μm。在步长近似3μm的位移测试中,与比对的标准仪器记录值比较,标准偏差为0.2057μm,精度在亚微米量级。重复性实验表明,位置测试的稳定性为0.09μm(标准差),得到600倍以上细分的分辨力。