Search NASA⌕ Search

SEARCH · Search NASA

Results for “Analysis preservation”

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 631 records · Page 35
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

A successful start for mLife

mLife made its debut with the publication of the inaugurating issue on March 30, 2022. We are pleased to have published 42 high-quality articles, including reviews, research articles, and application notes, which cover microbial genetics, biochemistry and physiology, ecology and evolution, pathogenic and public health microbiology, and so forth. Nine of the articles concern technical innovations and applications in areas including genome editing, single-cell analysis, and database. To pay tribute to the great microbiologist Carl Woese on the 10th anniversary of his death, the Journal published a special section containing three thought-provoking articles in the last issue of the year. mLife and its collaborating publisher Wiley have made great efforts to increase the Journal's national and continental representation. As a result, the Journal received submissions from over 20 countries in five continents last year. The authors of the published articles are from China, United States, Great Britain, France, Canada, Ger many, Japan, Switzerland, and Austria.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Dispersion and the speed-limited particle-in-cell algorithm

This paper discusses temporally continuous and discrete forms of the speed-limited particle-in-cell (SLPIC) method first treated by Werner et al. [Phys. Plasmas 25, 123512 (2018)]. The dispersion relation for a 1D1V electrostatic plasma whose fast particles are speed-limited is derived and analyzed. By examining the normal modes of this dispersion relation, we show that the imposed speed-limiting substantially reduces the frequency of fast electron plasma oscillations while preserving the correct physics of lower-frequency plasma dynamics (e.g. ion acoustic wave dispersion and damping). We then demonstrate how the timestep constraints of conventional electrostatic particle-in-cell methods are relaxed by the speed-limiting approach, thus enabling larger timesteps and faster simulations. Here, these results indicate that the SLPIC method is a fast, accurate, and powerful technique for modeling plasmas wherein electron kinetic behavior is nontrivial (such that a fluid/Boltzmann representation for electrons is inadequate) but evolution is on ion timescales.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Local bilinear computation of Jacobi sets

Abstract We propose a novel method for the computation of Jacobi sets in 2D domains. The Jacobi set is a topological descriptor based on Morse theory that captures gradient alignments among multiple scalar fields, which is useful for multi-field visualization. Previous Jacobi set computations use piecewise linear approximations on triangulations that result in discretization artifacts like zig-zag patterns. In this paper, we utilize a local bilinear method to obtain a more precise approximation of Jacobi sets by preserving the topology and improving the geometry. Consequently, zig-zag patterns on edges are avoided, resulting in a smoother Jacobi set representation. Our experiments show a better convergence with increasing resolution compared to the piecewise linear method. We utilize this advantage with an efficient local subdivision scheme. Finally, our approach is evaluated qualitatively and quantitatively in comparison with previous methods for different mesh resolutions and across a number of synthetic and real-world examples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Integrable symplectic maps with a polygon tessellation

Identifying integrable dynamics remains a formidable challenge, and despite centuries of research, only a handful of examples are known to date. In this article, we explore a distinct form of area-preserving (symplectic) mappings derived from the stroboscopic Poincaré cross section of a kicked rotator—an oscillator subjected to an external force periodically switched on in short pulses. The significance of this class of problems extends to various applications in physics and mathematics, including particle accelerators, crystallography, and studies of chaos. Notably, Suris's theorem constrains the integrability within this category of mappings, outlining potential scenarios with analytic invariants of motion. In this paper, we challenge the assumption of the analyticity of the invariant by exploring piecewise linear transformations on a torus ( T 2 ) and associated systems on the plane ( R 2 ), incorporating arithmetic quasiperiodicity and discontinuities. Introducing a new automated technique, we discovered previously unknown scenarios featuring polygonal invariants that form perfect tessellations and, moreover, fibrations of the plane or torus. This work reveals a novel category of planar tilings characterized by discrete symmetries that emerge from the invertibility of transformations and are intrinsically linked to the presence of integrability. Our algorithm relies on the analysis of the Poincaré rotation number and its piecewise monotonic nature for integrable cases, contrasting with the noisy behavior in the case of chaos, thereby allowing for clear separation. Some of the newly discovered systems exhibit the peculiar behavior of “integrable diffusion,” characterized by infinite and quasirandom hopping between tiles while being confined to a set of invariant segments. Finally, through the implementation of a smoothening procedure, all mappings can be generalized to quasi-integrable scenarios with suppressed volume occupied by chaotic trajectories, thereby opening doors to potential practical applications. Published by the American Physical Society 2024

