Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “integer”

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 37 records · Page 2

Multistage distributionally robust mixed-integer programming with decision-dependent moment-based ambiguity sets

We study multistage distributionally robust mixed-integer programs under endogenous uncertainty, where the probability distribution of stage-wise uncertainty depends on the decisions made in previous stages. We first consider two ambiguity sets defined by decision-dependent bounds on the first and second moments of uncertain parameters and by mean and covariance matrix that exactly match decision-dependent empirical ones, respectively. For both sets, we show that the subproblem in each stage can be recast as a mixed-integer linear program (MILP). Moreover, we extend the general moment-based ambiguity set in to the multistage decision-dependent setting, and derive mixed-integer semidefinite programming (MISDP) reformulations of stage-wise subproblems. We develop methods for attaining lower and upper bounds of the optimal objective value of the multistage MISDPs, and approximate them using a series of MILPs. We deploy the Stochastic Dual Dynamic integer Programming (SDDiP) method for solving the problem under the three ambiguity sets with risk-neutral or risk-averse objective functions, and conduct numerical studies on multistage facility-location instances having diverse sizes under different parameter and uncertainty settings. Furthermore, our results show that the SDDiP quickly finds optimal solutions for moderate-sized instances under the first two ambiguity sets, and also finds good approximate bounds for the multistage MISDPs derived under the third ambiguity set. We also demonstrate the efficacy of incorporating decision-dependent distributional ambiguity in multistage decision-making processes.

97 MATHEMATICS AND COMPUTING↗

Half‐Integer Topological Charge Polarization of Quasi‐Dirac Bound States in the Continuum

Abstract The non‐trivial polarization topology of bound states in the continuum (BICs) provides new strategies in nanophotonics. The polarization topology depends on the geometric parameters and energy‐momentum dispersion of the system and can be engineered to add specific functionalities for light molding. Herein, such a possibility is investigated by studying the topology of the polarization states associated with the optical field radiated by BICs when Dirac‐cone‐degeneracy is lifted. The opening of a pseudogap in the Dirac cone dispersion of square‐lattice dielectric photonic crystal slabs is achieved by tuning the slab thickness. First, the emergence of half‐integer topological charges without the requirement of BIC annihilation is theoretically shown, which instead occurs when in‐plane inversion symmetry is broken. Then, using spin‐to‐orbital angular momentum conversion, the theory of half‐integer topological charges mediated by BICs is demonstrated and experimentally proved. The same device is able to give rise to vortices with different orbital angular momentum depending on the way it is illuminated, thus improving the potential of optical multiplexing. In addition, the additive character of the topology‐induced phase‐vortex generation is finally demonstrated for both integer and half‐integer charges using also vortex states as input beams, which is of relevance for information delivery.

36 MATERIALS SCIENCE↗

Density Dependence of the Phases of the v = 1 Integer Quantum Hall Plateau in Low Disorder Electron Gases

Recent magnetotransport measurements in low-disorder electron systems confined to GaAs/AlGaAs samples reveal that the v = 1 integer quantum Hall plateau is broken into three distinct regions. These three regions are associated with two phases with different types of bulk localization: the Anderson insulator is due to random quasiparticle localization, and the integer quantum Hall Wigner solid is due to pinning of a stiff quasiparticle lattice. Universal properties of the v = 1 plateau are highlighted: the structure of the stability diagram, the nonmonotonic dependence of the activation energy on the filling factor, and the alignment of features of the activation energy with features of the stability regions of the different phases are found to be similar in three samples spanning a wide range of electron densities. Quantitative differences between the samples are also discussed, such as the dependence of the onset temperature and the activation energy of the integer quantum Hall Wigner solid on the electron density. The findings provide insights into the localization behavior along the v = 1 integer quantum Hall plateau in the low disorder regime.

Anderson insulator↗

Breakdown of the $v=1$ integer quantum Hall effect in the single particle and collective localization regimes

