Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Tracking Code”

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 325 records · Page 18

A model of the effects of heavy ion radiation on human tissue

In heavy ion radiotherapy and space travel humans are exposed to energetic heavy ions (C, Si, Fe and others). This type of irradiation often produces more severe biological effects per unit dose than more common X-rays. A new Monte Carlo model generates a physical space with the complex geometry of human tissue or a cell culture based model of tissue, which is affected by the passage of ionizing radiation. For irradiation, the model relies on a physical code for the ion track structure; for tissues, cellular maps are derived from two- or three-dimensional confocal microscopy images using image segmentation algorithm, which defines cells as pixilated volumes. The model is used to study tissue-specific statistics of direct ion hits and the remote ion action on cells. As an application of the technique, we considered the spatial pattern of apoptotic cells after heavy ion irradiation. The pattern of apoptosis is modeled as a stochastic process, which is defined by the action cross section taken from available experimental data. To characterize the degree of apoptosis, an autocorrelation function that describes the spatial correlation of apoptotic cells is introduced. The values of the autocorrelation function demonstrate the effect of the directionality of the radiation track on the spatial arrangements of inactivated cells in tissue. This effect is intrinsic only to high linear-energy-transfer radiation.

59 BASIC BIOLOGICAL SCIENCES↗

Parallelized and Vectorized Tracking Using Kalman Filters with CMS Detector Geometry and Events

The High-Luminosity Large Hadron Collider at CERN will be characterized by greater pileup of events and higher occupancy, making the track reconstruction even more computationally demanding. Existing algorithms at the LHC are based on Kalman filter techniques with proven excellent physics performance under a variety of conditions. Starting in 2014, we have been developing Kalman-filter-based methods for track finding and fitting adapted for many-core SIMD processors that are becoming dominant in high-performance systems. This paper summarizes the latest extensions to our software that allow it to run on the realistic CMS-2017 tracker geometry using CMSSW-generated events, including pileup. The reconstructed tracks can be validated against either the CMSSW simulation that generated the hits, or the CMSSW reconstruction of the tracks. In general, the code's computational performance has continued to improve while the above capabilities were being added. We demonstrate that the present Kalman filter implementation is able to reconstruct events with comparable physics performance to CMSSW, while providing generally better computational performance. Further plans for advancing the software are discussed.

Cerati, Giuseppe↗

Uncertainty propagation in full-core Monte Carlo depletion simulations using Serpent

The desire to accurately model the heterogeneity of the nuclear reactor environment combined with the ever more powerful computational resources have made in recent years the use of Monte Carlo method more attractive and feasible (if challenging) even for 3-D full core depletion simulation. However, in this case statistical uncertainty is combined with error propagating through the calculation from previous steps. In an effort to understand this error propagation, a numerical study was undertaken and previously reported modeling depletion of a four fuel assemblies (a 'quad'). This work extends results and analysis on a full nuclear reactor core depletion simulation where isotopics of individual fuel pins is tracked. By changing the code's initial random number seed, the data produced by a series of 19 replica runs was used to investigate the true and apparent variance in k{sub eff} and pin powers. It is hoped that this results can help to identify some common regularities in the behavior of uncertainty in several key parameters, and ultimately develop a predictive model. (authors)

97 MATHEMATICS AND COMPUTING↗

Beam Losses and Background Loads on Collider Detectors Due to Beam-Gas Interactions in the LHC

With a fully-operational high-efficient collimation system in the LHC, nuclear interactions of circulating protons with residual gas in the machine beam pipe can be a major source of beam losses in the vicinity of the collider detectors, responsible for the machine-induced backgrounds. Realistic modeling of Coulomb scattering, elastic and inelastic interactions of 7-TeV protons with nuclei in the vacuum chamber of the cold and warm sections of the LHC ring--with an appropriate pressure profile--is performed with the STRUCT and MARS15 codes. Multi-turn tracking of the primary beams, propagation of secondaries through the lattice, their interception by the tertiary collimators TCT as well as properties of corresponding particle distributions at the CMS and ATLAS detectors are studied in great detail and results presented in this paper.

43 PARTICLE ACCELERATORS↗

Improved Compression of Wavelet-Transformed Images