43 PARTICLE ACCELERATORS↗
DOE OSTI2026

Transplatformer: translating toxicogenomic profiles between generations of platforms

Background Transcriptomic profiling technologies have advanced the analysis of biological and toxicological responses. However, substantial differences in probe design, dynamic range, gene coverage, and preprocessing pipelines across platforms introduce artifacts that limit cross-study integration and hinder the reuse of historical datasets. We aim to develop computational methods for accurate cross-platform translation to maximize the value of legacy resources. Results We present TransPlatformer a deep learning framework for translating gene expression profiles across heterogeneous toxicogenomics platforms. TransPlatformer employs a novel attention-based architecture to map high-dimensional fold-change vectors from legacy microarray technologies to current platforms. Models are trained and evaluated using DrugMatrix, spanning three technological generations. We investigate mixed-tissue, single-tissue, and cross-tissue training paradigms and benchmark performance against multilayer perceptron and matrix-completion baselines. In mixed-tissue training, TransPlatformer achieves a greater than 50% reduction in mean absolute error (0.043 vs. 0.09) and nearly doubles Pearson correlation ( ≈ 0.71 vs. 0.37) relative to baseline methods. Importantly, TransPlatformer preserves rare but biologically meaningful over- and under-expressed signals, with mean absolute error below 0.22. Single-tissue models yield further improvements for well-represented organs, such as a 10% reduction in liver mean absolute error, while underscoring the need for data augmentation strategies in low-sample tissues.ra Conclusions TransPlatformer provides an effective and scalable computational solution for cross-platform transcriptomic translation. By enabling biologically faithful harmonization of gene expression data, the proposed approach facilitates the reuse of legacy toxicogenomics datasets, enhances downstream biomarker discovery, and supports more reproducible predictive modeling in toxicology.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2026

Symmetry dilemmas in quantum computing for chemistry: A comprehensive analysis

Symmetry adaptation, universality, and gate efficiency are central but often competing requirements in quantum algorithms for electronic structure and many-body physics. For example, fully symmetry-adapted universal operator pools typically generate long and deep quantum circuits; gate-efficient universal operator pools generally break symmetries; and gate-efficient, fully symmetry-adapted operator pools may not be universal. In this work, we analyze such symmetry dilemmas both theoretically and numerically. On the theory side, we prove that the popular, gate-efficient operator pool consisting of singlet spin-adapted singles and perfect-pairing doubles is not universal when spatial symmetry is enforced. To demonstrate the strengths and weaknesses of the three types of pools, we perform numerical simulations using an adaptive algorithm paired with operator pools that are (i) fully symmetry-adapted and universal, (ii) fully symmetry-adapted and non-universal, and (iii) breaking a single symmetry and universal. Our numerical simulations encompass three physically relevant scenarios in which the target state is (i) the global ground state, (ii) the ground state crossed by a state differing in multiple symmetry properties, and (iii) the ground state crossed by a state differing in a single symmetry property. Our results show when symmetry-breaking but universal pools can be used safely, when enforcing at least one distinguishing symmetry suffices, and when a particular symmetry must be rigorously preserved to avoid variational collapse. Together, the formal and numerical analyses provide a practical guide for designing and benchmarking symmetry-adapted operator pools that balance universality, resource requirements, and robust state targeting in quantum simulations for chemistry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Scalable and accurate multi-GPU-based image reconstruction of large-scale ptychography data

