Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Constructive Tree”

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

Variation in Sphingomonas traits across habitats and phylogenetic clades

Whether microbes show habitat preferences is a fundamental question in microbial ecology. If different microbial lineages have distinct traits, those lineages may occur more frequently in habitats where their traits are advantageous. Sphingomonas is an ideal bacterial clade in which to investigate how habitat preference relates to traits because these bacteria inhabit diverse environments and hosts. Here we downloaded 440 publicly available Sphingomonas genomes, assigned them to habitats based on isolation source, and examined their phylogenetic relationships. We sought to address whether: (1) there is a relationship between Sphingomonas habitat and phylogeny, and (2) whether there is a phylogenetic correlation between key, genome-based traits and habitat preference. We hypothesized that Sphingomonas strains from similar habitats would cluster together in phylogenetic clades, and key traits that improve fitness in specific environments should correlate with habitat. Genome-based traits were categorized into the Y-A-S trait-based framework for high growth yield, resource acquisition, and stress tolerance. We selected 252 high quality genomes and constructed a phylogenetic tree with 12 well-defined clades based on an alignment of 404 core genes. Sphingomonas strains from the same habitat clustered together within the same clades, and strains within clades shared similar clusters of accessory genes. Additionally, key genome-based trait frequencies varied across habitats. We conclude that Sphingomonas gene content reflects habitat preference. This knowledge of how environment and host relate to phylogeny may also help with future functional predictions about Sphingomonas and facilitate applications in bioremediation.

59 BASIC BIOLOGICAL SCIENCES↗

Unveiling the Arsenal of Apple Bitter Rot Fungi: Comparative Genomics Identifies Candidate Effectors, CAZymes, and Biosynthetic Gene Clusters in Colletotrichum Species

The bitter rot of apple is caused by Colletotrichum spp. and is a serious pre-harvest disease that can manifest in postharvest losses on harvested fruit. In this study, we obtained genome sequences from four different species, C. chrysophilum, C. noveboracense, C. nupharicola, and C. fioriniae, that infect apple and cause diseases on other fruits, vegetables, and flowers. Our genomic data were obtained from isolates/species that have not yet been sequenced and represent geographic-specific regions. Genome sequencing allowed for the construction of phylogenetic trees, which corroborated the overall concordance observed in prior MLST studies. Bioinformatic pipelines were used to discover CAZyme, effector, and secondary metabolic (SM) gene clusters in all nine Colletotrichum isolates. We found redundancy and a high level of similarity across species regarding CAZyme classes and predicted cytoplastic and apoplastic effectors. SM gene clusters displayed the most diversity in type and the most common cluster was one that encodes genes involved in the production of alternapyrone. Our study provides a solid platform to identify targets for functional studies that underpin pathogenicity, virulence, and/or quiescence that can be targeted for the development of new control strategies. With these new genomics resources, exploration via omics-based technologies using these isolates will help ascertain the biological underpinnings of their widespread success and observed geographic dominance in specific areas throughout the country.

59 BASIC BIOLOGICAL SCIENCES↗

Algebraic Algorithms for Betweenness and Percolation Centrality

Abstract In this paper, we explored different ways to write the algebraic version of betweenness centrality algorithm. Particularly, we focused on Brandes' algorithm. We aimed for algebraic betweenness centrality that can be parallelized easily. We proposed 3-tuple geodetic semiring as an extension to the usual geodetic semiring with 2-tuples. Using the 3-tuple geodetic semiring, Dijkstra's and Brandes' algorithm, we wrote more concise and general algebraic betweenness centrality (ABC) algorithm which is valid for weighted and directed graphs. We also proposed an alternative version of ABC using the usual geodetic semiring with 2-tuple where we used a simple way to construct shortest path tree after computing shortest path distances in the usual geodetic semiring. This allows us to avoid computational complexity of ABC implementation using 3-tuple geodetic semiring. We used numba to optimize and parallelize ABC. We evaluated the performance of ABC using 2-tuple geodetic semiring as compared to NetworkX, a common python package for graph algorithms. We did scalability experiments on parallel ABC and showed its total speedup. We also showed that with small modification, ABC can be adapted to algebraicly compute other centrality measures such as percolation centrality.

