Engineering PapersSearch

SEARCH · Engineering Papers

Results for “enumerators”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 73 records · Page 4

First-Order Runtime Verification using BDDs

Runtime Verification (RV) expedites the analyses of execution traces for detecting system errors and for statistical and quality analysis. Having started modestly, with checking temporal properties that are based on propositional (yes/no) values, the current practice of RV often involves properties that are parametrized by the data observed in the input trace. The specifications are based on various formalisms, such as automata, temporal logics, rule systems, and stream processing. Checking execution traces that are data intensive against a specification that imposes strong dependencies between the data, poses a nontrivial challenges; in particular if runtime verification has to be performed online, while many events that carry data appear within small time proximities. Towards achieving this goal, it was recently suggested to represent relations over the observed data values, based on BDDs, where data elements are enumerated and then converted into bit vectors. This representation provided a very simple and natural extension of an RV algorithm from propositional to first-order LTL, but more importantly, was shown to contribute to the memory compactness and to the speed, as was demonstrated using a corresponding implementation. We extend here the capabilities of BDD-based RV with the ability to express timing constraints, where the monitored events include (integer) clock values. We show how to efficiently operate on BDDs that represent both relations on (enumerations of) values and time dependencies, as required by the addition of the time constraints. We demonstrate our algorithm with an efficient implementation and provide experimental results.

Peled, Doron

Single-Cell Analysis of Yeast (Saccharomyces cerevisiae) Using Hydrogel Encapsulation

Space radiation poses a major health risk to astronauts. To fulfill NASA’s mission of exploration beyond Earth, the biological effects of Galactic Cosmic Radiation and gamma radiation must be investigated to elucidate cellular damage mechanisms and inform countermeasure protocols to safely bring humans beyond Earth’s magnetosphere. Budding yeast (Saccharomyces cerevisiae) are commonly used in experiments as a model organism for studying the effects of radiation on eukaryotes. Radiobiology of yeast at the single cell level is poorly understood, yet crucial for informing models to aid in the design and interpretation of experiments. We are using a novel method of microencapsulation in hydrogel particles (PicoShells) to enable analysis of the distribution of radiation-induced damage among yeast cells at the single-cell level, in high throughput. Here we describe the development of methods for culturing, visualization, and quantification of encapsulated yeast. The encapsulated yeast are cultured in Yeast extract-Peptone-Dextrose (YPD) medium, fixed in formaldehyde or ethanol, and stained with DAPI or propidium iodide, then visualized using microscopy or enumerated using flow cytometry, with the aim of developing a protocol to enumerate the distribution of viable cells in each PicoShell. This will allow us to quantify how different forms of radiation can generate different distributions of damage across a population of cells, ultimately providing insight into the biological effects of space-relevant ionizing radiation.

yeast

System-Theoretic Analysis of Unsafe Collaborative Control in Teaming Systems

The interactions that occur in human-teaming are inspiring novel aerospace designs aimed at improving how humans and machines, or multiple machines, work together. Unfortunately, current Systems Engineering processes are ill-equipped to handle these complex relationships and are unable to design and assure the safety for these systems. To close part of this gap, this paper introduces a novel system-theoretic analytical process to identify unsafe collaborative control actions. It is part of a broader set of techniques that extend the state-of-the-art in hazard analysis, System Theoretic Process Analysis (STPA), to systematically address collaboration. The method rigorously expresses the different ways multiple commands may be unsafe together. Using Systems Theory, it employs abstraction to manage the combinatorial complexity in enumerating control contributions from multiple collaborating components. An algorithm integrates these concepts into an end-to-end process and is supported by automation to enumerate, refine, prune, and prioritize unsafe combinations of control actions. The output of the method feeds the specification of system requirements to implement safety-guided design starting early in concept development. The process is demonstrated on a manned-unmanned aircraft teaming case study and finds new causal factors that were not previously found in a past hazard analysis of the same system.

System Safety

