The findable, accessible, interoperable, and reusable (FAIR) data principles have provided a framework for examining, evaluating, and improving how we share data with the aim of facilitating scientific discovery. Efforts have been made to generalize these principles to research software and other digital products. Artificial intelligence (AI) models -- algorithms that have been trained on data rather than explicitly programmed -- are an important target for this because of the ever-increasing pace with which AI is transforming scientific and engineering domains. In this paper, we propose a practical definition of FAIR principles for AI models and create a FAIR AI project template that promotes adherence to these principles. We demonstrate how to implement these principles using a concrete example from experimental high energy physics: a graph neural network for identifying Higgs bosons decaying to bottom quarks. We study the robustness of these FAIR AI models and their portability across hardware architectures and software frameworks, and report new insights on the interpretability of AI predictions by studying the interplay between FAIR datasets and AI models. Enabled by publishing FAIR AI models, these studies pave the way toward reliable and automated AI-driven scientific discovery.

Boll Weevil（Anthonomus Grandis L.）是一种严重的害虫，主要以棉花为食。由于亚热带气候条件，在德克萨斯州的下里奥格兰德山谷等地方，棉花植物可以全年生长，因此，收获期间上一个季节的剩下的种子可以在玉米中的旋转中继续生长（Zea Mays L.）和高粱（高粱双色L.）。这些野性或志愿棉花（VC）植物到达Pinhead平方阶段（5-6叶阶段）可以充当Boll Weevil Pest的宿主。得克萨斯州的鲍尔象鼻虫根除计划（TBWEP）雇用人们在道路或田野侧面生长的风险投资和消除旋转作物的田间生长，但在田野中生长的植物仍未被发现。在本文中，我们证明了基于您的计算机视觉（CV）算法的应用，仅在三个不同的生长阶段（V3，V6）（V3，V6）中检测出在玉米场中生长的VC植物，以检测在玉米场中生长的VC植物的应用。使用无人飞机系统（UAS）遥感图像。使用Yolov5（S，M，L和X）的所有四个变体，并根据分类精度，平均平均精度（MAP）和F1得分进行比较。发现Yolov5s可以在玉米的V6阶段检测到最大分类精度为98％，地图为96.3％，而Yolov5s和Yolov5m的地图为96.3％，而Yolov5m的分类精度为85％，Yolov5m和Yolov5m的分类准确性最小，而Yolov5L的分类精度最少。在VT阶段，在尺寸416 x 416像素的图像上为86.5％。开发的CV算法有可能有效地检测和定位在玉米场中间生长的VC植物，并加快TBWEP的管理方面。

这项工作提出了两种统计方法，用于基于通用和用户依赖模型的击键生物识别数据的合成。两种方法在机器人检测任务上均经过验证，使用击键合成数据来更好地训练系统。我们的实验包括一个来自168,000名受试者的1.36亿击球事件的数据集。我们通过定性和定量实验分析了两种合成方法的性能。根据两个监督分类器（支持向量机和长期的短期内存网络）和一个包括人类和生成的样本在内的学习框架，考虑了不同的机器人探测器。我们的结果证明，所提出的统计方法能够生成现实的人类合成击键样品。此外，分类结果表明，在具有大型标记数据的情况下，可以高精度检测这些合成样品。但是，在几次学习方案中，它代表了一个重要的挑战。

为了控制棉花场中的鲍尔象鼻虫（Anthonomus Grandis L.）害虫重新感染，目前的志愿棉花（VC）（VC）（gossypium hirsutum L.）植物检测玉米（Zea Mays L.）和Sorghum等旋转作物中的植物检测（高粱双色L.）涉及在田野边缘的手动田地侦察。这导致许多风险植物在田野中间生长仍未被发现，并继续与玉米和高粱并肩生长。当他们到达Pinhead平方阶段（5-6片叶子）时，它们可以充当鲍尔维尔虫害的宿主。因此，需要检测，定位，然后精确地用化学物质进行斑点。在本文中，我们介绍了Yolov5M在放射线和伽马校正的低分辨率（1.2兆像素）的多光谱图像中的应用，以检测和定位在康沃尔场的流苏中间（VT）生长阶段生长的VC植物。我们的结果表明，可以以平均平均精度（地图）为79％，分类精度为78％，大小为1207 x 923像素的分类精度为78％，平均推理速度在NVIDIA上的平均推理速度接近47帧（FPS） NVIDIA JETSON TX2 GPU上的Tesla P100 GPU-16GB和0.4 fps。我们还证明了基于开发的计算机视觉（CV）算法的定制无人飞机系统（UAS）的应用应用程序应用程序，以及如何将其用于近乎实时检测和缓解玉米领域中VC植物的近乎实时检测和缓解为了有效地管理鲍尔象鼻虫害虫。

