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 703 records · Page 39

Application of Quantum Annealing to Nurse Scheduling Problem

Quantum annealing is a promising heuristic method to solve combinatorial optimization problems, and efforts to quantify performance on real-world problems provide insights into how this approach may be best used in practice. We investigate the empirical performance of quantum annealing to solve the Nurse Scheduling Problem (NSP) with hard constraints using the D-Wave 2000Q quantum annealing device. NSP seeks the optimal assignment for a set of nurses to shifts under an accompanying set of constraints on schedule and personnel. After reducing NSP to a novel Ising-type Hamiltonian, we evaluate the solution quality obtained from the D-Wave 2000Q against the constraint requirements as well as the diversity of solutions. For the test problems explored here, our results indicate that quantum annealing recovers satisfying solutions for NSP and suggests the heuristic method is potentially achievable for practical use. Moreover, we observe that solution quality can be greatly improved through the use of reverse annealing, in which it is possible to refine returned results by using the annealing process a second time. We compare the performance of NSP using both forward and reverse annealing methods and describe how this approach might be used in practice.

97 MATHEMATICS AND COMPUTING↗

Regularization by denoising diffusion models for solving inverse PDE problems with application to full waveform inversion

Partial differential equation (PDE)-governed inverse problems are fundamental across various scientific and engineering applications; yet they face significant challenges due to nonlinearity, ill-posedness, and sensitivity to noise. Here, we introduce a computational framework, regularization by denoising using diffusion models for partial differential equations (RED-DiffEq), by integrating physics-driven inversion and data-driven learning. RED-DiffEq leverages pretrained diffusion models as a regularization mechanism for PDE-governed inverse problems. We apply RED-DiffEq to solve the full waveform inversion problem in geophysics, a challenging seismic imaging technique that seeks to reconstruct high-resolution subsurface velocity models from seismic measurement data. Our method shows enhanced accuracy and robustness compared to benchmark methods. Additionally, it exhibits strong generalization and domain decomposition capacity, enabling the inversion of more complex velocity models with larger domains than those used in training the diffusion model. Our framework can also be directly applied to diverse PDE-governed inverse problems.

