应用脸谱图与地积累指数法综合评价沉积物中重金属污染的研究

本文根据沉积学原理和重金属的环境化学特性及国际上新发展的重金属污染评价方法与多变量图表示法——脸谱图相结合,对本溪市区段河道沉积物中重金属的污染状况及不同重金属的积累程度进行了综合性的评价研究。本研究的特点在于从脸谱图上可以直观地看出各河段不同重金属的地积累程度和污染情况。结果表明,太子河本溪市区河道沉积物中重金属污染是严重的,必须采取相应的治理措施。     

基于知识图谱的建筑工程施工事故智能分析

为预防和减少建筑工程施工事故,应用人工智能领域知识图谱技术,对建筑工程施工事故进行分析。通过定义领域知识图谱概念体系结构,从建筑工程施工事故数据中提取关键知识要素,构建建筑工程施工事故知识图谱,将其储存在Neo4j图数据库中,并提出基于知识图谱的建筑工程施工事故分析流程,针对事故相关信息开展查询、统计分析以及关联路径分析等智能分析。研究结果表明：基于知识图谱技术,将建筑工程施工事故知识以可视化图形或表格等进行展示,将事故信息以知识形式结构化存储及表达,可有效提高事故分析工作效率,为事故预防以及安全管理提供决策支持。     

3-Parameters SPW technique: A new method for evaluation of target safety integrity level

Introduced by IEC-61508 standard, safety integrity levels (SIL) have been used for assessing the reliability of safety instrumented functions (SIF) for protection of the system under control in abnormal conditions. Different qualitative, semi-qualitative and quantitative methods have been proposed by the standard for establishing target safety integrity levels amongst which “Risk Graph” has gained wide attention due to its simplicity and easy-to-apply characteristics. However, this method is subject to many deficiencies that have forced industry men and experts to modify it to fit their demands. In this paper, a new modification to risk graph parameters has been proposed that adds more flexibility to them and reduces their subjective uncertainties but keeps the method as simple as before. Three parameters, namely severity (S), hazard avoidance probability (P), and demand rate (W) are used instead of former four parameters. Hence, the method is named SPW. The outcome results of this method can be directly converted to probability of failure on demand (PFD) or risk reduction factor (RRF). The proposed method has been tested on an example case that has been studied before with conventional risk graph and LOPA techniques. The results show that new method agrees well with LOPA and reduces costs imposed by conservative approximations assumed during application of conventional risk graph.     

基于车辆身份检测数据的车辆出行排放知识图谱研究

为实现个体车辆出行、排放行为的精细表征与挖掘,基于宣城市中心城区全量个体车辆的出行轨迹、技术参数、排放轨迹等多维交通大数据,以表征个体车辆出行过程的排放信息为主线,设计并构建车辆出行排放知识图谱.研究表明：①知识图谱直观地表征了“车辆-道路-出行-排放”信息的时空关联,可实现个体车辆在不同日期、不同时段、不同路段等多尺度出行特征的精细挖掘.以某辆小型客车为例,检索发现周一、周三出行主要连接的小时实体都为7：00、8：00和17：00,周五、非工作日出行连接的小时实体具有明显的随机性;周一、周三出行所连接的道路实体较少且基本一致,在宣水路、昭亭北路、昭亭南路的出行里程之和占比为63%~68%,周五、非工作日出行连接的道路实体则较为分散.②通过出行信息类、排放信息类实体的关联检索,可实现个体车辆出行排放时空特征的精细辨识和溯源分析.示例车辆的检索结果表明：周一车辆的CO日排放量为1.2g,是周六的2.5倍,同时在早高峰时段（7：00）,车辆出行在交通繁忙路段时,伴随低水平车速,排放强度相对较高.     

Designing a conservation reserve network with minimal fragmentation: A linear integer programming approach

