Search NASA⌕ Search

SEARCH · Search NASA

Results for “hard constraint”

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 55 records · Page 3

iCycle: Integrated, multicriterial beam angle, and profile optimization for generation of coplanar and noncoplanar IMRT plans

Purpose: To introduce iCycle, a novel algorithm for integrated, multicriterial optimization of beam angles, and intensity modulated radiotherapy (IMRT) profiles. Methods: A multicriterial plan optimization with iCycle is based on a prescription called wish-list, containing hard constraints and objectives with ascribed priorities. Priorities are ordinal parameters used for relative importance ranking of the objectives. The higher an objective priority is, the higher the probability that the corresponding objective will be met. Beam directions are selected from an input set of candidate directions. Input sets can be restricted, e.g., to allow only generation of coplanar plans, or to avoid collisions between patient/couch and the gantry in a noncoplanar setup. Obtaining clinically feasible calculation times was an important design criterium for development of iCycle. This could be realized by sequentially adding beams to the treatment plan in an iterative procedure. Each iteration loop starts with selection of the optimal direction to be added. Then, a Pareto-optimal IMRT plan is generated for the (fixed) beam setup that includes all so far selected directions, using a previously published algorithm for multicriterial optimization of fluence profiles for a fixed beam arrangement Breedveld et al.[Phys. Med. Biol. 54, 7199-7209 (2009)]. To select the next direction, each not yet selected candidate direction is temporarily added to the plan and an optimization problem, derived from the Lagrangian obtained from the just performed optimization for establishing the Pareto-optimal plan, is solved. For each patient, a single one-beam, two-beam, three-beam, etc. Pareto-optimal plan is generated until addition of beams does no longer result in significant plan quality improvement. Plan generation with iCycle is fully automated. Results: Performance and characteristics of iCycle are demonstrated by generating plans for a maxillary sinus case, a cervical cancer patient, and a liver patient treated with SBRT. Plans generated with beam angle optimization did better meet the clinical goals than equiangular or manually selected configurations. For the maxillary sinus and liver cases, significant improvements for noncoplanar setups were seen. The cervix case showed that also in IMRT with coplanar setups, beam angle optimization with iCycle may improve plan quality. Computation times for coplanar plans were around 1-2 h and for noncoplanar plans 4-7 h, depending on the number of beams and the complexity of the site. Conclusions: Integrated beam angle and profile optimization with iCycle may result in significant improvements in treatment plan quality. Due to automation, the plan generation workload is minimal. Clinical application has started.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

TH-C-12A-07: Implementation of a Pulsed Low Dose Date Radiotherapy (PLRT) Protocol for Recurrent Cancers Using Advanced Beam Delivery

Purpose: Recent in vitro and in vivo experimental findings provided strong evidence that pulsed low-dose-rate radiotherapy (PLDR) produced equivalent tumor control as conventional radiotherapy with significantly reduced normal tissue toxicities. This work aimed to implement a PLDR clinical protocol for the management of recurrent cancers utilizing IMRT and VMAT. Methods: Our PLDR protocol requires that the daily 2Gy dose be delivered in 0.2Gy×10 pulses with a 3min interval between the pulses. To take advantage of low-dose hyper-radiosensitivity the mean dose to the target is set at 0.2Gy and the maximum dose is limited to 0.4Gy per pulse. Practical planning strategies were developed for IMRT and VMAT: (1) set 10 ports for IMRT and 10 arcs for VMAT with each angle/arc as a pulse; (2) set the mean dose (0.2Gy) and maximum dose (0.4Gy) to the target per pulse as hard constraints (no constraints to OARs); (3) select optimal port/arc angles to avoid OARs; and (4) use reference structures in or around target/OARs to reduce maximum dose to the target/OARs. IMRT, VMAT and 3DCRT plans were generated for 60 H and N, breast, lung, pancreas and prostate patients and compared. Results: All PLDR treatment plans using IMRT and VMAT met the dosimetry requirements of the PLDR protocol (mean target dose: 0.20Gy±0.01Gy; maximum target dose < 0.4Gy). In comparison with 3DCRT, IMRT and VMAT exhibited improved target dose conformity and OAR dose sparing. A single arc can minimize the difference in the target dose due to multi-angle incidence although the delivery time is longer than 3DCRT and IMRT. Conclusion: IMRT and VMAT are better modalities for PLDR treatment of recurrent cancers with superior target dose conformity and critical structure sparing. The planning strategies/guidelines developed in this work are practical for IMRT/VMAT treatment planning to meet the dosimetry requirements of the PLDR protocol.

