Search NASA⌕ Search

SEARCH · Search NASA

Results for “random processes”

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 1,387 records · Page 77

Parasitic Modulation of Microwave Signals by a Hypersonic Plasma Layer

During hypersonic flight, compressional and viscous heating of the air can form a plasma layer which encases the aircraft. If the boundary layer becomes turbulent, then the electron density fluctuations can effect a parasitic modulation in microwave signals transmitted through the plasma. We developed an approach for studying the interaction of microwave signals with a turbulent, hypersonic plasma layer. The approach affords a great deal of flexibility in both the plasma layer model and the antenna configuration. We then analyzed a situation in which microwaves, transmitted from a rectangular aperture antenna, propagate through a turbulent plasma layer to a distant receiver. We characterized the first-and second-order statistics of the computed parasitic modulation and quantified the depolarization of the signal. The amplitude fluctuations are lognormally distributed at low frequencies and Rice-distributed at high frequencies. Fluctuations in the copolarized phase and amplitude of the far-field signal are strongly anticorrelated. Here, we used a multioutput Gaussian process (MOGP) to model these quantities. The efficacy of the MOGP model is demonstrated by recovering the time evolution of the copolarized phase given the copolarized amplitude and occasional measurements of the phase.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Efficient QAOA Optimization using Directed Restarts and Graph Lookup

Variational Quantum Algorithms (VQA) aim to enhance the capabilities of Noisy Intermediate-Scale Quantum (NISQ) devices. These algorithms utilize parameterized circuits and classical optimizers to iteratively execute circuits with varying parameters. However, VQA faces computational overheads due to repeated iterations and random restarts. Prior work suggests using basic sub-graphs to transfer parameters for the input graph, reducing optimizer overheads but limiting applicability to structured regular graphs. In real-world applications, random irregular graphs are common, and existing methods are not scalable or practical for such graphs. This paper presents a framework that aims to improve random irregular graphs in VQA. The framework uses graph similarity and important features like total edge counts, average edge counts, and variance. It follows an iterative process to choose basis sub-graphs from a small database and adjust parameters accordingly. Classical optimizers then utilize these parameters to determine when to restart and perform gradient descent. This approach increases the chances of reaching global maximum points.

Wang, Meng↗

High-resolution leaf area index maps generated from unoccupied aerial system, Teller Mile 27, Seward Peninsula, Alaska

Leaf area index (LAI), a measure of the amount of one-side leaf area per ground unit, is an important indicator of plant carbon, energy, and water cycle. In the heterogeneous Arctic landscapes, it has been challenging to accurately measure LAI across species and space needed for Earth system model validation. Here, we use multispectral unoccupied aerial systems (UASs) to scale up and map leaf area index (LAI) , in a low-Arctic tundra landscape on the Seward Peninsula, Alaska. We linked previous published LAI measurements with high-resolution, UAS-collected multispectral data collected over the region of Next Generation Ecosystem Experiments in the Arctic (NGEE Arctic)’s Teller Mile Maker 27 site in 2022 to develop random forest (RF) machine learning models to predict and map LAI. 100 RF models were developed to account for uncertainties in ground LAI plot measurements and process scaling. This dataset includes a raster (*.tif) map of the mean LAI value of the 100 RF models, a raster (*.tif) map of the standard deviation of the RF-modeled LAI data, and a user guide (*.pdf).

54 ENVIRONMENTAL SCIENCES↗

Double Shell Inertial Confinement Fusion X-Ray Spectral Analysis