A new template for developing C++ applications in NASA's Core Flight System

In this presentation, we will demonstrate an example Core Flight System (cFS) application written in C++, compatible with the Draco releases of the Core Flight Executive (cFE) and NASA Operating System Abstraction Layer (OSAL). The application boilerplate, supporting library, and associated generation script were recently developed and licensed under the permissive Apache License 2.0 with the goal of easing the cFS app development with C++. The design and features of this application will be presented, including a higher-level interface for interactions with the cFE software bus pipes, tables, and event services. Data structures are provided for centralized telecommand and telemetry parsing which isolates bookkeeping of message components from the calling code in an application's core logic. Specific advantages of writing a cFS application in C++ will be shown, including easier avoidance of symbol collisions via namespaces, expanded compile-time checks via constant expressions, default initialization for data structures, null safety via references, improved syntax for operating on multi-dimensional arrays, and reliable serialization of enumerations via enumeration classes. Special considerations needed for integrating a C++ application will be identified, including function linkage, exceptions, and stack unwinding. Evidence for the usefulness of this template will be discussed in the context of development of a flight software application used for interfacing with a solid-state data recorder.

Dominick Allen

Investigating Low-Altitude Constellations of Ad-Hoc Lunar PNT System for Distributed Spacecraft Autonomy

In this study, we examine a low-altitude Lunar Position, Navigation, and Timing (LPNT) constellations and the localization performance of Centralized Extended Kalman Filter (CEKF) and Decentralized Extended Kalman Filter (DEKF) algorithms. The primary investigation involves a 100-node swarm operating at a 100 km altitude, in contrast to previous studies that examined a 21-node asset in a frozen-orbit at 5,500 km. The autonomous operation of large-scale swarm is based on two-way Inter-Satellite Link (ISL) measurements, which involve pseudoranges and relative velocities among swarm nodes. We perform a numerical assessment of the two filtering approaches, utilizing ‘fully sampled’ measurements from all available assets as well as ‘two ISL’ measurements where each spacecraft is restricted to only two antennas. This research includes an analysis of CEKF under 2-ISL constraints and evaluates the performance of DEKF in a 100-node swarm, which has not been explored in previous studies. In addition, we examine the impact of increasing the sampling frequency for DEKF, showing that the update cycle can be shortened from a 10-minute interval. A novel approach for ‘2-ISL limited’ DEKF will also be introduced, using a matching formulation that exhaustively enumerates all potential matches. This study provides valuable insights into large-scale distributed swarm operations, considering various filter configurations, sampling frequencies, matching strategies, and scalability of CEKF and DEKF for low-altitude LPNT applications. The Lunar PNT technology plays a key role in providing reliable and robust navigation services on the Moon's surface and the South pole, where the primary Lunar missions are planned. To support upcoming Lunar missions, including small satellites from NASA's Commercial Lunar Payload Services program, the Lunar PNT system must be adaptable to smaller platforms like CubeSats. Driven by the growing involvement of public and private exploration partnerships, the traditional low Earth orbit missions are shifting to beyond geosynchronous orbit [1]. These upcoming missions aim to foster a sustainable and innovative exploration program, in collaboration with commercial and international partners, to facilitate human expansion throughout the solar system and return new knowledge and opportunities to Earth [2]. As part of this trend, there are increasing efforts to utilize science missions in Lunar orbit to develop a non-dedicated and ad-hoc PNT network system. Two traditional approaches, the Deep Space Network (DSN) and the weak signal Global Positioning System (GPS), are established deep-space navigation technologies for missions beyond the geosynchronous orbit. Beginning in 1958, the DSN was developed to communicate with the Explorer 1 spacecraft based on the use of radiometric tracking in spacecraft navigation [3]. The DSN is capable of providing nearly unfettered coverage to spacecraft beyond low-Earth orbit (LEO), however, increased space mission volume has created concerns about future expectations of DSN usage for spacecraft navigation [4]. For cislunar mission applications, the position accuracy using DSN achieves 100 m (3σ) with at least three geometrically diverse ground stations when using radiometric tracking alone [5]. The DSN's dependence on Earth-based ground stations restricts its operational capabilities to periods of Earth visibility. This limitation, coupled with its poor localization performance, renders the DSN unsuitable for future lunar missions that demand continuous tracking and precise positioning. To satisfy the increasing requirements of DSN in Lunar applications, spacecrafts are also required to improve their onboard antenna power and efficiency of the transmission. However, there is an important aggregate cost trade between adding capabilities to every spacecraft and adding to a capacity on the ground that serves multiple spacecraft [6]. A weak GPS system can provide PNT service while the user spacecraft is bound to the Moon, leveraging a single, steerable high gain antenna with the relatively narrow beam which includes all the sources in its field of view [7]. However, the higher the altitude the receiver is above the GPS constellations, the poorer and the weaker are the relative geometry and the received signal powers, respectively, leading to a significant navigation accuracy reduction [8]. The transmitted power becomes weaker with increasing distance from the Earth as well as signals tracked from one of the side lobes of the GPS antenna pattern. As a results, the number of visible satellites and relative geometric condition of the GPS satellites at very high altitude drops dramatically and reduces the navigation solution accuracy. Therefore, the weak GPS system is also not an ideal way to provide PNT service to upcoming Lunar missions when considering its limited geometric condition and the recued navigation accuracy. Another navigation approach on the Moon is being developed, similar to the Global Navigation Satellite System (GNSS) on Earth, aiming to offer navigation service with continuous 24/7 coverage across the entire Lunar surface. For example, lunar communications relay and navigation systems (LCRNS) by NASA and Lunar navigation satellite systems (LNSS) by JAXA are designed to serve as dedicated Position, Navigation, and Timing (PNT) systems for the Moon. However, designing a dedicated LNSS and PNT service involves additional challenges, which are unique to the lunar environment, including limited payload capacity for the CubeSat platform, i.e., the size, weight, and power (SWaP) of the onboard clock, limited lunar ground monitoring stations, and limited financial investment as compared to the legacy Earth-GPS [9]. NASA’s focus on utilizing CubeSat platforms on the Moon leads to an alternative Lunar navigation platform that leverages the existing Lunar science and exploration assets. The small satellites used in Lunar missions can be used to create a low-cost, autonomous, ad-hoc, and on-demand mission-centric Lunar PNT swarm capable of providing PNT services to these low-cost lunar missions [10]. As upcoming Lunar missions will often operate at low-altitude about 30 km to 100 km for scientific observations and mapping purposes, the low-altitude orbital constellations could be employed to create an ad-hoc Lunar PNT system. However, several issues must be addressed, such as the instability of these orbits, which often require maintenance or are only suitable for short-duration missions, operating for fewer than 90 days. Additionally, at an altitude of 100 km, the satellites have a limited period during which they are above the horizon and capable of providing PNT service to users. The implementation of a non-dedicated, ad-hoc Lunar navigation constellation facilitates on-demand PNT services. A preliminary study of ad-hoc Lunar PNT system was conducted using 21 spacecraft in 5,5000 km altitude frozen orbits to test its feasibility and a basic performance of orbital asset localization among ad-hoc Lunar constellations in small satellites format [10]. These swarm assets are designed for autonomous localization with minimal Earth interaction, reducing dependency on bandwidth and ground resources. The design in [10] demonstrated the feasibility of a decentralized PNT approach, specifically employing a DEKF approach for state estimation, which helps minimize onboard operating costs. The DEKF method distributes computation across individual satellites, which lightens the computational load while maintaining accuracy in orbit ephemeris and clock offsets, similar to centralized systems [11]. In a follow-on study [12], each spacecraft was limited to 2 communications antennae, forcing the selection of measurements and scheduling spacecraft activities to perform the measurements. A matching algorithm is implemented to select the best measurements and schedule position estimation updates. The decentralized localization performance is also investigated with increasing levels of network degradation for swarm assets considering the impact of intermittent and permanent communication failure, to demonstrate the robustness and fidelity of the decentralized Lunar PNT service [13]. This study confirmed that the ad-hoc PNT constellations in frozen orbit are highly robust and resilient to communication failures. However, unlike frozen orbit swarm assets, the low-altitude satellites have a limited ground view at an altitude of 100 km, where the ad-hoc Lunar constellation consists of 98 low-altitude satellites, evenly distributed across seven circular polar orbital planes, alongside two satellites in a frozen orbit at an altitude of 5,500 km (Figure 1). Therefore, the number of satellites visible to ground users is significantly limited in low-altitude orbit constellations. As each visibility of a spacecraft remains intact for only a few ticks before it moves out of the field of view, the ground user encounters challenges in maintaining continuous navigation service, resulting in sparse availability and provision of Lunar PNT system. Consequently, service availability is primarily restricted to the Lunar South Pole region (Figure 2). Given these limitations and concerns, the localization performance of low-altitude swarm assets will be assessed in this study. We focus on the investigation of the localization performance of low-altitude swarm assets and ground users near the Lunar South Pole. The overall flow of the Lunar PNT simulation incorporates the DEKF approach of asset localization and the weighted least-squares approach in user localization (Figure 3). The autonomous Lunar PNT simulation is primarily implemented in MATLAB, where the DEKF based on the matching scheduler is implemented with Google’s OR-tools as a model builder and Gurobi optimization tool as a backend solver. The General Mission Analysis Tool (GMAT) is utilized to generate ephemeris data for swarm assets, and accounts for satellite orbital details, mass, and perturbations like solar radiation pressure and drag coefficients. Each ephemeris dataset is produced in the Moon International Celestial Reference Frame (ICRF) inertial coordinate system. For state estimation, the distributed swarm assets rely on two-way Inter-Satellite Link (ISL) measurements, which involve tracking pseudoranges and relative velocities between visible satellites and anchor nodes during each observation. Numerical evaluations of the decentralized localization process are conducted to demonstrate the feasibility of the low-altitude PNT system in providing reliable navigation services. The main approach involves using DEKF and CEKF to localize 100 satellites in low-altitude constellations, where the CEKF is implemented to serve as a baseline for comparing the performance of distributed algorithms. In both cases, we evaluate ‘fully sampled’ measurements from all available assets, and ‘two ISL’ measurements when spacecraft are constrained to have only two antennas. We test four estimation techniques: CEKF fully sampled, CEKF two ISL, DEKF fully sampled, and DEKF two ISL filters. As the DEKF update cycle is comprised of network setup, communication, and computations, a global broadcast network and 2-way ISL network setup will take from 4 to 6 minutes as maximum [12]. In this simulation, the DEKF update cycle is set to 10 minutes, including a 4-minute latency for obtaining and computing the actual measurement updates. We experiment an increased update cycle to demonstrate the feasibility and evaluate the impact on localization performance using various tuning values for measurement noise covariances (Figures 4 and 5). By comparing centralized and decentralized approaches using a matching algorithm, we analyze the influence of cross-correlation factors in the covariance matrix, assuming 100% reliability of all assets and measurements. The increased frequency and the adjustments of tuning parameters reveal distinct error patterns between the two scenarios. The localization accuracy of the swarm assets and ground users is assessed by taking the median error across 100 assets and one ground user (84.9°S, 137.5°E) over 7-day simulation period (Table 1). Since the user localization accuracy is significantly affected by the performance of the swarm assets, it is crucial to maintain high localization accuracy within the swarm. This study will continue to explore decentralized filtering for autonomous LPNT operations, with further investigation of an 'iterative' matching approach which enumerates every valid matching pair, planned for the following month.