Shan, Siming [Yale University, New Haven, CT (Unit↗

Solving complex eigenvalue problems on a quantum annealer with applications to quantum scattering resonances

Quantum computing is a new and rapidly evolving paradigm for solving chemistry problems. In previous work, we developed the Quantum Annealer Eigensolver (QAE) and applied it to the calculation of the vibrational spectrum of a molecule on the D-Wave quantum annealer. However, the original QAE methodology was applicable to real symmetric matrices only. For many physics and chemistry problems, the diagonalization of complex matrices is required. For example, the calculation of quantum scattering resonances can be formulated as a complex eigenvalue problem where the real part of the eigenvalue is the resonance energy and the imaginary part is proportional to the resonance width. In the present work, we generalize the QAE to treat complex matrices: first complex Hermitian matrices and then complex symmetric matrices. These generalizations are then used to compute a quantum scattering resonance state in a 1D model potential for O + O collisions. These calculations are performed using both a software (classical) annealer and hardware annealer (the D-Wave 2000Q). The results of the complex QAE are also benchmarked against a standard linear algebra library (LAPACK). Furthermore, this work presents the first numerical solution of a complex eigenvalue problem of any kind on a quantum annealer, and it is the first treatment of a quantum scattering resonance on any quantum device.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

On one modification of traveling salesman problem oriented on application in atomic engineering

The mathematical model of a problem of minimization of a dose of an irradiation of the personnel which is carrying out dismantling of the completing block of a nuclear power plant is considered. Dismantling of elements of the block is carried out consistently. A brigade of workers having carried out dismantling of the next element of the block passes to similar work on other element of the block. Thus it is supposed that on the sequence of performance of works restrictions are imposed. These restrictions assume that on a number of pairs of works the condition is imposed: the second work cannot be executed before the first. This problem is similar to a known traveling salesman problem with the difference that expenses function depends on the list of outstanding works, and on sequence of performance of works and corresponding motions the constraints in the form of antecedence are imposed. The variant of the dynamic programming method is developed for such problem and the corresponding software is created.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Genetic Algorithm and Tabu Search for Vehicle Routing Problems with Stochastic Demand

This paper presents a problem of designing solid waste collection routes, involving scheduling of vehicles where each vehicle begins at the depot, visits customers and ends at the depot. It is modeled as a Vehicle Routing Problem with Stochastic Demands (VRPSD). A data set from a real world problem (a case) is used in this research. We developed Genetic Algorithm (GA) and Tabu Search (TS) procedure and these has produced the best possible result. The problem data are inspired by real case of VRPSD in waste collection. Results from the experiment show the advantages of the proposed algorithm that are its robustness and better solution qualities.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Two-dimensional lift-up problem for a rigid porous bed

The present study analytically reinvestigates the two-dimensional lift-up problem for a rigid porous bed that was studied by Mei, Yeung, and Liu [“Lifting of a large object from a porous seabed,” J. Fluid Mech. 152, 203 (1985)]. Mei, Yeung, and Liu proposed a model that treats the bed as a rigid porous medium and performed relevant experiments. In their model, they assumed the gap flow comes from the periphery of the gap, and there is a shear layer in the porous medium; the flow in the gap is described by adhesion approximation [D. J. Acheson, Elementary Fluid Dynamics (Clarendon, Oxford, 1990), pp. 243-245.] and the pore flow by Darcy’s law, and the slip-flow condition proposed by Beavers and Joseph [“Boundary conditions at a naturally permeable wall,” J. Fluid Mech. 30, 197 (1967)] is applied to the bed interface. In this problem, however, the gap flow initially mainly comes from the porous bed, and the shear layer may not exist. Although later the shear effect becomes important, the empirical slip-flow condition might not physically respond to the shear effect, and the existence of the vertical velocity affects the situation so greatly that the slip-flow condition might not be appropriate. In contrast, the present study proposes a more general model for the problem, applying Stokes flow to the gap, the Brinkman equation to the porous medium, and Song and Huang’s [“Laminar poroelastic media flow,” J. Eng. Mech. 126, 358 (2000)] complete interfacial conditions to the bed interface. The exact solution to the problem is found and fits Mei’s experiments well. The breakout phenomenon is examined for different soil beds, mechanics that cannot be illustrated by Mei’s model are revealed, and the theoretical breakout times obtained using Mei’s model and our model are compared. The results show that the proposed model is more compatible with physics and provides results that are more precise.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The inverse problem of sensing the mass and force induced by an adsorbate on a beam nanomechanical resonator

The mass sensing superiority of a micro/nanomechanical resonator sensor over conventional mass spectrometry has been, or at least, is being firmly established. Because the sensing mechanism of a mechanical resonator sensor is the shifts of resonant frequencies, how to link the shifts of resonant frequencies with the material properties of an analyte formulates an inverse problem. Besides the analyte/adsorbate mass, many other factors such as position and axial force can also cause the shifts of resonant frequencies. The in-situ measurement of the adsorbate position and axial force is extremely difficult if not impossible, especially when an adsorbate is as small as a molecule or an atom. Extra instruments are also required. In this study, an inverse problem of using three resonant frequencies to determine the mass, position and axial force is formulated and solved. The accuracy of the inverse problem solving method is demonstrated and how the method can be used in the real application of a nanomechanical resonator is also discussed. Solving the inverse problem is helpful to the development and application of mechanical resonator sensor on two things: reducing extra experimental equipments and achieving better mass sensing by considering more factors.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Inverse problem of polarimetry for media with orthogonal eigenpolarisations

We consider the problem of the ambiguity of the inverse problem of polarimetry for a homogeneous anisotropic medium characterised by orthogonal eigenpolarisations generated by non-commutativity of Jones and Mueller matrices of elementary types of anisotropy. The differences between two variants of the orthogonality conditions for the eigenpolarisations of an arbitrary anisotropic medium, the existence of which is due to this ambiguity, are investigated. The results obtained can be used to analyse the adequacy of the solution of the inverse problem of this class and in the problems of the synthesis of polarisation elements with given characteristics. (paper)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An algorithm for linearizing convex extremal problems

This paper suggests a method of approximating the solution of minimization problems for convex functions of several variables under convex constraints is suggested. The main idea of this approach is the approximation of a convex function by a piecewise linear function, which results in replacing the problem of convex programming by a linear programming problem. To carry out such an approximation, the epigraph of a convex function is approximated by the projection of a polytope of greater dimension. In the first part of the paper, the problem is considered for functions of one variable. In this case, an algorithm for approximating the epigraph of a convex function by a polygon is presented, it is shown that this algorithm is optimal with respect to the number of vertices of the polygon, and exact bounds for this number are obtained. After this, using an induction procedure, the algorithm is generalized to certain classes of functions of several variables. Applying the suggested method, polynomial algorithms for an approximate calculation of the L{sub p}-norm of a matrix and of the minimum of the entropy function on a polytope are obtained. Bibliography: 19 titles.

97 MATHEMATICS AND COMPUTING↗

A Multilevel in Space and Energy Solver for 3-D Multigroup Diffusion and Coarse-Mesh Finite Difference Eigenvalue Problems

The Multilevel in Space and Energy Diffusion (MSED) method accelerates the iterative convergence of multigroup diffusion eigenvalue problems by performing work on lower-order equations with only one group and/or coarser spatial grids. It consists of two primary components: (1) a grey (one-group) diffusion eigenvalue problem that is solved via Wielandt-shifted power iteration (PI) and (2) a multigrid-in-space linear solver. In previous work, the efficiency of MSED was verified using Fourier analysis and numerical results from a one-dimensional multigroup diffusion code. Since that work, MSED has been implemented as a solver for the coarse-mesh finite difference (CMFD) system in the three-dimensional Michigan Parallel Characteristics Transport (MPACT) code. In this paper, the results from the implementation of MSED in MPACT are introduced, and the changes needed to make MSED more suitable for MPACT are described. For problems without feedback, the conclusions in this paper show that MSED can reduce the CMFD run time by an order of magnitude and the overall run time by a factor of 2 to 3 compared to the default CMFD solver in MPACT [PI with the generalized minimal residual (GMRES) method]. For problems with feedback, the convergence of the outer Picard iteration scheme is worsened by the well-converged CMFD solutions produced by the standard MSED method. To overcome this unintuitive deficiency, MSED may be run with looser convergence criteria (a modified version of the MSED method called MSED-L) to circumvent the issue until the multiphysics iteration in MPACT is improved. Results show that MSED-L can reduce the CMFD run time in MPACT by an order of magnitude, without negatively impacting the outer Picard iteration scheme.

3-D↗

ON THE PERSISTENCE OF TWO SMALL-SCALE PROBLEMS IN ΛCDM

We investigate the degree to which the inclusion of baryonic physics can overcome two long-standing problems of the standard cosmological model on galaxy scales: (1) the problem of satellite planes around Local Group galaxies, and (2) the “too big to fail” problem. By comparing dissipational and dissipationless simulations, we find no indication that the addition of baryonic physics results in more flattened satellite distributions around Milky-Way-like systems. Recent claims to the contrary are shown to derive in part from a non-standard metric for the degree of flattening, which ignores the satellites’ radial positions. If the full 3D positions of the satellite galaxies are considered, none of the simulations we analyze reproduce the observed flattening nor the observed degree of kinematic coherence of the Milky Way satellite system. Our results are consistent with the expectation that baryonic physics should have little or no influence on the structure of satellite systems on scales of hundreds of kiloparsecs. Claims that the “too big to fail” problem can be resolved by the addition of baryonic physics are also shown to be problematic.

79 ASTRONOMY AND ASTROPHYSICS↗

A unified solution to the small scale problems of the ΛCDM model II: introducing parent-satellite interaction

We continue the study of the impact of baryon physics on the small scale problems of the ΛCDM model, based on a semi-analytical model (Del Popolo, 2009). With such model, we show how the cusp/core, missing satellite (MSP), Too Big to Fail (TBTF) problems and the angular momentum catastrophe can be reconciled with observations, adding parent-satellite interaction. Such interaction between dark matter (DM) and baryons through dynamical friction (DF) can sufficiently flatten the inner cusp of the density profiles to solve the cusp/core problem. Combining, in our model, a Zolotov et al. (2012)-like correction, similarly to Brooks et al. (2013), and effects of UV heating and tidal stripping, the number of massive, luminous satellites, as seen in the Via Lactea 2 (VL2) subhaloes, is in agreement with the numbers observed in the MW, thus resolving the MSP and TBTF problems. The model also produces a distribution of the angular spin parameter and angular momentum in agreement with observations of the dwarfs studied by van den Bosch, Burkert, and Swaters (2001)

79 ASTRONOMY AND ASTROPHYSICS↗

Implications of the non-observation of 6 Li in halo stars for the primordial 7 Li problem

The primordial Lithium Problem is intimately connected to the assumption that the 7 Li abundance observed in metal-poor halo stars is unchanged from its primordial value, which lies significantly below the predictions of standard big-bang nucleosynthesis. Two key lines of evidence have argued that these stars have not significantly depleted their initial (mostly primordial) 7 Li: i) the lack of dispersion in Li abundance measurements at low metallicity (and high surface temperature); and ii) the detection of the more fragile 6 Li isotope in at least two halo stars. The purported 6 Li detections were in good agreement with predictions from cosmic-ray nucleosynthesis which is responsible for the origin of 6 Li. This concordance left little room for 6 Li depletion, and the apparent 6 Li survival implied that 7 Li largely evaded destruction, because stellar interiors destroy 6 Li more vigorously then than 7 Li. Recent (re)-observations of halo stars challenge the evidence against 7 Li depletion: i) lithium elemental abundances now show significant dispersion, and ii) sensitive 6 Li searches now reveal only upper limits to the 6 Li/ 7 Li ratio. We discuss the consequences of these 6 Li non-detections on the primordial 7 Li Problem, Galactic cosmic-ray nucleosynthesis, and the question of differential depletion of Li in stars. The tight new 6 Li upper limits generally fall far below the predictions of cosmic-ray nucleosynthesis, implying that substantial 6 Li depletion has occurred — by factors up to 50. We show that in stars with 6 Li limits and thus lower bounds on 6 Li depletion, an equal amount of 7 Li depletion is more than sufficient to resolve the primordial 7 Li Problem. This picture is consistent with well-studied stellar models in which 7 Li is less depleted than 6 Li, and strengthen the case that the Lithium Problem has an astrophysical solution. We conclude by suggesting future observations that could test these ideas.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

