获得每拍信息是对心心电图（ECG）分析的关键任务，因为许多下游诊断任务取决于基于ECG的测量。然而，这些测量成本高昂地生产，特别是在整个长时间变化的记录中。但是，对于ECG描绘的现有注释数据库很小，尺寸不足，并且在它们所代表的病理条件阵列中。本文揭示了两个主要贡献。首先，基于伪造数据生成算法，基于概率论构成基本段的“池”，从原始数据库裁剪，以及将其布置成相干合成迹线的一组规则。通过对生成的轨迹施加专家知识来控制条件的产生，这增加了培训模型的输入变异性。其次，已经开发了两种新的基于分段的损耗功能，该损耗函数已经尝试通过专注于减少的样品来强制执行精确的独立结构的预测和产生更近的分段边界。最佳表演模型获得了$ f_1 $-score为99.38 \％，删除误差为2.19美元17.73 $ ms和4.45美元的$ 4.45 \ pm为所有Wave的信托（分别）（分别是持续的），如P的平均值，QRS和T波为三个不同可自由的数据库。尽管测试数据库的异质特性，但在铅配置（Holter，12-ex），采样频率（250美元，500美元和2,000美元）和代表的病理物理学（例如，不同类型的心律失常（例如，不同类型的心律失常）方面，所以获得了优异的结果。 ，窦性心律具有结构性心脏病，暗示在其泛化能力，同时优于现有最先进的划分方法。

Optimal Power Flow (OPF) is a very traditional research area within the power systems field that seeks for the optimal operation point of electric power plants, and which needs to be solved every few minutes in real-world scenarios. However, due to the nonconvexities that arise in power generation systems, there is not yet a fast, robust solution technique for the full Alternating Current Optimal Power Flow (ACOPF). In the last decades, power grids have evolved into a typical dynamic, non-linear and large-scale control system, known as the power system, so searching for better and faster ACOPF solutions is becoming crucial. Appearance of Graph Neural Networks (GNN) has allowed the natural use of Machine Learning (ML) algorithms on graph data, such as power networks. On the other hand, Deep Reinforcement Learning (DRL) is known for its powerful capability to solve complex decision-making problems. Although solutions that use these two methods separately are beginning to appear in the literature, none has yet combined the advantages of both. We propose a novel architecture based on the Proximal Policy Optimization algorithm with Graph Neural Networks to solve the Optimal Power Flow. The objective is to design an architecture that learns how to solve the optimization problem and that is at the same time able to generalize to unseen scenarios. We compare our solution with the DCOPF in terms of cost after having trained our DRL agent on IEEE 30 bus system and then computing the OPF on that base network with topology changes

Event cameras are novel bio-inspired sensors that offer advantages over traditional cameras (low latency, high dynamic range, low power, etc.). Optical flow estimation methods that work on packets of events trade off speed for accuracy, while event-by-event (incremental) methods have strong assumptions and have not been tested on common benchmarks that quantify progress in the field. Towards applications on resource-constrained devices, it is important to develop optical flow algorithms that are fast, light-weight and accurate. This work leverages insights from neuroscience, and proposes a novel optical flow estimation scheme based on triplet matching. The experiments on publicly available benchmarks demonstrate its capability to handle complex scenes with comparable results as prior packet-based algorithms. In addition, the proposed method achieves the fastest execution time (> 10 kHz) on standard CPUs as it requires only three events in estimation. We hope that our research opens the door to real-time, incremental motion estimation methods and applications in real-world scenarios.

Neural Radiance Fields (NeRFs) are emerging as a ubiquitous scene representation that allows for novel view synthesis. Increasingly, NeRFs will be shareable with other people. Before sharing a NeRF, though, it might be desirable to remove personal information or unsightly objects. Such removal is not easily achieved with the current NeRF editing frameworks. We propose a framework to remove objects from a NeRF representation created from an RGB-D sequence. Our NeRF inpainting method leverages recent work in 2D image inpainting and is guided by a user-provided mask. Our algorithm is underpinned by a confidence based view selection procedure. It chooses which of the individual 2D inpainted images to use in the creation of the NeRF, so that the resulting inpainted NeRF is 3D consistent. We show that our method for NeRF editing is effective for synthesizing plausible inpaintings in a multi-view coherent manner. We validate our approach using a new and still-challenging dataset for the task of NeRF inpainting.