Yeji Kim

A Comprehensive Comparative Study of Active Learning Schemes for Nanophotonics Design

We present a benchmarking study of active learning (AL) schemes for designing planar multilayer nanophotonic metamaterials, where the design tasks are formulated as binary optimization problems. Different surrogate models, including factorization machine (FM), Gaussian process regression (GPR), and convolutional neural network (CNN), combined with different optimization methods, including exhaustive enumeration, discrete particle swarm optimization (DPSO), quantum annealing (QA), hybrid QA, and simulated annealing are studied. The benchmark cases investigated range from small problems with short binary lengths (N = 25) to large problems with N up to 100, focusing on the design of two classes of photonic structures, including antireflective coatings for the long-wavelength infrared region and transparent radiative coolers. For small problems, CNN coupled with DPSO in AL achieves the best performance. As N increases, FM with QA outperforms GPR and CNN. For FM-based AL, hybrid QA yields the best optimization results, particularly in high-dimensional cases (N = 100). These results demonstrate that the optimization method can significantly affect in AL performance as N increases, and that QA-based optimization can provide practical routes for mitigating the optimization bottleneck in high-dimensional problems.

Jung, Serang [Kyung Hee University, Korea]

A physical basis for cosmological correlators from cuts

Significant progress has been made in our understanding of the analytic structure of FRW wavefunction coefficients, facilitated by the development of efficient algorithms to derive the differential equations they satisfy. Moreover, recent findings indicate that the twisted cohomology of the associated hyperplane arrangement defining FRW integrals overestimates the number of integrals required to define differential equations for the wave-function coefficient. We demonstrate that the associated dual cohomology is automatically organized in a way that is ideal for understanding and exploiting the cut/residue structure of FRW integrals. Utilizing this understanding, we develop a systematic approach to organize compatible sequential residues, which dictates the physical subspace of FRW integrals for any n -site, ℓ-loop graph. In particular, the physical subspace of tree-level FRW wavefunction coefficients is populated by differential forms associated to cuts/residues that factorize the integrand of the wavefunction coefficient into only flat space amplitudes. After demonstrating the validity of our construction using intersection theory, we develop simple graphical rules for cut tubings that enumerate the space of physical cuts and, consequently, differential forms without any calculation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS

Five-dimensional spinor helicity for all masses and spins

We develop a spinor helicity formalism for five-dimensional scattering amplitudes of any mass and spin configuration. While five-dimensional spinor helicity variables have been previously studied in the context of $\mathcal{N}$ = 2, 4 supersymmetric Yang-Mills scattering amplitudes with spin less than two [1], we propose an alternative viewpoint that stems from d-dimensional spinor helicity variables avoiding the decomposition of a massive momentum into the sum of two massless momenta. By enumerating all possible independent little group tensors, we systematically build the full space of five-dimensional three-point tree-level scattering amplitudes for any configuration of spins and masses. Furthermore, we provide a prescription for computing the high energy limit of scattering amplitudes written in our spinor helicity variables. We also expect that our formalism will be applicable to effective field theories with higher spin, in particular, the scattering of highly spinning black holes in five dimensions.

Field Theories in Higher Dimensions

A stiff order condition theory for Runge–Kutta methods applied to semilinear ODEs

Classical convergence theory of Runge–Kutta methods assumes that the time step is small relative to the Lipschitz constant of the ordinary differential equation (ODE). For stiff problems, that assumption is often violated, and a problematic degradation in accuracy, known as order reduction, can arise. Methods with high stage order, e.g., Gauss–Legendre and Radau, are known to avoid order reduction, but they must be fully implicit. For the broad class of semilinear ODEs, which consist of a stiff linear term and non-stiff nonlinear term, we show that weaker conditions suffice. Here, our new semilinear order conditions are formulated in terms of orthogonality relations and can be enumerated by rooted trees. Finally, we prove global error bounds that hold uniformly with respect to stiffness of the linear term.

