基于光纤技术的采空区发火监测系统的应用

基于光纤技术的采空区发火监测系统由传感器、数据传输、数据分析与控制三大部分构成,研发新一代适合煤矿安全领域应用的先进传感器、并以此为基础构建新型煤矿安全灾害监测预警系统,对于实现煤矿安全发展具有十分重要的意义。     

矿用钻孔深度测量仪的设计

设计了一种以STM32F103微控制器为控制核心,基于24位高精度模数转换器的钻孔深度测量仪器。利用弹性波回波测距原理,通过测量出钻孔中钻杆的长度,实现钻孔深度的快速、无损、准确的测量,主要用于井下瓦斯抽放钻孔、探放水钻孔等煤矿通防工作的施工验收。仪器小巧轻便,操作简单,单人即可完成测量工作,节约下井的人力物力,提高生产效率,最长测量长度可达250米,误差不超过1米。     

Enhancing urban infrastructure investment planning practices for a changing climate.

Climate change raises many concerns for urban water management because of the effects on all aspects of the hydrological cycle. Urban water infrastructure has traditionally been designed using historical observations and assuming stationary climatic conditions. The capability of this infrastructure, whether for storm-water drainage, or water supply, may be over- or under-designed for future climatic conditions. In particular, changes in the frequency and intensity of extreme rainfall events will have the most acute effect on storm-water drainage systems. Therefore, it is necessary to take future climatic conditions into consideration in engineering designs in order to enhance water infrastructure investment planning practices in a long time horizon. This paper provides the initial results of a study that is examining ways to enhance urban infrastructure investment planning practices against changes in hydrologic regimes for a changing climate. Design storms and intensity-duration-frequency curves that are used in the engineering design of storm-water drainage systems are developed under future climatic conditions by empirically adjusting the general circulation model output, and using the Gumbel distribution and the Chicago method. Simulations are then performed on an existing storm-water drainage system from NE Calgary to investigate the resiliency of the system under climate change.     

Finding all hops shortest paths

In this letter, we introduce and investigate a new problem referred to as the All Hops Shortest Paths (AHSP) problem. The AHSP problem involves selecting, for all hop counts, the shortest paths from a given source to any other node in a network. We derive a tight lower bound on the worst-case computational complexities of the optimal comparison-based solutions to AHSP.