@article{AnztBachDruskatetal.2020, author = {Anzt, H. and Bach, F. and Druskat, S. and L{\"o}ffler, F. and Loewe, A. and Renard, B. Y. and Seemann, G. and Struck, A. and Achhammer, E. and Appell, F. and Bader, M. and Brusch, L. and Busse, C. and Chourdakis, G. and Dabrowski, P. W. and Ebert, P. and Flemisch, B. and Friedl, S. and Fritzsch, B. and Funk, M. D. and Gast, V. and Goth, F. and Grad, J.-N. and Hermann, Sibylle and Hohmann, F. and Janosch, S. and Kutra, D. and Linxweiler, J. and Muth, T. and Peters-Kottig, Wolfgang and Rack, F. and Raters, F. H. C. and Rave, S. and Reina, G. and Reißig, M. and Ropinski, T. and Schaarschmidt, J. and Seibold, H. and Thiele, J. P. and Uekermann, B. and Unger, S. and Weeber, R.}, title = {An environment for sustainable research software in Germany and beyond: current state, open challenges, and call for action [version 1; peer review: 1 approved, 1 approved with reservations]}, journal = {F1000Research}, number = {9:295}, doi = {10.12688/f1000research.23224.1}, pages = {28}, year = {2020}, abstract = {Research software has become a central asset in academic research. It optimizes existing and enables new research methods, implements and embeds research knowledge, and constitutes an essential research product in itself. Research software must be sustainable in order to understand, replicate, reproduce, and build upon existing research or conduct new research effectively. In other words, software must be available, discoverable, usable, and adaptable to new needs, both now and in the future. Research software therefore requires an environment that supports sustainability. Hence, a change is needed in the way research software development and maintenance are currently motivated, incentivized, funded, structurally and infrastructurally supported, and legally treated. Failing to do so will threaten the quality and validity of research. In this paper, we identify challenges for research software sustainability in Germany and beyond, in terms of motivation, selection, research software engineering personnel, funding, infrastructure, and legal aspects. Besides researchers, we specifically address political and academic decision-makers to increase awareness of the importance and needs of sustainable research software practices. In particular, we recommend strategies and measures to create an environment for sustainable research software, with the ultimate goal to ensure that software-driven research is valid, reproducible and sustainable, and that software is recognized as a first class citizen in research. This paper is the outcome of two workshops run in Germany in 2019, at deRSE19 - the first International Conference of Research Software Engineers in Germany - and a dedicated DFG-supported follow-up workshop in Berlin.}, language = {en} } @misc{OltmannsHasler2020, author = {Oltmanns, Elias and Hasler, Tim}, title = {Outline of an archiving strategy for digital audiovisual material}, issn = {1438-0064}, doi = {10.12752/3.7884}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-78840}, year = {2020}, abstract = {This is the documentation on current results of a research project jointly conducted by Stiftung Deutsche Kinemathek (SDK) and Zuse Institute Berlin (ZIB). In this project, we are working on a practical yet sustainable archiving solution for audiovisual material. In the course of the project two major obstacles were identified: 1) Metadata is collected according to standards established in the community but lacking a prescribed serialisation format. 2) Storage size of audiovisual material and time scales of production processes make it often impractical to defer submission for archival storage until all components have arrived and can be processed in one go.}, language = {en} } @inproceedings{Klindt2017, author = {Klindt, Marco}, title = {PDF/A considered harmful for digital preservation}, volume = {14}, booktitle = {Proceedings of iPres - 14th International Conference on Digital Preservation / Kyoto, Japan / September 25 - 29, 2017}, year = {2017}, abstract = {Today, the Portable Document Format (PDF) is the prevalent file format for the exchange of fixed content electronic documents for publication, research, and dissemination work in the academic and cultural heritage domains. Therefore it is not surprising that PDF/A is perceived to be an archival format suitable for digital archiving workflows. This paper gives a rather short overview about the history and technical complexity of the format, its benefits, shortcomings and potential pitfalls in the area of digital preservation with respect to aspects of accessibility and reusability of the information content of PDF/A. Several potential problems within the creation, preservation, and dissemination contexts are identified that may create problems for present and future content users. It also discusses some of the risks inherent to PDF/A for parts of the preservation community and suggests possible strategies to mitigate problems that might prevent future human or machine-based usability of the data and information stored within digital archives.}, language = {en} } @article{Dierkes2017, author = {Dierkes, Thomas}, title = {Ist die Umsetzung der Open-Access-Komponente in Allianz-Lizenzvertr{\"a}gen wirklich so kompliziert?}, volume = {37}, journal = {ABI Technik}, number = {3}, doi = {10.1515/abitech-2017-0051}, pages = {237}, year = {2017}, abstract = {Thomas Dierkes ist promovierter Mathematiker und als Entwickler beim Kooperativen Bibliotheksverbund Berlin-Brandenburg (KOBV) am Zuse-Institut Berlin (ZIB) t{\"a}tig. Er arbeitet dort an der Entwicklung einer „Datendrehscheibe" f{\"u}r die Umsetzung der Open-Access-Komponente in Allianz-Lizenzen. Er beantwortet die aktuelle Abi Technikfrage: „Ist die Umsetzung der Open-Access-Komponente in Allianz-Lizenzvertr{\"a}gen wirklich so kompliziert?"}, language = {de} } @misc{BehrensBertelmannBoltzeetal.2019, author = {Behrens, Kathrin and Bertelmann, Roland and Boltze, Julia and Ceynowa, Klaus and Christof, J{\"u}rgen and Dierkes, Thomas and Goltz-Fellgiebel, Julia Alexandra and Groß, Matthias and Hammerl, Michaela and Haoua, Marsa and Heermann, Petra and Hoffmann, Cornelia and H{\"o}hnow, Tobias and Koch, Thorsten and Kuberek, Monika and Pampel, Heinz and Putnings, Markus and Rusch, Beate and Sch{\"a}ffler, Hildegard and Schwidder, Jens and S{\"o}llner, Konstanze and Staub, Hedda and Wannick, Eike}, title = {DeepGreen - Open Access Transformation: Eine Handreichung f{\"u}r institutionelle Repositorien}, issn = {1438-0064}, doi = {10.12752/7443}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-74438}, year = {2019}, abstract = {Mit dem DFG-gef{\"o}rderten Projekt DeepGreen soll eine automatisierte, rechtssichere L{\"o}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 {\"u}berf{\"u}hren. Dabei liegt der Fokus auf den DFG-gef{\"o}rderten und {\"u}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{\"o}ffentlichung, der durch die DeepGreen-Datendrehscheibe zugeordneten Artikel, zu erm{\"o}glichen. Die Handreichung basiert auf den bisherigen Erfahrungen der DeepGreen-Projektbeteiligten.}, language = {de} } @misc{GoltzFellgiebelRuschBiernackaetal.2019, author = {Goltz-Fellgiebel, Julia Alexandra and Rusch, Beate and Biernacka, Katarzyna and Brandtner, Andreas and Christof, J{\"u}rgen and Czechowska, Dr. Ilona and Degkwitz, Andreas and Euler, Prof. Dr. Ellen and Freyberg, Linda and Geukes, Dr. Albert and Happel, Hans-Gerd and Helbig, Kerstin and H{\"u}bner, Andreas and Mohnke, Janett and Mutter, Moritz and Seeliger, Frank and Stanek, Ursula and Voigt, Michaela and Winterhalter, Dr. Christian and Zeyns, Andrea and Kaminsky, Uta and Boltze, Julia and Conrad-Rempel, Steffi and Gerlach, Viktoria and Heidingsfelder, Nicole and Kant, Oliver and Lohrum, Stefan and M{\"u}ller, Anja and Peters-Kottig, Wolfgang and Schwidder, Jens and Weihe, Signe and Bauknecht, Anne-Beatrix and Krauß, Frieder}, title = {KOBV Jahresbericht 2017-2018}, number = {2017-2018}, issn = {1438-0064}, pages = {1 -- 63}, year = {2019}, abstract = {Der KOBV-Jahresbericht informiert r{\"u}ckblickend im 2-Jahres-Rhythmus {\"u}ber die bibliothekarisch-fachlichen Entwicklungen im Verbund und die Projekte des Kooperativen Bibliotheksverbunds Berlin-Brandenburg (KOBV).}, language = {de} } @misc{VuKochXu2024, author = {Vu, Thi Huong and Koch, Thorsten and Xu, Hong-Kun}, title = {The gradient projection method: Is the Polyak adaptive stepsize rule optimal?}, year = {2024}, abstract = {Not always! This is our answer to the question of whether the Polyak adaptive stepsize rule in the gradient projection method is optimal. The answer is based on revisiting the subgradient projection method by Polyak [USSR Computational Mathematics and Mathematical Physics 9 (1969)] for smooth and convex minimization problems where the objective function possesses a geometric property called flatness. Our results show that the method can be more flexible (the effective range for the parameter controlling the stepsize can be wider) and have sharper convergence rates. Applications to split feasibility/equality problems are presented, deriving for the first time the O(1/k) rate of convergence for the adaptive CQ method. A theoretical guarantee of the linear convergence of the gradient descent method with adaptive stepsizes for Google PageRank is provided. At the same time, numerical experiments are designed to spot the ``optimal" stepsize and to compare with other basic gradient methods.}, language = {en} } @inproceedings{YuekselErguenLitzelPeng2025, author = {Yueksel Erguen, Inci and Litzel, Ida and Peng, Hanqiu}, title = {Integrating Large Citation Datasets}, booktitle = {Operations Research Proceedings 2024. OR 2024}, doi = {10.1007/978-3-031-92575-7_7}, pages = {46 -- 52}, year = {2025}, abstract = {This paper explores methods for building a comprehensive citation graph using big data techniques to evaluate scientific impact more accurately. Traditional citation metrics have limitations, and this work investigates merging large citation datasets to create a more accurate picture. Challenges of big data, like inconsistent data formats and lack of unique identifiers, are addressed through deduplication efforts, resulting in a streamlined and reliable merged dataset with over 119 million records and 1.4 billion citations. We demonstrate that merging large citation datasets builds a more accurate citation graph facilitating a more robust evaluation of scientific impact.}, language = {en} } @article{VuLitzelKoch2026, author = {Vu, Thi Huong and Litzel, Ida and Koch, Thorsten}, title = {Similarity-based fuzzy clustering scientific articles: potentials and challenges from mathematical and computational perspectives}, volume = {10}, journal = {Journal of Nonlinear and Variational Analysis}, number = {2}, publisher = {Biemdas}, arxiv = {http://arxiv.org/abs/2506.04045}, doi = {https://doi.org/10.23952/jnva.10.2026.2.8}, pages = {381 -- 401}, year = {2026}, abstract = {Fuzzy clustering, which allows an article to belong to multiple clusters with soft membership degrees, plays a vital role in analyzing publication data. This problem can be formulated as a constrained optimization model, where the goal is to minimize the discrepancy between the similarity observed from data and the similarity derived from a predicted distribution. While this approach benefits from leveraging state-of-the-art optimization algorithms, tailoring them to work with real, massive databases like OpenAlex or Web of Science - containing about 70 million articles and a billion citations - poses significant challenges. We analyze potentials and challenges of the approach from both mathematical and computational perspectives. Among other things, second-order optimality conditions are established, providing new theoretical insights, and practical solution methods are proposed by exploiting the structure of the problem. Specifically, we accelerate the gradient projection method using GPU-based parallel computing to efficiently handle large-scale data.}, language = {en} } @misc{VuLitzelKoch2025, author = {Vu, Thi Huong and Litzel, Ida and Koch, Thorsten}, title = {Similarity-based fuzzy clustering scientific articles: potentials and challenges from mathematical and computational perspectives}, arxiv = {http://arxiv.org/abs/2506.04045}, year = {2025}, abstract = {Fuzzy clustering, which allows an article to belong to multiple clusters with soft membership degrees, plays a vital role in analyzing publication data. This problem can be formulated as a constrained optimization model, where the goal is to minimize the discrepancy between the similarity observed from data and the similarity derived from a predicted distribution. While this approach benefits from leveraging state-of-the-art optimization algorithms, tailoring them to work with real, massive databases like OpenAlex or Web of Science -- containing about 70 million articles and a billion citations -- poses significant challenges. We analyze potentials and challenges of the approach from both mathematical and computational perspectives. Among other things, second-order optimality conditions are established, providing new theoretical insights, and practical solution methods are proposed by exploiting the problem's structure. Specifically, we accelerate the gradient projection method using GPU-based parallel computing to efficiently handle large-scale data.}, language = {en} } @misc{VuKoch2025, author = {Vu, Thi Huong and Koch, Thorsten}, title = {Clustering scientific publications: lessons learned through experiments with a real citation network}, arxiv = {http://arxiv.org/abs/2505.18180}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-100418}, year = {2025}, abstract = {Clustering scientific publications helps uncover research structures within bibliographic databases. Graph-based methods such as spectral, Louvain, and Leiden clustering are commonly used due to their ability to model citation networks. However, their effectiveness can diminish when applied to real-world data. This study evaluates these clustering algorithms on a citation graph of about 700,000 articles and 4.6 million citations from the Web of Science. The results show that while scalable methods like Louvain and Leiden perform efficiently, their default settings often yield poor partitioning. Meaningful outcomes require careful parameter tuning, especially for large networks with uneven structures, including a dense core and loosely connected papers. These findings highlight practical lessons about the challenges of large-scale data, method selection and tuning based on specific structures of bibliometric clustering tasks.}, language = {en} } @article{RongChenMaetal.2025, author = {Rong, Guoyang and Chen, Ying and Ma, Feicheng and Koch, Thorsten}, title = {Exploring Interdisciplinary Research Trends through Critical Years for Interdisciplinary Citation}, volume = {19}, journal = {Journal of Informetrics}, number = {4}, doi = {10.1016/j.joi.2025.101726}, year = {2025}, language = {en} } @inproceedings{StomporZittelKochetal.2025, author = {Stompor, Tomasz and Zittel, Janina and Koch, Thorsten and Rusch, Beate}, title = {Fully Algorithmic Librarian: Large-Scale Citation Experiments}, booktitle = {20th International Society of Scientometrics and Informetrics Conference 2025, June 23-27, 2025 | Yerevan, Armenia}, doi = {10.51408/issi2025_204}, year = {2025}, abstract = {The Fully Algorithmic Librarian (FAN) project explores application scenarios for algorithmic-intelligence(AI)-supported methods in academic libraries as central institutions for research support. To this end, the study builds on two algorithmic approaches for analyzing large-scale citation networks. A comparison of Web of Science (WoS) and OpenAlex structures using the PageRank algorithm reveals key differences. Additionally, a multi-label clustering technique designed for large-scale citation networks accounts for disciplinary variations in publication practices.}, language = {en} } @misc{EulerEulerWolf2012, author = {Euler, Marianna and Euler, Norbert and Wolf, Thomas}, title = {The Two-Component Camassa-Holm Equations CH(2,1) and CH(2,2): First-Order Integrating Factors and Conservation Laws}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-16087}, year = {2012}, abstract = {Recently, Holm and Ivanov, proposed and studied a class of multi-component generalisations of the Camassa-Holm equations [D D Holm and R I Ivanov, Multi-component generalizations of the CH equation: geometrical aspects, peakons and numerical examples, {\it J. Phys A: Math. Theor} {\bf 43}, 492001 (20pp), 2010]. We consider two of those systems, denoted by Holm and Ivanov by CH(2,1) and CH(2,2), and report a class of integrating factors and its corresponding conservation laws for these two systems. In particular, we obtain the complete sent of first-order integrating factors for the systems in Cauchy-Kovalevskaya form and evaluate the corresponding sets of conservation laws for CH(2,1) and CH(2,2).}, language = {en} } @misc{OdesskiiWolf2012, author = {Odesskii, Alexander and Wolf, Thomas}, title = {Compatible quadratic Poisson brackets related to a family of elliptic curves}, issn = {1438-0064}, arxiv = {http://arxiv.org/abs/1204.1299}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-16097}, year = {2012}, abstract = {We construct nine pairwise compatible quadratic Poisson structures such that a generic linear combination of them is associated with an elliptic algebra in \$n\$ generators. Explicit formulas for Casimir elements of this elliptic Poisson structure are obtained.}, language = {en} } @misc{WolfSchrueferWebster2012, author = {Wolf, Thomas and Schr{\"u}fer, Eberhard and Webster, Kenneth}, title = {Solving large linear algebraic systems in the context of integrable non-abelian Laurent ODEs}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-16102}, year = {2012}, abstract = {The paper reports on a computer algebra program {\sc LSSS} (Linear Selective Systems Solver) for solving linear algebraic systems with rational coefficients. The program is especially efficient for very large sparse systems that have a solution in which many variables take the value zero. The program is applied to the symmetry investigation of a non-abelian Laurent ODE introduced recently by M.\ Kontsevich. The computed symmetries confirmed that a Lax pair found for this system earlier generates all first integrals of degree at least up to 14.}, language = {en} } @misc{AncoMacNaughtonWolf2012, author = {Anco, Stephen and MacNaughton, Steven A. and Wolf, Thomas}, title = {Conservation laws and symmetries of quasilinear radial wave equations in multi-dimensions}, issn = {1438-0064}, arxiv = {http://arxiv.org/abs/1109.1719}, doi = {10.1063/1.4711814}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-16111}, year = {2012}, abstract = {Symmetries and conservation laws are studied for two classes of physically and analytically interesting radial wave equations with power nonlinearities in multi-dimensions. The results consist of two main classifications: all symmetries of point type and all conservation laws of a general energy-momentum type are explicitly determined, including those such as dilations, inversions, similarity energies and conformal energies that exist only for special powers or dimensions. In particular, all variational cases (when a Lagrangian formulation exists) and non-variational cases (when no Lagrangian exists) for these wave equations are considered. As main results, the classification yields generalized energies and radial momenta in certain non-variational cases, which are shown to arise from a new type of Morawetz dilation identity that produces conservation laws for each of the two classes of wave equations in a different way than Noether's theorem.}, language = {en} } @misc{AncoMohiuddinWolf2012, author = {Anco, Stephen and Mohiuddin, Mohammad and Wolf, Thomas}, title = {Travelling waves and conservation laws for complex mKdV-type equations}, issn = {1438-0064}, arxiv = {http://arxiv.org/abs/1110.2403}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-16124}, year = {2012}, abstract = {Travelling waves and conservation laws are studied for a wide class of \$U(1)\$-invariant complex mKdV equations containing the two known integrable generalizations of the ordinary (real) mKdV equation. The main results on travelling waves include deriving new complex solitary waves and kinks that generalize the well-known mKdV \$\sech\$ and \$\tanh\$ solutions. The main results on conservation laws consist of explicitly finding all 1st order conserved densities that yield phase-invariant counterparts of the well-known mKdV conserved densities for momentum, energy, and Galilean energy, and a new conserved density describing the angular twist of complex kink solutions.}, language = {en} } @misc{GoltzFellgiebel2015, author = {Goltz-Fellgiebel, Julia Alexandra}, title = {Mobile Applikationen f{\"u}r Bibliotheken im deutschsprachigen Raum}, edition = {akt. u. erw. 2. Version}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-56241}, pages = {34}, year = {2015}, abstract = {Wir leben in einem digitalen Informationszeitalter, unsere Welt ist gepr{\"a}gt von Bits und Bytes. Unser Alltag wird dabei zunehmend von mobilen technischen Hilfsmitteln bestimmt, das Smartphone ist aus dem allt{\"a}glichen und auch dem beruflichen Leben kaum mehr wegzudenken. F{\"u}r jeden Bedarf gibt es mittlerweile kleine mobile Applikationen (Apps), die das Leben erleichtern sollen. Der digitale Wandel beeinflusst auch die Arbeit und die Ausrichtung von Bibliotheken und anderen Kultureinrichtungen. Neben ihren traditionellen Aufgaben stehen sie vor der Herausforderung, ihre qualitativ hochwertig aufbereiteten Daten und Informationen den Nutzerinnen und Nutzern {\"u}ber webbasierte, also von {\"u}berall zug{\"a}ngliche, f{\"u}r mobile Ger{\"a}te aufbereitete, intuitiv anwendbare und attraktive Dienste anzubieten. Im Zuge der strategischen Allianz, die seit Dezember 2007 zwischen dem Kooperativem Bibliotheksverbund Berlin-Brandenburg (KOBV) und dem Bibliotheksverbund Bayern (BVB) besteht, werden gemeinsame Entwicklungsprojekte durchgef{\"u}hrt. In diesem Rahmen entstand bereits die erste Version der Studie „Mobile Applikationen f{\"u}r Bibliotheken im deutsch-sprachigen Raum" (ZIB-Report 14-06; http://nbn-resolving.de/urn:nbn:de:0297-zib-46931). Das Papier bot einen {\"U}berblick zu den mobilen Angeboten der deutsch-sprachigen Bibliothekslandschaft und arbeitete Mehrwerte, die {\"u}ber die Recherche im lokalen Bibliothekskatalog hinausf{\"u}hrt, f{\"u}r Wissensinstitutionen aus. In der hier vorliegenden zweiten Version werden zus{\"a}tzlich rechtliche Rahmenbedingungen und entwicklungsbezogene Herausforderungen, denen Bibliotheken sich im Umgang mit mobilen Applikationen stellen m{\"u}ssen, beleuchtet. Fakten zur Nutzung mobiler Dienste und die Liste der bibliothekarischen mobilen Angebote wurden aktualisiert, anhand neuer Technologien denkbare zuk{\"u}nftige Mehrwerte f{\"u}r bibliothekarische Applikationen wurden spezifiziert.}, language = {de} } @misc{WeitzmannKlimpel2014, author = {Weitzmann, John H. and Klimpel, Paul}, title = {Rechtliche Rahmenbedingungen f{\"u}r Digitalisierungsprojekte von Ged{\"a}chtnisinstitutionen}, editor = {digiS - Servicestelle Digitalisierung Berlin,}, doi = {10.12752/2.0.002.1}, year = {2014}, abstract = {Kulturerbe- und Ged{\"a}chtnisinstitutionen sammeln, bewahren, dokumentieren und vermitteln Zeugnisse und Objekte des kulturellen Erbes. Die Digitalisierung er{\"o}ffnet f{\"u}r alle diese Handlungsfelder neue M{\"o}glichkeiten, aber gleichzeitig auch neue Herausforderungen. Diese ber{\"u}hren sowohl organisatorische und technische als auch rechtliche Aspekte. Gerade letztere sind oft mit schwer kalkulierbaren Risiken f{\"u}r die Kultureinrichtungen behaftet. Die vorliegende Handreichung, die von iRights im Auftrag der Servicestelle Digitalisierung des Landes Berlin (digiS) erstellt wurde, soll eine Einf{\"u}hrung f{\"u}r die Mitarbeiter der Kulturinstitutionen in die Themen Urheber- und Leistungsschutzrechte sein. Sie soll f{\"u}r rechtliche Risiken sensibilisieren und Handlungsspielr{\"a}ume aufzeigen. Die urspr{\"u}ngliche Version 1.0 wurde im Nachgang des Workshops der Autoren am ZIB noch einmal {\"u}berarbeitet. Neu hinzugekommen sind zwei Abschnitte zu den Themen Archivkopie und elektronischer Leseplatz.}, language = {de} } @misc{MuellerBartholmeiFischeretal.2014, author = {M{\"u}ller, Anja and Bartholmei, Stephan and Fischer, Barbara and Hahn, Helene}, title = {Der GLAM-Hackathon "Coding da Vinci"}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-54566}, year = {2014}, abstract = {Coding da Vinci, der erste deutsche Kultur-Hackathon, wurde gemeinsam von der Open Knowledge Foundation Deutschland, der Servicestelle Digitalisierung Berlin, Wikimedia Deutschland und der Deutschen Digitalen Bibliothek veranstaltet. Zwischen Ende April und Anfang Juli haben 150 Teilnehmer (Coder, Webdesigner, Kulturinteressierte u.a.) an Webseiten, mobilen Apps,Spielen, Hardwareprojekten und anderen Anwendungen offener Daten gearbeitet. Die Daten wurden von 16 Kultur-Einrichtungen bereitgestellt. Im Verlauf des Hackathons wurden daraus 17 funktionsf{\"a}hige Prototypen entwickelt, {\"o}ffentlich pr{\"a}sentiert und f{\"u}nf davon auch pr{\"a}miert.Doch was genau ist ein Hackathon? Wie kommen Kulturinstitutionen und Hacker zusammen? Wie gelangt eine Kulturinstitution zu offenen Daten? Welche Herausforderungen und Chancen bietet ein Hackathon f{\"u}r den Kulturbereich? Welche neue Qualit{\"a}t erw{\"a}chst aus einem partizipativen Zugang zum digitalen Kulturerbe und der M{\"o}glichkeit mit Daten zu arbeiten? Was bleibt zu tun,um die Ergebnisse nachhaltig zu sichern? Diese Fragen sollen anhand der Ergebnisse von CdV diskutiert werden. Unter dem Motto „lessons learned" wagen wir den Ausblick auf Coding da Vinci 2015.}, language = {de} } @article{Quitzsch2014, author = {Quitzsch, Nicole}, title = {Vorbei die Zeiten von Gebrauchsanweisungen f{\"u}r Bibliotheksportale : Nutzerbeteiligung und Co-Design am Beispiel des neuen KOBV-Portals}, volume = {48}, journal = {Bibliotheksdienst}, number = {10}, doi = {10.1515/bd-2014-0097}, pages = {795 -- 806}, year = {2014}, abstract = {Bibliotheken stehen heute mehr denn je vor der Frage, wie sie ihre Dienste attraktiv gestalten k{\"o}nnen. Da liegt es nahe, Nutzerinnen und Nutzer aktiv in den Designprozess einzubinden. Die Neuentwicklung des KOBV-Portals (http://portal.kobv.de), einer regionalen Suche {\"u}ber die Best{\"a}nde der Bibliotheken in Berlin und Brandenburg, geht konsequent den Weg des Co-Designs. Nutzerinnen und Nutzer werden als Entwicklungspartner verstanden. Als Projektpartner wurde das Institut f{\"u}r Bibliotheks- und Informationswissenschaft (IBI) der Humboldt-Universit{\"a}t zu Berlin gewonnen.}, language = {de} } @article{HaslerPetersKottig2013, author = {Hasler, Tim and Peters-Kottig, Wolfgang}, title = {Vorschrift oder Thunfisch? - Zur Langzeitverf{\"u}gbarkeit von Forschungsdaten}, journal = {LIBREAS - Library Ideas}, number = {23}, year = {2013}, language = {de} }