Abstract While the advances in synchrotron light sources, together with the development of focusing optics and detectors, allow nanoscale ptychographic imaging of materials and biological specimens, the corresponding experiments can yield terabyte-scale volumes of data that can impose a heavy burden on the computing platform. Although graphics processing units (GPUs) provide high performance for such large-scale ptychography datasets, a single GPU is typically insufficient for analysis and reconstruction. Several works have considered leveraging multiple GPUs to accelerate the ptychographic reconstruction. However, most of these works utilize only the Message Passing Interface to handle the communications between GPUs. This approach poses inefficiency for a hardware configuration that has multiple GPUs in a single node, especially while reconstructing a single large projection, since it provides no optimizations to handle the heterogeneous GPU interconnections containing both low-speed (e.g., PCIe) and high-speed links (e.g., NVLink). In this paper, we provide an optimized intranode multi-GPU implementation that can efficiently solve large-scale ptychographic reconstruction problems. We focus on the maximum likelihood reconstruction problem using a conjugate gradient (CG) method for the solution and propose a novel hybrid parallelization model to address the performance bottlenecks in the CG solver. Accordingly, we have developed a tool, called PtyGer ( Pty chographic G PU(multipl e )-based r econstruction), implementing our hybrid parallelization model design. A comprehensive evaluation verifies that PtyGer can fully preserve the original algorithm’s accuracy while achieving outstanding intranode GPU scalability.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Requirements Description of GAMSOR and GAMSRC

This report presents the modeling and simulation capabilities of Argonne National Laboratory’s GAMSOR and GAMSRC code that is used in present reactor analysis activities. These capabilities will then be used to establish the set of verification tasks necessary to verify GAMSOR for use on commercial projects. A similar approach was taken for the PERSENT, REBUS and DIF3D software packages. The GAMSOR program is a modified version of DIF3D used to obtain the coupled neutron gamma flux distributions for a given reactor system. GAMSOR was first developed in the 1980s and its work has progressed in parallel with DIF3D throughout its various development phases. While GAMSOR is compatible with DIF3D-FD and DIF3D-Nodal, DIF3D-VARIANT is most commonly used today and will be the focus of the present verification effort. As covered in [1], GAMSOR was built to provide more accurate heating distributions by explicitly solving for both the gamma and neutron heating distributions. Without this consideration, gamma heat is normally assumed to be deposited locally at the site of gamma production. This is acceptable for modeling some phenomena because the total energy production is preserved, but it can lead to inaccurate approximations of fluence-dependent behaviors such as fuel performance, swelling, cladding embrittlement, radiation induced creep, and power peaking. The outputs from GAMSOR are contained in multiple intermediate and final output files: FIXSRC, VARSRC, GTFLUX, GHFLUX, PWDINT, NPDINT, and GPDINT. DIF3D normally produces a PWDINT file containing power density results, with the assumption that gamma rays are absorbed where they are emitted (i.e., energy deposition is local with no modeled transport). With GAMSOR, neutron power density (NPDINT) and gamma power density (GPDINT) are both produced, with their summed power densities replacing the results in PWDINT for total heating (i.e., recoverable) power density.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2023

Holographic measurement in CFT thermofield doubles

We extend the results of arXiv:2209.12903 by studying local projective measurements performed on subregions of two copies of a CFT 2 in the thermofield double state and investigating their consequences on the bulk double-sided black hole holographic dual. We focus on CFTs defined on an infinite line and consider measurements of both finite and semi-infinite subregions. In the former case, the connectivity of the bulk spacetime is preserved after the measurement. In the latter case, the measurement of two semi-infinite intervals in one CFT or of one semi-infinite interval in each CFT can destroy the Einstein-Rosen bridge and disconnect the bulk dual spacetime. In particular, we find that a transition between a connected and disconnected phase occurs depending on the relative size of the measured and unmeasured subregions and on the specific Cardy state the measured subregions are projected on. We identify this phase transition as an entangled/disentangled phase transition of the dual CFT system by computing the post-measurement holographic entanglement entropy between the two CFTs. We also find that bulk information encoded in one CFT in the absence of measurement can sometimes be reconstructed from the other CFT when a measurement is performed, or can be erased by the measurement. Finally, we show that a purely CFT calculation of the Renyi entropy using the replica trick yields results compatible with those obtained in our bulk analysis.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Singular value decomposition and similarity renormalization group evolution of nuclear interactions