We report large signal current–voltage characteristics measurements near the $v=1$ integer quantum Hall plateau in a high mobility GaAs/AlGaAs sample that exhibits both single particle and collective localization. According to prior results, the central part of the $v=1$ plateau corresponds to single particle localization and hence an Anderson insulator. In contrast, the two regions in the flanks of this Anderson insulator were associated with collective localization and were identified with the integer quantum Hall Wigner solid. We find that, at low temperatures and under large bias currents, both the Anderson insulator and integer quantum Hall Wigner solid have a sharp onset of conduction above a threshold. Furthermore, this threshold shows an approximately monotonic dependence on the filling factor across the boundary between the two localized phases. Finally, to our surprise, we find that these large signal characteristics do not clearly distinguish between the Anderson insulator and the integer quantum Hall Wigner solid.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Modeling without categorical variables : a mixed-integer nonlinear program for the optimization of thermal insulation systems.

Optimal design applications are often modeled by using categorical variables to express discrete design decisions, such as material types. A disadvantage of using categorical variables is the lack of continuous relaxations, which precludes the use of modern integer programming techniques. We show how to express categorical variables with standard integer modeling techniques, and we illustrate this approach on a load-bearing thermal insulation system. The system consists of a number of insulators of different materials and intercepts that minimize the heat flow from a hot surface to a cold surface. Our new model allows us to employ black-box modeling languages and solvers and illustrates the interplay between integer and nonlinear modeling techniques. We present numerical experience that illustrates the advantage of the standard integer model.

97 MATHEMATICS AND COMPUTING↗

Integer ratios of S{sub n}/E{sub n} in {sup 40}Ca+n resonances suggesting two-oscillator excitations in the target nucleus

In s-wave neutron resonances of {sup 40}Ca at E{sub n}{<=}2.5 MeV, S{sub n}/E{sub n} for many levels is found to be of the form 17(n/m) where n, m are small integers. Statistical tests show small probabilities for the observed dispositions of many levels at E{sub n}=(j/k)(1/70)G (j, k; small integers). To meet the requirement of time periodicity of the compound nucleus at resonance, a breathing model is developed, where the excitation energies E{sub x} are written as a sum of inverse integers; E{sub x}=S{sub n}+E{sub n}=G{sigma}(1/k) (k: integer). In {sup 40}Ca+n, the separation energy S{sub n}=8362 keV is written as S{sub n}=(17/70)G=(1/7+1/10)G, where G=34.4 MeV. G is almost equal to the Fermi energy of the nucleus. It is suggested that two oscillators of energy (1/7)G and (1/10)G are excited in {sup 40}Ca by neutron incidence, in which the recurrence energy (1/70)G is resonant with neutrons of energies at (j/k)(1/70)G, forming a simple compound nucleus.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Disjunctive linear separation conditions and mixed-integer formulations for aircraft conflict resolution

In this paper, we address the aircraft conflict resolution problem in air traffic control. We introduce new mixed-integer programming formulations for aircraft conflict resolution with speed, heading and altitude control which are based on disjunctive linear separation conditions. We first examine the two-dimensional aircraft conflict resolution problem with speed and heading control represented as continuous decision variables. We show that the proposed disjunctive linear separation conditions are equivalent to the classical nonlinear conditions for aircraft separation. Further, we characterise conflict-free trajectories based on aircraft velocity bounds and propose a simple pre-processing algorithm to identify aircraft pairs which are either always conflict-free, or which cannot be separated using speed and heading control only. We then incorporate altitude control and propose a lexicographic optimisation formulation that aims to minimise the number of flight level changes before resolving outstanding conflicts via two-dimensional velocity control. The proposed mixed-integer programming formulations are nonconvex, and we propose convex relaxations, decomposition methods and constraint generation algorithms to solve the two-dimensional and lexicographic optimisation formulations to guaranteed optimality. Numerical experiments on four types of conflict resolution benchmarking instances are conducted to test the performance of the proposed mixed-integer formulations. Further, the proposed method is compared against two benchmarks based on state-of-the-art approaches for the aircraft conflict resolution problem. Our numerical results show that the proposed method largely outperforms both benchmarks in terms of runtime and is able to solve significantly more instances to global optimality.