In the biological conservation literature, the optimum reserve site selection problem has often been addressed by using the prototype set covering and maximal covering formulations, assuming that representation of species is the only criterion in site selection. This approach usually results in a small but highly fragmented reserve, which is not useful for practical conservation planning. To improve the chances of species' persistence, it may be desirable to reduce habitat fragmentation. This paper presents a linear integer programming formulation to minimize spatial gaps between selected sites in a reserve network, which is applied to a data set on breeding birds. The authors express their willingness to share the database used in this study. Those readers who wish to have access to the data may contact Robert A. Briers at r.briers@napier.ac.uk.     

土壤可蚀性（K）值图编制方法的初步研究

利用土壤普查图件和剖面理化分析的成果资料编制了土壤可蚀性（Ｋ）值图，介绍了求取剖面点Ｋ值的查图表法、图斑分并与图斑Ｋ值的确定原则和编制程序等，应用上述方法，完成了我国第一张地区级Ｋ值图，经分析，与公式算法比，查图表法的Ｋ值精度为８５．４％，与径流小区实测值比，用Ｋ值图上相应Ｋ值监测的土壤年流失量的精度为８６．０％。     

A Multiscale Network Analysis of Protected‐Area Connectivity for Mammals in the United States

Abstract: Protected areas must be close, or connected, enough to allow for the preservation of large‐scale ecological and evolutionary processes, such as gene flow, migration, and range shifts in response to climate change. Nevertheless, it is unknown whether the network of protected areas in the United States is connected in a way that will preserve biodiversity over large temporal and spatial scales. It is also unclear whether protected‐area networks that function for larger species will function for smaller species. We assessed the connectivity of protected areas in the three largest biomes in the United States. With methods from graph theory—a branch of mathematics that deals with connectivity and flow—we identified and measured networks of protected areas for three different groups of mammals. We also examined the value of using umbrella species (typically large‐bodied, far‐ranging mammals) in designing large‐scale networks of protected areas. Although the total amount of protected land varied greatly among biomes in the United States, overall connectivity did not. In general, protected‐area networks were well connected for large mammals but not for smaller mammals. Additionally, it was not possible to predict connectivity for small mammals on the basis of connectivity for large mammals, which suggests the umbrella species approach may not be an appropriate design strategy for conservation networks intended to protect many species. Our findings indicate different strategies should be used to increase the likelihood of persistence for different groups of species. Strategic linkages of existing lands should be a conservation priority for smaller mammals, whereas conservation of larger mammals would benefit most from the protection of more land.     

Convexity in projection matrices: Projection to a calibration problem

Convexity, as a fundamental property of sets and functions defined on convex sets, plays an important role in many mathematical and applied disciplines, including extremal and optimal-control problems. We prove the set of all feasible projection matrices in a general class of matrix models for stage-structured population dynamics to be convex and the dominant eigenvalue (λ₁) of any projection 2 × 2 matrix to be either a convex, or a concave function on a simplex of the matrix first-row entries (i.e., stage-specific reproduction rates). The latter is also conjectured for the general n × n case. Though looking far from practical needs of matrix population models, this mathematical result has appeared to be quite useful in solving a practical problem to calibrate the projection matrix, i.e., to estimate all the stage-specific vital rates, from empirical data. The data from monitoring of individual life histories of marked plants on permanent sample plots during successive years enable direct calculation of the stage-specific survival and ontogenetic transition rates, but the rates of reproduction do remain uncertain as far as the parent plants can hardly be determined for the (not yet marked!) recruitment.     

安全系统安全完整性等级确定方法比较研究

安全完整性等级的确定是开发和设计安全相关系统的前提和基础。为避免因方法选择不当而导致安全完整性等级确定不恰当的问题,针对常用的后果法、风险矩阵法、改进的HAZOP法、风险图法、保护层分析法和定量分析法进行了对比研究。在阐述和分析安全完整性等级内涵及其确定原理的基础上,根据每种方法自身的特点,从准确性、可量化性、工作量和运用的难易程度等方面对其进行了对比和研究,并分析和探讨了选择安全完整性等级确定方法时应重点考虑的因素。研究结果对合理选择安全完整性等级确定方法具有一定的实用价值和借鉴意义。     

最小生成树算法及其应用

Kruskal算法和Prim算法是求最小生成树的常用算法,文中设计了这两种算法的C语言程序,并通过实例说明了算法的应用.