Search NASA⌕ Search

SEARCH · Search NASA

Results for “EXPONENTIAL FUNCTION”

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 397 records · Page 22

Observed distribution functions of H, He, C, O, and Fe in corotating energetic particle streams: Implications for interplanetary acceleration and propagation

Distribution functions for H, He, C, O, and Fe derived from our IMP 8 measurements of approximately 0.15 to approximately 8 MeV/nucleon particles in three corotating streams observed near earth are shown to have a simple exponential dependence on the particle speed. The e-folding speed, v sub o, is typically 0.01c, is found to be the same for the distribution functions of all elements examined, and varies little from one corotating event to the next. The relative abundances of energetic particles in these events resemble most closely the solar coronal composition and, thus, presumably that of the solar wind. These results may imply that the acceleration of these particles, which occurs in corotating interaction regions at several AU from the sun, is by a statistical process.

Gloeckler, G.↗

Force Density Function Relationships in 2-D Granular Media

An integral transform relationship is developed to convert between two important probability density functions (distributions) used in the study of contact forces in granular physics. Developing this transform has now made it possible to compare and relate various theoretical approaches with one another and with the experimental data despite the fact that one may predict the Cartesian probability density and another the force magnitude probability density. Also, the transforms identify which functional forms are relevant to describe the probability density observed in nature, and so the modified Bessel function of the second kind has been identified as the relevant form for the Cartesian probability density corresponding to exponential forms in the force magnitude distribution. Furthermore, it is shown that this transform pair supplies a sufficient mathematical framework to describe the evolution of the force magnitude distribution under shearing. Apart from the choice of several coefficients, whose evolution of values must be explained in the physics, this framework successfully reproduces the features of the distribution that are taken to be an indicator of jamming and unjamming in a granular packing. Key words. Granular Physics, Probability Density Functions, Fourier Transforms

Youngquist, Robert C.↗

Bottom-Up Simulation, Reconstruction, and Quantification of Macromolecule Sequences from Experimental Polymerizations

Motivated by the canonical sequence–structure–function paradigm, tools to characterize chemical patterning in natural biomacromolecules, from proteins to nucleic acids, have grown exponentially in recent years. However, analogous strategies for synthetic macromolecules remain in nascent stages, complicated by sequence polydispersity and analytical limitations. To address this, we have developed a comprehensive and open-source Python package, PRISM (polymer rate insights and sequence modeling), an end-to-end workflow that provides a path from experimental kinetics measurements to quantitative and qualitative metrics for describing chemical patterning in stochastic polymers. First, a numerical integration strategy was constructed to simulate and fit experimental data from reversible addition–fragmentation chain transfer (RAFT) polymerization kinetics, enabling the facile estimation of relevant reactivity ratios. These ratios were then used in a mechanism-specific stochastic kinetic simulation strategy to simulate sequence ensembles corresponding to model systems spanning experimental copolymers, classes of statistical polymers (e.g., alternating, block, and gradient), and multiblock copolymers. Lastly, inspired by sequence homology metrics from bioinformatics, we introduce visualization strategies and quantitative metrics to facilitate comparisons of different sequence ensembles. As the sequence–structure–function paradigm becomes increasingly central in de novo design of synthetic macromolecules, this toolkit provides a first step toward accurate and representative sequence description and featurization.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A remark about pointed bubbles

The polymer expansion is a formal algebraic identity between a partition function and logarithm in statistical physics problems. The expansion gives a systematic method to control the free energy or to establish exponential tree-graph decay of connected correlations. Here, the convergence properties of the polymer expansion are analyzed in connection with three practical examples, including: intersecting bonds in chemical polymer chains; a connected closed hypersurface built from the (d-1)-faces of the d-dimensional unit cubes; and the set of Feynamn diagrams in the perturbation series of the Euclidean field theory partition function Z. The example of connected polymer chains is generalized to apply to other lattice models, including n-state Ising models at high temperature; short range lattice gases at high temperature; and weak coupling lattice field and gauge theories.

