Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Repeat”

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 1,387 records · Page 77

The Roseibium album (Labrenzia alba) Genome Possesses Multiple Symbiosis Factors Possibly Underpinning Host-Microbe Relationships in the Marine Benthos

Here, we announce the genomes of eight Roseibium album (synonym Labrenzia alba ) strains that were obtained from the octocoral Eunicella labiata . Genome annotation revealed multiple symbiosis factors common to all genomes, such as eukaryotic-like repeat protein- and multidrug resistance-encoding genes, which likely underpin symbiotic relationships with marine invertebrate hosts.

59 BASIC BIOLOGICAL SCIENCES↗

Discovery of an Antarctic Ascidian-Associated Uncultivated Verrucomicrobia with Antimelanoma Palmerolide Biosynthetic Potential

The Antarctic marine ecosystem harbors a wealth of biological and chemical innovation that has risen in concert over millennia since the isolation of the continent and formation of the Antarctic circumpolar current. Scientific inquiry into the novelty of marine natural products produced by Antarctic benthic invertebrates led to the discovery of a bioactive macrolide, palmerolide A, that has specific activity against melanoma and holds considerable promise as an anticancer therapeutic. While this compound was isolated from the Antarctic ascidian Synoicum adareanum, its biosynthesis has since been hypothesized to be microbially mediated, given structural similarities to microbially produced hybrid nonribosomal peptide-polyketide macrolides. Here, we describe a metagenome-enabled investigation aimed at identifying the biosynthetic gene cluster (BGC) and palmerolide A-producing organism. A 74-kbp candidate BGC encoding the multimodular enzymatic machinery (hybrid type I-trans-AT polyketide synthase-nonribosomal peptide synthetase and tailoring functional domains) was identified and found to harbor key features predicted as necessary for palmerolide A biosynthesis. Surveys of ascidian microbiome samples targeting the candidate BGC revealed a high correlation between palmerolide gene targets and a single 16S rRNA gene variant (R = 0.83 to 0.99). Through repeated rounds of metagenome sequencing followed by binning contigs into metagenome-assembled genomes, we were able to retrieve a nearly complete genome (10 contigs) of the BGC-producing organism, a novel verrucomicrobium within the Opitutaceae family that we propose here as “Candidatus Synoicihabitans palmerolidicus.” The refined genome assembly harbors five highly similar BGC copies, along with structural and functional features that shed light on the host-associated nature of this unique bacterium.

59 BASIC BIOLOGICAL SCIENCES↗

Drivers of stability and transience in composition-functioning links during serial propagation of litter-decomposing microbial communities

ABSTRACT Biotic factors that influence the temporal stability of microbial community functioning are an emerging research focus for the control of natural and engineered systems. The discovery of common features within community ensembles that differ in functional stability over time is a starting point to explore biotic factors. We serially propagated a suite of soil microbial communities through five generations of 28-day microcosm incubations to examine microbial community compositional and functional stability during plant litter decomposition. Using dissolved organic carbon (DOC) abundance as a target function, we hypothesized that microbial diversity, compositional stability, and associated changes in interactions would explain the relative stability of the ecosystem function between generations. Communities with initially high DOC abundance tended to converge towards a “low DOC” phenotype within two generations, but across all microcosms, functional stability between generations was highly variable. By splitting communities into two cohorts based on their relative DOC functional stability, we found that compositional shifts, diversity, and interaction network complexity were associated with the stability of DOC abundance between generations. Further, our results showed that legacy effects were important in determining compositional and functional outcomes, and we identified taxa associated with high DOC abundance. In the context of litter decomposition, achieving functionally stable communities is required to utilize soil microbiomes to increase DOC abundance and long-term terrestrial DOC sequestration as one solution to reduce atmospheric carbon dioxide concentrations. Identifying factors that stabilize function for a community of interest may improve the success of microbiome engineering applications. IMPORTANCE Microbial community functioning can be highly dynamic over time. Identifying and understanding biotic factors that control functional stability is of significant interest for natural and engineered communities alike. Using plant litter–decomposing communities as a model system, this study examined the stability of ecosystem function over time following repeated community transfers. By identifying microbial community features that are associated with stable ecosystem functions, microbial communities can be manipulated in ways that promote the consistency and reliability of the desired function, improving outcomes and increasing the utility of microorganisms.

