Microstructure and hardness of binary Cr-Ta alloys

The dependances of the microstructure and hardness of the binary Cr-Ta alloys [ Cr-9.0, -9.2, -9.4, -9.6,-9.8, and -13.0 Ta] (mole fraction, %) were investigated. When Ta content of the alloy is less than 9.4%, there are primary dandrite grains of a Cr solid-solution phase existing in the matrix of Cr-Cr2Ta eutectic colonies in the alloy. Moreover, the regular polygon grains of the primary Cr2Ta Laves-phase are surrounded by the Cr-Cr2Ta eutectic colony in the hyper-euteetic Cr-9.4 96 Ta alloys. The scanning electron microphotograph shows that one of the Cr2Ta phase plates of an eutectic colony always connects with the primary Cr2Ta Laves-phase grain in a hyper-eutectic alloy. The eutectic colony size of Cr-Ta alloys decreases with increasing Ta. In addition, the macrohardness of Cr-Ta alloys is influanced by the chemical composition at room temperature. The binary eutectic Cr-Ta alloy presents the lowest hardness on a macrohardness scale.     

非过渡金属二元系液相分层的若干规律

用扩展的Ｍｉｅｄｅｍａ合金元胞模型研究了非过渡金属二元系液相分层规律，结果表明：Δｎｗｓ＾１／３大，Δψ小的二元合金系液相分层，在ΔＺ（价电子数差）与Δｎｗｓ＾１／３，Δψ张成的三维空间中，形成固相中化合物的二元液相分层系和不形在固相中间化合物的液相分层系各自分布在特定的区域。     

CALCULATING ACTIVITIES USING Δ_(fus) H_((A_η)( B_ξ)) AND CALCULATION OF ACTIVITIES IN Ga-As, Ga-Sb AND In-Sb SYSTEMS

ＣＡＬＣＵＬＡＴＩＮＧＡＣＴＩＶＩＴＩＥＳＵＳＩＮＧΔｆｕｓＨＡηＢξＡＮＤＣＡＬＣＵＬＡＴＩＯＮＯＦＡＣＴＩＶＩＴＩＥＳＩＮＧａＡｓ，ＧａＳｂＡＮＤＩｎＳｂＳＹＳＴＥＭＳ①ＬｉＷｅｎｃｈａｏ，ＺｈｏｕＧｕｏｚｈｉ，ＬｉＸｉｎｇｋａｎｇ，Ｄｉｎ...     

NEW METHODS FOR CALCULATING ACTIVITIES OF COMPONENTS FROM PHASE DIAGRAMS IN BINARY PERITECTIC SYSTEMS

ＮＥＷＭＥＴＨＯＤＳＦＯＲＣＡＬＣＵＬＡＴＩＮＧＡＣＴＩＶＩＴＩＥＳＯＦＣＯＭＰＯＮＥＮＴＳＦＲＯＭＰＨＡＳＥＤＩＡＧＲＡＭＳＩＮＢＩＮＡＲＹＰＥＲＩＴＥＣＴＩＣＳＹＳＴＥＭＳ①ＺｈａｎｇＹｏｎｇｊｕｎＨｕｎａｎＳｕｐｅｒｉｏｒＴｅｃｈＭａｔｅｒｉ...     

Application of Graham scan algorithm in binary phase diagram calculation

Graham scan, a computational geometric algorithm for finding a two-dimensional convex hull, is introduced to calculate binary phase diagrams. This algorithm is modified and applied to find the convex hull of discrete points in the space of Gibbs energy vs mol fraction. The modified Graham scan algorithm has a very low computational cost, which improves efficiency in binary phase diagram calculation.     

基于类二叉树的圆锥型UWSNs的研究

针对水下无线传感器网络(UWSNs)能量损耗严重,节点分布不均匀无规律等现象,提出以各个水面浮标节点为顶点,构建一种圆锥型UWSNs信息网(传感器节点能根据能量大小而移动),并将其活跃节点与备选节点抽象成类二叉树结构,简化了拓扑控制与路由传递.传感器节点采集信息后,能通过活跃节点沿着类二叉树的右节点传递到浮标节点.通过Matlab实现了算法的性能仿真测试,探讨了同样水深的层数为4,6,8的类二叉树数据包传递率,结果显示:层数越多,传递率越高;将6层类二叉树的圆锥型UWSNs算法和深层路由(DBR)算法进行比较,结果显示,该算法数据包传递率高,能耗低.     

PR状态方程二元相互作用参数的拟合及对柴油中氢气溶解度的预测

通过Aspen Hysys模拟计算了温度(323~623)K和压力(4~10)MPa条件下,氢气在0~#柴油、直馏柴油、催化柴油和焦化柴油中的溶解度。计算结果对比实验数据,得到氢气在4种柴油中溶解度的平均误差分别为17.49%、11.48%、20.09%和14.00%。因二元相互作用参数与柴油性质以及温度之间存在着一定的关联,为了得到更加准确的溶解度数据,提出了计算PR状态方程中二元相互作用参数的关联式,并用Matlab进行关联式参数的拟合和氢气溶解度的计算,得到溶解度数据的平均误差分别为8.12%、7.51%、5.73%和6.10%,有效地提高了数据的准确性。因此,提出的二元相互作用参数的计算关联式可以为更加准确地预测氢气在柴油中的溶解度提供有效的方法。     

基于最大后验概率-马尔科夫随机场的二进制体数据优化

许多三维重建算法的结果以二进制体数据的形式给出,然而直接从中抽取等值面会造成阶梯化、锯齿化等走样现象.为此提出基于最大后验概率?马尔科夫随机场的二进制体数据优化方法.假设目标数据是随机变量并具有马尔科夫性,通过计算其最大后验概率推导了通用的优化公式,以及在常用模型下的优化公式;在此基础上,用户可选择不同的先验模型和观察模型来预测数据最有可能的取值,并将其作为优化结果.实验结果表明,文中方法可用于二进制体数据的可视化,光顺,去噪,修复等.     

基于地址-事件表示的高速二值连通域标记方法

为提高二值连通域标记的速度,将地址-事件表示AER（Address Event Representation）思想引入到二值图像处理,提出了一种基于事件对等价标号的二值连通域标记方法。该算法无需多次遍历图像中的背景点和冗余目标点,首先将待标记的连通域以AER“事件对”的方式编码保存,通过“事件对”的遍历生成临时标号和等价标记表;然后根据等价表修改临时标号;完成标号映射后最终实现连通域标记。整个算法只处理极低冗余的事件信息,避免了对全图像素的重复扫描与处理。实验结果表明,图像以AER“事件对”方式存储,数据量仅为全帧图像的10%~35%,有较高的压缩比;且该算法速度快,可达到了传统基于等价标号算法的1.5~8倍。     

Application execution path analysis for the automatic parallelisation of binary codes in the Intel x86 platform

Traditionally, computer programs have been developed using the sequential programming paradigm. With the advent of parallel computing systems, such as multicore processors and distributed environments, the sequential paradigm became a barrier to the utilisation of the available resources, since the program is restricted to a single processing unit. To address this issue, we propose a transparent automatic parallelisation tool with a binary rewriter. The steps of our approach are: the disassembly of the Intel x86 application, its transformation into an intermediary language; the analysis of this intermediary representation to obtain the flow and dependency graphs; the partitioning of the application into parallel units, using the obtained graphs; and, finally, the reassembly of the application back into the original Intel x86 architecture. By transforming the compiled application software, we aim at obtaining a program which can better explore the parallel resources, with no extra effort required from users or developers.