Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “mathematical optimization”

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 793 records · Page 44

Spherical fitting for oscilloscope film trace reading

This report describes a spherical fitting algorithm that can be used for estimating the oscilloscope film trace coordinates. This algorithm was adopted from a least square algebraic spherical fitting algorithm developed by the author earlier for photovoltaic velocimetry applications. Preliminary assessment suggests that the algorithm may be used for optimizing the coordinates manually digitized by the user, or may be used as an uncertainty estimator for the user’s film reading uncertainties.

97 MATHEMATICS AND COMPUTING↗

A duality framework for stochastic optimal control of complex systems

In this study, we address the problem of minimizing the long-run expected average cost of a complex system consisting of interactive subsystems. We formulate a multiobjective optimization problem of the one-stage expected costs of the subsystems and provide a duality framework to prove that the control policy yielding the Pareto optimal solution minimizes the average cost criterion of the system. We provide the conditions of existence and a geometric interpretation of the solution. For practical situations having constraints consistent with those studied here, our results imply that the Pareto control policy may be of value when we seek to derive online the optimal control policy in complex systems.

97 MATHEMATICS AND COMPUTING↗

Modeling of nitrogen fixation and polymer production in the heterotrophic diazotroph Azotobacter vinelandii DJ

Nitrogen fixation is an important metabolic process carried out by microorganisms, which converts molecular nitrogen into inorganic nitrogenous compounds such as ammonia (NH 3 ). These nitrogenous compounds are crucial for biogeochemical cycles and for the synthesis of essential biomolecules, i.e. nucleic acids, amino acids and proteins. Azotobacter vinelandii is a bacterial non-photosynthetic model organism to study aerobic nitrogen fixation (diazotrophy) and hydrogen production. Moreover, the diazotroph can produce biopolymers like alginate and polyhydroxybutyrate (PHB) that have important industrial applications. However, many metabolic processes such as partitioning of carbon and nitrogen metabolism in A. vinelandii remain unknown to date. Genome-scale metabolic models (M-models) represent reliable tools to unravel and optimize metabolic functions at genome-scale. M-models are mathematical representations that contain information about genes, reactions, metabolites and their associations. M-models can simulate optimal reaction fluxes under a wide variety of conditions using experimentally determined constraints. Here we report on the development of a M-model of the wild type bacterium A. vinelandii DJ (iDT1278) which consists of 2,003 metabolites, 2,469 reactions, and 1,278 genes. We validated the model using high-throughput phenotypic and physiological data, testing 180 carbon sources and 95 nitrogen sources. iDT1278 was able to achieve an accuracy of 89% and 91% for growth with carbon sources and nitrogen source, respectively. This comprehensive M-model will help to comprehend metabolic processes associated with nitrogen fixation, ammonium assimilation, and production of organic nitrogen in an environmentally important microorganism.

59 BASIC BIOLOGICAL SCIENCES↗

Randomized selection on the GPU

We implement here a fast and memory-sparing probabilistic top N selection algorithm on the GPU. To our knowledge, this is the first direct selection in the literature for the GPU. The algorithm proceeds via a probabilistic-guess-and-chcck process searching for the Nth element. It always gives a correct result and always terminates. The use of randomization reduces the amount of data that needs heavy processing, and so reduces the average time required for the algorithm. Probabilistic Las Vegas algorithms of this kind are a form of stochastic optimization and can be well suited to more general parallel processors with limited amounts of fast memory.

97 MATHEMATICS AND COMPUTING↗

Composite laminate optimization program suitable for microcomputers

The design of a composite panel requires some way of finding the minimum thickness laminate which will withstand the load requirements without failure. The mathematical complexity of this problem dictates the use of nonlinear optimization techniques. Specialized laminate optimization programs were developed which are compact and efficient enough to run on microcomputers. Only stresses at a point and inplane loads and deflections are considered. The programs are simple to use and require no knowledge of optimization. Techniques are developed which find minimum thickness laminates with either ply ratios or ply angles as design variables. A method is presented for finding the optimum orientation for the axis of symmetry of an orthotropic laminate. The orthotropic laminate program uses an approximate failure theory, which speed up computations dramatically.

Flanagan, G. V.↗

Resilient Design of Continuous-time Distributed Optimization Algorithm in the Presence of Cyber-attacks

This paper presents a continuous-time resilient distributed optimization algorithm based on competitive interaction design method on connected graphs in the presence of adversaries. Here, the competitive interaction method allows us to design a network that protects the multi-agent systems from adversaries without requiring high network connectivity. In addition, the proposed algorithm does not require the global information about the number of adversaries. First, we show that the proposed distributed algorithm solves the resilient distributed optimization problem with no attack on the communication links. Second, we show that the proposed continuous-time distributed optimization algorithm on connected graphs converges to the small neighborhood of the optimal solution in the presence of cyber-attacks onto the communication channel. Simulations are presented to illustrate our theoretical results.