60 APPLIED LIFE SCIENCES↗

SU-F-T-27: A Comparative Case Study Among Four Modalities for the Superficial Treatment of Squamous Cell Carcinoma

Purpose: We performed a comparative planning study among High Dose Rate (HDR) brachytherapy, superficial electrons, Volume Modulated Arc Therapy (VMAT), and Helical IMRT (Tomotherapy) for squamous cell carcinoma of the abdominal wall with consideration for the underlining bowel. Methods: A 69-year old female presented with squamous cell carcinoma protruding 8mm beyond the anterior skin surface of the midabdomen was considered for treatment. The patient had a ventral hernia which resulted in the reduction of the abdominal wall thickness and the adjacent small bowel being the dose limiting structure. Four plans were generated using different treatment modalities: a) an enface electron field (eMC, Eclipse v. 11), b) Tomotherapy (HI-Art II v.5.0.5), c) VMAT (Acuros, Eclipse v. 11), and d) HDR using a Freiburg applicator (Oncentra v. 4.3). The following plan objectives were used for all four plans: for the CTV target, V90% ≥90% (61.8Gy2/2).For the small bowel, D0.1cc < 56.2 Gy2/2 was a hard constraint and expressed as a percentage of the prescription for comparison to demonstrate the dose fall-off achieved among the modalities.For HDR, V200% <0.1cc was an additional constraint. Multiple dosimetric parameters, including those listed above, were compared among the four modalities. Results: The HDR plan showed comparable target coverage compared to the Tomotherapy plan and better coverage compared to the electron plan. Small bowel doses (D0.1cc) were lower in HDR plan compared to Tomotherapy, electron, & VMAT plans (88.8%, 89.6%, 90.9%, & 96.6%). Integral dose to the whole body (V5%) was much higher for HDR, VMAT, and Tomotherapy when compared to electron plan by factors of seven, eight, and ten, respectively. After reviewing all treatment modalities, the physician selected HDR owing to better control of the small bowel dose while maintaining adequate target coverage. Conclusion: This case study demonstrated HDR can successfully treat superficial lesions with superior sparing of underlying structures.

60 APPLIED LIFE SCIENCES↗

Emergent inequality and self-organized social classes in a network of power and frustration

We propose a simple agent-based model on a network to conceptualize the allocation of limited wealth among more abundant expectations at the interplay of power, frustration, and initiative. Concepts imported from the statistical physics of frustrated systems in and out of equilibrium allow us to compare subjective measures of frustration and satisfaction to collective measures of fairness in wealth distribution, such as the Lorenz curve and the Gini index. We find that a completely libertarian, law-of-the-jungle setting, where every agent can acquire wealth from or lose wealth to anybody else invariably leads to a complete polarization of the distribution of wealth vs. opportunity. This picture is however dramatically ameliorated when hard constraints are imposed over agents in the form of a limiting network of transactions. There, an out of equilibrium dynamics of the networks, based on a competition between power and frustration in the decision-making of agents, leads to network coevolution. The ratio of power and frustration controls different dynamical regimes separated by kinetic transitions and characterized by drastically different values of equality. It also leads, for proper values of social initiative, to the emergence of three self-organized social classes, lower, middle, and upper class. Their dynamics, which appears mostly controlled by the middle class, drives a cyclical regime of dramatic social changes.

97 MATHEMATICS AND COMPUTING↗

More Opportunities than Wealth. A Network of Power and Frustration

We introduce a minimal agent-based model to qualitatively conceptualize the allocation of limited wealth among more abundant opportunities. We study the interplay of power, satisfaction and frustration in the problem of wealth distribution, concentration, and inequality. This framework allows us to compare subjective measures of frustration and satisfaction to collective measures of fairness in wealth distribution, such as the Lorenz curve and the Gini index. We find that a completely libertarian, law-of-the-jungle setting, where every agent can acquire wealth from, or lose wealth to, anybody else invariably leads to a complete polarization of the distribution of wealth vs. opportunity, only minimally ameliorated by disorder in a non-optimized society. The picture is however dramatically modified when hard constraints are imposed over agents, and they are forced to share wealth with neighbors on a network. We discuss the case of random networks and scale free networks. We then propose an out of equilibrium dynamics of the networks, based on a competition of power and frustration in the decision-making of agents that leads to network evolution. We show that the ratio of power and frustration controls different dynamical regimes separated by kinetic transition and characterized by drastically different values of the indices of equality.

