Search NASA⌕ Search

SEARCH · Search NASA

Results for “randomized algorithms”

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 559 records · Page 31

Satellite communication performance evaluation: Computational techniques based on moments

Computational techniques that efficiently compute bit error probabilities when only moments of the various interference random variables are available are presented. The approach taken is a generalization of the well known Gauss-Quadrature rules used for numerically evaluating single or multiple integrals. In what follows, basic algorithms are developed. Some of its properties and generalizations are shown and its many potential applications are described. Some typical interference scenarios for which the results are particularly applicable include: intentional jamming, adjacent and cochannel interferences; radar pulses (RFI); multipath; and intersymbol interference. While the examples presented stress evaluation of bit error probilities in uncoded digital communication systems, the moment techniques can also be applied to the evaluation of other parameters, such as computational cutoff rate under both normal and mismatched receiver cases in coded systems. Another important application is the determination of the probability distributions of the output of a discrete time dynamical system. This type of model occurs widely in control systems, queueing systems, and synchronization systems (e.g., discrete phase locked loops).

Omura, J. K.↗

The CCD/Transit Instrument (CTI) data-analysis system

The automated software system for archiving, analyzing, and interrogating data from the CCD/Transit Instrument (CTI) is described. The CTI collects up to 450 Mbytes of image-data each clear night in the form of a narrow strip of sky observed in two colors. The large data-volumes and the scientific aims of the project make it imperative that the data are analyzed within the 24-hour period following the observations. To this end a fully automatic and self evaluating software system has been developed. The data are collected from the telescope in real-time and then transported to Tucson for analysis. Verification is performed by visual inspection of random subsets of the data and obvious cosmic rays are detected and removed before permanent archival is made to the optical disc. The analysis phase is performed by a pair of linked algorithms, one operating on the absolute pixel-values and the other on the spatial derivative of the data. In this way both isolated and merged images are reliably detected in a single pass. In order to isolate the latter algorithm from the effects of noise spikes a 3x3 Hanning filter is applied to the raw data before the analysis is run. The algorithms reduce the input pixel-data to a database of measured parameters for each image which has been found. A contrast filter is applied in order to assign a detection-probability to each image and then x-y calibration and intensity calibration are performed using known reference stars in the strip. These are added to as necessary by secondary standards boot-strapped from the CTI data itself. The final stages involve merging the new data into the CTI Master-list and History-list and the automatic comparison of each new detection with a set of pre-defined templates in parameter-space to find interesting objects such as supernovae, quasars and variable stars. Each stage of the processing from verification to interesting image selection is performed under a data-logging system which both controls the pipe-lining of data through the system and records key performance monitor parameters which are built into the software. Furthermore, the data from each stage are stored in databases to facilitate evaluation, and all stages offer the facility to enter keyword-indexed free-format text into the data-logging system. In this way a large measure of certification is built into the system to provide the necessary confidence in the end results.

Cawson, M. G. M.↗

A Simple Stochastic Model for Generating Broken Cloud Optical Depth and Top Height Fields

A simple and fast algorithm for generating two correlated stochastic twodimensional (2D) cloud fields is described. The algorithm is illustrated with two broken cumulus cloud fields: cloud optical depth and cloud top height retrieved from Moderate Resolution Imaging Spectrometer (MODIS). Only two 2D fields are required as an input. The algorithm output is statistical realizations of these two fields with approximately the same correlation and joint distribution functions as the original ones. The major assumption of the algorithm is statistical isotropy of the fields. In contrast to fractals and the Fourier filtering methods frequently used for stochastic cloud modeling, the proposed method is based on spectral models of homogeneous random fields. For keeping the same probability density function as the (first) original field, the method of inverse distribution function is used. When the spatial distribution of the first field has been generated, a realization of the correlated second field is simulated using a conditional distribution matrix. This paper is served as a theoretical justification to the publicly available software that has been recently released by the authors and can be freely downloaded from http://i3rc.gsfc.nasa.gov/Public codes clouds.htm. Though 2D rather than full 3D, stochastic realizations of two correlated cloud fields that mimic statistics of given fields have proved to be very useful to study 3D radiative transfer features of broken cumulus clouds for better understanding of shortwave radiation and interpretation of the remote sensing retrievals.

Prigarin, Sergei M.↗

Spin Glass Patch Planting

In this paper, we propose a patch planting method for creating arbitrarily large spin glass instances with known ground states. The scaling of the computational complexity of these instances with various block numbers and sizes is investigated and compared with random instances using population annealing Monte Carlo and the quantum annealing DW2X machine. The method can be useful for benchmarking tests for future generation quantum annealing machines, classical and quantum mechanical optimization algorithms.

