Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “problem”

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,801 records · Page 100

Biexciton Condensation in Electron-Hole-Doped Hubbard Bilayers: A Sign-Problem-Free Quantum Monte Carlo Study

The bilayer Hubbard model with electron-hole doping is an ideal platform to study excitonic orders due to suppressed recombination via spatial separation of electrons and holes. However, suffering from the sign problem, previous quantum Monte Carlo studies could not arrive at an unequivocal conclusion regarding the presence of phases with clear signatures of excitonic condensation in bilayer Hubbard models. Here, we develop a determinant quantum Monte Carlo algorithm for the bilayer Hubbard model that is sign-problem-free for equal and opposite doping in the two layers and study excitonic order and charge and spin density modulations as a function of chemical potential difference between the two layers, on-site Coulomb repulsion, and interlayer interaction. In the intermediate coupling regime and in proximity to the SU(4)-symmetric point, we find a biexcitonic condensate phase at finite electron-hole doping, as well as a competing (π, π) charge density wave state. In this study, we extract the Berezinskii-Kosterlitz-Thouless transition temperature from superfluid density and a finite-size scaling analysis of the correlation functions and explain our results in terms of an effective biexcitonic hard-core boson model.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Sign Problem in Tensor-Network Contraction

We investigate how the computational difficulty of contracting tensor networks depends on the sign structure of the tensor entries. Using results from computational complexity, we observe that the approximate contraction of tensor networks with only positive entries has lower computational complexity as compared to tensor networks with general real or complex entries. This raises the question of how this transition in computational complexity manifests itself in the hardness of different tensor-network-contraction schemes. We pursue this question by studying random tensor networks with varying bias toward positive entries. First, we consider contraction via Monte Carlo sampling and find that the transition from hard to easy occurs when the tensor entries become predominantly positive; this can be understood as a tensor-network manifestation of the well-known negative-sign problem in quantum Monte Carlo. Second, we analyze the commonly used contraction based on boundary tensor networks. The performance of this scheme is governed by the number of correlations in contiguous parts of the tensor network (which by analogy can be thought of as entanglement). Remarkably, we find that the transition from hard to easy—i.e., from a volume-law to a boundary-law scaling of entanglement—already occurs for a slight bias of the tensor entries toward a positive mean, scaling inversely with the bond dimension D , and thus the problem becomes easy the earlier the larger D occurs. This is in contrast both to expectations and to the behavior found in Monte Carlo contraction, where the hardness at fixed bias increases with the bond dimension. To provide insight into this early breakdown of computational hardness and the accompanying entanglement transition, we construct an effective classical statistical-mechanical model that predicts a transition at a bias of the tensor entries of 1 / D , confirming our observations. We conclude by investigating the computational difficulty of computing expectation values of tensor-network wave functions (projected entangled-pair states, PEPSs) and find that in this setting, the complexity of entanglement-based contraction always remains low. We explain this by providing a local transformation that maps PEPS expectation values to a positive-valued tensor network. This not only provides insight into the origin of the observed boundary-law entanglement scaling but also suggests new approaches toward PEPS contraction based on positive decompositions. Published by the American Physical Society 2025

Chen, Jielun (ORCID:0000000178411545)↗

Complex paths around the sign problem

The Monte Carlo evaluation of path integrals is one of a few general purpose methods to approach strongly coupled systems. It is used in all branches of physics, from QCD and nuclear physics to the correlated electron systems. However, many systems of great importance (dense matter inside neutron stars, the repulsive Hubbard model away from half filling, and dynamical and nonequilibrium observables) are not amenable to the Monte Carlo method as it currently stands due to the so-called sign problem. Here, a new set of ideas recently developed to tackle the sign problem based on the complexification of field space and the Picard-Lefshetz theory accompanying it is reviewed. The mathematical ideas underpinning this approach, as well as the algorithms developed thus far, are described together with nontrivial examples where the method has already been proved successful. Directions of future work, including the burgeoning use of machine learning techniques, are delineated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Leveraging differentiable programming in the inverse problem of neutron stars

Neutron stars (NSs) probe the high-density regime of the nuclear equation of state (EOS). However, inferring the EOS from observations of NSs is a computationally challenging task. Here, in this work, we efficiently solve this inverse problem by leveraging differential programming in two ways. First, we enable full Bayesian inference in under one hour of wall time on a GPU by using gradient-based samplers, without requiring pretrained machine learning emulators. Moreover, we demonstrate efficient scaling to high-dimensional parameter spaces. Second, we introduce a novel gradient-based optimization scheme that recovers the EOS of a given NS mass-radius curve. We demonstrate how our framework can reveal consistencies or tensions between nuclear physics and astrophysics. First, we show how the breakdown density of a metamodel description of the EOS can be determined from NS observations. Second, we demonstrate how degeneracies in EOS modeling using nuclear empirical parameters can influence the inverse problem during gradient-based optimization. Looking ahead, our approach opens up new theoretical studies of the relation between NS properties and the EOS, while effectively tackling the data analysis challenges brought by future detectors.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Machine Learning-Assisted Distribution System Network Reconfiguration Problem

