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 379 records · Page 21

Dynamic Flow Management Problems in Air Transportation

In 1995, over six hundred thousand licensed pilots flew nearly thirty-five million flights into over eighteen thousand U.S. airports, logging more than 519 billion passenger miles. Since demand for air travel has increased by more than 50% in the last decade while capacity has stagnated, congestion is a problem of undeniable practical significance. In this thesis, we will develop optimization techniques that reduce the impact of congestion on the national airspace. We start by determining the optimal release times for flights into the airspace and the optimal speed adjustment while airborne taking into account the capacitated airspace. This is called the Air Traffic Flow Management Problem (TFMP). We address the complexity, showing that it is NP-hard. We build an integer programming formulation that is quite strong as some of the proposed inequalities are facet defining for the convex hull of solutions. For practical problems, the solutions of the LP relaxation of the TFMP are very often integral. In essence, we reduce the problem to efficiently solving large scale linear programming problems. Thus, the computation times are reasonably small for large scale, practical problems involving thousands of flights. Next, we address the problem of determining how to reroute aircraft in the airspace system when faced with dynamically changing weather conditions. This is called the Air Traffic Flow Management Rerouting Problem (TFMRP) We present an integrated mathematical programming approach for the TFMRP, which utilizes several methodologies, in order to minimize delay costs. In order to address the high dimensionality, we present an aggregate model, in which we formulate the TFMRP as a multicommodity, integer, dynamic network flow problem with certain side constraints. Using Lagrangian relaxation, we generate aggregate flows that are decomposed into a collection of flight paths using a randomized rounding heuristic. This collection of paths is used in a packing integer programming formulation, the solution of which generates feasible and near-optimal routes for individual flights. The algorithm, termed the Lagrangian Generation Algorithm, is used to solve practical problems in the southwestern portion of United States in which the solutions are within 1% of the corresponding lower bounds.

Patterson, Sarah Stock↗

A gradient in the duration of the G1 phase in the murine neocortical proliferative epithelium

Neuronogenesis in the neocortical pseudostratified ventricular epithelium (PVE) is initiated rostrolaterally and progresses caudo-medially as development progresses. Here we have measured the cytokinetic parameters and the fractional neuronal output parameter, Q, of laterally located early-maturing regions over the principal embryonic days (E12-E15) of neocortical neuronogenesis in the mouse. These measures are compared with ones previously made of a medial, late-maturing portion of the PVE. Laterally, as medially, the duration of the neuronogenetic interval is 6 days and comprises 11 integer cell cycles. Also, in both lateral and medial areas the length of G1 phase (TG1) increases nearly 4-fold and is the only cell cycle parameter to change. Q progresses essentially identically laterally and medially with respect to the succession of integer cell cycles. Most importantly, from E12 to E13 there is a steeply declining lateral to medial gradient in TG1. The gradient is due both to the lateral to medial graded stage of neuronogenesis and to the stepwise increase in TG1 with each integer cycle during the neuronogenetic interval. To our knowledge this gradient in TG1 of the cerebral PVE is the first cell biological gradient to be demonstrated experimentally in such an extensive proliferative epithelial sheet. We suggest that this gradient in TG1 is the cellular mechanism for positionally encoding a protomap of the neocortex within the PVE.

Non-NASA Center↗

System using leo satellites for centimeter-level navigation

Disclosed herein is a system for rapidly resolving position with centimeter-level accuracy for a mobile or stationary receiver [4]. This is achieved by estimating a set of parameters that are related to the integer cycle ambiguities which arise in tracking the carrier phase of satellite downlinks [5,6]. In the preferred embodiment, the technique involves a navigation receiver [4] simultaneously tracking transmissions [6] from Low Earth Orbit Satellites (LEOS) [2] together with transmissions [5] from GPS navigation satellites [1]. The rapid change in the line-of-sight vectors from the receiver [4] to the LEO signal sources [2], due to the orbital motion of the LEOS, enables the resolution with integrity of the integer cycle ambiguities of the GPS signals [5] as well as parameters related to the integer cycle ambiguity on the LEOS signals [6]. These parameters, once identified, enable real-time centimeter-level positioning of the receiver [4]. In order to achieve high-precision position estimates without the use of specialized electronics such as atomic clocks, the technique accounts for instabilities in the crystal oscillators driving the satellite transmitters, as well as those in the reference [3] and user [4] receivers. In addition, the algorithm accommodates as well as to LEOS that receive signals from ground-based transmitters, then re-transmit frequency-converted signals to the ground.

