Nusselt number correlations for heat transfer to small spheres in thermal plasma flows

Seven different equations predicting heat transfer rates to small spheres in plasma flows are examined considering argon and nitrogan as plasma gases from 300 to 21,000 K at 1 atm. For argon there is a general consensus up to 9000 K, beyond which wide deviations in behavior occur. For nitrogen, the seven correlations are in good agreement up to 4000 K, but show substantial deviations beyond this value. Comparisons with the sparsely available experimental data are made for argon from 300 to 17,000 K and for nitrogen up to 5500 K. Disagreement between the various correlations and experiment can exceed one order of magnitude.     

一类新的表面活性剂——长链烷基三苯基鏻——Ⅵ.稳态荧光猝灭法测定十二烷基三苯基溴化鏻胶束的平均簇集数

研究了十二烷基三苯基溴化鏻(C_(12)PBr)胶束中N,N-二甲基苯胺(DMA)和二苯甲酮(DPK)对芘的荧光猝灭,发现DMA的猝灭行为不符合Stern-Volmer动态猝灭和Turro静态猝灭模型;DPK的猝灭行为不符合Stern-Volmer猝灭模型,但遵从Turro静态猝灭模型。根据DPK的静态猝灭性质测得C_(12)PBr胶束的平均簇集数为15士2,并相应地得到C_(12)PBr的临界胶束浓度为(1.77±0.09)×10~(-3)mol/L,后者与文献值一致。     

On disjoint configurations in infinite graphs

For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?₀ disjoint copies of A is referred to as ?₀A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?₀A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G₁, G₂,… such that G_i is not a minor of G_j for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?₀A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016     

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

双环网络是计算机互连网络和通讯系统的一类重要拓扑结构．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.     

Homogeneity and Canonical Connections of Isoparametric Manifolds

On every isoparametric submanifold M a connection with parallel second fundamental form is constructed geometrically such that M is an orbit of an s-representation if and only if the connection is a canonical one. If the rank of M is greater than one this connection is in case of homogeneity the canonical connection of the reductive decomposition given by the orbit of s-representation. This revised version was published online in June 2006 with corrections to the Cover Date.     

几类数列通项的矩阵求法

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

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     

无原子布氏代数理论的计算复杂性

研究无原子布氏代数的计算复杂性 .得到了下面的新定理 :定理 1　无原子布氏代数理论Δ具有完全的量词消去法 ,也就是说每一个式子都Δ等价于一个开式子 .定理 2　无原子布氏代数的初等型Γ (x1,… ,xn)是由型内的不含量词的全体开式子所唯一决定 .定理 3　无原子布氏代数的一个长度为 n的语句的判断过程所消耗的 Turing时间和空间都是属于 2 2 cn指数级 .     

一些包含Lucas数的恒等式

利用第一类Chebyshev多项式的性质以及其与Lucas数的关系得到了关于Lucas数立方的一些恒等式.