97 MATHEMATICS AND COMPUTING↗

ADAPT

The purpose of the ADAPT code is to generate Dynamic Event Trees (DET) using a user specified set of simulators. ADAPT can utilize any simulation tool which meets a minimal set of requirements. ADAPT is based on the concept of DET which uses explicit modeling of the deterministic dynamic processes that take place during a nuclear reactor plant system (or other complex system) evolution along with stochastic modeling. When DET are used to model various aspects of Probabilistic Risk Assessment (PRA), all accident progression scenarios starting from an initiating event are considered simultaneously. The DET branching occurs at user specified times and/or when an action is required by the system and/or the operator. These outcomes then decide how the dynamic system variables will evolve in time for each DET branch. Since two different outcomes at a DET branching may lead to completely different paths for system evolution, the next branching for these paths may occur not only at separate times, but can be based on different branching criteria. The computational infrastructure allows for flexibility in ADAPT to link with different system simulation codes, parallel processing of the scenarios under consideration, on-line scenario management (initiation as well as termination), analysis of results, and user friendly graphical capabilities. The ADAPT system is designed for a distributed computing environment; the scheduler can track multiple concurrent branches simultaneously. The scheduler is modularized so that the DET branching strategy can be modified (e.g. biasing towards the worst-case scenario/event). Independent database systems store data from the simulation tasks and the DET structure so that the event tree can be constructed and analyzed later. ADAPT is provided with a user-friendly client which can easily sort through and display the results of an experiment, precluding the need for the user to manually inspect individual simulator runs.

Reynolds, John↗

An Intelligent Distributed Ledger Construction Algorithm for IoT

Blockchain is the next generation of secure data management that creates near-immutable decentralized storage. Secure cryptography created a niche for blockchain to provide alternatives to well-known security compromises. However, design bottlenecks with traditional blockchain data structures scale poorly with increased network usage and are extremely computation-intensive. This made the technology difficult to combine with limited devices, like those in Internet of Things networks. In protocols like IOTA, replacement of blockchain's linked-list queue processing with a lightweight dynamic ledger showed remarkable throughput performance increase. However, current stochastic algorithms for ledger construction suffer distinct trade-offs between efficiency and security. This work proposed a machine-learning approach with a multi-arm bandit that resolved these issues and was designed for auditing on limited devices. This algorithm was tested in a reinforcement-learning environment simulating the IOTA ledger's construction with a decision tree. This study showed through regret analysis and experimentation that this approach was secure against impulse manipulation attacks while remaining energy-efficient. Although the IOTA protocol was a pioneer for lightweight distributed ledgers, it is expected that future blockchain protocols will adopt techniques similar to those presented in this work.

multi-arm bandit↗

Extremely Scalable Distributed Computation of Contour Trees via Pre-Simplification

Contour trees offer an abstract representation of the level set topology in scalar fields and are widely used in topological data analysis and visualization. However, applying contour trees to large-scale scientific datasets remains challenging due to scalability limitations. Recent developments in distributed hierarchical contour trees have addressed these challenges by enabling scalable computation across distributed systems. Building on these structures, advanced analytical tasks—such as volumetric branch decomposition and contour extraction—have been introduced to facilitate large-scale scientific analysis. Despite these advancements, such analytical tasks substantially increase memory usage, which hampers scalability. In this paper, we propose a pre-simplification strategy to significantly reduce the memory overhead associated with analytical tasks on distributed hierarchical contour trees. We demonstrate enhanced scalability through strong scaling experiments, constructing the largest known contour tree—comprising over half a trillion nodes with complex topology—in under 15 minutes on a dataset containing 550 billion elements.

