Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Coding theory”

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 415 records · Page 23

SENSMG: First-Order Sensitivities of Neutron Reaction Rates, Reaction-Rate Ratios, Leakage, k eff , and α Using PARTISN

SENSMG is a tool for calculating the first-order sensitivities of reaction-rate ratios, k eff , and α in critical problems and reaction-rate ratios, reaction rates, and leakage in fixed-source problems to multigroup cross sections, isotope densities, material mass densities, and interface locations using the PARTISN multigroup discrete-ordinates code by implementing Generalized Perturbation Theory. SENSMG can be used for one-dimensional spherical and slab (r) and two-dimensional cylindrical (r-z) geometries. For fixed-source (leakage) problems, SENSMG relies on the MISC and/or SOURCES4C codes to compute neutron source rate densities from spontaneous fission and (α,n) sources. SENSMG is a combination of Python and Fortran and was developed under Linux. This computer code abstract describes all user inputs, the input file, and output files. Furthermore, this computer code abstract describes how SENSMG can be modified to support different computer platforms, PARTISN versions, or cross-section availability. Several verification problems are presented in which SENSMG results are compared with MCNP6, SCALE6.2, and direct perturbations (central differences).

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Electron–phonon physics from first principles using the EPW code

EPW is an open-source software for ab initio calculations of electron–phonon interactions and related materials properties. The code combines density functional perturbation theory and maximally localized Wannier functions to efficiently compute electron–phonon coupling matrix elements, and to perform predictive calculations of temperature-dependent properties and phonon-assisted quantum processes in bulk solids and low-dimensional materials. Here, we report on significant developments in the code since 2016, namely: a transport module for the calculation of charge carrier mobility under electric and magnetic fields using the Boltzmann transport equation; a superconductivity module for calculations of phonon-mediated superconductors using the anisotropic multi-band Eliashberg theory; an optics module for calculations of phonon-assisted indirect transitions; a module for the calculation of small and large polarons without supercells; and a module for calculating band structure renormalization and temperature-dependent optical spectra using the special displacement method. For each capability, we outline the methodology and implementation and provide example calculations.

36 MATERIALS SCIENCE↗

Trade-off capacities of the quantum Hadamard channels

Coding theorems in quantum Shannon theory express the ultimate rates at which a sender can transmit information over a noisy quantum channel. More often than not, the known formulas expressing these transmission rates are intractable, requiring an optimization over an infinite number of uses of the channel. Researchers have rarely found quantum channels with a tractable classical or quantum capacity, but when such a finding occurs, it demonstrates a complete understanding of that channel's capabilities for transmitting classical or quantum information. Here we show that the three-dimensional capacity region for entanglement-assisted transmission of classical and quantum information is tractable for the Hadamard class of channels. Examples of Hadamard channels include generalized dephasing channels, cloning channels, and the Unruh channel. The generalized dephasing channels and the cloning channels are natural processes that occur in quantum systems through the loss of quantum coherence or stimulated emission, respectively. The Unruh channel is a noisy process that occurs in relativistic quantum information theory as a result of the Unruh effect and bears a strong relationship to the cloning channels. We give exact formulas for the entanglement-assisted classical and quantum communication capacity regions of these channels. The coding strategy for each of these examples is superior to a naieve time-sharing strategy, and we introduce a measure to determine this improvement.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An optimization program based on the method of feasible directions: Theory and users guide

The theory and user instructions for an optimization code based on the method of feasible directions are presented. The code was written for wide distribution and ease of attachment to other simulation software. Although the theory of the method of feasible direction was developed in the 1960's, many considerations are involved in its actual implementation as a computer code. Included in the code are a number of features to improve robustness in optimization. The search direction is obtained by solving a quadratic program using an interior method based on Karmarkar's algorithm. The theory is discussed, focusing on the important and often overlooked role played by the various parameters guiding the iterations within the program. Also discussed is a robust approach for handling infeasible starting points. The code was validated by solving a variety of structural optimization test problems that have known solutions obtained by other optimization codes. It has been observed that this code is accurate and robust: it has solved a variety of problems from different starting points. However, the code is inefficient in that it takes considerable CPU time as compared with certain other available codes. Further work is required to improve its efficiency while retaining its robustness.

Ashok D. Belegundu↗

Assessment of 3D Codes for Predicting Liner Attenuation in Flow Ducts