High penetration from volatile renewable energy resources in the grid and the varying nature of loads raise the need for frequent line switching to ensure the efficient operation of electrical distribution networks. Operators must ensure maximum load delivery, reduced losses, and the operation between voltage limits. However, computations to decide the optimal feeder configuration are often computationally expensive and intractable, making it unfavorable for real-time operations. This is mainly due to the existence of binary variables in the network reconfiguration optimization problem. To tackle this issue, we have devised an approach that leverages machine learning techniques to reshape distribution networks featuring multiple substations. This involves predicting the substation responsible for serving each part of the network. Hence, it leaves simple and more tractable Optimal Power Flow problems to be solved. This method can produce accurate results in a significantly faster time, as demonstrated using the IEEE 37-bus distribution feeder. Compared to the traditional optimization-based approaches, a feasible solution is achieved approximately ten times faster for all the tested scenarios.

deep neural networks↗

A Hybrid Approach for Solving Optimization Problems on Small Quantum Computers

Solving larger-sized problems is an important area of research in quantum computing. Designing hybrid quantum-classical algorithms is a promising approach to solving this. We discuss decomposition-based hybrid approaches for solving optimization problems and demonstrate them for applications related to community detection.

97 MATHEMATICS AND COMPUTING↗

The Other Artificial Intelligence Hardware Problem

The consolidation of leading-edge semiconductor manufacturing in one company in one country poses two problems: a short-term strategic risk and a long-term innovation risk. Furthermore, both problems remain underexplored because advances in artificial intelligence (AI) algorithms have compensated for a relative lack of advances in AI hardware.

97 MATHEMATICS AND COMPUTING↗

Developing Frequency Stability Constraint for Unit Commitment Problem Considering High Penetration of Renewables

As zero-carbon electricity systems become the trend of future grid, the system inertia provided by conventional synchronous generators (SGs) keeps decreasing. The resultant lower system inertia will inevitably cause frequency stability problem, especially in the first few seconds following disturbance. To tackle this challenge, this paper proposes a frequency stability constraint for power systems unit commitment problem by considering the fast frequency responses (FFRs) from inverter-based resources (IBRs). Our developed frequency stability constraint is grounded on an analytical frequency nadir estimation framework that considers both SG and IBR dynamics. The accuracy of our frequency nadir estimation framework is validated by most severe N-1 contingency simulation result in a real island system. Then, the adaptive inertia frequency stability constraint is derived by performing sensitivity analysis with our frequency nadir estimation framework. Finally, we demonstrate the effectiveness of our developed frequency stability constraint with one year day-ahead unit commitment results of the island system.

fast frequency response↗

Decentralized Schemes with Overlap for Solving Graph-Structured Optimization Problems

We present a new algorithmic paradigm for the decentralized solution of graph-structured optimization problems that arise in the estimation and control of network systems. A key and novel design concept of the proposed approach is that it uses overlapping subdomains to promote and accelerate convergence. We show that the algorithm converges if the size of the overlap is sufficiently large and that the convergence rate improves exponentially with the size of the overlap. The proposed approach provides a bridge between fully decentralized and centralized architectures and is flexible in that it enables the implementation of asynchronous schemes, handling of constraints, and balancing of computing, communication, and data privacy needs. The proposed scheme is tested in an estimation problem for a 9241-node power network and we show that it outperforms the alternating direction method of multipliers.

asynchronous↗

Identifying and Characterizing Non-Convexities in the Feasible Spaces of Optimal Power Flow Problems

Optimal power flow (OPF) is an important problem in the operation of electric power systems. The solution to an OPF problem provides a minimum cost operating point that satisfies constraints imposed by both the non-linear power flow equations and engineering limits. These constraints can yield non-convex feasible spaces that result in significant computational challenges. This brief proposes an algorithm that identifies and characterizes non-convexities in OPF feasible spaces. This algorithm searches for a pair of feasible points whose connecting line segment contains an infeasible point. Such points certify the existence of a non-convexity in the OPF feasible space. Moreover, the constraint violations at the infeasible point along the connecting line segment physically characterize a cause of the non-convexity. Numerical demonstrations include a small illustrative example as well as applications to various test cases.

Molzahn, Daniel K.↗

Wireless Sensor Networks - Node Localization for Various Industry Problems