A recently developed data-compression method is an adaptive technique for coding quantized wavelet-transformed data, nominally as part of a complete image-data compressor. Unlike some other approaches, this method admits a simple implementation and does not rely on the use of large code tables. A common data compression approach, particularly for images, is to perform a wavelet transform on the input data, and then losslessly compress a quantized version of the wavelet-transformed data. Under this compression approach, it is common for the quantized data to include long sequences, or runs, of zeros. The new coding method uses prefixfree codes for the nonnegative integers as part of an adaptive algorithm for compressing the quantized wavelet-transformed data by run-length coding. In the form of run-length coding used here, the data sequence to be encoded is parsed into strings consisting of some number (possibly 0) of zeros, followed by a nonzero value. The nonzero value and the length of the run of zeros are encoded. For a data stream that contains a sufficiently high frequency of zeros, this method is known to be more effective than using a single variable length code to encode each symbol. The specific prefix-free codes used are from two classes of variable-length codes: a class known as Golomb codes, and a class known as exponential-Golomb codes. The codes within each class are indexed by a single integer parameter. The present method uses exponential-Golomb codes for the lengths of the runs of zeros, and Golomb codes for the nonzero values. The code parameters within each code class are determined adaptively on the fly as compression proceeds, on the basis of statistics from previously encoded values. In particular, a simple adaptive method has been devised to select the parameter identifying the particular exponential-Golomb code to use. The method tracks the average number of bits used to encode recent runlengths, and takes the difference between this average length and the code parameter. When this difference falls outside a fixed range, the code parameter is updated (increased or decreased). The Golomb code parameter is selected based on the average magnitude of recently encoded nonzero samples. The coding method requires no floating- point operations, and more readily adapts to local statistics than other methods. The method can also accommodate arbitrarily large input values and arbitrarily long runs of zeros. In practice, this means that changes in the dynamic range or size of the input data set would not require a change to the compressor. The algorithm has been tested in computational experiments on test images. A comparison with a previously developed algorithm that uses large code tables (generated via Huffman coding on training data) suggests that the data-compression effectiveness of the present algorithm is comparable to the best performance achievable by the previously developed algorithm.

Kiely, Aaron↗

Coded spread spectrum digital transmission system design study

Results are presented of a comprehensive study of the performance of Viterbi-decoded convolutional codes in the presence of nonideal carrier tracking and bit synchronization. A constraint length 7, rate 1/3 convolutional code and parameters suitable for the space shuttle coded communications links are used. Mathematical models are developed and theoretical and simulation results are obtained to determine the tracking and acquisition performance of the system. Pseudorandom sequence spread spectrum techniques are also considered to minimize potential degradation caused by multipath.

Heller, J. A.↗

Quick-look decoding schemes for DSN convolutional codes

Decoding schemes are proposed for the tracking systems of the galileo project. Quick look decoding schemes requiring only shift registers are given for the DSN (7, 1/2) and (7, 1/3) convolutional codes. These schemes are used when the communication channel is error free. The schemes decode the data, symbol errors, and the lack of node syncronization.

Greenhall, C. A.↗

\texttt{qec\_code\_sim}: An open-source Python framework for estimating the effectiveness of quantum-error correcting codes on superconducting qubits

Quantum computers are highly susceptible to errors due to unintended interactions with their environment. It is crucial to correct these errors without gaining information about the quantum state, which would result in its destruction through back-action. Quantum Error Correction (QEC) provides information about occurred errors without compromising the quantum state of the system. However, the implementation of QEC has proven to be challenging due to the current performance levels of qubits -- break-even requires fabrication and operation quality that is beyond the state-of-the-art. Understanding how qubit performance factors into the success of a QEC code is a valuable exercise for tracking progress towards fault-tolerant quantum computing. Here we present \texttt{qec\_code\_sim}, an open-source, lightweight Python framework for studying the performance of small quantum error correcting codes under the influence of a realistic error model appropriate for superconducting transmon qubits, with the goal of enabling useful hardware studies and experiments. \texttt{qec\_code\_sim} requires minimal software dependencies and prioritizes ease of use, ease of change, and pedagogy over execution speed. As such, it is a tool well-suited to small teams studying systems on the order of one dozen qubits.

Lopez, Santiago↗

A new approach to calculate the transport matrix in RF cavities