97 MATHEMATICS AND COMPUTING↗

Multidimensional sum-up rounding for integer programming in optimal experimental design

Here we present a numerical method for approximating the solution of convex integer programs stemming from optimal experimental design. The statistical setup consists of a Bayesian framework for linear inverse problems for which the direct relationship is described by a discretized integral equation. Specifically, we aim to find the optimal sensor placement from a set of candidate locations where data are collected with measurement error. The convex objective function is a measure of the uncertainty, described here by the trace or log-determinant of the posterior covariance matrix, for the discretized linear inverse problem solution. The resulting convex integer program is relaxed, producing a lower bound. An upper bound is obtained by extending the sum-up rounding approach to multiple dimensions. For this extension, we analyze its accuracy as a function of the discretization mesh size for a rectangular domain. We show asymptotic optimality of the integer solution defining the upper bound for different experimental design criteria (A- and D-optimal), by proving the convergence to zero of the gap between the upper and lower bounds as the mesh size goes to zero. The technique is illustrated on a two-dimensional gravity surveying problem for both A-optimal and D-optimal sensor placement where our designs yield better results compared with a thresholding rounding approach.

97 MATHEMATICS AND COMPUTING↗

Domain Decomposition for Integer Optimal Control with Total Variation Regularization

Total variation integer optimal control problems admit solutions and necessary optimality conditions via geometric variational analysis. In spite of the existence of said solutions, algorithms which solve the discretized objective suffer from high numerical cost associated with the combinatorial nature of integer programming. Hence, such methods are often limited to small and medium-sized problems. We propose a globally convergent, coordinate descent–inspired algorithm that allows tractable subproblem solutions restricted to a partition of the domain. Our decomposition method solves relatively small trust-region subproblems that modify the control variable on a subdomain only. Given nontrivial subdomain overlap, we prove that a global first-order necessary optimality condition is equivalent to a first-order necessary optimality condition per subdomain. We additionally show that a sufficient decrease is achieved on a single subdomain by way of a trust-region subproblem solver using geometric measure–theoretic arguments, which we integrate with a greedy patch selection to prove convergence of our algorithm. In conclusion, we demonstrate the practicality of our algorithm on a benchmark large-scale, PDE-constrained integer optimal control problem and find that our method is faster than the state of the art.

domain decomposition↗

Orbital Conflict: Cutting Planes for Symmetric Integer Programs

Cutting planes have been an important factor in the impressive progress made by integer programming (IP) solvers in the past two decades. However, cutting planes have had little impact on improving performance for symmetric IPs. Rather, the main breakthroughs for solving symmetric IPs have been achieved by cleverly exploiting symmetry in the enumeration phase of branch and bound. In this work, we introduce a hierarchy of cutting planes that arise from a reinterpretation of symmetry-exploiting branching methods. There are too many inequalities in the hierarchy to be used efficiently in a direct manner. However, the lowest levels of this cutting-plane hierarchy can be implicitly exploited by enhancing the conflict graph of the integer programming instance and by generating inequalities such as clique cuts valid for the stable set relaxation of the instance. We provide computational evidence that the resulting symmetry-powered clique cuts can improve state-of-the-art symmetry-exploiting methods. Furthermore, the inequalities are then employed in a two-phase approach with high-throughput computations to solve heretofore unsolved symmetric integer programs arising from covering designs, establishing for the first time the covering radii of two binary-ternary codes.

97 MATHEMATICS AND COMPUTING↗

An n -material thresholding method for improving integerness of solutions in topology optimization