59 BASIC BIOLOGICAL SCIENCES↗

Compositional zoning of the Otowi Member of the Bandelier Tuff, Valles caldera, New Mexico, USA

The Otowi Member of the Bandelier Tuff erupted at ca. 1.60 Ma from the Valles caldera (New Mexico, USA). It consists of as much as 400 km 3 (dense rock equivalent) of strongly differentiated high-silica rhyolite and shows systematic upward variations in crystallinity, mineral chemistry, and trace element concentrations through its thickness, but the major element composition is almost constant and is near the low-pressure granite minimum. Incompatible trace elements in whole pumice fragments and glasses show well-correlated linear covariations. Upward zoning to lower abundances of incompatible trace elements is accompanied by development of overgrowths on quartz and alkali feldspar, although earlier-formed interiors of quartz and feldspar have near-constant compositions throughout the tuff, modified by cation diffusion in the case of feldspar. Melt inclusions in remnant quartz cores show diverse Pb isotope ratios, pointing to a wide range of distinct protoliths that contributed rhyolitic melt to the Otowi magma. Mineral thermometers suggest a modest temperature gradient through the melt body, perhaps of 40 °C, at the time of eruption. Chemical, textural, and mineralogical variations and volume-composition relations through the tuff are consistent with an origin for zoning by melting of a high-crystallinity cumulate layer beneath cognate supernatant liquid to produce denser, remobilized liquid of accumulative composition (i.e., the “modified mush model”). Melting may have occurred in several episodes. The latest of these episodes, probably thousands of years prior to eruption, introduced new rhyolitic liquid into the system and was associated with a thermal excursion, recorded in core compositions of pyroxene, during which much of the earlier crystal mass was dissolved. This left inherited cores and interiors of accumulated quartz and feldspar mantled with new growth having less-evolved compositions (higher Ti, Sr, and Ba). Changing solubility of zircon during cumulate melting produced a reversal of Zr concentrations. There is no clear petrologic evidence of a recharge eruption trigger; nonetheless, compositional zoning resulted mainly from repeated recharge-induced remobilization of quartz-feldspar cumulate. The Otowi system was built, evolved, and modified by several events over the course of a few hundred thousand years.

Wolff, J. A.↗

G-Mapper: Learning a Cover in the Mapper Construction

The Mapper algorithm is a visualization technique in topological data analysis (TDA) that outputs a graph reflecting the structure of a given dataset. However, the Mapper algorithm requires tuning several parameters in order to generate a “nice” Mapper graph. This paper focuses on selecting the cover parameter. We present an algorithm that optimizes the cover of a Mapper graph by splitting a cover repeatedly according to a statistical test for normality. Our algorithm is based on G-means clustering, which searches for the optimal number of clusters in 𝑘-means by iteratively applying the Anderson–Darling test. Our splitting procedure employs a Gaussian mixture model to carefully choose the cover according to the distribution of the given data. In conclusion, experiments for synthetic and real-world datasets demonstrate that our algorithm generates covers so that the Mapper graphs retain the essence of the datasets, while also running significantly faster than a previous iterative method.

G-means clustering↗

Activity Characterization for Modeling Behavioral-driven Human Mobility in Platial Networks

The population is increasingly becoming tractable as more and more people carry handheld devices as part of their everyday activities. Recent studies have shown that handheld devices' generated traffic share is now more than 50% of total global online traffic. This has created an unprecedented opportunity for modeling human mobility behavior. For example, aggregate check-ins and dwell time can reveal building level occupancies. However, there are clear limits to accurate modeling (e.g. reproducible, repeatable, and realistic), unless we decipher the underlying reason causing typical mobility patterns. We know that human behavior is a reflection of a set of activities, such as going to the gym or work, and which can be seen as a catalyst for humans to move from one location to another. This work envisions the use of activity characterization for modeling human mobility by introducing a context that maps activities to certain mobility patterns. In the end, we highlight the efficacy of the proposed approach by analyzing the impact of public policies surrounding stay at home order on human mobility.

Thakur, Gautam Malviya↗

Error-controlled, progressive, and adaptable retrieval of scientific data with multilevel decomposition

