@article{SchmaltzPokuttaHeidornetal.2014, author = {Schmaltz, Christian and Pokutta, Sebastian and Heidorn, Thomas and Andrae, Silvio}, title = {How to make regulators and shareholders happy under Basel III}, journal = {Journal of Banking and Finance}, pages = {311 -- 325}, year = {2014}, language = {en} } @article{BraunPokutta2014, author = {Braun, G{\´a}bor and Pokutta, Sebastian}, title = {A short proof for the polyhedrality of the Chv{\´a}tal-Gomory closure of a compact convex set}, volume = {42}, journal = {Operations Research Letters}, arxiv = {http://arxiv.org/abs/1207.4884}, pages = {307 -- 310}, year = {2014}, language = {en} } @article{DeyPokutta2014, author = {Dey, Santanu Sabush and Pokutta, Sebastian}, title = {Design and verify: a new scheme for generating cutting-planes}, volume = {145}, journal = {Mathematical Programming A}, pages = {199 -- 222}, year = {2014}, language = {en} } @article{PokuttaStruengmann2007, author = {Pokutta, Sebastian and Str{\"u}ngmann, L.}, title = {The Chase radical and reduced products}, volume = {211}, journal = {Journal of Pure and Applied Algebra}, pages = {532 -- 540}, year = {2007}, language = {en} } @article{DrosteGoebelPokutta2008, author = {Droste, M. and G{\"o}bel, R. and Pokutta, Sebastian}, title = {Absolute graphs with prescribed endomorphism monoid}, volume = {76}, journal = {Semigroup Forum}, pages = {256 -- 267}, year = {2008}, language = {en} } @article{GoebelPokutta2008, author = {G{\"o}bel, R. and Pokutta, Sebastian}, title = {Construction of dual modules using Martin's axiom}, volume = {320}, journal = {Journal of Algebra}, pages = {2388 -- 2404}, year = {2008}, language = {en} } @article{HeldtKreuzerPokuttaetal.2009, author = {Heldt, D. and Kreuzer, M. and Pokutta, Sebastian and Poulisse, H.}, title = {Approximate Computation of zero-dimensional polynomial ideals}, volume = {44}, journal = {Journal of Symbolic Computation}, pages = {1566 -- 1591}, year = {2009}, language = {en} } @article{PokuttaStauffer2009, author = {Pokutta, Sebastian and Stauffer, G.}, title = {France Telecom Workforce Scheduling Problem: a challenge}, journal = {RAIRO-Operations Research}, number = {43}, pages = {375 -- 386}, year = {2009}, language = {en} } @article{BraunPokutta2011, author = {Braun, G{\´a}bor and Pokutta, Sebastian}, title = {Random half-integral polytopes}, volume = {39}, journal = {Operations Research Letters}, number = {3}, pages = {204 -- 207}, year = {2011}, language = {en} } @article{HausHemmeckePokutta2011, author = {Haus, Utz-Uwe and Hemmecke, R. and Pokutta, Sebastian}, title = {Reconstructing biochemical cluster networks}, volume = {49}, journal = {Journal of Mathematical Chemistry}, number = {10}, arxiv = {http://arxiv.org/abs/0906.1342v2}, pages = {2441 -- 2456}, year = {2011}, language = {en} } @article{LetchfordPokuttaSchulz2011, author = {Letchford, A.N. and Pokutta, Sebastian and Schulz, A.S.}, title = {On the membership problem for the 0,1/2-closure}, volume = {39}, journal = {Operations Research Letters}, number = {5}, pages = {301 -- 304}, year = {2011}, language = {en} } @article{PokuttaSchulz2011, author = {Pokutta, Sebastian and Schulz, A.S.}, title = {Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chv{\´a}tal rank}, volume = {39}, journal = {Operations Research Letters}, number = {6}, pages = {457 -- 460}, year = {2011}, language = {en} } @article{DrewesPokutta2014, author = {Drewes, S. and Pokutta, Sebastian}, title = {Computing discrete expected utility maximizing portfolios}, volume = {23}, journal = {Journal of Investing}, number = {4}, pages = {121 -- 132}, year = {2014}, language = {en} } @article{DrewesPokutta2014, author = {Drewes, S. and Pokutta, Sebastian}, title = {Symmetry-exploiting cuts for a class of mixed-0/1 second order cone programs}, volume = {13}, journal = {Discrete Optimization}, pages = {23 -- 35}, year = {2014}, language = {en} } @article{MartinMuellerPokutta2014, author = {Martin, Alexander and M{\"u}ller, J. and Pokutta, Sebastian}, title = {Strict linear prices in non-convex European day-ahead electricity markets}, volume = {29}, journal = {Optimization Methods and Software}, number = {1}, pages = {189 -- 221}, year = {2014}, language = {en} } @article{BrietDadushPokutta2015, author = {Bri{\"e}t, Jop and Dadush, Daniel and Pokutta, Sebastian}, title = {On the existence of 0/1 polytopes with high semidefinite extension complexity}, volume = {153}, journal = {Mathematical Programming B}, number = {1}, arxiv = {http://arxiv.org/abs/1305.3268}, pages = {179 -- 199}, year = {2015}, language = {en} } @article{BraunFioriniPokuttaetal.2015, author = {Braun, G{\´a}bor and Fiorini, Samuel and Pokutta, Sebastian and Steurer, D.}, title = {Approximation Limits of Linear Programs (Beyond Hierarchies)}, volume = {40}, journal = {Mathematics of Operations Research}, number = {3}, arxiv = {http://arxiv.org/abs/1204.0957}, pages = {179 -- 199}, year = {2015}, language = {en} } @article{BraunPokutta2015, author = {Braun, G{\´a}bor and Pokutta, Sebastian}, title = {The matching polytope does not admit fully-polynomial size relaxation schemes}, volume = {61}, journal = {IEEE Transactions on Information Theory}, number = {10}, arxiv = {http://arxiv.org/abs/1403.6710}, pages = {1 -- 11}, year = {2015}, language = {en} } @article{BraunPokuttaXie2015, author = {Braun, G{\´a}bor and Pokutta, Sebastian and Xie, Y.}, title = {Info-Greedy Sequential Adaptive Compressed Sensing}, volume = {9}, journal = {IEEE Journal of Selected Topics in Signal Processing}, number = {4}, arxiv = {http://arxiv.org/abs/1407.0731}, pages = {601 -- 611}, year = {2015}, language = {en} } @article{FioriniMassarPokuttaetal.2015, author = {Fiorini, Samuel and Massar, S. and Pokutta, Sebastian and Tiwary, H.R. and de Wolf, R.}, title = {Exponential Lower Bounds for Polytopes in Combinatorial Optimization}, volume = {62}, journal = {Journal of the ACM}, number = {2}, arxiv = {http://arxiv.org/abs/1111.0837}, pages = {1 -- 17}, year = {2015}, language = {en} } @article{BraunFioriniPokutta2016, author = {Braun, G{\´a}bor and Fiorini, Samuel and Pokutta, Sebastian}, title = {Average case polyhedral complexity of the maximum stable set problem}, volume = {160}, journal = {Mathematical Programming A}, number = {1}, arxiv = {http://arxiv.org/abs/1311.4001}, pages = {407 -- 431}, year = {2016}, language = {en} } @article{BraunPokutta2016, author = {Braun, G{\´a}bor and Pokutta, Sebastian}, title = {A polyhedral characterization of Border Bases}, volume = {30}, journal = {SIAM Journal on Discrete Mathematics}, number = {1}, arxiv = {http://arxiv.org/abs/0912.1502}, pages = {239 -- 265}, year = {2016}, language = {en} } @inproceedings{PokuttaSchmaltz2011, author = {Pokutta, Sebastian and Schmaltz, Christian}, title = {Optimal Planning under Basel III Regulations}, booktitle = {Proceedings of 24th Australasian Finance and Banking Conference}, year = {2011}, language = {en} } @inproceedings{BraunFioriniPokuttaetal.2012, author = {Braun, G{\´a}bor and Fiorini, Samuel and Pokutta, Sebastian and Steurer, D.}, title = {Approximation Limits of Linear Programs (Beyond Hierarchies)}, booktitle = {Proceedings of FOCS}, arxiv = {http://arxiv.org/abs/1204.0957}, year = {2012}, language = {en} } @inproceedings{BraunPokutta2012, author = {Braun, G{\´a}bor and Pokutta, Sebastian}, title = {An algebraic view on symmetric extended formulations}, volume = {7422}, booktitle = {Proceedings of ISCO, Lecture Notes in Computer Science}, number = {141--152}, arxiv = {http://arxiv.org/abs/1206.6318}, year = {2012}, language = {en} } @inproceedings{FioriniMassarPokuttaetal.2012, author = {Fiorini, Samuel and Massar, S. and Pokutta, Sebastian and Tiwary, H.R. and de Wolf, R.}, title = {Linear vs. Semidefinite Extended Formulations: Exponential Separation and Strong Lower Bounds}, booktitle = {Proceedings of STOC}, arxiv = {http://arxiv.org/abs/1111.0837}, year = {2012}, language = {en} } @inproceedings{SchmaltzPokuttaHeidornetal.2013, author = {Schmaltz, Christian and Pokutta, Sebastian and Heidorn, Thomas and Andrae, Silvio}, title = {How to make regulators and shareholders happy under Basel III}, booktitle = {Proceedings of the 26th Australasian Finance and Banking Conference}, year = {2013}, language = {en} } @inproceedings{BrietDadushPokutta2013, author = {Bri{\"e}t, Jop and Dadush, Daniel and Pokutta, Sebastian}, title = {On the existence of 0/1 polytopes with high semidefinite extension complexity}, booktitle = {Proceedings of ESA}, arxiv = {http://arxiv.org/abs/1305.3268}, year = {2013}, language = {en} } @inproceedings{BraunPokutta2013, author = {Braun, Gabor and Pokutta, Sebastian}, title = {Foundations of Computer Science (FOCS), 2013 IEEE 54th Annual Symposium}, booktitle = {Foundations of Computer Science (FOCS), 2013 IEEE 54th Annual Symposium}, pages = {688 -- 697}, year = {2013}, language = {en} } @inproceedings{BraunFioriniPokutta2014, author = {Braun, G{\´a}bor and Fiorini, Samuel and Pokutta, Sebastian}, title = {Average case polyhedral complexity of the maximum stable set problem}, booktitle = {Proceedings of RANDOM}, arxiv = {http://arxiv.org/abs/1311.4001}, year = {2014}, language = {en} } @inproceedings{BraunPokuttaXie2014, author = {Braun, G{\´a}bor and Pokutta, Sebastian and Xie, Y.}, title = {Info-Greedy Sequential Adaptive Compressed Sensing}, booktitle = {Proceedings of 52nd Annual Allerton Conference on Communication, Control, and Computing}, arxiv = {http://arxiv.org/abs/1407.0731}, year = {2014}, language = {en} } @inproceedings{BazziFioriniPokuttaetal.2015, author = {Bazzi, Abbas and Fiorini, Samuel and Pokutta, Sebastian and Svensson, Ola}, title = {Small linear programs cannot approximate Vertex Cover within a factor of 2 - epsilon}, booktitle = {Proceedings of FOCS}, arxiv = {http://arxiv.org/abs/1503.00753}, year = {2015}, language = {en} } @inproceedings{SobollGolas2012, author = {Soboll, T. and Golas, Ulrike}, title = {A Local-Global Model for Multiagent Systems - Sheaves on the Category MAS}, volume = {2}, booktitle = {Proceedings of ICAART 2012}, editor = {Filipe, J. and Fred, A.}, publisher = {SciTePress}, pages = {331 -- 334}, year = {2012}, language = {en} } @article{GolasLambersEhrigetal.2012, author = {Golas, Ulrike and Lambers, L. and Ehrig, Hartmut and Orejas, Fernando}, title = {Attributed Graph Transformation with Inheritance}, volume = {424}, journal = {Theoretical Computer Science}, doi = {10.1016/j.tcs.2012.01.032}, pages = {46 -- 68}, year = {2012}, language = {en} } @incollection{FlikReinefeld2012, author = {Flik, T. and Reinefeld, Alexander}, title = {Rechnerorganisation}, booktitle = {H{\"u}tte - Das Ingenieurwissen}, editor = {Czichos, Horst and Hennecke, Manfred}, edition = {34}, publisher = {Springer-Verlag Berlin}, pages = {J6 -- J124}, year = {2012}, language = {en} } @inproceedings{Golas2012, author = {Golas, Ulrike}, title = {A General Attribution Concept for Models in M-Adhesive Transformation Systems}, volume = {7562}, booktitle = {Proceedings of ICGT 2012}, editor = {Ehrig, Hartmut and Engels, G. and Kreowski, H.-J. and Rozenberg, G.}, publisher = {Springer}, doi = {10.1007/978-3-642-33654-6_13}, pages = {187 -- 202}, year = {2012}, language = {en} } @inproceedings{GolasLambersEhrigetal.2012, author = {Golas, Ulrike and Lambers, L. and Ehrig, Hartmut and Giese, H.}, title = {Towards Bridging the Gap between Formal Foundations and Current Practice for Triple Graph Grammars - Flexible Relations between Source and Target Elements}, volume = {7562}, booktitle = {Proceedings of ICGT 2012}, editor = {Ehrig, Hartmut and Engels, G. and Kreowski, H.-J. and Rozenberg, G.}, publisher = {Springer}, doi = {10.1007/978-3-642-33654-6_10}, pages = {141 -- 155}, year = {2012}, language = {en} } @inproceedings{HeckelEhrigGolasetal.2012, author = {Heckel, R. and Ehrig, Hartmut and Golas, Ulrike and Hermann, Frank}, title = {Parallelism and Concurrency of Stochastic Graph Transformations}, volume = {7562}, booktitle = {Proceedings of ICGT 2012}, editor = {Ehrig, Hartmut and Engels, G. and Kreowski, H.-J. and Rozenberg, G.}, publisher = {Springer}, doi = {10.1007/978-3-642-33654-6_7}, pages = {96 -- 110}, year = {2012}, language = {en} } @article{EhrigGolasHabeletal.2012, author = {Ehrig, Hartmut and Golas, Ulrike and Habel, A. and Lambers, L. and Orejas, Fernando}, title = {M-Adhesive Transformation Systems with Nested Application Conditions. Part 2}, volume = {118}, journal = {Fundamenta Informaticae}, number = {1-2}, doi = {10.3233/FI-2012-705}, pages = {35 -- 63}, year = {2012}, language = {en} } @misc{OPUS4-3402, title = {Proceedings of ACCAT 2012}, journal = {Electronic Proceedings in Theoretical Computer Science 93}, editor = {Golas, Ulrike and Soboll, T.}, doi = {10.4204/EPTCS.93}, year = {2012}, language = {en} } @inproceedings{SchaeferHoegqvist2012, author = {Sch{\"a}fer, Patrick and H{\"o}gqvist, Mikael}, title = {SFA : a symbolic fourier approximation and index for similarity search in high dimensional datasets}, booktitle = {Proceedings of the 15th International Conference on Extending Database Technology}, publisher = {ACM}, address = {New York, NY, USA}, doi = {10.1145/2247596.2247656}, pages = {516 -- 527}, year = {2012}, language = {en} } @inproceedings{OrejasBoronatGolasetal.2013, author = {Orejas, Fernando and Boronat, Artur and Golas, Ulrike and Mylonakis, Nikos}, title = {Checking Bisimilarity for Attributed Graph Transformation}, volume = {7794}, booktitle = {Foundations of Software Science and Computation Structures. Proceedings of FOSSACS 2013}, editor = {Pfenning, Frank}, publisher = {Springer}, doi = {10.1007/978-3-642-37075-5_8}, pages = {113 -- 128}, year = {2013}, language = {en} } @inproceedings{SchaeferDressler2013, author = {Sch{\"a}fer, Patrick and Dreßler, Sebastian}, title = {Shooting Audio Recordings of Insects with SFA}, booktitle = {AmiBio Workshop, Bonn, Germany}, year = {2013}, language = {en} } @misc{Reinbacher2013, type = {Master Thesis}, author = {Reinbacher, Uwe}, title = {Implementierung und Evaluierung eines FPGA-basierten statischen Paketfilters}, year = {2013}, language = {de} } @inproceedings{RitterBaumannFelsenberg2010, author = {Ritter, Zully and Baumann, Wolfgang and Felsenberg, Dieter}, title = {In vivo tibial compressive stiffness variations after HR-pQCT measurements of 60 days immobility during the Berlin bed rest study II using μfinite element analysis}, volume = {31}, booktitle = {6th World Congress of Biomechanics (WCB 2010), August 1-6, 2010 Singapore: In Conjunction with 14th International Conference on Biomedical Engineering (ICBME) and 5th Asia Pacific Conference on Biomechanics (APBiomech)}, doi = {10.1007/978-3-642-14515-5_209}, pages = {823 -- 826}, year = {2010}, language = {en} } @misc{BaumLindowHegeetal.2017, author = {Baum, Daniel and Lindow, Norbert and Hege, Hans-Christian and Lepper, Verena and Siopi, Tzulia and Kutz, Frank and Mahlow, Kristin and Mahnke, Heinz-Eberhard}, title = {Revealing hidden text in rolled and folded papyri}, issn = {1438-0064}, doi = {10.1007/s00339-017-0808-6}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-61826}, year = {2017}, abstract = {Ancient Egyptian papyri are often folded, rolled up or kept as small packages, sometimes even sealed. Physically unrolling or unfolding these packages might severely damage them. We demonstrate a way to get access to the hidden script without physical unfolding by employing computed tomography and mathematical algorithms for virtual unrolling and unfolding. Our algorithmic approaches are combined with manual interaction. This provides the necessary flexibility to enable the unfolding of even complicated and partly damaged papyrus packages. In addition, it allows us to cope with challenges posed by the structure of ancient papyrus, which is rather irregular, compared to other writing substrates like metallic foils or parchment. Unfolding of packages is done in two stages. In the first stage, we virtually invert the physical folding process step by step until the partially unfolded package is topologically equivalent to a scroll or a papyrus sheet folded only along one fold line. To minimize distortions at this stage, we apply the method of moving least squares. In the second stage, the papyrus is simply flattened, which requires the definition of a medial surface. We have applied our software framework to several papyri. In this work, we present the results of applying our approaches to mockup papyri that were either rolled or folded along perpendicular fold lines. In the case of the folded papyrus, our approach represents the first attempt to address the unfolding of such complicated folds.}, language = {en} } @article{Lange2016, author = {Lange, Alexander}, title = {Reconstruction of disease transmission rates: applications to measles, dengue, and influenza}, volume = {400}, journal = {Journal of Theoretical Biology}, doi = {10.1016/j.jtbi.2016.04.017}, pages = {138 -- 153}, year = {2016}, language = {en} } @article{BauerGribovaLangeetal.2017, author = {Bauer, Gernot and Gribova, Nadezhda and Lange, Alexander and Holm, Christian and Gross, Joachim}, title = {Three-body effects in triplets of capped gold nanocrystals}, volume = {115}, journal = {Molecular Physics}, doi = {10.1080/00268976.2016.1213909}, pages = {1031 -- 1040}, year = {2017}, language = {en} } @misc{Schiela2012, author = {Schiela, Anton}, title = {A cubic regularization algorithm for nonconvex optimization in function space (in preparation)}, issn = {1438-0064}, year = {2012}, abstract = {We propose a cubic regularization algorithm that is constructed to deal with nonconvex minimization problems in function space. It allows for a flexible choice of the regularization term and thus accounts for the fact that in such problems one often has to deal with more than one norm. Global and local convergence results are established in a general framework. Moreover, several variants of step computations are compared. In the context of nonlinear elasticity it turns out the a cg method applied to an augmented Hessian is more robust than truncated cg.}, language = {en} } @misc{LieSullivan2016, author = {Lie, Han Cheng and Sullivan, T. J.}, title = {Cameron--Martin theorems for sequences of Cauchy-distributed random variables}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-60230}, year = {2016}, abstract = {Given a sequence of Cauchy-distributed random variables defined by a sequence of location parameters and a sequence of scale parameters, we consider another sequence of random variables that is obtained by perturbing the location or scale parameter sequences. Using a result of Kakutani on equivalence of infinite product measures, we provide sufficient conditions for the equivalence of laws of the two sequences.}, language = {en} } @misc{Sullivan2016, author = {Sullivan, T. J.}, title = {Well-posed Bayesian inverse problems and heavy-tailed stable Banach space priors}, issn = {1438-0064}, doi = {10.3934/ipi.2017040}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-59422}, year = {2016}, abstract = {This article extends the framework of Bayesian inverse problems in infinite-dimensional parameter spaces, as advocated by Stuart (Acta Numer. 19:451-559, 2010) and others, to the case of a heavy-tailed prior measure in the family of stable distributions, such as an infinite-dimensional Cauchy distribution, for which polynomial moments are infinite or undefined. It is shown that analogues of the Karhunen-Lo{\`e}ve expansion for square-integrable random variables can be used to sample such measures. Furthermore, under weaker regularity assumptions than those used to date, the Bayesian posterior measure is shown to depend Lipschitz continuously in the Hellinger metric upon perturbations of the misfit function and observed data.}, language = {en} } @misc{CostaMantonOstrovskyetal.2016, author = {Costa, Marta and Manton, James D. and Ostrovsky, Aaron D. and Prohaska, Steffen and Jefferis, Gregory S.X.E.}, title = {NBLAST: Rapid, sensitive comparison of neuronal structure and construction of neuron family databases}, issn = {1438-0064}, doi = {10.1016/j.neuron.2016.06.012}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-59672}, year = {2016}, abstract = {Neural circuit mapping is generating datasets of 10,000s of labeled neurons. New computational tools are needed to search and organize these data. We present NBLAST, a sensitive and rapid algorithm, for measuring pairwise neuronal similarity. NBLAST considers both position and local geometry, decomposing neurons into short segments; matched segments are scored using a probabilistic scoring matrix defined by statistics of matches and non-matches. We validated NBLAST on a published dataset of 16,129 single Drosophila neurons. NBLAST can distinguish neuronal types down to the finest level (single identified neurons) without a priori information. Cluster analysis of extensively studied neuronal classes identified new types and unreported topographical features. Fully automated clustering organized the validation dataset into 1052 clusters, many of which map onto previously described neuronal types. NBLAST supports additional query types including searching neurons against transgene expression patterns. Finally we show that NBLAST is effective with data from other invertebrates and zebrafish.}, language = {en} } @article{CostaMantonOstrovskyetal.2016, author = {Costa, Marta and Manton, James D. and Ostrovsky, Aaron D. and Prohaska, Steffen and Jefferis, Gregory S.X.E.}, title = {NBLAST: Rapid, Sensitive Comparison of Neuronal Structure and Construction of Neuron Family Databases}, volume = {91}, journal = {Neuron}, number = {2}, doi = {10.1016/j.neuron.2016.06.012}, pages = {293 -- 311}, year = {2016}, abstract = {Neural circuit mapping is generating datasets of tens of thousands of labeled neurons. New computational tools are needed to search and organize these data. We present NBLAST, a sensitive and rapid algorithm, for measuring pairwise neuronal similarity. NBLAST considers both position and local geometry, decomposing neurons into short segments; matched segments are scored using a probabilistic scoring matrix defined by statistics of matches and non-matches. We validated NBLAST on a published dataset of 16,129 single Drosophila neurons. NBLAST can distinguish neuronal types down to the finest level (single identified neurons) without a priori information. Cluster analysis of extensively studied neuronal classes identified new types and unreported topographical features. Fully automated clustering organized the validation dataset into 1,052 clusters, many of which map onto previously described neuronal types. NBLAST supports additional query types, including searching neurons against transgene expression patterns. Finally, we show that NBLAST is effective with data from other invertebrates and zebrafish.}, language = {en} }