At the National Ignition Facility (NIF), lasers are used to compress a double shell capsule with deuterium and tritium in order to create nuclear fusion processes. The lasers aim at the inside of a gold hohlraum which excite electrons which further release photons in the range of 0~20keV. The photons randomly disperse, ultimately either going towards the fuel capsule or back out the laser entrance holes. The photons that go towards the fuel capsule work towards the compression of the multi-shell capsule whereas the photons that leave the hohlraum have a chance at being picked up by the Lawrence Livermore National Lab’s ‘Dante’ photon detector. ‘Dante’ analyzes photon data by having 18 planar vacuum x-ray diodes (XRD) behind unique filters to differentiate data amongst various photon energies. The goal of the project was to analyze the characteristics of low and high energy photons released by the gold shell.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Performance and automatic calibration scheme of the waveform sampler in the ETROC2 ASIC chip

The waveform sampler in the CMS ETROC2 chip for LGAD gain aging monitoring is a 2.56-GS/s 12-bit 8x-Interleaved ADC that consists of a coarse SAR stage, and a fine stage. This architecture delivers high performance on a relatively modest 65 nm process, while requires finding up to 24 calibration constants through calibration. We developed an automatic calibration method using charge injection test data. After calibration, the baseline random error is reduced by a factor of 2.5–3 compared to the default calibration, and a 5% charge measurement precision is achieved in 15 fC charge injection tests.

Fu, Tao [Unlisted, US]↗

Principles of robust innate immune response to viral infections: a multiplex network analysis

The human innate immune response, particularly the type-I interferon (IFN) response, is highly robust and effective first line of defense against virus invasion. IFN molecules are produced and secreted frominfected cells upon virus infection and recognition. They then act as signaling/communicationmolecules to activate an antiviral response in neighboring cells so that those cells become refractory to infection. Previous experimental studies have identified the detailed molecular mechanisms for the IFN signaling and response. However, the principles underlying how host cells use IFN to communicate with each other to collectively and robustly halt an infection is not understood. Here we take a multiplex network modeling approach to provide a theoretical framework to identify key factors that determine the effectiveness of the IFN response against virus infection of a host. In this approach, we consider the virus spread among host cells and the interferon signaling to protect host cells as a competition process on a two-layer multiplex network. We focused on two types of network topology, i.e., the Erdős-Rényi (ER) network and the Geometric Random (GR) network, which represent the scenarios when infection of cells is mostly well mixed (e.g., in the blood) and when infection is spatially segregated (e.g., in tissues), respectively.We show that in general, the IFN response works effectively to stop viral infection when virus infection spreads spatially (a most likely scenario for initial virus infection of a host at the peripheral tissue). Importantly, we show that the effectiveness of the IFN response is robust against large variations in the distance of IFN diffusion as long as IFNs diffuse faster than viruses and they can effectively induce antiviral responses in susceptible host cells. This suggests that the effectiveness of the IFN response is insensitive to the specific arrangement of host cells in peripheral tissues. Thus, our work provides a quantitative explanation of why the IFN response can serve an effective and robust response in different tissue types to a wide range of viral infections of a host.

59 BASIC BIOLOGICAL SCIENCES↗

Sensor Authentication in Collaborating Sensor Networks

In this thesis, we address a new security problem in the realm of collaborating sensor networks. By collaborating sensor networks, we refer to the networks of sensor networks collaborating on a mission, with each sensor network is independently owned and operated by separate entities. Such networks are practical where a number of independent entities can deploy their own sensor networks in multi-national, commercial, and environmental scenarios, and some of these networks will integrate complementary functionalities for a mission. In the scenario, we address an authentication problem wherein the goal is for the Operator O i of Sensor Network S i to correctly determine the number of active sensors in Network Si. Such a problem is challenging in collaborating sensor networks where other sensor networks, despite showing an intent to collaborate, may not be completely trustworthy and could compromise the authentication process. We propose two authentication protocols to address this problem. Our protocols rely on Physically Unclonable Functions, which are a hardware based authentication primitive exploiting inherent randomness in circuit fabrication. Our protocols are light-weight, energy efficient, and highly secure against a number of attacks. To the best of our knowledge, ours is the first to addresses a practical security problem in collaborating sensor networks.

42 ENGINEERING↗

Joint synthetic aperture radar plus ground moving target indicator from single-channel radar using compressive sensing

