Search NASA⌕ Search

SEARCH · Search NASA

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

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↗

Chiral topologically ordered insulating phases in arrays of interacting integer quantum Hall islands

Here, we study networks of Coulomb-blockaded integer quantum Hall islands with even fillings ν = 2 k ( k being an integer), including cases with 2 k layers each of ν = 1 fillings. Allowing only spin-current interactions between the islands (i.e., without any charge transfer), we obtain solvable models leading to a rich set of insulating S U ( 2 ) k topologically ordered phases. The case with k = 1 is dual to the Kalmeyer-Laughlin phase, k = 2 to Kitaev's chiral spin liquid and the Moore-Read state, and k = 3 contains a Fibonacci anyon that may be utilized for universal topological quantum computation. Additionally, we show how the S U ( 2 ) k topological phases may be obtained also in an array of islands with ν = 2 k integer quantum Hall states and critical spin chains in a checkerboard pattern. The array and checkerboard constructions gap out the charge mode and additional “flavor” modes by virtue of their geometry. Furthermore, we find that a fine tuning of the system parameter is not needed in the checkerboard configuration and the ν = 2 case. We also discuss their bulk excitations, and show that their thermal Hall conductance is universal, reflecting the central charge c = 3 k / ( k + 2 ) of the chiral edge modes.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Half-Integer Conductance Plateau at the ν = 2 / 3 Fractional Quantum Hall State in a Quantum Point Contact

The v = 2/3 fractional quantum Hall state is the hole-conjugate state to the primary Laughlin v = 1/3 state. Here, we investigate transmission of edge states through quantum point contacts fabricated on a GaAs/AlGaAs heterostructure designed to have a sharp confining potential. When a small but finite bias is applied, we observe an intermediate conductance plateau with G = 0.5⁢(e 2 /ℎ). This plateau is observed in multiple QPCs, and persists over a significant range of magnetic field, gate voltage, and source-drain bias, making it a robust feature. Using a simple model that considers scattering and equilibration between counterflowing charged edge modes, we find this half-integer quantized plateau to be consistent with full reflection of an inner counterpropagating -1/3 edge mode while the outer integer mode is fully transmitted. In a QPC fabricated on a different heterostructure which has a softer confining potential, we instead observe an intermediate conductance plateau at G = (1/3)⁢(e 2 /ℎ). These results provide support for a model at v = 2/3 in which the edge transitions from a structure having an inner upstream -1/3 charge mode and outer downstream integer mode to a structure with two downstream 1/3 charge modes when the confining potential is tuned from sharp to soft and disorder prevails.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Chern Insulators at Integer and Fractional Filling in Moiré Pentalayer Graphene

The advent of moiré platforms for engineered quantum matter has led to discoveries of integer and fractional quantum anomalous Hall effects, with predictions for correlation-driven topological states based on electron crystallization. Here, we report an array of trivial and topological insulators formed in a moiré lattice of rhomobohedral pentalayer graphene (R5G). At a doping of one electron per moiré unit cell ( ν = 1 ), we see a correlated insulator with a Chern number that can be tuned between C = 0 and + 1 by an electric displacement field. This is accompanied by a series of additional Chern insulators with C = + 1 originating from fractional fillings of the moiré lattice— ν = 1 / 4 , 1 / 3 , and 2 / 3 —associated with the formation of moiré-driven topological electronic crystals. At ν = 2 / 3 the system exhibits an integer quantum anomalous Hall effect at zero magnetic field, but further develops hints of an incipient C = 2 / 3 fractional Chern insulator in a modest field. Our results establish moiré R5G as a fertile platform for studying the competition and potential intertwining of integer and fractional Chern insulators. Published by the American Physical Society 2025

Waters, Dacen (ORCID:0000000335880039)↗

Evaluating the Performance of Integer Sum Reduction in SYCL on GPUs

SYCL is a promising programming model for heterogeneous computing—allowing a single-source code to target devices from multiple vendors. One significant task performed on these accelerators is a primitive operation for integer sum reduction. This paper presents several SYCL implementations of integer sum reduction—using atomic functions, shared local memory, vectorized memory accesses and parameterized workload sizes—to compare the performance and maturity of SYCL against open-source vendor-specific implementations of the same reduction. For a sufficiently large number of integers, tuning the parameters of our SYCL implementations achieves 1.4X speedup over the open-source implementations on an Intel UHD630 integrated GPU. The SYCL reduction is 3% faster than the templated reduction in Thrust, and 0.3% faster than the device reduction in CUB on an Nvidia P100 GPU. The SYCL reduction is 1.9% faster than the templated reduction in Thrust, and 0.4% faster than the device reduction in CUB on an Nvidia V100 GPU.

Jin, Zheming↗

Parallel Solver Framework for Mixed-Integer PDE-Constrained Optimization

ROL-PEBBL is a C++, MPI-based parallel code for mixed-integer PDE-constrained optimization (MIPDECO). In these problems we wish to optimize (control, design, etc.) physical systems, which must obey the laws of physics, when some of the decision variables must take integer values. ROL-PEBBL combines a code to efficiently search over integer choices (PEBBL = Parallel Enumeration Branch-and-Bound Library) and a code for efficient nonlinear optimization, including PDE-constrained optimization (ROL = Rapid Optimization Library). In this report, we summarize the design of ROL-PEBBL and initial applications/results. For an artificial source-inversion problem, finding sources of pollution on a grid from sparse samples, ROL-PEBBLs solution for the nest grid gave the best optimization guarantee for any general solver that gives both a solution and a quality guarantee.

