非均匀内热源对多孔介质内复合对流传热传质的数值研究

采用数值方法分析了具有非均匀内热源的竖直套管中复合对流传热传质,考查内热源分布系数M和热质二浮力比N对速度、温度、浓度分布以及Nusselt数和Sherwood数的影响,讨论了Da数对复合对流传热传质的影响.结果表明:当N＞1时速度V为正,其值随N的增加而增大:当N＜-1.5时,V则先负后正.随着M增大,内外壁面处流线...     

粉煤灰传热的影响研究

近年来国内外竞相开展利用粉煤灰等制备保温材料的研发工作,以粉煤灰传热为研究对象,对粉煤灰内的流场、温度场、高温壁面平均努谢尔数Nu进行研究;采用整场求解法方法进行数值求解,对网格的独立性和计算过程进行了验证;得到了粉煤灰传热一些基本数据,分析了粉煤灰温度场和流场随瑞利数Ra的变化规律。研究结果表明:随着Ra增加,开始流线均匀分布为一个顺时针大窝,逐渐变化为流线集中分布在流场外侧,而在中央基本上保持静止状态;当Ra很小时,无量纲等值线近似于平行高低温壁面的垂直线,随着Ra数逐渐增大,对应的温度等值线近似呈高温至低温的线性变化趋势;Ra小于10~5时,高温壁面Nu基本为2.37～3.31的定值;高温壁面底部努谢尔数Nu数大,最大值为30.8,上部Nu数小,最小值为1.19。     

涡轮叶尖压力边小翼肋条对泄漏流场的数值模拟

结合基于压力修正的采用雷诺应力湍流模型加壁面函数的气维计算流体力学程序,通过在叶尖压力面表面边缘加小翼肋条的被动控制方法以期减小叶尖间隙泄漏流动带来的损失,文章对某一轴流涡轮转子叶尖间隙泄漏流场的被动控制进行了数值模拟研究,并详细分析了在不同肋条宽度下泄漏流场细节,最后计算了涡轮效率;结果表明:涡轮叶尖单压力边小翼肋条总体上减小叶尖表面压差,使得吸力面后半部分泄漏流速度减小,从而减小泄漏流动损失,但会增大通道内流动损失,涡轮转子效率下降;小翼肋条宽度有一个最佳值,小间隙下增大肋条宽度使得效率减小,大间隙下肋条宽度增大却增大涡轮转子效率;压力边小翼肋条改变了叶尖压力边附近的流场,对吸力边附近泄漏流动结构没有大的影响.     

旋流分离器内三维两相流场的数值模拟

采用RNG k-ε湍流模型,对旋流分离器内三维两相流场作了数值模拟,给出了压力、速度、湍流动能和湍流耗散率等参数的分布。结果表明流体速度从中心沿径向逐渐增大,在旋流器壁面附近又逐渐降低,湍流动能、湍流强度以及湍流粘度均沿径向先增大然后逐渐减小,而湍动能耗散率的变化是沿径向先增大然后逐渐减小,在壁面附近急剧增大。同时对不同粒径颗粒的运动轨迹进行了计算和讨论。计算结果表明,粒径较大的颗粒大多进入到底流口,而粒径较小的颗粒大多进入到顶部溢流口。而粒径为100μm的固体颗粒100％进入底流,与从进口面不同点进入无关。     

海底埋设犁水刀破土能力分析

为了完成对风电项目的电缆进行较高深度要求的埋设作业,需要设计一套全新的海底埋设犁。该埋设犁采用水力冲刷的方式破土。文章采用数值模拟的方式计算指定冲刷沟型内的流场,并通过分析壁面的剪切力分布来判断水刀的破土能力。首先,采用单相流模型计算水刀与冲刷坑前壁面4组不同间距的定常流工况,发现随着距离增大,前壁面被剪切破坏的区域明显减小,前壁面上部区域更难被破坏,但冲刷坑底部土壤仍能被汇聚水流在后方剪切破坏;其次,计算2种不同喷嘴安装角的4组不同间距的定常流工况,发现随着安装角的增大,射流对前壁面的剪切破坏效率越来越高;最后,计算了2组非定常流工况,观察了冲刷坑内流线的变化,得到流场达到动平衡的时间,以此预估埋设犁的作业速度。仿真计算结果表明,该埋设犁能够以900 m/h的设计作业速度开挖出指定深度的冲刷沟。     

