总延误问题顺时安排法的性能比

给定一组工件的加工时间与工期，要求确定这些工件在一台机器上的加．工排列，使相应的总延误达到最小，这就是总延误问题．该问题在近年已被证明是NP困难的．由Wilkermn和Irwin（1971），林勋（1983）等所研究的顺时安排法能得到相邻交换意义下的局部解．在本文中，我们进一步证明该算法能得到前移邻域意义下的局部解，并确定了该算法的性能比．     

关于紧优双环网络的无限族

双环网络是计算机互连网络和通讯系统的一类重要拓扑结构．1993年,李乔等人提出一个系统的构造方法,构造出69类0紧优和33类1紧优双环网络的无限族,并提出研究下述问题:求k(k>1)紧优双环网络的无限族．2003年,徐俊明等人给出一个4紧优双环网络的无限族．本文首先证明从每一个具体的0紧优双环网络出发,都可以构造若干0紧优双环网络无限族;结合同余方程组理论和数论中的素数理论,给出若干求一般k(k≥0)紧优双环网络无限族(包括非单位步长双环网络无限族)的方法．     

Metallic radii of nonmetals

Experimental data are used to determine the atomic volumes and radii of the elements of subgroups IV–VIIA in the structures of metallic phases at high pressures. Metallic radii of nonmetals are compared with values based on Pauling and Goldschmidt calculations.Translated fromIzvestiya Akademii Nauk. Seriya Khimicheskaya, No. 2, pp. 220–222, February, 1994.     

几类数列通项的矩阵求法

本利用矩阵给出了几类数列的通项公式的求法，把数列通项公式的求法转化为矩阵幂的计算，思路简单、计算简便，并能判别其敛散性。     

Linear Ramsey numbers of sparse graphs

The Ramsey number R(G₁,G₂) of two graphs G₁ and G₂ is the least integer p so that either a graph G of order p contains a copy of G₁ or its complement G^c contains a copy of G₂. In 1973, Burr and Erd?s offered a total of $25 for settling the conjecture that there is a constant c = c(d) so that R(G,G)≤ c|V(G)| for all d‐degenerate graphs G, i.e., the Ramsey numbers grow linearly for d‐degenerate graphs. We show in this paper that the Ramsey numbers grow linearly for degenerate graphs versus some sparser graphs, arrangeable graphs, and crowns for example. This implies that the Ramsey numbers grow linearly for degenerate graphs versus graphs with bounded maximum degree, planar graphs, or graphs without containing any topological minor of a fixed clique, etc. © 2005 Wiley Periodicals, Inc. J Graph Theory     

Chromatic Uniqueness of the Complement of T_m(l, 4, m - 6)

In the paper, we prove that the complement of Tm(1,4,m - 6)(m > 10) is chromatically unique if and only if m ≠5k(k ≥ 2).     

全变差有界函数列的一致(R)可积性

给出了一致有界单调函数列一致可积性定理 ,由此得出全变差序列有界的收敛函数列的一致可积性 .说明了该结论可判断一些非一致收敛函数列的逐项积分性质 .     

Experimental Evaluation of Strain Shielding in Distal Femur in Revision TKA

Theoretical concerns about the use of cemented and press-fit stems in revision total knee arthroplasty (TKA) include stress shielding with adverse effects on prosthesis fixation. Radiological studies have showed distal femoral bone resorption after revision TKA. The revision with use of stems can place abnormal stresses. These stresses can promote the effect of bone stress shielding and may contribute to bone loss. Experimental quantification of strain shielding in the distal synthetic femur following TKA is the main purpose of the present study. Three different constructs of TKA were assessed. The first construct included a stemless femoral component. The other two included a press-fit and a cemented femoral stem. Cortical bone strains were measured experimentally with tri-axial strain gauges in synthetic femurs before and after in-vitro knee surgery. The difference between principal strains of implanted and intact femur was calculated for each strain gauge position. This study indicates that the use of stems in distal femur changes the distribution and magnitude of bone strains. The press-fit stem provoked relevant bone area (stem length) subjected to strain shielding and also originated the highest reduction of strains in the distal region, which can potentially induce bone resorption. The stemless implanted femur produced minor bone strain changes relatively to the intact femur. The use of distal femur stems increases initial stability in the bone, but the observed reduction of strains in this region, relative to the intact femur, provokes strain shielding that can induce bone resorption and may compromise the long term implant stability.     

Maximal σ‐polynomials of connected 3‐chromatic graphs

In the set of graphs of order n and chromatic number k the following partial order relation is defined. One says that a graph G is less than a graph H if c_i(G) ≤ c_i(H) holds for every i, k ≤ i ≤ n and at least one inequality is strict, where c_i(G) denotes the number of i‐color partitions of G. In this paper the first ? n/2 ? levels of the diagram of the partially ordered set of connected 3‐chromatic graphs of order n are described. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 210–222, 2003     

一个素变数丢番图不等式

本文证明了如果1相似文献