Computational design of enzyme-ligand binding using a combined energy function and deterministic sequence optimization algorithm.

PubMed

Tian, Ye; Huang, Xiaoqiang; Zhu, Yushan

2015-08-01

Enzyme amino-acid sequences at ligand-binding interfaces are evolutionarily optimized for reactions, and the natural conformation of an enzyme-ligand complex must have a low free energy relative to alternative conformations in native-like or non-native sequences. Based on this assumption, a combined energy function was developed for enzyme design and then evaluated by recapitulating native enzyme sequences at ligand-binding interfaces for 10 enzyme-ligand complexes. In this energy function, the electrostatic interaction between polar or charged atoms at buried interfaces is described by an explicitly orientation-dependent hydrogen-bonding potential and a pairwise-decomposable generalized Born model based on the general side chain in the protein design framework. The energy function is augmented with a pairwise surface-area based hydrophobic contribution for nonpolar atom burial. Using this function, on average, 78% of the amino acids at ligand-binding sites were predicted correctly in the minimum-energy sequences, whereas 84% were predicted correctly in the most-similar sequences, which were selected from the top 20 sequences for each enzyme-ligand complex. Hydrogen bonds at the enzyme-ligand binding interfaces in the 10 complexes were usually recovered with the correct geometries. The binding energies calculated using the combined energy function helped to discriminate the active sequences from a pool of alternative sequences that were generated by repeatedly solving a series of mixed-integer linear programming problems for sequence selection with increasing integer cuts.

A mixed integer program to model spatial wildfire behavior and suppression placement decisions

Treesearch

Erin J. Belval; Yu Wei; Michael Bevers

2015-01-01

Wildfire suppression combines multiple objectives and dynamic fire behavior to form a complex problem for decision makers. This paper presents a mixed integer program designed to explore integrating spatial fire behavior and suppression placement decisions into a mathematical programming framework. Fire behavior and suppression placement decisions are modeled using...

An Integer Programming Model for Multi-Echelon Supply Chain Decision Problem Considering Inventories

NASA Astrophysics Data System (ADS)

Harahap, Amin; Mawengkang, Herman; Siswadi; Effendi, Syahril

2018-01-01

In this paper we address a problem that is of significance to the industry, namely the optimal decision of a multi-echelon supply chain and the associated inventory systems. By using the guaranteed service approach to model the multi-echelon inventory system, we develop a mixed integer; programming model to simultaneously optimize the transportation, inventory and network structure of a multi-echelon supply chain. To solve the model we develop a direct search approach using a strategy of releasing nonbasic variables from their bounds, combined with the “active constraint” method. This strategy is used to force the appropriate non-integer basic variables to move to their neighbourhood integer points.

An Improved Search Approach for Solving Non-Convex Mixed-Integer Non Linear Programming Problems

NASA Astrophysics Data System (ADS)

Sitopu, Joni Wilson; Mawengkang, Herman; Syafitri Lubis, Riri

2018-01-01

The nonlinear mathematical programming problem addressed in this paper has a structure characterized by a subset of variables restricted to assume discrete values, which are linear and separable from the continuous variables. The strategy of releasing nonbasic variables from their bounds, combined with the “active constraint” method, has been developed. This strategy is used to force the appropriate non-integer basic variables to move to their neighbourhood integer points. Successful implementation of these algorithms was achieved on various test problems.

A Structural Weight Estimation Program (SWEEP) for Aircraft. Volume 11 - Flexible Airloads Stand-Alone Program

DTIC Science & Technology

1974-06-01

stiffness, lb-in. I Integer used to designate wing strip number 2 I Airplanw pitching moment of inertia, slug ft 2 I Airplane yawing moment of inertia...slug ft J Integer used to designated wing-loading distribution, i.e., J-l, loading due to angle of attack J=2> loading due to flap deflection J-3...moment at intersection of load reference line and body interface station (for vertical tail), in.-lb Integer used to designate type of wing airload

Multiple object tracking using the shortest path faster association algorithm.

PubMed

Xi, Zhenghao; Liu, Heping; Liu, Huaping; Yang, Bin

2014-01-01

To solve the persistently multiple object tracking in cluttered environments, this paper presents a novel tracking association approach based on the shortest path faster algorithm. First, the multiple object tracking is formulated as an integer programming problem of the flow network. Then we relax the integer programming to a standard linear programming problem. Therefore, the global optimum can be quickly obtained using the shortest path faster algorithm. The proposed method avoids the difficulties of integer programming, and it has a lower worst-case complexity than competing methods but better robustness and tracking accuracy in complex environments. Simulation results show that the proposed algorithm takes less time than other state-of-the-art methods and can operate in real time.

Multiple Object Tracking Using the Shortest Path Faster Association Algorithm

PubMed Central

Liu, Heping; Liu, Huaping; Yang, Bin

2014-01-01

To solve the persistently multiple object tracking in cluttered environments, this paper presents a novel tracking association approach based on the shortest path faster algorithm. First, the multiple object tracking is formulated as an integer programming problem of the flow network. Then we relax the integer programming to a standard linear programming problem. Therefore, the global optimum can be quickly obtained using the shortest path faster algorithm. The proposed method avoids the difficulties of integer programming, and it has a lower worst-case complexity than competing methods but better robustness and tracking accuracy in complex environments. Simulation results show that the proposed algorithm takes less time than other state-of-the-art methods and can operate in real time. PMID:25215322

Dynamic UNITY

DTIC Science & Technology

2002-01-01

UNITY program that implements exactly the same algorithm as Specification 1.1. The correctness of this program is proven in amanner sim- 4 program...chapter, we introduce the Dynamic UNITY formalism, which allows us to reason about algorithms and protocols in which the sets of participating processes...implements Euclid’s algorithm for calculating the greatest common divisor (GCD) of two integers; it repeat- edly reads an integer message from each of its

Stochastic Semidefinite Programming: Applications and Algorithms

DTIC Science & Technology

2012-03-03

doi: 2011/09/07 13:38:21 13 TOTAL: 1 Number of Papers published in non peer-reviewed journals: Baha M. Alzalg and K. A. Ariyawansa, Stochastic...symmetric programming over integers. International Conference on Scientific Computing, Las Vegas, Nevada, July 18--21, 2011. Baha M. Alzalg. On recent...Proceeding publications (other than abstracts): PaperReceived Baha M. Alzalg, K. A. Ariyawansa. Stochastic mixed integer second-order cone programming

Comparison of Integer Programming (IP) Solvers for Automated Test Assembly (ATA). Research Report. ETS RR-15-05

ERIC Educational Resources Information Center

Donoghue, John R.

2015-01-01

At the heart of van der Linden's approach to automated test assembly (ATA) is a linear programming/integer programming (LP/IP) problem. A variety of IP solvers are available, ranging in cost from free to hundreds of thousands of dollars. In this paper, I compare several approaches to solving the underlying IP problem. These approaches range from…

Optimal Facility Location Tool for Logistics Battle Command (LBC)

DTIC Science & Technology

2015-08-01

64 Appendix B. VBA Code . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 72 Appendix C. Story...should city planners have located emergency service facilities so that all households (the demand) had equal access to coverage?” The critical...programming language called Visual Basic for Applications ( VBA ). CPLEX is a commercial solver for linear, integer, and mixed integer linear programming problems

A Treatment of Computational Precision, Number Representation, and Large Integers in an Introductory Fortran Course

ERIC Educational Resources Information Center

Richardson, William H., Jr.

2006-01-01

Computational precision is sometimes given short shrift in a first programming course. Treating this topic requires discussing integer and floating-point number representations and inaccuracies that may result from their use. An example of a moderately simple programming problem from elementary statistics was examined. It forced students to…

An Integer Programming Approach to School District Financial Management.

ERIC Educational Resources Information Center

Dembowski, Frederick L.

Because of the nature of school district cash flows, there are opportunities for investing surplus cash and the necessity to borrow cash in deficit periods. The term structure of interest rates makes the manual determination of the optimal financial package impossible. In this research, an integer programming model of this cash management process…

Currency Arbitrage Detection Using a Binary Integer Programming Model

ERIC Educational Resources Information Center

Soon, Wanmei; Ye, Heng-Qing

2011-01-01

In this article, we examine the use of a new binary integer programming (BIP) model to detect arbitrage opportunities in currency exchanges. This model showcases an excellent application of mathematics to the real world. The concepts involved are easily accessible to undergraduate students with basic knowledge in Operations Research. Through this…

Puerto Rico water resources planning model program description

USGS Publications Warehouse

Moody, D.W.; Maddock, Thomas; Karlinger, M.R.; Lloyd, J.J.

1973-01-01

Because the use of the Mathematical Programming System -Extended (MPSX) to solve large linear and mixed integer programs requires the preparation of many input data cards, a matrix generator program to produce the MPSX input data from a much more limited set of data may expedite the use of the mixed integer programming optimization technique. The Model Definition and Control Program (MODCQP) is intended to assist a planner in preparing MPSX input data for the Puerto Rico Water Resources Planning Model. The model utilizes a mixed-integer mathematical program to identify a minimum present cost set of water resources projects (diversions, reservoirs, ground-water fields, desalinization plants, water treatment plants, and inter-basin transfers of water) which will meet a set of future water demands and to determine their sequence of construction. While MODCOP was specifically written to generate MPSX input data for the planning model described in this report, the program can be easily modified to reflect changes in the model's mathematical structure.

Dynamic analysis for solid waste management systems: an inexact multistage integer programming approach.

PubMed

Li, Yongping; Huang, Guohe

2009-03-01

In this study, a dynamic analysis approach based on an inexact multistage integer programming (IMIP) model is developed for supporting municipal solid waste (MSW) management under uncertainty. Techniques of interval-parameter programming and multistage stochastic programming are incorporated within an integer-programming framework. The developed IMIP can deal with uncertainties expressed as probability distributions and interval numbers, and can reflect the dynamics in terms of decisions for waste-flow allocation and facility-capacity expansion over a multistage context. Moreover, the IMIP can be used for analyzing various policy scenarios that are associated with different levels of economic consequences. The developed method is applied to a case study of long-term waste-management planning. The results indicate that reasonable solutions have been generated for binary and continuous variables. They can help generate desired decisions of system-capacity expansion and waste-flow allocation with a minimized system cost and maximized system reliability.

Airborne Tactical Crossload Planner

DTIC Science & Technology

2017-12-01

set out in the Airborne Standard Operating Procedure (ASOP). 14. SUBJECT TERMS crossload, airborne, optimization, integer linear programming ...they land to their respective sub-mission locations. In this thesis, we formulate and implement an integer linear program called the Tactical...to meet any desired crossload objectives. xiv We demonstrate TCP with two real-world tactical problems from recent airborne operations: one by the

Solving mixed integer nonlinear programming problems using spiral dynamics optimization algorithm

NASA Astrophysics Data System (ADS)

Kania, Adhe; Sidarto, Kuntjoro Adji

2016-02-01

Many engineering and practical problem can be modeled by mixed integer nonlinear programming. This paper proposes to solve the problem with modified spiral dynamics inspired optimization method of Tamura and Yasuda. Four test cases have been examined, including problem in engineering and sport. This method succeeds in obtaining the optimal result in all test cases.

PIPS-SBB: A Parallel Distributed-Memory Branch-and-Bound Algorithm for Stochastic Mixed-Integer Programs

DOE PAGES

Munguia, Lluis-Miquel; Oxberry, Geoffrey; Rajan, Deepak

2016-05-01

Stochastic mixed-integer programs (SMIPs) deal with optimization under uncertainty at many levels of the decision-making process. When solved as extensive formulation mixed- integer programs, problem instances can exceed available memory on a single workstation. In order to overcome this limitation, we present PIPS-SBB: a distributed-memory parallel stochastic MIP solver that takes advantage of parallelism at multiple levels of the optimization process. We also show promising results on the SIPLIB benchmark by combining methods known for accelerating Branch and Bound (B&B) methods with new ideas that leverage the structure of SMIPs. Finally, we expect the performance of PIPS-SBB to improve furthermore » as more functionality is added in the future.« less

Logic integer programming models for signaling networks.

PubMed

Haus, Utz-Uwe; Niermann, Kathrin; Truemper, Klaus; Weismantel, Robert

2009-05-01

We propose a static and a dynamic approach to model biological signaling networks, and show how each can be used to answer relevant biological questions. For this, we use the two different mathematical tools of Propositional Logic and Integer Programming. The power of discrete mathematics for handling qualitative as well as quantitative data has so far not been exploited in molecular biology, which is mostly driven by experimental research, relying on first-order or statistical models. The arising logic statements and integer programs are analyzed and can be solved with standard software. For a restricted class of problems the logic models reduce to a polynomial-time solvable satisfiability algorithm. Additionally, a more dynamic model enables enumeration of possible time resolutions in poly-logarithmic time. Computational experiments are included.

A logic-based method for integer programming

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hooker, J.; Natraj, N.R.

1994-12-31

We propose a logic-based approach to integer programming that replaces traditional branch-and-cut techniques with logical analogs. Integer variables are regarded as atomic propositions. The constraints give rise to logical formulas that are analogous to separating cuts. No continuous relaxation is used. Rather, the cuts are selected so that they can be easily solved as a discrete relaxation. (In fact, defining a relaxation and generating cuts are best seen as the same problem.) We experiment with relaxations that have a k-tree structure and can be solved by nonserial dynamic programming. We also present logic-based analogs of facet-defining cuts, Chv{acute a}tal rank,more » etc. We conclude with some preliminary computational results.« less

Identifying Blocks Formed by Curbed Fractures Using Exact Arithmetic

NASA Astrophysics Data System (ADS)

Zheng, Y.; Xia, L.; Yu, Q.; Zhang, X.

2015-12-01

Identifying blocks formed by fractures is important in rock engineering. Most studies assume the fractures to be perfect planar whereas curved fractures are rarely considered. However, large fractures observed in the field are often curved. This paper presents a new method for identifying rock blocks formed by both curved and planar fractures based on the element-block-assembling approach. The curved and planar fractures are represented as triangle meshes and planar discs, respectively. In the beginning of the identification method, the intersection segments between different triangle meshes are calculated and the intersected triangles are re-meshed to construct a piecewise linear complex (PLC). Then, the modeling domain is divided into tetrahedral subdomains under the constraint of the PLC and these subdomains are further decomposed into element blocks by extended planar fractures. Finally, the element blocks are combined and the subdomains are assembled to form complex blocks. The combination of two subdomains is skipped if and only if the common facet lies on a curved fracture. In this study, the exact arithmetic is used to handle the computational errors, which may threat the robustness of the block identification program when the degenerated cases are encountered. Specifically, a real number is represented as the ratio between two integers and the basic arithmetic such as addition, subtraction, multiplication and division between different real numbers can be performed exactly if an arbitrary precision integer package is used. In this way, the exact construction of blocks can be achieved without introducing computational errors. Several analytical examples are given in this paper and the results show effectiveness of this method in handling arbitrary shaped blocks. Moreover, there is no limitation on the number of blocks in a block system. The results also show (suggest) that the degenerated cases can be handled without affecting the robustness of the identification program.

Determination of optimum values for maximizing the profit in bread production: Daily bakery Sdn Bhd

NASA Astrophysics Data System (ADS)

Muda, Nora; Sim, Raymond

2015-02-01

An integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers. In many settings the term refers to integer linear programming (ILP), in which the objective function and the constraints (other than the integer constraints) are linear. An ILP has many applications in industrial production, including job-shop modelling. A possible objective is to maximize the total production, without exceeding the available resources. In some cases, this can be expressed in terms of a linear program, but variables must be constrained to be integer. It concerned with the optimization of a linear function while satisfying a set of linear equality and inequality constraints and restrictions. It has been used to solve optimization problem in many industries area such as banking, nutrition, agriculture, and bakery and so on. The main purpose of this study is to formulate the best combination of all ingredients in producing different type of bread in Daily Bakery in order to gain maximum profit. This study also focuses on the sensitivity analysis due to changing of the profit and the cost of each ingredient. The optimum result obtained from QM software is RM 65,377.29 per day. This study will be benefited for Daily Bakery and also other similar industries. By formulating a combination of all ingredients make up, they can easily know their total profit in producing bread everyday.

Computer Corner: Spreadsheets, Power Series, Generating Functions, and Integers.

ERIC Educational Resources Information Center

Snow, Donald R.

1989-01-01

Implements a table algorithm on a spreadsheet program and obtains functions for several number sequences such as the Fibonacci and Catalan numbers. Considers other applications of the table algorithm to integers represented in various number bases. (YP)

An interactive approach based on a discrete differential evolution algorithm for a class of integer bilevel programming problems

NASA Astrophysics Data System (ADS)

Li, Hong; Zhang, Li; Jiao, Yong-Chang

2016-07-01

This paper presents an interactive approach based on a discrete differential evolution algorithm to solve a class of integer bilevel programming problems, in which integer decision variables are controlled by an upper-level decision maker and real-value or continuous decision variables are controlled by a lower-level decision maker. Using the Karush--Kuhn-Tucker optimality conditions in the lower-level programming, the original discrete bilevel formulation can be converted into a discrete single-level nonlinear programming problem with the complementarity constraints, and then the smoothing technique is applied to deal with the complementarity constraints. Finally, a discrete single-level nonlinear programming problem is obtained, and solved by an interactive approach. In each iteration, for each given upper-level discrete variable, a system of nonlinear equations including the lower-level variables and Lagrange multipliers is solved first, and then a discrete nonlinear programming problem only with inequality constraints is handled by using a discrete differential evolution algorithm. Simulation results show the effectiveness of the proposed approach.

Currency arbitrage detection using a binary integer programming model

NASA Astrophysics Data System (ADS)

Soon, Wanmei; Ye, Heng-Qing

2011-04-01

In this article, we examine the use of a new binary integer programming (BIP) model to detect arbitrage opportunities in currency exchanges. This model showcases an excellent application of mathematics to the real world. The concepts involved are easily accessible to undergraduate students with basic knowledge in Operations Research. Through this work, students can learn to link several types of basic optimization models, namely linear programming, integer programming and network models, and apply the well-known sensitivity analysis procedure to accommodate realistic changes in the exchange rates. Beginning with a BIP model, we discuss how it can be reduced to an equivalent but considerably simpler model, where an efficient algorithm can be applied to find the arbitrages and incorporate the sensitivity analysis procedure. A simple comparison is then made with a different arbitrage detection model. This exercise helps students learn to apply basic Operations Research concepts to a practical real-life example, and provides insights into the processes involved in Operations Research model formulations.

Mixed Integer Programming and Heuristic Scheduling for Space Communication Networks

NASA Technical Reports Server (NTRS)

Cheung, Kar-Ming; Lee, Charles H.

2012-01-01

We developed framework and the mathematical formulation for optimizing communication network using mixed integer programming. The design yields a system that is much smaller, in search space size, when compared to the earlier approach. Our constrained network optimization takes into account the dynamics of link performance within the network along with mission and operation requirements. A unique penalty function is introduced to transform the mixed integer programming into the more manageable problem of searching in a continuous space. The constrained optimization problem was proposed to solve in two stages: first using the heuristic Particle Swarming Optimization algorithm to get a good initial starting point, and then feeding the result into the Sequential Quadratic Programming algorithm to achieve the final optimal schedule. We demonstrate the above planning and scheduling methodology with a scenario of 20 spacecraft and 3 ground stations of a Deep Space Network site. Our approach and framework have been simple and flexible so that problems with larger number of constraints and network can be easily adapted and solved.

An Interactive Artificial Cutting Plane Method for Bicriterion Integer Programming Problems

DTIC Science & Technology

1992-08-01

AUTHOR(S) Diane Breivik Allen, 1st Lt 7. PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES) 8. PERFORMING ORGANIZATION REPORT NUMBER AFIT Student Attending...INTERACTIVE ARTIFICIAL CUTTING PLANE METHOD FOR BICRITERION INTEGER PROGRAMMING PROBLEMS By Diane Breivik Allen A Thesis Submitted to the Faculty of...ITfiSRA&1 DTIC TAB 0 Unannounced 0 Justirication By BY Diane Breivik Allen Distributlon/ Availability CQdes Avail and/or Dist Special Approved: DTI

Enhanced index tracking modeling in portfolio optimization with mixed-integer programming z approach

NASA Astrophysics Data System (ADS)

Siew, Lam Weng; Jaaman, Saiful Hafizah Hj.; Ismail, Hamizun bin

2014-09-01

Enhanced index tracking is a popular form of portfolio management in stock market investment. Enhanced index tracking aims to construct an optimal portfolio to generate excess return over the return achieved by the stock market index without purchasing all of the stocks that make up the index. The objective of this paper is to construct an optimal portfolio using mixed-integer programming model which adopts regression approach in order to generate higher portfolio mean return than stock market index return. In this study, the data consists of 24 component stocks in Malaysia market index which is FTSE Bursa Malaysia Kuala Lumpur Composite Index from January 2010 until December 2012. The results of this study show that the optimal portfolio of mixed-integer programming model is able to generate higher mean return than FTSE Bursa Malaysia Kuala Lumpur Composite Index return with only selecting 30% out of the total stock market index components.

Smart-Grid Backbone Network Real-Time Delay Reduction via Integer Programming.

PubMed

Pagadrai, Sasikanth; Yilmaz, Muhittin; Valluri, Pratyush

2016-08-01

This research investigates an optimal delay-based virtual topology design using integer linear programming (ILP), which is applied to the current backbone networks such as smart-grid real-time communication systems. A network traffic matrix is applied and the corresponding virtual topology problem is solved using the ILP formulations that include a network delay-dependent objective function and lightpath routing, wavelength assignment, wavelength continuity, flow routing, and traffic loss constraints. The proposed optimization approach provides an efficient deterministic integration of intelligent sensing and decision making, and network learning features for superior smart grid operations by adaptively responding the time-varying network traffic data as well as operational constraints to maintain optimal virtual topologies. A representative optical backbone network has been utilized to demonstrate the proposed optimization framework whose simulation results indicate that superior smart-grid network performance can be achieved using commercial networks and integer programming.

Chromosome structures: reduction of certain problems with unequal gene content and gene paralogs to integer linear programming.

PubMed

Lyubetsky, Vassily; Gershgorin, Roman; Gorbunov, Konstantin

2017-12-06

Chromosome structure is a very limited model of the genome including the information about its chromosomes such as their linear or circular organization, the order of genes on them, and the DNA strand encoding a gene. Gene lengths, nucleotide composition, and intergenic regions are ignored. Although highly incomplete, such structure can be used in many cases, e.g., to reconstruct phylogeny and evolutionary events, to identify gene synteny, regulatory elements and promoters (considering highly conserved elements), etc. Three problems are considered; all assume unequal gene content and the presence of gene paralogs. The distance problem is to determine the minimum number of operations required to transform one chromosome structure into another and the corresponding transformation itself including the identification of paralogs in two structures. We use the DCJ model which is one of the most studied combinatorial rearrangement models. Double-, sesqui-, and single-operations as well as deletion and insertion of a chromosome region are considered in the model; the single ones comprise cut and join. In the reconstruction problem, a phylogenetic tree with chromosome structures in the leaves is given. It is necessary to assign the structures to inner nodes of the tree to minimize the sum of distances between terminal structures of each edge and to identify the mutual paralogs in a fairly large set of structures. A linear algorithm is known for the distance problem without paralogs, while the presence of paralogs makes it NP-hard. If paralogs are allowed but the insertion and deletion operations are missing (and special constraints are imposed), the reduction of the distance problem to integer linear programming is known. Apparently, the reconstruction problem is NP-hard even in the absence of paralogs. The problem of contigs is to find the optimal arrangements for each given set of contigs, which also includes the mutual identification of paralogs. We proved that these problems can be reduced to integer linear programming formulations, which allows an algorithm to redefine the problems to implement a very special case of the integer linear programming tool. The results were tested on synthetic and biological samples. Three well-known problems were reduced to a very special case of integer linear programming, which is a new method of their solutions. Integer linear programming is clearly among the main computational methods and, as generally accepted, is fast on average; in particular, computation systems specifically targeted at it are available. The challenges are to reduce the size of the corresponding integer linear programming formulations and to incorporate a more detailed biological concept in our model of the reconstruction.

Determining inter-system bias of GNSS signals with narrowly spaced frequencies for GNSS positioning

NASA Astrophysics Data System (ADS)

Tian, Yumiao; Liu, Zhizhao; Ge, Maorong; Neitzel, Frank

2017-12-01

Relative positioning using multi-GNSS (global navigation satellite systems) can improve accuracy, reliability, and availability compared to the use of a single constellation system. Intra-system double-difference (DD) ambiguities (ISDDAs) refer to the DD ambiguities between satellites of a single constellation system and can be fixed to an integer to derive the precise fixed solution. Inter-system ambiguities, which denote the DD ambiguities between different constellation systems, can also be fixed to integers on overlapping frequencies, once the inter-system bias (ISB) is removed. Compared with fixing ISDDAs, fixing both integer intra- and inter-system DD ambiguities (IIDDAs) means an increase of positioning precision through an integration of multiple GNSS constellations. Previously, researchers have studied IIDDA fixing with systems of the same frequencies, but not with systems of different frequencies. Integer IIDDAs can be determined from single-difference (SD) ambiguities, even if the frequencies of multi-GNSS signals used in the positioning are different. In this study, we investigated IIDDA fixing for multi-GNSS signals of narrowly spaced frequencies. First, the inter-system DD models of multi-GNSS signals of different frequencies are introduced, and the strategy for compensating for ISB is presented. The ISB is decomposed into three parts: 1) a float approximate ISB number that can be considered equal to the ISB of code pseudorange observations and thus can be estimated through single point positioning (SPP); 2) a number that is a multiple of the GNSS signal wavelength; and 3) a fractional ISB part, with a magnitude smaller than a single wavelength. Then, the relationship between intra- and inter-system DD ambiguity RATIO values and ISB was investigated by integrating GPS L1 and GLONASS L1 signals. In our numerical analyses with short baselines, the ISB parameter and IIDDA were successfully fixed, even if the number of observed satellites in each system was small.

Alternative mathematical programming formulations for FSS synthesis

NASA Technical Reports Server (NTRS)

Reilly, C. H.; Mount-Campbell, C. A.; Gonsalvez, D. J. A.; Levis, C. A.

1986-01-01

A variety of mathematical programming models and two solution strategies are suggested for the problem of allocating orbital positions to (synthesizing) satellites in the Fixed Satellite Service. Mixed integer programming and almost linear programming formulations are presented in detail for each of two objectives: (1) positioning satellites as closely as possible to specified desired locations, and (2) minimizing the total length of the geostationary arc allocated to the satellites whose positions are to be determined. Computational results for mixed integer and almost linear programming models, with the objective of positioning satellites as closely as possible to their desired locations, are reported for three six-administration test problems and a thirteen-administration test problem.

Aerospace Applications of Integer and Combinatorial Optimization

NASA Technical Reports Server (NTRS)

Padula, S. L.; Kincaid, R. K.

1995-01-01

Research supported by NASA Langley Research Center includes many applications of aerospace design optimization and is conducted by teams of applied mathematicians and aerospace engineers. This paper investigates the benefits from this combined expertise in formulating and solving integer and combinatorial optimization problems. Applications range from the design of large space antennas to interior noise control. A typical problem, for example, seeks the optimal locations for vibration-damping devices on an orbiting platform and is expressed as a mixed/integer linear programming problem with more than 1500 design variables.

Aerospace applications on integer and combinatorial optimization

NASA Technical Reports Server (NTRS)

Padula, S. L.; Kincaid, R. K.

1995-01-01

Research supported by NASA Langley Research Center includes many applications of aerospace design optimization and is conducted by teams of applied mathematicians and aerospace engineers. This paper investigates the benefits from this combined expertise in formulating and solving integer and combinatorial optimization problems. Applications range from the design of large space antennas to interior noise control. A typical problem. for example, seeks the optimal locations for vibration-damping devices on an orbiting platform and is expressed as a mixed/integer linear programming problem with more than 1500 design variables.

Spin-1 Kitaev model in one dimension

NASA Astrophysics Data System (ADS)

Sen, Diptiman; Shankar, R.; Dhar, Deepak; Ramola, Kabir

2010-11-01

We study a one-dimensional version of the Kitaev model on a ring of size N , in which there is a spin S>1/2 on each site and the Hamiltonian is J∑nSnxSn+1y . The cases where S is integer and half-odd integer are qualitatively different. We show that there is a Z2 -valued conserved quantity Wn for each bond (n,n+1) of the system. For integer S , the Hilbert space can be decomposed into 2N sectors, of unequal sizes. The number of states in most of the sectors grows as dN , where d depends on the sector. The largest sector contains the ground state, and for this sector, for S=1 , d=(5+1)/2 . We carry out exact diagonalization for small systems. The extrapolation of our results to large N indicates that the energy gap remains finite in this limit. In the ground-state sector, the system can be mapped to a spin-1/2 model. We develop variational wave functions to study the lowest energy states in the ground state and other sectors. The first excited state of the system is the lowest energy state of a different sector and we estimate its excitation energy. We consider a more general Hamiltonian, adding a term λ∑nWn , and show that this has gapless excitations in the range λ1c≤λ≤λ2c . We use the variational wave functions to study how the ground-state energy and the defect density vary near the two critical points λ1c and λ2c .

Integration of progressive hedging and dual decomposition in stochastic integer programs

DOE PAGES

Watson, Jean -Paul; Guo, Ge; Hackebeil, Gabriel; ...

2015-04-07

We present a method for integrating the Progressive Hedging (PH) algorithm and the Dual Decomposition (DD) algorithm of Carøe and Schultz for stochastic mixed-integer programs. Based on the correspondence between lower bounds obtained with PH and DD, a method to transform weights from PH to Lagrange multipliers in DD is found. Fast progress in early iterations of PH speeds up convergence of DD to an exact solution. As a result, we report computational results on server location and unit commitment instances.

Performance comparison of genetic algorithms and particle swarm optimization for model integer programming bus timetabling problem

NASA Astrophysics Data System (ADS)

Wihartiko, F. D.; Wijayanti, H.; Virgantari, F.

2018-03-01

Genetic Algorithm (GA) is a common algorithm used to solve optimization problems with artificial intelligence approach. Similarly, the Particle Swarm Optimization (PSO) algorithm. Both algorithms have different advantages and disadvantages when applied to the case of optimization of the Model Integer Programming for Bus Timetabling Problem (MIPBTP), where in the case of MIPBTP will be found the optimal number of trips confronted with various constraints. The comparison results show that the PSO algorithm is superior in terms of complexity, accuracy, iteration and program simplicity in finding the optimal solution.

Solving the Water Jugs Problem by an Integer Sequence Approach

ERIC Educational Resources Information Center

Man, Yiu-Kwong

2012-01-01

In this article, we present an integer sequence approach to solve the classic water jugs problem. The solution steps can be obtained easily by additions and subtractions only, which is suitable for manual calculation or programming by computer. This approach can be introduced to secondary and undergraduate students, and also to teachers and…

Fast scaffolding with small independent mixed integer programs

PubMed Central

Salmela, Leena; Mäkinen, Veli; Välimäki, Niko; Ylinen, Johannes; Ukkonen, Esko

2011-01-01

Motivation: Assembling genomes from short read data has become increasingly popular, but the problem remains computationally challenging especially for larger genomes. We study the scaffolding phase of sequence assembly where preassembled contigs are ordered based on mate pair data. Results: We present MIP Scaffolder that divides the scaffolding problem into smaller subproblems and solves these with mixed integer programming. The scaffolding problem can be represented as a graph and the biconnected components of this graph can be solved independently. We present a technique for restricting the size of these subproblems so that they can be solved accurately with mixed integer programming. We compare MIP Scaffolder to two state of the art methods, SOPRA and SSPACE. MIP Scaffolder is fast and produces better or as good scaffolds as its competitors on large genomes. Availability: The source code of MIP Scaffolder is freely available at http://www.cs.helsinki.fi/u/lmsalmel/mip-scaffolder/. Contact: leena.salmela@cs.helsinki.fi PMID:21998153

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Song, Hyun-Seob; Goldberg, Noam; Mahajan, Ashutosh

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. Tomore » 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.« less

Learning multivariate distributions by competitive assembly of marginals.

PubMed

Sánchez-Vega, Francisco; Younes, Laurent; Geman, Donald

2013-02-01

We present a new framework for learning high-dimensional multivariate probability distributions from estimated marginals. The approach is motivated by compositional models and Bayesian networks, and designed to adapt to small sample sizes. We start with a large, overlapping set of elementary statistical building blocks, or "primitives," which are low-dimensional marginal distributions learned from data. Each variable may appear in many primitives. Subsets of primitives are combined in a Lego-like fashion to construct a probabilistic graphical model; only a small fraction of the primitives will participate in any valid construction. Since primitives can be precomputed, parameter estimation and structure search are separated. Model complexity is controlled by strong biases; we adapt the primitives to the amount of training data and impose rules which restrict the merging of them into allowable compositions. The likelihood of the data decomposes into a sum of local gains, one for each primitive in the final structure. We focus on a specific subclass of networks which are binary forests. Structure optimization corresponds to an integer linear program and the maximizing composition can be computed for reasonably large numbers of variables. Performance is evaluated using both synthetic data and real datasets from natural language processing and computational biology.

A two-stage mixed-integer fuzzy programming with interval-valued membership functions approach for flood-diversion planning.

PubMed

Wang, S; Huang, G H

2013-03-15

Flood disasters have been extremely severe in recent decades, and they account for about one third of all natural catastrophes throughout the world. In this study, a two-stage mixed-integer fuzzy programming with interval-valued membership functions (TMFP-IMF) approach is developed for flood-diversion planning under uncertainty. TMFP-IMF integrates the fuzzy flexible programming, two-stage stochastic programming, and integer programming within a general framework. A concept of interval-valued fuzzy membership function is introduced to address complexities of system uncertainties. TMFP-IMF can not only deal with uncertainties expressed as fuzzy sets and probability distributions, but also incorporate pre-regulated water-diversion policies directly into its optimization process. TMFP-IMF is applied to a hypothetical case study of flood-diversion planning for demonstrating its applicability. Results indicate that reasonable solutions can be generated for binary and continuous variables. A variety of flood-diversion and capacity-expansion schemes can be obtained under four scenarios, which enable decision makers (DMs) to identify the most desired one based on their perceptions and attitudes towards the objective-function value and constraints. Copyright © 2013 Elsevier Ltd. All rights reserved.

A Comparison of the DISASTER (Trademark) Scheduling Software with a Simultaneous Scheduling Algorithm for Minimizing Maximum Tardiness in Job Shops

DTIC Science & Technology

1993-09-01

goal ( Heizer , Render , and Stair, 1993:94). Integer Prgronmming. Integer programming is a general purpose approach used to optimally solve job shop...Scheduling," Operations Research Journal. 29, No 4: 646-667 (July-August 1981). Heizer , Jay, Barry Render and Ralph M. Stair, Jr. Production and Operations

An integer programming model to optimize resource allocation for wildfire containment.

Treesearch

Geoffrey H. Donovan; Douglas B. Rideout

2003-01-01

Determining the specific mix of fire-fighting resources for a given fire is a necessary condition for identifying the minimum of the Cost Plus Net Value Change (C+NVC) function. Current wildland fire management models may not reliably do so. The problem of identifying the most efficient wildland fire organization is characterized mathematically using integer-...

RSM 1.0 - A RESUPPLY SCHEDULER USING INTEGER OPTIMIZATION

NASA Technical Reports Server (NTRS)

Viterna, L. A.

1994-01-01

RSM, Resupply Scheduling Modeler, is a fully menu-driven program that uses integer programming techniques to determine an optimum schedule for replacing components on or before the end of a fixed replacement period. Although written to analyze the electrical power system on the Space Station Freedom, RSM is quite general and can be used to model the resupply of almost any system subject to user-defined resource constraints. RSM is based on a specific form of the general linear programming problem in which all variables in the objective function and all variables in the constraints are integers. While more computationally intensive, integer programming was required for accuracy when modeling systems with small quantities of components. Input values for component life cane be real numbers, RSM converts them to integers by dividing the lifetime by the period duration, then reducing the result to the next lowest integer. For each component, there is a set of constraints that insure that it is replaced before its lifetime expires. RSM includes user-defined constraints such as transportation mass and volume limits, as well as component life, available repair crew time and assembly sequences. A weighting factor allows the program to minimize factors such as cost. The program then performs an iterative analysis, which is displayed during the processing. A message gives the first period in which resources are being exceeded on each iteration. If the scheduling problem is unfeasible, the final message will also indicate the first period in which resources were exceeded. RSM is written in APL2 for IBM PC series computers and compatibles. A stand-alone executable version of RSM is provided; however, this is a "packed" version of RSM which can only utilize the memory within the 640K DOS limit. This executable requires at least 640K of memory and DOS 3.1 or higher. Source code for an APL2/PC workspace version is also provided. This version of RSM can make full use of any installed extended memory but must be run with the APL2 interpreter; and it requires an 80486 based microcomputer or an 80386 based microcomputer with an 80387 math coprocessor, at least 2Mb of extended memory, and DOS 3.3 or higher. The standard distribution medium for this package is one 5.25 inch 360K MS-DOS format diskette. RSM was developed in 1991. APL2 and IBM PC are registered trademarks of International Business Machines Corporation. MS-DOS is a registered trademark of Microsoft Corporation.

A generalized interval fuzzy mixed integer programming model for a multimodal transportation problem under uncertainty

NASA Astrophysics Data System (ADS)

Tian, Wenli; Cao, Chengxuan

2017-03-01

A generalized interval fuzzy mixed integer programming model is proposed for the multimodal freight transportation problem under uncertainty, in which the optimal mode of transport and the optimal amount of each type of freight transported through each path need to be decided. For practical purposes, three mathematical methods, i.e. the interval ranking method, fuzzy linear programming method and linear weighted summation method, are applied to obtain equivalents of constraints and parameters, and then a fuzzy expected value model is presented. A heuristic algorithm based on a greedy criterion and the linear relaxation algorithm are designed to solve the model.

A Mixed-Integer Linear Programming Problem which is Efficiently Solvable.

DTIC Science & Technology

1987-10-01

INTEGER LINEAR PROGRAMMING PROBLEM WHICH IS EFFICIENTLY SOLVABLE 12. PERSONAL AUTHOR(S) Leiserson, Charles, and Saxe, James B. 13a. TYPE OF REPORT j13b TIME...ger prongramn rg versions or the problem is not ac’hievable in genieral for sparse inistancves of’ P rolem(r Mi. Th le remrai nder or thris paper is...rClazes c:oIh edge (i,I*) by comlpli urg +- rnirr(z 3, ,x + a,j). A sirnI) le analysis (11 vto Nei [131 indicates why whe Iellinan-Ford algorithm works

Development of a Menu Driven Materials Data Base for Use on Personal Computers

DTIC Science & Technology

1992-07-01

written permission. Copyright Is the responsibility of the Director Publishing and Marketing , AGPS. Enquiries should be directed to the Manager, AGPS...PROGRAM LISTING A-2-1 Program MOB; uses crt; label levell,level2,level3,shutdown,dis;play; var options,code, nlines ,nmeflitemp,i,j4,k :integer; w,chl,ch2,ch3...char; menus :array [I. .1001 of st~ring[801; nline :array [l. .100] of integer; s2 :string[21; control :string[4]; aline :string[801; inm,iflt :text

Stacking-sequence optimization for buckling of laminated plates by integer programming

NASA Technical Reports Server (NTRS)

Haftka, Raphael T.; Walsh, Joanne L.

1991-01-01

Integer-programming formulations for the design of symmetric and balanced laminated plates under biaxial compression are presented. Both maximization of buckling load for a given total thickness and the minimization of total thickness subject to a buckling constraint are formulated. The design variables that define the stacking sequence of the laminate are zero-one integers. It is shown that the formulation results in a linear optimization problem that can be solved on readily available software. This is in contrast to the continuous case, where the design variables are the thicknesses of layers with specified ply orientations, and the optimization problem is nonlinear. Constraints on the stacking sequence such as a limit on the number of contiguous plies of the same orientation and limits on in-plane stiffnesses are easily accommodated. Examples are presented for graphite-epoxy plates under uniaxial and biaxial compression using a commercial software package based on the branch-and-bound algorithm.

Comparison of two non-convex mixed-integer nonlinear programming algorithms applied to autoregressive moving average model structure and parameter estimation

NASA Astrophysics Data System (ADS)

Uilhoorn, F. E.

2016-10-01

In this article, the stochastic modelling approach proposed by Box and Jenkins is treated as a mixed-integer nonlinear programming (MINLP) problem solved with a mesh adaptive direct search and a real-coded genetic class of algorithms. The aim is to estimate the real-valued parameters and non-negative integer, correlated structure of stationary autoregressive moving average (ARMA) processes. The maximum likelihood function of the stationary ARMA process is embedded in Akaike's information criterion and the Bayesian information criterion, whereas the estimation procedure is based on Kalman filter recursions. The constraints imposed on the objective function enforce stability and invertibility. The best ARMA model is regarded as the global minimum of the non-convex MINLP problem. The robustness and computational performance of the MINLP solvers are compared with brute-force enumeration. Numerical experiments are done for existing time series and one new data set.

Distributed mixed-integer fuzzy hierarchical programming for municipal solid waste management. Part I: System identification and methodology development.

PubMed

Cheng, Guanhui; Huang, Guohe; Dong, Cong; Xu, Ye; Chen, Xiujuan; Chen, Jiapei

2017-03-01

Due to the existence of complexities of heterogeneities, hierarchy, discreteness, and interactions in municipal solid waste management (MSWM) systems such as Beijing, China, a series of socio-economic and eco-environmental problems may emerge or worsen and result in irredeemable damages in the following decades. Meanwhile, existing studies, especially ones focusing on MSWM in Beijing, could hardly reflect these complexities in system simulations and provide reliable decision support for management practices. Thus, a framework of distributed mixed-integer fuzzy hierarchical programming (DMIFHP) is developed in this study for MSWM under these complexities. Beijing is selected as a representative case. The Beijing MSWM system is comprehensively analyzed in many aspects such as socio-economic conditions, natural conditions, spatial heterogeneities, treatment facilities, and system complexities, building a solid foundation for system simulation and optimization. Correspondingly, the MSWM system in Beijing is discretized as 235 grids to reflect spatial heterogeneity. A DMIFHP model which is a nonlinear programming problem is constructed to parameterize the Beijing MSWM system. To enable scientific solving of it, a solution algorithm is proposed based on coupling of fuzzy programming and mixed-integer linear programming. Innovations and advantages of the DMIFHP framework are discussed. The optimal MSWM schemes and mechanism revelations will be discussed in another companion paper due to length limitation.

Split diversity in constrained conservation prioritization using integer linear programming.

PubMed

Chernomor, Olga; Minh, Bui Quang; Forest, Félix; Klaere, Steffen; Ingram, Travis; Henzinger, Monika; von Haeseler, Arndt

2015-01-01

Phylogenetic diversity (PD) is a measure of biodiversity based on the evolutionary history of species. Here, we discuss several optimization problems related to the use of PD, and the more general measure split diversity (SD), in conservation prioritization.Depending on the conservation goal and the information available about species, one can construct optimization routines that incorporate various conservation constraints. We demonstrate how this information can be used to select sets of species for conservation action. Specifically, we discuss the use of species' geographic distributions, the choice of candidates under economic pressure, and the use of predator-prey interactions between the species in a community to define viability constraints.Despite such optimization problems falling into the area of NP hard problems, it is possible to solve them in a reasonable amount of time using integer programming. We apply integer linear programming to a variety of models for conservation prioritization that incorporate the SD measure.We exemplarily show the results for two data sets: the Cape region of South Africa and a Caribbean coral reef community. Finally, we provide user-friendly software at http://www.cibiv.at/software/pda.

Rarity-weighted richness: a simple and reliable alternative to integer programming and heuristic algorithms for minimum set and maximum coverage problems in conservation planning.

PubMed

Albuquerque, Fabio; Beier, Paul

2015-01-01

Here we report that prioritizing sites in order of rarity-weighted richness (RWR) is a simple, reliable way to identify sites that represent all species in the fewest number of sites (minimum set problem) or to identify sites that represent the largest number of species within a given number of sites (maximum coverage problem). We compared the number of species represented in sites prioritized by RWR to numbers of species represented in sites prioritized by the Zonation software package for 11 datasets in which the size of individual planning units (sites) ranged from <1 ha to 2,500 km2. On average, RWR solutions were more efficient than Zonation solutions. Integer programming remains the only guaranteed way find an optimal solution, and heuristic algorithms remain superior for conservation prioritizations that consider compactness and multiple near-optimal solutions in addition to species representation. But because RWR can be implemented easily and quickly in R or a spreadsheet, it is an attractive alternative to integer programming or heuristic algorithms in some conservation prioritization contexts.

Integer programming for improving radiotherapy treatment efficiency.

PubMed

Lv, Ming; Li, Yi; Kou, Bo; Zhou, Zhili

2017-01-01

Patients received by radiotherapy departments are diverse and may be diagnosed with different cancers. Therefore, they need different radiotherapy treatment plans and thus have different needs for medical resources. This research aims to explore the best method of scheduling the admission of patients receiving radiotherapy so as to reduce patient loss and maximize the usage efficiency of service resources. A mix integer programming (MIP) model integrated with special features of radiotherapy is constructed. The data used here is based on the historical data collected and we propose an exact method to solve the MIP model. Compared with the traditional First Come First Served (FCFS) method, the new method has boosted patient admission as well as the usage of linear accelerators (LINAC) and beds. The integer programming model can be used to describe the complex problem of scheduling radio-receiving patients, to identify the bottleneck resources that hinder patient admission, and to obtain the optimal LINAC-bed radio under the current data conditions. Different management strategies can be implemented by adjusting the settings of the MIP model. The computational results can serve as a reference for the policy-makers in decision making.

Thermal decomposition of the amino acids glycine, cysteine, aspartic acid, asparagine, glutamic acid, glutamine, arginine and histidine.

PubMed

Weiss, Ingrid M; Muth, Christina; Drumm, Robert; Kirchner, Helmut O K

2018-01-01

The pathways of thermal instability of amino acids have been unknown. New mass spectrometric data allow unequivocal quantitative identification of the decomposition products. Calorimetry, thermogravimetry and mass spectrometry were used to follow the thermal decomposition of the eight amino acids G, C, D, N, E, Q, R and H between 185 °C and 280 °C. Endothermic heats of decomposition between 72 and 151 kJ/mol are needed to form 12 to 70% volatile products. This process is neither melting nor sublimation. With exception of cysteine they emit mainly H 2 O, some NH 3 and no CO 2 . Cysteine produces CO 2 and little else. The reactions are described by polynomials, AA→ a NH 3 + b H 2 O+ c CO 2 + d H 2 S+ e residue, with integer or half integer coefficients. The solid monomolecular residues are rich in peptide bonds. Eight of the 20 standard amino acids decompose at well-defined, characteristic temperatures, in contrast to commonly accepted knowledge. Products of decomposition are simple. The novel quantitative results emphasize the impact of water and cyclic condensates with peptide bonds and put constraints on hypotheses of the origin, state and stability of amino acids in the range between 200 °C and 300 °C.

Mixed Integer Linear Programming model for Crude Palm Oil Supply Chain Planning

NASA Astrophysics Data System (ADS)

Sembiring, Pasukat; Mawengkang, Herman; Sadyadharma, Hendaru; Bu'ulolo, F.; Fajriana

2018-01-01

The production process of crude palm oil (CPO) can be defined as the milling process of raw materials, called fresh fruit bunch (FFB) into end products palm oil. The process usually through a series of steps producing and consuming intermediate products. The CPO milling industry considered in this paper does not have oil palm plantation, therefore the FFB are supplied by several public oil palm plantations. Due to the limited availability of FFB, then it is necessary to choose from which plantations would be appropriate. This paper proposes a mixed integer linear programming model the supply chain integrated problem, which include waste processing. The mathematical programming model is solved using neighborhood search approach.

Exact algorithms for haplotype assembly from whole-genome sequence data.

PubMed

Chen, Zhi-Zhong; Deng, Fei; Wang, Lusheng

2013-08-15

Haplotypes play a crucial role in genetic analysis and have many applications such as gene disease diagnoses, association studies, ancestry inference and so forth. The development of DNA sequencing technologies makes it possible to obtain haplotypes from a set of aligned reads originated from both copies of a chromosome of a single individual. This approach is often known as haplotype assembly. Exact algorithms that can give optimal solutions to the haplotype assembly problem are highly demanded. Unfortunately, previous algorithms for this problem either fail to output optimal solutions or take too long time even executed on a PC cluster. We develop an approach to finding optimal solutions for the haplotype assembly problem under the minimum-error-correction (MEC) model. Most of the previous approaches assume that the columns in the input matrix correspond to (putative) heterozygous sites. This all-heterozygous assumption is correct for most columns, but it may be incorrect for a small number of columns. In this article, we consider the MEC model with or without the all-heterozygous assumption. In our approach, we first use new methods to decompose the input read matrix into small independent blocks and then model the problem for each block as an integer linear programming problem, which is then solved by an integer linear programming solver. We have tested our program on a single PC [a Linux (x64) desktop PC with i7-3960X CPU], using the filtered HuRef and the NA 12878 datasets (after applying some variant calling methods). With the all-heterozygous assumption, our approach can optimally solve the whole HuRef data set within a total time of 31 h (26 h for the most difficult block of the 15th chromosome and only 5 h for the other blocks). To our knowledge, this is the first time that MEC optimal solutions are completely obtained for the filtered HuRef dataset. Moreover, in the general case (without the all-heterozygous assumption), for the HuRef dataset our approach can optimally solve all the chromosomes except the most difficult block in chromosome 15 within a total time of 12 days. For both of the HuRef and NA12878 datasets, the optimal costs in the general case are sometimes much smaller than those in the all-heterozygous case. This implies that some columns in the input matrix (after applying certain variant calling methods) still correspond to false-heterozygous sites. Our program, the optimal solutions found for the HuRef dataset available at http://rnc.r.dendai.ac.jp/hapAssembly.html.

BBPH: Using progressive hedging within branch and bound to solve multi-stage stochastic mixed integer programs

DOE PAGES

Barnett, Jason; Watson, Jean -Paul; Woodruff, David L.

2016-11-27

Progressive hedging, though an effective heuristic for solving stochastic mixed integer programs (SMIPs), is not guaranteed to converge in this case. Here, we describe BBPH, a branch and bound algorithm that uses PH at each node in the search tree such that, given sufficient time, it will always converge to a globally optimal solution. Additionally, to providing a theoretically convergent “wrapper” for PH applied to SMIPs, computational results demonstrate that for some difficult problem instances branch and bound can find improved solutions after exploring only a few nodes.

An Integer Programming Model for the Management of a Forest in the North of Portugal

NASA Astrophysics Data System (ADS)

Cerveira, Adelaide; Fonseca, Teresa; Mota, Artur; Martins, Isabel

2011-09-01

This study aims to develop an approach for the management of a forest of maritime pine located in the north region of Portugal. The forest is classified into five public lands, the so-called baldios, extending over 4432 ha. These baldios are co-managed by the Official Forest Services and the local communities mainly for timber production purposes. The forest planning involves non-spatial and spatial constraints. Spatial constraints dictate a maximum clearcut area and an exclusion time. An integer programming model is presented and the computational results are discussed.

Solving the water jugs problem by an integer sequence approach

NASA Astrophysics Data System (ADS)

Man, Yiu-Kwong

2012-01-01

In this article, we present an integer sequence approach to solve the classic water jugs problem. The solution steps can be obtained easily by additions and subtractions only, which is suitable for manual calculation or programming by computer. This approach can be introduced to secondary and undergraduate students, and also to teachers and lecturers involved in teaching mathematical problem solving, recreational mathematics, or elementary number theory.

New Approaches for Very Large-Scale Integer Programming

DTIC Science & Technology

2016-06-24

existing algorithms. This research has been presented at several conferences and has and will appear in archival journals. 15. SUBJECT TERMS integer...This research has been presented at several conferences and has and will appear in archival journals. Distribution Statement This is block 12 on the...pdf Upload a Report Document, if any. The maximum file size for the Report Document is 50MB. Archival Publications (published) during reporting

Thermal energy storage to minimize cost and improve efficiency of a polygeneration district energy system in a real-time electricity market

DOE Office of Scientific and Technical Information (OSTI.GOV)

Powell, Kody M.; Kim, Jong Suk; Cole, Wesley J.

2016-10-01

District energy systems can produce low-cost utilities for large energy networks, but can also be a resource for the electric grid by their ability to ramp production or to store thermal energy by responding to real-time market signals. In this work, dynamic optimization exploits the flexibility of thermal energy storage by determining optimal times to store and extract excess energy. This concept is applied to a polygeneration distributed energy system with combined heat and power, district heating, district cooling, and chilled water thermal energy storage. The system is a university campus responsible for meeting the energy needs of tens ofmore » thousands of people. The objective for the dynamic optimization problem is to minimize cost over a 24-h period while meeting multiple loads in real time. The paper presents a novel algorithm to solve this dynamic optimization problem with energy storage by decomposing the problem into multiple static mixed-integer nonlinear programming (MINLP) problems. Another innovative feature of this work is the study of a large, complex energy network which includes the interrelations of a wide variety of energy technologies. Results indicate that a cost savings of 16.5% is realized when the system can participate in the wholesale electricity market.« less

Find_tfSBP: find thermodynamics-feasible and smallest balanced pathways with high yield from large-scale metabolic networks.

PubMed

Xu, Zixiang; Sun, Jibin; Wu, Qiaqing; Zhu, Dunming

2017-12-11

Biologically meaningful metabolic pathways are important references in the design of industrial bacterium. At present, constraint-based method is the only way to model and simulate a genome-scale metabolic network under steady-state criteria. Due to the inadequate assumption of the relationship in gene-enzyme-reaction as one-to-one unique association, computational difficulty or ignoring the yield from substrate to product, previous pathway finding approaches can't be effectively applied to find out the high yield pathways that are mass balanced in stoichiometry. In addition, the shortest pathways may not be the pathways with high yield. At the same time, a pathway, which exists in stoichiometry, may not be feasible in thermodynamics. By using mixed integer programming strategy, we put forward an algorithm to identify all the smallest balanced pathways which convert the source compound to the target compound in large-scale metabolic networks. The resulting pathways by our method can finely satisfy the stoichiometric constraints and non-decomposability condition. Especially, the functions of high yield and thermodynamics feasibility have been considered in our approach. This tool is tailored to direct the metabolic engineering practice to enlarge the metabolic potentials of industrial strains by integrating the extensive metabolic network information built from systems biology dataset.

Integer programming of cement distribution by train

NASA Astrophysics Data System (ADS)

Indarsih

2018-01-01

Cement industry in Central Java distributes cement by train to meet daily demand in Yogyakarta and Central Java area. There are five destination stations. For each destination station, there is a warehouse to load cements. Decision maker of cement industry have a plan to redesign the infrastructure and transportation system. The aim is to determine how many locomotives, train wagons, and containers and how to arrange train schedules with subject to the delivery time. For this purposes, we consider an integer programming to minimize the total of operational cost. Further, we will discuss a case study and the solution the problem can be calculated by LINGO software.

Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs

DOE PAGES

Gade, Dinakar; Hackebeil, Gabriel; Ryan, Sarah M.; ...

2016-04-02

We present a method for computing lower bounds in the progressive hedging algorithm (PHA) for two-stage and multi-stage stochastic mixed-integer programs. Computing lower bounds in the PHA allows one to assess the quality of the solutions generated by the algorithm contemporaneously. The lower bounds can be computed in any iteration of the algorithm by using dual prices that are calculated during execution of the standard PHA. In conclusion, we report computational results on stochastic unit commitment and stochastic server location problem instances, and explore the relationship between key PHA parameters and the quality of the resulting lower bounds.

An integer programming model for distal humerus fracture fixation planning.

PubMed

Maratt, Joseph D; Peaks, Ya-Sin A; Doro, Lisa Case; Karunakar, Madhav A; Hughes, Richard E

2008-05-01

To demonstrate the feasibility of an integer programming model to assist in pre-operative planning for open reduction and internal fixation of a distal humerus fracture. We describe an integer programming model based on the objective of maximizing the reward for screws placed while satisfying the requirements for sound internal fixation. The model maximizes the number of bicortical screws placed while avoiding screw collision and favoring screws of greater length that cross multiple fracture planes. The model was tested on three types of total articular fractures of the distal humerus. Solutions were generated using 5, 9, 21 and 33 possible screw orientations per hole. Solutions generated using 33 possible screw orientations per hole and five screw lengths resulted in the most clinically relevant fixation plan and required the calculation of 1,191,975 pairs of screws that resulted in collision. At this level of complexity, the pre-processor took 104 seconds to generate the constraints for the solver, and a solution was generated in under one minute in all three cases. Despite the large size of this problem, it can be solved in a reasonable amount of time, making use of the model practical in pre-surgical planning.

Mixed-Integer Conic Linear Programming: Challenges and Perspectives

DTIC Science & Technology

2013-10-01

The novel DCCs for MISOCO may be used in branch- and-cut algorithms when solving MISOCO problems. The experimental software CICLO was developed to...perform limited, but rigorous computational experiments. The CICLO solver utilizes continuous SOCO solvers, MOSEK, CPLES or SeDuMi, builds on the open...submitted Fall 2013. Software: 1. CICLO : Integer conic linear optimization package. Authors: J.C. Góez, T.K. Ralphs, Y. Fu, and T. Terlaky

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

PubMed

Song, Hyun-Seob; Goldberg, Noam; Mahajan, Ashutosh; Ramkrishna, Doraiswami

2017-08-01

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). 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. The software is implemented in Matlab, and is provided as supplementary information . hyunseob.song@pnnl.gov. Supplementary data are available at Bioinformatics online. Published by Oxford University Press 2017. This work is written by US Government employees and are in the public domain in the US.

Mixed Integer Programming Model and Incremental Optimization for Delivery and Storage Planning Using Truck Terminals

NASA Astrophysics Data System (ADS)

Sakakibara, Kazutoshi; Tian, Yajie; Nishikawa, Ikuko

We discuss the planning of transportation by trucks over a multi-day period. Each truck collects loads from suppliers and delivers them to assembly plants or a truck terminal. By exploiting the truck terminal as a temporal storage, we aim to increase the load ratio of each truck and to minimize the lead time for transportation. In this paper, we show a mixed integer programming model which represents each product explicitly, and discuss the decomposition of the problem into a problem of delivery and storage, and a problem of vehicle routing. Based on this model, we propose a relax-and-fix type heuristic in which decision variables are fixed one by one by mathematical programming techniques such as branch-and-bound methods.

A chance-constrained stochastic approach to intermodal container routing problems.

PubMed

Zhao, Yi; Liu, Ronghui; Zhang, Xi; Whiteing, Anthony

2018-01-01

We consider a container routing problem with stochastic time variables in a sea-rail intermodal transportation system. The problem is formulated as a binary integer chance-constrained programming model including stochastic travel times and stochastic transfer time, with the objective of minimising the expected total cost. Two chance constraints are proposed to ensure that the container service satisfies ship fulfilment and cargo on-time delivery with pre-specified probabilities. A hybrid heuristic algorithm is employed to solve the binary integer chance-constrained programming model. Two case studies are conducted to demonstrate the feasibility of the proposed model and to analyse the impact of stochastic variables and chance-constraints on the optimal solution and total cost.

A chance-constrained stochastic approach to intermodal container routing problems

PubMed Central

Zhao, Yi; Zhang, Xi; Whiteing, Anthony

2018-01-01

We consider a container routing problem with stochastic time variables in a sea-rail intermodal transportation system. The problem is formulated as a binary integer chance-constrained programming model including stochastic travel times and stochastic transfer time, with the objective of minimising the expected total cost. Two chance constraints are proposed to ensure that the container service satisfies ship fulfilment and cargo on-time delivery with pre-specified probabilities. A hybrid heuristic algorithm is employed to solve the binary integer chance-constrained programming model. Two case studies are conducted to demonstrate the feasibility of the proposed model and to analyse the impact of stochastic variables and chance-constraints on the optimal solution and total cost. PMID:29438389

Edit distance for marked point processes revisited: An implementation by binary integer programming

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hirata, Yoshito; Aihara, Kazuyuki

2015-12-15

We implement the edit distance for marked point processes [Suzuki et al., Int. J. Bifurcation Chaos 20, 3699–3708 (2010)] as a binary integer program. Compared with the previous implementation using minimum cost perfect matching, the proposed implementation has two advantages: first, by using the proposed implementation, we can apply a wide variety of software and hardware, even spin glasses and coherent ising machines, to calculate the edit distance for marked point processes; second, the proposed implementation runs faster than the previous implementation when the difference between the numbers of events in two time windows for a marked point process ismore » large.« less

SSP: an interval integer linear programming for de novo transcriptome assembly and isoform discovery of RNA-seq reads.

PubMed

Safikhani, Zhaleh; Sadeghi, Mehdi; Pezeshk, Hamid; Eslahchi, Changiz

2013-01-01

Recent advances in the sequencing technologies have provided a handful of RNA-seq datasets for transcriptome analysis. However, reconstruction of full-length isoforms and estimation of the expression level of transcripts with a low cost are challenging tasks. We propose a novel de novo method named SSP that incorporates interval integer linear programming to resolve alternatively spliced isoforms and reconstruct the whole transcriptome from short reads. Experimental results show that SSP is fast and precise in determining different alternatively spliced isoforms along with the estimation of reconstructed transcript abundances. The SSP software package is available at http://www.bioinf.cs.ipm.ir/software/ssp. © 2013.

A Mixed Integer Linear Programming Approach to Electrical Stimulation Optimization Problems.

PubMed

Abouelseoud, Gehan; Abouelseoud, Yasmine; Shoukry, Amin; Ismail, Nour; Mekky, Jaidaa

2018-02-01

Electrical stimulation optimization is a challenging problem. Even when a single region is targeted for excitation, the problem remains a constrained multi-objective optimization problem. The constrained nature of the problem results from safety concerns while its multi-objectives originate from the requirement that non-targeted regions should remain unaffected. In this paper, we propose a mixed integer linear programming formulation that can successfully address the challenges facing this problem. Moreover, the proposed framework can conclusively check the feasibility of the stimulation goals. This helps researchers to avoid wasting time trying to achieve goals that are impossible under a chosen stimulation setup. The superiority of the proposed framework over alternative methods is demonstrated through simulation examples.

Integer Linear Programming in Computational Biology

NASA Astrophysics Data System (ADS)

Althaus, Ernst; Klau, Gunnar W.; Kohlbacher, Oliver; Lenhof, Hans-Peter; Reinert, Knut

Computational molecular biology (bioinformatics) is a young research field that is rich in NP-hard optimization problems. The problem instances encountered are often huge and comprise thousands of variables. Since their introduction into the field of bioinformatics in 1997, integer linear programming (ILP) techniques have been successfully applied to many optimization problems. These approaches have added much momentum to development and progress in related areas. In particular, ILP-based approaches have become a standard optimization technique in bioinformatics. In this review, we present applications of ILP-based techniques developed by members and former members of Kurt Mehlhorn’s group. These techniques were introduced to bioinformatics in a series of papers and popularized by demonstration of their effectiveness and potential.

Integer programming applications: Bond trading, mortgage backed security financing, and FASB 115 accounting

DOE Office of Scientific and Technical Information (OSTI.GOV)

Nauss, R.

1994-12-31

In this review we describe three integer programming applications involving fixed income securities. A bond trading model is presented that features a number of possible different objectives and collections of constraints including future interest rate scenarios. A mortgage backed security (MBS) financing model that accounts for potential defaults in the MBS is also presented. Finally we describe an approach to allocate collections of bank securities into three categories: hold to maturity, available for sale, or trading. Placement of securities in these categories affects the capital, net income, and liquidity of a bank according to new accounting rules promulgated by themore » Financial Accounting Standards Board.« less

Intelligent Tutoring for Programming Tasks: Using Plan Analysis to Generate Better Hints.

DTIC Science & Technology

1982-03-01

construction and execution of a BASIC proqram that assiqns an integer value to a variable and then prints the value of that integer. - ARTICHOKE : assign...the string " ARTICHOKE " to a string variable, assiqn the value of that variable to a second variable, and print the second variable. -SINOP: qet two...the first five tasks: GREENFLAG, ARTICHOKE , SINOP, NINOP, and TWOS. Because the protocols are very lonq, it was necessary to condense them into a

Determining the Surface-to-Air Missile Requirement for Western and Southern Part of the Turkish Air Defense System

DTIC Science & Technology

2008-03-01

been shown to yield success in such applications as well. ( Daskin ,1995). LP optimization, matrix row reduction, a combination of both, or cutting...integer solution (Current, 2002). If the LP relaxation of the SCLP results in a fractional solution, Current, Daskin , and Schilling (2002) recommend...coverage for a given number of SAM sites. The model is formulated as an integer program, and the LINGO 10 software package is used to solve the model

Aerospace applications of integer and combinatorial optimization

NASA Technical Reports Server (NTRS)

Padula, S. L.; Kincaid, R. K.

1995-01-01

Research supported by NASA Langley Research Center includes many applications of aerospace design optimization and is conducted by teams of applied mathematicians and aerospace engineers. This paper investigates the benefits from this combined expertise in solving combinatorial optimization problems. Applications range from the design of large space antennas to interior noise control. A typical problem, for example, seeks the optimal locations for vibration-damping devices on a large space structure and is expressed as a mixed/integer linear programming problem with more than 1500 design variables.

Results of the Clarus Regional Demonstrations : Evaluation of Enhanced Road Weather Forecasting

DOT National Transportation Integrated Search

2012-01-01

The Clarus Initiative is a research effort of the U.S. Department of Transportation Intelligent Transportation Systems Joint Program Office and the Federal Highway Administrations Road Weather Management Program to develop and demonstrate an integ...

Determining on-fault earthquake magnitude distributions from integer programming

NASA Astrophysics Data System (ADS)

Geist, Eric L.; Parsons, Tom

2018-02-01

Earthquake magnitude distributions among faults within a fault system are determined from regional seismicity and fault slip rates using binary integer programming. A synthetic earthquake catalog (i.e., list of randomly sampled magnitudes) that spans millennia is first formed, assuming that regional seismicity follows a Gutenberg-Richter relation. Each earthquake in the synthetic catalog can occur on any fault and at any location. The objective is to minimize misfits in the target slip rate for each fault, where slip for each earthquake is scaled from its magnitude. The decision vector consists of binary variables indicating which locations are optimal among all possibilities. Uncertainty estimates in fault slip rates provide explicit upper and lower bounding constraints to the problem. An implicit constraint is that an earthquake can only be located on a fault if it is long enough to contain that earthquake. A general mixed-integer programming solver, consisting of a number of different algorithms, is used to determine the optimal decision vector. A case study is presented for the State of California, where a 4 kyr synthetic earthquake catalog is created and faults with slip ≥3 mm/yr are considered, resulting in >106 variables. The optimal magnitude distributions for each of the faults in the system span a rich diversity of shapes, ranging from characteristic to power-law distributions.

Operations research applications in nuclear energy

NASA Astrophysics Data System (ADS)

Johnson, Benjamin Lloyd

This dissertation consists of three papers; the first is published in Annals of Operations Research, the second is nearing submission to INFORMS Journal on Computing, and the third is the predecessor of a paper nearing submission to Progress in Nuclear Energy. We apply operations research techniques to nuclear waste disposal and nuclear safeguards. Although these fields are different, they allow us to showcase some benefits of using operations research techniques to enhance nuclear energy applications. The first paper, "Optimizing High-Level Nuclear Waste Disposal within a Deep Geologic Repository," presents a mixed-integer programming model that determines where to place high-level nuclear waste packages in a deep geologic repository to minimize heat load concentration. We develop a heuristic that increases the size of solvable model instances. The second paper, "Optimally Configuring a Measurement System to Detect Diversions from a Nuclear Fuel Cycle," introduces a simulation-optimization algorithm and an integer-programming model to find the best, or near-best, resource-limited nuclear fuel cycle measurement system with a high degree of confidence. Given location-dependent measurement method precisions, we (i) optimize the configuration of n methods at n locations of a hypothetical nuclear fuel cycle facility, (ii) find the most important location at which to improve method precision, and (iii) determine the effect of measurement frequency on near-optimal configurations and objective values. Our results correspond to existing outcomes but we obtain them at least an order of magnitude faster. The third paper, "Optimizing Nuclear Material Control and Accountability Measurement Systems," extends the integer program from the second paper to locate measurement methods in a larger, hypothetical nuclear fuel cycle scenario given fixed purchase and utilization budgets. This paper also presents two mixed-integer quadratic programming models to increase the precision of existing methods given a fixed improvement budget and to reduce the measurement uncertainty in the system while limiting improvement costs. We quickly obtain similar or better solutions compared to several intuitive analyses that take much longer to perform.

Investigating Integer Restrictions in Linear Programming

ERIC Educational Resources Information Center

Edwards, Thomas G.; Chelst, Kenneth R.; Principato, Angela M.; Wilhelm, Thad L.

2015-01-01

Linear programming (LP) is an application of graphing linear systems that appears in many Algebra 2 textbooks. Although not explicitly mentioned in the Common Core State Standards for Mathematics, linear programming blends seamlessly into modeling with mathematics, the fourth Standard for Mathematical Practice (CCSSI 2010, p. 7). In solving a…

The Retrofit Puzzle Extended: Optimal Fleet Owner Behavior over Multiple Time Periods

DOT National Transportation Integrated Search

2009-08-04

In "The Retrofit Puzzle: Optimal Fleet Owner Behavior in the Context of Diesel Retrofit Incentive Programs" (1) an integer program was developed to model profit-maximizing diesel fleet owner behavior when selecting pollution reduction retrofits. Flee...

NEWTONP - CUMULATIVE BINOMIAL PROGRAMS

NASA Technical Reports Server (NTRS)

Bowerman, P. N.

1994-01-01

The cumulative binomial program, NEWTONP, is one of a set of three programs which calculate cumulative binomial probability distributions for arbitrary inputs. The three programs, NEWTONP, CUMBIN (NPO-17555), and CROSSER (NPO-17557), can be used independently of one another. NEWTONP can be used by statisticians and users of statistical procedures, test planners, designers, and numerical analysts. The program has been used for reliability/availability calculations. NEWTONP calculates the probably p required to yield a given system reliability V for a k-out-of-n system. It can also be used to determine the Clopper-Pearson confidence limits (either one-sided or two-sided) for the parameter p of a Bernoulli distribution. NEWTONP can determine Bayesian probability limits for a proportion (if the beta prior has positive integer parameters). It can determine the percentiles of incomplete beta distributions with positive integer parameters. It can also determine the percentiles of F distributions and the midian plotting positions in probability plotting. NEWTONP is designed to work well with all integer values 0 < k <= n. To run the program, the user simply runs the executable version and inputs the information requested by the program. NEWTONP is not designed to weed out incorrect inputs, so the user must take care to make sure the inputs are correct. Once all input has been entered, the program calculates and lists the result. It also lists the number of iterations of Newton's method required to calculate the answer within the given error. The NEWTONP program is written in C. It was developed on an IBM AT with a numeric co-processor using Microsoft C 5.0. Because the source code is written using standard C structures and functions, it should compile correctly with most C compilers. The program format is interactive. It has been implemented under DOS 3.2 and has a memory requirement of 26K. NEWTONP was developed in 1988.

HAL/S programmer's guide. [space shuttle flight software language

NASA Technical Reports Server (NTRS)

Newbold, P. M.; Hotz, R. L.

1974-01-01

HAL/S is a programming language developed to satisfy the flight software requirements for the space shuttle program. The user's guide explains pertinent language operating procedures and described the various HAL/S facilities for manipulating integer, scalar, vector, and matrix data types.

Are you ready? Managing transportation resources through the Y2K weekend

DOT National Transportation Integrated Search

2011-01-01

The Clarus Initiative, a joint effort of the U.S. Department of Transportation Intelligent Transportation Systems (ITS) Joint Program Office and FHWAs Road Weather Management Program (RWMP), is a six-year effort to develop and demonstrate an integ...

Inexact fuzzy-stochastic mixed-integer programming approach for long-term planning of waste management--Part A: methodology.

PubMed

Guo, P; Huang, G H

2009-01-01

In this study, an inexact fuzzy chance-constrained two-stage mixed-integer linear programming (IFCTIP) approach is proposed for supporting long-term planning of waste-management systems under multiple uncertainties in the City of Regina, Canada. The method improves upon the existing inexact two-stage programming and mixed-integer linear programming techniques by incorporating uncertainties expressed as multiple uncertainties of intervals and dual probability distributions within a general optimization framework. The developed method can provide an effective linkage between the predefined environmental policies and the associated economic implications. Four special characteristics of the proposed method make it unique compared with other optimization techniques that deal with uncertainties. Firstly, it provides a linkage to predefined policies that have to be respected when a modeling effort is undertaken; secondly, it is useful for tackling uncertainties presented as intervals, probabilities, fuzzy sets and their incorporation; thirdly, it facilitates dynamic analysis for decisions of facility-expansion planning and waste-flow allocation within a multi-facility, multi-period, multi-level, and multi-option context; fourthly, the penalties are exercised with recourse against any infeasibility, which permits in-depth analyses of various policy scenarios that are associated with different levels of economic consequences when the promised solid waste-generation rates are violated. In a companion paper, the developed method is applied to a real case for the long-term planning of waste management in the City of Regina, Canada.

A Space-Time Network-Based Modeling Framework for Dynamic Unmanned Aerial Vehicle Routing in Traffic Incident Monitoring Applications

PubMed Central

Zhang, Jisheng; Jia, Limin; Niu, Shuyun; Zhang, Fan; Tong, Lu; Zhou, Xuesong

2015-01-01

It is essential for transportation management centers to equip and manage a network of fixed and mobile sensors in order to quickly detect traffic incidents and further monitor the related impact areas, especially for high-impact accidents with dramatic traffic congestion propagation. As emerging small Unmanned Aerial Vehicles (UAVs) start to have a more flexible regulation environment, it is critically important to fully explore the potential for of using UAVs for monitoring recurring and non-recurring traffic conditions and special events on transportation networks. This paper presents a space-time network- based modeling framework for integrated fixed and mobile sensor networks, in order to provide a rapid and systematic road traffic monitoring mechanism. By constructing a discretized space-time network to characterize not only the speed for UAVs but also the time-sensitive impact areas of traffic congestion, we formulate the problem as a linear integer programming model to minimize the detection delay cost and operational cost, subject to feasible flying route constraints. A Lagrangian relaxation solution framework is developed to decompose the original complex problem into a series of computationally efficient time-dependent and least cost path finding sub-problems. Several examples are used to demonstrate the results of proposed models in UAVs’ route planning for small and medium-scale networks. PMID:26076404

High Penetration of Electrical Vehicles in Microgrids: Threats and Opportunities

NASA Astrophysics Data System (ADS)

Khederzadeh, Mojtaba; Khalili, Mohammad

2014-10-01

Given that the microgrid concept is the building block of future electric distribution systems and electrical vehicles (EVs) are the future of transportation market, in this paper, the impact of EVs on the performance of microgrids is investigated. Demand-side participation is used to cope with increasing demand for EV charging. The problem of coordination of EV charging and discharging (with vehicle-to-grid (V2G) functionality) and demand response is formulated as a market-clearing mechanism that accepts bids from the demand and supply sides and takes into account the constraints put forward by different parts. Therefore, a day-ahead market with detailed bids and offers within the microgrid is designed whose objective is to maximize the social welfare which is the difference between the value that consumers attach to the electrical energy they buy plus the benefit of the EV owners participating in the V2G functionality and the cost of producing/purchasing this energy. As the optimization problem is a mixed integer nonlinear programming one, it is decomposed into one master problem for energy scheduling and one subproblem for power flow computation. The two problems are solved iteratively by interfacing MATLAB with GAMS. Simulation results on a sample microgrid with different residential, commercial and industrial consumers with associated demand-side biddings and different penetration level of EVs support the proposed formulation of the problem and the applied methods.

Characterization of Deficiencies in the Frequency Domain Forced Response Analysis Technique for Turbine Bladed Disks

NASA Technical Reports Server (NTRS)

Brown, Andrew M.; Schmauch, Preston

2012-01-01

Turbine blades in rocket and jet engine turbomachinery experience enormous harmonic loading conditions. These loads result from the integer number of upstream and downstream stator vanes as well as the other turbine stages. The standard technique for forced response analysis to assess structural integrity is to decompose a CFD generated flow field into its harmonic components, and to then perform a frequency response analysis at the problematic natural frequencies. Recent CFD analysis and water-flow testing at NASA/MSFC, though, indicates that this technique may miss substantial harmonic and non-harmonic excitation sources that become present in complex flows. These complications suggest the question of whether frequency domain analysis is capable of capturing the excitation content sufficiently. Two studies comparing frequency response analysis with transient response analysis, therefore, have been performed. The first is of a bladed disk with each blade modeled by simple beam elements. It was hypothesized that the randomness and other variation from the standard harmonic excitation would reduce the blade structural response, but the results showed little reduction. The second study was of a realistic model of a bladed-disk excited by the same CFD used in the J2X engine program. The results showed that the transient analysis results were up to 10% higher for "clean" nodal diameter excitations and six times larger for "messy" excitations, where substantial Fourier content around the main harmonic exists.

GLOBAL SOLUTIONS TO FOLDED CONCAVE PENALIZED NONCONVEX LEARNING

PubMed Central

Liu, Hongcheng; Yao, Tao; Li, Runze

2015-01-01

This paper is concerned with solving nonconvex learning problems with folded concave penalty. Despite that their global solutions entail desirable statistical properties, there lack optimization techniques that guarantee global optimality in a general setting. In this paper, we show that a class of nonconvex learning problems are equivalent to general quadratic programs. This equivalence facilitates us in developing mixed integer linear programming reformulations, which admit finite algorithms that find a provably global optimal solution. We refer to this reformulation-based technique as the mixed integer programming-based global optimization (MIPGO). To our knowledge, this is the first global optimization scheme with a theoretical guarantee for folded concave penalized nonconvex learning with the SCAD penalty (Fan and Li, 2001) and the MCP penalty (Zhang, 2010). Numerical results indicate a significant outperformance of MIPGO over the state-of-the-art solution scheme, local linear approximation, and other alternative solution techniques in literature in terms of solution quality. PMID:27141126

RSM 1.0 user's guide: A resupply scheduler using integer optimization

NASA Technical Reports Server (NTRS)

Viterna, Larry A.; Green, Robert D.; Reed, David M.

1991-01-01

The Resupply Scheduling Model (RSM) is a PC based, fully menu-driven computer program. It uses integer programming techniques to determine an optimum schedule to replace components on or before a fixed replacement period, subject to user defined constraints such as transportation mass and volume limits or available repair crew time. Principal input for RSJ includes properties such as mass and volume and an assembly sequence. Resource constraints are entered for each period corresponding to the component properties. Though written to analyze the electrical power system on the Space Station Freedom, RSM is quite general and can be used to model the resupply of almost any system subject to user defined resource constraints. Presented here is a step by step procedure for preparing the input, performing the analysis, and interpreting the results. Instructions for installing the program and information on the algorithms are given.

An integer programming approach to a real-world recyclable waste collection problem in Argentina.

PubMed

Braier, Gustavo; Durán, Guillermo; Marenco, Javier; Wesner, Francisco

2017-05-01

This article reports on the use of mathematical programming techniques to optimise the routes of a recyclable waste collection system servicing Morón, a large municipality outside Buenos Aires, Argentina. The truck routing problem posed by the system is a particular case of the generalised directed open rural postman problem. An integer programming model is developed with a solving procedure built around a subtour-merging algorithm and the addition of subtour elimination constraints. The route solutions generated by the proposed methodology perform significantly better than the previously used, manually designed routes, the main improvement being that coverage of blocks within the municipality with the model solutions is 100% by construction, whereas with the manual routes as much as 16% of the blocks went unserviced. The model-generated routes were adopted by the municipality in 2014 and the national government is planning to introduce the methodology elsewhere in the country.

Mixed integer nonlinear programming model of wireless pricing scheme with QoS attribute of bandwidth and end-to-end delay

NASA Astrophysics Data System (ADS)

Irmeilyana, Puspita, Fitri Maya; Indrawati

2016-02-01

The pricing for wireless networks is developed by considering linearity factors, elasticity price and price factors. Mixed Integer Nonlinear Programming of wireless pricing model is proposed as the nonlinear programming problem that can be solved optimally using LINGO 13.0. The solutions are expected to give some information about the connections between the acceptance factor and the price. Previous model worked on the model that focuses on bandwidth as the QoS attribute. The models attempt to maximize the total price for a connection based on QoS parameter. The QoS attributes used will be the bandwidth and the end to end delay that affect the traffic. The maximum goal to maximum price is achieved when the provider determine the requirement for the increment or decrement of price change due to QoS change and amount of QoS value.

Synchronizable Series Expressions. Part 2. Overview of the Theory and Implementation.

DTIC Science & Technology

1987-11-01

more running time than shown in the table. because time is eventually required in order to collect the garbage it creates. Program Running ’rime Garbage...possible to simply put an enumerator where it is used.) (loop for x integer from I to 4 collect x) - (lotS* ((x (Eup I :to 4))) (declare (type integer x...below. (loop for x from 1 to 4 and for y = 0 then (1- x) collect (list x y)) - (lotS* ((x (Eup 1 :to 4)) (y (Tprevious (1- x) 0))) (Rlist (list x y

Papers on Program Testing,

DTIC Science & Technology

1979-01-01

tractability for scientific analysis. Although much remains to be learned about mutation as a testing tool, there is a considerable body of written material...explicitly address classifications (2) may not have been affected at all! In general, the and (3) in this article , except to point out that even relative...34 ARTICLE B=B’B C IN CACM 1971). C=C*02 INTEGER AiN),N.F D=B+C INTEGER M.NS.R.I.J.W IF (A.NE.D) GOTO 200 MI PRINT 150 NS=N 150 FORMATIIH .RIGHT ANGLED

ALPS - A LINEAR PROGRAM SOLVER

NASA Technical Reports Server (NTRS)

Viterna, L. A.

1994-01-01

Linear programming is a widely-used engineering and management tool. Scheduling, resource allocation, and production planning are all well-known applications of linear programs (LP's). Most LP's are too large to be solved by hand, so over the decades many computer codes for solving LP's have been developed. ALPS, A Linear Program Solver, is a full-featured LP analysis program. ALPS can solve plain linear programs as well as more complicated mixed integer and pure integer programs. ALPS also contains an efficient solution technique for pure binary (0-1 integer) programs. One of the many weaknesses of LP solvers is the lack of interaction with the user. ALPS is a menu-driven program with no special commands or keywords to learn. In addition, ALPS contains a full-screen editor to enter and maintain the LP formulation. These formulations can be written to and read from plain ASCII files for portability. For those less experienced in LP formulation, ALPS contains a problem "parser" which checks the formulation for errors. ALPS creates fully formatted, readable reports that can be sent to a printer or output file. ALPS is written entirely in IBM's APL2/PC product, Version 1.01. The APL2 workspace containing all the ALPS code can be run on any APL2/PC system (AT or 386). On a 32-bit system, this configuration can take advantage of all extended memory. The user can also examine and modify the ALPS code. The APL2 workspace has also been "packed" to be run on any DOS system (without APL2) as a stand-alone "EXE" file, but has limited memory capacity on a 640K system. A numeric coprocessor (80X87) is optional but recommended. The standard distribution medium for ALPS is a 5.25 inch 360K MS-DOS format diskette. IBM, IBM PC and IBM APL2 are registered trademarks of International Business Machines Corporation. MS-DOS is a registered trademark of Microsoft Corporation.

The Capability Portfolio Analysis Tool (CPAT): A Mixed Integer Linear Programming Formulation for Fleet Modernization Analysis (Version 2.0.2).

DOE Office of Scientific and Technical Information (OSTI.GOV)

Waddell, Lucas; Muldoon, Frank; Henry, Stephen Michael

In order to effectively plan the management and modernization of their large and diverse fleets of vehicles, Program Executive Office Ground Combat Systems (PEO GCS) and Program Executive Office Combat Support and Combat Service Support (PEO CS&CSS) commis- sioned the development of a large-scale portfolio planning optimization tool. This software, the Capability Portfolio Analysis Tool (CPAT), creates a detailed schedule that optimally prioritizes the modernization or replacement of vehicles within the fleet - respecting numerous business rules associated with fleet structure, budgets, industrial base, research and testing, etc., while maximizing overall fleet performance through time. This paper contains a thor-more » ough documentation of the terminology, parameters, variables, and constraints that comprise the fleet management mixed integer linear programming (MILP) mathematical formulation. This paper, which is an update to the original CPAT formulation document published in 2015 (SAND2015-3487), covers the formulation of important new CPAT features.« less

Obtaining identical results with double precision global accuracy on different numbers of processors in parallel particle Monte Carlo simulations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cleveland, Mathew A., E-mail: cleveland7@llnl.gov; Brunner, Thomas A.; Gentile, Nicholas A.

2013-10-15

We describe and compare different approaches for achieving numerical reproducibility in photon Monte Carlo simulations. Reproducibility is desirable for code verification, testing, and debugging. Parallelism creates a unique problem for achieving reproducibility in Monte Carlo simulations because it changes the order in which values are summed. This is a numerical problem because double precision arithmetic is not associative. Parallel Monte Carlo, both domain replicated and decomposed simulations, will run their particles in a different order during different runs of the same simulation because the non-reproducibility of communication between processors. In addition, runs of the same simulation using different domain decompositionsmore » will also result in particles being simulated in a different order. In [1], a way of eliminating non-associative accumulations using integer tallies was described. This approach successfully achieves reproducibility at the cost of lost accuracy by rounding double precision numbers to fewer significant digits. This integer approach, and other extended and reduced precision reproducibility techniques, are described and compared in this work. Increased precision alone is not enough to ensure reproducibility of photon Monte Carlo simulations. Non-arbitrary precision approaches require a varying degree of rounding to achieve reproducibility. For the problems investigated in this work double precision global accuracy was achievable by using 100 bits of precision or greater on all unordered sums which where subsequently rounded to double precision at the end of every time-step.« less

An improved exploratory search technique for pure integer linear programming problems

NASA Technical Reports Server (NTRS)

Fogle, F. R.

1990-01-01

The development is documented of a heuristic method for the solution of pure integer linear programming problems. The procedure draws its methodology from the ideas of Hooke and Jeeves type 1 and 2 exploratory searches, greedy procedures, and neighborhood searches. It uses an efficient rounding method to obtain its first feasible integer point from the optimal continuous solution obtained via the simplex method. Since this method is based entirely on simple addition or subtraction of one to each variable of a point in n-space and the subsequent comparison of candidate solutions to a given set of constraints, it facilitates significant complexity improvements over existing techniques. It also obtains the same optimal solution found by the branch-and-bound technique in 44 of 45 small to moderate size test problems. Two example problems are worked in detail to show the inner workings of the method. Furthermore, using an established weighted scheme for comparing computational effort involved in an algorithm, a comparison of this algorithm is made to the more established and rigorous branch-and-bound method. A computer implementation of the procedure, in PC compatible Pascal, is also presented and discussed.

Determining on-fault earthquake magnitude distributions from integer programming

USGS Publications Warehouse

Geist, Eric L.; Parsons, Thomas E.

2018-01-01

Earthquake magnitude distributions among faults within a fault system are determined from regional seismicity and fault slip rates using binary integer programming. A synthetic earthquake catalog (i.e., list of randomly sampled magnitudes) that spans millennia is first formed, assuming that regional seismicity follows a Gutenberg-Richter relation. Each earthquake in the synthetic catalog can occur on any fault and at any location. The objective is to minimize misfits in the target slip rate for each fault, where slip for each earthquake is scaled from its magnitude. The decision vector consists of binary variables indicating which locations are optimal among all possibilities. Uncertainty estimates in fault slip rates provide explicit upper and lower bounding constraints to the problem. An implicit constraint is that an earthquake can only be located on a fault if it is long enough to contain that earthquake. A general mixed-integer programming solver, consisting of a number of different algorithms, is used to determine the optimal decision vector. A case study is presented for the State of California, where a 4 kyr synthetic earthquake catalog is created and faults with slip ≥3 mm/yr are considered, resulting in >106  variables. The optimal magnitude distributions for each of the faults in the system span a rich diversity of shapes, ranging from characteristic to power-law distributions. 

Selection of actuator locations for static shape control of large space structures by heuristic integer programing

NASA Technical Reports Server (NTRS)

Haftka, R. T.; Adelman, H. M.

1984-01-01

Orbiting spacecraft such as large space antennas have to maintain a highly accurate space to operate satisfactorily. Such structures require active and passive controls to mantain an accurate shape under a variety of disturbances. Methods for the optimum placement of control actuators for correcting static deformations are described. In particular, attention is focused on the case were control locations have to be selected from a large set of available sites, so that integer programing methods are called for. The effectiveness of three heuristic techniques for obtaining a near-optimal site selection is compared. In addition, efficient reanalysis techniques for the rapid assessment of control effectiveness are presented. Two examples are used to demonstrate the methods: a simple beam structure and a 55m space-truss-parabolic antenna.

Developing optimal nurses work schedule using integer programming

NASA Astrophysics Data System (ADS)

Shahidin, Ainon Mardhiyah; Said, Mohd Syazwan Md; Said, Noor Hizwan Mohamad; Sazali, Noor Izatie Amaliena

2017-08-01

Time management is the art of arranging, organizing and scheduling one's time for the purpose of generating more effective work and productivity. Scheduling is the process of deciding how to commit resources between varieties of possible tasks. Thus, it is crucial for every organization to have a good work schedule for their staffs. The job of Ward nurses at hospitals runs for 24 hours every day. Therefore, nurses will be working using shift scheduling. This study is aimed to solve the nurse scheduling problem at an emergency ward of a private hospital. A 7-day work schedule for 7 consecutive weeks satisfying all the constraints set by the hospital will be developed using Integer Programming. The work schedule for the nurses obtained gives an optimal solution where all the constraints are being satisfied successfully.

An Integer Programming Model For Solving Heterogeneous Vehicle Routing Problem With Hard Time Window considering Service Choice

NASA Astrophysics Data System (ADS)

Susilawati, Enny; Mawengkang, Herman; Efendi, Syahril

2018-01-01

Generally a Vehicle Routing Problem with time windows (VRPTW) can be defined as a problem to determine the optimal set of routes used by a fleet of vehicles to serve a given set of customers with service time restrictions; the objective is to minimize the total travel cost (related to the travel times or distances) and operational cost (related to the number of vehicles used). In this paper we address a variant of the VRPTW in which the fleet of vehicle is heterogenic due to the different size of demand from customers. The problem, called Heterogeneous VRP (HVRP) also includes service levels. We use integer programming model to describe the problem. A feasible neighbourhood approach is proposed to solve the model.

A solution procedure for mixed-integer nonlinear programming formulation of supply chain planning with quantity discounts under demand uncertainty

NASA Astrophysics Data System (ADS)

Yin, Sisi; Nishi, Tatsushi

2014-11-01

Quantity discount policy is decision-making for trade-off prices between suppliers and manufacturers while production is changeable due to demand fluctuations in a real market. In this paper, quantity discount models which consider selection of contract suppliers, production quantity and inventory simultaneously are addressed. The supply chain planning problem with quantity discounts under demand uncertainty is formulated as a mixed-integer nonlinear programming problem (MINLP) with integral terms. We apply an outer-approximation method to solve MINLP problems. In order to improve the efficiency of the proposed method, the problem is reformulated as a stochastic model replacing the integral terms by using a normalisation technique. We present numerical examples to demonstrate the efficiency of the proposed method.

Advances in mixed-integer programming methods for chemical production scheduling.

PubMed

Velez, Sara; Maravelias, Christos T

2014-01-01

The goal of this paper is to critically review advances in the area of chemical production scheduling over the past three decades and then present two recently proposed solution methods that have led to dramatic computational enhancements. First, we present a general framework and problem classification and discuss modeling and solution methods with an emphasis on mixed-integer programming (MIP) techniques. Second, we present two solution methods: (a) a constraint propagation algorithm that allows us to compute parameters that are then used to tighten MIP scheduling models and (b) a reformulation that introduces new variables, thus leading to effective branching. We also present computational results and an example illustrating how these methods are implemented, as well as the resulting enhancements. We close with a discussion of open research challenges and future research directions.

A divide-and-conquer approach to determine the Pareto frontier for optimization of protein engineering experiments.

PubMed

He, Lu; Friedman, Alan M; Bailey-Kellogg, Chris

2012-03-01

In developing improved protein variants by site-directed mutagenesis or recombination, there are often competing objectives that must be considered in designing an experiment (selecting mutations or breakpoints): stability versus novelty, affinity versus specificity, activity versus immunogenicity, and so forth. Pareto optimal experimental designs make the best trade-offs between competing objectives. Such designs are not "dominated"; that is, no other design is better than a Pareto optimal design for one objective without being worse for another objective. Our goal is to produce all the Pareto optimal designs (the Pareto frontier), to characterize the trade-offs and suggest designs most worth considering, but to avoid explicitly considering the large number of dominated designs. To do so, we develop a divide-and-conquer algorithm, Protein Engineering Pareto FRontier (PEPFR), that hierarchically subdivides the objective space, using appropriate dynamic programming or integer programming methods to optimize designs in different regions. This divide-and-conquer approach is efficient in that the number of divisions (and thus calls to the optimizer) is directly proportional to the number of Pareto optimal designs. We demonstrate PEPFR with three protein engineering case studies: site-directed recombination for stability and diversity via dynamic programming, site-directed mutagenesis of interacting proteins for affinity and specificity via integer programming, and site-directed mutagenesis of a therapeutic protein for activity and immunogenicity via integer programming. We show that PEPFR is able to effectively produce all the Pareto optimal designs, discovering many more designs than previous methods. The characterization of the Pareto frontier provides additional insights into the local stability of design choices as well as global trends leading to trade-offs between competing criteria. Copyright © 2011 Wiley Periodicals, Inc.

Integer Optimization Model for a Logistic System based on Location-Routing Considering Distance and Chosen Route

NASA Astrophysics Data System (ADS)

Mulyasari, Joni; Mawengkang, Herman; Efendi, Syahril

2018-02-01

In a distribution network it is important to decide the locations of facilities that impacts not only the profitability of an organization but the ability to serve customers.Generally the location-routing problem is to minimize the overall cost by simultaneously selecting a subset of candidate facilities and constructing a set of delivery routes that satisfy some restrictions. In this paper we impose restriction on the route that should be passed for delivery. We use integer programming model to describe the problem. A feasible neighbourhood search is proposed to solve the result model.

A new Fortran 90 program to compute regular and irregular associated Legendre functions (new version announcement)

NASA Astrophysics Data System (ADS)

Schneider, Barry I.; Segura, Javier; Gil, Amparo; Guan, Xiaoxu; Bartschat, Klaus

2018-04-01

This is a revised and updated version of a modern Fortran 90 code to compute the regular Plm (x) and irregular Qlm (x) associated Legendre functions for all x ∈(- 1 , + 1) (on the cut) and | x | > 1 and integer degree (l) and order (m). The necessity to revise the code comes as a consequence of some comments of Prof. James Bremer of the UC//Davis Mathematics Department, who discovered that there were errors in the code for large integer degree and order for the normalized regular Legendre functions on the cut.

Modeling an integrated hospital management planning problem using integer optimization approach

NASA Astrophysics Data System (ADS)

Sitepu, Suryati; Mawengkang, Herman; Irvan

2017-09-01

Hospital is a very important institution to provide health care for people. It is not surprising that nowadays the people’s demands for hospital is increasing. However, due to the rising cost of healthcare services, hospitals need to consider efficiencies in order to overcome these two problems. This paper deals with an integrated strategy of staff capacity management and bed allocation planning to tackle these problems. Mathematically, the strategy can be modeled as an integer linear programming problem. We solve the model using a direct neighborhood search approach, based on the notion of superbasic variables.

Recent research in network problems with applications

NASA Technical Reports Server (NTRS)

Thompson, G. L.

1980-01-01

The capabilities of network codes and their extensions are surveyed in regard to specially structured integer programming problems which are solved by using the solutions of a series of ordinary network problems.

Integer programming model for optimizing bus timetable using genetic algorithm

NASA Astrophysics Data System (ADS)

Wihartiko, F. D.; Buono, A.; Silalahi, B. P.

2017-01-01

Bus timetable gave an information for passengers to ensure the availability of bus services. Timetable optimal condition happened when bus trips frequency could adapt and suit with passenger demand. In the peak time, the number of bus trips would be larger than the off-peak time. If the number of bus trips were more frequent than the optimal condition, it would make a high operating cost for bus operator. Conversely, if the number of trip was less than optimal condition, it would make a bad quality service for passengers. In this paper, the bus timetabling problem would be solved by integer programming model with modified genetic algorithm. Modification was placed in the chromosomes design, initial population recovery technique, chromosomes reconstruction and chromosomes extermination on specific generation. The result of this model gave the optimal solution with accuracy 99.1%.

Reconstructing cerebrovascular networks under local physiological constraints by integer programming

DOE PAGES

Rempfler, Markus; Schneider, Matthias; Ielacqua, Giovanna D.; ...

2015-04-23

We introduce a probabilistic approach to vessel network extraction that enforces physiological constraints on the vessel structure. The method accounts for both image evidence and geometric relationships between vessels by solving an integer program, which is shown to yield the maximum a posteriori (MAP) estimate to the probabilistic model. Starting from an over-connected network, it is pruning vessel stumps and spurious connections by evaluating the local geometry and the global connectivity of the graph. We utilize a high-resolution micro computed tomography (µCT) dataset of a cerebrovascular corrosion cast to obtain a reference network and learn the prior distributions of ourmore » probabilistic model. As a result, we perform experiments on micro magnetic resonance angiography (µMRA) images of mouse brains and discuss properties of the networks obtained under different tracking and pruning approaches.« less

FPGA Implementation of Optimal 3D-Integer DCT Structure for Video Compression

PubMed Central

2015-01-01

A novel optimal structure for implementing 3D-integer discrete cosine transform (DCT) is presented by analyzing various integer approximation methods. The integer set with reduced mean squared error (MSE) and high coding efficiency are considered for implementation in FPGA. The proposed method proves that the least resources are utilized for the integer set that has shorter bit values. Optimal 3D-integer DCT structure is determined by analyzing the MSE, power dissipation, coding efficiency, and hardware complexity of different integer sets. The experimental results reveal that direct method of computing the 3D-integer DCT using the integer set [10, 9, 6, 2, 3, 1, 1] performs better when compared to other integer sets in terms of resource utilization and power dissipation. PMID:26601120

Automated Simultaneous Assembly of Multistage Testlets for a High-Stakes Licensing Examination

ERIC Educational Resources Information Center

Breithaupt, Krista; Hare, Donovan R.

2007-01-01

Many challenges exist for high-stakes testing programs offering continuous computerized administration. The automated assembly of test questions to exactly meet content and other requirements, provide uniformity, and control item exposure can be modeled and solved by mixed-integer programming (MIP) methods. A case study of the computerized…

THREE-PEE SAMPLING THEORY and program 'THRP' for computer generation of selection criteria

Treesearch

L. R. Grosenbaugh

1965-01-01

Theory necessary for sampling with probability proportional to prediction ('three-pee,' or '3P,' sampling) is first developed and then exemplified by numerical comparisons of several estimators. Program 'T RP' for computer generation of appropriate 3P-sample-selection criteria is described, and convenient random integer dispensers are...

The checkpoint ordering problem

PubMed Central

Hungerländer, P.

2017-01-01

Abstract We suggest a new variant of a row layout problem: Find an ordering of n departments with given lengths such that the total weighted sum of their distances to a given checkpoint is minimized. The Checkpoint Ordering Problem (COP) is both of theoretical and practical interest. It has several applications and is conceptually related to some well-studied combinatorial optimization problems, namely the Single-Row Facility Layout Problem, the Linear Ordering Problem and a variant of parallel machine scheduling. In this paper we study the complexity of the (COP) and its special cases. The general version of the (COP) with an arbitrary but fixed number of checkpoints is NP-hard in the weak sense. We propose both a dynamic programming algorithm and an integer linear programming approach for the (COP) . Our computational experiments indicate that the (COP) is hard to solve in practice. While the run time of the dynamic programming algorithm strongly depends on the length of the departments, the integer linear programming approach is able to solve instances with up to 25 departments to optimality. PMID:29170574

Incorporation of Fixed Installation Costs into Optimization of Groundwater Remediation with a New Efficient Surrogate Nonlinear Mixed Integer Optimization Algorithm

NASA Astrophysics Data System (ADS)

Shoemaker, Christine; Wan, Ying

2016-04-01

Optimization of nonlinear water resources management issues which have a mixture of fixed (e.g. construction cost for a well) and variable (e.g. cost per gallon of water pumped) costs has been not well addressed because prior algorithms for the resulting nonlinear mixed integer problems have required many groundwater simulations (with different configurations of decision variable), especially when the solution space is multimodal. In particular heuristic methods like genetic algorithms have often been used in the water resources area, but they require so many groundwater simulations that only small systems have been solved. Hence there is a need to have a method that reduces the number of expensive groundwater simulations. A recently published algorithm for nonlinear mixed integer programming using surrogates was shown in this study to greatly reduce the computational effort for obtaining accurate answers to problems involving fixed costs for well construction as well as variable costs for pumping because of a substantial reduction in the number of groundwater simulations required to obtain an accurate answer. Results are presented for a US EPA hazardous waste site. The nonlinear mixed integer surrogate algorithm is general and can be used on other problems arising in hydrology with open source codes in Matlab and python ("pySOT" in Bitbucket).

Conjunctive management of multi-reservoir network system and groundwater system

NASA Astrophysics Data System (ADS)

Mani, A.; Tsai, F. T. C.

2015-12-01

This study develops a successive mixed-integer linear fractional programming (successive MILFP) method to conjunctively manage water resources provided by a multi-reservoir network system and a groundwater system. The conjunctive management objectives are to maximize groundwater withdrawals and maximize reservoir storages while satisfying water demands and raising groundwater level to a target level. The decision variables in the management problem are reservoir releases and spills, network flows and groundwater pumping rates. Using the fractional programming approach, the objective function is defined as a ratio of total groundwater withdraws to total reservoir storage deficits from the maximum storages. Maximizing this ratio function tends to maximizing groundwater use and minimizing surface water use. This study introduces a conditional constraint on groundwater head in order to sustain aquifers from overpumping: if current groundwater level is less than a target level, groundwater head at the next time period has to be raised; otherwise, it is allowed to decrease up to a certain extent. This conditional constraint is formulated into a set of mixed binary nonlinear constraints and results in a mixed-integer nonlinear fractional programming (MINLFP) problem. To solve the MINLFP problem, we first use the response matrix approach to linearize groundwater head with respect to pumping rate and reduce the problem to an MILFP problem. Using the Charnes-Cooper transformation, the MILFP is transformed to an equivalent mixed-integer linear programming (MILP). The solution of the MILP is successively updated by updating the response matrix in every iteration. The study uses IBM CPLEX to solve the MILP problem. The methodology is applied to water resources management in northern Louisiana. This conjunctive management approach aims to recover the declining groundwater level of the stressed Sparta aquifer by using surface water from a network of four reservoirs as an alternative source of supply.

Calculating the Mean Amplitude of Glycemic Excursions from Continuous Glucose Data Using an Open-Code Programmable Algorithm Based on the Integer Nonlinear Method.

PubMed

Yu, Xuefei; Lin, Liangzhuo; Shen, Jie; Chen, Zhi; Jian, Jun; Li, Bin; Xin, Sherman Xuegang

2018-01-01

The mean amplitude of glycemic excursions (MAGE) is an essential index for glycemic variability assessment, which is treated as a key reference for blood glucose controlling at clinic. However, the traditional "ruler and pencil" manual method for the calculation of MAGE is time-consuming and prone to error due to the huge data size, making the development of robust computer-aided program an urgent requirement. Although several software products are available instead of manual calculation, poor agreement among them is reported. Therefore, more studies are required in this field. In this paper, we developed a mathematical algorithm based on integer nonlinear programming. Following the proposed mathematical method, an open-code computer program named MAGECAA v1.0 was developed and validated. The results of the statistical analysis indicated that the developed program was robust compared to the manual method. The agreement among the developed program and currently available popular software is satisfied, indicating that the worry about the disagreement among different software products is not necessary. The open-code programmable algorithm is an extra resource for those peers who are interested in the related study on methodology in the future.

Product-line selection and pricing with remanufacturing under availability constraints

NASA Astrophysics Data System (ADS)

Aras, Necati; Esenduran, G.÷k.‡e.; Altinel, I. Kuban

2004-12-01

Product line selection and pricing are two crucial decisions for the profitability of a manufacturing firm. Remanufacturing, on the other hand, may be a profitable strategy that captures the remaining value in used products. In this paper we develop a mixed-integer nonlinear programming model form the perspective of an original equipment manufacturer (OEM). The objective of the OEM is to select products to manufacture and remanufacture among a set of given alternatives and simultaneously determine their prices so as to maximize its profit. It is assumed that the probability a customer selects a product is proportional to its utility and inversely proportional to its price. The utility of a product is an increasing function of its perceived quality. In our base model, products are discriminated by their unit production costs and utilities. We also analyze a case where remanufacturing is limited by the available quantity of collected remanufacturable products. We show that the resulting problem is decomposed into the pricing and product line selection subproblems. Pricing problem is solved by a variant of the simplex search procedure which can also handle constraints, while complete enumeration and a genetic algorithm are used for the solution of the product line selection problem. A number of experiments are carried out to identify conditions under which it is economically viable for the firm to sell remanufactured products. We also determine the optimal utility and unit production cost values of a remanufactured product, which maximizes the total profit of the OEM.

Multi-task feature selection in microarray data by binary integer programming.

PubMed

Lan, Liang; Vucetic, Slobodan

2013-12-20

A major challenge in microarray classification is that the number of features is typically orders of magnitude larger than the number of examples. In this paper, we propose a novel feature filter algorithm to select the feature subset with maximal discriminative power and minimal redundancy by solving a quadratic objective function with binary integer constraints. To improve the computational efficiency, the binary integer constraints are relaxed and a low-rank approximation to the quadratic term is applied. The proposed feature selection algorithm was extended to solve multi-task microarray classification problems. We compared the single-task version of the proposed feature selection algorithm with 9 existing feature selection methods on 4 benchmark microarray data sets. The empirical results show that the proposed method achieved the most accurate predictions overall. We also evaluated the multi-task version of the proposed algorithm on 8 multi-task microarray datasets. The multi-task feature selection algorithm resulted in significantly higher accuracy than when using the single-task feature selection methods.

Comparison of penalty functions on a penalty approach to mixed-integer optimization

NASA Astrophysics Data System (ADS)

Francisco, Rogério B.; Costa, M. Fernanda P.; Rocha, Ana Maria A. C.; Fernandes, Edite M. G. P.

2016-06-01

In this paper, we present a comparative study involving several penalty functions that can be used in a penalty approach for globally solving bound mixed-integer nonlinear programming (bMIMLP) problems. The penalty approach relies on a continuous reformulation of the bMINLP problem by adding a particular penalty term to the objective function. A penalty function based on the `erf' function is proposed. The continuous nonlinear optimization problems are sequentially solved by the population-based firefly algorithm. Preliminary numerical experiments are carried out in order to analyze the quality of the produced solutions, when compared with other penalty functions available in the literature.

Finite pure integer programming algorithms employing only hyperspherically deduced cuts

NASA Technical Reports Server (NTRS)

Young, R. D.

1971-01-01

Three algorithms are developed that may be based exclusively on hyperspherically deduced cuts. The algorithms only apply, therefore, to problems structured so that these cuts are valid. The algorithms are shown to be finite.

Speedy Alchemy.

ERIC Educational Resources Information Center

Deininger, Rolf A.; Berger, Carl F., Jr.

1983-01-01

Provides instructions for interfacing a pH meter directly to an Apple II microcomputer without an analog-to-digital converter. Includes program listing (with enough remark statements to make it self-documenting) in Integer Basic to display the pH readings. (Author/JN)

Solving large-scale fixed cost integer linear programming models for grid-based location problems with heuristic techniques

NASA Astrophysics Data System (ADS)

Noor-E-Alam, Md.; Doucette, John

2015-08-01

Grid-based location problems (GBLPs) can be used to solve location problems in business, engineering, resource exploitation, and even in the field of medical sciences. To solve these decision problems, an integer linear programming (ILP) model is designed and developed to provide the optimal solution for GBLPs considering fixed cost criteria. Preliminary results show that the ILP model is efficient in solving small to moderate-sized problems. However, this ILP model becomes intractable in solving large-scale instances. Therefore, a decomposition heuristic is proposed to solve these large-scale GBLPs, which demonstrates significant reduction of solution runtimes. To benchmark the proposed heuristic, results are compared with the exact solution via ILP. The experimental results show that the proposed method significantly outperforms the exact method in runtime with minimal (and in most cases, no) loss of optimality.

A Generalized National Planning Approach for Admission Capacity in Higher Education: A Nonlinear Integer Goal Programming Model with a Novel Differential Evolution Algorithm

PubMed Central

El-Qulity, Said Ali; Mohamed, Ali Wagdy

2016-01-01

This paper proposes a nonlinear integer goal programming model (NIGPM) for solving the general problem of admission capacity planning in a country as a whole. The work aims to satisfy most of the required key objectives of a country related to the enrollment problem for higher education. The system general outlines are developed along with the solution methodology for application to the time horizon in a given plan. The up-to-date data for Saudi Arabia is used as a case study and a novel evolutionary algorithm based on modified differential evolution (DE) algorithm is used to solve the complexity of the NIGPM generated for different goal priorities. The experimental results presented in this paper show their effectiveness in solving the admission capacity for higher education in terms of final solution quality and robustness. PMID:26819583

A Generalized National Planning Approach for Admission Capacity in Higher Education: A Nonlinear Integer Goal Programming Model with a Novel Differential Evolution Algorithm.

PubMed

El-Qulity, Said Ali; Mohamed, Ali Wagdy

2016-01-01

This paper proposes a nonlinear integer goal programming model (NIGPM) for solving the general problem of admission capacity planning in a country as a whole. The work aims to satisfy most of the required key objectives of a country related to the enrollment problem for higher education. The system general outlines are developed along with the solution methodology for application to the time horizon in a given plan. The up-to-date data for Saudi Arabia is used as a case study and a novel evolutionary algorithm based on modified differential evolution (DE) algorithm is used to solve the complexity of the NIGPM generated for different goal priorities. The experimental results presented in this paper show their effectiveness in solving the admission capacity for higher education in terms of final solution quality and robustness.

Personnel scheduling using an integer programming model- an application at Avanti Blue-Nile Hotels.

PubMed

Kassa, Biniyam Asmare; Tizazu, Anteneh Eshetu

2013-01-01

In this paper, we report perhaps a first of its kind application of management science in the Ethiopian hotel industry. Avanti Blue Nile Hotels, a newly established five star hotel in Bahir Dar, is the company for which we developed an integer programming model that determines an optimal weekly shift schedule for the Hotel's engineering department personnel while satisfying several constraints including weekly rest requirements per employee, rest requirements between working shifts per employee, required number of personnel per shift, and other constraints. The model is implemented on an excel solver routine. The model enables the company's personnel department management to develop a fair personnel schedule as needed and to effectively utilize personnel resources while satisfying several technical, legal and economic requirements. These encouraging achievements make us optimistic about the gains other Ethiopian organizations can amass by introducing management science approaches in their management planning and decision making systems.

Combinatorial optimization games

DOE Office of Scientific and Technical Information (OSTI.GOV)

Deng, X.; Ibaraki, Toshihide; Nagamochi, Hiroshi

1997-06-01

We introduce a general integer programming formulation for a class of combinatorial optimization games, which immediately allows us to improve the algorithmic result for finding amputations in the core (an important solution concept in cooperative game theory) of the network flow game on simple networks by Kalai and Zemel. An interesting result is a general theorem that the core for this class of games is nonempty if and only if a related linear program has an integer optimal solution. We study the properties for this mathematical condition to hold for several interesting problems, and apply them to resolve algorithmic andmore » complexity issues for their cores along the line as put forward in: decide whether the core is empty; if the core is empty, find an imputation in the core; given an imputation x, test whether x is in the core. We also explore the properties of totally balanced games in this succinct formulation of cooperative games.« less

JPLEX: Java Simplex Implementation with Branch-and-Bound Search for Automated Test Assembly

ERIC Educational Resources Information Center

Park, Ryoungsun; Kim, Jiseon; Dodd, Barbara G.; Chung, Hyewon

2011-01-01

JPLEX, short for Java simPLEX, is an automated test assembly (ATA) program. It is a mixed integer linear programming (MILP) solver written in Java. It reads in a configuration file, solves the minimization problem, and produces an output file for postprocessing. It implements the simplex algorithm to create a fully relaxed solution and…

Radar Resource Management in a Dense Target Environment

DTIC Science & Technology

2014-03-01

problem faced by networked MFRs . While relaxing our assumptions concerning information gain presents numerous challenges worth exploring, future research...linear programming MFR multifunction phased array radar MILP mixed integer linear programming NATO North Atlantic Treaty Organization PDF probability...1: INTRODUCTION Multifunction phased array radars ( MFRs ) are capable of performing various tasks in rapid succession. The performance of target search

A statistical mechanical approach to restricted integer partition functions

NASA Astrophysics Data System (ADS)

Zhou, Chi-Chun; Dai, Wu-Sheng

2018-05-01

The main aim of this paper is twofold: (1) suggesting a statistical mechanical approach to the calculation of the generating function of restricted integer partition functions which count the number of partitions—a way of writing an integer as a sum of other integers under certain restrictions. In this approach, the generating function of restricted integer partition functions is constructed from the canonical partition functions of various quantum gases. (2) Introducing a new type of restricted integer partition functions corresponding to general statistics which is a generalization of Gentile statistics in statistical mechanics; many kinds of restricted integer partition functions are special cases of this restricted integer partition function. Moreover, with statistical mechanics as a bridge, we reveal a mathematical fact: the generating function of restricted integer partition function is just the symmetric function which is a class of functions being invariant under the action of permutation groups. Using this approach, we provide some expressions of restricted integer partition functions as examples.

Stochastic Dynamic Mixed-Integer Programming (SD-MIP)

DTIC Science & Technology

2015-05-05

stochastic linear programming ( SLP ) problems. By using a combination of ideas from cutting plane theory of deterministic MIP (especially disjunctive...developed to date. b) As part of this project, we have also developed tools for very large scale Stochastic Linear Programming ( SLP ). There are...several reasons for this. First, SLP models continue to challenge many of the fastest computers to date, and many applications within the DoD (e.g

Mixed-Integer Nonconvex Quadratic Optimization Relaxations and Performance Analysis

DTIC Science & Technology

2016-10-11

Analysis of Interior Point Algorithms for Non-Lipschitz and Nonconvex Minimization,” (W. Bian, X. Chen, and Ye), Math Programming, 149 (2015) 301-327...Chen, Ge, Wang, Ye), Math Programming, 143 (1-2) (2014) 371-383. This paper resolved an important open question in cardinality constrained...Statistical Performance, and Algorithmic Theory for Local Solutions,” (H. Liu, T. Yao, R. Li, Y. Ye) manuscript, 2nd revision in Math Programming

Materiel Acquisition Management of U.S. Army Attack Helicopters

DTIC Science & Technology

1989-06-02

used to evaluate the existing helicopter program periodically in order to determine utility in reference to all evaluation criteria. Defintion of... mixed integer linear programming model, the Phoenix model has demonstrated the potential to assist in the analysis of strategic and operational issues in...Fleet Max i of Aircraft per Fleet Programmed Buys .. -- Technology Unit Production mix Retirement Start-up ROTIE Flying Hour Aviation Overheadl I Aviation

A Polyhedral Outer-approximation, Dynamic-discretization optimization solver, 1.x

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bent, Rusell; Nagarajan, Harsha; Sundar, Kaarthik

2017-09-25

In this software, we implement an adaptive, multivariate partitioning algorithm for solving mixed-integer nonlinear programs (MINLP) to global optimality. The algorithm combines ideas that exploit the structure of convex relaxations to MINLPs and bound tightening procedures

Integer programming methods for reserve selection and design

Treesearch

Robert G. Haight; Stephanie A. Snyder

2009-01-01

How many nature reserves should there be? Where should they be located? Which places have highest priority for protection? Conservation biologists, economists, and operations researchers have been developing quantitative methods to address these questions since the 1980s.

Optimal traffic resource allocation and management.

DOT National Transportation Integrated Search

2010-05-01

"In this paper, we address the problem of determining the patrol routes of state troopers for maximum coverage of : highway spots with high frequencies of crashes (hot spots). We develop a mixed integer linear programming model : for this problem und...

Analysis of embolic signals with directional dual tree rational dilation wavelet transform.

PubMed

Serbes, Gorkem; Aydin, Nizamettin

2016-08-01

The dyadic discrete wavelet transform (dyadic-DWT), which is based on fixed integer sampling factor, has been used before for processing piecewise smooth biomedical signals. However, the dyadic-DWT has poor frequency resolution due to the low-oscillatory nature of its wavelet bases and therefore, it is less effective in processing embolic signals (ESs). To process ESs more effectively, a wavelet transform having better frequency resolution than the dyadic-DWT is needed. Therefore, in this study two ESs, containing micro-emboli and artifact waveforms, are analyzed with the Directional Dual Tree Rational-Dilation Wavelet Transform (DDT-RADWT). The DDT-RADWT, which can be directly applied to quadrature signals, is based on rational dilation factors and has adjustable frequency resolution. The analyses are done for both low and high Q-factors. It is proved that, when high Q-factor filters are employed in the DDT-RADWT, clearer representations of ESs can be attained in decomposed sub-bands and artifacts can be successfully separated.

Efficient Remainder Rule

ERIC Educational Resources Information Center

Firozzaman, Firoz; Firoz, Fahim

2017-01-01

Understanding the solution of a problem may require the reader to have background knowledge on the subject. For instance, finding an integer which, when divided by a nonzero integer leaves a remainder; but when divided by another nonzero integer may leave a different remainder. To find a smallest positive integer or a set of integers following the…

Hybrid Nested Partitions and Math Programming Framework for Large-scale Combinatorial Optimization

DTIC Science & Technology

2010-03-31

optimization problems: 1) exact algorithms and 2) metaheuristic algorithms . This project will integrate concepts from these two technologies to develop...optimal solutions within an acceptable amount of computation time, and 2) metaheuristic algorithms such as genetic algorithms , tabu search, and the...integer programming decomposition approaches, such as Dantzig Wolfe decomposition and Lagrangian relaxation, and metaheuristics such as the Nested

Automated Test Assembly Using lp_Solve Version 5.5 in R

ERIC Educational Resources Information Center

Diao, Qi; van der Linden, Wim J.

2011-01-01

This article reviews the use of the software program lp_solve version 5.5 for solving mixed-integer automated test assembly (ATA) problems. The program is freely available under Lesser General Public License 2 (LGPL2). It can be called from the statistical language R using the lpSolveAPI interface. Three empirical problems are presented to…

47 CFR 1.2202 - Competitive bidding design options.

Code of Federal Regulations, 2014 CFR

2014-10-01

... Section 1.2202 Telecommunication FEDERAL COMMUNICATIONS COMMISSION GENERAL PRACTICE AND PROCEDURE Grants...) Procedures that utilize mathematical computer optimization software, such as integer programming, to evaluate... evaluating bids using a ranking based on specified factors. (B) Procedures that combine computer optimization...

SPECIES RICHNESS AND BIODIVERSITY CONSERVATION PRIORITIES IN BRITISH COLUMBIA

EPA Science Inventory

Patterns in the geographic distribution of seven species groups were used to identify important areas for conservation in British Columbia, Canada. Potential priority sites for conservation were determined using an integer programming algorithm that maximized the number of speci...

Selective Optimization

DTIC Science & Technology

2015-07-06

NUMBER 5b. GRANT NUMBER AFOSR FA9550-12-1-0154 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S) Shabbir Ahmed and Santanu S. Dey 5d. PROJECT NUMBER 5e. TASK...standard mixed-integer programming (MIP) formulations of selective optimization problems. While such formulations can be attacked by commercial...F33615-86-C-5169. 5b. GRANT NUMBER. Enter all grant numbers as they appear in the report, e.g. AFOSR-82-1234. 5c. PROGRAM ELEMENT NUMBER. Enter

Cumulative Poisson Distribution Program

NASA Technical Reports Server (NTRS)

Bowerman, Paul N.; Scheuer, Ernest M.; Nolty, Robert

1990-01-01

Overflow and underflow in sums prevented. Cumulative Poisson Distribution Program, CUMPOIS, one of two computer programs that make calculations involving cumulative Poisson distributions. Both programs, CUMPOIS (NPO-17714) and NEWTPOIS (NPO-17715), used independently of one another. CUMPOIS determines cumulative Poisson distribution, used to evaluate cumulative distribution function (cdf) for gamma distributions with integer shape parameters and cdf for X (sup2) distributions with even degrees of freedom. Used by statisticians and others concerned with probabilities of independent events occurring over specific units of time, area, or volume. Written in C.

Moving multiple sinks through wireless sensor networks for lifetime maximization.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Petrioli, Chiara; Carosi, Alessio; Basagni, Stefano

2008-01-01

Unattended sensor networks typically watch for some phenomena such as volcanic events, forest fires, pollution, or movements in animal populations. Sensors report to a collection point periodically or when they observe reportable events. When sensors are too far from the collection point to communicate directly, other sensors relay messages for them. If the collection point location is static, sensor nodes that are closer to the collection point relay far more messages than those on the periphery. Assuming all sensor nodes have roughly the same capabilities, those with high relay burden experience battery failure much faster than the rest of themore » network. However, since their death disconnects the live nodes from the collection point, the whole network is then dead. We consider the problem of moving a set of collectors (sinks) through a wireless sensor network to balance the energy used for relaying messages, maximizing the lifetime of the network. We show how to compute an upper bound on the lifetime for any instance using linear and integer programming. We present a centralized heuristic that produces sink movement schedules that produce network lifetimes within 1.4% of the upper bound for realistic settings. We also present a distributed heuristic that produces lifetimes at most 25:3% below the upper bound. More specifically, we formulate a linear program (LP) that is a relaxation of the scheduling problem. The variables are naturally continuous, but the LP relaxes some constraints. The LP has an exponential number of constraints, but we can satisfy them all by enforcing only a polynomial number using a separation algorithm. This separation algorithm is a p-median facility location problem, which we can solve efficiently in practice for huge instances using integer programming technology. This LP selects a set of good sensor configurations. Given the solution to the LP, we can find a feasible schedule by selecting a subset of these configurations, ordering them via a traveling salesman heuristic, and computing feasible transitions using matching algorithms. This algorithm assumes sinks can get a schedule from a central server or a leader sink. If the network owner prefers the sinks make independent decisions, they can use our distributed heuristic. In this heuristic, sinks maintain estimates of the energy distribution in the network and move greedily (with some coordination) based on local search. This application uses the new SUCASA (Solver Utility for Customization with Automatic Symbol Access) facility within the PICO (Parallel Integer and Combinatorial Optimizer) integer programming solver system. SUCASA allows rapid development of customized math programming (search-based) solvers using a problem's natural multidimensional representation. In this case, SUCASA also significantly improves runtime compared to implementations in the ampl math programming language or in perl.« less

Exact calculation of distributions on integers, with application to sequence alignment.

PubMed

Newberg, Lee A; Lawrence, Charles E

2009-01-01

Computational biology is replete with high-dimensional discrete prediction and inference problems. Dynamic programming recursions can be applied to several of the most important of these, including sequence alignment, RNA secondary-structure prediction, phylogenetic inference, and motif finding. In these problems, attention is frequently focused on some scalar quantity of interest, a score, such as an alignment score or the free energy of an RNA secondary structure. In many cases, score is naturally defined on integers, such as a count of the number of pairing differences between two sequence alignments, or else an integer score has been adopted for computational reasons, such as in the test of significance of motif scores. The probability distribution of the score under an appropriate probabilistic model is of interest, such as in tests of significance of motif scores, or in calculation of Bayesian confidence limits around an alignment. Here we present three algorithms for calculating the exact distribution of a score of this type; then, in the context of pairwise local sequence alignments, we apply the approach so as to find the alignment score distribution and Bayesian confidence limits.

Center for Parallel Optimization

DTIC Science & Technology

1993-09-30

BOLLING AFB DC 20332-0001 _ii _ 11. SUPPLEMENTARY NOTES 12a. DISTRIBUTION/ AVAILABILITY STATEMENT 12b. DISTRIBUTION CODE APPROVED FOR PUBLIC RELEASE...Machines Corporation, March 16-19, 1993 , A Branch- and-Bound Method for Mixed Integer Programming on the CM-.5 "* Dr. Roberto Musmanno, University of

Topics

ERIC Educational Resources Information Center

Mathematics Teaching, 1973

1973-01-01

This column includes the description of a game involving addition and subtraction of integers represented by colored bricks, a general formula for an enlargement in the Cartesian plane, an analysis of the possibilities for certain games of board Solitaire, and a BASIC program for a recreational mathematics problem. (DT)

Distributing Earthquakes Among California's Faults: A Binary Integer Programming Approach

NASA Astrophysics Data System (ADS)

Geist, E. L.; Parsons, T.

2016-12-01

Statement of the problem is simple: given regional seismicity specified by a Gutenber-Richter (G-R) relation, how are earthquakes distributed to match observed fault-slip rates? The objective is to determine the magnitude-frequency relation on individual faults. The California statewide G-R b-value and a-value are estimated from historical seismicity, with the a-value accounting for off-fault seismicity. UCERF3 consensus slip rates are used, based on geologic and geodetic data and include estimates of coupling coefficients. The binary integer programming (BIP) problem is set up such that each earthquake from a synthetic catalog spanning millennia can occur at any location along any fault. The decision vector, therefore, consists of binary variables, with values equal to one indicating the location of each earthquake that results in an optimal match of slip rates, in an L1-norm sense. Rupture area and slip associated with each earthquake are determined from a magnitude-area scaling relation. Uncertainty bounds on the UCERF3 slip rates provide explicit minimum and maximum constraints to the BIP model, with the former more important to feasibility of the problem. There is a maximum magnitude limit associated with each fault, based on fault length, providing an implicit constraint. Solution of integer programming problems with a large number of variables (>105 in this study) has been possible only since the late 1990s. In addition to the classic branch-and-bound technique used for these problems, several other algorithms have been recently developed, including pre-solving, sifting, cutting planes, heuristics, and parallelization. An optimal solution is obtained using a state-of-the-art BIP solver for M≥6 earthquakes and California's faults with slip-rates > 1 mm/yr. Preliminary results indicate a surprising diversity of on-fault magnitude-frequency relations throughout the state.

Newton/Poisson-Distribution Program

NASA Technical Reports Server (NTRS)

Bowerman, Paul N.; Scheuer, Ernest M.

1990-01-01

NEWTPOIS, one of two computer programs making calculations involving cumulative Poisson distributions. NEWTPOIS (NPO-17715) and CUMPOIS (NPO-17714) used independently of one another. NEWTPOIS determines Poisson parameter for given cumulative probability, from which one obtains percentiles for gamma distributions with integer shape parameters and percentiles for X(sup2) distributions with even degrees of freedom. Used by statisticians and others concerned with probabilities of independent events occurring over specific units of time, area, or volume. Program written in C.

Integers as Transformations.

ERIC Educational Resources Information Center

Thompson, Patrick W.; Dreyfus, Tommy

1988-01-01

Investigates whether elementary school students can construct operations of thought for integers and integer addition crucial for understanding elementary algebra. Two sixth graders were taught using a computer. Results included both students being able to construct mental operations for negating arbitrary integers and determining sign and…

Classifying the Progression of Ductal Carcinoma from Single-Cell Sampled Data via Integer Linear Programming: A Case Study

PubMed Central

Catanzaro, Daniele; Schäffer, Alejandro A.; Schwartz, Russell

2016-01-01

Ductal Carcinoma In Situ (DCIS) is a precursor lesion of Invasive Ductal Carcinoma (IDC) of the breast. Investigating its temporal progression could provide fundamental new insights for the development of better diagnostic tools to predict which cases of DCIS will progress to IDC. We investigate the problem of reconstructing a plausible progression from single-cell sampled data of an individual with Synchronous DCIS and IDC. Specifically, by using a number of assumptions derived from the observation of cellular atypia occurring in IDC, we design a possible predictive model using integer linear programming (ILP). Computational experiments carried out on a preexisting data set of 13 patients with simultaneous DCIS and IDC show that the corresponding predicted progression models are classifiable into categories having specific evolutionary characteristics. The approach provides new insights into mechanisms of clonal progression in breast cancers and helps illustrate the power of the ILP approach for similar problems in reconstructing tumor evolution scenarios under complex sets of constraints. PMID:26353381

A mathematical model for municipal solid waste management - A case study in Hong Kong.

PubMed

Lee, C K M; Yeung, C L; Xiong, Z R; Chung, S H

2016-12-01

With the booming economy and increasing population, the accumulation of waste has become an increasingly arduous issue and has aroused the attention from all sectors of society. Hong Kong which has a relative high daily per capita domestic waste generation rate in Asia has not yet established a comprehensive waste management system. This paper conducts a review of waste management approaches and models. Researchers highlight that mathematical models provide useful information for decision-makers to select appropriate choices and save cost. It is suggested to consider municipal solid waste management in a holistic view and improve the utilization of waste management infrastructures. A mathematical model which adopts integer linear programming and mixed integer programming has been developed for Hong Kong municipal solid waste management. A sensitivity analysis was carried out to simulate different scenarios which provide decision-makers important information for establishing Hong Kong waste management system. Copyright © 2016 Elsevier Ltd. All rights reserved.

A new mathematical modeling for pure parsimony haplotyping problem.

PubMed

Feizabadi, R; Bagherian, M; Vaziri, H R; Salahi, M

2016-11-01

Pure parsimony haplotyping (PPH) problem is important in bioinformatics because rational haplotyping inference plays important roles in analysis of genetic data, mapping complex genetic diseases such as Alzheimer's disease, heart disorders and etc. Haplotypes and genotypes are m-length sequences. Although several integer programing models have already been presented for PPH problem, its NP-hardness characteristic resulted in ineffectiveness of those models facing the real instances especially instances with many heterozygous sites. In this paper, we assign a corresponding number to each haplotype and genotype and based on those numbers, we set a mixed integer programing model. Using numbers, instead of sequences, would lead to less complexity of the new model in comparison with previous models in a way that there are neither constraints nor variables corresponding to heterozygous nucleotide sites in it. Experimental results approve the efficiency of the new model in producing better solution in comparison to two state-of-the art haplotyping approaches. Copyright © 2016 Elsevier Inc. All rights reserved.

Discovering Link Communities in Complex Networks by an Integer Programming Model and a Genetic Algorithm

PubMed Central

Li, Zhenping; Zhang, Xiang-Sun; Wang, Rui-Sheng; Liu, Hongwei; Zhang, Shihua

2013-01-01

Identification of communities in complex networks is an important topic and issue in many fields such as sociology, biology, and computer science. Communities are often defined as groups of related nodes or links that correspond to functional subunits in the corresponding complex systems. While most conventional approaches have focused on discovering communities of nodes, some recent studies start partitioning links to find overlapping communities straightforwardly. In this paper, we propose a new quantity function for link community identification in complex networks. Based on this quantity function we formulate the link community partition problem into an integer programming model which allows us to partition a complex network into overlapping communities. We further propose a genetic algorithm for link community detection which can partition a network into overlapping communities without knowing the number of communities. We test our model and algorithm on both artificial networks and real-world networks. The results demonstrate that the model and algorithm are efficient in detecting overlapping community structure in complex networks. PMID:24386268

Integer Linear Programming for Constrained Multi-Aspect Committee Review Assignment

PubMed Central

Karimzadehgan, Maryam; Zhai, ChengXiang

2011-01-01

Automatic review assignment can significantly improve the productivity of many people such as conference organizers, journal editors and grant administrators. A general setup of the review assignment problem involves assigning a set of reviewers on a committee to a set of documents to be reviewed under the constraint of review quota so that the reviewers assigned to a document can collectively cover multiple topic aspects of the document. No previous work has addressed such a setup of committee review assignments while also considering matching multiple aspects of topics and expertise. In this paper, we tackle the problem of committee review assignment with multi-aspect expertise matching by casting it as an integer linear programming problem. The proposed algorithm can naturally accommodate any probabilistic or deterministic method for modeling multiple aspects to automate committee review assignments. Evaluation using a multi-aspect review assignment test set constructed using ACM SIGIR publications shows that the proposed algorithm is effective and efficient for committee review assignments based on multi-aspect expertise matching. PMID:22711970

Fish Processed Production Planning Using Integer Stochastic Programming Model

NASA Astrophysics Data System (ADS)

Firmansyah, Mawengkang, Herman

2011-06-01

Fish and its processed products are the most affordable source of animal protein in the diet of most people in Indonesia. The goal in production planning is to meet customer demand over a fixed time horizon divided into planning periods by optimizing the trade-off between economic objectives such as production cost and customer satisfaction level. The major decisions are production and inventory levels for each product and the number of workforce in each planning period. In this paper we consider the management of small scale traditional business at North Sumatera Province which performs processing fish into several local seafood products. The inherent uncertainty of data (e.g. demand, fish availability), together with the sequential evolution of data over time leads the production planning problem to a nonlinear mixed-integer stochastic programming model. We use scenario generation based approach and feasible neighborhood search for solving the model. The results which show the amount of each fish processed product and the number of workforce needed in each horizon planning are presented.

A robust multi-objective global supplier selection model under currency fluctuation and price discount

NASA Astrophysics Data System (ADS)

Zarindast, Atousa; Seyed Hosseini, Seyed Mohamad; Pishvaee, Mir Saman

2017-06-01

Robust supplier selection problem, in a scenario-based approach has been proposed, when the demand and exchange rates are subject to uncertainties. First, a deterministic multi-objective mixed integer linear programming is developed; then, the robust counterpart of the proposed mixed integer linear programming is presented using the recent extension in robust optimization theory. We discuss decision variables, respectively, by a two-stage stochastic planning model, a robust stochastic optimization planning model which integrates worst case scenario in modeling approach and finally by equivalent deterministic planning model. The experimental study is carried out to compare the performances of the three models. Robust model resulted in remarkable cost saving and it illustrated that to cope with such uncertainties, we should consider them in advance in our planning. In our case study different supplier were selected due to this uncertainties and since supplier selection is a strategic decision, it is crucial to consider these uncertainties in planning approach.

Classifying the Progression of Ductal Carcinoma from Single-Cell Sampled Data via Integer Linear Programming: A Case Study.

PubMed

Catanzaro, Daniele; Shackney, Stanley E; Schaffer, Alejandro A; Schwartz, Russell

2016-01-01

Ductal Carcinoma In Situ (DCIS) is a precursor lesion of Invasive Ductal Carcinoma (IDC) of the breast. Investigating its temporal progression could provide fundamental new insights for the development of better diagnostic tools to predict which cases of DCIS will progress to IDC. We investigate the problem of reconstructing a plausible progression from single-cell sampled data of an individual with synchronous DCIS and IDC. Specifically, by using a number of assumptions derived from the observation of cellular atypia occurring in IDC, we design a possible predictive model using integer linear programming (ILP). Computational experiments carried out on a preexisting data set of 13 patients with simultaneous DCIS and IDC show that the corresponding predicted progression models are classifiable into categories having specific evolutionary characteristics. The approach provides new insights into mechanisms of clonal progression in breast cancers and helps illustrate the power of the ILP approach for similar problems in reconstructing tumor evolution scenarios under complex sets of constraints.

A supplier selection and order allocation problem with stochastic demands

NASA Astrophysics Data System (ADS)

Zhou, Yun; Zhao, Lei; Zhao, Xiaobo; Jiang, Jianhua

2011-08-01

We consider a system comprising a retailer and a set of candidate suppliers that operates within a finite planning horizon of multiple periods. The retailer replenishes its inventory from the suppliers and satisfies stochastic customer demands. At the beginning of each period, the retailer makes decisions on the replenishment quantity, supplier selection and order allocation among the selected suppliers. An optimisation problem is formulated to minimise the total expected system cost, which includes an outer level stochastic dynamic program for the optimal replenishment quantity and an inner level integer program for supplier selection and order allocation with a given replenishment quantity. For the inner level subproblem, we develop a polynomial algorithm to obtain optimal decisions. For the outer level subproblem, we propose an efficient heuristic for the system with integer-valued inventory, based on the structural properties of the system with real-valued inventory. We investigate the efficiency of the proposed solution approach, as well as the impact of parameters on the optimal replenishment decision with numerical experiments.

Multicasting for all-optical multifiber networks

NASA Astrophysics Data System (ADS)

Kã¶Ksal, Fatih; Ersoy, Cem

2007-02-01

All-optical wavelength-routed WDM WANs can support the high bandwidth and the long session duration requirements of the application scenarios such as interactive distance learning or on-line diagnosis of patients simultaneously in different hospitals. However, multifiber and limited sparse light splitting and wavelength conversion capabilities of switches result in a difficult optimization problem. We attack this problem using a layered graph model. The problem is defined as a k-edge-disjoint degree-constrained Steiner tree problem for routing and fiber and wavelength assignment of k multicasts. A mixed integer linear programming formulation for the problem is given, and a solution using CPLEX is provided. However, the complexity of the problem grows quickly with respect to the number of edges in the layered graph, which depends on the number of nodes, fibers, wavelengths, and multicast sessions. Hence, we propose two heuristics layered all-optical multicast algorithm [(LAMA) and conservative fiber and wavelength assignment (C-FWA)] to compare with CPLEX, existing work, and unicasting. Extensive computational experiments show that LAMA's performance is very close to CPLEX, and it is significantly better than existing work and C-FWA for nearly all metrics, since LAMA jointly optimizes routing and fiber-wavelength assignment phases compared with the other candidates, which attack the problem by decomposing two phases. Experiments also show that important metrics (e.g., session and group blocking probability, transmitter wavelength, and fiber conversion resources) are adversely affected by the separation of two phases. Finally, the fiber-wavelength assignment strategy of C-FWA (Ex-Fit) uses wavelength and fiber conversion resources more effectively than the First Fit.

Galaxy Redshifts from Discrete Optimization of Correlation Functions

NASA Astrophysics Data System (ADS)

Lee, Benjamin C. G.; Budavári, Tamás; Basu, Amitabh; Rahman, Mubdi

2016-12-01

We propose a new method of constraining the redshifts of individual extragalactic sources based on celestial coordinates and their ensemble statistics. Techniques from integer linear programming (ILP) are utilized to optimize simultaneously for the angular two-point cross- and autocorrelation functions. Our novel formalism introduced here not only transforms the otherwise hopelessly expensive, brute-force combinatorial search into a linear system with integer constraints but also is readily implementable in off-the-shelf solvers. We adopt Gurobi, a commercial optimization solver, and use Python to build the cost function dynamically. The preliminary results on simulated data show potential for future applications to sky surveys by complementing and enhancing photometric redshift estimators. Our approach is the first application of ILP to astronomical analysis.

Non-integer viscoelastic constitutive law to model soft biological tissues to in-vivo indentation.

PubMed

Demirci, Nagehan; Tönük, Ergin

2014-01-01

During the last decades, derivatives and integrals of non-integer orders are being more commonly used for the description of constitutive behavior of various viscoelastic materials including soft biological tissues. Compared to integer order constitutive relations, non-integer order viscoelastic material models of soft biological tissues are capable of capturing a wider range of viscoelastic behavior obtained from experiments. Although integer order models may yield comparably accurate results, non-integer order material models have less number of parameters to be identified in addition to description of an intermediate material that can monotonically and continuously be adjusted in between an ideal elastic solid and an ideal viscous fluid. In this work, starting with some preliminaries on non-integer (fractional) calculus, the "spring-pot", (intermediate mechanical element between a solid and a fluid), non-integer order three element (Zener) solid model, finally a user-defined large strain non-integer order viscoelastic constitutive model was constructed to be used in finite element simulations. Using the constitutive equation developed, by utilizing inverse finite element method and in vivo indentation experiments, soft tissue material identification was performed. The results indicate that material coefficients obtained from relaxation experiments, when optimized with creep experimental data could simulate relaxation, creep and cyclic loading and unloading experiments accurately. Non-integer calculus viscoelastic constitutive models, having physical interpretation and modeling experimental data accurately is a good alternative to classical phenomenological viscoelastic constitutive equations.

Fast Integer Ambiguity Resolution for GPS Attitude Determination

NASA Technical Reports Server (NTRS)

Lightsey, E. Glenn; Crassidis, John L.; Markley, F. Landis

1999-01-01

In this paper, a new algorithm for GPS (Global Positioning System) integer ambiguity resolution is shown. The algorithm first incorporates an instantaneous (static) integer search to significantly reduce the search space using a geometric inequality. Then a batch-type loss function is used to check the remaining integers in order to determine the optimal integer. This batch function represents the GPS sightline vectors in the body frame as the sum of two vectors, one depending on the phase measurements and the other on the unknown integers. The new algorithm has several advantages: it does not require an a-priori estimate of the vehicle's attitude; it provides an inherent integrity check using a covariance-type expression; and it can resolve the integers even when coplanar baselines exist. The performance of the new algorithm is tested on a dynamic hardware simulator.

Learning Integer Addition: Is Later Better?

ERIC Educational Resources Information Center

Aqazade, Mahtob; Bofferding, Laura; Farmer, Sherri

2017-01-01

We investigate thirty-three second and fifth-grade students' solution strategies on integer addition problems before and after analyzing contrasting cases with integer addition and participating in a lesson on integers. The students took a pretest, participated in two small group sessions and a short lesson, and took a posttest. Even though the…

Online with Integers

ERIC Educational Resources Information Center

Siegel, Jonathan W.; Siegel, P. B.

2011-01-01

Integers are sometimes used in physics problems to simplify the mathematics so the arithmetic does not distract students from the physics concepts. This is particularly important in exams where students should not have to spend a lot of time using their calculators. Common uses of integers in physics problems include integer solutions to…

Integers Made Easy: Just Walk It Off

ERIC Educational Resources Information Center

Nurnberger-Haag, Julie

2007-01-01

This article describes a multisensory method for teaching students how to multiply and divide as well as add and subtract integers. The author uses sidewalk chalk and the underlying concept of integers to physically and mentally engage students in understanding the concepts of integers, making connections, and developing computational fluency.…

A mixed integer bi-level DEA model for bank branch performance evaluation by Stackelberg approach

NASA Astrophysics Data System (ADS)

Shafiee, Morteza; Lotfi, Farhad Hosseinzadeh; Saleh, Hilda; Ghaderi, Mehdi

2016-03-01

One of the most complicated decision making problems for managers is the evaluation of bank performance, which involves various criteria. There are many studies about bank efficiency evaluation by network DEA in the literature review. These studies do not focus on multi-level network. Wu (Eur J Oper Res 207:856-864, 2010) proposed a bi-level structure for cost efficiency at the first time. In this model, multi-level programming and cost efficiency were used. He used a nonlinear programming to solve the model. In this paper, we have focused on multi-level structure and proposed a bi-level DEA model. We then used a liner programming to solve our model. In other hand, we significantly improved the way to achieve the optimum solution in comparison with the work by Wu (2010) by converting the NP-hard nonlinear programing into a mixed integer linear programming. This study uses a bi-level programming data envelopment analysis model that embodies internal structure with Stackelberg-game relationships to evaluate the performance of banking chain. The perspective of decentralized decisions is taken in this paper to cope with complex interactions in banking chain. The results derived from bi-level programming DEA can provide valuable insights and detailed information for managers to help them evaluate the performance of the banking chain as a whole using Stackelberg-game relationships. Finally, this model was applied in the Iranian bank to evaluate cost efficiency.

Optimally Scheduling Basic Courses at the Defense Language Institute using Integer Programming

DTIC Science & Technology

2005-09-01

DLI’s manual schedules at best can train 8%, 7% and 64%. 15. NUMBER OF PAGES 59 14. SUBJECT TERMS Operations Research, Linear Programming...class in 2006, 2007, and 2008, whereas DLI’s manual schedules at best can train 8%, 7% and 64%. vi THIS PAGE...ARABIC INSTRUTOR LEVELS .....................................25 FIGURE 2. OCS1 AND OCS2 CHINESE-MANDARIN INSTRUTOR LEVELS ............26 FIGURE 3

Optimization methods for decision making in disease prevention and epidemic control.

PubMed

Deng, Yan; Shen, Siqian; Vorobeychik, Yevgeniy

2013-11-01

This paper investigates problems of disease prevention and epidemic control (DPEC), in which we optimize two sets of decisions: (i) vaccinating individuals and (ii) closing locations, given respective budgets with the goal of minimizing the expected number of infected individuals after intervention. The spread of diseases is inherently stochastic due to the uncertainty about disease transmission and human interaction. We use a bipartite graph to represent individuals' propensities of visiting a set of location, and formulate two integer nonlinear programming models to optimize choices of individuals to vaccinate and locations to close. Our first model assumes that if a location is closed, its visitors stay in a safe location and will not visit other locations. Our second model incorporates compensatory behavior by assuming multiple behavioral groups, always visiting the most preferred locations that remain open. The paper develops algorithms based on a greedy strategy, dynamic programming, and integer programming, and compares the computational efficacy and solution quality. We test problem instances derived from daily behavior patterns of 100 randomly chosen individuals (corresponding to 195 locations) in Portland, Oregon, and provide policy insights regarding the use of the two DPEC models. Copyright © 2013 Elsevier Inc. All rights reserved.

A Two-Stage Stochastic Mixed-Integer Programming Approach to the Smart House Scheduling Problem

NASA Astrophysics Data System (ADS)

Ozoe, Shunsuke; Tanaka, Yoichi; Fukushima, Masao

A “Smart House” is a highly energy-optimized house equipped with photovoltaic systems (PV systems), electric battery systems, fuel cell cogeneration systems (FC systems), electric vehicles (EVs) and so on. Smart houses are attracting much attention recently thanks to their enhanced ability to save energy by making full use of renewable energy and by achieving power grid stability despite an increased power draw for installed PV systems. Yet running a smart house's power system, with its multiple power sources and power storages, is no simple task. In this paper, we consider the problem of power scheduling for a smart house with a PV system, an FC system and an EV. We formulate the problem as a mixed integer programming problem, and then extend it to a stochastic programming problem involving recourse costs to cope with uncertain electricity demand, heat demand and PV power generation. Using our method, we seek to achieve the optimal power schedule running at the minimum expected operation cost. We present some results of numerical experiments with data on real-life demands and PV power generation to show the effectiveness of our method.

Making Sense of Integer Arithmetic: The Effect of Using Virtual Manipulatives on Students' Representational Fluency

ERIC Educational Resources Information Center

Bolyard, Johnna; Moyer-Packenham, Patricia

2012-01-01

This study investigated how the use of virtual manipulatives in integer instruction impacts student achievement for integer addition and subtraction. Of particular interest was the influence of using virtual manipulatives on students' ability to create and translate among representations for integer computation. The research employed a…

Teachers' Construction of Meanings of Signed Quantities and Integer Operation

ERIC Educational Resources Information Center

Kumar, Ruchi S.; Subramaniam, K.; Naik, Shweta Shripad

2017-01-01

Understanding signed quantities and its arithmetic is one of the challenging topics of middle school mathematics. The "specialized content knowledge" (SCK) for teaching integers includes understanding of a variety of representations that may be used while teaching. In this study, we argue that meanings of integers and integer operations…

Anisotropic fractal media by vector calculus in non-integer dimensional space

NASA Astrophysics Data System (ADS)

Tarasov, Vasily E.

2014-08-01

A review of different approaches to describe anisotropic fractal media is proposed. In this paper, differentiation and integration non-integer dimensional and multi-fractional spaces are considered as tools to describe anisotropic fractal materials and media. We suggest a generalization of vector calculus for non-integer dimensional space by using a product measure method. The product of fractional and non-integer dimensional spaces allows us to take into account the anisotropy of the fractal media in the framework of continuum models. The integration over non-integer-dimensional spaces is considered. In this paper differential operators of first and second orders for fractional space and non-integer dimensional space are suggested. The differential operators are defined as inverse operations to integration in spaces with non-integer dimensions. Non-integer dimensional space that is product of spaces with different dimensions allows us to give continuum models for anisotropic type of the media. The Poisson's equation for fractal medium, the Euler-Bernoulli fractal beam, and the Timoshenko beam equations for fractal material are considered as examples of application of suggested generalization of vector calculus for anisotropic fractal materials and media.

Solution of the Generalized Noah's Ark Problem.

PubMed

Billionnet, Alain

2013-01-01

The phylogenetic diversity (PD) of a set of species is a measure of the evolutionary distance among the species in the collection, based on a phylogenetic tree. Such a tree is composed of a root, internal nodes, and leaves that correspond to the set of taxa under study. With each edge of the tree is associated a non-negative branch length (evolutionary distance). If a particular survival probability is associated with each taxon, the PD measure becomes the expected PD measure. In the Noah's Ark Problem (NAP) introduced by Weitzman (1998), these survival probabilities can be increased at some cost. The problem is to determine how best to allocate a limited amount of resources to maximize the expected PD of the considered species. It is easy to formulate the NAP as a (difficult) nonlinear 0-1 programming problem. The aim of this article is to show that a general version of the NAP (GNAP) can be solved simply and efficiently with any set of edge weights and any set of survival probabilities by using standard mixed-integer linear programming software. The crucial point to move from a nonlinear program in binary variables to a mixed-integer linear program, is to approximate the logarithmic function by the lower envelope of a set of tangents to the curve. Solving the obtained mixed-integer linear program provides not only a near-optimal solution but also an upper bound on the value of the optimal solution. We also applied this approach to a generalization of the nature reserve problem (GNRP) that consists of selecting a set of regions to be conserved so that the expected PD of the set of species present in these regions is maximized. In this case, the survival probabilities of different taxa are not independent of each other. Computational results are presented to illustrate potentialities of the approach. Near-optimal solutions with hypothetical phylogenetic trees comprising about 4000 taxa are obtained in a few seconds or minutes of computing time for the GNAP, and in about 30 min for the GNRP. In all the cases the average guarantee varies from 0% to 1.20%.

Multi-vehicle mobility allowance shuttle transit (MAST) system : an analytical model to select the fleet size and a scheduling heuristic.

DOT National Transportation Integrated Search

2012-06-01

The mobility allowance shuttle transit (MAST) system is a hybrid transit system in which vehicles are : allowed to deviate from a fixed route to serve flexible demand. A mixed integer programming (MIP) : formulation for the static scheduling problem ...

A Graphical Teaching Tool for Understanding Two's Complement.

ERIC Educational Resources Information Center

Luck, Carlos L.

As part of the Electrical Engineering program at the Univesity of Southern Maine, students are typically introduced to Two's Complement algebra and representation, a method to include negative numbers in the binary representation of integers that is widely used in microprocessors and related digital systems. The traditional, procedural method to…

Space tug economic analysis study. Volume 2: Tug concepts analysis. Part 2: Economic analysis

NASA Technical Reports Server (NTRS)

1972-01-01

An economic analysis of space tug operations is presented. The subjects discussed are: (1) cost uncertainties, (2) scenario analysis, (3) economic sensitivities, (4) mixed integer programming formulation of the space tug problem, and (5) critical parameters in the evaluation of a public expenditure.

Optimizing efficiency of height modeling for extensive forest inventories.

Treesearch

T.M. Barrett

2006-01-01

Although critical to monitoring forest ecosystems, inventories are expensive. This paper presents a generalizable method for using an integer programming model to examine tradeoffs between cost and estimation error for alternative measurement strategies in forest inventories. The method is applied to an example problem of choosing alternative height-modeling strategies...

Selecting Personal Computers.

ERIC Educational Resources Information Center

Djang, Philipp A.

1993-01-01

Describes a Multiple Criteria Decision Analysis Approach for the selection of personal computers that combines the capabilities of Analytic Hierarchy Process and Integer Goal Programing. An example of how decision makers can use this approach to determine what kind of personal computers and how many of each type to purchase is given. (nine…

Integrated Sensing and Processing (ISP) Phase II: Demonstration and Evaluation for Distributed Sensor Netowrks and Missile Seeker Systems

DTIC Science & Technology

2007-02-28

Shah, D. Waagen, H. Schmitt, S. Bellofiore, A. Spanias, and D. Cochran, 32nd International Conference on Acoustics, Speech , and Signal Processing...Information Exploitation Office kNN k-Nearest Neighbor LEAN Laplacian Eigenmap Adaptive Neighbor LIP Linear Integer Programming ISP

Optimization Research of Generation Investment Based on Linear Programming Model

NASA Astrophysics Data System (ADS)

Wu, Juan; Ge, Xueqian

Linear programming is an important branch of operational research and it is a mathematical method to assist the people to carry out scientific management. GAMS is an advanced simulation and optimization modeling language and it will combine a large number of complex mathematical programming, such as linear programming LP, nonlinear programming NLP, MIP and other mixed-integer programming with the system simulation. In this paper, based on the linear programming model, the optimized investment decision-making of generation is simulated and analyzed. At last, the optimal installed capacity of power plants and the final total cost are got, which provides the rational decision-making basis for optimized investments.

INFORM: An interactive data collection and display program with debugging capability

NASA Technical Reports Server (NTRS)

Cwynar, D. S.

1980-01-01

A computer program was developed to aid ASSEMBLY language programmers of mini and micro computers in solving the man machine communications problems that exist when scaled integers are involved. In addition to producing displays of quasi-steady state values, INFORM provides an interactive mode for debugging programs, making program patches, and modifying the displays. Auxiliary routines SAMPLE and DATAO add dynamic data acquisition and high speed dynamic display capability to the program. Programming information and flow charts to aid in implementing INFORM on various machines together with descriptions of all supportive software are provided. Program modifications to satisfy the individual user's needs are considered.

Optimization-based manufacturing scheduling with multiple resources and setup requirements

NASA Astrophysics Data System (ADS)

Chen, Dong; Luh, Peter B.; Thakur, Lakshman S.; Moreno, Jack, Jr.

1998-10-01

The increasing demand for on-time delivery and low price forces manufacturer to seek effective schedules to improve coordination of multiple resources and to reduce product internal costs associated with labor, setup and inventory. This study describes the design and implementation of a scheduling system for J. M. Product Inc. whose manufacturing is characterized by the need to simultaneously consider machines and operators while an operator may attend several operations at the same time, and the presence of machines requiring significant setup times. The scheduling problem with these characteristics are typical for many manufacturers, very difficult to be handled, and have not been adequately addressed in the literature. In this study, both machine and operators are modeled as resources with finite capacities to obtain efficient coordination between them, and an operator's time can be shared by several operations at the same time to make full use of the operator. Setups are explicitly modeled following our previous work, with additional penalties on excessive setups to reduce setup costs and avoid possible scraps. An integer formulation with a separable structure is developed to maximize on-time delivery of products, low inventory and small number of setups. Within the Lagrangian relaxation framework, the problem is decomposed into individual subproblems that are effectively solved by using dynamic programming with additional penalties embedded in state transitions. Heuristics is then developed to obtain a feasible schedule following on our previous work with new mechanism to satisfy operator capacity constraints. The method has been implemented using the object-oriented programming language C++ with a user-friendly interface, and numerical testing shows that the method generates high quality schedules in a timely fashion. Through simultaneous consideration of machines and operators, machines and operators are well coordinated to facilitate the smooth flow of parts through the system. The explicit modeling of setups and the associated penalties let parts with same setup requirements clustered together to avoid excessive setups.

Software Technology for Adaptable, Reliable Systems (STARS) (User Manual). Ada Command Environment (ACE) Version 8.0 Sun OS Implementation

DTIC Science & Technology

1990-10-29

the equivalent type names in the basic X libary . 37. Intrinsics Contains the type declarations common to all Xt toolkit routines. 38. Widget-Package...Memory-Size constant Integer 1; MinInt constant I-reger Integer’First; MaxInt const-i’ integer Integer’Last; -- Max- Digits constant Integer 1; -- MaxMan...connection between some type names used by Xt routines and the equivalent type names in the basic X libary . .package RenamedXlibTypes is P;’ge 65 29

CUMBIN - CUMULATIVE BINOMIAL PROGRAMS

NASA Technical Reports Server (NTRS)

Bowerman, P. N.

1994-01-01

The cumulative binomial program, CUMBIN, is one of a set of three programs which calculate cumulative binomial probability distributions for arbitrary inputs. The three programs, CUMBIN, NEWTONP (NPO-17556), and CROSSER (NPO-17557), can be used independently of one another. CUMBIN can be used by statisticians and users of statistical procedures, test planners, designers, and numerical analysts. The program has been used for reliability/availability calculations. CUMBIN calculates the probability that a system of n components has at least k operating if the probability that any one operating is p and the components are independent. Equivalently, this is the reliability of a k-out-of-n system having independent components with common reliability p. CUMBIN can evaluate the incomplete beta distribution for two positive integer arguments. CUMBIN can also evaluate the cumulative F distribution and the negative binomial distribution, and can determine the sample size in a test design. CUMBIN is designed to work well with all integer values 0 < k <= n. To run the program, the user simply runs the executable version and inputs the information requested by the program. The program is not designed to weed out incorrect inputs, so the user must take care to make sure the inputs are correct. Once all input has been entered, the program calculates and lists the result. The CUMBIN program is written in C. It was developed on an IBM AT with a numeric co-processor using Microsoft C 5.0. Because the source code is written using standard C structures and functions, it should compile correctly with most C compilers. The program format is interactive. It has been implemented under DOS 3.2 and has a memory requirement of 26K. CUMBIN was developed in 1988.

Operational Planning for Multiple Heterogeneous Unmanned Aerial Vehicles in Three Dimensions

DTIC Science & Technology

2009-06-01

human input in the planning process. Two solution methods are presented: (1) a mixed-integer program, and (2) an algorithm that utilizes a metaheuristic ...and (2) an algorithm that utilizes a metaheuristic to generate composite variables for a linear program, called the Composite Operations Planning...that represent a path and an associated type of UAV. The reformulation is incorporated into an algorithm that uses a metaheuristic to generate the

Forest management and economics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Buongiorno, J.; Gilless, J.K.

1987-01-01

This volume provides a survey of quantitative methods, guiding the reader through formulation and analysis of models that address forest management problems. The authors use simple mathematics, graphics, and short computer programs to explain each method. Emphasizing applications, they discuss linear, integer, dynamic, and goal programming; simulation; network modeling; and econometrics, as these relate to problems of determining economic harvest schedules in even-aged and uneven-aged forests, the evaluation of forest policies, multiple-objective decision making, and more.

Modeling Road Vulnerability to Snow Using Mixed Integer Optimization

DOE Office of Scientific and Technical Information (OSTI.GOV)

Rodriguez, Tony K; Omitaomu, Olufemi A; Ostrowski, James A

As the number and severity of snowfall events continue to grow, the need to intelligently direct road maintenance during these snowfall events will also grow. In several locations, local governments lack the resources to completely treat all roadways during snow events. Furthermore, some governments utilize only traffic data to determine which roads should be treated. As a result, many schools, businesses, and government offices must be unnecessarily closed, which directly impacts the social, educational, and economic well-being of citizens and institutions. In this work, we propose a mixed integer programming formulation to optimally allocate resources to manage snowfall on roadsmore » using meteorological, geographical, and environmental parameters. Additionally, we evaluate the impacts of an increase in budget for winter road maintenance on snow control resources.« less

DORMAN computer program (study 2.5). Volume 2: User's guide and programmer's guide. [development of data bank for computerized information storage of NASA programs

NASA Technical Reports Server (NTRS)

Wray, S. T., Jr.

1973-01-01

The DORMAN program was developed to create and modify a data bank containing data decks which serve as input to the DORCA Computer Program. Via a remote terminal a user can access the bank, extract any data deck, modify that deck, output the modified deck to be input to the DORCA program, and save the modified deck in the data bank. This computer program is an assist in the utilization of the DORCA program. The program is dimensionless and operates almost entirely in integer mode. The program was developed on the CDC 6400/7600 complex for implementation on a UNIVAC 1108 computer.

Counting Triangles to Sum Squares

ERIC Educational Resources Information Center

DeMaio, Joe

2012-01-01

Counting complete subgraphs of three vertices in complete graphs, yields combinatorial arguments for identities for sums of squares of integers, odd integers, even integers and sums of the triangular numbers.

Slip and Slide Method of Factoring Trinomials with Integer Coefficients over the Integers

ERIC Educational Resources Information Center

Donnell, William A.

2012-01-01

In intermediate and college algebra courses there are a number of methods for factoring quadratic trinomials with integer coefficients over the integers. Some of these methods have been given names, such as trial and error, reversing FOIL, AC method, middle term splitting method and slip and slide method. The purpose of this article is to discuss…

Obstacles and Affordances for Integer Reasoning: An Analysis of Children's Thinking and the History of Mathematics

ERIC Educational Resources Information Center

Bishop, Jessica Pierson; Lamb, Lisa L.; Philipp, Randolph A.; Whitacre, Ian; Schappelle, Bonnie P.; Lewis, Melinda L.

2014-01-01

We identify and document 3 cognitive obstacles, 3 cognitive affordances, and 1 type of integer understanding that can function as either an obstacle or affordance for learners while they extend their numeric domains from whole numbers to include negative integers. In particular, we highlight 2 key subsets of integer reasoning: understanding or…

A symmetrical image encryption scheme in wavelet and time domain

NASA Astrophysics Data System (ADS)

Luo, Yuling; Du, Minghui; Liu, Junxiu

2015-02-01

There has been an increasing concern for effective storages and secure transactions of multimedia information over the Internet. Then a great variety of encryption schemes have been proposed to ensure the information security while transmitting, but most of current approaches are designed to diffuse the data only in spatial domain which result in reducing storage efficiency. A lightweight image encryption strategy based on chaos is proposed in this paper. The encryption process is designed in transform domain. The original image is decomposed into approximation and detail components using integer wavelet transform (IWT); then as the more important component of the image, the approximation coefficients are diffused by secret keys generated from a spatiotemporal chaotic system followed by inverse IWT to construct the diffused image; finally a plain permutation is performed for diffusion image by the Logistic mapping in order to reduce the correlation between adjacent pixels further. Experimental results and performance analysis demonstrate the proposed scheme is an efficient, secure and robust encryption mechanism and it realizes effective coding compression to satisfy desirable storage.

Anisotropic fractal media by vector calculus in non-integer dimensional space

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tarasov, Vasily E., E-mail: tarasov@theory.sinp.msu.ru

2014-08-15

A review of different approaches to describe anisotropic fractal media is proposed. In this paper, differentiation and integration non-integer dimensional and multi-fractional spaces are considered as tools to describe anisotropic fractal materials and media. We suggest a generalization of vector calculus for non-integer dimensional space by using a product measure method. The product of fractional and non-integer dimensional spaces allows us to take into account the anisotropy of the fractal media in the framework of continuum models. The integration over non-integer-dimensional spaces is considered. In this paper differential operators of first and second orders for fractional space and non-integer dimensionalmore » space are suggested. The differential operators are defined as inverse operations to integration in spaces with non-integer dimensions. Non-integer dimensional space that is product of spaces with different dimensions allows us to give continuum models for anisotropic type of the media. The Poisson's equation for fractal medium, the Euler-Bernoulli fractal beam, and the Timoshenko beam equations for fractal material are considered as examples of application of suggested generalization of vector calculus for anisotropic fractal materials and media.« less

Techniques for computing the discrete Fourier transform using the quadratic residue Fermat number systems

NASA Technical Reports Server (NTRS)

Truong, T. K.; Chang, J. J.; Hsu, I. S.; Pei, D. Y.; Reed, I. S.

1986-01-01

The complex integer multiplier and adder over the direct sum of two copies of finite field developed by Cozzens and Finkelstein (1985) is specialized to the direct sum of the rings of integers modulo Fermat numbers. Such multiplication over the rings of integers modulo Fermat numbers can be performed by means of two integer multiplications, whereas the complex integer multiplication requires three integer multiplications. Such multiplications and additions can be used in the implementation of a discrete Fourier transform (DFT) of a sequence of complex numbers. The advantage of the present approach is that the number of multiplications needed to compute a systolic array of the DFT can be reduced substantially. The architectural designs using this approach are regular, simple, expandable and, therefore, naturally suitable for VLSI implementation.

Scheduling algorithms for rapid imaging using agile Cubesat constellations

NASA Astrophysics Data System (ADS)

Nag, Sreeja; Li, Alan S.; Merrick, James H.

2018-02-01

Distributed Space Missions such as formation flight and constellations, are being recognized as important Earth Observation solutions to increase measurement samples over space and time. Cubesats are increasing in size (27U, ∼40 kg in development) with increasing capabilities to host imager payloads. Given the precise attitude control systems emerging in the commercial market, Cubesats now have the ability to slew and capture images within short notice. We propose a modular framework that combines orbital mechanics, attitude control and scheduling optimization to plan the time-varying, full-body orientation of agile Cubesats in a constellation such that they maximize the number of observed images and observation time, within the constraints of Cubesat hardware specifications. The attitude control strategy combines bang-bang and PD control, with constraints such as power consumption, response time, and stability factored into the optimality computations and a possible extension to PID control to account for disturbances. Schedule optimization is performed using dynamic programming with two levels of heuristics, verified and improved upon using mixed integer linear programming. The automated scheduler is expected to run on ground station resources and the resultant schedules uplinked to the satellites for execution, however it can be adapted for onboard scheduling, contingent on Cubesat hardware and software upgrades. The framework is generalizable over small steerable spacecraft, sensor specifications, imaging objectives and regions of interest, and is demonstrated using multiple 20 kg satellites in Low Earth Orbit for two case studies - rapid imaging of Landsat's land and coastal images and extended imaging of global, warm water coral reefs. The proposed algorithm captures up to 161% more Landsat images than nadir-pointing sensors with the same field of view, on a 2-satellite constellation over a 12-h simulation. Integer programming was able to verify that optimality of the dynamic programming solution for single satellites was within 10%, and find up to 5% more optimal solutions. The optimality gap for constellations was found to be 22% at worst, but the dynamic programming schedules were found at nearly four orders of magnitude better computational speed than integer programming. The algorithm can include cloud cover predictions, ground downlink windows or any other spatial, temporal or angular constraints into the orbital module and be integrated into planning tools for agile constellations.

Case study and lessons learned for the Great Lakes ITS Program, Airport ITS Integration and the Road Infrastructure Management System projects, final report, Wayne County, Michigan

DOT National Transportation Integrated Search

2007-03-02

This report presents the case study and lessons learned for the national evaluation of the Great Lakes Intelligent Transportation Systems (GLITS) Airport ITS Integration and Road Infrastructure Management System (RIMS) projects. The Airport ITS Integ...

A Procedure Using Calculators to Express Answers in Fractional Form.

ERIC Educational Resources Information Center

Carlisle, Earnest

A procedure is described that enables students to perform operations on fractions with a calculator, expressing the answer as a fraction. Patterns using paper-and-pencil procedures for each operation with fractions are presented. A microcomputer software program illustrates how the answer can be found using integer values of the numerators and…

Automated Test-Form Generation

ERIC Educational Resources Information Center

van der Linden, Wim J.; Diao, Qi

2011-01-01

In automated test assembly (ATA), the methodology of mixed-integer programming is used to select test items from an item bank to meet the specifications for a desired test form and optimize its measurement accuracy. The same methodology can be used to automate the formatting of the set of selected items into the actual test form. Three different…

A strategic assessment of biofuels development in the Western States

Treesearch

Kenneth E. Skog; Robert Rummer; Bryan Jenkins; Nathan Parker; Peter Tittman; Quinn Hart; Richard Nelson; Ed Gray; Anneliese Schmidt; Marcia Patton-Mallory; Gordon Gayle

2009-01-01

The Western Governors' Association assessment of biofuels potential in western states estimated the location and capacity of biofuels plants that could potentially be built for selected gasoline prices in 2015 using a mixed integer programming model. The model included information on forest biomass supply curves by county (developed using Forest Service FIA data...

An Integer Programming-Based Generalized Vehicle Routing Approach for Printed Circuit Board Assembly Optimization

ERIC Educational Resources Information Center

Seth, Anupam

2009-01-01

Production planning and scheduling for printed circuit, board assembly has so far defied standard operations research approaches due to the size and complexity of the underlying problems, resulting in unexploited automation flexibility. In this thesis, the increasingly popular collect-and-place machine configuration is studied and the assembly…

Elements of Mathematics, Book O: Intuitive Background. Chapter 2, The Integers.

ERIC Educational Resources Information Center

Exner, Robert; And Others

The sixteen chapters of this book provide the core materials for the Elements of Mathematics Program, a secondary sequence developed for highly motivated students with strong verbal abilities. The sequence is based on a functional-relational approach to mathematics teaching, and emphasizes teaching by analysis of real-life situations. This text is…

Algorithms for Scheduling and Network Problems

DTIC Science & Technology

1991-09-01

time. We already know, by Lemma 2.2.1, that WOPT = O(log( mpU )), so if we could solve this integer program optimally we would be done. However, the...Folydirat, 15:177-191, 1982. [6] I.S. Belov and Ya. N. Stolin. An algorithm in a single path operations scheduling problem. In Mathematical Economics and

Enhancing Autonomy of Aerial Systems Via Integration of Visual Sensors into Their Avionics Suite

DTIC Science & Technology

2016-09-01

aerial platform for subsequent visual sensor integration. 14. SUBJECT TERMS autonomous system, quadrotors, direct method, inverse ...CONTROLLER ARCHITECTURE .....................................................43 B. INVERSE DYNAMICS IN THE VIRTUAL DOMAIN ......................45 1...control station GPS Global-Positioning System IDVD inverse dynamics in the virtual domain ILP integer linear program INS inertial-navigation system

The Efficiency of Split Panel Designs in an Analysis of Variance Model

PubMed Central

Wang, Wei-Guo; Liu, Hai-Jun

2016-01-01

We consider split panel design efficiency in analysis of variance models, that is, the determination of the cross-sections series optimal proportion in all samples, to minimize parametric best linear unbiased estimators of linear combination variances. An orthogonal matrix is constructed to obtain manageable expression of variances. On this basis, we derive a theorem for analyzing split panel design efficiency irrespective of interest and budget parameters. Additionally, relative estimator efficiency based on the split panel to an estimator based on a pure panel or a pure cross-section is present. The analysis shows that the gains from split panel can be quite substantial. We further consider the efficiency of split panel design, given a budget, and transform it to a constrained nonlinear integer programming. Specifically, an efficient algorithm is designed to solve the constrained nonlinear integer programming. Moreover, we combine one at time designs and factorial designs to illustrate the algorithm’s efficiency with an empirical example concerning monthly consumer expenditure on food in 1985, in the Netherlands, and the efficient ranges of the algorithm parameters are given to ensure a good solution. PMID:27163447

A farm-level precision land management framework based on integer programming

PubMed Central

Li, Qi; Hu, Guiping; Jubery, Talukder Zaki; Ganapathysubramanian, Baskar

2017-01-01

Farmland management involves several planning and decision making tasks including seed selection and irrigation management. A farm-level precision farmland management model based on mixed integer linear programming is proposed in this study. Optimal decisions are designed for pre-season planning of crops and irrigation water allocation. The model captures the effect of size and shape of decision scale as well as special irrigation patterns. The authors illustrate the model with a case study on a farm in the state of California in the U.S. and show the model can capture the impact of precision farm management on profitability. The results show that threefold increase of annual net profit for farmers could be achieved by carefully choosing irrigation and seed selection. Although farmers could increase profits by applying precision management to seed or irrigation alone, profit increase is more significant if farmers apply precision management on seed and irrigation simultaneously. The proposed model can also serve as a risk analysis tool for farmers facing seasonal irrigation water limits as well as a quantitative tool to explore the impact of precision agriculture. PMID:28346499

Microgrid Optimal Scheduling With Chance-Constrained Islanding Capability

DOE PAGES

Liu, Guodong; Starke, Michael R.; Xiao, B.; ...

2017-01-13

To facilitate the integration of variable renewable generation and improve the resilience of electricity sup-ply in a microgrid, this paper proposes an optimal scheduling strategy for microgrid operation considering constraints of islanding capability. A new concept, probability of successful islanding (PSI), indicating the probability that a microgrid maintains enough spinning reserve (both up and down) to meet local demand and accommodate local renewable generation after instantaneously islanding from the main grid, is developed. The PSI is formulated as mixed-integer linear program using multi-interval approximation taking into account the probability distributions of forecast errors of wind, PV and load. With themore » goal of minimizing the total operating cost while preserving user specified PSI, a chance-constrained optimization problem is formulated for the optimal scheduling of mirogrids and solved by mixed integer linear programming (MILP). Numerical simulations on a microgrid consisting of a wind turbine, a PV panel, a fuel cell, a micro-turbine, a diesel generator and a battery demonstrate the effectiveness of the proposed scheduling strategy. Lastly, we verify the relationship between PSI and various factors.« less

A hybrid inventory management system respondingto regular demand and surge demand

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mohammad S. Roni; Mingzhou Jin; Sandra D. Eksioglu

2014-06-01

This paper proposes a hybrid policy for a stochastic inventory system facing regular demand and surge demand. The combination of two different demand patterns can be observed in many areas, such as healthcare inventory and humanitarian supply chain management. The surge demand has a lower arrival rate but higher demand volume per arrival. The solution approach proposed in this paper incorporates the level crossing method and mixed integer programming technique to optimize the hybrid inventory policy with both regular orders and emergency orders. The level crossing method is applied to obtain the equilibrium distributions of inventory levels under a givenmore » policy. The model is further transformed into a mixed integer program to identify an optimal hybrid policy. A sensitivity analysis is conducted to investigate the impact of parameters on the optimal inventory policy and minimum cost. Numerical results clearly show the benefit of using the proposed hybrid inventory model. The model and solution approach could help healthcare providers or humanitarian logistics providers in managing their emergency supplies in responding to surge demands.« less

Chemotherapy appointment scheduling under uncertainty using mean-risk stochastic integer programming.

PubMed

Alvarado, Michelle; Ntaimo, Lewis

2018-03-01

Oncology clinics are often burdened with scheduling large volumes of cancer patients for chemotherapy treatments under limited resources such as the number of nurses and chairs. These cancer patients require a series of appointments over several weeks or months and the timing of these appointments is critical to the treatment's effectiveness. Additionally, the appointment duration, the acuity levels of each appointment, and the availability of clinic nurses are uncertain. The timing constraints, stochastic parameters, rising treatment costs, and increased demand of outpatient oncology clinic services motivate the need for efficient appointment schedules and clinic operations. In this paper, we develop three mean-risk stochastic integer programming (SIP) models, referred to as SIP-CHEMO, for the problem of scheduling individual chemotherapy patient appointments and resources. These mean-risk models are presented and an algorithm is devised to improve computational speed. Computational results were conducted using a simulation model and results indicate that the risk-averse SIP-CHEMO model with the expected excess mean-risk measure can decrease patient waiting times and nurse overtime when compared to deterministic scheduling algorithms by 42 % and 27 %, respectively.

Supporting Dynamic Spectrum Access in Heterogeneous LTE+ Networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Luiz A. DaSilva; Ryan E. Irwin; Mike Benonis

As early as 2014, mobile network operators’ spectral capac- ity is expected to be overwhelmed by the demand brought on by new devices and applications. With Long Term Evo- lution Advanced (LTE+) networks likely as the future one world 4G standard, network operators may need to deploy a Dynamic Spectrum Access (DSA) overlay in Heterogeneous Networks (HetNets) to extend coverage, increase spectrum efficiency, and increase the capacity of these networks. In this paper, we propose three new management frameworks for DSA in an LTE+ HetNet: Spectrum Accountability Client, Cell Spectrum Management, and Domain Spectrum Man- agement. For these spectrum managementmore » frameworks, we define protocol interfaces and operational signaling scenar- ios to support cooperative sensing, spectrum lease manage- ment, and alarm scenarios for rule adjustment. We also quan- tify, through integer programs, the benefits of using DSA in an LTE+ HetNet, that can opportunistically reuse vacant TV and GSM spectrum. Using integer programs, we consider a topology using Geographic Information System data from the Blacksburg, VA metro area to assess the realistic benefits of DSA in an LTE+ HetNet.« less

Two Methods for Efficient Solution of the Hitting-Set Problem

NASA Technical Reports Server (NTRS)

Vatan, Farrokh; Fijany, Amir

2005-01-01

A paper addresses much of the same subject matter as that of Fast Algorithms for Model-Based Diagnosis (NPO-30582), which appears elsewhere in this issue of NASA Tech Briefs. However, in the paper, the emphasis is more on the hitting-set problem (also known as the transversal problem), which is well known among experts in combinatorics. The authors primary interest in the hitting-set problem lies in its connection to the diagnosis problem: it is a theorem of model-based diagnosis that in the set-theory representation of the components of a system, the minimal diagnoses of a system are the minimal hitting sets of the system. In the paper, the hitting-set problem (and, hence, the diagnosis problem) is translated from a combinatorial to a computational problem by mapping it onto the Boolean satisfiability and integer- programming problems. The paper goes on to describe developments nearly identical to those summarized in the cited companion NASA Tech Briefs article, including the utilization of Boolean-satisfiability and integer- programming techniques to reduce the computation time and/or memory needed to solve the hitting-set problem.

Integer-Linear-Programing Optimization in Scalable Video Multicast with Adaptive Modulation and Coding in Wireless Networks

PubMed Central

Lee, Chaewoo

2014-01-01

The advancement in wideband wireless network supports real time services such as IPTV and live video streaming. However, because of the sharing nature of the wireless medium, efficient resource allocation has been studied to achieve a high level of acceptability and proliferation of wireless multimedia. Scalable video coding (SVC) with adaptive modulation and coding (AMC) provides an excellent solution for wireless video streaming. By assigning different modulation and coding schemes (MCSs) to video layers, SVC can provide good video quality to users in good channel conditions and also basic video quality to users in bad channel conditions. For optimal resource allocation, a key issue in applying SVC in the wireless multicast service is how to assign MCSs and the time resources to each SVC layer in the heterogeneous channel condition. We formulate this problem with integer linear programming (ILP) and provide numerical results to show the performance under 802.16 m environment. The result shows that our methodology enhances the overall system throughput compared to an existing algorithm. PMID:25276862

Checking Equivalence of SPMD Programs Using Non-Interference

DTIC Science & Technology

2010-01-29

with it hopes to go beyond the limits of Moore’s law, but also worries that programming will become harder [5]. One of the reasons why parallel...array name in G or L, and e is an arithmetic expression of integer type. In the CUDA code shown in Section 3, b and t are represented by coreId and...b+ t. A second, optimized version of the program (using function “reverse2”, see Section 3) can be modeled as a tuple P2 = ( G ,L2, F 2), with G same

Parallel scheduling of recursively defined arrays

NASA Technical Reports Server (NTRS)

Myers, T. J.; Gokhale, M. B.

1986-01-01

A new method of automatic generation of concurrent programs which constructs arrays defined by sets of recursive equations is described. It is assumed that the time of computation of an array element is a linear combination of its indices, and integer programming is used to seek a succession of hyperplanes along which array elements can be computed concurrently. The method can be used to schedule equations involving variable length dependency vectors and mutually recursive arrays. Portions of the work reported here have been implemented in the PS automatic program generation system.

Sums of Consecutive Integers

ERIC Educational Resources Information Center

Pong, Wai Yan

2007-01-01

We begin by answering the question, "Which natural numbers are sums of consecutive integers?" We then go on to explore the set of lengths (numbers of summands) in the decompositions of an integer as such sums.

lsjk—a C++ library for arbitrary-precision numeric evaluation of the generalized log-sine functions

NASA Astrophysics Data System (ADS)

Kalmykov, M. Yu.; Sheplyakov, A.

2005-10-01

Generalized log-sine functions Lsj(k)(θ) appear in higher order ɛ-expansion of different Feynman diagrams. We present an algorithm for the numerical evaluation of these functions for real arguments. This algorithm is implemented as a C++ library with arbitrary-precision arithmetics for integer 0⩽k⩽9 and j⩾2. Some new relations and representations of the generalized log-sine functions are given. Program summaryTitle of program:lsjk Catalogue number:ADVS Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADVS Program obtained from: CPC Program Library, Queen's University of Belfast, N. Ireland Licensing terms: GNU General Public License Computers:all Operating systems:POSIX Programming language:C++ Memory required to execute:Depending on the complexity of the problem, at least 32 MB RAM recommended No. of lines in distributed program, including testing data, etc.:41 975 No. of bytes in distributed program, including testing data, etc.:309 156 Distribution format:tar.gz Other programs called:The CLN library for arbitrary-precision arithmetics is required at version 1.1.5 or greater External files needed:none Nature of the physical problem:Numerical evaluation of the generalized log-sine functions for real argument in the region 0<θ<π. These functions appear in Feynman integrals Method of solution:Series representation for the real argument in the region 0<θ<π Restriction on the complexity of the problem:Limited up to Lsj(9)(θ), and j is an arbitrary integer number. Thus, all function up to the weight 12 in the region 0<θ<π can be evaluated. The algorithm can be extended up to higher values of k(k>9) without modification Typical running time:Depending on the complexity of problem. See text below.

DB90: A Fortran Callable Relational Database Routine for Scientific and Engineering Computer Programs

NASA Technical Reports Server (NTRS)

Wrenn, Gregory A.

2005-01-01

This report describes a database routine called DB90 which is intended for use with scientific and engineering computer programs. The software is written in the Fortran 90/95 programming language standard with file input and output routines written in the C programming language. These routines should be completely portable to any computing platform and operating system that has Fortran 90/95 and C compilers. DB90 allows a program to supply relation names and up to 5 integer key values to uniquely identify each record of each relation. This permits the user to select records or retrieve data in any desired order.

Synchronic interval Gaussian mixed-integer programming for air quality management.

PubMed

Cheng, Guanhui; Huang, Guohe Gordon; Dong, Cong

2015-12-15

To reveal the synchronism of interval uncertainties, the tradeoff between system optimality and security, the discreteness of facility-expansion options, the uncertainty of pollutant dispersion processes, and the seasonality of wind features in air quality management (AQM) systems, a synchronic interval Gaussian mixed-integer programming (SIGMIP) approach is proposed in this study. A robust interval Gaussian dispersion model is developed for approaching the pollutant dispersion process under interval uncertainties and seasonal variations. The reflection of synchronic effects of interval uncertainties in the programming objective is enabled through introducing interval functions. The proposition of constraint violation degrees helps quantify the tradeoff between system optimality and constraint violation under interval uncertainties. The overall optimality of system profits of an SIGMIP model is achieved based on the definition of an integrally optimal solution. Integer variables in the SIGMIP model are resolved by the existing cutting-plane method. Combining these efforts leads to an effective algorithm for the SIGMIP model. An application to an AQM problem in a region in Shandong Province, China, reveals that the proposed SIGMIP model can facilitate identifying the desired scheme for AQM. The enhancement of the robustness of optimization exercises may be helpful for increasing the reliability of suggested schemes for AQM under these complexities. The interrelated tradeoffs among control measures, emission sources, flow processes, receptors, influencing factors, and economic and environmental goals are effectively balanced. Interests of many stakeholders are reasonably coordinated. The harmony between economic development and air quality control is enabled. Results also indicate that the constraint violation degree is effective at reflecting the compromise relationship between constraint-violation risks and system optimality under interval uncertainties. This can help decision makers mitigate potential risks, e.g. insufficiency of pollutant treatment capabilities, exceedance of air quality standards, deficiency of pollution control fund, or imbalance of economic or environmental stress, in the process of guiding AQM. Copyright © 2015 Elsevier B.V. All rights reserved.

TH-EF-BRB-04: 4π Dynamic Conformal Arc Therapy Dynamic Conformal Arc Therapy (DCAT) for SBRT

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chiu, T; Long, T; Tian, Z.

2016-06-15

Purpose: To develop an efficient and effective trajectory optimization methodology for 4π dynamic conformal arc treatment (4π DCAT) with synchronized gantry and couch motion; and to investigate potential clinical benefits for stereotactic body radiation therapy (SBRT) to breast, lung, liver and spine tumors. Methods: The entire optimization framework for 4π DCAT inverse planning consists of two parts: 1) integer programming algorithm and 2) particle swarm optimization (PSO) algorithm. The integer programming is designed to find an optimal solution for arc delivery trajectory with both couch and gantry rotation, while PSO minimize a non-convex objective function based on the selected trajectorymore » and dose-volume constraints. In this study, control point interaction is explicitly taken into account. Beam trajectory was modeled as a series of control points connected together to form a deliverable path. With linear treatment planning objectives, a mixed-integer program (MIP) was formulated. Under mild assumptions, the MIP is tractable. Assigning monitor units to control points along the path can be integrated into the model and done by PSO. The developed 4π DCAT inverse planning strategy is evaluated on SBRT cases and compared to clinically treated plans. Results: The resultant dose distribution of this technique was evaluated between 3D conformal treatment plan generated by Pinnacle treatment planning system and 4π DCAT on a lung SBRT patient case. Both plans share the same scale of MU, 3038 and 2822 correspondingly to 3D conformal plan and 4π DCAT. The mean doses for most of OARs were greatly reduced at 32% (cord), 70% (esophagus), 2.8% (lung) and 42.4% (stomach). Conclusion: Initial results in this study show the proposed 4π DCAT treatment technique can achieve better OAR sparing and lower MUs, which indicates that the developed technique is promising for high dose SBRT to reduce the risk of secondary cancer.« less

Bi-objective integer programming for RNA secondary structure prediction with pseudoknots.

PubMed

Legendre, Audrey; Angel, Eric; Tahi, Fariza

2018-01-15

RNA structure prediction is an important field in bioinformatics, and numerous methods and tools have been proposed. Pseudoknots are specific motifs of RNA secondary structures that are difficult to predict. Almost all existing methods are based on a single model and return one solution, often missing the real structure. An alternative approach would be to combine different models and return a (small) set of solutions, maximizing its quality and diversity in order to increase the probability that it contains the real structure. We propose here an original method for predicting RNA secondary structures with pseudoknots, based on integer programming. We developed a generic bi-objective integer programming algorithm allowing to return optimal and sub-optimal solutions optimizing simultaneously two models. This algorithm was then applied to the combination of two known models of RNA secondary structure prediction, namely MEA and MFE. The resulting tool, called BiokoP, is compared with the other methods in the literature. The results show that the best solution (structure with the highest F 1 -score) is, in most cases, given by BiokoP. Moreover, the results of BiokoP are homogeneous, regardless of the pseudoknot type or the presence or not of pseudoknots. Indeed, the F 1 -scores are always higher than 70% for any number of solutions returned. The results obtained by BiokoP show that combining the MEA and the MFE models, as well as returning several optimal and several sub-optimal solutions, allow to improve the prediction of secondary structures. One perspective of our work is to combine better mono-criterion models, in particular to combine a model based on the comparative approach with the MEA and the MFE models. This leads to develop in the future a new multi-objective algorithm to combine more than two models. BiokoP is available on the EvryRNA platform: https://EvryRNA.ibisc.univ-evry.fr .

AKLSQF - LEAST SQUARES CURVE FITTING

NASA Technical Reports Server (NTRS)

Kantak, A. V.

1994-01-01

The Least Squares Curve Fitting program, AKLSQF, computes the polynomial which will least square fit uniformly spaced data easily and efficiently. The program allows the user to specify the tolerable least squares error in the fitting or allows the user to specify the polynomial degree. In both cases AKLSQF returns the polynomial and the actual least squares fit error incurred in the operation. The data may be supplied to the routine either by direct keyboard entry or via a file. AKLSQF produces the least squares polynomial in two steps. First, the data points are least squares fitted using the orthogonal factorial polynomials. The result is then reduced to a regular polynomial using Sterling numbers of the first kind. If an error tolerance is specified, the program starts with a polynomial of degree 1 and computes the least squares fit error. The degree of the polynomial used for fitting is then increased successively until the error criterion specified by the user is met. At every step the polynomial as well as the least squares fitting error is printed to the screen. In general, the program can produce a curve fitting up to a 100 degree polynomial. All computations in the program are carried out under Double Precision format for real numbers and under long integer format for integers to provide the maximum accuracy possible. AKLSQF was written for an IBM PC X/AT or compatible using Microsoft's Quick Basic compiler. It has been implemented under DOS 3.2.1 using 23K of RAM. AKLSQF was developed in 1989.

Analysis misconception of integers in microteaching activities

NASA Astrophysics Data System (ADS)

Setyawati, R. D.; Indiati, I.

2018-05-01

This study view to analyse student misconceptions on integers in microteaching activities. This research used qualitative research design. An integers test contained questions from eight main areas of integers. The Integers material test includes (a) converting the image into fractions, (b) examples of positive numbers including rational numbers, (c) operations in fractions, (d) sorting fractions from the largest to the smallest, and vice versa; e) equate denominator, (f) concept of ratio mark, (g) definition of fraction, and (h) difference between fractions and parts. The results indicated an integers concepts: (1) the students have not been able to define concepts well based on the classification of facts in organized part; (2) The correlational concept: students have not been able to combine interrelated events in the form of general principles; and (3) theoretical concepts: students have not been able to use concepts that facilitate in learning the facts or events in an organized system.

Fractal electrodynamics via non-integer dimensional space approach

NASA Astrophysics Data System (ADS)

Tarasov, Vasily E.

2015-09-01

Using the recently suggested vector calculus for non-integer dimensional space, we consider electrodynamics problems in isotropic case. This calculus allows us to describe fractal media in the framework of continuum models with non-integer dimensional space. We consider electric and magnetic fields of fractal media with charges and currents in the framework of continuum models with non-integer dimensional spaces. An application of the fractal Gauss's law, the fractal Ampere's circuital law, the fractal Poisson equation for electric potential, and equation for fractal stream of charges are suggested. Lorentz invariance and speed of light in fractal electrodynamics are discussed. An expression for effective refractive index of non-integer dimensional space is suggested.

A combinatorial approach to the design of vaccines.

PubMed

Martínez, Luis; Milanič, Martin; Legarreta, Leire; Medvedev, Paul; Malaina, Iker; de la Fuente, Ildefonso M

2015-05-01

We present two new problems of combinatorial optimization and discuss their applications to the computational design of vaccines. In the shortest λ-superstring problem, given a family S1,...,S(k) of strings over a finite alphabet, a set Τ of "target" strings over that alphabet, and an integer λ, the task is to find a string of minimum length containing, for each i, at least λ target strings as substrings of S(i). In the shortest λ-cover superstring problem, given a collection X1,...,X(n) of finite sets of strings over a finite alphabet and an integer λ, the task is to find a string of minimum length containing, for each i, at least λ elements of X(i) as substrings. The two problems are polynomially equivalent, and the shortest λ-cover superstring problem is a common generalization of two well known combinatorial optimization problems, the shortest common superstring problem and the set cover problem. We present two approaches to obtain exact or approximate solutions to the shortest λ-superstring and λ-cover superstring problems: one based on integer programming, and a hill-climbing algorithm. An application is given to the computational design of vaccines and the algorithms are applied to experimental data taken from patients infected by H5N1 and HIV-1.

Density of Primitive Pythagorean Triples

ERIC Educational Resources Information Center

Killen, Duncan A.

2004-01-01

Based on the properties of a Primitive Pythagorean Triple (PPT), a computer program was written to generate, print, and count all PPTs greater than or equal to I[subscript x], where I[subscript x] is an arbitrarily chosen integer. The Density of Primitive Pythagorean Triples may be defined as the ratio of the number of PPTs whose hypotenuse is…

Applying ant colony optimization metaheuristic to solve forest transportation planning problems with side constraints

Treesearch

Marco A. Contreras; Woodam Chung; Greg Jones

2008-01-01

Forest transportation planning problems (FTPP) have evolved from considering only the financial aspects of timber management to more holistic problems that also consider the environmental impacts of roads. These additional requirements have introduced side constraints, making FTPP larger and more complex. Mixed-integer programming (MIP) has been used to solve FTPP, but...

Going Around On Circles: Mathematics and Computer Art. Part 2.

ERIC Educational Resources Information Center

Gordon, Sheldon P.; Gordon, Florence S.

1984-01-01

Discusses properties of epicycloids. (The easiest way to picture them is to think of a piece of radioactive bubble gum attached to a wheel which is rolling around the outside of a larger wheel.) Includes a computer program (TRS-80 color computer) that will graph any epicycloid with integer values for the radii. (JN)

Dynamic reserve selection: Optimal land retention with land-price feedbacks

Treesearch

Sandor F. Toth; Robert G. Haight; Luke W. Rogers

2011-01-01

Urban growth compromises open space and ecosystem functions. To mitigate the negative effects, some agencies use reserve selection models to identify conservation sites for purchase or retention. Existing models assume that conservation has no impact on nearby land prices. We propose a new integer program that relaxes this assumption via adaptive cost coefficients. Our...

Integrating Test-Form Formatting into Automated Test Assembly

ERIC Educational Resources Information Center

Diao, Qi; van der Linden, Wim J.

2013-01-01

Automated test assembly uses the methodology of mixed integer programming to select an optimal set of items from an item bank. Automated test-form generation uses the same methodology to optimally order the items and format the test form. From an optimization point of view, production of fully formatted test forms directly from the item pool using…

Large-Scale Multiobjective Static Test Generation for Web-Based Testing with Integer Programming

ERIC Educational Resources Information Center

Nguyen, M. L.; Hui, Siu Cheung; Fong, A. C. M.

2013-01-01

Web-based testing has become a ubiquitous self-assessment method for online learning. One useful feature that is missing from today's web-based testing systems is the reliable capability to fulfill different assessment requirements of students based on a large-scale question data set. A promising approach for supporting large-scale web-based…

A Unified Approach to Optimization

DTIC Science & Technology

2014-10-02

employee scheduling, ad placement, latin squares, disjunctions of linear systems, temporal modeling with interval variables, and traveling salesman problems ...integrating technologies. A key to integrated modeling is to formulate a problem with high-levelmetaconstraints, which are inspired by the “global... problem substructure to the solver. This contrasts with the atomistic modeling style of mixed integer programming (MIP) and satisfiability (SAT) solvers

Equitably Distributing Quality of Marine Security Guards Using Integer Programming

DTIC Science & Technology

2013-03-01

Model for Fix-It Shop-Assignment (From Balakrishnan et al ., 2007...LP; Balakrishnan et al ., 2007). The Soviet mathematician A. N. Kolmogorov is recognized as the first person to conceptually develop the idea of LP...commercial sector today. Balakrishnan et al . (2007) captured the three major steps in LP, which are formulation, solution, and interpretation and

Parameterizing by the Number of Numbers

NASA Astrophysics Data System (ADS)

Fellows, Michael R.; Gaspers, Serge; Rosamond, Frances A.

The usefulness of parameterized algorithmics has often depended on what Niedermeier has called "the art of problem parameterization". In this paper we introduce and explore a novel but general form of parameterization: the number of numbers. Several classic numerical problems, such as Subset Sum, Partition, 3-Partition, Numerical 3-Dimensional Matching, and Numerical Matching with Target Sums, have multisets of integers as input. We initiate the study of parameterizing these problems by the number of distinct integers in the input. We rely on an FPT result for Integer Linear Programming Feasibility to show that all the above-mentioned problems are fixed-parameter tractable when parameterized in this way. In various applied settings, problem inputs often consist in part of multisets of integers or multisets of weighted objects (such as edges in a graph, or jobs to be scheduled). Such number-of-numbers parameterized problems often reduce to subproblems about transition systems of various kinds, parameterized by the size of the system description. We consider several core problems of this kind relevant to number-of-numbers parameterization. Our main hardness result considers the problem: given a non-deterministic Mealy machine M (a finite state automaton outputting a letter on each transition), an input word x, and a census requirement c for the output word specifying how many times each letter of the output alphabet should be written, decide whether there exists a computation of M reading x that outputs a word y that meets the requirement c. We show that this problem is hard for W[1]. If the question is whether there exists an input word x such that a computation of M on x outputs a word that meets c, the problem becomes fixed-parameter tractable.

Engineering calculations for solving the orbital allotment problem

NASA Technical Reports Server (NTRS)

Reilly, C.; Walton, E. K.; Mount-Campbell, C.; Caldecott, R.; Aebker, E.; Mata, F.

1988-01-01

Four approaches for calculating downlink interferences for shaped-beam antennas are described. An investigation of alternative mixed-integer programming models for satellite synthesis is summarized. Plans for coordinating the various programs developed under this grant are outlined. Two procedures for ordering satellites to initialize the k-permutation algorithm are proposed. Results are presented for the k-permutation algorithms. Feasible solutions are found for 5 of the 6 problems considered. Finally, it is demonstrated that the k-permutation algorithm can be used to solve arc allotment problems.

Mixed Integer Programming and Heuristic Scheduling for Space Communication

NASA Technical Reports Server (NTRS)

Lee, Charles H.; Cheung, Kar-Ming

2013-01-01

Optimal planning and scheduling for a communication network was created where the nodes within the network are communicating at the highest possible rates while meeting the mission requirements and operational constraints. The planning and scheduling problem was formulated in the framework of Mixed Integer Programming (MIP) to introduce a special penalty function to convert the MIP problem into a continuous optimization problem, and to solve the constrained optimization problem using heuristic optimization. The communication network consists of space and ground assets with the link dynamics between any two assets varying with respect to time, distance, and telecom configurations. One asset could be communicating with another at very high data rates at one time, and at other times, communication is impossible, as the asset could be inaccessible from the network due to planetary occultation. Based on the network's geometric dynamics and link capabilities, the start time, end time, and link configuration of each view period are selected to maximize the communication efficiency within the network. Mathematical formulations for the constrained mixed integer optimization problem were derived, and efficient analytical and numerical techniques were developed to find the optimal solution. By setting up the problem using MIP, the search space for the optimization problem is reduced significantly, thereby speeding up the solution process. The ratio of the dimension of the traditional method over the proposed formulation is approximately an order N (single) to 2*N (arraying), where N is the number of receiving antennas of a node. By introducing a special penalty function, the MIP problem with non-differentiable cost function and nonlinear constraints can be converted into a continuous variable problem, whose solution is possible.

Analysis of Modeling Assumptions used in Production Cost Models for Renewable Integration Studies

DOE Office of Scientific and Technical Information (OSTI.GOV)

Stoll, Brady; Brinkman, Gregory; Townsend, Aaron

2016-01-01

Renewable energy integration studies have been published for many different regions exploring the question of how higher penetration of renewable energy will impact the electric grid. These studies each make assumptions about the systems they are analyzing; however the effect of many of these assumptions has not been yet been examined and published. In this paper we analyze the impact of modeling assumptions in renewable integration studies, including the optimization method used (linear or mixed-integer programming) and the temporal resolution of the dispatch stage (hourly or sub-hourly). We analyze each of these assumptions on a large and a small systemmore » and determine the impact of each assumption on key metrics including the total production cost, curtailment of renewables, CO2 emissions, and generator starts and ramps. Additionally, we identified the impact on these metrics if a four-hour ahead commitment step is included before the dispatch step and the impact of retiring generators to reduce the degree to which the system is overbuilt. We find that the largest effect of these assumptions is at the unit level on starts and ramps, particularly for the temporal resolution, and saw a smaller impact at the aggregate level on system costs and emissions. For each fossil fuel generator type we measured the average capacity started, average run-time per start, and average number of ramps. Linear programming results saw up to a 20% difference in number of starts and average run time of traditional generators, and up to a 4% difference in the number of ramps, when compared to mixed-integer programming. Utilizing hourly dispatch instead of sub-hourly dispatch saw no difference in coal or gas CC units for either start metric, while gas CT units had a 5% increase in the number of starts and 2% increase in the average on-time per start. The number of ramps decreased up to 44%. The smallest effect seen was on the CO2 emissions and total production cost, with a 0.8% and 0.9% reduction respectively when using linear programming compared to mixed-integer programming and 0.07% and 0.6% reduction, respectively, in the hourly dispatch compared to sub-hourly dispatch.« less

Oilfield flooding polymer

DOEpatents

Martin, Fred D.; Hatch, Melvin J.; Shepitka, Joel S.; Donaruma, Lorraine G.

1986-01-01

A monomer, polymers containing the monomer, and the use of the polymer in oilfield flooding is disclosed. The subject monomer is represented by the general formula: ##STR1## wherein: n is an integer from 0 to about 4; m is an integer from 0 to about 6; a is an integer equal to at least 1 except where m is equal to 0, a must equal 0 and where m is equal to 1, a must equal 0 or 1; p is an integer from 2 to about 10; b is an integer equal to at least 1 and is of sufficient magnitude that the ratio b/p is at least 0.2; and q is an integer from 0 to 2. The number of hydroxy groups in the monomer is believed to be critical, and therefore the sum of (a+b) divided by the sum (m+p) should be at least 0.2. The moieties linked to the acrylic nitrogen can be joined to provide a ringed structure.

An Ada Linear-Algebra Software Package Modeled After HAL/S

NASA Technical Reports Server (NTRS)

Klumpp, Allan R.; Lawson, Charles L.

1990-01-01

New avionics software written more easily. Software package extends Ada programming language to include linear-algebra capabilities similar to those of HAL/S programming language. Designed for such avionics applications as Space Station flight software. In addition to built-in functions of HAL/S, package incorporates quaternion functions used in Space Shuttle and Galileo projects and routines from LINPAK solving systems of equations involving general square matrices. Contains two generic programs: one for floating-point computations and one for integer computations. Written on IBM/AT personal computer running under PC DOS, v.3.1.

A Paper-and-Pencil gcd Algorithm for Gaussian Integers

ERIC Educational Resources Information Center

Szabo, Sandor

2005-01-01

As with natural numbers, a greatest common divisor of two Gaussian (complex) integers "a" and "b" is a Gaussian integer "d" that is a common divisor of both "a" and "b". This article explores an algorithm for such gcds that is easy to do by hand.

Robust design of (s, S) inventory policy parameters in supply chains with demand and lead time uncertainties

NASA Astrophysics Data System (ADS)

Karimi Movahed, Kamran; Zhang, Zhi-Hai

2015-09-01

Demand and lead time uncertainties have significant effects on supply chain behaviour. In this paper, we present a single-product three-level multi-period supply chain with uncertain demands and lead times by using robust techniques to study the managerial insights of the supply chain inventory system under uncertainty. We formulate this problem as a robust mixed-integer linear program with minimised expected cost and total cost variation to determine the optimal (s, S) values of the inventory parameters. Several numerical studies are performed to investigate the supply chain behaviour. Useful guidelines for the design of a robust supply chain are also provided. Results show that the order variance and the expected cost in a supply chain significantly increase when the manufacturer's review period is an integer ratio of the distributor's and the retailer's review periods.

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

NASA Technical Reports Server (NTRS)

Truong, T. K.; Hsu, I. S.; Chang, J. J.; Shyu, H. C.; Reed, I. S.

1986-01-01

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.

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

NASA Technical Reports Server (NTRS)

Shyu, H. C.; Reed, I. S.; Truong, T. K.; Hsu, I. S.; Chang, J. J.

1987-01-01

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.

Elasticity of fractal materials using the continuum model with non-integer dimensional space

NASA Astrophysics Data System (ADS)

Tarasov, Vasily E.

2015-01-01

Using a generalization of vector calculus for space with non-integer dimension, we consider elastic properties of fractal materials. Fractal materials are described by continuum models with non-integer dimensional space. A generalization of elasticity equations for non-integer dimensional space, and its solutions for the equilibrium case of fractal materials are suggested. Elasticity problems for fractal hollow ball and cylindrical fractal elastic pipe with inside and outside pressures, for rotating cylindrical fractal pipe, for gradient elasticity and thermoelasticity of fractal materials are solved.

Innovative Teaching Games: Climbing the Hills of Math Skills. California Demonstration Mathematics Program.

ERIC Educational Resources Information Center

Pittsburg Unified School District, CA.

The card games in this publication are an alternative activity to help students master computational skills. Games for operations with whole numbers, fractions, decimals, percents, integers, and square roots are included. They can be used to introduce math topics and for practice and review, with either the whole class or in small groups with 2 to…

Optimizing Marine Corps Personnel Assignments Using an Integer Programming Model

DTIC Science & Technology

2012-12-01

Corps. vi THIS PAGE INTENTIONALLY LEFT BLANK vii TABLE OF CONTENTS I. INTRODUCTION ...throughout our careers. xvi THIS PAGE INTENTIONALLY LEFT BLANK 1 I. INTRODUCTION The Marine Corps Manpower and Reserve Affairs (M&RA) office has the...2012 BAH Rates-with Dependents. Defense Travel Mangement Office. (2011, December). 2012 BAH Rates-without Dependents. M ileage C ost 1 Per D iem

Discrete Optimization of Electronic Hyperpolarizabilities in a Chemical Subspace

DTIC Science & Technology

2009-05-01

molecular design. Methods for optimization in discrete spaces have been studied extensively and recently reviewed ( 5). Optimization methods include...integer programming, as in branch-and-bound techniques (including dead-end elimination [ 6]), simulated annealing ( 7), and genetic algorithms ( 8...These algorithms have found renewed interest and application in molecular and materials design (9- 12) . Recently, new approaches have been

Development of a Prototype H-46 Helicopter Diagnostic Expert System.

DTIC Science & Technology

1987-09-01

SQUADRON MAINTEN\\NCE: CURRENT PROCESS AND CA D S INTEG R ,ATIO N ........................................ 14 A. MAINTENANCE DATA SYSTEM...increasce the effectiveness of the maintenance process should enhance the ability of achieving :hee objectives. Artificial intelligence techniques offer a...completeiy validated. G. ORGANIZATION OF STUDY Chapter II contains a description of the Naval Aviation Maintenance Program’s Maintenance Data System (MDS

Learning oncogenetic networks by reducing to mixed integer linear programming.

PubMed

Shahrabi Farahani, Hossein; Lagergren, Jens

2013-01-01

Cancer can be a result of accumulation of different types of genetic mutations such as copy number aberrations. The data from tumors are cross-sectional and do not contain the temporal order of the genetic events. Finding the order in which the genetic events have occurred and progression pathways are of vital importance in understanding the disease. In order to model cancer progression, we propose Progression Networks, a special case of Bayesian networks, that are tailored to model disease progression. Progression networks have similarities with Conjunctive Bayesian Networks (CBNs) [1],a variation of Bayesian networks also proposed for modeling disease progression. We also describe a learning algorithm for learning Bayesian networks in general and progression networks in particular. We reduce the hard problem of learning the Bayesian and progression networks to Mixed Integer Linear Programming (MILP). MILP is a Non-deterministic Polynomial-time complete (NP-complete) problem for which very good heuristics exists. We tested our algorithm on synthetic and real cytogenetic data from renal cell carcinoma. We also compared our learned progression networks with the networks proposed in earlier publications. The software is available on the website https://bitbucket.org/farahani/diprog.

Should We Stop Developing Heuristics and Only Rely on Mixed Integer Programming Solvers in Automated Test Assembly? A Rejoinder to van der Linden and Li (2016).

PubMed

Chen, Pei-Hua

2017-05-01

This rejoinder responds to the commentary by van der Linden and Li entiled "Comment on Three-Element Item Selection Procedures for Multiple Forms Assembly: An Item Matching Approach" on the article "Three-Element Item Selection Procedures for Multiple Forms Assembly: An Item Matching Approach" by Chen. Van der Linden and Li made a strong statement calling for the cessation of test assembly heuristics development, and instead encouraged embracing mixed integer programming (MIP). This article points out the nondeterministic polynomial (NP)-hard nature of MIP problems and how solutions found using heuristics could be useful in an MIP context. Although van der Linden and Li provided several practical examples of test assembly supporting their view, the examples ignore the cases in which a slight change of constraints or item pool data might mean it would not be possible to obtain solutions as quickly as before. The article illustrates the use of heuristic solutions to improve both the performance of MIP solvers and the quality of solutions. Additional responses to the commentary by van der Linden and Li are included.

A bi-objective integer programming model for partly-restricted flight departure scheduling

PubMed Central

Guan, Wei; Zhang, Wenyi; Jiang, Shixiong; Fan, Lingling

2018-01-01

The normal studies on air traffic departure scheduling problem (DSP) mainly deal with an independent airport in which the departure traffic is not affected by surrounded airports, which, however, is not a consistent case. In reality, there still exist cases where several commercial airports are closely located and one of them possesses a higher priority. During the peak hours, the departure activities of the lower-priority airports are usually required to give way to those of higher-priority airport. These giving-way requirements can inflict a set of changes on the modeling of departure scheduling problem with respect to the lower-priority airports. To the best of our knowledge, studies on DSP under this condition are scarce. Accordingly, this paper develops a bi-objective integer programming model to address the flight departure scheduling of the partly-restricted (e.g., lower-priority) one among several adjacent airports. An adapted tabu search algorithm is designed to solve the current problem. It is demonstrated from the case study of Tianjin Binhai International Airport in China that the proposed method can obviously improve the operation efficiency, while still realizing superior equity and regularity among restricted flows. PMID:29715299

Accurate construction of consensus genetic maps via integer linear programming.

PubMed

Wu, Yonghui; Close, Timothy J; Lonardi, Stefano

2011-01-01

We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which is a directed graph that includes and is consistent with all (or, the vast majority of) the markers in the input maps. However, when markers in the individual maps have ordering conflicts, the resulting consensus map will contain cycles. Here, we formulate the problem of resolving cycles in the context of a parsimonious paradigm that takes into account two types of errors that may be present in the input maps, namely, local reshuffles and global displacements. The resulting combinatorial optimization problem is, in turn, expressed as an integer linear program. A fast approximation algorithm is proposed, and an additional speedup heuristic is developed. Our algorithms were implemented in a software tool named MERGEMAP which is freely available for academic use. An extensive set of experiments shows that MERGEMAP consistently outperforms JOINMAP, which is the most popular tool currently available for this task, both in terms of accuracy and running time. MERGEMAP is available for download at http://www.cs.ucr.edu/~yonghui/mgmap.html.

Analysis of the single-vehicle cyclic inventory routing problem

NASA Astrophysics Data System (ADS)

Aghezzaf, El-Houssaine; Zhong, Yiqing; Raa, Birger; Mateo, Manel

2012-11-01

The single-vehicle cyclic inventory routing problem (SV-CIRP) consists of a repetitive distribution of a product from a single depot to a selected subset of customers. For each customer, selected for replenishments, the supplier collects a corresponding fixed reward. The objective is to determine the subset of customers to replenish, the quantity of the product to be delivered to each and to design the vehicle route so that the resulting profit (difference between the total reward and the total logistical cost) is maximised while preventing stockouts at each of the selected customers. This problem appears often as a sub-problem in many logistical problems. In this article, the SV-CIRP is formulated as a mixed-integer program with a nonlinear objective function. After a thorough analysis of the structure of the problem and its features, an exact algorithm for its solution is proposed. This exact algorithm requires only solutions of linear mixed-integer programs. Values of a savings-based heuristic for this problem are compared to the optimal values obtained for a set of some test problems. In general, the gap may get as large as 25%, which justifies the effort to continue exploring and developing exact and approximation algorithms for the SV-CIRP.

MIP models for connected facility location: A theoretical and computational study☆

PubMed Central

Gollowitzer, Stefan; Ljubić, Ivana

2011-01-01

This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines facility location and Steiner trees: given a set of customers, a set of potential facility locations and some inter-connection nodes, ConFL searches for the minimum-cost way of assigning each customer to exactly one open facility, and connecting the open facilities via a Steiner tree. The costs needed for building the Steiner tree, facility opening costs and the assignment costs need to be minimized. We model ConFL using seven compact and three mixed integer programming formulations of exponential size. We also show how to transform ConFL into the Steiner arborescence problem. A full hierarchy between the models is provided. For two exponential size models we develop a branch-and-cut algorithm. An extensive computational study is based on two benchmark sets of randomly generated instances with up to 1300 nodes and 115,000 edges. We empirically compare the presented models with respect to the quality of obtained bounds and the corresponding running time. We report optimal values for all but 16 instances for which the obtained gaps are below 0.6%. PMID:25009366

Quantum-Inspired Maximizer

NASA Technical Reports Server (NTRS)

Zak, Michail

2008-01-01

A report discusses an algorithm for a new kind of dynamics based on a quantum- classical hybrid-quantum-inspired maximizer. The model is represented by a modified Madelung equation in which the quantum potential is replaced by different, specially chosen 'computational' potential. As a result, the dynamics attains both quantum and classical properties: it preserves superposition and entanglement of random solutions, while allowing one to measure its state variables, using classical methods. Such optimal combination of characteristics is a perfect match for quantum-inspired computing. As an application, an algorithm for global maximum of an arbitrary integrable function is proposed. The idea of the proposed algorithm is very simple: based upon the Quantum-inspired Maximizer (QIM), introduce a positive function to be maximized as the probability density to which the solution is attracted. Then the larger value of this function will have the higher probability to appear. Special attention is paid to simulation of integer programming and NP-complete problems. It is demonstrated that the problem of global maximum of an integrable function can be found in polynomial time by using the proposed quantum- classical hybrid. The result is extended to a constrained maximum with applications to integer programming and TSP (Traveling Salesman Problem).

A bi-objective integer programming model for partly-restricted flight departure scheduling.

PubMed

Zhong, Han; Guan, Wei; Zhang, Wenyi; Jiang, Shixiong; Fan, Lingling

2018-01-01

The normal studies on air traffic departure scheduling problem (DSP) mainly deal with an independent airport in which the departure traffic is not affected by surrounded airports, which, however, is not a consistent case. In reality, there still exist cases where several commercial airports are closely located and one of them possesses a higher priority. During the peak hours, the departure activities of the lower-priority airports are usually required to give way to those of higher-priority airport. These giving-way requirements can inflict a set of changes on the modeling of departure scheduling problem with respect to the lower-priority airports. To the best of our knowledge, studies on DSP under this condition are scarce. Accordingly, this paper develops a bi-objective integer programming model to address the flight departure scheduling of the partly-restricted (e.g., lower-priority) one among several adjacent airports. An adapted tabu search algorithm is designed to solve the current problem. It is demonstrated from the case study of Tianjin Binhai International Airport in China that the proposed method can obviously improve the operation efficiency, while still realizing superior equity and regularity among restricted flows.

Discovery of Boolean metabolic networks: integer linear programming based approach.

PubMed

Qiu, Yushan; Jiang, Hao; Ching, Wai-Ki; Cheng, Xiaoqing

2018-04-11

Traditional drug discovery methods focused on the efficacy of drugs rather than their toxicity. However, toxicity and/or lack of efficacy are produced when unintended targets are affected in metabolic networks. Thus, identification of biological targets which can be manipulated to produce the desired effect with minimum side-effects has become an important and challenging topic. Efficient computational methods are required to identify the drug targets while incurring minimal side-effects. In this paper, we propose a graph-based computational damage model that summarizes the impact of enzymes on compounds in metabolic networks. An efficient method based on Integer Linear Programming formalism is then developed to identify the optimal enzyme-combination so as to minimize the side-effects. The identified target enzymes for known successful drugs are then verified by comparing the results with those in the existing literature. Side-effects reduction plays a crucial role in the study of drug development. A graph-based computational damage model is proposed and the theoretical analysis states the captured problem is NP-completeness. The proposed approaches can therefore contribute to the discovery of drug targets. Our developed software is available at " http://hkumath.hku.hk/~wkc/APBC2018-metabolic-network.zip ".

A combined MOIP-MCDA approach to building and screening atmospheric pollution control strategies in urban regions.

PubMed

Mavrotas, George; Ziomas, Ioannis C; Diakouaki, Danae

2006-07-01

This article presents a methodological approach for the formulation of control strategies capable of reducing atmospheric pollution at the standards set by European legislation. The approach was implemented in the greater area of Thessaloniki and was part of a project aiming at the compliance with air quality standards in five major cities in Greece. The methodological approach comprises two stages: in the first stage, the availability of several measures contributing to a certain extent to reducing atmospheric pollution indicates a combinatorial problem and favors the use of Integer Programming. More specifically, Multiple Objective Integer Programming is used in order to generate alternative efficient combinations of the available policy measures on the basis of two conflicting objectives: public expenditure minimization and social acceptance maximization. In the second stage, these combinations of control measures (i.e., the control strategies) are then comparatively evaluated with respect to a wider set of criteria, using tools from Multiple Criteria Decision Analysis, namely, the well-known PROMETHEE method. The whole procedure is based on the active involvement of local and central authorities in order to incorporate their concerns and preferences, as well as to secure the adoption and implementation of the resulting solution.

Mixed Integer Linear Programming based machine learning approach identifies regulators of telomerase in yeast.

PubMed

Poos, Alexandra M; Maicher, André; Dieckmann, Anna K; Oswald, Marcus; Eils, Roland; Kupiec, Martin; Luke, Brian; König, Rainer

2016-06-02

Understanding telomere length maintenance mechanisms is central in cancer biology as their dysregulation is one of the hallmarks for immortalization of cancer cells. Important for this well-balanced control is the transcriptional regulation of the telomerase genes. We integrated Mixed Integer Linear Programming models into a comparative machine learning based approach to identify regulatory interactions that best explain the discrepancy of telomerase transcript levels in yeast mutants with deleted regulators showing aberrant telomere length, when compared to mutants with normal telomere length. We uncover novel regulators of telomerase expression, several of which affect histone levels or modifications. In particular, our results point to the transcription factors Sum1, Hst1 and Srb2 as being important for the regulation of EST1 transcription, and we validated the effect of Sum1 experimentally. We compiled our machine learning method leading to a user friendly package for R which can straightforwardly be applied to similar problems integrating gene regulator binding information and expression profiles of samples of e.g. different phenotypes, diseases or treatments. © The Author(s) 2016. Published by Oxford University Press on behalf of Nucleic Acids Research.

Optimising the selection of food items for FFQs using Mixed Integer Linear Programming.

PubMed

Gerdessen, Johanna C; Souverein, Olga W; van 't Veer, Pieter; de Vries, Jeanne Hm

2015-01-01

To support the selection of food items for FFQs in such a way that the amount of information on all relevant nutrients is maximised while the food list is as short as possible. Selection of the most informative food items to be included in FFQs was modelled as a Mixed Integer Linear Programming (MILP) model. The methodology was demonstrated for an FFQ with interest in energy, total protein, total fat, saturated fat, monounsaturated fat, polyunsaturated fat, total carbohydrates, mono- and disaccharides, dietary fibre and potassium. The food lists generated by the MILP model have good performance in terms of length, coverage and R 2 (explained variance) of all nutrients. MILP-generated food lists were 32-40 % shorter than a benchmark food list, whereas their quality in terms of R 2 was similar to that of the benchmark. The results suggest that the MILP model makes the selection process faster, more standardised and transparent, and is especially helpful in coping with multiple nutrients. The complexity of the method does not increase with increasing number of nutrients. The generated food lists appear either shorter or provide more information than a food list generated without the MILP model.

A Combined MOIP-MCDA Approach to Building and Screening Atmospheric Pollution Control Strategies in Urban Regions

NASA Astrophysics Data System (ADS)

Mavrotas, George; Ziomas, Ioannis C.; Diakouaki, Danae

2006-07-01

This article presents a methodological approach for the formulation of control strategies capable of reducing atmospheric pollution at the standards set by European legislation. The approach was implemented in the greater area of Thessaloniki and was part of a project aiming at the compliance with air quality standards in five major cities in Greece. The methodological approach comprises two stages: in the first stage, the availability of several measures contributing to a certain extent to reducing atmospheric pollution indicates a combinatorial problem and favors the use of Integer Programming. More specifically, Multiple Objective Integer Programming is used in order to generate alternative efficient combinations of the available policy measures on the basis of two conflicting objectives: public expenditure minimization and social acceptance maximization. In the second stage, these combinations of control measures (i.e., the control strategies) are then comparatively evaluated with respect to a wider set of criteria, using tools from Multiple Criteria Decision Analysis, namely, the well-known PROMETHEE method. The whole procedure is based on the active involvement of local and central authorities in order to incorporate their concerns and preferences, as well as to secure the adoption and implementation of the resulting solution.

Sum-Difference Numbers

ERIC Educational Resources Information Center

Shi, Yixun

2010-01-01

Starting with an interesting number game sometimes used by school teachers to demonstrate the factorization of integers, "sum-difference numbers" are defined. A positive integer n is a "sum-difference number" if there exist positive integers "x, y, w, z" such that n = xy = wz and x ? y = w + z. This paper characterizes all sum-difference numbers…

Order and Value: Transitioning to Integers

ERIC Educational Resources Information Center

Bofferding, Laura

2014-01-01

As students progress from working with whole numbers to working with integers, they must wrestle with the big ideas of number values and order. Using objects to show positive quantities is easy, but no physical negative quantities exist. Therefore, when talking about integers, the author refers to number values instead of number quantities. The…

A time series model: First-order integer-valued autoregressive (INAR(1))

NASA Astrophysics Data System (ADS)

Simarmata, D. M.; Novkaniza, F.; Widyaningsih, Y.

2017-07-01

Nonnegative integer-valued time series arises in many applications. A time series model: first-order Integer-valued AutoRegressive (INAR(1)) is constructed by binomial thinning operator to model nonnegative integer-valued time series. INAR (1) depends on one period from the process before. The parameter of the model can be estimated by Conditional Least Squares (CLS). Specification of INAR(1) is following the specification of (AR(1)). Forecasting in INAR(1) uses median or Bayesian forecasting methodology. Median forecasting methodology obtains integer s, which is cumulative density function (CDF) until s, is more than or equal to 0.5. Bayesian forecasting methodology forecasts h-step-ahead of generating the parameter of the model and parameter of innovation term using Adaptive Rejection Metropolis Sampling within Gibbs sampling (ARMS), then finding the least integer s, where CDF until s is more than or equal to u . u is a value taken from the Uniform(0,1) distribution. INAR(1) is applied on pneumonia case in Penjaringan, Jakarta Utara, January 2008 until April 2016 monthly.

Arikan and Alamouti matrices based on fast block-wise inverse Jacket transform

NASA Astrophysics Data System (ADS)

Lee, Moon Ho; Khan, Md Hashem Ali; Kim, Kyeong Jin

2013-12-01

Recently, Lee and Hou (IEEE Signal Process Lett 13: 461-464, 2006) proposed one-dimensional and two-dimensional fast algorithms for block-wise inverse Jacket transforms (BIJTs). Their BIJTs are not real inverse Jacket transforms from mathematical point of view because their inverses do not satisfy the usual condition, i.e., the multiplication of a matrix with its inverse matrix is not equal to the identity matrix. Therefore, we mathematically propose a fast block-wise inverse Jacket transform of orders N = 2 k , 3 k , 5 k , and 6 k , where k is a positive integer. Based on the Kronecker product of the successive lower order Jacket matrices and the basis matrix, the fast algorithms for realizing these transforms are obtained. Due to the simple inverse and fast algorithms of Arikan polar binary and Alamouti multiple-input multiple-output (MIMO) non-binary matrices, which are obtained from BIJTs, they can be applied in areas such as 3GPP physical layer for ultra mobile broadband permutation matrices design, first-order q-ary Reed-Muller code design, diagonal channel design, diagonal subchannel decompose for interference alignment, and 4G MIMO long-term evolution Alamouti precoding design.

Vector calculus in non-integer dimensional space and its applications to fractal media

NASA Astrophysics Data System (ADS)

Tarasov, Vasily E.

2015-02-01

We suggest a generalization of vector calculus for the case of non-integer dimensional space. The first and second orders operations such as gradient, divergence, the scalar and vector Laplace operators for non-integer dimensional space are defined. For simplification we consider scalar and vector fields that are independent of angles. We formulate a generalization of vector calculus for rotationally covariant scalar and vector functions. This generalization allows us to describe fractal media and materials in the framework of continuum models with non-integer dimensional space. As examples of application of the suggested calculus, we consider elasticity of fractal materials (fractal hollow ball and fractal cylindrical pipe with pressure inside and outside), steady distribution of heat in fractal media, electric field of fractal charged cylinder. We solve the correspondent equations for non-integer dimensional space models.

Trace of totally positive algebraic integers and integer transfinite diameter

NASA Astrophysics Data System (ADS)

Flammang, V.

2009-06-01

Explicit auxiliary functions can be used in the ``Schur-Siegel- Smyth trace problem''. In the previous works, these functions were constructed only with polynomials having all their roots positive. Here, we use several polynomials with complex roots, which are found with Wu's algorithm, and we improve the known lower bounds for the absolute trace of totally positive algebraic integers. This improvement has a consequence for the search of Salem numbers that have a negative trace. The same method also gives a small improvement of the upper bound for the integer transfinite diameter of [0,1].

Integer cosine transform for image compression

NASA Technical Reports Server (NTRS)

Cheung, K.-M.; Pollara, F.; Shahshahani, M.

1991-01-01

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.

A multistage stochastic programming model for a multi-period strategic expansion of biofuel supply chain under evolving uncertainties

DOE Office of Scientific and Technical Information (OSTI.GOV)

Xie, Fei; Huang, Yongxi

Here, we develop a multistage, stochastic mixed-integer model to support biofuel supply chain expansion under evolving uncertainties. By utilizing the block-separable recourse property, we reformulate the multistage program in an equivalent two-stage program and solve it using an enhanced nested decomposition method with maximal non-dominated cuts. We conduct extensive numerical experiments and demonstrate the application of the model and algorithm in a case study based on the South Carolina settings. The value of multistage stochastic programming method is also explored by comparing the model solution with the counterparts of an expected value based deterministic model and a two-stage stochastic model.

A multistage stochastic programming model for a multi-period strategic expansion of biofuel supply chain under evolving uncertainties

DOE PAGES

Xie, Fei; Huang, Yongxi

2018-02-04

Here, we develop a multistage, stochastic mixed-integer model to support biofuel supply chain expansion under evolving uncertainties. By utilizing the block-separable recourse property, we reformulate the multistage program in an equivalent two-stage program and solve it using an enhanced nested decomposition method with maximal non-dominated cuts. We conduct extensive numerical experiments and demonstrate the application of the model and algorithm in a case study based on the South Carolina settings. The value of multistage stochastic programming method is also explored by comparing the model solution with the counterparts of an expected value based deterministic model and a two-stage stochastic model.

There's No Place Like Home

ERIC Educational Resources Information Center

Elrick, Mike

2010-01-01

The integrated program that the author teaches--the Community Environmental Leadership Program (CELP)--begins with a five-night wilderness trip. Here connections to the Earth are clear: water comes from lakes, fuel comes from trees and waste decomposes in the soil below. Students learn quickly that they shouldn't pee in the water they are…

Elliptic Curve Integral Points on y2 = x3 + 3x ‑ 14

NASA Astrophysics Data System (ADS)

Zhao, Jianhong

2018-03-01

The positive integer points and integral points of elliptic curves are very important in the theory of number and arithmetic algebra, it has a wide range of applications in cryptography and other fields. There are some results of positive integer points of elliptic curve y 2 = x 3 + ax + b, a, b ∈ Z In 1987, D. Zagier submit the question of the integer points on y 2 = x 3 ‑ 27x + 62, it count a great deal to the study of the arithmetic properties of elliptic curves. In 2009, Zhu H L and Chen J H solved the problem of the integer points on y 2 = x 3 ‑ 27x + 62 by using algebraic number theory and P-adic analysis method. In 2010, By using the elementary method, Wu H M obtain all the integral points of elliptic curves y 2 = x 3 ‑ 27x ‑ 62. In 2015, Li Y Z and Cui B J solved the problem of the integer points on y 2 = x 3 ‑ 21x ‑ 90 By using the elementary method. In 2016, Guo J solved the problem of the integer points on y 2 = x 3 + 27x + 62 by using the elementary method. In 2017, Guo J proved that y 2 = x 3 ‑ 21x + 90 has no integer points by using the elementary method. Up to now, there is no relevant conclusions on the integral points of elliptic curves y 2 = x 3 + 3x ‑ 14, which is the subject of this paper. By using congruence and Legendre Symbol, it can be proved that elliptic curve y 2 = x 3 + 3x ‑ 14 has only one integer point: (x, y) = (2, 0).

A FAST POLYNOMIAL TRANSFORM PROGRAM WITH A MODULARIZED STRUCTURE

NASA Technical Reports Server (NTRS)

Truong, T. K.

1994-01-01

This program utilizes a fast polynomial transformation (FPT) algorithm applicable to two-dimensional mathematical convolutions. Two-dimensional convolution has many applications, particularly in image processing. Two-dimensional cyclic convolutions can be converted to a one-dimensional convolution in a polynomial ring. Traditional FPT methods decompose the one-dimensional cyclic polynomial into polynomial convolutions of different lengths. This program will decompose a cyclic polynomial into polynomial convolutions of the same length. Thus, only FPTs and Fast Fourier Transforms of the same length are required. This modular approach can save computational resources. To further enhance its appeal, the program is written in the transportable 'C' language. The steps in the algorithm are: 1) formulate the modulus reduction equations, 2) calculate the polynomial transforms, 3) multiply the transforms using a generalized fast Fourier transformation, 4) compute the inverse polynomial transforms, and 5) reconstruct the final matrices using the Chinese remainder theorem. Input to this program is comprised of the row and column dimensions and the initial two matrices. The matrices are printed out at all steps, ending with the final reconstruction. This program is written in 'C' for batch execution and has been implemented on the IBM PC series of computers under DOS with a central memory requirement of approximately 18K of 8 bit bytes. This program was developed in 1986.

Integer aperture ambiguity resolution based on difference test

NASA Astrophysics Data System (ADS)

Zhang, Jingyu; Wu, Meiping; Li, Tao; Zhang, Kaidong

2015-07-01

Carrier-phase integer ambiguity resolution (IAR) is the key to highly precise, fast positioning and attitude determination with Global Navigation Satellite System (GNSS). It can be seen as the process of estimating the unknown cycle ambiguities of the carrier-phase observations as integers. Once the ambiguities are fixed, carrier phase data will act as the very precise range data. Integer aperture (IA) ambiguity resolution is the combination of acceptance testing and integer ambiguity resolution, which can realize better quality control of IAR. Difference test (DT) is one of the most popular acceptance tests. This contribution will give a detailed analysis about the following properties of IA ambiguity resolution based on DT: 1. The sharpest and loose upper bounds of DT are derived from the perspective of geometry. These bounds are very simple and easy to be computed, which give the range for the critical values of DT.

Naval Postgraduate School Aircraft Synthesis Program (User’s Manual)

DTIC Science & Technology

1991-09-01

LOGICAL DVFLAG CHARACTER ANS*6, TITLE*80, PHASE*8 INTEGER EN REAL MACHI, M&CH2 DIMENSION ALTD(6), XM& CH (6) 6590 IF(DVFLAG.EQ. .FALSE.) THEN !GIVE OPTION TO...7800 7840 WRITE (6, 78 45) 7845 FORMAT(/7X,’ENTER THE HORIZONTAL TAIL/CANARD’/ &7X,’WEIGHT SLOPE: ’,$) READ(5,7826,ERR-7840) SLOPE(3) IF((SLOPE(3).LT

Formal Semanol Specification of Ada.

DTIC Science & Technology

1980-09-01

concurrent task modeling involved very little change to the SEMANOL metalanguage. A primitive capable of initiating concurrent SEMANOL task processors...i.e., #CO-COMPUTE) and two primitivc-; corresponding to integer semaphores (i.c., #P and #V) were all that were required. In addition, these changes... synchronization techniques and choice of correct unblocking alternatives. We should note that it had been our original intention to use the Ada Translator program

HIPPO Unit Commitment Version 1

DOE Office of Scientific and Technical Information (OSTI.GOV)

2017-01-17

Developed for the Midcontinent Independent System Operator, Inc. (MISO), HIPPO-Unit Commitment Version 1 is for solving security constrained unit commitment problem. The model was developed to solve MISO's cases. This version of codes includes I/O module to read in MISO's csv files, modules to create a state-based mixed integer programming formulation for solving MIP, and modules to test basic procedures to solve MIP via HPC.

Item Selection for the Development of Parallel Forms from an IRT-Based Seed Test Using a Sampling and Classification Approach

ERIC Educational Resources Information Center

Chen, Pei-Hua; Chang, Hua-Hua; Wu, Haiyan

2012-01-01

Two sampling-and-classification-based procedures were developed for automated test assembly: the Cell Only and the Cell and Cube methods. A simulation study based on a 540-item bank was conducted to compare the performance of the procedures with the performance of a mixed-integer programming (MIP) method for assembling multiple parallel test…

Optimum use of air tankers in initial attack: selection, basing, and transfer rules

Treesearch

Francis E. Greulich; William G. O' Regan

1982-01-01

Fire managers face two interrelated problems in deciding the most efficient use of air tankers: where best to base them, and how best to reallocate them each day in anticipation of fire occurrence. A computerized model based on a mixed integer linear program can help in assigning air tankers throughout the fire season. The model was tested using information from...

Towards a theory of automated elliptic mesh generation

NASA Technical Reports Server (NTRS)

Cordova, J. Q.

1992-01-01

The theory of elliptic mesh generation is reviewed and the fundamental problem of constructing computational space is discussed. It is argued that the construction of computational space is an NP-Complete problem and therefore requires a nonstandard approach for its solution. This leads to the development of graph-theoretic, combinatorial optimization and integer programming algorithms. Methods for the construction of two dimensional computational space are presented.

A Generalized Distance’ Estimation Procedure for Intra-Urban Interaction

DTIC Science & Technology

Bettinger . It is found that available estimation techniques necessarily result in non-integer solutions. A mathematical device is therefore...The estimation of urban and regional travel patterns has been a necessary part of current efforts to establish land use guidelines for the Texas...paper details computational experience with travel estimation within Corpus Christi, Texas, using a new convex programming approach of Charnes, Raike and

MIADS2 ... an alphanumeric map information assembly and display system for a large computer

Treesearch

Elliot L. Amidon

1966-01-01

A major improvement and extension of the Map Information Assembly and Display System (MIADS) developed in 1964 is described. Basic principles remain unchanged, but the computer programs have been expanded and rewritten for a large computer, in Fortran IV and MAP languages. The code system is extended from 99 integers to about 2,200 alphanumeric 2-character codes. Hand-...

Computer simulation results of attitude estimation of earth orbiting satellites

NASA Technical Reports Server (NTRS)

Kou, S. R.

1976-01-01

Computer simulation results of attitude estimation of Earth-orbiting satellites (including Space Telescope) subjected to environmental disturbances and noises are presented. Decomposed linear recursive filter and Kalman filter were used as estimation tools. Six programs were developed for this simulation, and all were written in the basic language and were run on HP 9830A and HP 9866A computers. Simulation results show that a decomposed linear recursive filter is accurate in estimation and fast in response time. Furthermore, for higher order systems, this filter has computational advantages (i.e., less integration errors and roundoff errors) over a Kalman filter.

A Converse of a Result about the Floor Function by Hermite

ERIC Educational Resources Information Center

Mortici, Cristinel

2012-01-01

The floor function maps a real number to the largest previous integer. More precisely, floor(x)=[x] is the largest integer not greater than x. The square bracket notation [x] for the floor function was introduced by Gauss in his third proof of quadratic reciprocity in 1808. The floor function is also called the greatest integer or entier (French…

Using Integer Clocks to Verify the Timing-Sync Sensor Network Protocol

NASA Technical Reports Server (NTRS)

Huang, Xiaowan; Singh, Anu; Smolka, Scott A.

2010-01-01

We use the UPPAAL model checker for Timed Automata to verify the Timing-Sync time-synchronization protocol for sensor networks (TPSN). The TPSN protocol seeks to provide network-wide synchronization of the distributed clocks in a sensor network. Clock-synchronization algorithms for sensor networks such as TPSN must be able to perform arithmetic on clock values to calculate clock drift and network propagation delays. They must be able to read the value of a local clock and assign it to another local clock. Such operations are not directly supported by the theory of Timed Automata. To overcome this formal-modeling obstacle, we augment the UPPAAL specification language with the integer clock derived type. Integer clocks, which are essentially integer variables that are periodically incremented by a global pulse generator, greatly facilitate the encoding of the operations required to synchronize clocks as in the TPSN protocol. With this integer-clock-based model of TPSN in hand, we use UPPAAL to verify that the protocol achieves network-wide time synchronization and is devoid of deadlock. We also use the UPPAAL Tracer tool to illustrate how integer clocks can be used to capture clock drift and resynchronization during protocol execution

System and method for generating attitude determinations using GPS

NASA Technical Reports Server (NTRS)

Cohen, Clark E. (Inventor)

1996-01-01

A GPS attitude receiver for determining the attitude of a moving vehicle in conjunction with a first, a second, a third, and a fourth antenna mounted to the moving vehicle. Each of the antennas receives a plurality of GPS signals that each include a carrier component. For each of the carrier components of the received GPS signals there is an integer ambiguity associated with the first and fourth antennas, an integer ambiguity associated with second and fourth antennas, and an integer ambiguity associated with the third and fourth antennas. The GPS attitude receiver measures phase values for the carrier components of the GPS signals received from each of the antennas at a plurality of measurement epochs during an initialization period and at a measurement epoch after the initialization period. In response to the phase values measured at the measurement epochs during the initialization period, the GPS attitude receiver computes integer ambiguity resolution values representing resolution of the integer ambiguities. Then, in response to the computed integer ambiguity resolution values and the phase value measured at the measurement epoch after the initialization period, it computes values defining the attitude of the moving vehicle at the measurement epoch after the initialization period.

A model for solving the prescribed burn planning problem.

PubMed

Rachmawati, Ramya; Ozlen, Melih; Reinke, Karin J; Hearne, John W

2015-01-01

The increasing frequency of destructive wildfires, with a consequent loss of life and property, has led to fire and land management agencies initiating extensive fuel management programs. This involves long-term planning of fuel reduction activities such as prescribed burning or mechanical clearing. In this paper, we propose a mixed integer programming (MIP) model that determines when and where fuel reduction activities should take place. The model takes into account multiple vegetation types in the landscape, their tolerance to frequency of fire events, and keeps track of the age of each vegetation class in each treatment unit. The objective is to minimise fuel load over the planning horizon. The complexity of scheduling fuel reduction activities has led to the introduction of sophisticated mathematical optimisation methods. While these approaches can provide optimum solutions, they can be computationally expensive, particularly for fuel management planning which extends across the landscape and spans long term planning horizons. This raises the question of how much better do exact modelling approaches compare to simpler heuristic approaches in their solutions. To answer this question, the proposed model is run using an exact MIP (using commercial MIP solver) and two heuristic approaches that decompose the problem into multiple single-period sub problems. The Knapsack Problem (KP), which is the first heuristic approach, solves the single period problems, using an exact MIP approach. The second heuristic approach solves the single period sub problem using a greedy heuristic approach. The three methods are compared in term of model tractability, computational time and the objective values. The model was tested using randomised data from 711 treatment units in the Barwon-Otway district of Victoria, Australia. Solutions for the exact MIP could be obtained for up to a 15-year planning only using a standard implementation of CPLEX. Both heuristic approaches can solve significantly larger problems, involving 100-year or even longer planning horizons. Furthermore there are no substantial differences in the solutions produced by the three approaches. It is concluded that for practical purposes a heuristic method is to be preferred to the exact MIP approach.

Scheduling the resident 80-hour work week: an operations research algorithm.

PubMed

Day, T Eugene; Napoli, Joseph T; Kuo, Paul C

2006-01-01

The resident 80-hour work week requires that programs now schedule duty hours. Typically, scheduling is performed in an empirical "trial-and-error" fashion. However, this is a classic "scheduling" problem from the field of operations research (OR). It is similar to scheduling issues that airlines must face with pilots and planes routing through various airports at various times. The authors hypothesized that an OR approach using iterative computer algorithms could provide a rational scheduling solution. Institution-specific constraints of the residency problem were formulated. A total of 56 residents are rotating through 4 hospitals. Additional constraints were dictated by the Residency Review Committee (RRC) rules or the specific surgical service. For example, at Hospital 1, during the weekday hours between 6 am and 6 pm, there will be a PGY4 or PGY5 and a PGY2 or PGY3 on-duty to cover Service "A." A series of equations and logic statements was generated to satisfy all constraints and requirements. These were restated in the Optimization Programming Language used by the ILOG software suite for solving mixed integer programming problems. An integer programming solution was generated to this resource-constrained assignment problem. A total of 30,900 variables and 12,443 constraints were required. A total of man-hours of programming were used; computer run-time was 25.9 hours. A weekly schedule was generated for each resident that satisfied the RRC regulations while fulfilling all stated surgical service requirements. Each required between 64 and 80 weekly resident duty hours. The authors conclude that OR is a viable approach to schedule resident work hours. This technique is sufficiently robust to accommodate changes in resident numbers, service requirements, and service and hospital rotations.

Dynamic Distributed Cooperative Control of Multiple Heterogeneous Resources

DTIC Science & Technology

2012-10-01

of the UAVs to maximize the total sensor footprint over the region of interest. The algorithm utilized to solve this problem was based on sampling a...and moving obstacles. Obstacle positions were assumed known a priori. Kingston and Beard [22] presented an algorithm to keep moving UAVs equally spaced...Planning Algorithms , Cambridge University Press, 2006. 11. Ma, C. S. and Miller, R. H., “Mixed integer linear programming trajectory generation for

An Advanced Tabu Search Approach to Solving the Mixed Payload Airlift Load Planning Problem

DTIC Science & Technology

2009-03-01

cargo, and the problem therefore becomes trivial. 3. Shoring: Some cargo requires shoring which is small planks of plywood stacked on top of each...Integer Programming Method In 1989, Kevin Ng examined the bin-packing MPALP for Canada’s C-130 aircraft (Ng 1992). His goal was to move a set of... leadership & ethics [ ] warfighting [ ] international security [ ] doctrine [X] other (specify): Military Airlift

Optimal Partitioning of a Surveillance Space for Persistent Coverage Using Multiple Autonomous Unmanned Aerial Vehicles: An Integer Programming Approach

DTIC Science & Technology

2014-03-27

asymptotically equal. Carlsson shows that the problem is solved by treating each subregion Ri as a traveling salesman problem (TSP) with a set of points that...terminal state to the goal. If no- travel zones are repre- sented as the union of regions Akx > Bk, the coverage problem can be expressed as an IP [14...3 1.2 Problem Statement

Optimized Waterspace Management and Scheduling Using Mixed-Integer Linear Programming

DTIC Science & Technology

2016-01-01

Complete [30]. Proposition 4.1 satisfies the first criterion. For the second criterion, we will use the Traveling Salesman Problem (TSP), which has been...A branch and cut algorithm for the symmetric generalized traveling salesman problem , Operations Research 45 (1997) 378–394. [33] J. Silberholz, B...Golden, The generalized traveling salesman problem : A new genetic algorithm ap- proach, Extended Horizons: Advances in Computing, Optimization, and

Uncluttered Single-Image Visualization of Vascular Structures using GPU and Integer Programming

PubMed Central

Won, Joong-Ho; Jeon, Yongkweon; Rosenberg, Jarrett; Yoon, Sungroh; Rubin, Geoffrey D.; Napel, Sandy

2013-01-01

Direct projection of three-dimensional branching structures, such as networks of cables, blood vessels, or neurons onto a 2D image creates the illusion of intersecting structural parts and creates challenges for understanding and communication. We present a method for visualizing such structures, and demonstrate its utility in visualizing the abdominal aorta and its branches, whose tomographic images might be obtained by computed tomography or magnetic resonance angiography, in a single two-dimensional stylistic image, without overlaps among branches. The visualization method, termed uncluttered single-image visualization (USIV), involves optimization of geometry. This paper proposes a novel optimization technique that utilizes an interesting connection of the optimization problem regarding USIV to the protein structure prediction problem. Adopting the integer linear programming-based formulation for the protein structure prediction problem, we tested the proposed technique using 30 visualizations produced from five patient scans with representative anatomical variants in the abdominal aortic vessel tree. The novel technique can exploit commodity-level parallelism, enabling use of general-purpose graphics processing unit (GPGPU) technology that yields a significant speedup. Comparison of the results with the other optimization technique previously reported elsewhere suggests that, in most aspects, the quality of the visualization is comparable to that of the previous one, with a significant gain in the computation time of the algorithm. PMID:22291148

An integer programming formulation of the parsimonious loss of heterozygosity problem.

PubMed

Catanzaro, Daniele; Labbé, Martine; Halldórsson, Bjarni V

2013-01-01

A loss of heterozygosity (LOH) event occurs when, by the laws of Mendelian inheritance, an individual should be heterozygote at a given site but, due to a deletion polymorphism, is not. Deletions play an important role in human disease and their detection could provide fundamental insights for the development of new diagnostics and treatments. In this paper, we investigate the parsimonious loss of heterozygosity problem (PLOHP), i.e., the problem of partitioning suspected polymorphisms from a set of individuals into a minimum number of deletion areas. Specifically, we generalize Halldórsson et al.'s work by providing a more general formulation of the PLOHP and by showing how one can incorporate different recombination rates and prior knowledge about the locations of deletions. Moreover, we show that the PLOHP can be formulated as a specific version of the clique partition problem in a particular class of graphs called undirected catch-point interval graphs and we prove its general $({\\cal NP})$-hardness. Finally, we provide a state-of-the-art integer programming (IP) formulation and strengthening valid inequalities to exactly solve real instances of the PLOHP containing up to 9,000 individuals and 3,000 SNPs. Our results give perspectives on the mathematics of the PLOHP and suggest new directions on the development of future efficient exact solution approaches.

Automatic design of synthetic gene circuits through mixed integer non-linear programming.

PubMed

Huynh, Linh; Kececioglu, John; Köppe, Matthias; Tagkopoulos, Ilias

2012-01-01

Automatic design of synthetic gene circuits poses a significant challenge to synthetic biology, primarily due to the complexity of biological systems, and the lack of rigorous optimization methods that can cope with the combinatorial explosion as the number of biological parts increases. Current optimization methods for synthetic gene design rely on heuristic algorithms that are usually not deterministic, deliver sub-optimal solutions, and provide no guaranties on convergence or error bounds. Here, we introduce an optimization framework for the problem of part selection in synthetic gene circuits that is based on mixed integer non-linear programming (MINLP), which is a deterministic method that finds the globally optimal solution and guarantees convergence in finite time. Given a synthetic gene circuit, a library of characterized parts, and user-defined constraints, our method can find the optimal selection of parts that satisfy the constraints and best approximates the objective function given by the user. We evaluated the proposed method in the design of three synthetic circuits (a toggle switch, a transcriptional cascade, and a band detector), with both experimentally constructed and synthetic promoter libraries. Scalability and robustness analysis shows that the proposed framework scales well with the library size and the solution space. The work described here is a step towards a unifying, realistic framework for the automated design of biological circuits.

Predicting protein contact map using evolutionary and physical constraints by integer programming.

PubMed

Wang, Zhiyong; Xu, Jinbo

2013-07-01

Protein contact map describes the pairwise spatial and functional relationship of residues in a protein and contains key information for protein 3D structure prediction. Although studied extensively, it remains challenging to predict contact map using only sequence information. Most existing methods predict the contact map matrix element-by-element, ignoring correlation among contacts and physical feasibility of the whole-contact map. A couple of recent methods predict contact map by using mutual information, taking into consideration contact correlation and enforcing a sparsity restraint, but these methods demand for a very large number of sequence homologs for the protein under consideration and the resultant contact map may be still physically infeasible. This article presents a novel method PhyCMAP for contact map prediction, integrating both evolutionary and physical restraints by machine learning and integer linear programming. The evolutionary restraints are much more informative than mutual information, and the physical restraints specify more concrete relationship among contacts than the sparsity restraint. As such, our method greatly reduces the solution space of the contact map matrix and, thus, significantly improves prediction accuracy. Experimental results confirm that PhyCMAP outperforms currently popular methods no matter how many sequence homologs are available for the protein under consideration. http://raptorx.uchicago.edu.

The whole number axis integer linear transformation reversible information hiding algorithm on wavelet domain

NASA Astrophysics Data System (ADS)

Jiang, Zhuo; Xie, Chengjun

2013-12-01

This paper improved the algorithm of reversible integer linear transform on finite interval [0,255], which can realize reversible integer linear transform in whole number axis shielding data LSB (least significant bit). Firstly, this method use integer wavelet transformation based on lifting scheme to transform the original image, and select the transformed high frequency areas as information hiding area, meanwhile transform the high frequency coefficients blocks in integer linear way and embed the secret information in LSB of each coefficient, then information hiding by embedding the opposite steps. To extract data bits and recover the host image, a similar reverse procedure can be conducted, and the original host image can be lossless recovered. The simulation experimental results show that this method has good secrecy and concealment, after conducted the CDF (m, n) and DD (m, n) series of wavelet transformed. This method can be applied to information security domain, such as medicine, law and military.

A GA based penalty function technique for solving constrained redundancy allocation problem of series system with interval valued reliability of components

NASA Astrophysics Data System (ADS)

Gupta, R. K.; Bhunia, A. K.; Roy, D.

2009-10-01

In this paper, we have considered the problem of constrained redundancy allocation of series system with interval valued reliability of components. For maximizing the overall system reliability under limited resource constraints, the problem is formulated as an unconstrained integer programming problem with interval coefficients by penalty function technique and solved by an advanced GA for integer variables with interval fitness function, tournament selection, uniform crossover, uniform mutation and elitism. As a special case, considering the lower and upper bounds of the interval valued reliabilities of the components to be the same, the corresponding problem has been solved. The model has been illustrated with some numerical examples and the results of the series redundancy allocation problem with fixed value of reliability of the components have been compared with the existing results available in the literature. Finally, sensitivity analyses have been shown graphically to study the stability of our developed GA with respect to the different GA parameters.

Optimizing Multi-Product Multi-Constraint Inventory Control Systems with Stochastic Replenishments

NASA Astrophysics Data System (ADS)

Allah Taleizadeh, Ata; Aryanezhad, Mir-Bahador; Niaki, Seyed Taghi Akhavan

Multi-periodic inventory control problems are mainly studied employing two assumptions. The first is the continuous review, where depending on the inventory level orders can happen at any time and the other is the periodic review, where orders can only happen at the beginning of each period. In this study, we relax these assumptions and assume that the periodic replenishments are stochastic in nature. Furthermore, we assume that the periods between two replenishments are independent and identically random variables. For the problem at hand, the decision variables are of integer-type and there are two kinds of space and service level constraints for each product. We develop a model of the problem in which a combination of back-order and lost-sales are considered for the shortages. Then, we show that the model is of an integer-nonlinear-programming type and in order to solve it, a search algorithm can be utilized. We employ a simulated annealing approach and provide a numerical example to demonstrate the applicability of the proposed methodology.

Java Programming Language

NASA Technical Reports Server (NTRS)

Shaykhian, Gholam Ali

2007-01-01

The Java seminar covers the fundamentals of Java programming language. No prior programming experience is required for participation in the seminar. The first part of the seminar covers introductory concepts in Java programming including data types (integer, character, ..), operators, functions and constants, casts, input, output, control flow, scope, conditional statements, and arrays. Furthermore, introduction to Object-Oriented programming in Java, relationships between classes, using packages, constructors, private data and methods, final instance fields, static fields and methods, and overloading are explained. The second part of the seminar covers extending classes, inheritance hierarchies, polymorphism, dynamic binding, abstract classes, protected access. The seminar conclude by introducing interfaces, properties of interfaces, interfaces and abstract classes, interfaces and cailbacks, basics of event handling, user interface components with swing, applet basics, converting applications to applets, the applet HTML tags and attributes, exceptions and debugging.

Edgelist phase unwrapping algorithm for time series InSAR analysis.

PubMed

Shanker, A Piyush; Zebker, Howard

2010-03-01

We present here a new integer programming formulation for phase unwrapping of multidimensional data. Phase unwrapping is a key problem in many coherent imaging systems, including time series synthetic aperture radar interferometry (InSAR), with two spatial and one temporal data dimensions. The minimum cost flow (MCF) [IEEE Trans. Geosci. Remote Sens. 36, 813 (1998)] phase unwrapping algorithm describes a global cost minimization problem involving flow between phase residues computed over closed loops. Here we replace closed loops by reliable edges as the basic construct, thus leading to the name "edgelist." Our algorithm has several advantages over current methods-it simplifies the representation of multidimensional phase unwrapping, it incorporates data from external sources, such as GPS, where available to better constrain the unwrapped solution, and it treats regularly sampled or sparsely sampled data alike. It thus is particularly applicable to time series InSAR, where data are often irregularly spaced in time and individual interferograms can be corrupted with large decorrelated regions. We show that, similar to the MCF network problem, the edgelist formulation also exhibits total unimodularity, which enables us to solve the integer program problem by using efficient linear programming tools. We apply our method to a persistent scatterer-InSAR data set from the creeping section of the Central San Andreas Fault and find that the average creep rate of 22 mm/Yr is constant within 3 mm/Yr over 1992-2004 but varies systematically with ground location, with a slightly higher rate in 1992-1998 than in 1999-2003.

Introducing difference recurrence relations for faster semi-global alignment of long sequences.

PubMed

Suzuki, Hajime; Kasahara, Masahiro

2018-02-19

The read length of single-molecule DNA sequencers is reaching 1 Mb. Popular alignment software tools widely used for analyzing such long reads often take advantage of single-instruction multiple-data (SIMD) operations to accelerate calculation of dynamic programming (DP) matrices in the Smith-Waterman-Gotoh (SWG) algorithm with a fixed alignment start position at the origin. Nonetheless, 16-bit or 32-bit integers are necessary for storing the values in a DP matrix when sequences to be aligned are long; this situation hampers the use of the full SIMD width of modern processors. We proposed a faster semi-global alignment algorithm, "difference recurrence relations," that runs more rapidly than the state-of-the-art algorithm by a factor of 2.1. Instead of calculating and storing all the values in a DP matrix directly, our algorithm computes and stores mainly the differences between the values of adjacent cells in the matrix. Although the SWG algorithm and our algorithm can output exactly the same result, our algorithm mainly involves 8-bit integer operations, enabling us to exploit the full width of SIMD operations (e.g., 32) on modern processors. We also developed a library, libgaba, so that developers can easily integrate our algorithm into alignment programs. Our novel algorithm and optimized library implementation will facilitate accelerating nucleotide long-read analysis algorithms that use pairwise alignment stages. The library is implemented in the C programming language and available at https://github.com/ocxtal/libgaba .

Quantum Hall effect in ac driven graphene: From the half-integer to the integer case

NASA Astrophysics Data System (ADS)

Ding, Kai-He; Lim, Lih-King; Su, Gang; Weng, Zheng-Yu

2018-01-01

We theoretically study the quantum Hall effect (QHE) in graphene with an ac electric field. Based on the tight-binding model, the structure of the half-integer Hall plateaus at σxy=±(n +1 /2 ) 4 e2/h (n is an integer) gets qualitatively changed with the addition of new integer Hall plateaus at σxy=±n (4 e2/h ) starting from the edges of the band center regime towards the band center with an increasing ac field. Beyond a critical field strength, a Hall plateau with σxy=0 can be realized at the band center, hence fully restoring a conventional integer QHE with particle-hole symmetry. Within a low-energy Hamiltonian for Dirac cones merging, we show a very good agreement with the tight-binding calculations for the Hall plateau transitions. We also obtain the band structure for driven graphene ribbons to provide a further understanding on the appearance of the new Hall plateaus, showing a trivial insulator behavior for the σxy=0 state. In the presence of disorder, we numerically study the disorder-induced destruction of the quantum Hall states in a finite driven sample and find that qualitative features known in the undriven disordered case are maintained.

A Polynomial Time, Numerically Stable Integer Relation Algorithm

NASA Technical Reports Server (NTRS)

Ferguson, Helaman R. P.; Bailey, Daivd H.; Kutler, Paul (Technical Monitor)

1998-01-01

Let x = (x1, x2...,xn be a vector of real numbers. X is said to possess an integer relation if there exist integers a(sub i) not all zero such that a1x1 + a2x2 + ... a(sub n)Xn = 0. Beginning in 1977 several algorithms (with proofs) have been discovered to recover the a(sub i) given x. The most efficient of these existing integer relation algorithms (in terms of run time and the precision required of the input) has the drawback of being very unstable numerically. It often requires a numeric precision level in the thousands of digits to reliably recover relations in modest-sized test problems. We present here a new algorithm for finding integer relations, which we have named the "PSLQ" algorithm. It is proved in this paper that the PSLQ algorithm terminates with a relation in a number of iterations that is bounded by a polynomial in it. Because this algorithm employs a numerically stable matrix reduction procedure, it is free from the numerical difficulties, that plague other integer relation algorithms. Furthermore, its stability admits an efficient implementation with lower run times oil average than other algorithms currently in Use. Finally, this stability can be used to prove that relation bounds obtained from computer runs using this algorithm are numerically accurate.

Mineralisation of 14C-labelled synthetic lignin and ligninolytic enzyme activities of litter-decomposing basidiomycetous fungi.

PubMed

Steffen, K T; Hofrichter, M; Hatakka, A

2000-12-01

Within a screening program, 27 soil litter-decomposing basidiomycetes were tested for ligninolytic enzyme activities using agar-media containing 2,2'-azinobis(3-ethylbenzthiazoline-6-sulphonate), a humic acid or Mn2+ ions as indicator substrates. Most active species were found within the family Strophariaceae (Agrocybe praecox, Stropharia coronilla, S. rugosoannulata) and used for mineralisation experiments with a 14C-ring-labelled synthetic lignin (14C-DHP). The fungi mineralised around 25% of the lignin to 14CO2 within 12 weeks of incubation in a straw environment; about 20% of the lignin was converted to water-soluble fragments. Mn-peroxidase was found to be the predominant ligninolytic enzyme of all three fungi in liquid culture and its production was strongly enhanced in the presence of Mn2+ ions. The results of this study demonstrate that certain ubiquitous litter-decomposing basidiomycetes possess ligninolytic activities similar to the wood-decaying white-rot fungi, the most efficient lignin degraders in nature.

An Analysis of the Multiple Objective Capital Budgeting Problem via Fuzzy Linear Integer (0-1) Programming.

DTIC Science & Technology

1980-05-31

34 International Journal of Man- Machine Studies , Vol. 9, No. 1, 1977, pp. 1-68. [16] Zimmermann, H. J., Theory and Applications of Fuzzy Sets, Institut...Boston, Inc., Hingham, MA, 1978. [18] Yager, R. R., "Multiple Objective Decision-Making Using Fuzzy Sets," International Journal of Man- Machine Studies ...Professor of Industria Engineering ... iv t TABLE OF CONTENTS page ABSTRACT .. .. . ...... . .... ...... ........ iii LIST OF TABLES

Extension of the firefly algorithm and preference rules for solving MINLP problems

NASA Astrophysics Data System (ADS)

Costa, M. Fernanda P.; Francisco, Rogério B.; Rocha, Ana Maria A. C.; Fernandes, Edite M. G. P.

2017-07-01

An extension of the firefly algorithm (FA) for solving mixed-integer nonlinear programming (MINLP) problems is presented. Although penalty functions are nowadays frequently used to handle integrality conditions and inequality and equality constraints, this paper proposes the implementation within the FA of a simple rounded-based heuristic and four preference rules to find and converge to MINLP feasible solutions. Preliminary numerical experiments are carried out to validate the proposed methodology.

Generating a 2D Representation of a Complex Data Structure

NASA Technical Reports Server (NTRS)

James, Mark

2006-01-01

A computer program, designed to assist in the development and debugging of other software, generates a two-dimensional (2D) representation of a possibly complex n-dimensional (where n is an integer >2) data structure or abstract rank-n object in that other software. The nature of the 2D representation is such that it can be displayed on a non-graphical output device and distributed by non-graphical means.

Graph Structured Program Evolution: Evolution of Loop Structures

NASA Astrophysics Data System (ADS)

Shirakawa, Shinichi; Nagao, Tomoharu

Recently, numerous automatic programming techniques have been developed and applied in various fields. A typical example is genetic programming (GP), and various extensions and representations of GP have been proposed thus far. Complex programs and hand-written programs, however, may contain several loops and handle multiple data types. In this chapter, we propose a new method called Graph Structured Program Evolution (GRAPE). The representation of GRAPE is a graph structure; therefore, it can represent branches and loops using this structure. Each programis constructed as an arbitrary directed graph of nodes and a data set. The GRAPE program handles multiple data types using the data set for each type, and the genotype of GRAPE takes the form of a linear string of integers. We apply GRAPE to three test problems, factorial, exponentiation, and list sorting, and demonstrate that the optimum solution in each problem is obtained by the GRAPE system.

Non-integer expansion embedding techniques for reversible image watermarking

NASA Astrophysics Data System (ADS)

Xiang, Shijun; Wang, Yi

2015-12-01

This work aims at reducing the embedding distortion of prediction-error expansion (PE)-based reversible watermarking. In the classical PE embedding method proposed by Thodi and Rodriguez, the predicted value is rounded to integer number for integer prediction-error expansion (IPE) embedding. The rounding operation makes a constraint on a predictor's performance. In this paper, we propose a non-integer PE (NIPE) embedding approach, which can proceed non-integer prediction errors for embedding data into an audio or image file by only expanding integer element of a prediction error while keeping its fractional element unchanged. The advantage of the NIPE embedding technique is that the NIPE technique can really bring a predictor into full play by estimating a sample/pixel in a noncausal way in a single pass since there is no rounding operation. A new noncausal image prediction method to estimate a pixel with four immediate pixels in a single pass is included in the proposed scheme. The proposed noncausal image predictor can provide better performance than Sachnev et al.'s noncausal double-set prediction method (where data prediction in two passes brings a distortion problem due to the fact that half of the pixels were predicted with the watermarked pixels). In comparison with existing several state-of-the-art works, experimental results have shown that the NIPE technique with the new noncausal prediction strategy can reduce the embedding distortion for the same embedding payload.

Designing optimal cell factories: integer programming couples elementary mode analysis with regulation

PubMed Central

2012-01-01

Background Elementary mode (EM) analysis is ideally suited for metabolic engineering as it allows for an unbiased decomposition of metabolic networks in biologically meaningful pathways. Recently, constrained minimal cut sets (cMCS) have been introduced to derive optimal design strategies for strain improvement by using the full potential of EM analysis. However, this approach does not allow for the inclusion of regulatory information. Results Here we present an alternative, novel and simple method for the prediction of cMCS, which allows to account for boolean transcriptional regulation. We use binary linear programming and show that the design of a regulated, optimal metabolic network of minimal functionality can be formulated as a standard optimization problem, where EM and regulation show up as constraints. We validated our tool by optimizing ethanol production in E. coli. Our study showed that up to 70% of the predicted cMCS contained non-enzymatic, non-annotated reactions, which are difficult to engineer. These cMCS are automatically excluded by our approach utilizing simple weight functions. Finally, due to efficient preprocessing, the binary program remains computationally feasible. Conclusions We used integer programming to predict efficient deletion strategies to metabolically engineer a production organism. Our formulation utilizes the full potential of cMCS but adds additional flexibility to the design process. In particular our method allows to integrate regulatory information into the metabolic design process and explicitly favors experimentally feasible deletions. Our method remains manageable even if millions or potentially billions of EM enter the analysis. We demonstrated that our approach is able to correctly predict the most efficient designs for ethanol production in E. coli. PMID:22898474

AN ADA LINEAR ALGEBRA PACKAGE MODELED AFTER HAL/S

NASA Technical Reports Server (NTRS)

Klumpp, A. R.

1994-01-01

This package extends the Ada programming language to include linear algebra capabilities similar to those of the HAL/S programming language. The package is designed for avionics applications such as Space Station flight software. In addition to the HAL/S built-in functions, the package incorporates the quaternion functions used in the Shuttle and Galileo projects, and routines from LINPAK that solve systems of equations involving general square matrices. Language conventions in this package follow those of HAL/S to the maximum extent practical and minimize the effort required for writing new avionics software and translating existent software into Ada. Valid numeric types in this package include scalar, vector, matrix, and quaternion declarations. (Quaternions are fourcomponent vectors used in representing motion between two coordinate frames). Single precision and double precision floating point arithmetic is available in addition to the standard double precision integer manipulation. Infix operators are used instead of function calls to define dot products, cross products, quaternion products, and mixed scalar-vector, scalar-matrix, and vector-matrix products. The package contains two generic programs: one for floating point, and one for integer. The actual component type is passed as a formal parameter to the generic linear algebra package. The procedures for solving systems of linear equations defined by general matrices include GEFA, GECO, GESL, and GIDI. The HAL/S functions include ABVAL, UNIT, TRACE, DET, INVERSE, TRANSPOSE, GET, PUT, FETCH, PLACE, and IDENTITY. This package is written in Ada (Version 1.2) for batch execution and is machine independent. The linear algebra software depends on nothing outside the Ada language except for a call to a square root function for floating point scalars (such as SQRT in the DEC VAX MATHLIB library). This program was developed in 1989, and is a copyrighted work with all copyright vested in NASA.

Nonlinear viscoelastic characterization of human vocal fold tissues under large-amplitude oscillatory shear (LAOS)

PubMed Central

Chan, Roger W.

2018-01-01

Viscoelastic shear properties of human vocal fold tissues were previously quantified by the shear moduli (G′ and G″). Yet these small-strain linear measures were unable to describe any nonlinear tissue behavior. This study attempted to characterize the nonlinear viscoelastic response of the vocal fold lamina propria under large-amplitude oscillatory shear (LAOS) with a stress decomposition approach. Human vocal fold cover and vocal ligament specimens from eight subjects were subjected to LAOS rheometric testing with a simple-shear rheometer. The empirical total stress response was decomposed into elastic and viscous stress components, based on odd-integer harmonic decomposition approach with Fourier transform. Nonlinear viscoelastic measures derived from the decomposition were plotted in Pipkin space and as rheological fingerprints to observe the onset of nonlinearity and the type of nonlinear behavior. Results showed that both the vocal fold cover and the vocal ligament experienced intercycle strain softening, intracycle strain stiffening, as well as shear thinning both intercycle and intracycle. The vocal ligament appeared to demonstrate an earlier onset of nonlinearity at phonatory frequencies, and higher sensitivity to changes in frequency and strain. In summary, the stress decomposition approach provided much better insights into the nonlinear viscoelastic behavior of the vocal fold lamina propria than the traditional linear measures. PMID:29780189

Nonlinear viscoelastic characterization of human vocal fold tissues under large-amplitude oscillatory shear (LAOS).

PubMed

Chan, Roger W

2018-05-01

Viscoelastic shear properties of human vocal fold tissues were previously quantified by the shear moduli ( G' and G″ ). Yet these small-strain linear measures were unable to describe any nonlinear tissue behavior. This study attempted to characterize the nonlinear viscoelastic response of the vocal fold lamina propria under large-amplitude oscillatory shear (LAOS) with a stress decomposition approach. Human vocal fold cover and vocal ligament specimens from eight subjects were subjected to LAOS rheometric testing with a simple-shear rheometer. The empirical total stress response was decomposed into elastic and viscous stress components, based on odd-integer harmonic decomposition approach with Fourier transform. Nonlinear viscoelastic measures derived from the decomposition were plotted in Pipkin space and as rheological fingerprints to observe the onset of nonlinearity and the type of nonlinear behavior. Results showed that both the vocal fold cover and the vocal ligament experienced intercycle strain softening, intracycle strain stiffening, as well as shear thinning both intercycle and intracycle. The vocal ligament appeared to demonstrate an earlier onset of nonlinearity at phonatory frequencies, and higher sensitivity to changes in frequency and strain. In summary, the stress decomposition approach provided much better insights into the nonlinear viscoelastic behavior of the vocal fold lamina propria than the traditional linear measures.

Gene regulatory network inference from multifactorial perturbation data using both regression and correlation analyses.

PubMed

Xiong, Jie; Zhou, Tong

2012-01-01

An important problem in systems biology is to reconstruct gene regulatory networks (GRNs) from experimental data and other a priori information. The DREAM project offers some types of experimental data, such as knockout data, knockdown data, time series data, etc. Among them, multifactorial perturbation data are easier and less expensive to obtain than other types of experimental data and are thus more common in practice. In this article, a new algorithm is presented for the inference of GRNs using the DREAM4 multifactorial perturbation data. The GRN inference problem among [Formula: see text] genes is decomposed into [Formula: see text] different regression problems. In each of the regression problems, the expression level of a target gene is predicted solely from the expression level of a potential regulation gene. For different potential regulation genes, different weights for a specific target gene are constructed by using the sum of squared residuals and the Pearson correlation coefficient. Then these weights are normalized to reflect effort differences of regulating distinct genes. By appropriately choosing the parameters of the power law, we constructe a 0-1 integer programming problem. By solving this problem, direct regulation genes for an arbitrary gene can be estimated. And, the normalized weight of a gene is modified, on the basis of the estimation results about the existence of direct regulations to it. These normalized and modified weights are used in queuing the possibility of the existence of a corresponding direct regulation. Computation results with the DREAM4 In Silico Size 100 Multifactorial subchallenge show that estimation performances of the suggested algorithm can even outperform the best team. Using the real data provided by the DREAM5 Network Inference Challenge, estimation performances can be ranked third. Furthermore, the high precision of the obtained most reliable predictions shows the suggested algorithm may be helpful in guiding biological experiment designs.

Example Level 1 Ada/SQL (Structured Query Language) System Software

DTIC Science & Technology

1987-09-01

PUTLINE ("EMPNAME JOB SALARY COMMISSION"); loop FETCH ( CURSOR ); INTO ( VEMP NAME , STR LAST ); T LEN INTEGER (STR LAST - V EMP NAME’FIRST + 1); for I in 1...begin PUT_LINE ("EMPNAME JOB SALARY DEPT"); loop FETCH (CURSOR); INTO ( VEMP NAME , STRLAST ); T_LEN := INTEGER (STRLAST - V_EMPNAME’FIRST + 1); for I in...NUMBERS OPEN ( CURSOR ); begin PUT_LINE ("EMP_NAME SALARY JOB"); loop FETCH ( CURSOR ); INTO ( VEMP NAME , STRLAST ); T_LEN := INTEGER (STR_LAST

Aspect-Oriented Programming

NASA Technical Reports Server (NTRS)

Elrad, Tzilla (Editor); Filman, Robert E. (Editor); Bader, Atef (Editor)

2001-01-01

Computer science has experienced an evolution in programming languages and systems from the crude assembly and machine codes of the earliest computers through concepts such as formula translation, procedural programming, structured programming, functional programming, logic programming, and programming with abstract data types. Each of these steps in programming technology has advanced our ability to achieve clear separation of concerns at the source code level. Currently, the dominant programming paradigm is object-oriented programming - the idea that one builds a software system by decomposing a problem into objects and then writing the code of those objects. Such objects abstract together behavior and data into a single conceptual and physical entity. Object-orientation is reflected in the entire spectrum of current software development methodologies and tools - we have OO methodologies, analysis and design tools, and OO programming languages. Writing complex applications such as graphical user interfaces, operating systems, and distributed applications while maintaining comprehensible source code has been made possible with OOP. Success at developing simpler systems leads to aspirations for greater complexity. Object orientation is a clever idea, but has certain limitations. We are now seeing that many requirements do not decompose neatly into behavior centered on a single locus. Object technology has difficulty localizing concerns invoking global constraints and pandemic behaviors, appropriately segregating concerns, and applying domain-specific knowledge. Post-object programming (POP) mechanisms that look to increase the expressiveness of the OO paradigm are a fertile arena for current research. Examples of POP technologies include domain-specific languages, generative programming, generic programming, constraint languages, reflection and metaprogramming, feature-oriented development, views/viewpoints, and asynchronous message brokering. (Czarneclu and Eisenecker s book includes a good survey of many of these technologies).

Program Helps Decompose Complex Design Systems

NASA Technical Reports Server (NTRS)

Rogers, James L., Jr.; Hall, Laura E.

1994-01-01

DeMAID (A Design Manager's Aid for Intelligent Decomposition) computer program is knowledge-based software system for ordering sequence of modules and identifying possible multilevel structure for design problem. Groups modular subsystems on basis of interactions among them. Saves considerable money and time in total design process, particularly in new design problem in which order of modules has not been defined. Available in two machine versions: Macintosh and Sun.

MAUD: An Interactive Computer Program for the Structuring, Decomposition, and Recomposition of Preferences between Multiattributed Alternatives. Final Report. Technical Report 543.

ERIC Educational Resources Information Center

Humphreys, Patrick; Wisudha, Ayleen

As a demonstration of the application of heuristic devices to decision-theoretical techniques, an interactive computer program known as MAUD (Multiattribute Utility Decomposition) has been designed to support decision or choice problems that can be decomposed into component factors, or to act as a tool for investigating the microstructure of a…

Mathematical programming (MP) model to determine optimal transportation infrastructure for geologic CO2 storage in the Illinois basin

NASA Astrophysics Data System (ADS)

Rehmer, Donald E.

Analysis of results from a mathematical programming model were examined to 1) determine the least cost options for infrastructure development of geologic storage of CO2 in the Illinois Basin, and 2) perform an analysis of a number of CO2 emission tax and oil price scenarios in order to implement development of the least-cost pipeline networks for distribution of CO2. The model, using mixed integer programming, tested the hypothesis of whether viable EOR sequestration sites can serve as nodal points or hubs to expand the CO2 delivery infrastructure to more distal locations from the emissions sources. This is in contrast to previous model results based on a point-to- point model having direct pipeline segments from each CO2 capture site to each storage sink. There is literature on the spoke and hub problem that relates to airline scheduling as well as maritime shipping. A large-scale ship assignment problem that utilized integer linear programming was run on Excel Solver and described by Mourao et al., (2001). Other literature indicates that aircraft assignment in spoke and hub routes can also be achieved using integer linear programming (Daskin and Panayotopoulos, 1989; Hane et al., 1995). The distribution concept is basically the reverse of the "tree and branch" type (Rothfarb et al., 1970) gathering systems for oil and natural gas that industry has been developing for decades. Model results indicate that the inclusion of hubs as variables in the model yields lower transportation costs for geologic carbon dioxide storage over previous models of point-to-point infrastructure geometries. Tabular results and GIS maps of the selected scenarios illustrate that EOR sites can serve as nodal points or hubs for distribution of CO2 to distal oil field locations as well as deeper saline reservoirs. Revenue amounts and capture percentages both show an improvement over solutions when the hubs are not allowed to come into the solution. Other results indicate that geologic storage of CO2 into saline aquifers does not come into solutions selected by the model until the CO 2 emissions tax approaches 50/tonne. CO2 capture and storage begins to occur when the oil price is above 24.42 a barrel based on the constraints of the model. The annual storage capacity of the basin is nearly maximized when the net price of oil is as low as 40 per barrel and the CO2 emission tax is 60/tonne. The results from every subsequent scenario that was examined by this study demonstrate that EOR utilizing anthropogenically captured CO2 will earn net revenue, and thus represents an economically viable option for CO2 storage in the Illinois Basin.

Simple proof of the impossibility of bit commitment in generalized probabilistic theories using cone programming

NASA Astrophysics Data System (ADS)

Sikora, Jamie; Selby, John

2018-04-01

Bit commitment is a fundamental cryptographic task, in which Alice commits a bit to Bob such that she cannot later change the value of the bit, while, simultaneously, the bit is hidden from Bob. It is known that ideal bit commitment is impossible within quantum theory. In this work, we show that it is also impossible in generalized probabilistic theories (under a small set of assumptions) by presenting a quantitative trade-off between Alice's and Bob's cheating probabilities. Our proof relies crucially on a formulation of cheating strategies as cone programs, a natural generalization of semidefinite programs. In fact, using the generality of this technique, we prove that this result holds for the more general task of integer commitment.

Selecting university undergraduate student activities via compromised-analytical hierarchy process and 0-1 integer programming to maximize SETARA points

NASA Astrophysics Data System (ADS)

Nazri, Engku Muhammad; Yusof, Nur Ai'Syah; Ahmad, Norazura; Shariffuddin, Mohd Dino Khairri; Khan, Shazida Jan Mohd

2017-11-01

Prioritizing and making decisions on what student activities to be selected and conducted to fulfill the aspiration of a university as translated in its strategic plan must be executed with transparency and accountability. It is becoming even more crucial, particularly for universities in Malaysia with the recent budget cut imposed by the Malaysian government. In this paper, we illustrated how 0-1 integer programming (0-1 IP) model was implemented to select which activities among the forty activities proposed by the student body of Universiti Utara Malaysia (UUM) to be implemented for the 2017/2018 academic year. Two different models were constructed. The first model was developed to determine the minimum total budget that should be given to the student body by the UUM management to conduct all the activities that can fulfill the minimum targeted number of activities as stated in its strategic plan. On the other hand, the second model was developed to determine which activities to be selected based on the total budget already allocated beforehand by the UUM management towards fulfilling the requirements as set in its strategic plan. The selection of activities for the second model, was also based on the preference of the members of the student body whereby the preference value for each activity was determined using Compromised-Analytical Hierarchy Process. The outputs from both models were compared and discussed. The technique used in this study will be useful and suitable to be implemented by organizations with key performance indicator-oriented programs and having limited budget allocation issues.

MEIGO: an open-source software suite based on metaheuristics for global optimization in systems biology and bioinformatics.

PubMed

Egea, Jose A; Henriques, David; Cokelaer, Thomas; Villaverde, Alejandro F; MacNamara, Aidan; Danciu, Diana-Patricia; Banga, Julio R; Saez-Rodriguez, Julio

2014-05-10

Optimization is the key to solving many problems in computational biology. Global optimization methods, which provide a robust methodology, and metaheuristics in particular have proven to be the most efficient methods for many applications. Despite their utility, there is a limited availability of metaheuristic tools. We present MEIGO, an R and Matlab optimization toolbox (also available in Python via a wrapper of the R version), that implements metaheuristics capable of solving diverse problems arising in systems biology and bioinformatics. The toolbox includes the enhanced scatter search method (eSS) for continuous nonlinear programming (cNLP) and mixed-integer programming (MINLP) problems, and variable neighborhood search (VNS) for Integer Programming (IP) problems. Additionally, the R version includes BayesFit for parameter estimation by Bayesian inference. The eSS and VNS methods can be run on a single-thread or in parallel using a cooperative strategy. The code is supplied under GPLv3 and is available at http://www.iim.csic.es/~gingproc/meigo.html. Documentation and examples are included. The R package has been submitted to BioConductor. We evaluate MEIGO against optimization benchmarks, and illustrate its applicability to a series of case studies in bioinformatics and systems biology where it outperforms other state-of-the-art methods. MEIGO provides a free, open-source platform for optimization that can be applied to multiple domains of systems biology and bioinformatics. It includes efficient state of the art metaheuristics, and its open and modular structure allows the addition of further methods.

MEIGO: an open-source software suite based on metaheuristics for global optimization in systems biology and bioinformatics

PubMed Central

2014-01-01

Background Optimization is the key to solving many problems in computational biology. Global optimization methods, which provide a robust methodology, and metaheuristics in particular have proven to be the most efficient methods for many applications. Despite their utility, there is a limited availability of metaheuristic tools. Results We present MEIGO, an R and Matlab optimization toolbox (also available in Python via a wrapper of the R version), that implements metaheuristics capable of solving diverse problems arising in systems biology and bioinformatics. The toolbox includes the enhanced scatter search method (eSS) for continuous nonlinear programming (cNLP) and mixed-integer programming (MINLP) problems, and variable neighborhood search (VNS) for Integer Programming (IP) problems. Additionally, the R version includes BayesFit for parameter estimation by Bayesian inference. The eSS and VNS methods can be run on a single-thread or in parallel using a cooperative strategy. The code is supplied under GPLv3 and is available at http://www.iim.csic.es/~gingproc/meigo.html. Documentation and examples are included. The R package has been submitted to BioConductor. We evaluate MEIGO against optimization benchmarks, and illustrate its applicability to a series of case studies in bioinformatics and systems biology where it outperforms other state-of-the-art methods. Conclusions MEIGO provides a free, open-source platform for optimization that can be applied to multiple domains of systems biology and bioinformatics. It includes efficient state of the art metaheuristics, and its open and modular structure allows the addition of further methods. PMID:24885957

Optimal planning of co-firing alternative fuels with coal in a power plant by grey nonlinear mixed integer programming model.

PubMed

Ko, Andi Setiady; Chang, Ni-Bin

2008-07-01

Energy supply and use is of fundamental importance to society. Although the interactions between energy and environment were originally local in character, they have now widened to cover regional and global issues, such as acid rain and the greenhouse effect. It is for this reason that there is a need for covering the direct and indirect economic and environmental impacts of energy acquisition, transport, production and use. In this paper, particular attention is directed to ways of resolving conflict between economic and environmental goals by encouraging a power plant to consider co-firing biomass and refuse-derived fuel (RDF) with coal simultaneously. It aims at reducing the emission level of sulfur dioxide (SO(2)) in an uncertain environment, using the power plant in Michigan City, Indiana as an example. To assess the uncertainty by a comparative way both deterministic and grey nonlinear mixed integer programming (MIP) models were developed to minimize the net operating cost with respect to possible fuel combinations. It aims at generating the optimal portfolio of alternative fuels while maintaining the same electricity generation simultaneously. To ease the solution procedure stepwise relaxation algorithm was developed for solving the grey nonlinear MIP model. Breakeven alternative fuel value can be identified in the post-optimization stage for decision-making. Research findings show that the inclusion of RDF does not exhibit comparative advantage in terms of the net cost, albeit relatively lower air pollution impact. Yet it can be sustained by a charge system, subsidy program, or emission credit as the price of coal increases over time.

Magnetic impurity effect on charge and magnetic order in doped La1.5Ca0.5CoO4

NASA Astrophysics Data System (ADS)

Horigane, K.; Hiraka, H.; Tomiyasu, K.; Ohoyama, K.; Louca, D.; Yamada, K.

2012-02-01

Neutron scattering experiments were performed on single crystals of magnetic impurity doped cobalt oxides La1.5Ca0.5CoO4 to characterize the charge and spin orders. We newly found contrasting impurity effects. Two types of magnetic peaks are observed at q = (0.5,0,L) with L = half-integer and integer in La1.5Ca0.5CoO4, while magnetic peak at L = half-integer (integer) was only observed in Mn (Fe)-substituted sample. Although Mn and Fe impurities degrade charge and magnetic order, Cr impurity stabilizes the ordering at x = 0.5. Based on the crystal structural analysis of Cr doped sample, we found that the excess oxygen and change of octahedron around Co3+ were realized in Cr doped sample.

Fast parallel DNA-based algorithms for molecular computation: quadratic congruence and factoring integers.

PubMed

Chang, Weng-Long

2012-03-01

Assume that n is a positive integer. If there is an integer such that M (2) ≡ C (mod n), i.e., the congruence has a solution, then C is said to be a quadratic congruence (mod n). If the congruence does not have a solution, then C is said to be a quadratic noncongruence (mod n). The task of solving the problem is central to many important applications, the most obvious being cryptography. In this article, we describe a DNA-based algorithm for solving quadratic congruence and factoring integers. In additional to this novel contribution, we also show the utility of our encoding scheme, and of the algorithm's submodules. We demonstrate how a variety of arithmetic, shifted and comparative operations, namely bitwise and full addition, subtraction, left shifter and comparison perhaps are performed using strands of DNA.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Xiaohu; Shi, Di; Wang, Zhiwei

Shunt FACTS devices, such as, a Static Var Compensator (SVC), are capable of providing local reactive power compensation. They are widely used in the network to reduce the real power loss and improve the voltage profile. This paper proposes a planning model based on mixed integer conic programming (MICP) to optimally allocate SVCs in the transmission network considering load uncertainty. The load uncertainties are represented by a number of scenarios. Reformulation and linearization techniques are utilized to transform the original non-convex model into a convex second order cone programming (SOCP) model. Numerical case studies based on the IEEE 30-bus systemmore » demonstrate the effectiveness of the proposed planning model.« less

Optimization techniques applied to spectrum management for communications satellites

NASA Astrophysics Data System (ADS)

Ottey, H. R.; Sullivan, T. M.; Zusman, F. S.

This paper describes user requirements, algorithms and software design features for the application of optimization techniques to the management of the geostationary orbit/spectrum resource. Relevant problems include parameter sensitivity analyses, frequency and orbit position assignment coordination, and orbit position allotment planning. It is shown how integer and nonlinear programming as well as heuristic search techniques can be used to solve these problems. Formalized mathematical objective functions that define the problems are presented. Constraint functions that impart the necessary solution bounds are described. A versatile program structure is outlined, which would allow problems to be solved in stages while varying the problem space, solution resolution, objective function and constraints.

The Neighborhood Covering Heuristic (NCH) Approach for the General Mixed Integer Programming Problem

DTIC Science & Technology

2004-02-02

5e. TASK NUMBER 5f. WORK UNIT NUMBER 7. PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES) Creative Action LLC 680 N. Portage Path Akron, OH 44303; The...University of Akron Department of Theoretical and Applied Mathematics Akron OH 44325-4002 8. PERFORMING ORGANIZATION REPORT NUMBER SF309 9...algorithm is naturally adaptable to a parallel architechture . In particular, under NCH, one could parcel out pieces of the problem to many processors

Neuro Inspired Adaptive Perception and Control for Agile Mobility of Autonomous Vehicles in Uncertain and Hostile Environments

DTIC Science & Technology

2017-02-08

Georgia Tech Research Corporation 505 Tenth Street NW Atlanta, GA 30332 -0420 ABSTRACT Final Report: MURI: Neuro-Inspired Adaptive Perception and...Conquer Strategy for Optimal Trajectory Planning via Mixed-Integer Programming, IEEE Transactions on Robotics, (12 2015): 0. doi: 10.1109/TRO...Learning Day, Microsoft Corporation , Cambridge, MA, May 18, 2015. (c) Presentations 09/06/2015 09/08/2015 125 131 Ali Borji, Dicky N. Sihite, Laurent Itti

Program Manager: Journal of the Defense Systems Management College. Volume 19, Number 4, July-August 1990

DTIC Science & Technology

1990-08-01

officials making process, innovation, integ- would be focused on customer were committed, as well as the Con- rity, and accountability. satisrceion...staff in the Department of The bill contains the following - Research and Information at the Defensetion which has as its goal to make S ms Managmnt Cov...Cost/Quantity Dynamics There is a necessary relationship 7 between unit costs and quantities procured, and the budget changes made. This relationship

Stochastic search in structural optimization - Genetic algorithms and simulated annealing

NASA Technical Reports Server (NTRS)

Hajela, Prabhat

1993-01-01

An account is given of illustrative applications of genetic algorithms and simulated annealing methods in structural optimization. The advantages of such stochastic search methods over traditional mathematical programming strategies are emphasized; it is noted that these methods offer a significantly higher probability of locating the global optimum in a multimodal design space. Both genetic-search and simulated annealing can be effectively used in problems with a mix of continuous, discrete, and integer design variables.

A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings

DOE PAGES

Lin, Fu; Leyffer, Sven; Munson, Todd

2016-04-12

We study a two-stage mixed-integer linear program (MILP) with more than 1 million binary variables in the second stage. We develop a two-level approach by constructing a semi-coarse model that coarsens with respect to variables and a coarse model that coarsens with respect to both variables and constraints. We coarsen binary variables by selecting a small number of prespecified on/off profiles. We aggregate constraints by partitioning them into groups and taking convex combination over each group. With an appropriate choice of coarsened profiles, the semi-coarse model is guaranteed to find a feasible solution of the original problem and hence providesmore » an upper bound on the optimal solution. We show that solving a sequence of coarse models converges to the same upper bound with proven finite steps. This is achieved by adding violated constraints to coarse models until all constraints in the semi-coarse model are satisfied. We demonstrate the effectiveness of our approach in cogeneration for buildings. Here, the coarsened models allow us to obtain good approximate solutions at a fraction of the time required by solving the original problem. Extensive numerical experiments show that the two-level approach scales to large problems that are beyond the capacity of state-of-the-art commercial MILP solvers.« less

A Mixed Integer Linear Program for Solving a Multiple Route Taxi Scheduling Problem

NASA Technical Reports Server (NTRS)

Montoya, Justin Vincent; Wood, Zachary Paul; Rathinam, Sivakumar; Malik, Waqar Ahmad

2010-01-01

Aircraft movements on taxiways at busy airports often create bottlenecks. This paper introduces a mixed integer linear program to solve a Multiple Route Aircraft Taxi Scheduling Problem. The outputs of the model are in the form of optimal taxi schedules, which include routing decisions for taxiing aircraft. The model extends an existing single route formulation to include routing decisions. An efficient comparison framework compares the multi-route formulation and the single route formulation. The multi-route model is exercised for east side airport surface traffic at Dallas/Fort Worth International Airport to determine if any arrival taxi time savings can be achieved by allowing arrivals to have two taxi routes: a route that crosses an active departure runway and a perimeter route that avoids the crossing. Results indicate that the multi-route formulation yields reduced arrival taxi times over the single route formulation only when a perimeter taxiway is used. In conditions where the departure aircraft are given an optimal and fixed takeoff sequence, accumulative arrival taxi time savings in the multi-route formulation can be as high as 3.6 hours more than the single route formulation. If the departure sequence is not optimal, the multi-route formulation results in less taxi time savings made over the single route formulation, but the average arrival taxi time is significantly decreased.

Automatic Design of Synthetic Gene Circuits through Mixed Integer Non-linear Programming

PubMed Central

Huynh, Linh; Kececioglu, John; Köppe, Matthias; Tagkopoulos, Ilias

2012-01-01

Automatic design of synthetic gene circuits poses a significant challenge to synthetic biology, primarily due to the complexity of biological systems, and the lack of rigorous optimization methods that can cope with the combinatorial explosion as the number of biological parts increases. Current optimization methods for synthetic gene design rely on heuristic algorithms that are usually not deterministic, deliver sub-optimal solutions, and provide no guaranties on convergence or error bounds. Here, we introduce an optimization framework for the problem of part selection in synthetic gene circuits that is based on mixed integer non-linear programming (MINLP), which is a deterministic method that finds the globally optimal solution and guarantees convergence in finite time. Given a synthetic gene circuit, a library of characterized parts, and user-defined constraints, our method can find the optimal selection of parts that satisfy the constraints and best approximates the objective function given by the user. We evaluated the proposed method in the design of three synthetic circuits (a toggle switch, a transcriptional cascade, and a band detector), with both experimentally constructed and synthetic promoter libraries. Scalability and robustness analysis shows that the proposed framework scales well with the library size and the solution space. The work described here is a step towards a unifying, realistic framework for the automated design of biological circuits. PMID:22536398

Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs

NASA Astrophysics Data System (ADS)

Chekuri, Chandra; Ene, Alina; Korula, Nitish

We consider the unsplittable flow problem (UFP) and the closely related column-restricted packing integer programs (CPIPs). In UFP we are given an edge-capacitated graph G = (V,E) and k request pairs R 1, ..., R k , where each R i consists of a source-destination pair (s i ,t i ), a demand d i and a weight w i . The goal is to find a maximum weight subset of requests that can be routed unsplittably in G. Most previous work on UFP has focused on the no-bottleneck case in which the maximum demand of the requests is at most the smallest edge capacity. Inspired by the recent work of Bansal et al. [3] on UFP on a path without the above assumption, we consider UFP on paths as well as trees. We give a simple O(logn) approximation for UFP on trees when all weights are identical; this yields an O(log2 n) approximation for the weighted case. These are the first non-trivial approximations for UFP on trees. We develop an LP relaxation for UFP on paths that has an integrality gap of O(log2 n); previously there was no relaxation with o(n) gap. We also consider UFP in general graphs and CPIPs without the no-bottleneck assumption and obtain new and useful results.

A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lin, Fu; Leyffer, Sven; Munson, Todd

We study a two-stage mixed-integer linear program (MILP) with more than 1 million binary variables in the second stage. We develop a two-level approach by constructing a semi-coarse model that coarsens with respect to variables and a coarse model that coarsens with respect to both variables and constraints. We coarsen binary variables by selecting a small number of prespecified on/off profiles. We aggregate constraints by partitioning them into groups and taking convex combination over each group. With an appropriate choice of coarsened profiles, the semi-coarse model is guaranteed to find a feasible solution of the original problem and hence providesmore » an upper bound on the optimal solution. We show that solving a sequence of coarse models converges to the same upper bound with proven finite steps. This is achieved by adding violated constraints to coarse models until all constraints in the semi-coarse model are satisfied. We demonstrate the effectiveness of our approach in cogeneration for buildings. Here, the coarsened models allow us to obtain good approximate solutions at a fraction of the time required by solving the original problem. Extensive numerical experiments show that the two-level approach scales to large problems that are beyond the capacity of state-of-the-art commercial MILP solvers.« less

Mixed integer simulation optimization for optimal hydraulic fracturing and production of shale gas fields

NASA Astrophysics Data System (ADS)

Li, J. C.; Gong, B.; Wang, H. G.

2016-08-01

Optimal development of shale gas fields involves designing a most productive fracturing network for hydraulic stimulation processes and operating wells appropriately throughout the production time. A hydraulic fracturing network design-determining well placement, number of fracturing stages, and fracture lengths-is defined by specifying a set of integer ordered blocks to drill wells and create fractures in a discrete shale gas reservoir model. The well control variables such as bottom hole pressures or production rates for well operations are real valued. Shale gas development problems, therefore, can be mathematically formulated with mixed-integer optimization models. A shale gas reservoir simulator is used to evaluate the production performance for a hydraulic fracturing and well control plan. To find the optimal fracturing design and well operation is challenging because the problem is a mixed integer optimization problem and entails computationally expensive reservoir simulation. A dynamic simplex interpolation-based alternate subspace (DSIAS) search method is applied for mixed integer optimization problems associated with shale gas development projects. The optimization performance is demonstrated with the example case of the development of the Barnett Shale field. The optimization results of DSIAS are compared with those of a pattern search algorithm.

Interplay of Hofstadter and quantum Hall states in bilayer graphene

NASA Astrophysics Data System (ADS)

Spanton, Eric M.; Zibrov, Alexander A.; Zhou, Haoxin; Taniguchi, Takashi; Watanabe, Kenji; Young, Andrea

Electron interactions in ultraclean systems such as graphene lead to the fractional quantum Hall effect in an applied magnetic field. Long wavelength periodic potentials from a moiré pattern in aligned boron nitride-graphene heterostructures may compete with such interactions and favor spatially ordered states (e.g. Wigner crystals orcharge density waves). To investigate this competition, we studied the bulk phase diagram of asymmetrically moiré-coupled bilayer graphene via multi-terminal magnetocapacitance measurements at ultra-high magnetic fields. Two quantum numbers characterize energy gaps in this regime: t, which indexes the Bloch bands, and s, which indexes the Landau level. Similar to past experiments, we observe the conventional integer and fractional quantum Hall gaps (t = 0), integer Hofstadter gaps (integer s and integer t ≠ 0), and fractional Bloch states associated with an expanded superlattice unit cell (fractional s and integer t). Additionally, we find states with fractional values for both s and t. Measurement of the capacitance matrix shows that these states occur on the layer exposed to the strong periodic potential. We discuss the results in terms of possible fractional quantum hall states unique to periodically modulated systems.

Spatially resolved spectroscopy analysis of the XMM-Newton large program on SN1006

NASA Astrophysics Data System (ADS)

Li, Jiang-Tao; Decourchelle, Anne; Miceli, Marco; Vink, Jacco; Bocchino, Fabrizio

2016-04-01

We perform analysis of the XMM-Newton large program on SN1006 based on our newly developed methods of spatially resolved spectroscopy analysis. We extract spectra from low and high resolution meshes. The former (3596 meshes) is used to roughly decompose the thermal and non-thermal components and characterize the spatial distributions of different parameters, such as temperature, abundances of different elements, ionization age, and electron density of the thermal component, as well as photon index and cutoff frequency of the non-thermal component. On the other hand, the low resolution meshes (583 meshes) focus on the interior region dominated by the thermal emission and have enough counts to well characterize the Si lines. We fit the spectra from the low resolution meshes with different models, in order to decompose the multiple plasma components at different thermal and ionization states and compare their spatial distributions. In this poster, we will present the initial results of this project.

COMDECOM: predicting the lifetime of screening compounds in DMSO solution.

PubMed

Zitha-Bovens, Emrin; Maas, Peter; Wife, Dick; Tijhuis, Johan; Hu, Qian-Nan; Kleinöder, Thomas; Gasteiger, Johann

2009-06-01

The technological evolution of the 1990s in both combinatorial chemistry and high-throughput screening created the demand for rapid access to the compound deck to support the screening process. The common strategy within the pharmaceutical industry is to store the screening library in DMSO solution. Several studies have shown that a percentage of these compounds decompose in solution, varying from a few percent of the total to a substantial part of the library. In the COMDECOM (COMpound DECOMposition) project, the compound stability of screening compounds in DMSO solution is monitored in an accelerated thermal, hydrolytic, and oxidative decomposition program. A large database with stability data is collected, and from this database, a predictive model is being developed. The aim of this program is to build an algorithm that can flag compounds that are likely to decompose-information that is considered to be of utmost importance (e.g., in the compound acquisition process and when evaluation screening results of library compounds, as well as in the determination of optimal storage conditions).

Army Illumination Model v2 User’s Manual

DTIC Science & Technology

2011-09-01

Fraction of city luminosity escaping above the horizontal from lamp fixtures 10–15% suggested month4 integer Month of year 2 digits day4 integer Day...of month 2 digits yr4 integer Year 4 digits utc4 real UTC time of observer Equivalent to Zulu or GMT 4 Table 1. AIM input values, their...from 0.10 to 0.15. 2.1.4 Record 4 2.1.4.1 Date and Time The month (1–12), day (1–31), 4- digit year and coordinated universal time (UTC) for the

Modelling with Integer Variables.

DTIC Science & Technology

1984-01-01

Computational Comparison of * ’Equivalent’ Mixed Integer Formulations," Naval Research Logistics Quarterly 28 (1981), pp. 115- 131 . 39. R. R, Meyer and...jE(i) 3 K ".- .e I " Z A . .,.. x jCI (i) IJ ~s ;:. ... i=I 1 1X. integer A- k . . . . . . . . . . . ... . ... . . . . . . . . . o...be such that Z X.. = 1 andIfxCi’e k jcI (i) 11 13 kx m). *x + E okv . Then by putting Xil and X.=O for j* i, j£I(i) kE (2.3.4) holds. Hence S’ Pi" As

Radial Instabilities of a Pulsating Air Bubble in Water

DTIC Science & Technology

1990-01-30

ERASEDISPLAY GOTO 100 ELSE C CALL ERASEDISPLAY CALL EXIr ENDIF END I 1 257 3 PRCA PM SHAPE VIRTUAL DRIVE(16384) WAVE1 (16384) , WAVE2 (16L8 4 ’ ,DC(16384)3...INTEGER DRIVE, WAVE1, WAVE2 , DC INTEGER ROW, COL, NCHAR, I, OSCADR, GENADR, INFO (50) , MAXVAL, MAXV INTEGER KOUNT REAL GEN, ATEMP, WTEMP, WATT, FREQ...IREC=1 26D CALL GETWAV (1, DC, OSCADR, I REC) CALL GETWAV (2, DRIVE, OSCADR, IREC) CALL GETWAV (3, WAVE1, OSCADR, IREC) CALL GETWAV (4, WAVE2 ,OSCADR

Enhanced ant colony optimization for inventory routing problem

NASA Astrophysics Data System (ADS)

Wong, Lily; Moin, Noor Hasnah

2015-10-01

The inventory routing problem (IRP) integrates and coordinates two important components of supply chain management which are transportation and inventory management. We consider a one-to-many IRP network for a finite planning horizon. The demand for each product is deterministic and time varying as well as a fleet of capacitated homogeneous vehicles, housed at a depot/warehouse, delivers the products from the warehouse to meet the demand specified by the customers in each period. The inventory holding cost is product specific and is incurred at the customer sites. The objective is to determine the amount of inventory and to construct a delivery routing that minimizes both the total transportation and inventory holding cost while ensuring each customer's demand is met over the planning horizon. The problem is formulated as a mixed integer programming problem and is solved using CPLEX 12.4 to get the lower and upper bound (best integer) for each instance considered. We propose an enhanced ant colony optimization (ACO) to solve the problem and the built route is improved by using local search. The computational experiments demonstrating the effectiveness of our approach is presented.

Statistical analysis of the limitation of half integer resonances on the available momentum acceptance of the High Energy Photon Source

NASA Astrophysics Data System (ADS)

Jiao, Yi; Duan, Zhe

2017-01-01

In a diffraction-limited storage ring, half integer resonances can have strong effects on the beam dynamics, associated with the large detuning terms from the strong focusing and strong sextupoles as required for an ultralow emittance. In this study, the limitation of half integer resonances on the available momentum acceptance (MA) was statistically analyzed based on one design of the High Energy Photon Source (HEPS). It was found that the probability of MA reduction due to crossing of half integer resonances is closely correlated with the level of beta beats at the nominal tunes, but independent of the error sources. The analysis indicated that for the presented HEPS lattice design, the rms amplitude of beta beats should be kept below 1.5% horizontally and 2.5% vertically to reach a small MA reduction probability of about 1%.

Fabry-Perot Interferometry in the Integer and Fractional Quantum Hall Regimes

NASA Astrophysics Data System (ADS)

McClure, Douglas; Chang, Willy; Kou, Angela; Marcus, Charles; Pfeiffer, Loren; West, Ken

2011-03-01

We present measurements of electronic Fabry-Perot interferometers in the integer and fractional quantum Hall regimes. Two classes of resistance oscillations may be seen as a function of magnetic field and gate voltage, as we have previously reported. In small interferometers in the integer regime, oscillations of the type associated with Coulomb interaction are ubiquitous, while those consistent with single-particle Aharonov-Bohm interference are seen to co-exist in some configurations. The amplitude scaling of both types with temperature and device size is consistent with a theoretical model. Oscillations are further observed in the fractional quantum Hall regime. Here the dependence of the period on the filling factors in the constrictions and bulk of the interferometer can shed light on the effective charge of the interfering quasiparticles, but care is needed to distinguish these oscillations from those associated with integer quantum Hall states. We acknowledge funding from Microsoft Project Q and IBM.

Numerical bias in bounded and unbounded number line tasks.

PubMed

Cohen, Dale J; Blanc-Goldhammer, Daryn

2011-04-01

The number line task is often used to assess children's and adults' underlying representations of integers. Traditional bounded number line tasks, however, have limitations that can lead to misinterpretation. Here we present a new task, an unbounded number line task, that overcomes these limitations. In Experiment 1, we show that adults use a biased proportion estimation strategy to complete the traditional bounded number line task. In Experiment 2, we show that adults use a dead-reckoning integer estimation strategy in our unbounded number line task. Participants revealed a positively accelerating numerical bias in both tasks, but showed scalar variance only in the unbounded number line task. We conclude that the unbounded number line task is a more pure measure of integer representation than the bounded number line task, and using these results, we present a preliminary description of adults' underlying representation of integers.

Decomposing economic disparities in risky sexual behaviors among people who inject drugs in Tehran: Blinder-Oaxaca decomposition analysis.

PubMed

Noroozi, Mehdi; Sharifi, Hamid; Noroozi, Alireza; Rezaei, Fatemah; Bazrafshan, Mohammad Rafi; Armoon, Bahram

2017-01-01

To our knowledge, no previous study has systematically assessed the role of economic status in risky sexual behavior among people who inject drugs (PWID) in Iran. In this study, we used Blinder-Oaxaca (BO) decomposition to explore the contribution of economic status to inequality in unprotected sex among PWID in Tehran and to decompose it into its determinants. Behavioral surveys among PWID were conducted in Tehran, the capital city of Iran, from November 2016 to April 2017. We employed a cross-sectional design and snowball sampling methodology. We constructed the asset index (weighted by the first principal component analysis factor) using socioeconomic data and then divided the variable into 3 tertiles. We used the BO method to decompose the economic inequality in unprotected sex. Of the 520 recruited individuals, 20 were missing data for variables used to define their economic status, and were therefore excluded from the analysis. Not having access to harm reduction programs was the largest factor contributing to the economic disparity in unprotected sex, accounting for 5.5 percentage points of the 21.4% discrepancy. Of the unadjusted total economic disparity in unprotected sex, 52% was unexplained by observable characteristics included in the regression model. The difference in the prevalence of unprotected sex between the high-income and low-income groups was 25%. Increasing needle syringe program coverage and improving human immunodeficiency virus (HIV) knowledge are essential for efforts to eliminate inequalities in HIV risk behaviors among PWID.

Summing up the Euler [phi] Function

ERIC Educational Resources Information Center

Loomis, Paul; Plytage, Michael; Polhill, John

2008-01-01

The Euler [phi] function counts the number of positive integers less than and relatively prime to a positive integer n. Here we look at perfect totient numbers, number for which [phi](n) + [phi]([phi](n)) + [phi]([phi]([phi](n))) + ... + 1 = n.

Multicriteria Cost Assessment and Logistics Modeling for Military Humanitarian Assistance and Disaster Relief Aerial Delivery Operations

DTIC Science & Technology

2015-03-01

vulnerable people will have access to this airdropped consumable aid (since nobody 1 is necessarily coordinating the distribution on the ground... VBA ) platforms (see Appendix B). In particular, we used GAMS v.23.9.3 with IBM ILOG CPLEX 12.4.0.1 to solve the stochastic, mixed-integer weighted...goal programming model, and we used Excel/ VBA to create an auto- matic, user-friendly interface with the decision maker for model input and analysis of

A Low-Cost Part-Task Flight Training System: An Application of a Head Mounted Display

DTIC Science & Technology

1990-12-01

architecture. The task at hand was to develop a software emulation libary that would emulate the function calls used within the Flight and Dog programs. This...represented in two hexadecimal digits for each color. The format of the packed long integer looks like aaggbbrr with each color value representing a...Western Digital ethernet card as the cheapest compatible card available. Good fortune arrived, as I was calling to order the card, I saw an unused card

Computer program for Bessel and Hankel functions

NASA Technical Reports Server (NTRS)

Kreider, Kevin L.; Saule, Arthur V.; Rice, Edward J.; Clark, Bruce J.

1991-01-01

A set of FORTRAN subroutines for calculating Bessel and Hankel functions is presented. The routines calculate Bessel and Hankel functions of the first and second kinds, as well as their derivatives, for wide ranges of integer order and real or complex argument in single or double precision. Depending on the order and argument, one of three evaluation methods is used: the power series definition, an Airy function expansion, or an asymptotic expansion. Routines to calculate Airy functions and their derivatives are also included.

The Staircase and Related Structures in Integer Programming.

DTIC Science & Technology

1980-06-01

objective value of the incumbent x; 38 zk(i) = optimal objective value of the LP relaxation of node i (descended from subproblem k); GPk (i) = maximum...following fathoming conditions holds at the current node i: (a) the LP relaxation of node i is infeasible. (b) cumobj + FLOOR(Zk(i) + GPk (i)) + maxc(k...zk(i) + GPk (i), where (as before) GPk (i) is the maximum Gomory penalty associated with node i of subproblem k, and zk(i) is the objective value of the

An Airlift Hub-and-Spoke Location-Routing Model with Time Windows: Case Study of the CONUS-to-Korea Airlift Problem

DTIC Science & Technology

1998-03-01

a point of embarkation to a point of debarkation. This study develops an alternative hub-and-spoke combined location-routing integer linear...programming prototype model, and uses this model to determine what advantages a hub-and-spoke system offers, and in which scenarios it is better-suited than the...extension on the following works: the hierarchical model of Perl and Daskin (1983), time windows features of Chan (1991), combining subtour-breaking and range

Solving a Class of Stochastic Mixed-Integer Programs With Branch and Price

DTIC Science & Technology

2006-01-01

a two-dimensional knapsack problem, but for a given m, the objective value gi does not depend on the variance index v. This will be used in a final...optimization. Journal of Multicriteria Decision Analysis 11, 139–150 (2002) 29. Ford, L.R., Fulkerson, D.R.: A suggested computation for the maximal...for solution by a branch-and-price algorithm (B&P). We then survey a number of examples, and use a stochastic facility-location problem (SFLP) for a

Primer on Computer Graphics Programming. Revision

DTIC Science & Technology

1982-04-01

TEXTO 60 TO 4 3 CALL UWRITl C’Ai’,’TEXT𔃽 4 CONTINUE «.«. ^^^^ef%,xN...CX.Y.’NOO mm^^ CALL UPRNTl CTTTLECO,’ TEXTO CALL UPRNTJ CX.OPTIONCI33 CALL UPRNTJ CTITLEC25.’ TEXTO CALL UPRNTl CY,OPTIONCli3 CALL UMOVE OC.Y5...CALL USET (’TEXT’) CALL UPRINT (-1.0,-1.05,’SIDES;’) CALL USET (’INTEGER’) CALL UPRINT (0.9,-1.05,S! DES ) 1 CONTINUE CALLUEND STOP

The CCTC Quick-Reacting General War Gaming System (QUICK) Program Maintenance Manual. Volume I. Data Management Subsystem. Change 3.

DTIC Science & Technology

1980-05-22

cross -referenced with the number of the data transaction listed in the data module quality con- trol list NVB Integer variable used to...Organization of the Joint Chiefs of Staff. Technical support was provided by System Sciences, Incorporated under Contract Number DCA100-75-C-0019. Change set... Contract Number DCA 100-75-C-0019. Change set two was prepared u nder Contract Number DCA 100-78-C-0035. Computer Sciences Corporation prepared change

On unified modeling, theory, and method for solving multi-scale global optimization problems

NASA Astrophysics Data System (ADS)

Gao, David Yang

2016-10-01

A unified model is proposed for general optimization problems in multi-scale complex systems. Based on this model and necessary assumptions in physics, the canonical duality theory is presented in a precise way to include traditional duality theories and popular methods as special applications. Two conjectures on NP-hardness are proposed, which should play important roles for correctly understanding and efficiently solving challenging real-world problems. Applications are illustrated for both nonconvex continuous optimization and mixed integer nonlinear programming.

Path finding methods accounting for stoichiometry in metabolic networks

PubMed Central

2011-01-01

Graph-based methods have been widely used for the analysis of biological networks. Their application to metabolic networks has been much discussed, in particular noting that an important weakness in such methods is that reaction stoichiometry is neglected. In this study, we show that reaction stoichiometry can be incorporated into path-finding approaches via mixed-integer linear programming. This major advance at the modeling level results in improved prediction of topological and functional properties in metabolic networks. PMID:21619601

Unimodular lattices in dimensions 14 and 15 over the Eisenstein integers

NASA Astrophysics Data System (ADS)

Abdukhalikov, Kanat; Scharlau, Rudolf

2009-03-01

All indecomposable unimodular hermitian lattices in dimensions 14 and 15 over the ring of integers in mathbb{Q}(sqrt{-3}) are determined. Precisely one lattice in dimension 14 and two lattices in dimension 15 have minimal norm 3.

Sylow p-groups of polynomial permutations on the integers mod pn☆

PubMed Central

Frisch, Sophie; Krenn, Daniel

2013-01-01

We enumerate and describe the Sylow p-groups of the groups of polynomial permutations of the integers mod pn for n⩾1 and of the pro-finite group which is the projective limit of these groups. PMID:26869732

Fast and secure encryption-decryption method based on chaotic dynamics

DOEpatents

Protopopescu, Vladimir A.; Santoro, Robert T.; Tolliver, Johnny S.

1995-01-01

A method and system for the secure encryption of information. The method comprises the steps of dividing a message of length L into its character components; generating m chaotic iterates from m independent chaotic maps; producing an "initial" value based upon the m chaotic iterates; transforming the "initial" value to create a pseudo-random integer; repeating the steps of generating, producing and transforming until a pseudo-random integer sequence of length L is created; and encrypting the message as ciphertext based upon the pseudo random integer sequence. A system for accomplishing the invention is also provided.

Inductance Calculations of Variable Pitch Helical Inductors

DTIC Science & Technology

2015-08-01

8217 ’ Integral solution using Simpson’s Rule ’ Dim i As Integer Dim Pi As Double, uo As Double, kc As Double Dim a As Double, amax As Double, da As...Double Dim steps As Integer Dim func1a As Double, func1b As Double ’ On Error GoTo err_TorisV1 steps = 1000 Pi = 3.14159 uo = 4 * Pi * 0.0000001...As Double ’ ’ Integral solution using Simpson’s Rule ’ Dim i As Integer Dim Pi As Double, uo As Double, kc As Double Dim a As Double, amax As

Polarization singularity indices in Gaussian laser beams

NASA Astrophysics Data System (ADS)

Freund, Isaac

2002-01-01

Two types of point singularities in the polarization of a paraxial Gaussian laser beam are discussed in detail. V-points, which are vector point singularities where the direction of the electric vector of a linearly polarized field becomes undefined, and C-points, which are elliptic point singularities where the ellipse orientations of elliptically polarized fields become undefined. Conventionally, V-points are characterized by the conserved integer valued Poincaré-Hopf index η, with generic value η=±1, while C-points are characterized by the conserved half-integer singularity index IC, with generic value IC=±1/2. Simple algorithms are given for generating V-points with arbitrary positive or negative integer indices, including zero, at arbitrary locations, and C-points with arbitrary positive or negative half-integer or integer indices, including zero, at arbitrary locations. Algorithms are also given for generating continuous lines of these singularities in the plane, V-lines and C-lines. V-points and C-points may be transformed one into another. A topological index based on directly measurable Stokes parameters is used to discuss this transformation. The evolution under propagation of V-points and C-points initially embedded in the beam waist is studied, as is the evolution of V-dipoles and C-dipoles.

Multiple Choice Knapsack Problem: example of planning choice in transportation.

PubMed

Zhong, Tao; Young, Rhonda

2010-05-01

Transportation programming, a process of selecting projects for funding given budget and other constraints, is becoming more complex as a result of new federal laws, local planning regulations, and increased public involvement. This article describes the use of an integer programming tool, Multiple Choice Knapsack Problem (MCKP), to provide optimal solutions to transportation programming problems in cases where alternative versions of projects are under consideration. In this paper, optimization methods for use in the transportation programming process are compared and then the process of building and solving the optimization problems is discussed. The concepts about the use of MCKP are presented and a real-world transportation programming example at various budget levels is provided. This article illustrates how the use of MCKP addresses the modern complexities and provides timely solutions in transportation programming practice. While the article uses transportation programming as a case study, MCKP can be useful in other fields where a similar decision among a subset of the alternatives is required. Copyright 2009 Elsevier Ltd. All rights reserved.

Model for the design of distributed data bases

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ram, S.

This research focuses on developing a model to solve the File Allocation Problem (FAP). The model integrates two major design issues, namely Concurrently Control and Data Distribution. The central node locking mechanism is incorporated in developing a nonlinear integer programming model. Two solution algorithms are proposed, one of which was implemented in FORTRAN.V. The allocation of data bases and programs are examined using this heuristic. Several decision rules were also formulated based on the results of the heuristic. A second more comprehensive heuristic was proposed, based on the knapsack problem. The development and implementation of this algorithm has been leftmore » as a topic for future research.« less

Fermat's Last Theorem for Factional and Irrational Exponents

ERIC Educational Resources Information Center

Morgan, Frank

2010-01-01

Fermat's Last Theorem says that for integers n greater than 2, there are no solutions to x[superscript n] + y[superscript n] = z[superscript n] among positive integers. What about rational exponents? Irrational n? Negative n? See what an undergraduate senior seminar discovered.

Improving consensus contact prediction via server correlation reduction.

PubMed

Gao, Xin; Bu, Dongbo; Xu, Jinbo; Li, Ming

2009-05-06

Protein inter-residue contacts play a crucial role in the determination and prediction of protein structures. Previous studies on contact prediction indicate that although template-based consensus methods outperform sequence-based methods on targets with typical templates, such consensus methods perform poorly on new fold targets. However, we find out that even for new fold targets, the models generated by threading programs can contain many true contacts. The challenge is how to identify them. In this paper, we develop an integer linear programming model for consensus contact prediction. In contrast to the simple majority voting method assuming that all the individual servers are equally important and independent, the newly developed method evaluates their correlation by using maximum likelihood estimation and extracts independent latent servers from them by using principal component analysis. An integer linear programming method is then applied to assign a weight to each latent server to maximize the difference between true contacts and false ones. The proposed method is tested on the CASP7 data set. If the top L/5 predicted contacts are evaluated where L is the protein size, the average accuracy is 73%, which is much higher than that of any previously reported study. Moreover, if only the 15 new fold CASP7 targets are considered, our method achieves an average accuracy of 37%, which is much better than that of the majority voting method, SVM-LOMETS, SVM-SEQ, and SAM-T06. These methods demonstrate an average accuracy of 13.0%, 10.8%, 25.8% and 21.2%, respectively. Reducing server correlation and optimally combining independent latent servers show a significant improvement over the traditional consensus methods. This approach can hopefully provide a powerful tool for protein structure refinement and prediction use.

Op-Ug TD Optimizer Tool Based on Matlab Code to Find Transition Depth From Open Pit to Block Caving / Narzędzie Optymalizacyjne Oparte O Kod Matlab Wykorzystane Do Określania Głębokości Przejściowej Od Wydobycia Odkrywkowego Do Wybierania Komorami

NASA Astrophysics Data System (ADS)

Bakhtavar, E.

2015-09-01

In this study, transition from open pit to block caving has been considered as a challenging problem. For this purpose, the linear integer programing code of Matlab was initially developed on the basis of the binary integer model proposed by Bakhtavar et al (2012). Then a program based on graphical user interface (GUI) was set up and named "Op-Ug TD Optimizer". It is a beneficial tool for simple application of the model in all situations where open pit is considered together with block caving method for mining an ore deposit. Finally, Op-Ug TD Optimizer has been explained step by step through solving the transition from open pit to block caving problem of a case ore deposit. W pracy tej rozważano skomplikowane zagadnienie przejścia od wybierania odkrywkowego do komorowego. W tym celu opracowano kod programowania liniowego w środowisku MATLAB w oparciu o model liczb binarnych zaproponowany przez Bakhtavara (2012). Następnie opracowano program z wykorzystujący graficzny interfejs użytkownika o nazwie Optymalizator Op-Ug TD. Jest to niezwykle cenne narzędzie umożliwiające stosowanie modelu dla wszystkich warunków w sytuacjach gdy rozważamy prowadzenie wydobycia metodą odkrywkową oraz wydobycie komorowe przy eksploatacji złóż rud żelaza. W końcowej części pracy podano szczegółową instrukcję stosowanie programu Optymalizator na przedstawionym przykładzie przejścia od wydobycia rud żelaza metodami odkrywkowymi poprzez wydobycie komorami.

A set-covering based heuristic algorithm for the periodic vehicle routing problem.

PubMed

Cacchiani, V; Hemmelmayr, V C; Tricoire, F

2014-01-30

We present a hybrid optimization algorithm for mixed-integer linear programming, embedding both heuristic and exact components. In order to validate it we use the periodic vehicle routing problem (PVRP) as a case study. This problem consists of determining a set of minimum cost routes for each day of a given planning horizon, with the constraints that each customer must be visited a required number of times (chosen among a set of valid day combinations), must receive every time the required quantity of product, and that the number of routes per day (each respecting the capacity of the vehicle) does not exceed the total number of available vehicles. This is a generalization of the well-known vehicle routing problem (VRP). Our algorithm is based on the linear programming (LP) relaxation of a set-covering-like integer linear programming formulation of the problem, with additional constraints. The LP-relaxation is solved by column generation, where columns are generated heuristically by an iterated local search algorithm. The whole solution method takes advantage of the LP-solution and applies techniques of fixing and releasing of the columns as a local search, making use of a tabu list to avoid cycling. We show the results of the proposed algorithm on benchmark instances from the literature and compare them to the state-of-the-art algorithms, showing the effectiveness of our approach in producing good quality solutions. In addition, we report the results on realistic instances of the PVRP introduced in Pacheco et al. (2011)  [24] and on benchmark instances of the periodic traveling salesman problem (PTSP), showing the efficacy of the proposed algorithm on these as well. Finally, we report the new best known solutions found for all the tested problems.

A set-covering based heuristic algorithm for the periodic vehicle routing problem

PubMed Central

Cacchiani, V.; Hemmelmayr, V.C.; Tricoire, F.

2014-01-01

We present a hybrid optimization algorithm for mixed-integer linear programming, embedding both heuristic and exact components. In order to validate it we use the periodic vehicle routing problem (PVRP) as a case study. This problem consists of determining a set of minimum cost routes for each day of a given planning horizon, with the constraints that each customer must be visited a required number of times (chosen among a set of valid day combinations), must receive every time the required quantity of product, and that the number of routes per day (each respecting the capacity of the vehicle) does not exceed the total number of available vehicles. This is a generalization of the well-known vehicle routing problem (VRP). Our algorithm is based on the linear programming (LP) relaxation of a set-covering-like integer linear programming formulation of the problem, with additional constraints. The LP-relaxation is solved by column generation, where columns are generated heuristically by an iterated local search algorithm. The whole solution method takes advantage of the LP-solution and applies techniques of fixing and releasing of the columns as a local search, making use of a tabu list to avoid cycling. We show the results of the proposed algorithm on benchmark instances from the literature and compare them to the state-of-the-art algorithms, showing the effectiveness of our approach in producing good quality solutions. In addition, we report the results on realistic instances of the PVRP introduced in Pacheco et al. (2011)  [24] and on benchmark instances of the periodic traveling salesman problem (PTSP), showing the efficacy of the proposed algorithm on these as well. Finally, we report the new best known solutions found for all the tested problems. PMID:24748696

Array-based satellite phase bias sensing: theory and GPS/BeiDou/QZSS results

NASA Astrophysics Data System (ADS)

Khodabandeh, A.; Teunissen, P. J. G.

2014-09-01

Single-receiver integer ambiguity resolution (IAR) is a measurement concept that makes use of network-derived non-integer satellite phase biases (SPBs), among other corrections, to recover and resolve the integer ambiguities of the carrier-phase data of a single GNSS receiver. If it is realized, the very precise integer ambiguity-resolved carrier-phase data would then contribute to the estimation of the receiver’s position, thus making (near) real-time precise point positioning feasible. Proper definition and determination of the SPBs take a leading part in developing the idea of single-receiver IAR. In this contribution, the concept of array-based between-satellite single-differenced (SD) SPB determination is introduced, which is aimed to reduce the code-dominated precision of the SD-SPB corrections. The underlying model is realized by giving the role of the local reference network to an array of antennas, mounted on rigid platforms, that are separated by short distances so that the same ionospheric delay is assumed to be experienced by all the antennas. To that end, a closed-form expression of the array-aided SD-SPB corrections is presented, thereby proposing a simple strategy to compute the SD-SPBs. After resolving double-differenced ambiguities of the array’s data, the variance of the SD-SPB corrections is shown to be reduced by a factor equal to the number of antennas. This improvement in precision is also affirmed by numerical results of the three GNSSs GPS, BeiDou and QZSS. Experimental results demonstrate that the integer-recovered ambiguities converge to integers faster, upon increasing the number of antennas aiding the SD-SPB corrections.

A Mixed Integer Efficient Global Optimization Framework: Applied to the Simultaneous Aircraft Design, Airline Allocation and Revenue Management Problem

NASA Astrophysics Data System (ADS)

Roy, Satadru

Traditional approaches to design and optimize a new system, often, use a system-centric objective and do not take into consideration how the operator will use this new system alongside of other existing systems. This "hand-off" between the design of the new system and how the new system operates alongside other systems might lead to a sub-optimal performance with respect to the operator-level objective. In other words, the system that is optimal for its system-level objective might not be best for the system-of-systems level objective of the operator. Among the few available references that describe attempts to address this hand-off, most follow an MDO-motivated subspace decomposition approach of first designing a very good system and then provide this system to the operator who decides the best way to use this new system along with the existing systems. The motivating example in this dissertation presents one such similar problem that includes aircraft design, airline operations and revenue management "subspaces". The research here develops an approach that could simultaneously solve these subspaces posed as a monolithic optimization problem. The monolithic approach makes the problem a Mixed Integer/Discrete Non-Linear Programming (MINLP/MDNLP) problem, which are extremely difficult to solve. The presence of expensive, sophisticated engineering analyses further aggravate the problem. To tackle this challenge problem, the work here presents a new optimization framework that simultaneously solves the subspaces to capture the "synergism" in the problem that the previous decomposition approaches may not have exploited, addresses mixed-integer/discrete type design variables in an efficient manner, and accounts for computationally expensive analysis tools. The framework combines concepts from efficient global optimization, Kriging partial least squares, and gradient-based optimization. This approach then demonstrates its ability to solve an 11 route airline network problem consisting of 94 decision variables including 33 integer and 61 continuous type variables. This application problem is a representation of an interacting group of systems and provides key challenges to the optimization framework to solve the MINLP problem, as reflected by the presence of a moderate number of integer and continuous type design variables and expensive analysis tool. The result indicates simultaneously solving the subspaces could lead to significant improvement in the fleet-level objective of the airline when compared to the previously developed sequential subspace decomposition approach. In developing the approach to solve the MINLP/MDNLP challenge problem, several test problems provided the ability to explore performance of the framework. While solving these test problems, the framework showed that it could solve other MDNLP problems including categorically discrete variables, indicating that the framework could have broader application than the new aircraft design-fleet allocation-revenue management problem.

Comparing the performance of expert user heuristics and an integer linear program in aircraft carrier deck operations.

PubMed

Ryan, Jason C; Banerjee, Ashis Gopal; Cummings, Mary L; Roy, Nicholas

2014-06-01

Planning operations across a number of domains can be considered as resource allocation problems with timing constraints. An unexplored instance of such a problem domain is the aircraft carrier flight deck, where, in current operations, replanning is done without the aid of any computerized decision support. Rather, veteran operators employ a set of experience-based heuristics to quickly generate new operating schedules. These expert user heuristics are neither codified nor evaluated by the United States Navy; they have grown solely from the convergent experiences of supervisory staff. As unmanned aerial vehicles (UAVs) are introduced in the aircraft carrier domain, these heuristics may require alterations due to differing capabilities. The inclusion of UAVs also allows for new opportunities for on-line planning and control, providing an alternative to the current heuristic-based replanning methodology. To investigate these issues formally, we have developed a decision support system for flight deck operations that utilizes a conventional integer linear program-based planning algorithm. In this system, a human operator sets both the goals and constraints for the algorithm, which then returns a proposed schedule for operator approval. As a part of validating this system, the performance of this collaborative human-automation planner was compared with that of the expert user heuristics over a set of test scenarios. The resulting analysis shows that human heuristics often outperform the plans produced by an optimization algorithm, but are also often more conservative.

Constrained spacecraft reorientation using mixed integer convex programming

NASA Astrophysics Data System (ADS)

Tam, Margaret; Glenn Lightsey, E.

2016-10-01

A constrained attitude guidance (CAG) system is developed using convex optimization to autonomously achieve spacecraft pointing objectives while meeting the constraints imposed by on-board hardware. These constraints include bounds on the control input and slew rate, as well as pointing constraints imposed by the sensors. The pointing constraints consist of inclusion and exclusion cones that dictate permissible orientations of the spacecraft in order to keep objects in or out of the field of view of the sensors. The optimization scheme drives a body vector towards a target inertial vector along a trajectory that consists solely of permissible orientations in order to achieve the desired attitude for a given mission mode. The non-convex rotational kinematics are handled by discretization, which also ensures that the quaternion stays unity norm. In order to guarantee an admissible path, the pointing constraints are relaxed. Depending on how strict the pointing constraints are, the degree of relaxation is tuneable. The use of binary variables permits the inclusion of logical expressions in the pointing constraints in the case that a set of sensors has redundancies. The resulting mixed integer convex programming (MICP) formulation generates a steering law that can be easily integrated into an attitude determination and control (ADC) system. A sample simulation of the system is performed for the Bevo-2 satellite, including disturbance torques and actuator dynamics which are not modeled by the controller. Simulation results demonstrate the robustness of the system to disturbances while meeting the mission requirements with desirable performance characteristics.

Comparing genomes with rearrangements and segmental duplications.

PubMed

Shao, Mingfu; Moret, Bernard M E

2015-06-15

Large-scale evolutionary events such as genomic rearrange.ments and segmental duplications form an important part of the evolution of genomes and are widely studied from both biological and computational perspectives. A basic computational problem is to infer these events in the evolutionary history for given modern genomes, a task for which many algorithms have been proposed under various constraints. Algorithms that can handle both rearrangements and content-modifying events such as duplications and losses remain few and limited in their applicability. We study the comparison of two genomes under a model including general rearrangements (through double-cut-and-join) and segmental duplications. We formulate the comparison as an optimization problem and describe an exact algorithm to solve it by using an integer linear program. We also devise a sufficient condition and an efficient algorithm to identify optimal substructures, which can simplify the problem while preserving optimality. Using the optimal substructures with the integer linear program (ILP) formulation yields a practical and exact algorithm to solve the problem. We then apply our algorithm to assign in-paralogs and orthologs (a necessary step in handling duplications) and compare its performance with that of the state-of-the-art method MSOAR, using both simulations and real data. On simulated datasets, our method outperforms MSOAR by a significant margin, and on five well-annotated species, MSOAR achieves high accuracy, yet our method performs slightly better on each of the 10 pairwise comparisons. http://lcbb.epfl.ch/softwares/coser. © The Author 2015. Published by Oxford University Press.

Maximum likelihood pedigree reconstruction using integer linear programming.

PubMed

Cussens, James; Bartlett, Mark; Jones, Elinor M; Sheehan, Nuala A

2013-01-01

Large population biobanks of unrelated individuals have been highly successful in detecting common genetic variants affecting diseases of public health concern. However, they lack the statistical power to detect more modest gene-gene and gene-environment interaction effects or the effects of rare variants for which related individuals are ideally required. In reality, most large population studies will undoubtedly contain sets of undeclared relatives, or pedigrees. Although a crude measure of relatedness might sometimes suffice, having a good estimate of the true pedigree would be much more informative if this could be obtained efficiently. Relatives are more likely to share longer haplotypes around disease susceptibility loci and are hence biologically more informative for rare variants than unrelated cases and controls. Distant relatives are arguably more useful for detecting variants with small effects because they are less likely to share masking environmental effects. Moreover, the identification of relatives enables appropriate adjustments of statistical analyses that typically assume unrelatedness. We propose to exploit an integer linear programming optimisation approach to pedigree learning, which is adapted to find valid pedigrees by imposing appropriate constraints. Our method is not restricted to small pedigrees and is guaranteed to return a maximum likelihood pedigree. With additional constraints, we can also search for multiple high-probability pedigrees and thus account for the inherent uncertainty in any particular pedigree reconstruction. The true pedigree is found very quickly by comparison with other methods when all individuals are observed. Extensions to more complex problems seem feasible. © 2012 Wiley Periodicals, Inc.

Robust automated mass spectra interpretation and chemical formula calculation using mixed integer linear programming.

PubMed

Baran, Richard; Northen, Trent R

2013-10-15

Untargeted metabolite profiling using liquid chromatography and mass spectrometry coupled via electrospray ionization is a powerful tool for the discovery of novel natural products, metabolic capabilities, and biomarkers. However, the elucidation of the identities of uncharacterized metabolites from spectral features remains challenging. A critical step in the metabolite identification workflow is the assignment of redundant spectral features (adducts, fragments, multimers) and calculation of the underlying chemical formula. Inspection of the data by experts using computational tools solving partial problems (e.g., chemical formula calculation for individual ions) can be performed to disambiguate alternative solutions and provide reliable results. However, manual curation is tedious and not readily scalable or standardized. Here we describe an automated procedure for the robust automated mass spectra interpretation and chemical formula calculation using mixed integer linear programming optimization (RAMSI). Chemical rules among related ions are expressed as linear constraints and both the spectra interpretation and chemical formula calculation are performed in a single optimization step. This approach is unbiased in that it does not require predefined sets of neutral losses and positive and negative polarity spectra can be combined in a single optimization. The procedure was evaluated with 30 experimental mass spectra and was found to effectively identify the protonated or deprotonated molecule ([M + H](+) or [M - H](-)) while being robust to the presence of background ions. RAMSI provides a much-needed standardized tool for interpreting ions for subsequent identification in untargeted metabolomics workflows.

A mixed-integer linear programming approach to the reduction of genome-scale metabolic networks.

PubMed

Röhl, Annika; Bockmayr, Alexander

2017-01-03

Constraint-based analysis has become a widely used method to study metabolic networks. While some of the associated algorithms can be applied to genome-scale network reconstructions with several thousands of reactions, others are limited to small or medium-sized models. In 2015, Erdrich et al. introduced a method called NetworkReducer, which reduces large metabolic networks to smaller subnetworks, while preserving a set of biological requirements that can be specified by the user. Already in 2001, Burgard et al. developed a mixed-integer linear programming (MILP) approach for computing minimal reaction sets under a given growth requirement. Here we present an MILP approach for computing minimum subnetworks with the given properties. The minimality (with respect to the number of active reactions) is not guaranteed by NetworkReducer, while the method by Burgard et al. does not allow specifying the different biological requirements. Our procedure is about 5-10 times faster than NetworkReducer and can enumerate all minimum subnetworks in case there exist several ones. This allows identifying common reactions that are present in all subnetworks, and reactions appearing in alternative pathways. Applying complex analysis methods to genome-scale metabolic networks is often not possible in practice. Thus it may become necessary to reduce the size of the network while keeping important functionalities. We propose a MILP solution to this problem. Compared to previous work, our approach is more efficient and allows computing not only one, but even all minimum subnetworks satisfying the required properties.

How to Differentiate an Integer Modulo n

ERIC Educational Resources Information Center

Emmons, Caleb; Krebs, Mike; Shaheen, Anthony

2009-01-01

A number derivative is a numerical mapping that satisfies the product rule. In this paper, we determine all number derivatives on the set of integers modulo n. We also give a list of undergraduate research projects to pursue using these maps as a starting point.

Transition metal carbides, nitrides and borides, and their oxygen containing analogs useful as water gas shift catalysts

DOEpatents

Thompson, Levi T.; Patt, Jeremy; Moon, Dong Ju; Phillips, Cory

2003-09-23

Mono- and bimetallic transition metal carbides, nitrides and borides, and their oxygen containing analogs (e.g. oxycarbides) for use as water gas shift catalysts are described. In a preferred embodiment, the catalysts have the general formula of M1.sub.A M2.sub.B Z.sub.C O.sub.D, wherein M1 is selected from the group consisting of Mo, W, and combinations thereof; M2 is selected from the group consisting of Fe, Ni, Cu, Co, and combinations thereof; Z is selected from the group consisting of carbon, nitrogen, boron, and combinations thereof; A is an integer; B is 0 or an integer greater than 0; C is an integer; O is oxygen; and D is 0 or an integer greater than 0. The catalysts exhibit good reactivity, stability, and sulfur tolerance, as compared to conventional water shift gas catalysts. These catalysts hold promise for use in conjunction with proton exchange membrane fuel cell powered systems.

A new fractional nonlocal model and its application in free vibration of Timoshenko and Euler-Bernoulli beams

NASA Astrophysics Data System (ADS)

Rahimi, Zaher; Sumelka, Wojciech; Yang, Xiao-Jun

2017-11-01

The application of fractional calculus in fractional models (FMs) makes them more flexible than integer models inasmuch they can conclude all of integer and non-integer operators. In other words FMs let us use more potential of mathematics to modeling physical phenomena due to the use of both integer and fractional operators to present a better modeling of problems, which makes them more flexible and powerful. In the present work, a new fractional nonlocal model has been proposed, which has a simple form and can be used in different problems due to the simple form of numerical solutions. Then the model has been used to govern equations of the motion of the Timoshenko beam theory (TBT) and Euler-Bernoulli beam theory (EBT). Next, free vibration of the Timoshenko and Euler-Bernoulli simply-supported (S-S) beam has been investigated. The Galerkin weighted residual method has been used to solve the non-linear governing equations.

A tale of two fractals: The Hofstadter butterfly and the integral Apollonian gaskets

NASA Astrophysics Data System (ADS)

Satija, Indubala I.

2016-11-01

This paper unveils a mapping between a quantum fractal that describes a physical phenomena, and an abstract geometrical fractal. The quantum fractal is the Hofstadter butterfly discovered in 1976 in an iconic condensed matter problem of electrons moving in a two-dimensional lattice in a transverse magnetic field. The geometric fractal is the integer Apollonian gasket characterized in terms of a 300 BC problem of mutually tangent circles. Both of these fractals are made up of integers. In the Hofstadter butterfly, these integers encode the topological quantum numbers of quantum Hall conductivity. In the Apollonian gaskets an infinite number of mutually tangent circles are nested inside each other, where each circle has integer curvature. The mapping between these two fractals reveals a hidden D3 symmetry embedded in the kaleidoscopic images that describe the asymptotic scaling properties of the butterfly. This paper also serves as a mini review of these fractals, emphasizing their hierarchical aspects in terms of Farey fractions.

Optimization by nonhierarchical asynchronous decomposition

NASA Technical Reports Server (NTRS)

Shankar, Jayashree; Ribbens, Calvin J.; Haftka, Raphael T.; Watson, Layne T.

1992-01-01

Large scale optimization problems are tractable only if they are somehow decomposed. Hierarchical decompositions are inappropriate for some types of problems and do not parallelize well. Sobieszczanski-Sobieski has proposed a nonhierarchical decomposition strategy for nonlinear constrained optimization that is naturally parallel. Despite some successes on engineering problems, the algorithm as originally proposed fails on simple two dimensional quadratic programs. The algorithm is carefully analyzed for quadratic programs, and a number of modifications are suggested to improve its robustness.

Variations on a theme of Heisenberg, Pauli and Weyl

NASA Astrophysics Data System (ADS)

Kibler, Maurice R.

2008-09-01

The parentage between Weyl pairs, the generalized Pauli group and the unitary group is investigated in detail. We start from an abstract definition of the Heisenberg-Weyl group on the field {\\bb R} and then switch to the discrete Heisenberg-Weyl group or generalized Pauli group on a finite ring {\\bb Z}_d . The main characteristics of the latter group, an abstract group of order d3 noted Pd, are given (conjugacy classes and irreducible representation classes or equivalently Lie algebra of dimension d3 associated with Pd). Leaving the abstract sector, a set of Weyl pairs in dimension d is derived from a polar decomposition of SU(2) closely connected to angular momentum theory. Then, a realization of the generalized Pauli group Pd and the construction of generalized Pauli matrices in dimension d are revisited in terms of Weyl pairs. Finally, the Lie algebra of the unitary group U(d) is obtained as a subalgebra of the Lie algebra associated with Pd. This leads to a development of the Lie algebra of U(d) in a basis consisting of d2 generalized Pauli matrices. In the case where d is a power of a prime integer, the Lie algebra of SU(d) can be decomposed into d - 1 Cartan subalgebras. Dedicated to the memory of my teacher and friend Moshé Flato on the occasion of the tenth anniversary of his death.

New optimal asymmetric quantum codes constructed from constacyclic codes

NASA Astrophysics Data System (ADS)

Xu, Gen; Li, Ruihu; Guo, Luobin; Lü, Liangdong

2017-02-01

In this paper, we propose the construction of asymmetric quantum codes from two families of constacyclic codes over finite field 𝔽q2 of code length n, where for the first family, q is an odd prime power with the form 4t + 1 (t ≥ 1 is integer) or 4t - 1 (t ≥ 2 is integer) and n1 = q2+1 2; for the second family, q is an odd prime power with the form 10t + 3 or 10t + 7 (t ≥ 0 is integer) and n2 = q2+1 5. As a result, families of new asymmetric quantum codes [[n,k,dz/dx

Integer sequence discovery from small graphs

PubMed Central

Hoppe, Travis; Petrone, Anna

2015-01-01

We have exhaustively enumerated all simple, connected graphs of a finite order and have computed a selection of invariants over this set. Integer sequences were constructed from these invariants and checked against the Online Encyclopedia of Integer Sequences (OEIS). 141 new sequences were added and six sequences were extended. From the graph database, we were able to programmatically suggest relationships among the invariants. It will be shown that we can readily visualize any sequence of graphs with a given criteria. The code has been released as an open-source framework for further analysis and the database was constructed to be extensible to invariants not considered in this work. PMID:27034526

Selecting Tools to Model Integer and Binomial Multiplication

ERIC Educational Resources Information Center

Pratt, Sarah Smitherman; Eddy, Colleen M.

2017-01-01

Mathematics teachers frequently provide concrete manipulatives to students during instruction; however, the rationale for using certain manipulatives in conjunction with concepts may not be explored. This article focuses on area models that are currently used in classrooms to provide concrete examples of integer and binomial multiplication. The…

Integer Operations Using a Whiteboard

ERIC Educational Resources Information Center

Andrews, Delise R.

2011-01-01

Interactive whiteboards are somewhat unimpressive at first and look like the whiteboards that already hang on the walls of many classrooms. However, integrating interactive whiteboard technology in a unit on adding and subtracting integers enhances student engagement and understanding. In this article, the author describes how she used an…

Extending ALE3D, an Arbitrarily Connected hexahedral 3D Code, to Very Large Problem Size (U)

DOE Office of Scientific and Technical Information (OSTI.GOV)

Nichols, A L

2010-12-15

As the number of compute units increases on the ASC computers, the prospect of running previously unimaginably large problems is becoming a reality. In an arbitrarily connected 3D finite element code, like ALE3D, one must provide a unique identification number for every node, element, face, and edge. This is required for a number of reasons, including defining the global connectivity array required for domain decomposition, identifying appropriate communication patterns after domain decomposition, and determining the appropriate load locations for implicit solvers, for example. In most codes, the unique identification number is defined as a 32-bit integer. Thus the maximum valuemore » available is 231, or roughly 2.1 billion. For a 3D geometry consisting of arbitrarily connected hexahedral elements, there are approximately 3 faces for every element, and 3 edges for every node. Since the nodes and faces need id numbers, using 32-bit integers puts a hard limit on the number of elements in a problem at roughly 700 million. The first solution to this problem would be to replace 32-bit signed integers with 32-bit unsigned integers. This would increase the maximum size of a problem by a factor of 2. This provides some head room, but almost certainly not one that will last long. Another solution would be to replace all 32-bit int declarations with 64-bit long long declarations. (long is either a 32-bit or a 64-bit integer, depending on the OS). The problem with this approach is that there are only a few arrays that actually need to extended size, and thus this would increase the size of the problem unnecessarily. In a future computing environment where CPUs are abundant but memory relatively scarce, this is probably the wrong approach. Based on these considerations, we have chosen to replace only the global identifiers with the appropriate 64-bit integer. The problem with this approach is finding all the places where data that is specified as a 32-bit integer needs to be replaced with the 64-bit integer. that need to be replaced. In the rest of this paper we describe the techniques used to facilitate this transformation, issues raised, and issues still to be addressed. This poster will describe the reasons, methods, issues associated with extending the ALE3D code to run problems larger than 700 million elements.« less

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ohkubo, Makio

2009-08-15

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 asmore » 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.« less

50 CFR 260.103 - Operations and operating procedures shall be in accordance with an effective sanitation program.

Code of Federal Regulations, 2010 CFR

2010-10-01

... cause contamination of foods by oil, dust, paint, scale, fumes, grinding materials, decomposed food... partially processed food ingredients shall not be stacked in such manner as to permit contamination of the... PROCESSED FISHERY PRODUCTS, PROCESSED PRODUCTS THEREOF, AND CERTAIN OTHER PROCESSED FOOD PRODUCTS INSPECTION...

Project SQUID. A Program of Fundamental Research on Liquid Rocket and Pulse Jet Propulsion

DTIC Science & Technology

1947-01-01

However, while the acoustical case can very well be represented by a correspond- ing linear electrical system, no way lias been found to represent...a carbon tube containing the gas to be decomposed thermally will be heated and its tem- perature determined by an optical pyrometer ; by the ojier

Scheduling double round-robin tournaments with divisional play using constraint programming

DOE Office of Scientific and Technical Information (OSTI.GOV)

Carlsson, Mats; Johansson, Mikael; Larson, Jeffrey

We study a tournament format that extends a traditional double round-robin format with divisional single round-robin tournaments. Elitserien, the top Swedish handball league, uses such a format for its league schedule. We present a constraint programming model that characterizes the general double round-robin plus divisional single round-robin format. This integrated model allows scheduling to be performed in a single step, as opposed to common multistep approaches that decompose scheduling into smaller problems and possibly miss optimal solutions. In addition to general constraints, we introduce Elitserien-specific requirements for its tournament. These general and league-specific constraints allow us to identify implicit andmore » symmetry-breaking properties that reduce the time to solution from hours to seconds. A scalability study of the number of teams shows that our approach is reasonably fast for even larger league sizes. The experimental evaluation of the integrated approach takes considerably less computational effort to schedule Elitserien than does the previous decomposed approach. (C) 2016 Elsevier B.V. All rights reserved« less

Exploring the Sums of Powers of Consecutive q-Integers

ERIC Educational Resources Information Center

Kim, T.; Ryoo, C. S.; Jang, L. C.; Rim, S. H.

2005-01-01

The Bernoulli numbers are among the most interesting and important number sequences in mathematics. They first appeared in the posthumous work "Ars Conjectandi" (1713) by Jacob Bernoulli (1654-1705) in connection with sums of powers of consecutive integers (Bernoulli, 1713; or Smith, 1959). Bernoulli numbers are particularly important in number…

Leveraging Structure: Logical Necessity in the Context of Integer Arithmetic

ERIC Educational Resources Information Center

Bishop, Jessica Pierson; Lamb, Lisa L.; Philipp, Randolph A.; Whitacre, Ian; Schappelle, Bonnie P.

2016-01-01

Looking for, recognizing, and using underlying mathematical structure is an important aspect of mathematical reasoning. We explore the use of mathematical structure in children's integer strategies by developing and exemplifying the construct of logical necessity. Students in our study used logical necessity to approach and use numbers in a…

Generating "Random" Integers

ERIC Educational Resources Information Center

Griffiths, Martin

2011-01-01

One of the author's undergraduate students recently asked him whether it was possible to generate a random positive integer. After some thought, the author realised that there were plenty of interesting mathematical ideas inherent in her question. So much so in fact, that the author decided to organise a workshop, open both to undergraduates and…

Negative Integer Understanding: Characterizing First Graders' Mental Models

ERIC Educational Resources Information Center

Bofferding, Laura

2014-01-01

This article presents results of a research study. Sixty-one first graders' responses to interview questions about negative integer values and order and directed magnitudes were examined to characterize the students' mental models. The models reveal that initially, students overrelied on various combinations of whole-number principles as…

Automatic computation of the travelling wave solutions to nonlinear PDEs

NASA Astrophysics Data System (ADS)

Liang, Songxin; Jeffrey, David J.

2008-05-01

Various extensions of the tanh-function method and their implementations for finding explicit travelling wave solutions to nonlinear partial differential equations (PDEs) have been reported in the literature. However, some solutions are often missed by these packages. In this paper, a new algorithm and its implementation called TWS for solving single nonlinear PDEs are presented. TWS is implemented in MAPLE 10. It turns out that, for PDEs whose balancing numbers are not positive integers, TWS works much better than existing packages. Furthermore, TWS obtains more solutions than existing packages for most cases. Program summaryProgram title:TWS Catalogue identifier:AEAM_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEAM_v1_0.html Program obtainable from:CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions:Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.:1250 No. of bytes in distributed program, including test data, etc.:78 101 Distribution format:tar.gz Programming language:Maple 10 Computer:A laptop with 1.6 GHz Pentium CPU Operating system:Windows XP Professional RAM:760 Mbytes Classification:5 Nature of problem:Finding the travelling wave solutions to single nonlinear PDEs. Solution method:Based on tanh-function method. Restrictions:The current version of this package can only deal with single autonomous PDEs or ODEs, not systems of PDEs or ODEs. However, the PDEs can have any finite number of independent space variables in addition to time t. Unusual features:For PDEs whose balancing numbers are not positive integers, TWS works much better than existing packages. Furthermore, TWS obtains more solutions than existing packages for most cases. Additional comments:It is easy to use. Running time:Less than 20 seconds for most cases, between 20 to 100 seconds for some cases, over 100 seconds for few cases. References: [1] E.S. Cheb-Terrab, K. von Bulow, Comput. Phys. Comm. 90 (1995) 102. [2] S.A. Elwakil, S.K. El-Labany, M.A. Zahran, R. Sabry, Phys. Lett. A 299 (2002) 179. [3] E. Fan, Phys. Lett. 277 (2000) 212. [4] W. Malfliet, Amer. J. Phys. 60 (1992) 650. [5] W. Malfliet, W. Hereman, Phys. Scripta 54 (1996) 563. [6] E.J. Parkes, B.R. Duffy, Comput. Phys. Comm. 98 (1996) 288.

Coordinated Control Method of Voltage and Reactive Power for Active Distribution Networks Based on Soft Open Point

DOE PAGES

Li, Peng; Ji, Haoran; Wang, Chengshan; ...

2017-03-22

The increasing penetration of distributed generators (DGs) exacerbates the risk of voltage violations in active distribution networks (ADNs). The conventional voltage regulation devices limited by the physical constraints are difficult to meet the requirement of real-time voltage and VAR control (VVC) with high precision when DGs fluctuate frequently. But, soft open point (SOP), a flexible power electronic device, can be used as the continuous reactive power source to realize the fast voltage regulation. Considering the cooperation of SOP and multiple regulation devices, this paper proposes a coordinated VVC method based on SOP for ADNs. Firstly, a time-series model of coordi-natedmore » VVC is developed to minimize operation costs and eliminate voltage violations of ADNs. Then, by applying the linearization and conic relaxation, the original nonconvex mixed-integer non-linear optimization model is converted into a mixed-integer second-order cone programming (MISOCP) model which can be efficiently solved to meet the requirement of voltage regulation rapidity. Here, we carried out some case studies on the IEEE 33-node system and IEEE 123-node system to illustrate the effectiveness of the proposed method.« less

Optimising multi-product multi-chance-constraint inventory control system with stochastic period lengths and total discount under fuzzy purchasing price and holding costs

NASA Astrophysics Data System (ADS)

Allah Taleizadeh, Ata; Niaki, Seyed Taghi Akhavan; Aryanezhad, Mir-Bahador

2010-10-01

While the usual assumptions in multi-periodic inventory control problems are that the orders are placed at the beginning of each period (periodic review) or depending on the inventory level they can happen at any time (continuous review), in this article, we relax these assumptions and assume that the periods between two replenishments of the products are independent and identically distributed random variables. Furthermore, assuming that the purchasing price are triangular fuzzy variables, the quantities of the orders are of integer-type and that there are space and service level constraints, total discount are considered to purchase products and a combination of back-order and lost-sales are taken into account for the shortages. We show that the model of this problem is a fuzzy mixed-integer nonlinear programming type and in order to solve it, a hybrid meta-heuristic intelligent algorithm is proposed. At the end, a numerical example is given to demonstrate the applicability of the proposed methodology and to compare its performance with one of the existing algorithms in real world inventory control problems.

Coordinated Control Method of Voltage and Reactive Power for Active Distribution Networks Based on Soft Open Point

DOE Office of Scientific and Technical Information (OSTI.GOV)

Li, Peng; Ji, Haoran; Wang, Chengshan

The increasing penetration of distributed generators (DGs) exacerbates the risk of voltage violations in active distribution networks (ADNs). The conventional voltage regulation devices limited by the physical constraints are difficult to meet the requirement of real-time voltage and VAR control (VVC) with high precision when DGs fluctuate frequently. But, soft open point (SOP), a flexible power electronic device, can be used as the continuous reactive power source to realize the fast voltage regulation. Considering the cooperation of SOP and multiple regulation devices, this paper proposes a coordinated VVC method based on SOP for ADNs. Firstly, a time-series model of coordi-natedmore » VVC is developed to minimize operation costs and eliminate voltage violations of ADNs. Then, by applying the linearization and conic relaxation, the original nonconvex mixed-integer non-linear optimization model is converted into a mixed-integer second-order cone programming (MISOCP) model which can be efficiently solved to meet the requirement of voltage regulation rapidity. Here, we carried out some case studies on the IEEE 33-node system and IEEE 123-node system to illustrate the effectiveness of the proposed method.« less

Optimal Compression of Floating-Point Astronomical Images Without Significant Loss of Information

NASA Technical Reports Server (NTRS)

Pence, William D.; White, R. L.; Seaman, R.

2010-01-01

We describe a compression method for floating-point astronomical images that gives compression ratios of 6 - 10 while still preserving the scientifically important information in the image. The pixel values are first preprocessed by quantizing them into scaled integer intensity levels, which removes some of the uncompressible noise in the image. The integers are then losslessly compressed using the fast and efficient Rice algorithm and stored in a portable FITS format file. Quantizing an image more coarsely gives greater image compression, but it also increases the noise and degrades the precision of the photometric and astrometric measurements in the quantized image. Dithering the pixel values during the quantization process greatly improves the precision of measurements in the more coarsely quantized images. We perform a series of experiments on both synthetic and real astronomical CCD images to quantitatively demonstrate that the magnitudes and positions of stars in the quantized images can be measured with the predicted amount of precision. In order to encourage wider use of these image compression methods, we have made available a pair of general-purpose image compression programs, called fpack and funpack, which can be used to compress any FITS format image.

Profiler - A Fast and Versatile New Program for Decomposing Galaxy Light Profiles

NASA Astrophysics Data System (ADS)

Ciambur, Bogdan C.

2016-12-01

I introduce Profiler, a user-friendly program designed to analyse the radial surface brightness profiles of galaxies. With an intuitive graphical user interface, Profiler can accurately model galaxies of a broad range of morphological types, with various parametric functions routinely employed in the field (Sérsic, core-Sérsic, exponential, Gaussian, Moffat, and Ferrers). In addition to these, Profiler can employ the broken exponential model for disc truncations or anti-truncations, and two special cases of the edge-on disc model: along the disc's major or minor axis. The convolution of (circular or elliptical) models with the point spread function is performed in 2D, and offers a choice between Gaussian, Moffat or a user-provided profile for the point spread function. Profiler is optimised to work with galaxy light profiles obtained from isophotal measurements, which allow for radial gradients in the geometric parameters of the isophotes, and are thus often better at capturing the total light than 2D image-fitting programs. Additionally, the 1D approach is generally less computationally expensive and more stable. I demonstrate Profiler's features by decomposing three case-study galaxies: the cored elliptical galaxy NGC 3348, the nucleated dwarf Seyfert I galaxy Pox 52, and NGC 2549, a double-barred galaxy with an edge-on, truncated disc.

Operations-Focused Optimized Theater Weather Sensing Strategies Using Preemptive Binary Integer Programming

DTIC Science & Technology

2009-03-01

8217 Clear old problem data Do While Trim(Sheets("Campaign").Range("AF" & CStr (LOOP_COUNTER))) <> "" LOOP_COUNTER = LOOP_COUNTER + 1 Loop Do While...Trim(Sheets("Campaign").Range("A" & CStr (LOOP_COUNTER))) <> "" ’ Loop through all problem instances Sheets("Campaign").Range("R1:AF1").Rows...total number of locations M = Sheets("Campaign").Range("F" & CStr (LOOP_COUNTER)) ’ Record total number of sensor types N

Finding fixed satellite service orbital allotments with a k-permutation algorithm

NASA Technical Reports Server (NTRS)

Reilly, Charles H.; Mount-Campbell, Clark A.; Gonsalvez, David J. A.

1990-01-01

A satellite system synthesis problem, the satellite location problem (SLP), is addressed. In SLP, orbital locations (longitudes) are allotted to geostationary satellites in the fixed satellite service. A linear mixed-integer programming model is presented that views SLP as a combination of two problems: the problem of ordering the satellites and the problem of locating the satellites given some ordering. A special-purpose heuristic procedure, a k-permutation algorithm, has been developed to find solutions to SLPs. Solutions to small sample problems are presented and analyzed on the basis of calculated interferences.

A Computer Model for the Transmission Characteristics of Dielectric Radomes

DTIC Science & Technology

1992-03-01

GAUS.F....... 104 APPENDIX D........................105 A. ARGUMENTS: CIRCTHETA. CIRCRHO AND CIRCPHI . . . 105 B. TEST PROGRAM: CIRCSUB.F...ETSCAT(500),EPSCAT(500),ETHF(500),EPHF(500) INTEGER NT,NPHI,CNRHO,CNPHI,NP,SELECTION REAL MODE,BASE,RS,ZP, RHB ,ZHB DATA PI,START,STOP/3.1415926,0.,90...ZH(I)).LT..OO1) ZH(I)=O. IF(ABS(RH(I)).LT..O01) RH(I)=O. ZHB=ZH (I) /BK RHB =RH (I) /BK ZiG (i)=IMP C C ASSIGN SURFACE IMPEDANCE AT THIS POINT. THE

An optimization model for metabolic pathways.

PubMed

Planes, F J; Beasley, J E

2009-10-15

Different mathematical methods have emerged in the post-genomic era to determine metabolic pathways. These methods can be divided into stoichiometric methods and path finding methods. In this paper we detail a novel optimization model, based upon integer linear programming, to determine metabolic pathways. Our model links reaction stoichiometry with path finding in a single approach. We test the ability of our model to determine 40 annotated Escherichia coli metabolic pathways. We show that our model is able to determine 36 of these 40 pathways in a computationally effective manner.

Simulation and Mixed Integer Linear Programming Models for Analysis of Semi-Automated Mail Processing

DTIC Science & Technology

1989-12-01

Sincere appreciation is deserved by Geraldo Veiga , Department of Industrial Engineering and Operations Research, at the University of California, Berkeley...Convergence 124 Veiga , University of California, Berkeley, must be credited with applying the MINOS code to our GMF-A problems). MINOS is a FORTRAN...placed in cart ACT,O,,TS23; and if the cart is full, an ACT,O,LSN8l3CARr.GE.LSMBl3FULL,TS24; entity is sent to TS24 to ACr,O,,TT fl ; empty the cart

Analysis, Evaluation and Improvement of Sequential Single-Item Auctions for the Cooperative Real-Time Allocation of Tasks

DTIC Science & Technology

2013-03-30

Abstract: We study multi-robot routing problems (MR- LDR ) where a team of robots has to visit a set of given targets with linear decreasing rewards over...time, such as required for the delivery of goods to rescue sites after disasters. The objective of MR- LDR is to find an assignment of targets to...We develop a mixed integer program that solves MR- LDR optimally with a flow-type formulation and can be solved faster than the standard TSP-type

Optimal rail container shipment planning problem in multimodal transportation

NASA Astrophysics Data System (ADS)

Cao, Chengxuan; Gao, Ziyou; Li, Keping

2012-09-01

The optimal rail container shipment planning problem in multimodal transportation is studied in this article. The characteristics of the multi-period planning problem is presented and the problem is formulated as a large-scale 0-1 integer programming model, which maximizes the total profit generated by all freight bookings accepted in a multi-period planning horizon subject to the limited capacities. Two heuristic algorithms are proposed to obtain an approximate optimal solution of the problem. Finally, numerical experiments are conducted to demonstrate the proposed formulation and heuristic algorithms.

Optimal reconfiguration strategy for a degradable multimodule computing system

NASA Technical Reports Server (NTRS)

Lee, Yann-Hang; Shin, Kang G.

1987-01-01

The present quantitative approach to the problem of reconfiguring a degradable multimode system assigns some modules to computation and arranges others for reliability. By using expected total reward as the optimal criterion, there emerges an active reconfiguration strategy based not only on the occurrence of failure but the progression of the given mission. This reconfiguration strategy requires specification of the times at which the system should undergo reconfiguration, and the configurations to which the system should change. The optimal reconfiguration problem is converted to integer nonlinear knapsack and fractional programming problems.

Supporting shared data structures on distributed memory architectures

NASA Technical Reports Server (NTRS)

Koelbel, Charles; Mehrotra, Piyush; Vanrosendale, John

1990-01-01

Programming nonshared memory systems is more difficult than programming shared memory systems, since there is no support for shared data structures. Current programming languages for distributed memory architectures force the user to decompose all data structures into separate pieces, with each piece owned by one of the processors in the machine, and with all communication explicitly specified by low-level message-passing primitives. A new programming environment is presented for distributed memory architectures, providing a global name space and allowing direct access to remote parts of data values. The analysis and program transformations required to implement this environment are described, and the efficiency of the resulting code on the NCUBE/7 and IPSC/2 hypercubes are described.

Program Helps Decompose Complicated Design Problems

NASA Technical Reports Server (NTRS)

Rogers, James L., Jr.

1993-01-01

Time saved by intelligent decomposition into smaller, interrelated problems. DeMAID is knowledge-based software system for ordering sequence of modules and identifying possible multilevel structure for design problem. Displays modules in N x N matrix format. Requires investment of time to generate and refine list of modules for input, it saves considerable amount of money and time in total design process, particularly new design problems in which ordering of modules has not been defined. Program also implemented to examine assembly-line process or ordering of tasks and milestones.

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

DOEpatents

Chen, Dong; Eisley, Noel A.; Heidelberger, Philip; Steinmacher-Burow, Burkhard

2016-11-15

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.

Generalized Symbolic Execution for Model Checking and Testing

NASA Technical Reports Server (NTRS)

Khurshid, Sarfraz; Pasareanu, Corina; Visser, Willem; Kofmeyer, David (Technical Monitor)

2003-01-01

Modern software systems, which often are concurrent and manipulate complex data structures must be extremely reliable. We present a novel framework based on symbolic execution, for automated checking of such systems. We provide a two-fold generalization of traditional symbolic execution based approaches: one, we define a program instrumentation, which enables standard model checkers to perform symbolic execution; two, we give a novel symbolic execution algorithm that handles dynamically allocated structures (e.g., lists and trees), method preconditions (e.g., acyclicity of lists), data (e.g., integers and strings) and concurrency. The program instrumentation enables a model checker to automatically explore program heap configurations (using a systematic treatment of aliasing) and manipulate logical formulae on program data values (using a decision procedure). We illustrate two applications of our framework: checking correctness of multi-threaded programs that take inputs from unbounded domains with complex structure and generation of non-isomorphic test inputs that satisfy a testing criterion. Our implementation for Java uses the Java PathFinder model checker.

ProMC: Input-output data format for HEP applications using varint encoding

NASA Astrophysics Data System (ADS)

Chekanov, S. V.; May, E.; Strand, K.; Van Gemmeren, P.

2014-10-01

A new data format for Monte Carlo (MC) events, or any structural data, including experimental data, is discussed. The format is designed to store data in a compact binary form using variable-size integer encoding as implemented in the Google's Protocol Buffers package. This approach is implemented in the PROMC library which produces smaller file sizes for MC records compared to the existing input-output libraries used in high-energy physics (HEP). Other important features of the proposed format are a separation of abstract data layouts from concrete programming implementations, self-description and random access. Data stored in PROMC files can be written, read and manipulated in a number of programming languages, such C++, JAVA, FORTRAN and PYTHON.

Fuzzy Energy and Reserve Co-optimization With High Penetration of Renewable Energy

DOE Office of Scientific and Technical Information (OSTI.GOV)

Liu, Cong; Botterud, Audun; Zhou, Zhi

In this study, we propose a fuzzy-based energy and reserve co-optimization model with consideration of high penetration of renewable energy. Under the assumption of a fixed uncertainty set of renewables, a two-stage robust model is proposed for clearing energy and reserves in the first stage and checking the feasibility and robustness of re-dispatches in the second stage. Fuzzy sets and their membership functions are introduced into the optimization model to represent the satisfaction degree of the variable uncertainty sets. The lower bound of the uncertainty set is expressed as fuzzy membership functions. The solutions are obtained by transforming the fuzzymore » mathematical programming formulation into traditional mixed integer linear programming problems.« less

Fuzzy Energy and Reserve Co-optimization With High Penetration of Renewable Energy

DOE PAGES

Liu, Cong; Botterud, Audun; Zhou, Zhi; ...

2016-10-21

In this study, we propose a fuzzy-based energy and reserve co-optimization model with consideration of high penetration of renewable energy. Under the assumption of a fixed uncertainty set of renewables, a two-stage robust model is proposed for clearing energy and reserves in the first stage and checking the feasibility and robustness of re-dispatches in the second stage. Fuzzy sets and their membership functions are introduced into the optimization model to represent the satisfaction degree of the variable uncertainty sets. The lower bound of the uncertainty set is expressed as fuzzy membership functions. The solutions are obtained by transforming the fuzzymore » mathematical programming formulation into traditional mixed integer linear programming problems.« less

Strategic planning for disaster recovery with stochastic last mile distribution

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bent, Russell Whitford; Van Hentenryck, Pascal; Coffrin, Carleton

2010-01-01

This paper considers the single commodity allocation problem (SCAP) for disaster recovery, a fundamental problem faced by all populated areas. SCAPs are complex stochastic optimization problems that combine resource allocation, warehouse routing, and parallel fleet routing. Moreover, these problems must be solved under tight runtime constraints to be practical in real-world disaster situations. This paper formalizes the specification of SCAPs and introduces a novel multi-stage hybrid-optimization algorithm that utilizes the strengths of mixed integer programming, constraint programming, and large neighborhood search. The algorithm was validated on hurricane disaster scenarios generated by Los Alamos National Laboratory using state-of-the-art disaster simulation toolsmore » and is deployed to aid federal organizations in the US.« less

On the Goldbach Conjecture

DOE Office of Scientific and Technical Information (OSTI.GOV)

Friedland, G.

2018-01-08

This note confirms Goldbach’s Conjecture from 1742. This is, every even integer greater than two is the sum of two prime numbers. An analysis of the nature of multiplication as description length reduction for addition precedes a contraposition that it is impossible to subtract any prime from a given even integer without the result ever being prime.

A Description of a Family of Heron Quadrilaterals

ERIC Educational Resources Information Center

Sastry, K. R. S.

2005-01-01

Mathematical historians place Heron in the first century. Right-angled triangles with integer sides and area had been determined before Heron, but he discovered such a "non" right-angled triangle, viz 13, 14, 15; 84. In view of this, triangles with integer sides and area are named "Heron triangles." The Indian mathematician Brahmagupta, born in…

Design Study: Integer Subtraction Operation Teaching Learning Using Multimedia in Primary School

ERIC Educational Resources Information Center

Aris, Rendi Muhammad; Putri, Ratu Ilma Indra

2017-01-01

This study aims to develop a learning trajectory to help students understand concept of subtraction of integers using multimedia in the fourth grade. This study is thematic integrative learning in Curriculum 2013 PMRI based. The method used is design research consists of three stages; preparing for the experiment, design experiment, retrospective…

Problems with Primes

ERIC Educational Resources Information Center

Melrose, Tim; Scott, Paul

2005-01-01

This article discusses prime numbers, defined as integers greater than 1 that are divisible only by only themselves and the number 1. A positive integer greater than 1 that is not a prime is called composite. The number 1 itself is considered neither prime nor composite. As the name suggests, prime numbers are one of the most basic but important…

Why the Faulhaber Polynomials Are Sums of Even or Odd Powers of (n + 1/2)

ERIC Educational Resources Information Center

Hersh, Reuben

2012-01-01

By extending Faulhaber's polynomial to negative values of n, the sum of the p'th powers of the first n integers is seen to be an even or odd polynomial in (n + 1/2) and therefore expressible in terms of the sum of the first n integers.

Dollars & Sense: Students' Integer Perspectives

ERIC Educational Resources Information Center

Whitacre, Ian; Bishop, Jessica Pierson; Philipp, Randolph A.; Lamb, Lisa L.; Schappelle, Bonnie P.

2014-01-01

A story problem about borrowing money, presented in this article, may be represented with positive or negative numbers and thought about in different ways. The authors describe ideas related to integers (both positive and negative) and how students used them in relation to a story problem, and how they related these ideas to equations.

Learning to "See" Less than Nothing: Putting Perceptual Skills to Work for Learning Numerical Structure

ERIC Educational Resources Information Center

Tsang, Jessica M.; Blair, Kristen P.; Bofferding, Laura; Schwartz, Daniel L.

2015-01-01

How can children's natural perceptuo-motor skills be harnessed for teaching and learning mathematical structure? We address this question in the case of the integers. Existing research suggests that adult mental representations of integers recruit perceptuo-motor functionalities involving symmetry. Building on these findings, we designed a…

Informing Practice: Making Sense of Integers through Storytelling

ERIC Educational Resources Information Center

Wessman-Enzinger, Nicole M.; Mooney, Edward S.

2014-01-01

The authors asked fifth-grade and eighth-grade students to pose stories for number sentences involving the addition and subtraction of integers. In this article, the authors look at eight stories from students. Which of these stories works for the given number sentence? What do they reveal about student thinking? When the authors examined these…

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.

PubMed

Morrison, Robert C

2015-01-07

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, Vxc(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 Vxc(r) varies continuously as an integer boundary is crossed. The discontinuity of the Vxc(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.

Exponent and scrambling index of double alternate circular snake graphs

NASA Astrophysics Data System (ADS)

Rahmayanti, Sri; Pasaribu, Valdo E.; Nasution, Sawaluddin; Liani Salnaz, Sishi

2018-01-01

A graph is primitive if it contains a cycle of odd length. The exponent of a primitive graph G, denoted by exp(G), is the smallest positive integer k such that for each pair of vertices u and v in G there is a uv-walk length k. The scrambling index of a primitive graph G, denoted by k(G), is the smallest positive integer k such that for each pair of vertices u and v in G there is a uv-walk of length 2k. For an even positive integer n and an odd positive integer r, a (n,r)-double alternate circular snake graph, denoted by DA(C r,n ), is a graph obtained from a path u 1 u 2 ... u n by replacing each edge of the form u 2i u 2i+1 by two different r-cycles. We study the exponent and scrambling index of DA(C r,n ) and show that exp(DA(C r,n )) = n + r - 4 and k(DA(C r,n )) = (n + r - 3)/2.

integIRTy: a method to identify genes altered in cancer by accounting for multiple mechanisms of regulation using item response theory.

PubMed

Tong, Pan; Coombes, Kevin R

2012-11-15

Identifying genes altered in cancer plays a crucial role in both understanding the mechanism of carcinogenesis and developing novel therapeutics. It is known that there are various mechanisms of regulation that can lead to gene dysfunction, including copy number change, methylation, abnormal expression, mutation and so on. Nowadays, all these types of alterations can be simultaneously interrogated by different types of assays. Although many methods have been proposed to identify altered genes from a single assay, there is no method that can deal with multiple assays accounting for different alteration types systematically. In this article, we propose a novel method, integration using item response theory (integIRTy), to identify altered genes by using item response theory that allows integrated analysis of multiple high-throughput assays. When applied to a single assay, the proposed method is more robust and reliable than conventional methods such as Student's t-test or the Wilcoxon rank-sum test. When used to integrate multiple assays, integIRTy can identify novel-altered genes that cannot be found by looking at individual assay separately. We applied integIRTy to three public cancer datasets (ovarian carcinoma, breast cancer, glioblastoma) for cross-assay type integration which all show encouraging results. The R package integIRTy is available at the web site http://bioinformatics.mdanderson.org/main/OOMPA:Overview. kcoombes@mdanderson.org. Supplementary data are available at Bioinformatics online.

Exploiting Fractional Order PID Controller Methods in Improving the Performance of Integer Order PID Controllers: A GA Based Approach

NASA Astrophysics Data System (ADS)

Mukherjee, Bijoy K.; Metia, Santanu

2009-10-01

The paper is divided into three parts. The first part gives a brief introduction to the overall paper, to fractional order PID (PIλDμ) controllers and to Genetic Algorithm (GA). In the second part, first it has been studied how the performance of an integer order PID controller deteriorates when implemented with lossy capacitors in its analog realization. Thereafter it has been shown that the lossy capacitors can be effectively modeled by fractional order terms. Then, a novel GA based method has been proposed to tune the controller parameters such that the original performance is retained even though realized with the same lossy capacitors. Simulation results have been presented to validate the usefulness of the method. Some Ziegler-Nichols type tuning rules for design of fractional order PID controllers have been proposed in the literature [11]. In the third part, a novel GA based method has been proposed which shows how equivalent integer order PID controllers can be obtained which will give performance level similar to those of the fractional order PID controllers thereby removing the complexity involved in the implementation of the latter. It has been shown with extensive simulation results that the equivalent integer order PID controllers more or less retain the robustness and iso-damping properties of the original fractional order PID controllers. Simulation results also show that the equivalent integer order PID controllers are more robust than the normal Ziegler-Nichols tuned PID controllers.

Parallel Logic Programming Architecture

DTIC Science & Technology

1990-04-01

Section 3.1. 3.1. A STATIC ALLOCATION SCHEME (SAS) Methods that have been used for decomposing distributed problems in artificial intelligence...multiple agents, knowledge organization and allocation, and cooperative parallel execution. These difficulties are common to distributed artificial ...for the following reasons. First, intellegent backtracking requires much more bookkeeping and is therefore more costly during consult-time and during

Something Old, Something New: MBA Program Evaluation Using Shift-Share Analysis and Google Trends

ERIC Educational Resources Information Center

Davis, Sarah M.; Rodriguez, A. E.

2014-01-01

Shift-share analysis is a decomposition technique that is commonly used to measure attributes of regional change. In this method, regional change is decomposed into its relevant functional and competitive parts. This paper introduces traditional shift-share method and its extensions with examples of its applicability and usefulness for program…

Land Application of Wastes: An Educational Program. Organic Matter - Module 17, Objectives, and Script.

ERIC Educational Resources Information Center

Clarkson, W. W.; And Others

This module sketches out the impact of sewage organic matter on soils. For convenience, that organic matter is separated into the readily decomposable compounds and the more resistant material (volatile suspended solids, refractory organics, and sludges). The fates of those organics are reviewed along with loading rates and recommended soil…

Impact of self-citation on the H index in the field of academic radiology.

PubMed

Rad, Arash Ehteshami; Shahgholi, Leili; Kallmes, David

2012-04-01

The Hirsch Index (H index) is widely applied as a metric of scientific productivity. The purpose of this study was to evaluate the role of self-citation on the H index in academic radiology. Through the National Resident Matching Program's Web site, one third (47/139) of radiology residency programs were selected randomly. All chairpersons and full professors were included. Using the Scopus database, we calculated the H index as well as the number of cumulative citations with and without inclusion of self-citations. We determined the proportion of academic staff in which H index increased by one, two, or greater than two integers. We also correlated the proportional increase in H index before and after inclusion of self citations with the number of publications. A total of 487 academic staff (47 chair and 440 professors) was identified. Because of self-citation, mean ± SD of the H index increased from 13.7 ± 9.9 to 14.0 ± 10.2; mean ± SD of cumulative citations increased from 1804 ± 1889 to 1870 ± 1971. H index numbers did not change in 376/487 (77%) authors as a result of self-citation. There was no correlation between number of publications and proportional change of H index. The effect of self-citation is minimal in academic radiology, as evidenced by the fact that cumulative citations increase by only 2% and the large majority of H index values do not change by even a single integer after inclusion of self-citation. Copyright © 2012 AUR. Published by Elsevier Inc. All rights reserved.

Experimental design for estimating unknown groundwater pumping using genetic algorithm and reduced order model

NASA Astrophysics Data System (ADS)

Ushijima, Timothy T.; Yeh, William W.-G.

2013-10-01

An optimal experimental design algorithm is developed to select locations for a network of observation wells that provide maximum information about unknown groundwater pumping in a confined, anisotropic aquifer. The design uses a maximal information criterion that chooses, among competing designs, the design that maximizes the sum of squared sensitivities while conforming to specified design constraints. The formulated optimization problem is non-convex and contains integer variables necessitating a combinatorial search. Given a realistic large-scale model, the size of the combinatorial search required can make the problem difficult, if not impossible, to solve using traditional mathematical programming techniques. Genetic algorithms (GAs) can be used to perform the global search; however, because a GA requires a large number of calls to a groundwater model, the formulated optimization problem still may be infeasible to solve. As a result, proper orthogonal decomposition (POD) is applied to the groundwater model to reduce its dimensionality. Then, the information matrix in the full model space can be searched without solving the full model. Results from a small-scale test case show identical optimal solutions among the GA, integer programming, and exhaustive search methods. This demonstrates the GA's ability to determine the optimal solution. In addition, the results show that a GA with POD model reduction is several orders of magnitude faster in finding the optimal solution than a GA using the full model. The proposed experimental design algorithm is applied to a realistic, two-dimensional, large-scale groundwater problem. The GA converged to a solution for this large-scale problem.

Aspect-object alignment with Integer Linear Programming in opinion mining.

PubMed

Zhao, Yanyan; Qin, Bing; Liu, Ting; Yang, Wei

2015-01-01

Target extraction is an important task in opinion mining. In this task, a complete target consists of an aspect and its corresponding object. However, previous work has always simply regarded the aspect as the target itself and has ignored the important "object" element. Thus, these studies have addressed incomplete targets, which are of limited use for practical applications. This paper proposes a novel and important sentiment analysis task, termed aspect-object alignment, to solve the "object neglect" problem. The objective of this task is to obtain the correct corresponding object for each aspect. We design a two-step framework for this task. We first provide an aspect-object alignment classifier that incorporates three sets of features, namely, the basic, relational, and special target features. However, the objects that are assigned to aspects in a sentence often contradict each other and possess many complicated features that are difficult to incorporate into a classifier. To resolve these conflicts, we impose two types of constraints in the second step: intra-sentence constraints and inter-sentence constraints. These constraints are encoded as linear formulations, and Integer Linear Programming (ILP) is used as an inference procedure to obtain a final global decision that is consistent with the constraints. Experiments on a corpus in the camera domain demonstrate that the three feature sets used in the aspect-object alignment classifier are effective in improving its performance. Moreover, the classifier with ILP inference performs better than the classifier without it, thereby illustrating that the two types of constraints that we impose are beneficial.

Classification of drug molecules considering their IC50 values using mixed-integer linear programming based hyper-boxes method.

PubMed

Armutlu, Pelin; Ozdemir, Muhittin E; Uney-Yuksektepe, Fadime; Kavakli, I Halil; Turkay, Metin

2008-10-03

A priori analysis of the activity of drugs on the target protein by computational approaches can be useful in narrowing down drug candidates for further experimental tests. Currently, there are a large number of computational methods that predict the activity of drugs on proteins. In this study, we approach the activity prediction problem as a classification problem and, we aim to improve the classification accuracy by introducing an algorithm that combines partial least squares regression with mixed-integer programming based hyper-boxes classification method, where drug molecules are classified as low active or high active regarding their binding activity (IC50 values) on target proteins. We also aim to determine the most significant molecular descriptors for the drug molecules. We first apply our approach by analyzing the activities of widely known inhibitor datasets including Acetylcholinesterase (ACHE), Benzodiazepine Receptor (BZR), Dihydrofolate Reductase (DHFR), Cyclooxygenase-2 (COX-2) with known IC50 values. The results at this stage proved that our approach consistently gives better classification accuracies compared to 63 other reported classification methods such as SVM, Naïve Bayes, where we were able to predict the experimentally determined IC50 values with a worst case accuracy of 96%. To further test applicability of this approach we first created dataset for Cytochrome P450 C17 inhibitors and then predicted their activities with 100% accuracy. Our results indicate that this approach can be utilized to predict the inhibitory effects of inhibitors based on their molecular descriptors. This approach will not only enhance drug discovery process, but also save time and resources committed.

Unique Factorization in Cyclotomic Integers of Degree Seven

ERIC Educational Resources Information Center

Duckworth, W. Ethan

2008-01-01

This article provides a survey of some basic results in algebraic number theory and applies this material to prove that the cyclotomic integers generated by a seventh root of unity are a unique factorization domain. Part of the proof uses the computer algebra system Maple to find and verify factorizations. The proofs use a combination of historic…

Triangular Numbers, Gaussian Integers, and KenKen

ERIC Educational Resources Information Center

Watkins, John J.

2012-01-01

Latin squares form the basis for the recreational puzzles sudoku and KenKen. In this article we show how useful several ideas from number theory are in solving a KenKen puzzle. For example, the simple notion of triangular number is surprisingly effective. We also introduce a variation of KenKen that uses the Gaussian integers in order to…

The Mental Representation of Integers: An Abstract-to-Concrete Shift in the Understanding of Mathematical Concepts

ERIC Educational Resources Information Center

Varma, Sashank; Schwartz, Daniel L.

2011-01-01

Mathematics has a level of structure that transcends untutored intuition. What is the cognitive representation of abstract mathematical concepts that makes them meaningful? We consider this question in the context of the integers, which extend the natural numbers with zero and negative numbers. Participants made greater and lesser judgments of…

On Pell, Pell-Lucas, and balancing numbers.

PubMed

Karadeniz Gözeri, Gül

2018-01-01

In this paper, we derive some identities on Pell, Pell-Lucas, and balancing numbers and the relationships between them. We also deduce some formulas on the sums, divisibility properties, perfect squares, Pythagorean triples involving these numbers. Moreover, we obtain the set of positive integer solutions of some specific Pell equations in terms of the integer sequences mentioned in the text.

Physical Applications of a Simple Approximation of Bessel Functions of Integer Order

ERIC Educational Resources Information Center

Barsan, V.; Cojocaru, S.

2007-01-01

Applications of a simple approximation of Bessel functions of integer order, in terms of trigonometric functions, are discussed for several examples from electromagnetism and optics. The method may be applied in the intermediate regime, bridging the "small values regime" and the "asymptotic" one, and covering, in this way, an area of great…

Some Difficulties in Understanding Negative Numbers Faced by Students: A Qualitative Study Applied at Secondary Schools in Indonesia

ERIC Educational Resources Information Center

Fuadiah, Nyiayu Fahriza; Suryadi, Didi; Turmudi

2017-01-01

This study revealed how students' understanding of negative numbers and identified their difficulties related with the concept of integer and its counting operation as part of identifying epistemological obstacles about negative numbers. Even though teachers have explained counting operation procedure of integer, but there was concept…

On Vieta's Formulas and the Determination of a Set of Positive Integers by Their Sum and Product

ERIC Educational Resources Information Center

Valahas, Theodoros; Boukas, Andreas

2011-01-01

In Years 9 and 10 of secondary schooling students are typically introduced to quadratic expressions and functions and related modelling, algebra, and graphing. This includes work on the expansion and factorisation of quadratic expressions (typically with integer values of coefficients), graphing quadratic functions, finding the roots of quadratic…

The fate of a gray soliton in a quenched Bose-Einstein condensate

NASA Astrophysics Data System (ADS)

Gamayun, Oleksandr; Bezvershenko, Yulia; Cheianov, Vadim

2015-03-01

We investigate the destiny of a gray soliton in a repulsive one-dimensional Bose-Einstein condensate undergoing a sudden quench of the non-linearity parameter. The outcome of the quench is found to depend dramatically on the ratio η of the final and initial values of the speed of sound. For integer η the soliton splits into exactly 2 η - 1 solitons. For non-integer η the soliton decays into multiple solitons and Bogoliubov modes. The case of integer η is analyzed in detail. The parameters of solitons in the out-state are found explicitly. Our approach exploits the inverse scattering method and can be easily used for the similar quenches in any classical integrable system.

AdS/CFT in Fractional Dimension and Higher-Spins at One Loop

NASA Astrophysics Data System (ADS)

Skvortsov, Evgeny; Tran, Tung

2017-08-01

Large-$N$, $\\epsilon$-expansion or the conformal bootstrap allow one to make sense of some of conformal field theories in non-integer dimension, which suggests that AdS/CFT may also extend to fractional dimensions. It was shown recently that the sphere free energy and the $a$-anomaly coefficient of the free scalar field can be reproduced as a one-loop effect in the dual higher-spin theory in a number of integer dimensions. We extend this result to all integer and also to fractional dimensions. Upon changing the boundary conditions in the higher-spin theory the sphere free energy of the large-$N$ Wilson-Fisher CFT can also be reproduced from the higher-spin side.

Two-dimensional convolute integers for analytical instrumentation

NASA Technical Reports Server (NTRS)

Edwards, T. R.

1982-01-01

As new analytical instruments and techniques emerge with increased dimensionality, a corresponding need is seen for data processing logic which can appropriately address the data. Two-dimensional measurements reveal enhanced unknown mixture analysis capability as a result of the greater spectral information content over two one-dimensional methods taken separately. It is noted that two-dimensional convolute integers are merely an extension of the work by Savitzky and Golay (1964). It is shown that these low-pass, high-pass and band-pass digital filters are truly two-dimensional and that they can be applied in a manner identical with their one-dimensional counterpart, that is, a weighted nearest-neighbor, moving average with zero phase shifting, convoluted integer (universal number) weighting coefficients.

Lossless crossing of a resonance stopband during tune modulation by synchrotron oscillations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wang, G. M.; Shaftan, T.; Smaluk, V.

Modern high performance circular accelerators require sophisticated corrections of nonlinear lattices. The beam betatron tune footprint may cross many resonances, reducing dynamic aperture and causing particle loss. But, if particles cross a resonance reasonably fast, the beam deterioration may be minimized. This paper describes the experiments with the beam passing through a half-integer resonance stopband via tune modulation by exciting synchrotron oscillations. This is the first time that beam dynamics have been kept under precise control while the beam crosses a half-integer resonance. These results convincingly demonstrate that particles can cross the half-integer resonance without being lost if the passagemore » is reasonably fast and the resonance stopband is sufficiently narrow.« less

Lossless crossing of a resonance stopband during tune modulation by synchrotron oscillations

DOE PAGES

Wang, G. M.; Shaftan, T.; Smaluk, V.; ...

2017-09-14

Modern high performance circular accelerators require sophisticated corrections of nonlinear lattices. The beam betatron tune footprint may cross many resonances, reducing dynamic aperture and causing particle loss. But, if particles cross a resonance reasonably fast, the beam deterioration may be minimized. This paper describes the experiments with the beam passing through a half-integer resonance stopband via tune modulation by exciting synchrotron oscillations. This is the first time that beam dynamics have been kept under precise control while the beam crosses a half-integer resonance. These results convincingly demonstrate that particles can cross the half-integer resonance without being lost if the passagemore » is reasonably fast and the resonance stopband is sufficiently narrow.« less

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chen, Dong; Eisley, Noel A; Heidelberger, Philip

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 themore » collective logic device and receive outputs only once from the collective logic device.« less

There are many ways to spin a photon: Half-quantization of a total optical angular momentum

PubMed Central

Ballantine, Kyle E.; Donegan, John F.; Eastham, Paul R.

2016-01-01

The angular momentum of light plays an important role in many areas, from optical trapping to quantum information. In the usual three-dimensional setting, the angular momentum quantum numbers of the photon are integers, in units of the Planck constant ħ. We show that, in reduced dimensions, photons can have a half-integer total angular momentum. We identify a new form of total angular momentum, carried by beams of light, comprising an unequal mixture of spin and orbital contributions. We demonstrate the half-integer quantization of this total angular momentum using noise measurements. We conclude that for light, as is known for electrons, reduced dimensionality allows new forms of quantization. PMID:28861467

Integer-ambiguity resolution in astronomy and geodesy

NASA Astrophysics Data System (ADS)

Lannes, A.; Prieur, J.-L.

2014-02-01

Recent theoretical developments in astronomical aperture synthesis have revealed the existence of integer-ambiguity problems. Those problems, which appear in the self-calibration procedures of radio imaging, have been shown to be similar to the nearest-lattice point (NLP) problems encountered in high-precision geodetic positioning and in global navigation satellite systems. In this paper we analyse the theoretical aspects of the matter and propose new methods for solving those NLP~problems. The related optimization aspects concern both the preconditioning stage, and the discrete-search stage in which the integer ambiguities are finally fixed. Our algorithms, which are described in an explicit manner, can easily be implemented. They lead to substantial gains in the processing time of both stages. Their efficiency was shown via intensive numerical tests.

Accurate multiple sequence-structure alignment of RNA sequences using combinatorial optimization.

PubMed

Bauer, Markus; Klau, Gunnar W; Reinert, Knut

2007-07-27

The discovery of functional non-coding RNA sequences has led to an increasing interest in algorithms related to RNA analysis. Traditional sequence alignment algorithms, however, fail at computing reliable alignments of low-homology RNA sequences. The spatial conformation of RNA sequences largely determines their function, and therefore RNA alignment algorithms have to take structural information into account. We present a graph-based representation for sequence-structure alignments, which we model as an integer linear program (ILP). We sketch how we compute an optimal or near-optimal solution to the ILP using methods from combinatorial optimization, and present results on a recently published benchmark set for RNA alignments. The implementation of our algorithm yields better alignments in terms of two published scores than the other programs that we tested: This is especially the case with an increasing number of input sequences. Our program LARA is freely available for academic purposes from http://www.planet-lisa.net.

Strongdeco: Expansion of analytical, strongly correlated quantum states into a many-body basis

NASA Astrophysics Data System (ADS)

Juliá-Díaz, Bruno; Graß, Tobias

2012-03-01

We provide a Mathematica code for decomposing strongly correlated quantum states described by a first-quantized, analytical wave function into many-body Fock states. Within them, the single-particle occupations refer to the subset of Fock-Darwin functions with no nodes. Such states, commonly appearing in two-dimensional systems subjected to gauge fields, were first discussed in the context of quantum Hall physics and are nowadays very relevant in the field of ultracold quantum gases. As important examples, we explicitly apply our decomposition scheme to the prominent Laughlin and Pfaffian states. This allows for easily calculating the overlap between arbitrary states with these highly correlated test states, and thus provides a useful tool to classify correlated quantum systems. Furthermore, we can directly read off the angular momentum distribution of a state from its decomposition. Finally we make use of our code to calculate the normalization factors for Laughlin's famous quasi-particle/quasi-hole excitations, from which we gain insight into the intriguing fractional behavior of these excitations. Program summaryProgram title: Strongdeco Catalogue identifier: AELA_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AELA_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 5475 No. of bytes in distributed program, including test data, etc.: 31 071 Distribution format: tar.gz Programming language: Mathematica Computer: Any computer on which Mathematica can be installed Operating system: Linux, Windows, Mac Classification: 2.9 Nature of problem: Analysis of strongly correlated quantum states. Solution method: The program makes use of the tools developed in Mathematica to deal with multivariate polynomials to decompose analytical strongly correlated states of bosons and fermions into a standard many-body basis. Operations with polynomials, determinants and permanents are the basic tools. Running time: The distributed notebook takes a couple of minutes to run.

Linear decomposition approach for a class of nonconvex programming problems.

PubMed

Shen, Peiping; Wang, Chunfeng

2017-01-01

This paper presents a linear decomposition approach for a class of nonconvex programming problems by dividing the input space into polynomially many grids. It shows that under certain assumptions the original problem can be transformed and decomposed into a polynomial number of equivalent linear programming subproblems. Based on solving a series of liner programming subproblems corresponding to those grid points we can obtain the near-optimal solution of the original problem. Compared to existing results in the literature, the proposed algorithm does not require the assumptions of quasi-concavity and differentiability of the objective function, and it differs significantly giving an interesting approach to solving the problem with a reduced running time.

Removal of methylmercury and tributyltin (TBT) using marine microorganisms.

PubMed

Lee, Seong Eon; Chung, Jin Wook; Won, Ho Shik; Lee, Dong Sup; Lee, Yong-Woo

2012-02-01

Two marine species of bacteria were isolated that are capable of degrading organometallic contaminants: Pseudomonas balearica, which decomposes methylmercury; and Shewanella putrefaciens, which decomposes tributyltin. P. balearica decomposed 97% of methylmercury (20.0 μg/L) into inorganic mercury after 3 h, while S. putrefaciens decomposed 88% of tributyltin (55.3 μg Sn/L) in real wastewater after 36 h. These data indicate that the two bacteria efficiently decomposed the targeted substances and may be applied to real wastewater.

Reactivity of a Thick BaO Film Supported on Pt(111): Adsorption and Reaction of NO2, H2O and CO2

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mudiyanselage, Kumudu; Yi, Cheol-Woo W.; Szanyi, Janos

2009-09-15

Reactions of NO2, H2O, and CO2 with a thick (> 20 MLE) BaO film supported on Pt(111) were studied with temperature programmed desorption (TPD) and X-ray photoelectron spectroscopy (XPS). NO2 reacts with a thick BaO to form surface nitrite-nitrate ion pairs at 300 K, while only nitrates form at 600 K. In the thermal decomposition process of nitrite–nitrate ion pairs, first nitrites decompose and desorb as NO. Then nitrates decompose in two steps : at lower temperature with the release of NO2 and at higher temperature, nitrates dissociate to NO + O2. The thick BaO layer converts completely to Ba(OH)2more » following the adsorption of H2O at 300 K. Dehydration/dehydroxylation of this hydroxide layer can be fully achieved by annealing to 550 K. CO2 also reacts with BaO to form BaCO3 that completely decomposes to regenerate BaO upon annealing to 825 K. However, the thick BaO film cannot be converted completely to Ba(NOx)2 or BaCO3 under the experimental conditions employed in this study.« less

Integer Partitions and Convexity

NASA Astrophysics Data System (ADS)

Bouroubi, Sadek

2007-06-01

Let n be an integer >=1, and let p(n,k) and P(n,k) count the number of partitions of n into k parts, and the number of partitions of n into parts less than or equal to k, respectively. In this paper, we show that these functions are convex. The result includes the actual value of the constant of Bateman and Erdos.

From "Following" to "Going Beyond" the Textbook: In-Service Indian Mathematics Teachers' Professional Development for Teaching Integers

ERIC Educational Resources Information Center

Kumar, Ruchi S.; Subramaniam, Kalyansundaram

2015-01-01

In this paper we describe four Indian in-service middle school mathematics teachers' shifts in their roles with respect to the textbook. The shifts occurred through participation in collaborative investigation on the topic of integers in professional development meetings. Analysis of teachers' talk in these meetings indicated a shift in teachers'…

Development of a Run Time Math Library for the 1750A Airborne Microcomputer.

DTIC Science & Technology

1985-12-01

premiue CWUTLDK Is R: Integer :a 0; 0: Integer :ul; LNMM: UEM; -Compute the Lado (alpii) for J In 0..Ol.K-1) loop Itf 0(14 1)/ 0. 0...ORGANIZATION (If appiicable) * School of Engineering AFIT/ ENC 6c. ADDRESS (City, State and ZIP Code) 7b. ADDRESS (City. State and ZIP Code) Air Force

Fast discrete cosine transform structure suitable for implementation with integer computation

NASA Astrophysics Data System (ADS)

Jeong, Yeonsik; Lee, Imgeun

2000-10-01

The discrete cosine transform (DCT) has wide applications in speech and image coding. We propose a fast DCT scheme with the property of reduced multiplication stages and fewer additions and multiplications. The proposed algorithm is structured so that most multiplications are performed at the final stage, which reduces the propagation error that could occur in the integer computation.

A Solution to Weighted Sums of Squares as a Square

ERIC Educational Resources Information Center

Withers, Christopher S.; Nadarajah, Saralees

2012-01-01

For n = 1, 2, ... , we give a solution (x[subscript 1], ... , x[subscript n], N) to the Diophantine integer equation [image omitted]. Our solution has N of the form n!, in contrast to other solutions in the literature that are extensions of Euler's solution for N, a sum of squares. More generally, for given n and given integer weights m[subscript…

Four Proofs of the Converse of the Chinese Remainder Theorem

ERIC Educational Resources Information Center

Dobbs, D. E.

2008-01-01

Four proofs, designed for classroom use in varying levels of courses on abstract algebra, are given for the converse of the classical Chinese Remainder Theorem over the integers. In other words, it is proved that if m and n are integers greater than 1 such that the abelian groups [double-struck z][subscript m] [direct sum] [double-struck…

Using Set Model for Learning Addition of Integers

ERIC Educational Resources Information Center

Lestari, Umi Puji; Putri, Ratu Ilma Indra; Hartono, Yusuf

2015-01-01

This study aims to investigate how set model can help students' understanding of addition of integers in fourth grade. The study has been carried out to 23 students and a teacher of IVC SD Iba Palembang in January 2015. This study is a design research that also promotes PMRI as the underlying design context and activity. Results showed that the…

To the Beat of Your Own Drum: Cortical Regularization of Non-Integer Ratio Rhythms toward Metrical Patterns

ERIC Educational Resources Information Center

Motz, Benjamin A.; Erickson, Molly A.; Hetrick, William P.

2013-01-01

Humans perceive a wide range of temporal patterns, including those rhythms that occur in music, speech, and movement; however, there are constraints on the rhythmic patterns that we can represent. Past research has shown that sequences in which sounds occur regularly at non-metrical locations in a repeating beat period (non-integer ratio…

Multi-Target Tracking via Mixed Integer Optimization

DTIC Science & Technology

2016-05-13

solving these two problems separately, however few algorithms attempt to solve these simultaneously and even fewer utilize optimization. In this paper we...introduce a new mixed integer optimization (MIO) model which solves the data association and trajectory estimation problems simultaneously by minimizing...Kalman filter [5], which updates the trajectory estimates before the algorithm progresses forward to the next scan. This process repeats sequentially

Neural representations of magnitude for natural and rational numbers.

PubMed

DeWolf, Melissa; Chiang, Jeffrey N; Bassok, Miriam; Holyoak, Keith J; Monti, Martin M

2016-11-01

Humans have developed multiple symbolic representations for numbers, including natural numbers (positive integers) as well as rational numbers (both fractions and decimals). Despite a considerable body of behavioral and neuroimaging research, it is currently unknown whether different notations map onto a single, fully abstract, magnitude code, or whether separate representations exist for specific number types (e.g., natural versus rational) or number representations (e.g., base-10 versus fractions). We address this question by comparing brain metabolic response during a magnitude comparison task involving (on different trials) integers, decimals, and fractions. Univariate and multivariate analyses revealed that the strength and pattern of activation for fractions differed systematically, within the intraparietal sulcus, from that of both decimals and integers, while the latter two number representations appeared virtually indistinguishable. These results demonstrate that the two major notations formats for rational numbers, fractions and decimals, evoke distinct neural representations of magnitude, with decimals representations being more closely linked to those of integers than to those of magnitude-equivalent fractions. Our findings thus suggest that number representation (base-10 versus fractions) is an important organizational principle for the neural substrate underlying mathematical cognition. Copyright © 2016 Elsevier Inc. All rights reserved.

Geometrical meaning of winding number and its characterization of topological phases in one-dimensional chiral non-Hermitian systems

NASA Astrophysics Data System (ADS)

Yin, Chuanhao; Jiang, Hui; Li, Linhu; Lü, Rong; Chen, Shu

2018-05-01

We unveil the geometrical meaning of winding number and utilize it to characterize the topological phases in one-dimensional chiral non-Hermitian systems. While chiral symmetry ensures the winding number of Hermitian systems are integers, it can take half integers for non-Hermitian systems. We give a geometrical interpretation of the half integers by demonstrating that the winding number ν of a non-Hermitian system is equal to half of the summation of two winding numbers ν1 and ν2 associated with two exceptional points, respectively. The winding numbers ν1 and ν2 represent the times of the real part of the Hamiltonian in momentum space encircling the exceptional points and can only take integers. We further find that the difference of ν1 and ν2 is related to the second winding number or energy vorticity. By applying our scheme to a non-Hermitian Su-Schrieffer-Heeger model and an extended version of it, we show that the topologically different phases can be well characterized by winding numbers. Furthermore, we demonstrate that the existence of left and right zero-mode edge states is closely related to the winding number ν1 and ν2.

Calibration of Magnetometers with GNSS Receivers and Magnetometer-Aided GNSS Ambiguity Fixing

PubMed Central

Henkel, Patrick

2017-01-01

Magnetometers provide compass information, and are widely used for navigation, orientation and alignment of objects. As magnetometers are affected by sensor biases and eventually by systematic distortions of the Earth magnetic field, a calibration is needed. In this paper, a method for calibration of magnetometers with three Global Navigation Satellite System (GNSS) receivers is presented. We perform a least-squares estimation of the magnetic flux and sensor biases using GNSS-based attitude information. The attitude is obtained from the relative positions between the GNSS receivers in the North-East-Down coordinate frame and prior knowledge of these relative positions in the platform’s coordinate frame. The relative positions and integer ambiguities of the periodic carrier phase measurements are determined with an integer least-squares estimation using an integer decorrelation and sequential tree search. Prior knowledge on the relative positions is used to increase the success rate of ambiguity fixing. We have validated the proposed method with low-cost magnetometers and GNSS receivers on a vehicle in a test drive. The calibration enabled a consistent heading determination with an accuracy of five degrees. This precise magnetometer-based attitude information allows an instantaneous GNSS integer ambiguity fixing. PMID:28594369

Calibration of Magnetometers with GNSS Receivers and Magnetometer-Aided GNSS Ambiguity Fixing.

PubMed

Henkel, Patrick

2017-06-08

Magnetometers provide compass information, and are widely used for navigation, orientation and alignment of objects. As magnetometers are affected by sensor biases and eventually by systematic distortions of the Earth magnetic field, a calibration is needed. In this paper, a method for calibration of magnetometers with three Global Navigation Satellite System (GNSS) receivers is presented. We perform a least-squares estimation of the magnetic flux and sensor biases using GNSS-based attitude information. The attitude is obtained from the relative positions between the GNSS receivers in the North-East-Down coordinate frame and prior knowledge of these relative positions in the platform's coordinate frame. The relative positions and integer ambiguities of the periodic carrier phase measurements are determined with an integer least-squares estimation using an integer decorrelation and sequential tree search. Prior knowledge on the relative positions is used to increase the success rate of ambiguity fixing. We have validated the proposed method with low-cost magnetometers and GNSS receivers on a vehicle in a test drive. The calibration enabled a consistent heading determination with an accuracy of five degrees. This precise magnetometer-based attitude information allows an instantaneous GNSS integer ambiguity fixing.

Improving energy efficiency in handheld biometric applications

NASA Astrophysics Data System (ADS)

Hoyle, David C.; Gale, John W.; Schultz, Robert C.; Rakvic, Ryan N.; Ives, Robert W.

2012-06-01

With improved smartphone and tablet technology, it is becoming increasingly feasible to implement powerful biometric recognition algorithms on portable devices. Typical iris recognition algorithms, such as Ridge Energy Direction (RED), utilize two-dimensional convolution in their implementation. This paper explores the energy consumption implications of 12 different methods of implementing two-dimensional convolution on a portable device. Typically, convolution is implemented using floating point operations. If a given algorithm implemented integer convolution vice floating point convolution, it could drastically reduce the energy consumed by the processor. The 12 methods compared include 4 major categories: Integer C, Integer Java, Floating Point C, and Floating Point Java. Each major category is further divided into 3 implementations: variable size looped convolution, static size looped convolution, and unrolled looped convolution. All testing was performed using the HTC Thunderbolt with energy measured directly using a Tektronix TDS5104B Digital Phosphor oscilloscope. Results indicate that energy savings as high as 75% are possible by using Integer C versus Floating Point C. Considering the relative proportion of processing time that convolution is responsible for in a typical algorithm, the savings in energy would likely result in significantly greater time between battery charges.