圆型薄板的临界转速分析

对内边夹支外边自由的一类薄圆板,利用卡门大挠度理论建立了其旋转时的横向振动方程.通过化简并应用伽辽金法对该偏微分方程离散化,计算出了一个刚度算子在不同的节径数n下的最低阶（节圆数m=0）特征值及简化方程相应模态的特征频率.给出了临界转速的计算方法,并讨论了其随板的内外半径比a/b及泊松比μ的变化关系.分析结果表明,对于节径n=0和n=1均不存在临界转速,对于其它节径n,临界转速随着内外半径比的增大而增大随着泊松比的增大而减小.这对于电脑硬盘、圆锯、涡轮机等高速旋转设备的设计有重要的参考意义.     

微型人造血管壁面特征对血液流动的影响

针对3D打印和喷丝成型两种不同微加工方法制备的人造血管壁面特征对其内部液态流场的影响开展仿真研究。借助商用Comsol软件,研究了不同壁面拓扑形貌,结构尺寸和流体粘度等因素对人造血管内部流场的影响规律分析。结果表明:3D打印制备的人造血管内壁面凸起阵列结构在流场内形成了液体滞留区,该区域面积不随液体粘度的变化而变化,而会随着凸起结构尺寸的变大而变大;当滞留区带有血栓时,滞留区域面积进一步增大,容易引起血小板富集,因此,3D打印的人造血管壁面凸起结构对于血栓具有诱发和强化的作用。     

短叶片长度对固液离心泵内流场影响的模拟研究

为了研究短叶片长度对长短叶片离心泵叶轮内固液两相流场的影响,应用CFD软件对5种不同短叶片长度的离心泵中的固液两相流场进行数值模拟,分析并对比5种离心泵中压力及固相体积浓度变化规律.结果显示:5种离心泵中的压力沿着半径增大方向呈增大趋势;且相同半径处,工作面压力总是大于吸力面;在一定程度上减小短叶片长度,压力分布更均匀,颗粒浓度的变化曲线更平缓,同时叶轮中固相颗粒的高浓度区域大大减小,从而能够减弱各种不稳定因素的影响,保持良好的流动状态,提高离心泵的水力性能和抗磨损性能.所得结论为离心泵的改良和设计提供非常有价值的理论基础.     

防寒沟对日光温室横向地温的影响

以未设置防寒沟和在前底脚设置防寒沟的辽沈Ⅰ型日光温室为例,对土壤温度变化规律进行了试验研究。研究表明,在地面下0．4m,最低温度出现在温室的前底脚,其次是温室的后底脚,未设置防寒沟时最高温度出现在温室中部靠后,设置防寒沟时最高温度出现在温室中部靠前;在地面下0．8m,未设置防寒沟与设置防寒沟温室内外温度变化规律基本相同,说明防寒沟埋深0．8m是合理的,建议取0．8m～1．2m;对采用不同防寒沟材料对日光温室沿横向地温变化规律分析表明,吸湿性小、导热系数小、整体性好的聚苯板具有较好的保温隔热性能,而炉渣作用不明显。     

低雷诺数湍流模型的网格特征

低雷诺数模型目前主要应用于二维简单流动的数值仿真中,为研究该湍流模型在三维复杂流动计算中的网格特征,选取不同系列的车身面网格尺寸、车身壁面第一层边界层与壁面法向高度以及边界层层数等3组网格参数,利用ANSYS对阶背式MIRA模型外流场进行数值仿真.数值仿真结果与风洞试验的结果对比表明：数值计算得到的车身表面平均y+值随面网格尺寸增加而呈现减小趋势;网格方案对气动力因数和车身表面压力因数分布影响显著,气动阻力因数仿真值与试验值误差的变化区间为0.83%~7.93%,气动升力因数误差变化区间为10%~104%;气动阻力因数和气动升力因数均随着边界层层数的增加而增大,边界层层数为5时可以得到兼顾气动力因数精度和车身表面压力因数精度的较优仿真结果.     

