@misc{Fischer, author = {Fischer, Alexander}, title = {An Uncoupling-Coupling Technique for Markov Chain Monte Carlo Methods}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-5720}, number = {00-04}, abstract = {Uncoupling-coupling Monte Carlo (UCMC) combines uncoupling techniques for finite Markov chains with Markov chain Monte Carlo methodology. By determining almost invariant sets of the associated Markov operator, the Monte Carlo sampling splits by a hierarchical annealing process into the essential regions of the state space; therefore UCMC aims at avoiding the typical metastable behavior of Monte Carlo techniques. From the viewpoint of Monte Carlo, a slowly converging long-time Markov chain is replaced by a limited number of rapidly mixing short-time ones. The correct weighting factors for the various Markov chains are obtained via a coupling matrix, that connects the samplings from the different almost invariant sets. The underlying mathematical structure of this approach is given by a general examination of the uncoupling-coupling procedure. Furthermore, the overall algorithmic scheme of UCMC is applied to the \$n\$-pentane molecule, a well-known example from molecular dynamics.}, language = {en} } @misc{SchuetteFischerHuisingaetal., author = {Sch{\"u}tte, Christof and Fischer, Alexander and Huisinga, Wilhelm and Deuflhard, Peter}, title = {A Direct Approach to Conformational Dynamics based on Hybrid Monte Carlo}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-3889}, number = {SC-98-45}, abstract = {Recently, a novel concept for the computation of essential features of the dynamics of Hamiltonian systems (such as molecular dynamics) has been proposed. The realization of this concept had been based on subdivision techniques applied to the Frobenius--Perron operator for the dynamical system. The present paper suggests an alternative but related concept that merges the conceptual advantages of the dynamical systems approach with the appropriate statistical physics framework. This approach allows to define the phrase ``conformation'' in terms of the dynamical behavior of the molecular system and to characterize the dynamical stability of conformations. In a first step, the frequency of conformational changes is characterized in statistical terms leading to the definition of some Markov operator \$T\$ that describes the corresponding transition probabilities within the canonical ensemble. In a second step, a discretization of \$T\$ via specific hybrid Monte Carlo techniques is shown to lead to a stochastic matrix \$P\$. With these theoretical preparations, an identification algorithm for conformations is applicable. It is demonstrated that the discretization of \$T\$ can be restricted to few essential degrees of freedom so that the combinatorial explosion of discretization boxes is prevented and biomolecular systems can be attacked. Numerical results for the n-pentane molecule and the triribonucleotide adenylyl\emph{(3'-5')}cytidylyl\emph{(3'-5')}cytidin are given and interpreted.}, language = {en} } @misc{FischerCordesSchuette, author = {Fischer, Alexander and Cordes, Frank and Sch{\"u}tte, Christof}, title = {Hybrid Monte Carlo with Adaptive Temperature in a Mixed-Canonical Ensemble: Efficient Conformational Analysis of RNA}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-3364}, number = {SC-97-67}, abstract = {A hybrid Monte Carlo method with adaptive temperature choice is presented, which exactly generates the distribution of a mixed-canonical ensemble composed of two canonical ensembles at low and high temperature. The analysis of resulting Markov chains with the reweighting technique shows an efficient sampling of the canonical distribution at low temperature, whereas the high temperature component facilitates conformational transitions, which allows shorter simulation times. \\The algorithm was tested by comparing analytical and numerical results for the small n-butane molecule before simulations were performed for a triribonucleotide. Sampling the complex multi-minima energy landscape of these small RNA segments, we observed enforced crossing of energy barriers.}, language = {en} } @misc{DeuflhardHuisingaFischeretal., author = {Deuflhard, Peter and Huisinga, Wilhelm and Fischer, Alexander and Sch{\"u}tte, Christof}, title = {Identification of Almost Invariant Aggregates in Reversible Nearly Uncoupled Markov Chains}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-3469}, number = {SC-98-03}, abstract = {The topic of the present paper bas been motivated by a recent computational approach to identify chemical conformations and conformational changes within molecular systems. After proper discretization, the conformations show up as almost invariant aggregates in reversible nearly uncoupled Markov chains. Most of the former work on this subject treated the direct problem: given the aggregates, analyze the loose coupling in connection with the computation of the stationary distribution (aggregation/disaggregation techniques). In contrast to that the present paper focuses on the inverse problem: given the system as a whole, identify the almost invariant aggregates together with the associated transition probabilites. A rather simple and robust algorithm is suggested and illustrated by its application to the n-pentane molecule.}, language = {en} } @misc{SchuetteFischerHuisingaetal., author = {Sch{\"u}tte, Christof and Fischer, Alexander and Huisinga, Wilhelm and Deuflhard, Peter}, title = {A Hybrid Monte Carlo Method for Essential Molecular Dynamics}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-3474}, number = {SC-98-04}, abstract = {Recently, a novel concept for the computation of essential features of Hamiltonian systems (such as those arising in molecular dynamics) has been proposed. The realization of that concept was based on subdivision techniques applied to the Frobenius--Perron operator for the dynamical system. The present paper suggests an alternative but related concept based on statistical mechanics, which allows to attack realistic molecular systems. In a first step, the frequency of conformational changes is characterized in statistical terms leading to the definition of some Markov operator \$T\$ that describes the corresponding transition probabilities within the canonical ensemble. In a second step, a discretization of \$T\$ via hybrid Monte Carlo techniques (based on short term subtrajectories only) is shown to lead to a stochastic matrix \$P\$. With these theoretical preparations, an identification algorithm for conformations is applicable (to be presented elsewhere). Numerical results for the n-pentane molecule are given and interpreted.}, language = {en} } @misc{FischerSchuetteDeuflhardetal., author = {Fischer, Alexander and Sch{\"u}tte, Christof and Deuflhard, Peter and Cordes, Frank}, title = {Hierarchical Uncoupling-Coupling of Metastable Conformations}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-6296}, number = {01-03}, abstract = {Uncoupling-coupling Monte Carlo (UCMC) combines uncoupling techniques for finite Markov chains with Markov chain Monte Carlo methodology. UCMC aims at avoiding the typical metastable or trapping behavior of Monte Carlo techniques. From the viewpoint of Monte Carlo, a slowly converging long-time Markov chain is replaced by a limited number of rapidly mixing short-time ones. Therefore, the state space of the chain has to be hierarchically decomposed into its metastable conformations. This is done by means of combining the technique of conformation analysis as recently introduced by the authors, and appropriate annealing strategies. We present a detailed examination of the uncoupling-coupling procedure which uncovers its theoretical background, and illustrates the hierarchical algorithmic approach. Furthermore, application of the UCMC algorithm to the \$n\$-pentane molecule allows us to discuss the effect of its crucial steps in a typical molecular scenario.}, language = {en} } @inproceedings{BockSkibinaFischeretal.2012, author = {Bock, Martin and Skibina, Julia and Fischer, Dorit and Grunwald, R{\"u}diger and Burger, Sven and Beloglazov, Valentin and Steinmeyer, G{\"u}nter}, title = {10-fs pulse delivery through a fiber}, series = {CLEO}, booktitle = {CLEO}, publisher = {Optical Society of America}, doi = {10.1364/CLEO_SI.2012.CTh3G.3}, pages = {CTh3G.3}, year = {2012}, language = {en} } @article{SchuetteFischerHuisingaetal.1999, author = {Sch{\"u}tte, Christof and Fischer, Alexander and Huisinga, Wilhelm and Deuflhard, Peter}, title = {A Direct Approach to Conformational Dynamics Based on Hybrid Monte Carlo}, series = {J. Comput. Phys.}, volume = {151}, journal = {J. Comput. Phys.}, pages = {146 -- 168}, year = {1999}, language = {en} } @article{FischerCordesSchuette1998, author = {Fischer, Alexander and Cordes, Frank and Sch{\"u}tte, Christof}, title = {Hybrid Monte Carlo with Adaptive Temperature in Mixed-Canonical Ensemble: Efficient conformational analysis of RNA}, series = {J. Comp. Chem.}, volume = {19}, journal = {J. Comp. Chem.}, number = {15}, doi = {10.1002/(SICI)1096-987X(19981130)19:15<1689::AID-JCC2>3.0.CO;2-J}, pages = {1689 -- 1697}, year = {1998}, language = {en} } @inproceedings{FischerSchuetteDeuflhardetal.2002, author = {Fischer, Alexander and Sch{\"u}tte, Christof and Deuflhard, Peter and Cordes, Frank}, title = {Hierarchical Uncoupling-Coupling of Metastable Conformations}, series = {Computational Methods for Macromolecules}, booktitle = {Computational Methods for Macromolecules}, number = {24}, editor = {Schlick, T. and Gan, H.}, publisher = {Springer}, pages = {235 -- 259}, year = {2002}, language = {en} } @article{DeuflhardHuisingaFischeretal.2000, author = {Deuflhard, Peter and Huisinga, Wilhelm and Fischer, Alexander and Sch{\"u}tte, Christof}, title = {Identification of Almost Invariant Aggregates in Reversible Nearly Uncoupled Markov Chains}, series = {Lin. Alg. Appl.}, volume = {315}, journal = {Lin. Alg. Appl.}, pages = {39 -- 59}, year = {2000}, language = {en} } @incollection{EnkeFiedlerFischeretal.2013, author = {Enke, Harry and Fiedler, Norman and Fischer, Thomas and Gnadt, Timo and Ketzan, Erik and Ludwig, Jens and Rathmann, Torsten and St{\"o}ckle, Gabriel and Schintke, Florian}, title = {Leitfaden zum Forschungsdaten-Management}, series = {Leitfaden zum Forschungsdaten-Management}, booktitle = {Leitfaden zum Forschungsdaten-Management}, editor = {Enke, Harry and Ludwig, Jens}, publisher = {Verlag Werner H{\"u}lsbusch, Gl{\"u}ckstadt}, year = {2013}, language = {en} } @masterthesis{Fischer, type = {Bachelor Thesis}, author = {Fischer, Jens V.}, title = {A Gossiping Framework for Scalaris}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-50685}, language = {en} } @inproceedings{SkibinaBockFischeretal., author = {Skibina, Julia and Bock, Martin and Fischer, Dorit and Grunwald, R{\"u}diger and Steinmeyer, G{\"u}nter and Wedell, Reiner and Bretschneider, Mario and Burger, Sven and Beloglazov, Valentin}, title = {10-fs fiber based pulse delivery}, series = {Conference on Lasers, Applications, and Technologies (LAT)}, booktitle = {Conference on Lasers, Applications, and Technologies (LAT)}, pages = {LWF5}, language = {en} } @misc{FischerSchlechte, author = {Fischer, Frank and Schlechte, Thomas}, title = {Strong Relaxations for the Train Timetabling Problem using Connected Configurations}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-64743}, abstract = {The task of the train timetabling problem or track allocation problem is to find conflict free schedules for a set of trains with predefined routes in a railway network. Especially for non-periodic instances models based on time expanded networks are often used. Unfortunately, the linear programming relaxation of these models is often extremely weak because these models do not describe combinatorial relations like overtaking possibilities very well. In this paper we extend the model by so called connected configuration subproblems. These subproblems perfectly describe feasible schedules of a small subset of trains (2-3) on consecutive track segments. In a Lagrangian relaxation approach we solve several of these subproblems together in order to produce solutions which consist of combinatorially compatible schedules along the track segments. The computational results on a mostly single track corridor taken from the INFORMS RAS Problem Solving Competition 2012 data indicate that our new solution approach is rather strong. Indeed, for this instance the solution of the Lagrangian relaxation is already integral.}, language = {en} } @article{FischerGoetschelWeiser, author = {Fischer, Lisa and G{\"o}tschel, Sebastian and Weiser, Martin}, title = {Lossy data compression reduces communication time in hybrid time-parallel integrators}, series = {Comput. Vis. Sci.}, volume = {19}, journal = {Comput. Vis. Sci.}, number = {1}, doi = {10.1007/s00791-018-0293-2}, pages = {19 -- 30}, abstract = {Parallel in time methods for solving initial value problems are a means to increase the parallelism of numerical simulations. Hybrid parareal schemes interleaving the parallel in time iteration with an iterative solution of the individual time steps are among the most efficient methods for general nonlinear problems. Despite the hiding of communication time behind computation, communication has in certain situations a significant impact on the total runtime. Here we present strict, yet no sharp, error bounds for hybrid parareal methods with inexact communication due to lossy data compression, and derive theoretical estimates of the impact of compression on parallel efficiency of the algorithms. These and some computational experiments suggest that compression is a viable method to make hybrid parareal schemes robust with respect to low bandwidth setups.}, language = {en} } @misc{Fischer2017, type = {Master Thesis}, author = {Fischer, Lisa}, title = {On the convergence of inexact time parallel time integration}, pages = {61}, year = {2017}, language = {en} } @inproceedings{FischerSchlechte, author = {Fischer, Frank and Schlechte, Thomas}, title = {Strong Relaxations for the Train Timetabling Problem using Connected Configurations}, series = {17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2017)}, volume = {59}, booktitle = {17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2017)}, editor = {D'Angelo, Gianlorenzo and Dollevoet, Twan}, isbn = {978-3-95977-042-2}, doi = {10.4230/OASIcs.ATMOS.2017.11}, abstract = {The task of the train timetabling problem or track allocation problem is to find conflict free schedules for a set of trains with predefined routes in a railway network. Especially for non-periodic instances models based on time expanded networks are often used. Unfortunately, the linear programming relaxation of these models is often extremely weak because these models do not describe combinatorial relations like overtaking possibilities very well. In this paper we extend the model by so called connected configuration subproblems. These subproblems perfectly describe feasible schedules of a small subset of trains (2-3) on consecutive track segments. In a Lagrangian relaxation approach we solve several of these subproblems together in order to produce solutions which consist of combinatorially compatible schedules along the track segments. The computational results on a mostly single track corridor taken from the INFORMS RAS Problem Solving Competition 2012 data indicate that our new solution approach is rather strong. Indeed, for this instance the solution of the Lagrangian relaxation is already integral.}, language = {en} } @inproceedings{FischerGrimmKlugetal., author = {Fischer, Frank and Grimm, Boris and Klug, Torsten and Schlechte, Thomas}, title = {A Re-optimization Approach for Train Dispatching}, series = {Operations Research Proceedings 2016}, booktitle = {Operations Research Proceedings 2016}, doi = {10.1007/978-3-319-55702-1_85}, pages = {645 -- 651}, abstract = {The Train Dispatching Problem (TDP) is to schedule trains through a network in a cost optimal way. Due to disturbances during operation existing track allocations often have to be re-scheduled and integrated into the timetable. This has to be done in seconds and with minimal timetable changes to guarantee smooth and conflict free operation. We present an integrated modeling approach for the re-optimization task using Mixed Integer Programming. Finally, we provide computational results for scenarios provided by the INFORMS RAS Problem Soling Competition 2012.}, language = {en} } @inproceedings{FischerSchlechte2015, author = {Fischer, Frank and Schlechte, Thomas}, title = {Comparing two dual relaxations of large scale train timetabling problems}, series = {Proceedings of Conference on Advanced Systems in Public Transport 2015}, booktitle = {Proceedings of Conference on Advanced Systems in Public Transport 2015}, year = {2015}, abstract = {Railway transportation and in particular train timetabling is one of the basic and source application areas of combinatorial optimization and integer programming. We will discuss two well established modeling techniques for the train timetabling problem. In this paper we focus on one major ingredient - the bounding by dual relaxations. We compare two classical dual relaxations of large scale time expanded train timetabling problems - the Lagrangean Dual and Lagrangean Decomposition. We discuss the convergence behavior and show limitations of the Lagrangean Decomposition approach for a configuration based model. We introduce a third dualization approach to overcome those limitations. Finally, we present promising preliminary computational experiments that show that our new approach indeed has superior convergence properties.}, language = {en} } @misc{FischerGrimmKlugetal., author = {Fischer, Frank and Grimm, Boris and Klug, Torsten and Schlechte, Thomas}, title = {A Re-optimization Approach for Train Dispatching}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-60493}, abstract = {The Train Dispatching Problem (TDP) is to schedule trains through a network in a cost optimal way. Due to disturbances during operation existing track allocations often have to be re-scheduled and integrated into the timetable. This has to be done in seconds and with minimal timetable changes to guarantee smooth and conflict free operation. We present an integrated modeling approach for the re-optimization task using Mixed Integer Programming. Finally, we provide computational results for scenarios provided by the INFORMS RAS Problem Soling Competition 2012.}, language = {en} } @misc{FischerGoetschelWeiser, author = {Fischer, Lisa and G{\"o}tschel, Sebastian and Weiser, Martin}, title = {Lossy data compression reduces communication time in hybrid time-parallel integrators}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-63961}, abstract = {Parallel in time methods for solving initial value problems are a means to increase the parallelism of numerical simulations. Hybrid parareal schemes interleaving the parallel in time iteration with an iterative solution of the individual time steps are among the most efficient methods for general nonlinear problems. Despite the hiding of communication time behind computation, communication has in certain situations a significant impact on the total runtime. Here we present strict, yet no sharp, error bounds for hybrid parareal methods with inexact communication due to lossy data compression, and derive theoretical estimates of the impact of compression on parallel efficiency of the algorithms. These and some computational experiments suggest that compression is a viable method to make hybrid parareal schemes robust with respect to low bandwidth setups.}, language = {en} } @inproceedings{SkibinaIliewBethgeetal.2009, author = {Skibina, Julia and Iliew, Rumen and Bethge, Jens and Bock, Martin and Fischer, Dorit and Beloglazov, Valentin and Wedell, Reiner and Burger, Sven and Steinmeyer, G{\"u}nter}, title = {A chirped photonic crystal fiber for high-fidelity guiding of sub-100 fs pluses}, series = {CLEO/QELS}, booktitle = {CLEO/QELS}, doi = {10.1364/CLEO.2009.CMHH1}, pages = {CMHH1}, year = {2009}, language = {en} } @incollection{CaimiFischerSchlechte, author = {Caimi, Gabrio and Fischer, Frank and Schlechte, Thomas}, title = {Railway Track Allocation}, series = {Handbook of Optimization in the Railway Industry}, volume = {268}, booktitle = {Handbook of Optimization in the Railway Industry}, publisher = {Springer International Publishing}, isbn = {978-3-319-72152-1}, doi = {https://doi.org/10.1007/978-3-319-72153-8}, pages = {141 -- 160}, abstract = {This chapter addresses the classical task to decide which train runs on which track in a railway network. In this context a track allocation defines the precise routing of trains through a railway network, which usually has only a limited capacity. Moreover, the departure and arrival times at the visited stations of each train must simultaneously meet several operational and safety requirements. The problem to find the 'best possible' allocation for all trains is called the track allocation problem (TTP). Railway systems can be modeled on a very detailed scale covering the behavior of individual trains and the safety system to a large extent. However, those microscopic models are too big and not scalable to large networks, which make them inappropriate for mathematical optimization on a network wide level. Hence, most network optimization approaches consider simplified, so called macroscopic, models. In the first part we take a look at the challenge to construct a reliable and condensed macroscopic model for the associated microscopic model and to facilitate the transition between both models of different scale. In the main part we focus on the optimization problem for macroscopic models of the railway system. Based on classical graph-theoretical tools the track allocation problem is formulated to determine conflict-free paths in corresponding time-expanded graphs. We present standard integer programming model formulations for the track allocation problem that model resource or block conflicts in terms of packing constraints. In addition, we discuss the role of maximal clique inequalities and the concept of configuration networks. We will also present classical decomposition approaches like Lagrangian relaxation and bundle methods. Furthermore, we will discuss recently developed techniques, e.g., dynamic graph generation. Finally, we will discuss the status quo and show a vision of mathematical optimization to support real world track allocation, i.e. integrated train routing and scheduling, in a data-dominated and digitized railway future.}, language = {en} } @misc{Fischer, type = {Master Thesis}, author = {Fischer, Jens}, title = {Evaluating the Scalability of Scalaris}, language = {en} } @article{HeinzeDipankarHenkenetal., author = {Heinze, Rieke and Dipankar, Anurag and Henken, Cintia Carbajal and Moseley, Christopher and Sourdeval, Odran and Tr{\"o}mel, Silke and Xie, Xinxin and Adamidis, Panos and Ament, Felix and Baars, Holger and Barthlott, Christian and Behrendt, Andreas and Blahak, Ulrich and Bley, Sebastian and Brdar, Slavko and Brueck, Matthias and Crewell, Susanne and Deneke, Hartwig and Di Girolamo, Paolo and Evaristo, Raquel and Fischer, J{\"u}rgen and Frank, Christopher and Friederichs, Petra and G{\"o}cke, Tobias and Gorges, Ksenia and Hande, Luke and Hanke, Moritz and Hansen, Akio and Hege, Hans-Christian and Hose, Corinna and Jahns, Thomas and Kalthoff, Norbert and Klocke, Daniel and Kneifel, Stefan and Knippertz, Peter and Kuhn, Alexander and van Laar, Thriza and Macke, Andreas and Maurer, Vera and Mayer, Bernhard and Meyer, Catrin I. and Muppa, Shravan K. and Neggers, Roeland A. J. and Orlandi, Emiliano and Pantillon, Florian and Pospichal, Bernhard and R{\"o}ber, Niklas and Scheck, Leonhard and Seifert, Axel and Seifert, Patric and Senf, Fabian and Siligam, Pavan and Simmer, Clemens and Steinke, Sandra and Stevens, Bjorn and Wapler, Kathrin and Weniger, Michael and Wulfmeyer, Volker and Z{\"a}ngl, G{\"u}nther and Zhang, Dan and Quaas, Johannes}, title = {Large-eddy simulations over Germany using ICON: a comprehensive evaluation}, series = {Quarterly Journal of the Royal Meteorological Society}, volume = {143}, journal = {Quarterly Journal of the Royal Meteorological Society}, number = {702}, doi = {10.1002/qj.2947}, pages = {69 -- 100}, abstract = {Large-eddy simulations (LES) with the new ICOsahedral Non-hydrostatic atmosphere model (ICON) covering Germany are evaluated for four days in spring 2013 using observational data from various sources. Reference simulations with the established Consortium for Small-scale Modelling (COSMO) numerical weather prediction model and further standard LES codes are performed and used as a reference. This comprehensive evaluation approach covers multiple parameters and scales, focusing on boundary-layer variables, clouds and precipitation. The evaluation points to the need to work on parametrizations influencing the surface energy balance, and possibly on ice cloud microphysics. The central purpose for the development and application of ICON in the LES configuration is the use of simulation results to improve the understanding of moist processes, as well as their parametrization in climate models. The evaluation thus aims at building confidence in the model's ability to simulate small- to mesoscale variability in turbulence, clouds and precipitation. The results are encouraging: the high-resolution model matches the observed variability much better at small- to mesoscales than the coarser resolved reference model. In its highest grid resolution, the simulated turbulence profiles are realistic and column water vapour matches the observed temporal variability at short time-scales. Despite being somewhat too large and too frequent, small cumulus clouds are well represented in comparison with satellite data, as is the shape of the cloud size spectrum. Variability of cloud water matches the satellite observations much better in ICON than in the reference model. In this sense, it is concluded that the model is fit for the purpose of using its output for parametrization development, despite the potential to improve further some important aspects of processes that are also parametrized in the high-resolution model.}, language = {en} } @article{BockSkibinaFischeretal.2013, author = {Bock, Martin and Skibina, Julia and Fischer, Dorit and Bretschneider, Mario and Wedell, Reiner and Grunwald, R{\"u}diger and Burger, Sven and Beloglazov, Valentin and Steinmeyer, G{\"u}nter}, title = {Nanostructured fibers for sub-10 fs optical pulse delivery}, series = {Laser \& Photonics Reviews}, volume = {7}, journal = {Laser \& Photonics Reviews}, doi = {10.1002/lpor.201300006}, pages = {566 -- 570}, year = {2013}, language = {en} } @article{KramerKreisbeckRihaetal., author = {Kramer, Tobias and Kreisbeck, Christoph and Riha, Christian and Chiatti, Olivio and Buchholz, Sven and Wieck, Andreas and Reuter, Dirk and Fischer, Saskia}, title = {Thermal energy and charge currents in multi-terminal nanorings}, series = {AIP Advances}, volume = {6}, journal = {AIP Advances}, doi = {10.1063/1.4953812}, pages = {065306}, abstract = {We study in experiment and theory thermal energy and charge transfer close to the quantum limit in a ballistic nanodevice, consisting of multiply connected one-dimensional electron waveguides. The fabricated device is based on an AlGaAs/GaAs heterostructure and is covered by a global top-gate to steer the thermal energy and charge transfer in the presence of a temperature gradient, which is established by a heating current. The estimate of the heat transfer by means of thermal noise measurements shows the device acting as a switch for charge and thermal energy transfer. The wave-packet simulations are based on the multi-terminal Landauer-B{\"u}ttiker approach and confirm the experimental finding of a mode-dependent redistribution of the thermal energy current, if a scatterer breaks the device symmetry.}, language = {en} } @misc{FischerSchlechte, author = {Fischer, Frank and Schlechte, Thomas}, title = {Comparing two dual relaxations of large scale train timetabling problems}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-56068}, abstract = {Railway transportation and in particular train timetabling is one of the basic and source application areas of combinatorial optimization and integer programming. We will discuss two well established modeling techniques for the train timetabling problem. In this paper we focus on one major ingredient - the bounding by dual relaxations. We compare two classical dual relaxations of large scale time expanded train timetabling problems - the Lagrangean Dual and Lagrangean Decomposition. We discuss the convergence behavior and show limitations of the Lagrangean Decomposition approach for a configuration based model. We introduce a third dualization approach to overcome those limitations. Finally, we present promising preliminary computational experiments that show that our new approach indeed has superior convergence properties.}, language = {en} } @article{KoschekDurmazKrylovaetal., author = {Koschek, and Durmaz, Vedat and Krylova, and Wieczorek, and Gupta, Pooja and Richter, and Bujotzek, Alexander and Fischer, and Haag, Rainer and Freund, and Weber, Marcus and Rademann,}, title = {Peptide polymer ligands for a tandem WW-domain, a soft multivalent protein-protein interaction: lessons on the thermodynamic fitness of flexible ligands}, series = {Beilstein J. Org. Chem.}, volume = {11}, journal = {Beilstein J. Org. Chem.}, pages = {837 -- 847}, language = {en} } @inproceedings{SkibinaIliewBethgeetal., author = {Skibina, Julia and Iliew, Rumen and Bethge, Jens and Bock, Martin and Fischer, Dorit and Beloglazov, Valentin and Wedell, Reiner and Burger, Sven and Steinmeyer, G{\"u}nter}, title = {A chirped photonic crystal fiber for ultrashort laser pulse delivery}, series = {CLEO Europe - EQEC}, booktitle = {CLEO Europe - EQEC}, doi = {10.1109/CLEOE-EQEC.2009.5196579}, language = {en} } @misc{MuellerBartholmeiFischeretal., 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}, 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{WeberFischerDamerauetal., author = {Weber, Marie-Christin and Fischer, Lisa and Damerau, Alexandra and Ponomarev, Igor and Pfeiffenberger, Moritz and Gaber, Timo and G{\"o}tschel, Sebastian and Lang, Jens and R{\"o}blitz, Susanna and Buttgereit, Frank and Ehrig, Rainald and Lang, Annemarie}, title = {In vitro and in silico modeling of cellular and matrix-related changes during the early phase of osteoarthritis}, series = {BioRxiv}, journal = {BioRxiv}, doi = {10.1101/725317}, abstract = {Understanding the pathophysiological processes of osteoarthritis (OA) require adequate model systems. Although different in vitro or in vivo models have been described, further comprehensive approaches are needed to study specific parts of the disease. This study aimed to combine in vitro and in silico modeling to describe cellular and matrix-related changes during the early phase of OA. We developed an in vitro OA model based on scaffold-free cartilage-like constructs (SFCCs), which was mathematically modeled using a partial differential equation (PDE) system to resemble the processes during the onset of OA. SFCCs were produced from mesenchymal stromal cells and analyzed weekly by histology and qPCR to characterize the cellular and matrix-related composition. To simulate the early phase of OA, SFCCs were treated with interleukin-1β (IL-1β), tumor necrosis factor α (TNFα) and examined after 3 weeks or cultivated another 3 weeks without inflammatory cytokines to validate the regeneration potential. Mathematical modeling was performed in parallel to the in vitro experiments. SFCCs expressed cartilage-specific markers, and after stimulation an increased expression of inflammatory markers, matrix degrading enzymes, a loss of collagen II (Col-2) and a reduced cell density was observed which could be partially reversed by retraction of stimulation. Based on the PDEs, the distribution processes within the SFCCs, including those of IL-1β, Col-2 degradation and cell number reduction was simulated. By combining in vitro and in silico methods, we aimed to develop a valid, efficient alternative approach to examine and predict disease progression and new therapeutic strategies.}, language = {en} } @article{LangFischerWeberetal., author = {Lang, Annemarie and Fischer, Lisa and Weber, Marie-Christin and Gaber, Timo and Ehrig, Rainald and R{\"o}blitz, Susanna and Buttgereit, Frank}, title = {Combining in vitro simulation and in silico modelling towards a sophisticated human osteoarthritis model}, series = {Osteoarthritis and Cartilage}, volume = {27}, journal = {Osteoarthritis and Cartilage}, doi = {10.1016/j.joca.2019.02.277}, pages = {S183}, abstract = {Our project aimed at building an in silico model based on our recently developed in vitro osteoarthritis (OA) model seeking for refinement of the model to enhance validity and translatability towards the more sophisticated simulation of OA. In detail, the previously 3D in vitro model is based on 3D chondrogenic constructs generated solely from human bone marrow derived mesenchymal stromal cells (hMSCs). Besides studying the normal state of the model over 3 weeks, the in vitro model was treated with interleukin-1β (IL-1β) and tumor necrosis factor alpha (TNFα) to mimic an OA-like environment.}, language = {en} } @article{WeberFischerDamerauetal., author = {Weber, Marie-Christin and Fischer, Lisa and Damerau, Alexandra and Ponomarev, Igor and Pfeiffenberger, Moritz and Gaber, Timo and G{\"o}tschel, Sebastian and Lang, Jens and R{\"o}blitz, Susanna and Buttgereit, Frank and Ehrig, Rainald and Lang, Annemarie}, title = {Macroscale mesenchymal condensation to study cytokine-driven cellular and matrix-related changes during cartilage degradation}, series = {Biofabrication}, volume = {12}, journal = {Biofabrication}, number = {4}, doi = {10.1088/1758-5090/aba08f}, abstract = {Understanding the pathophysiological processes of cartilage degradation requires adequate model systems to develop therapeutic strategies towards osteoarthritis (OA). Although different in vitro or in vivo models have been described, further comprehensive approaches are needed to study specific disease aspects. This study aimed to combine in vitro and in silico modeling based on a tissue-engineering approach using mesenchymal condensation to mimic cytokine-induced cellular and matrix-related changes during cartilage degradation. Thus, scaffold-free cartilage-like constructs (SFCCs) were produced based on self-organization of mesenchymal stromal cells (mesenchymal condensation) and i) characterized regarding their cellular and matrix composition or secondly ii) treated with interleukin-1β (IL-1β) and tumor necrosis factor α (TNFα) for 3 weeks to simulate OA-related matrix degradation. In addition, an existing mathematical model based on partial differential equations was optimized and transferred to the underlying settings to simulate distribution of IL-1β, type II collagen degradation and cell number reduction. By combining in vitro and in silico methods, we aim to develop a valid, efficient alternative approach to examine and predict disease progression and effects of new therapeutics.}, language = {en} } @article{FischerEhrigSchaeferetal., author = {Fischer, Sophie and Ehrig, Rainald and Sch{\"a}fer, Stefan and Tronci, Enrico and Mancini, Toni and Egli, Marcel and Ille, Fabian and Kr{\"u}ger, Tillmann H. C. and Leeners, Brigitte and R{\"o}blitz, Susanna}, title = {Mathematical Modelling and Simulation Provides Evidence for New Strategies of Ovarian Stimulation}, series = {Frontiers in Endocrinology}, volume = {12}, journal = {Frontiers in Endocrinology}, doi = {10.3389/fendo.2021.613048}, abstract = {New approaches to ovarian stimulation protocols, such as luteal start, random start or double stimulation, allow for flexibility in ovarian stimulation at different phases of the menstrual cycle which is especially useful when time for assisted reproductive technology is limited, e.g. for emergency fertility preservation in cancer patients. It has been proposed that the success of these methods is based on the continuous growth of multiple cohorts ("waves") of follicles throughout the menstrual cycle which leads to the availability of ovarian follicles for ovarian controlled stimulation at several time points. Though several preliminary studies have been published, their scientific evidence has not been considered as being strong enough to integrate these results into routine clinical practice. This work aims at adding further scientific evidence about the efficiency of variable-start protocols and underpinning the theory of follicular waves by using mathematical modelling and numerical simulations. For this purpose, we have modified and coupled two previously published models, one describing the time course of hormones and one describing competitive follicular growth in a normal menstrual cycle. The coupled model is used to test stimulation protocols in silico. Simulation results show the occurrence of follicles in a wave-like manner during a normal menstrual cycle and qualitatively predict the outcome of ovarian stimulation initiated at different time points of the menstrual cycle.}, language = {en} } @book{AbbinkBaermannBešinovicetal., author = {Abbink, Erwin and B{\"a}rmann, Andreas and Bešinovic, Nikola and Bohlin, Markus and Cacchiani, Valentina and Caimi, Gabrio and de Fabris, Stefano and Dollevoet, Twan and Fischer, Frank and F{\"u}genschuh, Armin and Galli, Laura and Goverde, Rob M.P. and Hansmann, Ronny and Homfeld, Henning and Huisman, Dennis and Johann, Marc and Klug, Torsten and T{\"o}rnquist Krasemann, Johanna and Kroon, Leo and Lamorgese, Leonardo and Liers, Frauke and Mannino, Carlo and Medeossi, Giorgio and Pacciarelli, Dario and Reuther, Markus and Schlechte, Thomas and Schmidt, Marie and Sch{\"o}bel, Anita and Sch{\"u}lldorf, Hanno and Stieber, Anke and Stiller, Sebastian and Toth, Paolo and Zimmermann, Uwe}, title = {Handbook of Optimization in the Railway Industry}, volume = {268}, editor = {Bornd{\"o}rfer, Ralf and Klug, Torsten and Lamorgese, Leonardo and Mannino, Carlo and Reuther, Markus and Schlechte, Thomas}, publisher = {Springer Verlag}, isbn = {978-3-319-72152-1}, doi = {10.1007/978-3-319-72153-8}, abstract = {This book promotes the use of mathematical optimization and operations research methods in rail transportation. The editors assembled thirteen contributions from leading scholars to present a unified voice, standardize terminology, and assess the state-of-the-art. There are three main clusters of articles, corresponding to the classical stages of the planning process: strategic, tactical, and operational. These three clusters are further subdivided into five parts which correspond to the main phases of the railway network planning process: network assessment, capacity planning, timetabling, resource planning, and operational planning. Individual chapters cover: Simulation Capacity Assessment Network Design Train Routing Robust Timetabling Event Scheduling Track Allocation Blocking Shunting Rolling Stock Crew Scheduling Dispatching Delay Propagation}, language = {en} } @article{GarciaSantiagoHammerschmidtSachsetal., author = {Garcia Santiago, Xavier and Hammerschmidt, Martin and Sachs, Johannes and Burger, Sven and Kwon, Hyunah and Kn{\"o}ller, Marvin and Arens, Tilo and Fischer, Peer and Fernandez-Corbaton, Ivan and Rockstuhl, Carsten}, title = {Toward maximally electromagnetically chiral scatterers at optical frequencies}, series = {ACS Photonics}, volume = {9}, journal = {ACS Photonics}, doi = {10.1021/acsphotonics.1c01887}, pages = {1954}, language = {en} } @article{FischerHolzhausenRoeblitz, author = {Fischer-Holzhausen, Sophie and R{\"o}blitz, Susanna}, title = {Hormonal regulation of ovarian follicle growth in humans: Model-based exploration of cycle variability and parameter sensitivities}, series = {Journal of Theoretical Biology}, journal = {Journal of Theoretical Biology}, doi = {https://doi.org/10.1016/j.jtbi.2022.111150}, abstract = {We present a modelling and simulation framework for the dynamics of ovarian follicles and key hormones along the hypothalamic-pituitary-gonadal axis throughout consecutive human menstrual cycles. All simulation results (hormone concentrations and ovarian follicle sizes) are in biological units and can easily be compared to clinical data. The model takes into account variability in follicles' response to stimulating hormones, which introduces variability between cycles. The growth of ovarian follicles in waves is an emergent property in our model simulations and further supports the hypothesis that follicular waves are also present in humans. We use Approximate Bayesian Computation and cluster analysis to construct a population of virtual subjects and to study parameter distributions and sensitivities. The model can be used to compare and optimize treatment protocols for ovarian hyperstimulation, thus potentially forming the integral part of a clinical decision support system in reproductive endocrinology.}, language = {en} } @article{FischerHolzhausenRoeblitz, author = {Fischer-Holzhausen, Sophie and R{\"o}blitz, Susanna}, title = {Mathematical modelling of follicular growth and ovarian stimulation}, series = {Current Opinion in Endocrine and Metabolic Research}, journal = {Current Opinion in Endocrine and Metabolic Research}, doi = {https://doi.org/10.1016/j.coemr.2022.100385}, language = {en} } @article{GorgullaDasLeighetal., author = {Gorgulla, Christoph and Das, Krishna M. Padmanabha and Leigh, Kendra E and Cespugli, Marco and Fischer, Patrick D. and Wang, Zi-Fu and Tesseyre, Guilhem and Pandita, Shreya and Shnapir, Alex and Calderaio, Anthony and Hutcheson, Colin and Gechev, Minko and Rose, Alexander and Lewis, Noam and Yaffe, Erez and Luxenburg, Roni and Herce, Henry D. and Durmaz, Vedat and Halazonetis, Thanos D. and Fackeldey, Konstantin and Patten, Justin J. and Chuprina, Alexander and Dziuba, Igor and Plekhova, Alla and Moroz, Yurii and Radchenko, Dmytro and Tarkhanova, Olga and Yavnyuk, Irina and Gruber, Christian C. and Yust, Ryan and Payne, Dave and N{\"a}{\"a}r, Anders M. and Namchuk, Mark N. and Davey, Robert A. and Wagner, Gerhard and Kinney, Jamie and Arthanari, Haribabu}, title = {A Multi-Pronged Approach Targeting SARS-CoV-2 Proteins Using Ultra-Large Virtual Screening}, series = {iScience}, volume = {24}, journal = {iScience}, number = {2}, publisher = {CellPress}, doi = {10.26434/chemrxiv.12682316}, pages = {102021}, abstract = {Severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2), previously known as 2019 novel coronavirus (2019-nCoV), has spread rapidly across the globe, creating an unparalleled global health burden and spurring a deepening economic crisis. As of July 7th, 2020, almost seven months into the outbreak, there are no approved vaccines and few treatments available. Developing drugs that target multiple points in the viral life cycle could serve as a strategy to tackle the current as well as future coronavirus pandemics. Here we leverage the power of our recently developed in silico screening platform, VirtualFlow, to identify inhibitors that target SARS-CoV-2. VirtualFlow is able to efficiently harness the power of computing clusters and cloud-based computing platforms to carry out ultra-large scale virtual screens. In this unprecedented structure-based multi-target virtual screening campaign, we have used VirtualFlow to screen an average of approximately 1 billion molecules against each of 40 different target sites on 17 different potential viral and host targets in the cloud. In addition to targeting the active sites of viral enzymes, we also target critical auxiliary sites such as functionally important protein-protein interaction interfaces. This multi-target approach not only increases the likelihood of finding a potent inhibitor, but could also help identify a collection of anti-coronavirus drugs that would retain efficacy in the face of viral mutation. Drugs belonging to different regimen classes could be combined to develop possible combination therapies, and top hits that bind at highly conserved sites would be potential candidates for further development as coronavirus drugs. Here, we present the top 200 in silico hits for each target site. While in-house experimental validation of some of these compounds is currently underway, we want to make this array of potential inhibitor candidates available to researchers worldwide in consideration of the pressing need for fast-tracked drug development.}, language = {en} } @article{GorgullaBoeszoermnyiWangetal., author = {Gorgulla, Christoph and Boeszoermnyi, Andras and Wang, Zi-Fu and Fischer, Patrick D. and Coote, Paul and Das, Krishna M. Padmanabha and Malets, Yehor S. and Radchenko, Dmytro S. and Moroz, Yurii and Scott, David A. and Fackeldey, Konstantin and Hoffmann, Moritz and Iavniuk, Iryna and Wagner, Gerhard and Arthanari, Haribabu}, title = {An open-source drug discovery platform enables ultra-large virtual screens}, series = {Nature}, volume = {580}, journal = {Nature}, publisher = {Springer Nature}, doi = {https://doi.org/10.1038/s41586-020-2117-z}, pages = {663 -- 668}, abstract = {On average, an approved drug today costs \$2-3 billion and takes over ten years to develop1. In part, this is due to expensive and time-consuming wet-lab experiments, poor initial hit compounds, and the high attrition rates in the (pre-)clinical phases. Structure-based virtual screening (SBVS) has the potential to mitigate these problems. With SBVS, the quality of the hits improves with the number of compounds screened2. However, despite the fact that large compound databases exist, the ability to carry out large-scale SBVSs on computer clusters in an accessible, efficient, and flexible manner has remained elusive. Here we designed VirtualFlow, a highly automated and versatile open-source platform with perfect scaling behaviour that is able to prepare and efficiently screen ultra-large ligand libraries of compounds. VirtualFlow is able to use a variety of the most powerful docking programs. Using VirtualFlow, we have prepared the largest and freely available ready-to-dock ligand library available, with over 1.4 billion commercially available molecules. To demonstrate the power of VirtualFlow, we screened over 1 billion compounds and discovered a small molecule inhibitor (iKeap1) that engages KEAP1 with nanomolar affinity (Kd = 114 nM) and disrupts the interaction between KEAP1 and the transcription factor NRF2. We also identified a set of structurally diverse molecules that bind to KEAP1 with submicromolar affinity. This illustrates the potential of VirtualFlow to access vast regions of the chemical space and identify binders with high affinity for target proteins.}, language = {en} } @article{GorgullaCınaroğluFischeretal., author = {Gorgulla, Christoph and {\c{C}}{\i}naroğlu, S{\"u}leyman and Fischer, Patrick D. and Fackeldey, Konstantin and Wagner, Gerhard and Arthanari, Haribabu}, title = {VirtualFlow Ants—Ultra-Large Virtual Screenings with Artificial Intelligence Driven Docking Algorithm Based on Ant Colony Optimization}, series = {Special Issue Artificial Intelligence \& Deep Learning Approaches for Structural Bioinformatics}, volume = {22}, journal = {Special Issue Artificial Intelligence \& Deep Learning Approaches for Structural Bioinformatics}, number = {11}, doi = {https://doi.org/10.3390/ijms22115807}, pages = {5807}, abstract = {The docking program PLANTS, which is based on ant colony optimization (ACO) algorithm, has many advanced features for molecular docking. Among them are multiple scoring functions, the possibility to model explicit displaceable water molecules, and the inclusion of experimental constraints. Here, we add support of PLANTS to VirtualFlow (VirtualFlow Ants), which adds a valuable method for primary virtual screenings and rescoring procedures. Furthermore, we have added support of ligand libraries in the MOL2 format, as well as on the fly conversion of ligand libraries which are in the PDBQT format to the MOL2 format to endow VirtualFlow Ants with an increased flexibility regarding the ligand libraries. The on the fly conversion is carried out with Open Babel and the program SPORES. We applied VirtualFlow Ants to a test system involving KEAP1 on the Google Cloud up to 128,000 CPUs, and the observed scaling behavior is approximately linear. Furthermore, we have adjusted several central docking parameters of PLANTS (such as the speed parameter or the number of ants) and screened 10 million compounds for each of the 10 resulting docking scenarios. We analyzed their docking scores and average docking times, which are key factors in virtual screenings. The possibility of carrying out ultra-large virtual screening with PLANTS via VirtualFlow Ants opens new avenues in computational drug discovery.}, language = {en} } @article{MeerbachSchuetteFischer2005, author = {Meerbach, E. and Sch{\"u}tte, Christof and Fischer, Alexander}, title = {Eigenvalue Bounds on Restrictions of Reversible Nearly Uncoupled Markov Chains}, series = {Lin. Alg. Appl.}, volume = {398}, journal = {Lin. Alg. Appl.}, doi = {10.1016/j.laa.2004.10.018}, pages = {141 -- 160}, year = {2005}, language = {en} } @article{HorenkoDittmerFischeretal.2006, author = {Horenko, Illia and Dittmer, E. and Fischer, Alexander and Sch{\"u}tte, Christof}, title = {Automated Model Reduction for Complex Systems exhibiting Metastability}, series = {Mult. Mod. Sim.}, volume = {5}, journal = {Mult. Mod. Sim.}, number = {3}, doi = {10.1137/050623310}, pages = {802 -- 827}, year = {2006}, language = {en} } @article{FischerCordesSchuette1998, author = {Fischer, Alexander and Cordes, Frank and Sch{\"u}tte, Christof}, title = {Hybrid Monte Carlo with adaptive temperature in mixed-canonical ensemble}, series = {J. Comp. Chem.}, volume = {19}, journal = {J. Comp. Chem.}, number = {15}, doi = {10.1002/(SICI)1096-987X(19981130)19:15<1689::AID-JCC2>3.0.CO;2-J}, pages = {1689 -- 1697}, year = {1998}, language = {en} } @article{SchuetteFischerHuisingaetal.1999, author = {Sch{\"u}tte, Christof and Fischer, Alexander and Huisinga, Wilhelm and Deuflhard, Peter}, title = {A Direct Approach to Conformational Dynamics based on Hybrid Monte Carlo}, series = {J. Comp. Phys}, volume = {151}, journal = {J. Comp. Phys}, number = {1}, doi = {10.1006/jcph.1999.6231}, pages = {146 -- 168}, year = {1999}, language = {en} } @article{FischerCordesSchuette1999, author = {Fischer, Alexander and Cordes, Frank and Sch{\"u}tte, Christof}, title = {Hybrid Monte Carlo with adaptive temperature choice}, series = {Comp. Phys. Comm.}, volume = {121}, journal = {Comp. Phys. Comm.}, doi = {10.1016/S0010-4655(99)00274-X}, pages = {37 -- 39}, year = {1999}, language = {en} } @inproceedings{FischerSchuetteDeuflhardetal.2002, author = {Fischer, Alexander and Sch{\"u}tte, Christof and Deuflhard, Peter and Cordes, Frank}, title = {Hierarchical Uncoupling-Coupling of Metastable Conformations}, series = {Computational Methods for Macromolecules}, volume = {24}, booktitle = {Computational Methods for Macromolecules}, editor = {Schlick, T. and Gan, H.}, publisher = {Springer}, pages = {235 -- 259}, year = {2002}, language = {en} } @article{DeuflhardHuisingaFischeretal.2000, author = {Deuflhard, Peter and Huisinga, Wilhelm and Fischer, Alexander and Sch{\"u}tte, Christof}, title = {Identification of Almost Invariant Aggregates in Reversible Nearly Uncoupled Markov Chains}, series = {Lin. Alg. Appl.}, volume = {315}, journal = {Lin. Alg. Appl.}, number = {1-3}, doi = {10.1016/S0024-3795(00)00095-1}, pages = {39 -- 59}, year = {2000}, language = {en} } @inproceedings{SchuetteForsterMeerbachetal.2005, author = {Sch{\"u}tte, Christof and Forster, R. and Meerbach, E. and Fischer, Alexander}, title = {Uncoupling-Coupling Techniques for Metastable Dynamical Systems}, series = {Domain Decomposition Methods in Science and Engineering}, volume = {40}, booktitle = {Domain Decomposition Methods in Science and Engineering}, editor = {Kornhuber, Ralf and Hoppe, Ronald H. W. and P{\~A}\copyrightriaux, J. and Pironneau, O. and Widlund, Olof and Xu, J.}, publisher = {Springer}, pages = {115 -- 129}, year = {2005}, language = {en} } @article{FischerWaldhausenHorenkoetal.2007, author = {Fischer, Alexander and Waldhausen, S. and Horenko, Illia and Meerbach, E. and Sch{\"u}tte, Christof}, title = {Identification of Biomolecular Conformations from Incomplete Torsion Angle Observations by Hidden Markov Models}, series = {J. Comp. Chem.}, volume = {28}, journal = {J. Comp. Chem.}, number = {15}, doi = {10.1002/jcc.20692}, pages = {2453 -- 2464}, year = {2007}, language = {en} } @misc{MaherFischerGallyetal., author = {Maher, Stephen J. and Fischer, Tobias and Gally, Tristan and Gamrath, Gerald and Gleixner, Ambros and Gottwald, Robert Lion and Hendel, Gregor and Koch, Thorsten and L{\"u}bbecke, Marco and Miltenberger, Matthias and M{\"u}ller, Benjamin and Pfetsch, Marc and Puchert, Christian and Rehfeldt, Daniel and Schenker, Sebastian and Schwarz, Robert and Serrano, Felipe and Shinano, Yuji and Weninger, Dieter and Witt, Jonas T. and Witzig, Jakob}, title = {The SCIP Optimization Suite 4.0}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-62170}, abstract = {The SCIP Optimization Suite is a powerful collection of optimization software that consists of the branch-cut-and-price framework and mixed-integer programming solver SCIP, the linear programming solver SoPlex, the modeling language Zimpl, the parallelization framework UG, and the generic branch-cut-and-price solver GCG. Additionally, it features the extensions SCIP-Jack for solving Steiner tree problems, PolySCIP for solving multi-objective problems, and SCIP-SDP for solving mixed-integer semidefinite programs. The SCIP Optimization Suite has been continuously developed and has now reached version 4.0. The goal of this report is to present the recent changes to the collection. We not only describe the theoretical basis, but focus on implementation aspects and their computational consequences.}, language = {en} } @misc{GamrathFischerGallyetal., author = {Gamrath, Gerald and Fischer, Tobias and Gally, Tristan and Gleixner, Ambros and Hendel, Gregor and Koch, Thorsten and Maher, Stephen J. and Miltenberger, Matthias and M{\"u}ller, Benjamin and Pfetsch, Marc and Puchert, Christian and Rehfeldt, Daniel and Schenker, Sebastian and Schwarz, Robert and Serrano, Felipe and Shinano, Yuji and Vigerske, Stefan and Weninger, Dieter and Winkler, Michael and Witt, Jonas T. and Witzig, Jakob}, title = {The SCIP Optimization Suite 3.2}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-57675}, abstract = {The SCIP Optimization Suite is a software toolbox for generating and solving various classes of mathematical optimization problems. Its major components are the modeling language ZIMPL, the linear programming solver SoPlex, the constraint integer programming framework and mixed-integer linear and nonlinear programming solver SCIP, the UG framework for parallelization of branch-and-bound-based solvers, and the generic branch-cut-and-price solver GCG. It has been used in many applications from both academia and industry and is one of the leading non-commercial solvers. This paper highlights the new features of version 3.2 of the SCIP Optimization Suite. Version 3.2 was released in July 2015. This release comes with new presolving steps, primal heuristics, and branching rules within SCIP. In addition, version 3.2 includes a reoptimization feature and improved handling of quadratic constraints and special ordered sets. SoPlex can now solve LPs exactly over the rational number and performance improvements have been achieved by exploiting sparsity in more situations. UG has been tested successfully on 80,000 cores. A major new feature of UG is the functionality to parallelize a customized SCIP solver. GCG has been enhanced with a new separator, new primal heuristics, and improved column management. Finally, new and improved extensions of SCIP are presented, namely solvers for multi-criteria optimization, Steiner tree problems, and mixed-integer semidefinite programs.}, language = {en} } @article{SchimunekSeidlElezetal.2023, author = {Schimunek, Johannes and Seidl, Philipp and Elez, Katarina and Hempel, Tim and Le, Tuan and No{\´e}, Frank and Olsson, Simon and Raich, Llu{\´i}s and Winter, Robin and Gokcan, Hatice and Gusev, Filipp and Gutkin, Evgeny M. and Isayev, Olexandr and Kurnikova, Maria G. and Narangoda, Chamali H. and Zubatyuk, Roman and Bosko, Ivan P. and Furs, Konstantin V. and Karpenko, Anna D. and Kornoushenko, Yury V. and Shuldau, Mikita and Yushkevich, Artsemi and Benabderrahmane, Mohammed B. and Bousquet-Melou, Patrick and Bureau, Ronan and Charton, Beatrice and Cirou, Bertrand C. and Gil, G{\´e}rard and Allen, William J. and Sirimulla, Suman and Watowich, Stanley and Antonopoulos, Nick and Epitropakis, Nikolaos and Krasoulis, Agamemnon and Itsikalis, Vassilis and Theodorakis, Stavros and Kozlovskii, Igor and Maliutin, Anton and Medvedev, Alexander and Popov, Petr and Zaretckii, Mark and Eghbal-Zadeh, Hamid and Halmich, Christina and Hochreiter, Sepp and Mayr, Andreas and Ruch, Peter and Widrich, Michael and Berenger, Francois and Kumar, Ashutosh and Yamanishi, Yoshihiro and Zhang, Kam Y. J. and Bengio, Emmanuel and Bengio, Yoshua and Jain, Moksh J. and Korablyov, Maksym and Liu, Cheng-Hao and Marcou, Gilles and Glaab, Enrico and Barnsley, Kelly and Iyengar, Suhasini M. and Ondrechen, Mary Jo and Haupt, V. Joachim and Kaiser, Florian and Schroeder, Michael and Pugliese, Luisa and Albani, Simone and Athanasiou, Christina and Beccari, Andrea and Carloni, Paolo and D'Arrigo, Giulia and Gianquinto, Eleonora and Goßen, Jonas and Hanke, Anton and Joseph, Benjamin P. and Kokh, Daria B. and Kovachka, Sandra and Manelfi, Candida and Mukherjee, Goutam and Mu{\~n}iz-Chicharro, Abraham and Musiani, Francesco and Nunes-Alves, Ariane and Paiardi, Giulia and Rossetti, Giulia and Sadiq, S. Kashif and Spyrakis, Francesca and Talarico, Carmine and Tsengenes, Alexandros and Wade, Rebecca C. and Copeland, Conner and Gaiser, Jeremiah and Olson, Daniel R. and Roy, Amitava and Venkatraman, Vishwesh and Wheeler, Travis J. and Arthanari, Haribabu and Blaschitz, Klara and Cespugli, Marco and Durmaz, Vedat and Fackeldey, Konstantin and Fischer, Patrick D. and Gorgulla, Christoph and Gruber, Christian and Gruber, Karl and Hetmann, Michael and Kinney, Jamie E. and Padmanabha Das, Krishna M. and Pandita, Shreya and Singh, Amit and Steinkellner, Georg and Tesseyre, Guilhem and Wagner, Gerhard and Wang, Zi-Fu and Yust, Ryan J. and Druzhilovskiy, Dmitry S. and Filimonov, Dmitry A. and Pogodin, Pavel V. and Poroikov, Vladimir and Rudik, Anastassia V. and Stolbov, Leonid A. and Veselovsky, Alexander V. and De Rosa, Maria and De Simone, Giada and Gulotta, Maria R. and Lombino, Jessica and Mekni, Nedra and Perricone, Ugo and Casini, Arturo and Embree, Amanda and Gordon, D. Benjamin and Lei, David and Pratt, Katelin and Voigt, Christopher A. and Chen, Kuang-Yu and Jacob, Yves and Krischuns, Tim and Lafaye, Pierre and Zettor, Agn{\`e}s and Rodr{\´i}guez, M. Luis and White, Kris M. and Fearon, Daren and Von Delft, Frank and Walsh, Martin A. and Horvath, Dragos and Brooks III, Charles L. and Falsafi, Babak and Ford, Bryan and Garc{\´i}a-Sastre, Adolfo and Yup Lee, Sang and Naffakh, Nadia and Varnek, Alexandre and Klambauer, G{\"u}nter and Hermans, Thomas M.}, title = {A community effort in SARS-CoV-2 drug discovery}, series = {Molecular Informatics}, volume = {43}, journal = {Molecular Informatics}, number = {1}, doi = {https://doi.org/10.1002/minf.202300262}, pages = {e202300262}, year = {2023}, language = {en} }