Detecting stable locality-aware predicates

In a large-scale locality-driven network such as in modular robotics and wireless sensor networks, knowing the state of a local area is sometimes necessary due to either interactions being local and driven by neighborhood proximity or the users being interested in the state of a certain region. We define locality-aware predicates (LAP) that aim at detecting a predicate within a specified area. We model the area of interest as the set of processes that are within a breadth-first search tree (BFST) of height k$k$ rooted at the initiator process. Although a locality-aware predicate specifies a predicate only within a local area, observing the area consistently requires considering the entire system in a consistent manner. This raises the challenge of making the complexities of the corresponding predicate detection algorithms scale-free, i.e., independent of the size of the system. Since all existing algorithms for getting a consistent view of the system require either a global snapshot of the entire system or vector clocks of the size of the system, a new solution is needed. We focus on stable LAP, which are those LAP that remain true once they become true. We propose a scale-free algorithm to detect stable LAP within a k$k$-height BFST. Our algorithm can detect both stable conjunctive LAP and stable relational LAP. In the process of designing our algorithm, we also propose the first distributed algorithm for building a BFST within an area of interest in a graph, and the first distributed algorithm for recording a consistent sub-cut within the area of interest. This paper demonstrates that LAPs are a natural fit for detecting distributed properties in large-scale distributed systems, and stable LAPs can be practically detected at low cost.     

A uniform approach for programming distributed heterogeneous computing systems

Large-scale compute clusters of heterogeneous nodes equipped with multi-core CPUs and GPUs are getting increasingly popular in the scientific community. However, such systems require a combination of different programming paradigms making application development very challenging.In this article we introduce libWater, a library-based extension of the OpenCL programming model that simplifies the development of heterogeneous distributed applications. libWater consists of a simple interface, which is a transparent abstraction of the underlying distributed architecture, offering advanced features such as inter-context and inter-node device synchronization. It provides a runtime system which tracks dependency information enforced by event synchronization to dynamically build a DAG of commands, on which we automatically apply two optimizations: collective communication pattern detection and device-host-device copy removal.We assess libWater’s performance in three compute clusters available from the Vienna Scientific Cluster, the Barcelona Supercomputing Center and the University of Innsbruck, demonstrating improved performance and scaling with different test applications and configurations.     

New software developments for quality mesh generation and optimization from biomedical imaging data

In this paper we present a new software toolkit for generating and optimizing surface and volumetric meshes from three-dimensional (3D) biomedical imaging data, targeted at image-based finite element analysis of some biomedical activities in a single material domain. Our toolkit includes a series of geometric processing algorithms including surface re-meshing and quality-guaranteed tetrahedral mesh generation and optimization. All methods described have been encapsulated into a user-friendly graphical interface for easy manipulation and informative visualization of biomedical images and mesh models. Numerous examples are presented to demonstrate the effectiveness and efficiency of the described methods and toolkit.     

A Dantzig–Wolfe decomposition algorithm for linear economic model predictive control of dynamically decoupled subsystems

This paper presents a warm-started Dantzig–Wolfe decomposition algorithm tailored to economic model predictive control of dynamically decoupled subsystems. We formulate the constrained optimal control problem solved at each sampling instant as a linear program with state space constraints, input limits, input rate limits, and soft output limits. The objective function of the linear program is related directly to the cost of operating the subsystems, and the cost of violating the soft output constraints. Simulations for large-scale economic power dispatch problems show that the proposed algorithm is significantly faster than both state-of-the-art linear programming solvers, and a structure exploiting implementation of the alternating direction method of multipliers. It is also demonstrated that the control strategy presented in this paper can be tuned using a weighted ℓ₁-regularization term. In the presence of process and measurement noise, such a regularization term is critical for achieving a well-behaved closed-loop performance.     

基于一致性的小型四旋翼机群自主编队分布式运动规划

设计一种小型四旋翼无人机群起飞后自主形成正多边形编队的分布式运动规划方法.在四旋翼无人机的串级控制系统框架下,分布式编队控制器以简化agent模型为基础,同时采用平均一致性算法和有领导一致性算法,共同产生各无人机位置与偏航角的期望轨迹.讨论了达成最终协调目标队形的拓扑条件,并给出一种基于有向Hamilton环的通信拓扑设计方案.最后通过数值仿真验证了所提出算法的有效性.     

硬约束限制的情感文本生成方法研究

预训练语言模型在情感文本的生成任务中取得了良好效果,但现有情感文本生成方法多使用软约束的方式控制文本整体的情感属性,缺乏单词和短语级别的硬性控制。为解决以上问题,提出硬约束限制下的情感文本生成方法。首先使用方面情感分析技术提取句子的方面词、情感词并判断情感极性;之后,选择目标情感的方面词和情感词作为预训练语言模型的硬约束输入来重建完整句子,其中,设计了一种新的单词权重计算方法,旨在使模型优先生成重要单词。实验结果表明,该方法生成的句子不仅具有方面级情感,在文本质量和多样性的评价指标上也有显著提高。     

基于BPNN-PID的风电机组桨距控制分析

变桨控制技术是风力发电机组的核心技术之一,开展对风力发电机组变桨控制方面的研究具有重要的理论和应用价值。根据风力发电机组在额定风速以上如何保持输出功率稳定和降低风轮转速波动的控制技术进行研究,在传统的变桨距控制策略基础上,提出了基于BP神经网络(Neural Network,NN)整定PID的控制策略,并在Matlab/simulink环境下对PID控制和BP神经网络控制相结合的复合控制系统进行建模与分析。对1.5MW风电机组的仿真验证了BPNN-PID算法的有效性,提出算法不仅能够解决传统PID控制器参数整定困难的问题,而且优化效率更高,可以得到优良的控制性能。     

氢化物发生的机理及其在原子光谱中的应用

详细介绍了氢化物发生的反应体系和氢化反应的两种机理,并讨论了氢化物发生法在原子光谱中的应用现状和发展趋势。     

Ellipsoidal neighbourhood outlier factor for distributed anomaly detection in resource constrained networks

Anomaly detection in resource constrained wireless networks is an important challenge for tasks such as intrusion detection, quality assurance and event monitoring applications. The challenge is to detect these interesting events or anomalies in a timely manner, while minimising energy consumption in the network. We propose a distributed anomaly detection architecture, which uses multiple hyperellipsoidal clusters to model the data at each sensor node, and identify global and local anomalies in the network. In particular, a novel anomaly scoring method is proposed to provide a score for each hyperellipsoidal model, based on how remote the ellipsoid is relative to their neighbours. We demonstrate using several synthetic and real datasets that our proposed scheme achieves a higher detection performance with a significant reduction in communication overhead in the network compared to centralised and existing schemes.