Integrating Operational and Organizational Aspects in Interdependent Infrastructure Network Recovery

Managing risk in infrastructure systems implies dealing with interdependent physical networks and their relationships with the natural and societal contexts. Computational tools are often used to support operational decisions aimed at improving resilience, whereas economics‐related tools tend to be used to address broader societal and policy issues in infrastructure management. We propose an optimization‐based framework for infrastructure resilience analysis that incorporates organizational and socioeconomic aspects into operational problems, allowing to understand relationships between decisions at the policy level (e.g., regulation) and the technical level (e.g., optimal infrastructure restoration). We focus on three issues that arise when integrating such levels. First, optimal restoration strategies driven by financial and operational factors evolve differently compared to those driven by socioeconomic and humanitarian factors. Second, regulatory aspects have a significant impact on recovery dynamics (e.g., effective recovery is most challenging in societies with weak institutions and regulation, where individual interests may compromise societal well‐being). And third, the decision space (i.e., available actions) in postdisaster phases is strongly determined by predisaster decisions (e.g., resource allocation). The proposed optimization framework addresses these issues by using: (1) parametric analyses to test the influence of operational and socioeconomic factors on optimization outcomes, (2) regulatory constraints to model and assess the cost and benefit (for a variety of actors) of enforcing specific policy‐related conditions for the recovery process, and (3) sensitivity analyses to capture the effect of predisaster decisions on recovery. We illustrate our methodology with an example regarding the recovery of interdependent water, power, and gas networks in Shelby County, TN (USA), with exposure to natural hazards.     

ELAN网络控制系统通信处理时间的测量与分析

针对ELAN嵌入式网络微机控制系统中的实时性问题，给出了ELAN网络系统中的通信处理时间的测量方法，并对网络中的通信处理时间进行了分析，最后提出了代码下装的方法。     

On the Convergence of the Monte Carlo Maximum Likelihood Method for Latent Variable Models

While much used in practice, latent variable models raise challenging estimation problems due to the intractability of their likelihood. Monte Carlo maximum likelihood (MCML), as proposed by Geyer & Thompson (1992 ), is a simulation-based approach to maximum likelihood approximation applicable to general latent variable models. MCML can be described as an importance sampling method in which the likelihood ratio is approximated by Monte Carlo averages of importance ratios simulated from the complete data model corresponding to an arbitrary value of the unknown parameter. This paper studies the asymptotic (in the number of observations) performance of the MCML method in the case of latent variable models with independent observations. This is in contrast with previous works on the same topic which only considered conditional convergence to the maximum likelihood estimator, for a fixed set of observations. A first important result is that when is fixed, the MCML method can only be consistent if the number of simulations grows exponentially fast with the number of observations. If on the other hand, is obtained from a consistent sequence of estimates of the unknown parameter, then the requirements on the number of simulations are shown to be much weaker.     

一类带有分布参数系统的最佳控制

本文给出一类非均匀弦的横向振动的最佳控制，推广了P C Park的结果。这一结果同样适用于同类型振动问题。     

浅论波普反历史决定论观念政治上的贫困——从政治的视角对波普诘难历史决定论的几点质疑

文章有两大基本特点：对波普诘难历史决定论的质疑是从政治学这个独特视角进行的；对波普诘难历史决定论的质疑主要是针对哲学界较少关注的几个观点。这些观点包括波普过分推崇讧伪的方法，贬低和轻视证实方法的观点；波普认为整体主义不能建设一个适合于人们生活的新社会，只能建设一个使人适合于他的新社会的观点；波普认为渐进工程工程师在改革范围内可以不抱成见提出自己问题的观点。对于这些观点，文章借用罗尔斯、阿尔蒙德、伊斯顿、科恩、熊彼得、林尚立等的观点和理论对其进行了深入的剖析。     

无抵触理论与我国公共英语教学

将无抵触理论应用于公共英语教学，可以对外语学习活动进行设计，使学习者水平与任务的难度相当、培养语言学习兴趣、加强师生交流、确保学习者获得学习主动权等，使其在学习过程中体验到巨大乐趣，进入以注意力高度集中和全身心投入为特征的无抵触心理状态，提高学习效率。     

约束优化问题的异步并行拟牛顿方法

提出了一种求解等式约束优化问题的异步并行拟牛顿方法 .若假设目标函数 f和约束函数h至少三次连续可微 ,且△h(x)对任意x∈Rn 均为满秩矩阵 ,证明了所提出的异步并行算法是 q—超线性收敛的 .     

网络工期成本优化技术

本文提出利用列表和在表上逐步进行修改,最终得到工期成本优化问题的最优解的方法。该方法的特点是直观、易于操作。     

A study of simulated annealing and a revised cascade algorithm for image reconstruction

We describe an image reconstruction problem and the computational difficulties arising in determining the maximum a posteriori (MAP) estimate. Two algorithms for tackling the problem, iterated conditional modes (ICM) and simulated annealing, are usually applied pixel by pixel. The performance of this strategy can be poor, particularly for heavily degraded images, and as a potential improvement Jubb and Jennison (1991) suggest the cascade algorithm in which ICM is initially applied to coarser images formed by blocking squares of pixels. In this paper we attempt to resolve certain criticisms of cascade and present a version of the algorithm extended in definition and implementation. As an illustration we apply our new method to a synthetic aperture radar (SAR) image. We also carry out a study of simulated annealing, with and without cascade, applied to a more tractable minimization problem from which we gain insight into the properties of cascade algorithms.     

基于移动代理的新型IDS维护更新机制设计

提出了一种基于移动代理的新型分布式入侵检测系统。该系统是针对广域网环境专门设计的,数据的处理通过各节点所设置的代理来进行分布式计算,不仅能实现全网络范围内的入侵检测功能,具有良好的可移植性;而且对网络系统和主机的资源占用较低,减少了出现网络瓶颈的可能。还建立了移动代理的新型分布式入侵检测系统的体系结构和理论分析模型,并讨论了该系统的维护更新机制。