Extreme-scale simulations and high-resolution instruments have been generating an increasing amount of data, which poses significant challenges to not only data storage during the run, but also post-processing where data will be repeatedly retrieved and analyzed for a long period of time. The challenges in satisfying a wide range of post-hoc analysis needs while minimizing the I/O overhead caused by inappropriate and/or excessive data retrieval should never be left unmanaged. In this paper, we propose a data refactoring, compressing, and retrieval framework capable of 1) fine-grained data refactoring with regard to precision; 2) incrementally retrieving and recomposing the data in terms of various error bounds; and 3) adaptively retrieving data in multi-precision and multi-resolution with respect to different analysis. With the progressive data re-composition and the adaptable retrieval algorithms, our framework significantly reduces the amount of data retrieved when multiple incremental precision are requested and/or the downstream analysis time when coarse resolution is used. Experiments show that the amount of data retrieved under the same progressively requested error bound using our framework is 64% less than that using state-of-the-art single-error-bounded approaches. Parallel experiments with up to 1, 024 cores and ~ 600 GB data in total show that our approach yields 1.36× and 2.52× performance over existing approaches in writing to and reading from persistent storage systems, respectively.

Liang, Xin↗

PAGANI: a parallel adaptive GPU algorithm for numerical integration

We present a new adaptive parallel algorithm for the challenging problem of multi-dimensional numerical integration on massively parallel architectures. Adaptive algorithms have demonstrated the best performance, but efficient many-core utilization is difficult to achieve because the adaptive work-load can vary greatly across the integration space and is impossible to predict a priori. Existing parallel algorithms utilize sequential computations on independent processors, which results in bottlenecks due to the need for data redistribution and processor synchronization. Our algorithm employs a high-throughput approach in which all existing sub-regions are processed and sub-divided in parallel. Repeated sub-region classification and filtering improves upon a brute-force approach and allows the algorithm to make efficient use of computation and memory resources. A CUDA implementation shows orders of magnitude speedup over the fastest open-source CPU method and extends the achievable accuracy for difficult integrands. Our algorithm typically outperforms other existing deterministic parallel methods.

Sakiotis, Ioannis↗

Computational Estimation by Scientific Data Mining with Classical Methods to Automate Learning Strategies of Scientists

Experimental results are often plotted as 2-dimensional graphical plots (aka graphs) in scientific domains depicting dependent versus independent variables to aid visual analysis of processes. Repeatedly performing laboratory experiments consumes significant time and resources, motivating the need for computational estimation. The goals are to estimate the graph obtained in an experiment given its input conditions, and to estimate the conditions that would lead to a desired graph. Existing estimation approaches often do not meet accuracy and efficiency needs of targeted applications. We develop a computational estimation approach called AutoDomainMine that integrates clustering and classification over complex scientific data in a framework so as to automate classical learning methods of scientists. Knowledge discovered thereby from a database of existing experiments serves as the basis for estimation. Challenges include preserving domain semantics in clustering, finding matching strategies in classification, striking a good balance between elaboration and conciseness while displaying estimation results based on needs of targeted users, and deriving objective measures to capture subjective user interests. These and other challenges are addressed in this work. The AutoDomainMine approach is used to build a computational estimation system, rigorously evaluated with real data in Materials Science. Our evaluation confirms that AutoDomainMine provides desired accuracy and efficiency in computational estimation. It is extendable to other science and engineering domains as proved by adaptation of its sub-processes within fields such as Bioinformatics and Nanotechnology.

Computer Science↗

Training reinforcement learning models via an adversarial evolutionary algorithm

When training for control problems, more episodes used in training usually leads to better generalizability, but more episodes also requires significantly more training time. There are a variety of approaches for selecting the way that training episodes are chosen, including fixed episodes, uniform sampling, and stochastic sampling, but they can all leave gaps in the training landscape. In this work, we describe an approach that leverages an adversarial evolutionary algorithm to identify the worst performing states for a given model. We then use information about these states in the next cycle of training; this process can be repeated until the desired level of model performance is met. We demonstrate this approach with the OpenAI Gym cart-pole problem. With this problem, we show that the adversarial evolutionary algorithm did not reduce the number of episodes required in training needed to attain model generalizability when compared with stochastic sampling, and actually performed slightly worse.