Mathematics and Computing

Energetics of the nucleation and glide of disconnection modes in symmetric tilt grain boundaries

Grain boundaries (GBs) evolve by the nucleation and glide of disconnections, which are dislocations with a step character. In this work, motivated by recent success in predicting GB properties such as the shear coupling factor and mobility from the intrinsic properties of disconnections, we develop a systematic method to calculate the energy barriers for the nucleation and glide of individual disconnection modes under arbitrary driving forces and a quasi-2D setting. This method combines tools from bicrystallography to enumerate disconnection modes and the Nudged elastic band (NEB) method to calculate their energetics, yielding minimum energy paths and atomistic mechanisms for the nucleation and glide of each disconnection mode. We apply the method to accurately predict shear coupling factors of $[001]$ symmetric tilt grain boundaries in Cu. Particular attention is paid to the boundaries where the dislocation-based disconnection nucleation model produces incorrect nucleation barriers. We demonstrate that the method can accurately compute energy barriers and predict shear-coupling factors in the low-temperature regime. For certain disconnection modes in which the assumptions underlying our method do not hold, we report upper bounds on the energy barriers for disconnection nucleation and glide. In addition, the NEB trajectories reveal interesting phenomena such as the dissociation of a higher energy mode into lower energy modes, and in some cases, shear coupling being mediated by partial disconnections, wherein the GB structure temporarily changes to a metastable state before reverting back to its original structure. Graphical abstract

