表面细分技术在二维声辐射和声散射中的应用

把表面细分技术应用于求解边界积分方程，既能把CAD模型直接用于边界元分析，又能精确描述复杂的边界几何形状，实现网格自动加密和形函数自动升阶，满足误差要求。把它应用于简单的二维声辐射和声散射，结果表明对提高边界元方法的计算精度是有效的。     

Urn模型的B网及其应用

Urn模型的离散概率分布被用于构造逼近格式,具有Bernstein多项式的许多特性。本文用B网技术对Urn模型概率分布给出新的解释,指出了Urn模型B网的诸多性质,导出分布函数曲线的导数公式,构造了Urn分布的对偶基及与此相关的拟插值算子。     

Reduction of acoustic radiation by perforated board and honeycomb layer systems

A perforated system, proposed previously for reducing the radiated sound from a plate at arbitrary frequencies, is applied to three-dimensional problem. Plates are assumed to be supported in a duct of a finite cross-section and excited by a harmonic point force. The sound radiation is investigated from the viewpoint of acoustic power and it is discussed whether the attenuation effect shown previously in the one-dimensional system can be obtained with the three-dimensional system. The effect of support conditions on attenuation characteristics is discussed by using clamped and simply supported circular models. Allowing for the effect, a simply supported rectangular model is studied in detail and its problems are revealed. In order to overcome the problems, a new system including subdivided air cavities in the form of a honeycomb layer instead of a undivided backing cavity is proposed. Each of the honeycomb cells can create local one-dimensional sound fields. Calculated theoretical results are compared to data obtained in a 1/5th scale reverberation chamber. The results for the reduction effect, which are in good agreement, show that the honeycomb layer system can achieve the same reduction of the radiated sound power at arbitrary frequencies as the one-dimensional perforated system.     

Efficient interval partitioning for constrained global optimization

A new efficient interval partitioning approach to solve constrained global optimization problems is proposed. This involves a new parallel subdivision direction selection method as well as an adaptive tree search. The latter explores nodes (intervals in variable domains) using a restricted hybrid depth-first and best-first branching strategy. This hybrid approach is also used for activating local search to identify feasible stationary points. The new tree search management technique results in improved performance across standard solution and computational indicators when compared to previously proposed techniques. On the other hand, the new parallel subdivision direction selection rule detects infeasible and suboptimal boxes earlier than existing rules, and this contributes to performance by enabling earlier reliable deletion of such subintervals from the search space.     

A Construction of Multiresolution Analysis on Interval

We present a concrete method of constructing multiresolution analysis on interval. The method generalizes the corresponding results of Cohen, Daubechies and Vial [Appl. Comput. Harmonic Anal., 1（1993）, 54-81]. By the use of the subdivision operator, the expressions of the constructed functions are more compact. Furthermore, the method reveals more clearly some properties of multiresolution analysis with certain approximation order.     

G---的平面性

设G是一个简单图,其全图G 是以V(G)∪E(G)为顶点集的图,其中顶点x和y相邻当且仅当下面的一个条件成立: (i) x,y∈ V(G) ,且x和y在G中相邻, (ii) x,y∈ E(G) ,且x和y在G中相邻, (iii) x和y分别属于V(G)和E(G) ,且它们在G中关联. G---是全图的补图.在这篇文章中,证明了G---是平面的充要条件是 V(G) ≤ 3或者G同构于2K2,C4, K4- e,K4, 2K1 K3, K1,4, K1 K1,3,2K1 P3.     

CONSURF系统中机身造型曲线的若干几何性质

本文用计算几何学的观点对Ａ．Ａ．Ｂａｌｌ在前英车航空公司研制成功的ＣＯＮＳＵＲＦ系统进行分析，证明了这一系统的机身造型曲线具有包络性质，分段性质，变差缩减性质，奇点拐点分布性质和保凸性质。     

Hermite Subdivision Schemes and Taylor Polynomials

We propose a general study of the convergence of a Hermite subdivision scheme ℋ of degree d>0 in dimension 1. This is done by linking Hermite subdivision schemes and Taylor polynomials and by associating a so-called Taylor subdivision (vector) scheme . The main point of investigation is a spectral condition. If the subdivision scheme of the finite differences of is contractive, then is C ⁰ and ℋ is C ^d . We apply this result to two families of Hermite subdivision schemes. The first one is interpolatory; the second one is a kind of corner cutting. Both of them use the Tchakalov-Obreshkov interpolation polynomial.      

Isometric embeddings of subdivided connected graphs into hypercubes

Isometric subgraphs of hypercubes are known as partial cubes. These graphs have first been investigated by Graham and Pollack [R.L. Graham, H. Pollack, On the addressing problem for loop switching, Bell System Technol. J. 50 (1971) 2495-2519; and D. Djokovi?, Distance preserving subgraphs of hypercubes, J. Combin. Theory Ser. B 14 (1973) 263-267]. Several papers followed with various characterizations of partial cubes. In this paper, we determine all subdivisions of a given configuration which can be embedded isometrically in the hypercube. More specifically, we deal with the case where this configuration is a connected graph of order 4, a complete graph of order 5 and the case of a k-fan F_k(k≥3).     

Smoothness of Stationary Subdivision on Irregular Meshes

We derive necessary and sufficient conditions for tangent plane and C ^k -continuity of stationary subdivision schemes near extraordinary vertices. Our criteria generalize most previously known conditions. We introduce a new approach to analysis of subdivision surfaces based on the idea of the universal surface . Any subdivision surface can be locally represented as a projection of the universal surface, which is uniquely defined by the subdivision scheme. This approach provides us with a more intuitive geometric understanding of subdivision near extraordinary vertices. February 16, 1998. Date revised: January 27, 1999. Date accepted: April 2, 1999.