This paper presents comparisons of seven propagation codes for predicting liner attenuation in ducts with flow. The selected codes span the spectrum of methods available (finite element, parabolic approximation, and pseudo-time domain) and are collectively representative of the state-of-art in the liner industry. These codes are included because they have two-dimensional and three-dimensional versions and can be exported to NASA's Columbia Supercomputer. The basic assumptions, governing differential equations, boundary conditions, and numerical methods underlying each code are briefly reviewed and an assessment is performed based on two predefined metrics. The two metrics used in the assessment are the accuracy of the predicted attenuation and the amount of wall clock time to predict the attenuation. The assessment is performed over a range of frequencies, mean flow rates, and grazing flow liner impedances commonly used in the liner industry. The primary conclusions of the study are (1) predicted attenuations are in good agreement for rigid wall ducts, (2) the majority of codes compare well to each other and to approximate results from mode theory for soft wall ducts, (3) most codes compare well to measured data on a statistical basis, (4) only the finite element codes with cubic Hermite polynomials capture extremely large attenuations, and (5) wall clock time increases by an order of magnitude or more are observed for a three-dimensional code relative to the corresponding two-dimensional version of the same code.

Watson, W. R.↗

Large-scale Nanostructure Simulations from X-ray Scattering Data On Graphics Processor Clusters

X-ray scattering is a valuable tool for measuring the structural properties of materialsused in the design and fabrication of energy-relevant nanodevices (e.g., photovoltaic, energy storage, battery, fuel, and carbon capture andsequestration devices) that are key to the reduction of carbon emissions. Although today's ultra-fast X-ray scattering detectors can provide tremendousinformation on the structural properties of materials, a primary challenge remains in the analyses of the resulting data. We are developing novelhigh-performance computing algorithms, codes, and software tools for the analyses of X-ray scattering data. In this paper we describe two such HPCalgorithm advances. Firstly, we have implemented a flexible and highly efficient Grazing Incidence Small Angle Scattering (GISAXS) simulation code based on theDistorted Wave Born Approximation (DWBA) theory with C++/CUDA/MPI on a cluster of GPUs. Our code can compute the scattered light intensity from any givensample in all directions of space; thus allowing full construction of the GISAXS pattern. Preliminary tests on a single GPU show speedups over 125x compared tothe sequential code, and almost linear speedup when executing across a GPU cluster with 42 nodes, resulting in an additional 40x speedup compared to usingone GPU node. Secondly, for the structural fitting problems in inverse modeling, we have implemented a Reverse Monte Carlo simulation algorithm with C++/CUDAusing one GPU. Since there are large numbers of parameters for fitting in the in X-ray scattering simulation model, the earlier single CPU code required weeks ofruntime. Deploying the AccelerEyes Jacket/Matlab wrapper to use GPU gave around 100x speedup over the pure CPU code. Our further C++/CUDA optimization deliveredan additional 9x speedup.

36 MATERIALS SCIENCE↗

Fault-tolerant computation with higher-dimensional systems

Instead of a quantum computer where the fundamental units are 2-dimensional qubits, the author considers a quantum computer made up of d-dimensional systems. There is a straightforward generalization of the class of stabilizer codes to d-dimensional systems, and he discusses the theory of fault-tolerant computation using such codes. He proves that universal fault-tolerant computation is possible with any higher-dimensional stabilizer code for prime d.

CORRECTIONS↗

Thermodynamics of signal transduction systems and fluctuation theorem in a signal cascade

Biochemical chain reactions are signal transduction cascades that can transmit biological information about the intracellular environment. In this study, we modelled a chain reaction as a code string for applying information theory. Herein, we assumed that cell signal transduction selects a strategy to maximize the transduced signal per signal event duration. To investigate the same, we calculated the information transmission capacity of the reaction chain by maximizing the average entropy production rate per reaction time, indicating the idea of the entropy coding method. Moreover, we defined a signal cascade trajectory. Subsequently, we found that the logarithm of the forward and reverse transition ratio per reaction time is equal to the entropy production rate, which derives the form of the fluctuation theorem in signal transduction. Our findings suggest the application of information entropy theory for analysing signal transduction.

59 BASIC BIOLOGICAL SCIENCES↗

Earth-moon system: Dynamics and parameter estimation; numerical considerations and program documentation

Major activities included coding and verifying equations of motion for the earth-moon system. Some attention was also given to numerical integration methods and parameter estimation methods. Existing analytical theories such as Brown's lunar theory, Eckhardt's theory for lunar rotation, and Newcomb's theory for the rotation of the earth were coded and verified. These theories serve as checks for the numerical integration. Laser ranging data for the period January 1969 - December 1975 was collected and stored on tape. The main goal of this research is the development of software to enable physical parameters of the earth-moon system to be estimated making use of data available from the Lunar Laser Ranging Experiment and the Very Long Base Interferometry experiment of project Apollo. A more specific goal is to develop software for the estimation of certain physical parameters of the moon such as inertia ratios, and the third and fourth harmonic gravity coefficients.

