剖面隐藏的马尔可夫模型(PHMM)广泛用于许多生物信息学应用中,以准确识别生物学序列(例如DNA或蛋白质序列)之间的相似性。 PHMM使用常用和高度精确的方法(称为Baum-Welch算法)来计算这些相似性。但是,Baum-Welch算法在计算上很昂贵,现有作品为固定的PHMM设计提供了软件或仅硬件解决方案。当我们分析最先进的作品时,我们发现迫切需要灵活,高性能和节能的硬件软件共同设计,以有效地有效地解决所有主要效率低下的效率PHMM的Baum-Welch算法。我们提出了APHMM,这是第一个灵活的加速框架,可以显着减少PHMM的Baum-Welch算法的计算和能量开销。 APHMM利用硬件软件共同设计来解决Baum-Welch算法中的主要效率低下,通过1)设计灵活的硬件来支持不同的PHMMS设计,2)利用可预测的数据依赖性模式,并使用chip Memory的片段记忆,使用纪念活动技术,memoigience Memoriques,Memoigience Memoriques,Memoigient, 3)通过基于硬件的过滤器快速消除可忽略的计算,4)最小化冗余计算。我们在专用硬件和2)GPU的软件优化方面实现了我们的1)硬件软件优化,以为PHMM提供首个灵活的Baum-Welch加速器。与Baum-Welch算法的CPU,GPU和FPGA实现相比,APHMM提供的显着加速度为15.55 x-260.03x,1.83x-5.34x和27.97倍,分别为27.97倍。 APHMM的表现优于三个重要的生物信息学应用程序的最新CPU实现,1)错误校正,2)蛋白质家族搜索和3)多个序列对齐,比1.29x-59.94x,1.03x-1.75x和分别为1.03x-1.95x。
translated by 谷歌翻译
共同检测和隔离Covid-19患者对于成功实施缓解策略并最终遏制疾病扩散至关重要。由于在每个国家 /地区进行的每日共同测试数量有限,因此模拟COVID-19的扩散以及目前每种缓解策略的潜在影响仍然是管理医疗保健系统和指导决策者的最有效方法之一。我们介绍了Covidhunter,这是一种灵活而准确的Covid-19爆发模拟模型,评估了当前适用于该地区的缓解措施,可预测Covid-19统计数据(每日案件,住院和死亡人数),并就何种建议提供建议。力量即将进行的缓解措施应该是。 Covidhunter的关键思想是通过模拟考虑到外部因素的影响,例如环境条件(例如气候,温度,湿度,湿度),关注的不同变体,疫苗接种率和缓解措施。 Covidhunter以瑞士为案例研究,估计我们正在经历一场致命的新浪潮,该浪潮将于2022年1月26日达到顶峰,这与我们2020年2月的浪潮非常相似。决策者只有一个选择是为了增加30天的当前缓解措施的强度。与现有模型不同,Covidhunter模型可以准确监视,并预测COVID-19造成的病例,住院和死亡人数。我们的模型可以灵活地进行配置,并且可以易于修改,以在不同的环境条件和缓解措施下对不同方案进行建模。我们在https://github.com/cmu-safari/covidhunter上发布了covidhunter实现的源代码。
translated by 谷歌翻译
背景:COVID-19患者的早期检测和隔离对于成功实施缓解策略并最终遏制疾病扩散至关重要。由于在每个国家 /地区进行的每日共同测试数量有限,因此模拟COVID-19的扩散以及目前每种缓解策略的潜在影响仍然是管理医疗保健系统和指导决策者的最有效方法之一。方法:我们介绍了Covidhunter,这是一种灵活而准确的Covid-19爆发模拟模型,该模型评估了应用于区域的当前缓解措施,并提供有关即将进行的缓解措施的强度的建议。 Covidhunter的关键思想是通过模拟考虑到外部因素的影响,例如环境条件(例如气候,温度,湿度,湿度)和缓解措施。结果:使用瑞士作为案例研究,Covidhunter估计,如果政策制定者放宽30天的缓解措施50%,那么医院病床的日常容量和每日死亡人数平均每天的死亡人数平均增加了5.1倍,则会增加5.1倍谁可能会占用ICU床和呼吸机一段时间。与现有模型不同,Covidhunter模型可以准确监视,并预测COVID-19造成的病例,住院和死亡人数。我们的模型可以灵活地配置,并且可以易于修改,以在不同的环境条件和缓解措施下对不同方案进行建模。可用性:我们在https://github.com/cmu-safari/covidhunter上发布了covidhunter实现的源代码,并展示如何在任何情况下灵活配置我们的模型,并轻松地将其扩展为不同的度量和条件。
translated by 谷歌翻译
本文介绍了基于因子图的C ++估计框架,并针对移动机器人。狼将因子图的应用从典型的SLAM和OCOMORY中的典型问题扩展到能够处理自校准,模型识别或除本地化以外的动态量的观察的一般估计框架。狼在传感器速率上产生高通量估计到高达kHz范围,可用于高动态机器人的反馈控制,例如人形,四足动物或空中操纵器。脱离因子图范式,狼的体系结构允许模块化但紧密耦合的估计器。模块化基于运行时加载的插件。然后,通过yaml文件实现集成,允许用户在不需要编写或编译代码的情况下配置各种应用程序。通过分散的帧创建和加入策略,实现了传入数据的同步及其进入唯一因子图。大多数算法资产被编码为基类中的抽象算法,具有不同级别的专业化。总体而言,这些资产允许相干处理并有利于可重用性和可扩展性。狼可以与不同的求解器界面,我们为Google Ceres提供包装纸。同样,我们提供ROS集成,提供通用ROS节点和带有订阅者和发布者的专用套餐。狼被公开可用,并开放合作。
translated by 谷歌翻译
随机梯度马尔可夫链Monte Carlo(SGMCMC)是一种流行的可扩展贝叶斯推断算法。然而,这些算法包括诸如步进尺寸或批量尺寸,这些算法基于所获得的后样品影响估计器的准确性。因此,必须由从业者调整这些超级参数,目前没有具体的和自动化方式来调整它们存在。基于接受率的标准MCMC调整方法不能用于SGMCMC,从而需要替代工具和诊断。我们提出了一种基于新的基于强盗的算法,通过最小化真正的后后部和蒙特卡罗近似之间的斯坦坦差异来调谐SGMCMC近似度。我们提供支持这种方法的理论结果,并评估各种基于Stein的差异。我们通过对模拟和实际数据集的实验支持我们的结果,并发现该方法对于各种应用程序实用。
translated by 谷歌翻译
一个谎言小组是一个旧的数学抽象对象,追溯到xix世纪,当数学家大道谎言奠定了连续转型组理论的基础。正如经常发生的那样,许多年后,它的使用已经遍布各种科学和技术领域。在机器人学中,我们最近在估计领域中经历了一种重要的趋势,特别是在导航的运动估计中。然而,对于绝大多数机器人来说,谎言群体是高度抽象的结构,因此难以理解和使用。这可能是由于谎言理论上的大多数文献是由数学家和物理学家编写的,这些主义者可能比我们更多地用于这种理论涉及的深层抽象。在机器人学的估计中,通常没有必要利用理论的全部能力,因此需要选择材料的努力。在这篇论文中,我们将通过最基本的谎言理论原则,目的是传达明确和有用的想法,并留下了谎言理论的重要语料库。即使是这种肢解,这里所包含的材料也已被证明在机器人的现代估计算法中非常有用,特别是在SLAM,视觉内径等领域。除了这种微谎言之外,我们提供了一些应用示例的一章,以及机器人中使用的主要谎言团体的广泛公式参考,包括大多数雅各比矩阵以及轻松操纵它们的方式。我们还提供了一个新的C ++模板库,实现此处描述的所有功能。
translated by 谷歌翻译
The 3D-aware image synthesis focuses on conserving spatial consistency besides generating high-resolution images with fine details. Recently, Neural Radiance Field (NeRF) has been introduced for synthesizing novel views with low computational cost and superior performance. While several works investigate a generative NeRF and show remarkable achievement, they cannot handle conditional and continuous feature manipulation in the generation procedure. In this work, we introduce a novel model, called Class-Continuous Conditional Generative NeRF ($\text{C}^{3}$G-NeRF), which can synthesize conditionally manipulated photorealistic 3D-consistent images by projecting conditional features to the generator and the discriminator. The proposed $\text{C}^{3}$G-NeRF is evaluated with three image datasets, AFHQ, CelebA, and Cars. As a result, our model shows strong 3D-consistency with fine details and smooth interpolation in conditional feature manipulation. For instance, $\text{C}^{3}$G-NeRF exhibits a Fr\'echet Inception Distance (FID) of 7.64 in 3D-aware face image synthesis with a $\text{128}^{2}$ resolution. Additionally, we provide FIDs of generated 3D-aware images of each class of the datasets as it is possible to synthesize class-conditional images with $\text{C}^{3}$G-NeRF.
translated by 谷歌翻译
In both terrestrial and marine ecology, physical tagging is a frequently used method to study population dynamics and behavior. However, such tagging techniques are increasingly being replaced by individual re-identification using image analysis. This paper introduces a contrastive learning-based model for identifying individuals. The model uses the first parts of the Inception v3 network, supported by a projection head, and we use contrastive learning to find similar or dissimilar image pairs from a collection of uniform photographs. We apply this technique for corkwing wrasse, Symphodus melops, an ecologically and commercially important fish species. Photos are taken during repeated catches of the same individuals from a wild population, where the intervals between individual sightings might range from a few days to several years. Our model achieves a one-shot accuracy of 0.35, a 5-shot accuracy of 0.56, and a 100-shot accuracy of 0.88, on our dataset.
translated by 谷歌翻译
Feature selection helps reduce data acquisition costs in ML, but the standard approach is to train models with static feature subsets. Here, we consider the dynamic feature selection (DFS) problem where a model sequentially queries features based on the presently available information. DFS is often addressed with reinforcement learning (RL), but we explore a simpler approach of greedily selecting features based on their conditional mutual information. This method is theoretically appealing but requires oracle access to the data distribution, so we develop a learning approach based on amortized optimization. The proposed method is shown to recover the greedy policy when trained to optimality and outperforms numerous existing feature selection methods in our experiments, thus validating it as a simple but powerful approach for this problem.
translated by 谷歌翻译
The purpose of this work was to tackle practical issues which arise when using a tendon-driven robotic manipulator with a long, passive, flexible proximal section in medical applications. A separable robot which overcomes difficulties in actuation and sterilization is introduced, in which the body containing the electronics is reusable and the remainder is disposable. A control input which resolves the redundancy in the kinematics and a physical interpretation of this redundancy are provided. The effect of a static change in the proximal section angle on bending angle error was explored under four testing conditions for a sinusoidal input. Bending angle error increased for increasing proximal section angle for all testing conditions with an average error reduction of 41.48% for retension, 4.28% for hysteresis, and 52.35% for re-tension + hysteresis compensation relative to the baseline case. Two major sources of error in tracking the bending angle were identified: time delay from hysteresis and DC offset from the proximal section angle. Examination of these error sources revealed that the simple hysteresis compensation was most effective for removing time delay and re-tension compensation for removing DC offset, which was the primary source of increasing error. The re-tension compensation was also tested for dynamic changes in the proximal section and reduced error in the final configuration of the tip by 89.14% relative to the baseline case.
translated by 谷歌翻译