Quantum Annealing↗

An Algorithm for the Transport of Anisotropic Neutrons

One major obstacle to human space exploration is the possible limitations imposed by the adverse effect of long-term exposure to the space environment. Even before human spaceflight began, the potentially brief exposure of astronauts to the very intense random solar particle events (SPE) were of great concern. A new challenge appears in deep space exploration from exposure to the low-intensity heavy-ion flux of the galactic cosmic rays (GCR) since the missions are of long duration and the accumulated GCR exposures can be high. Because cancer induction rates increase behind low to rather large thicknesses of aluminum shielding, according to available biological data on mammalian exposures to GCR like ions, the shield requirements for a Mars mission are prohibitively expensive in terms of mission launch costs. Therefore, a critical issue in the Human Exploration and Development of Space enterprise is cost effective mitigation of risk associated with ionizing radiation exposure. In order to estimate astronaut risk to GCR exposure and associated cancer risks and health hazards, it is necessary to do shield material studies. To determine an optimum radiation shield material it is necessary to understand nuclear interaction processes such as fragmentation and secondary particle production which is a function of energy dependent cross sections. This requires knowledge of material transmission characteristics either through laboratory testing or improved theoretical modeling. Here ion beam transport theory is of importance in that testing of materials in the laboratory environment generated by particle accelerators is a necessary step in materials development and evaluation for space use. The approximations used in solving the Boltzmann transport equation for the space setting are often not sufficient for laboratory work and those issues are a major emphasis of the present work.

Tweed, J.↗

Quantification of Native Lignin Structural Features with Gel–Phase 2D–HSQC 0 Reveals Lignin Structural Changes During Extraction

Our ability to study and valorize the lignin fraction of biomass is hampered by the fundamental and still unmet challenge of precisely quantifying native lignin's structural features. Here, we developed a rapid elevated-temperature 1 H– 13 C Heteronuclear Single-Quantum Coherence Zero (HSQC 0 ) NMR method that enables this precise quantification of native lignin structural characteristics even with whole plant cell wall (WPCW) NMR spectroscopy, overcoming fast spin relaxation in the gel phase. We also formulated a Gaussian fitting algorithm to perform automatic and reliable spectral integration. By combining HSQC 0 measurements with yield measurements following depolymerisation, we can confirm the combinatorial nature of radical coupling reactions during biosynthesis leading to a random sequential organization of linkages within a largely linear lignin chain. Such analyses illustrate how this analytical method can greatly facilitate the study of native lignin structure, which can then be used for fundamental studies or to understand lignin depolymerization methods like reductive catalytic fractionation or aldehyde-assisted fractionation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantification of Native Lignin Structural Features with Gel–Phase 2D–HSQC 0 Reveals Lignin Structural Changes During Extraction

Our ability to study and valorize the lignin fraction of biomass is hampered by the fundamental and still unmet challenge of precisely quantifying native lignin's structural features. Here, we developed a rapid elevated-temperature 1 H– 13 C Heteronuclear Single-Quantum Coherence Zero (HSQC 0 ) NMR method that enables this precise quantification of native lignin structural characteristics even with whole plant cell wall (WPCW) NMR spectroscopy, overcoming fast spin relaxation in the gel phase. We also formulated a Gaussian fitting algorithm to perform automatic and reliable spectral integration. By combining HSQC 0 measurements with yield measurements following depolymerisation, we can confirm the combinatorial nature of radical coupling reactions during biosynthesis leading to a random sequential organization of linkages within a largely linear lignin chain. Such analyses illustrate how this analytical method can greatly facilitate the study of native lignin structure, which can then be used for fundamental studies or to understand lignin depolymerization methods like reductive catalytic fractionation or aldehyde-assisted fractionation.

09 BIOMASS FUELS↗

Control system design using frequency domain models and parameter optimization, with application to supersonic inlet controls

A technique is described for designing feedback control systems using frequency domain models, a quadratic cost function, and a parameter optimization computer program. FORTRAN listings for the computer program are included. The approach is applied to the design of shock position controllers for a supersonic inlet. Deterministic or random system disturbances, and the presence of random measurement noise are considered. The cost function minimization is formulated in the time domain, but the problem solution is obtained using a frequency domain system description. A scaled and constrained conjugate gradient algorithm is used for the minimization. The approach to a supersonic inlet included the calculations of the optimal proportional-plus integral (PI) and proportional-plus-integral-plus-derivative controllers. A single-loop PI controller was the most desirable of the designs considered.