Coletti, Mark↗

Efficient QAOA Optimization using Directed Restarts and Graph Lookup

Variational Quantum Algorithms (VQA) aim to enhance the capabilities of Noisy Intermediate-Scale Quantum (NISQ) devices. These algorithms utilize parameterized circuits and classical optimizers to iteratively execute circuits with varying parameters. However, VQA faces computational overheads due to repeated iterations and random restarts. Prior work suggests using basic sub-graphs to transfer parameters for the input graph, reducing optimizer overheads but limiting applicability to structured regular graphs. In real-world applications, random irregular graphs are common, and existing methods are not scalable or practical for such graphs. This paper presents a framework that aims to improve random irregular graphs in VQA. The framework uses graph similarity and important features like total edge counts, average edge counts, and variance. It follows an iterative process to choose basis sub-graphs from a small database and adjust parameters accordingly. Classical optimizers then utilize these parameters to determine when to restart and perform gradient descent. This approach increases the chances of reaching global maximum points.

Wang, Meng↗

TISCC: A Surface Code Compiler and Resource Estimator for Trapped-Ion Processors

We introduce the Trapped-Ion Surface Code Compiler (TISCC), a software tool that generates circuits for a universal set of surface code patch operations in terms of a native trapped-ion gate set. To accomplish this, TISCC manages an internal representation of a trapped-ion system where a repeating pattern of trapping zones and junctions is arranged in an arbitrarily large rectangular grid. Surface code operations are compiled by instantiating surface code patches on the grid and using methods to generate transversal operations over data qubits, rounds of error correction over stabilizer plaquettes, and/or lattice surgery operations between neighboring patches. Beyond the implementation of a basic surface code instruction set, TISCC contains corner movement functionality and a patch translation that is implemented using ion movement alone. Except in the latter case, all TISCC functionality is extensible to alternative grid-like hardware architectures. TISCC output has been verified using the Oak Ridge Quasi-Clifford Simulator (ORQCS).

LeBlond, Tyler↗

Parallel Simulation of Quantum Networks with Distributed Quantum State Management

Quantum network simulators offer the opportunity to cost-efficiently investigate potential avenues for building networks that scale with the number of users, communication distance, and application demands by simulating alternative hardware designs and control protocols. Several quantum network simulators have been recently developed with these goals in mind. As the size of the simulated networks increases, however, sequential execution becomes time-consuming. Parallel execution presents a suitable method for scalable simulations of large-scale quantum networks, but the unique attributes of quantum information create unexpected challenges. In this work, we identify requirements for parallel simulation of quantum networks and develop the first parallel discrete-event quantum network simulator by modifying the existing serial simulator SeQUeNCe. Our contributions include the design and development of a quantum state manager (QSM) that maintains shared quantum information distributed across multiple processes. We also optimize our parallel code by minimizing the overhead of the QSM and decreasing the amount of synchronization needed among processes. Using these techniques, we observe a speedup of 2 to 25 times when simulating a 1,024-node linear network topology using 2 to 128 processes. We also observe an efficiency greater than 0.5 for up to 32 processes in a linear network topology of the same size and with the same workload. We repeat this evaluation with a randomized workload on a caveman network. We also introduce several methods for partitioning networks by mapping them to different parallel simulation processes. We have released the parallel SeQUeNCe simulator as an open source tool alongside the existing sequential version.

97 MATHEMATICS AND COMPUTING↗

Progressive Dynamics for Cloth and Shell Animation

We propose Progressive Dynamics, a coarse-to-fine, level-of-detail simulation method for the physics-based animation of complex frictionally contacting thin shell and cloth dynamics. Progressive Dynamics provides tight-matching consistency and progressive improvement across levels, with comparable quality and realism to high-fidelity, IPC-based shell simulations [Li et al. 2021] at finest resolutions. Together these features enable an efficient animation-design pipeline with predictive coarse-resolution previews providing rapid design iterations for a final, to-be-generated, high-resolution animation. In contrast, previously, to design such scenes with comparable dynamics would require prohibitively slow design iterations via repeated direct simulations on high-resolution meshes. We evaluate and demonstrate Progressive Dynamics's features over a wide range of challenging stress-tests, benchmarks, and animation design tasks. Here Progressive Dynamics efficiently computes consistent previews at costs comparable to coarsest-level direct simulations. Its matching progressive refinements across levels then generate rich, high-resolution animations with high-speed dynamics, impacts, and the complex detailing of the dynamic wrinkling, folding, and sliding of frictionally contacting thin shells and fabrics.