It is common in solving topology optimization problems to replace an integer-valued characteristic function design field with the material volume fraction field, a real-valued approximation of the design field that permits "fictitious" mixtures of materials during intermediate iterations in the optimization process. This is reasonable so long as one can interpolate properties for such materials and so long as the final design is integer valued. For this purpose, we present a method for smoothly thresholding the volume fractions of an arbitrary number of material phases which specify the design. This method is trivial for two-material design problems, for example, the canonical topology design problem of specifying the presence or absence of a single material within a domain, but it becomes more complex when three or more materials are used, as often occurs in material design problems. We take advantage of the similarity in properties between the volume fractions and the barycentric coordinates on a simplex to derive a thresholding, method which is applicable to an arbitrary number of materials. As we show in a sensitivity analysis, this method has smooth derivatives, allowing it to be used in gradient-based optimization algorithms. Finally, we present results, which show synergistic effects when used with Solid Isotropic Material with Penalty and Rational Approximation of Material Properties material interpolation functions, popular methods of ensuring integerness of solutions.

42 ENGINEERING↗

Polyhedral approximation in mixed-integer convex optimization

Generalizing both mixed-integer linear optimization and convex optimization, mixed-integer convex optimization possesses broad modeling power but has seen relatively few advances in general-purpose solvers in recent years. Here, we intend to provide a broadly accessible introduction to our recent work in developing algorithms and software for this problem class. Our approach is based on constructing polyhedral outer approximations of the convex constraints, resulting in a global solution by solving a finite number of mixed-integer linear and continuous convex subproblems. The key advance we present is to strengthen the polyhedral approximations by constructing them in a higher-dimensional space. In order to automate this extended formulation we rely on the algebraic modeling technique of disciplined convex programming (DCP), and for generality and ease of implementation we use conic representations of the convex constraints. Although our framework requires a manual translation of existing models into DCP form, after performing this transformation on the MINLPLIB2 benchmark library we were able to solve a number of unsolved instances and on many other instances achieve superior performance compared with state-of-the-art solvers like Bonmin, SCIP, and Artelys Knitro.

97 MATHEMATICS AND COMPUTING↗

Application of the p-Adic Topology on ℤ to the Problem of Finding Solutions in Integers of an Implicit Linear Difference Equation

We study solutions in integers of an implicit linear inhomogeneous first order difference equation bx{sub n+1} = ax{sub n} + f{sub n}. Based on the p-adic topology on the ring of integers, we obtain a criterion for the existence of solutions and show that for a = 1 a typical (in the natural topological sense) equation has no integer solutions.

97 MATHEMATICS AND COMPUTING↗

Half-integer level shift of vortex bound states in an iron-based superconductor

Vortices in topological superconductors host Majorana zero modes (MZMs), which are proposed to be building blocks of fault-tolerant topological quantum computers. Recently, a new single-material platform for realizing MZM has been discovered in iron-based superconductors, without involving hybrid semiconductor-superconductor structures. Here we report on a detailed scanning tunneling spectroscopy study of a FeTe 0.55 Se 0.45 single crystal, revealing two distinct classes of vortices present in this system which differ by a half-integer level shift in the energy spectra of the vortex bound states. This level shift is directly tied with the presence or absence of zero-bias peak and also alters the ratios of higher energy levels from integer to half-odd-integer. Our model calculations fully reproduce the spectra of these two types of vortex bound states, suggesting the presence of topological and conventional superconducting regions that coexist within the same crystal. Our findings provide strong evidence for the topological nature of superconductivity in FeTe 0.55 Se 0.45 and establish it as an excellent platform for further studies on MZMs.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Emergence of competing electronic states from non-integer nuclear charges

Understanding many-electron phenomena with competing near-degenerate electronic states is of fundamental importance to chemistry and condensed matter physics. One of the most significant challenges for exploring such many-electron phenomena is the necessity for large system sizes in order to realize competing states, far beyond those practical for first-principles methods. Here, we show how allowing non-integer nuclear charges expands the space of computationally tractable electron systems that host competing electronic states. The emergence of competing electronic states from non-integer nuclear charges is exemplified in the simple 2-electron H 2 molecule and used to examine the microscopic structure of doped quasi-1D cuprate chains, showing how non-integer nuclear charges can open a window for first-principles calculations of difficult many-electron phenomena.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Discontinuity of the exchange-correlation potential and the functional derivative of the noninteracting kinetic energy as the number of electrons crosses integer boundaries in Li, Be, and B