A realistic approach to calculate the transport matrix in RF cavities is developed. It is based on joint solution of equations of longitudinal and transverse motion of a charged particle in an electromagnetic field of the linac. This field is a given by distribution (measured or calculated) of the component of the longitudinal electric field on the axis of the linac. New approach is compared with other matrix methods to solve the same problem. The comparison with code ASTRA has been carried out. Complete agreement for tracking results for a TESLA-type cavity is achieved. A corresponding algorithm will be implemented into the MARS15 code. A realistic approach to calculate the transport matrix in RF cavities is developed. Complete agreement for tracking results with existed code ASTRA is achieved. New algorithm will be implemented into MARS15 code.

43 PARTICLE ACCELERATORS↗

Performance Assessment of LunaNet’s Augmented Forward Signal

LunaNet provides a common set of interoperable specifications for communication and position, navigation and time (PNT) services and interfaces soon to be implemented in lunar vicinity. The LunaNet Interoperability Specification (LNIS) provides the design for the GNSS-like Augmented Forward Signal (AFS), which enables orbiting and surface users in lunar space, such as Artemis, to estimate their position, velocity, and time. The specification of AFS defines two orthogonal signal components on a single carrier: the in-phase component (AFS-I), a lower-chip-rate data channel tailored for applications where low SWaP (Size, Weight, and Power) is critical (e.g., IoT devices or search and rescue), and the quadrature component (AFS-Q), a high-chip-rate data-less pilot signal for high-precision, robust lunar navigation and positioning applications. An initial description of AFS was provided in [1], with initial analysis results shown in [2] and [3] and the current signal in space description provided in [4]. As part of NASA's Lunar Communication Relay and Navigation Systems (LCRNS) project, this work expands upon the initial analysis results and proposes a new expanded set of AFS-Q spreading codes that exceed the cross-correlation and autocorrelation sidelobe performance of L1C and other GNSS signals, while providing additional expansion capabilities for future provider satellites. A set of 420 codes was selected from a Weil-based code derived from the prime number 10247, which is larger than the 10243 prime number used to derive Beidou’s B1C Weil sequences. Both the initial set of 210 codes and the expanded set of 420 codes are shown to provide the best cross-correlation of any 10230-chip satellite navigation codes. The performance is demonstrated for hierarchical sets of spreading codes optimized and organized in sets of 30 codes. The new codes were developed using an optimization approach and correlation methodology described in [5]. The work also compares LunaNet’s AFS to terrestrial GNSS signals in terms of acquisition, tracking, and data demodulation performance. Performance is evaluated for receivers that only track the 1.023 MCPS data channel spreading code for low SWaP IoT use cases, as well as for receivers that track both the 1.023 MCPS data channel and the 5.115 MCPS pilot channel spreading code for high-performance use cases. Performance is assessed in the presence of interference and thermal noise. The analysis is performed in terms of expected operating conditions on the lunar surface. Several unique flexibility aspects of the augmented forward signal are described, including the use of the Q channel’s secondary and tertiary codes to enable variable coherent integrations during acquisition. This is compared to GNSS signals such as L5/E5 and MBOC in terms of achievable processing gain for interference mitigation versus acquisition complexity. The work details acquisition and tracking techniques used to optimally acquire and track the primary, secondary, and tertiary codes on the Q channel, as well as acquisition of the I channel spreading code. Acquisition of the 8 ms Q channel spreading code is also compared to joint acquisition of the I and Q channel primary codes in noise and interference environments.

LCRNS↗

Ranging code processor

System extracts range data from pseudorandom-coded range radar used to track a moving body. Pseudorandom binary waveforms with favorable correlation properties are transmitted and their reflections received and processed. The phase difference between the received and transmitted codes gives an accurate measure of the distance to the moving body.

Anderson, T. O.↗

Adapting CLUTCH methodology to multigroup TSUNAMI-3D for eigenvalue sensitivity calculations