THE SOLAR ABUNDANCE PROBLEM: THE EFFECT OF THE TURBULENT KINETIC FLUX ON THE SOLAR ENVELOPE MODEL

Recent three-dimensional (3D) simulations have shown that the turbulent kinetic flux (TKF) is significant. We discuss the effects of TKF on the size of the convection zone and find that the TKF may help solve the solar abundance problem. The solar abundance problem is that, with new abundances, the solar convection zone depth, the sound speed in the radiative interior, the helium abundance, and the density in the convective envelope are not in agreement with helioseismic inversions. We have performed Monte Carlo simulations on solar convective envelope models with different profiles of TKF to test its effects. The solar abundance problem is revealed in the standard solar convective envelope model with AGSS09 composition, which shows significant differences (∼10)) in density from the helioseismic inversions, but the differences in the model with the old composition GN93 is small (∼0.5)). In the testing models with a different TKF imposed, it is found that the density profile is sensitive to the value of TKF at the base of the convective envelope and insensitive to the structure of TKF in the convection zone. The required value of turbulent kinetic luminosity at the base is about –13% to – 19% L {sub ☉}. Comparing with the 3D simulations, this value is plausible. This study is for the solar convective envelope only. Evolutionary solar models with TKF are required to investigat the effects of TKF on the solar interior structure below the convection zone and the whole solar abundance problem, but the profile of the TKF in the overshoot region is necessary.