97 MATHEMATICS AND COMPUTING↗

Quadratic integer programming for large scale banded matrices

This paper is concerned with the integer quadratic program where the variables are constrained to belong to a given set of discrete values. This quadratic integer program is shown to be equivalent to a problem of finding the shortest path in a particular directed graph called a trellis when the matrix is a positive-definite symmetric banded matrix. An efficient procedure for solving this shortest path problem is presented which allows the solution of the integer quadratic program. This method is particularly effective when the half-bandwidth of the matrix is significantly smaller than its dimension.

Yan, T. Y.↗

A new VLSI complex integer multiplier which uses a quadratic-polynomial residue system with Fermat numbers

A quadratic-polynomial Fermat residue number system (QFNS) has been used to compute complex integer multiplications. The advantage of such a QFNS is that a complex integer multiplication requires only two integer multiplications. In this article, a new type Fermat number multiplier is developed which eliminates the initialization condition of the previous method. It is shown that the new complex multiplier can be implemented on a single VLSI chip. Such a chip is designed and fabricated in CMOS-pw technology.

Truong, T. K.↗

A new VLSI complex integer multiplier which uses a quadratic-polynomial residue system with Fermat numbers

A quadratic-polynomial Fermat residue number system (QFNS) has been used to compute complex integer multiplications. The advantage of such a QFNS is that a complex integer multiplication requires only two integer multiplications. In this article, a new type Fermat number multiplier is developed which eliminates the initialization condition of the previous method. It is shown that the new complex multiplier can be implemented on a single VLSI chip. Such a chip is designed and fabricated in CMOS-Pw technology.

Shyu, H. C.↗

Software For Integer Programming

Improved Exploratory Search Technique for Pure Integer Linear Programming Problems (IESIP) program optimizes objective function of variables subject to confining functions or constraints, using discrete optimization or integer programming. Enables rapid solution of problems up to 10 variables in size. Integer programming required for accuracy in modeling systems containing small number of components, distribution of goods, scheduling operations on machine tools, and scheduling production in general. Written in Borland's TURBO Pascal.

Fogle, F. R.↗

Integer cosine transform for image compression

This article describes a recently introduced transform algorithm called the integer cosine transform (ICT), which is used in transform-based data compression schemes. The ICT algorithm requires only integer operations on small integers and at the same time gives a rate-distortion performance comparable to that offered by the floating-point discrete cosine transform (DCT). The article addresses the issue of implementation complexity, which is of prime concern for source coding applications of interest in deep-space communications. Complexity reduction in the transform stage of the compression scheme is particularly relevant, since this stage accounts for most (typically over 80 percent) of the computational load.

Cheung, K.-M.↗

Foraging with MUSHROOMS: A Mixed-integer Linear Programming Scheduler for Multimessenger Target of Opportunity Searches with the Zwicky Transient Facility

Electromagnetic follow-up of gravitational-wave detections is very resource intensive, taking up hours of limited observation time on dozens of telescopes. Creating more efficient schedules for follow-up will lead to a commensurate increase in counterpart location efficiency without using more telescope time. Widely used in operations research and telescope scheduling, mixed-integer linear programming is a strong candidate to produce these higher-efficiency schedules, as it can make use of powerful commercial solvers that find globally optimal solutions to provided problems. We detail a new target-of-opportunity scheduling algorithm designed with Zwicky Transient Facility in mind that uses mixed-integer linear programming. We compare its performance to gwemopt, the tuned heuristic scheduler used by the Zwicky Transient Facility and other facilities during the third LIGO–Virgo gravitational-wave observing run. This new algorithm uses variable-length observing blocks to enforce cadence requirements and to ensure field observability, along with having a secondary optimization step to minimize slew time. We show that by employing a hybrid method utilizing both this scheduler and gwemopt, the previous scheduler used, in concert, we can achieve an average improvement in detection efficiency of 3%–11% over gwemopt alone for a simulated binary neutron star merger data set consistent with LIGO–Virgo's third observing run, highlighting the potential of mixed-integer target of opportunity schedulers for future multimessenger follow-up surveys.

B Parazin↗

PySP : modeling and solving stochastic mixed-integer programs in Python.

Although stochastic programming is a powerful tool for modeling decision-making under uncertainty, various impediments have historically prevented its widespread use. One key factor involves the ability of non-specialists to easily express stochastic programming problems as extensions of deterministic models, which are often formulated first. A second key factor relates to the difficulty of solving stochastic programming models, particularly the general mixed-integer, multi-stage case. Intricate, configurable, and parallel decomposition strategies are frequently required to achieve tractable run-times. We simultaneously address both of these factors in our PySP software package, which is part of the COIN-OR Coopr open-source Python project for optimization. To formulate a stochastic program in PySP, the user specifies both the deterministic base model and the scenario tree with associated uncertain parameters in the Pyomo open-source algebraic modeling language. Given these two models, PySP provides two paths for solution of the corresponding stochastic program. The first alternative involves writing the extensive form and invoking a standard deterministic (mixed-integer) solver. For more complex stochastic programs, we provide an implementation of Rockafellar and Wets Progressive Hedging algorithm. Our particular focus is on the use of Progressive Hedging as an effective heuristic for approximating general multi-stage, mixed-integer stochastic programs. By leveraging the combination of a high-level programming language (Python) and the embedding of the base deterministic model in that language (Pyomo), we are able to provide completely generic and highly configurable solver implementations. PySP has been used by a number of research groups, including our own, to rapidly prototype and solve difficult stochastic programming problems.

99 GENERAL AND MISCELLANEOUS↗