基于IFMOP的玉环市区域水资源配置

引入无概率分布的区间数表示不确定性影响范围,选取经济效益、供需水效率和COD排放量分别构建经济目标、社会目标和环境目标优化函数,构建了玉环市不确定性模糊多目标规划(IFMOP)水资源配置模型,并计算了不确定性解集。结果表明:IFMOP配置计算成果可实现玉环市区域水量水质协调高效利用和社会-经济-生态系统均衡发展;在75%来水保证率下各行业配置总水量不确定性范围为14 375万~15 154万m³。IFMOP水资源配置模型在信息不充分的条件下能够全面使用各类数据信息进行水资源配置,更好地满足水资源在各行业配置过程中的动态管理需求。     

采用大数据分析建设工程市场信息的新方法

随着招投标过程信息化的快速发展,越来越多的招标、评标、中标信息统一集中在相应交易中心平台网站上进行公示,使采用大数据手段分析建设工程信息成为了可能。采用Web Scraper插件爬取网页内容简便、高效、准确。大数据的介入能很大程度遏制非法围标、串标行为,保证公共资源交易过程的公平、公正,有效打击权力寻租。同时大数据分析以定量、可视化的成果展示了建设工程的市场行为趋势,为政府的宏观调控提供更精确的数据性指导性意见。     

南水北调东干渠工程安全监测数据分析与处理技术研究

东干渠工程是北京市南水北调配套工程之一,是中心城环线供水系统重要组成部分,承担第十水厂、通州水厂等东部区域供水任务.东干渠工程建设了安全监测系统,监测内容包括环境量、变形、渗流、应力、应变及专项监测等.但监测系统存在监测数据中断、仪器失效及缺少初值等问题.对某典型断面的应力、应变及温度等内观监测数据以及东五环段的沉降监测数据进行了梳理、对比验证分析,明确了监测数据的合理性,初步确定了沉降风险点,为东干渠工程安全监控提供技术支撑.     

密云水库第一溢洪道水工大体积商品混凝土温控计算方法与措施研究

密云水库第一溢洪道是洪水期间保证密云水库安全的重要设施,溢洪道闸室段对强度和裂缝限制要求较高.利用经验公式、数值模型2种方法初步计算大体积商品混凝土的温度过程,为现场采取温控措施提供参考,进行浇筑施工并实时测温,然后以现场浇筑情况作为边界条件重新计算,与现场实测结果对比验证;用数值模型进一步分析不同温控措施的敏感性.定量分析结果表明,经验公式计算的外部温度过程比实测偏低,数值模型计算结果与实测相近,建议大型水利工程温度计算尽量采用数值模拟;混凝土最大温升受浇筑温度、冷却水管布置密度的影响较大,冷却结束时的温度受冷却水管布置密度、通水时长、模板导热系数影响较大.裂缝实测结果显示工程制定的浇筑方案合理可行,可以为类似工程提供借鉴.     

浅谈纳米胶在密云水库输水工程中的应用

密云水库第九水厂输水隧洞为一圆形压力隧洞,安全鉴定发现洞身混凝土表面有较多裂缝,裂缝以环形或半环形为主,裂缝宽度一般在0.5mm以下,存在剥蚀、慢渗等情况.为保证隧洞输水安全和水厂正常供水,采用水利先进实用技术"纳米胶",对隧洞混凝土衬砌表层进行了防护和修复,达到很好的微细裂缝修补、抗渗和防护效果.     

基于PXI总线的导弹角速度编码器组合测试系统设计

针对某型导弹角速度编码器组合测试快速化、模块化、自动化的要求,通过对角速度编码器组合进行分析,结合角速度编码器组合输入信号的模拟、输出信号的采集、测试系统功能和性能要求,设计了基于PXI总线的导弹角速度编码器组合测试系统;介绍了测试系统的测试原理、硬件结构和软件组成、主要设计思想;实验表明,该测试系统工作性能稳定,能有效地进行组合测试和分组件测试并运用层次故障树分析法定位故障,提高了武器系统检测维修保障能力.     

移动位置的信息服务系统研究

随着移动通信技术的发展,无线网的覆盖面越来越广,移动电话发起的紧急呼叫数量在全部紧急呼叫中所占的比例也随之上升。现有的无线网能为移动电话紧急呼叫提供的辅助决策信息非常少。研究的目标是设计一种精确安全的报警系统,使得市民可以便捷并安全地将案情报告给指挥中心,而且指挥中心能够根据案发地点找出最近的警力及时赶往现场,第一时间处理案情。研究表明,系统能够实现报警电话快速定位的功能,并通过地图或文字描述等方式展示位置信息,达到接警、处警对位置信息的要求。     

Stability analysis and H∞ control for hybrid complex dynamical networks with coupling delays

This paper formulates and studies a model of complex dynamical networks with switching topology and coupling delays. Based on the hybrid control and Lyapunov function, the stability and robust H_∞ control of such networks with impulsive and switching effects, which have not been studied before, are addressed with some criteria derived. Examples are given to illustrate the effectiveness of the theoretical results. Copyright © 2011 John Wiley & Sons, Ltd.     

Existence and Exponential Stability of Multiple Periodic Solutions for a Multidirectional Associative Memory Neural Network

The paper proposes several mathematical models of the multidirectional associative memory (MAM) neural network by analyzing its structure. A model of MAM with distributed delays is studied. Under some new assumptions on activation functions, 2^n₀[m/2]{2^{n_0[m/2]}} invariant subsets of MAM are constructed. Then the existence and the exponential stability of 2^n₀[m/2]{2^{n_0[m/2]}} periodic solutions located on invariant subsets are obtained by constructing a suitable Liapunov function and a Poincaré mapping. An estimating method of the exponential convergence rate is given. The obtained results are new to MAM neural networks. An example is given to illustrate the effectiveness of the results.     

Long-term information collection with energy harvesting wireless sensors: a multi-armed bandit based approach

This paper reports on the development of a multi-agent approach to long-term information collection in networks of energy harvesting wireless sensors. In particular, we focus on developing energy management and data routing policies that adapt their behaviour according to the energy that is harvested, in order to maximise the amount of information collected given the available energy budget. In so doing, we introduce a new energy management technique, based on multi-armed bandit learning, that allows each agent to adaptively allocate its energy budget across the tasks of data sampling, receiving and transmitting. By using this approach, each agent can learn the optimal energy budget settings that give it efficient information collection in the long run. Then, we propose two novel decentralised multi-hop algorithms for data routing. The first proveably maximises the information throughput in the network, but can sometimes involve high communication cost. The second algorithm provides near-optimal performance, but with reduced computational and communication costs. Finally, we demonstrate that, by using our approaches for energy management and routing, we can achieve a 120% improvement in long-term information collection against state-of-the-art benchmarks.