Performance comparison of reduced models for leak detection in water distribution networks

This paper presents a methodology for comparing the performance of model-reduction strategies to be used with a diagnostic methodology for leak detection in water distribution networks. The goal is to find reduction strategies that are suitable for error-domain model falsification, a model based data interpretation methodology. Twelve reduction strategies are derived from five strategy categories. Categories differ according to the manner in which nodes are selected for deletion. A node is selected for deletion according to: (1) the diameter of the pipes; (2) the number of pipes linked to a node; (3) the angle of the pipes in the case of two-pipe nodes; (4) the distribution of the water demand; and, (5) a pair-wise combination of some categories.The methodology is illustrated using part of a real network. Performance is evaluated first by judging the equivalency of the reduced network with the initial network (before the application of any reduction procedure) and secondly, by assessing the compatibility with the diagnostic methodology. The results show that for each reduction strategy the equivalency of networks is verified. Computational time can be reduced to less than 20% of the non-reduced network in the best case. Results of diagnostic performance show that the performance decreases when using reduced networks. The reduction strategy with the best diagnostic performance is that based on the angle of two-pipe nodes, with an angle threshold of 165°. In addition, the sensitivity of the performance of the reduced networks to variation in leak intensity is evaluated. Results show that the reduction strategies where the number of nodes is significantly reduced are the most sensitive.Finally this paper describes a Pareto analysis that is used to select the reduction strategy that is a good compromise between reduction of computational time and performance of the diagnosis. In this context, the extension strategy is the most attractive.     

On input‐to‐state stability‐based design for leader/follower formation control with measurement delays

This paper addresses the design of low‐level controllers for leader–follower formations of nonholonomic vehicles in the presence of bounded measurement delays. The concept of input‐to‐state stability is extended to encompass the effect of bounded delays and restrictions on the input. A method is proposed to integrate a Smith predictor in a backstepping design on the basis of nested saturations and nonlinear small‐gain assignment, which allows for time delays in the feedback loop. Robustness analysis under uncertain bounded time delays is provided, and design tradeoffs resulting from the use of bounded controls are discussed. Illustrative simulations are shown to validate the design and robustness analysis in the context of a simple leader–follower trailing control problem. Copyright © 2012 John Wiley & Sons, Ltd.     

Stabilization of One‐Dimensional Schrödinger Equation with Variable Coefficient under Delayed Boundary Output Feedback

This article considers stabilization of a one‐dimensional Schrödinger equation with variable coefficient and boundary observation which suffers from an arbitrary given time delay. We design an observer and predictor to stabilize the system. The state is estimated in the time span where the observation is available, and also predicted in the time interval where the observation is not available. It is shown that the estimated state feedback stabilizes the system exponentially. A numerical simulation is presented to illustrate the effect of the stabilizing controller.     

Bounded Consensus Algorithms for Multi‐Agent Systems in Directed Networks

In this paper, the consensus problem is investigated via bounded controls for the multi‐agent systems with or without communication. Based on the nested saturation method, the saturated control laws are designed to solve the consensus problem. Under the designed saturated control laws, the transient performance of the closed‐loop system can be improved by tuning the saturation level. First of all, asymptotical consensus algorithms with bounded control inputs are proposed for the multi‐agent systems with or without communication delays. Under these consensus algorithms, the states’ consensus can be achieved asymptotically. Then, based on a kind of novel nonlinear saturation functions, bounded finite‐time consensus algorithms are further developed. It is shown that the states’ consensus can be achieved in finite time. Finally, two examples are given to verify the efficiency of the proposed methods.     

Quantized H∞ Control for Networked Systems with Communication Constraints