79 ASTRONOMY AND ASTROPHYSICS↗

Environmental Problems Associated With Decommissioning The Chernobyl Nuclear Power Plant Cooling Pond

Decommissioning of nuclear power plants and other nuclear fuel cycle facilities has been an imperative issue lately. There exist significant experience and generally accepted recommendations on remediation of lands with residual radioactive contamination; however, there are hardly any such recommendations on remediation of cooling ponds that, in most cases, are fairly large water reservoirs. The literature only describes remediation of minor reservoirs containing radioactive silt (a complete closure followed by preservation) or small water reservoirs resulting in reestablishing natural water flows. Problems associated with remediation of river reservoirs resulting in flooding of vast agricultural areas also have been described. In addition, the severity of environmental and economic problems related to the remedial activities is shown to exceed any potential benefits of these activities. One of the large, highly contaminated water reservoirs that require either remediation or closure is Karachay Lake near the MAYAK Production Association in the Chelyabinsk Region of Russia where liquid radioactive waste had been deep well injected for a long period of time. Backfilling of Karachay Lake is currently in progress. It should be noted that secondary environmental problems associated with its closure are considered to be of less importance since sustaining Karachay Lake would have presented a much higher radiological risk. Another well-known highly contaminated water reservoir is the Chernobyl Nuclear Power Plant (ChNPP) Cooling Pond, decommissioning of which is planned for the near future. This study summarizes the environmental problems associated with the ChNPP Cooling Pond decommissioning.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Classical optimization with imaginary-time block encoding on quantum computers: The MaxCut problem