Seidel, R. C.↗

Analysis of the Continuous Stellar Tracking Attitude Reference (CSTAR) attitude rate processor

The Continuous Stellar Tracking Attitude Reference (CSTAR) system is an in-house project for Space Station to provide high accuracy, drift free attitude and angular rate information for the GN&C system. The outputs of the solid state star trackers are processed to provide attitude information; rate data is then derived from the attitude. Rate derivation is based on discrete time polynomial approximation techniques. This gives simple algorithms which allow for interpolation by other users. Attitude rate is modeled as a constant with low amplitude, low frequency sinusoids superimposed. The rate processor is parameterized to account for the effects of random errors, sample rate, data processing rate and perturbation frequency. The baseline system may be characterized as follows: the three sigma attitude accuracy is 0.01 degrees, the three sigma rate accuracy is 0.0001 degrees per second, the sample rate is 100 Hertz, the sampled signal is bandlimited to 0.5 Hertz, and the data processing rate is 10 Hertz. The above system requires a differentiator of length 127. This will track rate perturbations of frequencies less than 0.01 Hertz with low systematic errors.

Uhde-Lacovara, J.↗

Genetic algorithms applied to the scheduling of the Hubble Space Telescope

A prototype system employing a genetic algorithm (GA) has been developed to support the scheduling of the Hubble Space Telescope. A non-standard knowledge structure is used and appropriate genetic operators have been created. Several different crossover styles (random point selection, evolving points, and smart point selection) are tested and the best GA is compared with a neural network (NN) based optimizer. The smart crossover operator produces the best results and the GA system is able to evolve complete schedules using it. The GA is not as time-efficient as the NN system and the NN solutions tend to be better.

Sponsler, Jeffrey L.↗

Protein Kinase Classification with 2866 Hidden Markov Models and One Support Vector Machine

The main application considered in this paper is predicting true kinases from randomly permuted kinases that share the same length and amino acid distributions as the true kinases. Numerous methods already exist for this classification task, such as HMMs, motif-matchers, and sequence comparison algorithms. We build on some of these efforts by creating a vector from the output of thousands of structurally based HMMs, created offline with Pfam-A seed alignments using SAM-T99, which then must be combined into an overall classification for the protein. Then we use a Support Vector Machine for classifying this large ensemble Pfam-Vector, with a polynomial and chisquared kernel. In particular, the chi-squared kernel SVM performs better than the HMMs and better than the BLAST pairwise comparisons, when predicting true from false kinases in some respects, but no one algorithm is best for all purposes or in all instances so we consider the particular strengths and weaknesses of each.

Weber, Ryan↗

The Seasonal Cycle of Satellite Chlorophyll Fluorescence Observations and its Relationship to Vegetation Phenology and Ecosystem Atmosphere Carbon Exchange

Mapping of terrestrial chlorophyll uorescence from space has shown potentialfor providing global measurements related to gross primary productivity(GPP). In particular, space-based fluorescence may provide information onthe length of the carbon uptake period that can be of use for global carboncycle modeling. Here, we examine the seasonal cycle of photosynthesis asestimated from satellite fluorescence retrievals at wavelengths surroundingthe 740nm emission feature. These retrievals are from the Global OzoneMonitoring Experiment 2 (GOME-2) flying on the MetOp A satellite. Wecompare the fluorescence seasonal cycle with that of GPP as estimated froma diverse set of North American tower gas exchange measurements. Because the GOME-2 has a large ground footprint (40 x 80km2) as compared with that of the flux towers and requires averaging to reduce random errors, we additionally compare with seasonal cycles of upscaled GPP in the satellite averaging area surrounding the tower locations estimated from the Max Planck Institute for Biogeochemistry (MPI-BGC) machine learning algorithm. We also examine the seasonality of absorbed photosynthetically-active radiation(APAR) derived with reflectances from the MODerate-resolution Imaging Spectroradiometer (MODIS). Finally, we examine seasonal cycles of GPP as produced from an ensemble of vegetation models. Several of the data-driven models rely on satellite reflectance-based vegetation parameters to derive estimates of APAR that are used to compute GPP. For forested sites(particularly deciduous broadleaf and mixed forests), the GOME-2 fluorescence captures the spring onset and autumn shutoff of photosynthesis as delineated by the tower-based GPP estimates. In contrast, the reflectance-based indicators and many of the models tend to overestimate the length of the photosynthetically-active period for these and other biomes as has been noted previously in the literature. Satellite fluorescence measurements therefore show potential for improving model GPP estimates.