Rabinowitz, Matthew↗

High-Performance Algorithm for Solving the Diagnosis Problem

An improved method of model-based diagnosis of a complex engineering system is embodied in an algorithm that involves considerably less computation than do prior such algorithms. This method and algorithm are based largely on developments reported in several NASA Tech Briefs articles: The Complexity of the Diagnosis Problem (NPO-30315), Vol. 26, No. 4 (April 2002), page 20; Fast Algorithms for Model-Based Diagnosis (NPO-30582), Vol. 29, No. 3 (March 2005), page 69; Two Methods of Efficient Solution of the Hitting-Set Problem (NPO-30584), Vol. 29, No. 3 (March 2005), page 73; and Efficient Model-Based Diagnosis Engine (NPO-40544), on the following page. Some background information from the cited articles is prerequisite to a meaningful summary of the innovative aspects of the present method and algorithm. In model-based diagnosis, the function of each component and the relationships among all the components of the engineering system to be diagnosed are represented as a logical system denoted the system description (SD). Hence, the expected normal behavior of the engineering system is the set of logical consequences of the SD. Faulty components lead to inconsistencies between the observed behaviors of the system and the SD. Diagnosis the task of finding faulty components is reduced to finding those components, the abnormalities of which could explain all the inconsistencies. The solution of the diagnosis problem should be a minimal diagnosis, which is a minimal set of faulty components. The calculation of a minimal diagnosis is inherently a hard problem, the solution of which requires amounts of computation time and memory that increase exponentially with the number of components of the engineering system. Among the developments to reduce the computational burden, as reported in the cited articles, is the mapping of the diagnosis problem onto the integer-programming (IP) problem. This mapping makes it possible to utilize a variety of algorithms developed previously for IP to solve the diagnosis problem. In the IP approach, the diagnosis problem can be formulated as a linear integer optimization problem, which can be solved by use of well-developed integer-programming algorithms. This concludes the background information.

Fijany, Amir↗

Next Generation Aircraft Design Considering Airline Operations and Economics

Traditional approaches to design and optimization of a new system often use a system-centric objective and do not take into consideration how the operator will use this new system alongside other existing systems. When the new system design is incorporated into the broader group of systems, the performance of the operator-level objective can be sub-optimal due to the unmodeled interaction between the new system and the other systems. Among the few available references that describe attempts to address this disconnect, most follow an MDO (Multidisciplinary Design Optimization)-motivated sequential decomposition approach of first designing a very good system and then providing this system to the operator who, decides the best way to use this new system along with the existing systems. This paper addresses this issue by including aircraft design, airline operations, and revenue management "subspaces"; and presents an approach that could simultaneously solve these subspaces posed as a monolithic optimization problem rather than the traditional approach described above. The monolithic approach makes the problem an expensive Mixed Integer Non-Linear Programming problem, which are extremely difficult to solve. To address the problem, we use a recently developed optimization framework that simultaneously solves the subspaces to capture the "synergy" in the problem that the previous decomposition approaches did not exploit, addresses mixed-integer/discrete type design variables in an efficient manner, and accounts for computationally expensive analysis tools. This approach solves an 11-route airline network problem consisting of 94 decision variables including 33 integer and 61 continuous type variables. Simultaneously solving the subspaces leads to significant improvement in the fleet-level objective of the airline when compared to the previously developed sequential subspace decomposition approach.

Roy, Satadru↗

Overlap zoned electrically heated particulate filter

A system includes a particulate matter (PM) filter that includes an upstream end for receiving exhaust gas and a downstream end. A zoned heater is arranged spaced from the upstream end and comprises N zones, where N is an integer greater than one, wherein each of the N zones comprises M sub-zones, where M is an integer greater than or equal to one, and wherein the N zones and the M sub-zones are arranged in P layers, where P is an integer greater than one. A control module selectively activates at least a selected one of the N zones to initiate regeneration in downstream portions of the PM filter from the one of the N zones and deactivates non-selected ones of the N zones.