The problem of quantized H_∞ control for networked control systems (NCSs) subject to time‐varying delay and multiple packet dropouts is investigated in this paper. Both the control input and the measurement output signals are quantized before being transmitted and the quantized errors are described as sector bound uncertainties. The measurement channel and the control channel packet dropouts are considered simultaneously, and the stochastic variables satisfying Bernoulli random binary distribution are utilized to model the random multiple packet dropouts. Sufficient conditions for the existence of an observer‐based controller are established to ensure the exponential mean‐square stablility of the closed‐loop system and achieve the optimal H_∞ disturbance attenuation level. By using a globally convergent algorithm involving convex optimization, the nonconvex feasibility can be solved successfully. Finally, a numerical example is given to illustrate the effectiveness and applicability of the proposed method.     

核电站数字化反应堆保护系统停堆响应时间分析

为了评价出核电站数字化反应堆保护系统停堆响应的最大时间,根据数字化反应堆保护系统结构,分析出保护系统的响应过程须经过AI输入、IO总线通讯、CPU运算、网络通讯、DO输出处理。并基于DCS定周期扫描的运行方式,得出了各处理过程所需最大响应时间的计算方法,DCS停堆响应时间的评价值就是各部分最大响应时间的累加。最后提出了可缩短响应时间的改进方法。     

LED PWM dimming linearity investigation

LED PWM dimming application for large scale LED video displays is analyzed. The need for short light pulse duration is outlined. PWM dimming with short driving pulses is investigated experimentally. The LED response time skew introduces the nonlinearity for PWM dimming. For LED response time skew estimation, a method is suggested that has been successfully applied to measure some of today’s market representative LEDs. PWM dimming nonlinearity can be forecasted using the estimated skew. For a particular driving configuration, it is indicated that LED PWM dimming fails to satisfy the required 14 bit output coding together with the image refresh frequency of 400 Hz. A rough investigation demonstrates that the skew is quite stable. Therefore, the nonlinearity correction for the PWM pulse durations shorter than the skew value should be possible.     

Expected runtimes of evolutionary algorithms for the Eulerian cycle problem

Evolutionary algorithms are randomized search heuristics, which are applied to problems whose structure is not well understood, as well as to problems in combinatorial optimization. They have successfully been applied to different kinds of arc routing problems. To start the analysis of evolutionary algorithms with respect to the expected optimization time on these problems, we consider the Eulerian cycle problem. We show that a variant of the well-known (1+1)$(1+1)$ EA working on the important encoding of permutations is able to find an Eulerian tour of an Eulerian graph in expected polynomial time. Altering the operator used for mutation in the considered algorithm, the expected optimization time changes from polynomial to exponential.     

时间序列季节调整方法在中国的发展:PBC版X-12-ARIMA

中国人民银行(PBc)版X-12-ARIMA软件是基于中国特点而定制的时间序列季节调整软件.通过总结时间序列季节调整方法的特点以及相应软件在国外的发展,针对我国应用的特点,尤其是春节因素的考虑,在解剖X-12-ARIMA方法原理的基础上,在春节因素计算方法、软件应用界面以及用户使用帮助等3个主要方面加以改进,具有数据导入、调整设置文件、运行方式以及结果输出4方面的特色.     

A data collection protocol for real-time sensor applications

The nature of many sensor applications as well as continuously changing sensor data often imposes real-time requirements on wireless sensor network protocols. Due to numerous design constraints, such as limited bandwidth, memory and energy of sensor platforms, and packet collisions that can potentially lead to an unbounded number of retransmissions, timeliness techniques designed for real-time systems and real-time databases cannot be applied directly to wireless sensor networks. Our objective is to design a protocol for sensor applications that require periodic collection of raw data reports from the entire network in a timely manner. We formulate the problem as a graph coloring problem. We then present TIGRA (Timely Sensor Data Collection using Distributed Graph Coloring) — a distributed heuristic for graph coloring that takes into account application semantics and special characteristics of sensor networks. TIGRA ensures that no interference occurs and spatial channel reuse is maximized by assigning a specific time slot for each node. Although the end-to-end delay incurred by sensor data collection largely depends on a specific topology, platform, and application, TIGRA provides a transmission schedule that guarantees a deterministic delay on sensor data collection.