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.
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.
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)
An integer programming formulation of the parsimonious loss of heterozygosity problem.
Catanzaro, Daniele; Labbé, Martine; Halldórsson, Bjarni V
2013-01-01
A loss of heterozygosity (LOH) event occurs when, by the laws of Mendelian inheritance, an individual should be heterozygote at a given site but, due to a deletion polymorphism, is not. Deletions play an important role in human disease and their detection could provide fundamental insights for the development of new diagnostics and treatments. In this paper, we investigate the parsimonious loss of heterozygosity problem (PLOHP), i.e., the problem of partitioning suspected polymorphisms from a set of individuals into a minimum number of deletion areas. Specifically, we generalize Halldórsson et al.'s work by providing a more general formulation of the PLOHP and by showing how one can incorporate different recombination rates and prior knowledge about the locations of deletions. Moreover, we show that the PLOHP can be formulated as a specific version of the clique partition problem in a particular class of graphs called undirected catch-point interval graphs and we prove its general $({\\cal NP})$-hardness. Finally, we provide a state-of-the-art integer programming (IP) formulation and strengthening valid inequalities to exactly solve real instances of the PLOHP containing up to 9,000 individuals and 3,000 SNPs. Our results give perspectives on the mathematics of the PLOHP and suggest new directions on the development of future efficient exact solution approaches.
Neutrosophic Integer Programming Problem
Directory of Open Access Journals (Sweden)
Mai Mohamed
2017-02-01
Full Text Available In this paper, we introduce the integer programming in neutrosophic environment, by considering coffecients of problem as a triangulare neutrosophic numbers. The degrees of acceptance, indeterminacy and rejection of objectives are simultaneously considered.
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...
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.
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...... formulation provided four new best known lower bounds and, used in a matheuristic framework, improved eleven best known solutions. The computational experiments also show that the resulting integer programming models from the proposed formulation are more effectively solved for most of the instances....
Energy Technology Data Exchange (ETDEWEB)
Waddell, Lucas [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Muldoon, Frank [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Henry, Stephen Michael [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Hoffman, Matthew John [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Zwerneman, April Marie [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Backlund, Peter [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Melander, Darryl J. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Lawton, Craig R. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Rice, Roy Eugene [Teledyne Brown Engineering, Huntsville, AL (United States)
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.
Bivium as a Mixed Integer Programming Problem
DEFF Research Database (Denmark)
Borghoff, Julia; Knudsen, Lars Ramkilde; Stolpe, Mathias
2009-01-01
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...
Linear and integer programming made easy
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...
Stochastic programming with integer recourse
van der Vlerk, Maarten Hendrikus
1995-01-01
In this thesis we consider two-stage stochastic linear programming models with integer recourse. Such models are at the intersection of two different branches of mathematical programming. On the one hand some of the model parameters are random, which places the problem in the field of stochastic
Integer programming theory, applications, and computations
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
Stochastic integer programming by dynamic programming
Lageweg, B.J.; Lenstra, J.K.; Rinnooy Kan, A.H.G.; Stougie, L.; Ermoliev, Yu.; Wets, R.J.B.
1988-01-01
Stochastic integer programming is a suitable tool for modeling hierarchical decision situations with combinatorial features. In continuation of our work on the design and analysis of heuristics for such problems, we now try to find optimal solutions. Dynamic programming techniques can be used to
Applied Integer Programming Modeling and Solution
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
Domí nguez, Luis F.; Pistikopoulos, Efstratios N.
2010-01-01
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
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...
Optimal Diet Planning for Eczema Patient Using Integer Programming
Zhen Sheng, Low; Sufahani, Suliadi
2018-04-01
Human diet planning is conducted by choosing appropriate food items that fulfill the nutritional requirements into the diet formulation. This paper discusses the application of integer programming to build the mathematical model of diet planning for eczema patients. The model developed is used to solve the diet problem of eczema patients from young age group. The integer programming is a scientific approach to select suitable food items, which seeks to minimize the costs, under conditions of meeting desired nutrient quantities, avoiding food allergens and getting certain foods into the diet that brings relief to the eczema conditions. This paper illustrates that the integer programming approach able to produce the optimal and feasible solution to deal with the diet problem of eczema patient.
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.
Optimization of Product Instantiation using Integer Programming
van den Broek, P.M.; Botterweck, Goetz; Jarzabek, Stan; Kishi, Tomoji
2010-01-01
We show that Integer Programming (IP) can be used as an optimization technique for the instantiation of products of feature models. This is done by showing that the constraints of feature models can be written in linear form. As particular IP technique, we use Gomory cutting planes. We have applied
Logic integer programming models for signaling networks.
Haus, Utz-Uwe; Niermann, Kathrin; Truemper, Klaus; Weismantel, Robert
2009-05-01
We propose a static and a dynamic approach to model biological signaling networks, and show how each can be used to answer relevant biological questions. For this, we use the two different mathematical tools of Propositional Logic and Integer Programming. The power of discrete mathematics for handling qualitative as well as quantitative data has so far not been exploited in molecular biology, which is mostly driven by experimental research, relying on first-order or statistical models. The arising logic statements and integer programs are analyzed and can be solved with standard software. For a restricted class of problems the logic models reduce to a polynomial-time solvable satisfiability algorithm. Additionally, a more dynamic model enables enumeration of possible time resolutions in poly-logarithmic time. Computational experiments are included.
A 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.
Integer programming of cement distribution by train
Indarsih
2018-01-01
Cement industry in Central Java distributes cement by train to meet daily demand in Yogyakarta and Central Java area. There are five destination stations. For each destination station, there is a warehouse to load cements. Decision maker of cement industry have a plan to redesign the infrastructure and transportation system. The aim is to determine how many locomotives, train wagons, and containers and how to arrange train schedules with subject to the delivery time. For this purposes, we consider an integer programming to minimize the total of operational cost. Further, we will discuss a case study and the solution the problem can be calculated by LINGO software.
Network interdiction and stochastic integer programming
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....
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.
A fixed recourse integer programming approach towards a ...
African Journals Online (AJOL)
Regardless of the success that linear programming and integer linear programming has had in applications in engineering, business and economics, one has to challenge the assumed reality that these optimization models represent. In this paper the certainty assumptions of an integer linear program application is ...
Towards Merging Binary Integer Programming Techniques with Genetic Algorithms
Directory of Open Access Journals (Sweden)
Reza Zamani
2017-01-01
Full Text Available This paper presents a framework based on merging a binary integer programming technique with a genetic algorithm. The framework uses both lower and upper bounds to make the employed mathematical formulation of a problem as tight as possible. For problems whose optimal solutions cannot be obtained, precision is traded with speed through substituting the integrality constrains in a binary integer program with a penalty. In this way, instead of constraining a variable u with binary restriction, u is considered as real number between 0 and 1, with the penalty of Mu(1-u, in which M is a large number. Values not near to the boundary extremes of 0 and 1 make the component of Mu(1-u large and are expected to be avoided implicitly. The nonbinary values are then converted to priorities, and a genetic algorithm can use these priorities to fill its initial pool for producing feasible solutions. The presented framework can be applied to many combinatorial optimization problems. Here, a procedure based on this framework has been applied to a scheduling problem, and the results of computational experiments have been discussed, emphasizing the knowledge generated and inefficiencies to be circumvented with this framework in future.
Mixed Integer Programming and Heuristic Scheduling for Space Communication
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.
Mixed integer linear programming for maximum-parsimony phylogeny inference.
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.
New Approaches for Very Large-Scale Integer Programming
2016-06-24
DISTRIBUTION/ AVAILABILITY STATEMENT Approved for Public Release 13. SUPPLEMENTARY NOTES 14. ABSTRACT The focus of this project is new computational... heuristics for integer programs in order to rapidly improve dual bounds. 2. Choosing good branching variables in branch-and-bound algorithms for MIP. 3...programming, algorithms, parallel processing, machine learning, heuristics 16. SECURITY CLASSIFICATION OF: 17. LIMITATION OF ABSTRACT UU 18. NUMBER OF
A mixed integer linear program for an integrated fishery | Hasan ...
African Journals Online (AJOL)
... and labour allocation of quota based integrated fisheries. We demonstrate the workability of our model with a numerical example and sensitivity analysis based on data obtained from one of the major fisheries in New Zealand. Keywords: mixed integer linear program, fishing, trawler scheduling, processing, quotas ORiON: ...
A property of assignment type mixed integer linear programming problems
Benders, J.F.; van Nunen, J.A.E.E.
1982-01-01
In this paper we will proof that rather tight upper bounds can be given for the number of non-unique assignments that are achieved after solving the linear programming relaxation of some types of mixed integer linear assignment problems. Since in these cases the number of splitted assignments is
Integer programming for the generalized high school timetabling problem
DEFF Research Database (Denmark)
Kristiansen, Simon; Sørensen, Matias; Stidsen, Thomas Riis
2015-01-01
, 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...
Heuristic Methods of Integer Programming and Its Applications in Economics
Directory of Open Access Journals (Sweden)
Dominika Crnjac Milić
2010-12-01
Full Text Available A short overview of the results related to integer programming is described in the introductory part of this paper. Furthermore, there is a list of literature related to this field. The main part of the paper analyses the Heuristic method which yields a very fast result without the use of significant mathematical tools.
Investigating Integer Restrictions in Linear Programming
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…
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).
A Mixed Integer Programming for Port Anzali Development Plan
Mahdieh Allahviranloo
2009-01-01
This paper introduces a mixed integer programming model to find the optimum development plan for port Anzali. The model minimizes total system costs taking into account both port infrastructure costs and shipping costs. Due to the multipurpose function of the port, the model consists of 1020 decision variables and 2490 constraints. Results of the model determine the optimum number of berths that should be constructed in each period and for each type of cargo. In addition to, the results of se...
Penempatan Optimal Phasor Measurement Unit (PMU) Dengan Integer Programming
Amrulloh, Yunan Helmy
2013-01-01
Phasor Measurement Unit (PMU) merupakan peralatan yang mampu memberikan pengukuran fasor tegangan dan arus secara real-time. PMU dapat digunakan untuk monitoring, proteksi dan kontrol pada sistem tenaga listrik. Tugas akhir ini membahas penempatan PMU secara optimal berdasarkan topologi jaringan sehingga sistem tenaga listrik dapat diobservasi. Penempatan optimal PMU dirumuskan sebagai masalah Binary Integer Programming (BIP) yang akan memberikan variabel dengan pilihan nilai (0,1) yang menu...
Relaxation and decomposition methods for mixed integer nonlinear programming
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.
Smart-Grid Backbone Network Real-Time Delay Reduction via Integer Programming.
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.
Equitably Distributing Quality of Marine Security Guards Using Integer Programming
2013-03-01
ARB BALMOD COM DoD DoS E HAF HQ 10 IP IQ LP MOS MCESG MSG MSGAT NLP NMC OSAB PCS PP&O Q RSO SAl SD SE SNCO T-ODP LIST OF...and Eurasia 2 Abu Dhabi, United Arab Emirates India and the Middle East 3 Bangkok, Thailand East Asia and Pacific 4 Fort Lauderdale, Florida South...integer, goal, and quadratic programming. LP models and nonlinear programming ( NLP ) models are very similar in model development for both maximizing
Canepa, Edward S.; Claudel, Christian G.
2012-01-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.
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.
Binary integer programming solution for troubleshooting with dependent actions
Czech Academy of Sciences Publication Activity Database
Lín, Václav
2017-01-01
Roč. 53, č. 3 (2017), s. 493-512 ISSN 0023-5954 R&D Projects: GA ČR GA13-20012S Institutional support: RVO:67985556 Keywords : binary integer programming * decision-theoretic troubleshooting Subject RIV: JD - Computer Applications, Robotics OBOR OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8) Impact factor: 0.379, year: 2016 http://library.utia.cas.cz/separaty/2017/MTR/lin-0476547.pdf
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...
Screening synteny blocks in pairwise genome comparisons through integer programming.
Tang, Haibao; Lyons, Eric; Pedersen, Brent; Schnable, James C; Paterson, Andrew H; Freeling, Michael
2011-04-18
It is difficult to accurately interpret chromosomal correspondences such as true orthology and paralogy due to significant divergence of genomes from a common ancestor. Analyses are particularly problematic among lineages that have repeatedly experienced whole genome duplication (WGD) events. To compare multiple "subgenomes" derived from genome duplications, we need to relax the traditional requirements of "one-to-one" syntenic matchings of genomic regions in order to reflect "one-to-many" or more generally "many-to-many" matchings. However this relaxation may result in the identification of synteny blocks that are derived from ancient shared WGDs that are not of interest. For many downstream analyses, we need to eliminate weak, low scoring alignments from pairwise genome comparisons. Our goal is to objectively select subset of synteny blocks whose total scores are maximized while respecting the duplication history of the genomes in comparison. We call this "quota-based" screening of synteny blocks in order to appropriately fill a quota of syntenic relationships within one genome or between two genomes having WGD events. We have formulated the synteny block screening as an optimization problem known as "Binary Integer Programming" (BIP), which is solved using existing linear programming solvers. The computer program QUOTA-ALIGN performs this task by creating a clear objective function that maximizes the compatible set of synteny blocks under given constraints on overlaps and depths (corresponding to the duplication history in respective genomes). Such a procedure is useful for any pairwise synteny alignments, but is most useful in lineages affected by multiple WGDs, like plants or fish lineages. For example, there should be a 1:2 ploidy relationship between genome A and B if genome B had an independent WGD subsequent to the divergence of the two genomes. We show through simulations and real examples using plant genomes in the rosid superorder that the quota
Determining on-fault earthquake magnitude distributions from integer programming
Geist, Eric L.; Parsons, Thomas E.
2018-01-01
Earthquake magnitude distributions among faults within a fault system are determined from regional seismicity and fault slip rates using binary integer programming. A synthetic earthquake catalog (i.e., list of randomly sampled magnitudes) that spans millennia is first formed, assuming that regional seismicity follows a Gutenberg-Richter relation. Each earthquake in the synthetic catalog can occur on any fault and at any location. The objective is to minimize misfits in the target slip rate for each fault, where slip for each earthquake is scaled from its magnitude. The decision vector consists of binary variables indicating which locations are optimal among all possibilities. Uncertainty estimates in fault slip rates provide explicit upper and lower bounding constraints to the problem. An implicit constraint is that an earthquake can only be located on a fault if it is long enough to contain that earthquake. A general mixed-integer programming solver, consisting of a number of different algorithms, is used to determine the optimal decision vector. A case study is presented for the State of California, where a 4 kyr synthetic earthquake catalog is created and faults with slip ≥3 mm/yr are considered, resulting in >106 variables. The optimal magnitude distributions for each of the faults in the system span a rich diversity of shapes, ranging from characteristic to power-law distributions.
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.
Split diversity in constrained conservation prioritization using integer linear programming.
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.
Optimal placement of capacitors in a radial network using conic and mixed integer linear programming
Energy Technology Data Exchange (ETDEWEB)
Jabr, R.A. [Electrical, Computer and Communication Engineering Department, Notre Dame University, P.O. Box: 72, Zouk Mikhael, Zouk Mosbeh (Lebanon)
2008-06-15
This paper considers the problem of optimally placing fixed and switched type capacitors in a radial distribution network. The aim of this problem is to minimize the costs associated with capacitor banks, peak power, and energy losses whilst satisfying a pre-specified set of physical and technical constraints. The proposed solution is obtained using a two-phase approach. In phase-I, the problem is formulated as a conic program in which all nodes are candidates for placement of capacitor banks whose sizes are considered as continuous variables. A global solution of the phase-I problem is obtained using an interior-point based conic programming solver. Phase-II seeks a practical optimal solution by considering capacitor sizes as discrete variables. The problem in this phase is formulated as a mixed integer linear program based on minimizing the L1-norm of deviations from the phase-I state variable values. The solution to the phase-II problem is obtained using a mixed integer linear programming solver. The proposed method is validated via extensive comparisons with previously published results. (author)
Penempatan Optimal Phasor Measurement Unit (PMU dengan Integer Programming
Directory of Open Access Journals (Sweden)
Yunan Helmy Amrulloh
2013-09-01
Full Text Available Phasor Measurement Unit (PMU merupakan peralatan yang mampu memberikan pengukuran fasor tegangan dan arus secara real-time. PMU dapat digunakan untuk monitoring, proteksi dan kontrol pada sistem tenaga listrik. Tugas akhir ini membahas penempatan PMU secara optimal berdasarkan topologi jaringan sehingga sistem tenaga listrik dapat diobservasi. Penempatan optimal PMU dirumuskan sebagai masalah Binary Integer Programming (BIP yang akan memberikan variabel dengan pilihan nilai (0,1 yang menunjukkan tempat yang harus dipasang PMU. Dalam tugas akhir ini, BIP diterapkan untuk menyelesaikan masalah penempatan PMU secara optimal pada sistem tenaga listrik Jawa-Bali 500 KV yang selanjutnya diterapkan dengan penambahan konsep incomplete observability. Hasil simulasi menunjukkan bahwa penerapan BIP pada sistem dengan incomplete observability memberikan jumlah PMU yang lebih sedikit dibandingkan dengan sistem tanpa konsep incomplete observability.
Applications and algorithms for mixed integer nonlinear programming
International Nuclear Information System (INIS)
Leyffer, Sven; Munson, Todd; Linderoth, Jeff; Luedtke, James; Miller, Andrew
2009-01-01
The mathematical modeling of systems often requires the use of both nonlinear and discrete components. Discrete decision variables model dichotomies, discontinuities, and general logical relationships. Nonlinear functions are required to accurately represent physical properties such as pressure, stress, temperature, and equilibrium. Problems involving both discrete variables and nonlinear constraint functions are known as mixed-integer nonlinear programs (MINLPs) and are among the most challenging computational optimization problems faced by researchers and practitioners. In this paper, we describe relevant scientific applications that are naturally modeled as MINLPs, we provide an overview of available algorithms and software, and we describe ongoing methodological advances for solving MINLPs. These algorithmic advances are making increasingly larger instances of this important family of problems tractable.
Developing optimal nurses work schedule using integer programming
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.
Mixed integer (0-1) fractional programming for decision support in paper production industry
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
Learning oncogenetic networks by reducing to mixed integer linear programming.
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.
Maximum likelihood pedigree reconstruction using integer linear programming.
Cussens, James; Bartlett, Mark; Jones, Elinor M; Sheehan, Nuala A
2013-01-01
Large population biobanks of unrelated individuals have been highly successful in detecting common genetic variants affecting diseases of public health concern. However, they lack the statistical power to detect more modest gene-gene and gene-environment interaction effects or the effects of rare variants for which related individuals are ideally required. In reality, most large population studies will undoubtedly contain sets of undeclared relatives, or pedigrees. Although a crude measure of relatedness might sometimes suffice, having a good estimate of the true pedigree would be much more informative if this could be obtained efficiently. Relatives are more likely to share longer haplotypes around disease susceptibility loci and are hence biologically more informative for rare variants than unrelated cases and controls. Distant relatives are arguably more useful for detecting variants with small effects because they are less likely to share masking environmental effects. Moreover, the identification of relatives enables appropriate adjustments of statistical analyses that typically assume unrelatedness. We propose to exploit an integer linear programming optimisation approach to pedigree learning, which is adapted to find valid pedigrees by imposing appropriate constraints. Our method is not restricted to small pedigrees and is guaranteed to return a maximum likelihood pedigree. With additional constraints, we can also search for multiple high-probability pedigrees and thus account for the inherent uncertainty in any particular pedigree reconstruction. The true pedigree is found very quickly by comparison with other methods when all individuals are observed. Extensions to more complex problems seem feasible. © 2012 Wiley Periodicals, Inc.
Discovery of Boolean metabolic networks: integer linear programming based approach.
Qiu, Yushan; Jiang, Hao; Ching, Wai-Ki; Cheng, Xiaoqing
2018-04-11
Traditional drug discovery methods focused on the efficacy of drugs rather than their toxicity. However, toxicity and/or lack of efficacy are produced when unintended targets are affected in metabolic networks. Thus, identification of biological targets which can be manipulated to produce the desired effect with minimum side-effects has become an important and challenging topic. Efficient computational methods are required to identify the drug targets while incurring minimal side-effects. In this paper, we propose a graph-based computational damage model that summarizes the impact of enzymes on compounds in metabolic networks. An efficient method based on Integer Linear Programming formalism is then developed to identify the optimal enzyme-combination so as to minimize the side-effects. The identified target enzymes for known successful drugs are then verified by comparing the results with those in the existing literature. Side-effects reduction plays a crucial role in the study of drug development. A graph-based computational damage model is proposed and the theoretical analysis states the captured problem is NP-completeness. The proposed approaches can therefore contribute to the discovery of drug targets. Our developed software is available at " http://hkumath.hku.hk/~wkc/APBC2018-metabolic-network.zip ".
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.
IESIP - AN IMPROVED EXPLORATORY SEARCH TECHNIQUE FOR PURE INTEGER LINEAR PROGRAMMING PROBLEMS
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.
Integrative improvement method and mixed-integer programming in system planning
International Nuclear Information System (INIS)
Sadegheih, A.
2002-01-01
In this paper, system planning network is formulated for mixed-integer programming and a Ga. The cost function of this problem consists of the capital investment cost in discrete form, the cost of transmission losses and the power generation costs. The Dc load flow equations for the network are embedded in the constraints of the mathematical model to avoid sub-optimal solutions that can arise if the enforcement of such constraints is done in an indirect way. The solution of the model gives the best line additions. and also provides information regarding the optimal generation at each generation point. This method of solutions is demonstrated on the expansion of a 5 bus -bar system to 6 bus-bars
A Mixed Integer Linear Programming Approach to Electrical Stimulation Optimization Problems.
Abouelseoud, Gehan; Abouelseoud, Yasmine; Shoukry, Amin; Ismail, Nour; Mekky, Jaidaa
2018-02-01
Electrical stimulation optimization is a challenging problem. Even when a single region is targeted for excitation, the problem remains a constrained multi-objective optimization problem. The constrained nature of the problem results from safety concerns while its multi-objectives originate from the requirement that non-targeted regions should remain unaffected. In this paper, we propose a mixed integer linear programming formulation that can successfully address the challenges facing this problem. Moreover, the proposed framework can conclusively check the feasibility of the stimulation goals. This helps researchers to avoid wasting time trying to achieve goals that are impossible under a chosen stimulation setup. The superiority of the proposed framework over alternative methods is demonstrated through simulation examples.
FATCOP: A Fault Tolerant Condor-PVM Mixed Integer Program Solver
National Research Council Canada - National Science Library
Chen, Qun
1999-01-01
We describe FATCOP, a new parallel mixed integer program solver written in PVM. The implementation uses the Condor resource management system to provide a virtual machine composed of otherwise idle computers...
Lyubetsky, Vassily; Gershgorin, Roman; Gorbunov, Konstantin
2017-12-06
problems can be reduced to integer linear programming formulations, which allows an algorithm to redefine the problems to implement a very special case of the integer linear programming tool. The results were tested on synthetic and biological samples. Three well-known problems were reduced to a very special case of integer linear programming, which is a new method of their solutions. Integer linear programming is clearly among the main computational methods and, as generally accepted, is fast on average; in particular, computation systems specifically targeted at it are available. The challenges are to reduce the size of the corresponding integer linear programming formulations and to incorporate a more detailed biological concept in our model of the reconstruction.
International Nuclear Information System (INIS)
Sergienko, I.V.; Golodnikov, A.N.
1984-01-01
This article applies the methods of decompositions, which are used to solve continuous linear problems, to integer and partially integer problems. The fall-vector method is used to solve the obtained coordinate problems. An algorithm of the fall-vector is described. The Kornai-Liptak decomposition principle is used to reduce the integer linear programming problem to integer linear programming problems of a smaller dimension and to a discrete coordinate problem with simple constraints
Integer and combinatorial optimization
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
Mixed-Integer Conic Linear Programming: Challenges and Perspectives
2013-10-01
The novel DCCs for MISOCO may be used in branch- and-cut algorithms when solving MISOCO problems. The experimental software CICLO was developed to...perform limited, but rigorous computational experiments. The CICLO solver utilizes continuous SOCO solvers, MOSEK, CPLES or SeDuMi, builds on the open...submitted Fall 2013. Software: 1. CICLO : Integer conic linear optimization package. Authors: J.C. Góez, T.K. Ralphs, Y. Fu, and T. Terlaky
An Improved Search Approach for Solving Non-Convex Mixed-Integer Non Linear Programming Problems
Sitopu, Joni Wilson; Mawengkang, Herman; Syafitri Lubis, Riri
2018-01-01
The nonlinear mathematical programming problem addressed in this paper has a structure characterized by a subset of variables restricted to assume discrete values, which are linear and separable from the continuous variables. The strategy of releasing nonbasic variables from their bounds, combined with the “active constraint” method, has been developed. This strategy is used to force the appropriate non-integer basic variables to move to their neighbourhood integer points. Successful implementation of these algorithms was achieved on various test problems.
Fitting boxes to Manhattan scenes using linear integer programming
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.
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.
50 Years of Integer Programming 1958-2008 From the Early Years to the State-of-the-Art
Jünger, Michael; Naddef, Denis
2010-01-01
In 1958, Ralph E. Gomory transformed the field of integer programming when he published a paper that described a cutting-plane algorithm for pure integer programs and announced that the method could be refined to give a finite algorithm for integer programming. In 2008, to commemorate the anniversary of this seminal paper, a special workshop celebrating fifty years of integer programming was held in Aussois, France, as part of the 12th Combinatorial Optimization Workshop. It contains reprints of key historical articles and written versions of survey lectures on six of the hottest topics in the
A Two-Stage Stochastic Mixed-Integer Programming Approach to the Smart House Scheduling Problem
Ozoe, Shunsuke; Tanaka, Yoichi; Fukushima, Masao
A “Smart House” is a highly energy-optimized house equipped with photovoltaic systems (PV systems), electric battery systems, fuel cell cogeneration systems (FC systems), electric vehicles (EVs) and so on. Smart houses are attracting much attention recently thanks to their enhanced ability to save energy by making full use of renewable energy and by achieving power grid stability despite an increased power draw for installed PV systems. Yet running a smart house's power system, with its multiple power sources and power storages, is no simple task. In this paper, we consider the problem of power scheduling for a smart house with a PV system, an FC system and an EV. We formulate the problem as a mixed integer programming problem, and then extend it to a stochastic programming problem involving recourse costs to cope with uncertain electricity demand, heat demand and PV power generation. Using our method, we seek to achieve the optimal power schedule running at the minimum expected operation cost. We present some results of numerical experiments with data on real-life demands and PV power generation to show the effectiveness of our method.
A mixed integer program to model spatial wildfire behavior and suppression placement decisions
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...
Directory of Open Access Journals (Sweden)
Maoyuan Feng
2014-01-01
Full Text Available This study proposes a mixed integer linear programming (MILP model to optimize the spillways scheduling for reservoir flood control. Unlike the conventional reservoir operation model, the proposed MILP model specifies the spillways status (including the number of spillways to be open and the degree of the spillway opened instead of reservoir release, since the release is actually controlled by using the spillway. The piecewise linear approximation is used to formulate the relationship between the reservoir storage and water release for a spillway, which should be open/closed with a status depicted by a binary variable. The control order and symmetry rules of spillways are described and incorporated into the constraints for meeting the practical demand. Thus, a MILP model is set up to minimize the maximum reservoir storage. The General Algebraic Modeling System (GAMS and IBM ILOG CPLEX Optimization Studio (CPLEX software are used to find the optimal solution for the proposed MILP model. The China’s Three Gorges Reservoir, whose spillways are of five types with the total number of 80, is selected as the case study. It is shown that the proposed model decreases the flood risk compared with the conventional operation and makes the operation more practical by specifying the spillways status directly.
An Integer Programming Model for Multi-Echelon Supply Chain Decision Problem Considering Inventories
Harahap, Amin; Mawengkang, Herman; Siswadi; Effendi, Syahril
2018-01-01
In this paper we address a problem that is of significance to the industry, namely the optimal decision of a multi-echelon supply chain and the associated inventory systems. By using the guaranteed service approach to model the multi-echelon inventory system, we develop a mixed integer; programming model to simultaneously optimize the transportation, inventory and network structure of a multi-echelon supply chain. To solve the model we develop a direct search approach using a strategy of releasing nonbasic variables from their bounds, combined with the “active constraint” method. This strategy is used to force the appropriate non-integer basic variables to move to their neighbourhood integer points.
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
there is the complicating factor that some of the variables are required to be integral. The resulting class of problems is named multiobjective mixed integer programming (MOMIP) problems. Solving these kinds of optimization problems exactly requires a method that can generate the whole set of nondominated points (the...... 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......, and one of the two objectives has only integer variables. The proposed method is able to find the full set of nondominated points. It is tested on a large number of problem instances, from six different classes of MOMIP problems. The results reveal that the developed biobjective branch and bound method...
DEFF Research Database (Denmark)
Liu, Zhaoxi; Wu, Qiuwei; Oren, Shmuel S.
2017-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...
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...
Schultz, R.; Stougie, L.; Vlerk, van der M.H.
1998-01-01
In this paper we present a framework for solving stochastic programs with complete integer recourse and discretely distributed right-hand side vector, using Gröbner basis methods from computational algebra to solve the numerous second-stage integer programs. Using structural properties of the
Mixed Integer Programming and Heuristic Scheduling for Space Communication Networks
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.
Directory of Open Access Journals (Sweden)
Animesh Biswas
2016-04-01
Full Text Available This paper deals with fuzzy goal programming approach to solve fuzzy linear bilevel integer programming problems with fuzzy probabilistic constraints following Pareto distribution and Frechet distribution. In the proposed approach a new chance constrained programming methodology is developed from the view point of managing those probabilistic constraints in a hybrid fuzzy environment. A method of defuzzification of fuzzy numbers using ?-cut has been adopted to reduce the problem into a linear bilevel integer programming problem. The individual optimal value of the objective of each DM is found in isolation to construct the fuzzy membership goals. Finally, fuzzy goal programming approach is used to achieve maximum degree of each of the membership goals by minimizing under deviational variables in the decision making environment. To demonstrate the efficiency of the proposed approach, a numerical example is provided.
Combinatorial therapy discovery using mixed integer linear programming.
Pang, Kaifang; Wan, Ying-Wooi; Choi, William T; Donehower, Lawrence A; Sun, Jingchun; Pant, Dhruv; Liu, Zhandong
2014-05-15
Combinatorial therapies play increasingly important roles in combating complex diseases. Owing to the huge cost associated with experimental methods in identifying optimal drug combinations, computational approaches can provide a guide to limit the search space and reduce cost. However, few computational approaches have been developed for this purpose, and thus there is a great need of new algorithms for drug combination prediction. Here we proposed to formulate the optimal combinatorial therapy problem into two complementary mathematical algorithms, Balanced Target Set Cover (BTSC) and Minimum Off-Target Set Cover (MOTSC). Given a disease gene set, BTSC seeks a balanced solution that maximizes the coverage on the disease genes and minimizes the off-target hits at the same time. MOTSC seeks a full coverage on the disease gene set while minimizing the off-target set. Through simulation, both BTSC and MOTSC demonstrated a much faster running time over exhaustive search with the same accuracy. When applied to real disease gene sets, our algorithms not only identified known drug combinations, but also predicted novel drug combinations that are worth further testing. In addition, we developed a web-based tool to allow users to iteratively search for optimal drug combinations given a user-defined gene set. Our tool is freely available for noncommercial use at http://www.drug.liuzlab.org/. zhandong.liu@bcm.edu Supplementary data are available at Bioinformatics online.
Approximation in two-stage stochastic integer programming
W. Romeijnders; L. Stougie (Leen); M. van der Vlerk
2014-01-01
htmlabstractApproximation algorithms are the prevalent solution methods in the field of stochastic programming. Problems in this field are very hard to solve. Indeed, most of the research in this field has concentrated on designing solution methods that approximate the optimal solution value.
Approximation in two-stage stochastic integer programming
Romeijnders, W.; Stougie, L.; van der Vlerk, M.H.
2014-01-01
Approximation algorithms are the prevalent solution methods in the field of stochastic programming. Problems in this field are very hard to solve. Indeed, most of the research in this field has concentrated on designing solution methods that approximate the optimal solution value. However,
Integer goal programming approach for finding a compromise ...
African Journals Online (AJOL)
In second model the cost and time spent on repairing the components are considered as two different objectives. Selective maintenance operation is used to select the repairable components and a multi-objective goal programming algorithm is proposed to obtain compromise selection of repairable components for the two ...
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....
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 algorithm. The drastic reduction of space needed allows us to solve much larger instances than was possible before using this technique....
The use of mixed-integer programming for inverse treatment planning with pre-defined field segments
International Nuclear Information System (INIS)
Bednarz, Greg; Michalski, Darek; Houser, Chris; Huq, M. Saiful; Xiao Ying; Rani, Pramila Anne; Galvin, James M.
2002-01-01
Complex intensity patterns generated by traditional beamlet-based inverse treatment plans are often very difficult to deliver. In the approach presented in this work the intensity maps are controlled by pre-defining field segments to be used for dose optimization. A set of simple rules was used to define a pool of allowable delivery segments and the mixed-integer programming (MIP) method was used to optimize segment weights. The optimization problem was formulated by combining real variables describing segment weights with a set of binary variables, used to enumerate voxels in targets and critical structures. The MIP method was compared to the previously used Cimmino projection algorithm. The field segmentation approach was compared to an inverse planning system with a traditional beamlet-based beam intensity optimization. In four complex cases of oropharyngeal cancer the segmental inverse planning produced treatment plans, which competed with traditional beamlet-based IMRT plans. The mixed-integer programming provided mechanism for imposition of dose-volume constraints and allowed for identification of the optimal solution for feasible problems. Additional advantages of the segmental technique presented here are: simplified dosimetry, quality assurance and treatment delivery. (author)
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.
Aspect-object alignment with Integer Linear Programming in opinion mining.
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.
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...... applied to the TPC-C benchmark and the heuristic is shown to obtain solutions with costs close to the ones found using the quadratic program....
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 proﬁt. In particular, carcasses must be sorted in order to produce the “right” ﬁnal 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.......Slaughterhouses are major players in the pork supply chain, and supply and demand must be matched in order to generate the highest proﬁt. In particular, carcasses must be sorted in order to produce the “right” ﬁnal products from the “right” carcasses. We develop a mixed-integer programming (MIP...
Mixed integer linear programming model for dynamic supplier selection problem considering discounts
Directory of Open Access Journals (Sweden)
Adi Wicaksono Purnawan
2018-01-01
Full Text Available Supplier selection is one of the most important elements in supply chain management. This function involves evaluation of many factors such as, material costs, transportation costs, quality, delays, supplier capacity, storage capacity and others. Each of these factors varies with time, therefore, supplier identified for one period is not necessarily be same for the next period to supply the same product. So, mixed integer linear programming (MILP was developed to overcome the dynamic supplier selection problem (DSSP. In this paper, a mixed integer linear programming model is built to solve the lot-sizing problem with multiple suppliers, multiple periods, multiple products and quantity discounts. The buyer has to make a decision for some products which will be supplied by some suppliers for some periods cosidering by discount. To validate the MILP model with randomly generated data. The model is solved by Lingo 16.
Enhanced index tracking modeling in portfolio optimization with mixed-integer programming z approach
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.
A Mixed Integer Linear Programming Model for the North Atlantic Aircraft Trajectory Planning
Sbihi , Mohammed; Rodionova , Olga; Delahaye , Daniel; Mongeau , Marcel
2015-01-01
International audience; This paper discusses the trajectory planning problem for ights in the North Atlantic oceanic airspace (NAT). We develop a mathematical optimization framework in view of better utilizing available capacity by re-routing aircraft. The model is constructed by discretizing the problem parameters. A Mixed integer linear program (MILP) is proposed. Based on the MILP a heuristic to solve real-size instances is also introduced
Chenlu Miao; Gang Du; Yi Xia; Danping Wang
2016-01-01
Many leader-follower relationships exist in product family design engineering problems. We use bilevel programming (BLP) to reflect the leader-follower relationship and describe such problems. Product family design problems have unique characteristics; thus, mixed integer nonlinear BLP (MINLBLP), which has both continuous and discrete variables and multiple independent lower-level problems, is widely used in product family optimization. However, BLP is difficult in theory and is an NP-hard pr...
Learning Bayesian network structure: towards the essential graph by integer linear programming tools
Czech Academy of Sciences Publication Activity Database
Studený, Milan; Haws, D.
2014-01-01
Roč. 55, č. 4 (2014), s. 1043-1071 ISSN 0888-613X R&D Projects: GA ČR GA13-20012S Institutional support: RVO:67985556 Keywords : learning Bayesian network structure * integer linear programming * characteristic imset * essential graph Subject RIV: BA - General Mathematics Impact factor: 2.451, year: 2014 http://library.utia.cas.cz/separaty/2014/MTR/studeny-0427002.pdf
Urselmann, Maren; Emmerich, Michael T. M.; Till, Jochen; Sand, Guido; Engell, Sebastian
2007-07-01
Engineering optimization often deals with large, mixed-integer search spaces with a rigid structure due to the presence of a large number of constraints. Metaheuristics, such as evolutionary algorithms (EAs), are frequently suggested as solution algorithms in such cases. In order to exploit the full potential of these algorithms, it is important to choose an adequate representation of the search space and to integrate expert-knowledge into the stochastic search operators, without adding unnecessary bias to the search. Moreover, hybridisation with mathematical programming techniques such as mixed-integer programming (MIP) based on a problem decomposition can be considered for improving algorithmic performance. In order to design problem-specific EAs it is desirable to have a set of design guidelines that specify properties of search operators and representations. Recently, a set of guidelines has been proposed that gives rise to so-called Metric-based EAs (MBEAs). Extended by the minimal moves mutation they allow for a generalization of EA with self-adaptive mutation strength in discrete search spaces. In this article, a problem-specific EA for process engineering task is designed, following the MBEA guidelines and minimal moves mutation. On the background of the application, the usefulness of the design framework is discussed, and further extensions and corrections proposed. As a case-study, a two-stage stochastic programming problem in chemical batch process scheduling is considered. The algorithm design problem can be viewed as the choice of a hierarchical decision structure, where on different layers of the decision process symmetries and similarities can be exploited for the design of minimal moves. After a discussion of the design approach and its instantiation for the case-study, the resulting problem-specific EA/MIP is compared to a straightforward application of a canonical EA/MIP and to a monolithic mathematical programming algorithm. In view of the
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.
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.
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
DEFF Research Database (Denmark)
Pour, Shahrzad M.; Drake, John H.; Ejlertsen, Lena Secher
2017-01-01
A railway signaling system is a complex and interdependent system which should ensure the safe operation of trains. We introduce and address a mixed integer optimisation model for the preventive signal maintenance crew scheduling problem in the Danish railway system. The problem contains many...... to feed as ‘warm start’ solutions to a Mixed Integer Programming (MIP) solver for further optimisation. We apply the CP/MIP framework to a section of the Danish rail network and benchmark our results against both direct application of a MIP solver and modelling the problem as a Constraint Optimisation...
Domí nguez, Luis F.; Pistikopoulos, Efstratios N.
2012-01-01
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
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.
Wihartiko, F. D.; Wijayanti, H.; Virgantari, F.
2018-03-01
Genetic Algorithm (GA) is a common algorithm used to solve optimization problems with artificial intelligence approach. Similarly, the Particle Swarm Optimization (PSO) algorithm. Both algorithms have different advantages and disadvantages when applied to the case of optimization of the Model Integer Programming for Bus Timetabling Problem (MIPBTP), where in the case of MIPBTP will be found the optimal number of trips confronted with various constraints. The comparison results show that the PSO algorithm is superior in terms of complexity, accuracy, iteration and program simplicity in finding the optimal solution.
Mixed Integer Linear Programming model for Crude Palm Oil Supply Chain Planning
Sembiring, Pasukat; Mawengkang, Herman; Sadyadharma, Hendaru; Bu'ulolo, F.; Fajriana
2018-01-01
The production process of crude palm oil (CPO) can be defined as the milling process of raw materials, called fresh fruit bunch (FFB) into end products palm oil. The process usually through a series of steps producing and consuming intermediate products. The CPO milling industry considered in this paper does not have oil palm plantation, therefore the FFB are supplied by several public oil palm plantations. Due to the limited availability of FFB, then it is necessary to choose from which plantations would be appropriate. This paper proposes a mixed integer linear programming model the supply chain integrated problem, which include waste processing. The mathematical programming model is solved using neighborhood search approach.
Optimal Allocation of Static Var Compensator via Mixed Integer Conic Programming
Energy Technology Data Exchange (ETDEWEB)
Zhang, Xiaohu [ORNL; Shi, Di [Global Energy Interconnection Research Institute North America (GEIRI North America), California; Wang, Zhiwei [Global Energy Interconnection Research Institute North America (GEIRI North America), California; Huang, Junhui [Global Energy Interconnection Research Institute North America (GEIRI North America), California; Wang, Xu [Global Energy Interconnection Research Institute North America (GEIRI North America), California; Liu, Guodong [ORNL; Tomsovic, Kevin [University of Tennessee, Knoxville (UTK)
2017-01-01
Shunt FACTS devices, such as, a Static Var Compensator (SVC), are capable of providing local reactive power compensation. They are widely used in the network to reduce the real power loss and improve the voltage profile. This paper proposes a planning model based on mixed integer conic programming (MICP) to optimally allocate SVCs in the transmission network considering load uncertainty. The load uncertainties are represented by a number of scenarios. Reformulation and linearization techniques are utilized to transform the original non-convex model into a convex second order cone programming (SOCP) model. Numerical case studies based on the IEEE 30-bus system demonstrate the effectiveness of the proposed planning model.
An integer programming model for a forest harvest problem in Pinus pinaster stands
Energy Technology Data Exchange (ETDEWEB)
Fonseca, T. F.; Cerveira, A.; Mota, A.
2012-11-01
The study addresses the special case of a management plan for maritime pine (Pinus pinaster Ait.) in common lands. The study area refers to 4,432 ha of maritime pine stands in North Portugal (Perimetro Florestal do Barroso in the county of Ribeira de Pena), distributed among five common lands called baldio areas. Those lands are co-managed by the Official Forest Services and the local communities, essentially for timber production, using empirical guidance. As the current procedure does not guarantee the best thinning and clear-cutting scheduling, it was considered important to develop easy-to-use models, supported by optimization techniques, to be employed by the forest managers in the harvest planning of these communitarian forests. Planning of the thinning and clear-cutting operations involved certain conditions, such as: (1) the optimal age for harvesting; (2) the maximum stand density permitted; (3) the minimum volume to be cut; (4) the guarantee of incomes for each of the five baldios in at least a two year period; (5) balanced incomes during the length of the projection period. In order to evaluate the sustainability of the wood resources, a set of constraints lower bounding the average ending age was additionally tested. The problem was formulated as an integer linear programming model where the incomes from thinning and clear-cutting are maximized while considering the constraints mentioned above. Five major scenarios were simulated. The simplest one allows for silvicultural constraints only, whereas the other four consider these constraints besides different management options. Two of them introduce joint management of all common areas with or without constraints addressing balanced distribution of incomes during the plan horizon, whilst the other two consider the same options but for individual management of the baldios. The proposed model is easy to apply, providing immediate advantages for short and mid-term planning periods compared to the empirical
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.
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.
Scheduling of head-dependent cascaded hydro systems: Mixed-integer quadratic programming approach
International Nuclear Information System (INIS)
Catalao, J.P.S.; Pousinho, H.M.I.; Mendes, V.M.F.
2010-01-01
This paper is on the problem of short-term hydro scheduling, particularly concerning head-dependent cascaded hydro systems. We propose a novel mixed-integer quadratic programming approach, considering not only head-dependency, but also discontinuous operating regions and discharge ramping constraints. Thus, an enhanced short-term hydro scheduling is provided due to the more realistic modeling presented in this paper. Numerical results from two case studies, based on Portuguese cascaded hydro systems, illustrate the proficiency of the proposed approach.
Scheduling of head-dependent cascaded hydro systems: Mixed-integer quadratic programming approach
Energy Technology Data Exchange (ETDEWEB)
Catalao, J.P.S.; Pousinho, H.M.I. [Department of Electromechanical Engineering, University of Beira Interior, R. Fonte do Lameiro, 6201-001 Covilha (Portugal); Mendes, V.M.F. [Department of Electrical Engineering and Automation, Instituto Superior de Engenharia de Lisboa, R. Conselheiro Emidio Navarro, 1950-062 Lisbon (Portugal)
2010-03-15
This paper is on the problem of short-term hydro scheduling, particularly concerning head-dependent cascaded hydro systems. We propose a novel mixed-integer quadratic programming approach, considering not only head-dependency, but also discontinuous operating regions and discharge ramping constraints. Thus, an enhanced short-term hydro scheduling is provided due to the more realistic modeling presented in this paper. Numerical results from two case studies, based on Portuguese cascaded hydro systems, illustrate the proficiency of the proposed approach. (author)
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.
An Improved Method for Solving Multiobjective Integer Linear Fractional Programming Problem
Directory of Open Access Journals (Sweden)
Meriem Ait Mehdi
2014-01-01
Full Text Available We describe an improvement of Chergui and Moulaï’s method (2008 that generates the whole efficient set of a multiobjective integer linear fractional program based on the branch and cut concept. The general step of this method consists in optimizing (maximizing without loss of generality one of the fractional objective functions over a subset of the original continuous feasible set; then if necessary, a branching process is carried out until obtaining an integer feasible solution. At this stage, an efficient cut is built from the criteria’s growth directions in order to discard a part of the feasible domain containing only nonefficient solutions. Our contribution concerns firstly the optimization process where a linear program that we define later will be solved at each step rather than a fractional linear program. Secondly, local ideal and nadir points will be used as bounds to prune some branches leading to nonefficient solutions. The computational experiments show that the new method outperforms the old one in all the treated instances.
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.
An improved exploratory search technique for pure integer linear programming problems
Fogle, F. R.
1990-01-01
The development is documented of a heuristic method for the solution of pure integer linear programming problems. The procedure draws its methodology from the ideas of Hooke and Jeeves type 1 and 2 exploratory searches, greedy procedures, and neighborhood searches. It uses an efficient rounding method to obtain its first feasible integer point from the optimal continuous solution obtained via the simplex method. Since this method is based entirely on simple addition or subtraction of one to each variable of a point in n-space and the subsequent comparison of candidate solutions to a given set of constraints, it facilitates significant complexity improvements over existing techniques. It also obtains the same optimal solution found by the branch-and-bound technique in 44 of 45 small to moderate size test problems. Two example problems are worked in detail to show the inner workings of the method. Furthermore, using an established weighted scheme for comparing computational effort involved in an algorithm, a comparison of this algorithm is made to the more established and rigorous branch-and-bound method. A computer implementation of the procedure, in PC compatible Pascal, is also presented and discussed.
DEFF Research Database (Denmark)
Ommen, Torben Schmidt; Markussen, Wiebke Brix; Elmegaard, Brian
2014-01-01
In the paper, three frequently used operation optimisation methods are examined with respect to their impact on operation management of the combined utility technologies for electric power and DH (district heating) of eastern Denmark. The investigation focusses on individual plant operation...... 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...... as a benchmark, as this type is frequently used, and has the lowest amount of constraints of the three. A comparison of the optimised operation of a number of units shows significant differences between the three methods. Compared to the reference, the use of binary integer variables, increases operation...
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…
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.
Planning of fuel coal imports using a mixed integer programming method
International Nuclear Information System (INIS)
Shih, L.H.
1997-01-01
In the public utility and commercial fuel industries, commodities from multiple supply sources are sometimes blended before use to reduce costs and assure quality. A typical example of these commodities is the fuel coal used in coal fired power plants. The diversity of the supply sources for these plants makes the planning and scheduling of fuel coal logistics difficult, especially for a power company that has more than one power plant. This study proposes a mixed integer programming model that provides planning and scheduling of coal imports from multiple suppliers for the Taiwan Power Company. The objective is to minimize total inventory cost by minimizing procurement cost, transportation cost and holding cost. Constraints on the system include company procurement policy, power plant demand, harbor unloading capacity, inventory balance equations, blending requirements, and safety stock. An example problem is presented using the central coal logistics system of the Taiwan Power Company to demonstrate the validity of the proposed model
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
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......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...... 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...
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
. The potential for making cost-effective and energy-efficient liner-shipping networks using operations research (OR) is huge and neglected. The implementation of logistic planning tools based upon OR has enhanced performance of airlines, railways, and general transportation companies, but within the field......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...... 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...
Planning of fuel coal imports using a mixed integer programming method
Energy Technology Data Exchange (ETDEWEB)
Shih, L.H. [National Cheng Kung University, Tainan (Taiwan). Dept. of Mineral and Petroleum Engineering
1997-12-31
In the public utility and commercial fuel industries, commodities from multiple supply sources are sometimes blended before use to reduce costs and assure quality. A typical example of these commodities is the fuel coal used in coal fired power plants. The diversity of the supply sources for these plants makes the planning and scheduling of fuel coal logistics difficult, especially for a power company that has more than one power plant. This study proposes a mixed integer programming model that provides planning and scheduling of coal imports from multiple suppliers for the Taiwan Power Company. The objective is to minimize total inventory cost by minimizing procurement cost, transportation cost and holding cost. Constraints on the system include company procurement policy, power plant demand, harbor unloading capacity, inventory balance equations, blending requirements, and safety stock. An example problem is presented using the central coal logistics system of the Taiwan Power Company to demonstrate the validity of the proposed model.
Personnel scheduling using an integer programming model- an application at Avanti Blue-Nile Hotels.
Kassa, Biniyam Asmare; Tizazu, Anteneh Eshetu
2013-01-01
In this paper, we report perhaps a first of its kind application of management science in the Ethiopian hotel industry. Avanti Blue Nile Hotels, a newly established five star hotel in Bahir Dar, is the company for which we developed an integer programming model that determines an optimal weekly shift schedule for the Hotel's engineering department personnel while satisfying several constraints including weekly rest requirements per employee, rest requirements between working shifts per employee, required number of personnel per shift, and other constraints. The model is implemented on an excel solver routine. The model enables the company's personnel department management to develop a fair personnel schedule as needed and to effectively utilize personnel resources while satisfying several technical, legal and economic requirements. These encouraging achievements make us optimistic about the gains other Ethiopian organizations can amass by introducing management science approaches in their management planning and decision making systems.
Advances in mixed-integer programming methods for chemical production scheduling.
Velez, Sara; Maravelias, Christos T
2014-01-01
The goal of this paper is to critically review advances in the area of chemical production scheduling over the past three decades and then present two recently proposed solution methods that have led to dramatic computational enhancements. First, we present a general framework and problem classification and discuss modeling and solution methods with an emphasis on mixed-integer programming (MIP) techniques. Second, we present two solution methods: (a) a constraint propagation algorithm that allows us to compute parameters that are then used to tighten MIP scheduling models and (b) a reformulation that introduces new variables, thus leading to effective branching. We also present computational results and an example illustrating how these methods are implemented, as well as the resulting enhancements. We close with a discussion of open research challenges and future research directions.
An integer programming model for gate assignment problem at airline terminals
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.
Bi-objective integer programming for RNA secondary structure prediction with pseudoknots.
Legendre, Audrey; Angel, Eric; Tahi, Fariza
2018-01-15
RNA structure prediction is an important field in bioinformatics, and numerous methods and tools have been proposed. Pseudoknots are specific motifs of RNA secondary structures that are difficult to predict. Almost all existing methods are based on a single model and return one solution, often missing the real structure. An alternative approach would be to combine different models and return a (small) set of solutions, maximizing its quality and diversity in order to increase the probability that it contains the real structure. We propose here an original method for predicting RNA secondary structures with pseudoknots, based on integer programming. We developed a generic bi-objective integer programming algorithm allowing to return optimal and sub-optimal solutions optimizing simultaneously two models. This algorithm was then applied to the combination of two known models of RNA secondary structure prediction, namely MEA and MFE. The resulting tool, called BiokoP, is compared with the other methods in the literature. The results show that the best solution (structure with the highest F 1 -score) is, in most cases, given by BiokoP. Moreover, the results of BiokoP are homogeneous, regardless of the pseudoknot type or the presence or not of pseudoknots. Indeed, the F 1 -scores are always higher than 70% for any number of solutions returned. The results obtained by BiokoP show that combining the MEA and the MFE models, as well as returning several optimal and several sub-optimal solutions, allow to improve the prediction of secondary structures. One perspective of our work is to combine better mono-criterion models, in particular to combine a model based on the comparative approach with the MEA and the MFE models. This leads to develop in the future a new multi-objective algorithm to combine more than two models. BiokoP is available on the EvryRNA platform: https://EvryRNA.ibisc.univ-evry.fr .
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.
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.
Directory of Open Access Journals (Sweden)
Denny Nurkertamanda
2012-02-01
Full Text Available In paper cutting industry, cutting stock problem (CSP is a problem about how to cutting paper depends on quantity and specify of the demand. CSP related with dimension of pieces and rectangle which is use. In this research, we use one type dimension of rectangle and six type dimension of pieces and cutting all paper by two stage guillotine pattern. The major focus of this research is to formulate the paper cutting problem using integer linear programming. Cutting large objects into small pieces can be found in many industries. Inevitably, the cutting processes produce trim loss. On the rectangle we can put some different dimension of pieces then we can make certain pattern. The modification pattern have to produce minimum trim loss. Thus to develop optimal cutting pattern to reduce trim loss is the main purpose of this research. To reach that, we use branch and bound algorithm then continued with sensitivity analysis. From the research, we get optimum patten of paper cutting and quantity production for that pattern. Decision for quantity production depends on average demand every day. Beside that, we also give some alternative rules of production system which can take by the company. Keywords : Cutting stock problem, two stage guillotine pattern, branch and bound algorithm
International Nuclear Information System (INIS)
Khrennikov, Andrei; Klein, Moshe; Mor, Tal
2010-01-01
In number theory, a partition of a positive integer n is a way of writing n as a sum of positive integers. The number of partitions of n is given by the partition function p(n). Inspired by quantum information processing, we extend the concept of partitions in number theory as follows: for an integer n, we treat each partition as a basis state of a quantum system representing that number n, so that the Hilbert-space that corresponds to that integer n is of dimension p(n); the 'classical integer' n can thus be generalized into a (pure) quantum state ||ψ(n) > which is a superposition of the partitions of n, in the same way that a quantum bit (qubit) is a generalization of a classical bit. More generally, ρ(n) is a density matrix in that same Hilbert-space (a probability distribution over pure states). Inspired by the notion of quantum numbers in quantum theory (such as in Bohr's model of the atom), we then try to go beyond the partitions, by defining (via recursion) the notion of 'sub-partitions' in number theory. Combining the two notions mentioned above, sub-partitions and quantum integers, we finally provide an alternative definition of the quantum integers [the pure-state |ψ'(n)> and the mixed-state ρ'(n),] this time using the sub-partitions as the basis states instead of the partitions, for describing the quantum number that corresponds to the integer n.
Flow Formulations for Curriculum-based Course Timetabling
DEFF Research Database (Denmark)
Bagger, Niels-Christian Fink; Kristiansen, Simon; Sørensen, Matias
2017-01-01
lower bound on one data instance in the benchmark data set from the second international timetabling competition. Regarding upper bounds, the formulation based on the minimum cost flow problem performs better on average than other mixed integer programming approaches for the CTT.......In this paper we present two mixed-integer programming formulations for the Curriculum based Course Timetabling Problem (CTT). We show that the formulations contain underlying network structures by dividing the CTT into two separate models and then connect the two models using flow formulation...... techniques. The first mixed-integer programming formulation is based on an underlying minimum cost flow problem, which decreases the number of integer variables significantly and improves the performance compared to an intuitive mixed-integer programming formulation. The second formulation is based...
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.
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.
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.
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.
International Nuclear Information System (INIS)
Santos Coelho, Leandro dos
2009-01-01
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
Optimising the selection of food items for FFQs using Mixed Integer Linear Programming.
Gerdessen, Johanna C; Souverein, Olga W; van 't Veer, Pieter; de Vries, Jeanne Hm
2015-01-01
To support the selection of food items for FFQs in such a way that the amount of information on all relevant nutrients is maximised while the food list is as short as possible. Selection of the most informative food items to be included in FFQs was modelled as a Mixed Integer Linear Programming (MILP) model. The methodology was demonstrated for an FFQ with interest in energy, total protein, total fat, saturated fat, monounsaturated fat, polyunsaturated fat, total carbohydrates, mono- and disaccharides, dietary fibre and potassium. The food lists generated by the MILP model have good performance in terms of length, coverage and R 2 (explained variance) of all nutrients. MILP-generated food lists were 32-40 % shorter than a benchmark food list, whereas their quality in terms of R 2 was similar to that of the benchmark. The results suggest that the MILP model makes the selection process faster, more standardised and transparent, and is especially helpful in coping with multiple nutrients. The complexity of the method does not increase with increasing number of nutrients. The generated food lists appear either shorter or provide more information than a food list generated without the MILP model.
Construction of Fixed Rate Non-Binary WOM Codes Based on Integer Programming
Fujino, Yoju; Wadayama, Tadashi
In this paper, we propose a construction of non-binary WOM (Write-Once-Memory) codes for WOM storages such as flash memories. The WOM codes discussed in this paper are fixed rate WOM codes where messages in a fixed alphabet of size $M$ can be sequentially written in the WOM storage at least $t^*$-times. In this paper, a WOM storage is modeled by a state transition graph. The proposed construction has the following two features. First, it includes a systematic method to determine the encoding regions in the state transition graph. Second, the proposed construction includes a labeling method for states by using integer programming. Several novel WOM codes for $q$ level flash memories with 2 cells are constructed by the proposed construction. They achieve the worst numbers of writes $t^*$ that meet the known upper bound in many cases. In addition, we constructed fixed rate non-binary WOM codes with the capability to reduce ICI (inter cell interference) of flash cells. One of the advantages of the proposed construction is its flexibility. It can be applied to various storage devices, to various dimensions (i.e, number of cells), and various kind of additional constraints.
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.
WORKFORCE SIZING AND SCHEDULING FOR A SERVICE CONTRACTOR USING INTEGER PROGRAMMING
Directory of Open Access Journals (Sweden)
D.G. Conradie
2012-01-01
Full Text Available
ENGLISH ABSTRACT: Operations Research is perceived to be on the verge of demise as a decision support tool in industry. However, this is not true, since the relevancy and interdisciplinary nature of Operations Research makes it an indispensable part of operations management. What should rather be asked is how Operations Research is introduced to undergraduate industrial engineering students. This paper reports on one of the optimisation initiatives undertaken for a service contractor using integer programming as part of a semester project. Although the model addresses specific business issues related to the contractor, it can easily be generalised for other applications.
AFRIKAANSE OPSOMMING: Operasionele Navorsing word geag as ’n kwynende besluitnemingsinstrument in die nywerheid. Dit is egter onwaar, aangesien die toepaslikheid en interdissiplinêre karakter van Operasionele Navorsing dit ‘n onmisbare rol laat speel in operasionele bestuur. Die vraag wat eerder gevra moet word is hoe Operasionele Navorsing aan voorgraadse bedryfsingenieurswesestudente aangebied word. Hierdie artikel doen verslag oor een van die optimerings-inisiatiewe wat as deel van ‘n semesterprojek vir ‘n diensverskaffer uitgevoer is, en maak van heeltal-programmering gebruik. Alhoewel die model kontrakteur-spesifieke besigheidsreëls aanspreek, kan dit maklik veralgemeen word vir wyer toepassing.
A mixed-integer linear programming approach to the reduction of genome-scale metabolic networks.
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.
Integer Linear Programming for Constrained Multi-Aspect Committee Review Assignment
Karimzadehgan, Maryam; Zhai, ChengXiang
2011-01-01
Automatic review assignment can significantly improve the productivity of many people such as conference organizers, journal editors and grant administrators. A general setup of the review assignment problem involves assigning a set of reviewers on a committee to a set of documents to be reviewed under the constraint of review quota so that the reviewers assigned to a document can collectively cover multiple topic aspects of the document. No previous work has addressed such a setup of committee review assignments while also considering matching multiple aspects of topics and expertise. In this paper, we tackle the problem of committee review assignment with multi-aspect expertise matching by casting it as an integer linear programming problem. The proposed algorithm can naturally accommodate any probabilistic or deterministic method for modeling multiple aspects to automate committee review assignments. Evaluation using a multi-aspect review assignment test set constructed using ACM SIGIR publications shows that the proposed algorithm is effective and efficient for committee review assignments based on multi-aspect expertise matching. PMID:22711970
Poos, Alexandra M; Maicher, André; Dieckmann, Anna K; Oswald, Marcus; Eils, Roland; Kupiec, Martin; Luke, Brian; König, Rainer
2016-06-02
Understanding telomere length maintenance mechanisms is central in cancer biology as their dysregulation is one of the hallmarks for immortalization of cancer cells. Important for this well-balanced control is the transcriptional regulation of the telomerase genes. We integrated Mixed Integer Linear Programming models into a comparative machine learning based approach to identify regulatory interactions that best explain the discrepancy of telomerase transcript levels in yeast mutants with deleted regulators showing aberrant telomere length, when compared to mutants with normal telomere length. We uncover novel regulators of telomerase expression, several of which affect histone levels or modifications. In particular, our results point to the transcription factors Sum1, Hst1 and Srb2 as being important for the regulation of EST1 transcription, and we validated the effect of Sum1 experimentally. We compiled our machine learning method leading to a user friendly package for R which can straightforwardly be applied to similar problems integrating gene regulator binding information and expression profiles of samples of e.g. different phenotypes, diseases or treatments. © The Author(s) 2016. Published by Oxford University Press on behalf of Nucleic Acids Research.
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.
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.
Automatic Design of Synthetic Gene Circuits through Mixed Integer Non-linear Programming
Huynh, Linh; Kececioglu, John; Köppe, Matthias; Tagkopoulos, Ilias
2012-01-01
Automatic design of synthetic gene circuits poses a significant challenge to synthetic biology, primarily due to the complexity of biological systems, and the lack of rigorous optimization methods that can cope with the combinatorial explosion as the number of biological parts increases. Current optimization methods for synthetic gene design rely on heuristic algorithms that are usually not deterministic, deliver sub-optimal solutions, and provide no guaranties on convergence or error bounds. Here, we introduce an optimization framework for the problem of part selection in synthetic gene circuits that is based on mixed integer non-linear programming (MINLP), which is a deterministic method that finds the globally optimal solution and guarantees convergence in finite time. Given a synthetic gene circuit, a library of characterized parts, and user-defined constraints, our method can find the optimal selection of parts that satisfy the constraints and best approximates the objective function given by the user. We evaluated the proposed method in the design of three synthetic circuits (a toggle switch, a transcriptional cascade, and a band detector), with both experimentally constructed and synthetic promoter libraries. Scalability and robustness analysis shows that the proposed framework scales well with the library size and the solution space. The work described here is a step towards a unifying, realistic framework for the automated design of biological circuits. PMID:22536398
Improving an Integer Linear Programming Model of an Ecovat Buffer by Adding Long-Term Planning
Directory of Open Access Journals (Sweden)
Gijs J. H. de Goeijen
2017-12-01
Full Text Available The Ecovat is a seasonal thermal storage solution consisting of a large underground water tank divided into a number of virtual segments that can be individually charged and discharged. The goal of the Ecovat is to supply heat demand to a neighborhood throughout the entire year. In this work, we extend an integer linear programming model to describe the charging and discharging of such an Ecovat buffer by adding a long-term (yearly planning step to the model. We compare the results from the model using this extension to previously obtained results and show significant improvements when looking at the combination of costs and the energy content of the buffer at the end of the optimization. Furthermore, we show that the model is very robust against prediction errors. For this, we compare two different cases: one case in which we assume perfect predictions are available and one case in which we assume no predictions are available. The largest observed difference in costs between these two cases is less than 2%.
Integer 1/0 Knapsack Problem Dynamic Programming Approach in Building Maintenance Optimization
Directory of Open Access Journals (Sweden)
Viska Dewi Fawzy
2017-12-01
Full Text Available The most common problem in urban areas is the high public demand and the limited provision of housing. In meeting the needs of affordable housing for low income communities, the Government of Indonesia implements Rusunawa Project. Object of this research is Pandanarang Rusunawa. Rusunawa Pandanarang is one of the vertical housing in Cilacap that is facing deterioration issue and needs good maintenance management. This study aims at insetting priority and optimizing maintenance plan due to limited funds (limited budget and the amount of damage that must be repaired.This study uses one of the optimization methods of Dynamic Programing on the application of Integer 1/0 Knapsack Problem, to determine an schedule the maintenance activities. The Criteria that are used such as: the level of building components damage and the level of occupants participation. In the first criterion, the benefit (p is the percentage of damage that is fixed with the cost (w. While on the second criterion, the benefit (p is the percentage of occupant participation rate on the maintenance activities with the cost (w. For the budget of Rp 125.000.000, 00, it was obtained from the simulation that the value of the optimum solution on the first criterion at the 7th stage of 71.88% with total cost Rp 106.000.000, 00. At the second criterion, the value of the optimum solution at the 7th stage of 89.29% with total cost Rp 124.000.000, 00.
A multiple objective mixed integer linear programming model for power generation expansion planning
Energy Technology Data Exchange (ETDEWEB)
Antunes, C. Henggeler; Martins, A. Gomes [INESC-Coimbra, Coimbra (Portugal); Universidade de Coimbra, Dept. de Engenharia Electrotecnica, Coimbra (Portugal); Brito, Isabel Sofia [Instituto Politecnico de Beja, Escola Superior de Tecnologia e Gestao, Beja (Portugal)
2004-03-01
Power generation expansion planning inherently involves multiple, conflicting and incommensurate objectives. Therefore, mathematical models become more realistic if distinct evaluation aspects, such as cost and environmental concerns, are explicitly considered as objective functions rather than being encompassed by a single economic indicator. With the aid of multiple objective models, decision makers may grasp the conflicting nature and the trade-offs among the different objectives in order to select satisfactory compromise solutions. This paper presents a multiple objective mixed integer linear programming model for power generation expansion planning that allows the consideration of modular expansion capacity values of supply-side options. This characteristic of the model avoids the well-known problem associated with continuous capacity values that usually have to be discretized in a post-processing phase without feedback on the nature and importance of the changes in the attributes of the obtained solutions. Demand-side management (DSM) is also considered an option in the planning process, assuming there is a sufficiently large portion of the market under franchise conditions. As DSM full costs are accounted in the model, including lost revenues, it is possible to perform an evaluation of the rate impact in order to further inform the decision process (Author)
Directory of Open Access Journals (Sweden)
Chenlu Miao
2016-01-01
Full Text Available Many leader-follower relationships exist in product family design engineering problems. We use bilevel programming (BLP to reflect the leader-follower relationship and describe such problems. Product family design problems have unique characteristics; thus, mixed integer nonlinear BLP (MINLBLP, which has both continuous and discrete variables and multiple independent lower-level problems, is widely used in product family optimization. However, BLP is difficult in theory and is an NP-hard problem. Consequently, using traditional methods to solve such problems is difficult. Genetic algorithms (GAs have great value in solving BLP problems, and many studies have designed GAs to solve BLP problems; however, such GAs are typically designed for special cases that do not involve MINLBLP with one or multiple followers. Therefore, we propose a bilevel GA to solve these particular MINLBLP problems, which are widely used in product family problems. We give numerical examples to demonstrate the effectiveness of the proposed algorithm. In addition, a reducer family case study is examined to demonstrate practical applications of the proposed BLGA.
Alvarado, Michelle; Ntaimo, Lewis
2018-03-01
Oncology clinics are often burdened with scheduling large volumes of cancer patients for chemotherapy treatments under limited resources such as the number of nurses and chairs. These cancer patients require a series of appointments over several weeks or months and the timing of these appointments is critical to the treatment's effectiveness. Additionally, the appointment duration, the acuity levels of each appointment, and the availability of clinic nurses are uncertain. The timing constraints, stochastic parameters, rising treatment costs, and increased demand of outpatient oncology clinic services motivate the need for efficient appointment schedules and clinic operations. In this paper, we develop three mean-risk stochastic integer programming (SIP) models, referred to as SIP-CHEMO, for the problem of scheduling individual chemotherapy patient appointments and resources. These mean-risk models are presented and an algorithm is devised to improve computational speed. Computational results were conducted using a simulation model and results indicate that the risk-averse SIP-CHEMO model with the expected excess mean-risk measure can decrease patient waiting times and nurse overtime when compared to deterministic scheduling algorithms by 42 % and 27 %, respectively.
A bi-objective integer programming model for partly-restricted flight departure scheduling.
Zhong, Han; Guan, Wei; Zhang, Wenyi; Jiang, Shixiong; Fan, Lingling
2018-01-01
The normal studies on air traffic departure scheduling problem (DSP) mainly deal with an independent airport in which the departure traffic is not affected by surrounded airports, which, however, is not a consistent case. In reality, there still exist cases where several commercial airports are closely located and one of them possesses a higher priority. During the peak hours, the departure activities of the lower-priority airports are usually required to give way to those of higher-priority airport. These giving-way requirements can inflict a set of changes on the modeling of departure scheduling problem with respect to the lower-priority airports. To the best of our knowledge, studies on DSP under this condition are scarce. Accordingly, this paper develops a bi-objective integer programming model to address the flight departure scheduling of the partly-restricted (e.g., lower-priority) one among several adjacent airports. An adapted tabu search algorithm is designed to solve the current problem. It is demonstrated from the case study of Tianjin Binhai International Airport in China that the proposed method can obviously improve the operation efficiency, while still realizing superior equity and regularity among restricted flows.
Directory of Open Access Journals (Sweden)
Ricardo França Santos
2012-01-01
Full Text Available This work tries to solve a typical logistics problem of Navy of Brazil regards the allocation, transportation and distribution of genera refrigerated for Military Organizations within Grande Rio (RJ. After a brief review of literature on Linear/Integer Programming and some of their applications, we proposed the use of Integer Programming, using the Excel’s Solver as a tool for obtaining the optimal load configuration for the fleet, obtaining the lower distribution costs in order to meet the demand schedule. The assumptions were met in a first attempt with a single spreadsheet, but it could not find a convergent solution, without degeneration problems and with a reasonable solution time. A second solution was proposed separating the problem into three phases, which allowed us to highlight the potential and limitations of the Solver tool. This study showed the importance of formulating a realistic model and of a detailed critical analysis, which could be seen through the lack of convergence of the first solution and the success achieved by the second one.
International Nuclear Information System (INIS)
Mashayekh, Salman; Stadler, Michael; Cardoso, Gonçalo; Heleno, Miguel
2017-01-01
Highlights: • This paper presents a MILP model for optimal design of multi-energy microgrids. • Our microgrid design includes optimal technology portfolio, placement, and operation. • Our model includes microgrid electrical power flow and heat transfer equations. • The case study shows advantages of our model over aggregate single-node approaches. • The case study shows the accuracy of the integrated linearized power flow model. - Abstract: Optimal microgrid design is a challenging problem, especially for multi-energy microgrids with electricity, heating, and cooling loads as well as sources, and multiple energy carriers. To address this problem, this paper presents an optimization model formulated as a mixed-integer linear program, which determines the optimal technology portfolio, the optimal technology placement, and the associated optimal dispatch, in a microgrid with multiple energy types. The developed model uses a multi-node modeling approach (as opposed to an aggregate single-node approach) that includes electrical power flow and heat flow equations, and hence, offers the ability to perform optimal siting considering physical and operational constraints of electrical and heating/cooling networks. The new model is founded on the existing optimization model DER-CAM, a state-of-the-art decision support tool for microgrid planning and design. The results of a case study that compares single-node vs. multi-node optimal design for an example microgrid show the importance of multi-node modeling. It has been shown that single-node approaches are not only incapable of optimal DER placement, but may also result in sub-optimal DER portfolio, as well as underestimation of investment costs.
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.
Tang, Jiafu; Liu, Yang; Fung, Richard; Luo, Xinggang
2008-12-01
Manufacturers have a legal accountability to deal with industrial waste generated from their production processes in order to avoid pollution. Along with advances in waste recovery techniques, manufacturers may adopt various recycling strategies in dealing with industrial waste. With reuse strategies and technologies, byproducts or wastes will be returned to production processes in the iron and steel industry, and some waste can be recycled back to base material for reuse in other industries. This article focuses on a recovery strategies optimization problem for a typical class of industrial waste recycling process in order to maximize profit. There are multiple strategies for waste recycling available to generate multiple byproducts; these byproducts are then further transformed into several types of chemical products via different production patterns. A mixed integer programming model is developed to determine which recycling strategy and which production pattern should be selected with what quantity of chemical products corresponding to this strategy and pattern in order to yield maximum marginal profits. The sales profits of chemical products and the set-up costs of these strategies, patterns and operation costs of production are considered. A simulated annealing (SA) based heuristic algorithm is developed to solve the problem. Finally, an experiment is designed to verify the effectiveness and feasibility of the proposed method. By comparing a single strategy to multiple strategies in an example, it is shown that the total sales profit of chemical products can be increased by around 25% through the simultaneous use of multiple strategies. This illustrates the superiority of combinatorial multiple strategies. Furthermore, the effects of the model parameters on profit are discussed to help manufacturers organize their waste recycling network.
Mixed-integer programming methods for transportation and power generation problems
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.
Lemmen-Gerdessen, van J.C.; Souverein, O.W.; Veer, van 't P.; Vries, de J.H.M.
2015-01-01
Objective To support the selection of food items for FFQs in such a way that the amount of information on all relevant nutrients is maximised while the food list is as short as possible. Design Selection of the most informative food items to be included in FFQs was modelled as a Mixed Integer Linear
Planar multibody dynamics formulation, programming and applications
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
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...
Mixed integer programming model for optimizing the layout of an ICU vehicle
Directory of Open Access Journals (Sweden)
García-Sánchez Álvaro
2009-12-01
Full Text Available Abstract Background This paper presents a Mixed Integer Programming (MIP model for designing the layout of the Intensive Care Units' (ICUs patient care space. In particular, this MIP model was developed for optimizing the layout for materials to be used in interventions. This work was developed within the framework of a joint project between the Madrid Technical Unverstity and the Medical Emergency Services of the Madrid Regional Government (SUMMA 112. Methods The first task was to identify the relevant information to define the characteristics of the new vehicles and, in particular, to obtain a satisfactory interior layout to locate all the necessary materials. This information was gathered from health workers related to ICUs. With that information an optimization model was developed in order to obtain a solution. From the MIP model, a first solution was obtained, consisting of a grid to locate the different materials needed for the ICUs. The outcome from the MIP model was discussed with health workers to tune the solution, and after slightly altering that solution to meet some requirements that had not been included in the mathematical model, the eventual solution was approved by the persons responsible for specifying the characteristics of the new vehicles. According to the opinion stated by the SUMMA 112's medical group responsible for improving the ambulances (the so-called "coaching group", the outcome was highly satisfactory. Indeed, the final design served as a basis to draw up the requirements of a public tender. Results As a result from solving the Optimization model, a grid was obtained to locate the different necessary materials for the ICUs. This grid had to be slightly altered to meet some requirements that had not been included in the mathematical model. The results were discussed with the persons responsible for specifying the characteristics of the new vehicles. Conclusion The outcome was highly satisfactory. Indeed, the final
Song, Hyun-Seob; Goldberg, Noam; Mahajan, Ashutosh; Ramkrishna, Doraiswami
2017-08-01
Elementary (flux) modes (EMs) have served as a valuable tool for investigating structural and functional properties of metabolic networks. Identification of the full set of EMs in genome-scale networks remains challenging due to combinatorial explosion of EMs in complex networks. It is often, however, that only a small subset of relevant EMs needs to be known, for which optimization-based sequential computation is a useful alternative. Most of the currently available methods along this line are based on the iterative use of mixed integer linear programming (MILP), the effectiveness of which significantly deteriorates as the number of iterations builds up. To alleviate the computational burden associated with the MILP implementation, we here present a novel optimization algorithm termed alternate integer linear programming (AILP). Our algorithm was designed to iteratively solve a pair of integer programming (IP) and linear programming (LP) to compute EMs in a sequential manner. In each step, the IP identifies a minimal subset of reactions, the deletion of which disables all previously identified EMs. Thus, a subsequent LP solution subject to this reaction deletion constraint becomes a distinct EM. In cases where no feasible LP solution is available, IP-derived reaction deletion sets represent minimal cut sets (MCSs). Despite the additional computation of MCSs, AILP achieved significant time reduction in computing EMs by orders of magnitude. The proposed AILP algorithm not only offers a computational advantage in the EM analysis of genome-scale networks, but also improves the understanding of the linkage between EMs and MCSs. The software is implemented in Matlab, and is provided as supplementary information . hyunseob.song@pnnl.gov. Supplementary data are available at Bioinformatics online. Published by Oxford University Press 2017. This work is written by US Government employees and are in the public domain in the US.
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.
Directory of Open Access Journals (Sweden)
I Gede Agus Widyadana
2001-01-01
Full Text Available The decisions to choose appropriate tools for solving industrial problems are not just tools that achieve optimal solution only but it should consider computation time too. One of industrial problems that still difficult to achieve both criteria is scheduling problem. This paper discuss comparison between mixed integer programming which result optimal solution and heuristic method to solve job shop scheduling problem with separable sequence-dependent setup. The problems are generated and the result shows that the heuristic methods still cannot satisfy optimal solution.
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.
Safikhani, Zhaleh; Sadeghi, Mehdi; Pezeshk, Hamid; Eslahchi, Changiz
2013-01-01
Recent advances in the sequencing technologies have provided a handful of RNA-seq datasets for transcriptome analysis. However, reconstruction of full-length isoforms and estimation of the expression level of transcripts with a low cost are challenging tasks. We propose a novel de novo method named SSP that incorporates interval integer linear programming to resolve alternatively spliced isoforms and reconstruct the whole transcriptome from short reads. Experimental results show that SSP is fast and precise in determining different alternatively spliced isoforms along with the estimation of reconstructed transcript abundances. The SSP software package is available at http://www.bioinf.cs.ipm.ir/software/ssp. © 2013.
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.
Li, Yanning; Canepa, Edward S.; Claudel, Christian G.
2013-01-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.
Multi-task feature selection in microarray data by binary integer programming.
Lan, Liang; Vucetic, Slobodan
2013-12-20
A major challenge in microarray classification is that the number of features is typically orders of magnitude larger than the number of examples. In this paper, we propose a novel feature filter algorithm to select the feature subset with maximal discriminative power and minimal redundancy by solving a quadratic objective function with binary integer constraints. To improve the computational efficiency, the binary integer constraints are relaxed and a low-rank approximation to the quadratic term is applied. The proposed feature selection algorithm was extended to solve multi-task microarray classification problems. We compared the single-task version of the proposed feature selection algorithm with 9 existing feature selection methods on 4 benchmark microarray data sets. The empirical results show that the proposed method achieved the most accurate predictions overall. We also evaluated the multi-task version of the proposed algorithm on 8 multi-task microarray datasets. The multi-task feature selection algorithm resulted in significantly higher accuracy than when using the single-task feature selection methods.
International Nuclear Information System (INIS)
Zhang, Jianyun; Liu, Pei; Zhou, Zhe; Ma, Linwei; Li, Zheng; Ni, Weidou
2014-01-01
Highlights: • Integration of heat streams with HRSG in a polygeneration system is studied. • A mixed-integer nonlinear programming model is proposed to optimize heat network. • Operating parameters and heat network configuration are optimized simultaneously. • The optimized heat network highly depends on the HRSG type and model specification. - Abstract: A large number of heat flows at various temperature and pressure levels exist in a polygeneration plant which co-produces electricity and chemical products. Integration of these external heat flows in a heat recovery steam generator (HRSG) has great potential to further enhance energy efficiency of such a plant; however, it is a challenging problem arising from the large design space of heat exchanger network. In this paper, a mixed-integer nonlinear programming model is developed for the design optimization of a HRSG with consideration of all alternative matches between the HRSG and external heat flows. This model is applied to four polygeneration cases with different HRSG types, and results indicate that the optimized heat network mainly depends on the HRSG type and the model specification
Canepa, Edward S.; Bayen, Alexandre M.; Claudel, Christian G.
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
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.
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.
Günlük, O.; Woeginger, G.J.
2011-01-01
This volume contains the 33 papers presented at IPCO 2011, the 15th Conference on Integer Programming and Combinatorial Optimization, held during June 15–17, 2011 at the IBM T.J. Watson Research Center in New York, USA. IPCO conferences are sponsored by the Mathematical Optimization Society. The
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.
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 .
Directory of Open Access Journals (Sweden)
Akyene Tetteh
2017-04-01
Full Text Available Background: Although the Internet boosts business profitability, without certain activities like efficient transportation, scheduling, products ordered via the Internet may reach their destination very late. The environmental problems (vehicle part disposal, carbon monoxide [CO], nitrogen oxide [NOx] and hydrocarbons [HC] associated with transportation are mostly not accounted for by industries. Objectives: The main objective of this article is to minimising negative externalities cost in e-commerce environments. Method: The 0-1 mixed integer linear programming (0-1 MILP model was used to model the problem statement. The result was further analysed using the externality percentage impact factor (EPIF. Results: The simulation results suggest that (1 The mode of ordering refined petroleum products does not impact on the cost of distribution, (2 an increase in private cost is directly proportional to the externality cost, (3 externality cost is largely controlled by the government and number of vehicles used in the distribution and this is in no way influenced by the mode of request (i.e. Internet or otherwise and (4 externality cost may be reduce by using more ecofriendly fuel system.
Steps in formulating an environmental monitoring program
International Nuclear Information System (INIS)
Anon.
1991-01-01
This section describes the process of establishing a complete equipment environmental monitoring program; the step by step process is also illustrated in Table 3 of the Summary. The following decisions must be made in defining the program: an initial characterization of plant environment, how to integrate with existing programs to realize the maximum benefits, identification of the specific monitoring locations, determining the monitoring techniques, frequency of recording data, monitoring duration, quality assurance requirements, and finally, establishing the recordkeeping requirements
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.
Formulated linear programming problems from game theory and its ...
African Journals Online (AJOL)
Formulated linear programming problems from game theory and its computer implementation using Tora package. ... Game theory, a branch of operations research examines the various concepts of decision ... AJOL African Journals Online.
Cheng, Guanhui; Huang, Guohe; Dong, Cong; Xu, Ye; Chen, Jiapei; Chen, Xiujuan; Li, Kailong
2017-03-01
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
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/. © 2016 Wiley Periodicals, Inc.
Jonrinaldi, Hadiguna, Rika Ampuh; Salastino, Rades
2017-11-01
Environmental consciousness has paid many attention nowadays. It is not only about how to recycle, remanufacture or reuse used end products but it is also how to optimize the operations of the reverse system. A previous research has proposed a design of reverse supply chain of biodiesel network from used cooking oil. However, the research focused on the design of the supply chain strategy not the operations of the supply chain. It only decided how to design the structure of the supply chain in the next few years, and the process of each stage will be conducted in the supply chain system in general. The supply chain system has not considered operational policies to be conducted by the companies in the supply chain. Companies need a policy for each stage of the supply chain operations to be conducted so as to produce the optimal supply chain system, including how to use all the resources that have been designed in order to achieve the objectives of the supply chain system. Therefore, this paper proposes a model to optimize the operational planning of a biodiesel supply chain network from used cooking oil. A mixed integer linear programming is developed to model the operational planning of biodiesel supply chain in order to minimize the total operational cost of the supply chain. Based on the implementation of the model developed, the total operational cost of the biodiesel supply chain incurred by the system is less than the total operational cost of supply chain based on the previous research during seven days of operational planning about amount of 2,743,470.00 or 0.186%. Production costs contributed to 74.6 % of total operational cost and the cost of purchasing the used cooking oil contributed to 24.1 % of total operational cost. So, the system should pay more attention to these two aspects as changes in the value of these aspects will cause significant effects to the change in the total operational cost of the supply chain.
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...
International Nuclear Information System (INIS)
Wang, Xingwei; Cai, Yanpeng; Chen, Jiajun; Dai, Chao
2013-01-01
In this study, a GFIPMIP (grey-forecasting interval-parameter mixed-integer programming) approach was developed for supporting IEEM (integrated electric-environmental management) in Beijing. It was an attempt to incorporate an energy-forecasting model within a general modeling framework at the municipal level. The developed GFIPMIP model can not only forecast electric demands, but also reflect dynamic, interactive, and uncertain characteristics of the IEEM system in Beijing. Moreover, it can address issues regarding power supply, and emission reduction of atmospheric pollutants and GHG (greenhouse gas). Optimal solutions were obtained related to power generation patterns and facility capacity expansion schemes under a series of system constraints. Two scenarios were analyzed based on multiple environmental policies. The results were useful for helping decision makers identify desired management strategies to guarantee the city's power supply and mitigate emissions of GHG and atmospheric pollutants. The results also suggested that the developed GFIPMIP model be applicable to similar engineering problems. - Highlights: • A grey-forecasting interval-parameter mixed integer programming (GFIPMIP) approach was developed. • It could reflect dynamic, interactive, and uncertain characteristics of an IEEM system. • The developed GFIPMIP approach was used for supporting IEEM system planning in Beijing. • Two scenarios were established based on different environmental policies and management targets. • Optimal schemes for power generation, energy supply, and environmental protection were identified
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
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...... instance in the benchmark data set from the second international timetabling competition.......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...
2013-01-01
Background Phylogeny estimation from aligned haplotype sequences has attracted more and more attention in the recent years due to its importance in analysis of many fine-scale genetic data. Its application fields range from medical research, to drug discovery, to epidemiology, to population dynamics. The literature on molecular phylogenetics proposes a number of criteria for selecting a phylogeny from among plausible alternatives. Usually, such criteria can be expressed by means of objective functions, and the phylogenies that optimize them are referred to as optimal. One of the most important estimation criteria is the parsimony which states that the optimal phylogeny T∗for a set H of n haplotype sequences over a common set of variable loci is the one that satisfies the following requirements: (i) it has the shortest length and (ii) it is such that, for each pair of distinct haplotypes hi,hj∈H, the sum of the edge weights belonging to the path from hi to hj in T∗ is not smaller than the observed number of changes between hi and hj. Finding the most parsimonious phylogeny for H involves solving an optimization problem, called the Most Parsimonious Phylogeny Estimation Problem (MPPEP), which is NP-hard in many of its versions. Results In this article we investigate a recent version of the MPPEP that arises when input data consist of single nucleotide polymorphism haplotypes extracted from a population of individuals on a common genomic region. Specifically, we explore the prospects for improving on the implicit enumeration strategy of implicit enumeration strategy used in previous work using a novel problem formulation and a series of strengthening valid inequalities and preliminary symmetry breaking constraints to more precisely bound the solution space and accelerate implicit enumeration of possible optimal phylogenies. We present the basic formulation and then introduce a series of provable valid constraints to reduce the solution space. We then prove
Directory of Open Access Journals (Sweden)
Baofeng Cai
2017-08-01
Full Text Available The Interconnected River System Network Project (IRSNP is a significant water supply engineering project, which is capable of effectively utilizing flood resources to generate ecological value, by connecting 198 lakes and ponds in western Jilin, northeast China. In this article, an optimization research approach has been proposed to maximize the incremental value of IRSNP ecosystem services. A double-sided chance-constrained integer linear program (DCCILP method has been proposed to support the optimization, which can deal with uncertainties presented as integers or random parameters that appear on both sides of the decision variable at the same time. The optimal scheme indicates that after rational optimization, the total incremental value of ecosystem services from the interconnected river system network project increased 22.25%, providing an increase in benefits of 3.26 × 109 ¥ compared to the original scheme. Most of the functional area is swamp wetland, which provides the greatest ecological benefits. Adjustment services increased obviously, implying that the optimization scheme prioritizes ecological benefits rather than supply and production services.
Irmeilyana, Puspita, Fitri Maya; Indrawati
2016-02-01
The pricing for wireless networks is developed by considering linearity factors, elasticity price and price factors. Mixed Integer Nonlinear Programming of wireless pricing model is proposed as the nonlinear programming problem that can be solved optimally using LINGO 13.0. The solutions are expected to give some information about the connections between the acceptance factor and the price. Previous model worked on the model that focuses on bandwidth as the QoS attribute. The models attempt to maximize the total price for a connection based on QoS parameter. The QoS attributes used will be the bandwidth and the end to end delay that affect the traffic. The maximum goal to maximum price is achieved when the provider determine the requirement for the increment or decrement of price change due to QoS change and amount of QoS value.
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.
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.
Menu-Driven Solver Of Linear-Programming Problems
Viterna, L. A.; Ferencz, D.
1992-01-01
Program assists inexperienced user in formulating linear-programming problems. A Linear Program Solver (ALPS) computer program is full-featured LP analysis program. Solves plain linear-programming problems as well as more-complicated mixed-integer and pure-integer programs. Also contains efficient technique for solution of purely binary linear-programming problems. Written entirely in IBM's APL2/PC software, Version 1.01. Packed program contains licensed material, property of IBM (copyright 1988, all rights reserved).
Hard equality constrained integer knapsacks
Aardal, K.I.; Lenstra, A.K.; Cook, W.J.; Schulz, A.S.
2002-01-01
We consider the following integer feasibility problem: "Given positive integer numbers a 0, a 1,..., a n, with gcd(a 1,..., a n) = 1 and a = (a 1,..., a n), does there exist a nonnegative integer vector x satisfying ax = a 0?" Some instances of this type have been found to be extremely hard to solve
Chen, Pei-Hua
2017-05-01
This rejoinder responds to the commentary by van der Linden and Li entiled "Comment on Three-Element Item Selection Procedures for Multiple Forms Assembly: An Item Matching Approach" on the article "Three-Element Item Selection Procedures for Multiple Forms Assembly: An Item Matching Approach" by Chen. Van der Linden and Li made a strong statement calling for the cessation of test assembly heuristics development, and instead encouraged embracing mixed integer programming (MIP). This article points out the nondeterministic polynomial (NP)-hard nature of MIP problems and how solutions found using heuristics could be useful in an MIP context. Although van der Linden and Li provided several practical examples of test assembly supporting their view, the examples ignore the cases in which a slight change of constraints or item pool data might mean it would not be possible to obtain solutions as quickly as before. The article illustrates the use of heuristic solutions to improve both the performance of MIP solvers and the quality of solutions. Additional responses to the commentary by van der Linden and Li are included.
International Nuclear Information System (INIS)
Wouters, Carmen; Fraga, Eric S.; James, Adrian M.
2015-01-01
The integration of distributed generation units and microgrids in the current grid infrastructure requires an efficient and cost effective local energy system design. A mixed-integer linear programming model is presented to identify such optimal design. The electricity as well as the space heating and cooling demands of a small residential neighbourhood are satisfied through the consideration and combined use of distributed generation technologies, thermal units and energy storage with an optional interconnection with the central grid. Moreover, energy integration is allowed in the form of both optimised pipeline networks and microgrid operation. The objective is to minimise the total annualised cost of the system to meet its yearly energy demand. The model integrates the operational characteristics and constraints of the different technologies for several scenarios in a South Australian setting and is implemented in GAMS. The impact of energy integration is analysed, leading to the identification of key components for residential energy systems. Additionally, a multi-microgrid concept is introduced to allow for local clustering of households within neighbourhoods. The robustness of the model is shown through sensitivity analysis, up-scaling and an effort to address the variability of solar irradiation. - Highlights: • Distributed energy system planning is employed on a small residential scale. • Full energy integration is employed based on microgrid operation and tri-generation. • An MILP for local clustering of households in multi-microgrids is developed. • Micro combined heat and power units are key components for residential microgrids
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
Frozen density embedding with non-integer subsystems' particle numbers.
Fabiano, Eduardo; Laricchia, Savio; Della Sala, Fabio
2014-03-21
We extend the frozen density embedding theory to non-integer subsystems' particles numbers. Different features of this formulation are discussed, with special concern for approximate embedding calculations. In particular, we highlight the relation between the non-integer particle-number partition scheme and the resulting embedding errors. Finally, we provide a discussion of the implications of the present theory for the derivative discontinuity issue and the calculation of chemical reactivity descriptors.
Energy Technology Data Exchange (ETDEWEB)
Koa, A.S.; Chang, N.B. [University of Central Florida, Orlando, FL (United States). Dept. for Civil & Environmental Engineering
2008-07-15
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{sub 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 case 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.
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.
Nazri, Engku Muhammad; Yusof, Nur Ai'Syah; Ahmad, Norazura; Shariffuddin, Mohd Dino Khairri; Khan, Shazida Jan Mohd
2017-11-01
Prioritizing and making decisions on what student activities to be selected and conducted to fulfill the aspiration of a university as translated in its strategic plan must be executed with transparency and accountability. It is becoming even more crucial, particularly for universities in Malaysia with the recent budget cut imposed by the Malaysian government. In this paper, we illustrated how 0-1 integer programming (0-1 IP) model was implemented to select which activities among the forty activities proposed by the student body of Universiti Utara Malaysia (UUM) to be implemented for the 2017/2018 academic year. Two different models were constructed. The first model was developed to determine the minimum total budget that should be given to the student body by the UUM management to conduct all the activities that can fulfill the minimum targeted number of activities as stated in its strategic plan. On the other hand, the second model was developed to determine which activities to be selected based on the total budget already allocated beforehand by the UUM management towards fulfilling the requirements as set in its strategic plan. The selection of activities for the second model, was also based on the preference of the members of the student body whereby the preference value for each activity was determined using Compromised-Analytical Hierarchy Process. The outputs from both models were compared and discussed. The technique used in this study will be useful and suitable to be implemented by organizations with key performance indicator-oriented programs and having limited budget allocation issues.
Micosoft Excel Sensitivity Analysis for Linear and Stochastic Program Feed Formulation
Sensitivity analysis is a part of mathematical programming solutions and is used in making nutritional and economic decisions for a given feed formulation problem. The terms, shadow price and reduced cost, are familiar linear program (LP) terms to feed formulators. Because of the nonlinear nature of...
Simultaneously Exploiting Two Formulations: an Exact Benders Decomposition Approach
DEFF Research Database (Denmark)
Lusby, Richard Martin; Gamst, Mette; Spoorendonk, Simon
When modelling a given problem using linear programming techniques several possibilities often exist, and each results in a different mathematical formulation of the problem. Usually, advantages and disadvantages can be identified in any single formulation. In this paper we consider mixed integer...... to the standard branch-and-price approach from the literature, the method shows promising performance and appears to be an attractive alternative....
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.
Computer Corner: Spreadsheets, Power Series, Generating Functions, and Integers.
Snow, Donald R.
1989-01-01
Implements a table algorithm on a spreadsheet program and obtains functions for several number sequences such as the Fibonacci and Catalan numbers. Considers other applications of the table algorithm to integers represented in various number bases. (YP)
Mixed integer evolution strategies for parameter optimization.
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.
International Nuclear Information System (INIS)
Frahm, K M; Shepelyansky, D L; Chepelianskii, A D
2012-01-01
We 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 approximately 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 us to find this vector for matrices of billion size. This network provides a new PageRank order of integers. (paper)
Study on Formulating Policy and Strategies for IAEA TC Program
International Nuclear Information System (INIS)
Min, B. J.; Lee, M. K.; Shin, J. Y.
2010-10-01
The objectives of this study is to provide recommendations for formulating adequate policy and strategies for IAEA-TC programme as being of a donor Member State and to guide directions to facing the challenges of changing the status from IAEA-TC recipient to donor country. In addition, this study gives recommendations and feedbacks to the IAEA-TC programmer: how it has contributed to nation's nuclear technology development in the past on one hand and how the country has contributed to it on the other. Besides, this study also conducted to identify the following impacts expected: termination of on-going National TC projects, discontinuation of TC-based technical advices, sponsored fellowship and scientific visits for capacity building opportunities, and limitation in participations of various regional projects due to termination of IAEA financial support. In terms of financial aspect, this study has also performed to assess the nation's annual financial contribution (Technical Cooperation (TC) Fund: 1,67 million dollars in 2008) by comparing the experiences of other OECD countries cases. In conclusion, it is expected that the results of this study will contribute to develop appropriate measures in order to maximize the benefits for future national nuclear technology development and in addition, to explore the possibilities to extend the nuclear technology export market potentials
Formulating Employability Skills for Graduates of Public Health Study Program
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.…
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.
Landman, Bruce M
2003-01-01
Ramsey theory is the study of the structure of mathematical objects that is preserved under partitions. In its full generality, Ramsey theory is quite powerful, but can quickly become complicated. By limiting the focus of this book to Ramsey theory applied to the set of integers, the authors have produced a gentle, but meaningful, introduction to an important and enticing branch of modern mathematics. Ramsey Theory on the Integers offers students something quite rare for a book at this level: a glimpse into the world of mathematical research and the opportunity to begin pondering unsolved problems themselves. In addition to being the first truly accessible book on Ramsey theory, this innovative book also provides the first cohesive study of Ramsey theory on the integers. It contains perhaps the most substantial account of solved and unsolved problems in this blossoming subarea of Ramsey theory. The result is a breakthrough book that will engage students, teachers, and researchers alike.
Integer-valued trawl processes
DEFF Research Database (Denmark)
Barndorff-Nielsen, Ole E.; Lunde, Asger; Shephard, Neil
2014-01-01
the probabilistic properties of such processes in detail and, in addition, study volatility modulation and multivariate extensions within the new modelling framework. Moreover, we describe how the parameters of a trawl process can be estimated and obtain promising estimation results in our simulation study. Finally......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...
Linear programming: an alternative approach for developing formulations for emergency food products.
Sheibani, Ershad; Dabbagh Moghaddam, Arasb; Sharifan, Anousheh; Afshari, Zahra
2018-03-01
To minimize the mortality rates of individuals affected by disasters, providing high-quality food relief during the initial stages of an emergency is crucial. The goal of this study was to develop a formulation for a high-energy, nutrient-dense prototype using linear programming (LP) model as a novel method for developing formulations for food products. The model consisted of the objective function and the decision variables, which were the formulation costs and weights of the selected commodities, respectively. The LP constraints were the Institute of Medicine and the World Health Organization specifications of the content of nutrients in the product. Other constraints related to the product's sensory properties were also introduced to the model. Nonlinear constraints for energy ratios of nutrients were linearized to allow their use in the LP. Three focus group studies were conducted to evaluate the palatability and other aspects of the optimized formulation. New constraints were introduced to the LP model based on the focus group evaluations to improve the formulation. LP is an appropriate tool for designing formulations of food products to meet a set of nutritional requirements. This method is an excellent alternative to the traditional 'trial and error' method in designing formulations. © 2017 Society of Chemical Industry. © 2017 Society of Chemical Industry.
van den Akker, R.
2007-01-01
This thesis adresses statistical problems in econometrics. The first part contributes statistical methodology for nonnegative integer-valued time series. The second part of this thesis discusses semiparametric estimation in copula models and develops semiparametric lower bounds for a large class of
Rewrite systems for integer arithmetic
H.R. Walters (Pum); H. Zantema (Hans)
1995-01-01
textabstractWe present three term rewrite systems for integer arithmetic with addition, multiplication, and, in two cases, subtraction. All systems are ground confluent and terminating; termination is proved by semantic labelling and recursive path order. The first system represents numbers by
Rewrite systems for integer arithmetic
Walters, H.R.; Zantema, H.
1994-01-01
We present three term rewrite systems for integer arithmetic with addition, multiplication, and, in two cases, subtraction. All systems are ground con uent and terminating; termination is proved by semantic labelling and recursive path order. The first system represents numbers by successor and
A few Smarandache Integer Sequences
Ibstedt, Henry
2010-01-01
This paper deals with the analysis of a few Smarandache Integer Sequences which first appeared in Properties or the Numbers, F. Smarandache, University or Craiova Archives, 1975. The first four sequences are recurrence generated sequences while the last three are concatenation sequences.
Searching for optimal integer solutions to set partitioning problems using column generation
Bredström, David; Jörnsten, Kurt; Rönnqvist, Mikael
2007-01-01
We describe a new approach to produce integer feasible columns to a set partitioning problem directly in solving the linear programming (LP) relaxation using column generation. Traditionally, column generation is aimed to solve the LP relaxation as quick as possible without any concern of the integer properties of the columns formed. In our approach we aim to generate the columns forming the optimal integer solution while simultaneously solving the LP relaxation. By this we can re...
Landman, Bruce M
2014-01-01
Ramsey theory is the study of the structure of mathematical objects that is preserved under partitions. In its full generality, Ramsey theory is quite powerful, but can quickly become complicated. By limiting the focus of this book to Ramsey theory applied to the set of integers, the authors have produced a gentle, but meaningful, introduction to an important and enticing branch of modern mathematics. Ramsey Theory on the Integers offers students a glimpse into the world of mathematical research and the opportunity for them to begin pondering unsolved problems. For this new edition, several sections have been added and others have been significantly updated. Among the newly introduced topics are: rainbow Ramsey theory, an "inequality" version of Schur's theorem, monochromatic solutions of recurrence relations, Ramsey results involving both sums and products, monochromatic sets avoiding certain differences, Ramsey properties for polynomial progressions, generalizations of the Erdős-Ginzberg-Ziv theorem, and t...
DEFF Research Database (Denmark)
Quaglia, Alberto; Sarup, Bent; Sin, Gürkan
2013-01-01
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......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...... problems, while ensuring at the same time data consistency and quality at the application stage....
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...
Nutrient density score of typical Indonesian foods and dietary formulation using linear programming.
Jati, Ignasius Radix A P; Vadivel, Vellingiri; Nöhr, Donatus; Biesalski, Hans Konrad
2012-12-01
The present research aimed to analyse the nutrient density (ND), nutrient adequacy score (NAS) and energy density (ED) of Indonesian foods and to formulate a balanced diet using linear programming. Data on typical Indonesian diets were obtained from the Indonesian Socio-Economic Survey 2008. ND was investigated for 122 Indonesian foods. NAS was calculated for single nutrients such as Fe, Zn and vitamin A. Correlation analysis was performed between ND and ED, as well as between monthly expenditure class and food consumption pattern in Indonesia. Linear programming calculations were performed using the software POM-QM for Windows version 3. Republic of Indonesia, 2008. Public households (n 68 800). Vegetables had the highest ND of the food groups, followed by animal-based foods, fruits and staple foods. Based on NAS, the top ten food items for each food group were identified. Most of the staple foods had high ED and contributed towards daily energy fulfillment, followed by animal-based foods, vegetables and fruits. Commodities with high ND tended to have low ED. Linear programming could be used to formulate a balanced diet. In contrast to staple foods, purchases of fruit, vegetables and animal-based foods increased with the rise of monthly expenditure. People should select food items based on ND and NAS to alleviate micronutrient deficiencies in Indonesia. Dietary formulation calculated using linear programming to achieve RDA levels for micronutrients could be recommended for different age groups of the Indonesian population.
Ferencz, Donald C.; Viterna, Larry A.
1991-01-01
ALPS is a computer program which can be used to solve general linear program (optimization) problems. ALPS was designed for those who have minimal linear programming (LP) knowledge and features a menu-driven scheme to guide the user through the process of creating and solving LP formulations. Once created, the problems can be edited and stored in standard DOS ASCII files to provide portability to various word processors or even other linear programming packages. Unlike many math-oriented LP solvers, ALPS contains an LP parser that reads through the LP formulation and reports several types of errors to the user. ALPS provides a large amount of solution data which is often useful in problem solving. In addition to pure linear programs, ALPS can solve for integer, mixed integer, and binary type problems. Pure linear programs are solved with the revised simplex method. Integer or mixed integer programs are solved initially with the revised simplex, and the completed using the branch-and-bound technique. Binary programs are solved with the method of implicit enumeration. This manual describes how to use ALPS to create, edit, and solve linear programming problems. Instructions for installing ALPS on a PC compatible computer are included in the appendices along with a general introduction to linear programming. A programmers guide is also included for assistance in modifying and maintaining the program.
International Nuclear Information System (INIS)
Sukiman Sarmani
2002-01-01
Though Malaysia has no nuclear power station, but the management of its low level radioactive waste generated from industrial activities involves most of the same issues that must be considered in countries with nuclear power. These include public consultation at all stages, an open approach, high level scientific and engineering input and political decision by the Government. A carefully planned approach, which involves the public and gives time to build trust and confidence, is necessary for success. It is also pertinent to establish accurate and reliable data on environmental radiation to accurately assess possible risk. This is where a national monitoring program on environmental radiation is very important. While accurate data will help formulate sound policy on radioactive waste management, it should also be readily available to the public to gain support and acceptance. This paper presents arguments on the importance of a national monitoring program for environmental radiation as an input for formulating a policy on radioactive waste management in Malaysia. (Author)
Solving the Water Jugs Problem by an Integer Sequence Approach
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…
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
Mixed-integer representations in control design mathematical foundations and applications
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...
International Nuclear Information System (INIS)
Esmaeily, Ali; Ahmadi, Abdollah; Raeisi, Fatima; Ahmadi, Mohammad Reza; Esmaeel Nezhad, Ali; Janghorbani, Mohammadreza
2017-01-01
A new optimization framework based on MILP model is introduced in the paper for the problem of stochastic self-scheduling of hydrothermal units known as HTSS Problem implemented in a joint energy and reserve electricity market with day-ahead mechanism. The proposed MILP framework includes some practical constraints such as the cost due to valve-loading effect, the limit due to DRR and also multi-POZs, which have been less investigated in electricity market models. For the sake of more accuracy, for hydro generating units’ model, multi performance curves are also used. The problem proposed in this paper is formulated using a model on the basis of a stochastic optimization technique while the objective function is maximizing the expected profit utilizing MILP technique. The suggested stochastic self-scheduling model employs the price forecast error in order to take into account the uncertainty due to price. Besides, LMCS is combined with roulette wheel mechanism so that the scenarios corresponding to the non-spinning reserve price and spinning reserve price as well as the energy price at each hour of the scheduling are generated. Finally, the IEEE 118-bus power system is used to indicate the performance and the efficiency of the suggested technique. - Highlights: • Characterizing the uncertainties of price and FOR of units. • Replacing the fixed ramping rate constraints with the dynamic ones. • Proposing linearized model for the valve-point effects of thermal units. • Taking into consideration the multi-POZs relating to the thermal units. • Taking into consideration the multi-performance curves of hydroelectric units.
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.
Energy Technology Data Exchange (ETDEWEB)
Dufour, F., E-mail: dufour@math.u-bordeaux1.fr [Institut de Mathématiques de Bordeaux, INRIA Bordeaux Sud Ouest, Team: CQFD, and IMB (France); Prieto-Rumeau, T., E-mail: tprieto@ccia.uned.es [UNED, Department of Statistics and Operations Research (Spain)
2016-08-15
We consider a discrete-time constrained discounted Markov decision process (MDP) with Borel state and action spaces, compact action sets, and lower semi-continuous cost functions. We introduce a set of hypotheses related to a positive weight function which allow us to consider cost functions that might not be bounded below by a constant, and which imply the solvability of the linear programming formulation of the constrained MDP. In particular, we establish the existence of a constrained optimal stationary policy. Our results are illustrated with an application to a fishery management problem.
Vector calculus in non-integer dimensional space and its applications to fractal media
Tarasov, Vasily E.
2015-02-01
We suggest a generalization of vector calculus for the case of non-integer dimensional space. The first and second orders operations such as gradient, divergence, the scalar and vector Laplace operators for non-integer dimensional space are defined. For simplification we consider scalar and vector fields that are independent of angles. We formulate a generalization of vector calculus for rotationally covariant scalar and vector functions. This generalization allows us to describe fractal media and materials in the framework of continuum models with non-integer dimensional space. As examples of application of the suggested calculus, we consider elasticity of fractal materials (fractal hollow ball and fractal cylindrical pipe with pressure inside and outside), steady distribution of heat in fractal media, electric field of fractal charged cylinder. We solve the correspondent equations for non-integer dimensional space models.
DEFF Research Database (Denmark)
Hovgaard, Tobias Gybel; Larsen, Lars F. S.; Jørgensen, John Bagterp
2012-01-01
We consider the optimization of power set-points to a large number of wind turbines arranged within close vicinity of each other in a wind farm. The goal is to maximize the total electric power extracted from the wind, taking the wake effects that couple the individual turbines in the farm into a...... 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....
Quasi-greedy systems of integer translates
DEFF Research Database (Denmark)
Nielsen, Morten; Sikic, Hrvoje
We consider quasi-greedy systems of integer translates in a finitely generated shift invariant subspace of L2(Rd), that is systems for which the thresholding approximation procedure is well behaved. We prove that every quasi-greedy system of integer translates is also a Riesz basis for its closed...
Quasi-greedy systems of integer translates
DEFF Research Database (Denmark)
Nielsen, Morten; Sikic, Hrvoje
2008-01-01
We consider quasi-greedy systems of integer translates in a finitely generated shift-invariant subspace of L2(Rd), that is systems for which the thresholding approximation procedure is well behaved. We prove that every quasi-greedy system of integer translates is also a Riesz basis for its closed...
Positive integer solutions of certain diophantine equations
Indian Academy of Sciences (India)
BIJAN KUMAR PATEL
2018-03-19
Mar 19, 2018 ... integer solutions. They also found all the positive integer solutions of the given equations in terms of Fibonacci and Lucas numbers. Another interesting number sequence which is closely related to the sequence of. Fibonacci numbers is the sequence of balancing numbers. In 1999, Behera et al. [1] intro-.
Analysis misconception of integers in microteaching activities
Setyawati, R. D.; Indiati, I.
2018-05-01
This study view to analyse student misconceptions on integers in microteaching activities. This research used qualitative research design. An integers test contained questions from eight main areas of integers. The Integers material test includes (a) converting the image into fractions, (b) examples of positive numbers including rational numbers, (c) operations in fractions, (d) sorting fractions from the largest to the smallest, and vice versa; e) equate denominator, (f) concept of ratio mark, (g) definition of fraction, and (h) difference between fractions and parts. The results indicated an integers concepts: (1) the students have not been able to define concepts well based on the classification of facts in organized part; (2) The correlational concept: students have not been able to combine interrelated events in the form of general principles; and (3) theoretical concepts: students have not been able to use concepts that facilitate in learning the facts or events in an organized system.
International Nuclear Information System (INIS)
Attaviriyanupap, Pathom; Kita, Hiroyuki; Tanaka, Eiichi; Hasegawa, Jun
2005-01-01
In this paper, a new bidding strategy for a day-ahead market is formulated. The proposed algorithm is developed from the viewpoint of a generation company wishing to maximize a profit as a participant in the deregulated power and reserve markets. Separate power and reserve markets are considered, both are operated by clearing price auction system. The optimal bidding parameters for both markets are determined by solving an optimization problem that takes unit commitment constraints such as generating limits and unit minimum up/down time constraints into account. This is a non-convex and non-differentiable which is difficult to solve by traditional optimization techniques. In this paper, evolutionary programming is used to solve the problem. The algorithm is applied to both single-sided and double-sided auctions, numerical simulations are carried out to demonstrate the performance of the proposed scheme compared with those obtained from a sequential quadratic programming. (author)
Quality evaluation of millet-soy blended extrudates formulated through linear programming.
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.
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
Learning decision trees with flexible constraints and objectives using integer optimization
Verwer, S.; Zhang, Y.
2017-01-01
We encode the problem of learning the optimal decision tree of a given depth as an integer optimization problem. We show experimentally that our method (DTIP) can be used to learn good trees up to depth 5 from data sets of size up to 1000. In addition to being efficient, our new formulation allows
Discovering workflow nets using integer linear programming
van Zelst, S.J.; van Dongen, B.F.; van der Aalst, W.M.P.; Verbeek, H.M.W.
Process mining is concerned with the analysis, understanding and improvement of business processes. Process discovery, i.e. discovering a process model based on an event log, is considered the most challenging process mining task. State-of-the-art process discovery algorithms only discover local
AN INTEGER PROGRAMMING MODEL FOR HIERARCHICAL WORKFORCE
Directory of Open Access Journals (Sweden)
BANU SUNGUR
2013-06-01
Full Text Available The model presented in this paper is based on the model developed by Billionnet for the hierarchical workforce problem. In Billionnet’s Model, while determining the workers’ weekly costs, weekly working hours of workers are not taken into consideration. In our model, the weekly costs per worker are reduced in proportion to the working hours per week. Our model is illustrated on the Billionnet’s Example. The models in question are compared and evaluated on the basis of the results obtained from the example problem. A reduction is achieved in the total cost by the proposed model.
RSM 1.0 - A RESUPPLY SCHEDULER USING INTEGER OPTIMIZATION
Viterna, L. A.
1994-01-01
RSM, Resupply Scheduling Modeler, is a fully menu-driven program that uses integer programming techniques to determine an optimum schedule for replacing components on or before the end of a fixed replacement period. Although written to analyze the electrical power system on the Space Station Freedom, RSM is quite general and can be used to model the resupply of almost any system subject to user-defined resource constraints. RSM is based on a specific form of the general linear programming problem in which all variables in the objective function and all variables in the constraints are integers. While more computationally intensive, integer programming was required for accuracy when modeling systems with small quantities of components. Input values for component life cane be real numbers, RSM converts them to integers by dividing the lifetime by the period duration, then reducing the result to the next lowest integer. For each component, there is a set of constraints that insure that it is replaced before its lifetime expires. RSM includes user-defined constraints such as transportation mass and volume limits, as well as component life, available repair crew time and assembly sequences. A weighting factor allows the program to minimize factors such as cost. The program then performs an iterative analysis, which is displayed during the processing. A message gives the first period in which resources are being exceeded on each iteration. If the scheduling problem is unfeasible, the final message will also indicate the first period in which resources were exceeded. RSM is written in APL2 for IBM PC series computers and compatibles. A stand-alone executable version of RSM is provided; however, this is a "packed" version of RSM which can only utilize the memory within the 640K DOS limit. This executable requires at least 640K of memory and DOS 3.1 or higher. Source code for an APL2/PC workspace version is also provided. This version of RSM can make full use of any
Parallel Integer Factorization Using Quadratic Forms
National Research Council Canada - National Science Library
McMath, Stephen S
2005-01-01
Factorization is important for both practical and theoretical reasons. In secure digital communication, security of the commonly used RSA public key cryptosystem depends on the difficulty of factoring large integers...
COMPUTING VERTICES OF INTEGER PARTITION POLYTOPES
Directory of Open Access Journals (Sweden)
A. S. Vroublevski
2015-01-01
Full Text Available The paper describes a method of generating vertices of the polytopes of integer partitions that was used by the authors to calculate all vertices and support vertices of the partition polytopes for all n ≤ 105 and all knapsack partitions of n ≤ 165. The method avoids generating all partitions of n. The vertices are determined with the help of sufficient and necessary conditions; in the hard cases, the well-known program Polymake is used. Some computational aspects are exposed in more detail. These are the algorithm for checking the criterion that characterizes partitions that are convex combinations of two other partitions; the way of using two combinatorial operations that transform the known vertices to the new ones; and employing the Polymake to recognize a limited number (for small n of partitions that need three or more other partitions for being convexly expressed. We discuss the computational results on the numbers of vertices and support vertices of the partition polytopes and some appealing problems these results give rise to.
Mortgage Loan Portfolio Optimization Using Multi-Stage Stochastic Programming
DEFF Research Database (Denmark)
Rasmussen, Kourosh Marjani; Clausen, Jens
2007-01-01
We consider the dynamics of the Danish mortgage loan system and propose several models to reflect the choices of a mortgagor as well as his attitude towards risk. The models are formulated as multi stage stochastic integer programs, which are difficult to solve for more than 10 stages. Scenario...
Directory of Open Access Journals (Sweden)
Reyes Zotelo, Yunuem
2017-12-01
Full Text Available En este trabajo se propone un modelo de programación lineal entera para planificar la producción de un conjunto de artículos finales con demanda independiente. El modelo para la planificación maestra de producción (PMP está diseñado considerando los costes de producción e inventario, así como las restricciones definidas por el mismo proceso productivo en cuanto a instalaciones y tiempos de producción. El objetivo del modelo propuesto es la minimización de los costes implicados; concretamente, el tiempo ocioso y extra de los recursos, así como la consideración de un nivel mínimo de servicio ligado a la demanda diferida. La validación del modelo considera datos pertenecientes a la demanda de cada producto en un horizonte de 12 semanas y compara cinco escenarios en los que se modifican algunos aspectos del sistema y diferentes niveles de servicio. Por último, los resultados obtenidos para cada uno de los escenarios exponen la mejora obtenida por el modelo propuesto respecto al procedimiento actual en la empresa objeto de estudio. || In this work, we propose an integer linear programming model for production scheduling of a group of finished products with independent demand. The model for the master production scheduling (MPS is designed by considering production and inventory costs, as well as the productive process constraints regarding installations and production times. The aim of the proposed model is the minimization of the costs involved; specifically, undertime and overtime costs of resources, as well as the consideration of a minimum service level related to the deferred demand. The validation of the model considers data belonging to the demand of each product in a 12-week planning horizon and compares five scenarios in which some characteristics of the system and different service levels are modified. Finally, the results obtained for each one of the scenarios expose the improvement obtained by the proposed model with
Slip and Slide Method of Factoring Trinomials with Integer Coefficients over the Integers
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…
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.
Directory of Open Access Journals (Sweden)
Alexander Mitsos
Full Text Available 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.
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...
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.
Barmpalexis, Panagiotis; Grypioti, Agni; Eleftheriadis, Georgios K; Fatouros, Dimitris G
2018-02-01
In the present study, liquisolid formulations were developed for improving dissolution profile of aprepitant (APT) in a solid dosage form. Experimental studies were complemented with artificial neural networks and genetic programming. Specifically, the type and concentration of liquid vehicle was evaluated through saturation-solubility studies, while the effect of the amount of viscosity increasing agent (HPMC), the type of wetting (Soluplus® vs. PVP) and solubilizing (Poloxamer®407 vs. Kolliphor®ELP) agents, and the ratio of solid coating (microcrystalline cellulose) to carrier (colloidal silicon dioxide) were evaluated based on in vitro drug release studies. The optimum liquisolid formulation exhibited improved dissolution characteristics compared to the marketed product Emend®. X-ray diffraction (XRD), scanning electron microscopy (SEM) and a novel method combining particle size analysis by dynamic light scattering (DLS) and HPLC, revealed that the increase in dissolution rate of APT in the optimum liquisolid formulation was due to the formation of stable APT nanocrystals. Differential scanning calorimetry (DSC) and attenuated total reflection FTIR spectroscopy (ATR-FTIR) revealed the presence of intermolecular interactions between APT and liquisolid formulation excipients. Multilinear regression analysis (MLR), artificial neural networks (ANNs), and genetic programming (GP) were used to correlate several formulation variables with dissolution profile parameters (Y 15min and Y 30min ) using a full factorial experimental design. Results showed increased correlation efficacy for ANNs and GP (RMSE of 0.151 and 0.273, respectively) compared to MLR (RMSE = 0.413).
A statistical mechanical approach to restricted integer partition functions
Zhou, Chi-Chun; Dai, Wu-Sheng
2018-05-01
The main aim of this paper is twofold: (1) suggesting a statistical mechanical approach to the calculation of the generating function of restricted integer partition functions which count the number of partitions—a way of writing an integer as a sum of other integers under certain restrictions. In this approach, the generating function of restricted integer partition functions is constructed from the canonical partition functions of various quantum gases. (2) Introducing a new type of restricted integer partition functions corresponding to general statistics which is a generalization of Gentile statistics in statistical mechanics; many kinds of restricted integer partition functions are special cases of this restricted integer partition function. Moreover, with statistical mechanics as a bridge, we reveal a mathematical fact: the generating function of restricted integer partition function is just the symmetric function which is a class of functions being invariant under the action of permutation groups. Using this approach, we provide some expressions of restricted integer partition functions as examples.
Symmetry Breaking in MILP Formulations for Unit Commitment Problems
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.
Symmetry Breaking in MILP Formulations for Unit Commitment Problems
Lima, Ricardo; Novais, Augusto Q.
2015-01-01
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.
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...
A quantum architecture for multiplying signed integers
International Nuclear Information System (INIS)
Alvarez-Sanchez, J J; Alvarez-Bravo, J V; Nieto, L M
2008-01-01
A new quantum architecture for multiplying signed integers is presented based on Booth's algorithm, which is well known in classical computation. It is shown how a quantum binary chain might be encoded by its flank changes, giving the final product in 2's-complement representation.
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....
Ryan, Kelsey N; Adams, Katherine P; Vosti, Stephen A; Ordiz, M Isabel; Cimo, Elizabeth D; Manary, Mark J
2014-12-01
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 international and national crop and animal food databases was used to create a global and local candidate ingredient database. The database included information about each ingredient regarding nutrient composition, ingredient category, regional availability, and food safety, processing, and price. An LP tool was then designed to compose novel RUTF formulations. For the example case of Ethiopia, the objective was to minimize the ingredient cost of RUTF; the decision variables were ingredient weights and the extent of use of locally available ingredients, and the constraints were nutritional and product-quality related. Of the new RUTF formulations found by the LP tool for Ethiopia, 32 were predicted to be feasible for creating a paste, and these were prepared in the laboratory. Palatable final formulations contained a variety of ingredients, including fish, different dairy powders, and various seeds, grains, and legumes. Nearly all of the macronutrient values calculated by the LP tool differed by <10% from results produced by laboratory analyses, but the LP tool consistently underestimated total energy. The LP tool can be used to develop new RUTF formulations that make more use of locally available ingredients. This tool has the potential to lead to production of a variety of low-cost RUTF formulations that meet international standards and thereby potentially allow more children to be treated for SAM. © 2014 American Society for Nutrition.
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.
What Else Is Decidable about Integer Arrays?
Habermehl, Peter; Iosif, Radu; Vojnar, Tomáš
2008-01-01
International audience; We introduce a new decidable logic for reasoning about infinite arrays of integers. The logic is in the ∃ * ∀ * first-order fragment and allows (1) Presburger constraints on existentially quantified variables, (2) difference constraints as well as periodicity constraints on universally quantified indices, and (3) difference constraints on values. In particular, using our logic, one can express constraints on consecutive elements of arrays (e.g. ∀i. 0 ≤ i < n → a[i + 1]...
Fractional and integer charges from Levinson's theorem
International Nuclear Information System (INIS)
Farhi, E.; Graham, N.; Jaffe, R.L.; Weigel, H.
2001-01-01
We compute fractional and integer fermion quantum numbers of static background field configurations using phase shifts and Levinson's theorem. By extending fermionic scattering theory to arbitrary dimensions, we implement dimensional regularization in a (1+1)-dimensional gauge theory. We demonstrate that this regularization procedure automatically eliminates the anomaly in the vector current that a naive regulator would produce. We also apply these techniques to bag models in one and three dimensions
Integer factoring and modular square roots
Czech Academy of Sciences Publication Activity Database
Jeřábek, Emil
2016-01-01
Roč. 82, č. 2 (2016), s. 380-394 ISSN 0022-0000 R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061 Institutional support: RVO:67985840 Keywords : integer factoring * quadratic residue * PPA Subject RIV: BA - General Mathematics Impact factor: 1.678, year: 2016 http://www.sciencedirect.com/science/article/pii/S0022000015000768
On the price of integer charge quarks
International Nuclear Information System (INIS)
Okun, L.B.; Voloshin, M.B.; Zakharov, V.I.
1979-01-01
Implication of the integer charge quark (ICQ) model with a broken SU(3)xU(1) gauge symmetry for interactions in the leptonic sector were discussed. In this model there should be very large deviations of e + e - →μ + μ - annihilation processes in the GeV region from the standard QED behaviour. Such deviations seem to be completely excluded by existing data. Therefore it is concluded that the ICQ model is ruled out
Quadratic Sieve integer factorization using Hadoop
Ghebregiorgish, Semere Tsehaye
2012-01-01
Master's thesis in Computer Science Integer factorization problem is one of the most important parts in the world of cryptography. The security of the widely-used public-key cryptographic algorithm, RSA [1], and the Blum Blum Shub cryptographic pseudorandom number generator [2] heavily depend on the presumed difficulty of factoring a number to its prime constituents. As the size of the number to be factored gets larger, the difficulty of the problem increases enormously. Thi...
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
On the convex hull of the simple integer recourse objective function
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 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.
Fleming, P.
1985-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 non-linear 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.
Integer Set Compression and Statistical Modeling
DEFF Research Database (Denmark)
Larsson, N. Jesper
2014-01-01
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......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...
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.
S-parts of terms of integer linear recurrence sequences
Bugeaud, Y.; Evertse, J.H.
2017-01-01
Let S = {q1 , . . . , qs } be a finite, non-empty set of distinct prime numbers. For a non-zero integer m, write m = q1^ r1 . . . qs^rs M, where r1 , . . . , rs are non-negative integers and M is an integer relatively prime to q1 . . . qs. We define the S-part [m]_S of m by [m]_S := q1^r1 . . .
Extension of the Poincaré group with half-integer spin generators: hypergravity and beyond
Energy Technology Data Exchange (ETDEWEB)
Fuentealba, Oscar [Centro de Estudios Científicos (CECs), Av. Arturo Prat 514, Valdivia (Chile); Departamento de Física, Universidad de Concepción, Casilla 160-C, Concepción (Chile); Matulich, Javier; Troncoso, Ricardo [Centro de Estudios Científicos (CECs), Av. Arturo Prat 514, Valdivia (Chile)
2015-09-01
An extension of the Poincaré group with half-integer spin generators is explicitly constructed. We start discussing the case of three spacetime dimensions, and as an application, it is shown that hypergravity can be formulated so as to incorporate this structure as its local gauge symmetry. Since the algebra admits a nontrivial Casimir operator, the theory can be described in terms of gauge fields associated to the extension of the Poincaré group with a Chern-Simons action. The algebra is also shown to admit an infinite-dimensional non-linear extension, that in the case of fermionic spin-3/2 generators, corresponds to a subset of a contraction of two copies of WB{sub 2}. Finally, we show how the Poincaré group can be extended with half-integer spin generators for d≥3 dimensions.
Joint shape segmentation with linear programming
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.
DEFF Research Database (Denmark)
Cetin, Bilge Kartal; Prasad, Neeli R.; Prasad, Ramjee
2011-01-01
In wireless sensor networks, one of the key challenge is to achieve minimum energy consumption in order to maximize network lifetime. In fact, lifetime depends on many parameters: the topology of the sensor network, the data aggregation regime in the network, the channel access schemes, the routing...... 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...
On Secure Two-Party Integer Division
DEFF Research Database (Denmark)
Dahl, Morten; Ning, Chao; Toft, Tomas
2012-01-01
{\\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......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......)$ 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....
Extraction and characterization of artocarpus integer gum as pharmaceutical excipient.
Farooq, Uzma; Malviya, Rishabha; Sharma, Pramod Kumar
2014-01-01
Natural polymers are widely used as excipients in pharmaceutical formulations. They are easily available, cheap and less toxic as compared to synthetic polymers. This study involves the extraction and characterization of kathal (Artocarpus integer) gum as a pharmaceutical excipient. Water was used as a solvent for extraction of the natural polymer. Yield was calculated with an aim to evaluate the efficacy of the process. The product was screened for the presence of Micrometric properties, and swelling index, flow behavior, surface tension, and viscosity of natural polymers were calculated. Using a water based extraction method, the yield of gum was found to be 2.85%. Various parameters such as flow behavior, organoleptic properties, surface tension, viscosity, loss on drying, ash value and swelling index together with microscopic studies of particles were done to characterize the extracted gum. The result showed that extracted kathal gum exhibited excellent flow properties. The gum was investigated for purity by carrying out chemical tests for different phytochemical constituents and only carbohydrates were found to be present. It had a good swelling index (13 ± 1). The pH and surface tension of the 1% gum solution were found to be 6 ± 0.5 and 0.0627 J/m2, respectively. The ash values such as total ash, acid insoluble ash, and water soluble ash were found to be 18.9%, 0.67% and 4% respectively. Loss on drying was 6.61%. The extracted gum was soluble in warm water and insoluble in organic solvents. The scanning electron micrograph (SEM) revealed rough and irregular particles of the isolated polymer. The results of the evaluated properties showed that kathal-derived gum has acceptable pH and organoleptic properties and can be used as a pharmaceutical excipient to formulate solid oral dosage forms.
Binary Positive Semidefinite Matrices and Associated Integer Polytopes
DEFF Research Database (Denmark)
Letchford, Adam N.; Sørensen, Michael Malmros
2012-01-01
We consider the positive semidefinite (psd) matrices with binary entries, along with the corresponding integer polytopes. We begin by establishing some basic properties of these matrices and polytopes. Then, we show that several families of integer polytopes in the literature-the cut, boolean qua...
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...
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-01-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.
Directory of Open Access Journals (Sweden)
Nursalam
2014-01-01
Full Text Available The research aims to determine how the social design of policy formulation in recovery after disasters and social conflicts. The method used in the study is a qualitative research design, data collection techniques through documentation and interviews with key informants. The recovery of the public life after reconstruction due to natural disasters and social conflicts demanding greater government attention to solve bersoalan arising through the formulation of programs oriented to local values. The importance of such a policy given that the public is the target to be met interests, and basically in their social life with values that serve as a guide in achieving a common goal. The Formulations recovery program based value is essentially a process of public policy formulation design also is social design process that relies on the dimension; (1 a value appreciation of relevant actors; (2 an orientation toward conflict resolution, problem solving, and change. The first dimension concerns an administrator's to listen to other voices, share in others experiences, and gain new knowledge. The second describes the administrator's orientation toward conflict resolution, problem solving, and change; the administrator's actions can range from proactive to reactive. Research indicates that, the experience of local government in the province of East Nusa Tenggara post-disaster and conflict should be a lesson for having successfully implemented local values-based formulation design in formulating regional development programs.
A General Approach for Orthogonal 4-Tap Integer Multiwavelet Transforms
Directory of Open Access Journals (Sweden)
Mingli Jing
2010-01-01
Full Text Available An algorithm for orthogonal 4-tap integer multiwavelet transforms is proposed. We compute the singular value decomposition (SVD of block recursive matrices of transform matrix, and then transform matrix can be rewritten in a product of two block diagonal matrices and a permutation matrix. Furthermore, we factorize the block matrix of block diagonal matrices into triangular elementary reversible matrices (TERMs, which map integers to integers by rounding arithmetic. The cost of factorizing block matrix into TERMs does not increase with the increase of the dimension of transform matrix, and the proposed algorithm is in-place calculation and without allocating auxiliary memory. Examples of integer multiwavelet transform using DGHM and CL are given, which verify that the proposed algorithm is an executable algorithm and outperforms the existing algorithm for orthogonal 4-tap integer multiwavelet transform.
DEFF Research Database (Denmark)
Quaglia, Alberto; Gargalo, Carina L.; Chairakwongsa, Siwanat
2015-01-01
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......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...... 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...
Harmonic oscillator states with integer and non-integer orbital angular momentum
International Nuclear Information System (INIS)
Land, Martin
2011-01-01
We study the quantum mechanical harmonic oscillator in two and three dimensions, with particular attention to the solutions as basis states for representing their respective symmetry groups — O(2), O(1,1), O(3), and O(2,1). The goal of this study is to establish a correspondence between Hilbert space descriptions found by solving the Schrodinger equation in polar coordinates, and Fock space descriptions constructed by expressing the symmetry operators in terms of creation/annihilation operators. We obtain wavefunctions characterized by a principal quantum number, the group Casimir eigenvalue, and one group generator whose eigenvalue is m + s, for integer m and real constant parameter s. For the three groups that contain O(2), the solutions split into two inequivalent representations, one associated with s = 0, from which we recover the familiar description of the oscillator as a product of one-dimensional solutions, and the other with s > 0 (in three dimensions, solutions are found for s = 0 and s = 1/2) whose solutions are non-separable in Cartesian coordinates, and are hence overlooked by the standard Fock space approach. The O(1,1) solutions are singlet states, restricted to zero eigenvalue of the symmetry operator, which represents the boost, not angular momentum. For O(2), a single set of creation and annihilation operators forms a ladder representation for the allowed oscillator states for any s, and the degeneracy of energy states is always finite. However, in three dimensions, the integer and half-integer eigenstates are qualitatively different: the former can be expressed as finite dimensional irreducible tensors under O(3) or O(2,1) while the latter exhibit infinite degeneracy. Creation operators that produce the allowed integer states by acting on the non-degenerate ground state are constructed as irreducible tensor products of the fundamental vector representation. However, the half-integer eigenstates are infinite-dimensional, as expected for the non
De Carvalho, Irene Stuart Torrié; Granfeldt, Yvonne; Dejmek, Petr; Håkansson, Andreas
2015-03-01
Linear programming has been used extensively as a tool for nutritional recommendations. Extending the methodology to food formulation presents new challenges, since not all combinations of nutritious ingredients will produce an acceptable food. Furthermore, it would help in implementation and in ensuring the feasibility of the suggested recommendations. To extend the previously used linear programming methodology from diet optimization to food formulation using consistency constraints. In addition, to exemplify usability using the case of a porridge mix formulation for emergency situations in rural Mozambique. The linear programming method was extended with a consistency constraint based on previously published empirical studies on swelling of starch in soft porridges. The new method was exemplified using the formulation of a nutritious, minimum-cost porridge mix for children aged 1 to 2 years for use as a complete relief food, based primarily on local ingredients, in rural Mozambique. A nutritious porridge fulfilling the consistency constraints was found; however, the minimum cost was unfeasible with local ingredients only. This illustrates the challenges in formulating nutritious yet economically feasible foods from local ingredients. The high cost was caused by the high cost of mineral-rich foods. A nutritious, low-cost porridge that fulfills the consistency constraints was obtained by including supplements of zinc and calcium salts as ingredients. The optimizations were successful in fulfilling all constraints and provided a feasible porridge, showing that the extended constrained linear programming methodology provides a systematic tool for designing nutritious foods.
International Nuclear Information System (INIS)
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
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.
Diversity and non-integer differentiation for system dynamics
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
Fractal electrodynamics via non-integer dimensional space approach
Tarasov, Vasily E.
2015-09-01
Using the recently suggested vector calculus for non-integer dimensional space, we consider electrodynamics problems in isotropic case. This calculus allows us to describe fractal media in the framework of continuum models with non-integer dimensional space. We consider electric and magnetic fields of fractal media with charges and currents in the framework of continuum models with non-integer dimensional spaces. An application of the fractal Gauss's law, the fractal Ampere's circuital law, the fractal Poisson equation for electric potential, and equation for fractal stream of charges are suggested. Lorentz invariance and speed of light in fractal electrodynamics are discussed. An expression for effective refractive index of non-integer dimensional space is suggested.
Fockedey, N.
2005-01-01
The present chapter aims to be a literature review on the brackish water mysid Neomysis integer, with focus on its feeding ecology, life history aspects, behaviour, physiology, biochemical composition, bioenergetics and ecotoxico10gy. All records on the species, available from literature, are listed as an appendix. The review aims to identify the state-of-the-art and the gaps in our knowledge on the species. Abundant information is available on the distribution patterns of Neomysis integer in...
Integers without large prime factors in short intervals: Conditional ...
Indian Academy of Sciences (India)
α > 0 the interval (X, X +. √. X(log X)1/2+o(1)] contains an integer having no prime factor exceeding Xα for all X sufficiently large. Keywords. Smooth numbers; Riemann zeta function. 1. Introduction. Suppose P (n) denotes the largest prime factor of an integer n > 1 and let us declare. P(1) = 1. Given a positive real number y, ...
Mixed-integer nonlinear approach for the optimal scheduling of a head-dependent hydro chain
Energy Technology Data Exchange (ETDEWEB)
Catalao, J.P.S.; Pousinho, H.M.I. [Department of Electromechanical Engineering, University of Beira Interior, R. Fonte do Lameiro, 6201-001 Covilha (Portugal); Mendes, V.M.F. [Department of Electrical Engineering and Automation, Instituto Superior de Engenharia de Lisboa, R. Conselheiro Emidio Navarro, 1950-062 Lisbon (Portugal)
2010-08-15
This paper is on the problem of short-term hydro scheduling (STHS), particularly concerning a head-dependent hydro chain. We propose a novel mixed-integer nonlinear programming (MINLP) approach, considering hydroelectric power generation as a nonlinear function of water discharge and of the head. As a new contribution to earlier studies, we model the on-off behavior of the hydro plants using integer variables, in order to avoid water discharges at forbidden areas. Thus, an enhanced STHS is provided due to the more realistic modeling presented in this paper. Our approach has been applied successfully to solve a test case based on one of the Portuguese cascaded hydro systems with a negligible computational time requirement. (author)
A new continuous-time formulation for scheduling crude oil operations
International Nuclear Information System (INIS)
Reddy, P. Chandra Prakash; Karimi, I.A.; Srinivasan, R.
2004-01-01
In today's competitive business climate characterized by uncertain oil markets, responding effectively and speedily to market forces, while maintaining reliable operations, is crucial to a refinery's bottom line. Optimal crude oil scheduling enables cost reduction by using cheaper crudes intelligently, minimizing crude changeovers, and avoiding ship demurrage. So far, only discrete-time formulations have stood up to the challenge of this important, nonlinear problem. A continuous-time formulation would portend numerous advantages, however, existing work in this area has just begun to scratch the surface. In this paper, we present the first complete continuous-time mixed integer linear programming (MILP) formulation for the short-term scheduling of operations in a refinery that receives crude from very large crude carriers via a high-volume single buoy mooring pipeline. This novel formulation accounts for real-world operational practices. We use an iterative algorithm to eliminate the crude composition discrepancy that has proven to be the Achilles heel for existing formulations. While it does not guarantee global optimality, the algorithm needs only MILP solutions and obtains excellent maximum-profit schedules for industrial problems with up to 7 days of scheduling horizon. We also report the first comparison of discrete- vs. continuous-time formulations for this complex problem. (Author)
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.
Spreading Sequences Generated Using Asymmetrical Integer-Number Maps
Directory of Open Access Journals (Sweden)
V. Sebesta
2007-09-01
Full Text Available Chaotic sequences produced by piecewise linear maps can be transformed to binary sequences. The binary sequences are optimal for the asynchronous DS/CDMA systems in case of certain shapes of the maps. This paper is devoted to the one-to-one integer-number maps derived from the suitable asymmetrical piecewise linear maps. Such maps give periodic integer-number sequences, which can be transformed to the binary sequences. The binary sequences produced via proposed modified integer-number maps are perfectly balanced and embody good autocorrelation and crosscorrelation properties. The number of different binary sequences is sizable. The sequences are suitable as spreading sequences in DS/CDMA systems.
Directory of Open Access Journals (Sweden)
Syaifudin Noor
2018-01-01
Full Text Available This paper analyses financial feasibility and cost-benefit and formulates the relevant subsidy program that is currently implemented by the government. We find that providing interest subsidy is financially feasible only if it serves to substitute the consumption of diesel. The benefits are higher than the costs among three types (45 t, 60 t and 75 t of the palm waste generator capacity. The paper also reveals that Credit Program is relevant with the objective, to provide interest subsidy to farmers, but certain adaptations are required.
ALPS - A LINEAR PROGRAM SOLVER
Viterna, L. A.
1994-01-01
Linear programming is a widely-used engineering and management tool. Scheduling, resource allocation, and production planning are all well-known applications of linear programs (LP's). Most LP's are too large to be solved by hand, so over the decades many computer codes for solving LP's have been developed. ALPS, A Linear Program Solver, is a full-featured LP analysis program. ALPS can solve plain linear programs as well as more complicated mixed integer and pure integer programs. ALPS also contains an efficient solution technique for pure binary (0-1 integer) programs. One of the many weaknesses of LP solvers is the lack of interaction with the user. ALPS is a menu-driven program with no special commands or keywords to learn. In addition, ALPS contains a full-screen editor to enter and maintain the LP formulation. These formulations can be written to and read from plain ASCII files for portability. For those less experienced in LP formulation, ALPS contains a problem "parser" which checks the formulation for errors. ALPS creates fully formatted, readable reports that can be sent to a printer or output file. ALPS is written entirely in IBM's APL2/PC product, Version 1.01. The APL2 workspace containing all the ALPS code can be run on any APL2/PC system (AT or 386). On a 32-bit system, this configuration can take advantage of all extended memory. The user can also examine and modify the ALPS code. The APL2 workspace has also been "packed" to be run on any DOS system (without APL2) as a stand-alone "EXE" file, but has limited memory capacity on a 640K system. A numeric coprocessor (80X87) is optional but recommended. The standard distribution medium for ALPS is a 5.25 inch 360K MS-DOS format diskette. IBM, IBM PC and IBM APL2 are registered trademarks of International Business Machines Corporation. MS-DOS is a registered trademark of Microsoft Corporation.
Stochastic Dynamic Mixed-Integer Programming (SD-MIP)
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...Sampling and Convergence) In current sampling-based methods motivated by Benders’ decomposition the essential role of sampling is to reduce the number of...Kleywegt, A, Shapiro, A, and Homem- de -Mello, T, (2002) SIAM Journal on Optimization archive, vol. 12Journal SIAM Journal on Optimization archive
Optimizing Marine Corps Personnel Assignments Using an Integer Programming Model
2012-12-01
Corps. vi THIS PAGE INTENTIONALLY LEFT BLANK vii TABLE OF CONTENTS I. INTRODUCTION ...throughout our careers. xvi THIS PAGE INTENTIONALLY LEFT BLANK 1 I. INTRODUCTION The Marine Corps Manpower and Reserve Affairs (M&RA) office has the...2012 BAH Rates-with Dependents. Defense Travel Mangement Office. (2011, December). 2012 BAH Rates-without Dependents. M ileage C ost 1 Per D iem
Integer goal programming approach for finding a compromise ...
African Journals Online (AJOL)
user
However, making the above assumptions can have a big influence on the determination of the optimal maintenance policy. The maintenance action duration and the cost are important factors to take into account in the maintenance optimization process because practically the maintained component is not always restored ...
Fitting boxes to Manhattan scenes using linear integer programming
Li, Minglei; Nan, Liangliang; Liu, Shaochuang
2016-01-01
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
Stochastic integer programming for multi-disciplinary outpatient clinic planning
Leeftink, A. G.; Vliegen, I. M.H.; Hans, E. W.
2017-01-01
Scheduling appointments in a multi-disciplinary clinic is complex, since coordination between disciplines is required. The design of a blueprint schedule for a multi-disciplinary clinic with open access requirements requires an integrated optimization approach, in which all appointment schedules are
Integer goal programming approach for finding a compromise ...
African Journals Online (AJOL)
user
The maintenance action duration and the cost are important factors to take ... The selective maintenance operation is an optimal decision-making activity for systems consisting of ... Indeed, system deterioration is often reflected in higher production cost, time, lower product quality and also quantity. ...... Biographical notes.
A Multi-Stage Integer Programming Approach to Fantasy Team ...
African Journals Online (AJOL)
Team selection is a controversial topic, even more so when a team performs poorly. Many sport fans believe they can perform the selection process better than those tasked with the responsibility. With the developments of fantasy sport games, fans now have a platform to test their claims, albeit in a purely recreational ...
STUDY OF SOLUTION REPRESENTATION LANGUAGE INFLUENCE ON EFFICIENCY OF INTEGER SEQUENCES PREDICTION
Directory of Open Access Journals (Sweden)
A. S. Potapov
2015-01-01
Full Text Available Methods based on genetic programming for the problem solution of integer sequences extrapolation are the subjects for study in the paper. In order to check the hypothesis about the influence of language expression of program representation on the prediction effectiveness, the genetic programming method based on several limited languages for recurrent sequences has been developed. On the single sequence sample the implemented method with the use of more complete language has shown results, significantly better than the results of one of the current methods represented in literature based on artificial neural networks. Analysis of experimental comparison results for the realized method with the usage of different languages has shown that language extension increases the difficulty of consistent patterns search in languages, available for prediction in a simpler language though it makes new sequence classes accessible for prediction. This effect can be reduced but not eliminated completely at language extension by the constructions, which make solutions more compact. Carried out researches have drawn to the conclusion that alone the choice of an adequate language for solution representation is not enough for the full problem solution of integer sequences prediction (and, all the more, universal prediction problem. However, practically applied methods can be received by the usage of genetic programming.
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......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...
Modeling an integrated hospital management planning problem using integer optimization approach
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.
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)
Triangular Numbers, Gaussian Integers, and KenKen
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…
Rigorous solution to Bargmann-Wigner equation for integer spin
Huang Shi Zhong; Wu Ning; Zheng Zhi Peng
2002-01-01
A rigorous method is developed to solve the Bargamann-Wigner equation for arbitrary integer spin in coordinate representation in a step by step way. The Bargmann-Wigner equation is first transformed to a form easier to solve, the new equations are then solved rigorously in coordinate representation, and the wave functions in a closed form are thus derived
Selecting Tools to Model Integer and Binomial Multiplication
Pratt, Sarah Smitherman; Eddy, Colleen M.
2017-01-01
Mathematics teachers frequently provide concrete manipulatives to students during instruction; however, the rationale for using certain manipulatives in conjunction with concepts may not be explored. This article focuses on area models that are currently used in classrooms to provide concrete examples of integer and binomial multiplication. The…
Integers without Large Prime Factors in Short Intervals: Conditional ...
Indian Academy of Sciences (India)
... Public Lectures · Lecture Workshops · Refresher Courses · Symposia · Live Streaming. Home; Journals; Proceedings – Mathematical Sciences; Volume 120; Issue 5. Integers without Large Prime Factors in Short Intervals: Conditional Results. Goutam Pal Satadal Ganguly. Volume 120 Issue 5 November 2010 pp 515-524 ...
Sheaves in Elementary Mathematics: The case of positive integer numbers
Luna-Torres, Joaquin
2015-01-01
We aim to use the concept of sheaf to establish a link between certain aspects of the set of positive integers numbers, a topic corresponding to the elementary mathematics, and some fundamental ideas of contemporary mathematics. We hope that this type of approach helps the school students to restate some problems of elementary mathematics in an environment deeper and suitable for its study.
A new algorithm for benchmarking in integer data envelopment analysis
Directory of Open Access Journals (Sweden)
M. M. Omran
2012-08-01
Full Text Available The aim of this study is to investigate the effect of integer data in data envelopment analysis (DEA. The inputs and outputs in different types of DEA are considered to be continuous. In most application-oriented problems, some or all data are integers; and subsequently, the continuous condition of the values is omitted. For example, situations in which the inputs/outputs are representatives of the number of cars, people, etc. In fact, the benchmark unit is artificial and does not contain integer inputs/outputs after projection on the efficiency frontier. By rounding off the projection point, we may lose the feasibility or end up having inefficient DMU. In such cases, it is required to provide a benchmark unit such that the considered unit reaches the efficiency. In the present short communication, by proposing a novel algorithm, the projecting of an inefficient DMU is carried out in such a way that produced benchmarking takes values with fully integer inputs/outputs.
Note on Integer-Valued Bilinear Time Series Models
Drost, F.C.; van den Akker, R.; Werker, B.J.M.
2007-01-01
Summary. This note reconsiders the nonnegative integer-valued bilinear processes introduced by Doukhan, Latour, and Oraichi (2006). Using a hidden Markov argument, we extend their result of the existence of a stationary solution for the INBL(1,0,1,1) process to the class of superdiagonal INBL(p; q;
6th Conference on Non-integer Order Calculus and Its Applications
Ł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...
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.
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.
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
Bishop, Jessica Pierson; Lamb, Lisa L.; Philipp, Randolph A.; Whitacre, Ian; Schappelle, Bonnie P.; Lewis, Melinda L.
2014-01-01
We identify and document 3 cognitive obstacles, 3 cognitive affordances, and 1 type of integer understanding that can function as either an obstacle or affordance for learners while they extend their numeric domains from whole numbers to include negative integers. In particular, we highlight 2 key subsets of integer reasoning: understanding or…
A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations
Silva, Marcel K. de Carli; Tunçel, Levent
2018-01-01
Total dual integrality is a powerful and unifying concept in polyhedral combinatorics and integer programming that enables the refinement of geometric min-max relations given by linear programming Strong Duality into combinatorial min-max theorems. The definition of total dual integrality (TDI) revolves around the existence of optimal dual solutions that are integral, and thus naturally applies to a host of combinatorial optimization problems that are cast as integer programs whose LP relaxat...
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.
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.
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.
Applications exponential approximation by integer shifts of Gaussian functions
Directory of Open Access Journals (Sweden)
S. M. Sitnik
2013-01-01
Full Text Available In this paper we consider approximations of functions using integer shifts of Gaussians – quadratic exponentials. A method is proposed to find coefficients of node functions by solving linear systems of equations. The explicit formula for the determinant of the system is found, based on it solvability of linear system under consideration is proved and uniqueness of its solution. We compare results with known ones and briefly indicate applications to signal theory.
Polynomial selection in number field sieve for integer factorization
Directory of Open Access Journals (Sweden)
Gireesh Pandey
2016-09-01
Full Text Available The general number field sieve (GNFS is the fastest algorithm for factoring large composite integers which is made up by two prime numbers. Polynomial selection is an important step of GNFS. The asymptotic runtime depends on choice of good polynomial pairs. In this paper, we present polynomial selection algorithm that will be modelled with size and root properties. The correlations between polynomial coefficient and number of relations have been explored with experimental findings.
Multiplicity of summands in the random partitions of an integer
Indian Academy of Sciences (India)
We prove that the probability that there is a summand of multiplicity j in any randomly chosen partition or composition of an integer n goes to zero asymptotically with n provided j 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 ...
Population transfer HMQC for half-integer quadrupolar nuclei
International Nuclear Information System (INIS)
Wang, Qiang; Xu, Jun; Feng, Ningdong; Deng, Feng; Li, Yixuan; Trébosc, Julien; Lafon, Olivier; Hu, Bingwen; Chen, Qun; Amoureux, Jean-Paul
2015-01-01
This work presents a detailed analysis of a recently proposed nuclear magnetic resonance method [Wang et al., Chem. Commun. 49(59), 6653-6655 (2013)] for accelerating heteronuclear coherence transfers involving half-integer spin quadrupolar nuclei by manipulating their satellite transitions. This method, called Population Transfer Heteronuclear Multiple Quantum Correlation (PT-HMQC), is investigated in details by combining theoretical analyses, numerical simulations, and experimental investigations. We find that compared to instant inversion or instant saturation, continuous saturation is the most practical strategy to accelerate coherence transfers on half-integer quadrupolar nuclei. We further demonstrate that this strategy is efficient to enhance the sensitivity of J-mediated heteronuclear correlation experiments between two half-integer quadrupolar isotopes (e.g., 27 Al- 17 O). In this case, the build-up is strongly affected by relaxation for small T 2 ′ and J coupling values, and shortening the mixing time makes a huge signal enhancement. Moreover, this concept of population transfer can also be applied to dipolar-mediated HMQC experiments. Indeed, on the AlPO 4 -14 sample, one still observes experimentally a 2-fold shortening of the optimum mixing time albeit with no significant signal gain in the 31 P-( 27 Al) experiments
Winding numbers in homotopy theory from integers to reals
International Nuclear Information System (INIS)
Mekhfi, M.
1993-07-01
In Homotopy Theory (HT) we define paths on a given topological space. Closed paths prove to be construction elements of a group (the fundamental group) Π 1 and carry charges, the winding numbers. The charges are integers as they indicate how many times closed paths encircle a given hole (or set of holes). Open paths as they are defined in (HT) do not possess any groups structure and as such they are less useful in topology. In the present paper we enlarge the concept of a path in such a way that both types of paths do possess a group structure. In this broad sense we have two fundamental groups the Π i = Z group and the SO(2) group of rotations but the latter has the global property that there is no periodicity in the rotation angle. There is also two charge operators W and W λ whose eigenvalues are either integers or reals depending respectively on the paths being closed or open. Also the SO(2) group and the real charge operator W λ are not independently defined but directly related respectively to the Π i group and to the integer charge operator W. Thus well defined links can be established between seemingly different groups and charges. (author). 3 refs, 1 fig
Pinning mode of integer quantum Hall Wigner crystal of skyrmions
Zhu, Han; Sambandamurthy, G.; Chen, Y. P.; Jiang, P.-H.; Engel, L. W.; Tsui, D. C.; Pfeiffer, L. N.; West, K. W.
2009-03-01
Just away from integer Landau level (LL) filling factors ν, the dilute quasi-particles/holes at the partially filled LL form an integer-quantum-Hall Wigner crystal, which exhibits microwave pinning mode resonances [1]. Due to electron-electron interaction, it was predicted that the elementary excitation around ν= 1 is not a single spin flip, but a larger-scale spin texture, known as a skyrmion [2]. We have compared the pinning mode resonances [1] of integer quantum Hall Wigner crystals formed in the partly filled LL just away from ν= 1 and ν= 2, in the presence of an in-plane magnetic field. As an in-plane field is applied, the peak frequencies of the resonances near ν= 1 increase, while the peak frequencies below ν= 2 show neligible dependence on in-plane field. We interpret this observation as due to a skyrmion crystal phase around ν= 1 and a single-hole Wigner crystal phase below ν= 2. The in-plane field increases the Zeeman gap and causes shrinking of the skyrmion size toward single spin flips. [1] Yong P. Chen et al., Phys. Rev. Lett. 91, 016801 (2003). [2] S. L. Sondhi et al., Phys. Rev. B 47, 16 419 (1993); L. Brey et al., Phys. Rev. Lett. 75, 2562 (1995).
Skau, Jutta K H; Bunthang, Touch; Chamnan, Chhoun; Wieringa, Frank T; Dijkhuizen, Marjoleine A; Roos, Nanna; Ferguson, Elaine L
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. This study discusses the use of Optifood for predicting whether formulated complementary food (CF) products can ensure dietary adequacy for target populations in Cambodia. Dietary data were collected by 24-h recall in a cross-sectional survey of 6- to 11-mo-old infants (n = 78). LP model parameters were derived from these data, including a list of foods, median serving sizes, and dietary patterns. Five series of LP analyses were carried out to model the target population's baseline diet and 4 formulated CF products [WinFood (WF), WinFood-Lite (WF-L), Corn-Soy-Blend Plus (CSB+), and Corn-Soy-Blend Plus Plus (CSB++)], which were added to the diet in portions of 33 g/d dry weight (DW) for infants aged 6-8 mo and 40 g/d DW for infants aged 9-11 mo. In each series of analyses, the nutritionally optimal diet and theoretical range, in diet nutrient contents, were determined. The LP analysis showed that baseline diets could not achieve the Recommended Nutrient Intake (RNI) for thiamin, riboflavin, niacin, folate, vitamin B-12, calcium, iron, and zinc (range: 14-91% of RNI in the optimal diets) and that none of the formulated CF products could cover the nutrient gaps for thiamin, niacin, iron, and folate (range: 22-86% of the RNI). Iron was the key limiting nutrient, for all modeled diets, achieving a maximum of only 48% of the RNI when CSB++ was included in the diet. Only WF and WF-L filled the nutrient gap for calcium. WF-L, CSB+, and CSB++ filled the nutrient gap for zinc (9- to 11-mo-olds). The formulated CF products improved the nutrient adequacy of complementary feeding diets but could not entirely cover the nutrient gaps. These results emphasize the value of using LP to evaluate special CF products during the intervention planning phase. The WF study was registered at controlled-trials.com as ISRCTN19918531.
Integer Flows and Circuit Covers of Graphs and Signed Graphs
Cheng, Jian
The work in Chapter 2 is motivated by Tutte and Jaeger's pioneering work on converting modulo flows into integer-valued flows for ordinary graphs. For a signed graphs (G, sigma), we first prove that for each k ∈ {2, 3}, if (G, sigma) is (k - 1)-edge-connected and contains an even number of negative edges when k = 2, then every modulo k-flow of (G, sigma) can be converted into an integer-valued ( k + 1)-ow with a larger or the same support. We also prove that if (G, sigma) is odd-(2p+1)-edge-connected, then (G, sigma) admits a modulo circular (2 + 1/ p)-flows if and only if it admits an integer-valued circular (2 + 1/p)-flows, which improves all previous result by Xu and Zhang (DM2005), Schubert and Steffen (EJC2015), and Zhu (JCTB2015). Shortest circuit cover conjecture is one of the major open problems in graph theory. It states that every bridgeless graph G contains a set of circuits F such that each edge is contained in at least one member of F and the length of F is at most 7/5∥E(G)∥. This concept was recently generalized to signed graphs by Macajova et al. (JGT2015). In Chapter 3, we improve their upper bound from 11∥E( G)∥ to 14/3 ∥E(G)∥, and if G is 2-edgeconnected and has even negativeness, then it can be further reduced to 11/3 ∥E(G)∥. Tutte's 3-flow conjecture has been studied by many graph theorists in the last several decades. As a new approach to this conjecture, DeVos and Thomassen considered the vectors as ow values and found that there is a close relation between vector S1-flows and integer 3-NZFs. Motivated by their observation, in Chapter 4, we prove that if a graph G admits a vector S1-flow with rank at most two, then G admits an integer 3-NZF. The concept of even factors is highly related to the famous Four Color Theorem. We conclude this dissertation in Chapter 5 with an improvement of a recent result by Chen and Fan (JCTB2016) on the upperbound of even factors. We show that if a graph G contains an even factor, then it
INTEG INSPEC, Accident Frequencies and Safety Analysis for Nuclear Power Plant
International Nuclear Information System (INIS)
Arnett, L.M.
1976-01-01
1 - Description of problem or function: These programs analyze the characteristics of a general model developed to represent the safety aspects of an operating nuclear reactor. These characteristics are the frequencies of incidents that are departures from the expected behavior of the reactor. Each incident is assumed to be preceded by a sequence of events starting at some initiating event. At each member in this sequence there may be functions such as safety circuits, and personnel operations that stop the sequence at that member. When mechanical devices fail they are assumed to remain inoperative until repaired. The model accounts for scheduled inspection and maintenance of all equipment in the system. 2 - Method of solution: In INTEG, the discontinuous density function is integrated by the trapezoidal rule from time equals zero to time equals t. INSPEC is based on the simulation of reactor operation as a Markov process. A vector of probabilities is successively multiplied by a transition matrix. 3 - Restrictions on the complexity of the problem: INSPEC is limited to subsystems with no more than 7 safety circuits. The transition matrix can be made up as desired so that any intercorrelations between failures of circuits can be accommodated. In INTEG, failure rates of safety circuits are restricted to independence
Complex dynamics of the integer quantum Hall effect
International Nuclear Information System (INIS)
Trugman, S.A.; Nicopoulos, V.N.; Florida Univ., Gainesville, FL
1991-01-01
We investigate both classical and quantum potential scattering in two dimensions in a magnetic field, with applications to the integer quantum Hall effect. Classical scattering is complex, due in one case to the approach of scattering states to an infinite number of bound states. We show that bound states are generic, and occur for all but extremely smooth scattering potentials (|rvec ∇| → 0). Quantum scattering follows the classical behavior rather closely, exhibiting sharp resonances rather than classical bound states. Extended scatterers provide an explanation for the breakdown of the QHE at a comparatively small Hall voltage. 16 refs., 14 figs
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.
Integer channels in nonuniform non-equilibrium 2D systems
Shikin, V.
2018-01-01
We discuss the non-equilibrium properties of integer channels in nonuniform 2D electron (hole) systems in the presence of a strong magnetic field. The results are applied to a qualitative explanation of the Corbino disk current-voltage characteristics (IVC) in the quantum Hall effect (QHE) regime. Special consideration is paid to the so-called "QHE breakdown" effect, which is readily observed in both the Hall bar and Corbino geometries of the tested cells. The QHE breakdown is especially evident in the Corbino samples, allowing for a more in-depth study of these effects.
A new Tevatron Collider working point near the integer
International Nuclear Information System (INIS)
Johnson, R.P.; Zhang, P.
1989-12-01
It is well established that in hadron colliders the beam-beam interaction is more harmful in the presence of machine resonances of the form mν x + nν y = p, where |m| + |n| is the order of the resonance. Since the closest a resonance line can be to the integer stopband is 1/order, the closer the working point is to the integer, the fewer lower order resonances there are to enhance the beam-beam effects. A shift of the working point of the Tevatron from 19.4 to values near 19 and 20 has been studied. Problems with closed orbit control, dispersion matching, and matched low β insertions were considered. An excellent solution for the B0 insertion was found which has an improved β*. A new injection optics allows a transition to the low β optics which is much easier than the one now used. Results from the first machine studies demonstrate the ability to control the orbit with tunes of 19.03 horizontal and 20.03 vertical. Further studies require the activation of additional quadrupole compensation circuits. 4 refs. , 2 figs
Direct comparison of fractional and integer quantized Hall resistance
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.
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....
Non-integer viscoelastic constitutive law to model soft biological tissues to in-vivo indentation.
Demirci, Nagehan; Tönük, Ergin
2014-01-01
During the last decades, derivatives and integrals of non-integer orders are being more commonly used for the description of constitutive behavior of various viscoelastic materials including soft biological tissues. Compared to integer order constitutive relations, non-integer order viscoelastic material models of soft biological tissues are capable of capturing a wider range of viscoelastic behavior obtained from experiments. Although integer order models may yield comparably accurate results, non-integer order material models have less number of parameters to be identified in addition to description of an intermediate material that can monotonically and continuously be adjusted in between an ideal elastic solid and an ideal viscous fluid. In this work, starting with some preliminaries on non-integer (fractional) calculus, the "spring-pot", (intermediate mechanical element between a solid and a fluid), non-integer order three element (Zener) solid model, finally a user-defined large strain non-integer order viscoelastic constitutive model was constructed to be used in finite element simulations. Using the constitutive equation developed, by utilizing inverse finite element method and in vivo indentation experiments, soft tissue material identification was performed. The results indicate that material coefficients obtained from relaxation experiments, when optimized with creep experimental data could simulate relaxation, creep and cyclic loading and unloading experiments accurately. Non-integer calculus viscoelastic constitutive models, having physical interpretation and modeling experimental data accurately is a good alternative to classical phenomenological viscoelastic constitutive equations.
Spinor Field Realizations of the half-integer $W_{2,s}$ Strings
Wei, Shao-Wen; Liu, Yu-Xiao; Zhang, Li-Jie; Ren, Ji-Rong
2008-01-01
The grading Becchi-Rouet-Stora-Tyutin (BRST) method gives a way to construct the integer $W_{2,s}$ strings, where the BRST charge is written as $Q_B=Q_0+Q_1$. Using this method, we reconstruct the nilpotent BRST charges $Q_{0}$ for the integer $W_{2,s}$ strings and the half-integer $W_{2,s}$ strings. Then we construct the exact grading BRST charge with spinor fields and give the new realizations of the half-integer $W_{2,s}$ strings for the cases of $s=3/2$, 5/2, and 7/2.
Parallel integer sorting with medium and fine-scale parallelism
Dagum, Leonardo
1993-01-01
Two new parallel integer sorting algorithms, queue-sort and barrel-sort, are presented and analyzed in detail. These algorithms do not have optimal parallel complexity, yet they show very good performance in practice. Queue-sort designed for fine-scale parallel architectures which allow the queueing of multiple messages to the same destination. Barrel-sort is designed for medium-scale parallel architectures with a high message passing overhead. The performance results from the implementation of queue-sort on a Connection Machine CM-2 and barrel-sort on a 128 processor iPSC/860 are given. The two implementations are found to be comparable in performance but not as good as a fully vectorized bucket sort on the Cray YMP.
Half-integer ghost states and simple BRST quantization
International Nuclear Information System (INIS)
Marnelius, R.
1987-01-01
Quantum mechanical BRST systems are considered. As is well known an odd number of ghost operators has a representation with respect to the ghost number operator consisting of states with half-integer ghost numbers. Here it is shown that an eigenstate representation of the ghost operators requires a particular mixed Grassmann character of the states. It is also shown that such states always may be avoided provided only one starts from a lagrangian where the fundamental constraints are generated by Lagrange multipliers. In the latter case there also exists an anti-BRST charge. Some relevant properties of the different BRST approaches are displayed. The existence of inequivalent physical representations is demonstrated. (orig.)
A program package for solving linear optimization problems
International Nuclear Information System (INIS)
Horikami, Kunihiko; Fujimura, Toichiro; Nakahara, Yasuaki
1980-09-01
Seven computer programs for the solution of linear, integer and quadratic programming (four programs for linear programming, one for integer programming and two for quadratic programming) have been prepared and tested on FACOM M200 computer, and auxiliary programs have been written to make it easy to use the optimization program package. The characteristics of each program are explained and the detailed input/output descriptions are given in order to let users know how to use them. (author)
Mulyasari, Joni; Mawengkang, Herman; Efendi, Syahril
2018-02-01
In a distribution network it is important to decide the locations of facilities that impacts not only the profitability of an organization but the ability to serve customers.Generally the location-routing problem is to minimize the overall cost by simultaneously selecting a subset of candidate facilities and constructing a set of delivery routes that satisfy some restrictions. In this paper we impose restriction on the route that should be passed for delivery. We use integer programming model to describe the problem. A feasible neighbourhood search is proposed to solve the result model.
Suppression of tunneling by interference in half-integer--spin particles
Loss, Daniel; DiVincenzo, David P.; Grinstein, G.
1992-01-01
Within a wide class of ferromagnetic and antiferromagnetic systems, quantum tunneling of magnetization direction is spin-parity dependent: it vanishes for magnetic particles with half-integer spin, but is allowed for integer spin. A coherent-state path integral calculation shows that this topological effect results from interference between tunneling paths.
Sabrewing: A lightweight architecture for combined floating-point and integer arithmetic
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
A note on number fields having reciprocal integer generators | Zaïmi ...
African Journals Online (AJOL)
We prove that a totally complex algebraic number field K; having a conjugate which is not closed under complex conjugation, can be generated by a reciprocal integer, when the Galois group of its normal closure is contained in the hyperoctahedral group Bdeg(K)/2. Keywords: Reciprocal integers, unit primitive elements, ...
International Nuclear Information System (INIS)
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
Li, Zukui; Ding, Ran; Floudas, Christodoulos A.
2011-01-01
Robust counterpart optimization techniques for linear optimization and mixed integer linear optimization problems are studied in this paper. Different uncertainty sets, including those studied in literature (i.e., interval set; combined interval and ellipsoidal set; combined interval and polyhedral set) and new ones (i.e., adjustable box; pure ellipsoidal; pure polyhedral; combined interval, ellipsoidal, and polyhedral set) are studied in this work and their geometric relationship is discussed. For uncertainty in the left hand side, right hand side, and objective function of the optimization problems, robust counterpart optimization formulations induced by those different uncertainty sets are derived. Numerical studies are performed to compare the solutions of the robust counterpart optimization models and applications in refinery production planning and batch process scheduling problem are presented. PMID:21935263
Optimal installation program for reprocessing plants
International Nuclear Information System (INIS)
Kubokawa, Toshihiko; Kiyose, Ryohei
1976-01-01
Optimization of the program of installation of reprocessing plants is mathematically formulated as problem of mixed integer programming, which is numerically solved by the branch-and-bound method. A new concept of quasi-penalty is used to obviate the difficulties associated with dual degeneracy. The finiteness of the useful life of the plant is also taken into consideration. It is shown that an analogous formulation is possible for the cases in which the demand forecasts and expected plant lives cannot be predicted with certainty. The scale of the problem is found to have kN binary variables, (k+2)N continuous variables, and (k+3)N constraint conditions, where k is the number of intervals used in the piece-wise linear approximation of a nonlinear objective function, and N the overall duration of the period covered by the installation program. Calculations are made for N=24 yr and k=3, with the assumption that the plant life is 15 yr, the plant scale factor 0.5, and the maximum plant capacity 900 (t/yr). The results are calculated and discussed for four different demand forecasts. The difference of net profit between optimal and non-optimal installation programs is found to be in the range of 50 -- 100 M$. The pay-off matrix is calculated, and the optimal choice of action when the demand cannot be forecast with certainty is determined by applying Bayes' theory. The optimal installation program under such conditions of uncertainty is obtained also with a stochastic mixed integer programming model. (auth.)
Directory of Open Access Journals (Sweden)
Yan Zhang
2015-01-01
Full Text Available This paper presents four different integer sequences to construct quasi-cyclic low-density parity-check (QC-LDPC codes with mathematical theory. The paper introduces the procedure of the coding principle and coding. Four different integer sequences constructing QC-LDPC code are compared with LDPC codes by using PEG algorithm, array codes, and the Mackey codes, respectively. Then, the integer sequence QC-LDPC codes are used in coded cooperative communication. Simulation results show that the integer sequence constructed QC-LDPC codes are effective, and overall performance is better than that of other types of LDPC codes in the coded cooperative communication. The performance of Dayan integer sequence constructed QC-LDPC is the most excellent performance.
Bilevel programming problems theory, algorithms and applications to energy networks
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.
Crystallization Formulation Lab
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...
Anisotropic fractal media by vector calculus in non-integer dimensional space
International Nuclear Information System (INIS)
Tarasov, Vasily E.
2014-01-01
A review of different approaches to describe anisotropic fractal media is proposed. In this paper, differentiation and integration non-integer dimensional and multi-fractional spaces are considered as tools to describe anisotropic fractal materials and media. We suggest a generalization of vector calculus for non-integer dimensional space by using a product measure method. The product of fractional and non-integer dimensional spaces allows us to take into account the anisotropy of the fractal media in the framework of continuum models. The integration over non-integer-dimensional spaces is considered. In this paper differential operators of first and second orders for fractional space and non-integer dimensional space are suggested. The differential operators are defined as inverse operations to integration in spaces with non-integer dimensions. Non-integer dimensional space that is product of spaces with different dimensions allows us to give continuum models for anisotropic type of the media. The Poisson's equation for fractal medium, the Euler-Bernoulli fractal beam, and the Timoshenko beam equations for fractal material are considered as examples of application of suggested generalization of vector calculus for anisotropic fractal materials and media
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.
Anisotropic fractal media by vector calculus in non-integer dimensional space
Tarasov, Vasily E.
2014-08-01
A review of different approaches to describe anisotropic fractal media is proposed. In this paper, differentiation and integration non-integer dimensional and multi-fractional spaces are considered as tools to describe anisotropic fractal materials and media. We suggest a generalization of vector calculus for non-integer dimensional space by using a product measure method. The product of fractional and non-integer dimensional spaces allows us to take into account the anisotropy of the fractal media in the framework of continuum models. The integration over non-integer-dimensional spaces is considered. In this paper differential operators of first and second orders for fractional space and non-integer dimensional space are suggested. The differential operators are defined as inverse operations to integration in spaces with non-integer dimensions. Non-integer dimensional space that is product of spaces with different dimensions allows us to give continuum models for anisotropic type of the media. The Poisson's equation for fractal medium, the Euler-Bernoulli fractal beam, and the Timoshenko beam equations for fractal material are considered as examples of application of suggested generalization of vector calculus for anisotropic fractal materials and media.
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.
Preconditioning 2D Integer Data for Fast Convex Hull Computations.
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.
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......-case. To the best of our knowledge, this is the first such representation which supports these operations by always reading strictly less than n bits. For redundant counters where we only need to represent numbers in the range [0,...,L] for some integer L bits, we define the efficiency...
Elasticity of fractal materials using the continuum model with non-integer dimensional space
Tarasov, Vasily E.
2015-01-01
Using a generalization of vector calculus for space with non-integer dimension, we consider elastic properties of fractal materials. Fractal materials are described by continuum models with non-integer dimensional space. A generalization of elasticity equations for non-integer dimensional space, and its solutions for the equilibrium case of fractal materials are suggested. Elasticity problems for fractal hollow ball and cylindrical fractal elastic pipe with inside and outside pressures, for rotating cylindrical fractal pipe, for gradient elasticity and thermoelasticity of fractal materials are solved.
Deterministic integer multiple firing depending on initial state in Wang model
Energy Technology Data Exchange (ETDEWEB)
Xie Yong [Institute of Nonlinear Dynamics, MSSV, Department of Engineering Mechanics, Xi' an Jiaotong University, Xi' an 710049 (China)]. E-mail: yxie@mail.xjtu.edu.cn; Xu Jianxue [Institute of Nonlinear Dynamics, MSSV, Department of Engineering Mechanics, Xi' an Jiaotong University, Xi' an 710049 (China); Jiang Jun [Institute of Nonlinear Dynamics, MSSV, Department of Engineering Mechanics, Xi' an Jiaotong University, Xi' an 710049 (China)
2006-12-15
We investigate numerically dynamical behaviour of the Wang model, which describes the rhythmic activities of thalamic relay neurons. The model neuron exhibits Type I excitability from a global view, but Type II excitability from a local view. There exists a narrow range of bistability, in which a subthreshold oscillation and a suprathreshold firing behaviour coexist. A special firing pattern, integer multiple firing can be found in the certain part of the bistable range. The characteristic feature of such firing pattern is that the histogram of interspike intervals has a multipeaked structure, and the peaks are located at about integer multiples of a basic interspike interval. Since the Wang model is noise-free, the integer multiple firing is a deterministic firing pattern. The existence of bistability leads to the deterministic integer multiple firing depending on the initial state of the model neuron, i.e., the initial values of the state variables.
Deterministic integer multiple firing depending on initial state in Wang model
International Nuclear Information System (INIS)
Xie Yong; Xu Jianxue; Jiang Jun
2006-01-01
We investigate numerically dynamical behaviour of the Wang model, which describes the rhythmic activities of thalamic relay neurons. The model neuron exhibits Type I excitability from a global view, but Type II excitability from a local view. There exists a narrow range of bistability, in which a subthreshold oscillation and a suprathreshold firing behaviour coexist. A special firing pattern, integer multiple firing can be found in the certain part of the bistable range. The characteristic feature of such firing pattern is that the histogram of interspike intervals has a multipeaked structure, and the peaks are located at about integer multiples of a basic interspike interval. Since the Wang model is noise-free, the integer multiple firing is a deterministic firing pattern. The existence of bistability leads to the deterministic integer multiple firing depending on the initial state of the model neuron, i.e., the initial values of the state variables
5th Conference on Non-integer Order Calculus and Its Applications
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 ...
Unimodular lattices in dimensions 14 and 15 over the Eisenstein integers
Abdukhalikov, Kanat; Scharlau, Rudolf
2009-03-01
All indecomposable unimodular hermitian lattices in dimensions 14 and 15 over the ring of integers in mathbb{Q}(sqrt{-3}) are determined. Precisely one lattice in dimension 14 and two lattices in dimension 15 have minimal norm 3.
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.
7th Conference on Non-Integer Order Calculus and Its Applications
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...
Edge states and integer quantum Hall effect in topological insulator thin films.
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.
Positive integer solutions of the diophantine equation x2 −Lnxy +(−1 ...
Indian Academy of Sciences (India)
ny2 = ±5r when the equation has positive integer solutions. Keywords. Fibonacci numbers; Lucas numbers; diophantine equations. Mathematics Subject Classification. 11B37, 11B39. 1. Introduction. The Fibonacci sequence {Fn} is defined by F0 ...
Integer Quantum Magnon Hall Plateau-Plateau Transition in a Spin Ice Model
Xu, Baolong; Ohtsuki, Tomi; Shindou, Ryuichi
2016-01-01
Low-energy magnon bands in a two-dimensional spin ice model become integer quantum magnon Hall bands. By calculating the localization length and the two-terminal conductance of magnon transport, we show that the magnon bands with disorders undergo a quantum phase transition from an integer quantum magnon Hall regime to a conventional magnon localized regime. Finite size scaling analysis as well as a critical conductance distribution shows that the quantum critical point belongs to the same un...
DEFF Research Database (Denmark)
Zhou, Bo; Ai, Xiaomeng; Fang, Jiakun
2017-01-01
With the rapid development and deployment of voltage source converter (VSC) based HVDC, the traditional power system is evolving to the hybrid AC-DC grid. New optimization methods are urgently needed for these hybrid AC-DC power systems. In this paper, mixed-integer second order cone programming...... (MISOCP) for the hybrid AC-DC power systems is proposed. The second order cone (SOC) relaxation is adopted to transform the AC and DC power flow constraints to MISOCP. Several IEEE test systems are used to validate the proposed MISCOP formulation of the optimal power flow (OPF) and unit commitment (UC...
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
A mathematical programming framework for early stage design of wastewater treatment plants
DEFF Research Database (Denmark)
Bozkurt, Hande; Quaglia, Alberto; Gernaey, Krist
2015-01-01
The increasing number of alternative wastewater treatment technologies and stricter effluent requirements make the optimal treatment process selection for wastewater treatment plant design a complicated problem. This task, defined as wastewater treatment process synthesis, is currently based on e...... the design problem is formulated as a Mixed Integer (Non)linear Programming problem e MI(N)LP e and solved. A case study is formulated and solved to highlight the application of the framework. © 2014 Elsevier Ltd. All rights reserved....... on expert decisions and previous experiences. This paper proposes a new approach based on mathematical programming to manage the complexity of the problem. The approach generates/identifies novel and optimal wastewater treatment process selection, and the interconnection between unit operations to create...
Lima, Ricardo; Grossmann, Ignacio E.
2016-01-01
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
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
International Nuclear Information System (INIS)
Chen, Cheng-Liang; Chen, Hui-Chu; Lee, Jui-Yuan
2016-01-01
Highlights: • A rigorous model for hybrid power system (HPS) design to support a remote island. • Use pumped hydro storage to store tentative surplus electricity. • Formulate the HPS design problem as a mixed-integer linear program (MILP). - Abstract: This paper aims to present a mathematical model for the design of a hybrid power system (HPS) to support a remote island with 100 thousand citizens. The goal is to reduce diesel fuel consumption by adequate expansion of wind power supply. Pumped hydroelectric storage (PHS) is used in the HPS to buffer the impact of intermittent behavior of wind energy. A superstructure is proposed for HPS design, considering all possible capital decisions (e.g. the number of wind turbines) and hourly-basis operational variables (such as the amount of surplus electricity in storage and its discharge). The HPS design problem can then be formulated as a mixed-integer linear program (MILP) based on the proposed superstructure. For a given total share of wind power, the optimal mix of diesel-based and wind power supplies as well as the required capacity of PHS are determined using a four-step optimization approach, involving minimizing (i) the consumption of diesel fuel, (ii) the number of wind turbines, (iii) the size of the upper water reservoir, and (iv) the charge/discharge rates of the PHS system. In this sequential optimization, the objective value obtained in a previous step is added as an additional constraint to the next step. The proposed HPS design model is applied to a real case study of the remote K Island on the other side of Taiwan Strait using hourly-basis, year-round historical data. Inclusion of other renewable energy sources, such as photovoltaic cells and biomass-fired power plants, as well as economic perspectives will be considered in future work.
Using Integer Clocks to Verify the Timing-Sync Sensor Network Protocol
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
A time series model: First-order integer-valued autoregressive (INAR(1))
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.
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.
Application of a non-integer Bessel uniform approximation to inelastic molecular collisions
International Nuclear Information System (INIS)
Connor, J.N.L.; Mayne, H.R.
1979-01-01
A non-integer Bessel uniform approximation has been used to calculate transition probabilities for collinear atom-oscillator collisions. The collision systems used are a harmonic oscillator interacting via a Lennard-Jones potential and a Morse oscillator interacting via an exponential potential. Both classically allowed and classically forbidden transitions have been treated. The order of the Bessel function is chosen by a physical argument that makes use of information contained in the final-action initial-angle plot. Limitations of this procedure are discussed. It is shown that the non-integer Bessel approximation is accurate for elastic 0 → 0 collisions at high collision energies, where the integer Bessel approximation is inaccurate or inapplicable. (author)
Fabry-Perot Interferometry in the Integer and Fractional Quantum Hall Regimes
McClure, Douglas; Chang, Willy; Kou, Angela; Marcus, Charles; Pfeiffer, Loren; West, Ken
2011-03-01
We present measurements of electronic Fabry-Perot interferometers in the integer and fractional quantum Hall regimes. Two classes of resistance oscillations may be seen as a function of magnetic field and gate voltage, as we have previously reported. In small interferometers in the integer regime, oscillations of the type associated with Coulomb interaction are ubiquitous, while those consistent with single-particle Aharonov-Bohm interference are seen to co-exist in some configurations. The amplitude scaling of both types with temperature and device size is consistent with a theoretical model. Oscillations are further observed in the fractional quantum Hall regime. Here the dependence of the period on the filling factors in the constrictions and bulk of the interferometer can shed light on the effective charge of the interfering quasiparticles, but care is needed to distinguish these oscillations from those associated with integer quantum Hall states. We acknowledge funding from Microsoft Project Q and IBM.
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.
Chang, Weng-Long
2012-03-01
Assume that n is a positive integer. If there is an integer such that M (2) ≡ C (mod n), i.e., the congruence has a solution, then C is said to be a quadratic congruence (mod n). If the congruence does not have a solution, then C is said to be a quadratic noncongruence (mod n). The task of solving the problem is central to many important applications, the most obvious being cryptography. In this article, we describe a DNA-based algorithm for solving quadratic congruence and factoring integers. In additional to this novel contribution, we also show the utility of our encoding scheme, and of the algorithm's submodules. We demonstrate how a variety of arithmetic, shifted and comparative operations, namely bitwise and full addition, subtraction, left shifter and comparison perhaps are performed using strands of DNA.
An Efficient Integer Coding and Computing Method for Multiscale Time Segment
Directory of Open Access Journals (Sweden)
TONG Xiaochong
2016-12-01
Full Text Available This article focus on the exist problem and status of current time segment coding, proposed a new set of approach about time segment coding: multi-scale time segment integer coding (MTSIC. This approach utilized the tree structure and the sort by size formed among integer, it reflected the relationship among the multi-scale time segments: order, include/contained, intersection, etc., and finally achieved an unity integer coding processing for multi-scale time. On this foundation, this research also studied the computing method for calculating the time relationships of MTSIC, to support an efficient calculation and query based on the time segment, and preliminary discussed the application method and prospect of MTSIC. The test indicated that, the implement of MTSIC is convenient and reliable, and the transformation between it and the traditional method is convenient, it has the very high efficiency in query and calculating.
Obstacle avoidance handling and mixed integer predictive control for space robots
Zong, Lijun; Luo, Jianjun; Wang, Mingming; Yuan, Jianping
2018-04-01
This paper presents a novel obstacle avoidance constraint and a mixed integer predictive control (MIPC) method for space robots avoiding obstacles and satisfying physical limits during performing tasks. Firstly, a novel kind of obstacle avoidance constraint of space robots, which needs the assumption that the manipulator links and the obstacles can be represented by convex bodies, is proposed by limiting the relative velocity between two closest points which are on the manipulator and the obstacle, respectively. Furthermore, the logical variables are introduced into the obstacle avoidance constraint, which have realized the constraint form is automatically changed to satisfy different obstacle avoidance requirements in different distance intervals between the space robot and the obstacle. Afterwards, the obstacle avoidance constraint and other system physical limits, such as joint angle ranges, the amplitude boundaries of joint velocities and joint torques, are described as inequality constraints of a quadratic programming (QP) problem by using the model predictive control (MPC) method. To guarantee the feasibility of the obtained multi-constraint QP problem, the constraints are treated as soft constraints and assigned levels of priority based on the propositional logic theory, which can realize that the constraints with lower priorities are always firstly violated to recover the feasibility of the QP problem. Since the logical variables have been introduced, the optimization problem including obstacle avoidance and system physical limits as prioritized inequality constraints is termed as MIPC method of space robots, and its computational complexity as well as possible strategies for reducing calculation amount are analyzed. Simulations of the space robot unfolding its manipulator and tracking the end-effector's desired trajectories with the existence of obstacles and physical limits are presented to demonstrate the effectiveness of the proposed obstacle avoidance
Integers in number systems with positive and negative quadratic Pisot base
Masáková, Zuzana; Vávra, Tomáš
2013-01-01
We consider numeration systems with base $\\beta$ and $-\\beta$, for quadratic Pisot numbers $\\beta$ and focus on comparing the combinatorial structure of the sets $\\Z_\\beta$ and $\\Z_{-\\beta}$ of numbers with integer expansion in base $\\beta$, resp. $-\\beta$. Our main result is the comparison of languages of infinite words $u_\\beta$ and $u_{-\\beta}$ coding the ordering of distances between consecutive $\\beta$- and $(-\\beta)$-integers. It turns out that for a class of roots $\\beta$ of $x^2-mx-m$...
DEFF Research Database (Denmark)
Bresolin, Davide; Goranko, Valentin; Montanari, Angelo
2009-01-01
Interval temporal logics are based on interval structures over linearly (or partially) ordered domains, where time intervals, rather than time instants, are the primitive ontological entities. In this paper we introduce and study Right Propositional Neighborhood Logic over natural numbers...... with integer constraints for interval lengths, which is a propositional interval temporal logic featuring a modality for the 'right neighborhood' relation between intervals and explicit integer constraints for interval lengths. We prove that it has the bounded model property with respect to ultimately periodic...
THE PHENOMENON OF HALF-INTEGER SPIN, QUATERNIONS, AND PAULI MATRICES
Directory of Open Access Journals (Sweden)
FERNANDO R. GONZÁLEZ DÍAZ
2017-01-01
Full Text Available In this paper the phenomenon of half-integer spin exemplification Paul AM Dirac made with a pair of scissors, an elastic cord and chair play. Four examples in which the same phenomenon appears and the algebraic structure of quaternions is related to one of the examples are described. Mathematical proof of the phenomenon using known topological and algebraic results are explained. The basic results of algebraic structures are described quaternions H , and an intrinsic relationship with the phenomenon half-integer spin and the Pauli matrices is established.
Hierarchical Hidden Markov Models for Multivariate Integer-Valued Time-Series
DEFF Research Database (Denmark)
Catania, Leopoldo; Di Mari, Roberto
2018-01-01
We propose a new flexible dynamic model for multivariate nonnegative integer-valued time-series. Observations are assumed to depend on the realization of two additional unobserved integer-valued stochastic variables which control for the time-and cross-dependence of the data. An Expectation......-Maximization algorithm for maximum likelihood estimation of the model's parameters is derived. We provide conditional and unconditional (cross)-moments implied by the model, as well as the limiting distribution of the series. A Monte Carlo experiment investigates the finite sample properties of our estimation...
Henriques, David; Rocha, Miguel; Saez-Rodriguez, Julio; Banga, Julio R
2015-09-15
Systems biology models can be used to test new hypotheses formulated on the basis of previous knowledge or new experimental data, contradictory with a previously existing model. New hypotheses often come in the shape of a set of possible regulatory mechanisms. This search is usually not limited to finding a single regulation link, but rather a combination of links subject to great uncertainty or no information about the kinetic parameters. In this work, we combine a logic-based formalism, to describe all the possible regulatory structures for a given dynamic model of a pathway, with mixed-integer dynamic optimization (MIDO). This framework aims to simultaneously identify the regulatory structure (represented by binary parameters) and the real-valued parameters that are consistent with the available experimental data, resulting in a logic-based differential equation model. The alternative to this would be to perform real-valued parameter estimation for each possible model structure, which is not tractable for models of the size presented in this work. The performance of the method presented here is illustrated with several case studies: a synthetic pathway problem of signaling regulation, a two-component signal transduction pathway in bacterial homeostasis, and a signaling network in liver cancer cells. Supplementary data are available at Bioinformatics online. julio@iim.csic.es or saezrodriguez@ebi.ac.uk. © The Author 2015. Published by Oxford University Press.
PRP: a FORTRAN IV interactive plotting program
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.
Interactive Fuzzy Goal Programming approach in multi-response stratified sample surveys
Directory of Open Access Journals (Sweden)
Gupta Neha
2016-01-01
Full Text Available In this paper, we applied an Interactive Fuzzy Goal Programming (IFGP approach with linear, exponential and hyperbolic membership functions, which focuses on maximizing the minimum membership values to determine the preferred compromise solution for the multi-response stratified surveys problem, formulated as a Multi- Objective Non Linear Programming Problem (MONLPP, and by linearizing the nonlinear objective functions at their individual optimum solution, the problem is approximated to an Integer Linear Programming Problem (ILPP. A numerical example based on real data is given, and comparison with some existing allocations viz. Cochran’s compromise allocation, Chatterjee’s compromise allocation and Khowaja’s compromise allocation is made to demonstrate the utility of the approach.
van der Laan, G.; Talman, A.J.J.; Yang, Z.F.
2007-01-01
Tucker's well-known combinatorial lemma states that for any given symmetric triangulation of the n-dimensional unit cube and for any integer labeling that assigns to each vertex of the triangulation a label from the set f§1;§2; ¢ ¢ ¢ ;§ng with the property that antipodal vertices on the boundary of
Physical Applications of a Simple Approximation of Bessel Functions of Integer Order
Barsan, V.; Cojocaru, S.
2007-01-01
Applications of a simple approximation of Bessel functions of integer order, in terms of trigonometric functions, are discussed for several examples from electromagnetism and optics. The method may be applied in the intermediate regime, bridging the "small values regime" and the "asymptotic" one, and covering, in this way, an area of great…
Spherical Bessel functions jsub(n) and ysub(n) of integer order and real argument
International Nuclear Information System (INIS)
Ardill, R.W.B.; Moriarty, K.J.M.
1978-01-01
The spherical Bessel function appears in a variety of physical applications, and especially in phase shift analysis. The package SPHBES contains a subroutine to calculate jsub(n)(x) and ysub(n)(x) for any integer order n and real argument x. The functions jsub(n)(x) and ysub(n)(x) are produced simultaneously and efficiently. (Auth.)
CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
DEFF Research Database (Denmark)
Friberg, Henrik Alsing
2016-01-01
The Conic Benchmark Library is an ongoing community-driven project aiming to challenge commercial and open source solvers on mainstream cone support. In this paper, 121 mixed-integer and continuous second-order cone problem instances have been selected from 11 categories as representative...
A Finer Classification of the Unit Sum Number of the Ring of Integers ...
Indian Academy of Sciences (India)
Here we introduce a finer classification for the unit sum number of a ring and in this new classification we completely determine the unit sum number of the ring of integers of a quadratic field. Further we obtain some results on cubic complex fields which one can decide whether the unit sum number is or ∞. Then we ...
Exact diagonalization study of domain structures in integer filling factor quantum Hall ferromagnets
Czech Academy of Sciences Publication Activity Database
Rezayi, E. H.; Jungwirth, Tomáš; MacDonald, A. H.; Haldane, F. D. M.
2003-01-01
Roč. 67, č. 20 (2003), s. 201305-1 - 201305-4 ISSN 0163-1829 R&D Projects: GA ČR GA202/01/0754 Institutional research plan: CEZ:AV0Z1010914 Keywords : domain structure * integer filling factor * quantum Hall ferromagnets Subject RIV: BM - Solid Matter Physics ; Magnetism Impact factor: 2.962, year: 2003
Integer Charge Transfer and Hybridization at an Organic Semiconductor/Conductive Oxide Interface
Gruenewald, Marco; Schirra, Laura K.; Winget, Paul; Kozlik, Michael; Ndione, Paul F.; Sigdel, Ajaya K.; Berry, Joseph J.; Forker, Roman; Bredas, Jean-Luc; Fritz, Torsten; Monti, Oliver L. A.
2015-01-01
with localized states (the shallow donors) in the substrate and charge back-donation, resulting in an effectively integer charge transfer across the interface. Charge transfer is thus not merely a question of locating the Fermi level above the PTCDA electron
Li, Rui
2009-01-01
The target of this work is to extend the canonical Evolution Strategies (ES) from traditional real-valued parameter optimization domain to mixed-integer parameter optimization domain. This is necessary because there exist numerous practical optimization problems from industry in which the set of
Langevin formulation of quantum dynamics
International Nuclear Information System (INIS)
Roncadelli, M.
1989-03-01
We first show that nonrelativistic quantum mechanics formulated at imaginary-(h/2 π) can formally be viewed as the Fokker-Planck description of a frictionless brownian motion, which occurs (in general) in an absorbing medium. We next offer a new formulation of quantum mechanics, which is basically the Langevin treatment of this brownian motion. Explicitly, we derive a noise-average representation for the transition probability W(X'',t''|X',t'), in terms of the solutions to a Langevin equation with a Gaussian white-noise. Upon analytic continuation back to real-(h/2 π),W(X'',t''|X',t') becomes the propagator of the original Schroedinger equation. Our approach allows for a straightforward application to quantum dynamical problems of the mathematical techniques of classical stochastic processes. Moreover, computer simulations of quantum mechanical systems can be carried out by using numerical programs based on the Langevin dynamics. (author). 19 refs, 1 tab
Audits of radiopharmaceutical formulations
International Nuclear Information System (INIS)
Castronovo, F.P. Jr.
1992-01-01
A procedure for auditing radiopharmaceutical formulations is described. To meet FDA guidelines regarding the quality of radiopharmaceuticals, institutional radioactive drug research committees perform audits when such drugs are formulated away from an institutional pharmacy. All principal investigators who formulate drugs outside institutional pharmacies must pass these audits before they can obtain a radiopharmaceutical investigation permit. The audit team meets with the individual who performs the formulation at the site of drug preparation to verify that drug formulations meet identity, strength, quality, and purity standards; are uniform and reproducible; and are sterile and pyrogen free. This team must contain an expert knowledgeable in the preparation of radioactive drugs; a radiopharmacist is the most qualified person for this role. Problems that have been identified by audits include lack of sterility and apyrogenicity testing, formulations that are open to the laboratory environment, failure to use pharmaceutical-grade chemicals, inadequate quality control methods or records, inadequate training of the person preparing the drug, and improper unit dose preparation. Investigational radiopharmaceutical formulations, including nonradiolabeled drugs, must be audited before they are administered to humans. A properly trained pharmacist should be a member of the audit team
Roy, Satadru
Traditional approaches to design and optimize a new system, often, use a system-centric objective and do not take into consideration how the operator will use this new system alongside of other existing systems. This "hand-off" between the design of the new system and how the new system operates alongside other systems might lead to a sub-optimal performance with respect to the operator-level objective. In other words, the system that is optimal for its system-level objective might not be best for the system-of-systems level objective of the operator. Among the few available references that describe attempts to address this hand-off, most follow an MDO-motivated subspace decomposition approach of first designing a very good system and then provide this system to the operator who decides the best way to use this new system along with the existing systems. The motivating example in this dissertation presents one such similar problem that includes aircraft design, airline operations and revenue management "subspaces". The research here develops an approach that could simultaneously solve these subspaces posed as a monolithic optimization problem. The monolithic approach makes the problem a Mixed Integer/Discrete Non-Linear Programming (MINLP/MDNLP) problem, which are extremely difficult to solve. The presence of expensive, sophisticated engineering analyses further aggravate the problem. To tackle this challenge problem, the work here presents a new optimization framework that simultaneously solves the subspaces to capture the "synergism" in the problem that the previous decomposition approaches may not have exploited, addresses mixed-integer/discrete type design variables in an efficient manner, and accounts for computationally expensive analysis tools. The framework combines concepts from efficient global optimization, Kriging partial least squares, and gradient-based optimization. This approach then demonstrates its ability to solve an 11 route airline network
Energy Technology Data Exchange (ETDEWEB)
Wijnker, M. (ed.) [Eindhoven University of Technology TUE, Eindhoven (Netherlands)
2011-01-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. The relationship between UNDIP (Diponegoro University in Semarang, Java, Indonesia) and TU/e (Eindhoven University of Technology) has improved because of organising two additional activities together. The chosen topics of the two workshops offered a good opportunity to get to know each other. The level of knowledge in sustainable energy and energy efficiency at UNDIP is already on a high level. The relationship between UNCEN (Cenderawasih University, Jayapura, Papua, Indonesia) and TU/e has also improved much through the organisation of two additional activities. Staff of UNCEN took the opportunity to organise two workshops improving their knowledge in the field of sustainable energy and energy efficiency.
Reactive decontamination formulation
Giletto, Anthony [College Station, TX; White, William [College Station, TX; Cisar, Alan J [Cypress, TX; Hitchens, G Duncan [Bryan, TX; Fyffe, James [Bryan, TX
2003-05-27
The present invention provides a universal decontamination formulation and method for detoxifying chemical warfare agents (CWA's) and biological warfare agents (BWA's) without producing any toxic by-products, as well as, decontaminating surfaces that have come into contact with these agents. The formulation includes a sorbent material or gel, a peroxide source, a peroxide activator, and a compound containing a mixture of KHSO.sub.5, KHSO.sub.4 and K.sub.2 SO.sub.4. The formulation is self-decontaminating and once dried can easily be wiped from the surface being decontaminated. A method for decontaminating a surface exposed to chemical or biological agents is also disclosed.
Preparation of radiopharmaceutical formulations
International Nuclear Information System (INIS)
Simon, J.; Garlich, J.R.; Frank, R.K.; McMillan, K.
1998-01-01
Radiopharmaceutical formulations for complexes comprising at least one radionuclide complexed with a ligand, or its physiologically-acceptable salts thereof, especially 153 samarium-ethylenediaminetetramethylenephosphonic acid, which optionally contains a divalent metal ion, e.g. calcium, and is frozen, thawed, and then administered by injection. Alternatively, the radiopharmaceutical formulations must contain the divalent metal and are frozen only if the time before administration is sufficiently long to cause concern for radiolysis of the ligand. 2 figs., 9 tabs
Tariff formulation and equalization
International Nuclear Information System (INIS)
Svartsund, Trond
2003-01-01
The primary goal of the transmission tariff is to provide for socioeconomic use of the transmission grid. The present tariff structure is basically right. The responsibility for the formulation of the tariff resides with the local grid owner. This must take place in agreement with the current regulations which are passed by the authorities. The formulation must be adaptable to the local requirements. EBL (Norwegian Electricity Industry Association) is content with the current regulations
International Nuclear Information System (INIS)
Dey, M.K.
1999-01-01
This paper proposes a conceptual framework for developing a fire protection program at nuclear power plants based on probabilistic risk analysis (PRA) of fire hazards, and modeling the dynamics of fire effects. The process for categorizing nuclear power plant fire areas based on risk is described, followed by a discussion of fire safety design methods that can be used for different areas of the plant, depending on the degree of threat to plant safety from the fire hazard. This alternative framework has the potential to make programs more cost-effective, and comprehensive, since it will allow a more systematic and broader examination of fire risk, and provide a means to distinguish between high and low risk fire contributors. (orig.)
International Nuclear Information System (INIS)
Nikzad, Mehdi; Mozafari, Babak; Bashirvand, Mahdi; Solaymani, Soodabeh; Ranjbar, Ali Mohamad
2012-01-01
Recently in electricity markets, a massive focus has been made on setting up opportunities for participating demand side. Such opportunities, also known as demand response (DR) options, are triggered by either a grid reliability problem or high electricity prices. Two important challenges that market operators are facing are appropriate designing and reasonable pricing of DR options. In this paper, time-of-use program (TOU) as a prevalent time-varying program is modeled linearly based on own and cross elasticity definition. In order to decide on TOU rates, a stochastic model is proposed in which the optimum TOU rates are determined based on grid reliability index set by the operator. Expected Load Not Supplied (ELNS) is used to evaluate reliability of the power system in each hour. The proposed stochastic model is formulated as a two-stage stochastic mixed-integer linear programming (SMILP) problem and solved using CPLEX solver. The validity of the method is tested over the IEEE 24-bus test system. In this regard, the impact of the proposed pricing method on system load profile; operational costs and required capacity of up- and down-spinning reserve as well as improvement of load factor is demonstrated. Also the sensitivity of the results to elasticity coefficients is investigated. -- Highlights: ► Time-of-use demand response program is linearly modeled. ► A stochastic model is proposed to determine the optimum TOU rates based on ELNS index set by the operator. ► The model is formulated as a short-term two-stage stochastic mixed-integer linear programming problem.
Integer Charge Transfer and Hybridization at an Organic Semiconductor/Conductive Oxide Interface
Gruenewald, Marco
2015-02-11
We investigate the prototypical hybrid interface formed between PTCDA and conductive n-doped ZnO films by means of complementary optical and electronic spectroscopic techniques. We demonstrate that shallow donors in the vicinity of the ZnO surface cause an integer charge transfer to PTCDA, which is clearly restricted to the first monolayer. By means of DFT calculations, we show that the experimental signatures of the anionic PTCDA species can be understood in terms of strong hybridization with localized states (the shallow donors) in the substrate and charge back-donation, resulting in an effectively integer charge transfer across the interface. Charge transfer is thus not merely a question of locating the Fermi level above the PTCDA electron-transport level but requires rather an atomistic understanding of the interfacial interactions. The study reveals that defect sites and dopants can have a significant influence on the specifics of interfacial coupling and thus on carrier injection or extraction.
Time-Series INSAR: An Integer Least-Squares Approach For Distributed Scatterers
Samiei-Esfahany, Sami; Hanssen, Ramon F.
2012-01-01
The objective of this research is to extend the geode- tic mathematical model which was developed for persistent scatterers to a model which can exploit distributed scatterers (DS). The main focus is on the integer least- squares framework, and the main challenge is to include the decorrelation effect in the mathematical model. In order to adapt the integer least-squares mathematical model for DS we altered the model from a single master to a multi-master configuration and introduced the decorrelation effect stochastically. This effect is described in our model by a full covariance matrix. We propose to de- rive this covariance matrix by numerical integration of the (joint) probability distribution function (PDF) of interferometric phases. This PDF is a function of coherence values and can be directly computed from radar data. We show that the use of this model can improve the performance of temporal phase unwrapping of distributed scatterers.
Half-integer flux quantum effect in cuprate superconductors - a probe of pairing symmetry
International Nuclear Information System (INIS)
Tsuei, C.C.; Kirtley, J.R.; Gupta, A.; Sun, J.Z.; Moler, K.A.; Wang, J.H.
1996-01-01
Based on macroscopic quantum coherence effects arising from pair tunneling and flux quantization, a series of tricrystal experiments have been designed and carried out to test the order parameter symmetry in high-T c cuprate superconductors. By using a scanning SQUID microscope, we have directly and non-invasively observed the spontaneously generated half-integer flux quantum effect in controlled-orientation tricrystal cuprate superconducting systems. The presence or absence of the half-integer flux quantum effect as a function of the tricrystal geometry allows us to prove that the order parameter symmetry in the YBCO and Tl2201 systems is consistent with that of the d x 2 -y 2 pair state. (orig.)
IMC-PID-fractional-order-filter controllers design for integer order systems.
Maâmar, Bettayeb; Rachid, Mansouri
2014-09-01
One of the reasons of the great success of standard PID controllers is the presence of simple tuning rules, of the automatic tuning feature and of tables that simplify significantly their design. For the fractional order case, some tuning rules have been proposed in the literature. However, they are not general because they are valid only for some model cases. In this paper, a new approach is investigated. The fractional property is not especially imposed by the controller structure but by the closed loop reference model. The resulting controller is fractional but it has a very interesting structure for its implementation. Indeed, the controller can be decomposed into two transfer functions: an integer transfer function which is generally an integer PID controller and a simple fractional filter. Copyright © 2014 ISA. Published by Elsevier Ltd. All rights reserved.
Non-Porod scattering and non-integer scaling of resistance in rough films
Bupathy, Arunkumar; Verma, Rupesh; Banerjee, Varsha; Puri, Sanjay
2017-04-01
In many physical systems, films are rough due to the stochastic behavior of depositing particles. They are characterized by non-Porod power law decays in the structure factor S (k) . Theoretical studies predict anomalous diffusion in such morphologies, with important implications for diffusivity, conductivity, etc. We use the non-Porod decay to accurately determine the fractal properties of two prototypical nanoparticle films: (i) Palladium (Pd) and (ii) Cu2O. Using scaling arguments, we find that the resistance of rough films of lateral size L obeys a non-integer power law R ∼L-ζ , in contrast to integer power laws for compact structures. The exponent ζ is anisotropic. We confirm our predictions by re-analyzing experimental data from Cu2O nano-particle films. Our results are valuable for understanding recent experiments that report anisotropic electrical properties in (rough) thin films.
Directory of Open Access Journals (Sweden)
Atta Ullah
2014-01-01
Full Text Available In practical utilization of stratified random sampling scheme, the investigator meets a problem to select a sample that maximizes the precision of a finite population mean under cost constraint. An allocation of sample size becomes complicated when more than one characteristic is observed from each selected unit in a sample. In many real life situations, a linear cost function of a sample size nh is not a good approximation to actual cost of sample survey when traveling cost between selected units in a stratum is significant. In this paper, sample allocation problem in multivariate stratified random sampling with proposed cost function is formulated in integer nonlinear multiobjective mathematical programming. A solution procedure is proposed using extended lexicographic goal programming approach. A numerical example is presented to illustrate the computational details and to compare the efficiency of proposed compromise allocation.
Sikora, Jamie; Selby, John
2018-04-01
Bit commitment is a fundamental cryptographic task, in which Alice commits a bit to Bob such that she cannot later change the value of the bit, while, simultaneously, the bit is hidden from Bob. It is known that ideal bit commitment is impossible within quantum theory. In this work, we show that it is also impossible in generalized probabilistic theories (under a small set of assumptions) by presenting a quantitative trade-off between Alice's and Bob's cheating probabilities. Our proof relies crucially on a formulation of cheating strategies as cone programs, a natural generalization of semidefinite programs. In fact, using the generality of this technique, we prove that this result holds for the more general task of integer commitment.
Topologically induced fractional Hall steps in the integer quantum Hall regime of MoS 2
Firoz Islam, SK; Benjamin, Colin
2016-09-01
The quantum magnetotransport properties of a monolayer of molybdenum disulfide are derived using linear response theory. In particular, the effect of topological terms on longitudinal and Hall conductivity is analyzed. The Hall conductivity exhibits fractional steps in the integer quantum Hall regime. Further complete spin and valley polarization of the longitudinal conductivitity is seen in presence of these topological terms. Finally, the Shubnikov-de Hass oscillations are suppressed or enhanced contingent on the sign of these topological terms.
Core barrier formation near integer q surfaces in DIII-D
International Nuclear Information System (INIS)
Austin, M. E.; Gentle, K. W.; Burrell, K. H.; Waltz, R. E.; Gohil, P.; Greenfield, C. M.; Groebner, R. J.; Petty, C. C.; Prater, R.; Heidbrink, W. W.; Luo, Y.; Kinsey, J. E.; Makowski, M. A.; McKee, G. R.; Shafer, M. W.; Nazikian, R.; Rhodes, T. L.; Van Zeeland, M. A.
2006-01-01
Recent DIII-D experiments have significantly improved the understanding of internal transport barriers (ITBs) that are triggered close to the time when an integer value of the minimum in q is crossed. While this phenomenon has been observed on many tokamaks, the extensive transport and fluctuation diagnostics on DIII-D have permitted a detailed study of the generation mechanisms of q-triggered ITBs as pertaining to turbulence suppression dynamics, shear flows, and energetic particle modes. In these discharges, the evolution of the q profile is measured using motional Stark effect polarimetry and the integer q min crossings are further pinpointed in time by the observation of Alfven cascades. High time resolution measurements of the ion and electron temperatures and the toroidal rotation show that the start of improved confinement is simultaneous in all three channels, and that this event precedes the traversal of integer q min by 5-20 ms. There is no significant low-frequency magnetohydrodynamic activity prior to or just after the crossing of the integer q min and hence magnetic reconnection is determined not to be the precipitant of the confinement change. Instead, results from the GYRO code point to the effects of zonal flows near low order rational q values as playing a role in ITB triggering. A reduction in local turbulent fluctuations is observed at the start of the temperature rise and, concurrently, an increase in turbulence poloidal flow velocity and flow shear is measured with the beam emission spectroscopy diagnostic. For the case of a transition to an enduring internal barrier the fluctuation level remains at a reduced amplitude. The timing and nature of the temperature, rotation, and fluctuation changes leading to internal barriers suggests transport improvement due to increased shear flow arising from the zonal flow structures
Expansion around half-integer values, binomial sums, and inverse binomial sums
International Nuclear Information System (INIS)
Weinzierl, Stefan
2004-01-01
I consider the expansion of transcendental functions in a small parameter around rational numbers. This includes in particular the expansion around half-integer values. I present algorithms which are suitable for an implementation within a symbolic computer algebra system. The method is an extension of the technique of nested sums. The algorithms allow in addition the evaluation of binomial sums, inverse binomial sums and generalizations thereof
VLSI Architectures for the Multiplication of Integers Modulo a Fermat Number
Chang, J. J.; Truong, T. K.; Reed, I. S.; Hsu, I. S.
1984-01-01
Multiplication is central in the implementation of Fermat number transforms and other residue number algorithms. There is need for a good multiplication algorithm that can be realized easily on a very large scale integration (VLSI) chip. The Leibowitz multiplier is modified to realize multiplication in the ring of integers modulo a Fermat number. This new algorithm requires only a sequence of cyclic shifts and additions. The designs developed for this new multiplier are regular, simple, expandable, and, therefore, suitable for VLSI implementation.
Granulated decontamination formulations
Tucker, Mark D.
2007-10-02
A decontamination formulation and method of making that neutralizes the adverse health effects of both chemical and biological compounds, especially chemical warfare (CW) and biological warfare (BW) agents, and toxic industrial chemicals. The formulation provides solubilizing compounds that serve to effectively render the chemical and biological compounds, particularly CW and BW compounds, susceptible to attack, and at least one reactive compound that serves to attack (and detoxify or kill) the compound. The formulation includes at least one solubilizing agent, a reactive compound, a sorbent additive, and water. A highly adsorbent sorbent additive (e.g., amorphous silica, sorbitol, mannitol, etc.) is used to "dry out" one or more liquid ingredients into a dry, free-flowing powder that has an extended shelf life, and is more convenient to handle and mix in the field.
Directory of Open Access Journals (Sweden)
A. V. Tokarev
2015-01-01
Full Text Available The problem of optimization of food additives in compounding of sausages for elimination of defects in meat raw materials at production management is considered in article. The mathematical problem definition and algorithm of its decision is offered. Formally the task is classified as a combinatory problem of integer linear programming which purpose is providing a set functional and technological and the taste of the final product at the minimum cost of unit of mass offood additives. The offered algorithm of the decision realizes a method of step-by-step creation of the decision with elimination of the unpromising options defined on the basis of recurrence relations. An example of determining the optimal set of food additives for the production of a particular case, when the recipe sausage "Stolichnaya" contains large amounts of fat-containing raw materials. To solve the problem of binding and emulsifying oily materials, as shown in the article are necessary supplements which together would contain: phosphate (pH regulator, water-retaining agent, antioxidant, emulsifier, thickener, gelling agent, animal protein (filler, coloring agent retainer color, flavor intensifier. For example, it was presented with a set of six different food additives with their technological and functional properties of flavor and cost. It was necessary to determine which of these to include in the food additives formulated so as to on the one hand they ultimately comprise a predetermined set of specified properties, and on the other - of the total cost was minimal. Solving this problem with the use of the considered algorithm was found the optimal set of food additives, which completely cover the set. This kit contains all the necessary ingredients for the task, and their total cost is minimal, unlike other possible combinations. The algorithm is realized in program system "MultiMeat Expert" in system of support of decision-making.
Verslycke, Tim; Poelmans, Sofie; De Wasch, Katia; Vercauteren, Jordy; Devos, Christophe; Moens, Luc; Sandra, Patrick; De Brabander, Hubert F; Janssen, Colin R
2003-09-01
Current evidence suggests that the biocide tributyltin (TBT) causes the development of imposex, a state of pseudohermaphrodism in which females exhibit functional secondary male characteristics, by altering the biotransformation or elimination of testosterone. Imposex in gastropods following TBT exposure is the most complete example of the effects of an endocrine disrupter on marine invertebrates. Previous studies have demonstrated that the estuarine mysid Neomysis integer converts testosterone into multiple polar and nonpolar metabolites resulting from both phase I and phase II biotransformations. In this study, the effects of TBT chloride (TBTCl) on the phase I and II testosterone metabolism of N. integer were evaluated. The TBTCl was highly toxic to N. integer (96-h median lethal concentration [LC50] of 164 ng/L). To assess the effects on testosterone metabolism, mysids were exposed for 96 h to different concentrations of TBTCl (control, 10, 100, and 1,000 ng/L), and testosterone elimination as polar hydroxylated, nonpolar oxido-reduced, and glucose- and sulfate-conjugated metabolites was examined. The TBTCl differentially affected testosterone metabolism. The effect of TBTCl on phase I metabolism was unclear and has been shown to vary among species, likely depending on the inducibility or presence of certain P450 isozyme families. Reductase activity and metabolic androgenization were induced in the 10-ng/L treatment, whereas higher concentrations resulted in a reduction of sulfate conjugation. The exact mechanisms underlying TBT-induced imposex and alterations in the steroid metabolism need to be further elucidated.
Accurate Computation of Periodic Regions' Centers in the General M-Set with Integer Index Number
Directory of Open Access Journals (Sweden)
Wang Xingyuan
2010-01-01
Full Text Available This paper presents two methods for accurately computing the periodic regions' centers. One method fits for the general M-sets with integer index number, the other fits for the general M-sets with negative integer index number. Both methods improve the precision of computation by transforming the polynomial equations which determine the periodic regions' centers. We primarily discuss the general M-sets with negative integer index, and analyze the relationship between the number of periodic regions' centers on the principal symmetric axis and in the principal symmetric interior. We can get the centers' coordinates with at least 48 significant digits after the decimal point in both real and imaginary parts by applying the Newton's method to the transformed polynomial equation which determine the periodic regions' centers. In this paper, we list some centers' coordinates of general M-sets' k-periodic regions (k=3,4,5,6 for the index numbers α=−25,−24,…,−1 , all of which have highly numerical accuracy.
Spatial “Artistic” Networks: From Deconstructing Integer-Functions to Visual Arts
Directory of Open Access Journals (Sweden)
Ernesto Estrada
2018-01-01
Full Text Available Deconstructivism is an aesthetically appealing architectonic style. Here, we identify some general characteristics of this style, such as decomposition of the whole into parts, superposition of layers, and conservation of the memory of the whole. Using these attributes, we propose a method to deconstruct functions based on integers. Using this integer-function deconstruction we generate spatial networks which display a few artistic attributes such as (i biomorphic shapes, (ii symmetry, and (iii beauty. In building these networks, the deconstructed integer-functions are used as the coordinates of the nodes in a unit square, which are then joined according to a given connection radius like in random geometric graphs (RGGs. Some graph-theoretic invariants of these networks are calculated and compared with the classical RGGs. We then show how these networks inspire an artist to create artistic compositions using mixed techniques on canvas and on paper. Finally, we call for avoiding that the applicability of (network sciences should not go in detriment of curiosity-driven, and aesthetic-driven, researches. We claim that the aesthetic of network research, and not only its applicability, would be an attractor for new minds to this field.
BitPAl: a bit-parallel, general integer-scoring sequence alignment algorithm.
Loving, Joshua; Hernandez, Yozen; Benson, Gary
2014-11-15
Mapping of high-throughput sequencing data and other bulk sequence comparison applications have motivated a search for high-efficiency sequence alignment algorithms. The bit-parallel approach represents individual cells in an alignment scoring matrix as bits in computer words and emulates the calculation of scores by a series of logic operations composed of AND, OR, XOR, complement, shift and addition. Bit-parallelism has been successfully applied to the longest common subsequence (LCS) and edit-distance problems, producing fast algorithms in practice. We have developed BitPAl, a bit-parallel algorithm for general, integer-scoring global alignment. Integer-scoring schemes assign integer weights for match, mismatch and insertion/deletion. The BitPAl method uses structural properties in the relationship between adjacent scores in the scoring matrix to construct classes of efficient algorithms, each designed for a particular set of weights. In timed tests, we show that BitPAl runs 7-25 times faster than a standard iterative algorithm. Source code is freely available for download at http://lobstah.bu.edu/BitPAl/BitPAl.html. BitPAl is implemented in C and runs on all major operating systems. jloving@bu.edu or yhernand@bu.edu or gbenson@bu.edu Supplementary data are available at Bioinformatics online. © The Author 2014. Published by Oxford University Press.
An n -material thresholding method for improving integerness of solutions in topology optimization
International Nuclear Information System (INIS)
Watts, Seth; Engineering); Tortorelli, Daniel A.; Engineering)
2016-01-01
It is common in solving topology optimization problems to replace an integer-valued characteristic function design field with the material volume fraction field, a real-valued approximation of the design field that permits "fictitious" mixtures of materials during intermediate iterations in the optimization process. This is reasonable so long as one can interpolate properties for such materials and so long as the final design is integer valued. For this purpose, we present a method for smoothly thresholding the volume fractions of an arbitrary number of material phases which specify the design. This method is trivial for two-material design problems, for example, the canonical topology design problem of specifying the presence or absence of a single material within a domain, but it becomes more complex when three or more materials are used, as often occurs in material design problems. We take advantage of the similarity in properties between the volume fractions and the barycentric coordinates on a simplex to derive a thresholding, method which is applicable to an arbitrary number of materials. As we show in a sensitivity analysis, this method has smooth derivatives, allowing it to be used in gradient-based optimization algorithms. Finally, we present results, which show synergistic effects when used with Solid Isotropic Material with Penalty and Rational Approximation of Material Properties material interpolation functions, popular methods of ensuring integerness of solutions.
International Nuclear Information System (INIS)
Wang, Bo; Miao, Lingjuan; Wang, Shunting; Shen, Jun
2009-01-01
During attitude determination using a global positioning system (GPS), cycle slips occur due to the loss of lock and noise disturbance. Therefore, the integer ambiguity needs re-computation to isolate the error in carrier phase. This paper presents a fast method for integer ambiguity resolution for land vehicle application. After the cycle slips are detected, the velocity vector is utilized to obtain the rough baseline vector. The obtained baseline vector is substituted into carrier phase observation equations to solve the float ambiguity solution which can be used as a constraint to accelerate the integer ambiguity search procedure at next epochs. The probability of correct integer estimation in the expanded search space is analyzed. Experimental results demonstrate that the proposed method gives a fast approach to obtain new fixed ambiguities while the regular method takes longer time and sometimes results in incorrect solutions
Using linear integer programming for multi-site land-use allocation
Aerts, J.C.J.H.; Eisinger, E.; Heuvelink, G.B.M.; Stewart, Th.J.
2003-01-01
Research in the area of spatial decision support (SDS) and resource allocation has recently generated increased attention for integrating optimization techniques with GIS. In this paper we address the use of spatial optimization techniques for solving multi-site land-use allocation (MLUA) problems,
Optimal Airport Surface Traffic Planning Using Mixed-Integer Linear Programming
Roling, P.C.; Visser, H.G.
2008-01-01
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
Mixed-integer linear program for an optimal hybrid energy network topology
Mazairac, L.A.J.; Salenbien, R.; de Vries, B.
2015-01-01
Existing networks do not have the quantitative and qualitative capacity to facilitate the transition towards distributed renewable energy sources. Irregular production of energy over time at different locations will alter the current patters of energy flow, necessitating the implementation of short-
A Mixed-Integer Linear Programming Problem which is Efficiently Solvable.
1987-10-01
ger prongramn rg versions or the problem is not ac’hievable in genieral for sparse inistancves of’ P rolem(r Mi. Th le remrai nder or thris paper is...rClazes c:oIh edge (i,I*) by comlpli urg +- rnirr(z 3, ,x + a,j). A sirnI) le analysis (11 vto Nei [131 indicates why whe Iellinan-Ford algorithm works...ari cl(cck to iceat reguilar rnct’vtuls. For c’xamiic, oi1cc Wwitiil pcroccc’ssicg svlstcici1 rccjcilrcc thicit I iisc wires ice repeated verr 200W
Optimized Waterspace Management and Scheduling Using Mixed-Integer Linear Programming
2016-01-01
PANAMA CITY DIVISION PANAMA CITY, FLORIDA 32407-7001 5(3257...task. This paper is outlined as follows: in Section 2, we discuss the general setup of the the MCM scheduling problem, including the definition of the...Suite 1425 Arlington, VA 22203-1995 Naval Surface Warfare Center, Panama City Division 1 ATTN: Technical Library 110 Vernon Avenue Panama City, FL 32407 27
The Neighborhood Covering Heuristic (NCH) Approach for the General Mixed Integer Programming Problem
2004-02-02
5e. TASK NUMBER 5f. WORK UNIT NUMBER 7. PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES) Creative Action LLC 680 N. Portage Path Akron, OH 44303; The...University of Akron Department of Theoretical and Applied Mathematics Akron OH 44325-4002 8. PERFORMING ORGANIZATION REPORT NUMBER SF309 9...algorithm is naturally adaptable to a parallel architechture . In particular, under NCH, one could parcel out pieces of the problem to many processors
On the Impact of using Mixed Integer Programming Techniques on Real-world Offshore Wind Parks
DEFF Research Database (Denmark)
Fischetti, Martina; Pisinger, David
2017-01-01
Wind power is a leading technology in the transition to sustainable energy. Being a new and still more competitive field, it is of major interest to investigate new techniques to solve the design challenges involved. In this paper, we consider optimization of the inter-array cable routing...... optimization problem considers two objectives: minimizing immediate costs (CAPEX) and minimizing costs due to power losses. This makes it possible to perform various what-if analyses to evaluate the impact of different preferences to CAPEX versus reduction of power losses. Thanks to the close collaboration...... with a leading energy company, we have been able to report results on a set of real-world instances, based on six existing wind parks, studying the economical impact of considering power losses in the cable routing design phase....
Wu, C. Z.; Huang, G. H.; Yan, X. P.; Cai, Y. P.; Li, Y. P.
2010-05-01
Large crowds are increasingly common at political, social, economic, cultural and sports events in urban areas. This has led to attention on the management of evacuations under such situations. In this study, we optimise an approximation method for vehicle allocation and route planning in case of an evacuation. This method, based on an interval-parameter multi-objective optimisation model, has potential for use in a flexible decision support system for evacuation management. The modeling solutions are obtained by sequentially solving two sub-models corresponding to lower- and upper-bounds for the desired objective function value. The interval solutions are feasible and stable in the given decision space, and this may reduce the negative effects of uncertainty, thereby improving decision makers' estimates under different conditions. The resulting model can be used for a systematic analysis of the complex relationships among evacuation time, cost and environmental considerations. The results of a case study used to validate the proposed model show that the model does generate useful solutions for planning evacuation management and practices. Furthermore, these results are useful for evacuation planners, not only in making vehicle allocation decisions but also for providing insight into the tradeoffs among evacuation time, environmental considerations and economic objectives.
Directory of Open Access Journals (Sweden)
J. Fabian Lopez
2010-01-01
Full Text Available We consider a Pickup and Delivery Vehicle Routing Problem (PDP commonly encountered in real-world logistics operations. The problem involves a set of practical complications that have received little attention in the vehicle routing literature. In this problem, there are multiple vehicle types available to cover a set of pickup and delivery requests, each of which has pickup time windows and delivery time windows. Transportation orders and vehicle types must satisfy a set of compatibility constraints that specify which orders cannot be covered by which vehicle types. In addition we include some dock service capacity constraints as is required on common real world operations. This problem requires to be attended on large scale instances (orders ≥ 500, (vehicles ≥ 150. As a generalization of the traveling salesman problem, clearly this problem is NP-hard. The exact algorithms are too slow for large scale instances. The PDP-TWDS is both a packing problem (assign order to vehicles, and a routing problem (find the best route for each vehicle. We propose to solve the problem in three stages. The first stage constructs initials solutions at aggregate level relaxing some constraints on the original problem. The other two stages imposes time windows and dock service constraints. Our results are favorable finding good quality solutions in relatively short computational times.
Asset liability management modeling using multi-stage mixed-integer stochastic programming
Drijver, S.J.; Klein Haneveld, W.K.; van der Vlerk, Maarten H.
2000-01-01
A pension fund has to match the portfolio of long-term liabilities with the portfolio of assets. Key instruments in strategic Asset Liability Management (ALM) are the adjustments of the contribution rate of the sponsor and the reallocation of the investments in several asset classes at various
Canepa, Edward S.; Claudel, Christian G.
2013-01-01
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
CSIR Research Space (South Africa)
Mahlathi, Christopher
2016-10-01
Full Text Available Instream water quality management encompasses field monitoring and utilisation of mathematical models. These models can be coupled with optimisation techniques to determine more efficient water quality management alternatives. Among these activities...
Gorissen, B.L.; den Hertog, D.; Hoffmann, A.L.
2013-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
Mixed Integer Linear Programming for new trends in wind farm cable routing
DEFF Research Database (Denmark)
Fischetti, Martina; Pisinger, David
2018-01-01
The efficient production of green energy plays an import role in modern economies. In this paper we address the optimization of cable connections between turbines in an offshore wind park. Different versions of this problem have been studied recently. In a previous joint project with Vattenfall BA...
Gauge invariant Lagrangian formulation of massive higher spin fields in (A)dS3 space
International Nuclear Information System (INIS)
Buchbinder, I.L.; Snegirev, T.V.; Zinoviev, Yu.M.
2012-01-01
We develop the frame-like formulation of massive bosonic higher spin fields in the case of three-dimensional (A)dS space with the arbitrary cosmological constant. The formulation is based on gauge invariant description by involving the Stueckelberg auxiliary fields. The explicit form of the Lagrangians and the gauge transformation laws are found. The theory can be written in terms of gauge invariant objects similar to the massless theories, thus allowing us to hope to use the same methods for investigation of interactions. In the massive spin 3 field example we are able to rewrite the Lagrangian using the new the so-called separated variables, so that the study of Lagrangian formulation reduces to finding the Lagrangian containing only half of the fields. The same construction takes places for arbitrary integer spin field as well. Further working in terms of separated variables, we build Lagrangian for arbitrary integer spin and write it in terms of gauge invariant objects. Also, we demonstrate how to restore the full set of variables, thus receiving Lagrangian for the massive fields of arbitrary spin in the terms of initial fields.
Pomey, Marie-Pascale; Forest, Pierre-Gerlier; Palley, Howard A; Martin, Elisabeth
2007-09-01
In January 1997, the government of Quebec, Canada, implemented a public/private prescription drug program that covered the entire population of the province. Under this program, the public sector collaborates with private insurers to protect all Quebecers from the high cost of drugs. This article outlines the principal features and history of the Quebec plan and draws parallels between the factors that led to its emergence and those that led to the passage of the Medicare Prescription Drug, Improvement and Modernization Act (MMA) in the United States. It also discusses the challenges and similarities of both programs and analyzes Quebec's ten years of experience to identify adjustments that may help U.S. policymakers optimize the MMA.
Extension of the direct statistical approach to a volume parameter model (non-integer splitting)
International Nuclear Information System (INIS)
Burn, K.W.
1990-01-01
The Direct Statistical Approach is a rigorous mathematical derivation of the second moment for surface splitting and Russian Roulette games attached to the Monte Carlo modelling of fixed source particle transport. It has been extended to a volume parameter model (involving non-integer ''expected value'' splitting), and then to a cell model. The cell model gives second moment and time functions that have a closed form. This suggests the possibility of two different methods of solution of the optimum splitting/Russian Roulette parameters. (author)
A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
DEFF Research Database (Denmark)
Damgård, Ivan Bjerre; Fujisaki, Eiichiro
2002-01-01
We present a statistically-hiding commitment scheme allowing commitment to arbitrary size integers, based on any (Abelian) group with certain properties, most importantly, that it is hard for the committer to compute its order. We also give efficient zero-knowledge protocols for proving knowledge...... input is chosen by the (possibly cheating) prover. - - Our results apply to any group with suitable properties. In particular, they apply to a much larger class of RSA moduli than the safe prime products proposed in [14] - Potential examples include RSA moduli, class groups and, with a slight...
Universal conductance and conductivity at critical points in integer quantum Hall systems.
Schweitzer, L; Markos, P
2005-12-16
The sample averaged longitudinal two-terminal conductance and the respective Kubo conductivity are calculated at quantum critical points in the integer quantum Hall regime. In the limit of large system size, both transport quantities are found to be the same within numerical uncertainty in the lowest Landau band, and , respectively. In the second-lowest Landau band, a critical conductance is obtained which indeed supports the notion of universality. However, these numbers are significantly at variance with the hitherto commonly believed value . We argue that this difference is due to the multifractal structure of critical wave functions, a property that should generically show up in the conductance at quantum critical points.
Entanglement Properties of a Higher-Integer-Spin AKLT Model with Quantum Group Symmetry
Directory of Open Access Journals (Sweden)
Chikashi Arita
2012-10-01
Full Text Available We study the entanglement properties of a higher-integer-spin Affleck-Kennedy-Lieb-Tasaki model with quantum group symmetry in the periodic boundary condition. We exactly calculate the finite size correction terms of the entanglement entropies from the double scaling limit. We also evaluate the geometric entanglement, which serves as another measure for entanglement. We find the geometric entanglement reaches its maximum at the isotropic point, and decreases with the increase of the anisotropy. This behavior is similar to that of the entanglement entropies.
Absence of even-integer ζ-function values in Euclidean physical quantities in QCD
Jamin, Matthias; Miravitllas, Ramon
2018-04-01
At order αs4 in perturbative quantum chromodynamics, even-integer ζ-function values are present in Euclidean physical correlation functions like the scalar quark correlation function or the scalar gluonium correlator. We demonstrate that these contributions cancel when the perturbative expansion is expressed in terms of the so-called C-scheme coupling αˆs which has recently been introduced in Ref. [1]. It is furthermore conjectured that a ζ4 term should arise in the Adler function at order αs5 in the MS ‾-scheme, and that this term is expected to disappear in the C-scheme as well.
TRACKING SIMULATIONS NEAR HALF-INTEGER RESONANCE AT PEP-II
International Nuclear Information System (INIS)
Nosochkov, Yuri
2003-01-01
Beam-beam simulations predict that PEP-II luminosity can be increased by operating the horizontal betatron tune near and above a half-integer resonance. However, effects of the resonance and its synchrotron sidebands significantly enhance betatron and chromatic perturbations which tend to reduce dynamic aperture. In the study, chromatic variation of horizontal tune near the resonance was minimized by optimizing local sextupoles in the Interaction Region. Dynamic aperture was calculated using tracking simulations in LEGO code. Dependence of dynamic aperture on the residual orbit, dispersion and β distortion after correction was investigated
A concrete approach to abstract algebra from the integers to the insolvability of the quintic
Bergen, Jeffrey
2010-01-01
A Concrete Approach to Abstract Algebra begins with a concrete and thorough examination of familiar objects like integers, rational numbers, real numbers, complex numbers, complex conjugation and polynomials, in this unique approach, the author builds upon these familar objects and then uses them to introduce and motivate advanced concepts in algebra in a manner that is easier to understand for most students. The text will be of particular interest to teachers and future teachers as it links abstract algebra to many topics wich arise in courses in algebra, geometry, trigonometry, preca
Developing a Novel Multi-objective Programming Model for Personnel Assignment Problem
Directory of Open Access Journals (Sweden)
Mehdi Seifbarghy
2014-05-01
Full Text Available The assignment of personnel to the right positions in order to increase organization's performance is one of the most crucial tasks in human resource management. In this paper, personnel assignment problem is formulated as a multi-objective binary integer programming model in which skills, level of satisfaction and training cost of personnel are considered simultaneously in productive company. The purpose of this model is to obtain the best matching between candidates and positions. In this model, a set of methods such as a group analytic hierarchy process (GAHP, Shannon entropy, coefficient of variation (CV and fuzzy logic are used to calculate the weights of evaluation criteria, weights of position and coefficient of objective functions. This proposed model can rationalize the subjective judgments of decision makers with mathematic models.
Drug delivery and formulations.
Breitkreutz, Jörg; Boos, Joachim
2011-01-01
Paediatric drug delivery is a major challenge in drug development. Because of the heterogeneous nature of the patient group, ranging from newborns to adolescents, there is a need to use appropriate excipients, drug dosage forms and delivery devices for different age groups. So far, there is a lack of suitable and safe drug formulations for children, especially for the very young and seriously ill patients. The new EU legislation will enforce paediatric clinical trials and drug development. Current advances in paediatric drug delivery include interesting new concepts such as fast-dissolving drug formulations, including orodispersible tablets and oral thin strips (buccal wafers), and multiparticulate dosage forms based on mini-tabletting or pelletization technologies. Parenteral administration is likely to remain the first choice for children in the neonatal period and for emergency cases. Alternative routes of administration include transdermal, pulmonary and nasal drug delivery systems. A few products are already available on the market, but others still need further investigations and clinical proof of concept.
Ether formulations of relativity
International Nuclear Information System (INIS)
Duffy, M.C.
1980-01-01
Contemporary ether theories are surveyed and criticised, especially those formally identical to orthodox Relativity. The historical development of Relativity, Special and General, in terms of an ether, is briefly indicated. Classical interpretations of Generalized Relativity using ether are compared to Euclidean formulations using a background space. The history of a sub-group of theories, formulating a 'new' Relativity involving modified transforms, is outlined. According to the theory with which they agree, recent supposed detections of drift are classified and criticised. Cosmological evidence suggesting an ether is mentioned. Only ether theories formally identical to Relativity have been published in depth. They stand criticised as being contrary to the positivist spirit. The history of mechanical analogues is traced, from Hartley's representing gravitating matter as spherical standing waves, to recent suggestions that vortex-sponge might model electromagnetic, quantum, uncertainty and faster-than-light phenomena. Contemporary theories are particular physical theories, themselves 'second interpretations' of a primary mathematical model. Mechanical analogues are auxiliary, not necessary, to other theory, disclosing relationships between classical and non-classical descriptions of assemblies charging state. The ether-relativity polemic, part of a broader dispute about relativity, is founded on mistaken conceptions of the roles of mathematical and physical models, mechanical analogues; and a distored view of history, which indicates that ether theories have become relativistic. (author)
Origin and diversity of an underutilized fruit tree crop, cempedak (Artocarpus integer, Moraceae).
Wang, Maria M H; Gardner, Elliot M; Chung, Richard C K; Chew, Ming Yee; Milan, Abd Rahman; Pereira, Joan T; Zerega, Nyree J C
2018-06-06
Underutilized crops and their wild relatives are important resources for crop improvement and food security. Cempedak [Artocarpus integer (Thunb). Merr.] is a significant crop in Malaysia but underutilized elsewhere. Here we performed molecular characterization of cempedak and its putative wild relative bangkong (Artocarpus integer (Thunb). Merr. var. silvestris Corner) to address questions regarding the origin and diversity of cempedak. Using data from 12 microsatellite loci, we assessed the genetic diversity and genetic/geographic structure for 353 cempedak and 175 bangkong accessions from Malaysia and neighboring countries and employed clonal analysis to characterize cempedak cultivars. We conducted haplotype network analyses on the trnH-psbA region in a subset of these samples. We also analyzed key vegetative characters that reportedly differentiate cempedak and bangkong. We show that cempedak and bangkong are sister taxa and distinct genetically and morphologically, but the directionality of domestication origin is unclear. Genetic diversity was generally higher in bangkong than in cempedak. We found a distinct genetic cluster for cempedak from Borneo as compared to cempedak from Peninsular Malaysia. Finally, cempedak cultivars with the same names did not always share the same genetic fingerprint. Cempedak origins are complex, with likely admixture and hybridization with bangkong, warranting further investigation. We provide a baseline of genetic diversity of cempedak and bangkong in Malaysia and found that germplasm collections in Malaysia represent diverse coverage of the four cempedak genetic clusters detected. © 2018 Botanical Society of America.
Conference on Commutative rings, integer-valued polynomials and polynomial functions
Frisch, Sophie; Glaz, Sarah; Commutative Algebra : Recent Advances in Commutative Rings, Integer-Valued Polynomials, and Polynomial Functions
2014-01-01
This volume presents a multi-dimensional collection of articles highlighting recent developments in commutative algebra. It also includes an extensive bibliography and lists a substantial number of open problems that point to future directions of research in the represented subfields. The contributions cover areas in commutative algebra that have flourished in the last few decades and are not yet well represented in book form. Highlighted topics and research methods include Noetherian and non- Noetherian ring theory as well as integer-valued polynomials and functions. Specific topics include: · Homological dimensions of Prüfer-like rings · Quasi complete rings · Total graphs of rings · Properties of prime ideals over various rings · Bases for integer-valued polynomials · Boolean subrings · The portable property of domains · Probabilistic topics in Intn(D) · Closure operations in Zariski-Riemann spaces of valuation domains · Stability of do...
Yamada, Takashi
2017-12-01
This study computationally examines (1) how the behaviors of subjects are represented, (2) whether the classification of subjects is related to the scale of the game, and (3) what kind of behavioral models are successful in small-sized lowest unique integer games (LUIGs). In a LUIG, N (>= 3) players submit a positive integer up to M(> 1) and the player choosing the smallest number not chosen by anyone else wins. For this purpose, the author considers four LUIGs with N = {3, 4} and M = {3, 4} and uses the behavioral data obtained in the laboratory experiment by Yamada and Hanaki (Physica A 463, pp. 88–102, 2016). For computational experiments, the author calibrates the parameters of typical learning models for each subject and then pursues round robin competitions. The main findings are in the following: First, the subjects who played not differently from the mixed-strategy Nash equilibrium (MSE) prediction tended to made use of not only their choices but also the game outcomes. Meanwhile those who deviated from the MSE prediction took care of only their choices as the complexity of the game increased. Second, the heterogeneity of player strategies depends on both the number of players (N) and the upper limit (M). Third, when groups consist of different agents like in the earlier laboratory experiment, sticking behavior is quite effective to win.
Estimating Most Productive Scale Size in Data Envelopment Analysis with Integer Value Data
Dwi Sari, Yunita; Angria S, Layla; Efendi, Syahril; Zarlis, Muhammad
2018-01-01
The most productive scale size (MPSS) is a measurement that states how resources should be organized and utilized to achieve optimal results. The most productive scale size (MPSS) can be used as a benchmark for the success of an industry or company in producing goods or services. To estimate the most productive scale size (MPSS), each decision making unit (DMU) should pay attention the level of input-output efficiency, by data envelopment analysis (DEA) method decision making unit (DMU) can identify units used as references that can help to find the cause and solution from inefficiencies can optimize productivity that main advantage in managerial applications. Therefore, data envelopment analysis (DEA) is chosen to estimating most productive scale size (MPSS) that will focus on the input of integer value data with the CCR model and the BCC model. The purpose of this research is to find the best solution for estimating most productive scale size (MPSS) with input of integer value data in data envelopment analysis (DEA) method.
Imaging the Conductance of Integer and Fractional Quantum Hall Edge States
Directory of Open Access Journals (Sweden)
Nikola Pascher
2014-01-01
Full Text Available We measure the conductance of a quantum point contact while the biased tip of a scanning probe microscope induces a depleted region in the electron gas underneath. At a finite magnetic field, we find plateaus in the real-space maps of the conductance as a function of tip position at integer (ν=1, 2, 3, 4, 6, 8 and fractional (ν=1/3, 2/3, 5/3, 4/5 values of transmission. They resemble theoretically predicted compressible and incompressible stripes of quantum Hall edge states. The scanning tip allows us to shift the constriction limiting the conductance in real space over distances of many microns. The resulting stripes of integer and fractional filling factors are rugged on scales of a few hundred nanometers, i.e., on a scale much smaller than the zero-field elastic mean free path of the electrons. Our experiments demonstrate that microscopic inhomogeneities are relevant even in high-quality samples and lead to locally strongly fluctuating widths of incompressible regions even down to their complete suppression for certain tip positions. The macroscopic quantization of the Hall resistance measured experimentally in a nonlocal contact configuration survives in the presence of these inhomogeneities, and the relevant local energy scale for the ν=2 state turns out to be independent of tip position.
Directory of Open Access Journals (Sweden)
Takashi Yamada
2017-12-01
Full Text Available This study computationally examines (1 how the behaviors of subjects are represented, (2 whether the classification of subjects is related to the scale of the game, and (3 what kind of behavioral models are successful in small-sized lowest unique integer games (LUIGs. In a LUIG, N (≥ 3 players submit a positive integer up to M(> 1 and the player choosing the smallest number not chosen by anyone else wins. For this purpose, the author considers four LUIGs with N = {3, 4} and M = {3, 4} and uses the behavioral data obtained in the laboratory experiment by Yamada and Hanaki [1]. For computational experiments, the author calibrates the parameters of typical learning models for each subject and then pursues round robin competitions. The main findings are in the following: First, the subjects who played not differently from the mixed-strategy Nash equilibrium (MSE prediction tended to made use of not only their choices but also the game outcomes. Meanwhile those who deviated from the MSE prediction took care of only their choices as the complexity of the game increased. Second, the heterogeneity of player strategies depends on both the number of players (N and the upper limit (M. Third, when groups consist of different agents like in the earlier laboratory experiment, sticking behavior is quite effective to win.
International Nuclear Information System (INIS)
Binh, Do Quang; Huy, Ngo Quang; Hai, Nguyen Hoang
2014-01-01
This paper presents a new approach based on a binary mixed integer coded genetic algorithm in conjunction with the weighted sum method for multi-objective optimization of fuel loading patterns for nuclear research reactors. The proposed genetic algorithm works with two types of chromosomes: binary and integer chromosomes, and consists of two types of genetic operators: one working on binary chromosomes and the other working on integer chromosomes. The algorithm automatically searches for the most suitable weighting factors of the weighting function and the optimal fuel loading patterns in the search process. Illustrative calculations are implemented for a research reactor type TRIGA MARK II loaded with the Russian VVR-M2 fuels. Results show that the proposed genetic algorithm can successfully search for both the best weighting factors and a set of approximate optimal loading patterns that maximize the effective multiplication factor and minimize the power peaking factor while satisfying operational and safety constraints for the research reactor.
Energy Technology Data Exchange (ETDEWEB)
Jiao, Yi, E-mail: jiaoyi@ihep.ac.cn; Duan, Zhe
2017-01-01
In a diffraction-limited storage ring, half integer resonances can have strong effects on the beam dynamics, associated with the large detuning terms from the strong focusing and strong sextupoles as required for an ultralow emittance. In this study, the limitation of half integer resonances on the available momentum acceptance (MA) was statistically analyzed based on one design of the High Energy Photon Source (HEPS). It was found that the probability of MA reduction due to crossing of half integer resonances is closely correlated with the level of beta beats at the nominal tunes, but independent of the error sources. The analysis indicated that for the presented HEPS lattice design, the rms amplitude of beta beats should be kept below 1.5% horizontally and 2.5% vertically to reach a small MA reduction probability of about 1%.
Energy Technology Data Exchange (ETDEWEB)
Binh, Do Quang [University of Technical Education Ho Chi Minh City (Viet Nam); Huy, Ngo Quang [University of Industry Ho Chi Minh City (Viet Nam); Hai, Nguyen Hoang [Centre for Research and Development of Radiation Technology, Ho Chi Minh City (Viet Nam)
2014-12-15
This paper presents a new approach based on a binary mixed integer coded genetic algorithm in conjunction with the weighted sum method for multi-objective optimization of fuel loading patterns for nuclear research reactors. The proposed genetic algorithm works with two types of chromosomes: binary and integer chromosomes, and consists of two types of genetic operators: one working on binary chromosomes and the other working on integer chromosomes. The algorithm automatically searches for the most suitable weighting factors of the weighting function and the optimal fuel loading patterns in the search process. Illustrative calculations are implemented for a research reactor type TRIGA MARK II loaded with the Russian VVR-M2 fuels. Results show that the proposed genetic algorithm can successfully search for both the best weighting factors and a set of approximate optimal loading patterns that maximize the effective multiplication factor and minimize the power peaking factor while satisfying operational and safety constraints for the research reactor.
A Nanodroplet Processor for Advanced Microencapsulated Drug Formulations, Phase II
National Aeronautics and Space Administration — During this Phase II program we propose to build on the key aspects of the nanodroplet encapsulation technology to demonstrate optimized formulation and...
Zbožínek, Adam
2009-01-01
Tato práce uvádí základní pravidla a předpoklady pro konstrukci a použití vozů formule 1. Hlavní zaměření je na aerodynamiku, která je nejdůležitější disciplínou v tomto motoristickém sportu, dále je tato práce zaměřena na základní faktory týkající se motoru vozu, kol, nové technologie KERS a provedení volantu. This work shows basic rules and conditions for construction and use of cars formula 1. The main part of this work focus on the aerodynamics which is the most important discipline of...
Assessment of strategy formulation
DEFF Research Database (Denmark)
Acur, Nuran; Englyst, Linda
2006-01-01
of the success criteria through face-to-face interviews with 46 managers, workshops involving 40 managers, and two in-depth case studies. The success criteria have been slightly modified due to the empirical results, to yield the assessment tool. Findings – The resulting assessment tool integrates three generic...... approaches to strategy assessment, namely the goal-centred, comparative and improvement approaches, as found in the literature. Furthermore, it encompasses three phases of strategy formulation processes: strategic thinking, strategic planning and embedding of strategy. The tool reflects that the different......, but cases and managerial perceptions indicate that the need for accurate and detailed plans might be overrated in the literature, as implementation relies heavily on continuous improvement and empowerment. Concerning embedding, key aspects relate both to the goal-centred and improvement approaches, while...
Yu, Xuefei; Lin, Liangzhuo; Shen, Jie; Chen, Zhi; Jian, Jun; Li, Bin; Xin, Sherman Xuegang
2018-01-01
The mean amplitude of glycemic excursions (MAGE) is an essential index for glycemic variability assessment, which is treated as a key reference for blood glucose controlling at clinic. However, the traditional "ruler and pencil" manual method for the calculation of MAGE is time-consuming and prone to error due to the huge data size, making the development of robust computer-aided program an urgent requirement. Although several software products are available instead of manual calculation, poor agreement among them is reported. Therefore, more studies are required in this field. In this paper, we developed a mathematical algorithm based on integer nonlinear programming. Following the proposed mathematical method, an open-code computer program named MAGECAA v1.0 was developed and validated. The results of the statistical analysis indicated that the developed program was robust compared to the manual method. The agreement among the developed program and currently available popular software is satisfied, indicating that the worry about the disagreement among different software products is not necessary. The open-code programmable algorithm is an extra resource for those peers who are interested in the related study on methodology in the future.
Canonical formulation of general-relativistic theories
International Nuclear Information System (INIS)
Bergmann, P.G.
1987-01-01
With the birth of quantum field theory in the late twenties physicists decided that nature could not be half classical and half quantum, and that the gravitational field ought to be quanticized, just as the electromagnetic field had been. One could accept the group of differomorphisms as a fundamental characteristic of general relativity (and indeed of all general-relativistic theories), and proceed to construct a quantum field-theory that was adapted to that group. Quantization would be attempted by way of a Hamiltonian formulation of the (classical) theory, and quantum commutation relations be patterned after the Poisson brackets arising in that formulation. This program is usually called the canonical quantization program, whereas the weak-field approach is known as covariant quantization. The first steps, conceived entirely within the framework of the classical theory, turned out to be beset with technical and conceptual difficulties, which today are essentially resolved. In this paper the author traces out these initial steps
Non-linear time series extreme events and integer value problems
Turkman, Kamil Feridun; Zea Bermudez, Patrícia
2014-01-01
This book offers a useful combination of probabilistic and statistical tools for analyzing nonlinear time series. Key features of the book include a study of the extremal behavior of nonlinear time series and a comprehensive list of nonlinear models that address different aspects of nonlinearity. Several inferential methods, including quasi likelihood methods, sequential Markov Chain Monte Carlo Methods and particle filters, are also included so as to provide an overall view of the available tools for parameter estimation for nonlinear models. A chapter on integer time series models based on several thinning operations, which brings together all recent advances made in this area, is also included. Readers should have attended a prior course on linear time series, and a good grasp of simulation-based inferential methods is recommended. This book offers a valuable resource for second-year graduate students and researchers in statistics and other scientific areas who need a basic understanding of nonlinear time ...
2D massless QED Hall half-integer conductivity and graphene
International Nuclear Information System (INIS)
Martínez, A Pérez; Querts, E Rodriguez; Rojas, H Pérez; Gaitan, R; Rodriguez-Romo, S
2011-01-01
Starting from the photon self-energy tensor in a magnetized medium, the 3D complete antisymmetric form of the conductivity tensor is found in the static limit of a fermion system C-non-invariant under fermion–antifermion exchange. The massless relativistic 2D fermion limit in QED is derived by using the compactification along the dimension parallel to the magnetic field. In the static limit and at zero temperature, the main features of the quantum Hall effect (QHE) are obtained: the half-integer QHE and the minimum value proportional to e 2 /h for the Hall conductivity. For typical values of graphene the plateaus of the Hall conductivity are also reproduced. (paper)
Comparison on Integer Wavelet Transforms in Spherical Wavelet Based Image Based Relighting
Institute of Scientific and Technical Information of China (English)
WANGZe; LEEYin; LEUNGChising; WONGTientsin; ZHUYisheng
2003-01-01
To provide a good quality rendering in the Image based relighting (IBL) system, tremendous reference images under various illumination conditions are needed. Therefore data compression is essential to enable interactive action. And the rendering speed is another crucial consideration for real applications. Based on Spherical wavelet transform (SWT), this paper presents a quick representation method with Integer wavelet transform (IWT) for the IBL system. It focuses on comparison on different IWTs with the Embedded zerotree wavelet (EZW) used in the IBL system. The whole compression procedure contains two major compression steps. Firstly, SWT is applied to consider the correlation among different reference images. Secondly, the SW transformed images are compressed with IWT based image compression approach. Two IWTs are used and good results are showed in the simulations.
Load Frequency Control in Microgrids Based on a Stochastic Non-Integer Controller
DEFF Research Database (Denmark)
Khooban, Mohammad-Hassan; Niknam, Taher; Shasadeghi, Mokhtar
2018-01-01
of battery energy storage systems (BESS) can solve the unbalance effects between the load and supply of an isolated MG, their high cost and tendency toward degradation are restrictive factors, which call for the use of alternative power balancing options. In recent years, the concept of utilizing the BESSs...... of EVs, also known as vehicle-to-grid (V2G) concept, for frequency support of MGs has attracted a lot of attention. In order to allow the V2G controller operate optimally under a wide range of operation conditions caused by the intermittent behavior of renewable energy resources (RESs), a new multi...... hole optimization algorithm (MBHA) is utilized for the adaptive tuning of the non-integer fuzzy PID controller coefficients. The performance of the proposed LFC is evaluated by using real world wind and solar radiation data. Finally, the extensive studies and hardware-in-the-loop (HIL) simulations...
On the group of substitutions of formal power series with integer coefficients
International Nuclear Information System (INIS)
Babenko, I K; Bogatyi, S A
2008-01-01
We study certain properties of the group J(Z) of substitutions of formal power series in one variable with integer coefficients. We show that J(Z), regarded as a topological group, has four generators and cannot be generated by fewer elements. In particular, we show that the one-dimensional continuous homology of J(Z) is isomorphic to Z oplus Z oplus Z 2 oplus Z 2 . We study various topological and geometric properties of the coset space J(R)/J(Z). We compute the real cohomology H-tilde*(J(Z);R) with uniformly locally constant supports and show that it is naturally isomorphic to the cohomology of the nilpotent part of the Lie algebra of formal vector fields on the line
Two-Part Models for Fractional Responses Defined as Ratios of Integers
Directory of Open Access Journals (Sweden)
Harald Oberhofer
2014-09-01
Full Text Available This paper discusses two alternative two-part models for fractional response variables that are defined as ratios of integers. The first two-part model assumes a Binomial distribution and known group size. It nests the one-part fractional response model proposed by Papke and Wooldridge (1996 and, thus, allows one to apply Wald, LM and/or LR tests in order to discriminate between the two models. The second model extends the first one by allowing for overdispersion in the data. We demonstrate the usefulness of the proposed two-part models for data on the 401(k pension plan participation rates used in Papke and Wooldridge (1996.
A wavelet-based ECG delineation algorithm for 32-bit integer online processing.
Di Marco, Luigi Y; Chiari, Lorenzo
2011-04-03
Since the first well-known electrocardiogram (ECG) delineator based on Wavelet Transform (WT) presented by Li et al. in 1995, a significant research effort has been devoted to the exploitation of this promising method. Its ability to reliably delineate the major waveform components (mono- or bi-phasic P wave, QRS, and mono- or bi-phasic T wave) would make it a suitable candidate for efficient online processing of ambulatory ECG signals. Unfortunately, previous implementations of this method adopt non-linear operators such as root mean square (RMS) or floating point algebra, which are computationally demanding. This paper presents a 32-bit integer, linear algebra advanced approach to online QRS detection and P-QRS-T waves delineation of a single lead ECG signal, based on WT. The QRS detector performance was validated on the MIT-BIH Arrhythmia Database (sensitivity Se = 99.77%, positive predictive value P+ = 99.86%, on 109010 annotated beats) and on the European ST-T Database (Se = 99.81%, P+ = 99.56%, on 788050 annotated beats). The ECG delineator was validated on the QT Database, showing a mean error between manual and automatic annotation below 1.5 samples for all fiducial points: P-onset, P-peak, P-offset, QRS-onset, QRS-offset, T-peak, T-offset, and a mean standard deviation comparable to other established methods. The proposed algorithm exhibits reliable QRS detection as well as accurate ECG delineation, in spite of a simple structure built on integer linear algebra.
Solid state NMR, basic theory and recent progress for quadrupole nuclei with half-integer spin
International Nuclear Information System (INIS)
Dieter, F.
1998-01-01
This review describes the basic theory and some recently developed techniques for the study of quadrupole nuclei with half integer spins in powder materials. The latter is connected to the introduction of the double rotation (DOR) by A. Samoson et al. (1) and to the introduction of the multiple quantum magic-angle spinning (MQ MAS) technique by L. Frydman et. al. (2). For integer spins, especially the solid-state deuterium magnetic resonance, we refer to the review of G.L. Hoatson and R.L. Vold: '' 2 H-NMR Spectroscopy of Solids and Liquid Crystals'' (3). For single crystals we refer to O. Kanert and M. Mehring: ''Static quadrupole effects in disordered cubic solids''(4) and we would like also to mention the ''classic'' review of M.H. Cohen and F. Reif: ''Quadrupole effects in NMR studies of solids'' (5). Some more recent reviews in the field under study are D. Freude and J. Haase ''Quadrupole effects in solid-state NMR'' (6). Ch. Jager: ''Satellite Transition Spectroscopy of Quadrupolar Nuclei'' (7) and B.F. Chmelka and J.W. Zwanziger: ''Solid State NMR Line Narrowing Methods for Quadrupolar Nuclei - Double Rotation and Dynamic-Angle Spinning'' (8). A survey of nuclear quadrupole frequency data published before the end of 1982 is given by H. Chihara and N. Nakamura in Landolt-Bornstein, Vol. 20 (9). Values of the chemical shift of quadrupole nuclei in solids can be found in books such as ''Multinuclear NMR'' edited by J. Mason (10). In section 9 of ref (6) some electric field gradient and chemical shift data published from 1983 to 1992 for the most studied quadrupole nuclei sup 27 Al, sup 23 Na, and sup 17 O are given
ARIADNE 3. A Monte Carlo for QCD cascades in the colour dipole formulation
International Nuclear Information System (INIS)
Loennblad, Leif.
1989-06-01
A Monte Carlo program for generating QCD cascades, based on the colour dipole approximation is presented. The program is an extension of the program ARIADNE 2, including gluon splitting in the colour dipole formulation of QCD. (author)
Baseline LAW Glass Formulation Testing
International Nuclear Information System (INIS)
Kruger, Albert A.; Mooers, Cavin; Bazemore, Gina; Pegg, Ian L.; Hight, Kenneth; Lai, Shan Tao; Buechele, Andrew; Rielley, Elizabeth; Gan, Hao; Muller, Isabelle S.; Cecil, Richard
2013-01-01
The major objective of the baseline glass formulation work was to develop and select glass formulations that are compliant with contractual and processing requirements for each of the LAW waste streams. Other objectives of the work included preparation and characterization of glasses with respect to the properties of interest, optimization of sulfate loading in the glasses, evaluation of ability to achieve waste loading limits, testing to demonstrate compatibility of glass melts with melter materials of construction, development of glass formulations to support ILAW qualification activities, and identification of glass formulation issues with respect to contract specifications and processing requirements
International Nuclear Information System (INIS)
Koide, Yoshihiko; Ishida, Shin-ichi; Sakasai, Akira
1991-03-01
A particular role of integer-mode rational surfaces on the formation of peaked T i (r) and V t (r) is observed. In the case of JT-60 hot-ion regime, the plasma spontaneously changes its peaking region from the inside of q=2 surface to that of broader q=3 surface. (author)
Buchmann, J.; Cabarcas, D.; Göpfert, F.; Hülsing, A.T.; Weiden, P.; Lange, T.; Lauter, K.; Lisonek, P.
2014-01-01
Several lattice-based cryptosystems require to sample from a discrete Gaussian distribution over the integers. Existing methods to sample from such a distribution either need large amounts of memory or they are very slow. In this paper we explore a different method that allows for a flexible
Directory of Open Access Journals (Sweden)
Tyszka Apoloniusz
2017-03-01
Full Text Available Let Bn = {xi · xj = xk : i, j, k ∈ {1, . . . , n}} ∪ {xi + 1 = xk : i, k ∈ {1, . . . , n}} denote the system of equations in the variables x1, . . . , xn. For a positive integer n, let _(n denote the smallest positive integer b such that for each system of equations S ⊆ Bn with a unique solution in positive integers x1, . . . , xn, this solution belongs to [1, b]n. Let g(1 = 1, and let g(n + 1 = 22g(n for every positive integer n. We conjecture that ξ (n 6 g(2n for every positive integer n. We prove: (1 the function ξ : N \\ {0} → N \\ {0} is computable in the limit; (2 if a function f : N \\ {0} → N \\ {0} has a single-fold Diophantine representation, then there exists a positive integer m such that f (n m; (3 the conjecture implies that there exists an algorithm which takes as input a Diophantine equation D(x1, . . . , xp = 0 and returns a positive integer d with the following property: for every positive integers a1, . . . , ap, if the tuple (a1, . . . , ap solely solves the equation D(x1, . . . , xp = 0 in positive integers, then a1, . . . , ap 6 d; (4 the conjecture implies that if a set M ⊆ N has a single-fold Diophantine representation, then M is computable; (5 for every integer n > 9, the inequality ξ (n < (22n−5 − 12n−5 + 1 implies that 22n−5 + 1 is composite.
Symbolic Game Semantics for Model Checking Program Families
DEFF Research Database (Denmark)
Dimovski, Aleksandar
2016-01-01
represent program families with infinite integers as so-called (finite-state) featured symbolic automata. Specifically designed model checking algorithms are then employed to verify safety of all programs from a family at once and pinpoint those programs that are unsafe (respectively, safe). We present...... a prototype tool implementing this approach, and we illustrate it with several examples....
Dual Dynamic Programming - DDP
International Nuclear Information System (INIS)
Velasquez Bermudez, Jesus M
1998-01-01
Objections are presented to the mathematical formulation of the denominated Dual Dynamic programming-PDD that is the theoretical base of several computational model available for the optimal formulation of interconnected hydrothermal systems
NEWTONP - CUMULATIVE BINOMIAL PROGRAMS
Bowerman, P. N.
1994-01-01
The cumulative binomial program, NEWTONP, is one of a set of three programs which calculate cumulative binomial probability distributions for arbitrary inputs. The three programs, NEWTONP, CUMBIN (NPO-17555), and CROSSER (NPO-17557), can be used independently of one another. NEWTONP can be used by statisticians and users of statistical procedures, test planners, designers, and numerical analysts. The program has been used for reliability/availability calculations. NEWTONP calculates the probably p required to yield a given system reliability V for a k-out-of-n system. It can also be used to determine the Clopper-Pearson confidence limits (either one-sided or two-sided) for the parameter p of a Bernoulli distribution. NEWTONP can determine Bayesian probability limits for a proportion (if the beta prior has positive integer parameters). It can determine the percentiles of incomplete beta distributions with positive integer parameters. It can also determine the percentiles of F distributions and the midian plotting positions in probability plotting. NEWTONP is designed to work well with all integer values 0 < k <= n. To run the program, the user simply runs the executable version and inputs the information requested by the program. NEWTONP is not designed to weed out incorrect inputs, so the user must take care to make sure the inputs are correct. Once all input has been entered, the program calculates and lists the result. It also lists the number of iterations of Newton's method required to calculate the answer within the given error. The NEWTONP program is written in C. It was developed on an IBM AT with a numeric co-processor using Microsoft C 5.0. Because the source code is written using standard C structures and functions, it should compile correctly with most C compilers. The program format is interactive. It has been implemented under DOS 3.2 and has a memory requirement of 26K. NEWTONP was developed in 1988.
Instantaneous and controllable integer ambiguity resolution: review and an alternative approach
Zhang, Jingyu; Wu, Meiping; Li, Tao; Zhang, Kaidong
2015-11-01
In the high-precision application of Global Navigation Satellite System (GNSS), integer ambiguity resolution is the key step to realize precise positioning and attitude determination. As the necessary part of quality control, integer aperture (IA) ambiguity resolution provides the theoretical and practical foundation for ambiguity validation. It is mainly realized by acceptance testing. Due to the constraint of correlation between ambiguities, it is impossible to realize the controlling of failure rate according to analytical formula. Hence, the fixed failure rate approach is implemented by Monte Carlo sampling. However, due to the characteristics of Monte Carlo sampling and look-up table, we have to face the problem of a large amount of time consumption if sufficient GNSS scenarios are included in the creation of look-up table. This restricts the fixed failure rate approach to be a post process approach if a look-up table is not available. Furthermore, if not enough GNSS scenarios are considered, the table may only be valid for a specific scenario or application. Besides this, the method of creating look-up table or look-up function still needs to be designed for each specific acceptance test. To overcome these problems in determination of critical values, this contribution will propose an instantaneous and CONtrollable (iCON) IA ambiguity resolution approach for the first time. The iCON approach has the following advantages: (a) critical value of acceptance test is independently determined based on the required failure rate and GNSS model without resorting to external information such as look-up table; (b) it can be realized instantaneously for most of IA estimators which have analytical probability formulas. The stronger GNSS model, the less time consumption; (c) it provides a new viewpoint to improve the research about IA estimation. To verify these conclusions, multi-frequency and multi-GNSS simulation experiments are implemented. Those results show that IA
International Nuclear Information System (INIS)
Jannati, Jamil; Nazarpour, Daryoosh
2017-01-01
Highlights: • Energy management of IPL is considered in the presence of wind turbine and PV system. • The optimal charge and discharge powers of EVs, dispatch power of LDG are determined. • Charging/discharging decisions of electrolyser and fuel cell are determined. • Demand response program is used to manage the peak load to reduce the operation cost. • Global optimal is guaranteed in proposed model by mixed-integer linear programming. - Abstract: Nowadays, utilization of distributed generation sources and electric vehicles (EVs) are increased to reduce air pollution and greenhouse gas emissions. Also, intelligent parking lots (IPL) are increased in response to the increase in the number of EVs. Therefore, optimal operation of distributed generation sources and IPL in the power market without technical scheduling will follow some economic problems for the owner of IPL and some technical problems for the operator of distribution network. Therefore, in this paper, an optimal energy management has been proposed for an IPL which includes renewable energy sources (wind turbine and photovoltaic system) and local dispatchable generators (micro-turbines). Also, determination of optimal charge and discharge powers of hydrogen storage system (HSS) containing electrolyser, hydrogen storage tanks and fuel cell has been considered in the proposed model. Furthermore, the time-of-use rates of demand response program are proposed to flatten the load curve to reduce the operation cost of IPL. The objective function includes minimizing the operation costs of upstream grid and local dispatchable generators as well as charging and discharging cost of IPL subject to the technical and physical constraints under demand response program in the presence of HSS. The proposed model is formulated as a mixed-integer linear programming and solved using GAMS optimization software under CPLEX solver. Four case studies are investigated to validate the proposed model to show the positive
Newton/Poisson-Distribution Program
Bowerman, Paul N.; Scheuer, Ernest M.
1990-01-01
NEWTPOIS, one of two computer programs making calculations involving cumulative Poisson distributions. NEWTPOIS (NPO-17715) and CUMPOIS (NPO-17714) used independently of one another. NEWTPOIS determines Poisson parameter for given cumulative probability, from which one obtains percentiles for gamma distributions with integer shape parameters and percentiles for X(sup2) distributions with even degrees of freedom. Used by statisticians and others concerned with probabilities of independent events occurring over specific units of time, area, or volume. Program written in C.
Novel Formulations for Antimicrobial Peptides
Directory of Open Access Journals (Sweden)
Ana Maria Carmona-Ribeiro
2014-10-01
Full Text Available Peptides in general hold much promise as a major ingredient in novel supramolecular assemblies. They may become essential in vaccine design, antimicrobial chemotherapy, cancer immunotherapy, food preservation, organs transplants, design of novel materials for dentistry, formulations against diabetes and other important strategical applications. This review discusses how novel formulations may improve the therapeutic index of antimicrobial peptides by protecting their activity and improving their bioavailability. The diversity of novel formulations using lipids, liposomes, nanoparticles, polymers, micelles, etc., within the limits of nanotechnology may also provide novel applications going beyond antimicrobial chemotherapy.
Novel Formulations for Antimicrobial Peptides
Carmona-Ribeiro, Ana Maria; Carrasco, Letícia Dias de Melo
2014-01-01
Peptides in general hold much promise as a major ingredient in novel supramolecular assemblies. They may become essential in vaccine design, antimicrobial chemotherapy, cancer immunotherapy, food preservation, organs transplants, design of novel materials for dentistry, formulations against diabetes and other important strategical applications. This review discusses how novel formulations may improve the therapeutic index of antimicrobial peptides by protecting their activity and improving their bioavailability. The diversity of novel formulations using lipids, liposomes, nanoparticles, polymers, micelles, etc., within the limits of nanotechnology may also provide novel applications going beyond antimicrobial chemotherapy. PMID:25302615
Cumulative Poisson Distribution Program
Bowerman, Paul N.; Scheuer, Ernest M.; Nolty, Robert
1990-01-01
Overflow and underflow in sums prevented. Cumulative Poisson Distribution Program, CUMPOIS, one of two computer programs that make calculations involving cumulative Poisson distributions. Both programs, CUMPOIS (NPO-17714) and NEWTPOIS (NPO-17715), used independently of one another. CUMPOIS determines cumulative Poisson distribution, used to evaluate cumulative distribution function (cdf) for gamma distributions with integer shape parameters and cdf for X (sup2) distributions with even degrees of freedom. Used by statisticians and others concerned with probabilities of independent events occurring over specific units of time, area, or volume. Written in C.
Post, Evert Jan
1999-05-01
This essay presents conclusive evidence of the impermissibility of Copenhagen's single system interpretation of the Schroedinger process. The latter needs to be viewed as a tool exclusively describing phase and orientation randomized ensembles and is not be used for isolated single systems. Asymptotic closeness of single system and ensemble behavior and the rare nature of true single system manifestations have prevented a definitive identification of this Copenhagen deficiency over the past three quarter century. Quantum uncertainty so becomes a basic trade mark of phase and orientation disordered ensembles. The ensuing void of usable single system tools opens a new inquiry for tools without statistical connotations. Three, in part already known, period integrals here identified as flux, charge and action counters emerge as diffeo-4 invariant tools fully compatible with the demands of the general theory of relativity. The discovery of the quantum Hall effect has been instrumental in forcing a distinction between ensemble disorder as in the normal Hall effect versus ensemble order in the plateau states. Since the order of the latter permits a view of the plateau states as a macro- or meso-scopic single system, the period integral description applies, yielding a straightforward unified description of integer and fractional quantum Hall effects.
Robust integer and fractional helical modes in the quantum Hall effect
Ronen, Yuval; Cohen, Yonatan; Banitt, Daniel; Heiblum, Moty; Umansky, Vladimir
2018-04-01
Electronic systems harboring one-dimensional helical modes, where spin and momentum are locked, have lately become an important field of their own. When coupled to a conventional superconductor, such systems are expected to manifest topological superconductivity; a unique phase hosting exotic Majorana zero modes. Even more interesting are fractional helical modes, yet to be observed, which open the route for realizing generalized parafermions. Possessing non-Abelian exchange statistics, these quasiparticles may serve as building blocks in topological quantum computing. Here, we present a new approach to form protected one-dimensional helical edge modes in the quantum Hall regime. The novel platform is based on a carefully designed double-quantum-well structure in a GaAs-based system hosting two electronic sub-bands; each tuned to the quantum Hall effect regime. By electrostatic gating of different areas of the structure, counter-propagating integer, as well as fractional, edge modes with opposite spins are formed. We demonstrate that, due to spin protection, these helical modes remain ballistic over large distances. In addition to the formation of helical modes, this platform can serve as a rich playground for artificial induction of compounded fractional edge modes, and for construction of edge-mode-based interferometers.
Superluminal tunneling of a relativistic half-integer spin particle through a potential barrier
Directory of Open Access Journals (Sweden)
Nanni Luca
2017-11-01
Full Text Available This paper investigates the problem of a relativistic Dirac half-integer spin free particle tunneling through a rectangular quantum-mechanical barrier. If the energy difference between the barrier and the particle is positive, and the barrier width is large enough, there is proof that the tunneling may be superluminal. For first spinor components of particle and antiparticle states, the tunneling is always superluminal regardless the barrier width. Conversely, the second spinor components of particle and antiparticle states may be either subluminal or superluminal depending on the barrier width. These results derive from studying the tunneling time in terms of phase time. For the first spinor components of particle and antiparticle states, it is always negative while for the second spinor components of particle and antiparticle states, it is always positive, whatever the height and width of the barrier. In total, the tunneling time always remains positive for particle states while it becomes negative for antiparticle ones. Furthermore, the phase time tends to zero, increasing the potential barrier both for particle and antiparticle states. This agrees with the interpretation of quantum tunneling that the Heisenberg uncertainty principle provides. This study’s results are innovative with respect to those available in the literature. Moreover, they show that the superluminal behaviour of particles occurs in those processes with high-energy confinement.
Budi Darmayasa, Jero; Wahyudin; Mulyana, Tatang; Subali Noto, Muchamad
2018-04-01
Ethnomathematicsis considered as a new study in mathematic education. As a study, numerous regions in this world starts to explore through ethnomathematics, including Indonesia. As the intersection between mathematics and mathematical modelling and culture, ethnomathematics exists in various society’s cultural elements, including in the Balinese Hindus’ festivities. To find the mathematical concept used in determining the festivity days, the researcher(s) conducted ethnographic research in Bali Mula society in Kintamani District, Bali. Participation observation, in-depth interview, and literature and documentation were used in collecting the data. As the result, the researcher(s) revealed that the mathematical concept used is integer operations, least common multiple, mixed fraction, and number sequences. Since it contains mathematical concept used in junior high, thus ethnomathematics of “4-hindu’s festivities” may be used as context in mathematics learning. By using ethnomathematics as the context, the researcher(s) expect that it will help teachers in motivation their students to learn mathematics.
Quantum simulation of the integer factorization problem: Bell states in a Penning trap
Rosales, Jose Luis; Martin, Vicente
2018-03-01
The arithmetic problem of factoring an integer N can be translated into the physics of a quantum device, a result that supports Pólya's and Hilbert's conjecture to demonstrate Riemann's hypothesis. The energies of this system, being univocally related to the factors of N , are the eigenvalues of a bounded Hamiltonian. Here we solve the quantum conditions and show that the histogram of the discrete energies, provided by the spectrum of the system, should be interpreted in number theory as the relative probability for a prime to be a factor candidate of N . This is equivalent to a quantum sieve that is shown to require only o (ln√{N}) 3 energy measurements to solve the problem, recovering Shor's complexity result. Hence the outcome can be seen as a probability map that a pair of primes solve the given factorization problem. Furthermore, we show that a possible embodiment of this quantum simulator corresponds to two entangled particles in a Penning trap. The possibility to build the simulator experimentally is studied in detail. The results show that factoring numbers, many orders of magnitude larger than those computed with experimentally available quantum computers, is achievable using typical parameters in Penning traps.
Sahasrabudhe, Harshad; Fallahi, Saeed; Nakamura, James; Povolotskyi, Michael; Novakovic, Bozidar; Rahman, Rajib; Manfra, Michael; Klimeck, Gerhard
Quantum Point Contacts (QPCs) are extensively used in semiconductor devices for charge sensing, tunneling and interference experiments. Fabry-Pérot interferometers containing 2 QPCs have applications in quantum computing, in which electrons/quasi-particles undergo interference due to back-scattering from the QPCs. Such experiments have turned out to be difficult because of the complex structure of edge states near the QPC boundary. We present realistic simulations of the edge states in QPCs based on GaAs/AlGaAs heterostructures, which can be used to predict conductance and edge state velocities. Conduction band profile is obtained by solving decoupled effective mass Schrödinger and Poisson equations self-consistently on a finite element mesh of a realistic geometry. In the integer quantum Hall regime, we obtain compressible and in-compressible regions near the edges. We then use the recursive Green`s function algorithm to solve Schrödinger equation with open boundary conditions for calculating transmission and local current density in the QPCs. Impurities are treated by inserting bumps in the potential with a Gaussian distribution. We compare observables with experiments for fitting some adjustable parameters. The authors would like to thank Purdue Research Foundation and Purdue Center for Topological Materials for their support.
Optimization of edge state velocity in the integer quantum Hall regime
Sahasrabudhe, H.; Novakovic, B.; Nakamura, J.; Fallahi, S.; Povolotskyi, M.; Klimeck, G.; Rahman, R.; Manfra, M. J.
2018-02-01
Observation of interference in the quantum Hall regime may be hampered by a small edge state velocity due to finite phase coherence time. Therefore designing two quantum point contact (QPCs) interferometers having a high edge state velocity is desirable. Here we present a new simulation method for designing heterostructures with high edge state velocity by realistically modeling edge states near QPCs in the integer quantum Hall effect (IQHE) regime. Using this simulation method, we also predict the filling factor at the center of QPCs and their conductance at different gate voltages. The 3D Schrödinger equation is split into 1D and 2D parts. Quasi-1D Schrödinger and Poisson equations are solved self-consistently in the IQHE regime to obtain the potential profile, and quantum transport is used to solve for the edge state wave functions. The velocity of edge states is found to be /B , where is the expectation value of the electric field for the edge state. Anisotropically etched trench gated heterostructures with double-sided delta doping have the highest edge state velocity among the structures considered.
Neonates need tailored drug formulations.
Allegaert, Karel
2013-02-08
Drugs are very strong tools used to improve outcome in neonates. Despite this fact and in contrast to tailored perfusion equipment, incubators or ventilators for neonates, we still commonly use drug formulations initially developed for adults. We would like to make the point that drug formulations given to neonates need to be tailored for this age group. Besides the obvious need to search for active compounds that take the pathophysiology of the newborn into account, this includes the dosage and formulation. The dosage or concentration should facilitate the administration of low amounts and be flexible since clearance is lower in neonates with additional extensive between-individual variability. Formulations need to be tailored for dosage variability in the low ranges and also to the clinical characteristics of neonates. A specific focus of interest during neonatal drug development therefore is a need to quantify and limit excipient exposure based on the available knowledge of their safety or toxicity. Until such tailored vials and formulations become available, compounding practices for drug formulations in neonates should be evaluated to guarantee the correct dosing, product stability and safety.
Animal Diet Formulation with Floating Price
Directory of Open Access Journals (Sweden)
S.H Nasseri
2016-12-01
Full Text Available In the process of milk production, the highest cost relates to animal feed. Based on reports provided by the experts, around seventy percent of dairy livestock costs included feed costs. In order to minimize the total price of livestock feed, according to the limits of feed sources in each region or season, and also the transportation and maintenance costs and ultimately milk price reduction, optimization of the livestock nutrition program is an essential issue. Because of the uncertainty and lack of precision in the optimal food ration done with existing methods based on linear programming, there is a need to use appropriate methods to meet this purpose. Therefore, in this study formulation of completely mixed nutrient diets of dairy cows is done by using a fuzzy linear programming in early lactation. Application of fuzzy optimization method and floating price make it possible to formulate and change the completely mixed diets with adequate safety margins. Therefore, applications of fuzzy methods in feed rations of dairy cattle are recommended to optimize the diets. Obviously, it would be useful to design suitable software, which provides the possibility of using floating prices to set feed rations by the use of fuzzy optimization method.
International Nuclear Information System (INIS)
Wang, Bo; Deng, Zhihong; Wang, Shunting; Fu, Mengyin
2010-01-01
Loss of the satellite signal and noise disturbance will cause cycle slips to occur in the carrier phase observation of the attitude determination system using the global positioning system (GPS), especially in the dynamic situation. Therefore, in order to reject the error by cycle slips, the integer ambiguity should be re-computed. A motion model-based Kalman predictor is used for the ambiguity re-computation in dynamic applications. This method utilizes the correct observation of the last step to predict the current ambiguities. With the baseline length as a constraint to reject invalid values, we can solve the current integer ambiguity and the attitude angles, by substituting the obtained ambiguities into the constrained LAMBDA method. Experimental results demonstrate that the proposed method is more efficient in the dynamic situation, which takes less time to obtain new fixed ambiguities with a higher mean success rate