结构形式对椭圆扁管管内传热与流阻性能影响

利用数值模拟方法结合场协同理论,对直椭圆扁管、单向螺旋椭圆扁管和变向螺旋椭圆扁管管内传热与流动情况进行了数值模拟计算和理论分析,比较研究了不同的Re、Pr下,3种椭圆扁管的管内传热与流阻特性。结果表明,单向螺旋椭圆扁管和变向螺旋椭圆扁管与直椭圆扁管相比有很好的强化传热性能,而变向螺旋椭圆扁管要比单向螺旋椭圆扁管的强化传热性能更好。在管内流体具有高Pr及低Re的条件下,2种螺旋椭圆扁管的强化传热效果显著,可作为很好的强化传热元件应用于工程实际中。     

Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks

Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional (resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional (resp., unidirectional) topology is k-edge connected. The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18], which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19], which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity. In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity, and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for distributed implementation. A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless (Adhoc-Now 2003). Research performed in part while visiting the Max-Plank-Institut fur Informatik. Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms. Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990. His research interests include optical networks and wireless networks.     

数控技术及产业发展

简要介绍了我国数控技术和产业发展的状况及当今世界数控技术的发展趋势,对我国发展自己的数控技术及产业途径提出了一些建议。     

Sequential Spectrum Analysis of the Sideband Components of Digital Amplitude-Modulated Signals

It is shown that, for the spectrum analysis of digital quasi-periodic signals, one must use a procedure based on approximating the sequence of data readouts by a first-order trigonometric polynomial with a varying frequency of its harmonic functions.     

弯曲性分叉河道中污染物扩散性的初步研究

弯曲性分叉河道中水流特征复杂,对污染物扩散有很大影响。为了定量分析其水流特征对污染物扩散的影响,采用有限元方法求解弯曲性分叉河道中的污染物扩散数学模型,研究其中污染物扩散的状况。主要针对河道回流、绕流对污染物扩散的影响进行了详细数值模拟计算,并分别给出了可视化结果及平均的扩散距离。计算结果表明:边界层稍微减弱污染物的扩散,弯道分离使污染物扩散呈现多向扩散,而回流和绕流尾迹区使污染物很难扩散,从而有利于泄漏污染物的收集和集中治理。     

有限元技术在数值试井中的应用

分析了试井技术的发展趋势，对有限元分析技术及其发展作了较为全面的介绍，重点阐述了利用有限元技术进行三维建模的方法和步骤，尤其是对复杂的非对称边界和非均质油藏的建模方法和技巧进行了深入探讨。利用数值试井技术，石油工程师可以方便准确地对复杂油藏和边界进行建模，试井的模拟过程和油藏任意位置的压力瞬间变化都可以通过图形和颜色的变化显示出来，解释的精度和速度都得到了大大地提高。     

GaN-MOCVD设备反应室流场的CFD数值仿真

采用计算流体力学方法对生长半导体材料GaN的重要设备MOCVD(金属有机物化学气相沉积)反应室中的流场结构进行了三维数值仿真.数值模拟采用基于非交错网格系统的SIMPLE算法,用有限体积方法对控制方程进行离散,并采用改进的压力-速度耦合方法进行求解.数值仿真给出了具有复杂几何结构和运动方式的GaN-MOCVD反应室中的流场结构,研究了改变几何尺寸和运行参数对MOCVD反应室流场结构的影响,对正在试制开发中的MOCVD设备的几何结构的改进和运行参数的优化提出了指导性建议.     

数值试井在白6-2井测试资料分析评价中的应用

数值试井是在近来发展的一项新的试井解释技术，具有处理非均质，复杂边界油气藏问题的优点，弥补了常规解析试井技术的不足。运用数值试井解释技术，结合动、静态资料，通过对白6-1断块白6-2井测试资料的综合分析评价，确定了储层渗流参数，落实了该气藏的边界情况，为该断块下一步开发提供可靠依据。     

伶仃洋三维潮流输沙的数值模拟

作者使用垂向坐标变换技术，结合有限差分方法建立了三维潮流输沙的数学模型。为了增加模型的稳定性和减少数值耗散，对悬沙对流扩散方程中的水平对流项采用三阶迎风格式离散。应用本模型对伶仃洋的枯季和洪季的潮流输沙的悬沙场进行了数值模拟，将模拟结果与实测资料进行比较，二者吻合较好。模拟结果分析表明：伶仃洋悬沙运动主要集中在西滩，对伶仃航道影响不大；洪季水体含沙浓度高于枯季；水体含沙浓度沿水深存在浓度梯度，且洪季的浓度梯度明显大于枯季。     

NUMERICAL INVESTIGATION ON MUD BED-GENERATION AND IMPACTING A WALL ALONG A SLOPE

In this paper mud was treated as the Bingham fluid. In staggered grids, two-dimensional incompressible Navier-Stokes equations for non-Newtonian fluid was solved by the MAC method. Numerical simulations were conducted on mud bed-generating phenomenon and mud impacting a wall along a slope. The distributions of free surface, pressure and velocity of mud and water were obtained. The results indicate that the computed layer thickness of mud bed almost equals the theoretically predicted value. Because of the differences in constitutive relationship, the distributions of free surface are different for water and mud. The distortion of water free surface is much more complicated.