NH_3-OH体系中共沉淀法同时回收钕铁硼废料中Nd-Pr-Co-Fe

为了避免回收单一钕铁硼废料中有价元素带来的操作复杂和资源浪费等问题,本研究采用共沉淀法共沉淀出钕铁硼废料中的有价元素Me(Nd,Pr,Co,Fe),制备可用于生产再生钕铁硼的原料;根据质量守恒和同时平衡原理,采用MATLAB软件建立Me(Nd,Pr,Co,Fe)-OH--NH3热力学模型,绘制lg[Me]-p H曲线模拟共沉淀工艺,并根据模拟结果确立了共沉淀工艺;模拟和实验的结果表明:根据lg[Me]-p H模拟结果可以确立一步共沉淀法的p H:6~10,Fe3+比Fe2+更易于沉淀完全;在上述条件下获得的共沉淀粉末主相均为Nd,Pr,Co,Fe的化合物,且有价元素的百分比含量均大于99.4%;其中,当p H值在8左右时回收率最高,在该条件下金属元素Me(Nd,Pr,Co,Fe)的沉淀效率分别为:98.7%,99.9%,93.6%,99.9%。该结果也表明共沉淀法工艺不仅高效,而且所制备的共沉淀粉末可以满足制备二次钕铁硼的需要。     

李楼铁矿溜井料位监测系统的设计与应用

李楼铁矿主溜井未加装料位监测装置时,生产调度部门主要依靠经验和统计计算指挥控制溜井料位,其效率低并存在安全隐患。结合井下通信现状,采用Optech激光物位计设计了一套成本低廉、简单实用、稳定可靠的料位监测系统。该系统经煤矿现场应用,取得了良好的监测效果,提供了准确的信号,为生产科学调度提供了依据。     

Cross-Layer Optimization of Dynamic Packet Assignment for Video Transmission Over IEEE 802.11e Networks

Video transmission over IEEE 802.11e wireless networks still shows poor performance for large bandwidth demand and frequently changed environments. Thus, several enhancements of IEEE 802.11e were proposed. On the other hand, big frames and simultaneous sending of adjacent frames always cause packet dropping for buffer overflow. In the past, we proposed an IEEE 802.11e enhancement named DFAA and a content aware mechanism to solve the above problems. The motivation of this paper is to find a proper way to integrate these two mechanisms. A DFAA enhancement (DFAA-E) is proposed to make up the insufficiency of content aware mechanism. Experiments results show that the combination of DFAA-E and content aware mechanism improves the video decoded quality greatly. And its performance can be further enhanced by selecting the suitable settings of certain parameters.     

垦71井区三维VSP资料波场分离方法应用研究

三维VSP资料是多偏移距VSP资料，资料中多种类型的波叠合在一起形成复杂波场。从复杂波场中分离出单一的保幅反射波波场是三维VSP波场分离的重要工作。常规二维VSP波场处理方法单一，难以适用于复杂的三维波场处理。针对三维VSP资料的波场特点，以分离上行反射P波为例，将单一波场分离方法加以适当组合，对垦71井区三维VSP实际资料进行了应用研究。结果表明，波场分离处理中叠加消去法和中值滤波相结合以及F—K滤波和中值滤波相结合的方法克服了单一方法的缺陷，波场处理后获得了波组特征明显、波场清晰单一的上行反射P波保幅波场，取得了较好的波场分离效果。     

Corrosion morphology of AZ91D exposed in an atmospheric environment

The focused ion beam technique was employed to investigate the atmospheric corrosion morphology of AZ91D. It was found that the α matrix of the alloy was preferentially corroded in the areas adjacent to intermetallic phases. The most interesting finding was that the corrosion products in corrosion cavities were pelletlike, which has never been reported before.     

番禺30-1砂岩强水驱气藏储层非均质性研究

针对垂向非均质性严重且边底水能量强的番禺30-1气田面临的潜在开发问题，通过岩心分析及测井二次解释，对其夹层特征及储层非均质性等进行了研究，划分出19个流动单元并定量描述了各流动单元的特征参数，建立了该气田的精细地质模型。综合评价表明，新建的地质模型具有较高的精度，为该气藏合理开发提供了坚实的地质基础。     

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.