应用核磁共振进行聚驱后泡沫驱油特性研究

采用并联岩心进行聚驱后泡沫驱油实验,利用核磁共振技术,对驱替后岩心的不同直径孔隙内的流体分布进行了研究,得到了水驱、聚合物驱、泡沫驱替阶段的驱出油的孔径范围以及剩余油分布.实验结果表明,与水驱和聚合物驱相比,泡沫驱增大了波及的孔径的范围.泡沫可以在水驱和聚驱易发生窜流的大孔径通道形成封堵,从而波及到了水驱和聚驱未波及到的孔径,不但大幅度的提高了低渗岩心的采收率,也驱出了部分高渗岩心的小孔径的油.     

低压蒸汽滴状冷凝传热性能的实验研究

实验研究了不同水蒸气压力条件下的滴状冷凝传热特性。10 kPa、40 kPa和70 kPa时的传热系数分别是常压下的56%,68%和81%。随着水蒸气压力的下降,液滴脱落直径变大,液滴生长周期延长,冷凝传热系数下降。通过液滴的动力学特性分析和基于界面效应的滴状冷凝传热模型,分析了低压对水蒸气冷凝传热的主要影响因素,压力变化主要影响了分子扩散率和气-液相际传热热阻,导致总冷凝传热系数随压力下降。     

给定直径的单圈图的超Wiener指数

The hyper-Wiener index is a kind of extension of the Wiener index, used for predicting physicochemical properties of organic compounds. The hyper-Wiener index W W(G) is defined as WW(G) =1/2∑_(u,v)∈V(G)(d_G(u, v) + d_G~2(u,v)) with the summation going over all pairs of vertices in G, d_G(u,v) denotes the distance of the two vertices u and v in the graph G. In this paper,we study the minimum hyper-Wiener indices among all the unicyclic graph with n vertices and diameter d, and characterize the corresponding extremal graphs.     

连通无向图Rabin数的一个界

可靠性和有效性是互连网络设计的重要标准,而Rabin数是度量网络容错性和传输延迟的重要参数.将通过图的容错直径给出2- 连通无向图和~3- 连通无向图的~Rabin 数r_2(G)和r_3(G)的界;同时也得到r_2(G) = D_2(G)成立的一个条件.     

广义Petersen图的宽直径

Generalized Petersen graphs are commonly used interconnection networks,and wide diameter is an important parameter to measure fault-tolerance and efficiency of parallel pro- cessing computer networks.In this paper,we show that the diameter and 3-wide diameter of generalized Petersen graph P (m,a) are both O( m 2a ),where a ≥ 3.     

Nonlinear reynolds equation for lubrication of a rapidly rotating shaft

Using the homogenization theory, we derive the nonlinear Reynolds equation governing the process of lubrication of a slipper bearing with rapidly rotating shaft. We prove that this nonliner lubrication law is an approximation of the full Navier-Stokes equations in a thin cylinder with periodic roughness. The analyticity of the nonlinear function giving the relation between the velocity and the pressure drop is proved. The first term in its Taylor's expansion is the classical linear Reynolds law. Boundary layer correctors are computed.     

Doubly stochastic graph matrices,II

If G is a graph on n vertices, its Laplacian matrix L(G) = D(G) - A(G) is the difference of the diagonal matrix of vertex degrees and the adjacency matrix. The main purpose of this note is to continue the study of the positive definite, doubly stochastic graph matrix (I_n + L(G))?¹= ω(G) = (w_ij). If, for example, w(G) = min w_ij, then w(G)≥0 with equality if and only if G is disconnected and w(G) ≤ l/(n + 1) with equality if and only if G = K_n. If i¦j, then w_ii ≥2wij, with equality if and only if the ith vertex has degree n - 1. In a sense made precise in the note, max w,, identifies most remote vertices of G. Relations between these new graph invariants and the algebraic connectivity emerge naturally from the fact that the second largest eigenvalue of ω(G) is 1/(1 + a(G)).     

On the spectral radius of tricyclic graphs with a fixed diameter

A tricyclic graph is a connected graph with n vertices and n + 2 edges. In this article, we determine graphs with the largest spectral radius among the n-vertex tricyclic graphs with given diameter d.