DOCSLIB.ORG

Photonic Resonances Boost Quantum Technology Page

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Photonic Resonances Boost Quantum Technology Page ZIB 2018 Annual Report PHOTONIC RESONANCES FAULT BOOST OPTIMIZATION TOLERANCE IN THE DEEP QUANTUM MEETS SUPER- DISTRIBUTED PARALLELISM TECHNOLOGY COMPUTING SYSTEMS CHALLENGE PAGE 28 PAGE 56 PAGE 64 PAGE 74 Preface PREFACE According to our web page, “ZIB This way of doing research has made new level thus requires novel forms of is an interdisciplinary research ZIB strong; an internationally renowned data-augmented MSO to enable more institute for application-oriented research institute with quite a unique precise quantitative mathematical mod- mathematics and data-intensive profile. Since the definition of its new eling of real-world processes, gaining high-performance computing. Its research strategy and development plan deeper insights, improving predictions, research focuses on modeling, sim- in 2015, the profile of ZIB has started and thus supporting decision-making. ulation, and optimization (MSO) to change, mainly in order to take up In 2018, several crucial milestones of with scientific cooperation partners new challenges and utilize the related ZIB’s development plan were reached: from academia and industry.” In our opportunities. the Berlin-based MATH+ Cluster of understanding, application-oriented One of the main challenges is the Excellence was successful in German’s mathematics does not mean just exponentially growing amount of data most important funding line for research, solving mathematical problems that acquired by digital technology, promising the Excellence Strategy of the German appear in applications. Rather, ZIB unprecedented insights into nature, eco- federal and state governments. MATH+, pursues an integrated approach that nomics, and society. Today’s data wave a joint project of the three Berlin univer- combines efforts to describe the full is already revolutionizing many areas of sities, FU, HU, and TU, with WIAS and application problem in mathematical research and technology; some experts ZIB, will receive about €7.5 million fund- terms and to develop methods for its even predict that machine learning, ing per year for at least seven years. In its mathematical, as well as practical, especially deep learning, will replace core domain, application-oriented math- solution, including the required algo- mathematical modeling and analysis ematics, ten interdisciplinary research rithmic and computational methods. as the main driving force generating projects will be funded at ZIB that all This includes, in particular, the insights in scientific research. We believe are designed to take up the challenges translation back into the application that taming the growing complexity of described above (for more details, please fields in concerted efforts with the technological, cultural, and social pro- see the article “Berlin Mathematics is application partners. cesses demands the seamless integration Shaping the Future”). In part, MATH+ of both, advanced data analysis and MSO aims at continuing the success story of techniques. The challenge of raising the MATHEON research center, but with application-oriented mathematics to a a stronger focus on data-based research. 4 2018 Annual Report This will be complemented by the newly gives a general overview of ZIB’s organi- Challenge” reports on recent research of established Berlin Center for Machine zation and key factors for its successful ZIB and its partners on why mastering Learning (BCML), for which a Berlin- development. In particular, six feature the multiple levels of parallelism exposed based consortium including ZIB could articles highlight aspects of our work: by modern HPC systems is today the secure funding by the German Federal “How Mathematical Intelligence Can only way to achieve a sustained high Ministry of Education and Research Help with Your Knee Pain” provides an application performance. And “Fault (BMBF) in another nation-wide com- insight into how advanced data analysis Tolerance in Distributed Systems” shows petition (for more details please see and modern MSO techniques can be how researchers at ZIB study fault-tol- the article “Berlin Center for Machine combined to help address widespread erance approaches on different scales, Learning Established”). disease. In “Photonic Resonances ranging from the microlevel, byte-gran- In addition to the successful acquirement Boost Quantum Technology,” we report ular replication, to the macro-level, e.g., of MATH+ and BCML, the CRC 1114 and on recent research results at ZIB that check-pointing in exascale computing. TRR 154 DFG Collaborative Research provide insight into how quantum In summary, ZIB continues to be Centers, as well as the Berlin Big Data technology may be made possible based a place for excellent research and Center (BBDC), all with essential on nano-optical devices. “Optimization first-rate scientific services and infra- contribution by ZIB, were successfully Meets Supercomputing” sheds some structure. Last year was a fantastic evaluated in 2018 and will continue to lights on how hard combinatorial year for ZIB with key success stories be funded for four further years. ZIB’s structures can be tackled by parallel like the acquisition of the MATH+ participation in these centers, especially algorithms. The article “Digital Cultural Cluster of Excellence, which is set in MATH+, and the research funded Assets – digiS, or the Berlin Marvel” to have a positive impact on ZIB’s through it, contributes perfectly to the features the research agenda of the development for a decade and beyond, core research of our institute and to the “Research and Competence Centre as well as lots of other very positive ambitious strategic aims set out in 2015. Digitalization Berlin” (digiS) that, after developments that make us confident In this sense, 2018 was a pivotal step in six years of successful activity, was made that our institute has a bright future. ZIB’s development. permanent and institutionally anchored Berlin, May 2019 This annual report provides insights at ZIB, in itself a small cultural-polit- Christof Schütte into a variety of other success stories and ical miracle. “The Deep Parallelism President of ZIB Zuse Institute Berlin 5 28 PHOTONIC RESONANCES BOOST QUANTUM 4 TECHNOLOGY 36 ZUSE INSTITUTE HOW MATHEMATICAL BERLIN INTELLIGENCE Preface | Executive Summary | Organization | ZIB Structure | CAN HELP WITH ZIB in Numbers | Berlin Mathematics Is Shaping the Future | Berlin Center for YOUR KNEE PAIN Machine Learning Established | Economic Situation | Spin-Offs | Number of Employees CONTENTS 46 74 DIGITAL CULTURAL THE DEEP ASSETS – DIGIS OR PARALLELISM THE BERLIN MARVEL CHALLENGE 64 FAULT TOLERANCE IN DISTRIBUTED SYSTEMS 56 84 ZIB PUBLICATIONS OPTIMIZATION MEETS REFERENCES SUPERCOMPUTING IMPRINT Executive Summary EXECUTIVE SUMMARY MATHEMATICS FOR LIFE AND MATERIALS SCIENCES The year 2018 was marked by the requires raising application-oriented preparations for the MATH+ Cluster of mathematics to a new level. Nowadays, Excellence, the continuation of the DFG progress in the field requires an Collaborative Research Center 1114, and increased involvement of novel math- the associated priority shifts regarding ematical concepts, for example com- the division’s research activity. In recent putational topology in shape analysis years, ZIB’s Mathematics for Life and for medical imaging or geometry-based Materials Science division has con- methods in the computational identi- centrated its efforts on taking an inter- fication of nonlinear manifolds that nationally leading role in developing govern the effective dynamics of com- innovative application-oriented math- plex systems. In addition to the need ematics, moving beyond traditional for new mathematics, addressing the approaches to modeling, simulation, and challenges seems to require new forms data analysis for key technologies. Until of seamlessly merging classical model- recently, most of the division’s research and simulation-based approaches to had its roots in numerical mathematics machine learning and artificial intel- and scientific computing, as well as ligence. In 2018, the scientific divisions scientific visualization. of ZIB invested considerable effort into Today, many of the great challenges new projects exploring these directions originate from the growing complex- of research. Most of these new projects ity of technology and society, which will now be supported by MATH+ and 8 2018 Annual Report CRC 1114, but also by the new Berlin Center for Machine Learning funded by the German Ministry of Education and Research, based on an application of a scientific consortium including ZIB. The feature articles “How mathematical intelligence can help with your knee pain” and “Photonic resonances boost quantum technology” present some of these activities. The respective shift in our research orientation aims to establish new inter- actions between mathematics and new application fields, together with top- class Berlin experts and institutions, in areas such as social sciences and the humanities, revealing opportunities for cross-fertilization through joint interdisciplinary research endeavors and data-augmented approaches. Zuse Institute Berlin 9 Executive Summary MATHEMATICAL OPTIMIZATION AND SCIENTIFIC INFORMATION The integration of data-driven methods gas network operator. The develop- ond, and third prizes at the 2018 PACE into optimization approaches and the ments were also made possible by the competition, complementing a GOR increased use of supercomputing were initiation of Plan4res, a Horizon 2020 Thesis Award, an ATMOS Best Paper the major
Load more

