不同网格扭曲率下压力修正全隐算法——IDEAL求解性能研究

2008年,本文作者和陶文铨等提出了一种用于速度和压力耦合求解的高效稳定压力修正全隐算法IDEAL,该算法通过在每个迭代层次上对压力方程进行两次内迭代计算,完全克服了SIMPLE算法的两个假设,充分满足了速度和压力之间的耦合,从而大大提高了计算的收敛性和健壮性。为了进一步实现IDEAL算法的推广应用,本文基于三维倾斜方腔顶盖驱动流动,研究了IDEAL算法在不同网格扭曲率下的求解特性。研究发现,在不同网格扭曲率下,IDEAL算法的健壮性和收敛性均优于SIMPLE算法,特别在高网格扭曲率情况下,IDEAL算法求解性能更加优于SIMPLE算法。在不同网格扭曲率下,IDEAL算法健壮性保持不变,几乎可以在任意速度亚松弛因子下获得收敛的解,同时IDEAL算法最短计算耗时较SIMPLE算法减少了56%~89%,验证了IDEAL算法的优越性。     

不确定信息多目标线性优化的鲁棒方法

研究不确定信息的多目标线性优化问题,其数据不能精确给出但是属于一个给定的集合.首先,采用鲁棒方法把该问题转化为一个确定的多目标优化问题.然后,给出此问题解存在的充分条件.最后,通过实例验证了用鲁棒方法解决不确定信息的多目标线性优化问题的有效性.     

Universal robustness of scale‐free networks against cascading edge failures

Considering the effect of the local topology structure of an edge on cascading failures, we investigate the cascading reaction behaviors on scale‐free networks with respect to small edge‐based initial attacks. Adopt the initial load of an edge ij in a network to be L_ij = (k_ik_j)^α[(∑k_a)(∑k_b)]^β with k_i and k_j being the degrees of the nodes connected by the edge ij, where α and β are tunable parameters, governing the strength of the edge initial load, and Γ_i and Γ_j are the sets of neighboring nodes of i and j, respectively. Our aim is to explore the relationship between some parameters and universal robustness characteristics against cascading failures on scale‐free networks. We find by the theoretical analysis that the Baraba'si‐Albert (BA) scale‐free networks can reach the strongest robustness level against cascading failures when α + β = 1, where the robustness is quantified by a transition from normal state to collapse. And the network robustness has a positive correlation with the average degree. We furthermore confirm by the numerical simulations these results.     

Rapid Assessment of the Reaction‐Condition‐Based Sensitivity of Chemical Transformations

A systematic, user‐friendly assessment tool that delivers a clear overview of the sensitivity of reactions to key parameters is highly desirable. Herein, the development of such a method is described. The intuitive, standardized presentation of the results in a radar diagram enables the sensitivity of a protocol to be rapidly assessed. This method was applied to five different visible‐light‐mediated photochemical reactions, and the results were correlated to the underlying mechanism. Ultimately, we believe that this assessment will help to increase the uptake of new synthetic methods and their reproducibility.     

Robustness in complex information systems: The role of information “barriers” in Boolean networks

In this supposed “information age,” a high premium is put on the widespread availability of information. Access to as much information as possible is often cited as key to the making of effective decisions. While it would be foolish to deny the central role that information and its flow has in effective decision‐making processes, this chapter explores the equally important role of “barriers” to information flows in the robustness of complex systems. The analysis demonstrates that (for simple Boolean networks at least) a complex system's ability to filter out, i.e., block, certain information flows is essential if it is not to be beholden to every external signal. The reduction of information is as important as the availability of information. © 2009 Wiley Periodicals, Inc. Complexity, 2010     

数字水印的鲁棒性评测模型

数字水印的鲁棒性是水印技术实用化的一个重要指标.与通过StirMark测试和各种仿真测试不同,定义互信息作为代价函数,建立水印系统鲁棒性描述和度量的一般模型.以扩频水印和量化水印为范例,推导出评测鲁棒性的互信息度量计算模型,并仿真分析了高斯噪声和JPEG压缩条件下互信息函数对鲁棒性的评估结果.实验以统计误比特率的方法计算图像DCT域中低频系数为载体的扩频水印误码率和一段音频数据三级小波细节系数为载体的量化水印误码率.互信息函数和误码率之间的匹配关系验证了互信息度量模型的有效性,互信息函数可以作为代价函数预测误码率的变化趋势. 关键词： 数字水印 鲁棒性 互信息 误码率     

Consensus of Multi-Agent Systems with Prestissimo Scale-Free Networks

In this paper, the relations of the network topology and the moving consensus of multi-agent systems are studied. A consensus-prestissimo scale-free network model with the static preferential-consensus attachment is presented on the rewired link of the regular network. The effects of the static preferential-consensus BA network on the algebraic connectivity of the topology graph are compared with the regular network. The robustness gain to delay is analyzed for variable network topology with the same scale. The time to reach the consensus is studied for the dynamic network with and without communication delays. By applying the computer simulations, it is validated that the speed of the convergence of multi-agent systems can be greatly improved in the preferential-consensus BA network model with different configuration.     

基于复杂性测度的高温气冷堆模拟机运行模式识别及诊断研究

本文通过对高温气冷堆模拟机在运行过程中的12组状态参数进行分析,研究了反应堆在正常运行状态、 余热排出系统空气侧温度上升和一回路突然泄漏三种条件下系统的复杂度和稳健性等指标的变化. 研究表明,在条件发生改变时,高温气冷堆模拟机系统的复杂度有非常明显的变化,且不同条件下, 对于系统复杂性影响显著的参数也不相同.此外,反应堆模拟机中各系统间耦合计算与相互反馈机理的作用, 在系统的稳健度上也有很明显的体现.这些成果表明,复杂性分析方法在系统状态监测和 危机预警领域可以发挥重要的作用.     

利用节点效率评估复杂网络功能鲁棒性

为了克服现有复杂网络鲁棒性研究模型只考虑节点失效的局部影响性和网络拓扑鲁棒性的缺陷, 提出了一种利用节点效率来评估复杂网络功能鲁棒性的方法. 该方法综合考虑节点失效的全局影响性, 利用网络中节点的效率来定义各节点的负载、极限负载和失效模型, 通过打击后网络中最终失效节点的比例来衡量网络的功能鲁棒性, 并给出了其评估优化算法. 实验分析表明该方法对考虑节点负载的复杂网络功能鲁棒性的评定可行有效, 对于大型复杂网络可以获得理想的计算能力.     

一种基于超混沌系统的立体图像零水印算法

为了在不改变立体图像质量的前提下对立体图像实施版权保护,提出了一种基于超混沌离散系统的立体图像零水印算法. 该算法利用立体图像左右视点小波变换域低频子带视差的稳定性以及离散余弦变换直流系数稳定的特点构造了一种视差零水印. 在水印构造过程中,利用了超混沌离散系统的初始值敏感性、参数密钥空间大和动力学行为复杂等特性映射视差零水印的 位置信息,从而增强了水印算法的安全性.此外,还分析了水印安全性与水印容量之间的关系. 实验结果表明,该立体图像视差零水印算法对加噪、滤波、压缩、剪切、图像放大和缩小等各种对称和非对称攻击表现出了 较强的鲁棒性.