基于小角度高位技术的钻孔初采期瓦斯治理

回采工作面初采期瓦斯涌出不均衡,易出现瓦斯超限现象。针对新源煤矿近距离煤层群开采、瓦斯涌出量大等特点,提出了小角度高位钻孔抽采治理初采期瓦斯的方法;2219工作面应用实践表明,初采期内,小角度高位钻孔抽采瓦斯纯量最高5.25m3/min,瓦斯抽采率64.02%,回风流瓦斯浓度最高为0.32%,上隅角最高瓦斯浓度0.96%,未出现瓦斯超限现象,取得了很好的初采期瓦斯治理效果。     

锚栓用量对纯锚固岩棉保温系统抗风压性能的影响

采用ETAG 004:2013《外墙外保温薄抹灰系统欧洲技术认证指南》中规定的静态泡沫块法,测试在单位面积上使用不同数量锚栓的岩棉板外保温系统的抗风压性能。通过试验可以得出:在混凝土墙体上单纯采用敲击式锚栓锚固岩棉板外保温系统时,拉伸强度可达12.9 k Pa;单位面积增加锚栓的使用量可以提高系统的抗拉承载力,但在不同条件下增加相同数量锚栓对系统抗风载能力提高的程度不同;在普通混凝土墙中,单纯锚固岩棉板保温系统破坏时,单个锚栓承载力平均值的最大值约为其拉拔承载力的50.3%。     

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

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

基于图像增强的去雾快速算法的FPGA实现

基于图像增强方法，本文提出了一种使用亮度映射的图像去雾快速算法。此算法通过调整室外多雾场景图像的对比度，提高了雾中物体的辨识度。算法的复杂度低、处理延迟小，实时性高，利于FPGA的实现。实现时不需外存储器，延时为ns级，并提供了强度调节接口，以适应较广的应用环境。     

异质结光晶体管的研究与进展

回顾了异质结光晶体管(HPT)在近年来的重要进展,综合分析了HPT的工作原理以及影响其性能的主要参数。综述了不同材料制作的HPT的研究现状,得出了目前限制HPT发展的主要因素及当前应重点解决由于基区表面复合等效应导致的增益下降和由于结电容的充放电限制的响应带宽等问题的结论。     

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.     

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.