36 MATERIALS SCIENCE↗

The Quantum Alternating Operator Ansatz on Maximum k -Vertex Cover

The Quantum Alternating Operator Ansatz is a generalization of the Quantum Approximate Optimization Algorithm (QAOA) designed for finding approximate solutions to combinatorial optimization problems with hard constraints. In this paper, we study Maximum k-Vertex Cover under this ansatz due to its modest complexity, while still being more complex than the well studied problems of Max-Cut and Max E3-LIN2. Our approach includes (i) a performance comparison between easy-to-prepare classical states and Dicke states as starting states, (ii) a performance comparison between two XY -Hamiltonian mixing operators: the ring mixer and the complete graph mixer, (iii) an analysis of the distribution of solutions via Monte Carlo sampling, and (iv) the exploration of efficient angle selection strategies.

97 MATHEMATICS AND COMPUTING↗

Machine Learning for Turbulence

New Deep Learning architectures that embed physics as hard constraints with numerical methods, increasing accuracy and reducing computational cost.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Posterior Regularized Bayesian Neural Network

Traditional NNs often lack the ability for uncertainty quantification. Bayesian NNs(BNNs) could help measure the confidence level by using distributions in NNs modeling. Besides, knowledge is commonly available and could improve the performance of BNNs if it can be properly incorporated. In this work, we propose a novel Posterior-Regularized BNN(PR-BNN) model by incorporating soft and hard constraints as a posterior regularization term. We also propose an augmented Lagrangian method and stochastic optimization algorithm for efficient updating via Monte Carlo sampling. The simulations and case studies for solar PV plants have shown the performance improvement of the proposed model over traditional BNNs.

97 MATHEMATICS AND COMPUTING↗

Pareto-optimal multi-objective design of airplane control systems

A constrained minimization algorithm for the computer aided design of airplane control systems to meet many requirements over a set of flight conditions is generalized using the concept of Pareto-optimization. The new algorithm yields solutions on the boundary of the achievable domain in objective space in a single run, whereas the older method required a sequence of runs to approximate such a limiting solution. However, Pareto-optimality does not guarantee a satisfactory design, since such solutions may emphasize some objectives at the expense of others. The designer must still interact with the program to obtain a well-balanced set of objectives. Using the example of a fighter lateral stability augmentation system (SAS) design over five flight conditions, several effective techniques are developed for obtaining well-balanced Pareto-optimal solutions. For comparison, one of these techniques is also used in a recently developed algorithm of Kreisselmeier and Steinhauser, which replaces the hard constraints with soft constraints, using a special penalty function. It is shown that comparable results can be obtained.

Schy, A. A.↗

Primary differentiation in the early Earth: Nd and Sr isotopic evidence from diamondiferous eclogites for both old depleted and old enriched mantle, Yakutia, Siberia

Ancient, stable, continental cratons possess thick, subcontinental-lithospheric mantle 'keels' which favor particularly the emplacement of diamondiferous kimberlites and included peridotites and eclogites. These refractory mantle samples of the roots provide hard constraints on the theories of formation, growth, and evolution of these cratons. Xenoliths containing only primary garnet and clinopyroxene (eclogites), although rare in most kimberlites, can retain the geochemical signatures of their parent protoliths (e.g., subducted oceanic crust, ancient mantle) thus offering the opportunity to address mantle processes which may have taken place at earlier times in the Earth's history. In fact, it has been postulated that some eclogites are residues from the accretion of the early Earth. Nd and Sr isotopic data are presented which may be interpreted as evidence of an early (greater than 4 Ga) mantle differentiation event. The kimberlites of Yakutia are located both marginal and central to the Siberian craton, and a wide variety of xenoliths are present within them. The Siberian mantle samples have received little attention in the western world, largely because suitable suites of Yakutian samples have not been readily available. Importantly, there is evidence that metasomatism of the Siberian lithosphere has been considerably less intense or extensive than for the Kaapvaal craton. Therefore, it should be considerably easier to elicit the igneous/metamorphic histories of Siberian kimberlitic xenoliths. One of the notable features of the Siberian eclogites is the common appearance of diamonds, especially in the Mir and Udachnaya pipes. In all, eight eclogite samples (eight garnet separates and eight clinopyroxene separates) have been analyzed to date on the Udachnaya pipe, seven from our group.

Snyder, Gregory A.↗

Precision Manipulation with Cooperative Robots

