Search NASA⌕ Search

SEARCH · Search NASA

Results for “randomized algorithm”

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,009 records · Page 56

Toward Fully Automated Multicriterial Plan Generation: A Prospective Clinical Study

Purpose: To prospectively compare plans generated with iCycle, an in-house-developed algorithm for fully automated multicriterial intensity modulated radiation therapy (IMRT) beam profile and beam orientation optimization, with plans manually generated by dosimetrists using the clinical treatment planning system. Methods and Materials: For 20 randomly selected head-and-neck cancer patients with various tumor locations (of whom 13 received sequential boost treatments), we offered the treating physician the choice between an automatically generated iCycle plan and a manually optimized plan using standard clinical procedures. Although iCycle used a fixed “wish list” with hard constraints and prioritized objectives, the dosimetrists manually selected the beam configuration and fine tuned the constraints and objectives for each IMRT plan. Dosimetrists were not informed in advance whether a competing iCycle plan was made. The 2 plans were simultaneously presented to the physician, who then selected the plan to be used for treatment. For the patient group, differences in planning target volume coverage and sparing of critical tissues were quantified. Results: In 32 of 33 plan comparisons, the physician selected the iCycle plan for treatment. This highly consistent preference for the automatically generated plans was mainly caused by the improved sparing for the large majority of critical structures. With iCycle, the normal tissue complication probabilities for the parotid and submandibular glands were reduced by 2.4% ± 4.9% (maximum, 18.5%, P=.001) and 6.5% ± 8.3% (maximum, 27%, P=.005), respectively. The reduction in the mean oral cavity dose was 2.8 ± 2.8 Gy (maximum, 8.1 Gy, P=.005). For the swallowing muscles, the esophagus and larynx, the mean dose reduction was 3.3 ± 1.1 Gy (maximum, 9.2 Gy, P<.001). For 15 of the 20 patients, target coverage was also improved. Conclusions: In 97% of cases, automatically generated plans were selected for treatment because of the superior quality. Apart from the improved plan quality, automatic plan generation is economically attractive because of the reduced workload.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Parallel phase model : a programming model for high-end parallel machines with manycores.

This paper presents a parallel programming model, Parallel Phase Model (PPM), for next-generation high-end parallel machines based on a distributed memory architecture consisting of a networked cluster of nodes with a large number of cores on each node. PPM has a unified high-level programming abstraction that facilitates the design and implementation of parallel algorithms to exploit both the parallelism of the many cores and the parallelism at the cluster level. The programming abstraction will be suitable for expressing both fine-grained and coarse-grained parallelism. It includes a few high-level parallel programming language constructs that can be added as an extension to an existing (sequential or parallel) programming language such as C; and the implementation of PPM also includes a light-weight runtime library that runs on top of an existing network communication software layer (e.g. MPI). Design philosophy of PPM and details of the programming abstraction are also presented. Several unstructured applications that inherently require high-volume random fine-grained data accesses have been implemented in PPM with very promising results.

99 GENERAL AND MISCELLANEOUS↗

A block matching-based registration algorithm for localization of locally advanced lung tumors

Purpose: To implement and evaluate a block matching-based registration (BMR) algorithm for locally advanced lung tumor localization during image-guided radiotherapy. Methods: Small (1 cm{sup 3}), nonoverlapping image subvolumes (“blocks”) were automatically identified on the planning image to cover the tumor surface using a measure of the local intensity gradient. Blocks were independently and automatically registered to the on-treatment image using a rigid transform. To improve speed and robustness, registrations were performed iteratively from coarse to fine image resolution. At each resolution, all block displacements having a near-maximum similarity score were stored. From this list, a single displacement vector for each block was iteratively selected which maximized the consistency of displacement vectors across immediately neighboring blocks. These selected displacements were regularized using a median filter before proceeding to registrations at finer image resolutions. After evaluating all image resolutions, the global rigid transform of the on-treatment image was computed using a Procrustes analysis, providing the couch shift for patient setup correction. This algorithm was evaluated for 18 locally advanced lung cancer patients, each with 4–7 weekly on-treatment computed tomography scans having physician-delineated gross tumor volumes. Volume overlap (VO) and border displacement errors (BDE) were calculated relative to the nominal physician-identified targets to establish residual error after registration. Results: Implementation of multiresolution registration improved block matching accuracy by 39% compared to registration using only the full resolution images. By also considering multiple potential displacements per block, initial errors were reduced by 65%. Using the final implementation of the BMR algorithm, VO was significantly improved from 77% ± 21% (range: 0%–100%) in the initial bony alignment to 91% ± 8% (range: 56%–100%;p < 0.001). Left-right, anterior-posterior, and superior-inferior systematic BDE were 3.2, 2.4, and 4.4 mm, respectively, with random BDE of 2.4, 2.1, and 2.7 mm. Margins required to include both localization and delineation uncertainties ranged from 5.0 to 11.7 mm, an average of 40% less than required for bony alignment. Conclusions: BMR is a promising approach for automatic lung tumor localization. Further evaluation is warranted to assess the accuracy and robustness of BMR against other potential localization strategies.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A scalable variational method for estimating the latent infection-rate field of an outbreak

In this paper, we explore whether the infection-rate of a disease can serve as a robust monitoring variable in epidemiological surveillance algorithms. The infection-rate is dependent on population mixing patterns that do not vary erratically day-to-day; in contrast, daily case-counts used in contemporary surveillance algorithms are corrupted by reporting errors. The technical challenge lies in estimating the latent infection-rate from case-counts. Here we devise a Bayesian method to estimate the infection-rate across multiple adjoining areal units, and then use it, via an anomaly detector, to discern a change in epidemiological dynamics. We extend an existing model for estimating the infection-rate in an areal unit by incorporating a Markov random field model, so that we may estimate infection-rates across multiple areal units, while preserving spatial correlations observed in the epidemiological dynamics. To carry out the high-dimensional Bayesian inverse problem, we develop an implementation of mean-field variational inference specific to the infection model and integrate it with the random field model to incorporate correlations across counties. The method is tested on estimating the COVID-19 infection-rates across all 33 counties in New Mexico using data from the summer of 2020, and then employing them to detect the arrival of the Fall 2020 COVID-19 wave. We perform the detection using a temporal algorithm that is applied county-by-county. We also show how the infection-rate field can be used to cluster counties with similar epidemiological dynamics.

60 APPLIED LIFE SCIENCES↗

Using the Metropolis algorithm to explore the loss surface of a recurrent neural network

In the limit of small trial moves the Metropolis Monte Carlo algorithm is equivalent to gradient descent on the energy function in the presence of Gaussian white noise. This observation was originally used to demonstrate a correspondence between Metropolis Monte Carlo moves of model molecules and overdamped Langevin dynamics, but it also applies in the context of training a neural network: making small random changes to the weights of a neural network, accepted with the Metropolis probability, with the loss function playing the role of energy, has the same effect as training by explicit gradient descent in the presence of Gaussian white noise. We explore this correspondence in the context of a simple recurrent neural network. We also explore regimes in which this correspondence breaks down, where the gradient of the loss function becomes very large or small. In these regimes the Metropolis algorithm can still effect training, and so can be used as a probe of the loss function of a neural network in regimes in which gradient descent struggles. We also show that training can be accelerated by making purposely-designed Monte Carlo trial moves of neural-network weights.

Casert, Corneel↗

First-order nonadiabatic coupling matrix elements between excited states: A Lagrangian formulation at the CIS, RPA, TD-HF, and TD-DFT levels

Analytic expressions for the first-order nonadiabatic coupling matrix elements between electronically excited states are first formulated exactly via both time-independent equation of motion and time-dependent response theory, and are then approximated at the configuration interaction singles, particle-hole/particle-particle random phase approximation, and time-dependent density functional theory/Hartree-Fock levels of theory. Note that, to get the Pulay terms arising from the derivatives of basis functions, the standard response theory designed for electronic perturbations has to be extended to nuclear derivatives. The results are further recast into a Lagrangian form that is similar to that for excited-state energy gradients and allows to use atomic orbital based direct algorithms for large molecules.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Theory and praxis pf map analsys in CHEF part 1: Linear normal form

This memo begins a series which, put together, could comprise the 'CHEF Documentation Project' if there were such a thing. The first--and perhaps only--three will telegraphically describe theory, algorithms, implementation and usage of the normal form map analysis procedures encoded in CHEF's collection of libraries. [1] This one will begin the sequence by explaining the linear manipulations that connect the Jacobian matrix of a symplectic mapping to its normal form. It is a 'Reader's Digest' version of material I wrote in Intermediate Classical Dynamics (ICD) [2] and randomly scattered across technical memos, seminar viewgraphs, and lecture notes for the past quarter century. Much of its content is old, well known, and in some places borders on the trivial.1 Nevertheless, completeness requires their inclusion. The primary objective is the 'fundamental theorem' on normalization written on page 8. I plan to describe the nonlinear procedures in a subsequent memo and devote a third to laying out algorithms and lines of code, connecting them with equations written in the first two. Originally this was to be done in one short paper, but I jettisoned that approach after its first section exceeded a dozen pages. The organization of this document is as follows. A brief description of notation is followed by a section containing a general treatment of the linear problem. After the 'fundamental theorem' is proved, two further subsections discuss the generation of equilibrium distributions and issue of 'phase'. The final major section reviews parameterizations--that is, lattice functions--in two and four dimensions with a passing glance at the six-dimensional version. Appearances to the contrary, for the most part I have tried to restrict consideration to matters needed to understand the code in CHEF's libraries.

99 GENERAL AND MISCELLANEOUS↗

Hot, cold, or just right? An infrared biometric sensor to improve occupant comfort and reduce overcooling in buildings via closed-loop control

To improve occupant comfort and save energy in buildings, we have developed a closed-loop air conditioning (AC) sensor-controller that predicts occupant thermal sensation from the thermographic measurement of skin temperature distribution, then uses this information to reduce overcooling (cooling-energy overuse that discomforts occupants) by regulating AC output. Taking measures to protect privacy, it combines thermal-infrared (TIR) and color (visible spectrum) cameras with machine vision to measure the skin-surface temperature profile. Since the human thermoregulation system uses skin blood flow to maintain thermoneutrality, the distribution of skin temperature can be used to predict warm, neutral, and cool thermal states. We conducted a series of human-subject thermal-sensation trials in cold-to-hot environments, measuring skin temperatures and recording thermal sensation votes. We then trained random-forest classification machine-learning models (classifiers) to estimate thermal sensation from skin temperatures or skin-temperature differences. The estimated thermal sensation was input to a proportional integral (PI) control algorithm for the AC, targeting a sensation level between neutral and warm. Our sensor-controller includes a sensor assembly, server software, and client software. The server software orients the cameras and transmits images to the client software, which in turn assesses occupant skin temperature distribution, estimates occupant thermal sensation, and controls AC operation. A demonstration conducted in a conference room in an office building near Houston, TX showed that our system reduced overcooling, decreasing AC load by 42% when the room was occupied while improving occupant comfort (fraction of “comfortable” votes) by 15 percentage points.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

The Current Status and Future Directions of Heavy Charged Particle Therapy in Medicine

As aggressive, 3D-conformal treatment has become the clearly accepted goal of radiation oncology, heavy charged-particle treatment with protons and heavier ions has concurrently and relentlessly ascended to the forefront. Protons and helium nuclei, with relatively low linear-energy-transfer (LET) properties, have consistently been demonstrated to be beneficial for aggressive (high-dose) local treatment of many types of tumors. Protons have been applied to the majority of solid tumors, and have reached a high degree of general acceptance in radiation oncology after three decades and 55,000 patients treated. However, some 15% to 20% of tumor types have proven resistant to even the most aggressive low-LET irradiation. For these radio-resistant tumors, treatment with heavier ions (e.g., carbon) offers great potential benefit. These high-LET particles have increased relative biological effectiveness (RBE) that reaches its maximum in the Bragg peak. Irradiation with these heavier ions offers the unique combination of excellent 3D-dose distribution and increased RBE. We are presently witnessing several, important parallel developments in particle therapy. Protons will likely continue their exponential growth phase, and more compact design systems will make protons available to a larger patient population - thus becoming the 'heavy charged particle of choice' for Cancer Centers with limited financial resources. In parallel, major academic efforts will further advance the field of heavier ion therapy, exploring all opportunities for particle treatment and continuing the search for the ideal particle(s) for specific tumors. The future of ion therapy will be best realized by clinical trials that have ready access to top-quality delivery of both protons and heavier ions that can be accurately shaped for treatment of a specific pathology, and which will permit direct randomized-trial comparison of the effectiveness of the various ions for different diseases. Optimal results will require: (1) sophisticated target delineation that integrates CT, MRI and PET imaging; (2) reliable RBE modeling algorithms; (3) efficient beam-scanning technology that compensates for organ movements; (4) online beam control proximal to and within the patient; and (5) better understanding of dose-fractionation parameters. The current status and the anticipated future directions of the role of particle therapy in medicine is a complex subject that involves a very intimate interplay of radiobiology, accelerator physics and radiation oncology. The intention of this relatively brief manuscript is to describe the underlying principles, present the historical developments, highlight the clinical results, focus on the technical advances, and suggest likely future directions. We have also attempted to present a balanced, consensus view of the past achievements and current strategies in particle therapy, in a manner of interest both to long-term experts and to educated newcomers to this field.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Demonstration of reconstruction-free static magnetic control of DIII-D plasma with deep reinforcement learning