The various embodiments presented herein relate to utilizing an operational single-channel radar to collect and process synthetic aperture radar (SAR) and ground moving target indicator (GMTI) imagery from a same set of radar returns. In an embodiment, data is collected by randomly staggering a slow-time pulse repetition interval (PRI) over a SAR aperture such that a number of transmitted pulses in the SAR aperture is preserved with respect to standard SAR, but many of the pulses are spaced very closely enabling movers (e.g., targets) to be resolved, wherein a relative velocity of the movers places them outside of the SAR ground patch. The various embodiments of image reconstruction can be based on compressed sensing inversion from undersampled data, which can be solved efficiently using such techniques as Bregman iteration. The various embodiments enable high-quality SAR reconstruction, and high-quality GMTI reconstruction from the same set of radar returns.

47 OTHER INSTRUMENTATION↗

Subsurface stress criticality associated with fluid injection and determined using machine learning

Machine-learning methods and apparatus are disclosed to determine critical state or other parameters related to fluid-driven failure of a terrestrial locale impacted by anthropogenic activities such as hydraulic fracturing, hydrocarbon extraction, wastewater disposal, or geothermal harvesting. Acoustic emission, seismic waves, or other detectable indicators of microscopic processes are sensed. A classifier is trained using time series of microscopic data along with corresponding data of critical state or failure events. In disclosed examples, random forests and artificial neural networks are used, and grid-search or EGO procedures are used for hyperparameter tuning. Once trained, the classifier can be applied to live data from a fluid injection locale in order to assess a frictional state, assess seismic hazard, assess permeability, make predictions regarding a future fluid-driven failure event, or drive engineering solutions for mitigation or remediation. Variations are disclosed.

Johnson, Paul Allan↗

Concurrent segmentation of the prostate on MRI and CT via linked statistical shape models for radiotherapy planning

Purpose: Prostate gland segmentation is a critical step in prostate radiotherapy planning, where dose plans are typically formulated on CT. Pretreatment MRI is now beginning to be acquired at several medical centers. Delineation of the prostate on MRI is acknowledged as being significantly simpler to perform, compared to delineation on CT. In this work, the authors present a novel framework for building a linked statistical shape model (LSSM), a statistical shape model (SSM) that links the shape variation of a structure of interest (SOI) across multiple imaging modalities. This framework is particularly relevant in scenarios where accurate boundary delineations of the SOI on one of the modalities may not be readily available, or difficult to obtain, for training a SSM. In this work the authors apply the LSSM in the context of multimodal prostate segmentation for radiotherapy planning, where the prostate is concurrently segmented on MRI and CT. Methods: The framework comprises a number of logically connected steps. The first step utilizes multimodal registration of MRI and CT to map 2D boundary delineations of the prostate from MRI onto corresponding CT images, for a set of training studies. Hence, the scheme obviates the need for expert delineations of the gland on CT for explicitly constructing a SSM for prostate segmentation on CT. The delineations of the prostate gland on MRI and CT allows for 3D reconstruction of the prostate shape which facilitates the building of the LSSM. In order to perform concurrent prostate MRI and CT segmentation using the LSSM, the authors employ a region-based level set approach where the authors deform the evolving prostate boundary to simultaneously fit to MRI and CT images in which voxels are classified to be either part of the prostate or outside the prostate. The classification is facilitated by using a combination of MRI-CT probabilistic spatial atlases and a random forest classifier, driven by gradient and Haar features. Results: The authors acquire a total of 20 MRI-CT patient studies and use the leave-one-out strategy to train and evaluate four different LSSMs. First, a fusion-based LSSM (fLSSM) is built using expert ground truth delineations of the prostate on MRI alone, where the ground truth for the gland on CT is obtained via coregistration of the corresponding MRI and CT slices. The authors compare the fLSSM against another LSSM (xLSSM), where expert delineations of the gland on both MRI and CT are employed in the model building; xLSSM representing the idealized LSSM. The authors also compare the fLSSM against an exclusive CT-based SSM (ctSSM), built from expert delineations of the gland on CT alone. In addition, two LSSMs trained using trainee delineations (tLSSM) on CT are compared with the fLSSM. The results indicate that the xLSSM, tLSSMs, and the fLSSM perform equivalently, all of them out-performing the ctSSM. Conclusions: The fLSSM provides an accurate alternative to SSMs that require careful expert delineations of the SOI that may be difficult or laborious to obtain. Additionally, the fLSSM has the added benefit of providing concurrent segmentations of the SOI on multiple imaging modalities.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Weighted greedy-optimal design of computer experiments for kernel-based and Gaussian process model emulation and calibration