This work addresses several challenges of cooperative transportThis work addresses several challenges of cooperative transport and precision manipulation. Precision manipulation requires a rigid grasp, which places a hard constraint on the relative rover formation that must be accommodated, even though the rovers cannot directly observe their relative poses. Additionally, rovers must jointly select appropriate actions based on all available sensor information. Lastly, rovers cannot act on independent sensor information, but must fuse information to move jointly; the methods for fusing information must be determined.

multi-robot teams↗

Optimization of Angular-Momentum Biases of Reaction Wheels

RBOT [RWA Bias Optimization Tool (wherein RWA signifies Reaction Wheel Assembly )] is a computer program designed for computing angular momentum biases for reaction wheels used for providing spacecraft pointing in various directions as required for scientific observations. RBOT is currently deployed to support the Cassini mission to prevent operation of reaction wheels at unsafely high speeds while minimizing time in undesirable low-speed range, where elasto-hydrodynamic lubrication films in bearings become ineffective, leading to premature bearing failure. The problem is formulated as a constrained optimization problem in which maximum wheel speed limit is a hard constraint and a cost functional that increases as speed decreases below a low-speed threshold. The optimization problem is solved using a parametric search routine known as the Nelder-Mead simplex algorithm. To increase computational efficiency for extended operation involving large quantity of data, the algorithm is designed to (1) use large time increments during intervals when spacecraft attitudes or rates of rotation are nearly stationary, (2) use sinusoidal-approximation sampling to model repeated long periods of Earth-point rolling maneuvers to reduce computational loads, and (3) utilize an efficient equation to obtain wheel-rate profiles as functions of initial wheel biases based on conservation of angular momentum (in an inertial frame) using pre-computed terms.

Lee, Clifford↗

Posterior Regularized Bayesian Neural Network

Traditional NNs often lack the ability for uncertainty quantification. Bayesian NNs(BNNs) could help measure the confidence level by using distributions in NNs modeling. Besides, knowledge is commonly available and could improve the performance of BNNs if it can be properly incorporated. In this work, we propose a novel Posterior-Regularized BNN(PR-BNN) model by incorporating soft and hard constraints as a posterior regularization term. We also propose an augmented Lagrangian method and stochastic optimization algorithm for efficient updating via Monte Carlo sampling. The simulations and case studies in solar energy prediction have shown the performance improvement of the proposed model over traditional BNNs.

14 SOLAR ENERGY↗

Strict Constraint Feasibility in Analysis and Design of Uncertain Systems

This paper proposes a methodology for the analysis and design optimization of models subject to parametric uncertainty, where hard inequality constraints are present. Hard constraints are those that must be satisfied for all parameter realizations prescribed by the uncertainty model. Emphasis is given to uncertainty models prescribed by norm-bounded perturbations from a nominal parameter value, i.e., hyper-spheres, and by sets of independently bounded uncertain variables, i.e., hyper-rectangles. These models make it possible to consider sets of parameters having comparable as well as dissimilar levels of uncertainty. Two alternative formulations for hyper-rectangular sets are proposed, one based on a transformation of variables and another based on an infinity norm approach. The suite of tools developed enable us to determine if the satisfaction of hard constraints is feasible by identifying critical combinations of uncertain parameters. Since this practice is performed without sampling or partitioning the parameter space, the resulting assessments of robustness are analytically verifiable. Strategies that enable the comparison of the robustness of competing design alternatives, the approximation of the robust design space, and the systematic search for designs with improved robustness characteristics are also proposed. Since the problem formulation is generic and the solution methods only require standard optimization algorithms for their implementation, the tools developed are applicable to a broad range of problems in several disciplines.

Crespo, Luis G.↗

Simulated Online Adaptive Magnetic Resonance–Guided Stereotactic Body Radiation Therapy for the Treatment of Oligometastatic Disease of the Abdomen and Central Thorax: Characterization of Potential Advantages