The sensitivity of the eigenvalue to uncertainties in nuclear data and its evaluation are important for nuclear criticality safety. TSUNAMI-3D sequences within the SCALE code system offer several options to the user community for calculating eigenvalue sensitivity coefficients with multigroup (MG) and continuous energy (CE) 3D transport capabilities. TSUNAMI-3D sequences implement the adjoint-based perturbation theory with MG KENO code, the Contributon Linked eigenvalue sensitivity/Uncertainty estimation via Track length importance CHaracterization (CLUTCH) method with CE KENO code, and the Iterated Fission Probability (IFP) method with CE KENO and Shift codes. Each method has benefits and limitations depending on the problem that is run. The work presented here aims to adapt the CLUTCH method, which enables the Contributon method's mesh-free, memory-efficient approach for calculating adjoint-weighted tallies for sensitivity calculations, to the MG TSUNAMI-3D sequence. This application would eliminate the explicit adjoint KENO calculation, as well as the memory-consuming mesh flux moment tallies required by the conventional MG TSUNAMI-3D. Smaller memory footprints in the CLUTCH methodology and relatively shorter runtimes in MG KENO transport can make MG TSUNAMI-3D a viable method for some complex problems. Moreover, this adaptation allows MG sensitivity calculations with Shift, ORNL's next-generation high-performance Monte Carlo transport code, which currently does not offer any sensitivity capabilities with MG particle transport simulations. Initial implementation of the new MG TSUNAMI-3D sequence and its preliminary results with a selected critical benchmark experiment in the Verified, Archived Library of Inputs and Data (VALID) are presented in this study.

KENO↗

Velocity field calculation for non-orthogonal numerical grids

Computational grids containing cell faces that do not align with an orthogonal (e.g. Cartesian, cylindrical) coordinate system are routinely encountered in porous-medium numerical simulations. Such grids are referred to in this study as non-orthogonal grids because some cell faces are not orthogonal to a coordinate system plane (e.g. xy, yz or xz plane in Cartesian coordinates). Non-orthogonal grids are routinely encountered at the Savannah River Site in porous-medium flow simulations for Performance Assessments and groundwater flow modeling. Examples include grid lines that conform to the sloping roof of a waste tank or disposal unit in a 2D Performance Assessment simulation, and grid surfaces that conform to undulating stratigraphic surfaces in a 3D groundwater flow model. Particle tracking is routinely performed after a porous-medium numerical flow simulation to better understand the dynamics of the flow field and/or as an approximate indication of the trajectory and timing of advective solute transport. Particle tracks are computed by integrating the velocity field from cell to cell starting from designated seed (starting) positions. An accurate velocity field is required to attain accurate particle tracks. However, many numerical simulation codes report only the volumetric flowrate (e.g. PORFLOW) and/or flux (flowrate divided by area) crossing cell faces. For an orthogonal grid, the normal flux at a cell face is a component of the Darcy velocity vector in the coordinate system, and the pore velocity for particle tracking is attained by dividing by water content. For a non-orthogonal grid, the flux normal to a cell face that lies outside a coordinate plane is not a true component of velocity with respect to the coordinate system. Nonetheless, normal fluxes are often taken as Darcy velocity components, either naively or with accepted approximation. To enable accurate particle tracking or otherwise present an accurate depiction of the velocity field for a non-orthogonal grid, Darcy velocity components are rigorously derived in this study from normal fluxes to cell faces, which are assumed to be provided by or readily computed from porous-medium simulation code output. The normal fluxes are presumed to satisfy mass balances for every computational cell, and if so, the derived velocity fields are consistent with these mass balances. Derivations are provided for general two-dimensional quadrilateral and three-dimensional hexagonal systems, and for the commonly encountered special cases of perfectly vertical side faces in 2D and 3D and a rectangular footprint in 3D.

97 MATHEMATICS AND COMPUTING↗

90% Compliance Pilot Studies Final Report

In early 2010, the U.S. Department of Energy (DOE) announced an opportunity for states to participate in energy code compliance evaluation pilot studies. DOE worked with five Regional Energy Efficiency Organizations (REEOs, formerly referred to as Energy Efficiency Partnerships, or EEPs) to fund pilot studies covering nine states. This report details conclusions stated in individual state reports, as well as conclusions drawn by DOE based on their oversight of the pilot studies, and based on discussions held with the REEOs and representatives from the pilot study states and their contractors.

building codes↗

A comparison of Lagrangian/Eulerian approaches for tracking the kinematics of high deformation solid motion.

The modeling of solids is most naturally placed within a Lagrangian framework because it requires constitutive models which depend on knowledge of the original material orientations and subsequent deformations. Detailed kinematic information is needed to ensure material frame indifference which is captured through the deformation gradient F. Such information can be tracked easily in a Lagrangian code. Unfortunately, not all problems can be easily modeled using Lagrangian concepts due to severe distortions in the underlying motion. Either a Lagrangian/Eulerian or a pure Eulerian modeling framework must be introduced. We discuss and contrast several Lagrangian/Eulerian approaches for keeping track of the details of material kinematics.