This article is concerned with the approximation of high-dimensional functions by kernel-based methods. Motivated by uncertainty quantification, which often necessitates the construction of approximations that are accurate with respect to a probability density function of random variables, we aim at minimizing the approximation error with respect to a weighted $L^p$-norm. We present a greedy procedure for designing computer experiments based upon a weighted modification of the pivoted Cholesky factorization. The method successively generates nested samples with the goal of minimizing error in regions of high probability. Numerical experiments validate that this new importance sampling strategy is superior to other sampling approaches, especially when used with non-product probability density functions. We also show how to use the proposed algorithm to efficiently generate surrogates for inferring unknown model parameters from data.

97 MATHEMATICS AND COMPUTING↗

SU-E-J-191: Motion Prediction Using Extreme Learning Machine in Image Guided Radiotherapy

Purpose: Real-time motion tracking is a critical issue in image guided radiotherapy due to the time latency caused by image processing and system response. It is of great necessity to fast and accurately predict the future position of the respiratory motion and the tumor location. Methods: The prediction of respiratory position was done based on the positioning and tracking module in ARTS-IGRT system which was developed by FDS Team (www.fds.org.cn). An approach involving with the extreme learning machine (ELM) was adopted to predict the future respiratory position as well as the tumor’s location by training the past trajectories. For the training process, a feed-forward neural network with one single hidden layer was used for the learning. First, the number of hidden nodes was figured out for the single layered feed forward network (SLFN). Then the input weights and hidden layer biases of the SLFN were randomly assigned to calculate the hidden neuron output matrix. Finally, the predicted movement were obtained by applying the output weights and compared with the actual movement. Breathing movement acquired from the external infrared markers was used to test the prediction accuracy. And the implanted marker movement for the prostate cancer was used to test the implementation of the tumor motion prediction. Results: The accuracy of the predicted motion and the actual motion was tested. Five volunteers with different breathing patterns were tested. The average prediction time was 0.281s. And the standard deviation of prediction accuracy was 0.002 for the respiratory motion and 0.001 for the tumor motion. Conclusion: The extreme learning machine method can provide an accurate and fast prediction of the respiratory motion and the tumor location and therefore can meet the requirements of real-time tumor-tracking in image guided radiotherapy.

60 APPLIED LIFE SCIENCES↗

Toward Accelerating Discovery via Physics-Driven and Interactive Multifidelity Bayesian Optimization

Both computational and experimental material discovery bring forth the challenge of exploring multidimensional and often nondifferentiable parameter spaces, such as phase diagrams of Hamiltonians with multiple interactions, composition spaces of combinatorial libraries, processing spaces, and molecular embedding spaces. Often these systems are expensive or time consuming to evaluate a single instance, and hence classical approaches based on exhaustive grid or random search are too data intensive. This resulted in strong interest toward active learning methods such as Bayesian optimization (BO) where the adaptive exploration occurs based on human learning (discovery) objective. However, classical BO is based on a predefined optimization target, and policies balancing exploration and exploitation are purely data driven. In practical settings, the domain expert can pose prior knowledge of the system in the form of partially known physics laws and exploration policies often vary during the experiment. Here, we propose an interactive workflow building on multifidelity BO (MFBO), starting with classical (data-driven) MFBO, then expand to a proposed structured (physics-driven) structured MFBO (sMFBO), and finally extend it to allow human-in-the-loop interactive interactive MFBO (iMFBO) workflows for adaptive and domain expert aligned exploration. These approaches are demonstrated over highly nonsmooth multifidelity simulation data generated from an Ising model, considering spin–spin interaction as parameter space, lattice sizes as fidelity spaces, and the objective as maximizing heat capacity. Detailed analysis and comparison show the impact of physics knowledge injection and real-time human decisions for improved exploration with increased alignment to ground truth. Here, the associated notebooks allow to reproduce the reported analyses and apply them to other systems.