Fast, effective monitoring following airborne releases of toxic substances is critical to mitigate risks to threatened population areas. Wireless sensor nodes at fixed predetermined locations may monitor such airborne releases and provide early warnings to the public. A challenging algorithmic problem is determining the locations to place these sensor nodes while meeting several criteria: 1) provide complete coverage of the domain, and 2) create a topology with problem dependent node densities, while 3) minimizing the number of sensor nodes. This manuscript presents a novel approach to determining optimal sensor placement, Advancing Front mEsh generation with Constrained dElaunay Triangulation and Smoothing (AFECETS) that addresses these criteria. A unique aspect of AFECETS is the ability to determine wireless sensor node locations for areas of high interest (hospitals, schools, high population density areas) that require higher density of nodes for monitoring environmental conditions, a feature that is difficult to find in other research work. The AFECETS algorithm was tested on several arbitrary shaped domains. AFECETS simulation results show that the algorithm 1) provides significant reduction in the number of nodes, in some cases over 40%, compared to an advancing front mesh generation algorithm, 2) maintains and improves optimal spacing between nodes, and 3) produces simulation run times suitable for real-time applications.

42 ENGINEERING↗

Tightening McCormick Relaxations Toward Global Solution of the ACOPF Problem

Here, we show that a strong upper bound on the objective of the alternating current optimal power flow (ACOPF) problem can significantly improve the effectiveness of optimization-based bounds tightening (OBBT) on a number of relaxations. We additionally compare the performance of relaxations of the ACOPF problem, including the rectangular form without reference bus constraints, the rectangular form with reference bus constraints, and the polar form. We find that relaxations of the rectangular form significantly strengthen existing relaxations if reference bus constraints are included. Overall, relaxations of the polar form perform the best. However, neither the rectangular nor the polar form dominates the other. Ultimately, with these strategies, we are able to reduce the optimality gap to less than 0.1% on all but 5 NESTA test cases with up to 300 buses by performing OBBT alone.

24 POWER TRANSMISSION AND DISTRIBUTION↗

An Improved Genetic Algorithm approach to the Unit Commitment/Economic Dispatch problem

The deployment of new technologies, the importance of accurately modeling the dynamics of the generating units and the introduction of new policies are making the solution of the Unit Commitment/Economic Dispatch problem more and more complicated.In the present scenario, traditionally followed scheduling criteria might not lead to the optimal fleet configuration any more. In addition, most of the widely used techniques have limited capabilities at modeling the nonlinear dynamics of committed power plants. When realistic power systems comprising of several tens of generating units are modeled, the resulting optimization problem turns to be computationally intensive for the current computing capabilities. In this paper, an improved version of a GA-based optimization algorithm is presented. A detailed methodology aimed at obtaining a more efficient version of the GA, and a more detailed and accurate description of the flexible operation flexibility of the power plants is described.

genetic algorithm↗

Convergence Analysis of Fixed Point Chance Constrained Optimal Power Flow Problems

For optimal power flow problems with chance constraints, a particularly effective method is based on a fixed point iteration applied to a sequence of deterministic power flow problems. However, a priori, the convergence of such an approach is not necessarily guaranteed. Here this article analyses the convergence conditions for this fixed point approach, and reports numerical experiments including for large IEEE networks.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Pre-test CFD Calculations for a Bypass Flow Standard Problem

The bypass flow in a prismatic high temperature gas-cooled reactor (HTGR) is the flow that occurs between adjacent graphite blocks. Gaps exist between blocks due to variances in their manufacture and installation and because of the expansion and shrinkage of the blocks from heating and irradiation. Although the temperature of fuel compacts and graphite is sensitive to the presence of bypass flow, there is great uncertainty in the level and effects of the bypass flow. The Next Generation Nuclear Plant (NGNP) program at the Idaho National Laboratory has undertaken to produce experimental data of isothermal bypass flow between three adjacent graphite blocks. These data are intended to provide validation for computational fluid dynamic (CFD) analyses of the bypass flow. Such validation data sets are called Standard Problems in the nuclear safety analysis field. Details of the experimental apparatus as well as several pre-test calculations of the bypass flow are provided. Pre-test calculations are useful in examining the nature of the flow and to see if there are any problems associated with the flow and its measurement. The apparatus is designed to be able to provide three different gap widths in the vertical direction (the direction of the normal coolant flow) and two gap widths in the horizontal direction. It is expected that the vertical bypass flow will range from laminar to transitional to turbulent flow for the different gap widths that will be available.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

A general analytical solution to the geometrical problem of field matching in radiotherapy