36 MATERIALS SCIENCE

A generalized and adaptable tensor-contraction-based cluster expansion formalism for multicomponent solids

Density functional theory (DFT)-based simulations of materials have first-principles accuracy, but are very computationally expensive. For simulating various properties of multi-component alloys, the cluster expansion (CE) technique has served as the standard workaround to improve computational efficiency. However, the standard CE technique is difficult to extend to exotic and/or low-symmetry lattices, often implemented via iteration over particular cluster types, which must be enumerated per lattice structure. In this work, we introduce the tensor cluster expansion (TCE), implemented in the open-source code tce-lib, which maps correlation functions to mixed tensor contractions, eliminating the need to iterate over cluster types and additionally making the calculation of correlation functions well-suited for massively parallel architectures like GPUs. We show that local interaction energies are an immediate consequence of the TCE formalism, yielding nearly $\mathcal{O}$(1) energy difference calculations. We then use this formalism to fit CE models for the TaW and CoNiCrFeMn systems, and use these models to respectively compute the enthalpy of mixing curve and Cowley short-range order parameters, showing excellent agreement with ground truth data.

Cluster expansion

Investigating the Determinants of Household Capabilities Burden During Power Outages: The Case of Winter Storm Uri

Existing research primarily uses census data to identify the vulnerability of communities to hazards. These vulnerability indices provide aggregated data and are not hazard-specific nor well-validated with post-event data. In contrast, our study uses household survey data (n=1065) to understand which Texan households suffered the greatest loss of their capabilities due to power outages and other utility service disruptions during Winter Storm Uri. Inspired by the Capabilities Approach, our measures of burden include the number of household capability types disrupted during the outages (e.g., cooking, heating, refrigeration), the severity of impact for each disrupted capability, and the additional time and financial costs of coping with these disruptions. We perform a clustering analysis, and find two distinct groups in our data, consisting of ‘lesser burden' and ‘heavier burden' households. Results indicate that the households experiencing the heaviest capabilities burden were most likely to experience longer power outages and the loss of water services. They were also more likely to have a Hispanic-Latino household member, lack access to a generator, live in a rented home, have larger households with more young children, fewer adults over 65, lower household incomes, been impacted by the COVID-19 pandemic, and more family characteristics that made life harder. We also fit a logistic regression model to assess the role of outage, household, and community characteristics in predicting differences in capabilities burden. Our results offer insights into enumerating the consequences of utility service disruptions on households, which can inform more targeted and equitable resilience strategies.

24 POWER TRANSMISSION AND DISTRIBUTION