Breedlove, W. J., Jr.↗

High compression image and image sequence coding

The digital representation of an image requires a very large number of bits. This number is even larger for an image sequence. The goal of image coding is to reduce this number, as much as possible, and reconstruct a faithful duplicate of the original picture or image sequence. Early efforts in image coding, solely guided by information theory, led to a plethora of methods. The compression ratio reached a plateau around 10:1 a couple of years ago. Recent progress in the study of the brain mechanism of vision and scene analysis has opened new vistas in picture coding. Directional sensitivity of the neurones in the visual pathway combined with the separate processing of contours and textures has led to a new class of coding methods capable of achieving compression ratios as high as 100:1 for images and around 300:1 for image sequences. Recent progress on some of the main avenues of object-based methods is presented. These second generation techniques make use of contour-texture modeling, new results in neurophysiology and psychophysics and scene analysis.

Kunt, Murat↗

Modeling a thermionic energy converter using finite-difference time-domain particle-in-cell simulations

A thermionic energy converter (TEC) is a static device that converts heat directly into electricity by boiling electrons off a hot emitter surface across a small inter-electrode gap to a cooler collector surface. The main challenge in TECs is overcoming the space charge limit, which limits the current transmitted across a gap of a given voltage and width. We have verified the feasibility of studying and developing a TEC using a bounded finite-difference time-domain particle-in-cell plasma simulation code, OOPD1, developed by Plasma Theory and Simulation Group, formerly at UC Berkeley and now at Michigan State University. In this preliminary work, a TEC has been modeled kinetically using OOPD1, and the accuracy has been verified by comparing with an analytically solvable case, giving good agreement. With further improvement of the code, one will be able to quickly and cheaply analyze space charge effects, and seek designs that mitigate the space charge effect, allowing TECs to become more efficient and cost-effective.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Predictions of core plasma performance for the SPARC tokamak

SPARC is designed to be a high-field, medium-size tokamak aimed at achieving net energy gain with Ion Cyclotron Range-of-Frequencies (ICRF) as its primary auxiliary heating mechanism. Empirical predictions with conservative physics indicate that SPARC baseline plasmas would reach Q~11, well above its mission objective of Q>2. To build confidence that SPARC will be successful, physics-based integrated modeling has also been performed. The TRANSP code coupled with the theory-based TGLF turbulence model and EPED predictions for pedestal stability find that Q~9 is attainable in standard H-mode operation and confirms Q>2 operation is feasible even with adverse assumptions. In this analysis, ion cyclotron waves are simulated with the full wave TORIC code and alpha heating is modeled with the Monte-Carlo fast ion NUBEAM module. Detailed analysis of expected turbulence regimes with linear and nonlinear CGYRO simulations is also presented, demonstrating that profile predictions with the TGLF reduced model are in reasonable agreement.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Time Evolving Fission Chain Theory and Fast Neutron and Gamma-Ray Counting Distributions

Here, we solve a simple theoretical model of time evolving fission chains due to Feynman that generalizes and asymptotically approaches the point model theory. The point model theory has been used to analyze thermal neutron counting data. This extension of the theory underlies fast counting data for both neutrons and gamma rays from metal systems. Fast neutron and gamma-ray counting is now possible using liquid scintillator arrays with nanosecond time resolution. For individual fission chains, the differential equations describing three correlated probability distributions are solved: the time-dependent internal neutron population, accumulation of fissions in time, and accumulation of leaked neutrons in time. Explicit analytic formulas are given for correlated moments of the time evolving chain populations. The equations for random time gate fast neutron and gamma-ray counting distributions, due to randomly initiated chains, are presented. Correlated moment equations are given for both random time gate and triggered time gate counting. There are explicit formulas for all correlated moments are given up to triple order, for all combinations of correlated fast neutrons and gamma rays. The nonlinear differential equations for probabilities for time dependent fission chain populations have a remarkably simple Monte Carlo realization. A Monte Carlo code was developed for this theory and is shown to statistically realize the solutions to the fission chain theory probability distributions. Combined with random initiation of chains and detection of external quanta, the Monte Carlo code generates time tagged data for neutron and gamma-ray counting and from these data the counting distributions.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Entanglement-assisted quantum low-density parity-check codes