97 MATHEMATICS AND COMPUTING↗

Tracking of raindrops in flow over an airfoil

The splashback that occurs when raindrops impact an airfoil results in an 'ejecta fog' of small droplets around the leading edge. Acceleration of these droplets by the air flow field is a momentum sink for the air flow and has been hypothesized to contribute to the degradation of airfoil performance in heavy rain. Presented here is a one-way coupled Eulerian-Lagrangian particle tracking scheme to evaluate droplet number densities and momentum sink terms around a NACA 64-210 airfoil section for three rainfall rates. A laminar air flow field is determined with a standard CFD code and input to the particle tracking algorithm. Raindrops are assumed to be non-interacting, non-deforming, non-evaporating, and non-spinning spheres and are tracked through the curvilinear grid used by the air flow code. A simple model is used to simulate impacts and the resulting splashback on the airfoil surface.

Valentine, James R.↗

SU-E-P-26: Oncospace: A Shared Radiation Oncology Database System Designed for Personalized Medicine, Decision Support, and Research

Purpose: Advancement in Radiation Oncology (RO) practice develops through evidence based medicine and clinical trial. Knowledge usable for treatment planning, decision support and research is contained in our clinical data, stored in an Oncospace database. This data store and the tools for populating and analyzing it are compatible with standard RO practice and are shared with collaborating institutions. The question is - what protocol for system development and data sharing within an Oncospace Consortium? We focus our example on the technology and data meaning necessary to share across the Consortium. Methods: Oncospace consists of a database schema, planning and outcome data import and web based analysis tools.1) Database: The Consortium implements a federated data store; each member collects and maintains its own data within an Oncospace schema. For privacy, PHI is contained within a single table, accessible to the database owner.2) Import: Spatial dose data from treatment plans (Pinnacle or DICOM) is imported via Oncolink. Treatment outcomes are imported from an OIS (MOSAIQ).3) Analysis: JHU has built a number of webpages to answer analysis questions. Oncospace data can also be analyzed via MATLAB or SAS queries.These materials are available to Consortium members, who contribute enhancements and improvements. Results: 1) The Oncospace Consortium now consists of RO centers at JHU, UVA, UW and the University of Toronto. These members have successfully installed and populated Oncospace databases with over 1000 patients collectively.2) Members contributing code and getting updates via SVN repository. Errors are reported and tracked via Redmine. Teleconferences include strategizing design and code reviews.3) Successfully remotely queried federated databases to combine multiple institutions’ DVH data for dose-toxicity analysis (see below – data combined from JHU and UW Oncospace). Conclusion: RO data sharing can and has been effected according to the Oncospace Consortium model: http://oncospace.radonc.jhmi.edu/ . John Wong - SRA from Elekta; Todd McNutt - SRA from Elekta; Michael Bowers - funded by Elekta.

60 APPLIED LIFE SCIENCES↗

Advanced coding and modulation schemes for TDRSS

This paper describes the performance of the Ungerboeck and pragmatic 8-Phase Shift Key (PSK) Trellis Code Modulation (TCM) coding techniques with and without a (255,223) Reed-Solomon outer code as they are used for Tracking Data and Relay Satellite System (TDRSS) S-Band and Ku-Band return services. The performance of these codes at high data rates is compared to uncoded Quadrature PSK (QPSK) and rate 1/2 convolutionally coded QPSK in the presence of Radio Frequency Interference (RFI), self-interference, and hardware distortions. This paper shows that the outer Reed-Solomon code is necessary to achieve a 10(exp -5) Bit Error Rate (BER) with an acceptable level of degradation in the presence of RFI. This paper also shows that the TCM codes with or without the Reed-Solomon outer code do not perform well in the presence of self-interference. In fact, the uncoded QPSK signal performs better than the TCM coded signal in the self-interference situation considered in this analysis. Finally, this paper shows that the E(sub b)/N(sub 0) degradation due to TDRSS hardware distortions is approximately 1.3 dB with a TCM coded signal or a rate 1/2 convolutionally coded QPSK signal and is 3.2 dB with an uncoded QPSK signal.

Harrell, Linda↗