47 OTHER INSTRUMENTATION↗

Multi-input and binary reproducible, high bandwidth floating point adder in a collective network

To add floating point numbers in a parallel computing system, a collective logic device receives the floating point numbers from computing nodes. The collective logic devices converts the floating point numbers to integer numbers. The collective logic device adds the integer numbers and generating a summation of the integer numbers. The collective logic device converts the summation to a floating point number. The collective logic device performs the receiving, the converting the floating point numbers, the adding, the generating and the converting the summation in one pass. One pass indicates that the computing nodes send inputs only once to the collective logic device and receive outputs only once from the collective logic device.

97 MATHEMATICS AND COMPUTING↗

Multi-input and binary reproducible, high bandwidth floating point adder in a collective network

To add floating point numbers in a parallel computing system, a collective logic device receives the floating point numbers from computing nodes. The collective logic devices converts the floating point numbers to integer numbers. The collective logic device adds the integer numbers and generating a summation of the integer numbers. The collective logic device converts the summation to a floating point number. The collective logic device performs the receiving, the converting the floating point numbers, the adding, the generating and the converting the summation in one pass. One pass indicates that the computing nodes send inputs only once to the collective logic device and receive outputs only once from the collective logic device.

97 MATHEMATICS AND COMPUTING↗

Cross-linked polymeric membranes for carbon dioxide separation

A membrane useful in gas separation, the membrane comprising a cross-linked polysiloxane structure having a cross-link density of about 0.1.times.10.sup.-5 mol/cm.sup.3 to about 6.times.10.sup.-5 mol/cm.sup.3, where, in particular embodiments, the cross-linked polysiloxane structure has the following general structure: ##STR00001## wherein R.sup.1, R.sup.2, R.sup.3, R.sup.4, R.sup.5, and R.sup.6 are independently selected from hydrocarbon groups having at least 1 and up to 6 carbon atoms; A.sup.1 and A.sup.2 are independently selected from cyclic hydrocarbon groups; L.sup.1 and L.sup.2 are linking groups or covalent bonds; n is an integer of at least 1; r and s are independently selected from integers of at least 1; and p is an integer of at least 10. The invention also includes methods for making and using the above-described membranes for gas separation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

MCNP6 Gets Correlated with CGM 3.4 - Paper 41

Version 3.4 of the Cascading Gamma-ray Multiplicity (CGM) code has been integrated into version 6 of the Monte Carlo radiation transport code MCNP. The current release is MCNP6 which is the merger of MCNPX 2.7.0 and MCNP5. MCNP6 is a general purpose Monte Carlo radiation transport code that can transport 34 different particles and heavy ions. CGM was originally integrated into MCNPX 2.7.0 as an undocumented feature, but was never released to the public. With the integration of CGM into MCNP6 the code now has the capability of producing correlated secondary particle/gamma emissions and should be available in future release of MCNP. Before the integration of CGM, MCNP only used libraries that contain the total multiplicity but not the multiplicity distribution or the correlations. Lacking this information requires the code to use integer sampling to determine the multiplicity. In the example of thermal neutron capture on Cl-35, presented in the results section, MCNP does integer sampling. This means MCNP would produce one gamma 17% of the time and two gammas 82% giving a mean multiplicity of 1.83. Using CGM, MCNP can now produce a spectrum of multiplicities. The use of CGM has several advantages over the use of ACE data libraries in MCNP6: 1) it has correlated gamma production, 2) it produces a distribution of gamma multiplicities per interaction, whereas ACE produces an average between two integer multiplicities, 3) it is a theoretical model that may predict experimentally unmeasured physical quantities that may not be in experimental based data libraries. CGM conserves energy and angular momentum internally to CGM; however, angular emission information is not currently sent back to MCNP6. Future work will include the integration of correlated neutrons from CGM. Also, the reaction type will be passed to CGM to set the spin and parity for a particular reaction when possible. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗

Poisson Log-Normal Process for Count Data Prediction

Modeling count data is important in physics and other scientific disciplines, where measurements often involve discrete, non-negative quantities such as photon or neutrino detection events. Traditional parametric approaches can be trained to generate integer-count predictions but may struggle with capturing complex, non-linear dependencies often observed in the data. Gaussian process (GP) regression provides a robust non-parametric alternative to modeling continuous data; however, it cannot generate integer outputs. We propose the Poisson Log-Normal (PoLoN) process, a framework that employs GP to model Poisson log-rates. As in GP regression, our approach relies on the correlations between data points captured via GP kernel structure rather than explicit functional parameterizations. We demonstrate that the PoLoN predictive distribution is Poisson-LogNormal and provide an algorithm for optimizing kernel hyperparameters. Furthermore, we adapt the PoLoN approach to the problem of detecting weak localized signals superimposed on a smoothly varying background - a task of considerable interest in many areas of science and engineering. Our framework allows us to predict the strength, location and width of the detected signals. We evaluate PoLoN's performance using both synthetic and real-world datasets, including the open dataset from CERN which was used to detect the Higgs boson at the Large Hadron Collider. Our results indicate that the PoLoN process can be used as a non-parametric alternative for analyzing, predicting, and extracting signals from integer-valued data.

Saha, Anushka [Rutgers U., Piscataway]↗

Flexible dynamic boundary microgrid operation considering network and load unbalances

Flexible microgrids with dynamic boundaries have recently been introduced in the literature. With the ability to reconfigure the topology of the microgrids dynamically through remotely controlled switches, flexible microgrids with dynamic boundaries can further improve the resiliency and energy efficiency of microgrids with distributed energy resources (DERs). This paper focuses on the optimal operation considering one of the predominant characteristics of microgrids and distribution systems – unbalanced networks and loads. In existing literature, balanced modeling of microgrids is more common due to its attractive simplicity. The three-phase power unbalance has not been considered as a constraint on the generation units in a microgrid. Further, negative sequence constraints have also been neglected. In this article, we propose a set of constraints that is specifically related to the capabilities of inverter interfaced resources to supply unbalanced current/power when the microgrid is islanded from the main distribution grid. We incorporate the new set of constraints into two optimization formulations leveraging two convex relaxations of the three-phase power flow equations: mixed-integer linear programming (MILP) and mixed-integer semidefinite programming (MISDP) that optimize the dispatch of controllable switches and DERs in the microgrid. The algorithms are then extended to networked microgrids with grid-forming sources. We test the algorithms on a realistic community microgrid model in Puerto Rico as well as standardized IEEE distribution test feeders. The testing results demonstrate the performance of the proposed algorithms. The MILP is fast and scalable, and the MISDP enforces the negative sequence voltage constraints.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Evaluation of Horizon of Viability Optimization Engine for Sustained Power to Critical Infrastructure: Preprint

In the aftermath of increasingly frequent catastrophic events, a typical scenario is Critical Infrastructure (CI) units being supported by available backup sources with a weak power grid that can be intermittent or absent. Such a scenario is significantly challenging in the sense of reliable supply of power to CI units. In this article, an intelligent optimization scheme termed as Horizon of Viability (HoV) engine is developed to guarantee the viability of a sustained reliable supply of power to the CI units over a time-horizon. The proposed HoV engine generates a cost-optimal portfolio of the locally available generation sources and the loads over a time horizon using a mixed-integer convex programming problem. A Controller hardware-in-the-loop (CHIL) platform is developed to evaluate the control performance of the HoV engine. The experimental results corroborates the efficacy in maintaining the viability of the CI units after a grid interruption event. Further, the proposed HoV optimization scheme performs better compared to existing net-load management schemes in the literature.

disaster resiliency↗

Robust Distribution Network Reconfiguration

