现代车辆依靠通过控制器区域网络（CAN）巴士连接的电子控制装置（ECU）的车队进行关键的车辆控制。但是，随着汽车中高级连通性特征的扩展以及内部系统暴露的风险升高，罐头总线越来越容易受到侵入和注射攻击。普通的注射攻击破坏了CAN数据流的典型定时属性，基于规则的入侵检测系统（IDS）可以轻松检测它们。但是，高级攻击者可以将虚假数据注入到时间序列的感官数据（信号），同时通过CAN消息的模式/频率看起来无害。此类攻击可以绕过基于规则的ID或基于二进制有效载荷数据的任何基于异常的ID。为了使车辆强大地抵抗这种智能攻击，我们提出了CANSHIELD，这是一个基于信号的侵入式检测框架。 Canshield由三个模块组成：一个数据预处理模块，该模块在信号级别处理高维CAN数据流并使其适合深度学习模型；一个由多个深度自动编码器（AE）网络组成的数据分析仪模块，每个网络都从不同的时间角度分析时间序列数据；最后，使用集合方法来做出最终决定的攻击检测模块。对两个高保真信号的评估结果可以攻击数据集显示Canshield在检测高级入侵攻击方面的高精度和反应性。

车辆控制器区域网络（CAN）易于对不同层次的网络攻击影响。制造攻击是最容易管理的 - 对手只需在CAN上发送（额外）帧 - 而且最容易检测到，因为它们会破坏帧频率。为了克服基于时间的检测方法，对手必须通过发送帧来管理伪装攻击（因此在良性帧的预期时间，而是通过恶意有效载荷。研究努力已经证明可以攻击，特别是伪装攻击，可以影响车辆功能。示例包括导致意外加速，停用车辆的制动器，以及转向车辆。我们假设化妆舞会攻击修改了CAN信号时间序列和它们如何聚集在一起的细节相关性。因此，集群分配的变化应表示异常行为。我们通过利用我们以前开发的逆向工程可以信号（即CAN-D [控制器区域网络解码器]）来确认这一假设，并专注于推进通过分析从RAW CAN帧中提取的时间序列来检测伪装攻击的最新技术。具体地，我们证明可以通过使用车辆上的CAN信号（时间序列）上的分层聚类来计算时间序列聚类相似度来检测化妆舞会攻击，并将跨越群集相似性与跨越攻击进行比较。我们在先前收集的可以使用伪装攻击的数据集（即，道路数据集）中测试我们的方法，并开发法医工具作为概念证明，以证明所提出的检测方法的潜力可以弥补攻击攻击。

当今软件的复杂性日益增加，需要成千上万的开发人员的贡献。这种复杂的协作结构使开发人员更有可能引入易缺陷的更改，从而导致软件故障。确定何时引入这些缺陷的变化已被证明具有挑战性，并且使用传统的机器学习（ML）方法来做出这些决定似乎已经达到了平稳状态。在这项工作中，我们构建了由开发人员和源文件组成的贡献图，以捕获构建软件所需的更改的细微复杂性。通过利用这些贡献图，我们的研究表明了使用基于图的ML改善及时（JIT）缺陷预测的潜力。我们假设从贡献图中提取的功能可能是易缺陷变化的预测指标，而不是从软件特征中得出的固有特征。我们使用基于图的ML来证实我们的假设，以分类表示易缺陷变化的边缘。 JIT缺陷预测问题的新框架导致了更好的结果。我们在14个开源项目上测试了我们的方法，并表明我们的最佳模型可以预测代码更改是否会导致F1分数高达77.55 $ \％$的缺陷。这比JIT缺陷预测中最新的$ \％$的增加高达46.72美元。我们描述了局限性，开放挑战以及该方法如何用于操作JIT缺陷预测。

虽然在现代车辆中无处不在，但控制器区域网络（罐）缺乏基本的安全性，并且很容易利用。已经出现了一种快速增长的能够安全研究领域，寻求检测罐头的入侵。由于大多数研究人员需要昂贵的资产和专业知识，因此生产车辆的数据与各种入侵的数据遥不可及。为协助研究人员，我们向现有开放的第一个全面指南介绍了现有的可入侵数据集，包括每个数据集的质量分析以及每个人的好处，缺点和建议用例的列举。目前的公众可以IDS数据集仅限于实际制造（简单的消息注入）攻击和模拟攻击通常在合成数据中，缺乏保真度。通常，在可用的数据集中不验证攻击车辆对车辆的物理效果。只有一个数据集提供信号翻译数据，但不是相应的原始二进制版本。总的来说，可用的数据鸽子孔可以IDS在有限的有限情况下重新测试，通常是不恰当的数据（通常具有太容易检测到真正测试该方法的攻击），并且这种缺乏数据具有延迟的可比性和再现性的结果。作为我们的主要贡献，我们介绍了道路（真正的ORNL汽车测力计）可以入侵数据集，包括超过3.5小时的一辆车辆的数据。道路含有在各种活动中记录的环境数据，以及随着多种变体和实际模糊，制造和独特的先进攻击以及模拟化妆舞会攻击的攻击。为了便于基准测试可以IDS方法需要信号翻译的输入，我们还提供了许多可以捕获的信号时间序列格式。我们的贡献旨在促进CAN IDS领域的适当基准和所需的可比性。