Purpose: Several authors studied the problem of geometrical matching of fields produced by medical linear accelerators. However, a general solution has yet to be published. Currently available solutions are based on parallelism arguments. This study provides a general solution, considering not only parallelism but also field sizes. Methods: A fixed field with arbitrary field size, gantry, collimator, and couch angle is considered, and another field with a fixed gantry angle is matched to it. A single reference system attached to the treatment couch is used, and two approaches are followed. In the first approach, fixed field sizes are assumed and parallelism of the adjacent field-side planes is imposed. In the second approach, fixed isocenter positions are considered and both parallelism and coincidence between field-side planes are required. Results: When fixed field sizes are assumed, rotation angles are obtained; however, the isocenters may need to be shifted to make side planes coincident and therefore achieve a proper match. When fixed isocenter positions are considered, solutions for all parameters, including the field size, are obtained and an exact geometrical match is achieved. Conclusions: General expressions to the field-matching problem are found for the two approaches followed, fixed field sizes, and fixed isocenter positions. These results can be applied to any treatment technique and can easily be implemented in modern treatment planning systems.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

SU-E-J-108: Solving the Chinese Postman Problem for Effective Contour Deformation

Purpose: To develop a practical approach for accurate contour deformation when deformable image registration (DIR) is used for atlas-based segmentation or contour propagation in image-guided radiotherapy. Methods: A contour deformation approach was developed on the basis of 3D mesh operations. The 2D contours represented by a series of points in each slice were first converted to a 3D triangular mesh, which was deformed by the deformation vectors resulting from DIR. A set of parallel 2D planes then cut through the deformed 3D mesh, generating unordered points and line segments, which should be reorganized into a set of 2D contour points. It was realized that the reorganization problem was equivalent to solving the Chinese Postman Problem (CPP) by traversing a graph built from the unordered points with the least cost. Alternatively, deformation could be applied to a binary mask converted from the original contours. The deformed binary mask was then converted back into contours at the CT slice locations. We performed a qualitative comparison to validate the mesh-based approach against the image-based approach. Results: The DIR could considerably change the 3D mesh, making complicated 2D contour representations after deformation. CPP was able to effectively reorganize the points in 2D planes no matter how complicated the 2D contours were. The mesh-based approach did not require a post-processing of the contour, thus accurately showing the actual deformation in DIR. The mesh-based approach could keep some fine details and resulted in smoother contours than the image-based approach did, especially for the lung structure. Image-based approach appeared to over-process contours and suffered from image resolution limits. The mesh-based approach was integrated into in-house DIR software for use in routine clinic and research. Conclusion: We developed a practical approach for accurate contour deformation. The efficiency of this approach was demonstrated in both clinic and research applications. This work was partially supported by Cancer Prevention & Research Institute of Texas (CPRIT) RP110562.

60 APPLIED LIFE SCIENCES↗

SU-F-T-104: Determining the NTCP Parameters of Pharyngeal Constrictors and Proximal Esophagus for Radiation Induced Swallowing Problems Recorded Six Months After Radiation Therapy for Head and Neck Tumors

Purpose: To estimate the radiobiological parameters of four NTCP models that describe the dose-response relations of pharyngeal constrictors and proximal esophagus regarding the severity of patient reported swallowing problems 6 months post chemo-radiotherapy. To identify the section/structure that best correlates with the manifestation of the clinical endpoints. Finally, to compare the goodness-of-fit of those models. Methods: Forty-three patients were treated on a prospective multi-institutional phase II study for oropharyngeal squamous cell carcinoma. All the patients received 60 Gy IMRT and they reported symptoms using the novel patient reported outcome version of the CTCAE. We derived the individual patient dosimetric data of superior, medium and inferior sections of pharyngeal constrictors (SPC, MPC and IPC), superior and inferior sections of esophagus (SES and IES) as separate structures as well as combinations. The Lyman-Kutcher-Burman (LKB), Relative Seriality (RS), Logit and Relative Logit (RL) NTCP models were used to fit the patient data. The fitting of the different models was assessed through the area under the receiver operating characteristic curve (AUC) and the Odds Ratio methods. Results: The AUC values were highest for the SPC for Grade ≥ 2 (0.719 for the RS and RL models, and 0.716 for LKB and Logit). For Grade ≥ 1, the respective values were 0.699 for RS, LKB and Logit and 0.676 for RL. For MPC the AUC values varied between 0.463–0.477, for IPC between 0.396–0.458, for SES between 0.556–0.613 and for IES between 0.410–0.519. The Odds Ratio for the SPC was 15.6 (1.7–146.4) for RS, LKB and Logit for NTCP of 55%. Conclusion: All the examined NTCP models could fit the clinical data with similar accuracy. The SPC appear to correlate best with the clinical endpoints of swallowing problems. A prospective study could establish the use of NTCP values of SPC as a constraint in treatment planning.

60 APPLIED LIFE SCIENCES↗

Refine your search to explore more results.