Convergence analysis of the alternating RGLS algorithm for the identification of the reduced complexity Volterra model

In this paper we provide a convergence analysis of the alternating RGLS (Recursive Generalized Least Square) algorithm used for the identification of the reduced complexity Volterra model describing stochastic non-linear systems. The reduced Volterra model used is the 3rd order SVD-PARAFC-Volterra model provided using the Singular Value Decomposition (SVD) and the Parallel Factor (PARAFAC) tensor decomposition of the quadratic and the cubic kernels respectively of the classical Volterra model. The Alternating RGLS (ARGLS) algorithm consists on the execution of the classical RGLS algorithm in alternating way. The ARGLS convergence was proved using the Ordinary Differential Equation (ODE) method. It is noted that the algorithm convergence canno׳t be ensured when the disturbance acting on the system to be identified has specific features. The ARGLS algorithm is tested in simulations on a numerical example by satisfying the determined convergence conditions. To raise the elegies of the proposed algorithm, we proceed to its comparison with the classical Alternating Recursive Least Squares (ARLS) presented in the literature. The comparison has been built on a non-linear satellite channel and a benchmark system CSTR (Continuous Stirred Tank Reactor). Moreover the efficiency of the proposed identification approach is proved on an experimental Communicating Two Tank system (CTTS).     

Assumptions and Consequences of Treating Providers in Therapy Studies as Fixed Versus Random Effects: Reply to Crits-Christoph, Tu, and Gallop (2003) and Serlin, Wampold, and Levin (2003).

In their comments on the authors' article (see record 2003-10163-009), R. C. Serlin, B. E. Wampold, and J. R. Levin (see record 2003-10163-011) and P. Crits-Christoph, X. Tu, and R. Gallop (see record 2003-10163-010) took issue with the authors' suggestion to evaluate therapy studies with nested providers with a fixed model approach. In this rejoinder, the authors' comment on Serlin et al's critique by showing that their arguments do not apply, are based on misconceptions about the purpose and nature of statistical inference, or are based on flawed reasoning. The authors also comment on Crits-Christoph et al's critique by showing that the proposed approach is very similar to, but less inclusive than, their own suggestion. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

EIGENVECTORS-BASED PARALLELISATION OF NESTED LOOPS WITH AFFINE DEPENDENCES

Abstract

This paper presents a method for parallelising nested loops with affine dependences. The data dependences of a program are represented exactly using a dependence matrix rather than an imprecise dependence abstraction. By a careful analysis of the eigenvectors and eigenvalues of the dependence matrix, we detect the parallelism inherent in the program, partition the iteration space of the program into sequential and parallel regions, and generate parallel code to execute these regions. For a class of programs considered in the paper, the proposed method can expose more coarse-grain and fine-grain parallelism than a hyperplane-based loop transformation.     

一种基于区分服务的嵌套队列调度算法

现有队列调度算法只能满足某一种特定类型业务流量的服务质量(QoS)需求,无法广泛支持多种类型业务流量。为此,提出一种基于区分服务的嵌套队列调度算法。将现有队列调度算法通过嵌套模型进行组合,并根据该嵌套模型进行队列调度,从而为多种类型业务流量提供均衡的QoS保障。仿真结果表明,该算法能够满足不同类型业务流量的QoS需求,其各项性能指标所达效果与最优效果的差距较小,并且在多种类型业务流量的支持方面比现有队列调度算法表现更好。     

On Hypotheses Testing for the Selection of Spatio‐Temporal Models

Abstract. Several models have been proposed in recent years for analysing spatial data and also, to some extent, spatio‐temporal data. One of the important problems, namely the choice of an appropriate model for describing real data sets, remains unsolved. Here we consider the analysis of spatio‐temporal processes from which observations over space and time are available. We propose statistical tests for discriminating between space–time autoregressive processes and multivariate autoregressive processes. The sampling properties of the proposed tests are considered. We illustrate the methods with a real example. We use the above tests to find the best model to describe spatio‐temporal variations of hourly carbon monoxide measurements at four locations in London in January 2004.     

