Fault-aware Communication Mapping for NoCs with Guaranteed Latency

As feature sizes shrink, transient failures of on-chip network links become a critical problem. At the same time, many applications require guarantees on both message arrival probability and response time. We address the problem of transient link failures by means of temporally and spatially redundant transmission of messages, such that designer-imposed message arrival probabilities are guaranteed. Response time minimisation is achieved by a heuristic that statically assigns multiple copies of each message to network links, intelligently combining temporal and spatial redundancy. Concerns regarding energy consumption are addressed in two ways. First, we reduce the total amount of transmitted messages, and, second, we minimise the application response time such that the resulted time slack can be exploited for energy savings through voltage reduction. The advantages of the proposed approach are guaranteed message arrival probability and guaranteed worst case application response time.     

Trace,failure and testing equivalences for communicating processes

A basic question in the theory of communicating processes is “When should two processes be considered equivalent?”. Attempts to answer this question have led to the concepts of observation equivalence, bisimulations, testing equivalence, failure equivalence, etc. The main point of this paper is to increase the understanding and motivation for two of these equivalences, namely failure and testing equivalences. The approach starts with the idea that the equivalence of processes should be reducible to the visible sequences of actions which a process performs in various contexts. This idea is implemented by a string-based semantic order for communicating processes where divergence is catastrophic. Under some assumptions about contexts, the resulting semantics is shown to be equivalent to theimproved failure semantics of Brookes and Roscoe⁽¹⁾ and also to themust testing-semantics of Hennessy and DeNicola.^(2–4) This characterization gives independent support for the appropriateness of failures and testing.     

针对任意传感器失效的反馈设计新方法

本文针对任意传感器的失效，给出了一种反馈设计方法，通过解Ｌｙａｐｕｎｏｖ方程及判定一个不等式的成立，即可给出反馈增益阵的设计，最后用这种方法研究了一个例子。     

Stochastically resilient extended Kalman filtering for discrete-time nonlinear systems with sensor failures

Missing sensor data is a common problem, which severely influences the overall performance of modern data-intensive control and computing applications. In order to address this important issue, a novel resilient extended Kalman filter is proposed for discrete-time nonlinear stochastic systems with sensor failures and random observer gain perturbations. The failure mechanisms of multiple sensors are assumed to be independent of each other with different failure rates. The locally unbiased robust minimum mean square filter is designed for state estimation under these conditions. The performance of the proposed estimation method is verified by means of numerical Monte Carlo simulation of two different nonlinear stochastic systems, involving a sinusoidal system and a Lorenz oscillator system.     

基于参数可变遗传算法的炮兵通信网络覆盖控制优化

针对节点高密度部署的炮兵通信网络中优化工作节点集的选取问题,提出一种基于参数可变遗传算法的覆盖控制优化方法。设计了密度检测机制优化初始种群,并设计了即考虑到进化代数对算法影响,又考虑到每代中不同个体适应度对算法作用的自适应交叉概率和变异概率。仿真实验及分析表明,该优化方法快速有效地实现了工作节点数目少、节点集覆盖率高的工作节点集的选取,可有效地降低能耗,延长网络生存时间。     

制冷系统隐性故障分析

制冷系统中,隐性故障因故障现象不是十分明显而难以及时被发现,致使系统带故运行,造成能源的浪费。从热力学角度分析了制冷系统极易发生的5种隐性故障,总结出5种隐性故障的压力、温度变化特征,提供了判断隐性故障的途径。     

LLC负载超高频谐振逆变器并联特性研究

针对LLC负载1 MHz超高频感应加热电压型谐振逆变器并联运行中,串联不同电感时逆变器的工作特性进行了理论分析,探究逆变器换流角度以及LLC品质因数的变化,对逆变器输出电压存在差异时换流角度的变化进行了研究。得出1 MHz的电压型谐振逆变器在存在电感差异、电压差异时换流角度是较小的,可以保证逆变器工作在小感性换流状态。最后通过MATLAB/Simulink仿真实验验证了理论分析的正确性,并对仿真结果进行了综合分析。     

Endurance: A new robustness measure for complex networks under multiple failure scenarios

Society is now, more than ever, highly dependent on the large-scale networks that underpin its functions. In relatively recent times, significant failures have occurred on large-scale networks that have a considerable impact upon sizable proportions of the world’s inhabitants. The failure of infrastructure has, in turn, begot a subsequent loss of services supported by that network. Consequently, it is now vitally important to evaluate the robustness of such networks in terms of the services supported by the network in question. Evaluating network robustness is integral to service provisioning and thus any network should include explicit indication of the impact upon service performance. Traditionally, network robustness metrics focused solely on topological characteristics, although some new approaches have considered, to a degree, the services supported by such networks. Several shortcomings of these new metrics have been identified. With the purpose of solving the drawbacks of these metrics, this paper presents a new measure called endurance, which quantifies the level of robustness supported by a specific topology under different types of multiple failure scenarios, giving higher importance to perturbations affecting low percentages of elements of a network. In this paper, endurance of six synthetic complex networks is computed for a range of defined multiple failure scenarios, taking into account the connection requests that cannot be satisfied. It is demonstrated that our proposal is able to quantify the robustness of a network under given multiple failure scenarios. Finally, results show that different types of networks react differently depending on the type of multiple failure.