Joiner, J.↗

Likelihood-Based Particle Identification in the Short-Baseline Near Detector

Accurate particle identification is crucial in any high-energy physics experiment, allowing scientists to understand the unique interactions and mechanisms at play in a detector. In this project, I develop and study a new particle identification (PID) algorithm for the Short-Baseline Near Detector, a likelihood-based approach, different from out current $\chi^2$ method. A likelihood estimation offers a more physically motivated strategy for PID. The distribution random energy losses of charged particles traveling through a medium are described by the Vavilov probability density function. By using this model, we can account for random energy losses and construct likelihood functions specific to each particle type, potentially enabling a more accurate method for PID.

Vanderwaal, Sophia [U. Alabama, Huntsville] (ORCID↗

Parallel-in-Time Solution of Allen-Cahn Equations by Integrating Operator Learning into the Parareal Method

While recent advances in deep learning have shown promising efficiency gains in solving time-dependent partial differential equations (PDEs), matching the accuracy of conventional numerical solvers still remains a challenge. One strategy to improve the accuracy of deep learning-based solutions for time-dependent PDEs is to use the learned model as the coarse propagator in the Parareal method and a traditional numerical method as the fine solver. However, successful integration of deep learning into the Parareal method requires consistency between the coarse and fine solvers, particularly for PDEs exhibiting rapid changes such as sharp transitions. Here, to ensure this consistency, we propose using convolutional neural networks (CNNs) to learn the fully discrete time-stepping operator defined by the same numerical scheme employed as the fine solver. We demonstrate the effectiveness of the proposed method in solving the classical and mass-conservative Allen–Cahn (AC) equations. Through iterative updates in the Parareal algorithm, our approach achieves a significant computational speedup compared to traditional fine solvers while converging to high-accuracy solutions. Our results highlight that the proposed hybrid Parareal algorithm effectively accelerates simulations, particularly when implemented on multiple GPUs, and converges to the desired accuracy in only a few iterations. Another advantage of our method is that the CNN model is trained on trajectory-based data generated from random initial conditions, such that the trained model can be used to solve the AC equations with various initial conditions without retraining. This work demonstrates the potential of integrating neural network methods into parallel-in-time frameworks for efficient and accurate simulations of time-dependent PDEs.

97 MATHEMATICS AND COMPUTING↗

The topology of large-scale structure. V - Two-dimensional topology of sky maps

A 2D algorithm is applied to observed sky maps and numerical simulations. It is found that when topology is studied on smoothing scales larger than the correlation length, the topology is approximately in agreement with the random phase formula for the 2D genus-threshold density relation, G2(nu) varies as nu(e) exp-nu-squared/2. Some samples show small 'meatball shifts' similar to those seen in corresponding 3D observational samples and similar to those produced by biasing in cold dark matter simulations. The observational results are thus consistent with the standard model in which the structure in the universe today has grown from small fluctuations caused by random quantum noise in the early universe.

Gott, J. R., III↗

Error detection and data smoothing based on local procedures

An algorithm is presented which is able to locate isolated bad points and correct them without contaminating the rest of the good data. This work has been greatly influenced and motivated by what is currently done in the manual loft. It is not within the scope of this work to handle small random errors characteristic of a noisy system, and it is therefore assumed that the bad points are isolated and relatively few when compared with the total number of points. Motivated by the desire to imitate the loftsman a visual experiment was conducted to determine what is considered smooth data. This criterion is used to determine how much the data should be smoothed and to prove that this method produces such data. The method utimately converges to a set of points that lies on the polynomial that interpolates the first and last points; however convergence to such a set is definitely not the purpose of our algorithm. The proof of convergence is necessary to demonstrate that oscillation does not take place and that in a finite number of steps the method produces a set as smooth as desired.

Guerra, V. M.↗

Digital vibration control techniques

Analog vibration control techniques are reviewed and are compared with digital techniques. The advantages of the digital methods over the analog methods are demonstrated. The following topics are covered: (1) methods of computer-controlled random vibration and reverberation acoustic testing; (2) methods of computer-controlled sinewave vibration testing; and (3) methods of computer-controlled shock testing. Basic concepts are stressed rather than specific techniques or equipment. General algorithms are described in the form of block diagrams and flow diagrams. Specific problems and potential problems are discussed. The material is computer sciences oriented but is kept at a level that facilitates an understanding of the basic concepts of computer-controlled induced environmental test systems.

Chapman, P.↗