基于特征融合与双模板嵌套更新的孪生网络跟踪算法

为提高全卷积孪生网络SiamFC在复杂场景下的识别和定位能力,提出一种基于多响应图融合与双模板嵌套更新的实时目标跟踪算法。使用深度ResNet-22替换AlexNet作为骨干网络以提升网络特征提取性能,建立强识别能力的骨干语义分支。在ResNet-22的浅层使用高分辨率特征,构造强定位能力的浅层位置分支,计算并融合两个分支响应。通过高置信度的双模板嵌套更新机制对两个分支的模板进行更新,以适应目标的外观和位置变化。在OTB2015和VOT2016数据集上的实验结果表明,与基于SiamFC、SiamDW等的目标跟踪算法相比,该算法在目标快速移动、遮挡等复杂场景下跟踪效果更稳定,并且运行速度达到34 frame/s,满足实时性要求。     

Nested relation extraction with iterative neural network

Most existing researches on relation extraction focus on binary flat relations like BornIn relation between a Person and a Location. But a large portion of objective facts described in natural language are complex, especially in professional documents in fields such as finance and biomedicine that require precise expressions. For example, “the GDP of the United States in 2018 grew 2.9% compared with 2017” describes a growth rate relation between two other relations about the economic index, which is beyond the expressive power of binary flat relations. Thus, we propose the nested relation extraction problem and formulate it as a directed acyclic graph (DAG) structure extraction problem. Then, we propose a solution using the Iterative Neural Network which extracts relations layer by layer. The proposed solution achieves 78.98 and 97.89 F1 scores on two nested relation extraction tasks, namely semantic cause-and-effect relation extraction and formula extraction. Furthermore, we observe that nested relations are usually expressed in long sentences where entities are mentioned repetitively, which makes the annotation difficult and errorprone. Hence, we extend our model to incorporate a mentioninsensitive mode that only requires annotations of relations on entity concepts (instead of exact mentions) while preserving most of its performance. Our mention-insensitive model performs better than the mention sensitive model when the random level in mention selection is higher than 0.3.     

基于同步开关预判的半桥型VSC快速电磁暂态建模方法

现代电力系统存在大量的半桥型电压源变流器,采用传统电磁暂态仿真程序对其进行大规模仿真分析时,存在耗时高、效率低的问题.以半桥子电路为开关状态判断的基本单元,通过分析其开关状态变化时二极管的续流及关断过程,得出普适于半桥型电压源变流器的同步开关预判方法.该方法可在当前时步通过逻辑判断直接得出稳定的开关状态组合,消除了迭代计算.结合同步开关快速预判方法及内节点收缩方法构建了半桥型电压源变流器的快速仿真模型,通过对比仿真,验证了快速仿真模型具有与全详细化模型相当的仿真精度,且能有效减少仿真耗时,提高仿真效率.与全详细化模型相比,针对80模块固态变压器的快速仿真模型可加速20倍.     

嵌套分割算法在随机需求车辆路径问题中的应用研究

对需求量满足二项分布的随机需求车辆路径问题进行了研究,在服务失败时采取允许部分服务的策略,并将嵌套分割算法与扫描算法相结合,给出了一种新的求解随机需求车辆路径问题的两阶段算法,数值试验验证了该算法的有效性。同时,该算法也拓展了车辆路径问题的算法空间。     

Flow shop问题的嵌套分区优化调度方法

介绍了嵌套分区算法(NP)的基本思想, 并用于求解流水作业优化调度问题. 算法用嵌套分区树来描述流水作业调度问题, 对可行域进行系统性分区, 然后集中搜索有优良解的区域. 在每一步迭代中, 算法跟踪最有希望的分区, 并结合启发式算法和邻域搜索来实现分区转移. 仿真实验表明, 该算法比单纯的启发式算法和邻域搜索有较好的寻优能力.