Purpose: To characterize potential advantages of online-adaptive magnetic resonance (MR)-guided stereotactic body radiation therapy (SBRT) to treat oligometastatic disease of the non-liver abdomen and central thorax. Methods and Materials: Ten patients treated with RT for unresectable primary or oligometastatic disease of the non-liver abdomen (n=5) or central thorax (n=5) underwent imaging throughout treatment on a clinical MR image guided RT system. The SBRT plans were created on the basis of tumor/organ at risk (OAR) anatomy at initial computed tomography simulation (P{sub I}), and simulated adaptive plans were created on the basis of observed MR image set tumor/OAR “anatomy of the day” (P{sub A}). Each P{sub A} was planned under workflow constraints to simulate online-adaptive RT. Prescribed dose was 50 Gy/5 fractions, with goal coverage of 95% planning target volume (PTV) by 95% of the prescription, subject to hard OAR constraints. The P{sub I} was applied to each MR dataset and compared with P{sub A} to evaluate changes in dose delivered to tumor/OARs, with dose escalation when possible. Results: Hard OAR constraints were met for all P{sub Is} based on anatomy from initial computed tomography simulation, and all P{sub As} based on anatomy from each daily MR image set. Application of the P{sub I} to anatomy of the day caused OAR constraint violation in 19 of 30 cases. Adaptive planning increased PTV coverage in 21 of 30 cases, including 14 cases in which hard OAR constraints were violated by the nonadaptive plan. For 9 P{sub A} cases, decreased PTV coverage was required to meet hard OAR constraints that would have been violated in a nonadaptive setting. Conclusions: Online-adaptive MRI-guided SBRT may allow PTV dose escalation and/or simultaneous OAR sparing compared with nonadaptive SBRT. A prospective clinical trial is underway at our institution to evaluate clinical outcomes of this technique.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

GW-PINN: A deep learning algorithm for solving groundwater flow equations

Machine learning methods provide new perspective for more convenient and efficient prediction of groundwater flow. In this study, a deep learning method “GW-PINN” without labeled data for solving groundwater flow equations with wells was proposed. GW-PINN takes the physics inform neural network (PINN) as the backbone and uses either the hard or soft constraint in the loss function for training. A locally refined sampling strategy (LRS) is adopted to generate the consistent spatial sampling points for problems with strong hydraulic head change, and then combined with an appropriate temporal sampling scheme to obtain the final spatial-temporal sampling points. A snowball-style two-stage training strategy by dividing the temporal domain into two subdomains is designed to decrease the sampling points. Five cases were designed to test the training performance of GW-PINN under different sampling strategies and two constraints. The predicted results of GW-PINN were compared with MODFLOW and the analytical solution. The results demonstrate that GW-PINN possesses strong ability in capturing the hydraulic head change for both confined and un-confined aquifers. The hard constraint owns more robust learning ability than the soft constraint. The LRS strategy can generate more accurate results with much fewer sampling points than traditional sampling strategies, and the snowball-style two-stage training strategy is significantly efficient for problems with the drastic change of hydraulic head. Additionally, the application of GW-PINN as a surrogate model for parameterized groundwater flow equations is illustrated. This study provides an option tool for efficient groundwater flow simulation, especially for those with local refinements are needed.

54 ENVIRONMENTAL SCIENCES↗

Empirical results on scheduling and dynamic backtracking

At the Honeywell Technology Center (HTC), we have been working on a scheduling problem related to commercial avionics. This application is large, complex, and hard to solve. To be a little more concrete: 'large' means almost 20,000 activities, 'complex' means several activity types, periodic behavior, and assorted types of temporal constraints, and 'hard to solve' means that we have been unable to eliminate backtracking through the use of search heuristics. At this point, we can generate solutions, where solutions exist, or report failure and sometimes why the system failed. To the best of our knowledge, this is among the largest and most complex scheduling problems to have been solved as a constraint satisfaction problem, at least that has appeared in the published literature. This abstract is a preliminary report on what we have done and how. In the next section, we present our approach to treating scheduling as a constraint satisfaction problem. The following sections present the application in more detail and describe how we solve scheduling problems in the application domain. The implemented system makes use of Ginsberg's Dynamic Backtracking algorithm, with some minor extensions to improve its utility for scheduling. We describe those extensions and the performance of the resulting system. The paper concludes with some general remarks, open questions and plans for future work.

Boddy, Mark S.↗

Analytic limits on the forms of spectra possible from optically thin collisional bremsstrahlung source models

The constraints on hard X-ray bremsstrahlung spectral forms required in order for them to correspond to physically acceptable (nonnegative) electron distributions in thin-target, thick-target, and thermal source models are discussed. The extent to which various spectra can be attributed to the different models is examined, showing that many possible spectra cannot be described by all, or in some cases, any of the models. It is shown that for any bremsstrahlung cross section, the thick-target and thermal models require that successively higher derivatives of the thin-target constraint have the appropriate sign. It is found that thermal models are the most restrictive, and that thin-target models are the least restrictive. Explicit analytic constraint expressions are derived for all three cases for the Kramers cross section and examples of acceptable and unacceptable spectra are given. Application of these criteria to the testing and exclusion of models is discussed.

Brown, John C.↗