Self-consistent solution of the Frank–Bilby equation for interfaces containing disconnections

The quantized Frank–Bilby equation can be used to identify interfacial line defect array configurations which relax the misorientation and/or misfit of a coherent crystalline interface. These line defect arrays may be comprised of dislocations and/or disconnections, which are interfacial steps with dislocation character. When an interface contains disconnections, solution of the quantized Frank–Bilby equation is complicated by the fact that the habit plane orientation is not known in advance because it depends on the unknown spacing of the disconnection array. We present a root-finding-based method for addressing this issue, enabling a self-consistent solution for arbitrary defect content. Our method has been implemented in an open-source code which enumerates all possible solutions given a list of candidate line defects. Two cases are presented employing the code: a misoriented FCC twin boundary and an FCC/BCC phase boundary with the Nishiyama-Wasserman orientation relationship. Both cases exhibit more than 10,000 solutions to the Frank–Bilby equation, with several hundred solutions categorized as ‘‘low energy’’ and thus plausible configurations for the actual interface. The resulting set of solutions can be utilized to predict and understand the properties of a given interface.

42 ENGINEERING

Ensemble Effects on Hydroxide Bond Dissociation Free Energies in Polyoxovanadate Clusters

Understanding structure-property relationships is foundational to numerous modern chemistries, such as proton-coupled electron transfer (PCET). However, an experimentally measured property is the result of the behavior from an ensemble of molecules. Neglecting ensemble effects, especially under complex chemical environments, may obfuscate these relationships and lead to discrepancies between theory and experiment. In this work, we demonstrate the impact of configurational entropy and local chemical environments on hydroxide bond dissociation free energies [BDFE- (O−H)] for a set of polyoxovanadate nanoclusters, at ambient conditions. The O−H bond strengths are investigated via density functional theory (DFT) coupled with statistical thermodynamic analysis and bilinear modeling, and compared with previous experimental results on the same systems, namely electrochemical solutions of: [V 6 O 13−x (OH) x (TRIOL R ) 2 ] −2 (x = 2, 4, 6; R = NO 2 , Me) and [V 6 O 11−x (OMe) 2 (OH) x (TRIOL NO 2 ) 2 ] −2 (x = 2, 4). Interestingly, we find that ensemble effects, even at room temperature, can account for a significant portion of the BDFE(O−H) trend with the degree of reduction via H atom binding, which cannot be fully captured by single-structure, static DFT calculations. Moreover, we find that the ensemble effects may be replicated statistically, requiring only enumeration of energetically accessible H-binding sites. With the ensemble effects resolved, we present a simple bilinear model to reconcile remaining biases between experiment and ensemble-informed theory, which corelate with clusterspecific electronic environment differences. The bilinear model achieves outstanding accuracy vs experiments with a root-mean squared error of 0.4 kcal/mol. Finally, based on the physicochemical characteristics of hydrogen interaction with polyoxometalates, we present a simple methodology that captures the BDFE(O−H) trend while dramatically reducing required DFT calculations by 98% and achieving accuracy within 1 kcal/mol. Overall, this work elucidates the roles and structural origins of configurational entropy and chemical effects on polyoxometalate hydroxide bond energies, with potential applicability to various atomically precise metal oxide systems. Importantly, it introduces models for rapid and highly accurate property calculations in connection with experiments.

Cluster chemistry

Robust Interpretation of Electrochemical Impedance Spectra Using Numerical Complex Analysis

Electrochemical Impedance Spectroscopy (EIS) is a noninvasive technique widely used for understanding charge transfer and charge transport processes in electrochemical systems and devices. Standard approaches for the interpretation of EIS data involve starting with a hypothetical circuit model for the physical processes in the device based on experience/intuition and then fitting the EIS data to this circuit model. This work explores a mathematical approach for extracting key characteristic features from EIS data by relying on fundamental principles of complex analysis. These characteristic features can suggest the presence of inductors and constant phase elements (nonideal capacitors) from impedance data and enable us to answer questions about the identifiability and nonuniqueness of equivalent circuit models. In certain scenarios such as models with only resistors and capacitors, we are able to enumerate all possible families of circuit models. Finally, we apply the mathematical framework presented here to real-world electrochemical systems and highlight results using impedance measurements from a lithium-ion battery coin cell.