Optimization problems in finance, physics, and computer science are typically very hard to tackle in classical computing; quantum computing could help speed up computations and provide efficient methods for tackling large problems. Typically, to treat a problem with a quantum computer, the optimal solution is cast as the ground state of a diagonal Hamiltonian. Here, we develop a method, called imaginary-time evolution block encoding (ITE-BE), based on a recent imaginary-time algorithm, which requires no variational parameter optimization, as all parameters can be derived analytically from the target Hamiltonian. We also demonstrate that our method can be successfully combined with other quantum algorithms such as the quantum approximate optimization algorithm (QAOA). For illustration, here we study the MaxCut problem. We find that the QAOA ansatz increases the postselection success of ITE-BE, and shallow QAOA circuits, when boosted with ITE-BE, achieve better performance than deeper QAOA circuits. For the special case of the transverse initial state, we adapt our block-encoding scheme to allow for a deterministic application of the first layer of the circuit.

Zhong, Dawei [University of Southern California, L↗

Topologically protected Grover's oracle for the partition problem

The number partitioning problem (NPP) is one of the NP-complete (nondeterministic polynomial-time complete) computational problems. Its definite exact solution generally requires a check of all $N$ solution candidates, which is exponentially large. Here we describe a path to the fast solution of this problem in $\sqrt{N}$ quasi-adiabatic quantum annealing steps. We argue that the errors due to the finite duration of the quantum annealing can be suppressed if the annealing time scales with $N$ only logarithmically. Moreover, our adiabatic oracle is topologically protected, in the sense that it is robust against small uncertainty and slow time dependence of the physical parameters or the choice of the annealing protocol. In conclusion, we also argue that our approach can solve many other famous NP-complete computational problems in $\sqrt{N}$ steps.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