@incollection{GraefeSchuetteNordmeier2009, author = {Gr{\"a}fe, Ch. and Sch{\"u}tte, Christof and Nordmeier, V.}, title = {"Learner as creator" - Sch{\"u}lerInnen generieren eigene Lernspiele}, booktitle = {Didaktik der Physik - Bochum 2009}, publisher = {Lehmanns Media}, address = {Berlin}, year = {2009}, language = {en} } @misc{BuesingD'AndreagiovanniRaymond2013, author = {B{\"u}sing, Christina and D'Andreagiovanni, Fabio and Raymond, Annie}, title = {0-1 Multiband Robust Optimization}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-44093}, year = {2013}, abstract = {We provide an overview of new theoretical results that we obtained while further investigating multiband robust optimization, a new model for robust optimization that we recently proposed to tackle uncertainty in mixed-integer linear programming. This new model extends and refines the classical Gamma-robustness model of Bertsimas and Sim and is particularly useful in the common case of arbitrary asymmetric distributions of the uncertainty. Here, we focus on uncertain 0-1 programs and we analyze their robust counterparts when the uncertainty is represented through a multiband set. Our investigations were inspired by the needs of our industrial partners in the research project ROBUKOM.}, language = {en} } @inproceedings{BuesingD'AndreagiovanniRaymond2013, author = {B{\"u}sing, Christina and D'Andreagiovanni, Fabio and Raymond, Annie}, title = {0-1 Multiband Robust Optimization}, booktitle = {Operations Research Proceedings 2013}, year = {2013}, language = {en} } @misc{SchulzWeismantelZiegler1995, author = {Schulz, Andreas S. and Weismantel, Robert and Ziegler, G{\"u}nter M.}, title = {0/1-Integer Programming: Optimization and Augmentation are Equivalent}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-1744}, number = {SC-95-08}, year = {1995}, abstract = {{\def\xnew{x^{\mbox{\tiny new}}}\def\Z{{{\rm Z}\!\! Z}}For every fixed set \${\cal F}\subseteq\{0,1\}^n\$ the following problems are strongly polynomial time equivalent: given a feasible point \$x\in\cal F\$ and a linear objective function \$c\in\Z^n\$, \begin{itemize} \item find a feasible point \$x^*\in\cal F\$ that maximizes \$cx\$ (Optimization), \item find a feasible point \$\xnew\in\cal F\$ with \$c\xnew>cx\$ (Augmentation), and \item find a feasible point \$\xnew\in\cal F\$ with \$c\xnew>cx\$ such that \$\xnew-x\$ is ``irreducible''\\(Irreducible Augmentation). \end{itemize} This generalizes results and techniques that are well known for \$0/1\$--integer programming problems that arise from various classes of combinatorial optimization problems.}}, language = {en} } @misc{GroetschelNeumann2012, author = {Gr{\"o}tschel, Martin and Neumann, Gerald}, title = {10 Jahre TELOTA}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-14799}, number = {12-13}, year = {2012}, abstract = {Das TELOTA-Projekt - zun{\"a}chst nur f{\"u}r zwei Jahre gestartet - feierte am 15. Juni 2011 sein 10-j{\"a}hriges Bestehen im Rahmen eines Workshops mit einem abschließenden Festvortrag von Richard Stallmann zum Thema „Copyright versus community in the age of computer networks". Diese Veranstaltung zeigte, wie aktuell die TELOTA-Themen weiterhin sind und dass diese eine große Resonanz in der allgemeinen {\"O}ffentlichkeit finden. Die TELOTA-Aktivit{\"a}ten haben sich als wichtiger Bestandteil der IT-Infrastruktur der BBAW erwiesen, gehen aber weit {\"u}ber reinen Service hinaus. Sie beeinflussen die Forschung selbst und f{\"u}hren zu neuen interessanten wissenschaftlichen Fragestellungen. Der R{\"u}ckblick auf die ersten zehn Jahre der TELOTA-Initiative in diesem Artikel soll einen kleinen Eindruck von dem geben, was bisher geleistet wurde.}, language = {de} } @article{GroetschelNeumann2012, author = {Gr{\"o}tschel, Martin and Neumann, Gerald}, title = {10 Jahre TELOTA}, journal = {Jahrbuch 2011 / Berlin-Brandenburgische Akademie der Wissenschaften}, isbn = {978-3-05-005641-8}, pages = {202 -- 215}, year = {2012}, abstract = {Das TELOTA-Projekt - zun{\"a}chst nur f{\"u}r zwei Jahre gestartet - feierte am 15. Juni 2011 sein 10-j{\"a}hriges Bestehen im Rahmen eines Workshops mit einem abschließenden Festvortrag von Richard Stallmann zum Thema „Copyright versus community in the age of computer networks". Diese Veranstaltung zeigte, wie aktuell die TELOTA-Themen weiterhin sind und dass diese eine große Resonanz in der allgemeinen {\"O}ffentlichkeit finden. Die TELOTA-Aktivit{\"a}ten haben sich als wichtiger Bestandteil der IT-Infrastruktur der BBAW erwiesen, gehen aber weit {\"u}ber reinen Service hinaus. Sie beeinflussen die Forschung selbst und f{\"u}hren zu neuen interessanten wissenschaftlichen Fragestellungen. Der R{\"u}ckblick auf die ersten zehn Jahre der TELOTA-Initiative in diesem Artikel soll einen kleinen Eindruck von dem geben, was bisher geleistet wurde.}, language = {de} } @inproceedings{SkibinaBockFischeretal.2013, 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}, booktitle = {Conference on Lasers, Applications, and Technologies (LAT)}, pages = {LWF5}, year = {2013}, 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}, booktitle = {CLEO}, publisher = {Optical Society of America}, doi = {10.1364/CLEO_SI.2012.CTh3G.3}, pages = {CTh3G.3}, year = {2012}, language = {en} } @misc{Massing2009, type = {Master Thesis}, author = {Massing, Andr{\´e}}, title = {1D-Reduktion thermal signifikanter Aderstr{\"a}nge in der Hyperthermie-Modellierung}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-11407}, school = {Zuse Institute Berlin (ZIB)}, year = {2009}, abstract = {In dieser Arbeit wird ein neuer Ansatz zur Modellierung von thermal signifikanten Gef{\"a}ßstr{\"a}ngen im Hyperthermie-Kontext betrachtet. Ausgehend von einer Konvektions-Diffusions-Gleichung wird durch Reskalierung des Massenflussterms eine Reduktion des Adergebietes auf eine 1D-Struktur erreicht. Nach numerischen Vorbetrachtungen wird die Grenzgleichung innerhalb einer verallgemeinerten Sobolev-Algebra formuliert. Die Untersuchung der L{\"o}sungsfamilie in klassischen Funktionenr{\"a}umen zeigt, dass deren schwacher Grenzwert die L{\"o}sung der korrespondierenden Diffusions-Gleichung ist. Die Diskretisierung einer formalen Grenzgleichung mit Linienstromanteil stellt jedoch eine gute Approximation an die Diskretisierung des urspr{\"u}nglichen Problems dar, wenn man die lokale Maschenweite an die Gef{\"a}ßradien koppelt und bei erh{\"o}htem Genauigkeitsbedarf auf ein vollst{\"a}ndiges 3D-Modell umschaltet.}, language = {de} } @misc{Massing2007, type = {Master Thesis}, author = {Massing, Andre}, title = {1D-Reduktion thermal signifikanter Aderstr{\"a}nge in der Hyperthermie-Modellierung}, year = {2007}, language = {en} } @misc{Massing2007, type = {Master Thesis}, author = {Massing, Andre}, title = {1D-Reduktion thermal signifikanter Aderstr{\"a}nge in der Hyperthermie-Modellierung}, address = {Fachbereich Mathematik}, year = {2007}, language = {en} } @misc{OPUS4-8811, title = {22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022)}, volume = {106}, editor = {D'Emidio, Mattia and Lindner, Niels}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, isbn = {978-3-95977-259-4}, doi = {10.4230/OASIcs.ATMOS.2022}, year = {2022}, abstract = {OASIcs, Volume 106, ATMOS 2022, Complete Volume}, language = {en} } @inproceedings{ZaikinSaparinProhaskaetal.2003, author = {Zaikin, Alexei and Saparin, Peter and Prohaska, Steffen and Kurths, J{\"u}rgen and Gowin, Wolfgang}, title = {2D and 3D bone modelling for analysis of changes in the bone architecture and for evaluation of structural measures.}, booktitle = {2nd European Congress 'Achievements in Space Medicine into Health Care Practice and Industry'}, address = {Berlin-Adlershof}, year = {2003}, language = {en} } @incollection{AuerSreevalsanNairZobeletal.2009, author = {Auer, Cornelia and Sreevalsan-Nair, Jaya and Zobel, Valentin and Hotz, Ingrid}, title = {2D Tensor Field Segmentation}, volume = {2}, booktitle = {Scientific Visualization: Interactions, Features, Metaphors}, editor = {Hagen, Hans}, publisher = {Schloss Dagstuhl-Leibniz-Zentrum f{\"u}r Informatik}, doi = {10.4230/DFU.Vol2.SciViz.2011.17}, pages = {17 -- 35}, year = {2009}, language = {en} } @inproceedings{OPUS4-3585, title = {2nd IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2002), 22-24 May 2002, Berlin, Germany}, editor = {Bal, H. and L{\"o}hr, K.-P. and Reinefeld, Alexander}, publisher = {IEEE Computer Society}, isbn = {0-7695-1582-7}, year = {2002}, language = {en} } @misc{DeuflhardReich1997, author = {Deuflhard, Peter and Reich, Sebastian}, title = {2nd International Symposium Algorithms for Macromolecular Modelling}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-5455}, number = {TR-97-03}, year = {1997}, abstract = {The report contains the program and the collected abstracts of the 2nd International Symposium ``Algorithms for Macromolecular Modelling''.}, language = {en} } @article{PlattnerMaurerVorloeperetal.2012, author = {Plattner, A. and Maurer, H. and Vorloeper, J. and Blome, Mark}, title = {3-D electrical resistivity tomography using adaptive wavelet parameter grids}, volume = {189}, journal = {Geophysical Journal International}, pages = {317 -- 330}, year = {2012}, language = {en} } @article{ProhaskaDreherDewhirstetal.2004, author = {Prohaska, Steffen and Dreher, Matthew and Dewhirst, Mark and Chilkoti, Ashutosh and Pries, Axel}, title = {3-D reconstruction of tumor vascular networks}, volume = {41}, journal = {J. Vas. Res.}, pages = {463}, year = {2004}, language = {en} } @inproceedings{PaetschBaumBressleretal.2013, author = {Paetsch, Olaf and Baum, Daniel and Breßler, David and Ehrig, Karsten and Meinel, Dietmar and Prohaska, Steffen}, title = {3-D-Visualisierung und statistische Analyse von Rissen in mit Computer-Tomographie untersuchten Betonproben}, booktitle = {Tagungsband der DGZfP Jahrestagung 2013}, year = {2013}, language = {de} } @inproceedings{StreicherPaetschSeileretal.2011, author = {Streicher, Doreen and Paetsch, Olaf and Seiler, Robert and Prohaska, Steffen and Krause, Martin and Boller, Christian}, title = {3-D-Visualisierung von Radar- und Ultraschallecho-Daten mit ZIBAmira}, booktitle = {Proc. DGZfP-Jahrestagung 2011}, year = {2011}, language = {de} } @inproceedings{EhlkeHeylandMaerdianetal.2015, author = {Ehlke, Moritz and Heyland, Mark and M{\"a}rdian, Sven and Duda, Georg and Zachow, Stefan}, title = {3D Assessment of Osteosynthesis based on 2D Radiographs}, booktitle = {Proceedings of the Jahrestagung der Deutschen Gesellschaft f{\"u}r Computer- und Roboterassistierte Chirurgie (CURAC)}, pages = {317 -- 321}, year = {2015}, abstract = {We present a novel method to derive the surface distance of an osteosynthesis plate w.r.t. the patient-specific surface of the distal femur based on postoperative 2D radiographs. In a first step, the implant geometry is used as a calibration object to relate the implant and the individual X-ray images spatially in a virtual X-ray setup. Second, the patient- specific femoral shape and pose are reconstructed by fitting a deformable statistical shape and intensity model (SSIM) to the X-rays. The relative positioning between femur and implant is then assessed in terms of the displacement between the reconstructed 3D shape of the femur and the plate. We believe that the approach presented in this paper constitutes a meaningful tool to elucidate the effect of implant positioning on fracture healing and, ultimately, to derive load recommendations after surgery.}, language = {en} } @misc{EhlkeHeylandMaerdianetal.2015, author = {Ehlke, Moritz and Heyland, Mark and M{\"a}rdian, Sven and Duda, Georg and Zachow, Stefan}, title = {3D Assessment of Osteosynthesis based on 2D Radiographs}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-56217}, year = {2015}, abstract = {We present a novel method to derive the surface distance of an osteosynthesis plate w.r.t. the patient-specific surface of the distal femur based on postoperative 2D radiographs. In a first step, the implant geometry is used as a calibration object to relate the implant and the individual X-ray images spatially in a virtual X-ray setup. Second, the patient-specific femoral shape and pose are reconstructed by fitting a deformable statistical shape and intensity model (SSIM) to the X-rays. The relative positioning between femur and implant is then assessed in terms of the displacement between the reconstructed 3D shape of the femur and the plate. We believe that the approach presented in this paper constitutes a meaningful tool to elucidate the effect of implant positioning on fracture healing and, ultimately, to derive load recommendations after surgery.}, language = {en} } @inproceedings{GoubergritsPoethkePetzetal.2008, author = {Goubergrits, Leonid and P{\"o}thke, Jens and Petz, Christoph and Hege, Hans-Christian and Spuler, Andreas and Kertzscher, Ulrich}, title = {3D Bildgebung von zerebralen Aneurysmen}, booktitle = {Bildverarbeitung f{\"u}r die Medizin}, doi = {10.1007/978-3-540-78640-5_31}, pages = {153 -- 157}, year = {2008}, language = {en} } @inproceedings{PaetschBaumProhaskaetal.2015, author = {Paetsch, Olaf and Baum, Daniel and Prohaska, Steffen and Ehrig, Karsten and Meinel, Dietmar and Ebell, Gino}, title = {3D Corrosion Detection in Time-dependent CT Images of Concrete}, booktitle = {DIR-2015 Proceedings}, year = {2015}, abstract = {In civil engineering, the corrosion of steel reinforcements in structural elements of concrete bares a risk of stability-reduction, mainly caused by the exposure to chlorides. 3D computed tomography (CT) reveals the inner structure of concrete and allows one to investigate the corrosion with non-destructive testing methods. To carry out such investigations, specimens with a large artificial crack and an embedded steel rebar have been manufactured. 3D CT images of those specimens were acquired in the original state. Subsequently three cycles of electrochemical pre-damaging together with CT imaging were applied. These time series have been evaluated by means of image processing algorithms to segment and quantify the corrosion products. Visualization of the results supports the understanding of how corrosion propagates into cracks and pores. Furthermore, pitting of structural elements can be seen without dismantling. In this work, several image processing and visualization techniques are presented that have turned out to be particularly effective for the visualization and segmentation of corrosion products. Their combination to a workflow for corrosion analysis is the main contribution of this work.}, language = {en} } @misc{Grewe2015, author = {Grewe, Carl Martin}, title = {3D Digital Morphology of Human Faces}, journal = {Anthropologie der Wahrnehmung. Marsilius-Sommerakademie Heidelberg, 14.-20. September}, year = {2015}, language = {en} } @misc{OberlaenderBrunodeKocketal.2009, author = {Oberlaender, Marcel and Bruno, Randy M. and de Kock, Christiaan P. J. and Meyer, Hanno and Dercksen, Vincent J. and Sakmann, Bert}, title = {3D distribution and sub-cellular organization of thalamocortical VPM synapses for individual excitatory neuronal cell types in rat barrel cortex}, journal = {Conference Abstract No. 173.19/Y35, 39th Annual Meeting of the Society for Neuroscience (SfN)}, year = {2009}, language = {en} } @inproceedings{BurgerZschiedrichSchmidt2010, author = {Burger, Sven and Zschiedrich, Lin and Schmidt, Frank}, title = {3D FEM Simulations of High-Q Resonances in Photonic Crystal Microcavities}, booktitle = {Integrated Photonics Research, Silicon and Nanophotonics}, publisher = {OSA}, doi = {10.1364/IPRSN.2010.IWB7}, pages = {IWB7}, year = {2010}, language = {en} } @inproceedings{RozovaPomplunZschiedrichetal.2012, author = {Rozova, Maria and Pomplun, Jan and Zschiedrich, Lin and Schmidt, Frank and Burger, Sven}, title = {3D finite element simulation of optical modes in VCSELs}, volume = {8255}, booktitle = {Proc. SPIE}, arxiv = {http://arxiv.org/abs/1111.4393}, doi = {10.1117/12.906372}, pages = {82550K}, year = {2012}, language = {en} } @inproceedings{BurgerZschiedrichPomplunetal.2009, author = {Burger, Sven and Zschiedrich, Lin and Pomplun, Jan and Schmidt, Frank and Kettner, Benjamin and Lockau, D.}, title = {3D Finite-Element Simulations of Enhanced Light Transmission Through Arrays of Holes in Metal Films}, volume = {7390}, booktitle = {Numerical Methods in Optical Metrology}, publisher = {Proc. SPIE}, doi = {10.1117/12.827543}, pages = {73900H}, year = {2009}, language = {en} } @inproceedings{WesterhoffMayeBrandtetal.2002, author = {Westerhoff, Malte and Maye, Alexander and Brandt, Robert and Menzel, Randolf}, title = {3D Geometry Reconstruction in Neuroanatomy}, booktitle = {International Neuroscience Summit Abstract Book}, address = {Berlin, Germany}, pages = {49}, year = {2002}, language = {en} } @article{JungNowackaBarisinetal.2023, author = {Jung, Christian and Nowacka, Anna and Barisin, Tin and Meinel, Dietmar and Paetsch, Olaf and Grzesiak, Szymon and Salamon, Michael and Schladitz, Katja and Redenbach, Claudia and Pahn, Matthias}, title = {3d imaging and analysis of cracks in loaded concrete samples. 12th Conference on Industrial Computed Tomography (iCT) 2023, 27 February - 2 March 2023 in F{\"u}rth, Germany}, volume = {28}, journal = {e-Journal of Nondestructive Testing}, number = {3}, doi = {10.58286/27721}, year = {2023}, abstract = {Concrete plays a central role as the standard building material in civil engineering. Experimental characterization of the concrete microstructure and a description of failure mechanisms are important to understand the concrete's mechanical properties. Computed tomography is a powerful source of information as it yields 3d images of concrete specimens. However, complete visual inspection is often infeasible due to very large image sizes. Hence, automatic methods for crack detection and segmentation are needed. A region-growing algorithm and a 3d U-Net showed promising results in a previous study. Cracks in normal concrete and high-performance concrete that were initiated via tensile tests were investigated. Here, the methods are validated on a more diverse set of concrete types and crack characteristics. Adequate adaptions of the methods are necessary to deal with the complex crack structures. The segmentation results are assessed qualitatively and compared to those of a template matching algorithm which is well-established in industry.}, language = {en} } @misc{OberlaenderDercksenLangetal.2009, author = {Oberlaender, Marcel and Dercksen, Vincent J. and Lang, Stefan and Sakmann, Bert}, title = {3D mapping of synaptic connections within "in silico" microcircuits of full compartmental neurons in extended networks on the example of VPM axons projecting into S1 of rats.}, journal = {Conference Abstract, Neuroinformatics}, doi = {10.3389/conf.neuro.11.2009.08.092}, year = {2009}, language = {en} } @misc{BerioBayleAgretetal.2022, author = {Berio, Fidji and Bayle, Yann and Agret, Sylvie and Baum, Daniel and Goudemand, Nicolas and Debiais-Thibaud, M{\´e}lanie}, title = {3D models related to the publication: Hide and seek shark teeth in Random Forests: Machine learning applied to Scyliorhinus canicula}, journal = {MorphoMuseuM}, doi = {10.18563/journal.m3.164}, year = {2022}, abstract = {The present dataset contains the 3D models analyzed in Berio, F., Bayle, Y., Baum, D., Goudemand, N., and Debiais-Thibaud, M. 2022. Hide and seek shark teeth in Random Forests: Machine learning applied to Scyliorhinus canicula. It contains the head surfaces of 56 North Atlantic and Mediterranean small-spotted catsharks Scyliorhinus canicula, from which tooth surfaces were further extracted to perform geometric morphometrics and machine learning.}, language = {en} } @inproceedings{HammerschmidtLockauBurgeretal.2012, author = {Hammerschmidt, Martin and Lockau, Daniel and Burger, Sven and Schmidt, Frank and Schwanke, Christoph and Kirner, Simon and Calnan, Sonya and Stannowski, Bernd and Rech, Bernd}, title = {3D optical modeling of thin-film a-Si/mc-Si tandem solar cells with random textured interfaces using FEM}, booktitle = {Renewable Energy and the Environment Optics and Photonics Congress}, publisher = {Optical Society of America}, doi = {10.1364/E2.2012.JM5A.15}, pages = {JM5A.15}, year = {2012}, language = {en} } @inproceedings{ZachowGladilinZeilhoferetal.2001, author = {Zachow, Stefan and Gladilin, Evgeny and Zeilhofer, Hans-Florian and Sader, Robert}, title = {3D Osteotomieplanung in der MKG-Chirurgie unter Ber{\"u}cksichtigung der r{\"a}umlichen Weichgewebeanordnung}, booktitle = {Rechner- und sensorgest{\"u}tzte Chirurgie, GI Proc. zur SFB 414 Tagung}, address = {Heidelberg}, pages = {217 -- 226}, year = {2001}, language = {en} } @article{ZachowGladilinTrepczynskietal.2002, author = {Zachow, Stefan and Gladilin, Evgeny and Trepczynski, Adam and Sader, Robert and Zeilhofer, Hans-Florian}, title = {3D Osteotomy Planning in Cranio-Maxillofacial Surgery: Experiences and Results of Surgery Planning and Volumetric Finite-Element Soft Tissue Prediction in Three Clinical Cases}, journal = {Computer Assisted Radiology and Surgery (CARS)}, publisher = {Springer Verlag}, pages = {983 -- 987}, year = {2002}, language = {en} } @article{WestermarkZachowEppley2005, author = {Westermark, Anders and Zachow, Stefan and Eppley, Barry}, title = {3D osteotomy planning in maxillofacial surgery, including 3D soft tissue prediction}, volume = {16(1)}, journal = {Journal of Craniofacial Surgery}, pages = {100 -- 104}, year = {2005}, language = {en} } @inproceedings{NadobnyWlodarczykWustetal.1999, author = {Nadobny, Jacek and Wlodarczyk, Waldemar and Wust, Peter and M{\"o}nich, Gerhard and Deuflhard, Peter and Felix, Roland}, title = {3D Phased Array Applicator for Hyperthermia Treatment in Pelvis}, booktitle = {Proc. XXVIth General Assembly of International Union of Radio Science (URSI)}, address = {Toronto Ontario Canada}, pages = {648}, year = {1999}, language = {en} } @article{BuchmannKaplanPowelletal.2019, author = {Buchmann, Jens and Kaplan, Bernhard and Powell, Samuel and Prohaska, Steffen and Laufer, Jan}, title = {3D quantitative photoacoustic tomography using an adjoint radiance Monte Carlo model and gradient descent}, volume = {24}, journal = {Journal of Biomedical Optics}, number = {6}, doi = {10.1117/1.JBO.24.6.066001}, pages = {066001}, year = {2019}, abstract = {Quantitative photoacoustic tomography aims to recover maps of the local concentrations of tissue chromophores from multispectral images. While model-based inversion schemes are promising approaches, major challenges to their practical implementation include the unknown fluence distribution and the scale of the inverse problem. This paper describes an inversion scheme based on a radiance Monte Carlo model and an adjoint-assisted gradient optimization that incorporates fluence-dependent step sizes and adaptive moment estimation. The inversion is shown to recover absolute chromophore concentrations, blood oxygen saturation and the Gr{\"u}neisen parameter from in silico 3D phantom images for different radiance approximations. The scattering coefficient was assumed to be homogeneous and known a priori.}, language = {en} } @misc{BuchmannKaplanPowelletal.2019, author = {Buchmann, Jens and Kaplan, Bernhard and Powell, Samuel and Prohaska, Steffen and Laufer, Jan}, title = {3D quantitative photoacoustic tomography using an adjoint radiance Monte Carlo model and gradient descent}, issn = {1438-0064}, doi = {10.1117/1.JBO.24.6.066001}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-72995}, year = {2019}, abstract = {Quantitative photoacoustic tomography aims to recover maps of the local concentrations of tissue chromophores from multispectral images. While model-based inversion schemes are promising approaches, major challenges to their practical implementation include the unknown fluence distribution and the scale of the inverse problem. This paper describes an inversion scheme based on a radiance Monte Carlo model and an adjoint-assisted gradient optimization that incorporates fluence-dependent step sizes and adaptive moment estimation. The inversion is shown to recover absolute chromophore concentrations, blood oxygen saturation and the Gr{\"u}neisen parameter from in silico 3D phantom images for different radiance approximations. The scattering coefficient was assumed to be homogeneous and known a priori.}, language = {en} } @phdthesis{Ehlke2020, author = {Ehlke, Moritz}, title = {3D Reconstruction of Anatomical Structures from 2D X-ray Images}, doi = {https://doi.org/10.14279/depositonce-11553}, year = {2020}, language = {en} } @inproceedings{ZachowZilskeHege2007, author = {Zachow, Stefan and Zilske, Michael and Hege, Hans-Christian}, title = {3D Reconstruction of Individual Anatomy from Medical Image Data: Segmentation and Geometry Processing}, booktitle = {25. ANSYS Conference \& CADFEM Users' Meeting}, address = {Dresden}, year = {2007}, language = {en} } @misc{ZachowZilskeHege2007, author = {Zachow, Stefan and Zilske, Michael and Hege, Hans-Christian}, title = {3D reconstruction of individual anatomy from medical image data: Segmentation and geometry processing}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-10440}, number = {07-41}, year = {2007}, abstract = {For medical diagnosis, visualization, and model-based therapy planning three-dimensional geometric reconstructions of individual anatomical structures are often indispensable. Computer-assisted, model-based planning procedures typically cover specific modifications of "virtual anatomy" as well as numeric simulations of associated phenomena, like e.g. mechanical loads, fluid dynamics, or diffusion processes, in order to evaluate a potential therapeutic outcome. Since internal anatomical structures cannot be measured optically or mechanically in vivo, three-dimensional reconstruction of tomographic image data remains the method of choice. In this work the process chain of individual anatomy reconstruction is described which consists of segmentation of medical image data, geometrical reconstruction of all relevant tissue interfaces, up to the generation of geometric approximations (boundary surfaces and volumetric meshes) of three-dimensional anatomy being suited for finite element analysis. All results presented herein are generated with amira ® - a highly interactive software system for 3D data analysis, visualization and geometry reconstruction.}, language = {en} } @article{DworzakLameckervonBergetal.2009, author = {Dworzak, Jalda and Lamecker, Hans and von Berg, Jens and Klinder, Tobias and Lorenz, Cristian and Kainm{\"u}ller, Dagmar and Seim, Heiko and Hege, Hans-Christian and Zachow, Stefan}, title = {3D Reconstruction of the Human Rib Cage from 2D Projection Images using a Statistical Shape Model}, volume = {5}, journal = {Int. J. Comput. Assist. Radiol. Surg.}, number = {2}, publisher = {Springer}, issn = {1861-6410}, doi = {10.1007/s11548-009-0390-2}, pages = {111 -- 124}, year = {2009}, language = {en} } @misc{Lukanek2024, type = {Master Thesis}, author = {Lukanek, Sandra}, title = {3D Reconstruction of the Mandible from Panoramic Dental X-Ray Projections}, pages = {49}, year = {2024}, abstract = {Panoramic radiography is a popular imaging technique in dental medicine. It omprehensively represents the entire jaw, including the mandible, maxilla, and teeth in a compact two-dimensional (2D) image. It offers several advantages over three-dimensional (3D) imaging, such as Cone Beam Computed Tomography (CBCT), including cost-effectiveness and reduced radiation exposure. However, its major drawback lies in its ambiguities in spatial distribution, leading to inaccuracies in linear measurements due to the dependency on the parameters used for generating the image. In this thesis, we propose a methodology for reconstructing a 3D anatomy of the mandible from a given 2D panoramic X-ray image. Our approach involves extracting information from the 2D scan, considering the projection geometry, and aiming to achieve a realistic spatial distribution. The methodology builds upon an existing intensity-based 2D-3D registration algorithm, which is modified to accommodate the unique geometric parameters of panoramic radiography. By employing a virtual X-ray setup, we generate a panoramic X-ray from a Statistical Shape and Intensity Model (SSIM) derived from 25 tetrahedral meshes. The intensity information for each mesh is extracted from CBCT scans representing jaw anatomies. To reconstruct the true mandible, the model is iteratively optimized by comparing the simulated X-ray with the original panoramic X-ray. We evaluate and establish the setup using synthetically generated panoramic X-rays from multiple mandibles obtained from CBCT scans. After analyzing the feasibility of this method, we conclude that 2D-3D registration for panoramic X-rays presents a challenging task, as the ambiguity of the 2D projection involved in panoramic X-ray imaging can result in varied 3D shape representations.}, language = {en} } @inproceedings{AgudoJacomeHegePaetschetal.2016, author = {Agudo J{\´a}come, Leonardo and Hege, Hans-Christian and Paetsch, Olaf and P{\"o}thkow, Kai}, title = {3D Reconstruction, Visualization and Quantification of Dislocations from Transmission Electron Microscopy Stereo-Pairs}, booktitle = {Microscopy and Microanalysis 2016, July 24-28 Columbus, Ohio}, year = {2016}, language = {en} } @inproceedings{BurgerZschiedrichSchmidtetal.2007, author = {Burger, Sven and Zschiedrich, Lin and Schmidt, Frank and K{\"o}hle, Roderick and Henkel, Thomas and K{\"u}chler, Bernd and N{\"o}lscher, Christoph}, title = {3D simulations of electromagnetic fields in nanostructures using the time-harmonic finite-element method}, volume = {6617}, booktitle = {Modeling Aspects in Optical Metrology}, editor = {Bosse, Harald}, publisher = {Proc. SPIE}, doi = {10.1117/12.726236}, pages = {66170V}, year = {2007}, language = {en} } @inproceedings{WiebelPreisVosetal.2013, author = {Wiebel, Alexander and Preis, Philipp and Vos, Frans and Hege, Hans-Christian}, title = {3D Strokes on Visible Structures in Direct Volume Rendering}, booktitle = {EuroVis - Short Papers}, editor = {Hlawitschka, Mario and Weinkauf, Tino}, publisher = {Eurographics Association}, doi = {10.2312/PE.EuroVisShort.EuroVisShort2013.091-095}, pages = {91 -- 95}, year = {2013}, language = {en} } @article{ZiescheArltFineganetal.2020, author = {Ziesche, Ralf F. and Arlt, Tobias and Finegan, Donal P. and Heenan, Thomas M.M. and Tengattini, Alessandro and Baum, Daniel and Kardjilov, Nikolay and Mark{\"o}tter, Henning and Manke, Ingo and Kockelmann, Winfried and Brett, Dan J.L. and Shearing, Paul R.}, title = {4D imaging of lithium-batteries using correlative neutron and X-ray tomography with a virtual unrolling technique}, volume = {11}, journal = {Nature Communications}, doi = {10.1038/s41467-019-13943-3}, pages = {777}, year = {2020}, abstract = {The temporally and spatially resolved tracking of lithium intercalation and electrode degradation processes are crucial for detecting and understanding performance losses during the operation of lithium-batteries. Here, high-throughput X-ray computed tomography has enabled the identification of mechanical degradation processes in a commercial Li/MnO2 primary battery and the indirect tracking of lithium diffusion; furthermore, complementary neutron computed tomography has identified the direct lithium diffusion process and the electrode wetting by the electrolyte. Virtual electrode unrolling techniques provide a deeper view inside the electrode layers and are used to detect minor fluctuations which are difficult to observe using conventional three dimensional rendering tools. Moreover, the 'unrolling' provides a platform for correlating multi-modal image data which is expected to find wider application in battery science and engineering to study diverse effects e.g. electrode degradation or lithium diffusion blocking during battery cycling.}, language = {en} } @article{BeckerWyssEisenhaueretal.2014, author = {Becker, Christiane and Wyss, Philippe and Eisenhauer, David and Probst, J{\"u}rgen and Preidel, Veit and Hammerschmidt, Martin and Burger, Sven}, title = {5 x 5 cm2 silicon photonic crystal slabs on glass and plastic foil exhibiting broadband absorption and high-intensity near-fields}, volume = {4}, journal = {Sci. Rep.}, doi = {10.1038/srep05886}, pages = {5886}, year = {2014}, language = {en} } @misc{GiovanidisBrueckD'Andreagiovannietal.2011, author = {Giovanidis, Anastasios and Brueck, Stefan and D'Andreagiovanni, Fabio and Krolikowski, Jonatan and Hartanto Tanzil, Vicky}, title = {A 0-1 Program for Minimum Clustering in Downlink Base Station Cooperation}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-12776}, number = {11-19}, year = {2011}, abstract = {Base station cooperation in the downlink of cellular systems has been recently suggested as a promising concept towards a better exploitation of the communication system physical resources. It may offer a high gain in capacity through interference mitigation. This however, comes at a cost of high information exchange between cooperating entities and a high computational burden. Clustering of base stations into subgroups is an alternative to guarantee such cooperation benefits in a lower scale. The optimal definition of clusters, however, and a systematic way to find a solution to such problem is not yet available. In this work, we highlight the combinatorial nature of the problem, exploit this to describe the system of users and base stations as a graph and formulate a pure 0-1 program. Its solution suggests a cost optimal way to form clusters and assign user subsets to them.}, language = {en} } @inproceedings{HeinLuethZachowetal.1999, author = {Hein, Andreas and Lueth, Tim and Zachow, Stefan and Stien, Malte}, title = {A 2D Planning Sytem for Robot-Assisted Interventions}, booktitle = {Computer Assisted Radiology and Surgery}, publisher = {Elsevier Science B.V.}, pages = {1049}, year = {1999}, language = {en} } @article{NadobnySullivanWlodarczyketal.2003, author = {Nadobny, Johanna and Sullivan, Dennis and Wlodarczyk, Waldemar and Deuflhard, Peter and Wust, Peter}, title = {A 3-D Tensor FDTD-Formulation for Treatment of Sloped Interfaces in Electrically Inhomogeneous Media}, volume = {51}, journal = {IEEE Transactions on Antennas and Propagation}, number = {8}, pages = {1760 -- 1770}, year = {2003}, language = {en} } @inproceedings{LameckerSeebassHegeetal.2004, author = {Lamecker, Hans and Seebaß, Martin and Hege, Hans-Christian and Deuflhard, Peter}, title = {A 3D statistical shape model of the pelvic bone for segmentation}, booktitle = {Proceedings of SPIE - Volume 5370 Medical Imaging 2004}, editor = {Fitzpatrick, J. and Sonka, Milan}, doi = {10.1117/12.534145}, pages = {1341 -- 1351}, year = {2004}, language = {en} } @inproceedings{LameckerSeebassHegeetal.2004, author = {Lamecker, Hans and Seebaß, Martin and Hege, Hans-Christian and Deuflhard, Peter}, title = {A 3d statistical shape model of the pelvic bone for segmentation}, volume = {5370}, booktitle = {Proc. SPIE Medical Imaging 2004}, editor = {Fitzpatrick, J. and Sonka, Milan}, pages = {1341 -- 1351}, year = {2004}, language = {en} } @misc{BornemannYserentant1992, author = {Bornemann, Folkmar A. and Yserentant, Harry}, title = {A Basic Norm Equivalence for the Theory of Multilevel Methods.}, doi = {10.1007/BF01388699}, number = {SC-92-01}, year = {1992}, abstract = {Subspace decompositions of finite element spaces based on \$L2\$-like orthogonal projections play an important role for the construction and analysis of multigrid like iterative methods. Recently several authors proved the equivalence of the associated discrete norms with the \$H^1\$-norm. The present report gives an elementary, self-contained derivation of this result which is based on the use of \$ K\$-functionals known from the theory of interpolation spaces. {\bf Keywords:} multilevel methods, nonuniform meshes, optimal convergence rates. {\bf AMS(MOS) Subject classifications:} 65N55, 65N30, 65N50.}, language = {en} } @article{AndresArconesWeiserKoutsourelakisetal.2023, author = {Andr{\´e}s Arcones, Daniel and Weiser, Martin and Koutsourelakis, Faidon-Stelios and Unger, J{\"o}rg F.}, title = {A Bayesian Framework for Simulation-based Digital Twins of Bridges}, volume = {6}, journal = {EUROSTRUCT 2023:European Association on Quality Control of Bridges and Structures: Digital Transformation in Sustainability}, number = {5}, doi = {10.1002/cepa.2177}, pages = {734 -- 740}, year = {2023}, abstract = {Simulation-based digital twins have emerged as a powerful tool for evaluating the mechanical response of bridges. As virtual representations of physical systems, digital twins can provide a wealth of information that complements traditional inspection and monitoring data. By incorporating virtual sensors and predictive maintenance strategies, they have the potential to improve our understanding of the behavior and performance of bridges over time. However, as bridges age and undergo regular loading and extreme events, their structural characteristics change, often differing from the predictions of their initial design. Digital twins must be continuously adapted to reflect these changes. In this article, we present a Bayesian framework for updating simulation-based digital twins in the context of bridges. Our approach integrates information from measurements to account for inaccuracies in the simulation model and quantify uncertainties. Through its implementation and assessment, this work demonstrates the potential for digital twins to provide a reliable and up-to-date representation of bridge behavior, helping to inform decision-making for maintenance and management.}, language = {en} } @inproceedings{PrauseBorndoerfer2024, author = {Prause, Felix and Bornd{\"o}rfer, Ralf}, title = {A Bayesian Rolling Horizon Approach for Rolling Stock Rotation Planning with Predictive Maintenance}, volume = {123}, booktitle = {24th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2024)}, doi = {10.4230/OASIcs.ATMOS.2024.13}, pages = {13:1 -- 13:19}, year = {2024}, abstract = {We consider the rolling stock rotation planning problem with predictive maintenance (RSRP-PdM), where a timetable given by a set of trips must be operated by a fleet of vehicles. Here, the health states of the vehicles are assumed to be random variables, and their maintenance schedule should be planned based on their predicted failure probabilities. Utilizing the Bayesian update step of the Kalman filter, we develop a rolling horizon approach for RSRP-PdM, in which the predicted health state distributions are updated as new data become available. This approach reduces the uncertainty of the health states and thus improves the decision-making basis for maintenance planning. To solve the instances, we employ a local neighborhood search, which is a modification of a heuristic for RSRP-PdM, and demonstrate its effectiveness. Using this solution algorithm, the presented approach is compared with the results of common maintenance strategies on test instances derived from real-world timetables. The obtained results show the benefits of the rolling horizon approach.}, language = {en} } @article{GoebelHuynhCheginietal.2025, author = {G{\"o}bel, Fritz and Huynh, Ngoc Mai Monica and Chegini, Fatemeh and Pavarino, Luca and Weiser, Martin and Scacchi, Simone and Anzt, Hartwig}, title = {A BDDC Preconditioner for the Cardiac EMI Model in three Dimensions}, journal = {SIAM J. Sci. Comput.}, arxiv = {http://arxiv.org/abs/2502.07722}, year = {2025}, abstract = {We analyze a Balancing Domain Decomposition by Constraints (BDDC) preconditioner for the solution of three dimensional composite Discontinuous Galerkin discretizations of reaction-diffusion systems of ordinary and partial differential equations arising in cardiac cell-by-cell models like the Extracellular space, Membrane and Intracellular space (EMI) Model. These microscopic models are essential for the understanding of events in aging and structurally diseased hearts which macroscopic models relying on homogenized descriptions of the cardiac tissue, like Monodomain and Bidomain models, fail to adequately represent. The modeling of each individual cardiac cell results in discontinuous global solutions across cell boundaries, requiring the careful construction of dual and primal spaces for the BDDC preconditioner. We provide a scalable condition number bound for the precondition operator and validate the theoretical results with extensive numerical experiments.}, language = {en} } @article{TawfikLimbourg2019, author = {Tawfik, Christine and Limbourg, Sabine}, title = {A Bilevel Model for Network Design and Pricing Based on a Level-of-Service Assessment}, volume = {53}, journal = {Transportation Science}, number = {6}, publisher = {Informs}, address = {Transportation Science}, doi = {10.1287/trsc.2019.0906}, pages = {1609 -- 1626}, year = {2019}, abstract = {Within a wide view to stimulate intermodal transport, this paper is devoted to the examination of the intrinsically related problems of designing freight carrying services and determining their associated prices as observed by the shipper firms. A path-based multicommodity formulation is developed for a medium-term planning horizon, from the perspective of an intermodal operator. In the quest of incorporating nonprice attributes, two approaches are proposed to depict a realistic assessment of the service quality. First, frequency delay constraints are added to the upper level problem. Second, based on a random utility model, behavioural concepts are integrated in the expression of the lower level as a logistics costs minimization problem. Exact tests are invoked on real-world instances, demonstrating the capability of the presented approaches of reaching reasonable results within acceptable computation times and optimality gaps. The broader level-of-service perspective imposes additional costs on the service providers, although to a lesser extent on long-distance freight corridors, as indicated by the computed market share and net profit. Further experiments are conducted to test the impact of certain transport management instruments (e.g. subsidies and service capacities) on the modal split, as well as to assess the intermodality's future based on a scenario analysis methodology.}, language = {en} } @misc{BorndoerferCardonha2009, author = {Bornd{\"o}rfer, Ralf and Cardonha, Carlos}, title = {A Binary Quadratic Programming Approach to the Vehicle Positioning Problem}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-11242}, number = {09-12}, year = {2009}, abstract = {The Vehicle Positioning Problem (VPP) consists of the assignment of vehicles (buses, trams or trains) of a public transport or railway company to parking positions in a depot and to timetabled trips. Such companies have many different types of vehicles, and each trip can be performed only by vehicles of some of these types. These assignments are non-trivial due to the topology of depots. The parking positions are organized in tracks, which work as one- or two-sided stacks or queues. If a required type of vehicle is not available in the front of any track, shunting movements must be performed in order to change vehicles' positions, which is undesirable and should be avoided. In this text we present integer linear and non-linear programming formulations for some versions of the problem and compare them from a theoretical and a computational point of view.}, language = {en} } @inproceedings{BorndoerferCardonha2012, author = {Bornd{\"o}rfer, Ralf and Cardonha, Carlos}, title = {A Binary Quadratic Programming Approach to the Vehicle Positioning Problem}, booktitle = {Modeling, Simulation and Optimization of Complex Processes -- Proceedings of the Fourth International Conference on High Performance Scientific Computing, March 2-6, 2009}, doi = {10.1007/978-3-642-25707-0}, pages = {41 -- 52}, year = {2012}, abstract = {The Vehicle Positioning Problem (VPP) consists of the assignment of vehicles (buses, trams or trains) of a public transport or railway company to parking positions in a depot and to timetabled trips. Such companies have many different types of vehicles, and each trip can be performed only by vehicles of some of these types. These assignments are non-trivial due to the topology of depots. The parking positions are organized in tracks, which work as one- or two-sided stacks or queues. If a required type of vehicle is not available in the front of any track, shunting movements must be performed in order to change vehicles' positions, which is undesirable and should be avoided. In this text we present integer linear and non-linear programming formulations for some versions of the problem and compare them from a theoretical and a computational point of view.}, language = {en} } @inproceedings{GladilinZachowDeuflhardetal.2001, author = {Gladilin, Evgeny and Zachow, Stefan and Deuflhard, Peter and Hege, Hans-Christian}, title = {A Biomechanical Model for Soft Tissue Simulation in Craniofacial Surgery}, booktitle = {Medical Imaging and Augmented Reality (MIAR)}, address = {Hong Kong, China}, doi = {10.1109/MIAR.2001.930276}, pages = {137 -- 141}, year = {2001}, language = {en} } @misc{AscheuerJuengerReinelt1997, author = {Ascheuer, Norbert and J{\"u}nger, Michael and Reinelt, Gerhard}, title = {A Branch \& Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-3391}, number = {SC-97-70}, year = {1997}, abstract = {In this paper we consider a variant of the classical ATSP, namely the asymmetric Hamiltonian path problem (or equivalently ATSP) with precedence constraints. In this problem precedences among the nodes are present, stating that a certain node has to precede others in any feasible sequence. This problem occurs as a basic model in scheduling and routing and has a wide range of applications varying from helicopter routing[Timlin89], sequencing in flexible manufacturing [AscheuerEscuderoGroetschelStoer90,AscheuerEscuderoGroetschelStoer93], to stacker crane routing in an automatic storage system[Ascheuer95]. We give an integer programming model and summarize known classes of valid inequalities. We describe in detail the implementation of a branch\&-cut algorithm and give computational results on real world instances and benchmark problems from TSPLIB. The results we achieve indicate that our implementation outperforms other implementations found in the literature. Real world instances up to 174 nodes could be solved to optimality within a few minutes of CPU-time. As a side product we obtained a branch\&cut-algorithm for the ATSP. All instances in TSPLIB could be solved to optimality in a reasonable amount of computing time.}, language = {en} } @misc{Pfetsch2005, author = {Pfetsch, Marc}, title = {A Branch-And-Cut for the Maximum Feasible Subsystem Problem}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-8797}, number = {05-46}, year = {2005}, abstract = {We present a branch-and-cut algorithm for the NP-hard maximum feasible subsystem problem: For a given infeasible linear inequality system, determine a feasible subsystem containing as many inequalities as possible. The complementary problem, where one has to remove as few inequalities as possible in order to render the system feasible, can be formulated as a set covering problem. The rows of this formulation correspond to irreducible infeasible subsystems, which can be exponentially many. The main issue of a branch-and-cut algorithm for MaxFS is to efficiently find such infeasible subsystems. We present three heuristics for the corresponding NP-hard separation problem and discuss further cutting planes. This paper contains an extensive computational study of our implementation on a variety of instances arising in a number of applications.}, language = {en} } @misc{BorndoerferLoebelWeider2004, author = {Bornd{\"o}rfer, Ralf and L{\"o}bel, Andreas and Weider, Steffen}, title = {A Bundle Method for Integrated Multi-Depot Vehicle and Duty Scheduling in Public Transit}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-7898}, number = {04-14}, year = {2004}, abstract = {This article proposes a Lagrangean relaxation approach to solve integrated duty and vehicle scheduling problems arising in public transport. The approach is based on the proximal bundle method for the solution of concave decomposable functions, which is adapted for the approximate evaluation of the vehicle and duty scheduling components. The primal and dual information generated by the bundle method is used to guide a branch-and-bound type algorithm. Computational results for large-scale real-world integrated vehicle and duty scheduling problems with up to 1,500 timetabled trips are reported. Compared with the results of a classical sequential approach and with reference solutions, integrated scheduling offers remarkable potentials in savings and drivers' satisfaction.}, language = {en} } @inproceedings{BorndoerferLoebelWeider2008, author = {Bornd{\"o}rfer, Ralf and L{\"o}bel, Andreas and Weider, Steffen}, title = {A Bundle Method for Integrated Multi-Depot Vehicle and Duty Scheduling in Public Transit}, volume = {600}, booktitle = {Computer-aided Systems in Public Transport}, editor = {Hickman, Mark and Mirchandani, Pitu and Voß, Stefan}, publisher = {Springer-Verlag}, pages = {3 -- 24}, year = {2008}, language = {en} } @inproceedings{SchintkeSimonReinefeld2001, author = {Schintke, Florian and Simon, Jens and Reinefeld, Alexander}, title = {A Cache Simulator for Shared Memory Systems}, volume = {2074}, booktitle = {Computational Science - ICCS 2001}, doi = {10.1007/3-540-45718-6_62}, pages = {569 -- 578}, year = {2001}, language = {en} } @inproceedings{RoliaCherkasovaArlittetal.2005, author = {Rolia, Jerry and Cherkasova, Ludmila and Arlitt, Martin and Andrzejak, Artur}, title = {A capacity management service for resource pools}, booktitle = {Proceedings of the Fifth International Workshop on Software and Performance, WOSP 2005, Palma, Illes Balears, Spain, July 12-14}, pages = {229 -- 237}, year = {2005}, language = {en} } @misc{OevermannKlein2006, author = {Oevermann, Michael and Klein, Rupert}, title = {A cartesian grid finite volume method for the solution of the Poisson equation with variable coefficients and embedded interfaces}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-8996}, number = {06-05}, year = {2006}, abstract = {We present a finite volume method for the solution of the two-dimensional Poisson equation \$ \nabla\cdot( \beta( {\mbox{\boldmath \$x\$}}) \nabla u({\mbox{\boldmath \$x\$}})) = f(\mbox{\boldmath \$x\$}) \$ with variable, discontinuous coefficients and solution discontinuities on irregular domains. The method uses bilinear ansatz functions on Cartesian grids for the solution \$u({\mbox{\boldmath \$x\$})\$ resulting in a compact nine-point stencil. The resulting linear problem has been solved with a standard multigrid solver. Singularities associated with vanishing partial volumes of intersected grid cells or the dual bilinear ansatz itself are removed by a two-step asymptotic approach. The method achieves second order of accuracy in the \$L^\infty\$ and \$L^2\$ norm.}, language = {en} } @misc{HelmbergRoehl2005, author = {Helmberg, Christoph and R{\"o}hl, Stefan}, title = {A Case Study of Joint Online Truck Scheduling and Inventory Management for Multiple Warehouses}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-8454}, number = {05-11}, year = {2005}, abstract = {For a real world problem --- transporting pallets between warehouses in order to guarantee sufficient supply for known and additional stochastic demand --- we propose a solution approach via convex relaxation of an integer programming formulation, suitable for online optimization. The essential new element linking routing and inventory management is a convex piecewise linear cost function that is based on minimizing the expected number of pallets that still need transportation. For speed, the convex relaxation is solved approximately by a bundle approach yielding an online schedule in 5 to 12 minutes for up to 3 warehouses and 40000 articles; in contrast, computation times of state of the art LP-solvers are prohibitive for online application. In extensive numerical experiments on a real world data stream, the approximate solutions exhibit negligible loss in quality; in long term simulations the proposed method reduces the average number of pallets needing transportation due to short term demand to less than half the number observed in the data stream.}, language = {en} } @article{KlasseWeber2025, author = {Klasse, Sarah Michelle and Weber, Marcus}, title = {A Case Study of the Use of Logical Data Analysis in the Workmen's Village in Tell el-Amarna, Egypt}, volume = {66}, journal = {it - Information Technology}, number = {6}, publisher = {de Gruyter}, doi = {10.1515/itit-2024-0088}, pages = {256 -- 268}, year = {2025}, abstract = {The search for patterns in archaeological contexts is crucial to understanding ancient civilizations, including the organization of their societies and economies. This study focuses on the interdisciplinary application of mathematical logical data analysis to Egyptology, particularly examining food production in the Workmen's Village of Amarna. The introduction provides historical context about Amarna, founded by Pharaoh Akhenaten, and outlines the settlement structure and excavations of the Workmen's Village. The research utilizes archaeobotanical and archaeological data, along with digital humanities tools, to identify activity areas related to food production. The findings reveal spatial patterns in the distribution of tools such as mortars, pestles, and ovens, providing insights into the self-sufficiency and daily life of the villagers. Logical data analysis helps in finding rules and patterns in a dataset which are not visible otherwise, predicting the distribution of unexcavated areas and thus in this case enhancing our understanding of ancient Egyptian food production practices in state- planned settlements.}, language = {en} } @misc{BorndoerferSagnolSwarat2012, author = {Bornd{\"o}rfer, Ralf and Sagnol, Guillaume and Swarat, Elmar}, title = {A Case Study on Optimizing Toll Enforcements on Motorways}, issn = {1438-0064}, doi = {10.4230/OASIcs.SCOR.2012.1}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-15498}, year = {2012}, abstract = {In this paper we present the problem of computing optimal tours of toll inspectors on German motorways. This problem is a special type of vehicle routing problem and builds up an integrated model, consisting of a tour planning and a duty rostering part. The tours should guarantee a network-wide control whose intensity is proportional to given spatial and time dependent traffic distributions. We model this using a space-time network and formulate the associated optimization problem by an integer program (IP). Since sequential approaches fail, we integrated the assignment of crews to the tours in our model. In this process all duties of a crew member must fit in a feasible roster. It is modeled as a Multi-Commodity Flow Problem in a directed acyclic graph, where specific paths correspond to feasible rosters for one month. We present computational results in a case-study on a German subnetwork which documents the practicability of our approach.}, language = {en} } @inproceedings{BorndoerferSagnolSwarat2012, author = {Bornd{\"o}rfer, Ralf and Sagnol, Guillaume and Swarat, Elmar}, title = {A Case Study on Optimizing Toll Enforcements on Motorways}, volume = {22}, booktitle = {3rd Student Conference on Operational Research}, doi = {10.4230/OASIcs.SCOR.2012.1}, pages = {1 -- 10}, year = {2012}, abstract = {In this paper we present the problem of computing optimal tours of toll inspectors on German motorways. This problem is a special type of vehicle routing problem and builds up an integrated model, consisting of a tour planning and a duty rostering part. The tours should guarantee a network-wide control whose intensity is proportional to given spatial and time dependent traffic distributions. We model this using a space-time network and formulate the associated optimization problem by an integer program (IP). Since sequential approaches fail, we integrated the assignment of crews to the tours in our model. In this process all duties of a crew member must fit in a feasible roster. It is modeled as a Multi-Commodity Flow Problem in a directed acyclic graph, where specific paths correspond to feasible rosters for one month. We present computational results in a case-study on a German subnetwork which documents the practicability of our approach.}, 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}, booktitle = {CLEO/QELS}, doi = {10.1364/CLEO.2009.CMHH1}, pages = {CMHH1}, year = {2009}, 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 ultrashort laser pulse delivery}, booktitle = {CLEO Europe - EQEC}, doi = {10.1109/CLEOE-EQEC.2009.5196579}, year = {2009}, language = {en} } @article{Sagnol2011, author = {Sagnol, Guillaume}, title = {A class of Semidefinite Programs with rank-one solutions}, volume = {435}, journal = {Linear Algebra and its Applications}, number = {6}, doi = {10.1016/j.laa.2011.03.027}, pages = {1446 -- 1463}, year = {2011}, abstract = {We show that a class of semidefinite programs (SDP) admits a solution that is a positive semidefinite matrix of rank at most \$r\$, where \$r\$ is the rank of the matrix involved in the objective function of the SDP. The optimization problems of this class are semidefinite packing problems, which are the SDP analogs to vector packing problems. Of particular interest is the case in which our result guarantees the existence of a solution of rank one: we show that the computation of this solution actually reduces to a Second Order Cone Program (SOCP). We point out an application in statistics, in the optimal design of experiments.}, language = {en} } @misc{Sagnol2012, author = {Sagnol, Guillaume}, title = {A Class of Semidefinite Programs with rank-one solutions}, issn = {1438-0064}, doi = {10.1016/j.laa.2011.03.027}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-14933}, year = {2012}, abstract = {We show that a class of semidefinite programs (SDP) admits a solution that is a positive semidefinite matrix of rank at most \$r\$, where \$r\$ is the rank of the matrix involved in the objective function of the SDP. The optimization problems of this class are semidefinite packing problems, which are the SDP analogs to vector packing problems. Of particular interest is the case in which our result guarantees the existence of a solution of rank one: we show that the computation of this solution actually reduces to a Second Order Cone Program (SOCP). We point out an application in statistics, in the optimal design of experiments.}, language = {en} } @article{FackeldeyKlimmWeber2012, author = {Fackeldey, Konstantin and Klimm, Martina and Weber, Marcus}, title = {A Coarse Graining Method for the Dimension Reduction of the State Space of Biomolecules}, volume = {5}, journal = {Journal of Mathematical Chemistry}, number = {9}, pages = {2623 -- 2635}, year = {2012}, language = {en} } @article{KubeWeber2007, author = {Kube, Susanna and Weber, Marcus}, title = {A Coarse Graining Method for the Identification of Transition rates between Molecular Conformations}, volume = {126}, journal = {Journal of Chemical Physics}, number = {2}, doi = {10.1063/1.2404953}, year = {2007}, language = {en} } @misc{Gamrath2016, type = {Master Thesis}, author = {Gamrath, Gerwin}, title = {A Coarse-to-Fine Approach for the Workforce Scheduling of Teams}, pages = {72}, year = {2016}, abstract = {We present a coarse-to-fine column generation approach for the workforce scheduling of teams. In addition we present a price-and-branch approach and a new hypergraph formulation for a specific workforce team problem, called the Toll Enforcement Problem.}, language = {en} } @misc{BorndoerferReutherSchlechte2014, author = {Bornd{\"o}rfer, Ralf and Reuther, Markus and Schlechte, Thomas}, title = {A Coarse-To-Fine Approach to the Railway Rolling Stock Rotation Problem}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-51009}, year = {2014}, abstract = {We propose a new coarse-to-fine approach to solve certain linear programs by column generation. The problems that we address contain layers corresponding to different levels of detail, i.e., coarse layers as well as fine layers. These layers are utilized to design efficient pricing rules. In a nutshell, the method shifts the pricing of a fine linear program to a coarse counterpart. In this way, major decisions are taken in the coarse layer, while minor details are tackled within the fine layer. We elucidate our methodology by an application to a complex railway rolling stock rotation problem. We provide comprehensive computational results that demonstrate the benefit of this new technique for the solution of large scale problems.}, language = {en} } @inproceedings{BorndoerferReutherSchlechte2014, author = {Bornd{\"o}rfer, Ralf and Reuther, Markus and Schlechte, Thomas}, title = {A Coarse-To-Fine Approach to the Railway Rolling Stock Rotation Problem}, volume = {42}, booktitle = {14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems}, doi = {10.4230/OASIcs.ATMOS.2014.79}, pages = {79 -- 91}, year = {2014}, abstract = {We propose a new coarse-to-fine approach to solve certain linear programs by column generation. The problems that we address contain layers corresponding to different levels of detail, i.e., coarse layers as well as fine layers. These layers are utilized to design efficient pricing rules. In a nutshell, the method shifts the pricing of a fine linear program to a coarse counterpart. In this way, major decisions are taken in the coarse layer, while minor details are tackled within the fine layer. We elucidate our methodology by an application to a complex railway rolling stock rotation problem. We provide comprehensive computational results that demonstrate the benefit of this new technique for the solution of large scale problems.}, language = {en} } @inproceedings{KindermannSchintkeFritzsch2012, author = {Kindermann, S. and Schintke, Florian and Fritzsch, B.}, title = {A Collaborative Data Management Infrastructure for Climate Data Analysis}, volume = {14, EGU2012-10569}, booktitle = {Geophysical Research Abstracts}, doi = {10013/epic.39635.d001}, year = {2012}, language = {en} } @inproceedings{JoachimskyMaIckingetal.2019, author = {Joachimsky, Robert and Ma, Lihong and Icking, Christian and Zachow, Stefan}, title = {A Collision-Aware Articulated Statistical Shape Model of the Human Spine}, booktitle = {Proc. of the 18th annual conference on Computer- and Robot-assisted Surgery (CURAC)}, pages = {58 -- 64}, year = {2019}, abstract = {Statistical Shape Models (SSMs) are a proven means for model-based 3D anatomy reconstruction from medical image data. In orthopaedics and biomechanics, SSMs are increasingly employed to individualize measurement data or to create individualized anatomical models to which implants can be adapted to or functional tests can be performed on. For modeling and analysis of articulated structures, so called articulated SSMs (aSSMs) have been developed. However, a missing feature of aSSMs is the consideration of collisions in the course of individual fitting and articulation. The aim of our work was to develop aSSMs that handle collisions between components correctly. That way it becomes possible to adjust shape and articulation in view of a physically and geometrically plausible individualization. To be able to apply collision-aware aSSMs in simulation and optimisation, our approach is based on an e� cient collision detection method employing Graphics Processing Units (GPUs).}, language = {en} } @misc{BorndoerferScheltenSchlechteetal.2005, author = {Bornd{\"o}rfer, Ralf and Schelten, Uwe and Schlechte, Thomas and Weider, Steffen}, title = {A Column Generation Approach to Airline Crew Scheduling}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-8713}, number = {05-37}, year = {2005}, abstract = {The airline crew scheduling problem deals with the construction of crew rotations in order to cover the flights of a given schedule at minimum cost. The problem involves complex rules for the legality and costs of individual pairings and base constraints for the availability of crews at home bases. A typical instance considers a planning horizon of one month and several thousand flights. We propose a column generation approach for solving airline crew scheduling problems that is based on a set partitioning model. We discuss algorithmic aspects such as the use of bundle techniques for the fast, approximate solution of linear programs, a pairing generator that combines Lagrangean shortest path and callback techniques, and a novel rapid branching'' IP heuristic. Computational results for a number of industrial instances are reported. Our approach has been implemented within the commercial crew scheduling system NetLine/Crew of Lufthansa Systems Berlin GmbH.}, language = {en} } @inproceedings{BorndoerferScheltenSchlechteetal.2006, author = {Bornd{\"o}rfer, Ralf and Schelten, Uwe and Schlechte, Thomas and Weider, Steffen}, title = {A Column Generation Approach to Airline Crew Scheduling}, booktitle = {Operations Research Proceedings 2005}, editor = {Haasis, Hans-Dietrich}, publisher = {Springer-Verlag}, pages = {343 -- 348}, year = {2006}, language = {en} } @misc{BorndoerferGroetschelPfetsch2005, author = {Bornd{\"o}rfer, Ralf and Gr{\"o}tschel, Martin and Pfetsch, Marc}, title = {A Column-Generation Approach to Line Planning in Public Transport}, doi = {/10.1287/trsc.1060.0161}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-8522}, number = {05-18}, year = {2005}, abstract = {The line planning problem is one of the fundamental problems in strategic planning of public and rail transport. It consists in finding lines and corresponding frequencies in a transport network such that a given travel demand can be satisfied. There are (at least) two objectives. The transport company wishes to minimize operating costs, the passengers want to minimize travel times. We propose a n ew multi-commodity flow model for line planning. Its main features, in comparison to existing models, are that the passenger paths can be freely routed and that the lines are generated dynamically. We discuss properties of this model and investigate its complexity. Results with data for the city of Potsdam, Germany, are reported.}, language = {en} } @article{BorndoerferGroetschelPfetsch2007, author = {Bornd{\"o}rfer, Ralf and Gr{\"o}tschel, Martin and Pfetsch, Marc}, title = {A Column-Generation Approach to Line Planning in Public Transport}, volume = {41}, journal = {Transportation Science (INFORMS)}, number = {1}, doi = {10.1287/trsc.1060.0161}, pages = {123 -- 132}, year = {2007}, language = {en} } @misc{BeckenbachPeisSchaudtetal.2017, author = {Beckenbach, Isabel and Peis, Britta and Schaudt, Oliver and Scheidweiler, Robert}, title = {A Combinatorial Proof of a K{\"o}nig-type Theorem for Unimodular Hypergraphs}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-64017}, year = {2017}, abstract = {We state purely combinatorial proofs for K{\"o}nig- and Hall-type theorems for a wide class of combinatorial optimization problems. Our methods rely on relaxations of the matching and vertex cover problem and, moreover, on the strong coloring properties admitted by bipartite graphs and their generalizations.}, language = {en} } @phdthesis{Villatoro2018, author = {Villatoro, Jos{\´e}}, title = {A combined approach for the analysis of biomolecules using IR-MALDI ion mobility spectrometry and molecular dynamics simulations of peptide ions in the gas phase}, year = {2018}, language = {en} } @article{SchimunekSeidlElezetal.2024, 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}, volume = {43}, journal = {Molecular Informatics}, number = {1}, doi = {https://doi.org/10.1002/minf.202300262}, pages = {e202300262}, year = {2024}, language = {en} } @article{vanLieshoutLindner2025, author = {van Lieshout, Rolf and Lindner, Niels}, title = {A Compact Cycle Formulation for the Multiperiodic Event Scheduling Problem}, arxiv = {http://arxiv.org/abs/2507.17566}, year = {2025}, abstract = {The Periodic Event Scheduling Problem (PESP) is a fundamental model in periodic timetabling for public transport systems, assuming a common period across all events. However, real-world networks often feature heterogeneous service frequencies. This paper studies the Multiperiodic Event Scheduling Problem (MPESP), a generalization of PESP that allows each event to recur at its own individual period. While more expressive, MPESP presents new modeling challenges due to the loss of a global period. We present a cycle-based formulation for MPESP that extends the strongest known formulation for PESP and, in contrast to existing approaches, is valid for any MPESP instance. Crucially, the formulation requires a cycle basis derived from a spanning tree satisfying specific structural properties, which we formalize and algorithmically construct, extending the concept of sharp spanning trees to rooted instances. We further prove a multiperiodic analogue of the cycle periodicity property. Our new formulation solves nearly all tested instances, including several large-scale real-world public transport networks, to optimality or with small optimality gaps, dramatically outperforming existing arc-based models. The results demonstrate the practical potential of MPESP in capturing heterogeneous frequencies without resorting to artificial event duplication.}, language = {en} } @article{WillschFriedrichBaumetal.2020, author = {Willsch, Maraike and Friedrich, Frank and Baum, Daniel and Jurisch, Ivo and Ohl, Michael}, title = {A comparative description of the mesosomal musculature in Sphecidae and Ampulicidae (Hymenoptera, Apoidea) using 3D techniques}, volume = {67}, journal = {Deutsche Entomologische Zeitschrift}, number = {1}, doi = {10.3897/dez.67.49493}, pages = {51 -- 67}, year = {2020}, abstract = {Conflicting hypotheses about the relationships among the major lineages of aculeate Hymenoptera clearly show the necessity of detailed comparative morphological studies. Using micro-computed tomography and 3D reconstructions, the skeletal musculature of the meso- and metathorax and the first and second abdominal segment in Apoidea are described. Females of Sceliphron destillatorium, Sphex (Fernaldina) lucae (both Sphecidae), and Ampulex compressa (Ampulicidae) were examined. The morphological terminology provided by the Hymenoptera Anatomy Ontology is used. Up to 42 muscles were found. The three species differ in certain numerical and structural aspects. Ampulicidae differs significantly from Sphecidae in the metathorax and the anterior abdomen. The metapleural apodeme and paracoxal ridge are weakly developed in Ampulicidae, which affect some muscular structures. Furthermore, the muscles that insert on the coxae and trochanters are broader and longer in Ampulicidae. A conspicuous characteristic of Sphecidae is the absence of the metaphragma. Overall, we identified four hitherto unrecognized muscles. Our work suggests additional investigations on structures discussed in this paper.}, language = {en} } @misc{Wolf1999, author = {Wolf, Thomas}, title = {A comparison of four approaches to the calculation of conservation laws}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-3896}, number = {SC-99-01}, year = {1999}, abstract = {The paper compares computational aspects of four approaches to compute conservation laws of single differential equations or systems of them, ODEs and PDEs. The only restriction, required by two of the four corresponding computer algebra programs, is that each DE has to be solvable for a leading derivative. Extra constraints may be given. Examples of new conservation laws include non-polynomial expressions, an explicit variable dependence and conservation laws involving arbitrary functions. Examples involve the following equations: Ito, Liouville, Burgers, Kadomtsev-Petviashvili, Karney-Sen-Chu-Verheest, Boussinesq, Tzetzeica, Benney.}, language = {en} } @misc{Deuflhard2002, author = {Deuflhard, Peter}, title = {A Comparison of Related Concepts in Computational Chemistry and Mathematics}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-7138}, number = {02-46}, year = {2002}, abstract = {This article studies the relation of the two scientific languages Chemistry and Mathematics via three selected comparisons: (a) QSSA versus dynamic ILDM in reaction kinetics, (b) lumping versus discrete Galerkin methods in polymer chemistry, and (c) geometrical conformations versus metastable conformations in drug design. The common clear message from these comparisons is that chemical intuition may pave the way for mathematical concepts just as chemical concepts may gain from mathematical precisioning. Along this line, significant improvements in chemical research and engineering have already been possible -- and can be further expected in the future from the dialogue between the two scientific languages.}, language = {en} } @incollection{Deuflhard2003, author = {Deuflhard, Peter}, title = {A Comparison of Related Concepts in Computational Chemistry and Mathematics}, volume = {88}, booktitle = {Chemisty and Mathematics}, number = {330}, pages = {51 -- 66}, year = {2003}, language = {en} } @inproceedings{LockauHammerschmidtHaschkeetal.2014, author = {Lockau, Daniel and Hammerschmidt, Martin and Haschke, Jan and Blome, Mark and Ruske, Florian and Schmidt, Frank and Rech, Bernd}, title = {A comparison of scattering and non-scattering anti-reflection designs for back contacted polycrystalline thin film silicon solar cells in superstrate configuration}, volume = {9140}, booktitle = {Proc. SPIE}, doi = {10.1117/12.2052362}, pages = {914006}, year = {2014}, language = {en} } @article{YevickFrieseSchmidt2001, author = {Yevick, David and Friese, T. and Schmidt, Frank}, title = {A Comparison of Transparent Boundary Conditions for the Fresnel Equation}, volume = {168}, journal = {J. Comput. Phys.}, number = {2}, pages = {433 -- 444}, year = {2001}, language = {en} } @misc{YevickFrieseSchmidt2000, author = {Yevick, David and Friese, Tilmann and Schmidt, Frank}, title = {A Comparison of Transparent Boundary Conditions for the Fresnel Equation}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-5738}, number = {00-05}, year = {2000}, abstract = {We establish the relationship between the transparent boundary condition (BPP) of Baskakov and Popov [Wave Motion 14 (1991) 121-128] and Pakpadakis et. al. [J. Acoust. Soc. Am. 92 (1992) 2030-2038] and a second boundary condition (SDY) introduced by Schmidt and Deuflhard [Comp. Math. Appl. 29 (1995) 53-76] and Schmidt and Yevick [J. Compu. Phys. 134 (1997) 96-107], that is explicitly tailored to the form of the underlying numerical propagation scheme. Our analysis demonstrates that if the domain is first discretized in the propagation direction, the SDY expression can be obtained by applying the exact sequence of steps used to derive the BPP procedure. The BPP method is thus an approximate realization of the computationally far simpler and unconditionally stable SDY boundary condition.}, language = {en} }