charge transfer

High-throughput methods leveraging robotics and computer vision for the development of therapeutic phage cocktails

We present the high-throughput automated screening techniques that are being used to develop bacteriophage-based therapeutic products currently under investigation in human clinical trials to combat urinary tract infections. By integrating modern liquid handling robotics, standardized phenotypic assays, and computer vision-based enumeration, we established a platform capable of reproducibly screening large collections of phages against clinically derived bacterial strain panels. This approach enabled systematic assessment of phage-bacteria interactions at scale, facilitating the identification and optimization of phage cocktails with broad in vitro activity. Although bacteriophage therapy has long been investigated as a strategy for treating bacterial infections, few frameworks exist for developing phage combinations in a reproducible and scalable manner. The methods outlined here address this gap and aim to support the broader development of therapeutic assets available to combat antibiotic resistance.

Penke, Taylor J. R. [Locus Biosciences, Morrisvill

Quantum mechanical dataset of 836k neutral closed-shell molecules with up to 5 heavy atoms from C, N, O, F, Si, P, S, Cl, Br

Abstract We introduce the Vector-QM24 (VQM24) dataset comprehensively covering all possible neutral closed-shell small organic and inorganic molecules with up to five heavy (p-block) atoms: C, N, O, F, Si, P, S, Cl, Br. All valid stoichiometries, Lewis-rule-consistent graphs, and stable conformers (identified via GFN2-xTB) were enumerated combinatorially, yielding 577k conformational isomers spanning 258k constitutional isomers and 5,599 unique stoichiometries. DFT (ωB97X-D3/cc-pVDZ) optimizations were performed for all, and diffusion quantum Monte Carlo (DMC@PBE0(ccECP/cc-pVQZ)) energies are provided for 10,793 lowest-energy conformers with up to 4 heavy atoms. VQM24 includes structures, vibrational modes, rotational constants, thermodynamic properties (Gibbs free energies, enthalpies, ZPVEs, entropies, heat capacities), and electronic properties such as atomization, electron interaction, exchange-correlation, dispersion energies, multipole moments (dipole to hexadecapole), alchemical potentials, Mulliken charges, and wavefunctions. Machine learning models of atomization energies on this dataset reveal significantly higher complexity than QM9, with none achieving chemical accuracy. VQM24 offers a rigorous, high-fidelity benchmark for evaluating quantum machine learning models.

Science & Technology - Other Topics

Discovery of hybrid chemical synthesis pathways with DORAnet

Developing efficient tools for discovering novel synthesis pathways is essential to advance chemical production methods that maximize the use of resources and energy. We introduce DORAnet (Designing Optimal Reaction Avenues Network Enumeration Tool), an open-source computational framework that addresses key limitations in current computer-aided synthesis planning (CASP) tools. DORAnet integrates both chemical/chemocatalytic (i.e., non-enzymatic) and enzymatic transformations, enabling the discovery of hybrid synthesis pathways. With 390 expert-curated chemical/chemocatalytic reaction rules and 3606 enzymatic rules derived from MetaCyc, it provides extensive flexibility for synthetic chemists and biotechnologists. The framework features customizable network expansion strategies, advanced filtering, and pathway search, ranking, and visualization tools. Validated against known reaction data, DORAnet successfully identified both established and novel synthesis routes for key industrial chemicals. In a case study involving 51 high-volume targets, DORAnet frequently ranked known commercial pathways among the top three results, demonstrating its practical relevance and ranking accuracy, while also uncovering numerous alternative (hybrid) synthesis pathways that were highly ranked.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH