Search NASA⌕ Search

SEARCH · Search NASA

Results for “Minimization”

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 163 records · Page 9

Increasingly minimal bias routing

A system and algorithm configured to generate diversity at the traffic source so that packets are uniformly distributed over all of the available paths, but to increase the likelihood of taking a minimal path with each hop the packet takes. This is achieved by configuring routing biases so as to prefer non-minimal paths at the injection point, but increasingly prefer minimal paths as the packet proceeds, referred to herein as Increasing Minimal Bias (IMB).

97 MATHEMATICS AND COMPUTING↗

Quantifying impact reduction due to avoidance, minimization and restoration for a natural gas pipeline in the Peruvian Andes

We present monitoring methods and quantitative biodiversity data to document components of the mitigation hierarchy. We estimated avoidance, minimization, restoration and impact reduction in quality hectares for the 25 m wide right of way of a 408 km natural gas buried pipeline that crosses 14 Ecological Landscape Units (ELUs) in the tropical Andes of Peru. We found that applying the mitigation hierarchy as part of a comprehensive biodiversity action plan substantially reduced impacts on biodiversity in all habitats studied. Avoidance and right of way minimization contributed to significant impact reduction. We quantified impact reduction during construction and operation on the right of way of the pipeline over a five-year period and found that restoration was the greatest contributor to reducing impacts. We documented that most ELUs have a positive restoration trajectory. We also documented how monitoring over large scale spatial scales, in combination with site-specific monitoring, generated data for management to determine restoration priorities and impact mitigation. A biodiversity action plan that incorporated the mitigation hierarchy and a science-based biodiversity monitoring and assessment program contributed to biodiversity management of the project and played an important role in minimizing and managing impacts. - Highlights: •Quantitative data for mitigation hierarchy components are presented. •Application of the mitigation hierarchy reduced impacts on biodiversity. •A biodiversity monitoring program provided data to reduce impacts.

03 NATURAL GAS↗

A novel technique for minimizing energy functional using neural networks

An energy functional describes the equilibrium state of a system. In this work, we present a novel technique, Functional Optimization using Neural Networks (FONN), for minimizing the system’s energy. FONN utilizes neural networks to process information at discrete grid points, considering their interactions with neighboring grid points, to update the state of the system. The training process involves formulating a loss function based on the system’s energy, and with the help of multiple fine-tuning steps, the method employs a progressive energy reduction technique that decreases the energy in multiple steps. FONN’s effectiveness is demonstrated across various problems, including the minimization of the heat and Lyapunov energy. Furthermore, the paper explores the minimization of the elastic bending energy with an area constraint.

97 MATHEMATICS AND COMPUTING↗

Reweighted ℓ{sub 1} minimization method for stochastic elliptic differential equations

We consider elliptic stochastic partial differential equations (SPDEs) with random coefficients and solve them by expanding the solution using generalized polynomial chaos (gPC). Under some mild conditions on the coefficients, the solution is “sparse” in the random space, i.e., only a small number of gPC basis makes considerable contribution to the solution. To exploit this sparsity, we employ reweighted l{sub 1} minimization to recover the coefficients of the gPC expansion. We also combine this method with random sampling points based on the Chebyshev probability measure to further increase the accuracy of the recovery of the gPC coefficients. We first present a one-dimensional test to demonstrate the main idea, and then we consider 14 and 40 dimensional elliptic SPDEs to demonstrate the significant improvement of this method over the standard l{sub 1} minimization method. For moderately high dimensional (∼10) problems, the combination of Chebyshev measure with reweighted l{sub 1} minimization performs well while for higher dimensional problems, reweighted l{sub 1} only is sufficient. The proposed approach is especially suitable for problems for which the deterministic solver is very expensive since it reuses the sampling results and exploits all the information available from limited sources.

97 MATHEMATICS AND COMPUTING↗

Minimizing Energy Consumption from Connected Signalized Intersections by Reinforcement Learning

Explicit energy minimization objectives are often discouraged in signal optimization algorithms due to its negative impact on mobility performance. One potential direction to solve this problem is to provide a balanced objective function to achieve desired mobility with minimized energy consumption. This research developed a reinforcement learning (RL) based control with reward functions considering energy and mobility in a joint manner-a penalty function is introduced for number of stops. Further, we proposed a clustering-based technique to make the state-space finite which is critical for a tractable implementation of the RL algorithm. We implemented the algorithm in a calibrated NG-SIM network within a traffic micro-simulator-PTV VISSIM. With sole focus on energy, we report 47% reduction in energy consumption when compared with existing signal control schemes, however causing a 65.6% increase in system travel time. In contrast, the control strategy focusing on energy minimization with penalty for stops yields 6.7% reduction in energy consumption with 27% increase in system travel time. The developed RL algorithm with a flexible penalty function in the reward will achieve desired energy goals for a network of signalized intersections without compromising on the mobility performance.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A constrained, total-variation minimization algorithm for low-intensity x-ray CT

Purpose: The authors developed an iterative image-reconstruction algorithm for application to low-intensity computed tomography projection data, which is based on constrained, total-variation (TV) minimization. The algorithm design focuses on recovering structure on length scales comparable to a detector bin width. Methods: Recovering the resolution on the scale of a detector bin requires that pixel size be much smaller than the bin width. The resulting image array contains many more pixels than data, and this undersampling is overcome with a combination of Fourier upsampling of each projection and the use of constrained, TV minimization, as suggested by compressive sensing. The presented pseudocode for solving constrained, TV minimization is designed to yield an accurate solution to this optimization problem within 100 iterations. Results: The proposed image-reconstruction algorithm is applied to a low-intensity scan of a rabbit with a thin wire to test the resolution. The proposed algorithm is compared to filtered backprojection (FBP). Conclusions: The algorithm may have some advantage over FBP in that the resulting noise level is lowered at equivalent contrast levels of the wire.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

MO-FG-204-01: Improved Noise Suppression for Dual-Energy CT Through Entropy Minimization

Purpose: In dual energy CT (DECT), noise amplification during signal decomposition significantly limits the utility of basis material images. Since clinically relevant objects contain a limited number of materials, we propose to suppress noise for DECT based on image entropy minimization. An adaptive weighting scheme is employed during noise suppression to improve decomposition accuracy with limited effect on spatial resolution and image texture preservation. Methods: From decomposed images, we first generate a 2D plot of scattered data points, using basis material densities as coordinates. Data points representing the same material generate a highly asymmetric cluster. We orient an axis by minimizing the entropy in a 1D histogram of these points projected onto the axis. To suppress noise, we replace pixel values of decomposed images with center-of-mass values in the direction perpendicular to the optimal axis. To limit errors due to cluster overlap, we weight each data point’s contribution based on its high and low energy CT values and location within the image. The proposed method’s performance is assessed on physical phantom studies. Electron density is used as the quality metric for decomposition accuracy. Our results are compared to those without noise suppression and with a recently developed iterative method. Results: The proposed method reduces noise standard deviations of the decomposed images by at least one order of magnitude. On the Catphan phantom, this method greatly preserves the spatial resolution and texture of the CT images and limits induced error in measured electron density to below 1.2%. In the head phantom study, the proposed method performs the best in retaining fine, intricate structures. Conclusion: The entropy minimization based algorithm with adaptive weighting substantially reduces DECT noise while preserving image spatial resolution and texture. Future investigations will include extensive investigations on material decomposition accuracy that go beyond the current electron density calculations. This work was supported in part by the National Institutes of Health (NIH) under Grant Number R21 EB012700.

60 APPLIED LIFE SCIENCES↗

Minimal Coordinate Formulation of Contact Dynamics in Operational Space

In recent years, complementarity techniques have been developed for modeling non-smooth contact and collision dynamics problems for multi-link robotic systems. Normally, in this approach, a linear complementarity problem (LCP) is set up using 6n non-minimal coordinates for a system with n links together with all the unilateral constraints and inter-link bilateral constraints on the system. In this paper, we use operational space dynamics to develop a complementarity formulation for contact and collision dynamics that uses minimal coordinates. The use of such non-redundant coordinates results in much smaller size LCP problems and the automatic enforcement of the inter-link bilateral constraints. Furthermore, we exploit operational space low-order computational algorithms to overcome some of the bottlenecks in using minimal coordinates.

contact dynamics↗

Application of Sequential Quadratic Programming to Minimize Smart Active Flap Rotor Hub Loads

In an analytical study, SMART active flap rotor hub loads have been minimized using nonlinear programming constrained optimization methodology. The recently developed NLPQLP system (Schittkowski, 2010) that employs Sequential Quadratic Programming (SQP) as its core algorithm was embedded into a driver code (NLP10x10) specifically designed to minimize active flap rotor hub loads (Leyland, 2014). Three types of practical constraints on the flap deflections have been considered. To validate the current application, two other optimization methods have been used: i) the standard, linear unconstrained method, and ii) the nonlinear Generalized Reduced Gradient (GRG) method with constraints. The new software code NLP10x10 has been systematically checked out. It has been verified that NLP10x10 is functioning as desired. The following are briefly covered in this paper: relevant optimization theory; implementation of the capability of minimizing a metric of all, or a subset, of the hub loads as well as the capability of using all, or a subset, of the flap harmonics; and finally, solutions for the SMART rotor. The eventual goal is to implement NLP10x10 in a real-time wind tunnel environment.

HUB LOADS↗

Real-Time Adaptive Least-Squares Drag Minimization for Performance Adaptive Aeroelastic Wing

This paper contains a simulation study of a real-time adaptive least-squares drag minimization algorithm for an aeroelastic model of a flexible wing aircraft. The aircraft model is based on the NASA Generic Transport Model (GTM). The wing structures incorporate a novel aerodynamic control surface known as the Variable Camber Continuous Trailing Edge Flap (VCCTEF). The drag minimization algorithm uses the Newton-Raphson method to find the optimal VCCTEF deflections for minimum drag in the context of an altitude-hold flight control mode at cruise conditions. The aerodynamic coefficient parameters used in this optimization method are identified in real-time using Recursive Least Squares (RLS). The results demonstrate the potential of the VCCTEF to improve aerodynamic efficiency for drag minimization for transport aircraft.

Aeroservoelasticity↗

Finding a Minimally Informative Dirichlet Prior Distribution Using Least Squares

In a Bayesian framework, the Dirichlet distribution is the conjugate distribution to the multinomial likelihood function, and so the analyst is required to develop a Dirichlet prior that incorporates available information. However, as it is a multiparameter distribution, choosing the Dirichlet parameters is less straight-forward than choosing a prior distribution for a single parameter, such as p in the binomial distribution. In particular, one may wish to incorporate limited information into the prior, resulting in a minimally informative prior distribution that is responsive to updates with sparse data. In the case of binomial p or Poisson, the principle of maximum entropy can be employed to obtain a so-called constrained noninformative prior. However, even in the case of p, such a distribution cannot be written down in closed form, and so an approximate beta distribution is used in the case of p. In the case of the multinomial model with parametric constraints, the approach of maximum entropy does not appear tractable. This paper presents an alternative approach, based on constrained minimization of a least-squares objective function, which leads to a minimally informative Dirichlet prior distribution. The alpha-factor model for common-cause failure, which is widely used in the United States, is the motivation for this approach, and is used to illustrate the method. In this approach to modeling common-cause failure, the alpha-factors, which are the parameters in the underlying multinomial aleatory model for common-cause failure, must be estimated from data that is often quite sparse, because common-cause failures tend to be rare, especially failures of more than two or three components, and so a prior distribution that is responsive to updates with sparse data is needed.

99 GENERAL AND MISCELLANEOUS↗

Finding A Minimally Informative Dirichlet Prior Using Least Squares

In a Bayesian framework, the Dirichlet distribution is the conjugate distribution to the multinomial likelihood function, and so the analyst is required to develop a Dirichlet prior that incorporates available information. However, as it is a multiparameter distribution, choosing the Dirichlet parameters is less straightforward than choosing a prior distribution for a single parameter, such as p in the binomial distribution. In particular, one may wish to incorporate limited information into the prior, resulting in a minimally informative prior distribution that is responsive to updates with sparse data. In the case of binomial p or Poisson \lambda, the principle of maximum entropy can be employed to obtain a so-called constrained noninformative prior. However, even in the case of p, such a distribution cannot be written down in the form of a standard distribution (e.g., beta, gamma), and so a beta distribution is used as an approximation in the case of p. In the case of the multinomial model with parametric constraints, the approach of maximum entropy does not appear tractable. This paper presents an alternative approach, based on constrained minimization of a least-squares objective function, which leads to a minimally informative Dirichlet prior distribution. The alpha-factor model for common-cause failure, which is widely used in the United States, is the motivation for this approach, and is used to illustrate the method. In this approach to modeling common-cause failure, the alpha-factors, which are the parameters in the underlying multinomial model for common-cause failure, must be estimated from data that are often quite sparse, because common-cause failures tend to be rare, especially failures of more than two or three components, and so a prior distribution that is responsive to updates with sparse data is needed.

99 GENERAL AND MISCELLANEOUS↗

Low-Level Waste Minimization and Management Planning at the Western Waste Management Facility, Ontario Power Generation - 19235

The purpose of this study was to examine the strategies intended to mitigate the temporary storage restrictions for Low-Level radioactive waste at the Western Waste Management Facility to enable continued accommodation of waste generation rates, and to recover storage capacity from 2018-2023 to optimize long-term sustainability for radioactive waste management. The management options considered were based on existing waste processing technologies and programs available at the Western Waste Management Facility, in combination with third party volume-reduction services. Completed analysis measured the consumption of Low-Level Waste storage space as influenced by the projected volumes from nuclear generating stations, and the various processing scenarios developed; such as reducing the volume of surplus processable waste on-site, and the reduction of specific waste streams previously considered to be non-processable. Results from the quantitative analysis indicated which strategies will be most effective for minimizing waste volumes for long-term storage and for recovering low-level storage space at the Western Waste Management Facility. The strategic path forward is presented in short- to long-term management objectives. Results from this study will contribute to the waste stream planning and management of major reactor refurbishment projects and to the technological advancements and innovation of radioactive waste processing and minimization. With further understanding of the refurbishment-specific waste types and volumes, it is expected that Nuclear Waste Management and the nuclear generating stations will achieve increasingly improved minimization results with the progression of each refurbished reactor. (author)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Model-dependence of minimal-twist OPEs in d > 2 holographic CFTs

Following recent work on heavy-light correlators in higher-dimensional conformal field theories (CFTs) with a large central charge C T , we clarify the properties of stress tensor composite primary operators of minimal twist, [ T m ], using arguments in both CFT and gravity. We provide an efficient proof that the three-point coupling $\left\langle {\mathcal{O}}_L{\mathcal{O}}_L\left[{T}^m\right]\right\rangle$, where ${\mathcal{O}}_L$ is any light primary operator, is independent of the purely gravitational action. Next, we consider corrections to this coupling due to additional interactions in AdS effective field theory and the corresponding dual CFT. When the CFT contains a non-zero three-point coupling $\left\langle TT{\mathcal{O}}_L\right\rangle$, the three-point coupling $\left\langle {\mathcal{O}}_L{\mathcal{O}}_L\left[{T}^2\right]\right\rangle$ is modified at large C T if $\left\langle TT{\mathcal{O}}_L\right\rangle \sim \sqrt{C_T}$. This scaling is obeyed by the dilaton, by Kaluza-Klein modes of prototypical supergravity compactifications, and by scalars in stress tensor multiplets of supersymmetric CFTs. Quartic derivative interactions involving the graviton and the light probe field dual to ${\mathcal{O}}_L $ can also modify the minimal-twist couplings; these local interactions may be generated by integrating out a spin- ℓ ≥ 2 bulk field at tree level, or any spin ℓ at loop level. These results show how the minimal-twist OPE coefficients can depend on the higher-spin gap scale, even perturbatively.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Convex Programs for Minimal-Area Problems

The minimal-area problem that defines string diagrams in closed string field theory asks for the metric of least area on a Riemann surface with the condition that all non-contractible closed curves have length at least 2π. This is an extremal length problem in conformal geometry as well as a problem in systolic geometry. Here, we consider the analogous minimal-area problem for homology classes of curves and, with the aid of calibrations and the max flow-min cut theorem, formulate it as a local convex program. We derive an equivalent dual program involving maximization of a concave functional. These two programs give new insights into the form of the minimal-area metric and are amenable to numerical solution. We explain how the homology problem can be modified to provide the solution to the original homotopy problem.

97 MATHEMATICS AND COMPUTING↗

Minimal-Area Metrics on the Swiss Cross and Punctured Torus

The closed string theory minimal-area problem asks for the conformal metric of least area on a Riemann surface with the condition that all non-contractible closed curves have length greater than or equal to an arbitrary constant that can be set to one. Through every point in such a metric there is a geodesic that saturates the length condition, and the saturating geodesics in a given homotopy class form a band. The extremal metric is unknown when bands of geodesics cross, as it happens for surfaces of non-zero genus. Here, we use recently proposed convex programs to numerically find the minimal-area metric on the square torus with a square boundary, for various sizes of the boundary. For large enough boundary the problem is equivalent to the “Swiss cross” challenge posed by Strebel. We find that the metric is positively curved in the two-band region and flat in the single-band regions. For small boundary the metric develops a third band of geodesics wrapping around it, and has both regions of positive and of negative curvature. This surface can be completed to provide the minimal-area metric on a once-punctured torus, representing a closed-string tadpole diagram.

97 MATHEMATICS AND COMPUTING↗

Lumbar Spinal Stenosis Minimally Invasive Treatment with Bilateral Transpedicular Facet Augmentation System

Purpose. The purpose of this study was to evaluate the effectiveness of a new pedicle screw-based posterior dynamic stabilization device PDS Percudyn System Trade-Mark-Sign Anchor and Stabilizer (Interventional Spine Inc., Irvine, CA) as alternative minimally invasive treatment for patients with lumbar spine stenosis. Methods. Twenty-four consecutive patients (8 women, 16 men; mean age 61.8 yr) with lumbar spinal stenosis underwent implantation of the minimally invasive pedicle screw-based device for posterior dynamic stabilization. Inclusion criteria were lumbar stenosis without signs of instability, resistant to conservative treatment, and eligible to traditional surgical posterior decompression. Results. Twenty patients (83 %) progressively improved during the 1-year follow-up. Four (17 %) patients did not show any improvement and opted for surgical posterior decompression. For both responder and nonresponder patients, no device-related complications were reported. Conclusions. Minimally invasive PDS Percudyn System Trade-Mark-Sign has effectively improved the clinical setting of 83 % of highly selected patients treated, delaying the need for traditional surgical therapy.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Minimal position-velocity uncertainty wave packets in relativistic and non-relativistic quantum mechanics

We consider wave packets of free particles with a general energy-momentum dispersion relation E(p). The spreading of the wave packet is determined by the velocity v={partial_derivative}{sub p}E. The position-velocity uncertainty relation {delta}x{delta}v{>=}1/2 |<{partial_derivative}{sub p}{sup 2}E>| is saturated by minimal uncertainty wave packets {phi}(p)=Aexp(-{alpha}E(p)+{beta}p). In addition to the standard minimal Gaussian wave packets corresponding to the non-relativistic dispersion relation E(p)=p{sup 2}/2m, analytic calculations are presented for the spreading of wave packets with minimal position-velocity uncertainty product for the lattice dispersion relation E(p)=-cos(pa)/ma{sup 2} as well as for the relativistic dispersion relation E(p)={radical}(p{sup 2}+m{sup 2}). The boost properties of moving relativistic wave packets as well as the propagation of wave packets in an expanding Universe are also discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