Li, Mingzhe [University of Utah]↗

PANDORA: A Parallel Dendrogram Construction Algorithm for Single Linkage Clustering on GPU

This paper introduces Pandora, a parallel algorithm for computing dendrograms, the hierarchical cluster trees for single linkage clustering (SLC). Current parallel approaches construct dendrograms by partitioning a minimum spanning tree and removing edges. However, they struggle with skewed, hard-to-parallelize real-world dendrograms. Consequently, computing dendrograms is the sequential bottleneck in HDBSCAN*[21], a popular SLC variant. Pandora uses recursive tree contraction to address this limitation. Pandora contracts nodes to construct progressively smaller trees. It computes the smallest contracted dendrogram and expands it by inserting contracted edges. This recursive strategy is highly parallel, skew-independent, work-optimal, and well-suited for GPUs and multicores. We develop a performance portable implementation of Pandora in Kokkos[31] and evaluate its performance on multicore CPUs and multi-vendor GPUs (e.g., Nvidia, AMD) for dendrogram construction in HDBSCAN*. Multithreaded Pandora is 2.2x faster than the current best-multithreaded implementation. Our GPU version achieves 6-20x speedup on AMD GPUs and 10-37x on NVIDIA GPUs over multithreaded Pandora. Pandora removes HDBSCAN*’s sequential bottleneck, greatly boosting efficiency, particularly with GPUs.

Sao, Piyush↗

Generation of Low Fidelity Experimental Covariance Matrices for ICSBEP Cases

In validation, statistical methods routinely incorporate information from integral experiments to improve estimations of code biases and uncertainties. One source of high quality integral experiments is the ICSBEP Handbook. While uncertainties for criticality benchmarks are well characterized in the Handbook, information pertaining to the shared uncertainty/covariance between the cases is sparse, yet required for the aforementioned methods; correlations can result from using the same fuel for example. To remedy the lack of available covariance data in the Handbook, recent efforts have been undertaken, notably, within the framework of the NEA Expert Group on Uncertainty Analysis in Criticality Safety Assessment (UACSA) under the Working Party on Nuclear Criticality Safety (WPNCS) . The UACSA activities have focused primarily on comparing methods used to generate high quality covariance matrices for a small number of evaluations. Despite these efforts, within the Database for ICSBEP DICE only about 2% of the nearly 5000 experiments in the ICSBEP Handbook have correlation coefficients, so the amount of work required to generate the missing data appears daunting. And so, to fill in the gaps where no correlations are available, it is proposed to generate low fidelity correlations by isolating the largest components of uncertainty and determining the fraction shared between cases within an evaluation. Uncertainties can be shared when they are not independently measured, or the source of uncertainty is unchanged between cases. The degree to which an uncertainty is shared is linked to the experimental procedure; an approximation is made that in the absence of additional information, similar experimental procedures will lead to a similar fraction of shared uncertainty. Between experimental procedures there is some commonality. One method, proposed here, to help elucidate similar procedures is to encode each procedure into a decision tree grouped by uncertainty type. End nodes of the tree require judgment to assign the fraction of shared uncertainty between cases associated with the node. This can also be thought of as a set of rules, such that if experimental procedures and conditions occurred, then assign the shared uncertainty as some number between 0.0 and 1.0. One advantage of such a procedure is the formation of a transparent logical link between the judgment applied and the amount of shared uncertainty. This makes the results both more reproducible and easy to update. Generating correlation coefficients is reduced to developing decision trees that categorize how the experiments were done, and apply judgment of the degree of shared uncertainty for the end node of the tree. Trees need to be constructed after reading section 1 and 2 of the evaluation and some evaluations certainly do not contain enough information to create informative decision trees nor to assign an amount of shared uncertainty. These evaluations will not be considered here. (authors)

42 ENGINEERING↗

Point containment algorithms for constructive solid geometry with unbounded primitives