97 MATHEMATICS AND COMPUTING↗

Operation and Optimization of Microwave-Heated Continuous-Flow Microfluidics

Microwave (MW) technology can be powerful for electrification and process intensification but limited fundamental understanding of scalability and design principles hinders its effective use. In this work, we build a continuous-flow microreactor inside a commercial single-mode MW applicator and the corresponding computational fluid dynamics model to simulate the temperature profile. The model is in good agreement with experiments for various microreactor dimensions and operating conditions. The model indicates that MW heating is greatly influenced by reactor geometry as well as the operating parameters. We observe a strong correlation between parameters and develop a gradient boost regression tree model to predict the outlet temperature accurately. This model is then applied to optimize the dimensions and operating conditions to maximize the outlet temperature and energy efficiency, resulting in a Pareto optimal. We demonstrate computationally and experimentally that it is possible to surpass the Pareto optimal and achieve an energy efficiency of ~90% or greater at temperatures relevant for liquid-phase chemistry via salting of the solvent. The present methodology can be applied to other complex MW reactors. Lastly, the combined numerical and experimental approach provides insights into and a framework for scale-up and optimization.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Method for exploiting bias in factor analysis using constrained alternating least squares algorithms

Bias plays an important role in factor analysis and is often implicitly made use of, for example, to constrain solutions to factors that conform to physical reality. However, when components are collinear, a large range of solutions may exist that satisfy the basic constraints and fit the data equally well. In such cases, the introduction of mathematical bias through the application of constraints may select solutions that are less than optimal. The biased alternating least squares algorithm of the present invention can offset mathematical bias introduced by constraints in the standard alternating least squares analysis to achieve factor solutions that are most consistent with physical reality. In addition, these methods can be used to explicitly exploit bias to provide alternative views and provide additional insights into spectral data sets.

Keenan, Michael R↗

Optimal purchasing of raw materials: A data-driven approach

An approach to the optimal purchasing of raw materials that will achieve a desired product quality at a minimum cost is presented. A PLS (Partial Least Squares) approach to formulation modeling is used to combine databases on raw material properties and on past process operations and to relate these to final product quality. These PLS latent variable models are then used in a sequential quadratic programming (SQP) or mixed integer nonlinear programming (MINLP) optimization to select those raw-materials, among all those available on the market, the ratios in which to combine them and the process conditions under which they should be processed. The approach is illustrated for the optimal purchasing of metallurgical coals for coke making in the steel industry.

01 COAL, LIGNITE, AND PEAT↗

Optimizing wind farm siting to reduce power system impacts of wind variability

We introduce and solve two variants of a biobjective optimization model to reduce the negative impact of wind variability on the power system by strategically locating wind farms. The first model variant considers average changes in wind power over time; the second captures extreme fluctuations in wind power. A complementary set of wind sites is selected with the aim of minimizing both residual demand and the variability in residual demand. Because exact optimization is computationally intensive, we develop two heuristics—forward and backward greedy algorithms—to find approximate solutions. The results are compared with the exact optimization results for a well-selected subset of the data as well as to the results from selecting sites based on average wind alone. The two models are solved using demand data and potential wind sites for the Southwest Power Pool. Though both objectives can be improved by adding more sites, for a fixed number of sites, minimizing residual demand and variability in residual demand are competing objectives. Here, we find an approximate efficient frontier to compare trade-offs between the two objectives. We also vary the parameter in the heuristic that controls how the two objectives are prioritized. For the case study, the backward greedy algorithm is more effective at reducing the wind power variability than the forward greedy algorithm. Furthermore, using the backward algorithm for the full dataset is more effective than solving the exact optimization on a subset of the data when the results are evaluated using the full dataset.

17 WIND ENERGY↗

Phenomenological model of photoluminescence degradation and photoinduced defect formation in silicon nanocrystal ensembles under singlet oxygen generation

We propose a phenomenological model to explain photoluminescence degradation of silicon nanocrystals under singlet oxygen generation in gaseous and liquid systems. The model considers coupled rate equations, which take into account the exciton radiative recombination in silicon nanocrystals, photosensitization of singlet oxygen generation, defect formation on the surface of silicon nanocrystals as well as quenching processes for both excitons and singlet oxygen molecules. The model describes well the experimentally observed power law dependences of the photoluminescence intensity, singlet oxygen concentration, and lifetime versus photoexcitation time. The defect concentration in silicon nanocrystals increases by power law with a fractional exponent, which depends on the singlet oxygen concentration and ambient conditions. The obtained results are discussed in a view of optimization of the photosensitized singlet oxygen generation for biomedical applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

MOOSE Framework Speed and Memory Optimizations