97 MATHEMATICS AND COMPUTING↗

Effect of hatch spacing and laser power on microstructure, texture, and thermomechanical properties of laser powder bed fusion (L-PBF) additively manufactured NiTi

This study systematically evaluates the effects of laser powder bed fusion additive manufacturing (L-PBF-AM) parameters (hatch spacing and laser power) on the thermomechanical behavior and microstructure of Ni 50.8 Ti 49.2 shape memory alloy. The samples were fabricated with hatch spacings from 40 to 240 µm and laser powers of 50 and 100 W at a constant scanning speed of 125 mm/s, resulting in parts with volumetric energy density levels from 55 to 666 J/mm 3 and two sets of linear energy densities of 0.4 and 0.8 J/mm. The results showed a reduced melt pool size and discontinuity of scan tracks with decreased laser power. Additionally, the porosity level was increased with larger hatch spacing and lower laser power. More notably, the transformation temperatures increased, and the critical stress, recoverable strain, and functional stability of samples improved with lower hatch spacing, where the recovery ratio of up to 90% was observed, regardless of the employed laser power. This study also discussed the relationship between the fabrication process and texture formation in the L-PBF-AM process. In conclusion, the advantage of L-PBF-AM was revealed in tailoring the microstructure from highly textured samples in [1 1 1] or [0 0 1] direction when hatch spacing lower than laser beam focused was employed, to the appearance of equiaxed solidification front with island grains and random orientations.

36 MATERIALS SCIENCE↗

Grouper: A Compact, Streamable Triangle Mesh Data Structure

Here, we present Grouper: an all-in-one compact file format, random-access data structure, and streamable representation for large triangle meshes. Similarly to the recently published SQuad representation, Grouper represents the geometry and connectivity of a mesh by grouping vertices and triangles into fixed-size records, most of which store two adjacent triangles and a shared vertex. Unlike SQuad, however, Grouper interleaves geometry with connectivity and uses a new connectivity representation to ensure that vertices and triangles can be stored in a coherent order that enables memory-efficient sequential stream processing. We also present a linear-time construction algorithm that allows streaming out Grouper meshes using a small memory footprint while preserving the initial ordering of vertices. In this construction, we show how the problem of assigning vertices and triangles to groups reduces to a well-known NP-hard optimization problem, and present a simple yet effective heuristic solution that performs well in practice. Our array-based Grouper representation also doubles as a triangle mesh data structure that allows direct access to vertices and triangles. Storing only about two integer references per triangle-i.e., less than the three vertex references stored with each triangle in a conventional indexed mesh format-Grouper answers both incidence and adjacency queries in amortized constant time. Our compact representation enables data-parallel processing on multicore computers, instant partitioning and fast transmission for distributed processing, as well as efficient out-of-core access. We demonstrate the versatility and performance benefits of Grouper using a suite of example meshes and processing kernels.

97 MATHEMATICS AND COMPUTING↗

Randomized Cholesky Preconditioning for Graph Partitioning Applications