One of the main challenges for ab initio nuclear many-body theory is the growth of computational and storage costs as calculations are extended to heavy, exotic, and structurally complex nuclei. Here, we investigate the factorization of nuclear interactions as a means to address this issue. We perform Singular Value Decompositions of nucleon-nucleon interactions in partial wave representation and study the dependence of the singular value spectrum on interaction characteristics like regularization scheme and resolution scales. We develop and implement the Similarity Renormalization Group (SRG) evolution of the factorized interaction, and demonstrate that this SVD-SRG approach accurately preserves two-nucleon observables. We find that low-resolution interactions allow the truncation of the SVD at low rank, and that a small number of relevant components is sufficient to capture the nuclear interaction and perform an accurate SRG evolution, while the Coulomb interaction requires special consideration. The rank is uniform across all partial waves, and almost independent of the basis choice in the tested cases. This suggests an interpretation of the relevant singular components as mere representations of a small set of abstract operators that can describe the interaction and its SRG flow. Following the traditional workflow for nuclear interactions, we discuss how the transformation between the center-of-mass and laboratory frames creates redundant copies of the partial wave components when implemented in matrix representation, and we discuss strategies for mitigation. Lastly, we test the low-rank approximation to the SRG-evolved interactions in many-body calculations using the In-Medium SRG. By including nuclear radii in our analysis, we verify that the implementation of the SRG using the singular vectors of the interaction does not spoil the evolution of other observables.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Pulse-by-pulse transient thermal deformation in crystal optics under high-repetition-rate FEL

Time-domain modeling of the thermal deformation of crystal optics can help define acceptable operational ranges across the pulse-energy repetition-rate phase space. In this paper, we have studied the transient thermal deformation of a water-cooled diamond crystal for a cavity-based X-ray free-electron laser (CBXFEL), either an X-ray free-electron laser oscillator (XFELO) or a regenerative amplifier X-ray free-electron laser (RAFEL), by numerical simulations including finite-element analysis and advanced data processing. Pulse-by-pulse transient thermal deformation of a 50 µm-thick diamond crystal has been performed with X-ray pulse repetition rates between 50 kHz and 1 MHz. Results for temperature and thermal deformation have been compared with the results of transient analysis using a continuous wave (CW) power loading. Temperature and thermal deformation results from pulse-by-pulse transient analysis vary with time about the results for the CW case for the same average power. The variation amplitude increases with pulse energy and decreases with repetition rate. When the repetition rate increases to infinity, both temperature and thermal deformation converge to the results for the CW case. Two critical time scales for the operation of crystal optics in a CBXFEL are (1) first-turn time, i.e. the time for the XFEL pulse to complete the first turn around the cavity so that the crystal sees the recirculated XFEL pulse, and (2) period-end time, i.e. the time that the next electron bunch arrives for the amplification, so that the crystal outcouples the amplified FEL power. For the same average power, simulation results show that the crystal thermal deformation seen by the XFEL beam decreases with repetition rate at the first-turn time of a 300 m-long cavity and increases with repetition rate at the period-end time. For the wavefront preservation requirement of the crystal optics, a pulse-energy versus repetition-rate phase space has been established. The upper bounds of the pulse energy at both first-turn and period-end times decreases with repetition rate, especially at the period-end time. The upper bound of the thermal deformation of the crystal at the period-end time for any repetition frequency can be estimated from the CW case. For a water-cooled diamond crystal of dimension 5 mm × 5 mm × 0.05 mm, the time to reach a quasi steady-state is about 50 ms for temperature and 50 µs for thermal deformation.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Screening of alkali-assisted storage conditions to define the operational window of deacetylation within storage systems in the bioenergy supply chain

