Mixed burden softening and melting phenomena in blast furnace operation Part 1 – X-ray observation of ferrous burden

Abstract

The cohesive zone in the blast furnace (BF) is largely affected by the high temperature properties of the ferrous burden. Lowering and minimising the width of this zone will increase the productivity and performance of the BF. Recently part of the BF ferrous burden has been replaced by direct reduced iron (DRI) and hot briquetted iron (HBI). The objective of the present work is to expand the current understanding of softening and melting (SM) mechanism of ferrous raw materials including DRI, HBI, pellets, lump ore and mixed burdens. A small scale 'deformation under load' experiment was designed to examine the interaction of ferrous burdens. The SM tests were conducted with ferrous burdens in different combinations and parameters such as bed contraction, pressure loss, reduction degree, etc. were measured. In addition, the process was visualised using X-ray fluoroscopy. There were microstructural differences between the ferrous materials which governed the initial compaction of bed. The softening of the single burdens of DRI and HBI occurs owing to softening of iron phase. In mixed burdens composed of DRI and pellets/lump ore, initial deformation is not affected by the presence of DRI; however the melting of the bed is dependent on the melting of DRI indicating its dominance over other burden components at later stages of deformation. The change in reduction degree between SM temperatures was found to be small.     

FSO中分层空时编码的误码性能

分层空时编码(BLAST)虽然具有极高的频谱效率,能成倍提高光通信系统的信息传输速率,但BLAST系统的误码率较大,严重影响了光通信系统的可靠性。在描述了湍流信道中多输入多输出(MIMO)系统的信道模型后,针对多进制脉冲位置调制(Q-PPM)技术,推导出了采用线性译码算法时分层空时码的极大似然判决准则及其误码率公式,并比较了最大似然译码算法、线性译码算法、串行干扰消除译码算法的误码性能。最后,利用仿真实验进行了验证。结果表明:在自由空间光通信(FSO)中,串行干扰消除译码算法的误码性能更接近最大似然译码算法的性能,明显优于线性译码算法。在4×4系统中,当误比特率为2×10-2时,相对于最小均方误差(MMSE)译码算法,最大似然译码算法和MMSE-SIC译码算法的信噪比分别改善了约14.5 dB和7 dB。理论分析与实验结果相一致。     

Hemagglutinating activity and corresponding putative sequence identity from Curcuma aromatica rhizome

BACKGROUND: Curcuma aromatica is a medicinal plant belonging to the Zingiberaceae family with an incomplete genome sequence. It has been reported that extract from the rhizome of this plant contains haemagglutinating activity. In this study the profile of fractions containing hemagglutinating activity is described. RESULTS: Following extraction with saline buffer, the protein solution was fractionated by ammonium sulfate precipitation. Ion‐exchange chromatography was completed on fast‐flow SP‐Sepharose, as well as gel filtration chromatography on Superdex 75. The active fractions were then separated by one‐dimensional sodium dodecyl sulfate–polyacrylamide gel electrophoresis and labeled proteins were digested with trypsin. The digest bands were analyzed by reversed‐phase liquid chromatography—tandem mass spectrometry. Inferred peptide sequences were used in Mascot searching and mass spectrometry‐driven BLAST (MS‐BLAST) homology searches allowed the recognition of related proteins in other species of Viridiplantae. Six putative proteins from nine bands showed similarity with lectin sequences. CONCLUSION: This study reports the identification of six lectins from the Curcuma aromatica rhizome achieved by mass spectrometry using MS‐BLAST algorithms to search for homology between de novo determined peptide sequences and protein sequences available in sequence databases. Copyright © 2008 Society of Chemical Industry     

基于MIMO-DFE的BLAST接收机的差错传递控制的研究

近期对于BLAST(Bell Laboratories Layered space-time)的研究从平坦衰落信道转向频率选择性衰落信道,基于MIMO-DFE(Multiple-Input-Multiple-Output Decision Feedback Equalizer)的接收机结构因此受到了广泛的关注.然而由于这类接收机本身的反馈结构,性能可能会由于差错传递而大大下降.本文将传统判决反馈均衡器的差错传递控制方法推广到多入多出(MIMO)系统中,仿真结果表明,本文提出的带差错传递控制的接收机能够有效控制差错传递.     

基于分层结构的空时分组码

提出了一种新的空时编码方法,该方法结合了分层空时BLAST (Bell Layered Space Time)结构及空时分组码STBC (Space Time Block Code)的优点.采用在发射端对发射天线分组,对于每组进行独立的空时分组编码,而在接收端进行分组干扰抑制,并且用奇异值分解方法实现解码.该方法具有高于STBC的频谱利用率和码速率.仿真结果验证了该方法的抗衰落性能优于BLAST.     

频率选择性衰落信道下的BLAST新方案

提出一种将贝尔实验室分层空时(BLAST)技术与RAKE接收机相结合的方案,介绍了该方案的算法原理,并与现有的频率选择性衰落信道下的BLAST方案进行了仿真对比.结果表明新方案在系统性能损失不大的情况下,极大地降低了系统复杂度.     

MIMO技术的发展与应用

给出了多输入多输出(MIMO)技术的概念,详细叙述了MIMO技术的研究现状,阐述了MIMO的关键技术和MIMO技术的应用,研究和分析表明无线移动通信领域智能天线技术的重大突破就是多MIMO技术,它能在不增加带宽的情况下成倍地提高通信系统的容量和频谱利用率,是下一代移动通信系统中最富有竞争力的技术之一。文章最后给出了MIMO技术今后的研究方向。     

Database Allocation Strategies for Parallel BLAST Evaluation on Clusters

In this work we investigate the parallel evaluation of BLAST, the most popular tool for comparing biological sequences. Our goal is to study database distribution issues that, besides workload balancing, could improve the performance of a set of BLAST processes running in a workstation cluster. We consider different partitioning strategies within actual BLAST executions against a few relevant molecular databases. We have implemented multiple databases and input sequence configurations and show that there are many important parameters, such as the fragment generation method and sequence similarities, that must be taken into account in order to make full use of such parallel environment.     

Improvement of Performance of MegaBlast Algorithm for DNA Sequence Alignment

MegaBlast is one of the most important programs in NCBI BLAST （Basic Local Alignment Search Tool） toolkits, tIowever, MegaBlast is computation and I/O intensive. It consumes a great deal of memory which is proportional to the size of the query sequences set and subject （database） sequences set of product. This paper proposes a new strategy for optimizing MegaBlast. The new strategy exchanges the query and subject sequences sets, and builds a hash table based on new subject sequences. It overlaps I/O with computation, shortens the overall time and reduces the cost of memory, since the memory here is only proportional to the size of subject sequences set. The optimized algorithm is suitable to be parallelized in cluster systems. The parallel algorithm uses query segmentation method. As our experiments shown, the parallel program which is implemented with MPI has fine scalability.     

基于曙光4000A的BLAST并行算法

对BLAST启发式算法的实现做了优化：引入批处理的概念、并对整个库文件建立哈希表,实现了I／O延迟掩藏,提高了整个比对过程的速度,同时降低了内存消耗。优化的算法有利于并行化的实现：在并行系统中,将库文件广播到各个计算节点,由节点在局部分别建立哈希表。然后将查询文件分割发送到各个计算节点并行比对。计算结果可以在节点直接输出,不需要主结点收集,减少了通信开销。