Event cameras are emerging vision sensors and their advantages are suitable for various applications such as autonomous robots. Contrast maximization (CMax), which provides state-of-the-art accuracy on motion estimation using events, may suffer from an overfitting problem called event collapse. Prior works are computationally expensive or cannot alleviate the overfitting, which undermines the benefits of the CMax framework. We propose a novel, computationally efficient regularizer based on geometric principles to mitigate event collapse. The experiments show that the proposed regularizer achieves state-of-the-art accuracy results, while its reduced computational complexity makes it two to four times faster than previous approaches. To the best of our knowledge, our regularizer is the only effective solution for event collapse without trading off runtime. We hope our work opens the door for future applications that unlocks the advantages of event cameras.

Deep Reinforcement Learning (RL) agents are susceptible to adversarial noise in their observations that can mislead their policies and decrease their performance. However, an adversary may be interested not only in decreasing the reward, but also in modifying specific temporal logic properties of the policy. This paper presents a metric that measures the exact impact of adversarial attacks against such properties. We use this metric to craft optimal adversarial attacks. Furthermore, we introduce a model checking method that allows us to verify the robustness of RL policies against adversarial attacks. Our empirical analysis confirms (1) the quality of our metric to craft adversarial attacks against temporal logic properties, and (2) that we are able to concisely assess a system's robustness against attacks.

成功培训端到端的深网进行真实运动去缩合，需要尖锐/模糊的图像对数据集，这些数据集现实且多样化，足以实现概括以实现真实的图像。获得此类数据集仍然是一项具有挑战性的任务。在本文中，我们首先回顾了现有的Deblurring基准数据集的局限性，从泛化到野外模糊图像的角度。其次，我们提出了一种有效的程序方法，以基于一个简单而有效的图像形成模型来生成清晰/模糊的图像对。这允许生成几乎无限的现实和多样化的培训对。我们通过在模拟对上训练现有的DeBlurring架构，并在四个真实模糊图像的标准数据集中对其进行评估，从而证明了所提出的数据集的有效性。我们观察到使用建议方法训练时动态场景的真实运动毛线照片的最终任务的出色概括性能。

本文研究了黑盒安全测试配置中基于方案的安全测试算法。对于与不同采样分布共享相同州行动集覆盖的算法，通常认为优先考虑探索高风险状态现象会提高采样效率。我们的提案通过引入不可能的定理来对上述直觉提出异议，该定理可证明显示上述差异的所有安全测试算法，同样具有相同的预期采样效率。此外，对于涵盖不同状态活动集的测试算法，采样效率标准不再适用，因为不同的算法不一定会收敛到相同的终止条件。然后，我们提出了基于几乎安全集合概念的测试攻击性定义，以及一种无偏和有效的算法，比较了测试算法之间的侵略性。还提出了来自两足球运动控制器和车辆决策模块的安全测试的经验观察，以支持提出的理论意义和方法。

本文介绍了Cool-MC，这是一种集成了最先进的加固学习（RL）和模型检查的工具。具体而言，该工具建立在OpenAI健身房和概率模型检查器风暴上。COOL-MC提供以下功能：（1）模拟器在OpenAI体育馆训练RL政策，用于Markov决策过程（MDPS），这些模拟器定义为暴风雨的输入，（2）使用“ SORM”的新型号构建器，用于使用回调功能要验证（神经网络）RL策略，（3）与OpenAI Gym或Storm中指定的模型和政策相关的正式抽象，以及（4）算法以获得有关所谓允许政策的性能的界限。我们描述了Cool-MC的组件和体系结构，并在多个基准环境中演示了其功能。

对于诸如搜索和救援之类的苛刻情况下，人形生物的部署，高度智能的决策和熟练的感觉运动技能。一个有前途的解决方案是通过远程操作通过互连机器人和人类来利用人类的实力。为了创建无缝的操作，本文提出了一个动态的远程组分框架，该框架将人类飞行员的步态与双皮亚机器人的步行同步。首先，我们介绍了一种方法，以从人类飞行员的垫脚行为中生成虚拟人类步行模型，该模型是机器人行走的参考。其次，步行参考和机器人行走的动力学通过向人类飞行员和机器人施加力来同步，以实现两个系统之间的动态相似性。这使得人类飞行员能够不断感知并取消步行参考和机器人之间的任何异步。得出机器人的一致步骤放置策略是通过步骤过渡来维持动态相似性的。使用我们的人机界面，我们证明了人类飞行员可以通过地位，步行和干扰拒绝实验实现模拟机器人的稳定和同步近距离运行。这项工作为将人类智力和反射转移到人形机器人方面提供了基本的一步。