Accurate densities were determined from configuration interaction wave functions for atoms and ions of Li, Be, and B with up to four electrons. Exchange-correlation potentials, V{sub xc}(r), and functional derivatives of the noninteracting kinetic energy, δK[ρ]/δρ(r), obtained from these densities were used to examine their discontinuities as the number of electrons N increases across integer boundaries for N = 1, N = 2, and N = 3. These numerical results are consistent with conclusions that the discontinuities are characterized by a jump in the chemical potential while the shape of V{sub xc}(r) varies continuously as an integer boundary is crossed. The discontinuity of the V{sub xc}(r) is positive, depends on the ionization potential, electron affinity, and orbital energy differences, and the discontinuity in δK[ρ]/δρ(r) depends on the difference between the energies of the highest occupied and lowest unoccupied orbitals. The noninteracting kinetic energy and the exchange correlation energy have been computed for integer and noninteger values of N between 1 and 4.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Population transfer HMQC for half-integer quadrupolar nuclei

This work presents a detailed analysis of a recently proposed nuclear magnetic resonance method [Wang et al., Chem. Commun. 49(59), 6653-6655 (2013)] for accelerating heteronuclear coherence transfers involving half-integer spin quadrupolar nuclei by manipulating their satellite transitions. This method, called Population Transfer Heteronuclear Multiple Quantum Correlation (PT-HMQC), is investigated in details by combining theoretical analyses, numerical simulations, and experimental investigations. We find that compared to instant inversion or instant saturation, continuous saturation is the most practical strategy to accelerate coherence transfers on half-integer quadrupolar nuclei. We further demonstrate that this strategy is efficient to enhance the sensitivity of J-mediated heteronuclear correlation experiments between two half-integer quadrupolar isotopes (e.g., {sup 27}Al-{sup 17}O). In this case, the build-up is strongly affected by relaxation for small T{sub 2}′ and J coupling values, and shortening the mixing time makes a huge signal enhancement. Moreover, this concept of population transfer can also be applied to dipolar-mediated HMQC experiments. Indeed, on the AlPO{sub 4}-14 sample, one still observes experimentally a 2-fold shortening of the optimum mixing time albeit with no significant signal gain in the {sup 31}P-({sup 27}Al) experiments.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Sequential computation of elementary modes and minimal cut sets in genome-scale metabolic networks using alternate integer linear programming

Elementary (flux) modes (EMs) have served as a valuable tool for investigating structural and functional properties of metabolic networks. Identification of the full set of EMs in genome-scale networks remains challenging due to combinatorial explosion of EMs in complex networks. It is often, however, that only a small subset of relevant EMs needs to be known, for which optimization-based sequential computation is a useful alternative. Most of the currently available methods along this line are based on the iterative use of mixed integer linear programming (MILP), the effectiveness of which significantly deteriorates as the number of iterations builds up. To alleviate the computational burden associated with the MILP implementation, we here present a novel optimization algorithm termed alternate integer linear programming (AILP). Results: Our algorithm was designed to iteratively solve a pair of integer programming (IP) and linear programming (LP) to compute EMs in a sequential manner. In each step, the IP identifies a minimal subset of reactions, the deletion of which disables all previously identified EMs. Thus, a subsequent LP solution subject to this reaction deletion constraint becomes a distinct EM. In cases where no feasible LP solution is available, IP-derived reaction deletion sets represent minimal cut sets (MCSs). Despite the additional computation of MCSs, AILP achieved significant time reduction in computing EMs by orders of magnitude. The proposed AILP algorithm not only offers a computational advantage in the EM analysis of genome-scale networks, but also improves the understanding of the linkage between EMs and MCSs.

59 BASIC BIOLOGICAL SCIENCES↗