The building evacuation problem with shared information

In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

并行离散事件仿真中的DDM机制实现

在并行离散事件仿真系统中实现仿真模型间的互操作机制需要引入类似HLA中定义的声明管理(DM)和数据分发管理(DDM)服务.我们开发的KD-PADSE高性能并行离散事件仿真环境采用谓词断言和对象代理方法在面向对象的并行离散事件仿真系统中实现了基于平行结构和事件调度机制的声明管理(DM)和数据分发管理(DDM)服务.在以千兆以太网互联的10节点Linux集群计算机上,采用DDM机制后仿真模型每秒(物理时间)可以进行1万次属性更新,是没有采用DDM机制时的20倍,在功能性和性能上验证了该DDM机制在并行离散事件仿真系统中的适用性.     

Dynamic inventory management with cash flow constraints

In this article, we consider a classic dynamic inventory control problem of a self‐financing retailer who periodically replenishes its stock from a supplier and sells it to the market. The replenishment decisions of the retailer are constrained by cash flow, which is updated periodically following purchasing and sales in each period. Excess demand in each period is lost when insufficient inventory is in stock. The retailer's objective is to maximize its expected terminal wealth at the end of the planning horizon. We characterize the optimal inventory control policy and present a simple algorithm for computing the optimal policies for each period. Conditions are identified under which the optimal control policies are identical across periods. We also present comparative statics results on the optimal control policy. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008     

大规模代谢网络分解的生物信息学研究

随着大规模分子相互作用数据的不断涌现,生物学网络方面的研究正日益得到重视.代谢网络处于生物体的功能执行阶段,其结构组成方式不仅反映了生物体的功能构成,也直接影响代谢工程中的途径分析和研究.作为代谢网络研究的重要环节,实现网络的合理分解不仅对于基因组范围内分子网络的结构和功能研究具有重要意义,也是代谢工程的途径分析和优化得以顺利进行的前提之一.在回顾代谢网络宏观结构和拓扑特征研究成果的基础上,通过对现有分解方法的深入分析,指出缺乏合理且有针对性的模型评估准则是目前网络分解研究中亟待解决的问题之一.今后的研究趋势在于如何整合更多的信息和发展更先进的分析方法,建立更合理的模型,并进一步拓展网络分解的应用范围.     

一种改进的事件驱动系统框架

在给出事件驱动系统安全漏洞的基础上,指出了产生漏洞的根本原因是:系统忽视了输入系统的事件序列之间存在的相关性;系统无条件信任任何事件源产生的事件.针对这两个原因,相应提出了事件序列形式安全分析模型及基于事件源的可信度评估模型,依据这两个模型,构建了一种改进的事件驱动系统框架.     

The interaction between local and international power in EU police reform in Bosnia and Herzegovina

ABSTRACT

This article explores the interaction between local and international power structures in EU peacebuilding. While citizens in a state only face order from one authority (the state), local actors in a peacebuilding context are subject to orders from two institutions (the domestic state and the peacebuilding mission). This article explores the nature of interactions of these two institutions and their effect on local police officers’ compliance and resistance. Specifically, it analyzes the example of the police restructuring process in Bosnia and Herzegovina. It demonstrates that the choices of local officers to comply or resist depended on whether the interactions between the EU Police Mission and the local police organization were positive and mutually supportive, or whether they were competitive and contradictory. The findings of the article contribute to the debates on the role of local power and the importance of local legitimacy in peacebuilding.     

结合全局与局部信息的主动轮廓分割模型

针对传统的基于区域的主动轮廓模型在分割灰度不均匀图像和噪声图像存在效果不佳的问题,提出结合全局项与局部项的主动轮廓分割模型。全局项由CV(Chan-Vese)模型的保真项构成,局部项的构建考虑局部区域信息的同时引入反映图像灰度特性的局部熵信息。依据图像灰度的特点,选择合理的全局项和局部项参数,并加入正则项保证曲线在演化过程中保持平滑,保障分割结果的可靠性。通过变分水平集方法最小化能量泛函,依据梯度下降流迭代更新水平集,完成曲线演化。采用模拟图像和实际图像进行实验分析,结果表明,所提出的结合全局项和局部项的主动轮廓模型可以高效地分割噪声严重以及灰度分布不均匀的图像。     

An attacker‐defender model for analyzing the vulnerability of initial attack in wildfire suppression

Wildfire managers use initial attack (IA) to control wildfires before they grow large and become difficult to suppress. Although the majority of wildfire incidents are contained by IA, the small percentage of fires that escape IA causes most of the damage. Therefore, planning a successful IA is very important. In this article, we study the vulnerability of IA in wildfire suppression using an attacker‐defender Stackelberg model. The attacker's objective is to coordinate the simultaneous ignition of fires at various points in a landscape to maximize the number of fires that cannot be contained by IA. The defender's objective is to optimally dispatch suppression resources from multiple fire stations located across the landscape to minimize the number of wildfires not contained by IA. We use a decomposition algorithm to solve the model and apply the model on a test case landscape. We also investigate the impact of delay in the response, the fire growth rate, the amount of suppression resources, and the locations of fire stations on the success of IA.     

超低照度下微光图像增强神经网络损失函数设计分析

超低照度下(环境照度小于2×10~(-3)lux)微光图像具有低信噪比、低对比度等特点,使目标难以辨识,严重影响观察效果。为了提高超低照度下微光图像质量,设计了一种用于微光图像增强的卷积自编码深度神经网络,并针对传统的均方误差损失函数不符合人类视觉感知特性等问题,结合现有的全参考图像质量评价指标,研究了包括感知损失在内的几种损失函数,并提出了一种新的可微分损失函数。实验结果表明,在网络结构不发生改变的情况下,所提损失函数具有更好的性能,在提高微光图像信噪比和对比度的同时,能够有效地增强图像内部细节信息。     

携带诱骗信息的多层网络隐写方法

为了提升网络隐写方法中秘密信息隐蔽传输的安全性,研究了携带诱骗信息的多层网络隐写方法。方法分为两层,高层方法用于携带诱骗信息欺骗检测者,低层方法利用网络协议栈纵向多协议之间的关系编码秘密信息,实现隐蔽通信。实验结果表明,该方法能够在保证隐写带宽的同时,确保了秘密信息传输的安全性。