Computer Science↗

The Evolving Chronology of Moon Formation

Defining the age of the Moon has proven to be an elusive task because it requires reliably dating lunar samples using radiometric isotopic systems that record fractionation of parent and daughter elements during events that are petrologically associated with planet formation. Crystallization of the magma ocean is the only event that unambiguously meets this criterion because it probably occurred within tens of millions of years of Moon formation. There are three dateable crystallization products of the magma ocean: mafic mantle cumulates, felsic crustal cumulates, and late-stage crystallization products known as urKREEP (uniform residuum K, rare earth elements, and P). Although ages for these materials in the literature span 200 million years, there is a preponderance of reliable ages around 4.35 billion years recorded in all three lunar rock types. This age is also observed in many secondary crustal rocks, indicating that they were produced contemporaneously (within uncertainty of the ages), possibly during crystallization and overturn of the magma ocean. •The duration of planet formation is key information in understanding the mechanisms by which the terrestrial planets formed. •Ages of the oldest lunar rocks range widely, reflecting either the duration of Moon formation or disturbed ages caused by impact metamorphism. •Ages determined for compositionally distinct crust and mantle materials produced by lunar magma ocean differentiation cluster near 4.35 Gyr. •The repeated occurrence of 4.35 Gyr ages implies that Moon formation occurred late in Solar System history, likely by giant impact into Earth.

79 ASTRONOMY AND ASTROPHYSICS↗

3D Nanocrystallography and the Imperfect Molecular Lattice

Crystallographic analysis relies on the scattering of quanta from arrays of atoms that populate a repeating lattice. While large crystals built of lattices that appear ideal are sought after by crystallographers, imperfections are the norm for molecular crystals. Additionally, advanced X-ray and electron diffraction techniques, used for crystallography, have opened the possibility of interrogating micro- and nanoscale crystals, with edges only millions or even thousands of molecules long. These crystals exist in a size regime that approximates the lower bounds for traditional models of crystal nonuniformity and imperfection. Accordingly, data generated by diffraction from both X-rays and electrons show increased complexity and are more challenging to conventionally model. New approaches in serial crystallography and spatially resolved electron diffraction mapping are changing this paradigm by better accounting for variability within and between crystals. The intersection of these methods presents an opportunity for a more comprehensive understanding of the structure and properties of nanocrystalline materials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Manufacturing Process of Electrode Films

Rotating disk electrode (RDE) experiments form a key experimental characterization technique for measuring electrocatalyst performance and durability. While standard RDE testing protocols have been documented, it has been noted that catalyst film quality can skew measurements. Furthermore, the impact of relative humidity on drying is studied in an effort to produce consistent, high quality catalyst films for RDE experiments, which shows that high quality catalyst films can be manufactured repeatedly in a controlled environment, such as inside an environmental chamber as described.

08 HYDROGEN↗

Investigating Effects of Operational Parameters on the Rate of Electrochemical Cleaning of Chromium Deposits on Strontium-Doped Lanthanum Manganite Cathodes in Solid Oxide Fuel Cells

Chromium poisoning of the cathode remains a significant obstacle to the stable long-term performance of solid oxide fuel cells. This study reports, a quick, in-situ mitigation method, called electrochemical cleaning. By applying a mild anodic bias, the electrochemical deposition reactions of chromium-containing species are reversed. Chromium vapor species are formed, freeing active electrochemical sites in the air electrode. An LSM/YSZ-based cell was exposed to Cr vapors at 800ºC and then subjected to electrochemical cleaning. Cell performance recovery was evidenced by current-voltage and EIS measurements. Chromium removal was verified using SEM and EDS analyses. The cyclability of the electrochemical cleaning was tested by repeated poisoning and cleaning of another cell. Investigation into the effect of cell operating parameters (current density and cell temperature) on the rate of cleaning is discussed.

30 DIRECT ENERGY CONVERSION↗