Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs

For any graph G, let be the number of spanning trees of G, be the line graph of G, and for any nonnegative integer r, be the graph obtained from G by replacing each edge e by a path of length connecting the two ends of e. In this article, we obtain an expression for in terms of spanning trees of G by a combinatorial approach. This result generalizes some known results on the relation between and and gives an explicit expression if G is of order and size in which s vertices are of degree 1 and the others are of degree k. Thus we prove a conjecture on for such a graph G.     

胜利断块油藏细分注水技术界限研究

老油田进入特高含水期后,剩余油分布更加零散,各种地质因素也因长期注水开发而发生了一定的改变.此时稳油控水难度进一步加大,为了进一步挖掘剩余油,控制含水上升速度、减缓产量递减,必须对注水井采取进一步的细分调整.基于水湿油藏注水井注水层段吸水效果,从注入水受力分析入手,运用达西定律推导出了水驱油藏水驱油全过程中的单位体积注入水沿竖直、地层两个方向运移的渗流速度公式,明晰了水驱油藏注水层段不同开发阶段砂岩吸水机理.研究结果表明,水驱油藏细分注水效果与岩石绝对渗透率、水相相对渗透率、注入水黏度、水动力压力梯度、注水井启动压力梯度、含水饱和度、地层倾角、油水密度差等参数有关.结合胜利油田断块油藏地质特征及细分注水工艺要求,制定了一套适合胜利油田不同断块区的细分注水技术政策界限:层段内渗透率变异系数小于0.3,砂岩条带宽度极比小于2.5,且东辛油区断块油藏层段内砂岩厚度小于6m,小层数小于4个;现河油区断块油藏层段内砂岩厚度小于5m,小层数小于5个;临盘油区断块油藏层段内砂岩厚度小于6m,小层数小于6个.矿场试验证实,该细分注水技术政策界限是合理、实用的,其为胜利断块油藏注上水、注够水、注好水,实现多层断块油藏的高效开发提供了技术保障,对类似油藏细分注水技术界限研究具有一定的借鉴意义.     

对VC中子类化技术的探讨

在Windows编程中，适当的使用子类化技术，不但可以大大增强应用程序的功能，还可以满足软件的特殊要求。就控件子类化技术和窗口子类化技术分别进行了探讨。     

芭蕉扇的细分图T_n~*的和数

芭蕉扇T_n指在扇F_n=P_n(?)K_1的轴K_1上悬挂一条边所得的图,该边叫T_n的柄,P_n上的边叫缘边,其余边叫辐。芭蕉扇细分图T_n~*是T_n的缘边各剖分一次所得的图。本文证明了芭蕉扇细分图T_2~*是模和图,且σ(T_n~*)(?)=2,n=2、3,≤2,n≥4     

On the selection of subdivision directions in interval branch-and-bound methods for global optimization

This paper investigates the influence of the interval subdivision selection rule on the convergence of interval branch-and-bound algorithms for global optimization. For the class of rules that allows convergence, we study the effects of the rules on a model algorithm with special list ordering. Four different rules are investigated in theory and in practice. A wide spectrum of test problems is used for numerical tests indicating that there are substantial differences between the rules with respect to the required CPU time, the number of function and derivative evaluations, and the necessary storage space. Two rules can provide considerable improvements in efficiency for our model algorithm.The work has been supported by the Grants OTKA 2879/1991, and MKM 414/1994.     

Stationary binary subdivision schemes using radial basis function interpolation

A new family of interpolatory stationary subdivision schemes is introduced by using radial basis function interpolation. This work extends earlier studies on interpolatory stationary subdivision schemes in two aspects. First, it provides a wider class of interpolatory schemes; each 2L-point interpolatory scheme has the freedom of choosing a degree (say, m) of polynomial reproducing. Depending on the combination (2L,m), the proposed scheme suggests different subdivision rules. Second, the scheme turns out to be a 2L-point interpolatory scheme with a tension parameter. The conditions for convergence and smoothness are also studied. Dedicated to Prof. Charles A. Micchelli on the occasion of his 60th birthday Mathematics subject classifications (2000) 41A05, 41A25, 41A30, 65D10, 65D17. Byung-Gook Lee: This work was done as a part of Information & Communication fundamental Technology Research Program supported by Ministry of the Information & Communication in Republic of Korea. Jungho Yoon: Corresponding author. Supported by the Korea Science and Engineering Foundation grant (KOSEF R06-2002-012-01001).     

Concerning Order of Convergence for Subdivision

We discuss order of convergence for subdivision algorithms, in the scalar-valued and the vector-valued case. In order to find the generic order, the usual definition of convergence order is extended, refering to a proper quasi interpolant operator whose representation on polynomial spaces can be constructively determined with recourse to properties of the subdivision mask. Assuming stability and smoothness of the limit functions, the approximation order of the quasi interpolant operator determines the order of convergence of subdivision.     

Refinable bivariate quartic -splines for multi-level data representation and surface display

In this paper, a second-order Hermite basis of the space of -quartic splines on the six-directional mesh is constructed and the refinable mask of the basis functions is derived. In addition, the extra parameters of this basis are modified to extend the Hermite interpolating property at the integer lattices by including Lagrange interpolation at the half integers as well. We also formulate a compactly supported super function in terms of the basis functions to facilitate the construction of quasi-interpolants to achieve the highest (i.e., fifth) order of approximation in an efficient way. Due to the small (minimum) support of the basis functions, the refinable mask immediately yields (up to) four-point matrix-valued coefficient stencils of a vector subdivision scheme for efficient display of -quartic spline surfaces. Finally, this vector subdivision approach is further modified to reduce the size of the coefficient stencils to two-point templates while maintaining the second-order Hermite interpolating property.

     

Noninterpolatory Hermite subdivision schemes

Bivariate interpolatory Hermite subdivision schemes have recently been applied to build free-form subdivision surfaces. It is well known to geometric modelling practitioners that interpolatory schemes typically lead to ``unfair" surfaces--surfaces with unwanted wiggles or undulations--and noninterpolatory (a.k.a. approximating in the CAGD community) schemes are much preferred in geometric modelling applications. In this article, we introduce, analyze and construct noninterpolatory Hermite subdivision schemes, a class of vector subdivision schemes which can be applied to iteratively refine Hermite data in a not necessarily interpolatory fashion. We also study symmetry properties of such subdivision schemes which are crucial for application in free-form subdivision surfaces.

A key step in our mathematical analysis of Hermite type subdivision schemes is that we make use of the strong convergence theory of refinement equations to convert a prescribed geometric condition on the subdivision scheme--namely, the subdivision scheme is of Hermite type--to an algebraic condition on the subdivision mask. The latter algebraic condition can then be used in a computational framework to construct specific schemes.

     

体模型的一种细分格式

In this paper, a subdivision scheme which generalizes a surface scheme in previous papers to volume meshes is designed. The scheme exhibits significant control over shrink-age/size of volumetric models. It also has the ability to conveniently incorporate boundaries and creases into a smooth limit shape of models. The method presented here is much simpler and easier as compared to MacCracken and Joy‘s. This method makes no restrictions on the local topology of meshes. Particularly, it can be applied without any change to meshes of nonmanifold topology.