This paper presents the development and experimental validation of a reinforcement learning (RL)-based magnetic controller on the DIII-D tokamak. The controller directly maps raw magnetic diagnostic signals to actuator commands, replacing the traditional isoflux control algorithm based on equilibrium reconstruction. Four RL controllers are trained using the Soft Actor–Critic algorithm with an asymmetric Actor–Critic architecture in the NSFsim simulator. All controllers are deployed in the DIII-D Plasma Control System and operated with a 4 kHz feedback loop. Two randomization strategies are evaluated during training: evolving kinetic profiles and fixed kinetic profiles within each episode. The latter approach is found to better capture experimental deviations in the current density profile and to provide overall improved control performance. Robust operation is demonstrated across heating power scans in both L- and H-mode plasmas, as well as during transient events such as L–H transitions and pellet injections. Control errors in plasma shape and radial position remained within 1.5–2.0 cm and 1 cm, respectively. A notable discrepancy was observed in the vertical X-point position, with errors of up to approximately 4 cm, attributed to the current density distribution mismatches between simulations and experiments.

DIII-D↗

Graph Sparsification by Approximate matrix Multiplication

Graphs arising in statistical problems, signal processing, large networks, combinatorial optimization, and data analysis are often dense, which causes both computational and storage bottlenecks. One way of sparsifying a weighted graph, while sharing the same vertices as the original graph but reducing the number of edges, is through spectral sparsification. We study this problem through the perspective of RandNLA. Specifically, we utilize randomized matrix multiplication to give a clean and simple analysis of how sampling according to edge weights gives a spectral approximation to graph Laplacians, without requiring spectral information. Through the CR–MM algorithm, we attain a simple and computationally efficient sparsifier whose resulting Laplacian estimate is unbiased and of minimum variance. Here, we define a new notion of additive spectral sparsifiers, which has not been considered in the literature.

97 MATHEMATICS AND COMPUTING↗

Approximate Dynamic Programming With Enhanced Off-Policy Learning for Coordinating Distributed Energy Resources

Herein this paper proposes an innovative approximate dynamic programming (ADP) method for distributed energy resource coordination with the loss of life of battery energy storage system (BESS) explicitly modeled. The dispatch policy is designed to account for both calendrical and cyclical aging effects on BESS, explicitly modeling the impacts of ambient temperature on BESS lifespan. The proposed ADP employs an adaptive critic method and enhanced off-policy deterministic policy gradient (DPG) strategy, addressing the limitations of the on-policy gradient-based ADP approaches, including inadequate exploration, low data usage, and computational complexity. In particular, a customized policy is proposed to guide the algorithm to explore some promising decisions and thereby improve exploration capability and learning efficiency compared to conventional DPG-based learning approaches, which may struggle to find a global optimum due to random noisy action-based exploration or require expert demonstration with extra effort. The proposed method is illustrated using the IEEE 123-node system and compared with the existing ADP methods to prove solution accuracy and demonstrate the effects of incorporating degradation models into control design. Case studies showed that the proposed ADP effectively coordinates DERs with a 10 times smaller optimization gap compared to existing methods, and the incorporation of the BESS life loss model ensures the expected lifespan and results in significant cost savings.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Latest developments in seismic texture analysis for subsurface structure, facies, and reservoir characterization: A review

In exploration geology and geophysics, seismic texture is still a developing concept that has not been sufficiently known, although quite a number of different algorithms have been published in the literature. This paper provides a review of the seismic texture concepts and methodologies, focusing on latest developments in seismic amplitude texture analysis, with particular reference to the gray level co-occurrence matrix (GLCM) and the texture model regression (TMR) methods. The GLCM method evaluates spatial arrangements of amplitude samples within an analysis window using a matrix (a two-dimensional histogram) of amplitude co-occurrence. The matrix is then transformed into a suite of texture attributes, such as homogeneity, contrast, and randomness, which provide the basis for seismic facies classification. The TMR method uses a texture model as reference to discriminate among seismic features based on a linear, least-squares regression analysis between the model and the data within an analysis window. By implementing customized texture model schemes, the TMR algorithm has the flexibility to characterize subsurface geology for different purposes. A texture model with a constant phase is effective at enhancing the visibility of seismic structural fabrics, a texture model with a variable phase is helpful for visualizing seismic facies, and a texture model with variable amplitude, frequency, and size is instrumental in calibrating seismic to reservoir properties. Preliminary test case studies in the very recent past have indicated that the latest developments in seismic texture analysis have added to the existing amplitude interpretation theories and methodologies. These and future developments in seismic texture theory and methodologies will hopefully lead to a better understanding of the geologic implications of the seismic texture concept and to an improved geologic interpretation of reflection seismic amplitude

58 GEOSCIENCES↗

Multi-agent motion planning with sporadic communications for collision avoidance

Here, a novel multi-vehicle motion planning and collision avoidance algorithm is proposed and analyzed. The algorithm aims to reduce the amount of onboard calculations and inter-agent communications needed for each vehicle to successfully navigate through an environment with static obstacles and reach their goals. To this end, each agent first calculates a path to the goal by means of an asymptotically optimal rapidly-exploring random tree (RRT*) with respect to the static obstacles. Then, other agents are treated as dynamic obstacles and potential collisions are determined by means of collision cones. Collision cones depend on the position and velocity from other agents and are grown conservatively between inter-agent communications. Based on the available information, each agent determines if a deconfliction maneuver is needed, if it can continue along its current path, or if communication is needed to make a decision about a conflict. With probability one, our algorithm guarantees that the agents keep from colliding with each other. Under an assumption on the existence of a solution for a vehicle to its goal, this algorithm also solves the planning problem with probability one. Simulations illustrate a group of agents successfully reaching their goal configurations and examine how the uncertainty affects the communication frequency of the multi-agent system.

33 ADVANCED PROPULSION SYSTEMS↗

Random Forests as a Viable Method to Select and Discover High-redshift Quasars

We present a method of selecting quasars up to redshift ≈6 with random forests, a supervised machine-learning method, applied to Pan-STARRS1 and WISE data. We find that, thanks to the increasing set of known quasars, we can assemble a training set that enables supervised machine-learning algorithms to become a competitive alternative to other methods up to this redshift. We present a candidate set for the redshift range 4.8–6.3, which includes the region around z = 5.5 where selecting quasars is difficult due to their photometric similarity to red and brown dwarfs. We demonstrate that, under our survey restrictions, we can reach a high completeness (66% ± 7% below redshift 5.6/83{sub -9}{sup +6}% above redshift 5.6) while maintaining a high selection efficiency (78{sub -8}{sup +10}%/94{sub -8}{sup +5}%). Our selection efficiency is estimated via a novel method based on the different distributions of quasars and contaminants on the sky. The final catalog of 515 candidates includes 225 known quasars. We predict the candidate catalog to contain additional 148{sub -33}{sup +41} new quasars below redshift 5.6 and 45{sub -8}{sup +5} above, and we make the catalog publicly available. Spectroscopic follow-up observations of 37 candidates led us to discover 20 new high redshift quasars (18 at 4.6 ≤ z ≤ 5.5, 2 z ~ 5.7). These observations are consistent with our predictions on efficiency. We argue that random forests can lead to higher completeness because our candidate set contains a number of objects that would be rejected by common color cuts, including one of the newly discovered redshift 5.7 quasars.

79 ASTRONOMY AND ASTROPHYSICS↗

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↗