高水固结尾砂充填采矿充填体合理配比的研究

高水固结尾砂充填采矿是一种新型充填采矿法。试验测定了高水固结尾矿充填体的强度和变形特征；研究分析了影响充填体强度的主要因素、高水充填工艺的特殊要求，以及上向，下向进路开采对充填体强度和稳定性的要求，提出了满足支护强度，工艺及经济需求的充填材料的合理配比范围。     

分光光度法测定黄磷尾气中总磷

实验研究了溴化硝酸吸收－分光光度法测定黄磷尾气中总磷含量的方法，总磷回收≥97%,方法检测限可达0.2μg/mL.     

The Content Driven Mobile Internet

The development of future mobile networks will be driven, in large part, by content and web based services. In this paper, we examine several performance, scalability and architectural challenges faced by future mobile web applications and how advanced mobile content delivery techniques can address these challenges. We review existing content delivery using a taxonomy that consists of three categories: network scaling, end system acceleration, and content and protocol optimization. While wireline content delivery focuses on network and server scalability, mobile content delivery will likely benefit most from optimizing radio link usage. We also present our ongoing work in this area, which extends the functionality of edge caching to the terminal, uses user interest correlation information to maintain low terminal power consumption and adds a new dimension to radio resource management. This revised version was published online in August 2006 with corrections to the Cover Date.     

构皮滩水电站尾水隧洞特大断面软岩开挖支护

构皮滩水电站尾水隧洞软岩不良地质洞段占尾水隧洞全长的70%以上,确保软岩洞段的安全快速开挖是尾水隧洞施工的关键,尤其一次支护的强度对洞室稳定影响极大。为此,施工中根据软岩的地质特点及尾水隧洞开挖的断面尺寸,采取分层开挖和超前锚杆的施工方式和型钢拱架进行一次支护。根据监测结果,围岩变形很小,一次支护效果良好,表明构皮滩水电站尾水隧洞大断面软岩采取的开挖方式和一次支护方式是成功的。     

龙滩尾水出口枯期围堰设计与施工

介绍龙滩水电站尾水出口工程枯期围堰的设计参数及计算过程,结合施工过程中的实际情况,总结得出土石子围堰的闭气方法和浆砌石主围堰堰体防渗的应注意几个问题。     

瓦斯尾巷在高档普采工作面的应用

介绍了高档普采工作面利用掘送瓦斯尾巷等措施形成回风空间 ,从根本上解决高档普采工作面的瓦斯超限问题 ,其工艺有利于在其它采煤工作面内应用     

型钢矫直中产生缺陷的原因及改进

结合邯郸钢铁集团公司型棒材厂型材矫直后头、尾部普遍存在的问题,分析了产生问题的原因,通过采取一些技术措施产生了一定的效果,进一步提出了对矫直机结构的改进方案。     

参窝水库洪水尾巴蓄泄调度

本文应用防洪与兴利矛盾互相转化规律,结合参窝水库调度实际,阐述了洪水尾巴调度的方法。文章指出参考天气预报成果进行洪水尾巴调度可以取得很好的经济效益,同时可以保证防洪安全。     

Locality-preserving hash functions for general purpose parallel computation

Consider the problem of efficiently simulating the shared-memory parallel random access machine (PRAM) model on massively parallel architectures with physically distributed memory. To prevent network congestion and memory bank contention, it may be advantageous to hash the shared memory address space. The decision on whether or not to use hashing depends on (1) the communication latency in the network and (2) the locality of memory accesses in the algorithm.We relate this decision directly to algorithmic issues by studying the complexity of hashing in the Block PRAM model of Aggarwal, Chandra, and Snir, a shared-memory model of parallel computation which accounts for communication locality. For this model, we exhibit a universal family of hash functions having optimal locality. The complexity of applying these hash functions to the shared address space of the Block PRAM (i.e., by permuting data elements) is asymptotically equivalent to the complexity of performing a square matrix transpose, and this result is best possible for all pairwise independent universal hash families. These complexity bounds provide theoretical evidence that hashing and randomized routing need not destroy communication locality, addressing an open question of Valiant.This work was started when the author was a student at Oxford University, supported by a National Science Foundation Graduate Fellowship and a Rhodes Scholarship. Any opinions, findings, conclusions, or recommendations expressed in this publication are those of the author and do not necessarily reflect the views of the National Science Foundation or the Rhodes Trust.     

多用户动态节能资源竞争计算卸载策略

针对移动边缘计算环境下,移动设备的计算、续航、存储能力的不足,导致其响应延迟、电池寿命降低等问题,设计了一种动态节能资源竞争计算卸载（DERCO）策略。该策略综合考虑了信道容量以及设备间的相互干扰等情况,以一种贪婪算法的思想,让所有边缘设备通过迭代竞争信道资源,节能效果最好的设备将获得卸载机会,再利用一次性卸载方法,根据实时的信道状况和卸载速率进行动态的细粒度子任务卸载决策。实验结果表明,该策略优于一种近似协同计算卸载方案,有效降低了设备的能耗与时延。