Recommended publications
  • An Algorithm Based on Semidefinite Programming for Finding Minimax
    Takustr. 7 Zuse Institute Berlin 14195 Berlin Germany BELMIRO P.M. DUARTE,GUILLAUME SAGNOL,WENG KEE WONG An algorithm based on Semidefinite Programming for finding minimax optimal designs ZIB Report 18-01 (December 2017) Zuse Institute Berlin Takustr. 7 14195 Berlin Germany Telephone: +49 30-84185-0 Telefax: +49 30-84185-125 E-mail: [email protected] URL: http://www.zib.de ZIB-Report (Print) ISSN 1438-0064 ZIB-Report (Internet) ISSN 2192-7782 An algorithm based on Semidefinite Programming for finding minimax optimal designs Belmiro P.M. Duarte a,b, Guillaume Sagnolc, Weng Kee Wongd aPolytechnic Institute of Coimbra, ISEC, Department of Chemical and Biological Engineering, Portugal. bCIEPQPF, Department of Chemical Engineering, University of Coimbra, Portugal. cTechnische Universität Berlin, Institut für Mathematik, Germany. dDepartment of Biostatistics, Fielding School of Public Health, UCLA, U.S.A. Abstract An algorithm based on a delayed constraint generation method for solving semi- infinite programs for constructing minimax optimal designs for nonlinear models is proposed. The outer optimization level of the minimax optimization problem is solved using a semidefinite programming based approach that requires the de- sign space be discretized. A nonlinear programming solver is then used to solve the inner program to determine the combination of the parameters that yields the worst-case value of the design criterion. The proposed algorithm is applied to find minimax optimal designs for the logistic model, the flexible 4-parameter Hill homoscedastic model and the general nth order consecutive reaction model, and shows that it (i) produces designs that compare well with minimax D−optimal de- signs obtained from semi-infinite programming method in the literature; (ii) can be applied to semidefinite representable optimality criteria, that include the com- mon A−; E−; G−; I− and D-optimality criteria; (iii) can tackle design problems with arbitrary linear constraints on the weights; and (iv) is fast and relatively easy to use.
    [Show full text]
  • Solving Mixed Integer Linear and Nonlinear Problems Using the SCIP Optimization Suite
    Takustraße 7 Konrad-Zuse-Zentrum D-14195 Berlin-Dahlem fur¨ Informationstechnik Berlin Germany TIMO BERTHOLD GERALD GAMRATH AMBROS M. GLEIXNER STEFAN HEINZ THORSTEN KOCH YUJI SHINANO Solving mixed integer linear and nonlinear problems using the SCIP Optimization Suite Supported by the DFG Research Center MATHEON Mathematics for key technologies in Berlin. ZIB-Report 12-27 (July 2012) Herausgegeben vom Konrad-Zuse-Zentrum f¨urInformationstechnik Berlin Takustraße 7 D-14195 Berlin-Dahlem Telefon: 030-84185-0 Telefax: 030-84185-125 e-mail: [email protected] URL: http://www.zib.de ZIB-Report (Print) ISSN 1438-0064 ZIB-Report (Internet) ISSN 2192-7782 Solving mixed integer linear and nonlinear problems using the SCIP Optimization Suite∗ Timo Berthold Gerald Gamrath Ambros M. Gleixner Stefan Heinz Thorsten Koch Yuji Shinano Zuse Institute Berlin, Takustr. 7, 14195 Berlin, Germany, fberthold,gamrath,gleixner,heinz,koch,[email protected] July 31, 2012 Abstract This paper introduces the SCIP Optimization Suite and discusses the ca- pabilities of its three components: the modeling language Zimpl, the linear programming solver SoPlex, and the constraint integer programming frame- work SCIP. We explain how these can be used in concert to model and solve challenging mixed integer linear and nonlinear optimization problems. SCIP is currently one of the fastest non-commercial MIP and MINLP solvers. We demonstrate the usage of Zimpl, SCIP, and SoPlex by selected examples, give an overview of available interfaces, and outline plans for future development. ∗A Japanese translation of this paper will be published in the Proceedings of the 24th RAMP Symposium held at Tohoku University, Miyagi, Japan, 27{28 September 2012, see http://orsj.or.
    [Show full text]
  • Linear Underestimators for Bivariate Functions with a Fixed Convexity Behavior
    Takustraße 7 Konrad-Zuse-Zentrum D-14195 Berlin-Dahlem fur¨ Informationstechnik Berlin Germany MARTIN BALLERSTEINy AND DENNIS MICHAELSz AND STEFAN VIGERSKE Linear Underestimators for bivariate functions with a fixed convexity behavior This work is part of the Collaborative Research Centre “Integrated Chemical Processes in Liquid Multiphase Systems” (CRC/Transregio 63 “InPROMPT”) funded by the German Research Foundation (DFG). Main parts of this work has been finished while the second author was at the Institute for Operations Research at ETH Zurich and financially supported by DFG through CRC/Transregio 63. The first and second author thank the DFG for its financial support. Thethirdauthor was supported by the DFG Research Center MATHEON Mathematics for key technologies and the Research Campus MODAL Mathematical Optimization and Data Analysis Laboratories in Berlin. y Eidgenossische¨ Technische, Hochschule Zurich,¨ Institut fur¨ Operations Research, Ramistrasse¨ 101, 8092 Zurich (Switzerland) z Technische Universitat¨ Dortmund, Fakultat¨ fur¨ Mathematik, M/518, Vogelpothsweg 87, 44227 Dortmund (Germany) ZIB-Report 13-02 (revised) (February 2015) Herausgegeben vom Konrad-Zuse-Zentrum fur¨ Informationstechnik Berlin Takustraße 7 D-14195 Berlin-Dahlem Telefon: 030-84185-0 Telefax: 030-84185-125 e-mail: [email protected] URL: http://www.zib.de ZIB-Report (Print) ISSN 1438-0064 ZIB-Report (Internet) ISSN 2192-7782 Technical Report Linear Underestimators for bivariate functions with a fixed convexity behavior∗ A documentation for the SCIP constraint handler cons bivariate Martin Ballersteiny Dennis Michaelsz Stefan Vigerskex February 23, 2015 y Eidgenossische¨ Technische Hochschule Zurich¨ Institut fur¨ Operations Research Ramistrasse¨ 101, 8092 Zurich (Switzerland) z Technische Universitat¨ Dortmund Fakultat¨ fur¨ Mathematik, M/518 Vogelpothsweg 87, 44227 Dortmund (Germany) x Zuse Institute Berlin Takustr.
    [Show full text]
  • Nonlinear Programming Techniques for Operative Planning in Large Drinking Water Networks Jens Burgschweiger1, Bernd Gnädig2 and Marc C
    14 The Open Applied Mathematics Journal, 2009, 3, 14-28 Open Access Nonlinear Programming Techniques for Operative Planning in Large Drinking Water Networks Jens Burgschweiger1, Bernd Gnädig2 and Marc C. Steinbach3,* 1Berliner Wasserbetriebe, Abt. NA-G/W, 10864 Berlin, Germany 2Düsseldorf, Germany 3Leibniz Universität Hannover, IfAM, Welfengarten 1, 30167 Hannover, Germany Abstract: Mathematical decision support for operative planning in water supply systems is highly desirable; it leads, however, to very difficult optimization problems. We propose a nonlinear programming approach that yields practically satisfactory operating schedules in acceptable computing time even for large networks. Based on a carefully designed model supporting gradient-based optimization algorithms, this approach employs a special initialization strategy for convergence acceleration, special minimum up and down time constraints together with pump aggregation to handle switching decisions, and several network reduction techniques for further speed-up. Results for selected application scenarios at Berliner Wasserbetriebe demonstrate the success of the approach. Keywords: Water supply, large-scale nonlinear programming, convergence acceleration, discrete decisions, network reduction. INTRODUCTION • experiments with various optimization models and methods [36, 37], Stringent requirements on cost effectiveness and environmental compatibility generate an increased demand • a first nonlinear programming (NLP) model for model-based decision support tools for designing and developed under GAMS [38], operating municipal water supply systems. This paper deals • numerical results for a substantially reduced with the minimum cost operation of drinking water network graph using (under GAMS) the SQP codes networks. Operative planning in water networks is difficult: CONOPT, SNOPT, and the augmented Lagrangian a sound mathematical model leads to nonlinear mixed- code MINOS.
    [Show full text]
  • Different Preservation Levels: the Case of Scholarly Digital Editions
    Oltmanns, E, et al. 2019. Different Preservation Levels: The Case of Scholarly Digital Editions. Data Science Journal, 18: 51, pp. 1–9. DOI: https://doi.org/10.5334/dsj-2019-051 RESEARCH PAPER Different Preservation Levels: The Case of Scholarly Digital Editions Elias Oltmanns, Tim Hasler, Wolfgang Peters-Kottig and Heinz-Günter Kuper Department Scientific Information, Konrad-Zuse-Zentrum für Informationstechnik Berlin, DE Corresponding author: Elias Oltmanns ([email protected]) Ensuring the long-term availability of research data forms an integral part of data management services. Where OAIS compliant digital preservation has been established in recent years, in almost all cases the services aim at the preservation of file-based objects. In the Digital Human- ities, research data is often represented in highly structured aggregations, such as Scholarly Digital Editions. Naturally, scholars would like their editions to remain functionally complete as long as possible. Besides standard components like webservers, the presentation typically relies on project specific code interacting with client software like webbrowsers. Especially the latter being subject to rapid change over time invariably makes such environments awkward to maintain once funding has ended. Pragmatic approaches have to be found in order to balance the curation effort and the maintainability of access to research data over time. A sketch of four potential service levels aiming at the long-term availability of research data in the humanities is outlined: (1) Continuous Maintenance, (2) Application Conservation, (3) Application Data Preservation, and (4) Bitstream Preservation. The first being too costly and the last hardly satisfactory in general, we suggest that the implementation of services by an infrastructure provider should concentrate on service levels 2 and 3.
    [Show full text]
  • 54 OP08 Abstracts
    54 OP08 Abstracts CP1 Dept. of Mathematics Improving Ultimate Convergence of An Aug- [email protected] mented Lagrangian Method Optimization methods that employ the classical Powell- CP1 Hestenes-Rockafellar Augmented Lagrangian are useful A Second-Derivative SQP Method for Noncon- tools for solving Nonlinear Programming problems. Their vex Optimization Problems with Inequality Con- reputation decreased in the last ten years due to the com- straints parative success of Interior-Point Newtonian algorithms, which are asymptotically faster. In the present research We consider a second-derivative 1 sequential quadratic a combination of both approaches is evaluated. The idea programming trust-region method for large-scale nonlin- is to produce a competitive method, being more robust ear non-convex optimization problems with inequality con- and efficient than its ”pure” counterparts for critical prob- straints. Trial steps are composed of two components; a lems. Moreover, an additional hybrid algorithm is defined, Cauchy globalization step and an SQP correction step. A in which the Interior Point method is replaced by the New- single linear artificial constraint is incorporated that en- tonian resolution of a KKT system identified by the Aug- sures non-accent in the SQP correction step, thus ”guiding” mented Lagrangian algorithm. the algorithm through areas of indefiniteness. A salient feature of our approach is feasibility of all subproblems. Ernesto G. Birgin IME-USP Daniel Robinson Department of Computer Science Oxford University [email protected]
    [Show full text]
  • Using SCIP to Solve Your Favorite Integer Optimization Problem
    Using SCIP to Solve Your Favorite Integer Optimization Problem Gregor Hendel, [email protected], www.zib.de/hendel Monash University, Melbourne March 12, 2019 Gregor Hendel{ Using SCIP 1/78 Zuse Institute Berlin { Fast Algorithms, Fast Computers A research institute and computing center of the State of Berlin with research units: • Numerical Analysis and Modeling • Visualization and Data Analysis • Optimization: Energy { Transportation { Health { Mathematical Optimization Methods • Scientific Information Systems • Computer Science and High Performance Computing Gregor Hendel{ Using SCIP 2/78 What is SCIP? SCIP (Solving Constraint Integer Programs) . • provides a full-scale MIP and MINLP solver, • is constraint based, • incorporates • MIP features (cutting planes, LP relaxation), and • MINLP features (spatial branch-and-bound, OBBT) • CP features (domain propagation), • SAT-solving features (conflict analysis, restarts), • is a branch-cut-and-price framework, • has a modular structure via plugins, • is free for academic purposes, • and is available in source-code under http://scip.zib.de ! Gregor Hendel{ Using SCIP 3/78 Meet the SCIP Team 31 active developers • 7 running Bachelor and Master projects • 16 running PhD projects • 8 postdocs and professors 4 development centers in Germany • ZIB: SCIP, SoPlex, UG, ZIMPL • TU Darmstadt: SCIP and SCIP-SDP • FAU Erlangen-N¨urnberg: SCIP • RWTH Aachen: GCG Many international contributors and users • more than 10 000 downloads per year from 100+ countries Careers • 10 awards for Masters and PhD theses:
    [Show full text]
  • The SCIP Optimization Suite
    The SCIP Optimization Suite Gerald Gamrath Zuse Institute Berlin EWO Seminar February 13, 2015 Gerald Gamrath (ZIB): The SCIP Optimization Suite 1 ZIB: Fast Algorithms – Fast Computers Konrad-Zuse-Zentrum für Informationstechnik Berlin I non-university research institute and computing center of the state of Berlin I Research Units: I numerical analysis and modeling I visualization and data analysis I optimization: energy–traffic–telecommunication–linear and nonlinear IP I scientific information systems I distributed algorithms and supercomputing I President: Martin Grötschel I more information: http://www.zib.de Gerald Gamrath (ZIB): The SCIP Optimization Suite 2 ZIB: Fast Algorithms – Fast Computers Konrad-Zuse-Zentrum für Informationstechnik Berlin I non-university research institute and computing center of the state of Berlin I Research Units: I numerical analysis and modeling I visualization and data analysis I optimization: energy–traffic–telecommunication–linear and nonlinear IP I scientific information systems I distributed algorithms and supercomputing I President: Martin Grötschel I more information: http://www.zib.de Gerald Gamrath (ZIB): The SCIP Optimization Suite 2 Outline SCIP –SolvingConstraintIntegerPrograms Constraint Integer Programming Solving Constraint Integer Programs History and Applications http://scip.zib.de Gerald Gamrath (ZIB): The SCIP Optimization Suite 3 What is a Constraint Integer Program? Mixed Integer Program Constraint Program Objective function: Objective function: . linear function . arbitrary function Feasible set: Feasible set: . described by linear constraints . given by arbitrary constraints Variable domains: Variable domains: . real or integer values . arbitrary (usually finite) min cT x min c(x) s.t. Ax ≤ b s.t. x ∈ F I C I (xI , xC ) ∈ Z × R (xI , xN ) ∈ Z × X Gerald Gamrath (ZIB): The SCIP Optimization Suite 4 What is a Constraint Integer Program? Constraint Integer Program Objective function: .
    [Show full text]
  • Computational Aspects of Infeasibility Analysis in Mixed Integer Programming
    Takustr. 7 Zuse Institute Berlin 14195 Berlin Germany JAKOB WITZIG TIMO BERTHOLD STEFAN HEINZ Computational Aspects of Infeasibility Analysis in Mixed Integer Programming ZIB Report 19-54 (November 2019) Zuse Institute Berlin Takustr. 7 14195 Berlin Germany Telephone: +49 30-84185-0 Telefax: +49 30-84185-125 E-mail: [email protected] URL: http://www.zib.de ZIB-Report (Print) ISSN 1438-0064 ZIB-Report (Internet) ISSN 2192-7782 Computational Aspects of Infeasibility Analysis in Mixed Integer Programming Jakob Witzig,1 Timo Berthold,2 and Stefan Heinz3 1Zuse Institute Berlin, Takustr. 7, 14195 Berlin, Germany [email protected] 2Fair Isaac Germany GmbH, Stubenwald-Allee 19, 64625 Bensheim, Germany [email protected] 3Gurobi GmbH, Ulmenstr. 37–39, 60325 Frankfurt am Main, Germany [email protected] November 6, 2019 Abstract The analysis of infeasible subproblems plays an important role in solv- ing mixed integer programs (MIPs) and is implemented in most major MIP solvers. There are two fundamentally different concepts to gener- ate valid global constraints from infeasible subproblems. The first is to analyze the sequence of implications, obtained by domain propagation, that led to infeasibility. The result of this analysis is one or more sets of contradicting variable bounds from which so-called conflict constraints can be generated. This concept is called conflict graph analysis and has its origin in solving satisfiability problems and is similarly used in con- straint programming. The second concept is to analyze infeasible linear programming (LP) relaxations. Every ray of the dual LP provides a set of multipliers that can be used to generate a single new globally valid linear constraint.
    [Show full text]
  • Classical Benders Decomposition (KC203) Cluster: CPAIOR Chair: Jean-François Cordeau, HEC Montreal
    Sunday, May 29, 2016 9:00am - 10:00am Session: Classical Benders Decomposition (KC203) Cluster: CPAIOR Chair: Jean-François Cordeau, HEC Montreal Classical Benders Decomposition Jean-François Cordeau, HEC Montréal, [email protected] Benders decomposition is a mathematical decomposition technique designed to solve large- scale linear and mixed-integer programs comprising two sets of variables such that a more tractable subproblem is obtained when the values of some "complicating" variables are fixed. The technique works by projecting the original problem on the space of the complicating variables, and by using a cutting plane method where cuts are generated by solving the subproblem. The purpose of this masterclass is to introduce the basic Benders decomposition methodology, to present several computational refinements that have shown to improve performance, and to discuss some recent developments. ______________________________________________________________________________ 10:15am - 11:15am Session: Logic-Based Benders Decomposition (KC203) Cluster: CPAIOR Chair: John Hooker, Carnegie Mellon University Logic-Based Benders Decomposition John Hooker, Carnegie Mellon University, [email protected] This is a tutorial on logic-based Benders decomposition, which generalizes the classical Benders method so as to accommodate an arbitrary subproblem rather than only a linear or continuous nonlinear programming problem. This allows one to apply Benders profitably to any problem that simplifies or decouples when certain variables are
    [Show full text]
  • SPARC Institutional Repository Checklist & Resource Guide
    SPARC Institutional Repository Checklist & Resource Guide The Scholarly Publishing & Academic Resources Coalition 21 Dupont Circle • Washington, DC 20036 www.arl.org/sparc Prepared by Raym Crow, SPARC Senior Consultant SPARC Institutional Repository Checklist & Resource Guide Acknowledgements SPARC and the author wish to thank the many people whose comments have shaped this document. We would especially like to thank Chris Gutteridge of the University of Southampton and EPrints; Ed Sponsler and Kim Douglas of the Caltech Libraries; and MacKenzie Smith of the MIT Libraries and DSpace. The benefit of their experience and insight has improved this Guide immeasurably. Any errors or omissions that remain, however, are the sole responsibility of SPARC and the author. This document will be revised and updated on an ongoing basis as new information warrants. To comment on this document, please contact Raym Crow at [email protected]. SPARC Institutional Repository Checklist & Resource Guide Release 1.0 November 2002 © SPARC, 2002 Permission is granted to reproduce, distribute or electronically post copies of this work for nonprofit educational purposes, provided that the author, source, and copyright notices are included on each copy. This permission is in addition to the rights of reproduction granted under Sections 107, 108, and other provisions of the U.S. Copyright Act. These items may be further forwarded and distributed so long as the statement of copyright remains intact. All trademarks and service marks mentioned herein are the property of their respective owners. Page 2 of 51 SPARC Institutional Repository Checklist & Resource Guide TABLE OF CONTENTS INTRODUCTION.................................................................................................Page 5 The Institutional Repository................................................................................... 5 Document Purpose .................................................................................................
    [Show full text]
  • Persistent Identifiers
    Network of Expertise in Digital Preservation Persistent Identifiers Reinhard Altenhöner Die Deutsche Bibliothek, Frankfurt am Main, Germany [email protected] Die Deutsche Bibliothek Chinese-European Workshop on Digital Preservation, Beijing July 14 – 16 2004 1 Network of Expertise in Digital Preservation Table of Contents Introduction: persistent identifiers URN: a standard in the world of internet Structure and realization(s) PI in Praxis: the project Epicur in DDB Conclusions/Summary Die Deutsche Bibliothek Chinese-European Workshop on Digital Preservation, Beijing July 14 – 16 2004 2 Network of Expertise in Digital Preservation Die Deutsche Bibliothek Chinese-European Workshop on Digital Preservation, Beijing July 14 – 16 2004 3 Network of Expertise in Digital Preservation Identification of cars Number plate Chassis number non stable reliable can be a fake persistent small functionality appropriate non global functionality opaque (resolution!) global transparent unique Die Deutsche Bibliothek Chinese-European Workshop on Digital Preservation, Beijing July 14 – 16 2004 4 Network of Expertise in Digital Preservation The daily experience Die Deutsche Bibliothek Chinese-European Workshop on Digital Preservation, Beijing July 14 – 16 2004 5 Network of Expertise in Digital Preservation Die Deutsche Bibliothek Chinese-European Workshop on Digital Preservation, Beijing July 14 – 16 2004 6 Network of Expertise in Digital Preservation Persistence in the WEB 16% links after 6 months (T.Dowling) 50% after 24 months (British
    [Show full text]