The Multiphysics Object Oriented Simulation Environment (MOOSE) framework has been developed to solve a variety of complex simulations ranging from groundwater flows to full reactor simulations. MOOSE excels at solving fully-implicit, fully-coupled, highly nonlinear models using the Jacobian Free Newton-Krylov (JFNK) method relying on years of expertise in several dependent packages including PETSc, libMesh, Hypre and many others. The modular design of MOOSE enables the rapid development of new physics models that can be coupled with relative ease within the framework for building up simulations of different levels of complexity. With the ongoing adoption of MOOSE to new application areas along with streamlining of existing simulations, the priorities must be adjusted to include code optimizations. This includes both execution speed and the memory footprint of MOOSE-based simulations. These two categories can be further broken down into ''micro-optimizations'' or source code optimizations and algorithmic optimizations where source code is restructured to accomplish the same tasks through a more efficient means. However, before any code optimizations can occur, one must have robust way of measuring these critical simulation properties to identify the best candidates for optimizations along with having a way to identify the effectiveness of proposed optimizations to the framework. This report discusses the preliminary work towards the implementation of a robust execution baseline of the framework and derivative applications under a variety of different simulations. In addition, several potential optimization target areas in both the MOOSE framework and dependent libraries have been identified. An implementation strategy and potential benefits are discussed.

97 MATHEMATICS AND COMPUTING↗

Multiobjective optimization of hybrid regenerative life support technologies. Topic D: Technology Assessment

We developed simple mathematical models for many of the technologies constituting the water reclamation system in a space station. These models were employed for subsystem optimization and for the evaluation of the performance of individual water reclamation technologies, by quantifying their operational 'cost' as a linear function of weight, volume, and power consumption. Then we performed preliminary investigations on the performance improvements attainable by simple hybrid systems involving parallel combinations of technologies. We are developing a software tool for synthesizing a hybrid water recovery system (WRS) for long term space missions. As conceptual framework, we are employing the state space approach. Given a number of available technologies and the mission specifications, the state space approach would help design flowsheets featuring optimal process configurations, including those that feature stream connections in parallel, series, or recycles. We visualize this software tool to function as follows: given the mission duration, the crew size, water quality specifications, and the cost coefficients, the software will synthesize a water recovery system for the space station. It should require minimal user intervention. The following tasks need to be solved for achieving this goal: (1) formulate a problem statement that will be used to evaluate the advantages of a hybrid WRS over a single technology WBS; (2) model several WRS technologies that can be employed in the space station; (3) propose a recycling network design methodology (since the WRS synthesis task is a recycling network design problem, it is essential to employ a systematic method in synthesizing this network); (4) develop a software implementation for this design methodology, design a hybrid system using this software, and compare the resulting WRS with a base-case WRS; and (5) create a user-friendly interface for this software tool.

Manousiouthakis, Vasilios↗

Quantum Circuit Designs of Integer Division Optimizing T-Count and T-Depth

Quantum circuits for basic mathematical functions such as division are required to implement scientific computing algorithms on quantum computers. In this work, we propose two designs for quantum integer division. The designs are based on quantum Clifford+T gates and are optimized for T-count and T-depth. Quantum circuits that are based on Clifford+T gates can be made fault tolerant in nature but the T gate is very costly to implement. As a result, reducing T-count and T-depth have become important optimization goals. Existing quantum hardware is limited in terms of number of available qubits. Thus, ancillary qubits are a circuit overhead that needs to be kept to a minimum. We propose two quantum integer division circuits. The first quantum integer division circuit is based on the non-restoring division algorithm. The proposed non-restoring division circuit is optimized for total quantum hardware (T-count and T-depth) cost but requires 2* n + 1 ancillary qubits. We also propose a quantum integer division circuit based on the restoring division algorithm. The proposed restoring division circuit is optimized for total qubits. The design requires only n ancillary qubits but will need more quantum hardware than the non-restoring division circuit. Both proposed quantum circuits are based on (i) a new quantum conditional addition circuit, (ii) a new quantum adder-subtractor and (iii) a new quantum subtraction circuit. Further, both designs are compared and shown to be superior to existing work in terms of T-count and T-depth. The proposed quantum non-restoring integer division circuit has a 96% improvement in terms of T-count and a 93% improvement in terms of T-depth compared to existing work. The proposed quantum restoring integer division circuit has a 91% improvement in terms of T-count and a 86% improvement in terms of T-count compared to the existing work.

Thapliyal, Himanshu↗

Optimal pipelining

An effort is made to characterize the tradeoffs and overheads limiting the speedup potential theoretically projected for pipeline-incorporating computer architectures, using a mathematical model of the roles played by the various parameters. Pipeline optimization proceeds by a partitioning of the pipeline into an optimum number of segments so that maximization of throughput is obtained. Inferences are drawn from the model, and potential improvements to it are identified. Substantial agreement is obtained with Kunkel and Smith's (1986) CRAY-1S simulations of pipelining.

Dubey, Pradeep K.↗