Here, we present several algorithms for evaluating point containment in constructive solid geometry (CSG) trees with unbounded primitives. Three algorithms are presented based on postfix, prefix, and infix notations of the CSG binary expression tree. We show that prefix and infix notations enable short-circuiting logic, which reduces the number of primitives that must be checked during point containment. To evaluate the performance of the algorithms, each algorithm was implemented in the OpenMC Monte Carlo particle transport code, which relies on CSG to represent solid bodies through which subatomic particles travel. Two sets of tests were carried out. First, the execution time to generate a rasterized image of a 2D slice of three CSG models of varying complexity was measured. Use of both prefix and infix notations offered significant speedup over the postfix notation that has traditionally been used in particle transport codes, with infix resulting in a 6 x reduction in execution time relative to postfix for a model of a tokamak fusion device. We then measured the execution time of neutron transport simulations of the same three models using each of the algorithms. The results and performance improvements reveal the same trends as for the rasterization test, with a 5.52 x overall speedup using the infix notation relative to the original postfix notation in OpenMC for the tokamak model.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Microbial communities and biogeochemical functioning across peatlands in the Athabasca Oil Sands region of Canada: Implications for reclamation and management

Abstract Peatlands play an important role in global biogeochemical cycles and are essential for multiple ecosystem functions. Understanding the environmental drivers of microbial functioning and community structure can provide insights to enable effective and evidence‐based management. However, it remains largely unknown how microbial diversity contributes to the functioning of belowground processes. Addressing this gap in knowledge will provide a better understanding of microbial‐mediated processes in peatlands that are undergoing restoration or reclamation. This study assessed the changes in microbial community diversity and structure as well as soil function by measuring microbial respiration on a range of substrates from three natural fen types found in the Athabasca Oil Sands region of Alberta, Canada (a poor fen, a hypersaline fen, and a tree‐rich fen) and a nearby constructed fen undergoing reclamation following open pit mining. Overall, substrate induced respiration was significantly higher in the constructed fen. Alpha diversity of fungi and prokaryotes was highest in the tree‐rich fen, and the composition of microbial communities was significantly different between fens. Both fungal and prokaryotic communities were strongly related to pore water pH and temperature, with plant richness also contributing to the shape of fungal communities. In summary, microbial community structure reflects the underlying differences in soil condition across different fens but plays essential roles in the ecological functions of soil. These findings provide a new outlook for the management of peatlands undergoing post‐mining reclamation. Future research on peatland reclamation should consider the dynamic interaction between communities and ecosystem functionality, for which this study forms a useful baseline.

54 ENVIRONMENTAL SCIENCES↗

All-multiplicity one-loop amplitudes in Born-Infeld electrodynamics from generalized unitarity

We initiate a study of non-supersymmetric Born-Infeld electrodynamics in 4d at the quantum level. Explicit all-multiplicity expressions are calculated for the purely rational one-loop amplitudes in the self-dual (+ + … +) and next-to-self-dual (- + … +) helicity sectors. Using a supersymmetric decomposition, d-dimensional unitarity cuts of the integrand factorize into tree-amplitudes in a 4d model of Born-Infeld photons coupled to a massive complex scalar. The two-scalar tree-amplitudes needed to construct the Born-Infeld integrand are computed using two complimentary approaches: (1) as a double-copy of Yang-Mills coupled to a massive adjoint scalar with a dimensionally reduced form of Chiral Perturbation Theory, and (2) by imposing consistency with low-energy theorems under a reduction from 4d to 3d and T-duality. The Born-Infeld integrand is integrated in d = 4 - 2ϵ dimensions at order Ο(ϵ 0 ) using the dimension-shifting formalism. We comment on the implications for electromagnetic duality in quantum Born-Infeld theory.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Stabilization of a locally minimal forest

