[{"department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"doi":"10.1007/s10474-016-0648-4","acknowledgement":"The authors are veryg rateful to Hansj ̈org Geiges \r\nfor fruitful discussions and advice and Christian Evers for helpful remarks on a draft version.","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","type":"journal_article","date_updated":"2021-01-12T06:49:40Z","day":"01","scopus_import":1,"date_published":"2016-12-01T00:00:00Z","page":"441 - 455","publication":"Acta Mathematica Hungarica","title":"Computing the Thurston–Bennequin invariant in open books","_id":"1292","oa":1,"abstract":[{"text":"We give explicit formulas and algorithms for the computation of the Thurston–Bennequin invariant of a nullhomologous Legendrian knot on a page of a contact open book and on Heegaard surfaces in convex position. Furthermore, we extend the results to rationally nullhomologous knots in arbitrary 3-manifolds.","lang":"eng"}],"publication_status":"published","citation":{"ista":"Durst S, Kegel M, Klukas MD. 2016. Computing the Thurston–Bennequin invariant in open books. Acta Mathematica Hungarica. 150(2), 441–455.","short":"S. Durst, M. Kegel, M.D. Klukas, Acta Mathematica Hungarica 150 (2016) 441–455.","chicago":"Durst, Sebastian, Marc Kegel, and Mirko D Klukas. “Computing the Thurston–Bennequin Invariant in Open Books.” <i>Acta Mathematica Hungarica</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s10474-016-0648-4\">https://doi.org/10.1007/s10474-016-0648-4</a>.","ieee":"S. Durst, M. Kegel, and M. D. Klukas, “Computing the Thurston–Bennequin invariant in open books,” <i>Acta Mathematica Hungarica</i>, vol. 150, no. 2. Springer, pp. 441–455, 2016.","ama":"Durst S, Kegel M, Klukas MD. Computing the Thurston–Bennequin invariant in open books. <i>Acta Mathematica Hungarica</i>. 2016;150(2):441-455. doi:<a href=\"https://doi.org/10.1007/s10474-016-0648-4\">10.1007/s10474-016-0648-4</a>","apa":"Durst, S., Kegel, M., &#38; Klukas, M. D. (2016). Computing the Thurston–Bennequin invariant in open books. <i>Acta Mathematica Hungarica</i>. Springer. <a href=\"https://doi.org/10.1007/s10474-016-0648-4\">https://doi.org/10.1007/s10474-016-0648-4</a>","mla":"Durst, Sebastian, et al. “Computing the Thurston–Bennequin Invariant in Open Books.” <i>Acta Mathematica Hungarica</i>, vol. 150, no. 2, Springer, 2016, pp. 441–55, doi:<a href=\"https://doi.org/10.1007/s10474-016-0648-4\">10.1007/s10474-016-0648-4</a>."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1605.00794"}],"quality_controlled":"1","author":[{"last_name":"Durst","first_name":"Sebastian","full_name":"Durst, Sebastian"},{"first_name":"Marc","last_name":"Kegel","full_name":"Kegel, Marc"},{"first_name":"Mirko D","last_name":"Klukas","full_name":"Klukas, Mirko D","id":"34927512-F248-11E8-B48F-1D18A9856A87"}],"year":"2016","intvolume":"       150","publist_id":"6023","month":"12","date_created":"2018-12-11T11:51:11Z","status":"public","volume":150,"issue":"2","publisher":"Springer"},{"scopus_import":1,"date_published":"2016-11-15T00:00:00Z","page":"247 - 275","department":[{"_id":"CaUh"}],"doi":"10.1016/j.laa.2016.07.026","language":[{"iso":"eng"}],"acknowledgement":"We wish to thank Alexander Engström and Bernd Sturmfels for various valuable discussions and insights. We also thank the two anonymous referees for their thoughtful feedback on the paper. CU was partially supported by the Austrian Science Fund (FWF) Y 903-N35.","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","type":"journal_article","date_updated":"2021-01-12T06:49:40Z","day":"15","intvolume":"       509","publist_id":"6024","month":"11","date_created":"2018-12-11T11:51:11Z","status":"public","volume":509,"publisher":"Elsevier","title":"Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without K5 minors","publication":"Linear Algebra and Its Applications","_id":"1293","oa":1,"project":[{"call_identifier":"FWF","_id":"2530CA10-B435-11E9-9278-68D0E5697425","name":"Gaussian Graphical Models: Theory and Applications","grant_number":"Y 903-N35"}],"abstract":[{"lang":"eng","text":"For a graph G with p vertices the closed convex cone S⪰0(G) consists of all real positive semidefinite p×p matrices whose sparsity pattern is given by G, that is, those matrices with zeros in the off-diagonal entries corresponding to nonedges of G. The extremal rays of this cone and their associated ranks have applications to matrix completion problems, maximum likelihood estimation in Gaussian graphical models in statistics, and Gauss elimination for sparse matrices. While the maximum rank of an extremal ray in S⪰0(G), known as the sparsity order of G, has been characterized for different classes of graphs, we here study all possible extremal ranks of S⪰0(G). We investigate when the geometry of the (±1)-cut polytope of G yields a polyhedral characterization of the set of extremal ranks of S⪰0(G). For a graph G without K5 minors, we show that appropriately chosen normal vectors to the facets of the (±1)-cut polytope of G specify the off-diagonal entries of extremal matrices in S⪰0(G). We also prove that for appropriately chosen scalars the constant term of the linear equation of each facet-supporting hyperplane is the rank of its corresponding extremal matrix in S⪰0(G). Furthermore, we show that if G is series-parallel then this gives a complete characterization of all possible extremal ranks of S⪰0(G). Consequently, the sparsity order problem for series-parallel graphs can be solved in terms of polyhedral geometry."}],"publication_status":"published","citation":{"ista":"Solus LT, Uhler C, Yoshida R. 2016. Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without K5 minors. Linear Algebra and Its Applications. 509, 247–275.","short":"L.T. Solus, C. Uhler, R. Yoshida, Linear Algebra and Its Applications 509 (2016) 247–275.","chicago":"Solus, Liam T, Caroline Uhler, and Ruriko Yoshida. “Extremal Positive Semidefinite Matrices Whose Sparsity Pattern Is given by Graphs without K5 Minors.” <i>Linear Algebra and Its Applications</i>. Elsevier, 2016. <a href=\"https://doi.org/10.1016/j.laa.2016.07.026\">https://doi.org/10.1016/j.laa.2016.07.026</a>.","ama":"Solus LT, Uhler C, Yoshida R. Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without K5 minors. <i>Linear Algebra and Its Applications</i>. 2016;509:247-275. doi:<a href=\"https://doi.org/10.1016/j.laa.2016.07.026\">10.1016/j.laa.2016.07.026</a>","ieee":"L. T. Solus, C. Uhler, and R. Yoshida, “Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without K5 minors,” <i>Linear Algebra and Its Applications</i>, vol. 509. Elsevier, pp. 247–275, 2016.","mla":"Solus, Liam T., et al. “Extremal Positive Semidefinite Matrices Whose Sparsity Pattern Is given by Graphs without K5 Minors.” <i>Linear Algebra and Its Applications</i>, vol. 509, Elsevier, 2016, pp. 247–75, doi:<a href=\"https://doi.org/10.1016/j.laa.2016.07.026\">10.1016/j.laa.2016.07.026</a>.","apa":"Solus, L. T., Uhler, C., &#38; Yoshida, R. (2016). Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without K5 minors. <i>Linear Algebra and Its Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.laa.2016.07.026\">https://doi.org/10.1016/j.laa.2016.07.026</a>"},"main_file_link":[{"url":"https://arxiv.org/pdf/1506.06702.pdf","open_access":"1"}],"quality_controlled":"1","author":[{"full_name":"Solus, Liam T","id":"2AADA620-F248-11E8-B48F-1D18A9856A87","last_name":"Solus","first_name":"Liam T"},{"last_name":"Uhler","first_name":"Caroline","full_name":"Uhler, Caroline","orcid":"0000-0002-7008-0216","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Yoshida, Ruriko","last_name":"Yoshida","first_name":"Ruriko"}],"year":"2016"},{"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert"},{"id":"41B58C0C-F248-11E8-B48F-1D18A9856A87","full_name":"Iglesias Ham, Mabel","last_name":"Iglesias Ham","first_name":"Mabel"}],"quality_controlled":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Edelsbrunner, Herbert, and Mabel Iglesias Ham. “Multiple Covers with Balls II: Weighted Averages.” <i>Electronic Notes in Discrete Mathematics</i>, vol. 54, Elsevier, 2016, pp. 169–74, doi:<a href=\"https://doi.org/10.1016/j.endm.2016.09.030\">10.1016/j.endm.2016.09.030</a>.","apa":"Edelsbrunner, H., &#38; Iglesias Ham, M. (2016). Multiple covers with balls II: Weighted averages. <i>Electronic Notes in Discrete Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.endm.2016.09.030\">https://doi.org/10.1016/j.endm.2016.09.030</a>","ieee":"H. Edelsbrunner and M. Iglesias Ham, “Multiple covers with balls II: Weighted averages,” <i>Electronic Notes in Discrete Mathematics</i>, vol. 54. Elsevier, pp. 169–174, 2016.","ama":"Edelsbrunner H, Iglesias Ham M. Multiple covers with balls II: Weighted averages. <i>Electronic Notes in Discrete Mathematics</i>. 2016;54:169-174. doi:<a href=\"https://doi.org/10.1016/j.endm.2016.09.030\">10.1016/j.endm.2016.09.030</a>","chicago":"Edelsbrunner, Herbert, and Mabel Iglesias Ham. “Multiple Covers with Balls II: Weighted Averages.” <i>Electronic Notes in Discrete Mathematics</i>. Elsevier, 2016. <a href=\"https://doi.org/10.1016/j.endm.2016.09.030\">https://doi.org/10.1016/j.endm.2016.09.030</a>.","short":"H. Edelsbrunner, M. Iglesias Ham, Electronic Notes in Discrete Mathematics 54 (2016) 169–174.","ista":"Edelsbrunner H, Iglesias Ham M. 2016. Multiple covers with balls II: Weighted averages. Electronic Notes in Discrete Mathematics. 54, 169–174."},"day":"01","year":"2016","type":"journal_article","date_updated":"2021-01-12T06:49:41Z","oa_version":"None","language":[{"iso":"eng"}],"doi":"10.1016/j.endm.2016.09.030","department":[{"_id":"HeEd"}],"_id":"1295","ec_funded":1,"publication":"Electronic Notes in Discrete Mathematics","title":"Multiple covers with balls II: Weighted averages","publication_status":"published","abstract":[{"lang":"eng","text":"Voronoi diagrams and Delaunay triangulations have been extensively used to represent and compute geometric features of point configurations. We introduce a generalization to poset diagrams and poset complexes, which contain order-k and degree-k Voronoi diagrams and their duals as special cases. Extending a result of Aurenhammer from 1990, we show how to construct poset diagrams as weighted Voronoi diagrams of average balls."}],"acknowledgement":"This work is partially supported by the Toposys project FP7-ICT-318493-STREP, and by ESF under the ACAT Research Network Programme.","project":[{"name":"Topological Complex Systems","grant_number":"318493","_id":"255D761E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"page":"169 - 174","volume":54,"date_published":"2016-10-01T00:00:00Z","publisher":"Elsevier","publist_id":"5976","scopus_import":1,"intvolume":"        54","status":"public","date_created":"2018-12-11T11:51:12Z","month":"10"},{"publication":"Nature","title":"A neuronal circuit for colour vision based on rod-cone opponency","doi":"10.1038/nature17158","_id":"1303","acknowledgement":"This work was supported by grants to M.M. from the NIH and to M.J. from The International Human Frontier Science Program Organization.","publication_status":"published","abstract":[{"text":"In bright light, cone-photoreceptors are active and colour vision derives from a comparison of signals in cones with different visual pigments. This comparison begins in the retina, where certain retinal ganglion cells have 'colour-opponent' visual responses-excited by light of one colour and suppressed by another colour. In dim light, rod-photoreceptors are active, but colour vision is impossible because they all use the same visual pigment. Instead, the rod signals are thought to splice into retinal circuits at various points, in synergy with the cone signals. Here we report a new circuit for colour vision that challenges these expectations. A genetically identified type of mouse retinal ganglion cell called JAMB (J-RGC), was found to have colour-opponent responses, OFF to ultraviolet (UV) light and ON to green light. Although the mouse retina contains a green-sensitive cone, the ON response instead originates in rods. Rods and cones both contribute to the response over several decades of light intensity. Remarkably, the rod signal in this circuit is antagonistic to that from cones. For rodents, this UV-green channel may play a role in social communication, as suggested by spectral measurements from the environment. In the human retina, all of the components for this circuit exist as well, and its function can explain certain experiences of colour in dim lights, such as a 'blue shift' in twilight. The discovery of this genetically defined pathway will enable new targeted studies of colour processing in the brain.","lang":"eng"}],"citation":{"ista":"Jösch MA, Meister M. 2016. A neuronal circuit for colour vision based on rod-cone opponency. Nature. 532(7598), 236–239.","short":"M.A. Jösch, M. Meister, Nature 532 (2016) 236–239.","chicago":"Jösch, Maximilian A, and Markus Meister. “A Neuronal Circuit for Colour Vision Based on Rod-Cone Opponency.” <i>Nature</i>. Nature Publishing Group, 2016. <a href=\"https://doi.org/10.1038/nature17158\">https://doi.org/10.1038/nature17158</a>.","ieee":"M. A. Jösch and M. Meister, “A neuronal circuit for colour vision based on rod-cone opponency,” <i>Nature</i>, vol. 532, no. 7598. Nature Publishing Group, pp. 236–239, 2016.","ama":"Jösch MA, Meister M. A neuronal circuit for colour vision based on rod-cone opponency. <i>Nature</i>. 2016;532(7598):236-239. doi:<a href=\"https://doi.org/10.1038/nature17158\">10.1038/nature17158</a>","mla":"Jösch, Maximilian A., and Markus Meister. “A Neuronal Circuit for Colour Vision Based on Rod-Cone Opponency.” <i>Nature</i>, vol. 532, no. 7598, Nature Publishing Group, 2016, pp. 236–39, doi:<a href=\"https://doi.org/10.1038/nature17158\">10.1038/nature17158</a>.","apa":"Jösch, M. A., &#38; Meister, M. (2016). A neuronal circuit for colour vision based on rod-cone opponency. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nature17158\">https://doi.org/10.1038/nature17158</a>"},"author":[{"first_name":"Maximilian A","last_name":"Jösch","id":"2BD278E6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3937-1330","full_name":"Maximilian Jösch"},{"full_name":"Meister, Markus","last_name":"Meister","first_name":"Markus"}],"extern":1,"quality_controlled":0,"type":"journal_article","date_updated":"2021-01-12T06:49:45Z","day":"14","year":"2016","intvolume":"       532","publist_id":"5966","date_created":"2018-12-11T11:51:15Z","month":"04","status":"public","date_published":"2016-04-14T00:00:00Z","page":"236 - 239","volume":532,"issue":"7598","publisher":"Nature Publishing Group"},{"citation":{"ieee":"M. A. Jösch <i>et al.</i>, “Reconstruction of genetically identified neurons imaged by serial-section electron microscopy,” <i>eLife</i>, vol. 5, no. 2016JULY. eLife Sciences Publications, 2016.","ama":"Jösch MA, Mankus D, Yamagata M, et al. Reconstruction of genetically identified neurons imaged by serial-section electron microscopy. <i>eLife</i>. 2016;5(2016JULY). doi:<a href=\"https://doi.org/10.7554/eLife.15015\">10.7554/eLife.15015</a>","short":"M.A. Jösch, D. Mankus, M. Yamagata, A. Shahbazi, R. Schalek, A. Suissa Peleg, M. Meister, J. Lichtman, W. Scheirer, J. Sanes, ELife 5 (2016).","chicago":"Jösch, Maximilian A, David Mankus, Masahito Yamagata, Ali Shahbazi, Richard Schalek, Adi Suissa Peleg, Markus Meister, Jeff Lichtman, Walter Scheirer, and Joshua Sanes. “Reconstruction of Genetically Identified Neurons Imaged by Serial-Section Electron Microscopy.” <i>ELife</i>. eLife Sciences Publications, 2016. <a href=\"https://doi.org/10.7554/eLife.15015\">https://doi.org/10.7554/eLife.15015</a>.","ista":"Jösch MA, Mankus D, Yamagata M, Shahbazi A, Schalek R, Suissa Peleg A, Meister M, Lichtman J, Scheirer W, Sanes J. 2016. Reconstruction of genetically identified neurons imaged by serial-section electron microscopy. eLife. 5(2016JULY).","apa":"Jösch, M. A., Mankus, D., Yamagata, M., Shahbazi, A., Schalek, R., Suissa Peleg, A., … Sanes, J. (2016). Reconstruction of genetically identified neurons imaged by serial-section electron microscopy. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.15015\">https://doi.org/10.7554/eLife.15015</a>","mla":"Jösch, Maximilian A., et al. “Reconstruction of Genetically Identified Neurons Imaged by Serial-Section Electron Microscopy.” <i>ELife</i>, vol. 5, no. 2016JULY, eLife Sciences Publications, 2016, doi:<a href=\"https://doi.org/10.7554/eLife.15015\">10.7554/eLife.15015</a>."},"author":[{"id":"2BD278E6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3937-1330","full_name":"Maximilian Jösch","last_name":"Jösch","first_name":"Maximilian A"},{"full_name":"Mankus, David","last_name":"Mankus","first_name":"David"},{"last_name":"Yamagata","first_name":"Masahito","full_name":"Yamagata, Masahito"},{"first_name":"Ali","last_name":"Shahbazi","full_name":"Shahbazi, Ali"},{"last_name":"Schalek","first_name":"Richard","full_name":"Schalek, Richard L"},{"full_name":"Suissa-Peleg, Adi","last_name":"Suissa Peleg","first_name":"Adi"},{"full_name":"Meister, Markus","last_name":"Meister","first_name":"Markus"},{"full_name":"Lichtman, Jeff W","last_name":"Lichtman","first_name":"Jeff"},{"full_name":"Scheirer, Walter J","first_name":"Walter","last_name":"Scheirer"},{"last_name":"Sanes","first_name":"Joshua","full_name":"Sanes, Joshua R"}],"extern":1,"quality_controlled":0,"type":"journal_article","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2021-01-12T06:49:46Z","day":"07","year":"2016","title":"Reconstruction of genetically identified neurons imaged by serial-section electron microscopy","publication":"eLife","license":"https://creativecommons.org/licenses/by/4.0/","doi":"10.7554/eLife.15015","_id":"1306","acknowledgement":"This work was supported by NIH grant NS76467 to MM, JL and JRS, an HHMI Collaborative Innovation Award to JRS, an IARPA contract #D16PC00002 to WJS and by The International Human Frontier Science Program Organization fellowship to MJ.","publication_status":"published","abstract":[{"text":"Resolving patterns of synaptic connectivity in neural circuits currently requires serial section electron microscopy. However, complete circuit reconstruction is prohibitively slow and may not be necessary for many purposes such as comparing neuronal structure and connectivity among multiple animals. Here, we present an alternative strategy, targeted reconstruction of specific neuronal types. We used viral vectors to deliver peroxidase derivatives, which catalyze production of an electron-dense tracer, to genetically identify neurons, and developed a protocol that enhances the electron-density of the labeled cells while retaining the quality of the ultrastructure. The high contrast of the marked neurons enabled two innovations that speed data acquisition: targeted high-resolution reimaging of regions selected from rapidly-acquired lower resolution reconstruction, and an unsupervised segmentation algorithm. This pipeline reduces imaging and reconstruction times by two orders of magnitude, facilitating directed inquiry of circuit motifs.","lang":"eng"}],"date_published":"2016-07-07T00:00:00Z","issue":"2016JULY","volume":5,"publisher":"eLife Sciences Publications","intvolume":"         5","publist_id":"5965","date_created":"2018-12-11T11:51:16Z","month":"07","status":"public"},{"volume":54,"issue":"4","page":"2359 - 2378","date_published":"2016-01-01T00:00:00Z","publisher":"Society for Industrial and Applied Mathematics ","publist_id":"5954","intvolume":"        54","status":"public","date_created":"2018-12-11T11:51:19Z","month":"01","extern":1,"quality_controlled":0,"author":[{"first_name":"Fabian","last_name":"Brunner","full_name":"Brunner, Fabian"},{"first_name":"Julian L","last_name":"Fischer","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","full_name":"Julian Fischer","orcid":"0000-0002-0479-558X"},{"full_name":"Knabner, Peter","first_name":"Peter","last_name":"Knabner"}],"citation":{"short":"F. Brunner, J.L. Fischer, P. Knabner, SIAM Journal on Numerical Analysis 54 (2016) 2359–2378.","chicago":"Brunner, Fabian, Julian L Fischer, and Peter Knabner. “Analysis of a Modified Second-Order Mixed Hybrid BDM1 Finite Element Method for Transport Problems in Divergence Form.” <i>SIAM Journal on Numerical Analysis</i>. Society for Industrial and Applied Mathematics , 2016. <a href=\"https://doi.org/10.1137/15M1035379\">https://doi.org/10.1137/15M1035379</a>.","ista":"Brunner F, Fischer JL, Knabner P. 2016. Analysis of a modified second-order mixed hybrid BDM1 finite element method for transport problems in divergence form. SIAM Journal on Numerical Analysis. 54(4), 2359–2378.","ama":"Brunner F, Fischer JL, Knabner P. Analysis of a modified second-order mixed hybrid BDM1 finite element method for transport problems in divergence form. <i>SIAM Journal on Numerical Analysis</i>. 2016;54(4):2359-2378. doi:<a href=\"https://doi.org/10.1137/15M1035379\">10.1137/15M1035379</a>","ieee":"F. Brunner, J. L. Fischer, and P. Knabner, “Analysis of a modified second-order mixed hybrid BDM1 finite element method for transport problems in divergence form,” <i>SIAM Journal on Numerical Analysis</i>, vol. 54, no. 4. Society for Industrial and Applied Mathematics , pp. 2359–2378, 2016.","mla":"Brunner, Fabian, et al. “Analysis of a Modified Second-Order Mixed Hybrid BDM1 Finite Element Method for Transport Problems in Divergence Form.” <i>SIAM Journal on Numerical Analysis</i>, vol. 54, no. 4, Society for Industrial and Applied Mathematics , 2016, pp. 2359–78, doi:<a href=\"https://doi.org/10.1137/15M1035379\">10.1137/15M1035379</a>.","apa":"Brunner, F., Fischer, J. L., &#38; Knabner, P. (2016). Analysis of a modified second-order mixed hybrid BDM1 finite element method for transport problems in divergence form. <i>SIAM Journal on Numerical Analysis</i>. Society for Industrial and Applied Mathematics . <a href=\"https://doi.org/10.1137/15M1035379\">https://doi.org/10.1137/15M1035379</a>"},"day":"01","year":"2016","type":"journal_article","date_updated":"2021-01-12T06:49:49Z","doi":"10.1137/15M1035379","_id":"1315","title":"Analysis of a modified second-order mixed hybrid BDM1 finite element method for transport problems in divergence form","publication":"SIAM Journal on Numerical Analysis","publication_status":"published","abstract":[{"lang":"eng","text":"We prove optimal second order convergence of a modified lowest-order Brezzi-Douglas-Marini (BDM1) mixed finite element scheme for advection-diffusion problems in divergence form. If advection is present, it is known that the total flux is approximated only with first-order accuracy by the classical BDM1 mixed method, which is suboptimal since the same order of convergence is obtained if the computationally less expensive Raviart-Thomas (RT0) element is used. The modification that was first proposed by Brunner et al. [Adv. Water Res., 35 (2012),pp. 163-171] is based on the hybrid problem formulation and consists in using the Lagrange multipliers for the discretization of the advective term instead of the cellwise constant approximation of the scalar unknown."}]},{"issue":"5","volume":33,"page":"1301 - 1327","date_published":"2016-09-01T00:00:00Z","publisher":"Elsevier","publist_id":"5952","intvolume":"        33","status":"public","date_created":"2018-12-11T11:51:20Z","month":"09","extern":1,"quality_controlled":0,"author":[{"id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","full_name":"Julian Fischer","orcid":"0000-0002-0479-558X","first_name":"Julian L","last_name":"Fischer"}],"citation":{"ama":"Fischer JL. Behaviour of free boundaries in thin-film flow: The regime of strong slippage and the regime of very weak slippage. <i>Annales de l’Institut Henri Poincare (C) Non Linear Analysis</i>. 2016;33(5):1301-1327. doi:<a href=\"https://doi.org/10.1016/j.anihpc.2015.05.001\">10.1016/j.anihpc.2015.05.001</a>","ieee":"J. L. Fischer, “Behaviour of free boundaries in thin-film flow: The regime of strong slippage and the regime of very weak slippage,” <i>Annales de l’Institut Henri Poincare (C) Non Linear Analysis</i>, vol. 33, no. 5. Elsevier, pp. 1301–1327, 2016.","ista":"Fischer JL. 2016. Behaviour of free boundaries in thin-film flow: The regime of strong slippage and the regime of very weak slippage. Annales de l’Institut Henri Poincare (C) Non Linear Analysis. 33(5), 1301–1327.","chicago":"Fischer, Julian L. “Behaviour of Free Boundaries in Thin-Film Flow: The Regime of Strong Slippage and the Regime of Very Weak Slippage.” <i>Annales de l’Institut Henri Poincare (C) Non Linear Analysis</i>. Elsevier, 2016. <a href=\"https://doi.org/10.1016/j.anihpc.2015.05.001\">https://doi.org/10.1016/j.anihpc.2015.05.001</a>.","short":"J.L. Fischer, Annales de l’Institut Henri Poincare (C) Non Linear Analysis 33 (2016) 1301–1327.","mla":"Fischer, Julian L. “Behaviour of Free Boundaries in Thin-Film Flow: The Regime of Strong Slippage and the Regime of Very Weak Slippage.” <i>Annales de l’Institut Henri Poincare (C) Non Linear Analysis</i>, vol. 33, no. 5, Elsevier, 2016, pp. 1301–27, doi:<a href=\"https://doi.org/10.1016/j.anihpc.2015.05.001\">10.1016/j.anihpc.2015.05.001</a>.","apa":"Fischer, J. L. (2016). Behaviour of free boundaries in thin-film flow: The regime of strong slippage and the regime of very weak slippage. <i>Annales de l’Institut Henri Poincare (C) Non Linear Analysis</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.anihpc.2015.05.001\">https://doi.org/10.1016/j.anihpc.2015.05.001</a>"},"day":"01","year":"2016","type":"journal_article","date_updated":"2021-01-12T06:49:50Z","doi":"10.1016/j.anihpc.2015.05.001","_id":"1317","publication":"Annales de l'Institut Henri Poincare (C) Non Linear Analysis","title":"Behaviour of free boundaries in thin-film flow: The regime of strong slippage and the regime of very weak slippage","publication_status":"published","abstract":[{"lang":"eng","text":"We analyze the behaviour of free boundaries in thin-film flow in the regime of strong slippage n∈[1,2) and in the regime of very weak slippage n∈,3) qualitatively and quantitatively. In the regime of strong slippage, we construct initial data which are bounded from above by the steady state but for which nevertheless instantaneous forward motion of the free boundary occurs. This shows that the initial behaviour of the free boundary is not determined just by the growth of the initial data at the free boundary. Note that this is a new phenomenon for degenerate parabolic equations which is specific for higher-order equations. Furthermore, this result resolves a controversy in the literature over optimality of sufficient conditions for the occurrence of a waiting time phenomenon. In contrast, in the regime of very weak slippage we derive lower bounds on free boundary propagation which are optimal in the sense that they coincide up to a constant factor with the known upper bounds. In particular, in this regime the growth of the initial data at the free boundary fully determines the initial behaviour of the interface."}],"acknowledgement":"This research was partly supported by the Lithuanian–Swiss cooperation program under the project agreement No. CH-SMM-01/0."},{"date_published":"2016-07-02T00:00:00Z","page":"1108 - 1148","volume":41,"issue":"7","publisher":"Taylor & Francis","intvolume":"        41","publist_id":"5953","month":"07","date_created":"2018-12-11T11:51:20Z","status":"public","citation":{"apa":"Fischer, J. L., &#38; Otto, F. (2016). A higher-order large scale regularity theory for random elliptic operators. <i>Communications in Partial Differential Equations</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/03605302.2016.1179318\">https://doi.org/10.1080/03605302.2016.1179318</a>","mla":"Fischer, Julian L., and Felix Otto. “A Higher-Order Large Scale Regularity Theory for Random Elliptic Operators.” <i>Communications in Partial Differential Equations</i>, vol. 41, no. 7, Taylor &#38; Francis, 2016, pp. 1108–48, doi:<a href=\"https://doi.org/10.1080/03605302.2016.1179318\">10.1080/03605302.2016.1179318</a>.","ama":"Fischer JL, Otto F. A higher-order large scale regularity theory for random elliptic operators. <i>Communications in Partial Differential Equations</i>. 2016;41(7):1108-1148. doi:<a href=\"https://doi.org/10.1080/03605302.2016.1179318\">10.1080/03605302.2016.1179318</a>","ieee":"J. L. Fischer and F. Otto, “A higher-order large scale regularity theory for random elliptic operators,” <i>Communications in Partial Differential Equations</i>, vol. 41, no. 7. Taylor &#38; Francis, pp. 1108–1148, 2016.","ista":"Fischer JL, Otto F. 2016. A higher-order large scale regularity theory for random elliptic operators. Communications in Partial Differential Equations. 41(7), 1108–1148.","short":"J.L. Fischer, F. Otto, Communications in Partial Differential Equations 41 (2016) 1108–1148.","chicago":"Fischer, Julian L, and Felix Otto. “A Higher-Order Large Scale Regularity Theory for Random Elliptic Operators.” <i>Communications in Partial Differential Equations</i>. Taylor &#38; Francis, 2016. <a href=\"https://doi.org/10.1080/03605302.2016.1179318\">https://doi.org/10.1080/03605302.2016.1179318</a>."},"main_file_link":[{"url":"https://arxiv.org/abs/1503.07578","open_access":"1"}],"quality_controlled":0,"author":[{"id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0479-558X","full_name":"Julian Fischer","last_name":"Fischer","first_name":"Julian L"},{"last_name":"Otto","first_name":"Felix","full_name":"Otto, Felix"}],"extern":1,"type":"journal_article","date_updated":"2021-01-12T06:49:50Z","year":"2016","day":"02","title":"A higher-order large scale regularity theory for random elliptic operators","publication":"Communications in Partial Differential Equations","_id":"1318","doi":"10.1080/03605302.2016.1179318","oa":1,"abstract":[{"lang":"eng","text":"We develop a large-scale regularity theory of higher order for divergence-form elliptic equations with heterogeneous coefficient fields a in the context of stochastic homogenization. The large-scale regularity of a-harmonic functions is encoded by Liouville principles: The space of a-harmonic functions that grow at most like a polynomial of degree k has the same dimension as in the constant-coefficient case. This result can be seen as the qualitative side of a large-scale Ck,α-regularity theory, which in the present work is developed in the form of a corresponding Ck,α-“excess decay” estimate: For a given a-harmonic function u on a ball BR, its energy distance on some ball Br to the above space of a-harmonic functions that grow at most like a polynomial of degree k has the natural decay in the radius r above some minimal radius r0. Though motivated by stochastic homogenization, the contribution of this paper is of purely deterministic nature: We work under the assumption that for the given realization a of the coefficient field, the couple (φ, σ) of scalar and vector potentials of the harmonic coordinates, where φ is the usual corrector, grows sublinearly in a mildly quantified way. We then construct “kth-order correctors” and thereby the space of a-harmonic functions that grow at most like a polynomial of degree k, establish the above excess decay, and then the corresponding Liouville principle."}],"publication_status":"published"},{"citation":{"apa":"Bächer, M., Hepp, B., Pece, F., Kry, P., Bickel, B., Thomaszewski, B., &#38; Hilliges, O. (2016). DefSense: computational design of customized deformable input devices (pp. 3806–3816). Presented at the CHI: Conference on Human Factors in Computing Systems, San Jose, California, USA: ACM. <a href=\"https://doi.org/10.1145/2858036.2858354\">https://doi.org/10.1145/2858036.2858354</a>","mla":"Bächer, Moritz, et al. <i>DefSense: Computational Design of Customized Deformable Input Devices</i>. ACM, 2016, pp. 3806–16, doi:<a href=\"https://doi.org/10.1145/2858036.2858354\">10.1145/2858036.2858354</a>.","short":"M. Bächer, B. Hepp, F. Pece, P. Kry, B. Bickel, B. Thomaszewski, O. Hilliges, in:, ACM, 2016, pp. 3806–3816.","chicago":"Bächer, Moritz, Benjamin Hepp, Fabrizio Pece, Paul Kry, Bernd Bickel, Bernhard Thomaszewski, and Otmar Hilliges. “DefSense: Computational Design of Customized Deformable Input Devices,” 3806–16. ACM, 2016. <a href=\"https://doi.org/10.1145/2858036.2858354\">https://doi.org/10.1145/2858036.2858354</a>.","ista":"Bächer M, Hepp B, Pece F, Kry P, Bickel B, Thomaszewski B, Hilliges O. 2016. DefSense: computational design of customized deformable input devices. CHI: Conference on Human Factors in Computing Systems, 3806–3816.","ieee":"M. Bächer <i>et al.</i>, “DefSense: computational design of customized deformable input devices,” presented at the CHI: Conference on Human Factors in Computing Systems, San Jose, California, USA, 2016, pp. 3806–3816.","ama":"Bächer M, Hepp B, Pece F, et al. DefSense: computational design of customized deformable input devices. In: ACM; 2016:3806-3816. doi:<a href=\"https://doi.org/10.1145/2858036.2858354\">10.1145/2858036.2858354</a>"},"quality_controlled":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Bächer","first_name":"Moritz","full_name":"Bächer, Moritz"},{"first_name":"Benjamin","last_name":"Hepp","full_name":"Hepp, Benjamin"},{"first_name":"Fabrizio","last_name":"Pece","full_name":"Pece, Fabrizio"},{"full_name":"Kry, Paul","last_name":"Kry","first_name":"Paul"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd","last_name":"Bickel","first_name":"Bernd"},{"full_name":"Thomaszewski, Bernhard","last_name":"Thomaszewski","first_name":"Bernhard"},{"last_name":"Hilliges","first_name":"Otmar","full_name":"Hilliges, Otmar"}],"date_updated":"2021-01-12T06:49:51Z","type":"conference","oa_version":"None","day":"07","year":"2016","title":"DefSense: computational design of customized deformable input devices","language":[{"iso":"eng"}],"doi":"10.1145/2858036.2858354","_id":"1319","department":[{"_id":"BeBi"}],"acknowledgement":"We  thank  Damian  Karrer,   Rocco  Ghielmini  and  Jemin\r\nHwangbo for their help in our initial explorations. We would\r\nlike to thank Christian Schumacher for creating the video and\r\nC\r\n ́\r\necile Edwards-Rietmann for providing the voiceover. Mau-\r\nrizio Nitti helped us in designing our 3D characters. We thank\r\nChiara Daraio for insightful discussions on material proper-\r\nties and 3D printing.   We also thank the CHI reviewers for\r\ntheir feedback and guidance. Fabrizio Pece was supported by\r\nan ETH/Marie Curie fellowship (FEL-3314-1).","publication_status":"published","abstract":[{"text":"We present a novel optimization-based algorithm for the design and fabrication of customized, deformable input devices, capable of continuously sensing their deformation. We propose to embed piezoresistive sensing elements into flexible 3D printed objects. These sensing elements are then utilized to recover rich and natural user interactions at runtime. Designing such objects is a challenging and hard problem if attempted manually for all but the simplest geometries and deformations. Our method simultaneously optimizes the internal routing of the sensing elements and computes a mapping from low-level sensor readings to user-specified outputs in order to minimize reconstruction error. We demonstrate the power and flexibility of the approach by designing and fabricating a set of flexible input devices. Our results indicate that the optimization-based design greatly outperforms manual routings in terms of reconstruction accuracy and thus interaction fidelity.","lang":"eng"}],"date_published":"2016-05-07T00:00:00Z","page":"3806 - 3816","publisher":"ACM","publist_id":"5951","scopus_import":1,"date_created":"2018-12-11T11:51:21Z","month":"05","conference":{"name":"CHI: Conference on Human Factors in Computing Systems","end_date":"2016-05-12","start_date":"2016-05-07","location":"San Jose, California, USA"},"status":"public"},{"file_date_updated":"2020-07-14T12:44:43Z","publisher":"IEEE","pubrep_id":"810","volume":"2016-July","conference":{"end_date":"2016-07-08","name":"ACC: American Control Conference","start_date":"2016-07-06","location":"Boston, MA, USA"},"month":"07","date_created":"2018-12-11T11:51:21Z","status":"public","article_number":"7526722","publist_id":"5950","year":"2016","citation":{"apa":"Lang, M., &#38; Sontag, E. (2016). Scale-invariant systems realize nonlinear differential operators (Vol. 2016–July). Presented at the ACC: American Control Conference, Boston, MA, USA: IEEE. <a href=\"https://doi.org/10.1109/ACC.2016.7526722\">https://doi.org/10.1109/ACC.2016.7526722</a>","mla":"Lang, Moritz, and Eduardo Sontag. <i>Scale-Invariant Systems Realize Nonlinear Differential Operators</i>. Vol. 2016–July, 7526722, IEEE, 2016, doi:<a href=\"https://doi.org/10.1109/ACC.2016.7526722\">10.1109/ACC.2016.7526722</a>.","ama":"Lang M, Sontag E. Scale-invariant systems realize nonlinear differential operators. In: Vol 2016-July. IEEE; 2016. doi:<a href=\"https://doi.org/10.1109/ACC.2016.7526722\">10.1109/ACC.2016.7526722</a>","ieee":"M. Lang and E. Sontag, “Scale-invariant systems realize nonlinear differential operators,” presented at the ACC: American Control Conference, Boston, MA, USA, 2016, vol. 2016–July.","ista":"Lang M, Sontag E. 2016. Scale-invariant systems realize nonlinear differential operators. ACC: American Control Conference vol. 2016–July, 7526722.","short":"M. Lang, E. Sontag, in:, IEEE, 2016.","chicago":"Lang, Moritz, and Eduardo Sontag. “Scale-Invariant Systems Realize Nonlinear Differential Operators,” Vol. 2016–July. IEEE, 2016. <a href=\"https://doi.org/10.1109/ACC.2016.7526722\">https://doi.org/10.1109/ACC.2016.7526722</a>."},"author":[{"last_name":"Lang","first_name":"Moritz","id":"29E0800A-F248-11E8-B48F-1D18A9856A87","full_name":"Lang, Moritz"},{"full_name":"Sontag, Eduardo","first_name":"Eduardo","last_name":"Sontag"}],"quality_controlled":"1","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"abstract":[{"text":"In recent years, several biomolecular systems have been shown to be scale-invariant (SI), i.e. to show the same output dynamics when exposed to geometrically scaled input signals (u → pu, p &gt; 0) after pre-adaptation to accordingly scaled constant inputs. In this article, we show that SI systems-as well as systems invariant with respect to other input transformations-can realize nonlinear differential operators: when excited by inputs obeying functional forms characteristic for a given class of invariant systems, the systems' outputs converge to constant values directly quantifying the speed of the input.","lang":"eng"}],"publication_status":"published","title":"Scale-invariant systems realize nonlinear differential operators","_id":"1320","ddc":["003","621"],"file":[{"file_id":"5203","date_updated":"2020-07-14T12:44:43Z","access_level":"local","file_name":"IST-2017-810-v1+1_root.pdf","checksum":"7219432b43defc62a0d45f48d4ce6a19","date_created":"2018-12-12T10:16:17Z","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":539166}],"date_published":"2016-07-28T00:00:00Z","scopus_import":1,"oa_version":"Preprint","type":"conference","date_updated":"2021-01-12T06:49:51Z","day":"28","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The research leading to these results has received funding from the People Programme (Marie Curie Actions) of the European Union's Seventh Framework Programme (FP7/2007-2013) under REA grant agreement n° [291734]. Work supported in part by grants AFOSR FA9550-14-1-0060 and NIH 1R01GM100473.","ec_funded":1,"department":[{"_id":"CaGu"},{"_id":"GaTk"}],"has_accepted_license":"1","doi":"10.1109/ACC.2016.7526722","language":[{"iso":"eng"}]},{"intvolume":"        18","publist_id":"5949","month":"10","date_created":"2018-12-11T11:51:21Z","status":"public","volume":18,"file_date_updated":"2020-07-14T12:44:43Z","article_type":"original","publisher":"Nature Publishing Group","publication":"Nature Cell Biology","title":"Diversified actin protrusions promote environmental exploration but are dispensable for locomotion of leukocytes","_id":"1321","ddc":["570"],"oa":1,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"323"}]},"project":[{"grant_number":"281556","name":"Cytoskeletal force generation and force transduction of migrating leukocytes (EU)","_id":"25A603A2-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"abstract":[{"lang":"eng","text":"Most migrating cells extrude their front by the force of actin polymerization. Polymerization requires an initial nucleation step, which is mediated by factors establishing either parallel filaments in the case of filopodia or branched filaments that form the branched lamellipodial network. Branches are considered essential for regular cell motility and are initiated by the Arp2/3 complex, which in turn is activated by nucleation-promoting factors of the WASP and WAVE families. Here we employed rapid amoeboid crawling leukocytes and found that deletion of the WAVE complex eliminated actin branching and thus lamellipodia formation. The cells were left with parallel filaments at the leading edge, which translated, depending on the differentiation status of the cell, into a unipolar pointed cell shape or cells with multiple filopodia. Remarkably, unipolar cells migrated with increased speed and enormous directional persistence, while they were unable to turn towards chemotactic gradients. Cells with multiple filopodia retained chemotactic activity but their migration was progressively impaired with increasing geometrical complexity of the extracellular environment. These findings establish that diversified leading edge protrusions serve as explorative structures while they slow down actual locomotion."}],"publication_status":"published","citation":{"ama":"Leithner AF, Eichner A, Müller J, et al. Diversified actin protrusions promote environmental exploration but are dispensable for locomotion of leukocytes. <i>Nature Cell Biology</i>. 2016;18:1253-1259. doi:<a href=\"https://doi.org/10.1038/ncb3426\">10.1038/ncb3426</a>","ieee":"A. F. Leithner <i>et al.</i>, “Diversified actin protrusions promote environmental exploration but are dispensable for locomotion of leukocytes,” <i>Nature Cell Biology</i>, vol. 18. Nature Publishing Group, pp. 1253–1259, 2016.","chicago":"Leithner, Alexander F, Alexander Eichner, Jan Müller, Anne Reversat, Markus Brown, Jan Schwarz, Jack Merrin, et al. “Diversified Actin Protrusions Promote Environmental Exploration but Are Dispensable for Locomotion of Leukocytes.” <i>Nature Cell Biology</i>. Nature Publishing Group, 2016. <a href=\"https://doi.org/10.1038/ncb3426\">https://doi.org/10.1038/ncb3426</a>.","short":"A.F. Leithner, A. Eichner, J. Müller, A. Reversat, M. Brown, J. Schwarz, J. Merrin, D. De Gorter, F.K. Schur, J. Bayerl, I. de Vries, S. Wieser, R. Hauschild, F. Lai, M. Moser, D. Kerjaschki, K. Rottner, V. Small, T. Stradal, M.K. Sixt, Nature Cell Biology 18 (2016) 1253–1259.","ista":"Leithner AF, Eichner A, Müller J, Reversat A, Brown M, Schwarz J, Merrin J, De Gorter D, Schur FK, Bayerl J, de Vries I, Wieser S, Hauschild R, Lai F, Moser M, Kerjaschki D, Rottner K, Small V, Stradal T, Sixt MK. 2016. Diversified actin protrusions promote environmental exploration but are dispensable for locomotion of leukocytes. Nature Cell Biology. 18, 1253–1259.","apa":"Leithner, A. F., Eichner, A., Müller, J., Reversat, A., Brown, M., Schwarz, J., … Sixt, M. K. (2016). Diversified actin protrusions promote environmental exploration but are dispensable for locomotion of leukocytes. <i>Nature Cell Biology</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/ncb3426\">https://doi.org/10.1038/ncb3426</a>","mla":"Leithner, Alexander F., et al. “Diversified Actin Protrusions Promote Environmental Exploration but Are Dispensable for Locomotion of Leukocytes.” <i>Nature Cell Biology</i>, vol. 18, Nature Publishing Group, 2016, pp. 1253–59, doi:<a href=\"https://doi.org/10.1038/ncb3426\">10.1038/ncb3426</a>."},"author":[{"full_name":"Leithner, Alexander F","orcid":"0000-0002-1073-744X","id":"3B1B77E4-F248-11E8-B48F-1D18A9856A87","last_name":"Leithner","first_name":"Alexander F"},{"first_name":"Alexander","last_name":"Eichner","id":"4DFA52AE-F248-11E8-B48F-1D18A9856A87","full_name":"Eichner, Alexander"},{"id":"AD07FDB4-0F61-11EA-8158-C4CC64CEAA8D","full_name":"Müller, Jan","first_name":"Jan","last_name":"Müller"},{"last_name":"Reversat","first_name":"Anne","id":"35B76592-F248-11E8-B48F-1D18A9856A87","full_name":"Reversat, Anne","orcid":"0000-0003-0666-8928"},{"last_name":"Brown","first_name":"Markus","id":"3DAB9AFC-F248-11E8-B48F-1D18A9856A87","full_name":"Brown, Markus"},{"last_name":"Schwarz","first_name":"Jan","full_name":"Schwarz, Jan","id":"346C1EC6-F248-11E8-B48F-1D18A9856A87"},{"id":"4515C308-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5145-4609","full_name":"Merrin, Jack","last_name":"Merrin","first_name":"Jack"},{"full_name":"De Gorter, David","last_name":"De Gorter","first_name":"David"},{"id":"48AD8942-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4790-8078","full_name":"Schur, Florian","last_name":"Schur","first_name":"Florian"},{"full_name":"Bayerl, Jonathan","last_name":"Bayerl","first_name":"Jonathan"},{"first_name":"Ingrid","last_name":"De Vries","full_name":"De Vries, Ingrid","id":"4C7D837E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wieser, Stefan","orcid":"0000-0002-2670-2217","id":"355AA5A0-F248-11E8-B48F-1D18A9856A87","last_name":"Wieser","first_name":"Stefan"},{"last_name":"Hauschild","first_name":"Robert","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","full_name":"Hauschild, Robert","orcid":"0000-0001-9843-3522"},{"first_name":"Frank","last_name":"Lai","full_name":"Lai, Frank"},{"full_name":"Moser, Markus","first_name":"Markus","last_name":"Moser"},{"last_name":"Kerjaschki","first_name":"Dontscho","full_name":"Kerjaschki, Dontscho"},{"last_name":"Rottner","first_name":"Klemens","full_name":"Rottner, Klemens"},{"first_name":"Victor","last_name":"Small","full_name":"Small, Victor"},{"last_name":"Stradal","first_name":"Theresia","full_name":"Stradal, Theresia"},{"last_name":"Sixt","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K"}],"quality_controlled":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","short":"CC BY-NC-SA (4.0)","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","image":"/images/cc_by_nc_sa.png"},"year":"2016","scopus_import":1,"file":[{"date_created":"2020-05-14T16:33:46Z","relation":"main_file","file_size":4433280,"creator":"dernst","content_type":"application/pdf","date_updated":"2020-07-14T12:44:43Z","file_id":"7844","access_level":"open_access","file_name":"2018_NatureCell_Leithner.pdf","checksum":"e1411cb7c99a2d9089c178a6abef25e7"}],"date_published":"2016-10-24T00:00:00Z","page":"1253 - 1259","acknowledged_ssus":[{"_id":"SSU"}],"ec_funded":1,"has_accepted_license":"1","department":[{"_id":"MiSi"},{"_id":"NanoFab"},{"_id":"Bio"}],"doi":"10.1038/ncb3426","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","language":[{"iso":"eng"}],"acknowledgement":"This work was supported by the German Research Foundation (DFG) Priority Program SP 1464 to T.E.B.S. and M.S., and European Research Council (ERC GA 281556) and Human Frontiers Program grants to M.S.\r\nService Units of IST Austria for excellent technical support.","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","oa_version":"Submitted Version","date_updated":"2024-03-25T23:30:09Z","type":"journal_article","day":"24"},{"file_date_updated":"2020-07-14T12:44:44Z","publisher":"Public Library of Science","pubrep_id":"716","issue":"10","volume":11,"month":"10","date_created":"2018-12-11T11:51:22Z","article_number":"e0163867","status":"public","intvolume":"        11","publist_id":"5948","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"year":"2016","citation":{"mla":"Hilbe, Christian, et al. “Asymmetric Power Boosts Extortion in an Economic Experiment.” <i>PLoS One</i>, vol. 11, no. 10, e0163867, Public Library of Science, 2016, doi:<a href=\"https://doi.org/10.1371/journal.pone.0163867\">10.1371/journal.pone.0163867</a>.","apa":"Hilbe, C., Hagel, K., &#38; Milinski, M. (2016). Asymmetric power boosts extortion in an economic experiment. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0163867\">https://doi.org/10.1371/journal.pone.0163867</a>","ama":"Hilbe C, Hagel K, Milinski M. Asymmetric power boosts extortion in an economic experiment. <i>PLoS One</i>. 2016;11(10). doi:<a href=\"https://doi.org/10.1371/journal.pone.0163867\">10.1371/journal.pone.0163867</a>","ieee":"C. Hilbe, K. Hagel, and M. Milinski, “Asymmetric power boosts extortion in an economic experiment,” <i>PLoS One</i>, vol. 11, no. 10. Public Library of Science, 2016.","ista":"Hilbe C, Hagel K, Milinski M. 2016. Asymmetric power boosts extortion in an economic experiment. PLoS One. 11(10), e0163867.","short":"C. Hilbe, K. Hagel, M. Milinski, PLoS One 11 (2016).","chicago":"Hilbe, Christian, Kristin Hagel, and Manfred Milinski. “Asymmetric Power Boosts Extortion in an Economic Experiment.” <i>PLoS One</i>. Public Library of Science, 2016. <a href=\"https://doi.org/10.1371/journal.pone.0163867\">https://doi.org/10.1371/journal.pone.0163867</a>."},"author":[{"last_name":"Hilbe","first_name":"Christian","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5116-955X","full_name":"Hilbe, Christian"},{"first_name":"Kristin","last_name":"Hagel","full_name":"Hagel, Kristin"},{"first_name":"Manfred","last_name":"Milinski","full_name":"Milinski, Manfred"}],"quality_controlled":"1","abstract":[{"lang":"eng","text":"Direct reciprocity is a major mechanism for the evolution of cooperation. Several classical studies have suggested that humans should quickly learn to adopt reciprocal strategies to establish mutual cooperation in repeated interactions. On the other hand, the recently discovered theory of ZD strategies has found that subjects who use extortionate strategies are able to exploit and subdue cooperators. Although such extortioners have been predicted to succeed in any population of adaptive opponents, theoretical follow-up studies questioned whether extortion can evolve in reality. However, most of these studies presumed that individuals have similar strategic possibilities and comparable outside options, whereas asymmetries are ubiquitous in real world applications. Here we show with a model and an economic experiment that extortionate strategies readily emerge once subjects differ in their strategic power. Our experiment combines a repeated social dilemma with asymmetric partner choice. In our main treatment there is one randomly chosen group member who is unilaterally allowed to exchange one of the other group members after every ten rounds of the social dilemma. We find that this asymmetric replacement opportunity generally promotes cooperation, but often the resulting payoff distribution reflects the underlying power structure. Almost half of the subjects in a better strategic position turn into extortioners, who quickly proceed to exploit their peers. By adapting their cooperation probabilities consistent with ZD theory, extortioners force their co-players to cooperate without being similarly cooperative themselves. Comparison to non-extortionate players under the same conditions indicates a substantial net gain to extortion. Our results thus highlight how power asymmetries can endanger mutually beneficial interactions, and transform them into exploitative relationships. In particular, our results indicate that the extortionate strategies predicted from ZD theory could play a more prominent role in our daily interactions than previously thought."}],"publication_status":"published","title":"Asymmetric power boosts extortion in an economic experiment","publication":"PLoS One","_id":"1322","ddc":["004","006"],"related_material":{"record":[{"id":"9867","status":"public","relation":"research_data"},{"status":"public","relation":"research_data","id":"9868"}]},"oa":1,"file":[{"access_level":"open_access","checksum":"6b33e394003dfe8b4ca6be1858aaa8e3","file_name":"IST-2016-716-v1+1_journal.pone.0163867.PDF","file_id":"4668","date_updated":"2020-07-14T12:44:44Z","creator":"system","content_type":"application/pdf","file_size":2077905,"date_created":"2018-12-12T10:08:08Z","relation":"main_file"}],"date_published":"2016-10-04T00:00:00Z","scopus_import":1,"oa_version":"Published Version","type":"journal_article","date_updated":"2023-02-23T14:11:27Z","day":"04","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"CH was funded by the Schrödinger program of the Austrian Science Fund (FWF) J3475. ","department":[{"_id":"KrCh"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"doi":"10.1371/journal.pone.0163867"},{"publication":"eLife","title":"Plasticity-dependent, full detonation at hippocampal mossy fiber–CA3 pyramidal neuron synapses","_id":"1323","oa":1,"ddc":["571","572"],"project":[{"_id":"25C0F108-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons","grant_number":"268548"},{"grant_number":"692692","name":"Biophysics and circuit function of a giant cortical glumatergic synapse","call_identifier":"H2020","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425"}],"abstract":[{"text":"Mossy fiber synapses on CA3 pyramidal cells are 'conditional detonators' that reliably discharge postsynaptic targets. The 'conditional' nature implies that burst activity in dentate gyrus granule cells is required for detonation. Whether single unitary excitatory postsynaptic potentials (EPSPs) trigger spikes in CA3 neurons remains unknown. Mossy fiber synapses exhibit both pronounced short-term facilitation and uniquely large post-tetanic potentiation (PTP). We tested whether PTP could convert mossy fiber synapses from subdetonator into detonator mode, using a recently developed method to selectively and noninvasively stimulate individual presynaptic terminals in rat brain slices. Unitary EPSPs failed to initiate a spike in CA3 neurons under control conditions, but reliably discharged them after induction of presynaptic short-term plasticity. Remarkably, PTP switched mossy fiber synapses into full detonators for tens of seconds. Plasticity-dependent detonation may be critical for efficient coding, storage, and recall of information in the granule cell–CA3 cell network.","lang":"eng"}],"publication_status":"published","citation":{"mla":"Vyleta, Nicholas, et al. “Plasticity-Dependent, Full Detonation at Hippocampal Mossy Fiber–CA3 Pyramidal Neuron Synapses.” <i>ELife</i>, vol. 5, e17977, eLife Sciences Publications, 2016, doi:<a href=\"https://doi.org/10.7554/eLife.17977\">10.7554/eLife.17977</a>.","apa":"Vyleta, N., Borges Merjane, C., &#38; Jonas, P. M. (2016). Plasticity-dependent, full detonation at hippocampal mossy fiber–CA3 pyramidal neuron synapses. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.17977\">https://doi.org/10.7554/eLife.17977</a>","ista":"Vyleta N, Borges Merjane C, Jonas PM. 2016. Plasticity-dependent, full detonation at hippocampal mossy fiber–CA3 pyramidal neuron synapses. eLife. 5, e17977.","short":"N. Vyleta, C. Borges Merjane, P.M. Jonas, ELife 5 (2016).","chicago":"Vyleta, Nicholas, Carolina Borges Merjane, and Peter M Jonas. “Plasticity-Dependent, Full Detonation at Hippocampal Mossy Fiber–CA3 Pyramidal Neuron Synapses.” <i>ELife</i>. eLife Sciences Publications, 2016. <a href=\"https://doi.org/10.7554/eLife.17977\">https://doi.org/10.7554/eLife.17977</a>.","ama":"Vyleta N, Borges Merjane C, Jonas PM. Plasticity-dependent, full detonation at hippocampal mossy fiber–CA3 pyramidal neuron synapses. <i>eLife</i>. 2016;5. doi:<a href=\"https://doi.org/10.7554/eLife.17977\">10.7554/eLife.17977</a>","ieee":"N. Vyleta, C. Borges Merjane, and P. M. Jonas, “Plasticity-dependent, full detonation at hippocampal mossy fiber–CA3 pyramidal neuron synapses,” <i>eLife</i>, vol. 5. eLife Sciences Publications, 2016."},"quality_controlled":"1","author":[{"full_name":"Vyleta, Nicholas","id":"36C4978E-F248-11E8-B48F-1D18A9856A87","last_name":"Vyleta","first_name":"Nicholas"},{"last_name":"Borges Merjane","first_name":"Carolina","id":"4305C450-F248-11E8-B48F-1D18A9856A87","full_name":"Borges Merjane, Carolina","orcid":"0000-0003-0005-401X"},{"first_name":"Peter M","last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"year":"2016","intvolume":"         5","publist_id":"5947","month":"10","date_created":"2018-12-11T11:51:22Z","article_number":"e17977","status":"public","pubrep_id":"715","volume":5,"file_date_updated":"2020-07-14T12:44:44Z","publisher":"eLife Sciences Publications","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"PreCl"}],"ec_funded":1,"has_accepted_license":"1","department":[{"_id":"PeJo"}],"language":[{"iso":"eng"}],"doi":"10.7554/eLife.17977","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","date_updated":"2023-02-21T10:34:24Z","type":"journal_article","day":"25","scopus_import":1,"file":[{"access_level":"open_access","file_name":"IST-2016-715-v1+1_e17977-download.pdf","checksum":"a7201280c571bed88ebd459ce5ce6a47","date_updated":"2020-07-14T12:44:44Z","file_id":"5257","content_type":"application/pdf","creator":"system","file_size":1477891,"date_created":"2018-12-12T10:17:05Z","relation":"main_file"}],"date_published":"2016-10-25T00:00:00Z"},{"publication_status":"published","abstract":[{"text":"DEC-POMDPs extend POMDPs to a multi-agent setting, where several agents operate in an uncertain environment independently to achieve a joint objective. DEC-POMDPs have been studied with finite-horizon and infinite-horizon discounted-sum objectives, and there exist solvers both for exact and approximate solutions. In this work we consider Goal-DEC-POMDPs, where given a set of target states, the objective is to ensure that the target set is reached with minimal cost. We consider the indefinite-horizon (infinite-horizon with either discounted-sum, or undiscounted-sum, where absorbing goal states have zero-cost) problem. We present a new and novel method to solve the problem that extends methods for finite-horizon DEC-POMDPs and the RTDP-Bel approach for POMDPs. We present experimental results on several examples, and show that our approach presents promising results. Copyright ","lang":"eng"}],"project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"_id":"1324","title":"Indefinite-horizon reachability in Goal-DEC-POMDPs","ec_funded":1,"publication":"Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling","day":"01","year":"2016","date_updated":"2021-01-12T06:49:53Z","type":"conference","oa_version":"None","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"first_name":"Martin","last_name":"Chmelik","full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Chatterjee, K., &#38; Chmelik, M. (2016). Indefinite-horizon reachability in Goal-DEC-POMDPs. In <i>Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling</i> (Vol. 2016–January, pp. 88–96). London, United Kingdom: AAAI Press.","mla":"Chatterjee, Krishnendu, and Martin Chmelik. “Indefinite-Horizon Reachability in Goal-DEC-POMDPs.” <i>Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling</i>, vol. 2016–January, AAAI Press, 2016, pp. 88–96.","ama":"Chatterjee K, Chmelik M. Indefinite-horizon reachability in Goal-DEC-POMDPs. In: <i>Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling</i>. Vol 2016-January. AAAI Press; 2016:88-96.","ieee":"K. Chatterjee and M. Chmelik, “Indefinite-horizon reachability in Goal-DEC-POMDPs,” in <i>Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling</i>, London, United Kingdom, 2016, vol. 2016–January, pp. 88–96.","ista":"Chatterjee K, Chmelik M. 2016. Indefinite-horizon reachability in Goal-DEC-POMDPs. Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling. ICAPS: International Conference on Automated Planning and Scheduling vol. 2016–January, 88–96.","chicago":"Chatterjee, Krishnendu, and Martin Chmelik. “Indefinite-Horizon Reachability in Goal-DEC-POMDPs.” In <i>Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling</i>, 2016–January:88–96. AAAI Press, 2016.","short":"K. Chatterjee, M. Chmelik, in:, Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling, AAAI Press, 2016, pp. 88–96."},"main_file_link":[{"url":"http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/12999"}],"status":"public","date_created":"2018-12-11T11:51:22Z","conference":{"end_date":"2016-06-17","name":"ICAPS: International Conference on Automated Planning and Scheduling","location":"London, United Kingdom","start_date":"2016-06-12"},"month":"01","publist_id":"5946","scopus_import":1,"publisher":"AAAI Press","page":"88 - 96","volume":"2016-January","date_published":"2016-01-01T00:00:00Z"},{"alternative_title":["LIPIcs"],"scopus_import":1,"date_published":"2016-08-01T00:00:00Z","file":[{"file_size":553648,"creator":"system","content_type":"application/pdf","relation":"main_file","date_created":"2018-12-12T10:16:40Z","checksum":"3c2dc6ab0358f8aa8f7aa7d6c1293159","file_name":"IST-2016-665-v1+1_Forejt_et_al__Stability_in_graphs_and_games.pdf","access_level":"open_access","file_id":"5229","date_updated":"2020-07-14T12:44:44Z"}],"acknowledgement":"The work has been supported by the Czech Science Foundation, grant No. 15-17564S, by EPSRC grant\r\nEP/M023656/1, and by the People Programme (Marie Curie Actions) of the European Union’s Seventh\r\nFramework Programme (FP7/2007-2013) under REA grant agreement no [291734]","ec_funded":1,"language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.CONCUR.2016.10","has_accepted_license":"1","department":[{"_id":"KrCh"}],"type":"conference","date_updated":"2021-01-12T06:49:53Z","oa_version":"Published Version","day":"01","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:51:23Z","month":"08","conference":{"name":"CONCUR: Concurrency Theory","end_date":"2016-08-26","start_date":"2016-08-23","location":"Quebec City, Canada"},"status":"public","article_number":"10","intvolume":"        59","publist_id":"5944","file_date_updated":"2020-07-14T12:44:44Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","volume":59,"pubrep_id":"665","project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"publication_status":"published","abstract":[{"text":"We study graphs and two-player games in which rewards are assigned to states, and the goal of the players is to satisfy or dissatisfy certain property of the generated outcome, given as a mean payoff property. Since the notion of mean-payoff does not reflect possible fluctuations from the mean-payoff along a run, we propose definitions and algorithms for capturing the stability of the system, and give algorithms for deciding if a given mean payoff and stability objective can be ensured in the system.","lang":"eng"}],"title":"Stability in graphs and games","ddc":["004"],"oa":1,"_id":"1325","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"year":"2016","citation":{"ieee":"T. Brázdil, V. Forejt, A. Kučera, and P. Novotný, “Stability in graphs and games,” presented at the CONCUR: Concurrency Theory, Quebec City, Canada, 2016, vol. 59.","ama":"Brázdil T, Forejt V, Kučera A, Novotný P. Stability in graphs and games. In: Vol 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.10\">10.4230/LIPIcs.CONCUR.2016.10</a>","ista":"Brázdil T, Forejt V, Kučera A, Novotný P. 2016. Stability in graphs and games. CONCUR: Concurrency Theory, LIPIcs, vol. 59, 10.","short":"T. Brázdil, V. Forejt, A. Kučera, P. Novotný, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","chicago":"Brázdil, Tomáš, Vojtěch Forejt, Antonín Kučera, and Petr Novotný. “Stability in Graphs and Games,” Vol. 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.10\">https://doi.org/10.4230/LIPIcs.CONCUR.2016.10</a>.","apa":"Brázdil, T., Forejt, V., Kučera, A., &#38; Novotný, P. (2016). Stability in graphs and games (Vol. 59). Presented at the CONCUR: Concurrency Theory, Quebec City, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.10\">https://doi.org/10.4230/LIPIcs.CONCUR.2016.10</a>","mla":"Brázdil, Tomáš, et al. <i>Stability in Graphs and Games</i>. Vol. 59, 10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.10\">10.4230/LIPIcs.CONCUR.2016.10</a>."},"author":[{"full_name":"Brázdil, Tomáš","last_name":"Brázdil","first_name":"Tomáš"},{"full_name":"Forejt, Vojtěch","first_name":"Vojtěch","last_name":"Forejt"},{"full_name":"Kučera, Antonín","first_name":"Antonín","last_name":"Kučera"},{"full_name":"Novotny, Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","first_name":"Petr","last_name":"Novotny"}],"quality_controlled":"1"},{"page":"32 - 49","date_published":"2016-09-22T00:00:00Z","scopus_import":1,"alternative_title":["LNCS"],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"22","type":"conference","date_updated":"2021-01-12T06:49:53Z","oa_version":"Preprint","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-46520-3_3","department":[{"_id":"KrCh"}],"ec_funded":1,"acknowledgement":"The research was funded by the Czech Science Foundation Grant No. P202/12/G061 and by the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no [291734].","volume":9938,"publisher":"Springer","publist_id":"5943","intvolume":"      9938","status":"public","date_created":"2018-12-11T11:51:23Z","conference":{"end_date":"2016-10-20","name":"ATVA: Automated Technology for Verification and Analysis","location":"Chiba, Japan","start_date":"2016-10-17"},"month":"09","quality_controlled":"1","author":[{"first_name":"Tomáš","last_name":"Brázdil","full_name":"Brázdil, Tomáš"},{"full_name":"Kučera, Antonín","last_name":"Kučera","first_name":"Antonín"},{"first_name":"Petr","last_name":"Novotny","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","full_name":"Novotny, Petr"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1607.00678"}],"citation":{"apa":"Brázdil, T., Kučera, A., &#38; Novotný, P. (2016). Optimizing the expected mean payoff in Energy Markov Decision Processes (Vol. 9938, pp. 32–49). Presented at the ATVA: Automated Technology for Verification and Analysis, Chiba, Japan: Springer. <a href=\"https://doi.org/10.1007/978-3-319-46520-3_3\">https://doi.org/10.1007/978-3-319-46520-3_3</a>","mla":"Brázdil, Tomáš, et al. <i>Optimizing the Expected Mean Payoff in Energy Markov Decision Processes</i>. Vol. 9938, Springer, 2016, pp. 32–49, doi:<a href=\"https://doi.org/10.1007/978-3-319-46520-3_3\">10.1007/978-3-319-46520-3_3</a>.","ieee":"T. Brázdil, A. Kučera, and P. Novotný, “Optimizing the expected mean payoff in Energy Markov Decision Processes,” presented at the ATVA: Automated Technology for Verification and Analysis, Chiba, Japan, 2016, vol. 9938, pp. 32–49.","ama":"Brázdil T, Kučera A, Novotný P. Optimizing the expected mean payoff in Energy Markov Decision Processes. In: Vol 9938. Springer; 2016:32-49. doi:<a href=\"https://doi.org/10.1007/978-3-319-46520-3_3\">10.1007/978-3-319-46520-3_3</a>","short":"T. Brázdil, A. Kučera, P. Novotný, in:, Springer, 2016, pp. 32–49.","chicago":"Brázdil, Tomáš, Antonín Kučera, and Petr Novotný. “Optimizing the Expected Mean Payoff in Energy Markov Decision Processes,” 9938:32–49. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-46520-3_3\">https://doi.org/10.1007/978-3-319-46520-3_3</a>.","ista":"Brázdil T, Kučera A, Novotný P. 2016. Optimizing the expected mean payoff in Energy Markov Decision Processes. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 9938, 32–49."},"year":"2016","oa":1,"_id":"1326","title":"Optimizing the expected mean payoff in Energy Markov Decision Processes","publication_status":"published","abstract":[{"lang":"eng","text":"Energy Markov Decision Processes (EMDPs) are finite-state Markov decision processes where each transition is assigned an integer counter update and a rational payoff. An EMDP configuration is a pair s(n), where s is a control state and n is the current counter value. The configurations are changed by performing transitions in the standard way. We consider the problem of computing a safe strategy (i.e., a strategy that keeps the counter non-negative) which maximizes the expected mean payoff. "}],"project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}]},{"citation":{"apa":"Brázdil, T., Chatterjee, K., Chmelik, M., Gupta, A., &#38; Novotný, P. (2016). Stochastic shortest path with energy constraints in POMDPs. In <i>Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems</i> (pp. 1465–1466). Singapore: ACM.","mla":"Brázdil, Tomáš, et al. “Stochastic Shortest Path with Energy Constraints in POMDPs.” <i>Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems</i>, ACM, 2016, pp. 1465–66.","ista":"Brázdil T, Chatterjee K, Chmelik M, Gupta A, Novotný P. 2016. Stochastic shortest path with energy constraints in POMDPs. Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems. AAMAS: Autonomous Agents &#38; Multiagent Systems, 1465–1466.","short":"T. Brázdil, K. Chatterjee, M. Chmelik, A. Gupta, P. Novotný, in:, Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, ACM, 2016, pp. 1465–1466.","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Anchit Gupta, and Petr Novotný. “Stochastic Shortest Path with Energy Constraints in POMDPs.” In <i>Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems</i>, 1465–66. ACM, 2016.","ama":"Brázdil T, Chatterjee K, Chmelik M, Gupta A, Novotný P. Stochastic shortest path with energy constraints in POMDPs. In: <i>Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems</i>. ACM; 2016:1465-1466.","ieee":"T. Brázdil, K. Chatterjee, M. Chmelik, A. Gupta, and P. Novotný, “Stochastic shortest path with energy constraints in POMDPs,” in <i>Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems</i>, Singapore, 2016, pp. 1465–1466."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.07565"}],"author":[{"first_name":"Tomáš","last_name":"Brázdil","full_name":"Brázdil, Tomáš"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin","last_name":"Chmelik","first_name":"Martin"},{"full_name":"Gupta, Anchit","last_name":"Gupta","first_name":"Anchit"},{"last_name":"Novotny","first_name":"Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","full_name":"Novotny, Petr"}],"quality_controlled":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","type":"conference","date_updated":"2021-01-12T06:49:54Z","year":"2016","day":"01","publication":"Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems","title":"Stochastic shortest path with energy constraints in POMDPs","ec_funded":1,"_id":"1327","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"oa":1,"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"abstract":[{"text":"We consider partially observable Markov decision processes (POMDPs) with a set of target states and positive integer costs associated with every transition. The traditional optimization objective (stochastic shortest path) asks to minimize the expected total cost until the target set is reached. We extend the traditional framework of POMDPs to model energy consumption, which represents a hard constraint. The energy levels may increase and decrease with transitions, and the hard constraint requires that the energy level must remain positive in all steps till the target is reached. First, we present a novel algorithm for solving POMDPs with energy levels, developing on existing POMDP solvers and using RTDP as its main method. Our second contribution is related to policy representation. For larger POMDP instances the policies computed by existing solvers are too large to be understandable. We present an automated procedure based on machine learning techniques that automatically extracts important decisions of the policy allowing us to compute succinct human readable policies. Finally, we show experimentally that our algorithm performs well and computes succinct policies on a number of POMDP instances from the literature that were naturally enhanced with energy levels. ","lang":"eng"}],"publication_status":"published","date_published":"2016-01-01T00:00:00Z","page":"1465 - 1466","publisher":"ACM","scopus_import":1,"publist_id":"5942","conference":{"location":"Singapore","start_date":"2016-05-09","end_date":"2016-05-13","name":"AAMAS: Autonomous Agents & Multiagent Systems"},"month":"01","date_created":"2018-12-11T11:51:23Z","status":"public"},{"page":"6879 - 6885","date_published":"2016-09-22T00:00:00Z","file":[{"access_level":"open_access","checksum":"b63feece90d7b620ece49ca632e34ff3","file_name":"IST-2016-664-v1+1_acs.nanolett.6b02715.pdf","date_updated":"2020-07-14T12:44:44Z","file_id":"5053","creator":"system","content_type":"application/pdf","file_size":535121,"date_created":"2018-12-12T10:14:04Z","relation":"main_file"}],"scopus_import":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"22","date_updated":"2023-09-07T13:15:02Z","type":"journal_article","oa_version":"Published Version","language":[{"iso":"eng"}],"doi":"10.1021/acs.nanolett.6b02715","has_accepted_license":"1","department":[{"_id":"GeKa"}],"ec_funded":1,"acknowledgement":"The work was supported by the EC FP7 ICT project SiSPIN no. 323841, the EC FP7 ICT project PAMS no. 610446, the ERC Starting Grant no. 335497, the FWF-I-1190-N20 project, and the Swiss NSF. We acknowledge F. Schäffler for fruitful discussions related to the hut wire growth and for giving us access to the molecular beam epitaxy system, M. Schatzl for her support in electron beam lithography, and V. Jadris ̌ko for helping us with the COMSOL simulations. Finally, we thank G. Bauer for his continuous support. ","issue":"11","volume":16,"pubrep_id":"664","publisher":"American Chemical Society","file_date_updated":"2020-07-14T12:44:44Z","publist_id":"5941","intvolume":"        16","status":"public","date_created":"2018-12-11T11:51:24Z","month":"09","quality_controlled":"1","author":[{"full_name":"Watzinger, Hannes","id":"35DF8E50-F248-11E8-B48F-1D18A9856A87","last_name":"Watzinger","first_name":"Hannes"},{"first_name":"Christoph","last_name":"Kloeffel","full_name":"Kloeffel, Christoph"},{"orcid":"0000-0003-2424-8636","full_name":"Vukusic, Lada","id":"31E9F056-F248-11E8-B48F-1D18A9856A87","first_name":"Lada","last_name":"Vukusic"},{"full_name":"Rossell, Marta","first_name":"Marta","last_name":"Rossell"},{"full_name":"Sessi, Violetta","last_name":"Sessi","first_name":"Violetta"},{"full_name":"Kukucka, Josip","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87","first_name":"Josip","last_name":"Kukucka"},{"first_name":"Raimund","last_name":"Kirchschlager","full_name":"Kirchschlager, Raimund"},{"first_name":"Elisabeth","last_name":"Lausecker","id":"33662F76-F248-11E8-B48F-1D18A9856A87","full_name":"Lausecker, Elisabeth"},{"id":"49CBC780-F248-11E8-B48F-1D18A9856A87","full_name":"Truhlar, Alisha","first_name":"Alisha","last_name":"Truhlar"},{"full_name":"Glaser, Martin","last_name":"Glaser","first_name":"Martin"},{"last_name":"Rastelli","first_name":"Armando","full_name":"Rastelli, Armando"},{"first_name":"Andreas","last_name":"Fuhrer","full_name":"Fuhrer, Andreas"},{"full_name":"Loss, Daniel","first_name":"Daniel","last_name":"Loss"},{"id":"38DB5788-F248-11E8-B48F-1D18A9856A87","full_name":"Katsaros, Georgios","orcid":"0000-0001-8342-202X","last_name":"Katsaros","first_name":"Georgios"}],"citation":{"mla":"Watzinger, Hannes, et al. “Heavy-Hole States in Germanium Hut Wires.” <i>Nano Letters</i>, vol. 16, no. 11, American Chemical Society, 2016, pp. 6879–85, doi:<a href=\"https://doi.org/10.1021/acs.nanolett.6b02715\">10.1021/acs.nanolett.6b02715</a>.","apa":"Watzinger, H., Kloeffel, C., Vukušić, L., Rossell, M., Sessi, V., Kukucka, J., … Katsaros, G. (2016). Heavy-hole states in germanium hut wires. <i>Nano Letters</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.nanolett.6b02715\">https://doi.org/10.1021/acs.nanolett.6b02715</a>","ista":"Watzinger H, Kloeffel C, Vukušić L, Rossell M, Sessi V, Kukucka J, Kirchschlager R, Lausecker E, Truhlar A, Glaser M, Rastelli A, Fuhrer A, Loss D, Katsaros G. 2016. Heavy-hole states in germanium hut wires. Nano Letters. 16(11), 6879–6885.","short":"H. Watzinger, C. Kloeffel, L. Vukušić, M. Rossell, V. Sessi, J. Kukucka, R. Kirchschlager, E. Lausecker, A. Truhlar, M. Glaser, A. Rastelli, A. Fuhrer, D. Loss, G. Katsaros, Nano Letters 16 (2016) 6879–6885.","chicago":"Watzinger, Hannes, Christoph Kloeffel, Lada Vukušić, Marta Rossell, Violetta Sessi, Josip Kukucka, Raimund Kirchschlager, et al. “Heavy-Hole States in Germanium Hut Wires.” <i>Nano Letters</i>. American Chemical Society, 2016. <a href=\"https://doi.org/10.1021/acs.nanolett.6b02715\">https://doi.org/10.1021/acs.nanolett.6b02715</a>.","ieee":"H. Watzinger <i>et al.</i>, “Heavy-hole states in germanium hut wires,” <i>Nano Letters</i>, vol. 16, no. 11. American Chemical Society, pp. 6879–6885, 2016.","ama":"Watzinger H, Kloeffel C, Vukušić L, et al. Heavy-hole states in germanium hut wires. <i>Nano Letters</i>. 2016;16(11):6879-6885. doi:<a href=\"https://doi.org/10.1021/acs.nanolett.6b02715\">10.1021/acs.nanolett.6b02715</a>"},"year":"2016","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"related_material":{"record":[{"relation":"popular_science","status":"for_moderation","id":"7977"},{"id":"7996","relation":"dissertation_contains","status":"public"}]},"ddc":["539"],"oa":1,"_id":"1328","title":"Heavy-hole states in germanium hut wires","publication":"Nano Letters","publication_status":"published","abstract":[{"text":"Hole spins have gained considerable interest in the past few years due to their potential for fast electrically controlled qubits. Here, we study holes confined in Ge hut wires, a so-far unexplored type of nanostructure. Low-temperature magnetotransport measurements reveal a large anisotropy between the in-plane and out-of-plane g-factors of up to 18. Numerical simulations verify that this large anisotropy originates from a confined wave function of heavy-hole character. A light-hole admixture of less than 1% is estimated for the states of lowest energy, leading to a surprisingly large reduction of the out-of-plane g-factors compared with those for pure heavy holes. Given this tiny light-hole contribution, the spin lifetimes are expected to be very long, even in isotopically nonpurified samples.","lang":"eng"}],"project":[{"_id":"25517E86-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Towards Spin qubits and Majorana fermions in Germanium selfassembled hut-wires","grant_number":"335497"}]},{"scopus_import":1,"page":"3120 - 3139","file":[{"access_level":"open_access","checksum":"25c7adcb452d39d3b6343ff4b57a652d","file_name":"IST-2016-663-v1+1_Genome_Biol_Evol-2016-Huylmans-3120-39.pdf","date_updated":"2020-07-14T12:44:44Z","file_id":"4924","file_size":1406265,"content_type":"application/pdf","creator":"system","date_created":"2018-12-12T10:12:06Z","relation":"main_file"}],"date_published":"2016-10-01T00:00:00Z","acknowledgement":"This study was financially supported by individual grants from the Volkswagen Stiftung (to M.C.), the Deutsche Forschungsgemeinschaft (grant PA 903/6 to J.P.) and the DAAD (to A.K.H.). The authors would like to thank I. Schrank, L. Theodosiou, M. Kredler, C. Laforsch, J. Wolinska, J. Griebel, R. Jaenichen, and K. Otte for providing the necessary resources and help for maintaining Daphnia cultures in the laboratory. H. Lainer supported us for the molecular laboratory work. D. Gilbert and J. K. Colbourne contributed ideas for the bioinformatics analysis, and L. Hardulak did the orthology mapping including more insect species. This study was financially supported by individual grants from the Volkswagen Stiftung (to M.C.), the Deutsche Forschungsgemeinschaft (grant PA 903/6 to J.P.) and the DAAD (to A.K.H.). This work benefits from and contributes to the Daphnia Genomics Consortium.","has_accepted_license":"1","department":[{"_id":"BeVi"}],"license":"https://creativecommons.org/licenses/by-nc/4.0/","language":[{"iso":"eng"}],"doi":"10.1093/gbe/evw221","day":"01","oa_version":"Published Version","type":"journal_article","date_updated":"2021-01-12T06:49:55Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","month":"10","date_created":"2018-12-11T11:51:24Z","publist_id":"5940","intvolume":"         8","publisher":"Oxford University Press","file_date_updated":"2020-07-14T12:44:44Z","pubrep_id":"663","issue":"10","volume":8,"abstract":[{"lang":"eng","text":"Daphnia species have become models for ecological genomics and exhibit interesting features, such as high phenotypic plasticity and a densely packed genome with many lineage-specific genes. They are also cyclic parthenogenetic, with alternating asexual and sexual cycles and environmental sex determination. Here, we present a de novo transcriptome assembly of over 32,000 D. galeata genes and use it to investigate gene expression in females and spontaneously produced males of two clonal lines derived from lakes in Germany and the Czech Republic. We find that only a low percentage (18%) of genes shows sex-biased expression and that there are many more female-biased gene (FBG) than male-biased gene (MBG). Furthermore, FBGs tend to be more conserved between species than MBGs in both sequence and expression. These patterns may be a consequence of cyclic parthenogenesis leading to a relaxation of purifying selection on MBGs. The two clonal lines show considerable differences in both number and identity of sex-biased genes, suggesting that they may have reproductive strategies differing in their investment in sexual reproduction. Orthologs of key genes in the sex determination and juvenile hormone pathways, which are thought to be important for the transition from asexual to sexual reproduction, are present in D. galeata and highly conserved among Daphnia species."}],"publication_status":"published","_id":"1329","ddc":["576"],"oa":1,"title":"De novo transcriptome assembly and sex-biased gene expression in the cyclical parthenogenetic Daphnia galeata","publication":"Genome Biology and Evolution","year":"2016","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"quality_controlled":"1","author":[{"first_name":"Ann K","last_name":"Huylmans","id":"4C0A3874-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8871-4961","full_name":"Huylmans, Ann K"},{"first_name":"Alberto","last_name":"López Ezquerra","full_name":"López Ezquerra, Alberto"},{"last_name":"Parsch","first_name":"John","full_name":"Parsch, John"},{"full_name":"Cordellier, Mathilde","last_name":"Cordellier","first_name":"Mathilde"}],"citation":{"chicago":"Huylmans, Ann K, Alberto López Ezquerra, John Parsch, and Mathilde Cordellier. “De Novo Transcriptome Assembly and Sex-Biased Gene Expression in the Cyclical Parthenogenetic Daphnia Galeata.” <i>Genome Biology and Evolution</i>. Oxford University Press, 2016. <a href=\"https://doi.org/10.1093/gbe/evw221\">https://doi.org/10.1093/gbe/evw221</a>.","short":"A.K. Huylmans, A. López Ezquerra, J. Parsch, M. Cordellier, Genome Biology and Evolution 8 (2016) 3120–3139.","ista":"Huylmans AK, López Ezquerra A, Parsch J, Cordellier M. 2016. De novo transcriptome assembly and sex-biased gene expression in the cyclical parthenogenetic Daphnia galeata. Genome Biology and Evolution. 8(10), 3120–3139.","ama":"Huylmans AK, López Ezquerra A, Parsch J, Cordellier M. De novo transcriptome assembly and sex-biased gene expression in the cyclical parthenogenetic Daphnia galeata. <i>Genome Biology and Evolution</i>. 2016;8(10):3120-3139. doi:<a href=\"https://doi.org/10.1093/gbe/evw221\">10.1093/gbe/evw221</a>","ieee":"A. K. Huylmans, A. López Ezquerra, J. Parsch, and M. Cordellier, “De novo transcriptome assembly and sex-biased gene expression in the cyclical parthenogenetic Daphnia galeata,” <i>Genome Biology and Evolution</i>, vol. 8, no. 10. Oxford University Press, pp. 3120–3139, 2016.","apa":"Huylmans, A. K., López Ezquerra, A., Parsch, J., &#38; Cordellier, M. (2016). De novo transcriptome assembly and sex-biased gene expression in the cyclical parthenogenetic Daphnia galeata. <i>Genome Biology and Evolution</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/gbe/evw221\">https://doi.org/10.1093/gbe/evw221</a>","mla":"Huylmans, Ann K., et al. “De Novo Transcriptome Assembly and Sex-Biased Gene Expression in the Cyclical Parthenogenetic Daphnia Galeata.” <i>Genome Biology and Evolution</i>, vol. 8, no. 10, Oxford University Press, 2016, pp. 3120–39, doi:<a href=\"https://doi.org/10.1093/gbe/evw221\">10.1093/gbe/evw221</a>."}},{"abstract":[{"text":"In this paper we investigate the existence of closed billiard trajectories in not necessarily smooth convex bodies. In particular, we show that if a body K ⊂ Rd has the property that the tangent cone of every non-smooth point q ∉ ∂K is acute (in a certain sense), then there is a closed billiard trajectory in K.","lang":"eng"}],"publication_status":"published","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"}],"_id":"1330","oa":1,"title":"Billiards in convex bodies with acute angles","publication":"Israel Journal of Mathematics","year":"2016","quality_controlled":"1","author":[{"first_name":"Arseniy","last_name":"Akopyan","orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Balitskiy, Alexey","first_name":"Alexey","last_name":"Balitskiy"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1506.06014"}],"citation":{"ieee":"A. Akopyan and A. Balitskiy, “Billiards in convex bodies with acute angles,” <i>Israel Journal of Mathematics</i>, vol. 216, no. 2. Springer, pp. 833–845, 2016.","ama":"Akopyan A, Balitskiy A. Billiards in convex bodies with acute angles. <i>Israel Journal of Mathematics</i>. 2016;216(2):833-845. doi:<a href=\"https://doi.org/10.1007/s11856-016-1429-z\">10.1007/s11856-016-1429-z</a>","chicago":"Akopyan, Arseniy, and Alexey Balitskiy. “Billiards in Convex Bodies with Acute Angles.” <i>Israel Journal of Mathematics</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s11856-016-1429-z\">https://doi.org/10.1007/s11856-016-1429-z</a>.","short":"A. Akopyan, A. Balitskiy, Israel Journal of Mathematics 216 (2016) 833–845.","ista":"Akopyan A, Balitskiy A. 2016. Billiards in convex bodies with acute angles. Israel Journal of Mathematics. 216(2), 833–845.","apa":"Akopyan, A., &#38; Balitskiy, A. (2016). Billiards in convex bodies with acute angles. <i>Israel Journal of Mathematics</i>. Springer. <a href=\"https://doi.org/10.1007/s11856-016-1429-z\">https://doi.org/10.1007/s11856-016-1429-z</a>","mla":"Akopyan, Arseniy, and Alexey Balitskiy. “Billiards in Convex Bodies with Acute Angles.” <i>Israel Journal of Mathematics</i>, vol. 216, no. 2, Springer, 2016, pp. 833–45, doi:<a href=\"https://doi.org/10.1007/s11856-016-1429-z\">10.1007/s11856-016-1429-z</a>."},"status":"public","month":"10","date_created":"2018-12-11T11:51:24Z","publist_id":"5938","intvolume":"       216","publisher":"Springer","issue":"2","volume":216,"acknowledgement":"Supported by People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement n°[291734]. Supported by the Russian Foundation for Basic Research grant 15-31-20403 (mol a ved), by the Russian Foundation for Basic Research grant 15-01-99563 A, in part by the Moebius Contest Foundation for Young Scientists, and in part by the Simons Foundation.","department":[{"_id":"HeEd"}],"doi":"10.1007/s11856-016-1429-z","language":[{"iso":"eng"}],"ec_funded":1,"day":"15","oa_version":"Preprint","date_updated":"2021-01-12T06:49:56Z","type":"journal_article","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"page":"833 - 845","date_published":"2016-10-15T00:00:00Z"}]