Efficient and robust control using spiking neural networks (SNNs) is still an open problem. Whilst behaviour of biological agents is produced through sparse and irregular spiking patterns, which provide both robust and efficient control, the activity patterns in most artificial spiking neural networks used for control are dense and regular -- resulting in potentially less efficient codes. Additionally, for most existing control solutions network training or optimization is necessary, even for fully identified systems, complicating their implementation in on-chip low-power solutions. The neuroscience theory of Spike Coding Networks (SCNs) offers a fully analytical solution for implementing dynamical systems in recurrent spiking neural networks -- while maintaining irregular, sparse, and robust spiking activity -- but it's not clear how to directly apply it to control problems. Here, we extend SCN theory by incorporating closed-form optimal estimation and control. The resulting networks work as a spiking equivalent of a linear-quadratic-Gaussian controller. We demonstrate robust spiking control of simulated spring-mass-damper and cart-pole systems, in the face of several perturbations, including input- and system-noise, system disturbances, and neural silencing. As our approach does not need learning or optimization, it offers opportunities for deploying fast and efficient task-specific on-chip spiking controllers with biologically realistic activity.

Algorithms that involve both forecasting and optimization are at the core of solutions to many difficult real-world problems, such as in supply chains (inventory optimization), traffic, and in the transition towards carbon-free energy generation in battery/load/production scheduling in sustainable energy systems. Typically, in these scenarios we want to solve an optimization problem that depends on unknown future values, which therefore need to be forecast. As both forecasting and optimization are difficult problems in their own right, relatively few research has been done in this area. This paper presents the findings of the ``IEEE-CIS Technical Challenge on Predict+Optimize for Renewable Energy Scheduling," held in 2021. We present a comparison and evaluation of the seven highest-ranked solutions in the competition, to provide researchers with a benchmark problem and to establish the state of the art for this benchmark, with the aim to foster and facilitate research in this area. The competition used data from the Monash Microgrid, as well as weather data and energy market data. It then focused on two main challenges: forecasting renewable energy production and demand, and obtaining an optimal schedule for the activities (lectures) and on-site batteries that lead to the lowest cost of energy. The most accurate forecasts were obtained by gradient-boosted tree and random forest models, and optimization was mostly performed using mixed integer linear and quadratic programming. The winning method predicted different scenarios and optimized over all scenarios jointly using a sample average approximation method.

A reduced order model of a generic submarine is presented. Computational fluid dynamics (CFD) results are used to create and validate a model that includes depth dependence and the effect of waves on the craft. The model and the procedure to obtain its coefficients are discussed, and examples of the data used to obtain the model coefficients are presented. An example of operation following a complex path is presented and results from the reduced order model are compared to those from an equivalent CFD calculation. The controller implemented to complete these maneuvers is also presented.

Neural machine translation (NMT) has become the de-facto standard in real-world machine translation applications. However, NMT models can unpredictably produce severely pathological translations, known as hallucinations, that seriously undermine user trust. It becomes thus crucial to implement effective preventive strategies to guarantee their proper functioning. In this paper, we address the problem of hallucination detection in NMT by following a simple intuition: as hallucinations are detached from the source content, they exhibit encoder-decoder attention patterns that are statistically different from those of good quality translations. We frame this problem with an optimal transport formulation and propose a fully unsupervised, plug-in detector that can be used with any attention-based NMT model. Experimental results show that our detector not only outperforms all previous model-based detectors, but is also competitive with detectors that employ large models trained on millions of samples.

As more and more conversational and translation systems are deployed in production, it is essential to implement and to develop effective control mechanisms guaranteeing their proper functioning and security. An essential component to ensure safe system behavior is out-of-distribution (OOD) detection, which aims at detecting whether an input sample is statistically far from the training distribution. Although OOD detection is a widely covered topic in classification tasks, it has received much less attention in text generation. This paper addresses the problem of OOD detection for machine translation and dialog generation from an operational perspective. Our contributions include: (i) RAINPROOF a Relative informAItioN Projection ODD detection framework; and (ii) a more operational evaluation setting for OOD detection. Surprisingly, we find that OOD detection is not necessarily aligned with task-specific measures. The OOD detector may filter out samples that are well processed by the model and keep samples that are not, leading to weaker performance. Our results show that RAINPROOF breaks this curse and achieve good results in OOD detection while increasing performance.

Variance parameter estimation in linear mixed models is a challenge for many classical nonlinear optimization algorithms due to the positive-definiteness constraint of the random effects covariance matrix. We take a completely novel view on parameter estimation in linear mixed models by exploiting the intrinsic geometry of the parameter space. We formulate the problem of residual maximum likelihood estimation as an optimization problem on a Riemannian manifold. Based on the introduced formulation, we give geometric higher-order information on the problem via the Riemannian gradient and the Riemannian Hessian. Based on that, we test our approach with Riemannian optimization algorithms numerically. Our approach yields a higher quality of the variance parameter estimates compared to existing approaches.