Garabedian, P. R.↗

Performability modeling based on real data: A case study

Described is a measurement-based performability model based on error and resource usage data collected on a multiprocessor system. A method for identifying the model structure is introduced and the resulting model is validated against real data. Model development from the collection of raw data to the estimation of the expected reward is described. Both normal and error behavior of the system are characterized. The measured data show that the holding times in key operational and error states are not simple exponentials and that a semi-Markov process is necessary to model system behavior. A reward function, based on the service rate and the error rate in each state, is then defined in order to estimate the performability of the system and to depict the cost of apparent types of errors.

Hsueh, M. C.↗

Some easily analyzable convolutional codes

Convolutional codes have played and will play a key role in the downlink telemetry systems on many NASA deep-space probes, including Voyager, Magellan, and Galileo. One of the chief difficulties associated with the use of convolutional codes, however, is the notorious difficulty of analyzing them. Given a convolutional code as specified, say, by its generator polynomials, it is no easy matter to say how well that code will perform on a given noisy channel. The usual first step in such an analysis is to computer the code's free distance; this can be done with an algorithm whose complexity is exponential in the code's constraint length. The second step is often to calculate the transfer function in one, two, or three variables, or at least a few terms in its power series expansion. This step is quite hard, and for many codes of relatively short constraint lengths, it can be intractable. However, a large class of convolutional codes were discovered for which the free distance can be computed by inspection, and for which there is a closed-form expression for the three-variable transfer function. Although for large constraint lengths, these codes have relatively low rates, they are nevertheless interesting and potentially useful. Furthermore, the ideas developed here to analyze these specialized codes may well extend to a much larger class.

Mceliece, R.↗

A measurement-based performability model for a multiprocessor system

A measurement-based performability model based on real error-data collected on a multiprocessor system is described. Model development from the raw errror-data to the estimation of cumulative reward is described. Both normal and failure behavior of the system are characterized. The measured data show that the holding times in key operational and failure states are not simple exponential and that semi-Markov process is necessary to model the system behavior. A reward function, based on the service rate and the error rate in each state, is then defined in order to estimate the performability of the system and to depict the cost of different failure types and recovery procedures.

Ilsueh, M. C.↗

3D-Stereoscopic Analysis of Solar Active Region Loops: I: SoHo/EIT Observations at Temperatures of 1.0-1.5 MK

The three-dimensional (3D) structure of solar active region NOAA 7986 observed on 1996 August 30 with the Extrem-ultraviolet Imaging Telescope (EIT) onboard the Solar and Heliospheric Observatory (SoHO) is analyzed. We develop a new method of Dynamic Stereoscopy to reconstruct the 3D geometry of dynamically changing loops, which allows us to determine the orientation of the loop plane with respect to the line-of-sight, a prerequisite to correct properly for projection effects in 3D loop models. With this method and the filter-ratio technique applied to EIT 171 A and 195 A images we determine the 3D coordinates (x(s), y(s), z(s)), the loop width) w(s), the electron density n(sub e)(s), and the electron temperature T(sub e)(s) as function of the loop length s for 30 loop segments. Fitting the loop densities with an exponential density model n(sub e)(h) we find that the so inferred scale height temperatures, T(sub e)(sup lambda) = 1.22 +/- 0.23 MK, match closely the EIT filter-ratio temperatures, T(sub e)(sup FIT) = 1.21 +/- 0.06 MK. We conclude that these rather large-scale loops (with heights of h approx. equals 50 - 200 Mm) that dominate EIT 171 A images are close to thermal equilibrium. Most of the loops show no significant thickness variation w(s), but many exhibit a trend of increasing temperature (dT/ds greater than 0) above the footpoint.

Aschwanden, Markus J.↗

Automated Fiber Placement Through Thickness Defect Stacking Optimization