We propose a two-stage robust optimization model for the distribution network reconfiguration problem with load uncertainty. The first-stage decision is to configure the radial distribution network and the second-stage decision is to find the optimal a/c power flow of the reconfigured network for given demand realization. We solve the two-stage robust model by using a column-and-constraint generation algorithm, where the master problem and subproblem are formulated as mixed-integer second-order cone programs. Computational results for 16, 33, 70, and 94-bus test cases are reported. We find that the configuration from the robust model does not compromise much the power loss under the nominal load scenario compared to the configuration from the deterministic model, yet it provides the reliability of the distribution system for all scenarios in the uncertainty set.

distribution network↗

Incorporating Wind Energy in Power System Restoration Planning

Wind energy is rapidly growing. While wind brings us clean and inexpensive energy, its inherent variability and uncertainty present challenges for the power grid. In particular, employing wind energy for power system restoration is very challenging. A fast and reliable restoration plays a vital role to achieve the self-healing power grid. This paper develops a novel offline restoration planning tool for harnessing wind energy to enhance grid resilience. The Wind-for-Restoration problem is formulated as a stochastic mixed-integer linear programming problem with generated wind energy scenarios. The problem is then decomposed into two stages and solved with the integer Lshaped algorithm. Numerical experiments have been conducted through different case studies using the modified IEEE 57-bus system. The developed tool can provide the scheduled wind power at each restoration time. The impact of wind energy is investigated from the aspects of location and inertia capability, as well as wind penetration, fluctuation, and uncertainty. Moreover, a dynamic response validation tool is developed to validate the results of optimization problem in a dynamic simulation software. Finally, simulation results demonstrate that the optimal wind harnessing strategy can help improve system restoration process and enhance system resilience.

17 WIND ENERGY↗

Modular supply chain optimization considering demand uncertainty to manage risk

Supply chain under demand uncertainty has been a challenging problem due to increased competition and market volatility in modern markets. Flexibility in planning decisions makes modular manufacturing a promising way to address this problem. We report the problem of multiperiod process and supply chain network design is considered under demand uncertainty. A mixed integer two-stage stochastic programming problem is formulated with integer variables indicating the process design and continuous variables to represent the material flow in the supply chain. The problem is solved using a rolling horizon approach. Benders decomposition is used to reduce the computational complexity of the optimization problem. To promote risk-averse decisions, a downside risk measure is incorporated in the model. The results demonstrate the several advantages of modular designs in meeting product demands. A pareto-optimal curve for minimizing the objectives of expected cost and downside risk is obtained.

42 ENGINEERING↗

Optimal design and dispatch of a system of diesel generators, photovoltaics and batteries for remote locations

Renewable energy technologies, specifically, solar photovoltaic cells, combined with battery storage and diesel generators, form a hybrid system capable of independently powering remote locations, i.e., those isolated from larger grids. If sized correctly, hybrid systems reduce fuel consumption compared to diesel generator-only alternatives. We present an optimization model for establishing a hybrid power design and dispatch strategy for remote locations, such as a military forward operating base, that models the acquisition of different power technologies as integer variables and their operation using nonlinear expressions. Our cost-minimizing, nonconvex, mixed-integer, nonlinear program contains a detailed battery model. Due to its complexities, we present linearizations, which include exact and convex under-estimation techniques, and a heuristic, which determines an initial feasible solution to serve as a “warm start” for the solver. We determine, in a few hours at most, solutions within 5% of optimality for a candidate set of technologies; these solutions closely resemble those from the nonlinear model. Lastly, our instances contain real data spanning a yearly horizon at hour fidelity and demonstrate that a hybrid system could reduce fuel consumption by as much as 50% compared to a generator-only solution.

14 SOLAR ENERGY↗

Optimizing design and dispatch of a renewable energy system with combined heat and power

We embellish a mixed-integer program that prescribes a set of renewable energy, conventional generation, and storage technologies to procure, along with a corresponding dispatch strategy. Specifically, we add combined heat and power to this set. The model minimizes fixed and operational costs less incentives for the use of various technologies, subject to a series of component interoperability and system-wide constraints. The resulting mixed-integer linear program contains hundreds of thousands of variables and constraints. We demonstrate how to efficiently formulate and solve the corresponding instances such that we produce near-optimal solutions in minutes. A previous rendition of the model required hours of solution time for the same instances.

24 POWER TRANSMISSION AND DISTRIBUTION↗