Combining a monad and a comonad

We give a systematic treatment of distributivity for a monad and a comonad as arises in giving category theoretic accounts of operational and denotational semantics, and in giving an intensional denotational semantics. We do this axiomatically, in terms of a monad and a comonad in a 2-category, giving accounts of the Eilenberg–Moore and Kleisli constructions. We analyse the eight possible relationships, deducing that two pairs are isomorphic, but that the other pairs are all distinct. We develop those 2-categorical definitions necessary to support this analysis.     

Splitting a configuration in a simplex

This paper presents a new method of partition, named-splitting, of a point set ind-dimensional space. Given a pointG in ad-dimensional simplexT, T(G;i) is the subsimplex spanned by G and the ith facet ofT. LetS be a set ofn points inT, and let be a sequence of nonnegative integers ₁, ..., n_d+1 satisfying _i=1 ^d+1 ₁=n The-splitter of (T, S) is a pointG inT such thatT(G;i) contains at least _i points ofS in its closure for everyi=1, 2, ...,d + 1. The associated dissection is the re-splitting.The existence of a-splitting is shown for any (T, S) and, and two efficient algorithms for finding such a splitting are given. One runs inO(d²n logn + d³n) time, and the other runs inO(n) time if the dimensiond can be considered as a constant. Applications of re-splitting to mesh generation, polygonal-tour generation, and a combinatorial assignment problem are given.     

On a nonlinear problem of a sequential control with a parameter

The problem of evasion of a group of moving points from a nonlinear controlled object, whose goal is consecutively approach these points in a prescribed order, is analyzed. The movement of each point is defined uniquely by a scalar parameter chosen at the initial time instant. The controlled object minimizes a certain cost function, and the group of the points, acting cooperatively, maximize this cost function by choosing the parameters. Necessary optimality conditions for parameters are obtained. A model problem of an evasion of moving points from a vehicle is solved.     

Three-Link Mechanism as a Model of a Person on a Swing

Journal of Computer and Systems Sciences International - We model movements of a person swinging on a swing. We consider a flat three-link hinged mechanism as the main mechanical model of the...     

Not a castaway but a stowaway

A portable keyboard that's no larger than my phone, that's theiGo Stowaway.     

Transposing a matrix on a vector computer

There are many published algorithms for transposing a rectangular matrix in place, however none of these are suited to a vector processor. In this work we describe four methods and compare their speed and memory requirements to copying the matrix into workspace then back again in transposed order.     

Locating a tree in a phylogenetic network

Phylogenetic trees and networks are leaf-labelled graphs that are used to describe evolutionary histories of species. The Tree Containment problem asks whether a given phylogenetic tree is embedded in a given phylogenetic network. Given a phylogenetic network and a cluster of species, the Cluster Containment problem asks whether the given cluster is a cluster of some phylogenetic tree embedded in the network. Both problems are known to be NP-complete in general. In this article, we consider the restriction of these problems to several well-studied classes of phylogenetic networks. We show that Tree Containment is polynomial-time solvable for normal networks, for binary tree-child networks, and for level-k networks. On the other hand, we show that, even for tree-sibling, time-consistent, regular networks, both Tree Containment and Cluster Containment remain NP-complete.     

Linking a CYBER76 to a 3600

In mid-1973, the Division of Computing Research, CSIKO, took delivery of a Control Data CVBER76 computer, which acts as the primary processing power of the CSIRO computer network (CSIRONET), replacing the Control Data 3600. The 3600, running under the DAD operating system, has been retained as a ‘front-end’ to the CYBER76 and continues to support the following functions:

• 1 An interactive system allowing both editing and CYBER76 job submission
• 2 Input of job files centrally from 3600 input devices, remotely from CSIRONET devices, or from interactive console users, and output of results similarly
• 3 A permanent file (document) system, with tape archiving

This paper describes the linking of the CYBER76 to the 3600. Software for a CYBER76 PPU has been written and some changes to the 3600 and CYBER76 operating systems have been required.