In its 2022 commercial market outlook, Boeing forecasted an 80% increase in the global fleet through 2041 compared to 2019 pre-pandemic levels. This sharp rise in demand will drive pressure onto airframe manufacturers to ramp up production and find more efficient ways to design and manufacture airplanes. Complicating this challenge is the industry’s recent transformation from traditional metal-based airframes towards hybrid composite-metal aircraft. While composites have been used in aviation for decades, aircraft manufacturers are still struggling to design and manufacture quality parts at a high rate. Automated Fiber Placement (AFP) is one of the main manufacturing techniques used to produce large-scale composite parts. After a design has been created, a manufacturing strategy has to be developed based on the working material, part geometry, and machine capabilities. This process planning stage is essential to the AFP workflow and currently requires a high level of manual input from an experienced process planner. In an effort to automate and optimize this stage, the Computer Aided Process Planning (CAPP) module was developed. CAPP assists process planners in identifying optimal starting point location and layup strategy for each ply of a laminate. This Ply-Level Optimization (PLO) phase operates on the quantification of ply quality through predictable geometry-based defects such as gaps, overlaps, angle deviation, and steering. As you move from PLO to Laminate-Level Optimization (LLO) the design space grows exponentially, emphasizing the need for automated optimization. The work presented in this thesis expands CAPP’s functionality by comparing the planned fiber paths through the thickness of the laminate to mitigate stacked area defects and achieve an optimal laminate-level manufacturing strategy. Within CAPP, predicted gap and overlap defects are imported from Vericut Composites Programming (VCP) and then discretized to streamline the through-thickness comparison. Two objective functions are used to score different combinations of ply layup strategies based on defect stacking both globally and locally. Four combinatorial optimization algorithms were coupled with these objective functions to investigate the laminate-level manufacturing strategy design space and converge on the optimal plan. These algorithms were evaluated based on accuracy and efficiency through virtual testing on a complex tool surface. A separate LLO approach was developed to achieve near-optimal laminates in significantly less time. The end result is a software package which greatly reduces the required input from process planners, shortening the design-build cycle time and improving part quality.

AFP↗

Blocking reduction of Landsat Thematic Mapper JPEG browse images using optimal PSNR estimated spectra adaptive postfiltering

Two representative sample images of Band 4 of the Landsat Thematic Mapper are compressed with the JPEG algorithm at 8:1, 16:1 and 24:1 Compression Ratios for experimental browsing purposes. We then apply the Optimal PSNR Estimated Spectra Adaptive Postfiltering (ESAP) algorithm to reduce the DCT blocking distortion. ESAP reduces the blocking distortion while preserving most of the image's edge information by adaptively postfiltering the decoded image using the block's spectral information already obtainable from each block's DCT coefficients. The algorithm iteratively applied a one dimensional log-sigmoid weighting function to the separable interpolated local block estimated spectra of the decoded image until it converges to the optimal PSNR with respect to the original using a 2-D steepest ascent search. Convergence is obtained in a few iterations for integer parameters. The optimal logsig parameters are transmitted to the decoder as a negligible byte of overhead data. A unique maxima is guaranteed due to the 2-D asymptotic exponential overshoot shape of the surface generated by the algorithm. ESAP is based on a DFT analysis of the DCT basis functions. It is implemented with pixel-by-pixel spatially adaptive separable FIR postfilters. PSNR objective improvements between 0.4 to 0.8 dB are shown together with their corresponding optimal PSNR adaptive postfiltered images.

Linares, Irving↗

Stretched exponential magnetic relaxation dynamics in artificial square ice revealed through x-ray photon correlation spectroscopy

X-ray photon correlation scattering measurements are undertaken on a thermally active artificial spin ice based on the square lattice, referred to as artificial square ice, to probe the fluctuation timescales as a function of temperature as the system passes through the paramagnetic-antiferromagnetic phase transition, which belongs to the two-dimensional Ising universality class. In the paramagnetic regime, a single exponential timescale is seen, whereas at and below the critical temperature, a stretched exponential decorrelation is observed, with the stretching exponent decreasing from unity down to below one-half as the temperature reduces. This trend is confirmed by kinetic Monte Carlo simulations of a simplified point-dipolar square ice system, and is in agreement with past theoretical work on the kinetic Ising model where stretched exponential relaxation due to equilibrium domain wall dynamics below the critical temperature was found.