The method of partial stabilization of locally minimal networks, which was invented by Ivanov and Tuzhilin to construct examples of shortest trees with given topology, is developed. According to this method, boundary vertices of degree 2 are not added to all edges of the original locally minimal tree, but only to some of them. The problem of partial stabilization of locally minimal trees in a finite-dimensional Euclidean space is solved completely in the paper, that is, without any restrictions imposed on the number of edges remaining free of subdivision. A criterion for the realizability of such stabilization is established. In addition, the general problem of searching for the shortest forest connecting a finite family of boundary compact sets in an arbitrary metric space is formalized; it is shown that such forests exist for any family of compact sets if and only if for any finite subset of the ambient space there exists a shortest tree connecting it. The theory developed here allows us to establish further generalizations of the stabilization theorem both for arbitrary metric spaces and for metric spaces with some special properties. Bibliography: 10 titles.

97 MATHEMATICS AND COMPUTING↗

Development of DNA methylation‐based epigenetic age predictors in loblolly pine ( Pinus taeda )

Abstract Biological ageing is connected to life history variation across ecological scales and informs a basic understanding of age‐related declines in organismal function. Altered DNA methylation dynamics are a conserved aspect of biological ageing and have recently been modelled to predict chronological age among vertebrate species. In addition to their utility in estimating individual age, differences between chronological and predicted ages arise due to acceleration or deceleration of epigenetic ageing, and these discrepancies are linked to disease risk and multiple life history traits. Although evidence suggests that patterns of DNA methylation can describe ageing in plants, predictions with epigenetic clocks have yet to be performed. Here, we resolve the DNA methylome across CpG, CHG, and CHH‐methylation contexts in the loblolly pine tree ( Pinus taeda ) and construct epigenetic clocks capable of predicting ages in this species within 6% of its maximum lifespan. Although patterns of CHH‐methylation showed little association with age, both CpG and CHG‐methylation contexts were strongly associated with ageing, largely becoming hypomethylated with age. Among age‐associated loci were those in close proximity to malate dehydrogenase, NADH dehydrogenase, and 18S and 26S ribosomal RNA genes. This study reports one of the first epigenetic clocks in plants and demonstrates the universality of age‐associated DNA methylation dynamics which can inform conservation and management practices, as well as our ecological and evolutionary understanding of biological ageing in plants.

60 APPLIED LIFE SCIENCES↗

Electroweak loop contributions to the direct detection of wino dark matter

Electroweak loop corrections to the matrix elements for the spin-independent scattering of cold dark matter particles on nuclei are generally small, typically below the uncertainty in the local density of cold dark matter. However, as shown in this paper, there are instances in which the electroweak loop corrections are relatively large, and change significantly the spin-independent dark matter scattering rate. An important example occurs when the dark matter particle is a wino, e.g., in anomaly-mediated supersymmetry breaking (AMSB) and pure gravity mediation (PGM) models. We find that the one-loop electroweak corrections to the spin-independent wino LSP scattering cross section generally interfere constructively with the tree-level contribution for AMSB models with negative Higgsino mixing, μ < 0, and in PGM-like models for both signs of μ, lifting the cross section out of the neutrino fog and into a range that is potentially detectable in the next generation of direct searches for cold dark matter scattering.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A defense in depth approach for nuclear power plant accident management

An initiating event may lead to a severe accident if the plant safety functions have been challenged or operators do not follow the appropriate accident management procedures. Beyond design basis accidents are those corresponding to events of very low occurrence probability but such an accident may lead to significant consequences. The defense in depth approach is important to assure nuclear safety even in a severe accident. Plant Damage States (PDS) can be defined by the combination of the possible values for each of the PDS parameters which are showed on the nuclear power plant simulator. PDS is used to identify what the initiating event is, and can also give the information of safety system's status whether they are bypassed, inoperable or not. Initiating event and safety system's status are used in the construction of Containment Event Tree (CET) to determine containment failure modes by using probabilistic risk assessment (PRA) technique. Different initiating events will correspond to different CETs. With these CETs, the core melt frequency of an initiating event can be found. The use of Plant Damage States (PDS) is a symptom-oriented approach. On the other hand, the use of Containment Event Tree (CET) is an event-oriented approach. In this study, the Taiwan's fourth nuclear power plants, the Lungmen nuclear power station (LNPS), which is an advanced boiling water reactor (ABWR) with fully digitized instrumentation and control (I and C) system is chosen as the target plant. The LNPS full scope engineering simulator is used to generate the testing data for method development. The following common initiating events are considered in this study: loss of coolant accidents (LOCA), total loss of feedwater (TLOFW), loss of offsite power (LOOP), station blackout (SBO). Studies have indicated that the combination of the symptom-oriented approach and the event-oriented approach can be helpful to find mitigation strategies and is useful for the accident management. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Los Alamos Canyon Ice Rink Parking Flood Plain Assessment

