WorldWideScience

Sample records for integer programming formulation

  1. New Integer Programming Formulations of the Generalized Travelling Salesman Problem

    Directory of Open Access Journals (Sweden)

    P. C. Pop

    2007-01-01

    Full Text Available The Generalized Travelling Salesman Problem, denoted by GTSP, is a variant of the classical travelling salesman problem (TSP, in which the nodes of an undirected graph are partitioned into node sets (clusters and the salesman has to visit exactly one node from every cluster. In this paper we described six distinct formulations of the GTSP as an integer programming. Apart from the standard formulations all the new formulations that we describe are 'compact' in the sense that the number of constraints and variables is a polynomial function of the number of nodes in the problem. In order to provide compact formulations for the GTSP we used two approaches using auxiliary flow variables beyond the natural binary edge and node variables and the second one by distinguishing between global and local variables. Comparisons of the polytopes corresponding to their linear relaxations are established.

  2. Integer programming

    CERN Document Server

    Conforti, Michele; Zambelli, Giacomo

    2014-01-01

    This book is an elegant and rigorous presentation of integer programming, exposing the subject’s mathematical depth and broad applicability. Special attention is given to the theory behind the algorithms used in state-of-the-art solvers. An abundance of concrete examples and exercises of both theoretical and real-world interest explore the wide range of applications and ramifications of the theory. Each chapter is accompanied by an expertly informed guide to the literature and special topics, rounding out the reader’s understanding and serving as a gateway to deeper study. Key topics include: formulations polyhedral theory cutting planes decomposition enumeration semidefinite relaxations Written by renowned experts in integer programming and combinatorial optimization, Integer Programming is destined to become an essential text in the field.

  3. A Mixed Integer Programming Model Formulation for Solving the Lot-Sizing Problem

    CERN Document Server

    Mohammadi, Maryam

    2012-01-01

    This paper addresses a mixed integer programming (MIP) formulation for the multi-item uncapacitated lot-sizing problem that is inspired from the trailer manufacturer. The proposed MIP model has been utilized to find out the optimum order quantity, optimum order time, and the minimum total cost of purchasing, ordering, and holding over the predefined planning horizon. This problem is known as NP-hard problem. The model was presented in an optimal software form using LINGO 13.0.

  4. An Integer Programming Formulation of the Minimum Common String Partition Problem.

    Directory of Open Access Journals (Sweden)

    S M Ferdous

    Full Text Available We consider the problem of finding a minimum common string partition (MCSP of two strings, which is an NP-hard problem. The MCSP problem is closely related to genome comparison and rearrangement, an important field in Computational Biology. In this paper, we map the MCSP problem into a graph applying a prior technique and using this graph, we develop an Integer Linear Programming (ILP formulation for the problem. We implement the ILP formulation and compare the results with the state-of-the-art algorithms from the literature. The experimental results are found to be promising.

  5. Integer programming formulation and variable neighborhood search metaheuristic for the multiproduct pipeline scheduling problem

    Energy Technology Data Exchange (ETDEWEB)

    Souza Filho, Erito M.; Bahiense, Laura; Ferreira Filho, Virgilio J.M. [Universidade Federal do Rio de Janeiro (UFRJ), RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia (COPPE); Lima, Leonardo [Centro Federal de Educacao Tecnologica Celso Sukow da Fonseca (CEFET-RJ), Rio de Janeiro, RJ (Brazil)

    2008-07-01

    Pipeline are known as the most reliable and economical mode of transportation for petroleum and its derivatives, especially when large amounts of products have to be pumped for large distances. In this work we address the short-term schedule of a pipeline system comprising the distribution of several petroleum derivatives from a single oil refinery to several depots, connected to local consumer markets, through a single multi-product pipeline. We propose an integer linear programming formulation and a variable neighborhood search meta-heuristic in order to compare the performances of the exact and heuristic approaches to the problem. Computational tests in C language and MOSEL/XPRESS-MP language are performed over a real Brazilian pipeline system. (author)

  6. Integer Programming Formulation of the Problem of Generating Milton Babbitt's All-partition Arrays

    DEFF Research Database (Denmark)

    Tanaka, Tsubasa; Bemman, Brian; Meredith, David

    2016-01-01

    integer partition of 12. Integer programming (IP) has proven to be effective for solving such combinatorial prob- lems, however, it has never before been applied to the problem addressed in this paper. We introduce a new way of viewing this problem as one in which restricted overlaps between integer......Milton Babbitt (1916–2011) was a composer of twelve-tone serial music noted for creating the all-partition array. The problem of generating an all-partition array involves finding a rectangular array of pitch-class integers that can be partitioned into regions, each of which represents a distinct...... partition regions are allowed. This permits us to describe the problem using a set of linear constraints necessary for IP. In particular, we show that this problem can be defined as a special case of the well-known problem of set-covering (SCP), modified with additional constraints. Due to the difficulty...

  7. Integer Programming Formulation of the Problem of Generating Milton Babbitt's All-partition Arrays

    DEFF Research Database (Denmark)

    Tanaka, Tsubasa; Bemman, Brian; Meredith, David

    2016-01-01

    Milton Babbitt (1916–2011) was a composer of twelve-tone serial music noted for creating the all-partition array. The problem of generating an all-partition array involves finding a rectangular array of pitch-class integers that can be partitioned into regions, each of which represents a distinct...

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

    Science.gov (United States)

    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.

  9. Integer Programming Formulations for Approximate Packing Circles in a Rectangular Container

    Directory of Open Access Journals (Sweden)

    Igor Litvinchev

    2014-01-01

    Full Text Available A problem of packing a limited number of unequal circles in a fixed size rectangular container is considered. The aim is to maximize the (weighted number of circles placed into the container or minimize the waste. This problem has numerous applications in logistics, including production and packing for the textile, apparel, naval, automobile, aerospace, and food industries. Frequently the problem is formulated as a nonconvex continuous optimization problem which is solved by heuristic techniques combined with local search procedures. New formulations are proposed for approximate solution of packing problem. The container is approximated by a regular grid and the nodes of the grid are considered as potential positions for assigning centers of the circles. The packing problem is then stated as a large scale linear 0-1 optimization problem. The binary variables represent the assignment of centers to the nodes of the grid. Nesting circles inside one another is also considered. The resulting binary problem is then solved by commercial software. Numerical results are presented to demonstrate the efficiency of the proposed approach and compared with known results.

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

    Energy Technology Data Exchange (ETDEWEB)

    Waddell, Lucas; Muldoon, Frank; Henry, Stephen Michael; Hoffman, Matthew John; Zwerneman, April Marie; Backlund, Peter; Melander, Darryl J.; Lawton, Craig R.; Rice, Roy Eugene

    2017-09-01

    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- 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.

  11. Integer programming techniques for educational timetabling

    DEFF Research Database (Denmark)

    Fonseca, George H.G.; Santos, Haroldo G.; Carrano, Eduardo G.

    2017-01-01

    in recent studies in the field. This work presents new cuts and reformulations for the existing integer programming model for XHSTT. The proposed cuts improved hugely the linear relaxation of the formulation, leading to an average gap reduction of 32%. Applied to XHSTT-2014 instance set, the alternative...

  12. Linear and integer programming made easy

    CERN Document Server

    Hu, T C

    2016-01-01

    Linear and integer programming are fundamental toolkits for data and information science and technology, particularly in the context of today’s megatrends toward statistical optimization, machine learning, and big data analytics. Drawn from over 30 years of classroom teaching and applied research experience, this textbook provides a crisp and practical introduction to the basics of linear and integer programming. The authors’ approach is accessible to students from all fields of engineering, including operations research, statistics, machine learning, control system design, scheduling, formal verification, and computer vision. Readers will learn to cast hard combinatorial problems as mathematical programming optimizations, understand how to achieve formulations where the objective and constraints are linear, choose appropriate solution methods, and interpret results appropriately. •Provides a concise introduction to linear and integer programming, appropriate for undergraduates, graduates, a short cours...

  13. Integer programming theory, applications, and computations

    CERN Document Server

    Taha, Hamdy A

    1975-01-01

    Integer Programming: Theory, Applications, and Computations provides information pertinent to the theory, applications, and computations of integer programming. This book presents the computational advantages of the various techniques of integer programming.Organized into eight chapters, this book begins with an overview of the general categorization of integer applications and explains the three fundamental techniques of integer programming. This text then explores the concept of implicit enumeration, which is general in a sense that it is applicable to any well-defined binary program. Other

  14. Applied Integer Programming Modeling and Solution

    CERN Document Server

    Chen, Der-San; Dang, Yu

    2011-01-01

    An accessible treatment of the modeling and solution of integer programming problems, featuring modern applications and software In order to fully comprehend the algorithms associated with integer programming, it is important to understand not only how algorithms work, but also why they work. Applied Integer Programming features a unique emphasis on this point, focusing on problem modeling and solution using commercial software. Taking an application-oriented approach, this book addresses the art and science of mathematical modeling related to the mixed integer programming (MIP) framework and

  15. Stochastic Programming with Simple Integer Recourse

    NARCIS (Netherlands)

    Louveaux, François V.; van der Vlerk, Maarten H.

    1993-01-01

    Stochastic integer programs are notoriously difficult. Very few properties are known and solution algorithms are very scarce. In this paper, we introduce the class of stochastic programs with simple integer recourse, a natural extension of the simple recourse case extensively studied in stochastic c

  16. Integer Programming Models for Computational Biology Problems

    Institute of Scientific and Technical Information of China (English)

    Giuseppe Lancia

    2004-01-01

    The recent years have seen an impressive increase in the use of Integer Programming models for the solution of optimization problems originating in Molecular Biology. In this survey, some of the most successful Integer Programming approaches are described, while a broad overview of application areas being is given in modern Computational Molecular Biology.

  17. Bivium as a Mixed Integer Programming Problem

    DEFF Research Database (Denmark)

    Borghoff, Julia; Knudsen, Lars Ramkilde; Stolpe, Mathias

    2009-01-01

    Trivium is a stream cipher proposed for the eSTREAM project. Raddum introduced some reduced versions of Trivium, named Bivium A and Bivium B. In this article we present a numerical attack on the Biviums. The main idea is to transform the problem of solving a sparse system of quadratic equations...... over $GF(2)$ into a combinatorial optimization problem. We convert the Boolean equation system into an equation system over $\\mathbb{R}$ and formulate the problem of finding a $0$-$1$-valued solution for the system as a mixed-integer programming problem. This enables us to make use of several...... algorithms in the field of combinatorial optimization in order to find a solution for the problem and recover the initial state of Bivium. In particular this gives us an attack on Bivium B in estimated time complexity of $2^{63.7}$ seconds. But this kind of attack is also applicable to other cryptographic...

  18. Designing fractional factorial split-plot experiments using integer programming

    DEFF Research Database (Denmark)

    Capehart, Shay R.; Keha, Ahmet; Kulahci, Murat

    2011-01-01

    factorial (FF) design, with the restricted randomisation structure to account for the whole plots and subplots. We discuss the formulation of FFSP designs using integer programming (IP) to achieve various design criteria. We specifically look at the maximum number of clear two-factor interactions...

  19. Designing fractional factorial split-plot experiments using integer programming

    DEFF Research Database (Denmark)

    Capehart, Shay R.; Keha, Ahmet; Kulahci, Murat

    2011-01-01

    factorial (FF) design, with the restricted randomisation structure to account for the whole plots and subplots. We discuss the formulation of FFSP designs using integer programming (IP) to achieve various design criteria. We specifically look at the maximum number of clear two-factor interactions...

  20. Multiparametric programming based algorithms for pure integer and mixed-integer bilevel programming problems

    KAUST Repository

    Domínguez, Luis F.

    2010-12-01

    This work introduces two algorithms for the solution of pure integer and mixed-integer bilevel programming problems by multiparametric programming techniques. The first algorithm addresses the integer case of the bilevel programming problem where integer variables of the outer optimization problem appear in linear or polynomial form in the inner problem. The algorithm employs global optimization techniques to convexify nonlinear terms generated by a reformulation linearization technique (RLT). A continuous multiparametric programming algorithm is then used to solve the reformulated convex inner problem. The second algorithm addresses the mixed-integer case of the bilevel programming problem where integer and continuous variables of the outer problem appear in linear or polynomial forms in the inner problem. The algorithm relies on the use of global multiparametric mixed-integer programming techniques at the inner optimization level. In both algorithms, the multiparametric solutions obtained are embedded in the outer problem to form a set of single-level (M)(I)(N)LP problems - which are then solved to global optimality using standard fixed-point (global) optimization methods. Numerical examples drawn from the open literature are presented to illustrate the proposed algorithms. © 2010 Elsevier Ltd.

  1. Logic integer programming models for signaling networks.

    Science.gov (United States)

    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.

  2. Optimized Waterspace Management and Scheduling Using Mixed-Integer Linear Programming

    Science.gov (United States)

    2016-01-01

    TECHNICAL REPORT NSWC PCD TR 2015-003 OPTIMIZED WATERSPACE MANAGEMENT AND SCHEDULING USING MIXED-INTEGER LINEAR PROGRAMMING...constraints required for the mathematical formulation of the MCM scheduling problem pertaining to the survey constraints and logistics management . The...Floudas, Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications, Oxford University Press, 1995. [10] M. J. Bays, A. Shende, D. J

  3. Solving Integer Programming by Evolutionary Soft Agent

    Institute of Scientific and Technical Information of China (English)

    Yin Jian

    2003-01-01

    Many practical problems in commerce and industry involve finding the best way to allocate scarce resources a mong competing activities. This paper focuses on the problem of integer programming, and describes an evolutionary soft agent model to solve it. In proposed model, agent is composed of three components: goal, environment and behavior. Experirnental shows thne model has the characters of parallel computing and goal driving.

  4. Extracting vascular networks under physiological constraints via integer programming.

    Science.gov (United States)

    Rempfler, Markus; Schneider, Matthias; Ielacqua, Giovanna D; Xiao, Xianghui; Stock, Stuart R; Klohs, Jan; Székely, Gábor; Andres, Bjoern; Menze, Bjoern H

    2014-01-01

    We introduce an integer programming-based approach to vessel network extraction that enforces global physiological constraints on the vessel structure and learn this prior from a high-resolution reference network. The method accounts for both image evidence and geometric relationships between vessels by formulating and solving an integer programming problem. Starting from an over-connected network, it is pruning vessel stumps and spurious connections by evaluating bifurcation angle and connectivity of the graph. We utilize a high-resolution micro computed tomography (μCT) dataset of a cerebrovascular corrosion cast to obtain a reference network, 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.

  5. A fuzzy mixed integer programming for marketing planning

    Directory of Open Access Journals (Sweden)

    Abolfazl Danaei

    2014-03-01

    Full Text Available One of the primary concerns to market a product is to find appropriate channel to target customers. The recent advances on information technology have created new products with tremendous opportunities. This paper presents a mixed integer programming technique based on McCarthy's 4PS to locate suitable billboards for marketing newly introduced IPHONE product. The paper considers two types of information including age and income and tries to find the best places such that potential consumers aged 25-35 with high income visit the billboards and the cost of advertisement is minimized. The model is formulated in terms of mixed integer programming and it has been applied for potential customers who live in city of Tabriz, Iran. Using a typical software package, the model detects appropriate places in various parts of the city.

  6. Network interdiction and stochastic integer programming

    CERN Document Server

    2003-01-01

    On March 15, 2002 we held a workshop on network interdiction and the more general problem of stochastic mixed integer programming at the University of California, Davis. Jesús De Loera and I co-chaired the event, which included presentations of on-going research and discussion. At the workshop, we decided to produce a volume of timely work on the topics. This volume is the result. Each chapter represents state-of-the-art research and all of them were refereed by leading investigators in the respective fields. Problems - sociated with protecting and attacking computer, transportation, and social networks gain importance as the world becomes more dep- dent on interconnected systems. Optimization models that address the stochastic nature of these problems are an important part of the research agenda. This work relies on recent efforts to provide methods for - dressing stochastic mixed integer programs. The book is organized with interdiction papers first and the stochastic programming papers in the second part....

  7. An Integer Programming Approach to Solving Tantrix on Fixed Boards

    Directory of Open Access Journals (Sweden)

    Yushi Uno

    2012-03-01

    Full Text Available Tantrix (Tantrix R ⃝ is a registered trademark of Colour of Strategy Ltd. in New Zealand, and of TANTRIX JAPAN in Japan, respectively, under the license of M. McManaway, the inventor. is a puzzle to make a loop by connecting lines drawn on hexagonal tiles, and the objective of this research is to solve it by a computer. For this purpose, we first give a problem setting of solving Tantrix as making a loop on a given fixed board. We then formulate it as an integer program by describing the rules of Tantrix as its constraints, and solve it by a mathematical programming solver to have a solution. As a result, we establish a formulation that can solve Tantrix of moderate size, and even when the solutions are invalid only by elementary constraints, we achieved it by introducing additional constraints and re-solve it. By this approach we succeeded to solve Tantrix of size up to 60.

  8. Ensemble segmentation using efficient integer linear programming.

    Science.gov (United States)

    Alush, Amir; Goldberger, Jacob

    2012-10-01

    We present a method for combining several segmentations of an image into a single one that in some sense is the average segmentation in order to achieve a more reliable and accurate segmentation result. The goal is to find a point in the "space of segmentations" which is close to all the individual segmentations. We present an algorithm for segmentation averaging. The image is first oversegmented into superpixels. Next, each segmentation is projected onto the superpixel map. An instance of the EM algorithm combined with integer linear programming is applied on the set of binary merging decisions of neighboring superpixels to obtain the average segmentation. Apart from segmentation averaging, the algorithm also reports the reliability of each segmentation. The performance of the proposed algorithm is demonstrated on manually annotated images from the Berkeley segmentation data set and on the results of automatic segmentation algorithms.

  9. A virtual network mapping algorithm based on integer programming

    Institute of Scientific and Technical Information of China (English)

    Bo LU; Jian-ya CHEN; Hong-yan CUI; Tao HUANG; Yun-jie LIU

    2013-01-01

    The virtual network (VN) embedding/mapping problem is recognized as an essential question of network virtualiza-tion. The VN embedding problem is a major challenge in this field. Its target is to efficiently map the virtual nodes and virtual links onto the substrate network resources. Previous research focused on designing heuristic-based algorithms or attempting two-stage solutions by solving node mapping in the first stage and link mapping in the second stage. In this study, we propose a new VN embedding algorithm based on integer programming. We build a model of an augmented substrate graph, and formulate the VN embedding problem as an integer program with an objective function and some constraints. A factor of topology-awareness is added to the objective function. The VN embedding problem is solved in one stage. Simulation results show that our algorithm greatly enhances the acceptance ratio, and increases the revenue/cost (R/C) ratio and the revenue while decreasing the cost of the VN embedding problem.

  10. Mixed Integer Programming and Heuristic Scheduling for Space Communication

    Science.gov (United States)

    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.

  11. An integer linear programming for a comprehensive reverse supply chain

    Directory of Open Access Journals (Sweden)

    Hoda Mahmoudi

    2014-12-01

    Full Text Available Reverse supply chain is a cycle of recovery for the products and materials used by the customers but can be returned to the chain performing some operations. Due to significance of reverse supply chain in the content of environmental and economical aspects, we formulate a mathematical model of reverse multi-layer multi-product supply chain for minimizing the total costs including returning, disassembly, processing, recycling, remanufacturing, and distribution centers. The presented model is an integer linear programming model being solved using Lingo 9 software. Numerical experiments are conducted to gain insight into the proposed model. The solutions provide a decision aid stream strengthening the concept of reverse supply network design and analysis for profit-making organization.

  12. Linear and integer programming theory and practice

    CERN Document Server

    Sierksma, Gerard

    2001-01-01

    Linear optimisation; basic concepts; Dantzig's simplex method; duality and optimality; sensitivity analysis; karmarkar's interior path method; integer linear optimisation; linear network models; computational complexity issues; model building, case studies, and advanced techniques; solutions to selected exercises. Appendices: linear algebra; convexity; graph theory; optimisation theory; computer package INTPM.

  13. Short Rational Generating Functions For Multiobjective Linear Integer Programming

    CERN Document Server

    Blanco, Victor

    2007-01-01

    This paper presents an algorithm for solving multiobjective integer programming problems. The algorithm uses Barvinok's rational functions of the polytope that defines the feasible region and provides as output the entire set of nondominated solutions for the problem. Theoretical complexity results on the algorithm are provided in the paper and an implementation of the algorithm shows that it is useful for solving multiobjective integer linear programs.

  14. Mixed integer linear programming for maximum-parsimony phylogeny inference.

    Science.gov (United States)

    Sridhar, Srinath; Lam, Fumei; Blelloch, Guy E; Ravi, R; Schwartz, Russell

    2008-01-01

    Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new advances in phylogeny inference will be required if we are to be able to continue to make effective use of the rapidly growing stores of variation data now being gathered. In this paper, we present two integer linear programming (ILP) formulations to find the most parsimonious phylogenetic tree from a set of binary variation data. One method uses a flow-based formulation that can produce exponential numbers of variables and constraints in the worst case. The method has, however, proven extremely efficient in practice on datasets that are well beyond the reach of the available provably efficient methods, solving several large mtDNA and Y-chromosome instances within a few seconds and giving provably optimal results in times competitive with fast heuristics than cannot guarantee optimality. An alternative formulation establishes that the problem can be solved with a polynomial-sized ILP. We further present a web server developed based on the exponential-sized ILP that performs fast maximum parsimony inferences and serves as a front end to a database of precomputed phylogenies spanning the human genome.

  15. Integer Programming Model for Maximum Clique in Graph

    Institute of Scientific and Technical Information of China (English)

    YUAN Xi-bo; YANG You; ZENG Xin-hai

    2005-01-01

    The maximum clique or maximum independent set of graph is a classical problem in graph theory. Combined with Boolean algebra and integer programming, two integer programming models for maximum clique problem,which improve the old results were designed in this paper. Then, the programming model for maximum independent set is a corollary of the main results. These two models can be easily applied to computer algorithm and software, and suitable for graphs of any scale. Finally the models are presented as Lingo algorithms, verified and compared by several examples.

  16. A Polynomial Time Algorithm for a Special Case of Linear Integer Programming

    CERN Document Server

    Ghasemiesfeh, Golnaz; Tabesh, Yahya

    2011-01-01

    According to the wide use of integer programming in many fields, affords toward finding and solving sub classes of these problems which are solvable in polynomial time seems to be important and useful. Integer linear programming (ILP) problems have the general form: $Min \\{C^{T}x: Ax=b, x\\geq 0, x\\in Z^{n}\\}$ where $Z^{n}$ is the set of n-dimensional integer vectors. Algorithmic solution of ILP is at great interest, in this paper we have presented a polynomial algorithm for a special case of the ILP problems; we have used a graph theoretical formulation of the problem which leads to an $O[mn(m+n)]$ solution where $m$ and $n$ are dimensions of coefficient matrix $X$.

  17. A new heuristic algorithm for general integer linear programming problems

    Institute of Scientific and Technical Information of China (English)

    GAO Pei-wang; CAI Ying

    2006-01-01

    A new heuristic algorithm is proposed for solving general integer linear programming problems.In the algorithm,the objective function hyperplane is used as a cutting plane,and then by introducing a special set of assistant sets,an efficient heuristic search for the solution to the integer linear program is carried out in the sets on the objective function hyperplane.A simple numerical example shows that the algorithm is efficient for some problems,and therefore,of practical interest.

  18. Constrained spacecraft reorientation using mixed integer convex programming

    Science.gov (United States)

    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.

  19. Accurate construction of consensus genetic maps via integer linear programming.

    Science.gov (United States)

    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.

  20. Method for solving a convex integer programming problem

    OpenAIRE

    Stefanov, Stefan M.

    2003-01-01

    We consider a convex integer program which is a nonlinear version of the assignment problem. This problem is reformulated as an equivalent problem. An algorithm for solving the original problem is suggested which is based on solving the simple assignment problem via some of known algorithms.

  1. Currency Arbitrage Detection Using a Binary Integer Programming Model

    Science.gov (United States)

    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…

  2. Solving linear integer programming problems by a novel neural model.

    Science.gov (United States)

    Cavalieri, S

    1999-02-01

    The paper deals with integer linear programming problems. As is well known, these are extremely complex problems, even when the number of integer variables is quite low. Literature provides examples of various methods to solve such problems, some of which are of a heuristic nature. This paper proposes an alternative strategy based on the Hopfield neural network. The advantage of the strategy essentially lies in the fact that hardware implementation of the neural model allows for the time required to obtain a solution so as not depend on the size of the problem to be solved. The paper presents a particular class of integer linear programming problems, including well-known problems such as the Travelling Salesman Problem and the Set Covering Problem. After a brief description of this class of problems, it is demonstrated that the original Hopfield model is incapable of supplying valid solutions. This is attributed to the presence of constant bias currents in the dynamic of the neural model. A demonstration of this is given and then a novel neural model is presented which continues to be based on the same architecture as the Hopfield model, but introduces modifications thanks to which the integer linear programming problems presented can be solved. Some numerical examples and concluding remarks highlight the solving capacity of the novel neural model.

  3. Investigating Integer Restrictions in Linear Programming

    Science.gov (United States)

    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…

  4. Investigating Integer Restrictions in Linear Programming

    Science.gov (United States)

    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…

  5. Solving large double digestion problems for DNA restriction mapping by using branch-and-bound integer linear programming.

    Science.gov (United States)

    Wu, Z; Zhang, Y

    2008-01-01

    The double digestion problem for DNA restriction mapping has been proved to be NP-complete and intractable if the numbers of the DNA fragments become large. Several approaches to the problem have been tested and proved to be effective only for small problems. In this paper, we formulate the problem as a mixed-integer linear program (MIP) by following (Waterman, 1995) in a slightly different form. With this formulation and using state-of-the-art integer programming techniques, we can solve randomly generated problems whose search space sizes are many-magnitude larger than previously reported testing sizes.

  6. A quadratic approximation-based algorithm for the solution of multiparametric mixed-integer nonlinear programming problems

    KAUST Repository

    Domínguez, Luis F.

    2012-06-25

    An algorithm for the solution of convex multiparametric mixed-integer nonlinear programming problems arising in process engineering problems under uncertainty is introduced. The proposed algorithm iterates between a multiparametric nonlinear programming subproblem and a mixed-integer nonlinear programming subproblem to provide a series of parametric upper and lower bounds. The primal subproblem is formulated by fixing the integer variables and solved through a series of multiparametric quadratic programming (mp-QP) problems based on quadratic approximations of the objective function, while the deterministic master subproblem is formulated so as to provide feasible integer solutions for the next primal subproblem. To reduce the computational effort when infeasibilities are encountered at the vertices of the critical regions (CRs) generated by the primal subproblem, a simplicial approximation approach is used to obtain CRs that are feasible at each of their vertices. The algorithm terminates when there does not exist an integer solution that is better than the one previously used by the primal problem. Through a series of examples, the proposed algorithm is compared with a multiparametric mixed-integer outer approximation (mp-MIOA) algorithm to demonstrate its computational advantages. © 2012 American Institute of Chemical Engineers (AIChE).

  7. Relaxation and decomposition methods for mixed integer nonlinear programming

    CERN Document Server

    Nowak, Ivo; Bank, RE

    2005-01-01

    This book presents a comprehensive description of efficient methods for solving nonconvex mixed integer nonlinear programs, including several numerical and theoretical results, which are presented here for the first time. It contains many illustrations and an up-to-date bibliography. Because on the emphasis on practical methods, as well as the introduction into the basic theory, the book is accessible to a wide audience. It can be used both as a research and as a graduate text.

  8. Optimizing Marine Corps Personnel Assignments Using an Integer Programming Model

    Science.gov (United States)

    2012-12-01

    would assist the Monitors in the assignment process. Though these studies contain very thorough analyses, they differ from the approach taken in this...thesis in that they do not look into using a low cost, yet very efficient, decision modeling approach of integer programming as a method of...2012 BAH Rates-with Dependents. Defense Travel Mangement Office. (2011, December). 2012 BAH Rates-without Dependents. M ileage C ost 1 Per D iem

  9. Partial Gr\\"obner bases for multiobjective integer programming

    CERN Document Server

    Blanco, Victor

    2007-01-01

    In this paper we present two new methodologies for solving multiobjective integer programming using tools from algebraic geometry. We introduce the concept of partial Gr\\"obner basis for a family of multiobjective programs where the right-hand side varies. This new structure extends the notion of usual Gr\\"obner basis for the single objective case, to the case of multiple objectives, i.e., a partial ordering instead of a total ordering over the feasible vectors. The main property of these bases is that partial reduction of the integer elements in the kernel of the constraint matrix by the different blocks of the basis is zero. It allows us to prove that this new construction is a test family for a family of multiobjective programs. An algorithm '\\`a la Buchberger' is developed to compute partial Gr\\"obner basis. Specifically, with this tool we compute the entire set of efficient solutions of any multiobjective integer linear problem (MOILP). Some examples illustrate the application of the algorithms and compu...

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

    Science.gov (United States)

    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.

  11. Exact solutions to traffic density estimation problems involving the Lighthill-Whitham-Richards traffic flow model using mixed integer programming

    KAUST Repository

    Canepa, Edward S.

    2012-09-01

    This article presents a new mixed integer programming formulation of the traffic density estimation problem in highways modeled by the Lighthill Whitham Richards equation. We first present an equivalent formulation of the problem using an Hamilton-Jacobi equation. Then, using a semi-analytic formula, we show that the model constraints resulting from the Hamilton-Jacobi equation result in linear constraints, albeit with unknown integers. We then pose the problem of estimating the density at the initial time given incomplete and inaccurate traffic data as a Mixed Integer Program. We then present a numerical implementation of the method using experimental flow and probe data obtained during Mobile Century experiment. © 2012 IEEE.

  12. An overview of solution methods for multi-objective mixed integer linear programming programs

    DEFF Research Database (Denmark)

    Andersen, Kim Allan; Stidsen, Thomas Riis

    Multiple objective mixed integer linear programming (MOMIP) problems are notoriously hard to solve to optimality, i.e. finding the complete set of non-dominated solutions. We will give an overview of existing methods. Among those are interactive methods, the two phases method and enumeration...... methods. In particular we will discuss the existing branch and bound approaches for solving multiple objective integer programming problems. Despite the fact that branch and bound methods has been applied successfully to integer programming problems with one criterion only a few attempts has been made...

  13. An overview of solution methods for multi-objective mixed integer linear programming programs

    DEFF Research Database (Denmark)

    Andersen, Kim Allan; Stidsen, Thomas Riis

    Multiple objective mixed integer linear programming (MOMIP) problems are notoriously hard to solve to optimality, i.e. finding the complete set of non-dominated solutions. We will give an overview of existing methods. Among those are interactive methods, the two phases method and enumeration...... methods. In particular we will discuss the existing branch and bound approaches for solving multiple objective integer programming problems. Despite the fact that branch and bound methods has been applied successfully to integer programming problems with one criterion only a few attempts has been made...

  14. Integer programming for the generalized high school timetabling problem

    DEFF Research Database (Denmark)

    Kristiansen, Simon; Sørensen, Matias; Stidsen, Thomas Riis

    2015-01-01

    Recently, the XHSTT format for high school timetabling was introduced. It provides a uniform way of modeling problem instances and corresponding solutions. The format supports a wide variety of constraints, and currently 38 real-life instances from 11 different countries are available. Thereby......, the XHSTT format serves as a common ground for researchers within this area. This paper describes the first exact method capable of handling an arbitrary instance of the XHSTT format. The method is based on a mixed-integer linear programming (MIP) model, which is solved in two steps with a commercial...

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

    Science.gov (United States)

    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.

  16. Using Integer Programming for Airport Service Planning in Staff Scheduling

    Directory of Open Access Journals (Sweden)

    W.H. Ip

    2010-09-01

    Full Text Available Reliability and safety in flight is extremely necessary and that depend on the adoption of proper maintenance system. Therefore, it is essential for aircraft maintenance companies to perform the manpower scheduling efficiently. One of the objectives of this paper is to provide an Integer Programming approach to determine the optimal solutions to aircraft maintenance planning and scheduling and hence the planning and scheduling processes can become more efficient and effective. Another objective is to develop a set of computational schedules for maintenance manpower to cover all scheduled flights. In this paper, a sequential methodology consisting of 3 stages is proposed. They are initial maintenance demand schedule, the maintenance pairing and the maintenance group(s assignment. Since scheduling would split up into different stages, different mathematical techniques have been adopted to cater for their own problem characteristics. Microsoft Excel would be used. Results from the first stage and second stage would be inputted into integer programming model using Microsoft Excel Solver to find the optimal solution. Also, Microsoft Excel VBA is used for devising a scheduling system in order to reduce the manual process and provide a user friendly interface. For the results, all can be obtained optimal solution and the computation time is reasonable and acceptable. Besides, the comparison of the peak time and non-peak time is discussed.

  17. Split diversity in constrained conservation prioritization using integer linear programming.

    Science.gov (United States)

    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.

  18. Optimal power system management via mixed integer dynamic programming

    Energy Technology Data Exchange (ETDEWEB)

    Kwatny, H.G.; Mensah, E. [Drexel Univ., Philadelphia, PA (United States). Dept. of Mechanical Engineering and Mechanics; Niebur, D. [Drexel Univ., Philadelphia, PA (United States). Dept. of Electrical and Computer Engineering; Teolis, C. [Techno-Sciences Inc., Lanham, MD (United States)

    2006-07-01

    Power systems are comprised of continuous and discrete acting components and subsystems. This paper discussed a logical specification that was used to define the transition dynamics of the discrete subsystem. It also presented a computational tool that reduced the logical specification to a set of inequalities as well as the use of the transformed model in a dynamic programming approach to the design of the optimal feedback controls. An example of optimal load shedding within a power system with an aggregate induction motor and constant admittance loads was presented. Specifically, the paper outlined the problem and discussed the modeling of hybrid systems and the control problem. A solution to the optimal control problem was presented. The essential feature of the model was the characterization of the discrete subsystem in terms of a set of mixed-integer formulas. The case example showed how logical constraints involving system real variables, such as case excitation voltage, could be incorporated in the problem via transformation to mixed-integer formulas. 10 refs., 4 figs.

  19. An Integer Programming-based Local Search for Large-scale Maximal Covering Problems

    Directory of Open Access Journals (Sweden)

    Junha Hwang

    2011-02-01

    Full Text Available Maximal covering problem (MCP is classified as a linear integer optimization problem which can be effectively solved by integer programming technique. However, as the problem size grows, integerprogramming requires excessive time to get an optimal solution. This paper suggests a method for applying integer programming-based local search (IPbLS to solve large-scale maximal covering problems. IPbLS, which is a hybrid technique combining integer programming and local search, is a kind of local search using integer programming for neighbor generation. IPbLS itself is very effective for MCP. In addition, we improve the performance of IPbLS for MCP through problem reduction based on the current solution. Experimental results show that the proposed method considerably outperforms any other local search techniques and integer programming.

  20. Integer programming model for optimizing bus timetable using genetic algorithm

    Science.gov (United States)

    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%.

  1. Developing optimal nurses work schedule using integer programming

    Science.gov (United States)

    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.

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

    Science.gov (United States)

    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.

  3. Item Pool Construction Using Mixed Integer Quadratic Programming (MIQP). GMAC® Research Report RR-14-01

    Science.gov (United States)

    Han, Kyung T.; Rudner, Lawrence M.

    2014-01-01

    This study uses mixed integer quadratic programming (MIQP) to construct multiple highly equivalent item pools simultaneously, and compares the results from mixed integer programming (MIP). Three different MIP/MIQP models were implemented and evaluated using real CAT item pool data with 23 different content areas and a goal of equal information…

  4. Approximating electrical distribution networks via mixed-integer nonlinear programming

    Energy Technology Data Exchange (ETDEWEB)

    Lakhera, Sanyogita [Citibank, New York City, NY (United States); Shanbhag, Uday V. [Department of Industrial and Enterprise Systems Engineering at the University of Illinois at Urbana-Champaign, 117 Transportation Building, 104 S. Mathews Ave., Urbana, IL 61801 (United States); McInerney, Michael K. [Construction Engineering Research Laboratory (CERL) (United States)

    2011-02-15

    Given urban data derived from a geographical information system (GIS), we consider the problem of constructing an estimate of the electrical distribution system of an urban area. We employ the image data to obtain an approximate electrical load distribution over a network of a prespecificed discretization. Together with partial information about existing substations, we determine the optimal placement of electrical substations to sustain such a load that minimizes the cost of capital and losses. This requires solving large-scale quadratic programs with discrete variables for which we present a novel penalization-smoothing scheme. The choice of locations allows one to determine the optimal flows in this network, as required by physical requirements which provide us with an approximation of the distribution network. Furthermore, the scheme allows for approximating systems in the presence of no-go areas, such as lakes and fields. We examine the performance of our algorithm on the solution of a set of location problems and observe that the scheme is capable of solving large-scale instances, well beyond the realm of existing mixed-integer nonlinear programming solvers. We conclude with a case study in which a stage-wise extension of this scheme is developed to reflect the temporal evolution of load. (author)

  5. Deleting Outliers in Robust Regression with Mixed Integer Programming

    Institute of Scientific and Technical Information of China (English)

    Georgios Zioutas; Antonios Avramidis

    2005-01-01

    In robust regression we often have to decide how many are the unusual observations, which should be removed from the sample in order to obtain better fitting for the rest of the observations. Generally, we use the basic principle of LTS, which is to fit the majority of the data, identifying as outliers those points that cause the biggest damage to the robust fit. However, in the LTS regression method the choice of default values for high break down-point affects seriously the efficiency of the estimator. In the proposed approach we introduce penalty cost for discarding an outlier, consequently, the best fit for the majority of the data is obtained by discarding only catastrophic observations. This penalty cost is based on robust design weights and high break down-point residual scale taken from the LTS estimator. The robust estimation is obtained by solving a convex quadratic mixed integer programming problem, where in the objective function the sum of the squared residuals and penalties for discarding observations is minimized. The proposed mathematical programming formula is suitable for small-sample data. Moreover, we conduct a simulation study to compare other robust estimators with our approach in terms of their efficiency and robustness.

  6. On Column-restricted and Priority Covering Integer Programs

    CERN Document Server

    Chakrabarty, Deeparnab; Koenemann, Jochen

    2010-01-01

    In a column-restricted covering integer program (CCIP), all the non-zero entries of any column of the constraint matrix are equal. Such programs capture capacitated versions of covering problems. In this paper, we study the approximability of CCIPs, in particular, their relation to the integrality gaps of the underlying 0,1-CIP. If the underlying 0,1-CIP has an integrality gap O(gamma), and assuming that the integrality gap of the priority version of the 0,1-CIP is O(omega), we give a factor O(gamma + omega) approximation algorithm for the CCIP. Priority versions of 0,1-CIPs (PCIPs) naturally capture quality of service type constraints in a covering problem. We investigate priority versions of the line (PLC) and the (rooted) tree cover (PTC) problems. Apart from being natural objects to study, these problems fall in a class of fundamental geometric covering problems. We bound the integrality of certain classes of this PCIP by a constant. Algorithmically, we give a polytime exact algorithm for PLC, show that t...

  7. An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing

    OpenAIRE

    Puchinger, Jakob; Raidl, Günther,

    2004-01-01

    International audience; We consider the 3-stage two-dimensional bin packing problem , which occurs in real-world problems such as glass cutting. For it, we present a new integer linear programming formulation and a branch and price algorithm. Column generation is performed by applying either a greedy heuristic or an Evolutionary Algorithm (EA). Computational experiments show the benefits of the EA-based approach. The higher computational effort of the EA pays off in terms of better final solu...

  8. An Approximate Algorithm for a Class of Nonlinear Bilevel Integer Programming

    Institute of Scientific and Technical Information of China (English)

    LI Lei; TENG Chun-xian; TIAN Guang-yue

    2002-01-01

    The algorithm for a class of nonlinear bilevel integer programming is discussed in this paper. It is based on the theory and algorithm for nonlinear integer programming. The continuity methods for integer programming are studied in this paper. After simulated annealing algorithm is applied to the upper-level programming problem and the thought of filled function method for continuous global optimization is applied to the corresponding lower-level programming, an approximate algorithm is established. The satisfactory algorithm is elaborated in the following example.

  9. An integer programming model for assigning students to elective courses

    Directory of Open Access Journals (Sweden)

    Ivo Beroš

    2015-10-01

    Full Text Available This paper deals with the problem of assigning students to elective courses according to their preferences. This process of assigning students to elective courses according to their preferences often places before academic institutions numerous obstacles, the most typical being a limited number of students who can be assigned to any particular class. Furthermore, due to financial or technical reasons, the maximum number of the elective courses is determined in advance, meaning that the institution decides which courses to conduct. Therefore, the expectation that all the students will be assigned to their first choice of courses is not realistic (perfect satisfaction. This paper presents an integer programming model that maximizes the total student satisfaction in line with a number of different constraints. The measure of student satisfaction is based on a student's order of preference according to the principle: the more a choice is met the higher the satisfaction. Following the basic model, several versions of the models are generated to cover possible real-life situations, while taking into consideration the manner student satisfaction is measured, as well as the preference of academic institution within set technical and financial constraints. The main contribution of the paper is introducing the concept of the minimal student satisfaction level that reduces the number of students dissatised with the courses to which they were assigned.

  10. Learning oncogenetic networks by reducing to mixed integer linear programming.

    Science.gov (United States)

    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.

  11. Maximum likelihood pedigree reconstruction using integer linear programming.

    Science.gov (United States)

    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.

  12. Mixed integer (0-1) fractional programming for decision support in paper production industry

    NARCIS (Netherlands)

    Claassen, G.D.H.

    2014-01-01

    This paper presents an effective and efficient method for solving a special class of mixed integer fractional programming (FP) problems. We take a classical reformulation approach for continuous FP as a starting point and extend it for solving a more general class of mixed integer (0–1) fractional p

  13. AN ALGORITHM FOR FINDING GLOBAL MINIMUM OF NONLINEAR INTEGER PROGRAMMING

    Institute of Scientific and Technical Information of China (English)

    Wei-wenTian; Lian-shengZhang

    2004-01-01

    A filled function is proposed by R.Ge[2] for finding a global minimizer of a function of several continuous variables. In [4], an approach for finding a global integer minimizer of nonlinear flmction using the above filled function is given. Meanwhile a major obstacle is met: if ρ > 0 is small, and ‖xI- xI* is large, where xI - an integer point, xI* - a current local integer minimizer, then the value of the filled function almost equals zero. Thus it is difficult to recognize the size of the value of the filled flmction and can not to find the global integer minimizer of nonlinear function. In this paper, two new filled functions are proposed for finding global integer minimizer of nonlinear flmction, the new filled function improves some properties of the filled function proposed by R. Ge [2]. Some numerical results are given, which indicate the new filled function (4.1) to find global integer minimizer of nonlinear function is efficient.

  14. Exact Penalty Function and Asymptotic Strong Nonlinear Duality in Integer Programming

    Institute of Scientific and Technical Information of China (English)

    Fu-sheng Bai; Z.Y.Wu; L.S. Zhang

    2004-01-01

    In this paper, a logarithmic-exponential penalty function with two parameters for integer programmingis discussed. We obtain the exact penalty properties and then establish the asymptotic strong nonlinear duality in the corresponding logarithmic-exponential dual formulation by using the obtained exact penalty properties.The discussion is based on the logarithmic-exponential nonlinear dual formulation proposed in [6].

  15. STUDI PERBANDINGAN PERFORMANCE ALGORITMA HEURISTIK POUR TERHADAP MIXED INTEGER PROGRAMMING DALAM MENYELESAIKAN PENJADWALAN FLOWSHOP

    Directory of Open Access Journals (Sweden)

    Tessa Vanina Soetanto

    2004-01-01

    Full Text Available This paper presents a study about new heuristic algorithm performance compared to Mixed Integer Programming (MIP method in solving flowshop scheduling problem to reach minimum makespan. Performance appraisal is based on Efficiency Index (EI, Relative Error (RE and Elapsed Runtime. Abstract in Bahasa Indonesia : Makalah ini menyajikan penelitian tentang performance algoritma heuristik Pour terhadap metode Mixed Integer Programming (MIP dalam menyelesaikan masalah penjadwalan flowshop dengan tujuan meminimalkan makespan. Penilaian performance dilakukan berdasarkan nilai Efficiency Index (EI, Relative Error (RE dan Elapsed Runtime. Kata kunci: flowshop, makespan, algoritma heuristik Pour, Mixed Integer Programming.

  16. IESIP - AN IMPROVED EXPLORATORY SEARCH TECHNIQUE FOR PURE INTEGER LINEAR PROGRAMMING PROBLEMS

    Science.gov (United States)

    Fogle, F. R.

    1994-01-01

    IESIP, an Improved Exploratory Search Technique for Pure Integer Linear Programming Problems, addresses the problem of optimizing an objective function of one or more variables subject to a set of confining functions or constraints by a method called discrete optimization or integer programming. Integer programming 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 difficult, integer programming is required for accuracy when modeling systems with small numbers of components such as the distribution of goods, machine scheduling, and production scheduling. IESIP establishes a new methodology for solving pure integer programming problems by utilizing a modified version of the univariate exploratory move developed by Robert Hooke and T.A. Jeeves. IESIP also takes some of its technique from the greedy procedure and the idea of unit neighborhoods. A rounding scheme uses the continuous solution found by traditional methods (simplex or other suitable technique) and creates a feasible integer starting point. The Hook and Jeeves exploratory search is modified to accommodate integers and constraints and is then employed to determine an optimal integer solution from the feasible starting solution. The user-friendly IESIP allows for rapid solution of problems up to 10 variables in size (limited by DOS allocation). Sample problems compare IESIP solutions with the traditional branch-and-bound approach. IESIP is written in Borland's TURBO Pascal for IBM PC series computers and compatibles running DOS. Source code and an executable are provided. The main memory requirement for execution is 25K. This program is available on a 5.25 inch 360K MS DOS format diskette. IESIP was developed in 1990. IBM is a trademark of International Business Machines. TURBO Pascal is registered by Borland International.

  17. A ZERO-ONE INTEGER PROGRAMMING MODEL FOR THE DESIGN OF MANUFACTURING CELLS

    Directory of Open Access Journals (Sweden)

    C R SHIYAS

    2012-01-01

    Full Text Available Cellular manufacturing is an efficient approach for implementing the principles of Group Technology in a manufacturing environment wherein families of parts with similar manufacturing processes are grouped together to process in different manufacturing cells. The issues and different approaches used for a cellular manufacturing system (CMS design are described and its merits and demerits are discussed in this paper. A linear integer programming model for the design of manufacturing cells is suggested and the model minimizes the intercell moves for the given part-machine incidence matrix. A genetic algorithm (GA based solution procedure is suggested for the mathematical model which provides cell configuration. This GA is integrated with a part assignment rule to get both the cell and part family configurations. The GA is validated using software package, LINGO. Illustrative examples show the validity of the formulation and efficiency of the model.

  18. Final Report---Next-Generation Solvers for Mixed-Integer Nonlinear Programs: Structure, Search, and Implementation

    Energy Technology Data Exchange (ETDEWEB)

    Linderoth, Jeff T. [University of Wisconsin-Madison; Luedtke, James R. [University of Wisconsin-Madison

    2013-05-30

    The mathematical modeling of systems often requires the use of both nonlinear and discrete components. Problems involving both discrete and nonlinear components are known as mixed-integer nonlinear programs (MINLPs) and are among the most challenging computational optimization problems. This research project added to the understanding of this area by making a number of fundamental advances. First, the work demonstrated many novel, strong, tractable relaxations designed to deal with non-convexities arising in mathematical formulation. Second, the research implemented the ideas in software that is available to the public. Finally, the work demonstrated the importance of these ideas on practical applications and disseminated the work through scholarly journals, survey publications, and conference presentations.

  19. Integer Programming and m-irreducibility of numerical semigroups

    CERN Document Server

    Blanco, Víctor

    2011-01-01

    This paper addresses the problem of decomposing a numerical semigroup into m-irreducible numerical semigroups. The problem originally stated in algebraic terms is translated, introducing the so called Kunz-coordinates, to resolve a series of several discrete optimization problems. First, we prove that finding a minimal m-irreducible decomposition is equivalent to solve a multiobjective linear integer problem. Then, we restate that problem as the problem of finding all the optimal solutions of a finite number of single objective integer linear problems plus a set covering problem. Finally, we prove that there is a suitable transformation that reduces the original problem to find an optimal solution of a compact integer linear problem. This result ensures a polynomial time algorithm for each given multiplicity m. We have implemented the different algorithms and have performed some computational experiments to show the efficiency of our methodology.

  20. Stochastic level-value approximation for quadratic integer convex programming

    Institute of Scientific and Technical Information of China (English)

    PENG Zheng; WU Dong-hua

    2008-01-01

    We propose a stochastic level value approximation method for a quadratic integer convex minimizing problem in this paper. This method applies an importance sampling technique, and make use of the cross-entropy method to update the sample density functions. We also prove the asymptotic convergence of this algorithm, and re-port some numerical results to illuminate its effectiveness.

  1. A One-parameter Filled Function Method for Nonlinear Integer Programming

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    This paper gives a new definition of the filled function for nonlinear integer programming problem. A filled function satisfying our definition is presented. This function contains only one parameter. The properties of the proposed filled function and the method using this filled function to solve nonlinear integer programming problem are also discussed. Numerical results indicate the efficiency and reliability of the proposed filled function algorithm.

  2. One-parameter quasi-filled function algorithm for nonlinear integer programming

    Institute of Scientific and Technical Information of China (English)

    SHANG You-lin; HAN Bo-shun

    2005-01-01

    A definition of the quasi-filled function for nonlinear integer programming problem is given in this paper. A quasi-filled function satisfying our definition is presented. This function contains only one parameter. The properties of the proposed quasi-filled function and the method using this quasi-filled function to solve nonlinear integer programming problem are also discussed in this paper. Numerical results indicated the efficiency and reliability of the proposed quasi-filled function algorithm.

  3. ALLOCATING REPAIRABLE SYSTEM'S RELIABILITY SUBJECT TO MINIMAL TOTAL COST - AN INTEGER PROGRAMMING APPROACH

    Institute of Scientific and Technical Information of China (English)

    Ahmad A. Moreb

    2007-01-01

    Reliability allocation problem is commonly treated using a closed-form expression relating the cost to reliability. A recent approach has introduced the use of discrete integer technique for un-repairable systems. This research addresses the allocation problem for repairable systems. It presents an integer formulation for finding the optimum selection of components based on the integer values of their Mean Time to Failure (MTTF) and Mean Time to Repair (MTTR). The objective is to minimize the total cost under a system reliability constraint, in addition to other physical constraints. Although, a closed-form expression relating the cost to reliability may not be a linear; however, in this research, the objective function will always be linear regardless of the shape of the equivalent continuous closed-form function. An example is solved using the proposed method and compared with the solution of the continuous closed-form version. The formulation for all possible system configurations, components and subsystems are also considered.

  4. Mixed Integer Linear Programming For Exact Finite-Horizon Planning In Decentralized Pomdps

    CERN Document Server

    Aras, Raghav; Charpillet, Fran\\ccois

    2007-01-01

    We consider the problem of finding an n-agent joint-policy for the optimal finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem of very high complexity (NEXP-hard in n >= 2). In this paper, we propose a new mathematical programming approach for the problem. Our approach is based on two ideas: First, we represent each agent's policy in the sequence-form and not in the tree-form, thereby obtaining a very compact representation of the set of joint-policies. Second, using this compact representation, we solve this problem as an instance of combinatorial optimization for which we formulate a mixed integer linear program (MILP). The optimal solution of the MILP directly yields an optimal joint-policy for the Dec-Pomdp. Computational experience shows that formulating and solving the MILP requires significantly less time to solve benchmark Dec-Pomdp problems than existing algorithms. For example, the multi-agent tiger problem for horizon 4 is solved in 72 secs with the MILP whereas existing ...

  5. Integer and combinatorial optimization

    CERN Document Server

    Nemhauser, George L

    1999-01-01

    Rave reviews for INTEGER AND COMBINATORIAL OPTIMIZATION ""This book provides an excellent introduction and survey of traditional fields of combinatorial optimization . . . It is indeed one of the best and most complete texts on combinatorial optimization . . . available. [And] with more than 700 entries, [it] has quite an exhaustive reference list.""-Optima ""A unifying approach to optimization problems is to formulate them like linear programming problems, while restricting some or all of the variables to the integers. This book is an encyclopedic resource for such f

  6. Generic Mathematical Programming Formulation and Solution for Computer-Aided Molecular Design

    OpenAIRE

    2015-01-01

    This short communication presents a generic mathematical programming formulation for Computer-Aided Molecular Design (CAMD). A given CAMD problem, based on target properties, is formulated as a Mixed Integer Linear/Non-Linear Program (MILP/MINLP). The mathematical programming model presented here, which is formulated as an MILP/MINLP problem, considers first-order and second-order molecular groups for molecular structure representation and property estimation. It is shown that various CAMD pr...

  7. Fitting boxes to Manhattan scenes using linear integer programming

    KAUST Repository

    Li, Minglei

    2016-02-19

    We propose an approach for automatic generation of building models by assembling a set of boxes using a Manhattan-world assumption. The method first aligns the point cloud with a per-building local coordinate system, and then fits axis-aligned planes to the point cloud through an iterative regularization process. The refined planes partition the space of the data into a series of compact cubic cells (candidate boxes) spanning the entire 3D space of the input data. We then choose to approximate the target building by the assembly of a subset of these candidate boxes using a binary linear programming formulation. The objective function is designed to maximize the point cloud coverage and the compactness of the final model. Finally, all selected boxes are merged into a lightweight polygonal mesh model, which is suitable for interactive visualization of large scale urban scenes. Experimental results and a comparison with state-of-the-art methods demonstrate the effectiveness of the proposed framework.

  8. Uncovering signal transduction networks from high-throughput data by integer linear programming.

    Science.gov (United States)

    Zhao, Xing-Ming; Wang, Rui-Sheng; Chen, Luonan; Aihara, Kazuyuki

    2008-05-01

    Signal transduction is an important process that transmits signals from the outside of a cell to the inside to mediate sophisticated biological responses. Effective computational models to unravel such a process by taking advantage of high-throughput genomic and proteomic data are needed to understand the essential mechanisms underlying the signaling pathways. In this article, we propose a novel method for uncovering signal transduction networks (STNs) by integrating protein interaction with gene expression data. Specifically, we formulate STN identification problem as an integer linear programming (ILP) model, which can be actually solved by a relaxed linear programming algorithm and is flexible for handling various prior information without any restriction on the network structures. The numerical results on yeast MAPK signaling pathways demonstrate that the proposed ILP model is able to uncover STNs or pathways in an efficient and accurate manner. In particular, the prediction results are found to be in high agreement with current biological knowledge and available information in literature. In addition, the proposed model is simple to be interpreted and easy to be implemented even for a large-scale system.

  9. An extension of the Lovasz Local Lemma, and its applications to integer programming

    Energy Technology Data Exchange (ETDEWEB)

    Srinivasan, A. [National univ. of Singapore (Singapore)

    1996-12-31

    The Lovasz Local Lemma (LLL) is a powerful tool in proving the existence of rare events. We present an extension of this lemma, which works well when the event to be shown to exist is a conjunction of individual events, each of which asserts that a random variable does not deviate much from its mean. We consider three classes of NP-hard integer programs: minimax, packing, and covering integer programs. A key technique, randomized rounding of linear relaxations, was developed by Raghavan & Thompson to derive good approximation algorithms for such problems. We use our extended LLL to prove that randomized rounding produces, with non-zero probability, much better feasible solutions than known be- fore, if the constraint matrices of these integer programs are sparse (e.g., VLSI routing using short paths, problems on hypergraphs with small dimension/degree). We also generalize the method of pessimistic estimators due to Raghavan, to constructivize our packing and covering results.

  10. Exponential distribution-based genetic algorithm for solving mixed-integer bilevel programming problems

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    Two classes of mixed-integer nonlinear bilevel programming problems are discussed. One is that the follower's functions are separable with respect to the follower's variables, and the other is that the follower's functions are convex if the follower's variables are not restricted to integers. A genetic algorithm based on an exponential distribution is proposed for the aforementioned problems. First, for each fixed leader's variable x, it is proved that the optimal solution y of the follower's mixed-integer programming can be obtained by solving associated relaxed problems, and according to the convexity of the functions involved, a simplified branch and bound approach is given to solve the follower's programming for the second class of problems. Furthermore, based on an exponential distribution with a parameter A, a new crossover operator is designed in which the best individuals are used to generate better offspring of crossover. The simulation results illustrate that the proposed algorithm is efficient and robust.

  11. Metamorphic Testing Integer Overflow Faults of Mission Critical Program: A Case Study

    Directory of Open Access Journals (Sweden)

    Zhanwei Hui

    2013-01-01

    Full Text Available For mission critical programs, integer overflow is one of the most dangerous faults. Different testing methods provide several effective ways to detect the defect. However, it is hard to validate the testing outputs, because the oracle of testing is not always available or too expensive to get, unless the program throws an exception obviously. In the present study, the authors conduct a case study, where the authors apply a metamorphic testing (MT method to detect the integer overflow defect and alleviate the oracle problem in testing critical program of Traffic Collision Avoidance System (TCAS. Experimental results show that, in revealing typical integer mutations, compared with traditional safety property testing method, MT with a novel symbolic metamorphic relation is more effective than the traditional method in some cases.

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

    Science.gov (United States)

    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...

  13. A Mixed-Binary Convex Quadratic Reformulation for Box-Constrained Nonconvex Quadratic Integer Program

    OpenAIRE

    Xia, Yong; Han, Ying-Wei

    2014-01-01

    In this paper, we propose a mixed-binary convex quadratic programming reformulation for the box-constrained nonconvex quadratic integer program and then implement IBM ILOG CPLEX 12.6 to solve the new model. Computational results demonstrate that our approach clearly outperform the very recent state-of-the-art solvers.

  14. Two-parameters quasi-filled function algorithm for nonlinear integer programming

    Institute of Scientific and Technical Information of China (English)

    WANG Wei-xiang; SHANG You-lin; ZHANG Lian-sheng

    2006-01-01

    A quasi-filled function for nonlinear integer programming problem is given in this paper. This function contains two parameters which are easily to be chosen. Theoretical properties of the proposed quasi-filled function are investigated. Moreover,we also propose a new solution algorithm using this quasi-filled function to solve nonlinear integer programming problem in this paper. The examples with 2 to 6 variables are tested and computational results indicated the efficiency and reliability of the proposed quasi-filled function algorithm.

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

    Science.gov (United States)

    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.

  16. iPoint: an integer programming based algorithm for inferring protein subnetworks.

    Science.gov (United States)

    Atias, Nir; Sharan, Roded

    2013-07-01

    Large scale screening experiments have become the workhorse of molecular biology, producing data at an ever increasing scale. The interpretation of such data, particularly in the context of a protein interaction network, has the potential to shed light on the molecular pathways underlying the phenotype or the process in question. A host of approaches have been developed in recent years to tackle this reconstruction challenge. These approaches aim to infer a compact subnetwork that connects the genes revealed by the screen while optimizing local (individual path lengths) or global (likelihood) aspects of the subnetwork. Yosef et al. [Mol. Syst. Biol., 2009, 5, 248] were the first to provide a joint optimization of both criteria, albeit approximate in nature. Here we devise an integer linear programming formulation for the joint optimization problem, allowing us to solve it to optimality in minutes on current networks. We apply our algorithm, iPoint, to various data sets in yeast and human and evaluate its performance against state-of-the-art algorithms. We show that iPoint attains very compact and accurate solutions that outperform previous network inference algorithms with respect to their local and global attributes, their consistency across multiple experiments targeting the same pathway, and their agreement with current biological knowledge.

  17. Uncluttered Single-Image Visualization of Vascular Structures Using GPU and Integer Programming.

    Science.gov (United States)

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

    2013-01-01

    Direct projection of 3D 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 2D 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.

  18. Discovering link communities in complex networks by an integer programming model and a genetic algorithm.

    Science.gov (United States)

    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.

  19. Mixed integer programming for the resolution of GPS carrier phase ambiguities

    CERN Document Server

    Xu, Peiliang; Lachapelle, Gerard

    2010-01-01

    This arXiv upload is to clarify that the now well-known sorted QR MIMO decoder was first presented in the 1995 IUGG General Assembly. We clearly go much further in the sense that we directly incorporated reduction into this one step, non-exact suboptimal integer solution. Except for these first few lines up to this point, this paper is an unaltered version of the paper presented at the IUGG1995 Assembly in Boulder. Ambiguity resolution of GPS carrier phase observables is crucial in high precision geodetic positioning and navigation applications. It consists of two aspects: estimating the integer ambiguities in the mixed integer observation model and examining whether they are sufficiently accurate to be fixed as known nonrandom integers. We shall discuss the first point in this paper from the point of view of integer programming. A one-step nonexact approach is proposed by employing minimum diagonal pivoting Gaussian decompositions, which may be thought of as an improvement of the simple rounding-off method, ...

  20. Mixed-Integer-Linear-Programming-Based Energy Management System for Hybrid PV-Wind-Battery Microgrids

    DEFF Research Database (Denmark)

    Hernández, Adriana Carolina Luna; Aldana, Nelson Leonardo Diaz; Graells, Moises

    2017-01-01

    -side strategy, defined as a general mixed-integer linear programming by taking into account two stages for proper charging of the storage units. This model is considered as a deterministic problem that aims to minimize operating costs and promote self-consumption based on 24-hour ahead forecast data...

  1. The "Best" Algorithm for Solving Stochastic Mixed Integer Programs

    Science.gov (United States)

    2006-01-01

    focuses on solving problems for which all second-stage scenarios can be enu- merated (Klein Haneveld and van der Vlerk 1998, Ahmed 2004). Two exceptions... Haneveld , W. K. and M. H. van der Vlerk. 1998. Stochastic integer programming: state of the art. Available via <http://citeseer.ist.psu. edu

  2. Mixed Integer Programming and Heuristic Scheduling for Space Communication Networks

    Science.gov (United States)

    Lee, Charles H.; Cheung, Kar-Ming

    2012-01-01

    In this paper, we propose to solve the constrained optimization problem in two phases. The first phase uses heuristic methods such as the ant colony method, particle swarming optimization, and genetic algorithm to seek a near optimal solution among a list of feasible initial populations. The final optimal solution can be found by using the solution of the first phase as the initial condition to the SQP algorithm. We demonstrate the above problem formulation and optimization schemes with a large-scale network that includes the DSN ground stations and a number of spacecraft of deep space missions.

  3. Mixed Integer Programming and Heuristic Scheduling for Space Communication Networks

    Science.gov (United States)

    Lee, Charles H.; Cheung, Kar-Ming

    2012-01-01

    In this paper, we propose to solve the constrained optimization problem in two phases. The first phase uses heuristic methods such as the ant colony method, particle swarming optimization, and genetic algorithm to seek a near optimal solution among a list of feasible initial populations. The final optimal solution can be found by using the solution of the first phase as the initial condition to the SQP algorithm. We demonstrate the above problem formulation and optimization schemes with a large-scale network that includes the DSN ground stations and a number of spacecraft of deep space missions.

  4. Generic Mathematical Programming Formulation and Solution for Computer-Aided Molecular Design

    DEFF Research Database (Denmark)

    Zhang, Lei; Cignitti, Stefano; Gani, Rafiqul

    2015-01-01

    This short communication presents a generic mathematical programming formulation for Computer-Aided Molecular Design (CAMD). A given CAMD problem, based on target properties, is formulated as a Mixed Integer Linear/Non-Linear Program (MILP/MINLP). The mathematical programming model presented here......, which is formulated as an MILP/MINLP problem, considers first-order and second-order molecular groups for molecular structure representation and property estimation. It is shown that various CAMD problems can be formulated and solved through this model....

  5. Generic Mathematical Programming Formulation and Solution for Computer-Aided Molecular Design

    DEFF Research Database (Denmark)

    Zhang, Lei; Cignitti, Stefano; Gani, Rafiqul

    2015-01-01

    This short communication presents a generic mathematical programming formulation for Computer-Aided Molecular Design (CAMD). A given CAMD problem, based on target properties, is formulated as a Mixed Integer Linear/Non-Linear Program (MILP/MINLP). The mathematical programming model presented here......, which is formulated as an MILP/MINLP problem, considers first-order and second-order molecular groups for molecular structure representation and property estimation. It is shown that various CAMD problems can be formulated and solved through this model....

  6. Determining the optimal product-mix using integer programming: An application in audio speaker production

    Science.gov (United States)

    Khan, Sahubar Ali Bin Mohamed Nadhar; Ahmarofi, Ahmad Afif Bin

    2014-12-01

    In manufacturing sector, production planning or scheduling is the most important managerial task in order to achieve profit maximization and cost minimization. With limited resources, the management has to satisfy customer demand and at the same time fulfill company's objective, which is to maximize profit or minimize cost. Hence, planning becomes a significant task for production site in order to determine optimal number of units for each product to be produced. In this study, integer programming technique is used to develop an appropriate product-mix planning to obtain the optimal number of audio speaker products that should be produced in order to maximize profit. Branch-and-bound method is applied to obtain exact integer solutions when non-integer solutions occurred. Three major resource constraints are considered in this problem: raw materials constraint, demand constraint and standard production time constraint. It is found that, the developed integer programming model gives significant increase in profit compared to the existing method used by the company. At the end of the study, sensitivity analysis was performed to evaluate the effects of changes in objective function coefficient and available resources on the developed model. This will enable the management to foresee the effects on the results when some changes happen to the profit of its products or available resources.

  7. Improved Sorting-Based Procedure for Integer Programming

    DEFF Research Database (Denmark)

    Dantchev, Stefan

    2002-01-01

    Recently, Cornuéjols and Dawande have considered a special class of 0-1 programs that turns out to be hard for existing IP solvers. One of them is a sorting-based algorithm, based on an idea of Wolsey. In this paper, we show how to improve both the running time and the space requirements of this ......Recently, Cornuéjols and Dawande have considered a special class of 0-1 programs that turns out to be hard for existing IP solvers. One of them is a sorting-based algorithm, based on an idea of Wolsey. In this paper, we show how to improve both the running time and the space requirements...... of this algorithm. The drastic reduction of space needed allows us to solve much larger instances than was possible before using this technique....

  8. Aspect-object alignment with Integer Linear Programming in opinion mining.

    Directory of Open Access Journals (Sweden)

    Yanyan Zhao

    Full Text Available 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.

  9. Aspect-object alignment with Integer Linear Programming in opinion mining.

    Science.gov (United States)

    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.

  10. PON and WiMAX Convergence Network Planning Based on Mixed Integer Programming Model

    Institute of Scientific and Technical Information of China (English)

    Lv Miao; Chen Xue

    2011-01-01

    This article analyzes the characteristics of PON and WiMAX convergence network planning.Based on user coverage ratio,WiMAX channel allocation,cell radius,carrier-to-noise ratio threshold,and bandwidth constraint,we propose a mixed integer programming model solved by a Branch-Band and Heuristic Search method.Finally,the simulation result is given and analyzed.The planning method based on a mixed integer programming model can save 20 percentage of the overall planning cost,compared with the greedy algorithm.The relationship between the convergence network planning cost and frequency usage is also analyzed.The optimized planning result with the lowest cost can be acquired through the best frequency usage.

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

    Science.gov (United States)

    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.

  12. Persistent Phylogeny: A Galled-Tree and Integer Linear Programming Approach

    OpenAIRE

    Gusfield, Dan

    2015-01-01

    The Persistent-Phylogeny Model is an extension of the widely studied Perfect-Phylogeny Model, encompassing a broader range of evolutionary phenomena. Biological and algorithmic questions concerning persistent phylogeny have been intensely investigated in recent years. In this paper, we explore two alternative approaches to the persistent-phylogeny problem that grow out of our previous work on perfect phylogeny, and on galled trees. We develop an integer programming solution to the Persistent-...

  13. Reduced-Size Integer Linear Programming Models for String Selection Problems: Application to the Farthest String Problem.

    Science.gov (United States)

    Zörnig, Peter

    2015-08-01

    We present integer programming models for some variants of the farthest string problem. The number of variables and constraints is substantially less than that of the integer linear programming models known in the literature. Moreover, the solution of the linear programming-relaxation contains only a small proportion of noninteger values, which considerably simplifies the rounding process. Numerical tests have shown excellent results, especially when a small set of long sequences is given.

  14. A Mixed Integer Linear Programming Model for the Design of Remanufacturing Closed–loop Supply Chain Network

    Directory of Open Access Journals (Sweden)

    Mbarek Elbounjimi

    2015-11-01

    Full Text Available Closed-loop supply chain network design is a critical issue due to its impact on both economic and environmental performances of the supply chain. In this paper, we address the problem of designing a multi-echelon, multi-product and capacitated closed-loop supply chain network. First, a mixed-integer linear programming formulation is developed to maximize the total profit. The main contribution of the proposed model is addressing two economic viability issues of closed-loop supply chain. The first issue is the collection of sufficient quantity of end-of-life products are assured by retailers against an acquisition price. The second issue is exploiting the benefits of colocation of forward facilities and reverse facilities. The presented model is solved by LINGO for some test problems. Computational results and sensitivity analysis are conducted to show the performance of the proposed model.

  15. Comparison of linear, mixed integer and non-linear programming methods in energy system dispatch modelling

    DEFF Research Database (Denmark)

    Ommen, Torben Schmidt; Markussen, Wiebke Brix; Elmegaard, Brian

    2014-01-01

    differences and differences between the solution found by each optimisation method. One of the investigated approaches utilises LP (linear programming) for optimisation, one uses LP with binary operation constraints, while the third approach uses NLP (non-linear programming). The LP model is used...... of selected units by 23%, while for a non-linear approach the increase can be higher than 39%. The results indicate a higher coherence between the two latter approaches, and that the MLP (mixed integer programming) optimisation is most appropriate from a viewpoint of accuracy and runtime. © 2014 Elsevier Ltd...

  16. Integer programming

    CERN Document Server

    Greenberg, Harold

    1971-01-01

    In this book, we study theoretical and practical aspects of computing methods for mathematical modelling of nonlinear systems. A number of computing techniques are considered, such as methods of operator approximation with any given accuracy; operator interpolation techniques including a non-Lagrange interpolation; methods of system representation subject to constraints associated with concepts of causality, memory and stationarity; methods of system representation with an accuracy that is the best within a given class of models; methods of covariance matrix estimation;methods for low-rank mat

  17. Comparing Mixed & Integer Programming vs. Constraint Programming by solving Job-Shop Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Renata Melo e Silva de Oliveira

    2015-03-01

    Full Text Available Scheduling is a key factor for operations management as well as for business success. From industrial Job-shop Scheduling problems (JSSP, many optimization challenges have emerged since de 1960s when improvements have been continuously required such as bottlenecks allocation, lead-time reductions and reducing response time to requests.  With this in perspective, this work aims to discuss 3 different optimization models for minimizing Makespan. Those 3 models were applied on 17 classical problems of examples JSSP and produced different outputs.  The first model resorts on Mixed and Integer Programming (MIP and it resulted on optimizing 60% of the studied problems. The other models were based on Constraint Programming (CP and approached the problem in two different ways: a model CP1 is a standard IBM algorithm whereof restrictions have an interval structure that fail to solve 53% of the proposed instances, b Model CP-2 approaches the problem with disjunctive constraints and optimized 88% of the instances. In this work, each model is individually analyzed and then compared considering: i Optimization success performance, ii Computational processing time, iii Greatest Resource Utilization and, iv Minimum Work-in-process Inventory. Results demonstrated that CP-2 presented best results on criteria i and ii, but MIP was superior on criteria iii and iv and those findings are discussed at the final section of this work.

  18. Solution for integer linear bilevel programming problems using orthogonal genetic algorithm

    Institute of Scientific and Technical Information of China (English)

    Hong Li; Li Zhang; Yongchang Jiao

    2014-01-01

    An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit program-ming. An orthogonal genetic algorithm is developed for solving the binary linear implicit programming problem based on the ortho-gonal design. The orthogonal design with the factor analysis, an experimental design method is applied to the genetic algorithm to make the algorithm more robust, statistical y sound and quickly convergent. A crossover operator formed by the orthogonal array and the factor analysis is presented. First, this crossover operator can generate a smal but representative sample of points as off-spring. After al of the better genes of these offspring are selected, a best combination among these offspring is then generated. The simulation results show the effectiveness of the proposed algo-rithm.

  19. Spoofing cyber attack detection in probe-based traffic monitoring systems using mixed integer linear programming

    KAUST Repository

    Canepa, Edward S.

    2013-09-01

    Traffic sensing systems rely more and more on user generated (insecure) data, which can pose a security risk whenever the data is used for traffic flow control. In this article, we propose a new formulation for detecting malicious data injection in traffic flow monitoring systems by using the underlying traffic flow model. The state of traffic is modeled by the Lighthill- Whitham-Richards traffic flow model, which is a first order scalar conservation law with concave flux function. Given a set of traffic flow data generated by multiple sensors of different types, we show that the constraints resulting from this partial differential equation are mixed integer linear inequalities for a specific decision variable. We use this fact to pose the problem of detecting spoofing cyber attacks in probe-based traffic flow information systems as mixed integer linear feasibility problem. The resulting framework can be used to detect spoofing attacks in real time, or to evaluate the worst-case effects of an attack offliine. A numerical implementation is performed on a cyber attack scenario involving experimental data from the Mobile Century experiment and the Mobile Millennium system currently operational in Northern California. © American Institute of Mathematical Sciences.

  20. Spoofing cyber attack detection in probe-based traffic monitoring systems using mixed integer linear programming

    KAUST Repository

    Canepa, Edward S.

    2013-01-01

    Traffic sensing systems rely more and more on user generated (insecure) data, which can pose a security risk whenever the data is used for traffic flow control. In this article, we propose a new formulation for detecting malicious data injection in traffic flow monitoring systems by using the underlying traffic flow model. The state of traffic is modeled by the Lighthill-Whitham- Richards traffic flow model, which is a first order scalar conservation law with concave flux function. Given a set of traffic flow data, we show that the constraints resulting from this partial differential equation are mixed integer linear inequalities for some decision variable. We use this fact to pose the problem of detecting spoofing cyber-attacks in probe-based traffic flow information systems as mixed integer linear feasibility problem. The resulting framework can be used to detect spoofing attacks in real time, or to evaluate the worst-case effects of an attack offline. A numerical implementation is performed on a cyber-attack scenario involving experimental data from the Mobile Century experiment and the Mobile Millennium system currently operational in Northern California. © 2013 IEEE.

  1. An Integer Linear Programming Model for the Radiotherapy Treatment Scheduling Problem

    CERN Document Server

    Burke, Edmund K; Petrovic, Sanja

    2011-01-01

    Radiotherapy represents an important phase of treatment for a large number of cancer patients. It is essential that resources used to deliver this treatment are employed effectively. This paper presents a new integer linear programming model for real-world radiotherapy treatment scheduling and analyses the effectiveness of using this model on a daily basis in a hospital. Experiments are conducted varying the days on which schedules can be created. Results obtained using real-world data from the Nottingham University Hospitals NHS Trust, UK, are presented and show how the proposed model can be used with different policies in order to achieve good quality schedules.

  2. Designing A Nonlinear Integer Programming Model For A Cross-Dock By A Genetic Algorithm

    OpenAIRE

    Bahareh Vaisi; Reza Tavakkoli-Moghaddam

    2015-01-01

    Abstract This paper presents a non-linear integer programming model for a cross-dock problem that considers the total transportation cost of inbound and outbound trucks from an origin to a destination and the total cost of assigning strip and stack doors to trucks based on their number of trips and the distance between doors in cross-dock. In previous studies these two cost-based problems are modeled separately however it is more realistic and practical to use both of them as an integrated cr...

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

    Energy Technology Data Exchange (ETDEWEB)

    Hirata, Yoshito; Aihara, Kazuyuki [Institute of Industrial Science, The University of Tokyo, 4-6-1 Komaba, Meguro-ku, Tokyo 153-8505 (Japan)

    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 is large.

  4. Raw material utilization in slaughterhouses – optimizing expected profit using mixed-integer programming

    DEFF Research Database (Denmark)

    Jensen, Toke Koldborg; Kjærsgaard, Niels Christian

    Slaughterhouses are major players in the pork supply chain, and supply and demand must be matched in order to generate the highest profit. In particular, carcasses must be sorted in order to produce the “right” final products from the “right” carcasses. We develop a mixed-integer programming (MIP) ...... at slaughterhouses. Finally, we comment on the expected effect of variations in the raw material supply and the demand as well as future research concerning joint modelling of supply chain aspects....

  5. A Method of Determination of an Acquisition Program in Order to Maximize the Total Utility Using Linear Programming in Integer Numbers

    Directory of Open Access Journals (Sweden)

    Alin Cristian Ioan

    2010-03-01

    Full Text Available This paper solves in a different way the problem of maximization of the total utility using the linear programming in integer numbers. The author uses the diofantic equations (equations in integers numbers and after a decomposing in different cases, he obtains the maximal utility.

  6. Inexact fuzzy integer chance constraint programming approach for noise control within an urban environment

    Science.gov (United States)

    Huang, Kai; Huang, Gordon; Dai, Liming; Fan, Yurui

    2016-08-01

    This article introduces an inexact fuzzy integer chance constraint programming (IFICCP) approach for identifying noise reduction strategy under uncertainty. The IFICCP method integrates the interval programming and fuzzy chance constraint programming approaches into a framework, which is able to deal with uncertainties expressed as intervals and fuzziness. The proposed IFICCP model can be converted into two deterministic submodels corresponding to the optimistic and pessimistic conditions. The modelling approach is applied to a hypothetical control measure selection problem for noise reduction. Results of the case study indicate that useful solutions for noise control practices can be acquired. Three acceptable noise levels for two communities are considered. For each acceptable noise level, several decision alternatives have been obtained and analysed under different fuzzy confidence levels, which reflect the trade-offs between environmental and economic considerations.

  7. A Generalized Fuzzy Integer Programming Approach for Environmental Management under Uncertainty

    Directory of Open Access Journals (Sweden)

    Y. R. Fan

    2014-01-01

    Full Text Available In this study, a generalized fuzzy integer programming (GFIP method is developed for planning waste allocation and facility expansion under uncertainty. The developed method can (i deal with uncertainties expressed as fuzzy sets with known membership functions regardless of the shapes (linear or nonlinear of these membership functions, (ii allow uncertainties to be directly communicated into the optimization process and the resulting solutions, and (iii reflect dynamics in terms of waste-flow allocation and facility-capacity expansion. A stepwise interactive algorithm (SIA is proposed to solve the GFIP problem and generate solutions expressed as fuzzy sets. The procedures of the SIA method include (i discretizing the membership function grade of fuzzy parameters into a set of α-cut levels; (ii converting the GFIP problem into an inexact mixed-integer linear programming (IMILP problem under each α-cut level; (iii solving the IMILP problem through an interactive algorithm; and (iv approximating the membership function for decision variables through statistical regression methods. The developed GFIP method is applied to a municipal solid waste (MSW management problem to facilitate decision making on waste flow allocation and waste-treatment facilities expansion. The results, which are expressed as discrete or continuous fuzzy sets, can help identify desired alternatives for managing MSW under uncertainty.

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

    Science.gov (United States)

    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.

  9. A Base Integer Programming Model and Benchmark Suite for Liner-Shipping Network Design

    DEFF Research Database (Denmark)

    Brouer, Berit Dangaard; Alvarez, Fernando; Plum, Christian Edinger Munk

    2014-01-01

    sources of liner shipping for OR researchers in general. We describe and analyze the liner-shipping domain applied to network design and present a rich integer programming model based on services that constitute the fixed schedule of a liner shipping company. We prove the liner-shipping network design...... problem to be strongly NP-hard. A benchmark suite of data instances to reflect the business structure of a global liner shipping network is presented. The design of the benchmark suite is discussed in relation to industry standards, business rules, and mathematical programming. The data are based on real......The liner-shipping network design problem is to create a set of nonsimple cyclic sailing routes for a designated fleet of container vessels that jointly transports multiple commodities. The objective is to maximize the revenue of cargo transport while minimizing the costs of operation...

  10. Mixed integer programming improves comprehensibility and plan quality in inverse optimization of prostate HDR-brachytherapy

    CERN Document Server

    Gorissen, Bram L; Hoffmann, Aswin L

    2014-01-01

    Current inverse treatment planning methods that optimize both catheter positions and dwell times in prostate HDR brachytherapy use surrogate linear or quadratic objective functions that have no direct interpretation in terms of dose-volume histogram (DVH) criteria, do not result in an optimum or have long solution times. We decrease the solution time of existing linear and quadratic dose-based programming models (LP and QP, respectively) to allow optimizing over potential catheter positions using mixed integer programming. An additional average speed-up of 75% can be obtained by stopping the solver at an early stage, without deterioration of the plan quality. For a fixed catheter configuration, the dwell time optimization model LP solves to optimality in less than 15 seconds, which confirms earlier results. We propose an iterative procedure for QP that allows to prescribe the target dose as an interval, while retaining independence between the solution time and the number of dose calculation points. This iter...

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

    Science.gov (United States)

    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…

  12. A Mixed Integer Programming Poultry Feed Ration Optimisation Problem Using the Bat Algorithm

    Directory of Open Access Journals (Sweden)

    Godfrey Chagwiza

    2016-01-01

    Full Text Available In this paper, a feed ration problem is presented as a mixed integer programming problem. An attempt to find the optimal quantities of Moringa oleifera inclusion into the poultry feed ration was done and the problem was solved using the Bat algorithm and the Cplex solver. The study used findings of previous research to investigate the effects of Moringa oleifera inclusion in poultry feed ration. The results show that the farmer is likely to gain US$0.89 more if Moringa oleifera is included in the feed ration. Results also show superiority of the Bat algorithm in terms of execution time and number of iterations required to find the optimum solution as compared with the results obtained by the Cplex solver. Results revealed that there is a significant economic benefit of Moringa oleifera inclusion into the poultry feed ration.

  13. An Integer Linear Programming Solution to the Telescope Network Scheduling Problem

    CERN Document Server

    Lampoudi, Sotiria; Eastman, Jason

    2015-01-01

    Telescope networks are gaining traction due to their promise of higher resource utilization than single telescopes and as enablers of novel astronomical observation modes. However, as telescope network sizes increase, the possibility of scheduling them completely or even semi-manually disappears. In an earlier paper, a step towards software telescope scheduling was made with the specification of the Reservation formalism, through the use of which astronomers can express their complex observation needs and preferences. In this paper we build on that work. We present a solution to the discretized version of the problem of scheduling a telescope network. We derive a solvable integer linear programming (ILP) model based on the Reservation formalism. We show computational results verifying its correctness, and confirm that our Gurobi-based implementation can address problems of realistic size. Finally, we extend the ILP model to also handle the novel observation requests that can be specified using the more advanc...

  14. Mixed-Integer Linear Programming Models for Teaching Assistant Assignment and Extensions

    Directory of Open Access Journals (Sweden)

    Xiaobo Qu

    2017-01-01

    Full Text Available In this paper, we develop mixed-integer linear programming models for assigning the most appropriate teaching assistants to the tutorials in a department. The objective is to maximize the number of tutorials that are taught by the most suitable teaching assistants, accounting for the fact that different teaching assistants have different capabilities and each teaching assistant’s teaching load cannot exceed a maximum value. Moreover, with optimization models, the teaching load allocation, a time-consuming process, does not need to be carried out in a manual manner. We have further presented a number of extensions that capture more practical considerations. Extensive numerical experiments show that the optimization models can be solved by an off-the-shelf solver and used by departments in universities.

  15. An integer programming framework for inferring disease complexes from network data

    Science.gov (United States)

    Mazza, Arnon; Klockmeier, Konrad; Wanker, Erich; Sharan, Roded

    2016-01-01

    Motivation: Unraveling the molecular mechanisms that underlie disease calls for methods that go beyond the identification of single causal genes to inferring larger protein assemblies that take part in the disease process. Results: Here, we develop an exact, integer-programming-based method for associating protein complexes with disease. Our approach scores proteins based on their proximity in a protein–protein interaction network to a prior set that is known to be relevant for the studied disease. These scores are combined with interaction information to infer densely interacting protein complexes that are potentially disease-associated. We show that our method outperforms previous ones and leads to predictions that are well supported by current experimental data and literature knowledge. Availability and Implementation: The datasets we used, the executables and the results are available at www.cs.tau.ac.il/roded/disease_complexes.zip Contact: roded@post.tau.ac.il PMID:27307626

  16. Applicability of a Novel Integer Programming Model for Wireless Sensor Networks

    CERN Document Server

    de Aguiar, Alexei Barbosa; Pinheiro, Placido Rogerio; Coelho, Andre L V

    2009-01-01

    This paper presents an applicability analysis over a novel integer programming model devoted to optimize power consumption efficiency in heterogeneous wireless sensor networks. This model is based upon a schedule of sensor allocation plans in multiple time intervals subject to coverage and connectivity constraints. By turning off a specific set of redundant sensors in each time interval, it is possible to reduce the total energy consumption in the network and, at the same time, avoid partitioning the whole network by losing some strategic sensors too prematurely. Since the network is heterogeneous, sensors can sense different phenomena from different demand points, with different sample rates. As the problem instances grows the time spent to the execution turns impracticable.

  17. An integer programming model for gate assignment problem at airline terminals

    Science.gov (United States)

    Chun, Chong Kok; Nordin, Syarifah Zyurina

    2015-05-01

    In this paper, we concentrate on a gate assignment problem (GAP) at the airlines terminal. Our problem is to assign an arrival plane to a suitable gate. There are two considerations needed to take. One of its is passenger walking distance from arrival gate to departure gate while another consideration is the transport baggage distance from one gate to another. Our objective is to minimize the total distance between the gates that related to assign the arrival plane to the suitable gates. An integer linear programming (ILP) model is proposed to solve this gate assignment problem. We also conduct a computational experiment using CPLEX 12.1 solver in AIMMS 3.10 software to analyze the performance of the model. Results of the computational experiments are presented. The efficiency of flights assignment is depends on the ratio of the weight for both total passenger traveling distances and total baggage transport distances.

  18. An integer programming model and benchmark suite for liner shipping network design

    DEFF Research Database (Denmark)

    Løfstedt, Berit; Alvarez, Jose Fernando; Plum, Christian Edinger Munk

    along with a rich integer programming model based on the services, that constitute the fixed schedule of a liner shipping company. The model may be relaxed as well as decomposed. The design of a benchmark suite of data instances to reflect the business structure of a global liner shipping network......Maritime transportation is accountable for 2.7% of the worlds CO2 emissions and the liner shipping industry is committed to a slow steaming policy to provide low cost and environmentally conscious global transport of goods without compromising the level of service. The potential for making cost...... effective and energy efficient liner shipping networks using operations research is huge and neglected. The implementation of logistic planning tools based upon operations research has enhanced performance of both airlines, railways and general transportation companies, but within the field of liner...

  19. Distribution Locational Marginal Pricing for Optimal Electric Vehicle Charging through Chance Constrained Mixed-Integer Programming

    DEFF Research Database (Denmark)

    Liu, Zhaoxi; Wu, Qiuwei; Oren, Shmuel S.

    2016-01-01

    This paper presents a distribution locational marginal pricing (DLMP) method through chance constrained mixed-integer programming designed to alleviate the possible congestion in the future distribution network with high penetration of electric vehicles (EVs). In order to represent the stochastic...... the driving requirement is below the predetermined confidence parameter. The efficacy of the proposed approach was demonstrated by case studies using a 33-bus distribution system of the Bornholm power system and the Danish driving data. The case study results show that the DLMP method through chance...... constrained MIP can successfully alleviate the congestion in the distribution network due to the EV charging while keeping the failure probability of EV charging not meeting driving needs below the predefined confidence....

  20. Regional-scale electric power system planning under uncertainty-A multistage interval-stochastic integer linear programming approach

    Energy Technology Data Exchange (ETDEWEB)

    Li, Y.F. [Energy and Environmental Research Center, North China Electric Power University, Beijing 102206 (China); Huang, G.H., E-mail: gordon.huang@uregina.c [Environmental Systems Engineering Program, Faculty of Engineering, University of Regina, Regina, Saskatchewan, S4S 0A2 (Canada); College of Urban and Environmental Sciences, Peking University, Beijing 100871 (China); Li, Y.P. [College of Urban and Environmental Sciences, Peking University, Beijing 100871 (China); Xu, Y.; Chen, W.T. [Energy and Environmental Research Center, North China Electric Power University, Beijing 102206 (China)

    2010-01-15

    In this study, a multistage interval-stochastic regional-scale energy model (MIS-REM) is developed for supporting electric power system (EPS) planning under uncertainty that is based on a multistage interval-stochastic integer linear programming method. The developed MIS-REM can deal with uncertainties expressed as both probability distributions and interval values existing in energy system planning problems. Moreover, it can reflect dynamic decisions for electricity generation schemes and capacity expansions through transactions at discrete points of a multiple representative scenario set over a multistage context. It can also analyze various energy-policy scenarios that are associated with economic penalties when the regulated targets are violated. A case study is provided for demonstrating the applicability of the developed model, where renewable and non-renewable energy resources, economic concerns, and environmental requirements are integrated into a systematic optimization process. The results obtained are helpful for supporting (a) adjustment or justification of allocation patterns of regional energy resources and services, (b) formulation of local policies regarding energy consumption, economic development, and energy structure, and (c) analysis of interactions among economic cost, environmental requirement, and energy-supply security.

  1. Regional-scale electric power system planning under uncertainty. A multistage interval-stochastic integer linear programming approach

    Energy Technology Data Exchange (ETDEWEB)

    Li, Y.F.; Xu, Y.; Chen, W.T. [Energy and Environmental Research Center, North China Electric Power University, Beijing 102206 (China); Huang, G.H. [Environmental Systems Engineering Program, Faculty of Engineering, University of Regina, Regina, Saskatchewan (Canada); College of Urban and Environmental Sciences, Peking University, Beijing 100871 (China); Li, Y.P. [College of Urban and Environmental Sciences, Peking University, Beijing 100871 (China)

    2010-01-15

    In this study, a multistage interval-stochastic regional-scale energy model (MIS-REM) is developed for supporting electric power system (EPS) planning under uncertainty that is based on a multistage interval-stochastic integer linear programming method. The developed MIS-REM can deal with uncertainties expressed as both probability distributions and interval values existing in energy system planning problems. Moreover, it can reflect dynamic decisions for electricity generation schemes and capacity expansions through transactions at discrete points of a multiple representative scenario set over a multistage context. It can also analyze various energy-policy scenarios that are associated with economic penalties when the regulated targets are violated. A case study is provided for demonstrating the applicability of the developed model, where renewable and non-renewable energy resources, economic concerns, and environmental requirements are integrated into a systematic optimization process. The results obtained are helpful for supporting (a) adjustment or justification of allocation patterns of regional energy resources and services, (b) formulation of local policies regarding energy consumption, economic development, and energy structure, and (c) analysis of interactions among economic cost, environmental requirement, and energy-supply security. (author)

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

    Directory of Open Access Journals (Sweden)

    Dongyul Lee

    2014-01-01

    Full Text Available 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.

  3. Integer-linear-programing optimization in scalable video multicast with adaptive modulation and coding in wireless networks.

    Science.gov (United States)

    Lee, Dongyul; 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.

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

    Science.gov (United States)

    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

  5. A Mixed-Integer Linear Programming approach to wind farm layout and inter-array cable routing

    DEFF Research Database (Denmark)

    Fischetti, Martina; Leth, John-Josef; Borchersen, Anders Bech

    2015-01-01

    A Mixed-Integer Linear Programming (MILP) approach is proposed to optimize the turbine allocation and inter-array offshore cable routing. The two problems are considered with a two steps strategy, solving the layout problem first and then the cable problem. We give an introduction to both problem...

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

    Science.gov (United States)

    1980-05-31

    34 AIIE Transac- tions, Vol. 11, Nc, 1, March 1979, pp. 61-69. (8] Taylor, Bernard and Keown , Arthur J., "A Goal Programming Application of Capital...Programming," OMEGA, Vol. 1, No. 2, April 1973, pp. 193-205. [29] Lee, S. M., and Keown , Arthur J., "Integer Goal Programming Model for Capital...Hadley, G., Linear Algebra, Addison-Wesley Publishing Co., Inc., Reading, MA, 1961. [60] Zuckerman, Martin M., Sets and Transfinite Numbers, Macmillan

  7. Application of mixed-integer linear programming in a car seats assembling process

    Directory of Open Access Journals (Sweden)

    Jorge Iván Perez Rave

    2011-12-01

    Full Text Available In this paper, a decision problem involving a car parts manufacturing company is modeled in order to prepare the company for an increase in demand. Mixed-integer linear programming was used with the following decision variables: creating a second shift, purchasing additional equipment, determining the required work force, and other alternatives involving new manners of work distribution that make it possible to separate certain operations from some workplaces and integrate them into others to minimize production costs. The model was solved using GAMS. The solution consisted of programming 19 workers under a configuration that merges two workplaces and separates some operations from some workplaces. The solution did not involve purchasing additional machinery or creating a second shift. As a result, the manufacturing paradigms that had been valid in the company for over 14 years were broken. This study allowed the company to increase its productivity and obtain significant savings. It also shows the benefits of joint work between academia and companies, and provides useful information for professors, students and engineers regarding production and continuous improvement.

  8. The (parallel) approximability of non-boolean satisfiability problems and restricted integer programming

    Science.gov (United States)

    Serna, Maria; Trevisan, Luca; Xhafa, Fatos

    We present parallel approximation algorithms for maximization problems expressible by integer linear programs of a restricted syntactic form introduced by Barland et al. [BKT96]. One of our motivations was to show whether the approximation results in the framework of Barland et al. holds in the parallel setting. Our results are a confirmation of this, and thus we have a new common framework for both computational settings. Also, we prove almost tight non-approximability results, thus solving a main open question of Barland et al. We obtain the results through the constraint satisfaction problem over multi-valued domains, for which we show non-approximability results and develop parallel approximation algorithms. Our parallel approximation algorithms are based on linear programming and random rounding; they are better than previously known sequential algorithms. The non-approximability results are based on new recent progress in the fields of Probabilistically Checkable Proofs and Multi-Prover One-Round Proof Systems [Raz95, Hås97, AS97, RS97].

  9. Identifying optimal regional solid waste management strategies through an inexact integer programming model containing infinite objectives and constraints.

    Science.gov (United States)

    He, Li; Huang, Guo-He; Zeng, Guang-Ming; Lu, Hong-Wei

    2009-01-01

    The previous inexact mixed-integer linear programming (IMILP) method can only tackle problems with coefficients of the objective function and constraints being crisp intervals, while the existing inexact mixed-integer semi-infinite programming (IMISIP) method can only deal with single-objective programming problems as it merely allows the number of constraints to be infinite. This study proposes, an inexact mixed-integer bi-infinite programming (IMIBIP) method by incorporating the concept of functional intervals into the programming framework. Different from the existing methods, the IMIBIP can tackle the inexact programming problems that contain both infinite objectives and constraints. The developed method is applied to capacity planning of waste management systems under a variety of uncertainties. Four scenarios are considered for comparing the solutions of IMIBIP with those of IMILP. The results indicate that reasonable solutions can be generated by the IMIBIP method. Compared with IMILP, the system cost from IMIBIP would be relatively high since the fluctuating market factors are considered; however, the IMILP solutions are associated with a raised system reliability level and a reduced constraint violation risk level.

  10. Optimal Airport Surface Traffic Planning Using Mixed-Integer Linear Programming

    Directory of Open Access Journals (Sweden)

    P. C. Roling

    2008-01-01

    Full Text Available We describe an ongoing research effort pertaining to the development of a surface traffic automation system that will help controllers to better coordinate surface traffic movements related to arrival and departure traffic. More specifically, we describe the concept for a taxi-planning support tool that aims to optimize the routing and scheduling of airport surface traffic in such a way as to deconflict the taxi plans while optimizing delay, total taxi-time, or some other airport efficiency metric. Certain input parameters related to resource demand, such as the expected landing times and the expected pushback times, are rather difficult to predict accurately. Due to uncertainty in the input data driving the taxi-planning process, the taxi-planning tool is designed such that it produces solutions that are robust to uncertainty. The taxi-planning concept presented herein, which is based on mixed-integer linear programming, is designed such that it is able to adapt to perturbations in these input conditions, as well as to account for failure in the actual execution of surface trajectories. The capabilities of the tool are illustrated in a simple hypothetical airport.

  11. Real-Time Hybrid In-Station Bus Dispatching Strategy Based on Mixed Integer Programming

    Directory of Open Access Journals (Sweden)

    Shi An

    2016-07-01

    Full Text Available The actual bus headway often deviates from the planned departure frequency because of external factors, such as traffic conditions and public transport demand, leading to transit resource waste and reducing the quality of service. In view of the existing shortcomings of the current dispatching strategy, a mixed integer programming model, integrating a bus-holding and stop-skipping strategy, is constructed to improve transit service with a minimum cost. The real-time optimal holding and stop-skipping strategies can be obtained by solving the proposed model using the Lagrangian relaxation algorithm. A numerical example is conducted using real transit GPS (Global Position System and IC (Intelligent Card data in Harbin. The results show that compared to a single control strategy, the proposed hybrid model is a better trade-off between the quality of the transit service and the operation cost. Notably, such a strategy would produce a minimal passengers’ average travel time coefficient. It is a great help for promoting the transit service level and increasing competitiveness.

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

    Science.gov (United States)

    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.

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

    Science.gov (United States)

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

    2016-01-01

    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. PMID:26908654

  14. A mixed integer linear programming model applied in barge planning for Omya

    Directory of Open Access Journals (Sweden)

    David Bredström

    2015-12-01

    Full Text Available This article presents a mathematical model for barge transport planning on the river Rhine, which is part of a decision support system (DSS recently taken into use by the Swiss company Omya. The system is operated by Omya’s regional office in Cologne, Germany, responsible for distribution planning at the regional distribution center (RDC in Moerdijk, the Netherlands. The distribution planning is a vital part of supply chain management of Omya’s production of Norwegian high quality calcium carbonate slurry, supplied to European paper manufacturers. The DSS operates within a vendor managed inventory (VMI setting, where the customer inventories are monitored by Omya, who decides upon the refilling days and quantities delivered by barges. The barge planning problem falls into the category of inventory routing problems (IRP and is further characterized with multiple products, heterogeneous fleet with availability restrictions (the fleet is owned by third party, vehicle compartments, dependency of barge capacity on water-level, multiple customer visits, bounded customer inventories and rolling planning horizon. There are additional modelling details which had to be considered to make it possible to employ the model in practice at a sufficient level of detail. To the best of our knowledge, we have not been able to find similar models covering all these aspects in barge planning. This article presents the developed mixed-integer programming model and discusses practical experience with its solution. Briefly, it also puts the model into the context of the entire business case of value chain optimization in Omya.

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

    Science.gov (United States)

    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.

  16. An integer programming for airplane rounting in the U.S. Center-TRACON

    Directory of Open Access Journals (Sweden)

    Srisawat Supsomboon

    2015-06-01

    Full Text Available Air travel has been a major transportation for commerce and tour in many countries. As the demand of air traffic has been increasing, air traffic management has confronted with poverty of handling the increase of the demand of runway facilities where congestion often takes place. In order to cope with such problems, runway efficiency enhancement or capacity increasing are taken into account. In air traffic management, the effective air space utilization and air control workload management can be improved by the use of many up-to-date technologies in forms of decision support tools. This study developed a computer-aided decision support model in the form of integer programming. The purpose of the model was to allocate airplanes arrival at U.S. Center-TRACON airspace to enter feeder gates and to design optimal routes along the track to runway. Results of optimal path of the airplanes throughout the TRACON air space system which yield a minimum delay were presented.

  17. On the solution of mixed-integer nonlinear programming models for computer aided molecular design.

    Science.gov (United States)

    Ostrovsky, Guennadi M; Achenie, Luke E K; Sinha, Manish

    2002-11-01

    This paper addresses the efficient solution of computer aided molecular design (CAMD) problems, which have been posed as mixed-integer nonlinear programming models. The models of interest are those in which the number of linear constraints far exceeds the number of nonlinear constraints, and with most variables participating in the nonconvex terms. As a result global optimization methods are needed. A branch-and-bound algorithm (BB) is proposed that is specifically tailored to solving such problems. In a conventional BB algorithm, branching is performed on all the search variables that appear in the nonlinear terms. This translates to a large number of node traversals. To overcome this problem, we have proposed a new strategy for branching on a set of linear branchingfunctions, which depend linearly on the search variables. This leads to a significant reduction in the dimensionality of the search space. The construction of linear underestimators for a class of functions is also presented. The CAMD problem that is considered is the design of optimal solvents to be used as cleaning agents in lithographic printing.

  18. A new stochastic mixed integer programming to design integrated cellular manufacturing system: A supply chain framework

    Directory of Open Access Journals (Sweden)

    Vahid Reza Ghezavati

    2011-01-01

    Full Text Available This research defines a new application of mathematical modeling to design a cellular manufacturing system integrated with group scheduling and layout aspects in an uncertain decision space under a supply chain characteristics. The aim is to present a mixed integer programming (MIP which optimizes cell formation, scheduling and layout decisions, concurrently where the suppliers are required to operate exceptional products. For this purpose, the time in which parts need to be operated on machines and also products' demand are uncertain and explained by set of scenarios. This model tries to optimize expected holding cost and the costs regarded to the suppliers network in a supply chain in order to outsource exceptional operations. Scheduling decisions in a cellular manufacturing framework is treated as group scheduling problem, which assumes that all parts in a part group are operated in the same cell and no inter-cellular transfer is required. An efficient hybrid method made of genetic algorithm (GA and simulated annealing (SA will be proposed to solve such a complex problem under an optimization rule as a sub-ordinate section. This integrative combination algorithm is compared with global solutions and also, a benchmark heuristic algorithm introduced in the literature. Finally, performance of the algorithm will be verified through some test problems.

  19. An efficient particle swarm approach for mixed-integer programming in reliability-redundancy optimization applications

    Energy Technology Data Exchange (ETDEWEB)

    Santos Coelho, Leandro dos [Industrial and Systems Engineering Graduate Program, LAS/PPGEPS, Pontifical Catholic University of Parana, PUCPR, Imaculada Conceicao, 1155, 80215-901 Curitiba, Parana (Brazil)], E-mail: leandro.coelho@pucpr.br

    2009-04-15

    The reliability-redundancy optimization problems can involve the selection of components with multiple choices and redundancy levels that produce maximum benefits, and are subject to the cost, weight, and volume constraints. Many classical mathematical methods have failed in handling nonconvexities and nonsmoothness in reliability-redundancy optimization problems. As an alternative to the classical optimization approaches, the meta-heuristics have been given much attention by many researchers due to their ability to find an almost global optimal solutions. One of these meta-heuristics is the particle swarm optimization (PSO). PSO is a population-based heuristic optimization technique inspired by social behavior of bird flocking and fish schooling. This paper presents an efficient PSO algorithm based on Gaussian distribution and chaotic sequence (PSO-GC) to solve the reliability-redundancy optimization problems. In this context, two examples in reliability-redundancy design problems are evaluated. Simulation results demonstrate that the proposed PSO-GC is a promising optimization technique. PSO-GC performs well for the two examples of mixed-integer programming in reliability-redundancy applications considered in this paper. The solutions obtained by the PSO-GC are better than the previously best-known solutions available in the recent literature.

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

    Science.gov (United States)

    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.

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

    Science.gov (United States)

    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.

  2. Integer Linear Programming for Constrained Multi-Aspect Committee Review Assignment.

    Science.gov (United States)

    Karimzadehgan, Maryam; Zhai, Chengxiang

    2012-07-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.

  3. Designing A Nonlinear Integer Programming Model For A Cross-Dock By A Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Bahareh Vaisi

    2015-03-01

    Full Text Available Abstract This paper presents a non-linear integer programming model for a cross-dock problem that considers the total transportation cost of inbound and outbound trucks from an origin to a destination and the total cost of assigning strip and stack doors to trucks based on their number of trips and the distance between doors in cross-dock. In previous studies these two cost-based problems are modeled separately however it is more realistic and practical to use both of them as an integrated cross-docking model. Additionally this model is solved for a randomly generated numerical example with three suppliers and two customers by the use of a genetic algorithm. By comparing two different parameter levels i.e. low and high numbers of populations the optimum solution is obtained considering a high level population size. A number of strip and stack doors are equal to a number of inbound and outbound trucks in the same sequence as 4 and 6 respectively. Finally the conclusion is presented.

  4. Detecting and removing inconsistencies between experimental data and signaling network topologies using integer linear programming on interaction graphs.

    Science.gov (United States)

    Melas, Ioannis N; Samaga, Regina; Alexopoulos, Leonidas G; Klamt, Steffen

    2013-01-01

    Cross-referencing experimental data with our current knowledge of signaling network topologies is one central goal of mathematical modeling of cellular signal transduction networks. We present a new methodology for data-driven interrogation and training of signaling networks. While most published methods for signaling network inference operate on Bayesian, Boolean, or ODE models, our approach uses integer linear programming (ILP) on interaction graphs to encode constraints on the qualitative behavior of the nodes. These constraints are posed by the network topology and their formulation as ILP allows us to predict the possible qualitative changes (up, down, no effect) of the activation levels of the nodes for a given stimulus. We provide four basic operations to detect and remove inconsistencies between measurements and predicted behavior: (i) find a topology-consistent explanation for responses of signaling nodes measured in a stimulus-response experiment (if none exists, find the closest explanation); (ii) determine a minimal set of nodes that need to be corrected to make an inconsistent scenario consistent; (iii) determine the optimal subgraph of the given network topology which can best reflect measurements from a set of experimental scenarios; (iv) find possibly missing edges that would improve the consistency of the graph with respect to a set of experimental scenarios the most. We demonstrate the applicability of the proposed approach by interrogating a manually curated interaction graph model of EGFR/ErbB signaling against a library of high-throughput phosphoproteomic data measured in primary hepatocytes. Our methods detect interactions that are likely to be inactive in hepatocytes and provide suggestions for new interactions that, if included, would significantly improve the goodness of fit. Our framework is highly flexible and the underlying model requires only easily accessible biological knowledge. All related algorithms were implemented in a freely

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2017-03-27

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

  6. Integer anatomy

    Energy Technology Data Exchange (ETDEWEB)

    Doolittle, R. [ONR, Arlington, VA (United States)

    1994-11-15

    The title integer anatomy is intended to convey the idea of a systematic method for displaying the prime decomposition of the integers. Just as the biological study of anatomy does not teach us all things about behavior of species neither would we expect to learn everything about the number theory from a study of its anatomy. But, some number-theoretic theorems are illustrated by inspection of integer anatomy, which tend to validate the underlying structure and the form as developed and displayed in this treatise. The first statement to be made in this development is: the way structure of the natural numbers is displayed depends upon the allowed operations.

  7. Structural design using equilibrium programming formulations

    Science.gov (United States)

    Scotti, Stephen J.

    1995-06-01

    Solutions to increasingly larger structural optimization problems are desired. However, computational resources are strained to meet this need. New methods will be required to solve increasingly larger problems. The present approaches to solving large-scale problems involve approximations for the constraints of structural optimization problems and/or decomposition of the problem into multiple subproblems that can be solved in parallel. An area of game theory, equilibrium programming (also known as noncooperative game theory), can be used to unify these existing approaches from a theoretical point of view (considering the existence and optimality of solutions), and be used as a framework for the development of new methods for solving large-scale optimization problems. Equilibrium programming theory is described, and existing design techniques such as fully stressed design and constraint approximations are shown to fit within its framework. Two new structural design formulations are also derived. The first new formulation is another approximation technique which is a general updating scheme for the sensitivity derivatives of design constraints. The second new formulation uses a substructure-based decomposition of the structure for analysis and sensitivity calculations. Significant computational benefits of the new formulations compared with a conventional method are demonstrated.

  8. Mixed-integer programming methods for transportation and power generation problems

    Science.gov (United States)

    Damci Kurt, Pelin

    This dissertation conducts theoretical and computational research to solve challenging problems in application areas such as supply chain and power systems. The first part of the dissertation studies a transportation problem with market choice (TPMC) which is a variant of the classical transportation problem in which suppliers with limited capacities have a choice of which demands (markets) to satisfy. We show that TPMC is strongly NP-complete. We consider a version of the problem with a service level constraint on the maximum number of markets that can be rejected and show that if the original problem is polynomial, its cardinality-constrained version is also polynomial. We propose valid inequalities for mixed-integer cover and knapsack sets with variable upper bound constraints, which appear as substructures of TPMC and use them in a branch-and-cut algorithm to solve this problem. The second part of this dissertation studies a unit commitment (UC) problem in which the goal is to minimize the operational cost of power generators over a time period subject to physical constraints while satisfying demand. We provide several exponential classes of multi-period ramping and multi-period variable upper bound inequalities. We prove the strength of these inequalities and describe polynomial-time separation algorithms. Computational results show the effectiveness of the proposed inequalities when used as cuts in a branch-and-cut algorithm to solve the UC problem. The last part of this dissertation investigates the effects of uncertain wind power on the UC problem. A two-stage robust model and a three-stage stochastic program are compared.

  9. Automated integer programming based separation of arteries and veins from thoracic CT images.

    Science.gov (United States)

    Payer, Christian; Pienn, Michael; Bálint, Zoltán; Shekhovtsov, Alexander; Talakic, Emina; Nagy, Eszter; Olschewski, Andrea; Olschewski, Horst; Urschler, Martin

    2016-12-01

    Automated computer-aided analysis of lung vessels has shown to yield promising results for non-invasive diagnosis of lung diseases. To detect vascular changes which affect pulmonary arteries and veins differently, both compartments need to be identified. We present a novel, fully automatic method that separates arteries and veins in thoracic computed tomography images, by combining local as well as global properties of pulmonary vessels. We split the problem into two parts: the extraction of multiple distinct vessel subtrees, and their subsequent labeling into arteries and veins. Subtree extraction is performed with an integer program (IP), based on local vessel geometry. As naively solving this IP is time-consuming, we show how to drastically reduce computational effort by reformulating it as a Markov Random Field. Afterwards, each subtree is labeled as either arterial or venous by a second IP, using two anatomical properties of pulmonary vessels: the uniform distribution of arteries and veins, and the parallel configuration and close proximity of arteries and bronchi. We evaluate algorithm performance by comparing the results with 25 voxel-based manual reference segmentations. On this dataset, we show good performance of the subtree extraction, consisting of very few non-vascular structures (median value: 0.9%) and merged subtrees (median value: 0.6%). The resulting separation of arteries and veins achieves a median voxel-based overlap of 96.3% with the manual reference segmentations, outperforming a state-of-the-art interactive method. In conclusion, our novel approach provides an opportunity to become an integral part of computer aided pulmonary diagnosis, where artery/vein separation is important.

  10. Planar multibody dynamics formulation, programming and applications

    CERN Document Server

    Nikravesh, Parviz E

    2007-01-01

    Introduction Multibody Mechanical Systems Types of Analyses Methods of Formulation Computer Programming Application Examples Unit System Remarks Preliminaries Reference Axes Scalars and Vectors Matrices Vector, Array, and Matrix Differentiation Equations and Expressions Remarks Problems Fundamentals of Kinematics A Particle Kinematics of a Rigid Body Definitions Remarks Problems Fundamentals of Dynamics Newton's Laws of Motion Dynamics of a Body Force Elements Applied Forces Reaction Force Remarks Problems Point-Coordinates: Kinematics Multipoint

  11. An algorithm for the construction of convex hulls in simple integer recourse programming

    NARCIS (Netherlands)

    Klein Haneveld, W.K.; Stougie, L.; van der Vlerk, M.H.

    1996-01-01

    We consider the objective function of a simple integer recourse problem with fixed technology matrix and discretely distributed right-hand sides. Exploiting the special structure of this problem, we devise an algorithm that determines the convex hull of this function efficiently. The results are imp

  12. A Branch and Bound Algorithm for a Class of Biobjective Mixed Integer Programs

    DEFF Research Database (Denmark)

    Stidsen, Thomas Riis; Andersen, Kim Allan; Dammann, Bernd

    2014-01-01

    Pareto-optimal front). In this paper, we first give a survey of the newly developed branch and bound methods for solving MOMIP problems. After that, we propose a new branch and bound method for solving a subclass of MOMIP problems, where only two objectives are allowed, the integer variables are binary...

  13. A Mixed-Integer Linear Programming approach to wind farm layout and inter-array cable routing

    DEFF Research Database (Denmark)

    Fischetti, Martina; Leth, John-Josef; Borchersen, Anders Bech

    2015-01-01

    A Mixed-Integer Linear Programming (MILP) approach is proposed to optimize the turbine allocation and inter-array offshore cable routing. The two problems are considered with a two steps strategy, solving the layout problem first and then the cable problem. We give an introduction to both problems...... and present the MILP models we developed to solve them. To deal with interference in the onshore cases, we propose an adaptation of the standard Jensen’s model, suitable for 3D cases. A simple Stochastic Programming variant of our model allows us to consider different wind scenarios in the optimization...

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

    Science.gov (United States)

    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.

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

    Science.gov (United States)

    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.

  16. A Comparison of Multi-Parametric Programming, Mixed-Integer Programming, Gradient Descent Based, and the Embedding Approach on Four Published Hybrid Optimal Control Examples

    CERN Document Server

    Meyer, Richard; DeCarlo, Raymond A

    2012-01-01

    This paper compares the embedding approach for solving hybrid optimal control problems to multi-parameter programming, mixed-integer programming, and gradient-descent based methods in the context of four published examples. The four examples include a spring-mass system, moving-target tracking for a mobile robot, two-tank filling, and a DC-DC boost converter. Numerical advantages of the embedding approach are set forth and validated for each example: significantly faster solution time, no ad hoc assumptions (such as predetermined mode sequences) or control models, lower performance index costs, and algorithm convergence when other methods fail. Specific (theoretical) advantages of the embedding approach over the other methods are also described: guaranteed existence of a solution under mild conditions, convexity of the embedded optimization problem solvable with traditional techniques such as sequential quadratic programming with no need for any mixed-integer programming, applicability to nonlinear systems, e...

  17. A Stochastic Integer Programming Model for Minimizing Cost in the Use of Rain Water Collectors for Firefighting

    Directory of Open Access Journals (Sweden)

    Luis A. Rivera-Morales

    2014-01-01

    Full Text Available In this paper we propose a stochastic integer programming optimization model to determine the optimal location and number of rain water collectors (RWCs for forest firefighting. The objective is to minimize expected total cost to control forest fires. The model is tested using a real case and several additional realistic scenarios. The impact on the solution of varying the limit on the number of RWCs, the RWC water capacity, the aircraft capacity, the water demands, and the aircraft operating cost is explored. Some observations are that the objective value improves with larger RWCs and with the use of aircraft with greater capacity.

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

    Science.gov (United States)

    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.

  19. Exact solutions to robust control problems involving scalar hyperbolic conservation laws using Mixed Integer Linear Programming

    KAUST Repository

    Li, Yanning

    2013-10-01

    This article presents a new robust control framework for transportation problems in which the state is modeled by a first order scalar conservation law. Using an equivalent formulation based on a Hamilton-Jacobi equation, we pose the problem of controlling the state of the system on a network link, using boundary flow control, as a Linear Program. Unlike many previously investigated transportation control schemes, this method yields a globally optimal solution and is capable of handling shocks (i.e. discontinuities in the state of the system). We also demonstrate that the same framework can handle robust control problems, in which the uncontrollable components of the initial and boundary conditions are encoded in intervals on the right hand side of inequalities in the linear program. The lower bound of the interval which defines the smallest feasible solution set is used to solve the robust LP (or MILP if the objective function depends on boolean variables). Since this framework leverages the intrinsic properties of the Hamilton-Jacobi equation used to model the state of the system, it is extremely fast. Several examples are given to demonstrate the performance of the robust control solution and the trade-off between the robustness and the optimality. © 2013 IEEE.

  20. Integer programming-based method for designing synthetic metabolic networks by Minimum Reaction Insertion in a Boolean model.

    Directory of Open Access Journals (Sweden)

    Wei Lu

    Full Text Available In this paper, we consider the Minimum Reaction Insertion (MRI problem for finding the minimum number of additional reactions from a reference metabolic network to a host metabolic network so that a target compound becomes producible in the revised host metabolic network in a Boolean model. Although a similar problem for larger networks is solvable in a flux balance analysis (FBA-based model, the solution of the FBA-based model tends to include more reactions than that of the Boolean model. However, solving MRI using the Boolean model is computationally more expensive than using the FBA-based model since the Boolean model needs more integer variables. Therefore, in this study, to solve MRI for larger networks in the Boolean model, we have developed an efficient Integer Programming formalization method in which the number of integer variables is reduced by the notion of feedback vertex set and minimal valid assignment. As a result of computer experiments conducted using the data of metabolic networks of E. coli and reference networks downloaded from the Kyoto Encyclopedia of Genes and Genomes (KEGG database, we have found that the developed method can appropriately solve MRI in the Boolean model and is applicable to large scale-networks for which an exhaustive search does not work. We have also compared the developed method with the existing connectivity-based methods and FBA-based methods, and show the difference between the solutions of our method and the existing methods. A theoretical analysis of MRI is also conducted, and the NP-completeness of MRI is proved in the Boolean model. Our developed software is available at "http://sunflower.kuicr.kyoto-u.ac.jp/~rogi/minRect/minRect.html."

  1. Integer Programming-Based Method for Designing Synthetic Metabolic Networks by Minimum Reaction Insertion in a Boolean Model

    Science.gov (United States)

    Song, Jiangning; Akutsu, Tatsuya

    2014-01-01

    In this paper, we consider the Minimum Reaction Insertion (MRI) problem for finding the minimum number of additional reactions from a reference metabolic network to a host metabolic network so that a target compound becomes producible in the revised host metabolic network in a Boolean model. Although a similar problem for larger networks is solvable in a flux balance analysis (FBA)-based model, the solution of the FBA-based model tends to include more reactions than that of the Boolean model. However, solving MRI using the Boolean model is computationally more expensive than using the FBA-based model since the Boolean model needs more integer variables. Therefore, in this study, to solve MRI for larger networks in the Boolean model, we have developed an efficient Integer Programming formalization method in which the number of integer variables is reduced by the notion of feedback vertex set and minimal valid assignment. As a result of computer experiments conducted using the data of metabolic networks of E. coli and reference networks downloaded from the Kyoto Encyclopedia of Genes and Genomes (KEGG) database, we have found that the developed method can appropriately solve MRI in the Boolean model and is applicable to large scale-networks for which an exhaustive search does not work. We have also compared the developed method with the existing connectivity-based methods and FBA-based methods, and show the difference between the solutions of our method and the existing methods. A theoretical analysis of MRI is also conducted, and the NP-completeness of MRI is proved in the Boolean model. Our developed software is available at “http://sunflower.kuicr.kyoto-u.ac.jp/~rogi/minRect/minRect.html.” PMID:24651476

  2. Integer programming-based method for designing synthetic metabolic networks by Minimum Reaction Insertion in a Boolean model.

    Science.gov (United States)

    Lu, Wei; Tamura, Takeyuki; Song, Jiangning; Akutsu, Tatsuya

    2014-01-01

    In this paper, we consider the Minimum Reaction Insertion (MRI) problem for finding the minimum number of additional reactions from a reference metabolic network to a host metabolic network so that a target compound becomes producible in the revised host metabolic network in a Boolean model. Although a similar problem for larger networks is solvable in a flux balance analysis (FBA)-based model, the solution of the FBA-based model tends to include more reactions than that of the Boolean model. However, solving MRI using the Boolean model is computationally more expensive than using the FBA-based model since the Boolean model needs more integer variables. Therefore, in this study, to solve MRI for larger networks in the Boolean model, we have developed an efficient Integer Programming formalization method in which the number of integer variables is reduced by the notion of feedback vertex set and minimal valid assignment. As a result of computer experiments conducted using the data of metabolic networks of E. coli and reference networks downloaded from the Kyoto Encyclopedia of Genes and Genomes (KEGG) database, we have found that the developed method can appropriately solve MRI in the Boolean model and is applicable to large scale-networks for which an exhaustive search does not work. We have also compared the developed method with the existing connectivity-based methods and FBA-based methods, and show the difference between the solutions of our method and the existing methods. A theoretical analysis of MRI is also conducted, and the NP-completeness of MRI is proved in the Boolean model. Our developed software is available at "http://sunflower.kuicr.kyoto-u.ac.jp/~rogi/minRect/minRect.html."

  3. An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming

    Science.gov (United States)

    Buchheim, Christoph; Caprara, Alberto; Lodi, Andrea

    We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumeration tree, corresponding to the fixing of a subset of the variables, a lower bound is given by the continuous minimum of the restricted objective function. We improve this bound by exploiting the integrality of the variables using suitably-defined lattice-free ellipsoids. Experiments show that our approach is very fast on both unconstrained problems and problems with box constraints. The main reason is that all expensive calculations can be done in a preprocessing phase, while a single node in the enumeration tree can be processed in linear time in the problem dimension.

  4. Solving a mixed-integer linear programming model for a multi-skilled project scheduling problem by simulated annealing

    Directory of Open Access Journals (Sweden)

    H Kazemipoor

    2012-04-01

    Full Text Available A multi-skilled project scheduling problem (MSPSP has been generally presented to schedule a project with staff members as resources. Each activity in project network requires different skills and also staff members have different skills, too. This causes the MSPSP becomes a special type of a multi-mode resource-constrained project scheduling problem (MM-RCPSP with a huge number of modes. Given the importance of this issue, in this paper, a mixed integer linear programming for the MSPSP is presented. Due to the complexity of the problem, a meta-heuristic algorithm is proposed in order to find near optimal solutions. To validate performance of the algorithm, results are compared against exact solutions solved by the LINGO solver. The results are promising and show that optimal or near-optimal solutions are derived for small instances and good solutions for larger instances in reasonable time.

  5. A Green Mixed Integer Linear Programming Model for Optimization of Byproduct Gases in Iron and Steel Industry

    Institute of Scientific and Technical Information of China (English)

    Hai-ning KONG

    2015-01-01

    Byproduct gas is an important secondary energy in iron and steel industry, and its optimization is vital to cost reduction. With the development of iron and steel industry to be more eco-friendly, it is necessary to construct an integrated optimized system, taking economics, energy consumption and environment into consideration. Therefore, the environmental cost caused by pollutants discharge should be factored in total cost when optimizing byproduct gas distribution. A green mixed integer linear programming (MILP) model for the optimization of byproduct gases was established to reduce total cost, including both operation cost and environmental cost. The operation cost included penalty for gas deviation, costs of fuel and water consumption, holder booster trip penalty, and so forth; while the environmental cost consisted of penalties for both direct and indirect pollutants discharge. Case study showed that the proposed model brought an optimum solution and 2.2% of the total cost could be reduced compared with previous one.

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

    Science.gov (United States)

    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.

  7. Integer Quadratic Quasi-polyhedra

    Science.gov (United States)

    Letchford, Adam N.

    This paper introduces two fundamental families of 'quasi-polyhedra' - polyhedra with a countably infinite number of facets - that arise in the context of integer quadratic programming. It is shown that any integer quadratic program can be reduced to the minimisation of a linear function over a quasi-polyhedron in the first family. Some fundamental properties of the quasi-polyhedra are derived, along with connections to some other well-studied convex sets. Several classes of facet-inducing inequalities are also derived. Finally, extensions to the mixed-integer case are briefly examined.

  8. Thermodynamic design of a cascade refrigeration system of liquefied natural gas by applying mixed integer non-linear programming

    Institute of Scientific and Technical Information of China (English)

    Meysam Kamalinejad; Majid Amidpour; S.M. Mousavi Naeynian

    2015-01-01

    Liquefied natural gas (LNG) is the most economical way of transporting natural gas (NG) over long distances. Liq-uefaction of NG using vapor compression refrigeration system requires high operating and capital cost. Due to lack of systematic design methods for multistage refrigeration cycles, conventional approaches to determine op-timal cycle are largely trial-and-error. In this paper a novel mixed integer non-linear programming (MINLP) model is introduced to select optimal synthesis of refrigeration systems to reduce both operating and capital costs of an LNG plant. Better conceptual understanding of design improvement is illustrated on composite curve (CC) and exergetic grand composite curve (EGCC) of pinch analysis diagrams. In this method a superstruc-ture representation of complex refrigeration system is developed to select and optimize key decision variables in refrigeration cycles (i.e. partition temperature, compression configuration, refrigeration features, refrigerant flow rate and economic trade-off). Based on this method a program (LNG-Pro) is developed which integrates VBA, Refprop and Excel MINLP Solver to automate the methodology. Design procedure is applied on a sample LNG plant to illustrate advantages of using this method which shows a 3.3% reduction in total shaft work consumption.

  9. Minimum-time control of systems with Coloumb friction: Near global optima via mixed integer linear programming

    Energy Technology Data Exchange (ETDEWEB)

    DRIESSEN,BRIAN; SADEGH,NADER

    2000-04-25

    This work presents a method of finding near global optima to minimum-time trajectory generation problem for systems that would be linear if it were not for the presence of Coloumb friction. The required final state of the system is assumed to be maintainable by the system, and the input bounds are assumed to be large enough so that they can overcome the maximum static Coloumb friction force. Other than the previous work for generating minimum-time trajectories for non redundant robotic manipulators for which the path in joint space is already specified, this work represents, to the best of the authors' knowledge, the first approach for generating near global optima for minimum-time problems involving a nonlinear class of dynamic systems. The reason the optima generated are near global optima instead of exactly global optima is due to a discrete-time approximation of the system (which is usually used anyway to simulate such a system numerically). The method closely resembles previous methods for generating minimum-time trajectories for linear systems, where the core operation is the solution of a Phase I linear programming problem. For the nonlinear systems considered herein, the core operation is instead the solution of a mixed integer linear programming problem.

  10. Modelado del Transporte de Distribución Mediante Programación Lineal Entera An Optimization Model of Distribution Transport using Integer Linear Programming

    Directory of Open Access Journals (Sweden)

    L. Ferrer

    2004-01-01

    Full Text Available En este artículo se presenta un modelo de transporte de distribución usando programación lineal. El proceso global de distribución se considera dividido en sucesivos niveles entre la empresa y sus clientes. En cada nivel se distinguen unidades de origen-destino, entre un origen y varios destinos, con transporte directo y con ventanas en las fechas de entrega de los pedidos a transportar. La programación de la distribución se realiza en cada unidad, mediante programación lineal entera, considerando en la formulación flota limitada de vehículos y flota ilimitada. La programación global se obtiene como superposición de las programaciones de todas las unidades origen-destino. Para validar el modelo se han utilizado los datos proporcionados por una empresa del sector textil que cumple las características requeridas. Se concluye que el modelo presentado, resulta ser adecuado para modelar las empresas caracterizadas y ha permitido diseñar e implementar un procedimiento exacto para la programación de la distribución del producto de la empresaThis article presents a model of distribution transport using linear programming. The overall distribution process is considered to be divided into successive levels between the company and its clients. Origin-destination units are distinguished at each level between an origin and various destinations, with direct transport and with windows in the delivery dates of the orders to be transported. The distribution programming is carried out in each unit through integer linear programming considering in the formulation both limited and unlimited fleets of vehicles. The overall programming is obtained as a superposition of the programming of all the origin-destination units. Validation of the model was carried out using data obtained from a textile company having the required characteristics. It is concluded that the model presented is useful in modeling the companies described, and has permitted the

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

    Science.gov (United States)

    2006-01-01

    with time windows (Desrosiers et al. [26], Ribeiro and Soumis [46]) The vehicle routing problem with time windows (VRPTW) is one important exemplar from...procedures for solving mixed-variables programming problems. Numerische Mathematik 4, 238–252 (1962) 10. Bertsimas, D.J.: A vehicle routing problem with...Oper. Res. 45, 649–661 (1997) 24. Desrochers, M., Desrosiers, J., Solomon, M.: 1992. A new optimization algorithm for the vehicle routing problem with

  12. NVR-BIP: Nuclear Vector Replacement using Binary Integer Programming for NMR Structure-Based Assignments.

    Science.gov (United States)

    Apaydin, Mehmet Serkan; Çatay, Bülent; Patrick, Nicholas; Donald, Bruce R

    2011-05-01

    Nuclear magnetic resonance (NMR) spectroscopy is an important experimental technique that allows one to study protein structure and dynamics in solution. An important bottleneck in NMR protein structure determination is the assignment of NMR peaks to the corresponding nuclei. Structure-based assignment (SBA) aims to solve this problem with the help of a template protein which is homologous to the target and has applications in the study of structure-activity relationship, protein-protein and protein-ligand interactions. We formulate SBA as a linear assignment problem with additional nuclear overhauser effect constraints, which can be solved within nuclear vector replacement's (NVR) framework (Langmead, C., Yan, A., Lilien, R., Wang, L. and Donald, B. (2003) A Polynomial-Time Nuclear Vector Replacement Algorithm for Automated NMR Resonance Assignments. Proc. the 7th Annual Int. Conf. Research in Computational Molecular Biology (RECOMB), Berlin, Germany, April 10-13, pp. 176-187. ACM Press, New York, NY. J. Comp. Bio., (2004), 11, pp. 277-298; Langmead, C. and Donald, B. (2004) An expectation/maximization nuclear vector replacement algorithm for automated NMR resonance assignments. J. Biomol. NMR, 29, 111-138). Our approach uses NVR's scoring function and data types and also gives the option of using CH and NH residual dipolar coupling (RDCs), instead of NH RDCs which NVR requires. We test our technique on NVR's data set as well as on four new proteins. Our results are comparable to NVR's assignment accuracy on NVR's test set, but higher on novel proteins. Our approach allows partial assignments. It is also complete and can return the optimum as well as near-optimum assignments. Furthermore, it allows us to analyze the information content of each data type and is easily extendable to accept new forms of input data, such as additional RDCs.

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

    Science.gov (United States)

    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.

  14. Proposing a New Approach for Supplier Selection Based on Kraljic’s Model Using FMEA and Integer Linear Programming

    Directory of Open Access Journals (Sweden)

    S. Mohammad Arabzad

    2012-06-01

    Full Text Available In recent years, numerous methods have been proposed to deal with supplier evaluation and selection problem, but a point which has been usually neglected by researchers is the role of purchasing items. The aim of this paper is to propose an integrated approach to select suppliers and allocate orders on the basis of the nature of the purchasing items which means that this issue plays an important role in supplier selection and order allocation. Therefore, items are first categorized according to the Kraljic’s model by the use of FMEA technique. Then, suppliers are categorized and evaluated in four phases with respect to different types of purchasing items (Strategic, Bottleneck, Leverage and Routine. Finally, an integer linear programming is utilized to allocate purchasing orders to suppliers. Furthermore, an empirical example is conducted to illustrate the stage of proposed approach. Results imply that ranking of suppliers and allocation of purchasing items based on the nature of purchasing items will create more capabilities in managing purchasing items and suppliers .

  15. Optimizing a multi-echelon supply chain network flow using nonlinear fuzzy multi-objective integer programming: Genetic algorithm approach

    Directory of Open Access Journals (Sweden)

    Mohammad Ali Afshari

    2012-10-01

    Full Text Available The aim of this paper is to present mathematical models optimizing all materials flows in supply chain. In this research a fuzzy multi-objective nonlinear mixed- integer programming model with piecewise linear membership function is applied to design a multi echelon supply chain network (SCN by considering total transportation costs and capacities of all echelons with fuzzy objectives. The model that is proposed in this study has 4 fuzzy functions. The first function is minimizing the total transportation costs between all echelons (suppliers, factories, distribution centers (DCs and customers. The second one is minimizing holding and ordering cost on DCs. The third objective is minimizing the unnecessary and unused capacity of factories and DCs via decreasing variance of transported amounts between echelons. The forth is minimizing the number of total vehicles that ship the materials and products along with SCN. For solving such a problem, as nodes increases in SCN, the traditional method does not have ability to solve large scale problem. So, we applied a Meta heuristic method called Genetic Algorithm. The numerical example is real world applied and compared the results with each other demonstrate the feasibility of applying the proposed model to given problem, and also its advantages are discussed.

  16. Motion- and Communication-Planning of Unmanned Aerial Vehicles in Delay Tolerant Network using Mixed-Integer Linear Programming

    Directory of Open Access Journals (Sweden)

    Esten I. Grøtli

    2016-04-01

    Full Text Available Large amounts of data are typically generated in applications such as surveillance of power lines and railways, inspection of gas pipes, and security surveillance. In the latter application it is a necessity that the data is transmitted to the control centre ``on-the-fly'' for analysis. Also missions related to other applications would greatly benefit from near real-time analysis and operator interaction based on captured data. This is the motivation behind this paper on coarse offline motion- and communication-planning for cooperating Unmanned Aerial Vehicles (UAVs. A Mixed-Integer Linear Programming (MILP problem is defined in order to solve the surveillance mission. To efficiently transmit the data back to the base station the vehicles are allowed to store data for later transmission and transmit via other vehicles, in addition to direct transmission. The paths obtained by solving the optimization problem are analyzed using a realistic radio propagation path loss simulator. If the radio propagation path loss exceeds the maximum design criterion the optimization problem is solved again with a stricter communication constraint, and the procedure is continued in an iterative manner until the criterion is met. The proposed algorithm is supported by simulations showing the resulting paths and communication topologies for different choices of delay tolerance.

  17. Treatment planning for brachytherapy: an integer programming model, two computational approaches and experiments with permanent prostate implant planning.

    Science.gov (United States)

    Lee, E K; Gallagher, R J; Silvern, D; Wuu, C S; Zaider, M

    1999-01-01

    An integer linear programming model is proposed as a framework for optimizing seed placement and dose distribution in brachytherapy treatment planning. The basic model involves using 0/1 indicator variables to describe the placement or non-placement of seeds in a prespecified three-dimensional grid of potential locations. The dose delivered to each point in a discretized representation of the diseased organ and neighbouring healthy tissue can then be modelled as a linear combination of the indicator variables. A system of linear constraints is imposed to attempt to keep the dose level at each point to within specified target bounds. Since it is physically impossible to satisfy all constraints simultaneously, each constraint uses a variable to either record when the target dose level is achieved, or to record the deviation from the desired level. These additional variables are embedded into an objective function to be optimized. Variations on this model are discussed and two computational approaches--a branch-and-bound algorithm and a genetic algorithm--for finding 'optimal' seed placements are described. Results of computational experiments on a collection of prostate cancer cases are reported. The results indicate that both optimization algorithms are capable of producing good solutions within 5 to 15 min, and that small variations in model parameters can have a measurable effect on the dose distribution of the resulting plans.

  18. A Continuous Formulation for Logical Decisions in Differential Algebraic Systems using Mathematical Programs with Complementarity Constraints

    Directory of Open Access Journals (Sweden)

    Kody M. Powell

    2016-03-01

    Full Text Available This work presents a methodology to represent logical decisions in differential algebraic equation simulation and constrained optimization problems using a set of continuous algebraic equations. The formulations may be used when state variables trigger a change in process dynamics, and introduces a pseudo-binary decision variable, which is continuous, but should only have valid solutions at values of either zero or one within a finite time horizon. This formulation enables dynamic optimization problems with logical disjunctions to be solved by simultaneous solution methods without using methods such as mixed integer programming. Several case studies are given to illustrate the value of this methodology including nonlinear model predictive control of a chemical reactor using a surge tank with overflow to buffer disturbances in feed flow rate. Although this work contains novel methodologies for solving dynamic algebraic equation (DAE constrained problems where the system may experience an abrupt change in dynamics that may otherwise require a conditional statement, there remain substantial limitations to this methodology, including a limited domain where problems may converge and the possibility for ill-conditioning. Although the problems presented use only continuous algebraic equations, the formulation has inherent non-smoothness. Hence, these problems must be solved with care and only in select circumstances, such as in simulation or situations when the solution is expected to be near the solver’s initial point.

  19. Sequential Convex Programming for Power Set-point Optimization in a Wind Farm using Black-box Models, Simple Turbine Interactions, and Integer Variables

    DEFF Research Database (Denmark)

    Hovgaard, Tobias Gybel; Larsen, Lars F. S.; Jørgensen, John Bagterp

    2012-01-01

    from the wind farm model, enabling us to use a very simple linear relationship for describing the turbine interactions. In addition, we allow individual turbines to be turned on or off introducing integer variables into the optimization problem. We solve this within the same framework of iterative...... is far superior to, a more naive distribution scheme. We employ a fast convex quadratic programming solver to carry out the iterations in the range of microseconds for even large wind farms....

  20. Distributed mixed-integer fuzzy hierarchical programming for municipal solid waste management. Part II: scheme analysis and mechanism revelation.

    Science.gov (United States)

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

    2017-02-16

    As presented in the first companion paper, distributed mixed-integer fuzzy hierarchical programming (DMIFHP) was developed for municipal solid waste management (MSWM) under complexities of heterogeneities, hierarchy, discreteness, and interactions. Beijing was selected as a representative case. This paper focuses on presenting the obtained schemes and the revealed mechanisms of the Beijing MSWM system. The optimal MSWM schemes for Beijing under various solid waste treatment policies and their differences are deliberated. The impacts of facility expansion, hierarchy, and spatial heterogeneities and potential extensions of DMIFHP are also discussed. A few of findings are revealed from the results and a series of comparisons and analyses. For instance, DMIFHP is capable of robustly reflecting these complexities in MSWM systems, especially for Beijing. The optimal MSWM schemes are of fragmented patterns due to the dominant role of the proximity principle in allocating solid waste treatment resources, and they are closely related to regulated ratios of landfilling, incineration, and composting. Communities without significant differences among distances to different types of treatment facilities are more sensitive to these ratios than others. The complexities of hierarchy and heterogeneities pose significant impacts on MSWM practices. Spatial dislocation of MSW generation rates and facility capacities caused by unreasonable planning in the past may result in insufficient utilization of treatment capacities under substantial influences of transportation costs. The problems of unreasonable MSWM planning, e.g., severe imbalance among different technologies and complete vacancy of ten facilities, should be gained deliberation of the public and the municipal or local governments in Beijing. These findings are helpful for gaining insights into MSWM systems under these complexities, mitigating key challenges in the planning of these systems, improving the related management

  1. COMSAT: Residue contact prediction of transmembrane proteins based on support vector machines and mixed integer linear programming.

    Science.gov (United States)

    Zhang, Huiling; Huang, Qingsheng; Bei, Zhendong; Wei, Yanjie; Floudas, Christodoulos A

    2016-03-01

    In this article, we present COMSAT, a hybrid framework for residue contact prediction of transmembrane (TM) proteins, integrating a support vector machine (SVM) method and a mixed integer linear programming (MILP) method. COMSAT consists of two modules: COMSAT_SVM which is trained mainly on position-specific scoring matrix features, and COMSAT_MILP which is an ab initio method based on optimization models. Contacts predicted by the SVM model are ranked by SVM confidence scores, and a threshold is trained to improve the reliability of the predicted contacts. For TM proteins with no contacts above the threshold, COMSAT_MILP is used. The proposed hybrid contact prediction scheme was tested on two independent TM protein sets based on the contact definition of 14 Å between Cα-Cα atoms. First, using a rigorous leave-one-protein-out cross validation on the training set of 90 TM proteins, an accuracy of 66.8%, a coverage of 12.3%, a specificity of 99.3% and a Matthews' correlation coefficient (MCC) of 0.184 were obtained for residue pairs that are at least six amino acids apart. Second, when tested on a test set of 87 TM proteins, the proposed method showed a prediction accuracy of 64.5%, a coverage of 5.3%, a specificity of 99.4% and a MCC of 0.106. COMSAT shows satisfactory results when compared with 12 other state-of-the-art predictors, and is more robust in terms of prediction accuracy as the length and complexity of TM protein increase. COMSAT is freely accessible at http://hpcc.siat.ac.cn/COMSAT/.

  2. The Integer Abacus.

    Science.gov (United States)

    Dirks, Michael K.

    1984-01-01

    The abacus method for instruction on addition, subtraction, and multiplication with integers is explained. How to represent the integers for each operation is detailed with words and illustrations. (MNS)

  3. Sums of Consecutive Integers

    Science.gov (United States)

    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.

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

    Science.gov (United States)

    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.

  5. MODELOS DE PROGRAMACIÓN ENTERA PARA UN PROBLEMA DE PROGRAMACIÓN DE HORARIOS PARA UNIVERSIDADES MODELS OF INTEGER PROGRAMMING FOR AN UNIVERSITY TIMETABLING PROBLEM

    Directory of Open Access Journals (Sweden)

    Andrés Saldaña Crovo

    2007-12-01

    Full Text Available En esta investigación se formulan dos modelos de Programación Lineal Entera para un problema de Programación de Horarios para Universidades y se presentan dos estrategias de solución para cada uno de ellos. El problema consiste en programar las asignaturas a ser dictadas, considerando los profesores, días, horarios, aulas y la necesidad de dictar las asignaturas en periodos consecutivos determinados. El objetivo es minimizar la asignación en periodos no deseados, balanceando la carga de trabajo diaria para cada grupo de alumnos. Las estrategias de solución combinan modelos de asignación directa a aulas o asignación a tipos de aulas. Las estrategias de solución que consideran relajación de restricciones, permiten resolver problemas de gran tamaño, a niveles de calidad razonables y utilizando pequeños tiempos computacionales. Los enfoques fueron aplicados a instancias de la Facultad de Ingeniería de la Universidad de Concepción, Chile. Los modelos utilizados en esta investigación pueden ser aplicados a una gran cantidad de problemas de Programación de Horarios en Universidades , proporcionando una gran flexibilidad de resolución.In this research, two models of Integer Programming for a University Timetabling Problem are formulated and two solution strategies for each model are presented. The problem consists of programming the courses to be taught, considering teaching faculty, days, periods, classrooms and requirements for courses that are taught in consecutive periods. The objective is to minimize the allocation of undesired time slots as well as balancing the daily workload for each group of students. The solution strategies are based on either combining models of direct allocation to classrooms or types of classrooms. The solution strategies that include reducing constraints, allow solving big problems with reasonable levels of efficiency, using the computer system for a short time. The approaches were used with real data

  6. A uniform LMI formulation for tuning PID, multi-term fractional-order PID, and Tilt-Integral-Derivative (TID) for integer and fractional-order processes.

    Science.gov (United States)

    Merrikh-Bayat, Farshad

    2017-03-15

    In this paper first the Multi-term Fractional-Order PID (MFOPID) whose transfer function is equal to [Formula: see text] , where kj and αj are unknown and known real parameters respectively, is introduced. Without any loss of generality, a special form of MFOPID with transfer function kp+ki/s+kd1s+kd2s(μ) where kp, ki, kd1, and kd2 are unknown real and μ is a known positive real parameter, is considered. Similar to PID and TID, MFOPID is also linear in its parameters which makes it possible to study all of them in a same framework. Tuning the parameters of PID, TID, and MFOPID based on loop shaping using Linear Matrix Inequalities (LMIs) is discussed. For this purpose separate LMIs for closed-loop stability (of sufficient type) and adjusting different aspects of the open-loop frequency response are developed. The proposed LMIs for stability are obtained based on the Nyquist stability theorem and can be applied to both integer and fractional-order (not necessarily commensurate) processes which are either stable or have one unstable pole. Numerical simulations show that the performance of the four-variable MFOPID can compete the trivial five-variable FOPID and often excels PID and TID.

  7. An exact approach for aggregated formulations

    DEFF Research Database (Denmark)

    Gamst, Mette; Spoorendonk, Simon

    cause an infeasible solution. In this paper, we consider (mixed) integer program formulations and propose a method for ensuring an optimal solution to the original (disaggregated) problem using an aggregated formulation. The method is based on Benders’ decomposition on a combination of the disaggregated...... mathematical formulation and the aggregated formulation. The method allows usage of relaxed aggregated formulations and enables branching on both aggregated and disaggregated variables. Also, the method guarantees an LP bound at least as good as those for the disaggregated and aggregated formulations...

  8. Discrete Dirac equation on a finite half-integer lattice

    Science.gov (United States)

    Smalley, L. L.

    1986-01-01

    The formulation of the Dirac equation on a discrete lattice with half-integer spacing and periodic boundary conditions is investigated analytically. The importance of lattice formulations for problems in field theory and quantum mechanics is explained; the concept of half-integer Fourier representation is introduced; the discrete Dirac equation for the two-dimensional case is derived; dispersion relations for the four-dimensional case are developed; and the spinor formulation for the Dirac fields on the half-integer lattice and the discrete time variable for the four-dimensional time-dependent Dirac equation are obtained. It is argued that the half-integer lattice, because it takes the Dirac Lagrangian into account, is more than a mere relabeling of the integer lattice and may have fundamental physical meaning (e.g., for the statistics of fermions). It is noted that the present formulation does not lead to species doubling, except in the continuum limit.

  9. A Spreadsheet-Based, Matrix Formulation Linear Programming Lesson

    DEFF Research Database (Denmark)

    Harrod, Steven

    2009-01-01

    The article focuses on the spreadsheet-based, matrix formulation linear programming lesson. According to the article, it makes a higher level of theoretical mathematics approachable by a wide spectrum of students wherein many may not be decision sciences or quantitative methods majors. Moreover......, it is consistent with the Arganbright Principles because the arrays and functions are clear in their operation and easily manipulated by the user....

  10. Modeling Operation Problem of Micro-grids Considering Economical, Technical and Environmental issues as Mixed-Integer Non-Linear Programming

    Directory of Open Access Journals (Sweden)

    Samira Salahi

    2016-08-01

    Full Text Available Reduction of fossil resources, increasing the production of greenhouse gas emissions and demand growth lead to greater use of distributed energy resources in power system especially in distribution networks. Integrating these resources in order to supply local loads creates a new concept called micro-grid. Optimal operation of micro-grid in the specific time period is one of the most important problems of them. In this paper, the operation problem of micro-grids is modeled considering the economical, technical and environmental issues, as well as uncertainties related to loads, wind speed and solar radiation. The resulting model is a Mixed-Integer Non-Linear Programming (MINLP. To demonstrate the effectiveness of the proposed model, Bisheh village in Iran is considered as a case study. The results showed that considering load curtailment costs, the power losses of the main grid, the penalties of pollutant gasses emissions and the elimination of energy subsides will tremendous impacts on the operation of microgrids. Article History: Received March 12, 2016; Received in revised form June 20, 2016; Accepted July 2nd 2016; Available online How to Cite This Article: Salahi, S., and Bahramara, S. (2016 Modeling Operation Problem of Micro-grids Considering Economical, Technical and Environmental issues as Mixed-Integer Non-Linear Programming. Int. Journal of Renewable Energy Development, 5(2, 139-149. http://dx.doi.org/10.14710/ijred.5.2.139-149 

  11. A NEW DETERMINISTIC FORMULATION FOR DYNAMIC STOCHASTIC PROGRAMMING PROBLEMS AND ITS NUMERICAL COMPARISON WITH OTHERS

    Institute of Scientific and Technical Information of China (English)

    陈志平

    2003-01-01

    A new deterministic formulation,called the conditional expectation formulation,is proposed for dynamic stochastic programming problems in order to overcome some disadvantages of existing deterministic formulations.We then check the impact of the new deterministic formulation and other two deterministic formulations on the corresponding problem size,nonzero elements and solution time by solving some typical dynamic stochastic programming problems with different interior point algorithms.Numerical results show the advantage and application of the new deterministic formulation.

  12. Flow Formulation-based Model for the Curriculum-based Course Timetabling Problem

    DEFF Research Database (Denmark)

    Bagger, Niels-Christian Fink; Kristiansen, Simon; Sørensen, Matias;

    2015-01-01

    In this work we will present a new mixed integer programming formulation for the curriculum-based course timetabling problem. We show that the model contains an underlying network model by dividing the problem into two models and then connecting the two models back into one model using a maximum ow...... problem. This decreases the number of integer variables signicantly and improves the performance compared to the basic formulation. It also shows competitiveness with other approaches based on mixed integer programming from the literature and improves the currently best known lower bound on one data...

  13. Optimal fleetwide emissions reductions for passenger ferries: an application of a mixed-integer nonlinear programming model for the New York-New Jersey Harbor.

    Science.gov (United States)

    Winebrake, James J; Corbett, James J; Wang, Chengfeng; Farrell, Alexander E; Woods, Pippa

    2005-04-01

    Emissions from passenger ferries operating in urban harbors may contribute significantly to emissions inventories and commuter exposure to air pollution. In particular, ferries are problematic because of high emissions of oxides of nitrogen (NOx) and particulate matter (PM) from primarily unregulated diesel engines. This paper explores technical solutions to reduce pollution from passenger ferries operating in the New York-New Jersey Harbor. The paper discusses and demonstrates a mixed-integer, non-linear programming model used to identify optimal control strategies for meeting NOx and PM reduction targets for 45 privately owned commuter ferries in the harbor. Results from the model can be used by policy-makers to craft programs aimed at achieving least-cost reduction targets.

  14. Parallel Integer Relation Detection: Techniques and Applications

    OpenAIRE

    Bailey, David H.; Broadhurst, David J.

    1999-01-01

    Let $\\{x_1, x_2, ..., x_n\\}$ be a vector of real numbers. An integer relation algorithm is a computational scheme to find the $n$ integers $a_k$, if they exist, such that $a_1 x_1 + a_2 x_2 + ... + a_n x_n= 0$. In the past few years, integer relation algorithms have been utilized to discover new results in mathematics and physics. Existing programs for this purpose require very large amounts of computer time, due in part to the requirement for multiprecision arithmetic, yet are poorly suited ...

  15. Integers annual volume 2013

    CERN Document Server

    Landman, Bruce

    2014-01-01

    ""Integers"" is a refereed online journal devoted to research in the area of combinatorial number theory. It publishes original research articles in combinatorics and number theory. This work presents all papers of the 2013 volume in book form.

  16. 基于整数规划的物流配送中心选址研究%The location of logistics distribution centers based on integer programming

    Institute of Scientific and Technical Information of China (English)

    章海燕

    2016-01-01

    本文从物流配送中心的运营成本和运输时间限制着手,在满足连锁店服务要求的前提下,利用混合整数规划对物流配送中心进行选址模型研究,并结合实例给出了求解。%In this paper, under the premise of meeting the service requirements of the chain store, with the operation cost and transportation time limit of the logistics distribution center, research on logistics distribution center location model based on mixed integer programming. And the solution is given with an example.

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

    Science.gov (United States)

    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 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.

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

    Science.gov (United States)

    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.

  19. Aeroelastic analysis for propellers - mathematical formulations and program user's manual

    Science.gov (United States)

    Bielawa, R. L.; Johnson, S. A.; Chi, R. M.; Gangwani, S. T.

    1983-01-01

    Mathematical development is presented for a specialized propeller dedicated version of the G400 rotor aeroelastic analysis. The G400PROP analysis simulates aeroelastic characteristics particular to propellers such as structural sweep, aerodynamic sweep and high subsonic unsteady airloads (both stalled and unstalled). Formulations are presented for these expanded propeller related methodologies. Results of limited application of the analysis to realistic blade configurations and operating conditions which include stable and unstable stall flutter test conditions are given. Sections included for enhanced program user efficiency and expanded utilization include descriptions of: (1) the structuring of the G400PROP FORTRAN coding; (2) the required input data; and (3) the output results. General information to facilitate operation and improve efficiency is also provided.

  20. A Hybrid Approach Using an Artificial Bee Algorithm with Mixed Integer Programming Applied to a Large-Scale Capacitated Facility Location Problem

    Directory of Open Access Journals (Sweden)

    Guillermo Cabrera G.

    2012-01-01

    Full Text Available We present a hybridization of two different approaches applied to the well-known Capacitated Facility Location Problem (CFLP. The Artificial Bee algorithm (BA is used to select a promising subset of locations (warehouses which are solely included in the Mixed Integer Programming (MIP model. Next, the algorithm solves the subproblem by considering the entire set of customers. The hybrid implementation allows us to bypass certain inherited weaknesses of each algorithm, which means that we are able to find an optimal solution in an acceptable computational time. In this paper we demonstrate that BA can be significantly improved by use of the MIP algorithm. At the same time, our hybrid implementation allows the MIP algorithm to reach the optimal solution in a considerably shorter time than is needed to solve the model using the entire dataset directly within the model. Our hybrid approach outperforms the results obtained by each technique separately. It is able to find the optimal solution in a shorter time than each technique on its own, and the results are highly competitive with the state-of-the-art in large-scale optimization. Furthermore, according to our results, combining the BA with a mathematical programming approach appears to be an interesting research area in combinatorial optimization.

  1. The Multi-State Perfect Phylogeny Problem with missing and removable data: solutions via integer-programming and chordal graph theory.

    Science.gov (United States)

    Gusfield, Dan

    2010-03-01

    The Multi-State Perfect Phylogeny Problem is an extension of the Binary Perfect Phylogeny Problem, allowing characters to take on more than two states. In this article, we consider three problems that extend the utility of the multi-state perfect phylogeny model: (1) the Missing Data (MD) Problem, where some entries in the input are missing and the question is whether (bounded) values for the missing data can be imputed so that the resulting data has a multi-state perfect phylogeny; (2) the Character-Removal (CR) Problem, where we want to minimize the number of characters to remove from the data so that the resulting data has a multi-state perfect phylogeny; and (3) the Missing-Data Character-Removal (MDCR) Problem, where the input has missing data and we want to impute values for the missing data to minimize the solution to the resulting Character-Removal Problem. We discuss Integer Linear Programming (ILP) solutions to these problems for the special case of three, four, and five permitted states per character, and we report on extensive empirical testing of these solutions. Then we develop a general theory to solve the MD problem for an arbitrary number of permitted states, using chordal graph theory and results on minimal triangulation of non-chordal graphs. This establishes new necessary and sufficient conditions for the existence of a perfect phylogeny with (or without) missing data. We implement the general theory using integer linear programming, although other optimization methods are possible. We extensively explore the empirical behavior of the general solution, showing that the methods are very practical for data of size and complexity that is characteristic of many current applications in phylogenetics. Some of the empirical results for the MD problem with an arbitrary number of permitted states are very surprising, suggesting the existence of additional combinatorial structure in multi-state perfect phylogenies. Finally, we note some relationships

  2. Integer Equal Flows

    Energy Technology Data Exchange (ETDEWEB)

    Meyers, C A; Schulz, A S

    2009-01-07

    The integer equal flow problem is an NP-hard network flow problem, in which all arcs in given sets R{sub 1}, ..., R{sub {ell}} must carry equal flow. We show this problem is effectively inapproximable, even if the cardinality of each set R{sub k} is two. When {ell} is fixed, it is solvable in polynomial time.

  3. Encrypted integer division

    NARCIS (Netherlands)

    Veugen, P.J.M.

    2010-01-01

    When processing signals in the encrypted domain, homomorphic encryption can be used to enable linear operations on encrypted data. Integer division of encrypted data however requires an additional protocol with the server and will be relatively expensive. We present new solutions for dividing encryp

  4. Extended gcd of quadratic integers

    CERN Document Server

    Miled, Abdelwaheb

    2010-01-01

    Computation of the extended gcd of two quadratic integers. The ring of integers considered is principal but could be euclidean or not euclidean ring. This method rely on principal ideal ring and reduction of binary quadratic forms.

  5. Multi-objective Mixed Integer Programming approach for facility layout design by considering closeness ratings, material handling, and re-layout cost

    Science.gov (United States)

    Purnomo, Muhammad Ridwan Andi; Satrio Wiwoho, Yoga

    2016-01-01

    Facility layout becomes one of production system factor that should be managed well, as it is designated for the location of production. In managing the layout, designing the layout by considering the optimal layout condition that supports the work condition is essential. One of the method for facility layout optimization is Mixed Integer Programming (MIP). In this study, the MIP is solved using Lingo 9.0 software and considering quantitative and qualitative objectives to be achieved simultaneously: minimizing material handling cost, maximizing closeness rating, and minimizing re-layout cost. The research took place in Rekayasa Wangdi as a make to order company, focusing on the making of concrete brick dough stirring machine with 10 departments involved. The result shows an improvement in the new layout for 333,72 points of objective value compared with the initial layout. As the conclusion, the proposed MIP is proven to be used to model facility layout problem under multi objective consideration for a more realistic look.

  6. An Image Steganography Algorithm Combined with Integer Programming and YASS%一种结合整数规划和YASS的图像隐写算法

    Institute of Scientific and Technical Information of China (English)

    忻佳琳; 王士林

    2013-01-01

    In order to increase the steganography rate, this paper proposes a new scheme of steganography which is based on YASS algorithm. After discussing the inherent relationship between Discrete Cosine Transform(DCT) coefficients in different blocks, a method of iterative programming is proposed which is referenced to integer programming, and the carrier which has steganography has been corrected. In aspect of anti-detection, 98 degree’s Markov steganalysis method is used to detect the stego images. Experimental result shows that this optimization algorithm is proved to effectively decrease the errors caused by JPEG compression during YASS steganography. In this way, steganographic rate is increased to a great extent. This method is also proved to get the same outstanding performance in common anti-detection.%为提高图像隐写率,在 YASS 算法的基础上,提出一种改进的图像隐写算法。分析不同图像分块离散余弦变换系数之间的固有联系,借鉴整数规划的思想设计迭代算法,对已隐写的载体进行数据校正。使用98维马尔科夫通用图像检测方法进行实验,结果表明,该算法能减少YASS隐写过程中由JPEG图像压缩引入的误码,提高隐写率,同时可有效抵抗通用隐写检测。

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

    Science.gov (United States)

    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.

  8. Fissile materials disposition program plutonium immobilization project baseline formulation

    Energy Technology Data Exchange (ETDEWEB)

    Ebbinghaus, B B; Armantrout, G A; Gray, L; Herman, C C; Shaw, H F; Van Konynenburg, R A

    2000-09-01

    Since 1994 Lawrence Livermore National Laboratory (LLNL), with the help of several other laboratories and university groups, has been the lead laboratory for the Plutonium Immobilization Project (PIP). This involves, among other tasks, the development of a formulation and a fabrication process for a ceramic to be used in the immobilization of excess weapons-usable plutonium. This report reviews the history of the project as it relates to the development of the ceramic form. It describes the sample test plan for the pyrochlore-rich ceramic formulation that was selected, and it specifies the baseline formulation that has been adopted. It also presents compositional specifications (e.g. precursor compositions and mixing recipes) and other form and process specifications that are linked or potentially linked to the baseline formulation.

  9. Investigating Students’ Development of Learning Integer Concept and Integer Addition

    Directory of Open Access Journals (Sweden)

    Nenden Octavarulia Shanty

    2016-09-01

    Full Text Available This research aimed at investigating students’ development of learning integer concept and integer addition. The investigation was based on analyzing students’ works in solving the given mathematical problems in each instructional activity designed based on Realistic Mathematics Education (RME levels. Design research was chosen to achieve and to contribute in developing a local instruction theory for teaching and learning of integer concept and integer addition. In design research, the Hypothetical Learning Trajectory (HLT plays important role as a design and research instrument. It was designed in the phase of preliminary design and tested to three students of grade six OASIS International School, Ankara – Turkey. The result of the experiments showed that temperature in the thermometer context could stimulate students’ informal knowledge of integer concept. Furthermore, strategies and tools used by the students in comparing and relating two temperatures were gradually be developed into a more formal mathematics. The representation of line inside thermometer which then called the number line could bring the students to the last activity levels, namely rules for adding integer, and became the model for more formal reasoning. Based on these findings, it can be concluded that students’ learning integer concept and integer addition developed through RME levels.Keywords: integer concept, integer addition, Realistic Mathematics Education DOI: http://dx.doi.org/10.22342/jme.7.2.3538.57-72

  10. THE PROPOSAL MODEL OF RATIONAL WORKFORCE ASSIGNMENT IN DOKUZ EYLUL UNIVERSITY BY ANALYTIC HIERARCHY PROCESS BASED 0-1 INTEGER PROGRAMMING

    Directory of Open Access Journals (Sweden)

    Yılmaz GÖKŞEN

    2016-11-01

    to the personnel, a person’s contribution coefficients have been calculated. These values are used in the assignment model. This model has been solved and evaluated as 0-1 integer programming. Model outputs that have been solved again by using additional constraints like task type and disability conditions and these are compared with the previous figures.

  11. Integer-valued trawl processes

    DEFF Research Database (Denmark)

    Barndorff-Nielsen, Ole E.; Lunde, Asger; Shephard, Neil;

    2014-01-01

    This paper introduces a new continuous-time framework for modelling serially correlated count and integer-valued data. The key component in our new model is the class of integer-valued trawl processes, which are serially correlated, stationary, infinitely divisible processes. We analyse the proba......This paper introduces a new continuous-time framework for modelling serially correlated count and integer-valued data. The key component in our new model is the class of integer-valued trawl processes, which are serially correlated, stationary, infinitely divisible processes. We analyse...

  12. Integer roots of quadratic and cubic polynomials with integer coefficients

    CERN Document Server

    Zelator, Konstantine

    2011-01-01

    The subject matter of this work is quadratic and cubic polynomial functions with integer coefficients;and all of whose roots are integers. The material of this work is directed primarily at educators,students,and teachers of mathematics,grades K12 to K20.The results of this work are expressed in Theorems3,4,and5. Of these theorems, Theorem3, is the one that most likely, the general reader of this article will have some familiarity with.In Theorem3, precise coefficient conditions are given;in order that a quadratic trinomial(with integer) have two integer roots or zeros.On the other hand, Theorems4 and5 are largely unfamiliar territory. In Theorem4, precise coefficient conditions are stated; for a monic cubic polynomial to have a double(i.e.of multiplicity 2) integer root, and a single integer root(i.e.of multiplicity 1).The entire family of such cubics can be described in terms of four groups or subfamilies; each such group being a two-integer parameter subfamily. In Theorem5, a one-integer parameter family o...

  13. Integer and Half-Integer Quantization Conditions in Quantum Mechanics

    Institute of Scientific and Technical Information of China (English)

    DUAN Yi-Shi; JIA Duo-Jie

    2001-01-01

    The integer and half-integer quantization conditions are found in quantum mechanics based on the topological structure of symmetry group of the singlet and spinor wavefunction. The internal symmetry of the physical system is shown to be sufficient to determine the topological structure in quantum mechanics without taking int account the dynamical details about the interaction.

  14. Compact Formulations of the Steiner Traveling Salesman Problem and Related Problems

    CERN Document Server

    Letchford, Adam N; Theis, Dirk Oliver

    2012-01-01

    The Steiner Traveling Salesman Problem (STSP) is a variant of the Traveling Salesman Problem (TSP) that is particularly suitable when dealing with sparse networks, such as road networks. The standard integer programming formulation of the STSP has an exponential number of constraints, just like the standard formulation of the TSP. On the other hand, there exist several known {\\em compact} formulations of the TSP, i.e., formulations with a polynomial number of both variables and constraints. In this paper, we show that some of these compact formulations can be adapted to the STSP. We also briefly discuss the adaptation of our formulations to some closely-related problems.

  15. Use of nonlinear programming to optimize performance response to energy density in broiler feed formulation.

    Science.gov (United States)

    Guevara, V R

    2004-02-01

    A nonlinear programming optimization model was developed to maximize margin over feed cost in broiler feed formulation and is described in this paper. The model identifies the optimal feed mix that maximizes profit margin. Optimum metabolizable energy level and performance were found by using Excel Solver nonlinear programming. Data from an energy density study with broilers were fitted to quadratic equations to express weight gain, feed consumption, and the objective function income over feed cost in terms of energy density. Nutrient:energy ratio constraints were transformed into equivalent linear constraints. National Research Council nutrient requirements and feeding program were used for examining changes in variables. The nonlinear programming feed formulation method was used to illustrate the effects of changes in different variables on the optimum energy density, performance, and profitability and was compared with conventional linear programming. To demonstrate the capabilities of the model, I determined the impact of variation in prices. Prices for broiler, corn, fish meal, and soybean meal were increased and decreased by 25%. Formulations were identical in all other respects. Energy density, margin, and diet cost changed compared with conventional linear programming formulation. This study suggests that nonlinear programming can be more useful than conventional linear programming to optimize performance response to energy density in broiler feed formulation because an energy level does not need to be set.

  16. Mixed integer evolution strategies for parameter optimization.

    Science.gov (United States)

    Li, Rui; Emmerich, Michael T M; Eggermont, Jeroen; Bäck, Thomas; Schütz, M; Dijkstra, J; Reiber, J H C

    2013-01-01

    Evolution strategies (ESs) are powerful probabilistic search and optimization algorithms gleaned from biological evolution theory. They have been successfully applied to a wide range of real world applications. The modern ESs are mainly designed for solving continuous parameter optimization problems. Their ability to adapt the parameters of the multivariate normal distribution used for mutation during the optimization run makes them well suited for this domain. In this article we describe and study mixed integer evolution strategies (MIES), which are natural extensions of ES for mixed integer optimization problems. MIES can deal with parameter vectors consisting not only of continuous variables but also with nominal discrete and integer variables. Following the design principles of the canonical evolution strategies, they use specialized mutation operators tailored for the aforementioned mixed parameter classes. For each type of variable, the choice of mutation operators is governed by a natural metric for this variable type, maximal entropy, and symmetry considerations. All distributions used for mutation can be controlled in their shape by means of scaling parameters, allowing self-adaptation to be implemented. After introducing and motivating the conceptual design of the MIES, we study the optimality of the self-adaptation of step sizes and mutation rates on a generalized (weighted) sphere model. Moreover, we prove global convergence of the MIES on a very general class of problems. The remainder of the article is devoted to performance studies on artificial landscapes (barrier functions and mixed integer NK landscapes), and a case study in the optimization of medical image analysis systems. In addition, we show that with proper constraint handling techniques, MIES can also be applied to classical mixed integer nonlinear programming problems.

  17. Formulating Employability Skills for Graduates of Public Health Study Program

    Science.gov (United States)

    Qomariyah, Nurul; Savitri, Titi; Hadianto, Tridjoko; Claramita, Mora

    2016-01-01

    Employability skills (ES) are important for effective and successful individual participation in the workplace. The main aims of the research were to identify important ES needed by graduates of Public Health Study Program Universitas Ahmad Dahlan (PHSP UAD) and to assess the achievement of the ES development that has been carried out by PHSP UAD.…

  18. A formulation of combinatorial auction via reverse convex programming

    Directory of Open Access Journals (Sweden)

    Henry Schellhorn

    2005-01-01

    of this problem, where orders are aggregated and integrality constraints are relaxed. It was proved that this problem could be solved efficiently in two steps by calculating two fixed points, first the fixed point of a contraction mapping, and then of a set-valued function. In this paper, we generalize the problem to incorporate constraints on maximum price changes between two auction rounds. This generalized problem cannot be solved by the aforementioned methods and necessitates reverse convex programming techniques.

  19. PageRank of integers

    CERN Document Server

    Frahm, K M; Shepelyansky, D L

    2012-01-01

    We build up a directed network tracing links from a given integer to its divisors and analyze the properties of the Google matrix of this network. The PageRank vector of this matrix is computed numerically and it is shown that its probability is inversely proportional to the PageRank index thus being similar to the Zipf law and the dependence established for the World Wide Web. The spectrum of the Google matrix of integers is characterized by a large gap and a relatively small number of nonzero eigenvalues. A simple semi-analytical expression for the PageRank of integers is derived that allows to find this vector for matrices of billion size. This network provides a new PageRank order of integers.

  20. Statistical Mechanical Models of Integer Factorization Problem

    Science.gov (United States)

    Nakajima, Chihiro H.; Ohzeki, Masayuki

    2017-01-01

    We formulate the integer factorization problem via a formulation of the searching problem for the ground state of a statistical mechanical Hamiltonian. The first passage time required to find a correct divisor of a composite number signifies the exponential computational hardness. The analysis of the density of states of two macroscopic quantities, i.e., the energy and the Hamming distance from the correct solutions, leads to the conclusion that the ground state (correct solution) is completely isolated from the other low-energy states, with the distance being proportional to the system size. In addition, the profile of the microcanonical entropy of the model has two peculiar features that are each related to two marked changes in the energy region sampled via Monte Carlo simulation or simulated annealing. Hence, we find a peculiar first-order phase transition in our model.

  1. Modelling with Integer Variables.

    Science.gov (United States)

    1984-01-01

    H. Korte, North-Holland Publishing Co., Amsterdam, pp. 3-53, 1979. 2. Bazaraa , M. and Shetty, M., Non-Linear Programming, John Wiley & Sons, Inc., New...Survey," SIAM Review 18 (1976), pp. 710-760. 5. Bazaraa , M. and Shetty, M., Non-Linear Programming, John Wiley & Sons, Inc., New York 1979. 6. Beale

  2. Image Watermarking Method Using Integer-to-Integer Wavelet Transforms

    Institute of Scientific and Technical Information of China (English)

    陈韬; 王京春

    2002-01-01

    Digital watermarking is an efficient method for copyright protection for text, image, audio, and video data. This paper presents a new image watermarking method based on integer-to-integer wavelet transforms. The watermark is embedded in the significant wavelet coefficients by a simple exclusive OR operation. The method avoids complicated computations and high computer memory requirements that are the main drawbacks of common frequency domain based watermarking algorithms. Simulation results show that the embedded watermark is perceptually invisible and robust to various operations, such as low quality joint picture expert group (JPEG) compression, random and Gaussian noises, and smoothing (mean filtering).

  3. Exploiting Symmetry in Integer Convex Optimization using Core Points

    CERN Document Server

    Herr, Katrin; Schürmann, Achill

    2012-01-01

    We consider convex programming problems with integrality constraints that are invariant under a linear symmetry group. We define a core point of such a symmetry group as an integral point for which the convex hull of its orbit does not contain integral points other than the orbit points themselves. These core points allow us to decompose symmetric integer convex programming problems. Especially for symmetric integer linear programs we describe two algorithms based on this decomposition. Using a characterization of core points for direct products of symmetric groups, we show that prototype implementations can compete with state-of-the art commercial solvers and solve an open MIPLIB problem.

  4. Model-based optimal design of experiments - semidefinite and nonlinear programming formulations.

    Science.gov (United States)

    Duarte, Belmiro P M; Wong, Weng Kee; Oliveira, Nuno M C

    2016-02-15

    We use mathematical programming tools, such as Semidefinite Programming (SDP) and Nonlinear Programming (NLP)-based formulations to find optimal designs for models used in chemistry and chemical engineering. In particular, we employ local design-based setups in linear models and a Bayesian setup in nonlinear models to find optimal designs. In the latter case, Gaussian Quadrature Formulas (GQFs) are used to evaluate the optimality criterion averaged over the prior distribution for the model parameters. Mathematical programming techniques are then applied to solve the optimization problems. Because such methods require the design space be discretized, we also evaluate the impact of the discretization scheme on the generated design. We demonstrate the techniques for finding D-, A- and E-optimal designs using design problems in biochemical engineering and show the method can also be directly applied to tackle additional issues, such as heteroscedasticity in the model. Our results show that the NLP formulation produces highly efficient D-optimal designs but is computationally less efficient than that required for the SDP formulation. The efficiencies of the generated designs from the two methods are generally very close and so we recommend the SDP formulation in practice.

  5. GENOCOP算法在0—1非线性整数规划模型中的应用%The Application of GENOCOP Algorithm in 0- 1 Nonlinear Integer Programming Model

    Institute of Scientific and Technical Information of China (English)

    袁晓; 利洁婷; 王世其

    2011-01-01

    本文针对某公司电力容量扩展问题,采用一元线性回归模型拟合未来10年的需求量,再建立0—1非线性整数规划模型,并将该模型的0—1变量连续化处理,采用遗传算法中的GENOCOP算法求解。%In this paper,the next 10- year demand of a company for power capacity is fitted by monadic linear regression model. A model for 0 - 1 nonlinear integer programming is built, and the 0 - 1 variables of the model are disposed continuously. It is solved by the GENOCOP algorithm of genetic algorithm.

  6. DESIGN OF MULTI-SERVICE SDH NETWORKS: FORMULATION AND HEURISTICS

    Institute of Scientific and Technical Information of China (English)

    Xi Kang; Ge Ning; Feng Chongxi

    2003-01-01

    Multi-service SDH networks support both packet- and circuit-switched traffic. Op-timal design of such a network means to guarantee the circuit connections and configure a logicalpacket-switched topology with lowest congestion. This letter first formulates the problem as amixed integer linear programming, which achieves optima] solution but has high computation.Then a heuristic algorithm is proposed to yield near-optimal solution efficiently. Performance ofthe algorithm is verified by an example.

  7. Message-Passing Algorithms for Quadratic Programming Formulations of MAP Estimation

    CERN Document Server

    Kumar, Akshat

    2012-01-01

    Computing maximum a posteriori (MAP) estimation in graphical models is an important inference problem with many applications. We present message-passing algorithms for quadratic programming (QP) formulations of MAP estimation for pairwise Markov random fields. In particular, we use the concave-convex procedure (CCCP) to obtain a locally optimal algorithm for the non-convex QP formulation. A similar technique is used to derive a globally convergent algorithm for the convex QP relaxation of MAP. We also show that a recently developed expectation-maximization (EM) algorithm for the QP formulation of MAP can be derived from the CCCP perspective. Experiments on synthetic and real-world problems confirm that our new approach is competitive with max-product and its variations. Compared with CPLEX, we achieve more than an order-of-magnitude speedup in solving optimally the convex QP relaxation.

  8. Note on Integer Factoring Methods IV

    OpenAIRE

    Carella, N. A.

    2008-01-01

    This note continues the theoretical development of deterministic integer factorization algorithms based on systems of polynomials equations. The main result establishes a new deterministic time complexity bench mark in integer factorization.

  9. Design of a Generic and Flexible Data Structure for Efficient Formulation of Large Scale Network Problems

    DEFF Research Database (Denmark)

    Quaglia, Alberto; Sarup, Bent; Sin, Gürkan;

    2013-01-01

    The formulation of Enterprise-Wide Optimization (EWO) problems as mixed integer nonlinear programming requires collecting, consolidating and systematizing large amount of data, coming from different sources and specific to different disciplines. In this manuscript, a generic and flexible data...... structure for efficient formulation of enterprise-wide optimization problems is presented. Through the integration of the described data structure in our synthesis and design framework, the problem formulation workflow is automated in a software tool, reducing time and resources needed to formulate large...... problems, while ensuring at the same time data consistency and quality at the application stage....

  10. A Euclidean algorithm for integer matrices

    DEFF Research Database (Denmark)

    Lauritzen, Niels; Thomsen, Jesper Funch

    2015-01-01

    We present a Euclidean algorithm for computing a greatest common right divisor of two integer matrices. The algorithm is derived from elementary properties of finitely generated modules over the ring of integers.......We present a Euclidean algorithm for computing a greatest common right divisor of two integer matrices. The algorithm is derived from elementary properties of finitely generated modules over the ring of integers....

  11. Presolving and regularization in mixed-integer second-order cone optimization

    DEFF Research Database (Denmark)

    Friberg, Henrik Alsing

    Mixed-integer second-order cone optimization is a powerful mathematical framework capable of representing both logical conditions and nonlinear relationships in mathematical models of industrial optimization problems. What is more, solution methods are already part of many major commercial solvers...... both continuous and mixed-integer conic optimization in general, is discovered and treated. This part of the thesis continues the studies of facial reduction preceding the work of Borwein and Wolkowicz [17] in 1981, when the first algorithmic cure for these kinds of reliability issues were formulated....... An important distinction to make between continuous and mixed-integer optimization, however, is that the reliability issues occurring in mixed-integer optimization cannot be blamed on the practitioner’s formulation of the problem. Specifically, as shown, the causes for these issues may well lie within...

  12. On minimal integer representations of weighted games

    CERN Document Server

    Freixas, Josep

    2011-01-01

    We study minimum integer representations for the weights of weighted games, which is linked with some solution concepts in game theory. Closing some gaps in the existing literature we prove that each weighted game with two types of voters admits a unique minimum integer presentation and give examples for more than two types of voters without a minimum integer representation. We characterize the possible weights in minimum integer representations and give examples for at least four types of voters without minimum integer representations preserving types.

  13. Fast resolution of integer Vandermonde systems

    Directory of Open Access Journals (Sweden)

    Rosa di Salvo

    2014-10-01

    Full Text Available The resolution of polynomial interpolation problems with integer coefficients directly involves the open issue of the integer inversion of a general Vandermonde matrix defined over the field Z/pZ, for p prime number. The purpose of this paper is to demonstrate the possibility to invert a Vandermonde matrix with integer mod p coefficients and exactly compute the integer inverse matrix in the ring Mat(Z/pZ of square matrices over Z/pZ through the new fast algorithm InVanderMOD. The explicit formula derived for the integer inversion of Vandermonde matrices entirely develops inside the field of the integers mod p, with due consideration to the operation of integer division. The inversion procedure InVanderMOD is valid for any prime number p and competitive in terms of computational effort, since its computational cost is less than O(n^3.

  14. Efinaconazole topical solution, 10%: formulation development program of a new topical treatment of toenail onychomycosis.

    Science.gov (United States)

    Bhatt, V; Pillai, R

    2015-07-01

    Transungual drug delivery of antifungals is considered highly desirable to treat common nail disorders such as onychomycosis, due to localized effects, and improved adherence resulting from minimal systemic adverse events. However, the development of effective topical therapies has been hampered by poor nail penetration. An effective topical antifungal must permeate through, and under the dense keratinized nail plate to the site of infection in the nail bed and nail matrix. We present here the formulation development program to provide effective transungual and subungual delivery of efinaconazole, the first topical broad spectrum triazole specifically developed for onychomycosis treatment. We discuss the important aspects encompassing the formulation development program for efinaconazole topical solution, 10%, focusing on its solubility in a number of solvents, in vitro penetration through the nail, and in vivo efficacy. Efinaconazole topical solution, 10% is a stable, non-lacquer, antifungal with a unique combination of ingredients added to an alcohol-based formulation to provide low surface tension and good wetting properties. This low surface tension is believed to affect effective transungual delivery of efinaconazole and believed to provide a dual mode of delivery by accessing the nail bed by wicking into the space between the nail and nail plate. © 2015 Wiley Periodicals, Inc. and the American Pharmacists Association.

  15. Solving the Water Jugs Problem by an Integer Sequence Approach

    Science.gov (United States)

    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…

  16. The Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions

    CERN Document Server

    Lee, Jon; Romanchuk, Lyubov; Weismantel, Robert

    2010-01-01

    We consider the nonlinear integer programming problem of minimizing a quadratic function over the integer points in variable dimension satisfying a system of linear inequalities. We show that when the Graver basis of the matrix defining the system is given, and the quadratic function lies in a suitable {\\em dual Graver cone}, the problem can be solved in polynomial time. We discuss the relation between this cone and the cone of positive semidefinite matrices, and show that none contains the other. So we can minimize in polynomial time some non-convex and some (including all separable) convex quadrics. We conclude by extending our results to efficient integer minimization of multivariate polynomial functions of arbitrary degree lying in suitable cones.

  17. Optimal Component Lumping: problem formulation and solution techniques

    DEFF Research Database (Denmark)

    Lin, Bao; Leibovici, Claude F.; Jørgensen, Sten Bay

    2008-01-01

    to determine the lumping scheme. Given an objective function defined with a linear weighting rule, an optimal lumping problem is formulated as a mixed integer nonlinear programming (MINLP) problem both in discrete and in continuous settings. A reformulation of the original problem is also presented, which...... significantly reduces the number of independent variables. The application to a system with 144 components demonstrates that the optimal lumping problem can be efficiently solved with a stochastic optimization method, Tabu Search (TS) algorithm. The case study also reveals that the discrete formulation...

  18. An integer programming approach to optimizing solid waste system for environmental impact management%整数规划用于固废系统环境影响模型的研究

    Institute of Scientific and Technical Information of China (English)

    李薇; 徐毅; 李继强; 孙晓伟; 杜晓文; 万军

    2013-01-01

    In this study, an optimization model was developed based on the integer programming methods to address the environmental risk during solid waste transformation process. The integer programming method can help to address the selection of solid waste transfer routes and expansion schemes. The objective of the developed model is to minimize the system cost in solid waste treatment process considering the environmental effects for the surroundings of driving routes. The results indicated that different types of solid waste may need different recycling stations, in addition, the optimal routes from transfer stations to recycling stations may change during different planning periods. The landfill is always the best option for solid waste treatment due to its lower operation cost. However, pyrolysis is promising in the future owing to its huge treatment volume and the minimum transport and operation costs. The proposed model can effectively optimize resources distributions of municipal solid waste system and provide science-based waste management evidences for decision-makers.%采用整数线性规划的系统分析方法建立模型,以整数规划解决运输路线及处理方式扩容方案的选择问题,以系统经济成本为优化目标,并着重考虑了运输过程产生的3种恶臭气体扩散对周围特殊区域造成的环境影响,优化固体废弃物运输路线.结果表明:不同时期不同的垃圾回收站适合回收的垃圾类别不同;不同时期不同回收站的运输路线最优选择不同;垃圾填埋处理由于处理费用低,一直是垃圾处理的优选方案,但热解处理量较大,增长幅度最大,且运输处理总费用最低,从长远看,热解厂的未来发展趋势较好;该模型能够有效解决城市固体废弃物系统资源优化配置问题,为决策者提供可靠的依据.

  19. An integer optimization algorithm for robust identification of non-linear gene regulatory networks

    Directory of Open Access Journals (Sweden)

    Chemmangattuvalappil Nishanth

    2012-09-01

    Full Text Available Abstract Background Reverse engineering gene networks and identifying regulatory interactions are integral to understanding cellular decision making processes. Advancement in high throughput experimental techniques has initiated innovative data driven analysis of gene regulatory networks. However, inherent noise associated with biological systems requires numerous experimental replicates for reliable conclusions. Furthermore, evidence of robust algorithms directly exploiting basic biological traits are few. Such algorithms are expected to be efficient in their performance and robust in their prediction. Results We have developed a network identification algorithm to accurately infer both the topology and strength of regulatory interactions from time series gene expression data in the presence of significant experimental noise and non-linear behavior. In this novel formulism, we have addressed data variability in biological systems by integrating network identification with the bootstrap resampling technique, hence predicting robust interactions from limited experimental replicates subjected to noise. Furthermore, we have incorporated non-linearity in gene dynamics using the S-system formulation. The basic network identification formulation exploits the trait of sparsity of biological interactions. Towards that, the identification algorithm is formulated as an integer-programming problem by introducing binary variables for each network component. The objective function is targeted to minimize the network connections subjected to the constraint of maximal agreement between the experimental and predicted gene dynamics. The developed algorithm is validated using both in silico and experimental data-sets. These studies show that the algorithm can accurately predict the topology and connection strength of the in silico networks, as quantified by high precision and recall, and small discrepancy between the actual and predicted kinetic parameters

  20. An application of nonlinear programming to the design of regulators of a linear-quadratic formulation

    Science.gov (United States)

    Fleming, P.

    1983-01-01

    A design technique is proposed for linear regulators in which a feedback controller of fixed structure is chosen to minimize an integral quadratic objective function subject to the satisfaction of integral quadratic constraint functions. Application of a nonlinear programming algorithm to this mathematically tractable formulation results in an efficient and useful computer aided design tool. Particular attention is paid to computational efficiency and various recommendations are made. Two design examples illustrate the flexibility of the approach and highlight the special insight afforded to the designer. One concerns helicopter longitudinal dynamics and the other the flight dynamics of an aerodynamically unstable aircraft.

  1. CAD of control systems: Application of nonlinear programming to a linear quadratic formulation

    Science.gov (United States)

    Fleming, P.

    1983-01-01

    The familiar suboptimal regulator design approach is recast as a constrained optimization problem and incorporated in a Computer Aided Design (CAD) package where both design objective and constraints are quadratic cost functions. This formulation permits the separate consideration of, for example, model following errors, sensitivity measures and control energy as objectives to be minimized or limits to be observed. Efficient techniques for computing the interrelated cost functions and their gradients are utilized in conjunction with a nonlinear programming algorithm. The effectiveness of the approach and the degree of insight into the problem which it affords is illustrated in a helicopter regulation design example.

  2. Modelling formulations using gene expression programming--a comparative analysis with artificial neural networks.

    Science.gov (United States)

    Colbourn, E A; Roskilly, S J; Rowe, R C; York, P

    2011-10-09

    This study has investigated the utility and potential advantages of gene expression programming (GEP)--a new development in evolutionary computing for modelling data and automatically generating equations that describe the cause-and-effect relationships in a system--to four types of pharmaceutical formulation and compared the models with those generated by neural networks, a technique now widely used in the formulation development. Both methods were capable of discovering subtle and non-linear relationships within the data, with no requirement from the user to specify the functional forms that should be used. Although the neural networks rapidly developed models with higher values for the ANOVA R(2) these were black box and provided little insight into the key relationships. However, GEP, although significantly slower at developing models, generated relatively simple equations describing the relationships that could be interpreted directly. The results indicate that GEP can be considered an effective and efficient modelling technique for formulation data. Copyright © 2011 Elsevier B.V. All rights reserved.

  3. Mixed-integer representations in control design mathematical foundations and applications

    CERN Document Server

    Prodan, Ionela; Olaru, Sorin; Niculescu, Silviu-Iulian

    2016-01-01

    In this book, the authors propose efficient characterizations of the non-convex regions that appear in many control problems, such as those involving collision/obstacle avoidance and, in a broader sense, in the description of feasible sets for optimization-based control design involving contradictory objectives. The text deals with a large class of systems that require the solution of appropriate optimization problems over a feasible region, which is neither convex nor compact. The proposed approach uses the combinatorial notion of hyperplane arrangement, partitioning the space by a finite collection of hyperplanes, to describe non-convex regions efficiently. Mixed-integer programming techniques are then applied to propose acceptable formulations of the overall problem. Multiple constructions may arise from the same initial problem, and their complexity under various parameters - space dimension, number of binary variables, etc. - is also discussed. This book is a useful tool for academic researchers and grad...

  4. Scenario development as a basis for formulating a research program on future agriculture: a methodological approach.

    Science.gov (United States)

    Oborn, Ingrid; Bengtsson, Jan; Hedenus, Fredrik; Rydhmer, Lotta; Stenström, Maria; Vrede, Katarina; Westin, Charles; Magnusson, Ulf

    2013-11-01

    To increase the awareness of society to the challenges of global food security, we developed five contrasting global and European scenarios for 2050 and used these to identify important issues for future agricultural research. Using a scenario development method known as morphological analysis, scenarios were constructed that took economic, political, technical, and environmental factors into account. With the scenarios as a starting point future challenges were discussed and research issues and questions were identified in an interactive process with stakeholders and researchers. Based on the outcome of this process, six socioeconomic and biophysical overarching challenges for future agricultural were formulated and related research issues identified. The outcome was compared with research priorities generated in five other research programs. In comparison, our research questions focus more on societal values and the role of consumers in influencing agricultural production, as well as on policy formulation and resolving conflicting goals, areas that are presently under-represented in agricultural research. The partly new and more interdisciplinary research priorities identified in Future Agriculture compared to other programs analyzed are likely a result of the methodological approach used, combining scenarios and interaction between stakeholders and researchers.

  5. The effectiveness of scoliosis screening programs: methods for systematic review and expert panel recommendations formulation

    Science.gov (United States)

    2013-01-01

    Background Literature on scoliosis screening is vast, however because of the observational nature of available data and methodological flaws, data interpretation is often complex, leading to incomplete and sometimes, somewhat misleading conclusions. The need to propose a set of methods for critical appraisal of the literature about scoliosis screening, a comprehensive summary and rating of the available evidence appeared essential. Methods To address these gaps, the study aims were: i) To propose a framework for the assessment of published studies on scoliosis screening effectiveness; ii) To suggest specific questions to be answered on screening effectiveness instead of trying to reach a global position for or against the programs; iii) To contextualize the knowledge through expert panel consultation and meaningful recommendations. The general methodological approach proceeds through the following steps: Elaboration of the conceptual framework; Formulation of the review questions; Identification of the criteria for the review; Selection of the studies; Critical assessment of the studies; Results synthesis; Formulation and grading of recommendations in response to the questions. This plan follows at best GRADE Group (Grades of Recommendation, Assessment, Development and Evaluation) requirements for systematic reviews, assessing quality of evidence and grading the strength of recommendations. Conclusions In this article, the methods developed in support of this work are presented since they may be of some interest for similar reviews in scoliosis and orthopaedic fields. PMID:23883346

  6. Quality evaluation of millet-soy blended extrudates formulated through linear programming.

    Science.gov (United States)

    Balasubramanian, S; Singh, K K; Patil, R T; Onkar, Kolhe K

    2012-08-01

    Whole pearl millet, finger millet and decorticated soy bean blended (millet soy) extrudates formulations were designed using a linear programming (LP) model to minimize the total cost of the finished product. LP formulated composite flour was extruded through twin screw food extruder at different feed rate (6.5-13.5 kg/h), screw speed (200-350 rpm, constant feed moisture (14% wb), barrel temperature (120 °C) and cutter speed (15 rpm). The physical, functional, textural and pasting characteristics of extrudates were examined and their responses were studied. Expansion index (2.31) and sectional expansion index (5.39) was found to be was found maximum for feed rate and screw speed combination 9.5 kg/h and 250 rpm. However, density (0.25 × 10(-3) g/mm(3)) was maximum for 9.5 kg/h and 300 rpm combination. Maximum color change (10.32) was found for 9.5 kg/h feed rate and 200 rpm screw speed. The lower hardness was obtained for the samples extruded at lowest feed rate (6.5 kg/h) for all screw speed and feed rate at 9.5 kg/h for 300-350 rpm screw speed. Peak viscosity decreases with all screw speed of 9.5 kg/h feed rate.

  7. 县市级义务教育学校区位配置优化设计与实验%Optimal Location-allocation for County-level Compulsory School Site Selection Using GIS and Integer Linear Programming

    Institute of Scientific and Technical Information of China (English)

    孔云峰; 王震

    2012-01-01

    This paper aims to develop an optimal location-allocation methodology for school site selection using GIS and integer programming. According to the nearby enrollment policy, the authors propose two linear programming models (boolean and integer) with constrains of total school number and school capacity. The models are simplified by eliminating the unreasonable school-residence links for reducing the number of decision variables and therefore solving the problems efficiently. Since the constraint matrix of the boolean model is a sparse matrix with two non-zero elements per row, it can be solved optimally with very small tolerance using branch and cut algorithm. The constraint matrix of the integer model is similar to the totally unimodualr matrix and can be solved optimally. In ArcGIS 10 geoprocessing framework, the school site-selection tool is designed by integrating ArcGIS network analysis, Coin-or linear programming modeler (PuLP) and linear programming solver Cplex 12. School site selection of a county region with 1276 resident points and 50 schools is tested successfully. The related network analysis, model building, model solving and result visualization can be implemented speedily in normal personal computer with Intel Dual-Core 2. 44GHz CPU and 2GB memory. Case study shows that the mathematical models and solution method introduced in this paper are efficient, easy-to-use and practical for large-scale school location-allocation problems. The authors also argue that instead of using heuristic algorithms, many large-size location-allocation problems can be solved using branch and cut algorithm optimally or optimally with very small tolerance.%合理规划学校布局是实现义务教育均衡发展和落实就近入学政策的一个重要途径.为满足县市级中小学校空间布局规划需求,本文以区位配置优化方法解决学校区位选址问题.以平均入学距离为目标,以学校总数、学校学额为约束条件,分别构建P中

  8. Energy Scheduling Method of the Heliostat Field in a Solar Tower Power System Based on Integer Programming%基于整数规划的塔式太阳能镜场能量调度方法

    Institute of Scientific and Technical Information of China (English)

    刘紫军; 王昊; 李佳燕; 赵豫红

    2016-01-01

    We propose an energy scheduling method of the heliostat field,based on integer programming,to meet the requirements of power generation and to save operation costs in a solar tower power plant.We adopt a greedy-PSO (particle swarm optimization)algorithm to solve the optimization problem.The simulation results show that the heliostat field can export a specified energy value in the case of DNI (direct normal insolation) change,which verifies the effectiveness of the proposed method.Furthermore,the method is applied to the control of a water-steam receiver and simulation results indicate that real-time energy demand can be satisfied with the proposed method.%针对塔式太阳能热发电过程中镜场调度既需要满足发电能量需求又需要节省操作成本的问题,提出了一种基于整数规划的镜场能量调度方法,同时采用了一种贪婪—粒子群优化算法进行求解,并通过模拟在DNI(太阳直射辐射,direct nor-mal insolation)变化的情况下,使镜场输出固定的能量值,验证了方法的有效性。将此方法应用于水/蒸汽接收器的系统控制中,仿真结果表明方法能够实时跟踪系统所需能量的变化。

  9. Improvement of 0-1 integer programming based on triple-stranded DNA structure%基于三链DNA结构的0-1整数规划改进研究

    Institute of Scientific and Technical Information of China (English)

    任晓玲; 白雪; 刘希玉

    2013-01-01

    To realize the effective screening of solutions in DNA computing and to prevent the mismatch between probes, the formation of the hairpin structure etc, this paper presented an improved triple-stranded DNA model to solve 0- 1 integer programming problem. This method made a full array of all combinations of n 0-1 variables. Compared with the original one, the amount of DNA strands needed dropped from O((2n) !) to 0(2n n!) and the improved one made a better selection of feasible solutions. Triple-helix structure could be constructed by the homologous double-helix DNA with the oligodeoxyribonucleotides (ODN) in the mediated of RecA protein. It could make use of its special structure to promote it to the selection of solutions with the double-helix computing model.%为实现DNA计算中对解的有效筛选,防止探针与探针之间的错配、发夹结构等,以及便于检测最终解,提出了改进的三链DNA模型求解0-1规划的设计.该方法编码n个变量的每种组合的所有排列情况.此编码方式不仅使计算所需有效分子量从O((2n)!)下降到O(2nn!),并使对可行解的筛选更加有效.利用寡聚脱氧核苷酸(ODN)在RecA蛋白介导下与同源的双链DNA匹配成三螺旋DNA的特点,可推广到更多以双链DNA分子为计算模型的解的检测中.

  10. Effective integer-to-integer transforms for JPEG2000 coder

    Science.gov (United States)

    Przelaskowski, Artur

    2001-12-01

    This paper considers reversible transforms which are used in wavelet compression according to nowadays JPEG2000 standard. Original data decomposition in a form of integer wavelet transformation realized in subband decomposition scheme is optimized by design and selection of the most effective transforms. Lifting scheme is used to construct new biorthogonal symmetric wavelets. Number and distribution of vanishing moments, subband coding gain, associated filter length, computational complexity and number of lifting steps were mainly analyzed in the optimization of designed transforms. Coming from many tests of compression efficiency evaluation in JPEG2000 standardization process, the best selected transforms have been compared to designed ones to conclude the most efficient for compression wavelet bases and their important features. Certain new transforms overcome all other in both phases of lossy-to-lossless compression (e.g. up to 0.5 dB of PSNR for 0.5 bpp in comparison to the state-of-art transforms of JPEG2000 compression, and up to 3dB over 5/3 standard reversible transform). Moreover, the lossy compression efficiency of proposed reversible wavelets is comparable to reference irreversible wavelets potential in several cases. The highest improvement over that reference PSNR values is close to 1.2 dB.

  11. Leak detection in pipelines based on inverse transient analysis and mixed integer nonlinear programming[Includes the CSCE forum on professional practice and career development : 1. international engineering mechanics and materials specialty conference : 1. international/3. coastal, estuarine and offshore engineering specialty conference : 2. international/8. construction specialty conference

    Energy Technology Data Exchange (ETDEWEB)

    Shamloo, H.; Haghighi, A. [K.N. Toosi Univ. of Technology, Tehran (Iran, Islamic Republic of). Dept. of Civil Engineering

    2009-07-01

    The flow properties of pipes are affected by leaks. Leak detection methods based on hydraulic modelling and real data records aim to find a pipe's leak parameters including their number, location and size. Inverse Transient Analysis (ITA), generally in time domain, is a powerful approach to develop leak detection methods with considerable benefits. This paper introduced an ITA based leak detection method along with a numerical model developed for direct transient analysis of leaks in pipes using method of characteristics (MOC). Transient state flow was generated in pipe and the pressure fluctuations were sampled only at the end valve location. To minimize the effects of unsteadiness and uncertainties due to the numerical modeling and also practical problems caused by water hammer, the downstream end valve was considered to be closed gradually within a long enough time. Then, using the sampled data and a direct transient analysis model, a mixed integer nonlinear program was developed. A mixed genetic algorithm was used in which the binary chromosomes were decoded as mixed integer leak locations and real leak areas. In order to find unknown leak parameters in a pipe, an objective function was defined using the least squares criterion of differences between observed and calculated pressure heads at the valve location. The genetic algorithm was found to be a powerful and easy to use optimization tool to solve complicated mixed integer nonlinear program (MINLP) problems in leak detection. 24 refs., 1 tab., 7 figs.

  12. Garbageless reversible implementation of integer linear transformations

    DEFF Research Database (Denmark)

    Burignat, Stéphane; Vermeirsch, Kenneth; De Vos, Alexis;

    2013-01-01

    Discrete linear transformations are important tools in information processing. Many such transforms are injective and therefore prime candidates for a physically reversible implementation into hardware. We present here reversible digital implementations of different integer transformations on fou...

  13. On a correlational clustering of integers

    OpenAIRE

    Aszalós László; Hajdu Lajos (1968-) (matematikus); Pethő Attila (1950-) (matematikus, informatikus)

    2016-01-01

    Correlation clustering is a concept of machine learning. The ultimate goal of such a clustering is to find a partition with minimal conflicts. In this paper we investigate a correlation clustering of integers, based upon the greatest common divisor.

  14. Designing Networks: A Mixed-Integer Linear Optimization Approach

    CERN Document Server

    Gounaris, Chrysanthos E; Kevrekidis, Ioannis G; Floudas, Christodoulos A

    2015-01-01

    Designing networks with specified collective properties is useful in a variety of application areas, enabling the study of how given properties affect the behavior of network models, the downscaling of empirical networks to workable sizes, and the analysis of network evolution. Despite the importance of the task, there currently exists a gap in our ability to systematically generate networks that adhere to theoretical guarantees for the given property specifications. In this paper, we propose the use of Mixed-Integer Linear Optimization modeling and solution methodologies to address this Network Generation Problem. We present a number of useful modeling techniques and apply them to mathematically express and constrain network properties in the context of an optimization formulation. We then develop complete formulations for the generation of networks that attain specified levels of connectivity, spread, assortativity and robustness, and we illustrate these via a number of computational case studies.

  15. Solving Parity Games on Integer Vectors

    OpenAIRE

    Abdulla, Parosh Aziz; Mayr, Richard; Sangnier, Arnaud; Sproston, Jeremy

    2013-01-01

    We consider parity games on infinite graphs where configurations are represented by control-states and integer vectors. This framework subsumes two classic game problems: parity games on vector addition systems with states (vass) and multidimensional energy parity games. We show that the multidimensional energy parity game problem is inter-reducible with a subclass of single-sided parity games on vass where just one player can modify the integer counters and the opponent can only change contr...

  16. Shuttle program. MCC Level C formulation requirements: Entry guidance and entry autopilot

    Science.gov (United States)

    Harpold, J. C.; Hill, O.

    1980-01-01

    A set of preliminary entry guidance and autopilot software formulations is presented for use in the Mission Control Center (MCC) entry processor. These software formulations meet all level B requirements. Revision 2 incorporates the modifications required to functionally simulate optimal TAEM targeting capability (OTT). Implementation of this logic in the MCC must be coordinated with flight software OTT implementation and MCC TAEM guidance OTT. The entry guidance logic is based on the Orbiter avionics entry guidance software. This MCC requirements document contains a definition of coordinate systems, a list of parameter definitions for the software formulations, a description of the entry guidance detailed formulation requirements, a description of the detailed autopilot formulation requirements, a description of the targeting routine, and a set of formulation flow charts.

  17. A comprehensive linear programming tool to optimize formulations of ready-to-use therapeutic foods: An application to Ethiopia

    Science.gov (United States)

    Ready-to-use therapeutic food (RUTF) is the standard of care for children suffering from noncomplicated severe acute malnutrition (SAM). The objective was to develop a comprehensive linear programming (LP) tool to create novel RUTF formulations for Ethiopia. A systematic approach that surveyed inter...

  18. Non Linear Programming (NLP) formulation for quantitative modeling of protein signal transduction pathways.

    Science.gov (United States)

    Mitsos, Alexander; Melas, Ioannis N; Morris, Melody K; Saez-Rodriguez, Julio; Lauffenburger, Douglas A; Alexopoulos, Leonidas G

    2012-01-01

    Modeling of signal transduction pathways plays a major role in understanding cells' function and predicting cellular response. Mathematical formalisms based on a logic formalism are relatively simple but can describe how signals propagate from one protein to the next and have led to the construction of models that simulate the cells response to environmental or other perturbations. Constrained fuzzy logic was recently introduced to train models to cell specific data to result in quantitative pathway models of the specific cellular behavior. There are two major issues in this pathway optimization: i) excessive CPU time requirements and ii) loosely constrained optimization problem due to lack of data with respect to large signaling pathways. Herein, we address both issues: the former by reformulating the pathway optimization as a regular nonlinear optimization problem; and the latter by enhanced algorithms to pre/post-process the signaling network to remove parts that cannot be identified given the experimental conditions. As a case study, we tackle the construction of cell type specific pathways in normal and transformed hepatocytes using medium and large-scale functional phosphoproteomic datasets. The proposed Non Linear Programming (NLP) formulation allows for fast optimization of signaling topologies by combining the versatile nature of logic modeling with state of the art optimization algorithms.

  19. 微电网日内调度计划的混合整数规划模型%Mixed Integer Programming Model for Microgrid Intra-day Scheduling

    Institute of Scientific and Technical Information of China (English)

    孙浩; 张磊; 许海林; 汪隆君

    2015-01-01

    为进一步调和微电网日内调度计划模型求解速度与精度的矛盾,提出了一种适用于微电网日内调度计划的混合整数规划模型。构建了蓄电池充放电过程模型,能有效计及充放电循环次数和老化成本;在现有微电网经济调度模型的基础上,建立了考虑电压幅值的线性化潮流方程、基于解析几何的线性化支路容量、公共连接点功率交换和功率因数限制等约束模型。通过算例验证所提模型,结果表明:①所提模型求解精度高,快速稳定收敛于全局最优解,且不依赖于初值;②蓄电池充放电过程模型符合工程实际,克服了现有模型中蓄电池频繁充放电加剧老化的局限性。%A mixed integer programming model,which can be used in microgrid intra-day scheduling,is put forward in order to conciliate further the desired attributes of accuracy and computational performance in existing intra-day scheduling model.The model of storage battery charge/discharge process,which considers charge/discharge cycles and aging cost,is proposed. Compared with the conventional model for microgrid economical dispatching,the linearized constraint model,such as power flow with voltage amplitude limitation,branch capacity based on Cartesian geometry,transferring power and power factor of point of common couple et al,is established.The numerical results of case studies demonstrate that the proposed model and its solution are of the fast convergence and independent of initial points,and the storage battery model is in line with the practical engineering,overcoming the limitations of the existing model,which accelerates deterioration due to switching frequently between charge and discharge of storage battery.

  20. Study on project portfolio management of water conservancy enterprises based on integer programming%基于整数规划的水利企业项目组合管理研究

    Institute of Scientific and Technical Information of China (English)

    祝付营; 刘永强; 张慧

    2016-01-01

    In order to obtain more economic benefits, most water conservancy enterprises now adopt portfolio management ori-ented towards a number of related projects under the guidance of their overall strategic targets rather than managing a single pro-ject individually. According to the relevance of different projects, a mathematical model is established for water conservancy en-terprises to select projects in the process of portfolio management based on integer programming, which aims at the optimal combi-nation of projects and the maximum benefits of the enterprise. With a water conservancy enterprise as an example, portfolio man-agement is applied to the engineering projects awarded to the enterprise, and the combination of projects which may bring about the maximum benefits is selected. Through the example, the applicability and scientific values of project portfolio management for water conservancy enterprise are proved.%目前,多数水利企业为了获得更高的经济效益已不再仅仅对单个水利项目进行单独管理,而是在企业总体战略目标的指导下对多个相关项目进行组合管理。根据项目之间的相关性,利用整数规划算法构建了水利企业在采用项目组合管理时进行项目选择的数学模型,从而筛选出最优的项目组合,实现企业效益最大化的目标。以某水利企业为例,对其中标的若干个工程项目进行组合管理,选择使其获得最大利润的项目组合。由此阐明在水利企业中应用项目组合管理的适用性和科学性。

  1. 基于混合整数二元规划的机组启动次序策略研究%Generator unit startup sequence strategy based on mixed integer dual programming

    Institute of Scientific and Technical Information of China (English)

    罗宗杰

    2012-01-01

    When the power grid blackout, making the power system restore normal operation quickly and efficiently can not only reduce the equipment damage of the power generation side, but also improve the load restoration speed of the power side. This paper focuses on the ability of the units which have not self-starting time limit, total system capacity constraints, start power limit, and the constraints of unit restoration priority, and gets the unit start sequence strategy for system restoration process through the mixed binary integer programming algorithm. It is concluded that: in a given recovery time, this strategy can get the optimal order of the system unit startup under the premise of ensuring the safe operation of the unit and the maximum generation capacity of system, and can reduce the post-reconstruction and load restoration time directly.%当电网大停电之后,运行人员快速高效地把电力系统恢复到正常运行状态,不仅可以降低发电侧的设备损害程度,还可提高用电侧负荷的恢复速度.重点分析了没有自启动能力的机组时间限制、系统总容量限制、启动功率限制、机组恢复优先权限制等条件,通过混合二元整数规划算法得到系统恢复过程中机组启动次序的策略.结论表明:在给定恢复时间内,采用这种策略能在保证机组的安全运行和系统的最大发电容量的前提下,得到系统机组启动的最优次序,可直接减少后期系统重构和负荷恢复的时间.

  2. Report on article The Travelling Salesman Problem: A Linear Programming Formulation

    CERN Document Server

    Hofman, Radoslaw

    2008-01-01

    This article describes counter example prepared in order to prove that linear formulation of TSP problem proposed in [arXiv:0803.4354] is incorrect (it applies also to QAP problem formulation in [arXiv:0802.4307]). Article refers not only to model itself, but also to ability of extension of proposed model to be correct.

  3. A comparison of formulations and solution methods for the Minimum-Envy Location Problem. Additional results

    CERN Document Server

    Espejo, Inmaculada; Puerto, Justo; Rodriguez-Chia, Antonio

    2008-01-01

    We consider a discrete facility location problem with a new form of equity criterion. The model discussed in the paper analyzes the case where demand points only have strict preference order on the sites where the plants can be located. The goal is to find the location of the facilities minimizing the total envy felt by the entire set of demand points. We define this new total envy criterion and provide several integer linear programming formulations that reflect and model this approach. Extensive computational tests are reported, showing the potentials and limits of each formulation on several types of instances.

  4. A mathematical formulation for interface-based modular product design with geometric and weight constraints

    Science.gov (United States)

    Jung-Woon Yoo, John

    2016-06-01

    Since customer preferences change rapidly, there is a need for design processes with shorter product development cycles. Modularization plays a key role in achieving mass customization, which is crucial in today's competitive global market environments. Standardized interfaces among modularized parts have facilitated computational product design. To incorporate product size and weight constraints during computational design procedures, a mixed integer programming formulation is presented in this article. Product size and weight are two of the most important design parameters, as evidenced by recent smart-phone products. This article focuses on the integration of geometric, weight and interface constraints into the proposed mathematical formulation. The formulation generates the optimal selection of components for a target product, which satisfies geometric, weight and interface constraints. The formulation is verified through a case study and experiments are performed to demonstrate the performance of the formulation.

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

    Science.gov (United States)

    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…

  6. Elementary Theory of Factoring Trinomials with Integer Coefficients over the Integers

    Science.gov (United States)

    Donnell, William A.

    2010-01-01

    An important component of intermediate and college algebra courses involves teaching students methods to factor a trinomial with integer coefficients over the integers. The aim of this article is to present a theoretical justification of that which is often taught, but really never explained as to why it works. The theory is presented, and a…

  7. The use of linear programming to determine whether a formulated complementary food product can ensure adequate nutrients for 6- to 11-month-old Cambodian infants

    DEFF Research Database (Denmark)

    Skau, Jutta Kloppenborg Heick; Bunthang, Touch; Chamnan, Chhoun

    2014-01-01

    A new software tool, Optifood, developed by the WHO and based on linear programming (LP) analysis, has been developed to formulate food-based recommendations.......A new software tool, Optifood, developed by the WHO and based on linear programming (LP) analysis, has been developed to formulate food-based recommendations....

  8. Symmetry Breaking in MILP Formulations for Unit Commitment Problems

    KAUST Repository

    Lima, Ricardo

    2015-12-11

    This paper addresses the study of symmetry in Unit Commitment (UC) problems solved by Mixed Integer Linear Programming (MILP) formulations, and using Linear Programming based Branch & Bound MILP solvers. We propose three sets of symmetry breaking constraints for UC MILP formulations exhibiting symmetry, and its impact on three UC MILP models are studied. The case studies involve the solution of 24 instances by three widely used models in the literature, with and without symmetry breaking constraints. The results show that problems that could not be solved to optimality within hours can be solved with a relatively small computational burden if the symmetry breaking constraints are assumed. The proposed symmetry breaking constraints are also compared with the symmetry breaking methods included in two MILP solvers, and the symmetry breaking constraints derived in this work have a distinct advantage over the methods in the MILP solvers.

  9. Integer Discontinuity of Density Functional Theory

    CERN Document Server

    Mosquera, Martin A

    2014-01-01

    Density functional approximations to the exchange-correlation energy of Kohn-Sham theory, such as the local density approximation and generalized gradient approximations, lack the well-known integer discontinuity, a feature that is critical to describe molecular dissociation correctly. Moreover, standard approximations to the exchange-correlation energy also fail to yield the correct linear dependence of the ground-state energy on the number of electrons when this is a non-integer number obtained from the grand canonical ensemble statistics. We present a formal framework to restore the integer discontinuity of any density functional approximation. Our formalism derives from a formula for the exact energy functional and a new constrained search functional that recovers the linear dependence of the energy on the number of electrons.

  10. Integer Programming Model and Optimization Algorithm for Virtual Host Cloud Storage System%虚拟主机云存储系统整数规划模型及最优化分配算法

    Institute of Scientific and Technical Information of China (English)

    陈晓华; 李春芝; 俞坚奇

    2011-01-01

    With the network storage technology development, how to improve transmission performance and expand storage capacity is problem to be resolved. This paper presents VCloud Storage, a cloud storage system based on virtual host. And it can improve file transmission performance, balance the load and expand storage capacity unlimitedly. It firstly abstracts running state mathematical model of the virtual hosts, then creates integer programming model on the running state mathematical model. By implicit enumeration algorithm, it allocates virtual host to the client storage request optimally. Finally client modules and virtual host modules finish file transmission collaboratively. The experimental result shows that the model and algorithm have optimization effect significantly. VCloud Storage total throughput and average transmission rate is superior to Microsoft's SkyDrive storage,Tencent QQ mailbox store and a single virtual host storage. The proposed model and algorithm enhance file transmission performance and stability, and are an effective method that improves the performance of storage system in WAN network.%随着网络存储技术的发展,如何提高广域网网络存储系统的传输性能和存储容量是亟待解决的同题.本文提出一个基于虚拟主机集群的云存储系统(VCloud Storage),具有良好的负载均衡能力,提高了文件传输性能,同时解决了存储容量无限扩展的问题.本文提出的云存储系统首先抽象虚拟主机运行状态数学模型,然后在虚拟主机运行状态数学模型的基础上建立整数规划模型,利用隐枚举算法,最优化分配虚拟主机给客户端模块的存储请求,最终客户端模块与虚拟主机接口协作完成文件传输.实验结果表明:采用本文提出的模型及算法具有明显的优化效果,VClDud Storage总吞吐量和平均传输率均优于微软SkyDrive存储、腾讯QQ邮箱存储和单虚拟主机存储.本文提出的模型及算法增强了文

  11. Hermitian K-theory of the integers

    OpenAIRE

    Berrick, A. J.; Karoubi, M.

    2005-01-01

    The 2-primary torsion of the higher algebraic K-theory of the integers has been computed by Rognes and Weibel. In this paper we prove analogous results for the Hermitian K-theory of the integers with 2 inverted (denoted by Z'). We also prove in this case the analog of the Lichtenbaum conjecture for the hermitian K-theory of Z' : the homotopy fixed point set of a suitable Z/2 action on the classifying space of the algebraic K-theory of Z' is the hermitian K-theory of Z' after 2-adic completion.

  12. NEW ALGORITHM FOR FAST INTEGER AMBIGUITY RESOLUTION

    Institute of Scientific and Technical Information of China (English)

    HEXiao-feng; HUXiao-ping

    2005-01-01

    Fast integer ambiguity resolution is referred as a key part in precision relative positioning of the GPS carrier phase. A new algorithm for fast integer ambiguity resolution based on LAMBDA and FASF methods is proposed. This algorithm integrates the LAMBDA method and the FASF method, thus improving the efficiency of the ambiguity resolution. Firstly, the ambiguity search space transformation in the LAMBDA method is used,and then the FASF method is used to search ambiguities. Experiments in the relative positioning of about 1 km static baseline demonstrate that the error is less than 1 cm.

  13. A Binomial Integer-Valued ARCH Model.

    Science.gov (United States)

    Ristić, Miroslav M; Weiß, Christian H; Janjić, Ana D

    2016-11-01

    We present an integer-valued ARCH model which can be used for modeling time series of counts with under-, equi-, or overdispersion. The introduced model has a conditional binomial distribution, and it is shown to be strictly stationary and ergodic. The unknown parameters are estimated by three methods: conditional maximum likelihood, conditional least squares and maximum likelihood type penalty function estimation. The asymptotic distributions of the estimators are derived. A real application of the novel model to epidemic surveillance is briefly discussed. Finally, a generalization of the introduced model is considered by introducing an integer-valued GARCH model.

  14. CONDITIONAL FACTORIZATION BASED ON LATTICE THEORY FOR -INTEGERS

    Institute of Scientific and Technical Information of China (English)

    Zheng Yonghui; Zhu Yuefei

    2008-01-01

    In this paper, the integer N = pkq is called a -integer, if p and q are odd primes with almost the same size and k is a positive integer. Such integers were previously proposed for various cryptographic applications. The conditional factorization based on lattice theory for n-bit -integers is considered, and there is an algorithm in time polynomial in n to factor these integers if the least significant |(2k-1)n/(3k-1)(k-1)| bits of p are given.

  15. Extreme Environments Development of Decision Processes and Training Programs for Medical Policy Formulation

    Science.gov (United States)

    Stough, Roger

    2004-01-01

    The purpose of this workshop was to survey existing health and safety policies as well as processes and practices for various extreme environments; to identify strengths and shortcomings of these processes; and to recommend parameters for inclusion in a generic approach to policy formulation, applicable to the broadest categories of extreme environments. It was anticipated that two additional workshops would follow. The November 7, 2003 workshop would be devoted to the evaluation of different model(s) and a concluding expert evaluation of the usefulness of the model using a policy formulation example. The final workshop was planned for March 2004.

  16. Quadratic forms representing all odd positive integers

    CERN Document Server

    Rouse, Jeremy

    2011-01-01

    We consider the problem of classifying all positive-definite integer-valued quadratic forms that represent all positive odd integers. Kaplansky considered this problem for ternary forms, giving a list of 23 candidates, and proving that 19 of those represent all positive odds. (Jagy later dealt with a 20th candidate.) Assuming that the remaining three forms represent all positive odds, we prove that an arbitrary, positive-definite quadratic form represents all positive odds if and only if it represents the odd numbers from 1 up to 451. This result is analogous to Bhargava and Hanke's celebrated 290-theorem. In addition, we prove that these three remaining ternaries represent all positive odd integers, assuming the generalized Riemann hypothesis. This result is made possible by a new analytic method for bounding the cusp constants of integer-valued quaternary quadratic forms $Q$ with fundamental discriminant. This method is based on the analytic properties of Rankin-Selberg $L$-functions, and we use it to prove...

  17. Sums of Integer Squares: A New Look.

    Science.gov (United States)

    Sastry, K. R. S.; Pranesachar, C. R.; Venkatachala, B. J.

    1998-01-01

    Focuses on the study of the sum of two integer squares, neither of which is zero square. Develops some new interesting and nonstandard ideas that can be put to use in number theory class, mathematics club meetings, or popular lectures. (ASK)

  18. Predecessor queries in dynamic integer sets

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting

    1997-01-01

    We consider the problem of maintaining a set of n integers in the range 0.2w–1 under the operations of insertion, deletion, predecessor queries, minimum queries and maximum queries on a unit cost RAM with word size w bits. Let f (n) be an arbitrary nondecreasing smooth function satisfying n...

  19. Polynomial Size Formulations for the Distance and Capacity Constrained Vehicle Routing Problem

    Science.gov (United States)

    Kara, Imdat; Derya, Tusan

    2011-09-01

    The Distance and Capacity Constrained Vehicle Routing Problem (DCVRP) is an extension of the well known Traveling Salesman Problem (TSP). DCVRP arises in distribution and logistics problems. It would be beneficial to construct new formulations, which is the main motivation and contribution of this paper. We focused on two indexed integer programming formulations for DCVRP. One node based and one arc (flow) based formulation for DCVRP are presented. Both formulations have O(n2) binary variables and O(n2) constraints, i.e., the number of the decision variables and constraints grows with a polynomial function of the nodes of the underlying graph. It is shown that proposed arc based formulation produces better lower bound than the existing one (this refers to the Water's formulation in the paper). Finally, various problems from literature are solved with the node based and arc based formulations by using CPLEX 8.0. Preliminary computational analysis shows that, arc based formulation outperforms the node based formulation in terms of linear programming relaxation.

  20. Integer least-squares theory for the GNSS compass

    NARCIS (Netherlands)

    Teunissen, P.J.G.

    2010-01-01

    Global navigation satellite system (GNSS) carrier phase integer ambiguity resolution is the key to highprecision positioning and attitude determination. In this contribution, we develop new integer least-squares (ILS) theory for the GNSS compass model, together with efficient integer search strategi

  1. On the Delone property of (−β-integers

    Directory of Open Access Journals (Sweden)

    Wolfgang Steiner

    2011-08-01

    Full Text Available The (−β-integers are natural generalisations of the β-integers, and thus of the integers, for negative real bases. They can be described by infinite words which are fixed points of anti-morphisms. We show that they are not necessarily uniformly discrete and relatively dense in the real numbers.

  2. Integer least-squares theory for the GNSS compass

    NARCIS (Netherlands)

    Teunissen, P.J.G.

    2010-01-01

    Global navigation satellite system (GNSS) carrier phase integer ambiguity resolution is the key to highprecision positioning and attitude determination. In this contribution, we develop new integer least-squares (ILS) theory for the GNSS compass model, together with efficient integer search

  3. A Dynamic Programming Algorithm for the k-Haplotyping Problem

    Institute of Scientific and Technical Information of China (English)

    Zhen-ping Li; Ling-yun Wu; Yu-ying Zhao; Xiang-sun Zhang

    2006-01-01

    The Minimum Fragments Removal (MFR) problem is one of the haplotyping problems: given a set of fragments, remove the minimum number of fragments so that the resulting fragments can be partitioned into k classes of non-conflicting subsets. In this paper, we formulate the k-MFR problem as an integer linear programming problem, and develop a dynamic programming approach to solve the k-MFR problem for both the gapless and gap cases.

  4. PSLQ: An Algorithm to Discover Integer Relations

    Energy Technology Data Exchange (ETDEWEB)

    Bailey, David H.; Borwein, J. M.

    2009-04-03

    Let x = (x{sub 1}, x{sub 2} {hor_ellipsis}, x{sub n}) be a vector of real or complex numbers. x is said to possess an integer relation if there exist integers a{sub i}, not all zero, such that a{sub 1}x{sub 1} + a{sub 2}x{sub 2} + {hor_ellipsis} + a{sub n}x{sub n} = 0. By an integer relation algorithm, we mean a practical computational scheme that can recover the vector of integers ai, if it exists, or can produce bounds within which no integer relation exists. As we will see in the examples below, an integer relation algorithm can be used to recognize a computed constant in terms of a formula involving known constants, or to discover an underlying relation between quantities that can be computed to high precision. At the present time, the most effective algorithm for integer relation detection is the 'PSLQ' algorithm of mathematician-sculptor Helaman Ferguson [10, 4]. Some efficient 'multi-level' implementations of PSLQ, as well as a variant of PSLQ that is well-suited for highly parallel computer systems, are given in [4]. PSLQ constructs a sequence of integer-valued matrices B{sub n} that reduces the vector y = xB{sub n}, until either the relation is found (as one of the columns of B{sub n}), or else precision is exhausted. At the same time, PSLQ generates a steadily growing bound on the size of any possible relation. When a relation is found, the size of smallest entry of the vector y abruptly drops to roughly 'epsilon' (i.e. 10{sup -p}, where p is the number of digits of precision). The size of this drop can be viewed as a 'confidence level' that the relation is real and not merely a numerical artifact - a drop of 20 or more orders of magnitude almost always indicates a real relation. Very high precision arithmetic must be used in PSLQ. If one wishes to recover a relation of length n, with coefficients of maximum size d digits, then the input vector x must be specified to at least nd digits, and one must employ nd

  5. Integer sparse distributed memory: analysis and results.

    Science.gov (United States)

    Snaider, Javier; Franklin, Stan; Strain, Steve; George, E Olusegun

    2013-10-01

    Sparse distributed memory is an auto-associative memory system that stores high dimensional Boolean vectors. Here we present an extension of the original SDM, the Integer SDM that uses modular arithmetic integer vectors rather than binary vectors. This extension preserves many of the desirable properties of the original SDM: auto-associativity, content addressability, distributed storage, and robustness over noisy inputs. In addition, it improves the representation capabilities of the memory and is more robust over normalization. It can also be extended to support forgetting and reliable sequence storage. We performed several simulations that test the noise robustness property and capacity of the memory. Theoretical analyses of the memory's fidelity and capacity are also presented.

  6. Programming finite element method based hysteresis loss computation software using non-linear superconductor resistivity and T - phiv formulation

    Science.gov (United States)

    Stenvall, A.; Tarhasaari, T.

    2010-07-01

    Due to the rapid development of personal computers from the beginning of the 1990s, it has become a reality to simulate current penetration, and thus hysteresis losses, in superconductors with other than very simple one-dimensional (1D) Bean model computations or Norris formulae. Even though these older approaches are still usable, they do not consider, for example, multifilamentary conductors, local critical current dependency on magnetic field or varying n-values. Currently, many numerical methods employing different formulations are available. The problem of hysteresis losses can be scrutinized via an eddy current formulation of the classical theory of electromagnetism. The difficulty of the problem lies in the non-linear resistivity of the superconducting region. The steep transition between the superconducting and the normal states often causes convergence problems for the most common finite element method based programs. The integration methods suffer from full system matrices and, thus, restrict the number of elements to a few thousands at most. The so-called T - phiv formulation and the use of edge elements, or more precisely Whitney 1-forms, within the finite element method have proved to be a very suitable method for hysteresis loss simulations of different geometries. In this paper we consider making such finite element method software from first steps, employing differential geometry and forms.

  7. Programming finite element method based hysteresis loss computation software using non-linear superconductor resistivity and T - {psi} formulation

    Energy Technology Data Exchange (ETDEWEB)

    Stenvall, A; Tarhasaari, T, E-mail: antti.stenvall@tut.f [Electromagnetics, Tampere University of Technology, PO Box 692, 33101 Tampere (Finland)

    2010-07-15

    Due to the rapid development of personal computers from the beginning of the 1990s, it has become a reality to simulate current penetration, and thus hysteresis losses, in superconductors with other than very simple one-dimensional (1D) Bean model computations or Norris formulae. Even though these older approaches are still usable, they do not consider, for example, multifilamentary conductors, local critical current dependency on magnetic field or varying n-values. Currently, many numerical methods employing different formulations are available. The problem of hysteresis losses can be scrutinized via an eddy current formulation of the classical theory of electromagnetism. The difficulty of the problem lies in the non-linear resistivity of the superconducting region. The steep transition between the superconducting and the normal states often causes convergence problems for the most common finite element method based programs. The integration methods suffer from full system matrices and, thus, restrict the number of elements to a few thousands at most. The so-called T - {psi} formulation and the use of edge elements, or more precisely Whitney 1-forms, within the finite element method have proved to be a very suitable method for hysteresis loss simulations of different geometries. In this paper we consider making such finite element method software from first steps, employing differential geometry and forms.

  8. Recursion formulas for the evaluation of the parabolic cylinder function with integer and half-integer orders

    NARCIS (Netherlands)

    D. Veestraeten

    2015-01-01

    Sums of the parabolic cylinder function for, in absolute value, growing half-integer and integer orders emerge in numerous fields such as time-series analysis, quantum optics and transmission in wireless channels. This paper derives recursion formulas for the parabolic cylinder function with integer

  9. Uses and updating of the Benders method in the integer-mixed programming in the planning of the electric power systems expansion; Usos y actualizacion del metodo de Benders en la programacion entera-mixta y en la planeacion de la expansion de los sistemas electricos de potencia

    Energy Technology Data Exchange (ETDEWEB)

    De la Torre Vega, Eli

    1997-04-01

    In the first chapter the deduction of the Benders cuts are presented, departing from the properties of duality. Also the properties of the Benders cuts are presented, as well as the initial algorithm of Benders to solve any problem of lineal integer-mixed programming are presented. In the second chapter, of the planning of the expansion of means of generation and transmission in an electric power system is presented and the different structures of the mathematical programming it gives rise to and how the method of Benders can be adapted to these. In the third chapter the theoretical contributions of this work are presented: a) How to initialize the master problem to take advantage of the acquired experience after having solved a similar problem, so that it can be solved more efficiently, the succession of integer-mixed problems of linear programming that arise when solving the problem of the planning of the expansion of generation and transmission means in an electric power system. b) How to generate a master problem whose continuous optimal solution corresponds to the optimal continuous one of the integer-mixed problem, so that the search of integer solutions is made in the vicinity of the optimum continuous. c) How to generate an integer solution, close to the optimum continuous of the integer-mixed problem, that has high probability of being feasible, and that is perhaps the optimal integer solution, in a smaller time than that required to solve it in exact form. In addition, other ideas are presented that can be incorporated to the Benders method. In order to show the effectiveness of the proposed ideas, in chapter 4 the results obtained when solving several problems are presented using: 1. The updated Benders method, 2. The branch and bound method, 3. The update of Benders when adding restrictions and 4. The update of Benders when considered as integer each time to more variables. Finally a summary is made of the achievements, of the conclusions obtained and

  10. A Novel Linear Programming Formulation of Maximum Lifetime Routing Problem in Wireless Sensor Networks

    DEFF Research Database (Denmark)

    Cetin, Bilge Kartal; Prasad, Neeli R.; Prasad, Ramjee

    2011-01-01

    of the maximum lifetime routing problem that considers the operation modes of the node. Solution of the linear programming gives the upper analytical bound for the network lifetime. In order to illustrate teh application of the optimization model, we solved teh problem for different parameter settings...... protocols, and the energy model for transmission. In this paper, we tackle the routing challenge for maximum lifetime of the sensor network. We introduce a novel linear programming approach to the maximum lifetime routing problem. To the best of our knowledge, this is the first mathematical programming...

  11. On the convex hull of the simple integer recourse objective function

    NARCIS (Netherlands)

    Klein Haneveld, Willem K.; Stougie, L.; van der Vlerk, Maarten H.

    1995-01-01

    We consider the objective function of a simple integer recourse problem with fixed technology matrix. Using properties of the expected value function, we prove a relation between the convex hull of this function and the expected value function of a continuous simple recourse program. We present an

  12. On the expected value function of a simple integer recourse problem with random technology matrix

    NARCIS (Netherlands)

    Klein Haneveld, Willem K.; van der Vlerk, Maarten H.

    1994-01-01

    In this paper we consider the expected value function of a stochastic simple recourse program with random technology matrix and integer variables in the second stage. Due to its separability the analysis is straightforward. Conditions for finiteness, continuity, Lipschitz continuity and

  13. On the convex hull of the simple integer recourse objective function

    NARCIS (Netherlands)

    Klein Haneveld, Willem K.; Stougie, L.; van der Vlerk, Maarten H.

    1995-01-01

    We consider the objective function of a simple integer recourse problem with fixed technology matrix. Using properties of the expected value function, we prove a relation between the convex hull of this function and the expected value function of a continuous simple recourse program. We present an a

  14. Joint shape segmentation with linear programming

    KAUST Repository

    Huang, Qixing

    2011-01-01

    We present an approach to segmenting shapes in a heterogenous shape database. Our approach segments the shapes jointly, utilizing features from multiple shapes to improve the segmentation of each. The approach is entirely unsupervised and is based on an integer quadratic programming formulation of the joint segmentation problem. The program optimizes over possible segmentations of individual shapes as well as over possible correspondences between segments from multiple shapes. The integer quadratic program is solved via a linear programming relaxation, using a block coordinate descent procedure that makes the optimization feasible for large databases. We evaluate the presented approach on the Princeton segmentation benchmark and show that joint shape segmentation significantly outperforms single-shape segmentation techniques. © 2011 ACM.

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

    Science.gov (United States)

    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.

  16. Quantum Field-Theory in Non-Integer Dimensions.

    Science.gov (United States)

    Eyink, Gregory Lawrence

    In a 1973 paper entitled "Quantum Field-Theory Models in Less Than 4 Dimensions," Kenneth G. Wilson studied field-theories for spacetime dimension d between 2 and 4. With unconventional renormalizations, these models were found to have non-Gaussian ultraviolet renormalization group fixed points. Wilson's method was perturbative "dimensional regularization": the Feynman-graph integrals were analytically continued to non-integer d. His work left open the question of the nonperturbative existence of the models. Since that landmark paper, Yuval Gefen, Amnon Aharony and Benoit B. Mandelbrot have shown that Ising spin models on fractal lattices have critical properties like those predicted for non-integer dimensions by the analytic continuation, or "varepsilon-expansion," method. Our work shows that fractal lattices and continua provide also a nonperturbative definition of field-theories in non-integer dimensions. The fractal point-sets employed are the Sierpinski carpets and their higher-dimensional generalizations. This class of point-sets has a tunable dimension which allows the approach to four from below. Furthermore, the carpets have discrete groups of scale or dilation invariances and infinite order of ramification. A class of scalar field models are defined on these sets which should reduce to the standard models when dnearrow4. The propagator for these models is given by a proper-time or heat-kernel representation. For this propagator, reflection -positivity is established, a general scaling law is conjectured (and established in a special case), and the perturbative renormalizability shown to be governed by the spectral dimensionality. Scalar models with another choice of propagator, the hierarchical propagator, are studied by rigorous renormalization -group methods. Both massless and massive solutions with non-Gaussian ultraviolet fixed points are mathematically constructed. The definition of higher-spin fields, gauge and fermion fields, on fractal spacetimes

  17. A Novel Linear Programming Formulation of Maximum Lifetime Routing Problem in Wireless Sensor Networks

    DEFF Research Database (Denmark)

    Cetin, Bilge Kartal; Prasad, Neeli R.; Prasad, Ramjee

    2011-01-01

    of the maximum lifetime routing problem that considers the operation modes of the node. Solution of the linear programming gives the upper analytical bound for the network lifetime. In order to illustrate teh application of the optimization model, we solved teh problem for different parameter settings...

  18. Decimal Integer Multiplication based on Molecular Beacons

    Directory of Open Access Journals (Sweden)

    Jing Wang

    2013-12-01

    Full Text Available Due to the enhancement of circuit integration level, and the accelerating of working frequency of traditional computer, it requires components dimension must be constantly decreased. So encapsulation, etching and other problems of chip are becoming more and more difficult to solve, which causes its performance also become unstable. In order to overcome this problem, DNA computing as a new kind of molecular computing mode, with its high parallelism, huge amounts of storage capacity, low energy consumption advantages has received extensive attention. Being the same with traditional electronic computer, DNA computer is composed by arithmetic operations such as addition, subtraction, multiplication and dividing and basic logic units such as AND, OR, NON gate. This paper puts forward a new method to realize decimal integer multiplication based on molecular beacons. The algorithm firstly converts decimal integer to binary number, and then resolves the multiplication process into multiplication of current bit and addition of intermediate result after shifting two steps. Molecular beacon is used as multiplying unit, coding sequence is used as multiplier in this method. Based on the working principle of molecular beacon, multiplication operation of two one-bit binary is simulated. And by recording fluorescence status of molecular beacon to observe intermediate result and carry-bit situation, the final result can be obtained through addition after shifting. Examples prove that this method can realize decimal integer multiplication rapidly and accurately. This method is similar to multiplication system in traditional electronic computer, and it provides a simple, easier operation method for DNA computer to realize arithmetic operation.

  19. Integer Set Compression and Statistical Modeling

    DEFF Research Database (Denmark)

    Larsson, N. Jesper

    2014-01-01

    Compression of integer sets and sequences has been extensively studied for settings where elements follow a uniform probability distribution. In addition, methods exist that exploit clustering of elements in order to achieve higher compression performance. In this work, we address the case where...... enumeration of elements may be arbitrary or random, but where statistics is kept in order to estimate probabilities of elements. We present a recursive subset-size encoding method that is able to benefit from statistics, explore the effects of permuting the enumeration order based on element probabilities...

  20. Division Unit for Binary Integer Decimals

    DEFF Research Database (Denmark)

    Lang, Tomas; Nannarelli, Alberto

    2009-01-01

    -recurrence algorithm to BID representation and implement the division unit in standard cell technology. The implementation of the proposed BID division unit is compared to that of a BCD based unit implementing the same algorithm. The comparison shows that for normalized operands the BID unit has the same latency......In this work, we present a radix-10 division unit that is based on the digit-recurrence algorithm and implements binary encodings (binary integer decimal or BID) for significands. Recent decimal division designs are all based on the binary coded decimal (BCD) encoding. We adapt the radix-10 digit...

  1. A linear programming formulation of Mader's edge-disjoint paths problem

    NARCIS (Netherlands)

    Keijsper, J.C.M.; Pendavingh, R.A.; Stougie, L.

    2006-01-01

    We give a dual pair of linear programs for a min–max result of Mader describing the maximum number of edge-disjoint T-paths in a graph G=(V,E) with TV. We conclude that there exists a polynomial-time algorithm (based on the ellipsoid method) for finding the maximum number of T-paths in a

  2. Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem

    DEFF Research Database (Denmark)

    Bektas, Tolga; Erdogan, Günes; Røpke, Stefan

    2011-01-01

    The Generalized Vehicle Routing Problem (GVRP) consists of nding a set of routes for a number of vehicles with limited capacities on a graph with the vertices partitioned into clusters with given demands such that the total cost of travel is minimized and all demands are met. This paper offers four...... new integer linear programming formulations for the GVRP, two based on multicommodity flow and the other two based on exponential sets of inequalities. Branch-and-cut algorithms are proposed for the latter two. Computational results on a large set of instances are presented....

  3. Network Model for The Problem of Integer Balancing of a Fourdimensional Matrix

    Directory of Open Access Journals (Sweden)

    A. V. Smirnov

    2016-01-01

    Full Text Available The problem of integer balancing of a four-dimensional matrix is studied. The elements of the inner part (all four indices are greater than zero of the given real matrix are summed in each direction and each two- and three-dimensional section of the matrix; the total sum is also found. These sums are placed into the elements where one or more indices are equal to zero (according to the summing directions. The problem is to find an integer matrix of the same structure, which can be produced from the initial one by replacing the elements with the largest previous or the smallest following integer. At the same time, the element with four zero indices should be produced with standard rules of rounding - off. In the article the problem of finding the maximum multiple flow in the network of any natural multiplicity   is also studied. There are arcs of three types: ordinary arcs, multiple arcs and multi-arcs. Each multiple and multi-arc is a union of   linked arcs, which are adjusted with each other. The network constructing rules are described. The definitions of a divisible network and some associated subjects are stated. There are defined the basic principles for reducing the integer balancing problem of an  -dimensional matrix (  to the problem of finding the maximum flow in a divisible multiple network of multiplicity  . There are stated the rules for reducing the four-dimensional balancing problem to the maximum flow problem in the network of multiplicity 5. The algorithm of finding the maximum flow, which meets the solvability conditions for the integer balancing problem, is formulated for such a network.

  4. On the Miller-Tucker-Zemlin Based Formulations for the Distance Constrained Vehicle Routing Problems

    Science.gov (United States)

    Kara, Imdat

    2010-11-01

    Vehicle Routing Problem (VRP), is an extension of the well known Traveling Salesman Problem (TSP) and has many practical applications in the fields of distribution and logistics. When the VRP consists of distance based constraints it is called Distance Constrained Vehicle Routing Problem (DVRP). However, the literature addressing on the DVRP is scarce. In this paper, existing two-indexed integer programming formulations, having Miller-Tucker-Zemlin based subtour elimination constraints, are reviewed. Existing formulations are simplified and obtained formulation is presented as formulation F1. It is shown that, the distance bounding constraints of the formulation F1, may not generate the distance traveled up to the related node. To do this, we redefine the auxiliary variables of the formulation and propose second formulation F2 with new and easy to use distance bounding constraints. Adaptation of the second formulation to the cases where new restrictions such as minimal distance traveled by each vehicle or other objectives such as minimizing the longest distance traveled is discussed.

  5. Observations on the linear programming formulation of the single reflector design problem.

    Science.gov (United States)

    Canavesi, Cristina; Cassarly, William J; Rolland, Jannick P

    2012-02-13

    We implemented the linear programming approach proposed by Oliker and by Wang to solve the single reflector problem for a point source and a far-field target. The algorithm was shown to produce solutions that aim the input rays at the intersections between neighboring reflectors. This feature makes it possible to obtain the same reflector with a low number of rays - of the order of the number of targets - as with a high number of rays, greatly reducing the computation complexity of the problem.

  6. Horizontal visibility graphs from integer sequences

    Science.gov (United States)

    Lacasa, Lucas

    2016-09-01

    The horizontal visibility graph (HVG) is a graph-theoretical representation of a time series and builds a bridge between dynamical systems and graph theory. In recent years this representation has been used to describe and theoretically compare different types of dynamics and has been applied to characterize empirical signals, by extracting topological features from the associated HVGs which have shown to be informative on the class of dynamics. Among some other measures, it has been shown that the degree distribution of these graphs is a very informative feature that encapsulates nontrivial information of the series's generative dynamics. In particular, the HVG associated to a bi-infinite real-valued series of independent and identically distributed random variables is a universal exponential law P(k)=(1/3){(2/3)}k-2, independent of the series marginal distribution. Most of the current applications have however only addressed real-valued time series, as no exact results are known for the topological properties of HVGs associated to integer-valued series. In this paper we explore this latter situation and address univariate time series where each variable can only take a finite number n of consecutive integer values. We are able to construct an explicit formula for the parametric degree distribution {P}n(k), which we prove to converge to the continuous case for large n and deviates otherwise. A few applications are then considered.

  7. An experiment on Lowest Unique Integer Games

    Science.gov (United States)

    Yamada, Takashi; Hanaki, Nobuyuki

    2016-12-01

    We experimentally study Lowest Unique Integer Games (LUIGs) to determine if and how subjects self-organize into different behavioral classes. In a LUIG, N(≥ 3) players submit a positive integer up to M and the player choosing the smallest number not chosen by anyone else wins. LUIGs are simplified versions of real systems such as Lowest/Highest Unique Bid Auctions that have been attracting attention from scholars, yet experimental studies are scarce. Furthermore, LUIGs offer insights into choice patterns that can shed light on the alleviation of congestion problems. Here, we consider four LUIGs with N = { 3 , 4 } and M = { 3 , 4 } . We find that (a) choices made by more than 1/3 of subjects were not significantly different from what a symmetric mixed-strategy Nash equilibrium (MSE) predicts; however, (b) subjects who behaved significantly differently from what the MSE predicts won the game more frequently. What distinguishes subjects was their tendencies to change their choices following losses.

  8. Prime labeling of families of trees with Gaussian integers

    Directory of Open Access Journals (Sweden)

    Steven Klee

    2016-08-01

    Full Text Available A graph on n vertices is said to admit a prime labeling if we can label its vertices with the first n natural numbers such that any two adjacent vertices have relatively prime labels. Here we extend the idea of prime labeling to the Gaussian integers, which are the complex numbers whose real and imaginary parts are both integers. We begin by defining an order on the Gaussian integers that lie in the first quadrant. Using this ordering, we show that several families of trees admit a prime labeling with the Gaussian integers.

  9. Modified Filled Function to Solve NonlinearProgramming Problem

    Institute of Scientific and Technical Information of China (English)

    2015-01-01

    Filled function method is an approach to find the global minimum of nonlinear functions. Many Problems, such as computing,communication control, and management, in real applications naturally result in global optimization formulations in a form ofnonlinear global integer programming. This paper gives a modified filled function method to solve the nonlinear global integerprogramming problem. The properties of the proposed modified filled function are also discussed in this paper. The results ofpreliminary numerical experiments are also reported.

  10. Detection of gross errors using mixed integer optimization approach in process industry

    Institute of Scientific and Technical Information of China (English)

    MEI Cong-li; SU Hong-ye; CHU Jian

    2007-01-01

    A novel mixed integer linear programming (NMILP) model for detection of gross errors is presented in this paper.Yamamura et al.(1988) designed a model for detection of gross errors and data reconciliation based on Akaike information criterion (AIC). But much computational cost is needed due to its combinational nature. A mixed integer linear programming (MILP)approach was performed to reduce the computational cost and enhance the robustness. But it loses the super performance of maximum likelihood estimation. To reduce the computational cost and have the merit of maximum likelihood estimation, the simultaneous data reconciliation method in an MILP framework is decomposed and replaced by an NMILP subproblem and a quadratic programming (QP) or a least squares estimation (LSE) subproblem. Simulation result of an industrial case shows the high efficiency of the method.

  11. Systematic network synthesis and design: Problem formulation, superstructure generation, data management and solution

    DEFF Research Database (Denmark)

    Quaglia, Alberto; Gargalo, Carina L.; Chairakwongsa, Siwanat;

    2015-01-01

    The developments obtained in recent years in the field of mathematical programming considerably reduced the computational time and resources needed to solve large and complex Mixed Integer Non Linear Programming (MINLP) problems. Nevertheless, the application of these methods in industrial practice...... when large problems are considered. In an earlier work, we proposed a computer-aided framework for synthesis and design of process networks. In this contribution, we expand the framework by including methods and tools developed to structure, automate and simplify the mathematical formulation...... is still limited by the complexity associated with the mathematical formulation of some problems. In particular, the tasks of design space definition and representation as superstructure, as well as the data collection, validation and handling may become too complex and cumbersome to execute, especially...

  12. On Secure Two-Party Integer Division

    DEFF Research Database (Denmark)

    Dahl, Morten; Ning, Chao; Toft, Tomas

    2012-01-01

    We consider the problem of secure integer division: given two Paillier encryptions of ℓ-bit values n and d, determine an encryption of $\\lfloor \\frac{n}{d}\\rfloor$ without leaking any information about n or d. We propose two new protocols solving this problem. The first requires $\\ensuremath......{\\mathcal{O}}(\\ell)$ arithmetic operations on encrypted values (secure addition and multiplication) in $\\ensuremath{\\mathcal{O}}(1)$ rounds. This is the most efficient constant-rounds solution to date. The second protocol requires only $\\ensuremath{\\mathcal{O}} \\left( (\\log^2 \\ell)(\\kappa + \\operatorname{loglog} \\ell) \\right......)$ arithmetic operations in $\\ensuremath{\\mathcal{O}}(\\log^2 \\ell)$ rounds, where κ is a correctness parameter. Theoretically, this is the most efficient solution to date as all previous solutions have required Ω(ℓ) operations. Indeed, the fact that an o(ℓ) solution is possible at all is highly surprising....

  13. AGGREGATE PRODUCTION PLANNING MODEL BASED ON MIXED INTEGER LINEAR PROGRAMMING - KARMA TAMSAYILI DOĞRUSAL PROGRAMLAMA YÖNTEMİ İLE BÜTÜNLEŞİK ÜRETİM PLANLAMASI

    Directory of Open Access Journals (Sweden)

    Veli ULUÇAM

    2010-07-01

    Full Text Available Abstract:This work presents a mixed integer linearprogramming method developed by using 0-1 variables forsolving aggregate production planning problem with thefollowing performance criteria: (1 maximize profit, (2minimize costs. The production planning activities are calledas aggregate production planning when both it is producedmore than one goods and the demand changes period byperiod. The purpose of aggregate production planning is not toprepare detailed plans for each goods, it is to do plans forwhole goods produced in the firm together to take in hand.Aggregate production planning is probably one of the mostimportant, yet least understood, jobs that a manager performs.However, all parts of the organization, operations, marketing,finance, and so on, must work together in the planning processto ensure that they are moving in harmony with one another.Aggregate production planning is such a method that canmove all parts of the organizations in same harmony.Özet:Bu çalışmada; kazançların maksimize edilirkenmaliyetlerin minimize edilebileceği bir bütünleşik üretimplanlama probleminin, 0–1 değişkenleri kullanılarakgeliştirilmiş karma tamsayılı doğrusal programlama tekniği ileçözümü anlatılmaktadır. Birden fazla çeşitte ürünün bir aradaüretildiği ve talebin dönemlere göre değişiklik gösterdiğidurumlarda üretim planlama faaliyetleri bütünleşik üretimplanlama olarak tanımlanır. Planlama çalışmalarınınbütünleşik olma niteliği, bu yöntemin tek tek ürünlerin detaylıplanlarının hazırlanması amacıyla değil, işletme tarafındanüretilen tüm ürünlerin bir arada ele alınarak planlamaçalışmalarının yapılmasıdır. Son yıllarda daha iyi anlaşıldığıüzere, bütünleşik üretim planlaması bir yöneticininperformansını etkileyen en önemli kriterdir. Bununla beraberbir işletmenin tüm bölümleri, üretim, pazarlama, finans vediğerleri aynı ahenk içersinde ve uyumlu olarak

  14. Superposition of two optical vortices with opposite integer or non-integer orbital angular momentum

    Directory of Open Access Journals (Sweden)

    Carlos Fernando Díaz Meza

    2016-04-01

    Full Text Available This work develops a brief proposal to achieve the superposition of two opposite vortex beams, both with integer or non-integer mean value of the orbital angular momentum. The first part is about the generation of this kind of spatial light distributions through a modified Brown and Lohmann’s hologram. The inclusion of a simple mathematical expression into the pixelated grid’s transmittance function, based in Fourier domain properties, shifts the diffraction orders counterclockwise and clockwise to the same point and allows the addition of different modes. The strategy is theoretically and experimentally validated for the case of two opposite rotation helical wavefronts.

  15. Garbage-free reversible constant multipliers for arbitrary integers

    DEFF Research Database (Denmark)

    Mogensen, Torben Ægidius

    2013-01-01

    We present a method for constructing reversible circuitry for multiplying integers by arbitrary integer constants. The method is based on Mealy machines and gives circuits whose size are (in the worst case) linear in the size of the constant. This makes the method unsuitable for large constants......, but gives quite compact circuits for small constants. The circuits use no garbage or ancillary lines....

  16. On the Relationship between Integer Lifting and Rounding Transform

    Directory of Open Access Journals (Sweden)

    R. Vargic

    2007-12-01

    Full Text Available In this paper we analyze the relationship between integer Lifting scheme and Rounding transform as means to compute the wavelet transform in signal processing area. We bring some new results which better describe relationship, reversibility and equivalence of integer lifting scheme and rounding transform concept.

  17. A Paper-and-Pencil gcd Algorithm for Gaussian Integers

    Science.gov (United States)

    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.

  18. Mixed-Integer Nonconvex Quadratic Optimization Relaxations and Performance Analysis

    Science.gov (United States)

    2016-10-11

    formulates many online resource allocation and revenue management problems is the online linear program (0-1-ILP) in which the constraint matrix is...column is revealed without observing the future inputs and the goal is to maximize the overall objective function. In this paper, we provide a near

  19. Integer lattice dynamics for Vlasov-Poisson

    Science.gov (United States)

    Mocz, Philip; Succi, Sauro

    2017-03-01

    We revisit the integer lattice (IL) method to numerically solve the Vlasov-Poisson equations, and show that a slight variant of the method is a very easy, viable, and efficient numerical approach to study the dynamics of self-gravitating, collisionless systems. The distribution function lives in a discretized lattice phase-space, and each time-step in the simulation corresponds to a simple permutation of the lattice sites. Hence, the method is Lagrangian, conservative, and fully time-reversible. IL complements other existing methods, such as N-body/particle mesh (computationally efficient, but affected by Monte Carlo sampling noise and two-body relaxation) and finite volume (FV) direct integration schemes (expensive, accurate but diffusive). We also present improvements to the FV scheme, using a moving-mesh approach inspired by IL, to reduce numerical diffusion and the time-step criterion. Being a direct integration scheme like FV, IL is memory limited (memory requirement for a full 3D problem scales as N6, where N is the resolution per linear phase-space dimension). However, we describe a new technique for achieving N4 scaling. The method offers promise for investigating the full 6D phase-space of collisionless systems of stars and dark matter.

  20. Integer Lattice Dynamics for Vlasov-Poisson

    CERN Document Server

    Mocz, Philip

    2016-01-01

    We revisit the integer lattice (IL) method to numerically solve the Vlasov-Poisson equations, and show that a slight variant of the method is a very easy, viable, and efficient numerical approach to study the dynamics of self-gravitating, collisionless systems. The distribution function lives in a discretized lattice phase-space, and each time-step in the simulation corresponds to a simple permutation of the lattice sites. Hence, the method is Lagrangian, conservative, and fully time-reversible. IL complements other existing methods, such as N-body/particle mesh (computationally efficient, but affected by Monte-Carlo sampling noise and two-body relaxation) and finite volume (FV) direct integration schemes (expensive, accurate but diffusive). We also present improvements to the FV scheme, using a moving mesh approach inspired by IL, to reduce numerical diffusion and the time-step criterion. Being a direct integration scheme like FV, IL is memory limited (memory requirement for a full 3D problem scales as N^6, ...

  1. The integer quantum hall effect revisited

    Energy Technology Data Exchange (ETDEWEB)

    Michalakis, Spyridon [Los Alamos National Laboratory; Hastings, Matthew [Q STATION, CALIFORNIA

    2009-01-01

    For T - L x L a finite subset of Z{sup 2}, let H{sub o} denote a Hamiltonian on T with periodic boundary conditions and finite range, finite strength intetactions and a unique ground state with a nonvanishing spectral gap. For S {element_of} T, let q{sub s} denote the charge at site s and assume that the total charge Q = {Sigma}{sub s {element_of} T} q{sub s} is conserved. Using the local charge operators q{sub s}, we introduce a boundary magnetic flux in the horizontal and vertical direction and allow the ground state to evolve quasiadiabatically around a square of size one magnetic flux, in flux space. At the end of the evolution we obtain a trivial Berry phase, which we compare, via a method reminiscent of Stokes Theorem. to the Berry phase obtained from an evolution around an exponentially small loop near the origin. As a result, we show, without any averaging assumption, that the Hall conductance is quantized in integer multiples of e{sup 2}/h up to exponentially small corrections of order e{sup -L/{zeta}}, where {zeta}, is a correlation length that depends only on the gap and the range and strength of the interactions.

  2. Diversity and non-integer differentiation for system dynamics

    CERN Document Server

    Oustaloup, Alain

    2014-01-01

    Based on a structured approach to diversity, notably inspired by various forms of diversity of natural origins, Diversity and Non-integer Derivation Applied to System Dynamics provides a study framework to the introduction of the non-integer derivative as a modeling tool. Modeling tools that highlight unsuspected dynamical performances (notably damping performances) in an ""integer"" approach of mechanics and automation are also included. Written to enable a two-tier reading, this is an essential resource for scientists, researchers, and industrial engineers interested in this subject area. Ta

  3. Generalization of a few results in Integer Partitions

    CERN Document Server

    Dastidar, Manosij Ghosh

    2011-01-01

    In this paper, we generalize a few important results in Integer Partitions; namely the results known as Stanley's theorem and Elder's theorem, and the congruence results proposed by Ramanujan for the partition function. We generalize the results of Stanley and Elder from a fixed integer to an array of subsequent integers, and propose an analogue of Ramanujan's congruence relations for the `number of parts' function instead of the partition function. We also deduce the generating function for the `number of parts', and relate the technical results with their graphical interpretations through a novel use of the Ferrer's diagrams.

  4. Compiler for Fast, Accurate Mathematical Computing on Integer Processors Project

    Data.gov (United States)

    National Aeronautics and Space Administration — The proposers will develop a computer language compiler to enable inexpensive, low-power, integer-only processors to carry our mathematically-intensive comptutations...

  5. Mixed-integer vertex covers on bipartite graphs

    NARCIS (Netherlands)

    Gerards, A.M.H.; Conforti, M.; Zambelli, G.; Fischetti, M.; Williamson, D.P.

    2007-01-01

    Let $A$ be the edge-node incidence matrix of a bipartite graph $G = (U, V ; E)$, $I$ be a subset of the nodes of $G$, and $b$ be a vector such that $2b$ is integral. We consider the following mixed-integer set: $X(G, b, I) = {x : Ax ≥ b, x ≥ 0, x_i$ integer for all $i ∈ I}$

  6. Minimizing the Integer Ambiguity Search Space for RTK

    Institute of Scientific and Technical Information of China (English)

    Yang Yun-chun; R. R. Hatch; R. T. Sharpe

    2003-01-01

    Differential GPS carrier phase measurements have much lower noise and multipath error than that of pseudorange measurements.The result is centimeter accuracy for Real-Time Kinematic (RTK).However, the measurement of the carrier phase has a constant unknown integer ambiguity. Several technical issues are related to solving the integer ambiguity correctly. They are: proper stochastic model, search space definition and initialization, search space reduction, state and standard deviation calculation, validation and rejection criteria for the unique and correct candidate. Search space reduction is critically important. It not only affects the ambiguity resolution speed, but also defines the ambiguity resolution success rate. The smaller the search space, the easier it is to find the unique and correct candidate set. The paper analyzes the integer ambiguity search space in its residual domain.The search space is minimized by: Analyzing the maximum independent integer ambiguity measurement set theoretically; Selecting the best initial measurement set that minimizes the search range of each satellite in the set and reduces the error effects from noise that may cause the wrong integer ambiguity solution for the remaining satellites not contained in the initial measurement set.Since the Residual Sensitive Matrix (S-Matrix) relates the integer ambiguity candidate set directly to post-fix residuals, it is not necessary to compute a fix for each candidate set thus making the integ erambiguity search process much more efficient. Also, minimizing the search space in the residual domain improves the search efficiency significantly and at the same time improves its reliability. Performance issues, such as recursive and weighted search techniques as well as methods for improving reliability, are also discussed in the article.

  7. Um modelo de otimização inteira mista e heurísticas relax and fix para a programação da produção de fábricas de refrigerantes de pequeno porte A mixed integer programming model and relax and fix heuristics for the production scheduling of small scale soft drink plants

    Directory of Open Access Journals (Sweden)

    Deisemara Ferreira

    2008-01-01

    Full Text Available Neste artigo propomos um modelo de otimização inteira mista para o problema de dimensionamento e seqüenciamento dos lotes de produção em fábricas de refrigerantes de pequeno porte, com tempos e custos de set up de produção dependentes do seqüenciamento dos lotes. O modelo considera o estágio de envase como sendo o gargalo da produção da planta, o que é comum em fábricas de pequeno porte com uma única linha de envase, e restrições de lote mínimo do estágio de xaroparia. Variações da heurística relax and fix são propostas e comparadas na solução de exemplares do modelo, gerados com dados reais de uma fábrica localizada no interior do Estado de São Paulo. Os resultados mostram que as abordagens são capazes de gerar soluções melhores do que as utilizadas pela empresa.In this paper we propose a mixed integer programming model to the lot sizing and sequencing problem of a soft drink plant with sequence-dependent set up costs and times. The model considers that the bottling stage is the production bottleneck, which is common in small plants with only one production line, and minimum lot size constrains of the syrup stage. Variations of the relax and fix heuristic are proposed and compared. A computational study with instances generated based on real data from a plant situated in the State of São Paulo-Brazil is also presented. The results show that the approaches are capable to produce better solutions than the ones from the company.

  8. Fractal electrodynamics via non-integer dimensional space approach

    Energy Technology Data Exchange (ETDEWEB)

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

    2015-09-25

    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. - Highlights: • Electrodynamics of fractal media is described by non-integer dimensional spaces. • Applications of the fractal Gauss's and Ampere's laws are suggested. • Fractal Poisson equation, equation for fractal stream of charges are considered.

  9. Non-integer expansion embedding techniques for reversible image watermarking

    Science.gov (United States)

    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.

  10. Security-Constrained Unit Commitment Based on a Realizable Energy Delivery Formulation

    Directory of Open Access Journals (Sweden)

    Hongyu Wu

    2012-01-01

    Full Text Available Security-constrained unit commitment (SCUC is an important tool for independent system operators in the day-ahead electric power market. A serious issue arises that the energy realizability of the staircase generation schedules obtained in traditional SCUC cannot be guaranteed. This paper focuses on addressing this issue, and the basic idea is to formulate the power output of thermal units as piecewise-linear function. All individual unit constraints and systemwide constraints are then reformulated. The new SCUC formulation is solved within the Lagrangian relaxation (LR framework, in which a double dynamic programming method is developed to solve individual unit subproblems. Numerical testing is performed for a 6-bus system and an IEEE 118-bus system on Microsoft Visual C# .NET platform. It is shown that the energy realizability of generation schedules obtained from the new formulation is guaranteed. Comparative case study is conducted between LR and mixed integer linear programming (MILP in solving the new formulation. Numerical results show that the near-optimal solution can be obtained efficiently by the proposed LR-based method.

  11. Integer programming for the generalized high school timetabling problem

    DEFF Research Database (Denmark)

    Kristiansen, Simon; Sørensen, Matias; Stidsen, Thomas Riis

    2015-01-01

    Recently, the XHSTT format for high school timetabling was introduced. It provides a uniform way of modeling problem instances and corresponding solutions. The format supports a wide variety of constraints, and currently 38 real-life instances from 11 different countries are available. Thereby...

  12. An integer linear programming model for an Ecovat buffer

    NARCIS (Netherlands)

    Goeijen, de Gijs J.; Smit, Gerard J.M.; Hurink, Johann L.

    2016-01-01

    An increase in the number of volatile renewables in the electricity grid enhances the imbalance of supply and demand. One promising candidate to solve this problem is to improve the energy storage. The Ecovat system is a new seasonal thermal energy storage system currently under development. In this

  13. New Approaches for Very Large-Scale Integer Programming

    Science.gov (United States)

    2016-06-24

    problems. In the context of MIP, some recent works propose ML techniques for constructing a portfolio of good parameter configurations for a MIP solver... benefit of being instance-specific and of continuing the branch-and-bound seamlessly, without losing work when switching between learning and prediction...computational results on instances from MIPLIB 2010 illustrating the benefits of this framework. DISTRIBUTION A: Distribution approved for public release

  14. Heuristic Procedures for 0-1 Integer Programming.

    Science.gov (United States)

    1987-03-01

    A 30 60 0.021 0 ST B 30 60 0.010 0 ie 40 Chapter 4 Conclusions A heuristic algorithm aims at obtaining a very good feasible solution relatively...Department of Operations Research, Stanford University, February, 1977. 19. Ibaraki, T., Ohashi, T., and Mine, H. " A Heuristic Algorithm for Mixed

  15. Stochastic Dynamic Mixed-Integer Programming (SD-MIP)

    Science.gov (United States)

    2015-05-05

    et al (2009), there is continuing interest in using SA methods for SP problems. This genre of methods creates a sequence of sampled subgradients...Phone Number Contact phone number if there is a problem with the report 213-740-6810 Organization / Institution name University of Southern California

  16. Vertical partitioning of relational OLTP databases using integer programming

    DEFF Research Database (Denmark)

    Amossen, Rasmus Resen

    2010-01-01

    A way to optimize performance of relational row store databases is to reduce the row widths by vertically partition- ing tables into table fractions in order to minimize the number of irrelevant columns/attributes read by each transaction. This pa- per considers vertical partitioning algorithms...... for relational row- store OLTP databases with an H-store-like architecture, meaning that we would like to maximize the number of single-sited transactions. We present a model for the vertical partitioning problem that, given a schema together with a vertical partitioning and a workload, estimates the costs...... (bytes read/written by storage layer access methods and bytes transferred between sites) of evaluating the workload on the given partitioning. The cost model allows for arbitrarily prioritizing load balancing of sites vs. total cost minimization. We show that finding a minimum-cost vertical partitioning...

  17. 基于模糊整数规划的水质浮标光伏/蓄电池动力源配置优化%Collaborative optimization of photovoltaic/battery power source for water quality buoy based on fuzzy integer programming

    Institute of Scientific and Technical Information of China (English)

    张慧妍; 李爽; 于家斌; 王小艺; 许继平

    2015-01-01

    , temperature and relative humidity, and its output was daily generating capacity of photovoltaic power. When the daily generating capacity was less than zero, it was the rainy day without electricity output. And so the maximum continuous rainy days of poor photovoltaic power generation were effectively set by the historical meteorological data of the buoy operation place. Then, for the possible size deviations between the expected and the practical values, a fuzzy integer programming algorithm was proposed. The advocated solution fused the characteristics of Werners algorithm and cutting-plane method. It transformed the objective function and fuzzy constraints into the general constraints, and the Werners symmetric model was obtained. The cutting-plane method was used to get the integer solution of the model, which would optimize the design parameter configuration of PV-battery power source with the fluctuation tolerance. Later, the sensitivity analysis of the maximum consecutive rainy days was carried out to investigate the fluctuating effect of weather factor on the system stability. Finally, the simulation examples indicated that the maximum continuous rainy days could be reduced by 5 d, which meant to reduce 33.3% margin requirements of the storage battery. By the proposed fuzzy integer programming method, the parameters of electric power supply for the water quality monitoring buoy were obtained with the minimum construction cost and maximum fuzzy membership degree. It was helpful to overcome the fluctuation of the size of the buoy body in practice, which would improve the feasibility and effectiveness of the theoretical method applied. Sensitivity analysis showed that when the maximum continuous rainy days extended occasionally to 1 d, the power source still could support the running of water quality monitoring buoy. This research provides a feasible solution to the problems of the renewable stand-alone energy power generation system of water quality monitoring buoy. The

  18. Multiplicity of Summands in the Random Partitions of an Integer

    Indian Academy of Sciences (India)

    Ghurumuruhan Ganesan

    2013-02-01

    In this paper, we prove a conjecture of Yakubovich regarding limit shapes of `slices’ of two-dimensional (2D) integer partitions and compositions of when the number of summands $m\\sim An^$ for some >0 and $ < \\frac{1}{2}$. We prove that the probability that there is a summand of multiplicity in any randomly chosen partition or composition of an integer goes to zero asymptotically with provided is larger than a critical value. As a corollary, we strengthen a result due to Erdös and Lehner (Duke Math. J. 8(1941) 335–345) that concerns the relation between the number of integer partitions and compositions when $=\\frac{1}{3}$.

  19. The lattice of integer flows of a regular matroid

    CERN Document Server

    Su, Yi

    2009-01-01

    For a finite multigraph G, let \\Lambda(G) denote the lattice of integer flows of G -- this is a finitely generated free abelian group with an integer-valued positive definite bilinear form. Bacher, de la Harpe, and Nagnibeda show that if G and H are 2-isomorphic graphs then \\Lambda(G) and \\Lambda(H) are isometric, and remark that they were unable to find a pair of nonisomorphic 3-connected graphs for which the corresponding lattices are isometric. We explain this by examining the lattice \\Lambda(M) of integer flows of any regular matroid M. Let M_\\bullet be the minor of M obtained by contracting all co-loops. We show that \\Lambda(M) and \\Lambda(N) are isometric if and only if M_\\bullet and N_\\bullet are isomorphic.

  20. 根据露天矿长期计划自动形成短期计划的0-1整数规划方法%Automatic formation of short-term plan based on the long-term plan on open-pit mine using O-1 integer programming

    Institute of Scientific and Technical Information of China (English)

    孙效玉; 张维国; 陈毓; 王侠; 孙梦红

    2012-01-01

    针对露天矿生产不均衡产生的长期计划与短期计划严重脱节问题,通过对露天矿时空发展关系的分析,分时段建立露天矿短期计划的0-1整数规划模型,提出了超级组合块的概念,论述了短期计划优化处理逻辑。并在Surpac平台上采用TCL语言二次开发完成长期计划制作、台阶条块划分与动态显示功能,在VC++环境下通过调用LindoAPI数学软件自动优化形成短期计划。结果只需十几分钟到几小时的时间,即可实现传统方法根本无力解决的根据长期计划自动形成短期计划、进而验证长期计划的难题,实践证明这种方法稳定性强、工作效率高。%To solve the confliction between long-term and short-term production plan on open-pit mine, established a 0- 1 integer programming model of short-term plans by time period applying with space-time development, and a new con- cept of "super combo blocks" was proposed and the progress logic of short-term plan was dealt with. It implemented the design of long-term plan, dividing blocks from strip benches and dynamic displaying by secondary development using the TCL language on the Surpac software platform. The short-term plan could be automatically optimized by call- ing LindoAPI mathematical software under Visual C + + environment. It solved the problem that the short-term plan cannot be drawn out from automatic optimization based on long-term plan, but the program running time could be mi- nutes or few hours. The reliability and efficiency of the method is proved in the work field.

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

    Science.gov (United States)

    Jacob, J Augustin; Kumar, N Senthil

    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.

  2. Capacity Development and Strengthening for Energy Policy formulation and implementation of Sustainable Energy Projects in Indonesia CASINDO. Deliverable No. 17. Development of Education Programs at Indonesian Universities

    Energy Technology Data Exchange (ETDEWEB)

    Wijnker, M. [Eindhoven University of Technology TUE, Eindhoven (Netherlands)

    2011-08-15

    The overall objective of the CASINDO programme is to establish a self-sustaining and self-developing structure at both the national and regional level to build and strengthen human capacity to enable the provinces of North Sumatra, Yogyakarta, Central Java, West Nusa Tenggara and Papua to formulate sound policies for renewable energy and energy efficiency and to develop and implement sustainable energy projects. All five Indonesian partner universities managed to develop and implement an education program within the timeline of the CASINDO project. UMY (Muhammadiyah University of Yogyakarta, Indonesia), UNRAM (University of Mataram, Mataram, Indonesia) and UNCEN (Cenderawasih University, Jayapura, Papua, Indonesia) have chosen to develop a certificate program. UNDIP (Diponegoro University in Semarang, Java, Indonesia) and USU (University of Sumatra Utara, Medan, Indonesia) have both developed a master program in sustainable energy. UNDIP has already discussed the proposal of their master program with the Ministry of Education and will have to make some improvements. USU will first start the program as a specialisation within the Mechanical Engineering department and in some time continues to make it an independent master program. At all universities both contact persons and lecturers have put a lot of effort in developing the programs and succeeded. Additionally, through CASINDO a network of lecturers between the universities has developed, which will ease future cooperation, after the CASINDO project will have finished.

  3. Arithmetic progressions in Salem-type subsets of the integers

    CERN Document Server

    Potgieter, Paul

    2010-01-01

    Given a subset of the integers of zero density, we define the weaker notion of fractional density of such a set. It is shown how this notion corresponds to that of the Hausdorff dimension of a compact subset of the reals. We then show that a version of a theorem of {\\L}aba and Pramanik on 3-term arithmetic progressions in subsets of the unit interval also holds for subsets of the integers with fractional density and satisfying certain Fourier-decay conditions.

  4. Compact Mathematical Programs For DEC-MDPs With Structured Agent Interactions

    CERN Document Server

    Mostafa, Hala

    2012-01-01

    To deal with the prohibitive complexity of calculating policies in Decentralized MDPs, researchers have proposed models that exploit structured agent interactions. Settings where most agent actions are independent except for few actions that affect the transitions and/or rewards of other agents can be modeled using Event-Driven Interactions with Complex Rewards (EDI-CR). Finding the optimal joint policy can be formulated as an optimization problem. However, existing formulations are too verbose and/or lack optimality guarantees. We propose a compact Mixed Integer Linear Program formulation of EDI-CR instances. The key insight is that most action sequences of a group of agents have the same effect on a given agent. This allows us to treat these sequences similarly and use fewer variables. Experiments show that our formulation is more compact and leads to faster solution times and better solutions than existing formulations.

  5. Modeling an integrated hospital management planning problem using integer optimization approach

    Science.gov (United States)

    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.

  6. 6th Conference on Non-integer Order Calculus and Its Applications

    CERN Document Server

    Łukaniszyn, Marian; Stanisławski, Rafał

    2015-01-01

    This volume presents selected aspects of non-integer, or fractional order systems, whose analysis, synthesis and applications have increasingly become a real challenge for various research communities, ranging from science to engineering. The spectrum of applications of the fractional order calculus has incredibly expanded, in fact it would be hard to find a science/engineering-related subject area where the fractional calculus had not been incorporated. The content of the fractional calculus is ranged from pure mathematics to engineering implementations and so is the content of this volume. The volume is subdivided into six parts, reflecting particular aspects of the fractional order calculus. The first part contains a single invited paper on a new formulation of fractional-order descriptor observers for fractional-order descriptor continous LTI systems. The second part provides new elements to the mathematical theory of fractional-order systems. In the third part of this volume, a bunch of new results in ap...

  7. Quantum recurrence and integer ratios in neutron resonances

    Energy Technology Data Exchange (ETDEWEB)

    Ohkubo, Makio

    1998-03-01

    Quantum recurrence of the compound nucleus in neutron resonance reactions are described for normal modes which are excited on the compound nucleus simultaneously. In the structure of the recurrence time, integer relations among dominant level spacings are derived. The `base modes` are assumed as stable combinations of the normal modes, preferably excited in many nuclei. (author)

  8. Unique Factorization in Cyclotomic Integers of Degree Seven

    Science.gov (United States)

    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…

  9. Leveraging Structure: Logical Necessity in the Context of Integer Arithmetic

    Science.gov (United States)

    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…

  10. Limit theorems for bifurcating integer-valued autoregressive processes

    CERN Document Server

    Blandin, Vassili

    2012-01-01

    We study the asymptotic behavior of the weighted least squares estimators of the unknown parameters of bifurcating integer-valued autoregressive processes. Under suitable assumptions on the immigration, we establish the almost sure convergence of our estimators, together with the quadratic strong law and central limit theorems. All our investigation relies on asymptotic results for vector-valued martingales.

  11. Happy and Sad Thoughts: An Exploration of Children's Integer Reasoning

    Science.gov (United States)

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

    2012-01-01

    The purpose of this study was to investigate elementary children's conceptions that might serve as foundations for integer reasoning. Working from an abstract algebraic perspective and using an opposite-magnitudes context that is relevant to children, we analyzed the reasoning of 33 children in grades K-5. We focus our report on three prominent…

  12. Automorphisms of semigroups of invertible matrices with nonnegative integer elements

    Energy Technology Data Exchange (ETDEWEB)

    Semenov, Pavel P [M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, Moscow (Russian Federation)

    2012-09-30

    Let G{sub n}(Z) be the subsemigroup of GL{sub n}(Z) consisting of the matrices with nonnegative integer coefficients. In the paper, the automorphisms of this semigroup are described for n{>=}2. Bibliography: 5 titles.

  13. A fast DFT algorithm using complex integer transforms

    Science.gov (United States)

    Reed, I. S.; Truong, T. K.

    1978-01-01

    Winograd's algorithm for computing the discrete Fourier transform is extended considerably for certain large transform lengths. This is accomplished by performing the cyclic convolution, required by Winograd's method, by a fast transform over certain complex integer fields. This algorithm requires fewer multiplications than either the standard fast Fourier transform or Winograd's more conventional algorithms.

  14. Triangular Numbers, Gaussian Integers, and KenKen

    Science.gov (United States)

    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…

  15. Algorithms and Data Structures for Strings, Points and Integers

    DEFF Research Database (Denmark)

    Vind, Søren Juhl

    This dissertation presents our research in the broad area of algorithms and data structures. More specifically, we show solutions for the following problems related to strings, points and integers. Results hold on the Word RAM and we measure space in w-bit words. Compressed Fingerprints. The Karp...

  16. Negative Integer Understanding: Characterizing First Graders' Mental Models

    Science.gov (United States)

    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…

  17. Happy and Sad Thoughts: An Exploration of Children's Integer Reasoning

    Science.gov (United States)

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

    2012-01-01

    The purpose of this study was to investigate elementary children's conceptions that might serve as foundations for integer reasoning. Working from an abstract algebraic perspective and using an opposite-magnitudes context that is relevant to children, we analyzed the reasoning of 33 children in grades K-5. We focus our report on three prominent…

  18. Simple integer recourse models : convexity and convex approximations

    NARCIS (Netherlands)

    Klein Haneveld, W.K.; Stougie, L.; van der Vlerk, M.H.

    We consider the objective function of a simple recourse problem with fixed technology matrix and integer second-stage variables. Separability due to the simple recourse structure allows to study a one-dimensional version instead. Based on an explicit formula for the objective function, we derive a

  19. Simple Integer Recourse Models : Convexity and Convex Approximations

    NARCIS (Netherlands)

    Klein Haneveld, Willem K.; Stougie, L; van der Vlerk, Maarten H.

    2004-01-01

    We consider the objective function of a simple recourse problem with fixed technology matrix and integer second-stage variables. Separability due to the simple recourse structure allows to study a one-dimensional version instead. Based on an explicit formula for the objective function, we derive a

  20. Modelos de programação inteira mista para o planejamento do corte unidimensional de tubos metálicos na indústria aeronáutica agrícola Mixed integer programming models for the planning of one-dimensional metallic pipe cutting in the aeronautics industry

    Directory of Open Access Journals (Sweden)

    Alexander Abuabara

    2008-12-01

    Full Text Available Este trabalho busca otimizar o planejamento do processo de corte unidimensional de tubos estruturais metálicos utilizados na fabricação de aeronaves leves agrícolas. Dois modelos de programação linear inteira mista são apresentados com o objetivo de minimizar as perdas do material cortado e considerando a possibilidade de gerar sobras com tamanhos suficientes para reaproveitamento (retalhos. Os modelos são resolvidos por meio de uma linguagem de modelagem usando um software de otimização. Para a validação dos modelos, dois experimentos computacionais foram realizados com dados reais de uma carteira de pedidos de uma aeronave leve voltada para o segmento do mercado agrícola, o Ipanema, produzido pela empresa brasileira Neiva/Embraer. As soluções dos modelos são comparadas com as soluções de uma heurística residual de arredondamento guloso da literatura e também com as soluções utilizadas pela empresa. Os resultados mostram que os modelos são úteis para apoiar as decisões envolvidas no planejamento deste processo de corte.This study aims to optimize the one-dimensional cutting process planning of structural metallic tubes used to build agricultural light aircrafts. Two mixed integer linear programming models are presented to minimize the waste of material cut and considering the possibility of generating surpluses with sizes sufficiently large for reuse (leftovers. The models are solved using a commercial modeling language and an optimization solver. For the validation of the models, two computational experiments were performed with actual data from the portfolio of a light aircraft designed for agricultural purposes, the Ipanema, produced by the Brazilian company Neiva/Embraer. The solutions of the models are compared with the solutions of a constructive heuristic of the literature and the solutions used by the company. The results show that the models are useful for being used in the planning of this cutting process.

  1. Uso combinado de sistemas de informações geográficas para transportes e programação linear inteira mista em problemas de localização de instalações Combining geographic information systems for transportation and mixed integer linear programming in location-allocation problems

    Directory of Open Access Journals (Sweden)

    Sílvia Maria Santana Mapa

    2012-01-01

    Full Text Available O objetivo do trabalho é avaliar a qualidade das soluções para o problema de localização-alocação de instalações geradas por um SIG-T (Sistema de Informação Geográfica para Transportes, obtidas após a utilização combinada das rotinas Localização de Facilidades e Problema do Transporte, quando comparadas com as soluções ótimas obtidas a partir de modelo matemático exato baseado em Programação Linear Inteira Mista (PLIM, desenvolvido externamente ao SIG. Os modelos foram aplicados a três simulações: a primeira propõe a abertura de fábricas e alocação de clientes no Estado de São Paulo; a segunda envolve um atacadista e um estudo de localização de centros de distribuição e alocação dos clientes varejistas; a terceira localiza creches em um contexto urbano, alocando a demanda. Os resultados mostraram que, quando se considera a capacidade das instalações, o modelo otimizante PLIM chegou a apresentar, em um dos cenários simulados, resultados até 37% melhores do que o SIG, além de propor locais diferentes para abertura de novas instalações. Quando não se considera a capacidade, o modelo SIG se mostrou tão eficiente quanto o modelo exato PLIM, chegando exatamente às mesmas soluções.This study aims to evaluate the quality of the solutions for facility location-allocation problems generated by a GIS-T (Geographic Information System for Transportation software. These solutions were obtained from combining the Facility Location and Transportation Problem routines, when compared with the optimal solutions, which were obtained using the exact mathematical model based on the Mixed Integer Linear Programming (MILP developed externally to the GIS. The models were applied to three simulations: the first one proposes set up businesses and customers' allocation in the state of São Paulo; the second involves a wholesaler and an investigation of distribution center location and retailers' allocation; and the third one

  2. A generalization of the MDS method by mixed integer linear and nonlinear mathematical models

    Directory of Open Access Journals (Sweden)

    Sadegh Niroomand

    2014-09-01

    Full Text Available The Multi-Dimensional Scaling (MDS method is used in statistics to detect hidden interrelations among multi-dimensional data and it has a wide range of applications. The method’s input is a matrix that describes the similarity/dissimilarity among objects of unknown dimension. The objects are generally reconstructed as points of a lower dimensional space to reveal the geometric configuration of the objects. The original MDS method uses Euclidean distance, for measuring both the distance of the reconstructed points and the bias of the reconstructed distances from the original similarity values. In this paper, these distances are distinguished, and distances other than Euclidean are also used, generalizing the MDS method. Two different distances may be used for the two different purposes. Therefore the instances of the generalized MDS model are denoted as  model, where the first distance is the type of distance of the reconstructed points and the second one measures the bias of the reconstructed distances and the similarity values. In the case of   and   distances mixed-integer programming models are provided. The computational experiences show that the generalized model can catch the key properties of the original configuration, if any exist. Keywords: Multivariate Analysis; Multi-Dimensional Scaling; Optimization; Mixed Integer Linear Programming; Statistics.

  3. Efficient Algorithms for gcd and Cubic Residuosity in the Ring of Eisenstein Integers

    DEFF Research Database (Denmark)

    Damgård, Ivan Bjerre; Frandsen, Gudmund Skovbjerg

    2003-01-01

    We present simple and efficient algorithms for computing gcd and cubic residuosity in the ring of Eisenstein integers, bf Z[ ]i.e. the integers extended with , a complex primitive third root of unity. The algorithms are similar and may be seen as generalisations of the binary integer gcd and deri...... primality tests and the implementation of cryptographic protocols....

  4. GNSS integer ambiguity estimation and evaluation: LAMBDA and Ps-LAMBDA

    NARCIS (Netherlands)

    Li, B.; Verhagen, A.A.; Teunissen, P.J.G.

    2013-01-01

    Successful integer carrier-phase ambiguity resolution is crucial for high precision GNSS applications. It includes both integer estimation and evaluation. For integer estimation, the LAMBDA method has been applied in a wide variety of GNSS applications. The method’s popularity stems from its numeric

  5. Multimode Preemptive Resource Investment Problem Subject to Due Dates for Activities: Formulation and Solution Procedure

    Directory of Open Access Journals (Sweden)

    Behrouz Afshar-Nadjafi

    2014-01-01

    Full Text Available The preemptive Multimode resource investment problem is investigated. The Objective is to minimize the total renewable/nonrenewable resource costs and earliness-tardiness costs by a given project deadline and due dates for activities. In this problem setting preemption is allowed with no setup cost or time. The project contains activities interrelated by finish-start type precedence relations with a time lag of zero, which require a set of renewable and nonrenewable resources. The problem formed in this way is an NP-hard. A mixed integer programming formulation is proposed for the problem and parameters tuned genetic algorithm (GA is proposed to solve it. To evaluate the performance of the proposed algorithm, 120 test problems are used. Comparative statistical results reveal that the proposed GA is efficient and effective in terms of the objective function and computational times.

  6. Computer program for analysis of high speed, single row, angular contact, spherical roller bearing, SASHBEAN. Volume 2: Mathematical formulation and analysis

    Science.gov (United States)

    Aggarwal, Arun K.

    1993-01-01

    Spherical roller bearings have typically been used in applications with speeds limited to about 5000 rpm and loads limited for operation at less than about 0.25 million DN. However, spherical roller bearings are now being designed for high load and high speed applications including aerospace applications. A computer program, SASHBEAN, was developed to provide an analytical tool to design, analyze, and predict the performance of high speed, single row, angular contact (including zero contact angle), spherical roller bearings. The material presented is the mathematical formulation and analytical methods used to develop computer program SASHBEAN. For a given set of operating conditions, the program calculates the bearings ring deflections (axial and radial), roller deflections, contact areas stresses, depth and magnitude of maximum shear stresses, axial thrust, rolling element and cage rotational speeds, lubrication parameters, fatigue lives, and rates of heat generation. Centrifugal forces and gyroscopic moments are fully considered. The program is also capable of performing steady-state and time-transient thermal analyses of the bearing system.

  7. A Secret Image Sharing Method Using Integer Wavelet Transform

    Directory of Open Access Journals (Sweden)

    Li Ching-Chung

    2007-01-01

    Full Text Available A new image sharing method, based on the reversible integer-to-integer (ITI wavelet transform and Shamir's threshold scheme is presented, that provides highly compact shadows for real-time progressive transmission. This method, working in the wavelet domain, processes the transform coefficients in each subband, divides each of the resulting combination coefficients into shadows, and allows recovery of the complete secret image by using any or more shadows . We take advantages of properties of the wavelet transform multiresolution representation, such as coefficient magnitude decay and excellent energy compaction, to design combination procedures for the transform coefficients and processing sequences in wavelet subbands such that small shadows for real-time progressive transmission are obtained. Experimental results demonstrate that the proposed method yields small shadow images and has the capabilities of real-time progressive transmission and perfect reconstruction of secret images.

  8. Two dimensional convolute integers for machine vision and image recognition

    Science.gov (United States)

    Edwards, Thomas R.

    1988-01-01

    Machine vision and image recognition require sophisticated image processing prior to the application of Artificial Intelligence. Two Dimensional Convolute Integer Technology is an innovative mathematical approach for addressing machine vision and image recognition. This new technology generates a family of digital operators for addressing optical images and related two dimensional data sets. The operators are regression generated, integer valued, zero phase shifting, convoluting, frequency sensitive, two dimensional low pass, high pass and band pass filters that are mathematically equivalent to surface fitted partial derivatives. These operators are applied non-recursively either as classical convolutions (replacement point values), interstitial point generators (bandwidth broadening or resolution enhancement), or as missing value calculators (compensation for dead array element values). These operators show frequency sensitive feature selection scale invariant properties. Such tasks as boundary/edge enhancement and noise or small size pixel disturbance removal can readily be accomplished. For feature selection tight band pass operators are essential. Results from test cases are given.

  9. Integer-ambiguity resolution in astronomy and geodesy

    CERN Document Server

    Lannes, André

    2013-01-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.

  10. Optimization of integer wavelet transforms based on difference correlation structures.

    Science.gov (United States)

    Li, Hongliang; Liu, Guizhong; Zhang, Zhongwei

    2005-11-01

    In this paper, a novel lifting integer wavelet transform based on difference correlation structure (DCCS-LIWT) is proposed. First, we establish a relationship between the performance of a linear predictor and the difference correlations of an image. The obtained results provide a theoretical foundation for the following construction of the optimal lifting filters. Then, the optimal prediction lifting coefficients in the sense of least-square prediction error are derived. DCCS-LIWT puts heavy emphasis on image inherent dependence. A distinct feature of this method is the use of the variance-normalized autocorrelation function of the difference image to construct a linear predictor and adapt the predictor to varying image sources. The proposed scheme also allows respective calculations of the lifting filters for the horizontal and vertical orientations. Experimental evaluation shows that the proposed method produces better results than the other well-known integer transforms for the lossless image compression.

  11. A NOVEL INTEGER FREQUENCY OFFSET ESTIMATOR FOR OFDM

    Institute of Scientific and Technical Information of China (English)

    Cai Xuelian; Li Jiandong; Li Changle; Chen Chen

    2005-01-01

    One of the principal disadvantages of Orthogonal Frequency Division Multiplexing (OFDM) is very sensitive to carrier frequency offset. The integer frequency offset has no effect on the orthogonality among the subcarriers, but it causes a circular shift and phase rotation of the received data symbols sequence, resulting in a Bit Error Rate(BER) of 0.5. In this paper,a novel integer frequency offset estimator for OFDM is derived based on maximum likelihood estimation technique and exploration of the differential relation between two consecutive OFDM data symbol sequences in frequency domain. Its performance is compared with the conventional method by computer simulations for the additive white Gaussian noise channel and a multipath fading channel. Simulation results show that the performance of the proposed estimator is better than the conventional estimator.

  12. Linear Independence of -Logarithms over the Eisenstein Integers

    Directory of Open Access Journals (Sweden)

    Peter Bundschuh

    2010-01-01

    Full Text Available For fixed complex with ||>1, the -logarithm is the meromorphic continuation of the series ∑>0/(−1,||1,≠,2,3,…. In 2004, Tachiya showed that this is true in the Subcase =ℚ, ∈ℤ, =−1, and the present authors extended this result to arbitrary integer from an imaginary quadratic number field , and provided a quantitative version. In this paper, the earlier method, in particular its arithmetical part, is further developed to answer the above question in the affirmative if is the Eisenstein number field √ℚ(−3, an integer from , and a primitive third root of unity. Under these conditions, the linear independence holds also for 1,(,(−1, and both results are quantitative.

  13. Some new thin sets of integers in Harmonic Analysis

    CERN Document Server

    Li, Daniel; Rodriguez-Piazza, Luis

    2009-01-01

    We randomly construct various subsets $\\Lambda$ of the integers which have both smallness and largeness properties. They are small since they are very close, in various meanings, to Sidon sets: the continuous functions with spectrum in $\\Lambda$ have uniformly convergent series, and their Fourier coefficients are in $\\ell_p$ for all $p>1$; moreover, all the Lebesgue spaces $L^q_\\Lambda$ are equal for $q<+\\infty$. On the other hand, they are large in the sense that they are dense in the Bohr group and that the space of the bounded functions with spectrum in $\\Lambda$ is non separable. So these sets are very different from the thin sets of integers previously known.

  14. Low Complexity Integer Transform and Adaptive Quantization Optimization

    Institute of Scientific and Technical Information of China (English)

    Si-Wei Ma; Wen Gao

    2006-01-01

    In this paper, a new low complexity integer transform is proposed, which has been adopted by AVS1-PT. The proposed transform can enable AVS1-P7 to share the same quantization/dequantization table with AVS1-P2. As the bases of the proposed transform coefficients are very close, the transform normalization can be implemented only on the encoder side and the dequantization table size can be reduced compared with the transform used in H.264/MPEG-4 AVC. Along with the feature of the proposed transform, adaptive dead-zone quantization optimization for the proposed transform is studied.Experimental results show that the proposed integer transform has similar coding performance compared with the transform used in H.264/MPEG-4 AVC, and would gain near 0.1dB with the adaptive dead-zone quantization optimization.

  15. Consequences of the Continuity of the Monic Integer Transfinite Diameter

    CERN Document Server

    Hilmar, Jan

    2007-01-01

    We consider the problem of determining the monic integer transfinite diameter t_M(I)&=&\\lim_{n\\to\\infty}\\inf_{p_n\\in{\\mathcal M_n}}\\supnorm{p_n}{I}^{1/n} for real intervals of length less than 4. We show the $t_M([0,x])$, as a function in $x>0$, is continuous, therefore disproving two conjectures due to Hare and Smyth. Consequently, for $n>2\\in\

  16. Computing Integer Powers in Floating-Point Arithmetic

    CERN Document Server

    Kornerup, Peter; Muller, Jean-Michel

    2007-01-01

    We introduce two algorithms for accurately evaluating powers to a positive integer in floating-point arithmetic, assuming a fused multiply-add (fma) instruction is available. We show that our log-time algorithm always produce faithfully-rounded results, discuss the possibility of getting correctly rounded results, and show that results correctly rounded in double precision can be obtained if extended-precision is available with the possibility to round into double precision (with a single rounding).

  17. Computing Integer Powers in Floating-Point Arithmetic

    OpenAIRE

    Kornerup, Peter; Lefèvre, Vincent; Muller, Jean-Michel

    2007-01-01

    We introduce two algorithms for accurately evaluating powers to a positive integer in floating-point arithmetic, assuming a fused multiply-add (fma) instruction is available. We show that our log-time algorithm always produce faithfully-rounded results, discuss the possibility of getting correctly rounded results, and show that results correctly rounded in double precision can be obtained if extended-precision is available with the possibility to round into double precision (with a single rou...

  18. THE ALGORITHMS OF AN INTEGER PARTITIONING WITH ITS APPLICATIONS

    Institute of Scientific and Technical Information of China (English)

    曹立明; 周强

    1994-01-01

    In the light of the ideals of Artificial Intelligence(AI) , three algorithms of an integer partitioning have been given in this paper:generate and test algorithm ,and two heuristic algorithms about forward partition and backward partition. PROLOG has been used to describe algorithms, it is reasonable, direct and simple. In the sight of describing algorithms ,it is a new and valid try. At last, some intresting applications of the algorithms mentioned in the paper have been presented.

  19. Optimal source codes for geometrically distributed integer alphabets

    Science.gov (United States)

    Gallager, R. G.; Van Voorhis, D. C.

    1975-01-01

    An approach is shown for using the Huffman algorithm indirectly to prove the optimality of a code for an infinite alphabet if an estimate concerning the nature of the code can be made. Attention is given to nonnegative integers with a geometric probability assignment. The particular distribution considered arises in run-length coding and in encoding protocol information in data networks. Questions of redundancy of the optimal code are also investigated.

  20. On Integers, Primes and UniqueFactorization in Quadratic Fields

    OpenAIRE

    Hedenlund, Alice

    2013-01-01

    Abstract. This thesis will deal with quadratic elds. The prob- lem is to study such elds and their properties including, but not limited to, determining integers, nding primes and deciding which quadratic elds have unique factorization. The goal is to get famil- iar with these concepts and to provide a starting point for students with an interest in algebra to explore eld extensions and inte- gral closures in relation to elementary number theory. The reader will be assumed to have a basic kn...

  1. Application of Integer and Fractional Models in Electrochemical Systems

    Directory of Open Access Journals (Sweden)

    Isabel S. Jesus

    2012-01-01

    Full Text Available This paper describes the use of integer and fractional electrical elements, for modelling two electrochemical systems. A first type of system consists of botanical elements and a second type is implemented by electrolyte processes with fractal electrodes. Experimental results are analyzed in the frequency domain, and the pros and cons of adopting fractional-order electrical components for modelling these systems are compared.

  2. Integers without Large Prime Factors in Short Intervals: Conditional Results

    Indian Academy of Sciences (India)

    Goutam Pal; Satadal Ganguly

    2010-11-01

    Under the Riemann hypothesis and the conjecture that the order of growth of the argument of $(1/2+it)$ is bounded by $(\\log t)^{\\frac{1}{2}+o(1)}$, we show that for any given > 0 the interval $(X, X+\\sqrt{X}(\\log X)^{1/2+o(1)}]$ contains an integer having no prime factor exceeding $X^$ for all sufficiently large.

  3. Integer Sequences of the Form $\\alpha^n \\pm \\beta^n$

    CERN Document Server

    Abdulaziz, Abdulrahman Ali

    2010-01-01

    In this paper, we find all integer sequences of the form a^n + b^n, where a and b are complex numbers and n is a nonnegative integer. We prove that if p and q are integers, then there is a correspondence between the roots of the quadratic equation z^2 - pz - q = 0 and integer sequences of the form a^n + b^n. In addition, we will show that there are no integer sequences of the form a^n - b^n. Finally, we use special values of a and b to obtain a range of formulas involving Lucas and Fibonacci numbers.

  4. Efficient Big Integer Multiplication and Squaring Algorithms for Cryptographic Applications

    Directory of Open Access Journals (Sweden)

    Shahram Jahani

    2014-01-01

    Full Text Available Public-key cryptosystems are broadly employed to provide security for digital information. Improving the efficiency of public-key cryptosystem through speeding up calculation and using fewer resources are among the main goals of cryptography research. In this paper, we introduce new symbols extracted from binary representation of integers called Big-ones. We present a modified version of the classical multiplication and squaring algorithms based on the Big-ones to improve the efficiency of big integer multiplication and squaring in number theory based cryptosystems. Compared to the adopted classical and Karatsuba multiplication algorithms for squaring, the proposed squaring algorithm is 2 to 3.7 and 7.9 to 2.5 times faster for squaring 32-bit and 8-Kbit numbers, respectively. The proposed multiplication algorithm is also 2.3 to 3.9 and 7 to 2.4 times faster for multiplying 32-bit and 8-Kbit numbers, respectively. The number theory based cryptosystems, which are operating in the range of 1-Kbit to 4-Kbit integers, are directly benefited from the proposed method since multiplication and squaring are the main operations in most of these systems.

  5. Liquid chromatographic method for the simultaneous determination of captopril, piroxicam, and amlodipine in bulk drug, pharmaceutical formulation, and human serum by programming the detector.

    Science.gov (United States)

    Sultana, Najma; Arayne, M Saeed; Ali, Saeeda Nadir

    2013-10-01

    A highly sensitive LC method with UV detection has been developed for the simultaneous determination of coadministered drugs captopril, piroxicam, and amlodipine in bulk drug, pharmaceutical formulations, and human serum at the isosbestic point (235 nm) and at individual λmax (220, 255, and 238 nm, respectively) by programming the detector with time to match the individual analyte's chromophore, which enhanced the sensitivity with linear range. The assay involved an isocratic elution of analytes on a Bondapak C18 (10 μm, 25 × 0.46 cm) column at ambient temperature using a mobile phase of methanol/water 80:20 at pH 2.9 and a flow rate of 1.0 mL/min. Linearity was found to be 0.25-25, 0.10-6.0, and 0.20-13.0 μg/mL with correlation coefficient >0.998 and detection limits of 7.39, 3.90, and 9.38 ng/mL, respectively, whereas calibration curves for wavelength-programmed analysis were 0.10-6.0, 0.04-2.56, and 0.10-10.0 μg/mL with correlation coefficient >0.998 and detection limits of 5.79, 2.68, and 3.87 ng/mL, respectively. All the validated parameters were in the acceptable range. The recovery of drugs was 99.32-100.39 and 98.65-101.96% in pharmaceutical formulation and human serum, respectively, at the isosbestic point and at individual λmax . This method is applicable for the analysis of drugs in bulk drug, tablets, serum, and in clinical samples without interference of excipients or endogenous serum components.

  6. Hybrid 3-D rocket trajectory program. Part 1: Formulation and analysis. Part 2: Computer programming and user's instruction. [computerized simulation using three dimensional motion analysis

    Science.gov (United States)

    Huang, L. C. P.; Cook, R. A.

    1973-01-01

    Models utilizing various sub-sets of the six degrees of freedom are used in trajectory simulation. A 3-D model with only linear degrees of freedom is especially attractive, since the coefficients for the angular degrees of freedom are the most difficult to determine and the angular equations are the most time consuming for the computer to evaluate. A computer program is developed that uses three separate subsections to predict trajectories. A launch rail subsection is used until the rocket has left its launcher. The program then switches to a special 3-D section which computes motions in two linear and one angular degrees of freedom. When the rocket trims out, the program switches to the standard, three linear degrees of freedom model.

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

    Science.gov (United States)

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

    2016-11-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.

  8. Finite-element three-dimensional ground-water (FE3DGW) flow model - formulation, program listings and users' manual

    Energy Technology Data Exchange (ETDEWEB)

    Gupta, S.K.; Cole, C.R.; Bond, F.W.

    1979-12-01

    The Assessment of Effectiveness of Geologic Isolation Systems (AEGIS) Program is developing and applying the methodology for assessing the far-field, long-term post-closure safety of deep geologic nuclear waste repositories. AEGIS is being performed by Pacific Northwest Laboratory (PNL) under contract with the Office of Nuclear Waste Isolation (OWNI) for the Department of Energy (DOE). One task within AEGIS is the development of methodology for analysis of the consequences (water pathway) from loss of repository containment as defined by various release scenarios. Analysis of the long-term, far-field consequences of release scenarios requires the application of numerical codes which simulate the hydrologic systems, model the transport of released radionuclides through the hydrologic systems to the biosphere, and, where applicable, assess the radiological dose to humans. Hydrologic and transport models are available at several levels of complexity or sophistication. Model selection and use are determined by the quantity and quality of input data. Model development under AEGIS and related programs provides three levels of hydrologic models, two levels of transport models, and one level of dose models (with several separate models). This document consists of the description of the FE3DGW (Finite Element, Three-Dimensional Groundwater) Hydrologic model third level (high complexity) three-dimensional, finite element approach (Galerkin formulation) for saturated groundwater flow.

  9. Bleimann, Butzer, and Hahn Operators Based on the -Integers

    Directory of Open Access Journals (Sweden)

    Doğru Ogün

    2007-01-01

    Full Text Available We give a new generalization of Bleimann, Butzer, and Hahn operators, which includes -integers. We investigate uniform approximation of these new operators on some subspace of bounded and continuous functions. In Section, we show that the rates of convergence of the new operators in uniform norm are better than the classical ones. We also obtain a pointwise estimation in a general Lipschitz-type maximal function space. Finally, we define a generalization of these new operators and study the uniform convergence of them.

  10. Gaps and the exponent of convergence of an integer sequence

    CERN Document Server

    Grekos, Georges; Sleziak, Martin

    2012-01-01

    Professor Tibor \\v{S}al\\'at, at one of his seminars at Comenius University, Bratislava, asked to study the influence of gaps of an integer sequence A={a_1

  11. Efficient Reversible Watermarking Using Differential Expansible Integer Wavelet Transform

    Directory of Open Access Journals (Sweden)

    Sanjay Patel

    2016-07-01

    Full Text Available Digital watermarking has been utilized widely to claim the ownership and to protect images from alternation. Reversible watermarking is having great importance as it provided original image and the embedded logo without any loss. This paper proposed reversible watermarking algorithm using integer wavelet transform to satisfy the reversibility requirement. Further difference expansion based lifting scheme is used to make algorithm fast. To show the robustness of algorithm, various attacks like noise, rotating/scaling an image and filtering to the watermarked image is employed. The extraction of original image against such attacks is quantified in terms of peak signal to noise ratio (PSNR

  12. Integer Valued Autoregressive Models for Tipping Bucket Rainfall Measurements

    DEFF Research Database (Denmark)

    Thyregod, Peter; Carstensen, Niels Jacob; Madsen, Henrik

    1999-01-01

    A new method for modelling the dynamics of rain sampled by a tipping bucket rain gauge is proposed. The considered models belong to the class of integer valued autoregressive processes. The models take the autocorelation and discrete nature of the data into account. A first order, a second order...... and a threshold model are presented together with methods to estimate the parameters of each model. The models are demonstrated to provide a good description of dt from actual rain events requiring only two to four parameters....

  13. Integer least-squares theory for the GNSS compass

    Science.gov (United States)

    Teunissen, P. J. G.

    2010-07-01

    Global navigation satellite system (GNSS) carrier phase integer ambiguity resolution is the key to high-precision positioning and attitude determination. In this contribution, we develop new integer least-squares (ILS) theory for the GNSS compass model, together with efficient integer search strategies. It extends current unconstrained ILS theory to the nonlinearly constrained case, an extension that is particularly suited for precise attitude determination. As opposed to current practice, our method does proper justice to the a priori given information. The nonlinear baseline constraint is fully integrated into the ambiguity objective function, thereby receiving a proper weighting in its minimization and providing guidance for the integer search. Different search strategies are developed to compute exact and approximate solutions of the nonlinear constrained ILS problem. Their applicability depends on the strength of the GNSS model and on the length of the baseline. Two of the presented search strategies, a global and a local one, are based on the use of an ellipsoidal search space. This has the advantage that standard methods can be applied. The global ellipsoidal search strategy is applicable to GNSS models of sufficient strength, while the local ellipsoidal search strategy is applicable to models for which the baseline lengths are not too small. We also develop search strategies for the most challenging case, namely when the curvature of the non-ellipsoidal ambiguity search space needs to be taken into account. Two such strategies are presented, an approximate one and a rigorous, somewhat more complex, one. The approximate one is applicable when the fixed baseline variance matrix is close to diagonal. Both methods make use of a search and shrink strategy. The rigorous solution is efficiently obtained by means of a search and shrink strategy that uses non-quadratic, but easy-to-evaluate, bounding functions of the ambiguity objective function. The theory

  14. Bayesian integer frequency offset estimator for MIMO-OFDM systems

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    Carrier frequency offset (CFO) in MIMO-OFDM systems can be decoupled into two parts: fraction frequency offset (FFO) and integer frequency offset (IFO). The problem of IFO estimation is addressed and a new IFO estimator based on the Bayesian philosophy is proposed. Also, it is shown that the Bayesian IFO estimator is optimal among all the IFO estimators. Furthermore, the Bayesian estimator can take advantage of oversampling so that better performance can be obtained. Finally, numerical results show the optimality of the Bayesian estimator and validate the theoretical analysis.

  15. Using Set Model for Learning Addition of Integers

    Directory of Open Access Journals (Sweden)

    Umi Puji Lestari

    2015-07-01

    Full Text Available 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 use of set models that is packaged in activity of recording of financial transactions in two color chips and card game can help students to understand the concept of zero pair, addition with the same colored chips, and cancellation strategy.

  16. Gaussian free fields at the integer quantum Hall plateau transition

    Energy Technology Data Exchange (ETDEWEB)

    Bondesan, R., E-mail: roberto.bondesan@phys.ox.ac.uk [Rudolf Peierls Centre for Theoretical Physics, 1 Keble Road, Oxford OX1 3NP (United Kingdom); Wieczorek, D.; Zirnbauer, M.R. [Institut für Theoretische Physik, Universität zu Köln, Zülpicher Straße 77, 50937 Köln (Germany)

    2017-05-15

    In this work we put forward an effective Gaussian free field description of critical wavefunctions at the transition between plateaus of the integer quantum Hall effect. To this end, we expound our earlier proposal that powers of critical wave intensities prepared via point contacts behave as pure scaling fields obeying an Abelian operator product expansion. Our arguments employ the framework of conformal field theory and, in particular, lead to a multifractality spectrum which is parabolic. We also derive a number of old and new identities that hold exactly at the lattice level and hinge on the correspondence between the Chalker–Coddington network model and a supersymmetric vertex model.

  17. $W_{\\infty}$ algebra in the integer quantum Hall effects

    OpenAIRE

    Azuma, Hiroo

    1994-01-01

    We investigate the $W_{\\infty}$ algebra in the integer quantum Hall effects. Defining the simplest vacuum, the Dirac sea, we evaluate the central extension for this algebra. A new algebra which contains the central extension is called the $W_{1+\\infty}$ algebra. We show that this $W_{1+\\infty}$ algebra is an origin of the Kac-Moody algebra which determines the behavior of edge states of the system. We discuss the relation between the $W_{1+\\infty}$ algebra and the incompressibility of the int...

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

    Science.gov (United States)

    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).

  19. Systematic Equation Formulation

    DEFF Research Database (Denmark)

    Lindberg, Erik

    2007-01-01

    A tutorial giving a very simple introduction to the set-up of the equations used as a model for an electrical/electronic circuit. The aim is to find a method which is as simple and general as possible with respect to implementation in a computer program. The “Modified Nodal Approach”, MNA, and th......, and the “Controlled Source Approach”, CSA, for systematic equation formulation are investigated. It is suggested that the kernel of the P Spice program based on MNA is reprogrammed....

  20. Introduction to stochastic programming and its applications to finance

    OpenAIRE

    Şimşek, Koray Deniz; Simsek, Koray Deniz

    2008-01-01

    Mathematical programming is one of a number of operations research techniques that employs mathematical optimization models to assist in decision making. Mathematical programming includes linear programming, integer programming, mixed-integer programming, nonlinear programming, stochastic programming, and goal programming. Mathematical programming models allow the decision maker to identify the “best” solution. This is in contrast to other mathematical tools that are in the arsenal of decisio...

  1. Extensions to the Multilevel Programming Problem

    Science.gov (United States)

    1988-05-01

    READS IN A 0-1 BILEVEL PROGRAMMING C PROBLEM (BLPP) AND CREATES THE MATHEMATICAL C PROGRAMMING PROBLEM WHICH CAN BE SOLVED TO FIND C THE SOLUTION OF THE...CODES DEVELOPED BY DR. PAUL A. JENSEN. C IT IS USED TO SOLVE THE 0-1 INTEGER PROGRAMMING C PROBLEM DERIVED FROM THE 0-1 BLPP. C IMPLICIT INTEGER (A-Z...233 PROGRAM BLPPRD C C *****PURPOSE C THIS PROGRAM READS IN A BILEVEL PROGRAMMING C PROBLEM (BLPP) OR A MIXED INTEGER BLPP AND CREATES C THE

  2. BQP_p = PP for integer p > 2

    CERN Document Server

    Bebel, Joseph

    2011-01-01

    There's something really strange about quantum mechanics. It's not just that cats can be dead and alive at the same time, and that entanglement seems to violate the principle of locality; quantum mechanics seems to be what Aaronson calls "an island in theoryspace", because even slight perturbations to the theory of quantum mechanics seem to generate absurdities. In [Aar 04] and [Aar 05], he explores these perturbations and the corresponding absurdities in the context of computation. In particular, he shows that a quantum theory where the measurement probabilities are computed using p-norm instead of the standard 2-norm has the effect of blowing up the class BQP (the class of problems that can be efficiently solved on a quantum computer) to at least PP (the class of problems that can be solved in probabilistic polynomial time). He showed that PP \\subseteq BQP_p \\subseteq PSPACE for all constants p != 2, and that BQP_p = PP for even integers p > 2. Here, we show that this equality holds for all integers p > 2.

  3. Integer Representations towards Efficient Counting in the Bit Probe Model

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting; Greve, Mark; Pandey, Vineet

    2011-01-01

    Abstract We consider the problem of representing numbers in close to optimal space and supporting increment, decrement, addition and subtraction operations efficiently. We study the problem in the bit probe model and analyse the number of bits read and written to perform the operations, both...... in the worst-case and in the average-case. A counter is space-optimal if it represents any number in the range [0,...,2 n  − 1] using exactly n bits. We provide a space-optimal counter which supports increment and decrement operations by reading at most n − 1 bits and writing at most 3 bits in the worst...... of the counter as the ratio between L + 1 and 2 n . We present various representations that achieve different trade-offs between the read and write complexities and the efficiency. We also give another representation of integers that uses n + O(logn ) bits to represent integers in the range [0,...,2 n  − 1...

  4. Direct comparison of fractional and integer quantized Hall resistance

    Science.gov (United States)

    Ahlers, Franz J.; Götz, Martin; Pierz, Klaus

    2017-08-01

    We present precision measurements of the fractional quantized Hall effect, where the quantized resistance {{R}≤ft[ 1/3 \\right]} in the fractional quantum Hall state at filling factor 1/3 was compared with a quantized resistance {{R}[2]} , represented by an integer quantum Hall state at filling factor 2. A cryogenic current comparator bridge capable of currents down to the nanoampere range was used to directly compare two resistance values of two GaAs-based devices located in two cryostats. A value of 1-(5.3  ±  6.3) 10-8 (95% confidence level) was obtained for the ratio ({{R}≤ft[ 1/3 \\right]}/6{{R}[2]} ). This constitutes the most precise comparison of integer resistance quantization (in terms of h/e 2) in single-particle systems and of fractional quantization in fractionally charged quasi-particle systems. While not relevant for practical metrology, such a test of the validity of the underlying physics is of significance in the context of the upcoming revision of the SI.

  5. An Approach to Integer Wavelet Transform for Medical Image Compression in PACS

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    We study an approach to integer wavelet transform for lossless compression of medical image in medical picture archiving and communication system (PACS). By lifting scheme a reversible integer wavelet transform is generated, which has the similar features with the corresponding biorthogonal wavelet transform. Experimental results of the method based on integer wavelet transform are given to show better performance and great applicable potentiality in medical image compression.

  6. An alternative approach to calculate the posterior probability of GNSS integer ambiguity resolution

    Science.gov (United States)

    Yu, Xianwen; Wang, Jinling; Gao, Wang

    2017-03-01

    When precise positioning is carried out via GNSS carrier phases, it is important to make use of the property that every ambiguity should be an integer. With the known float solution, any integer vector, which has the same degree of freedom as the ambiguity vector, is the ambiguity vector in probability. For both integer aperture estimation and integer equivariant estimation, it is of great significance to know the posterior probabilities. However, to calculate the posterior probability, we have to face the thorny problem that the equation involves an infinite number of integer vectors. In this paper, using the float solution of ambiguity and its variance matrix, a new approach to rapidly and accurately calculate the posterior probability is proposed. The proposed approach consists of four steps. First, the ambiguity vector is transformed via decorrelation. Second, the range of the adopted integer of every component is directly obtained via formulas, and a finite number of integer vectors are obtained via combination. Third, using the integer vectors, the principal value of posterior probability and the correction factor are worked out. Finally, the posterior probability of every integer vector and its error upper bound can be obtained. In the paper, the detailed process to calculate the posterior probability and the derivations of the formulas are presented. The theory and numerical examples indicate that the proposed approach has the advantages of small amount of computations, high calculation accuracy and strong adaptability.

  7. An alternative approach to calculate the posterior probability of GNSS integer ambiguity resolution

    Science.gov (United States)

    Yu, Xianwen; Wang, Jinling; Gao, Wang

    2016-10-01

    When precise positioning is carried out via GNSS carrier phases, it is important to make use of the property that every ambiguity should be an integer. With the known float solution, any integer vector, which has the same degree of freedom as the ambiguity vector, is the ambiguity vector in probability. For both integer aperture estimation and integer equivariant estimation, it is of great significance to know the posterior probabilities. However, to calculate the posterior probability, we have to face the thorny problem that the equation involves an infinite number of integer vectors. In this paper, using the float solution of ambiguity and its variance matrix, a new approach to rapidly and accurately calculate the posterior probability is proposed. The proposed approach consists of four steps. First, the ambiguity vector is transformed via decorrelation. Second, the range of the adopted integer of every component is directly obtained via formulas, and a finite number of integer vectors are obtained via combination. Third, using the integer vectors, the principal value of posterior probability and the correction factor are worked out. Finally, the posterior probability of every integer vector and its error upper bound can be obtained. In the paper, the detailed process to calculate the posterior probability and the derivations of the formulas are presented. The theory and numerical examples indicate that the proposed approach has the advantages of small amount of computations, high calculation accuracy and strong adaptability.

  8. Exact Discrete Analogs of Derivatives of Integer Orders: Differences as Infinite Series

    Directory of Open Access Journals (Sweden)

    Vasily E. Tarasov

    2015-01-01

    Full Text Available New differences of integer orders, which are connected with derivatives of integer orders not approximately, are proposed. These differences are represented by infinite series. A characteristic property of the suggested differences is that its Fourier series transforms have a power-law form. We demonstrate that the proposed differences of integer orders n are directly connected with the derivatives ∂n/∂xn. In contrast to the usual finite differences of integer orders, the suggested differences give the usual derivatives without approximation.

  9. Bilevel programming problems theory, algorithms and applications to energy networks

    CERN Document Server

    Dempe, Stephan; Pérez-Valdés, Gerardo A; Kalashnykova, Nataliya; Kalashnikova, Nataliya

    2015-01-01

    This book describes recent theoretical findings relevant to bilevel programming in general, and in mixed-integer bilevel programming in particular. It describes recent applications in energy problems, such as the stochastic bilevel optimization approaches used in the natural gas industry. New algorithms for solving linear and mixed-integer bilevel programming problems are presented and explained.

  10. An optimal approach for the critical node problem using semidefinite programming

    Science.gov (United States)

    Jiang, Cheng; Liu, Zhonghua; Wang, Juyun; Yu, Hua; Guo, Xiaoling

    2017-04-01

    Detecting critical nodes in complex networks (CNP) has great theoretical and practical significance in many disciplines. The existing formulations for CNP are mostly, as we know, based on the integer linear programming model. However, we observed that, these formulations only considered the sizes but neglected the cohesiveness properties of the connected components in the induced network. To solve the problem and improve the performance of CNP solutions, we construct a novel nonconvex quadratically constrained quadratic programming (QCQP) model and derive its approximation solutions via semidefinite programming (SDP) technique and heuristic algorithms. Various types of synthesized and real-world networks, in the context of different connectivity patterns, are used to validate and verify the effectiveness of the proposed model and algorithm. Experimental results show that our method improved the state of the art of the CNP.

  11. Haar Wavelet Based Implementation Method of the Non–integer Order Differentiation and its Application to Signal Enhancement

    Directory of Open Access Journals (Sweden)

    Li Yuanlu

    2015-06-01

    Full Text Available Non–integer order differentiation is changing application of traditional differentiation because it can achieve a continuous interpolation of the integer order differentiation. However, implementation of the non–integer order differentiation is much more complex than that of integer order differentiation. For this purpose, a Haar wavelet-based implementation method of non–integer order differentiation is proposed. The basic idea of the proposed method is to use the operational matrix to compute the non–integer order differentiation of a signal through expanding the signal by the Haar wavelets and constructing Haar wavelet operational matrix of the non–integer order differentiation. The effectiveness of the proposed method was verified by comparison of theoretical results and those obtained by another non–integer order differential filtering method. Finally, non–integer order differentiation was applied to enhance signal.

  12. Stochastic Constraint Programming

    OpenAIRE

    Walsh, Toby

    2009-01-01

    To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision variables (which we can set) and stochastic variables (which follow a probability distribution). They combine together the best features of traditional constraint satisfaction, stochastic integer programming, and stochastic satisfiability. We give a semantics for stochastic constraint programs, and propose a number...

  13. Non-chiral 2d CFT with integer energy levels

    Science.gov (United States)

    Ashrafi, M.; Loran, F.

    2016-09-01

    The partition function of 2d conformal field theory is a modular invariant function. It is known that the partition function of a holomorphic CFT whose central charge is a multiple of 24 is a polynomial in the Klein function. In this paper, by using the medium temperature expansion we show that every modular invariant partition function can be mapped to a holomorphic partition function whose structure can be determined similarly. We use this map to study partition function of CFTs with half-integer left and right conformal weights. We show that the corresponding left and right central charges are necessarily multiples of 4. Furthermore, the degree of degeneracy of high-energy levels can be uniquely determined in terms of the degeneracy in the low energy states.

  14. Non-chiral 2d CFT with integer energy levels

    CERN Document Server

    Ashrafi, M

    2016-01-01

    The partition function of 2d conformal field theory is a modular invariant function. It is known that the partition function of a holomorphic CFT whose central charge is a multiple of 24 is a polynomial in the Klein function. In this paper, by using the medium temperature expansion we show that every modular invariant partition function can be mapped to a holomorphic partition function whose structure can be determined similarly. We use this map to study partition function of CFTs with half-integer left and right conformal weights. We show that the corresponding left and right central charges are necessarily multiples of 4. Furthermore, the degree of degeneracy of high-energy levels can be uniquely determined in terms of the degeneracy in the low energy states.

  15. Analytical estimation of the correlation dimension of integer lattices

    Energy Technology Data Exchange (ETDEWEB)

    Lacasa, Lucas, E-mail: l.lacasa@qmul.ac.uk [School of Mathematical Sciences, Queen Mary University of London, Mile End Road, E14NS London (United Kingdom); Gómez-Gardeñes, Jesús, E-mail: gardenes@gmail.com [Institute for Biocomputation and Physics of Complex System (BIFI), Universidad de Zaragoza, Zaragoza (Spain); Departamento de Fisica de la Materia Condensada, Universidad de Zaragoza, Zaragoza (Spain)

    2014-12-01

    Recently [L. Lacasa and J. Gómez-Gardeñes, Phys. Rev. Lett. 110, 168703 (2013)], a fractal dimension has been proposed to characterize the geometric structure of networks. This measure is an extension to graphs of the so called correlation dimension, originally proposed by Grassberger and Procaccia to describe the geometry of strange attractors in dissipative chaotic systems. The calculation of the correlation dimension of a graph is based on the local information retrieved from a random walker navigating the network. In this contribution, we study such quantity for some limiting synthetic spatial networks and obtain analytical results on agreement with the previously reported numerics. In particular, we show that up to first order, the correlation dimension β of integer lattices ℤ{sup d} coincides with the Haussdorf dimension of their coarsely equivalent Euclidean spaces, β = d.

  16. Parallel Matrix Implementation of an Integer Division Algorithm Using FPGA

    Directory of Open Access Journals (Sweden)

    Eshwararao. Boddepalli

    2011-12-01

    Full Text Available This paper presents a method for fast, parallel matrix implementation of an integer division algorithm inside FPGA that can be used for real-time control systems. An essential improvement over the known matrix structure was made, with all the matrix lines having the same width which leads to equal and reduced propagation time. The alignment was also improved by reducing one algorithm step and eliminating one matrix line. Both fully combinational and pipelined versions of the algorithm were designed and tested until a functional physical implementation was obtained, including a user interface. The paper also presents new way to implement hardware structures inside programmable circuits, using portable schematic design from “Altium Designer” software environment instead textual description with HDL languages

  17. Three-Dimensional Image Compression With Integer Wavelet Transforms

    Science.gov (United States)

    Bilgin, Ali; Zweig, George; Marcellin, Michael W.

    2000-04-01

    A three-dimensional (3-D) image-compression algorithm based on integer wavelet transforms and zerotree coding is presented. The embedded coding of zerotrees of wavelet coefficients (EZW) algorithm is extended to three dimensions, and context-based adaptive arithmetic coding is used to improve its performance. The resultant algorithm, 3-D CB-EZW, efficiently encodes 3-D image data by the exploitation of the dependencies in all dimensions, while enabling lossy and lossless decompression from the same bit stream. Compared with the best available two-dimensional lossless compression techniques, the 3-D CB-EZW algorithm produced averages of 22%, 25%, and 20% decreases in compressed file sizes for computed tomography, magnetic resonance, and Airborne Visible Infrared Imaging Spectrometer images, respectively. The progressive performance of the algorithm is also compared with other lossy progressive-coding algorithms.

  18. An Optimal Decision Procedure for MPNL over the Integers

    Directory of Open Access Journals (Sweden)

    Davide Bresolin

    2011-06-01

    Full Text Available Interval temporal logics provide a natural framework for qualitative and quantitative temporal reason- ing over interval structures, where the truth of formulae is defined over intervals rather than points. In this paper, we study the complexity of the satisfiability problem for Metric Propositional Neigh- borhood Logic (MPNL. MPNL features two modalities to access intervals "to the left" and "to the right" of the current one, respectively, plus an infinite set of length constraints. MPNL, interpreted over the naturals, has been recently shown to be decidable by a doubly exponential procedure. We improve such a result by proving that MPNL is actually EXPSPACE-complete (even when length constraints are encoded in binary, when interpreted over finite structures, the naturals, and the in- tegers, by developing an EXPSPACE decision procedure for MPNL over the integers, which can be easily tailored to finite linear orders and the naturals (EXPSPACE-hardness was already known.

  19. Some locally self-interacting walks on the integers

    CERN Document Server

    Erschler, Anna; Werner, Wendelin

    2010-01-01

    We study certain self-interacting walks on the set of integers, that choose to jump to the right or to the left randomly but influenced by the number of times they have previously jumped along the edges in the finite neighbourhood of their current position (in the present paper, typically, we will discuss the case where one considers the neighbouring edges and the next-to-neighbouring edges). We survey a variety of possible behaviours, including some where the walk is eventually confined to an interval of large length. We also focus on certain "asymmetric" drifts, where we prove that with positive probability, the walks behave deterministically on large scale and move like a constant times the square root of time, or like a constant times the logarithm of time.

  20. $\\sigma$-Set Theory and the Integer Space

    CERN Document Server

    Araus, Ivan Gatica

    2009-01-01

    In this article we develop an alternative theory to the ZF Set Theory called $\\sigma$-Set Theory. The goal of this theory is to build the Integer Space $3^{X}$, that will be the algebraic completion of the Power Set $2^{X}$, i.e., $3^{X}$ contains the inverse element for the union, that in this case we call fusion. We first give an introduction where we explain in a more detailed way the motivations and the objectives of this new theory. Later we present the language of the theory that will be the same as that of the Set Theory. Finally, we present the axioms of the $\\sigma$-Set Theory and their individual analysis.

  1. Self-Avoiding Random Dynamics on Integer Complex Systems

    CERN Document Server

    Hamze, Firas; de Freitas, Nando

    2011-01-01

    This paper introduces a new specialized algorithm for equilibrium Monte Carlo sampling of binary-valued systems, which allows for large moves in the state space. This is achieved by constructing self-avoiding walks (SAWs) in the state space. As a consequence, many bits are flipped in a single MCMC step. We name the algorithm SARDONICS, an acronym for Self-Avoiding Random Dynamics on Integer Complex Systems. The algorithm has several free parameters, but we show that Bayesian optimization can be used to automatically tune them. SARDONICS performs remarkably well in a broad number of sampling tasks: toroidal ferromagnetic and frustrated Ising models, 3D Ising models, restricted Boltzmann machines and chimera graphs arising in the design of quantum computers.

  2. Steganography Based on Integer Wavelet Transform and Bicubic Interpolation

    Directory of Open Access Journals (Sweden)

    N. Ajeeshvali

    2012-11-01

    Full Text Available Steganography is the art and science of hiding information in unremarkable cover media so as not to observe any suspicion. It is an application under information security field, being classified under information security, Steganography will be characterized by having set of measures that rely on strengths and counter attacks that are caused by weaknesses and vulnerabilities. The aim of this paper is to propose a modified high capacity image steganography technique that depends on integer wavelet transform with acceptable levels of imperceptibility and distortion in the cover image as a medium file and high levels of security. Bicubic interpolation causes overshoot, which increases acutance (apparent sharpness. The Bicubic algorithm is frequently used for scaling images and video for display. The algorithm preserves fine details of the image better than the common bilinear algorithm.

  3. The transport mechanism of the integer quantum Hall effect

    CERN Document Server

    LiMing, W

    2016-01-01

    The integer quantum Hall effect is analysed using a transport mechanism with a semi-classic wave packages of electrons in this paper. A strong magnetic field perpendicular to a slab separates the electron current into two branches with opposite wave vectors $({\\it k})$ and locating at the two edges of the slab, respectively, along the current. In this case back scattering of electrons ($k\\rightarrow -k$) is prohibited by the separation of electron currents. Thus the slab exhibits zero longitudinal resistance and plateaus of Hall resistance. When the Fermi level is scanning over a Landau level when the magnetic field increases, however, the electron waves locate around the central axis of the slab and overlap each other thus back scattering of electrons takes place frequently. Then longitudinal resistance appears and the Hall resistance goes up from one plateau to a new plateau.

  4. Sabrewing: a lightweight architecture for combined floating-point and integer arithmetic

    NARCIS (Netherlands)

    Bruintjes, Tom M.; Walters, Karel H.G.; Gerez, Sabih H.; Molenkamp, Bert; Smit, Gerard J.M.

    2012-01-01

    In spite of the fact that floating-point arithmetic is costly in terms of silicon area, the joint design of hardware for floating-point and integer arithmetic is seldom considered. While components like multipliers and adders can potentially be shared, floating-point and integer units in contemporar

  5. On the series of the reciprocals lcm's of sequences of positive integers: A curious interpretation

    CERN Document Server

    Farhi, Bakir

    2009-01-01

    In this paper, we prove the following result: {quote} Let $\\A$ be an infinite set of positive integers. For all positive integer $n$, let $\\tau_n$ denote the smallest element of $\\A$ which does not divide $n$. Then we have

  6. Nonlinear feedback synchronisation control between fractional-order and integer-order chaotic systems

    Institute of Scientific and Technical Information of China (English)

    Jia Li-Xin; Dai Hao; Hui Meng

    2010-01-01

    This paper focuses on the synchronisation between fractional-order and integer-order chaotic systems.Based on Lyapunov stability theory and numerical differentiation,a nonlinear feedback controller is obtained to achieve the synchronisation between fractional-order and integer-order chaotic systems.Numerical simulation results are presented to illustrate the effectiveness of this method.

  7. Sabrewing: A lightweight architecture for combined floating-point and integer arithmetic

    NARCIS (Netherlands)

    Bruintjes, Tom; Walters, K.H.G.; Gerez, Sabih H.; Molenkamp, Egbert; Smit, Gerardus Johannes Maria

    In spite of the fact that floating-point arithmetic is costly in terms of silicon area, the joint design of hardware for floating-point and integer arithmetic is seldom considered. While components like multipliers and adders can potentially be shared, floating-point and integer units in

  8. Integral-valued polynomials over sets of algebraic integers of bounded degree.

    Science.gov (United States)

    Peruginelli, Giulio

    2014-04-01

    Let K be a number field of degree n with ring of integers [Formula: see text]. By means of a criterion of Gilmer for polynomially dense subsets of the ring of integers of a number field, we show that, if [Formula: see text] maps every element of [Formula: see text] of degree n to an algebraic integer, then [Formula: see text] is integral-valued over [Formula: see text], that is, [Formula: see text]. A similar property holds if we consider the set of all algebraic integers of degree n and a polynomial [Formula: see text]: if [Formula: see text] is integral over [Formula: see text] for every algebraic integer α of degree n, then [Formula: see text] is integral over [Formula: see text] for every algebraic integer β of degree smaller than n. This second result is established by proving that the integral closure of the ring of polynomials in [Formula: see text] which are integer-valued over the set of matrices [Formula: see text] is equal to the ring of integral-valued polynomials over the set of algebraic integers of degree equal to n.

  9. Crystallization Formulation Lab

    Data.gov (United States)

    Federal Laboratory Consortium — The Crystallization Formulation Lab fills a critical need in the process development and optimization of current and new explosives and energetic formulations. The...

  10. Improving integer ambiguity resolution for GLONASS precise orbit determination

    Science.gov (United States)

    Liu, Yang; Ge, Maorong; Shi, Chuang; Lou, Yidong; Wickert, Jens; Schuh, Harald

    2016-08-01

    The frequency division multiple access adopted in present GLONASS introduces inter-frequency bias (IFB) at the receiver-end both in code and phase observables, which makes GLONASS ambiguity resolution rather difficult or even not available, especially for long baselines up to several thousand kilometers. This is one of the major reasons that GLONASS could hardly reach the orbit precision of GPS, both in terms of consistency among individual International GNSS Service (IGS) analysis centers and discontinuity at the overlapping day boundaries. Based on the fact that the GLONASS phase IFB is similar on L1 and L2 bands in unit of length and is a linear function of the frequency number, several approaches have been developed to estimate and calibrate the IFB for integer ambiguity resolution. However, they are only for short and medium baselines. In this study, a new ambiguity resolution approach is developed for GLONASS global networks. In the approach, the phase ambiguities in the ionosphere-free linear combination are directly transformed with a wavelength of about 5.3 cm, according to the special frequency relationship of GLONASS L1 and L2 signals. After such transformation, the phase IFB rate can be estimated and corrected precisely and then the corresponding double-differenced ambiguities can be directly fixed to integers even for baselines up to several thousand kilometers. To evaluate this approach, experimental validations using one-month data of a global network with 140 IGS stations was carried out for GLONASS precise orbit determination. The results show that the GLONASS double-difference ambiguity resolution for long baselines could be achieved with an average fixing-rate of 91.4 %. Applying the fixed ambiguities as constraints, the GLONASS orbit overlapping RMS at the day boundaries could be reduced by 37.2 % in ideal cases and with an averaged reduction of about 21.4 %, which is comparable with that by the GPS ambiguity resolution. The orbit improvement is

  11. On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study

    KAUST Repository

    Lima, Ricardo

    2016-06-16

    This paper addresses the solution of a cardinality Boolean quadratic programming problem using three different approaches. The first transforms the original problem into six mixed-integer linear programming (MILP) formulations. The second approach takes one of the MILP formulations and relies on the specific features of an MILP solver, namely using starting incumbents, polishing, and callbacks. The last involves the direct solution of the original problem by solvers that can accomodate the nonlinear combinatorial problem. Particular emphasis is placed on the definition of the MILP reformulations and their comparison with the other approaches. The results indicate that the data of the problem has a strong influence on the performance of the different approaches, and that there are clear-cut approaches that are better for some instances of the data. A detailed analysis of the results is made to identify the most effective approaches for specific instances of the data. © 2016 Springer Science+Business Media New York

  12. Positive Integer Solutions of the Diophantine Equation $x^2 - L_n xy + (-1)^n y^2 = ± 5^r$

    Indian Academy of Sciences (India)

    Refik Keskin; Zafer Şiar

    2014-08-01

    In this paper, we consider the equation $x^2-L_n xy+(-1)^n y^2=± 5^r$ and determine the values of for which the equation has positive integer solutions and . Moreover, we give all positive integer solutions of the equation $x^2-L_n xy+(-1)^n y^2=± 5^r$ when the equation has positive integer solutions.

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

    Energy Technology Data Exchange (ETDEWEB)

    Tarasov, Vasily E., E-mail: tarasov@theory.sinp.msu.ru [Skobeltsyn Institute of Nuclear Physics, Lomonosov Moscow State University, Moscow 119991 (Russian Federation)

    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 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.

  14. Sums of the Numbers of Prime Factors of Positive Integers

    Institute of Scientific and Technical Information of China (English)

    王巧林

    1993-01-01

    Denote by ω(n) and Ω(n) the number of distinct prime factors of n and the total number of prime factors of n,respectively.For any positive integer ι,we prove that ∑↑2≤n≤x1/ω(n)=ι↑∑↑κ=0(ι↑∑↑i=κ(-1)i-κCiκF(i-κ)(1)κ!x/(loglogx)i+1+O(x/(loglogx)ι+2) ∑↑2≤n≤xΩ(n)/ω(n)=x+ι↑∑↑κ=0ι↑∑↑i=κ∑↑p1/pκ+2-pκ+1(-1)i-κCiκF(i-κ)(1)κ!)x/(loglogx)i+1+O(x/(loglogx)ι+2) where F(z)=1/г(z)pⅡ(1+z/p-1)(1-1/p)z,and the constant O despends on ι.This improves previous result of R.L.Duncan and Chao Huizhong.

  15. Emergence of integer quantum Hall effect from chaos

    CERN Document Server

    Tian, Chushun; Wang, Jiao

    2015-01-01

    We present an analytic microscopic theory showing that in a large class of spin-$\\frac{1}{2}$ quasiperiodic quantum kicked rotors, a dynamical analog of the integer quantum Hall effect (IQHE) emerges from an intrinsic chaotic structure. Specifically, the inverse of the Planck's quantum ($h_e$) and the rotor's energy growth rate mimic the `filling fraction' and the `longitudinal conductivity' in conventional IQHE, respectively, and a hidden quantum number is found to mimic the `quantized Hall conductivity'. We show that for an infinite discrete set of critical values of $h_e$, the long-time energy growth rate is universal and of order of unity (`metallic' phase), but otherwise vanishes (`insulating' phase). Moreover, the rotor insulating phases are topological, each of which is characterized by a hidden quantum number. This number exhibits universal behavior for small $h_e$, i.e., it jumps by unity whenever $h_e$ decreases, passing through each critical value. This intriguing phenomenon is not triggered by the...

  16. Module detection in complex networks using integer optimisation

    Directory of Open Access Journals (Sweden)

    Tsoka Sophia

    2010-11-01

    Full Text Available Abstract Background The detection of modules or community structure is widely used to reveal the underlying properties of complex networks in biology, as well as physical and social sciences. Since the adoption of modularity as a measure of network topological properties, several methodologies for the discovery of community structure based on modularity maximisation have been developed. However, satisfactory partitions of large graphs with modest computational resources are particularly challenging due to the NP-hard nature of the related optimisation problem. Furthermore, it has been suggested that optimising the modularity metric can reach a resolution limit whereby the algorithm fails to detect smaller communities than a specific size in large networks. Results We present a novel solution approach to identify community structure in large complex networks and address resolution limitations in module detection. The proposed algorithm employs modularity to express network community structure and it is based on mixed integer optimisation models. The solution procedure is extended through an iterative procedure to diminish effects that tend to agglomerate smaller modules (resolution limitations. Conclusions A comprehensive comparative analysis of methodologies for module detection based on modularity maximisation shows that our approach outperforms previously reported methods. Furthermore, in contrast to previous reports, we propose a strategy to handle resolution limitations in modularity maximisation. Overall, we illustrate ways to improve existing methodologies for community structure identification so as to increase its efficiency and applicability.

  17. Integer wavelet transform for embedded lossy to lossless image compression.

    Science.gov (United States)

    Reichel, J; Menegaz, G; Nadenau, M J; Kunt, M

    2001-01-01

    The use of the discrete wavelet transform (DWT) for embedded lossy image compression is now well established. One of the possible implementations of the DWT is the lifting scheme (LS). Because perfect reconstruction is granted by the structure of the LS, nonlinear transforms can be used, allowing efficient lossless compression as well. The integer wavelet transform (IWT) is one of them. This is an interesting alternative to the DWT because its rate-distortion performance is similar and the differences can be predicted. This topic is investigated in a theoretical framework. A model of the degradations caused by the use of the IWT instead of the DWT for lossy compression is presented. The rounding operations are modeled as additive noise. The noise are then propagated through the LS structure to measure their impact on the reconstructed pixels. This methodology is verified using simulations with random noise as input. It predicts accurately the results obtained using images compressed by the well-known EZW algorithm. Experiment are also performed to measure the difference in terms of bit rate and visual quality. This allows to a better understanding of the impact of the IWT when applied to lossy image compression.

  18. AN EFFICIENT HILBERT AND INTEGER WAVELET TRANSFORM BASED VIDEO WATERMARKING

    Directory of Open Access Journals (Sweden)

    AGILANDEESWARI L.

    2016-03-01

    Full Text Available In this paper, an efficient, highly imperceptible, robust, and secure digital video watermarking technique for content authentication based on Hilbert transform in the Integer Wavelet Transform (IWT domain has been introduced. The Hilbert coefficients of gray watermark image are embedded into the cover video frames Hilbert coefficients on the 2-level IWT decomposed selected block on sub-bands using Principal Component Analysis (PCA technique. The authentication is achieved by using the digital signature mechanism. This mechanism is used to generate and embed a digital signature after embedding the watermarks. Since, the embedding process is done in Hilbert transform domain, the imperceptibility and the robustness of the watermark is greatly improved. At the receiver end, prior to the extraction of watermark, the originality of the content is verified through the authentication test. If the generated and received signature matches, it proves that the received content is original and performs the extraction process, otherwise deny the extraction process due to unauthenticated received content. The proposed method avoids typical degradations in the imperceptibility level of watermarked video in terms of Average Peak Signal – to – Noise Ratio (PSNR value of about 48db, while it is still providing better robustness against common video distortions such as frame dropping, averaging, and various image processing attacks such as noise addition, median filtering, contrast adjustment, and geometrical attacks such as, rotation and cropping in terms of Normalized Correlation Coefficient (NCC value of about nearly 1.

  19. A Faster Algorithm for Quasi-convex Integer Polynomial Optimization

    CERN Document Server

    Hildebrand, Robert

    2010-01-01

    We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasi-convex polynomial subject to s quasi-convex polynomial constraints and integrality constraints for all variables. The new algorithm is an improvement upon the best known algorithm due to Heinz (Journal of Complexity, 2005). A lower time complexity is reached through applying a stronger ellipsoid rounding method and applying a recent advancement in the shortest vector problem to give a smaller exponential-time complexity of a Lenstra-type algorithm. For the bounded case, our algorithm attains a time-complexity of s (r l M d)^{O(1)} 2^{2n\\log_2(n) + O(n)} when M is a bound on the number of monomials in each polynomial and r is the binary encoding length of a bound on the feasible region. In the general case, s l^{O(1)} d^{O(n)} 2^{2n\\log_2(n)}. In each we assume d>=2 is a bound on the total degree of the polynomials and l bounds the maximum binary encoding size of the input...

  20. Preconditioning 2D Integer Data for Fast Convex Hull Computations.

    Directory of Open Access Journals (Sweden)

    José Oswaldo Cadenas

    Full Text Available In order to accelerate computing the convex hull on a set of n points, a heuristic procedure is often applied to reduce the number of points to a set of s points, s ≤ n, which also contains the same hull. We present an algorithm to precondition 2D data with integer coordinates bounded by a box of size p × q before building a 2D convex hull, with three distinct advantages. First, we prove that under the condition min(p, q ≤ n the algorithm executes in time within O(n; second, no explicit sorting of data is required; and third, the reduced set of s points forms a simple polygonal chain and thus can be directly pipelined into an O(n time convex hull algorithm. This paper empirically evaluates and quantifies the speed up gained by preconditioning a set of points by a method based on the proposed algorithm before using common convex hull algorithms to build the final hull. A speedup factor of at least four is consistently found from experiments on various datasets when the condition min(p, q ≤ n holds; the smaller the ratio min(p, q/n is in the dataset, the greater the speedup factor achieved.

  1. Near integer tune for polarization preservation in the AGS

    Energy Technology Data Exchange (ETDEWEB)

    Tsoupas N.; Ahrens, L.; Bai, M.; Brown, K.; Glenn, J.W.; Huang, H.; MacKay, W.W.; Roser, T.; Schoefer, V.; Zeno, K.

    2012-05-20

    The high energy (T = 250 GeV) polarized proton beam experiments performed in RHIC, require high polarization of the beam. In order to preserve the polarization of the proton beam, during the acceleration in the AGS, which is the pre-injector to RHIC, we have installed in AGS two partial helical magnets which minimize the loss of the beam polarization caused by the various intrinsic spin resonances occurring during the proton acceleration. The minimization of the polarization loss during the acceleration cycle, requires that the vertical tune of the AGS is between the values of 8.97 and 8.985 during the acceleration. With the AGS constrained to run at near integer tune {approx}8.980, the perturbations to the beam caused by the partial helical magnets are large and also result in large beta and dispersion waves. To mitigate the adverse effect of the partial helices on the optics of the AGS, we have installed in specified straight sections of the AGS compensation quads and we have also generated a beam bump at the location of the cold partial helix. In this paper we present the beam optics of the AGS which ameliorates the adverse effect of the two partial helices on the beam optics.

  2. Cho Decomposition of One-Half Integer Monopoles Solutions

    Science.gov (United States)

    Teh, Rosy; Ng, Ban-Loong; Wong, Khai-Ming

    2013-11-01

    We performed the Cho decomposition of the SU(2) Yang-Mills-Higgs gauge potentials of the finite energy (1) one-half monopole solution and (2) the one and a half monopoles solution into Abelian and non-Abelian components. We found that the semi-infinite string singularity in the gauge potentials is a contribution from the Higgs field of the one-half monopole in both of the solutions. The non-Abelian components of the gauge potentials are able to remove the point singularity of the Abelian components of the 't Hooft-Polyakov monopole but not the string singularity of the one-half monopole which is topological in nature. Hence the total energy of a one monopole is infinite in the Maxwell electromagnetic theory but the total energy of a one-half monopole is finite. By analyzing the magnetic fields and the gauge covariant derivatives of the Higgs field, we are able to conclude that both the one-half integer monopoles solutions are indeed non-BPS even in the limit of vanishing Higgs self-coupling constant.

  3. Preconditioning 2D Integer Data for Fast Convex Hull Computations.

    Science.gov (United States)

    Cadenas, José Oswaldo; Megson, Graham M; Luengo Hendriks, Cris L

    2016-01-01

    In order to accelerate computing the convex hull on a set of n points, a heuristic procedure is often applied to reduce the number of points to a set of s points, s ≤ n, which also contains the same hull. We present an algorithm to precondition 2D data with integer coordinates bounded by a box of size p × q before building a 2D convex hull, with three distinct advantages. First, we prove that under the condition min(p, q) ≤ n the algorithm executes in time within O(n); second, no explicit sorting of data is required; and third, the reduced set of s points forms a simple polygonal chain and thus can be directly pipelined into an O(n) time convex hull algorithm. This paper empirically evaluates and quantifies the speed up gained by preconditioning a set of points by a method based on the proposed algorithm before using common convex hull algorithms to build the final hull. A speedup factor of at least four is consistently found from experiments on various datasets when the condition min(p, q) ≤ n holds; the smaller the ratio min(p, q)/n is in the dataset, the greater the speedup factor achieved.

  4. Efficient Interpolant Generation in Satisfiability Modulo Linear Integer Arithmetic

    CERN Document Server

    Griggio, Alberto; Sebastiani, Roberto

    2010-01-01

    The problem of computing Craig interpolants in SAT and SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for interpolant generation have been presented for some theories of interest ---including that of equality and uninterpreted functions, linear arithmetic over the rationals, and their combination--- and they are successfully used within model checking tools. For the theory of linear arithmetic over the integers (LA(Z)), however, the problem of finding an interpolant is more challenging, and the task of developing efficient interpolant generators for the full theory LA(Z) is still the objective of ongoing research. In this paper we try to close this gap. We build on previous work and present a novel interpolation algorithm for SMT(LA(Z)), which exploits the full power of current state-of-the-art SMT(LA(Z)) solvers. We demonstrate the potential of our approach with an extensive experimental evaluation of our implementation of the proposed al...

  5. Formulating Policy for Summer Schools.

    Science.gov (United States)

    Marriot, Helen

    1991-01-01

    Explores issues relating to the formulation of policy for summer programs for language learning, describing one university's experience with student demand, student motivation and progress, course timing and structure, academic staffing, administrative organization, student and staff evaluation, and funding. (three references) (CB)

  6. Higher-order semiclassical energy expansions for potentials with non-integer powers

    Indian Academy of Sciences (India)

    Asiri Nanayakkara

    2003-10-01

    In this paper, we present a semiclassical eigenenergy expansion for the potential || when is a positive rational number of the form 2/ ( is a positive integer and is an odd positive integer). Remarkably, this expansion is found to be identical to the WKB expansion obtained for the potential (-even), if 2/ is replaced by . Taking the limit → 2 of the above expansion, we obtain an explicit asymptotic energy expansion of symmetric odd power potentials ||2+1 (-positive integer). We then show how to develop approximate semiclassical expansions for potentials || when is any positive real number.

  7. Evaluation of overlap integrals with integer and noninteger n Slater-type orbitals using auxiliary functions.

    Science.gov (United States)

    Guseinov, Israfil; Mamedov, Bahtiyar

    2002-09-01

    The series expansion formulae are derived for the overlap integrals with arbitrary integer n and noninteger n* Slater-type orbitals (ISTOs and NISTOs) in terms of a product of well-known auxiliary functions A(sigma) and B (k). The series becomes an ordinary closed expression when both principal quantum numbers n* and n'* of orbitals are integer n*= n and n'*= n'. These formulae are especially useful for the calculation of overlap integrals for large quantum numbers. Accuracy of the results is satisfactory for values of integer and noninteger quantum numbers up to n= n'=60, n*= n'*orbitals and internuclear distances.

  8. On the Evaluation of Two-Center Overlap Integrals over Integer and Noninteger -Center Overlap Integrals over Integer and Noninteger n-Slater-Type Orbitals

    Institute of Scientific and Technical Information of China (English)

    T. Ozdogan, M. Orbay; S. Gümüs

    2002-01-01

    In this study, two-center overlap integrals over Slater-type orbitals (STOs) with integer and noninteger principal quantum numbers in unaligned coordinate systems have been calculated using formulas for overlap integrals in aligned coordinate systems obtained by the author's previous work (T. Ozdogan and M. Orbay, Int. J. Quant. Chem. 87(2002) 15). The obtained results for integer case have been found to be in excellent agreement with the prior literature.On the other hand, to the best of authors knowledge, because of the scarcity of the literatures on the use of noninteger n-STOs in unaligned coordinate systems, the results for noninteger case have been tested with the limit of integer case,and good agreement has been obtained too.

  9. The expected variation of random bounded integer sequences of finite length

    OpenAIRE

    Rudolfo Angeles; Don Rawlings; Lawrence Sze; Mark Tiefenbruck

    2005-01-01

    From the enumerative generating function of an abstract adjacency statistic, we deduce the mean and variance of the variation on random permutations, rearrangements, compositions, and bounded integer sequences of finite length.

  10. A Fast Algorithm for Determining the Existence and Value of Integer Roots of N

    CERN Document Server

    Libby, Vibeke

    2010-01-01

    We show that all perfect odd integer squares not divisible by 3, can be usefully written as sqrt(N) = a + 18p, where the constant a is determined by the basic properties of N. The equation can be solved deterministically by an efficient four step algorithm that is solely based on integer arithmetic. There is no required multiplication or division by multiple digit integers, nor does the algorithm need a seed value. It finds the integer p when N is a perfect square, and certifies N as a non-square when the algorithm terminates without a solution. The number of iterations scales approximately as log(sqrt(N)/2) for square roots. The paper also outlines how one of the methods discussed for squares can be extended to finding an arbitrary root of N. Finally, we present a rule that distinguishes products of twin primes from squares.

  11. Reversible Integer Wavelet Transform for the Joint of Image Encryption and Watermarking

    Directory of Open Access Journals (Sweden)

    Bin Wang

    2015-01-01

    Full Text Available In recent years, signal processing in the encrypted domain has attracted considerable research interest, especially embedding watermarking in encrypted image. In this work, a novel joint of image encryption and watermarking based on reversible integer wavelet transform is proposed. Firstly, the plain-image is encrypted by chaotic maps and reversible integer wavelet transform. Then the lossless watermarking is embedded in the encrypted image by reversible integer wavelet transform and histogram modification. Finally an encrypted image containing watermarking is obtained by the inverse integer wavelet transform. What is more, the original image and watermarking can be completely recovered by inverse process. Numerical experimental results and comparing with previous works show that the proposed scheme possesses higher security and embedding capacity than previous works. It is suitable for protecting the image information.

  12. 7th Conference on Non-Integer Order Calculus and Its Applications

    CERN Document Server

    Dworak, Paweł

    2016-01-01

    This volume is devoted to presentation of new results of research on systems of non-integer order, called also fractional systems. Their analysis and practical implementation have been the object of spontaneous development for a few last decades. The fractional order models can depict a physical plant better than the classical integer order ones. This covers different research fields such as insulator properties, visco-elastic materials, electrodynamic, electrothermal, electrochemical, economic processes modelling etc. On the other hand fractional controllers often outperform their integer order counterparts. This volume contains new ideas and examples of implementation, theoretical and pure practical aspects of using a non-integer order calculus. It is divided into four parts covering: mathematical fundamentals, modeling and approximations, controllability, observability and stability problems and practical applications of fractional control systems. The first part expands the base of tools and methods of th...

  13. The expected variation of random bounded integer sequences of finite length

    Directory of Open Access Journals (Sweden)

    Rudolfo Angeles

    2005-09-01

    Full Text Available From the enumerative generating function of an abstract adjacency statistic, we deduce the mean and variance of the variation on random permutations, rearrangements, compositions, and bounded integer sequences of finite length.

  14. The Number of Representations of an Integer as a Sum of Eight Squares

    Institute of Scientific and Technical Information of China (English)

    林甲富

    2002-01-01

    Two identities are obtained by Jacobi's triple product identity and some basic operators.By applying these identities,Jacobi's theorem for the number of representations of an integer as a sum of eight squares is easily proved.

  15. Edge states and integer quantum Hall effect in topological insulator thin films.

    Science.gov (United States)

    Zhang, Song-Bo; Lu, Hai-Zhou; Shen, Shun-Qing

    2015-08-25

    The integer quantum Hall effect is a topological state of quantum matter in two dimensions, and has recently been observed in three-dimensional topological insulator thin films. Here we study the Landau levels and edge states of surface Dirac fermions in topological insulators under strong magnetic field. We examine the formation of the quantum plateaux of the Hall conductance and find two different patterns, in one pattern the filling number covers all integers while only odd integers in the other. We focus on the quantum plateau closest to zero energy and demonstrate the breakdown of the quantum spin Hall effect resulting from structure inversion asymmetry. The phase diagrams of the quantum Hall states are presented as functions of magnetic field, gate voltage and chemical potential. This work establishes an intuitive picture of the edge states to understand the integer quantum Hall effect for Dirac electrons in topological insulator thin films.

  16. 5th Conference on Non-integer Order Calculus and Its Applications

    CERN Document Server

    Kacprzyk, Janusz; Baranowski, Jerzy

    2013-01-01

    This volume presents various aspects of non-integer order systems, also known as fractional systems, which have recently attracted an increasing attention in the scientific community of systems science, applied mathematics, control theory. Non-integer systems have become relevant for many fields of science and technology exemplified by the modeling of signal transmission, electric noise, dielectric polarization, heat transfer, electrochemical reactions, thermal processes,  acoustics, etc. The content is divided into six parts, every of which considers one of the currently relevant problems. In the first part the Realization problem is discussed, with a special focus on positive systems. The second part considers stability of certain classes of non-integer order systems with and without delays. The third part is focused on such important aspects as controllability, observability and optimization especially in discrete time. The fourth part is focused on distributed systems where non-integer calculus leads to ...

  17. On the Branch and Cut Method for Multidimentional Mixed Integer Knapsack Problem

    OpenAIRE

    Mostafa Khorramizadeh; Zahra Rakhshandehroo

    2014-01-01

    In this paper, we examine the effect of the feasibility pump (FP) method on the branch and cut method for solving the multidimentional mixed integer knapsack problem. The feasibility pump is a heuristic method, trying to compute a feasible solution for mixed integer pro- gramming problems. Moreover, we consider two efficient strategies for using the feasibility pump in a branch and cut method and present some tables of numerical results, concerning the application and comparison of using thes...

  18. Non-integer Quantum Transition, a True Non-perturbation Effect in Laser-Atom Interaction

    Institute of Scientific and Technical Information of China (English)

    ZHANG Qi-Ren

    2007-01-01

    We show that in the quantum transition of an atom interacting with an intense laser of circular frequencyω, the energy difference between the initial and the final states of the atom is not necessarily an integer multiple of the quantum energy (h)ω. This kind of non-integer transition is a true non-perturbation effect in laser-atom interaction.

  19. A universal first order formula defining the ring of integers in a number field

    CERN Document Server

    Park, Jennifer

    2012-01-01

    We show that the complement of the ring of integers in a number field K is Diophantine. This means the set of ring of integers in K can be written as {t in K | for all x_1, ..., x_N in K, f(t,x_1, ..., x_N) is not 0}. We will use global class field theory and generalize the ideas originating from Koenigsmann's recent result giving a universal first order formula for Z in Q.

  20. DESIGN STUDY: INTEGER SUBTRACTION OPERATION TEACHING LEARNING USING MULTIMEDIA IN PRIMARY SCHOOL

    Directory of Open Access Journals (Sweden)

    Rendi Muhammad Aris

    2016-12-01

    Full Text Available 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 analysis. The studied was conducted on 20 students of grade four SDN 1 Muara Batun, OKI. The activities of students in this study consisted of six learning trajectories. The first activity asks the students to classify heroism and non-heroism acts, summarize, and classify integers and non-integer. The second activity asks the students to answer the questions in the film given. The third activity asks students to count the remaining gravel in the film. The fourth activity asks students to count remaining spent money in the film. The fifth activity invites students to play rubber seeds in the bag. The last activity asks students to answer the questions in the student worksheet. The media used along the learning activities are a ruler, rubber seed, student worksheet, money, gravel, and film. The results indicate that the learning trajectory using multimedia help students understand the concept of integer subtraction integer. Keywords: Subtraction Integer, PMRI, Multimedia DOI: http://dx.doi.org/10.22342/jme.8.1.3233.95-102

  1. Brachytherapy seed localization using geometric and linear programming techniques.

    Science.gov (United States)

    Singh, Vikas; Mukherjee, Lopamudra; Xu, Jinhui; Hoffmann, Kenneth R; Dinu, Petru M; Podgorsak, Matthew

    2007-09-01

    We propose an optimization algorithm to solve the brachytherapy seed localization problem in prostate brachytherapy. Our algorithm is based on novel geometric approaches to exploit the special structure of the problem and relies on a number of key observations which help us formulate the optimization problem as a minimization integer program (IP). Our IP model precisely defines the feasibility polyhedron for this problem using a polynomial number of half-spaces; the solution to its corresponding linear program is rounded to yield an integral solution to our task of determining correspondences between seeds in multiple projection images. The algorithm is efficient in theory as well as in practice and performs well on simulation data (approximately 98% accuracy) and real X-ray images (approximately 95% accuracy). We present in detail the underlying ideas and an extensive set of performance evaluations based on our implementation.

  2. IT Supporting Strategy Formulation

    NARCIS (Netherlands)

    Achterbergh, J.M.I.M.

    2005-01-01

    This overview approaches information and communication technology (ICT) for competitive intelligence from the perspective of strategy formulation. It provides an ICT architecture for supporting the knowledge processes producing relevant knowledge for strategy formulation. To determine what this arch

  3. IT Supporting Strategy Formulation

    NARCIS (Netherlands)

    Achterbergh, J.M.I.M.

    2005-01-01

    This overview approaches information and communication technology (ICT) for competitive intelligence from the perspective of strategy formulation. It provides an ICT architecture for supporting the knowledge processes producing relevant knowledge for strategy formulation. To determine what this arch

  4. Key Factors for Formulation of Immunization Programs in Animal and Poultry Farms%制定养殖场免疫程序应考虑的主要因素

    Institute of Scientific and Technical Information of China (English)

    尹子静; 刘裕田

    2015-01-01

    Vaccination is an effective way for infectious disease prevention and control, and the quality of immunization programs directly determines the immune effect. In this paper,some key factors for formulation of immunization pro-grams in animal and poultry farms are discussed, including local disease situation,antibody level, vaccination routes, vaccine types and properties,breed sources, feeding management level. The immunization programs must be formu-lated according to the local conditions and the key factors mentioned above.%免疫接种是预防控制传染病的有效方法,免疫程序合理与否直接决定到免疫效果,因此养殖场要按照因地制宜的原则,根据本地的疫病种类、疫病流行情况、抗体水平、免疫途径、疫苗种类与性质、种畜禽来源、饲养管理水平等综合因素,科学制定适合本场的免疫程序。

  5. A reversibility-gain model for integer Karhunen-Loève transform design in video coding

    Institute of Scientific and Technical Information of China (English)

    Xing-guo ZHU; Lu YU

    2015-01-01

    Karhunen-Loève transform (KLT) is the optimal transform that minimizes distortion at a given bit allocation for Gaussian source. As a KLT matrix usually contains non-integers, integer-KLT design is a classical problem. In this paper, a joint reversibility-gain (R-G) model is proposed for integer-KLT design in video coding. Specifically, the 'reversibility' is modeled according to distortion analysis in using forward and inverse integer transform without quantization. It not only measures how invertible a transform is, but also bounds the distortion introduced by the non-orthonormal integer transform process. The 'gain' means transform coding gain (TCG), which is a widely used criterion for transform design in video coding. Since KLT maximizes the TCG under some assumptions, here we define the TCG loss ratio (LR) to measure how much coding gain an integer-KLT loses when compared with the original KLT. Thus, the R-G model can be explained as follows: subject to a certain TCG LR, an integer- KLT with the best reversibility is the optimal integer transform for a given non-integer-KLT. Experimental results show that the R-G model can guide the design of integer-KLTs with good performance.

  6. Torsion formulation of gravity

    Energy Technology Data Exchange (ETDEWEB)

    Lledo, M A; Sommovigo, L, E-mail: Maria.Lledo@ific.uv.e, E-mail: Luca.Sommovigo@mfn.unipmn.i [Departament de Fisica Teorica, Universitat de Valencia, and IFIC (Centro mixto CSIC-UVEG) C/Dr Moliner, 50, E-46100 Burjassot (Valencia) (Spain)

    2010-03-21

    We explain precisely what it means to have a connection with torsion as a solution of the Einstein equations. While locally the theory remains the same, the new formulation allows for topologies that would have been excluded in the standard formulation of gravity. In this formulation it is possible to couple arbitrary torsion to gauge fields without breaking the gauge invariance.

  7. Shared-risk link group (SRLG)-diverse path provisioning under hybrid service level agreements in wavelength-routed optical mesh networks: formulation and solution approaches

    Science.gov (United States)

    Shen, Lu; Yang, Xi; Ramamurthy, Byrav

    2003-10-01

    The static provisioning problem in wavelength-routed optical networks has been studied for many years. However, service providers are still facing the challenges arising from the special requirements for provisioning services at the optical layer. In this paper, we incorporate some realistic constraints into the static provisioning problem, and formulate it under different network resource availability conditions. We consider three classes of shared risk link group (SRLG)-diverse path protection schemes: dedicated, shared, and unprotected. We associate with each connection request a lightpath length constraint and a revenue value. When the network resources are not sufficient to accommodate all the connection requests, the static provisioning problem is formulated as a revenue maximization problem, whose objective is maximizing the total revenue value. When the network has sufficient resources, the problem becomes a capacity minimization problem with the objective of minimizing the number of used wavelength-links. We give integer linear programming (ILP) formulations for these problems. Because solving these ILP problems is extremely time consuming, we propose a tabu search heuristic to solve these problems within a reasonable time. Experimental results are presented to compare the solutions obtained by an ILP solver, the tabu search heuristic and a divide-and-conquer greedy heuristic.

  8. PRP: a FORTRAN IV interactive plotting program

    Science.gov (United States)

    Andrew, A. S.; Linde, J.

    A computer program, PRP, has been designed to plot any arithmetic combination selected from a set of major and trace element data on a y- x graph. y and x are defined and entered as a program string (y, x) which is interpreted sequentially. Operators ( +, -, ∗, /, ( unary) , square root, log 10, In c, antilog 10, exponential, integer, absolute value, (,),,) and integer or real numbers may be included. Axis lengths and scales are determined by the user. Five different plotting symbols are available.

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

    Science.gov (United States)

    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

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

    Science.gov (United States)

    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.

  11. The operator tensor formulation of quantum theory.

    Science.gov (United States)

    Hardy, Lucien

    2012-07-28

    In this paper, we provide what might be regarded as a manifestly covariant presentation of discrete quantum theory. A typical quantum experiment has a bunch of apparatuses placed so that quantum systems can pass between them. We regard each use of an apparatus, along with some given outcome on the apparatus (a certain detector click or a certain meter reading for example), as an operation. An operation (e.g. B(b(2)a(3))(a(1))) can have zero or more quantum systems inputted into it and zero or more quantum systems outputted from it. The operation B(b(2)a(3))(a(1)) has one system of type a inputted, and one system of type b and one system of type a outputted. We can wire together operations to form circuits, for example, A(a(1))B(b(2)a(3))(a(1))C(b(2)a(3)). Each repeated integer label here denotes a wire connecting an output to an input of the same type. As each operation in a circuit has an outcome associated with it, a circuit represents a set of outcomes that can happen in a run of the experiment. In the operator tensor formulation of quantum theory, each operation corresponds to an operator tensor. For example, the operation B(b(2)a(3))(a(1)) corresponds to the operator tensor B(b(2)a(3))(a(1)). Further, the probability for a general circuit is given by replacing operations with corresponding operator tensors as in Prob(A(a(1))B(b(2)a(3))(a(1))C(b(2)a(3))) = Â(a(1))B(b(2)a(3))(a(1))C(b(2)a(3)). Repeated integer labels indicate that we multiply in the associated subspace and then take the partial trace over that subspace. Operator tensors must be physical (namely, they must have positive input transpose and satisfy a certain normalization condition).

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

    Science.gov (United States)

    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.

  13. A Composite Algorithm for Mixed Integer Constrained Nonlinear Optimization.

    Science.gov (United States)

    1980-01-01

    algorithm (FLEX) developed by Paviani and Himmelblau [53] is a direct search algorithm for constrained, nonlinear problems. It uses a variation on the...given in an appendix to Himmelblau [32]. Two changes were made to the program as listed in the rcference. Between card number 1340 and 1350 the...1972, pp. 293-308 (32] Himmelblau , D. M., Applied Nonlinear Programming, McGraw-Hill, 1972 (33] Himmelblau , D. M., "A Uniform Evaluation of Unconstrained

  14. Formulation of Free Higher Spin Supersymmetric Theories in Superspace

    CERN Document Server

    Phillips, J

    2005-01-01

    The N = 1 superfield formalism in four-dimensions is well formulated and understood, yet there remain unsolved problems. In this thesis, superfield actions for free massless and massive higher spin superfield theories are formulated in four dimensions. The discussion of massless models is restricted to half integer superhelicity. These models describe multiplets with helicities (s, s-1/2) where s is an integer. The investigation of massive models covers recent work on superspin-3/2 and superspin-1 multiplets. Superspin-3/2 multiplets contain component fields with spins (2, 3/2, 3/2, 1) and superspin-1 multiplets contain component fields with spins (3/2, 1, 1, 1/2). The super projector method is used to distinguish supersymmetric subspaces. Here, this method is used to write general superspace actions. The underlying geometrical structure of superspace actions is elucidated when they are written in terms of super projectors. This thesis also discusses the connection between four-dimensional massive theories an...

  15. Cubic one-regular graphs of order twice a square-free integer

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    A graph is one-regular if its automorphism group acts regularly on the set of its arcs.Let n be a square-free integer.In this paper,we show that a cubic one-regular graph of order 2n exists if and only if n=3tp1p2…ps≥13,where t≤1,s≥1 and pi’s are distinct primes such that 3|(Pi—1). For such an integer n,there are 2s-1 non-isomorphic cubic one-regular graphs of order 2n,which are all Cayley graphs on the dihedral group of order 2n.As a result,no cubic one-regular graphs of order 4 times an odd square-free integer exist.

  16. Allocating the Fixed Resources and Setting Targets in Integer Data Envelopment Analysis

    Directory of Open Access Journals (Sweden)

    Kobra Gholami

    2013-11-01

    Full Text Available Data envelopment analysis (DEA is a non-parametric approach to evaluate a set of decision making units (DMUs consuming multiple inputs to produce multiple outputs. Formally, DEA use to estimate the efficiency score into the empirical efficient frontier. Also, DEA can be used to allocate resources and set targets for future forecast. The data are continuous in the standard DEA model whereas there are many problems in the real life that data must be integer such as number of employee, machinery, expert and so on. Thus in this paper we propose an approach to allocate fixed resources and set fixed targets with selective integer assumption that is based on an integer data envelopment analysis (IDEA approach for the first time. The major aim in this approach is preserving the efficiency score of DMUs. We use the concept of benchmarking to reach this aim. The numerical example gets to illustrate the applicability of the proposed method.

  17. On 4D, N = 1 Massless Gauge Superfields of Higher Superspin: Integer Case

    CERN Document Server

    Gates,, S James

    2013-01-01

    We present an alternative method of exploring the component structure of an integer super-helicity Y=s (for any integers) irreducible representation of the Super-Poincare group. We use it to derive the component action and the SUSY transformation laws. The effectiveness of this approach is based on the equations of motion and their properties, like Bianchi identities. These equations are generated by the superspace action when it is expressed in terms of prepotentials. For that reason we reproduce the superspace action for integer superspin, using unconstrained superfields. The appropriate, to use, superfields are dictated by the representation theory of the group and the requirement that there is a smooth limit between the massive and massless case.

  18. Property study of integer wavelet transform lossless compression coding based on lifting scheme

    Science.gov (United States)

    Xie, Cheng Jun; Yan, Su; Xiang, Yang

    2006-01-01

    In this paper the algorithms and its improvement of integer wavelet transform combining SPIHT and arithmetic coding in image lossless compression is mainly studied. The experimental result shows that if the order of low-pass filter vanish matrix is fixed, the improvement of compression effect is not evident when invertible integer wavelet transform is satisfied and focusing of energy property monotonic increase with transform scale. For the same wavelet bases, the order of low-pass filter vanish matrix is more important than the order of high-pass filter vanish matrix in improving the property of image compression. Integer wavelet transform lossless compression coding based on lifting scheme has no relation to the entropy of image. The effect of compression is depended on the the focuing of energy property of image transform.

  19. Spin analogs of superconductivity and integer quantum Hall effect in an array of spin chains

    Science.gov (United States)

    Hill, Daniel; Kim, Se Kwon; Tserkovnyak, Yaroslav

    2017-05-01

    Motivated by the successful idea of using weakly coupled quantum electronic wires to realize the quantum Hall effects and the quantum spin Hall effects, we theoretically study two systems composed of weakly coupled quantum spin chains within the mean-field approximations, which can exhibit spin analogs of superconductivity and the integer quantum Hall effect. First, a certain bilayer of two arrays of interacting spin chains is mapped, via the Jordan-Wigner transformation, to an attractive Hubbard model that exhibits fermionic superconductivity, which corresponds to spin superconductivity in the original spin Hamiltonian. Secondly, an array of spin-orbit-coupled spin chains in the presence of a suitable external magnetic field is transformed to an array of quantum wires that exhibits the integer quantum Hall effect, which translates into its spin analog in the spin Hamiltonian. The resultant spin superconductivity and spin integer quantum Hall effect can be characterized by their ability to transport spin without any resistance.

  20. The Basic Elements of Teacher Training Programs Formulation and Implementation and their Relationship Research%教师培训方案制定与实施的基本要素及其关系研究

    Institute of Scientific and Technical Information of China (English)

    王建

    2016-01-01

    A series of elements are involved in the formulation and implementation of teacher training programs,and they are related to whether the teacher training programs are scientific and ap-propriate, whether the implementation is specific and effective.Two aspects to be taken into account in the basic elements of teacher training programs formulation and implementation.One is to avoid o-verlapping, the other is to point to the nature.Based on the connotation of the elements and the es-tablishing standard, the basic elements of teacher training programs formulation and implementation can be concluded into the following nine aspects of interaction and interrelation: Training needs, Training objects, Training objectives, Training courses, Training teachers, Training methods, Training evaluation, Training comprehensive security management, and Training tracking guidance services.Each factor connects with, influences each other mutually and works together in the teach-er training activities.%本文主要阐述了教师培训方案制定与实施过程中涉及到的要素及其关系。认为确立教师培训方案制定与实施的基本要素必须从两个方面进行考虑:一是必须直指本质;二是避免相互交叉。基于要素的内涵及确立标准,认为教师培训方案制定与实施的基本要素可以概括为九个方面,即培训需求、培训对象、培训目标、培训课程、培训师资、培训方法、培训评估、培训综合保障管理、培训跟踪指导服务。各要素之间是彼此联系,相互影响,共同作用于整个教师培训活动当中。