36 MATERIALS SCIENCE↗

The behavior of quantization spectra as a function of signal-to-noise ratio

An expression for the spectrum of quantization error in a discrete-time system whose input is a sinusoid plus white Gaussian noise is derived. This quantization spectrum consists of two components: a white-noise floor and spurious harmonics. The dithering effect of the input Gaussian noise in both components of the spectrum is considered. Quantitative results in a discrete Fourier transform (DFT) example show the behavior of spurious harmonics as a function of the signal-to-noise ratio (SNR). These results have strong implications for digital reception and signal analysis systems. At low SNRs, spurious harmonics decay exponentially on a log-log scale, and the resulting spectrum is white. As the SNR increases, the spurious harmonics figure prominently in the output spectrum. A useful expression is given that roughly bounds the magnitude of a spurious harmonic as a function of the SNR.

Flanagan, M. J.↗

The Ground Flash Fraction Retrieval Algorithm Employing Differential Evolution: Simulations and Applications

The ability to estimate the fraction of ground flashes in a set of flashes observed by a satellite lightning imager, such as the future GOES-R Geostationary Lightning Mapper (GLM), would likely improve operational and scientific applications (e.g., severe weather warnings, lightning nitrogen oxides studies, and global electric circuit analyses). A Bayesian inversion method, called the Ground Flash Fraction Retrieval Algorithm (GoFFRA), was recently developed for estimating the ground flash fraction. The method uses a constrained mixed exponential distribution model to describe a particular lightning optical measurement called the Maximum Group Area (MGA). To obtain the optimum model parameters (one of which is the desired ground flash fraction), a scalar function must be minimized. This minimization is difficult because of two problems: (1) Label Switching (LS), and (2) Parameter Identity Theft (PIT). The LS problem is well known in the literature on mixed exponential distributions, and the PIT problem was discovered in this study. Each problem occurs when one allows the numerical minimizer to freely roam through the parameter search space; this allows certain solution parameters to interchange roles which leads to fundamental ambiguities, and solution error. A major accomplishment of this study is that we have employed a state-of-the-art genetic-based global optimization algorithm called Differential Evolution (DE) that constrains the parameter search in such a way as to remove both the LS and PIT problems. To test the performance of the GoFFRA when DE is employed, we applied it to analyze simulated MGA datasets that we generated from known mixed exponential distributions. Moreover, we evaluated the GoFFRA/DE method by applying it to analyze actual MGAs derived from low-Earth orbiting lightning imaging sensor data; the actual MGA data were classified as either ground or cloud flash MGAs using National Lightning Detection Network[TM] (NLDN) data. Solution error plots are provided for both the simulations and actual data analyses.

Koshak, William↗

Codiscovering graphical structure and functional relationships within data: A Gaussian Process framework for connecting the dots

Most problems within and beyond the scientific domain can be framed into one of the following three levels of complexity of function approximation. Type 1: Approximate an unknown function given input/output data. Type 2: Consider a collection of variables and functions, some of which are unknown, indexed by the nodes and hyperedges of a hypergraph (a generalized graph where edges can connect more than two vertices). Given partial observations of the variables of the hypergraph (satisfying the functional dependencies imposed by its structure), approximate all the unobserved variables and unknown functions. Type 3: Expanding on Type 2, if the hypergraph structure itself is unknown, use partial observations of the variables of the hypergraph to discover its structure and approximate its unknown functions. These hypergraphs offer a natural platform for organizing, communicating, and processing computational knowledge. While most scientific problems can be framed as the data-driven discovery of unknown functions in a computational hypergraph whose structure is known (Type 2), many require the data-driven discovery of the structure (connectivity) of the hypergraph itself (Type 3). We introduce an interpretable Gaussian Process (GP) framework for such (Type 3) problems that does not require randomization of the data, access to or control over its sampling, or sparsity of the unknown functions in a known or learned basis. Its polynomial complexity, which contrasts sharply with the super-exponential complexity of causal inference methods, is enabled by the nonlinear ANOVA capabilities of GPs used as a sensing mechanism.