This article develops a general method for constructing entanglement-assisted quantum low-density parity-check (LDPC) codes, which is based on combinatorial design theory. Explicit constructions are given for entanglement-assisted quantum error-correcting codes with many desirable properties. These properties include the requirement of only one initial entanglement bit, high error-correction performance, high rates, and low decoding complexity. The proposed method produces several infinite families of codes with a wide variety of parameters and entanglement requirements. Our framework encompasses the previously known entanglement-assisted quantum LDPC codes having the best error-correction performance and many other codes with better block error rates in simulations over the depolarizing channel. We also determine important parameters of several well-known classes of quantum and classical LDPC codes for previously unsettled cases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Are Lock-Free Concurrent Algorithms Practically Wait-Free?

Lock-free concurrent algorithms guarantee that some concurrent operation will always make progress in a finite number of steps. Yet programmers prefer to treat concurrent code as if it were wait-free, guaranteeing that all operations always make progress. Unfortunately, designing wait-free algorithms is generally a very complex task, and the resulting algorithms are not always efficient. Although obtaining efficient wait-free algorithms has been a long-time goal for the theory community, most nonblocking commercial code is only lock-free. This article suggests a simple solution to this problem. We show that for a large class of lock-free algorithms, under scheduling conditions that approximate those found in commercial hardware architectures, lock-free algorithms behave as if they are wait-free. In other words, programmers can continue to design simple lock-free algorithms instead of complex wait-free ones, and in practice, they will get wait-free progress. Our main contribution is a new way of analyzing a general class of lock-free algorithms under a stochastic scheduler. Our analysis relates the individual performance of processes to the global performance of the system using Markov chain lifting between a complex per-process chain and a simpler system progress chain. We show that lock-free algorithms are not only wait-free with probability 1 but that in fact a general subset of lock-free algorithms can be closely bounded in terms of the average number of steps required until an operation completes. Here, to the best of our knowledge, this is the first attempt to analyze progress conditions, typically stated in relation to a worst-case adversary, in a stochastic model capturing their expected asymptotic behavior.

97 MATHEMATICS AND COMPUTING↗

Predictions of core plasma performance for the SPARC tokamak

SPARC is designed to be a high-field, medium-size tokamak aimed at achieving net energy gain with ion cyclotron range-of-frequencies (ICRF) as its primary auxiliary heating mechanism. Empirical predictions with conservative physics indicate that SPARC baseline plasmas would reach $\textit{Q}$ ≈ 11, which is well above its mission objective of $\textit{Q}$ > 2. To build confidence that SPARC will be successful, physics-based integrated modelling has also been performed. The TRANSP code coupled with the theory-based trapped gyro-Landau fluid (TGLF) turbulence model and EPED predictions for pedestal stability find that $\textit{Q}$ ≈ 9 is attainable in standard H-mode operation and confirms $\textit{Q}$ > 2 operation is feasible even with adverse assumptions. In this analysis, ion cyclotron waves are simulated with the full wave TORIC code and alpha heating is modelled with the Monte–Carlo fast ion NUBEAM module. Detailed analysis of expected turbulence regimes with linear and nonlinear CGYRO simulations is also presented, demonstrating that profile predictions with the TGLF reduced model are in reasonable agreement.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Asymptotic/numerical analysis of supersonic propeller noise

An asymptotic analysis based on the Mach surface structure of the field of a supersonic helical source distribution is applied to predict thickness and loading noise radiated by high speed propeller blades. The theory utilizes an integral representation of the Ffowcs-Williams Hawkings equation in a fully linearized form. The asymptotic results are used for chordwise strips of the blade, while required spanwise integrations are performed numerically. The form of the analysis enables predicted waveforms to be interpreted in terms of Mach surface propagation. A computer code developed to implement the theory is described and found to yield results in close agreement with more exact computations.

Myers, M. K.↗

The Helicopter Antenna Radiation Prediction Code (HARP)

The first nine months effort in the development of a user oriented computer code, referred to as the HARP code, for analyzing the radiation from helicopter antennas is described. The HARP code uses modern computer graphics to aid in the description and display of the helicopter geometry. At low frequencies the helicopter is modeled by polygonal plates, and the method of moments is used to compute the desired patterns. At high frequencies the helicopter is modeled by a composite ellipsoid and flat plates, and computations are made using the geometrical theory of diffraction. The HARP code will provide a user friendly interface, employing modern computer graphics, to aid the user to describe the helicopter geometry, select the method of computation, construct the desired high or low frequency model, and display the results.

Klevenow, F. T.↗