不平衡数据的集成分类算法综述

集成学习是通过集成多个基分类器共同决策的机器学习技术,通过不同的样本集训练有差异的基分类器,得到的集成分类器可以有效地提高学习效果。在基分类器的训练过程中,可以通过代价敏感技术和数据采样实现不平衡数据的处理。由于集成学习在不平衡数据分类的优势,针对不平衡数据的集成分类算法得到广泛研究。详细分析了不平衡数据集成分类算法的研究现状,比较了现有算法的差异和各自存在的优点及问题,提出和分析了有待进一步研究的问题。     

基于FPGA的CCD低噪声测量系统设计

为了提高电荷耦合器件(CCD)一维尺度无接触测量系统的精度和集成度,设计了以现场可编程门阵列(FPGA)器件为核心的测量系统。对CCD输出信号进行低通滤波和相关双采样技术处理,降低了CCD信号噪声。模拟信号转换为12位数字信号后,传输至FPGA内嵌的FIFO中,提高了系统的集成度和稳定性。使用Verilog HDL语言对驱动时序发生器进行了硬件描述,并通过夫琅禾费单缝衍射实验来验证系统的可靠性和精度,实验表明:该系统稳定,精度达到0.82%。     

新一代水管式沉降仪控制模块的研制

新一代低功耗水管式沉降仪控制模块是基于16单片机MSP430F5436为处理器的低功耗装置.该文详细介绍了其硬件结构和工作原理,分别从电源系统、电磁阀控制电路、控制流程、数据采集等部分阐述了其特点,诠释了水管式沉降仪控制模块在人机交互、工作稳定性等多方面所具备的优势.新一代水管式沉降仪控制模块已在实际工程中得到了成功应用,其稳定性和精确性为大坝监控系统提供了准确的实时数据.     

Downscaling of the flood discharge in a probabilistic framework

Many modeled and observed data are in coarse resolution, which are required to be downscaled. This study develops a probabilistic method to downscale 3-hourly runoff to hourly resolution. Hourly data recorded at the Poldokhtar Stream gauge (Karkheh River basin, Iran) during flood events (2009–2019) are divided into two groups including calibration and validation. Statistical tests including Chi-Square and Kolmogorov–Smirnov test indicate that the Burr distribution is proper distribution functions for rising and falling limbs of the floods’ hydrograph in calibration (2009–2013). A conditional ascending/descending random sampling from the constructed distributions on rising/falling limb is applied to produce hourly runoff. The hourly-downscaled runoff is rescaled based on observation to adjust mean three-hourly data. To evaluate the efficiency of the developed method, statistical measures including root mean square error, Nash–Sutcliffe efficiency, Kolmogorov-Smirnov, and correlation are used to assess the performance of the downscaling method not only in calibration but also in validation (2014–2019). Results show that the hourly downscaled runoff is in close agreement with observations in both calibration and validation periods. In addition, cumulative distribution functions of the downscaled runoff closely follow the observed ones in rising and falling limb in two periods. Although the performance of many statistical downscaling methods decreases in extreme values, the developed model performs well at different quantiles (less and more frequent values). This developed method that can properly downscale other hydroclimatological variables at any time and location is useful to provide high-resolution inputs to drive other models. Furthermore, high-resolution data are required for valid and reliable analysis, risk assessment, and management plans.     

Performance evaluation of an importance sampling technique in a Jackson network

Importance sampling is a technique that is commonly used to speed up Monte Carlo simulation of rare events. However, little is known regarding the design of efficient importance sampling algorithms in the context of queueing networks. The standard approach, which simulates the system using an a priori fixed change of measure suggested by large deviation analysis, has been shown to fail in even the simplest network settings. Estimating probabilities associated with rare events has been a topic of great importance in queueing theory, and in applied probability at large. In this article, we analyse the performance of an importance sampling estimator for a rare event probability in a Jackson network. This article carries out strict deadlines to a two-node Jackson network with feedback whose arrival and service rates are modulated by an exogenous finite state Markov process. We have estimated the probability of network blocking for various sets of parameters, and also the probability of missing the deadline of customers for different loads and deadlines. We have finally shown that the probability of total population overflow may be affected by various deadline values, service rates and arrival rates.     

Explicit solution of relative entropy weighted control

We consider the minimization over probability measures of the expected value of a random variable, regularized by relative entropy with respect to a given probability distribution. In the general setting we provide a complete characterization of the situations in which a finite optimal value exists and the situations in which a minimizing probability distribution exists. Specializing to the case where the underlying probability distribution is Wiener measure, we characterize finite relative entropy changes of measure in terms of square integrability of the corresponding change of drift. For the optimal change of measure for the relative entropy weighted optimization, an expression involving the Malliavin derivative of the cost random variable is derived. The theory is illustrated by its application to several examples, including the case where the cost variable is the maximum of a standard Brownian motion over a finite time horizon. For this example we obtain an exact optimal drift, as well as an approximation of the optimal drift through a Monte-Carlo algorithm.     