Science & Technology - Other Topics↗

High throughput, accurate gene annotation through AI and HPC-enabled structural analysis

With the advances in next generation sequencing technologies, the number of sequenced genomes is growing exponentially, resulting in a technology bottleneck for the translation of sequence information into usable hypotheses about the function of each gene. We have proposed leveraging our leadership high-performance computing (HPC) resources to help break this annotation bottleneck. Here we design an HPC-based framework to infer gene function from gene sequence by incorporating information about protein structure and interactions predicted by deep learning approaches. Accurate functional prediction and gene annotation using computational methods will facilitate breakthroughs in the genomic sciences essential to understanding and harnessing life processes in bacteria, fungi and plants. The development and applications of the state-of-the-art deep neural networks to protein structural modeling, interaction prediction, sequence comparison, and quality assessment of protein structural models will be made possible by leadership computational resources. These HPC-enabled bioinformatics and molecular modeling tools will provide powerful insights into molecular functions of genes.

59 BASIC BIOLOGICAL SCIENCES↗

Finite Control in Underdamped Distributed Parameter Systems

Specifically, a class of distributed parameter systems is defined using Hilbert space methods based on a partial differential equation model of a structure. In this space a simple, easy to check definition of underdamping is constructed based on the well known single degree of freedom concept of critical damping. It is then shown that if a given distributed parameter system satisfies this definition, each mode of the modal expansion of the solution is in fact an underdamped function of time. It is noted that a distributed parameter system which is underdamped is also uniformly exponentially stable. By appealing to the work of Gibson, a finite dimensional model of the system will yield satisfactory control laws. Furthermore, it is shown that the assumption of the underdamping also allows straightforward computation of rough bounds on the magnitude of the unmodeled or residual modes for a modal truncation scheme. Hence, underdamped systems are precisely that class of distributed parameter systems which are not likely to have spillover problems and which will yield convergence of finite dimensional control laws to control laws which are optimal for the full distributed parameter model of the system.

Inman, D. J.↗

A mechanism for tectonic deformation on Venus

In the absence of identifiable physiographic features directly associated with plate tectonics, alternate mechanisms are sought for the intense tectonic deformation observed in radar images of Venus. One possible mechanism is direct coupling into an elastic lithosphere of the stresses associated with convective flow in the interior. Spectral Green's function solutions have been obtained for stresses in an elastic lithosphere overlying a Newtonian interior with an exponential depth dependence of viscosity, and a specified surface-density distribution driving the flow. At long wavelengths and for a rigid elastic/fluid boundary condition, horizontal normal stresses in the elastic lid are controlled by the vertical shear stress gradient and are directly proportional to the depth of the density disturbance in the underlying fluid. The depth and strength of density anomalies in the Venusian interior inferred by analyses of long wavelength gravity data suggest that stresses in excess of 100 MPa would be generated in a 10 km thick elastic lid unless a low viscosity channel occurring beneath the lid or a positive viscosity gradient uncouples the flow stresses. The great apparent depth of compensation of topographic features argues against this, however, thus supporting the importance of the coupling mechanism. If there is no elastic lid, stresses will also be very high near the surface, providing also that the viscosity gradient is negative.

Phillips, Roger J.↗

Performability modeling based on real data: A casestudy

Described is a measurement-based performability model based on error and resource usage data collected on a multiprocessor system. A method for identifying the model structure is introduced and the resulting model is validated against real data. Model development from the collection of raw data to the estimation of the expected reward is described. Both normal and error behavior of the system are characterized. The measured data show that the holding times in key operational and error states are not simple exponentials and that a semi-Markov process is necessary to model the system behavior. A reward function, based on the service rate and the error rate in each state, is then defined in order to estimate the performability of the system and to depict the cost of different types of errors.

Hsueh, M. C.↗