Overcoming biomass heterogeneity and associated recalcitrance to thermal, chemical, and enzymatic depolymerization is a necessary but challenging aspect of valorizing lignocellulosic biomass to fuels and chemicals. Here, this study explores how this recalcitrance can be reduced during the supply chain unit operation of storage, which is required for seasonally harvested agricultural residues to maintain constant throughput at a biorefinery. In this work, partial alkali pretreatment was performed just prior to corn stover entering storage, which had the benefit of providing a high pH environment entering storage such that soluble sugars were preserved and saponified acetyl groups in hemicellulose. This work investigated a range of viable conditions where saponification and preservation occur simultaneously by varying the moisture content (40% and 60%) and concentrations of sodium hydroxide (low and high) during aerobic and anaerobic storage. Anaerobic conditions preserved overall dry matter below 5% in the three scenarios evaluated, and the highest alkali loading solubilized up to 15% lignin, 18% xylan, and 50% of acetate, meanwhile doubling the extractable components. Scanning electron microscopy images highlighted potential physical impacts including cell-wall disruption near vascular bundles, pitting within parenchyma cells, and cell-wall distortion. Techno-economic assessment indicated that this storage approach and associated logistics system is economically competitive with a conventional approach using low-moisture bales.

09 BIOMASS FUELS↗
DOE OSTI2023

Planck constraints and gravitational wave forecasts for primordial black hole dark matter seeded by multifield inflation

Here, we perform a Markov Chain Monte Carlo analysis of a simple yet generic multifield inflation model characterized by two scalar fields coupled to each other and nonminimally coupled to gravity, fit to Planck 2018 cosmic microwave background (CMB) data. In particular, model parameters are constrained by data on the amplitude of the primordial power spectrum of scalar curvature perturbations on CMB scales A s , the spectral index n s , and the ratio of power in tensor to scalar modes r, with a prior that the primordial power spectrum should also lead to primordial black hole (PBH) production sufficient to account for the observed dark matter abundance. We find that n s in particular controls the constraints on our model. Whereas previous studies of PBH formation from an ultraslow-roll phase of inflation have highlighted the need for at least one model parameter to be highly fine-tuned, we identify a degeneracy direction in parameter space such that shifts by ~10% of one parameter can be compensated by comparable shifts in other parameters while preserving a close fit between model predictions and observations. Furthermore, we find this allowed parameter region produces observable gravitational wave signals in the frequency ranges to which upcoming experiments are projected to be sensitive, including Advanced LIGO and Virgo, the Einstein Telescope, Cosmic Explorer, DECIGO, and LISA.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Efficient graph representation framework for chemical molecule similarity tasks

Graph data has emerged in numerous scientific domains and machine learning techniques have been widely used for analysis and learning of diverse data for prediction and decision. Machine learning techniques can readily address complex problems by leveraging their structural information. But graphs cannot be directly used for existing machine learning algorithms unless encoded as vectors. The problem of efficient representation of graphs is a substantial challenge in graph machine learning. In this paper, we propose a novel two-stage framework for the representation of chemical molecule graphs based on the strengths of Graph Isomorphism Networks (GINs) and Siamese autoencoders. In the first stage, the GIN model is constructed and trained using the structural information of chemical molecule graphs. Node attributes, edge attributes, and edge indices are used as input data, while graph attributes are used as labels. The GIN model effectively captures the structural characteristics of graphs and can accurately predict graph attributes, i.e., molecular properties. It also generates Graph Embeddings, represented as vectors that encode the structural information of graphs. In the second stage, Graph Embedding vectors are further optimized for downstream similarity tasks while preserving the graph structural information. The Siamese autoencoder is constructed and trained, which reduces the dimensionality of the Graph Embedding vectors, while maximizing the preservation of structural information in the original high-dimensional vectors. The resulting low-dimensional Graph Embeddings can be effectively utilized for tasks such as approximate nearest neighbor search. The experimental results demonstrate the effectiveness of our proposed framework in accurately predicting graph similarity.

Ma, Jiaji↗
DOE OSTI2023

Multifidelity uncertainty quantification with models based on dissimilar parameters

Multifidelity uncertainty quantification (MF UQ) sampling approaches have been shown to significantly reduce the variance of statistical estimators while preserving the bias of the highest-fidelity model, provided that the low-fidelity models are well correlated. However, maintaining a high level of correlation can be challenging, especially when models depend on different input uncertain parameters, which drastically reduces the correlation. Existing MF UQ approaches do not adequately address this issue. In this work, we propose a new sampling strategy that exploits a shared space to improve the correlation among models with dissimilar parameterization. We achieve this by transforming the original coordinates onto an auxiliary manifold using the adaptive basis (AB) method (Tipireddy and Ghanem, 2014). The AB method has two main benefits: (1) it provides an effective tool to identify the low-dimensional manifold on which each model can be represented, and (2) it enables easy transformation of polynomial chaos representations from high- to low-dimensional spaces. This latter feature is used to identify a shared manifold among models without requiring additional evaluations. Here we present two algorithmic flavors of the new estimator to cover different analysis scenarios, including those with legacy and non-legacy high-fidelity (HF) data. We provide numerical results for analytical examples, a direct field acoustic test, and a finite element model of a nuclear fuel assembly. For all examples, we compare the proposed strategy against both single-fidelity and MF estimators based on the original model parameterization.