A graph is a mathematical representation of a network; we say it consists of a set of vertices, which are connected by edges. Graphs have numerous applications in various fields, as they can model all sorts of connections, processes, or relations. For example, graphs can model intricate transit systems or the human nervous system. However, graphs that are large or complicated become difficult to analyze. This is why there is an increased interest in the area of graph partitioning, reducing the size of the graph into multiple partitions. For example, partitions of a graph representing a social network might help identify clusters of friends or colleagues. Graph partitioning is also a widely used approach to load balancing in parallel computing. The partitioning of a graph is extremely useful to decompose the graph into smaller parts and allow for easier analysis. There are different ways to solve graph partitioning problems. For this work, we focus on a spectral partitioning method which forms a partition based upon the eigenvectors of the graph Laplacian (details presented in Acer, et. al.). This method uses the LOBPCG algorithm to compute these eigenvectors. LOBPCG can be accelerated by an operator called a preconditioner. For this internship, we evaluate a randomized Cholesky (rchol) preconditioner for its effectiveness on graph partitioning problems with LOBPCG. We compare it with two standard preconditioners: Jacobi and Incomplete Cholesky (ichol). This research was conducted from August to December 2021 in conjunction with Sandia National Laboratories.

97 MATHEMATICS AND COMPUTING↗

Supervised detection of anomalous light curves in massive astronomical catalogs

The development of synoptic sky surveys has led to a massive amount of data for which resources needed for analysis are beyond human capabilities. In order to process this information and to extract all possible knowledge, machine learning techniques become necessary. Here we present a new methodology to automatically discover unknown variable objects in large astronomical catalogs. With the aim of taking full advantage of all information we have about known objects, our method is based on a supervised algorithm. In particular, we train a random forest classifier using known variability classes of objects and obtain votes for each of the objects in the training set. We then model this voting distribution with a Bayesian network and obtain the joint voting distribution among the training objects. Consequently, an unknown object is considered as an outlier insofar it has a low joint probability. By leaving out one of the classes on the training set, we perform a validity test and show that when the random forest classifier attempts to classify unknown light curves (the class left out), it votes with an unusual distribution among the classes. This rare voting is detected by the Bayesian network and expressed as a low joint probability. Our method is suitable for exploring massive data sets given that the training process is performed offline. We tested our algorithm on 20 million light curves from the MACHO catalog and generated a list of anomalous candidates. After analysis, we divided the candidates into two main classes of outliers: artifacts and intrinsic outliers. Artifacts were principally due to air mass variation, seasonal variation, bad calibration, or instrumental errors and were consequently removed from our outlier list and added to the training set. After retraining, we selected about 4000 objects, which we passed to a post-analysis stage by performing a cross-match with all publicly available catalogs. Within these candidates we identified certain known but rare objects such as eclipsing Cepheids, blue variables, cataclysmic variables, and X-ray sources. For some outliers there was no additional information. Among them we identified three unknown variability types and a few individual outliers that will be followed up in order to perform a deeper analysis.

79 ASTRONOMY AND ASTROPHYSICS↗

Time evolution of the distribution function for stochastically heated relativistic electrons in a laser field of picosecond duration

We report a numerical analysis of the stochastic acceleration of electrons, stipulated by a random change in the phase of the force acting on the electron. The main source of randomness is the random spatial distribution of electromagnetic fields in the focal region of multimode laser radiation. A typical frequency of the random phase change corresponding to the maximum impact of the effect under consideration lies in the range of (0.25–0.5)ν (ν is the radiation frequency of a neodymium laser). A wave packet model convenient for calculations taking into account the radiative transitions of the neodymium ion is proposed. The dependence of the average energy of relativistic electrons on the flux density in the range of 10{sup 15}–10{sup 18} W cm{sup -2} is calculated. The time dependence of the average electron energy during the laser pulse in the form of approximating formulas is constructed. The typical time for the development of stochastic heating of electrons is determined. It is found that the stochastic acceleration process weakly depends on the laser pulse duration, when the latter exceeds several hundred periods of the electromagnetic wave. (interaction of laser radiation with matter. laser plasma)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