TY - JOUR A1 - Johnston, Jennifer A1 - Kelley, Richard A1 - Crawford, Thomas A1 - Morton, D. A1 - Agarwala, Richa A1 - Koch, Thorsten A1 - Schäffer, Alejandro A1 - Francomano, Clair A1 - Biesecker, Leslie T1 - A novel nemaline myopathy in the Amish caused by a mutation in troponin T1 JF - American Journal of Human Genetics Y1 - 2000 UR - http://www.journals.uchicago.edu/AJHG/journal/issues/v67n4/002057/002057.html VL - 67 SP - 814 EP - 821 ER - TY - CHAP A1 - Koch, Thorsten A1 - Martin, Alexander A1 - Voß, Stefan ED - Du, D.-Z. ED - Cheng, X. T1 - SteinLib: An Updated Library on Steiner Tree Problems in Graphs T2 - Steiner Trees in Industry Y1 - 2001 U6 - https://doi.org/10.1007/978-1-4613-0255-1_9 SP - 285 EP - 325 PB - Kluwer ER - TY - JOUR A1 - Albrecht, Rita A1 - Ceynowa, Klaus A1 - Degkwitz, Andreas A1 - Kende, Jiri A1 - Koch, Thorsten A1 - Messmer, Gabriele A1 - Risch, Uwe A1 - Rusch, Beate A1 - Scheuerl, Robert A1 - Voß, Michael T1 - Cloudbasierte Infrastruktur für Bibliotheksdaten – auf dem Weg zu einer Neuordnung der deutschen Verbundlandschaft JF - Bibliothek Forschung und Praxis N2 - Im Oktober 2012 hatte die Deutsche Forschungsgemeinschaft (DFG) ein Förderprogramm zur Neuausrichtung überregionaler Informationsservices ausgeschrieben, um eine umfassende Reorganisation bestehender Infrastrukturen anzustoßen, die mit den Empfehlungen des Wissenschaftsrates zur Zukunft der bibliothekarischen Verbundsysteme in Deutschland gefordert wurde. Im Themenfeld „Bibliotheksdateninfrastruktur und Lokale Systeme“ der DFG-Ausschreibung wurde das vom Hessischen Bibliotheksinformationssystem (HeBIS), vom Bibliotheksverbund Bayern (BVB) und vom Kooperativen Bibliotheksverbund Berlin-Brandenburg (KOBV) beantragte Vorhaben „Cloudbasierte Infrastruktur für Bibliotheksdaten“ (CIB) bewilligt. Das Projekt zielt auf die Überführung bibliothekarischer Workflows und Dienste in cloudbasierte Arbeitsumgebungen und die sukzessive Ablösung traditioneller Verbund- und Lokalsysteme durch internationale Systemplattformen. Zu den Arbeitspaketen des Vorhabens gehört u. a. die Einbindung von Norm- und Fremddatenangeboten und von weiteren Services in diese Plattformen. Y1 - 2013 U6 - https://doi.org/10.1515/bfp-2013-0044 VL - 37 IS - 3 SP - 279 EP - 287 ER - TY - GEN A1 - Becker, Pascal-Nicolas A1 - Bertelmann, Roland A1 - Ceynowa, Klaus A1 - Christof, Jürgen A1 - Dierkes, Thomas A1 - Goltz-Fellgiebel, Julia Alexandra A1 - Groß, Matthias A1 - Heidrich, Regina A1 - Höhnow, Tobias A1 - Kassube, Michael A1 - Koch, Thorsten A1 - Kuberek, Monika A1 - Landes, Lilian A1 - Pampel, Heinz A1 - Putnings, Markus A1 - Rusch, Beate A1 - Schäffler, Hildegard A1 - Schobert, Dagmar A1 - Schwab, Oliver A1 - Schwidder, Jens A1 - Söllner, Konstanze A1 - Stoyanova, Tonka A1 - Vierkant, Paul T1 - Questionnaire for effective exchange of bibliographic metadata – current status of publishing houses N2 - The project DeepGreen aims to realise better usage of green open access publication rights with regard to Alliance Licenses in Germany (https://www.nationallizenzen.de/open-access). Together with publishers who offer Alliance Licenses and authorized libraries, the project group intends to develop a prototype of a nearly fully automated workflow that covers the delivery of data from the publishers, including the article full texts, as well as the process of loading data into the institutional repositories of licensees. Further information about the project can be found within ZIB-Report 15-58, urn:nbn:de:0297-zib-56799. In order to become acquainted with publishers’ processes for exchanging documents and metadata, the project group developed a questionnaire for an online survey. The publishing of this questionnaire is intended to demonstrate relevant aspects of the issue (e. g. methods of data exchange, protocols and interfaces) and to foster reuse of valuable questionnaire elements. The XML-file can be reused as a template, the PDF-file reproduces the original survey layout. KW - Open Access KW - Open Access KW - Questionnaire Y1 - 2016 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-60419 N1 - This work is in the public domain: CC0 1.0 Universal (CC0 1.0) Public Domain Dedication. https://creativecommons.org/publicdomain/zero/1.0/ ER - TY - GEN A1 - Becker, Pascal-Nicolas A1 - Bertelmann, Roland A1 - Ceynowa, Klaus A1 - Christof, Jürgen A1 - Dierkes, Thomas A1 - Goltz-Fellgiebel, Julia Alexandra A1 - Groß, Matthias A1 - Heidrich, Regina A1 - Höhnow, Tobias A1 - Kassube, Michael A1 - Koch, Thorsten A1 - Kuberek, Monika A1 - Landes, Lilian A1 - Pampel, Heinz A1 - Putnings, Markus A1 - Rusch, Beate A1 - Schäffler, Hildegard A1 - Schobert, Dagmar A1 - Schwab, Oliver A1 - Schwidder, Jens A1 - Söllner, Konstanze A1 - Stoyanova, Tonka A1 - Vierkant, Paul T1 - DeepGreen – Metadata Schema for the exchange of publications between publishers and open access repositories. Version 1.1. June 2016 N2 - In 2011, important priorities were set to realize green publications in the open access movement in Germany. With financial support from the German Research Foundation (DFG), libraries negotiated Alliance licenses with publishers that guarantee extensive open access rights. Authors of institutions, that have therewith access to licensed journals, can freely publish their articles immediately or after a short embargo period in a repository of their choice. However, authors hesitantly use these open access rights. Also libraries – as managers of institutional and subject based repositories and thus legitimated representatives for the authors – only rarely make use of these rights. The aim of DeepGreen is to make the majority of those publications available online. Together with publishers of the Alliance licenses, the project consortium wants to develop a nearly fully automated workflow that covers both the delivery of data, including the full texts, of the publishers, as well as the data transformation to the necessary import formats and the loading process into the repositories. An intermediate “publication router” will serve as a distribution platform. The DeepGreen metadata schema contains metadata properties describing a wide range of deliverable bibliographic metadata from the Alliance license publishers (most common standards are JATS and CrossRef XML) as well as its compliance with technical, quality and metadata standards of the repositories. The schema includes required metadata elements and optional properties providing additional information.The metadata schema is aligned to the OCLC repository best practices (“Best Practices for CONTENTdm and other OAI-PMH compliant repositories: creating sharable metadata”, URL: http://www.oclc.org/content/dam/support/wcdigitalcollectiongateway/MetadataBestPractices.pdf). The current version of the schema is subject to changes as the functional requirements and workflow practices are evolving during the project experiences and prototype production. T3 - ZIB-Report - 16-32 Y1 - 2016 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-59580 SN - 1438-0064 N1 - This work is in the public domain: CC0 1.0 Universal (CC0 1.0) Public Domain Dedication. https://creativecommons.org/publicdomain/zero/1.0/ ER - TY - GEN A1 - Aust, Sonja A1 - Conrad-Rempel, Steffi A1 - Degkwitz, Andreas A1 - Golz, Bettina A1 - Hasler, Tim A1 - Heiss, Alexandra A1 - Keidel, Petra A1 - Koch, Thorsten A1 - Kuberek, Monika A1 - Lill, Monika A1 - Lohrum, Stefan A1 - Müller, Anja A1 - Peters-Kottig, Wolfgang A1 - Quitzsch, Nicole A1 - Rusch, Beate A1 - Schwidder, Jens A1 - Sischke, Gabriele A1 - Stanek, Ursula A1 - Taylor, Viola A1 - Weihe, Signe A1 - Wyrwol, Christiane A1 - Happel, Hans-Gerd T1 - KOBV Jahresbericht 2013-2014 N2 - Der KOBV-Jahresbericht informiert rückblickend im 2-Jahres-Rhythmus über die bibliothekarisch-fachlichen Entwicklungen im Verbund und die Projekte des Kooperativen Bibliotheksverbunds Berlin-Brandenburg (KOBV). T3 - KOBV-Jahresbericht - 2013-2014 KW - KOBV KW - Jahresbericht Y1 - 2015 SN - 0934-5892 VL - 2013-2014 IS - 2013-2014 SP - 1 EP - 56 ER - TY - GEN A1 - Christof, Jürgen A1 - Conrad-Rempel, Steffi A1 - Degkwitz, Andreas A1 - Goltz-Fellgiebel, Julia Alexandra A1 - Happel, Hans-Gerd A1 - Hasler, Tim A1 - Heiss, Alexandra A1 - Kaminsky, Uta A1 - Kant, Oliver A1 - Kende, Jiří A1 - Koch, Thorsten A1 - Kuberek, Monika A1 - Lohrum, Stefan A1 - Müller, Anja A1 - Mutter, Moritz A1 - Peters-Kottig, Wolfgang A1 - Quitzsch, Nicole A1 - Rusch, Beate A1 - Schwidder, Jens A1 - Stanek, Ursula A1 - Weihe, Signe A1 - Zeyns, Andrea T1 - KOBV Jahresbericht 2015-2016 N2 - Der KOBV-Jahresbericht informiert rückblickend im 2-Jahres-Rhythmus über die bibliothekarisch-fachlichen Entwicklungen im Verbund und die Projekte des Kooperativen Bibliotheksverbunds Berlin-Brandenburg (KOBV). T3 - KOBV-Jahresbericht - 2015-2016 KW - KOBV KW - Jahresbericht Y1 - 2017 SN - 0934-5892 VL - 2015-2016 IS - 2015-2016 SP - 1 EP - 64 ER - TY - GEN A1 - Behrens, Kathrin A1 - Bertelmann, Roland A1 - Boltze, Julia A1 - Ceynowa, Klaus A1 - Christof, Jürgen A1 - Dierkes, Thomas A1 - Goltz-Fellgiebel, Julia Alexandra A1 - Groß, Matthias A1 - Hammerl, Michaela A1 - Haoua, Marsa A1 - Heermann, Petra A1 - Hoffmann, Cornelia A1 - Höhnow, Tobias A1 - Koch, Thorsten A1 - Kuberek, Monika A1 - Pampel, Heinz A1 - Putnings, Markus A1 - Rusch, Beate A1 - Schäffler, Hildegard A1 - Schwidder, Jens A1 - Söllner, Konstanze A1 - Staub, Hedda A1 - Wannick, Eike T1 - DeepGreen - Open Access Transformation: Eine Handreichung für institutionelle Repositorien BT - Version 1.0 N2 - Mit dem DFG-geförderten Projekt DeepGreen soll eine automatisierte, rechtssichere Lösung entwickelt werden, um Artikeldaten von wissenschaftlichen Verlagen abzuholen und anschließend, nach Ablauf etwaiger lizenzrechtlicher Embargofristen, an berechtigte Repositorien zu verteilen und somit in den Open Access zu überführen. Dabei liegt der Fokus auf den DFG-geförderten und überregional verhandelten Allianz-Lizenzen, mit spezieller Open-Access-Komponente. Die vorliegende Handreichung richtet sich speziell an die Betreiber institutioneller Repositorien und stellt Empfehlungen und einen Workflow bereit, um eine erfolgreiche Veröffentlichung, der durch die DeepGreen-Datendrehscheibe zugeordneten Artikel, zu ermöglichen. Die Handreichung basiert auf den bisherigen Erfahrungen der DeepGreen-Projektbeteiligten. T3 - ZIB-Report - 19-31 KW - Open Access KW - Open-Access-Transformation Y1 - 2019 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-74438 SN - 1438-0064 ER - TY - GEN A1 - Koch, Thorsten A1 - Martin, Alexander T1 - Solving Steiner Tree Problems in Graphs to Optimality N2 - In this paper we present the implementation of a branch-and-cut algorithm for solving Steiner tree problems in graphs. Our algorithm is based on an integer programming formulation for directed graphs and comprises preprocessing, separation algorithms and primal heuristics. We are able to solve all problem instances discussed in literature to optimality, including one to our knowledge not yet solved problem. We also report on our computational experiences with some very large Steiner tree problems arising from the design of electronic circuits. All test problems are gathered in a newly introduced library called {\em SteinLib} that is accessible via World Wide Web. T3 - ZIB-Report - SC-96-42 Y1 - 1996 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-2526 ER - TY - GEN A1 - Pedersen, Jaap A1 - Lindner, Niels A1 - Rehfeldt, Daniel A1 - Koch, Thorsten T1 - Comparing Branching Rules for the Quota Steiner Tree Problem with Interference N2 - Branching decisions play a crucial role in branch-and-bound algorithms for solving combinatorial optimization problems. In this paper, we investigate several branching rules applied to the Quota Steiner Tree Problem with Interference (QSTPI). The Quota Steiner Tree Problem (QSTP) generalizes the classical Steiner Tree Problem (STP) in graphs by seeking a minimum-cost tree that connects a subset of profit-associated vertices to meet a given quota. The extended version, QSTPI, introduces interference among vertices: Selecting certain vertices simultaneously reduces their individual contributions to the overall profit. This problem arises, for example, in positioning and connecting wind turbines, where turbines possibly shadow other turbines, reducing their energy yield. While exact solvers for standard STP-related problems often rely heavily on reduction techniques and cutting-plane methods – rarely generating large branch-and-bound trees – experiments reveal that large instances of QSTPI require significantly more branching to compute provably optimal solutions. In contrast to branching on variables, we utilize the combinatorial structure of the QSTPI by branching on the graph’s vertices. We adapt classical and problem-specific branching rules and present a comprehensive computational study comparing the effectiveness of these branching strategies. T3 - ZIB-Report - 25-16 Y1 - 2025 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-101250 SN - 1438-0064 ER - TY - GEN A1 - Kempke, Nils-Christian A1 - Koch, Thorsten T1 - A GPU accelerated variant of Schroeppel-Shamir's algorithm for solving the market split problem N2 - The market split problem (MSP), introduced by Cornuéjols and Dawande (1998), is a challenging binary optimization problem that performs poorly on state-of-the-art linear programming-based branch-and-cut solvers. We present a novel algorithm for solving the feasibility version of this problem, derived from Schroeppel–Shamir's algorithm for the one-dimensional subset sum problem. Our approach is based on exhaustively enumerating one-dimensional solutions of MSP and utilizing GPUs to evaluate candidate solutions across the entire problem. The resulting hybrid CPU-GPU implementation efficiently solves instances with up to 10 constraints and 90 variables. We demonstrate the algorithm's performance on benchmark problems, solving instances of size (9, 80) in less than fifteen minutes and (10, 90) in up to one day. T3 - ZIB-Report - 25-10 Y1 - 2025 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-100554 SN - 1438-0064 ER - TY - JOUR A1 - Koch, Thorsten A1 - Bernal Neira, David E. A1 - Chen, Ying A1 - Cortiana, Giorgio A1 - Egger, Daniel J. A1 - Heese, Raoul A1 - Hegade, Narendra N. A1 - Gomez Cadavid, Alejandro A1 - Huang, Rhea A1 - Itoko, Toshinari A1 - Kleinert, Thomas A1 - Maciel Xavier, Pedro A1 - Mohseni, Naeimeh A1 - Montanez-Barrera, Jhon A. A1 - Nakano, Koji A1 - Nannicini, Giacomo A1 - O'Meara, Corey A1 - Pauckert, Justin A1 - Proissl, Manuel A1 - Ramesh, Anurag A1 - Schicker, Maximilian A1 - Shimada, Noriaki A1 - Takeori, Mitsuharu A1 - Valls, Victor A1 - Van Bulck, David A1 - Woerner, Stefan A1 - Zoufal, Christa T1 - Quantum Optimization Benchmark Library -- The Intractable Decathlon N2 - Through recent progress in hardware development, quantum computers have advanced to the point where benchmarking of (heuristic) quantum algorithms at scale is within reach. Particularly in combinatorial optimization -- where most algorithms are heuristics -- it is key to empirically analyze their performance on hardware and track progress towards quantum advantage. To this extent, we present ten optimization problem classes that are difficult for existing classical algorithms and can (mostly) be linked to practically-relevant applications, with the goal to enable systematic, fair, and comparable benchmarks for quantum optimization methods. Further, we introduce the Quantum Optimization Benchmark Library (QOBLIB) where the problem instances and solution track records can be found. The individual properties of the problem classes vary in terms of objective and variable type, coefficient ranges, and density. Crucially, they all become challenging for established classical methods already at system sizes ranging from less than 100 to, at most, an order of 100,000 decision variables, allowing to approach them with today's quantum computers. We reference the results from state-of-the-art solvers for instances from all problem classes and demonstrate exemplary baseline results obtained with quantum solvers for selected problems. The baseline results illustrate a standardized form to present benchmarking solutions, which has been designed to ensure comparability of the used methods, reproducibility of the respective results, and trackability of algorithmic and hardware improvements over time. We encourage the optimization community to explore the performance of available classical or quantum algorithms and hardware platforms with the benchmarking problem instances presented in this work toward demonstrating quantum advantage in optimization. Y1 - 2025 ER -