The project location is in Los Alamos Canyon east of the ice rink facility at the intersection of West and Omega roads (Figure 1). Forty eight parking spaces will be constructed on the north and south side of Omega Road, and a lighted walking path will be constructed to the ice rink. Some trees will be removed during this action. A guardrail of approximately 400 feet will be constructed along the north side of West Road to prevent unsafe parking in that area.

59 BASIC BIOLOGICAL SCIENCES↗

ArborX 2.0

ArborX library tackles a problem of efficiently finding geometric objects that are close in space. Variations of this problem, such as finding the nearest neighbors of a point, or finding all objects within a certain distance, are inherent components of applications in many fields. The data may be large so that solving the problem efficiently may require significant computational resources, such as multiple processors or accelerators such as general purpose GPUs. ArborX' main advantage in its ability to solve large problems efficiently utilizing a combination of distributed and on-node parallelism. ArborX can be run efficiently on a wide variety of hardware, including GPUs from different vendors, which distinguishes it from other available libraries which typically choose only few of these. The other advantage is that it supports both types of user problems: spatial problems (useful for intersections and finding objects within certain distance), and nearest neighbor problems. ArborX also supports flexible interface in its interaction with a user. Particularly, it allows a user to call user's own function on a positive match, a functionality not rarely available in other libraries. ArborX implements construction and traversal algorithms using efficient tree structures, such as bounding volume hierarchy (BVH). At its core, ArborX uses linear BVH for its low construction cost and sufficient quality. ArborX implements both spatial and nearest-neighbor traversal algorithms. ArborX also provides several clustering algorithms (minimum spanning tree, DBSCAN, HDBSCAN*), interpolation using minimum least squares and ray tracing. ArborX is written using C++, and is parallelized using the message passing interface (MPI) for the distributed communication, and the Kokkos library for on-node parallelism. This approach allows ArborX to be run on a wide variety of hardware, from common laptops and desktops to supercomputers while using the same codebase.

Prokopenko, Andrey [Oak Ridge National Laboratory ↗

Computing a Stable Distance on Merge Trees

Distances on merge trees facilitate visual comparison of collections of scalar fields. Two desirable properties for these distances to exhibit are 1) the ability to discern between scalar fields which other, less complex topological summaries cannot and 2) to still be robust to perturbations in the dataset. The combination of these two properties, known respectively as stability and discriminativity, has led to theoretical distances which are either thought to be or shown to be computationally complex and thus their implementations have been scarce. In order to design similarity measures on merge trees which are computationally feasible for more complex merge trees, many researchers have elected to loosen the restrictions on at least one of these two properties. The question still remains, however, if there are practical situations where trading these desirable properties is necessary. Here we construct a distance between merge trees which is designed to retain both discriminativity and stability. While our approach can be expensive for large merge trees, we illustrate its use in a setting where the number of nodes is small. This setting can be made more practical since we also provide a proof that persistence simplification increases the outputted distance by at most half of the simplified value. As a result, we demonstrate our distance measure on applications in shape comparison and on detection of periodicity in the von Kármán vortex street.

97 MATHEMATICS AND COMPUTING↗