42 ENGINEERING↗
DOE OSTI2026

Spatially Accelerated Winding Numbers for Curved Geometry

The generalized winding number (GWN) is a scalar field that supports robust containment queries on curved geometry, including non-watertight, overlapping, and nested boundary representations. While queries can be easily parallelized over samples, direct evaluation on parametric curves and surfaces remains costly for large and complex models. Fast, state-of-the-art GWN approaches leverage a spatial index to approximate the GWN, typically coupled with a Taylor expansion which approximates the GWN contribution for far clusters of geometric primitives. However, such methods operate only on discrete inputs such as triangle meshes and point clouds, and would introduce containment errors near boundaries if applied to curved input. We extend support for fast GWN evaluation over arbitrary collections of NURBS curves in 2D and trimmed NURBS patches in 3D via a Bounding Volume Hierarchy that stores efficiently precomputed moment data in the hierarchy nodes. When querying the hierarchy, approximations for far clusters are used alongside direct evaluation for nearby NURBS primitives, achieving sub-linear complexity while preserving the geometric features in the vicinity of the query point. Central to our performance improvements is an adaptive subdivision strategy for NURBS primitives during a preprocessing phase, creating better spatial partitions while retaining the same accuracy for containment decisions as a direct evaluation. We demonstrate the performance and accuracy of our approach across a large collection of 2D and 3D datasets.

Computer science↗
DOE OSTI2020

Biodefense Knowledge Management System

After the Amerithrax attacks, the Department of Homeland Security (DHS) recognized the need to link technical scientific information with law enforcement and national security information in the fight against bioterrorism. The Biodefense Knowledge Center (BKC) was formed to provide timely analysis of technical biodefense-related topics to support DHS and its customers in the interagency. The Biodefense Knowledge Management System (BKMS) was created as the backbone for information management within the BKC. It is a scalable, web-based knowledge management system for organizing disparate data sources. By combining information from 35+ data sources, the BKMS provides a searchable repository for technical information including scientific reports, journal articles, news articles, research funding databases, patent databases, and genomic datasets. The current system contains over 58 million documents and 450 million genomic records, and operates at several classification levels.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗
DOE OSTI2020

Installation Assignment Durations and Patterns of Army Personnel

The purpose of this document is to report on the development of personnel assignment duration statistical metrics and statistical descriptions for groups of Army personnel aggregated by rank, career management field, and other descriptors for 32 Continental United States (CONUS) Army installations. This information can be used for generating evidence-based measures of personnel exposure times associated with environmental health considerations at the installation and career management field levels. Assignment duration statistical descriptions were developed to provide temporal metrics for groups of personnel at Army installations as foundational data to support a variety of assessments. Statistical results of personnel assignment durations at the installation level are provided in several formats. The 50th percentile assignment duration represents the median number of days personnel in groups aggregated by rank and career management field spend at the 32 CONUS Army installations in this study. Likewise, other duration percentiles (90th) and quartiles of assignment durations for groups aggregated by rank and career management field spend at each installation were developed. Assignment path analysis provide statistical descriptions of assignment durations at Army installations throughout increments of time (e.g., 5 years, 10 years). Key groupings of assignment paths were achieved by analyzing the duration of assignments at installations in chronological order from entry throughout specified increments of military service to generate the most common assignment paths across the 32 CONUS Army installations in this study. The developed assignment duration analytics and duration statistical descriptions provide foundational temporal metrics for groups of personnel at 32 CONUS Army installations to support a variety of assessments including those by human resource planners and environmental health specialists.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