镇江市降雨场次划分与暴雨特性分析

为划分镇江市降雨场次和分析暴雨特性,基于丹徒站1981—2016年汛期5—10月的逐分钟降雨资料,确定了降雨间隔时间,筛选了暴雨场次,分析了汛期各月暴雨次数和暴雨量的变化特性,解析了不同历时和不同强度暴雨的演变规律。结果表明:镇江市合理的降雨间隔时间为2 h;汛期总暴雨次数呈略微上升的趋势,总暴雨量以每10年43.4 mm的速度增加;汛期暴雨主要集中在6—8月,其暴雨次数占汛期总暴雨次数的73.0%,其暴雨量占汛期总暴雨量的73.5%;7月和8月的暴雨量及其对总降雨的贡献率呈增加趋势,其他月份呈减少趋势,暴雨集中度增强;不同历时的暴雨中,一般暴雨占比最大,特短、短暴雨次数增长趋势显著,且特短暴雨的强度呈增加趋势;不同强度的暴雨中,弱暴雨占比最大,中、强暴雨次数均有不同程度的增长。     

高坝泄洪诱发场地振动响应分析及传播规律

为研究高坝泄洪诱发场地振动的问题,提出一种基于黏弹性人工边界的有限元数值模拟和水力学模型试验相结合的方法计算场地振动响应。以国内某工程为例,计算不同工况下场地振动响应,分析泄洪量和泄洪调度方式对场地振动的影响,揭示不同岩体条件下振动波的传播规律。结果表明:该工程各种泄洪方式都不会对周边居民的生活造成影响;泄洪量越大,下游场地振动响应越大,当3个溢洪洞泄洪条件一致时,采用2号洞泄洪最不利;同等泄洪条件下,采用4洞均分泄洪的振动响应小于按设计开度泄洪的振动响应;模型范围内放大振动波的主因是断层左右岩体性质的差异,断层的存在进一步加大了放大效应。     

基于CMIP5的中国西北地区暖湿化演变研究

为了解中国西北地区历史与未来时期的气候演变趋势,以CMFD再分析数据集及CMIP5全球气候模式输出数据为基础,从时空维度详细分析了西北地区历史气候的演变特征并对区域未来气候发展进行了预估。结果表明：1979-2018年西北地区的气温、降水量以及近地面空气比湿均呈现出明显的增加趋势,且未来极有可能继续增加;此外,降水量在年内的分配过程越趋均匀化,且降水结构在2001年左右发生了较大突变。整体来看,西北地区的历史气候演变显示出高度的暖湿化倾向。未来情景下,西北地区的气候将继续朝暖湿化方向发展,同时降水量的年内分配不均匀性也将进一步减小,且在RCP8.5排放情景下表现的更为突出。本研究可为西北地区气候变化的影响评估提供参考,同时也为水利、农业、气象和生态等部门的决策提供科学依据。     

北京市城区雨量站网最优布设模式研究

雨量监测的准确性对城市防洪减灾和保障城市运行产生重大影响,雨量站网布设模式直接影响区域雨量监测的准确性.选取北京市中心城区为研究对象,采用数理统计相结合的方法,在现有雨量站网布设的基础上,设置11个雨量站密度梯度(T1～T11),对北京市中心城区雨量站网布设合理性进行评价,提出最优雨量站布设方式.通过2年21场降雨实测数据分析结果表明,T10雨量站网布设密度实测面雨量值与目标值相差0～3.3％;最大雨量控制率和最大雨强控制率达100％;均方根误差(RMSE)、相对误差(Rd)、绝对误差(MRE)分别为0.3、0.007 7和0.22,NSE系数为0.999 9接近于1.综合考虑面雨量值、最大雨量及最大雨强等3个参数,同时考虑雨量站的后期维护管理.认为T10(8 km2/站)梯度雨量站数量和布设较为合理,8 km2/单站雨量站的布设模式为城区雨量监测最优站网布设模式.本研究旨在解决如何科学、经济、合理布设雨量站网这一基本问题.     

复掺粉煤灰+改性硅灰高性能水工混凝土试验研究

针对部分水利工程建设地区地下水和土壤中含侵蚀物质较高且骨料呈碱活性现象,文章进行了不同水胶比和不同粉煤灰+改性硅灰掺量下的高性能混凝土配比试验.结果表明:混凝土的强度随水胶比和粉煤灰掺量的增大而减小,当水胶比为0.3时,粉煤灰24％+改性硅灰6％的混凝土强度最高;高性能混凝土的水胶比建议不大于0.35,且粉煤灰掺量不宜过高,当水胶比为0.35时,粉煤灰24％+YK-Ⅲ6％的抗氯离子和抗水渗性能最佳;所有试验组的14天膨胀率均低于0.2％,最大膨胀率为0.031％,起到了很好的抑制碱骨料反应的设计要求;各试验组均能够有效抵抗浓度为20250mg/L的硫酸盐溶液的侵蚀,其中,当水胶比为0.3时,粉煤灰24％+改性硅灰6％的效果最好;试验结果可为类似地区水利工程推荐施工配比、指导工程实践提供帮助.     