A comprehensive evaluation of various sensitivity analysis methods: A case study with a hydrological model

Sensitivity analysis (SA) is a commonly used approach for identifying important parameters that dominate model behaviors. We use a newly developed software package, a Problem Solving environment for Uncertainty Analysis and Design Exploration (PSUADE), to evaluate the effectiveness and efficiency of ten widely used SA methods, including seven qualitative and three quantitative ones. All SA methods are tested using a variety of sampling techniques to screen out the most sensitive (i.e., important) parameters from the insensitive ones. The Sacramento Soil Moisture Accounting (SAC-SMA) model, which has thirteen tunable parameters, is used for illustration. The South Branch Potomac River basin near Springfield, West Virginia in the U.S. is chosen as the study area. The key findings from this study are: (1) For qualitative SA methods, Correlation Analysis (CA), Regression Analysis (RA), and Gaussian Process (GP) screening methods are shown to be not effective in this example. Morris One-At-a-Time (MOAT) screening is the most efficient, needing only 280 samples to identify the most important parameters, but it is the least robust method. Multivariate Adaptive Regression Splines (MARS), Delta Test (DT) and Sum-Of-Trees (SOT) screening methods need about 400–600 samples for the same purpose. Monte Carlo (MC), Orthogonal Array (OA) and Orthogonal Array based Latin Hypercube (OALH) are appropriate sampling techniques for them; (2) For quantitative SA methods, at least 2777 samples are needed for Fourier Amplitude Sensitivity Test (FAST) to identity parameter main effect. McKay method needs about 360 samples to evaluate the main effect, more than 1000 samples to assess the two-way interaction effect. OALH and LP_τ (LPTAU) sampling techniques are more appropriate for McKay method. For the Sobol' method, the minimum samples needed are 1050 to compute the first-order and total sensitivity indices correctly. These comparisons show that qualitative SA methods are more efficient but less accurate and robust than quantitative ones.     

Decentralized control: Status and outlook

This paper reviews state of the art in the area of decentralized networked control systems with an emphasis on event-triggered approach. The models or agents with the dynamics of linear continuous-time time-invariant state-space systems are considered. They serve for the framework for network phenomena within two basic structures. The I/O-oriented systems as well as the interaction-oriented systems with disjoint subsystems are distinguished. The focus is laid on the presentation of recent decentralized control design and co-design methods which offer effective tools to overcome specific difficulties caused mainly by network imperfections. Such side-effects include communication constraints, variable sampling, time-varying transmission delays, packet dropouts, and quantizations. Decentralized time-triggered methods are briefly discussed. The review is deals mainly with decentralized event-triggered methods. Particularly, the stabilizing controller–observer event-based controller design as well as the decentralized state controller co-design are presented within the I/O-oriented structures of large scale complex systems. The sampling instants depend in this case only on a local information offered by the local feedback loops. Minimum sampling time conditions are discussed. Special attention is focused on interaction-oriented system architecture. Model-based approach combined with event-based state feedback controller design is presented, where the event thresholds are fully decentralized. Finally, several selected open decentralized control problems are briefly offered as recent research challenges.     

高速网络流量测量方法

高速网络流量测量是目前实施实时准确地监测、管理和控制网络的基础.基于网络流量测量的应用,将网络流量测量分为抽样方法和数据流方法.从不同的层次,将抽样方法分为分组抽样和流抽样,分别介绍了两类抽样方法;从测度角度介绍了数据流方法.详细介绍了高速网络流量测量的常用数据结构,以及抽样、数据流方法在高速网络流量测量中的应用,比较了各种方法的优劣.概述了高速网络流量测量技术的研究进展.最后,就现有的网络流量测量方法的不足,对网络流量测量的发展趋势和进一步的研究方向进行了讨论.     

具有随机采样特性的网络化系统H∞ 滤波

研究一类具有随机采样特性的网络化系统H∞滤波问题.通过将传感器的随机采样过程建模成马尔可夫链,将数据量化作用转化为模型的参数不确定性,并用二值随机变量描述丢包过程,从而用一个多随机变量的马尔可夫不确定性模型来描述滤波误差系统.应用Lyapunov稳定性理论和随机系统分析方法,导出了滤波误差系统随机稳定且具有给定H∞性能的充分条件,并给出了滤波器的设计方法.仿真结果验证了所提出方法的有效性.