自1800年代后期从墨西哥进入美国以来，棉花象鼻虫是Anthonomus Grandis Boheman是美国棉花行业的严重害虫，其损失超过160亿美元。这种害虫几乎被根除了。但是，得克萨斯州南部仍然面临这个问题，由于其亚热带气候可以全年生长，因此每年始终容易恢复有害生物。一旦到达销售虫（玉米），一旦它们到达销售虫的植物，志愿棉花（VC）植物一旦到达销子，可以作为这些害虫的宿主，一旦它们到达销钉头阶段（5-6叶阶段），因此需要检测到，位于，位于，位置，并被摧毁或喷涂。在本文中，我们介绍了一项研究，用于使用Yolov3在无人飞机系统（UAS）收集的三个频段航空图像上检测玉米田中的VC植物。本文的两倍目标是：（i）确定Yolov3是否可以使用UAS和（II）收集的RGB（红色，绿色和蓝色）在玉米场中进行VC检测来研究行为基于平均精度（AP），平均平均精度（MAP）和95％的95％的图像（320 x 320，s1; 416 x 416，s2; 416 x 416，s2;和512 x 512，s3像素）的图像上的yolov3的图像。信心水平。在三个量表之间，MAP没有显着差异，而S1和S3之间的AP存在显着差异（P = 0.04），S2和S3（P = 0.02）。 S2和S3之间的F1分数也存在显着差异（P = 0.02）。在所有三个量表上，MAP缺乏显着差异表明，训练有素的Yolov3模型可用于基于计算机视觉的远程试验的航空应用系统（RPAA），以实时实时实时进行VC检测和喷雾应用。

AutoEncoders在异常检测中具有高能物理学中的有用应用，特别是对于喷气机 - 在碰撞中产生的颗粒的准直淋浴，例如Cern大型强子撞机的碰撞。我们探讨了基于图形的AutoEncoders，它们在其“粒子云”表示中的喷射器上运行，并且可以在喷气机内的粒子中利用相互依存的依赖性，用于这种任务。另外，我们通过图形神经网络对能量移动器的距离开发可差的近似，这随后可以用作自动化器的重建损耗函数。

粒子流（PF）算法用于通用粒子检测器中，通过组合来自不同子目录的信息来重建碰撞的综合粒子级视图。已经开发出作为机器学习粒子流（MLPF）算法的图形神经网络（GNN）模型，以替代基于规则的PF算法。但是，了解模型的决策并不简单，特别是鉴于设定的预测任务，动态图形构建和消息传递步骤的复杂性。在本文中，我们适应了GNN的层状相关性传播技术，并将其应用于MLPF算法，以衡量相关节点和特征的预测。通过这个过程，我们深入了解模型的决策。

The performance of inertial navigation systems is largely dependent on the stable flow of external measurements and information to guarantee continuous filter updates and bind the inertial solution drift. Platforms in different operational environments may be prevented at some point from receiving external measurements, thus exposing their navigation solution to drift. Over the years, a wide variety of works have been proposed to overcome this shortcoming, by exploiting knowledge of the system current conditions and turning it into an applicable source of information to update the navigation filter. This paper aims to provide an extensive survey of information aided navigation, broadly classified into direct, indirect, and model aiding. Each approach is described by the notable works that implemented its concept, use cases, relevant state updates, and their corresponding measurement models. By matching the appropriate constraint to a given scenario, one will be able to improve the navigation solution accuracy, compensate for the lost information, and uncover certain internal states, that would otherwise remain unobservable.

We consider infinite horizon Markov decision processes (MDPs) with fast-slow structure, meaning that certain parts of the state space move "fast" (and in a sense, are more influential) while other parts transition more "slowly." Such structure is common in real-world problems where sequential decisions need to be made at high frequencies, yet information that varies at a slower timescale also influences the optimal policy. Examples include: (1) service allocation for a multi-class queue with (slowly varying) stochastic costs, (2) a restless multi-armed bandit with an environmental state, and (3) energy demand response, where both day-ahead and real-time prices play a role in the firm's revenue. Models that fully capture these problems often result in MDPs with large state spaces and large effective time horizons (due to frequent decisions), rendering them computationally intractable. We propose an approximate dynamic programming algorithmic framework based on the idea of "freezing" the slow states, solving a set of simpler finite-horizon MDPs (the lower-level MDPs), and applying value iteration (VI) to an auxiliary MDP that transitions on a slower timescale (the upper-level MDP). We also extend the technique to a function approximation setting, where a feature-based linear architecture is used. On the theoretical side, we analyze the regret incurred by each variant of our frozen-state approach. Finally, we give empirical evidence that the frozen-state approach generates effective policies using just a fraction of the computational cost, while illustrating that simply omitting slow states from the decision modeling is often not a viable heuristic.

In the present work we propose an unsupervised ensemble method consisting of oblique trees that can address the task of auto-encoding, namely Oblique Forest AutoEncoders (briefly OF-AE). Our method is a natural extension of the eForest encoder introduced in [1]. More precisely, by employing oblique splits consisting in multivariate linear combination of features instead of the axis-parallel ones, we will devise an auto-encoder method through the computation of a sparse solution of a set of linear inequalities consisting of feature values constraints. The code for reproducing our results is available at https://github.com/CDAlecsa/Oblique-Forest-AutoEncoders.