妫水河入官厅水库水污染成因及减排措施评估

为保障妫水河入官厅水库入流水质达标,分析水质成因,分步制订水质改善措施。采用MIKE21耦合植物作用的Ecolab生态水质模型,对妫水河下游入官厅水库断面至东大桥断面、支流三里河水域进行模拟。通过对丰水期和枯水期监测数据及模拟结果进行分析,流域上游来流水量及水质、区间污染源及河流湿地等自净作用是影响官厅水库入流水质的主要原因,其中:妫水河入流污染负荷对水库入流水质贡献率最大,丰枯水期氨氮、总磷和总氮的贡献率分别为18.32%～45.76%、9.31%～31.17%和29.34%～67.56%;区间入河污染源氨氮、总磷和总氮削减率分别为19.41%、31.31%和24.94%;丰枯水期河道自净对氨氮、总磷和总氮削减率分别为44.85%～61.29%、51.40%～77.92%和8.40%～23.06%。为改善官厅水库入流水质,在流经城市区的妫水河下游及三里河修建了河流湿地公园,对区域污染源进行截污,使得入库水质可达到Ⅲ类水。为长远确保官厅水库的水质,控制来流水质和加强流域治理是关键,同时营造岸带湿地,对水质改善有积极的作用。研究结果及方法可为水库污染防治及负荷量削减提供理论依据。     

嵌入式调试中的数据获取和错误定位

嵌入式软件系统因其软件相关性和硬件相关性而比常规软件的调试复杂很多,特别是在数据获取和故障定位方面最为突出。从嵌入式软件开发与常规软件开发的异同着手,以该行业实践积累为基础,列出并讨论了一些行之有效的数据获取及错误定位方法,希望能为该领域开发人员提供一点帮助。     

Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks

In this paper, we study the problem of continuous monitoring of reverse k nearest neighbors queries in Euclidean space as well as in spatial networks. Existing techniques are sensitive toward objects and queries movement. For example, the results of a query are to be recomputed whenever the query changes its location. We present a framework for continuous reverse k nearest neighbor (RkNN) queries by assigning each object and query with a safe region such that the expensive recomputation is not required as long as the query and objects remain in their respective safe regions. This significantly improves the computation cost. As a byproduct, our framework also reduces the communication cost in client–server architectures because an object does not report its location to the server unless it leaves its safe region or the server sends a location update request. We also conduct a rigid cost analysis for our Euclidean space RkNN algorithm. We show that our techniques can also be applied to answer bichromatic RkNN queries in Euclidean space as well as in spatial networks. Furthermore, we show that our techniques can be extended for the spatial networks that are represented by directed graphs. The extensive experiments demonstrate that our techniques outperform the existing techniques by an order of magnitude in terms of computation cost and communication cost.     

A space and time efficient algorithm for SimRank computation

SimRank has become an important similarity measure to rank web documents based on a graph model on hyperlinks. The existing approaches for conducting SimRank computation adopt an iteration paradigm. The most efficient deterministic technique yields O(n³)O\left(n^3\right) worst-case time per iteration with the space requirement O(n²)O\left(n^2\right), where n is the number of nodes (web documents). In this paper, we propose novel optimization techniques such that each iteration takes O (min{ n ·m , n^r })O \left(\min \left\{ n \cdot m , n^r \right\}\right) time and O ( n + m )O \left( n + m \right) space, where m is the number of edges in a web-graph model and r ≤ log₂ 7. In addition, we extend the similarity transition matrix to prevent random surfers getting stuck, and devise a pruning technique to eliminate impractical similarities for each iteration. Moreover, we also develop a reordering technique combined with an over-relaxation method, not only speeding up the convergence rate of the existing techniques, but achieving I/O efficiency as well. We conduct extensive experiments on both synthetic and real data sets to demonstrate the efficiency and effectiveness of our iteration techniques.     

Automatic extraction of OWL ontologies from UML class diagrams: a semantics-preserving approach

Full implementation of the Semantic Web requires widespread availability of OWL ontologies. Manual ontology development using current OWL editors remains a tedious and cumbersome task that requires significant understanding of the new ontology language and can easily result in a knowledge acquisition bottleneck. On the other hand, abundant domain knowledge has been specified by existing database schemata such as UML class diagrams. Thus developing an automatic tool for extracting OWL ontologies from existing UML class diagrams is helpful to Web ontology development. In this paper we propose an automatic, semantics-preserving approach for extracting OWL ontologies from existing UML class diagrams. This approach establishes a precise conceptual correspondence between UML and OWL through a semantics-preserving schema translation algorithm. The experiments with our implemented prototype tool, UML2OWL, show that the proposed approach is effective and a fully automatic ontology extraction is achievable. The proposed approach and tool will facilitate the development of Web ontologies and the realization of semantic interoperations between existing Web database applications and the Semantic Web.