[{"oa_version":"Published Version","intvolume":" 2018","status":"public","title":"Byzantine stochastic gradient descent","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"6558","abstract":[{"lang":"eng","text":"This paper studies the problem of distributed stochastic optimization in an adversarial setting where, out of m machines which allegedly compute stochastic gradients every iteration, an α-fraction are Byzantine, and may behave adversarially. Our main result is a variant of stochastic gradient descent (SGD) which finds ε-approximate minimizers of convex functions in T=O~(1/ε²m+α²/ε²) iterations. In contrast, traditional mini-batch SGD needs T=O(1/ε²m) iterations, but cannot tolerate Byzantine failures. Further, we provide a lower bound showing that, up to logarithmic factors, our algorithm is information-theoretically optimal both in terms of sample complexity and time complexity."}],"type":"conference","date_published":"2018-12-01T00:00:00Z","page":"4613-4623","citation":{"ama":"Alistarh D-A, Allen-Zhu Z, Li J. Byzantine stochastic gradient descent. In: Advances in Neural Information Processing Systems. Vol 2018. Neural Information Processing Systems Foundation; 2018:4613-4623.","apa":"Alistarh, D.-A., Allen-Zhu, Z., & Li, J. (2018). Byzantine stochastic gradient descent. In Advances in Neural Information Processing Systems (Vol. 2018, pp. 4613–4623). Montreal, Canada: Neural Information Processing Systems Foundation.","ieee":"D.-A. Alistarh, Z. Allen-Zhu, and J. Li, “Byzantine stochastic gradient descent,” in Advances in Neural Information Processing Systems, Montreal, Canada, 2018, vol. 2018, pp. 4613–4623.","ista":"Alistarh D-A, Allen-Zhu Z, Li J. 2018. Byzantine stochastic gradient descent. Advances in Neural Information Processing Systems. NeurIPS: Conference on Neural Information Processing Systems vol. 2018, 4613–4623.","short":"D.-A. Alistarh, Z. Allen-Zhu, J. Li, in:, Advances in Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2018, pp. 4613–4623.","mla":"Alistarh, Dan-Adrian, et al. “Byzantine Stochastic Gradient Descent.” Advances in Neural Information Processing Systems, vol. 2018, Neural Information Processing Systems Foundation, 2018, pp. 4613–23.","chicago":"Alistarh, Dan-Adrian, Zeyuan Allen-Zhu, and Jerry Li. “Byzantine Stochastic Gradient Descent.” In Advances in Neural Information Processing Systems, 2018:4613–23. Neural Information Processing Systems Foundation, 2018."},"publication":"Advances in Neural Information Processing Systems","article_processing_charge":"No","day":"01","scopus_import":"1","volume":2018,"date_updated":"2023-09-19T15:12:45Z","date_created":"2019-06-13T08:22:37Z","author":[{"full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Allen-Zhu, Zeyuan","last_name":"Allen-Zhu","first_name":"Zeyuan"},{"full_name":"Li, Jerry","first_name":"Jerry","last_name":"Li"}],"department":[{"_id":"DaAl"}],"publisher":"Neural Information Processing Systems Foundation","publication_status":"published","year":"2018","language":[{"iso":"eng"}],"conference":{"name":"NeurIPS: Conference on Neural Information Processing Systems","location":"Montreal, Canada","start_date":"2018-12-02","end_date":"2018-12-08"},"isi":1,"quality_controlled":"1","external_id":{"isi":["000461823304061"],"arxiv":["1803.08917"]},"main_file_link":[{"url":"https://arxiv.org/abs/1803.08917","open_access":"1"}],"oa":1,"month":"12"},{"ec_funded":1,"article_number":"22","date_created":"2019-02-17T22:59:25Z","date_updated":"2023-09-20T11:20:26Z","volume":15,"author":[{"full_name":"Kazda, Alexandr","id":"3B32BAA8-F248-11E8-B48F-1D18A9856A87","first_name":"Alexandr","last_name":"Kazda"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir"},{"full_name":"Rolinek, Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","last_name":"Rolinek","first_name":"Michal"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1192"}]},"publication_status":"published","publisher":"ACM","department":[{"_id":"VlKo"}],"year":"2018","month":"12","language":[{"iso":"eng"}],"doi":"10.1145/3230649","isi":1,"quality_controlled":"1","project":[{"grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.03124"}],"external_id":{"isi":["000468036500007"],"arxiv":["1602.03124"]},"oa":1,"abstract":[{"lang":"eng","text":"The main result of this article is a generalization of the classical blossom algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean CSPs where each variable appears in exactly two constraints (we call it edge CSP) and all constraints are even Δ-matroid relations (represented by lists of tuples). As a consequence of this, we settle the complexity classification of planar Boolean CSPs started by Dvorak and Kupec. Using a reduction to even Δ-matroids, we then extend the tractability result to larger classes of Δ-matroids that we call efficiently coverable. It properly includes classes that were known to be tractable before, namely, co-independent, compact, local, linear, and binary, with the following caveat:We represent Δ-matroids by lists of tuples, while the last two use a representation by matrices. Since an n ×n matrix can represent exponentially many tuples, our tractability result is not strictly stronger than the known algorithm for linear and binary Δ-matroids."}],"issue":"2","type":"journal_article","oa_version":"Preprint","status":"public","title":"Even delta-matroids and the complexity of planar boolean CSPs","intvolume":" 15","_id":"6032","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"01","article_processing_charge":"No","scopus_import":"1","date_published":"2018-12-01T00:00:00Z","article_type":"original","publication":"ACM Transactions on Algorithms","citation":{"mla":"Kazda, Alexandr, et al. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.” ACM Transactions on Algorithms, vol. 15, no. 2, 22, ACM, 2018, doi:10.1145/3230649.","short":"A. Kazda, V. Kolmogorov, M. Rolinek, ACM Transactions on Algorithms 15 (2018).","chicago":"Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.” ACM Transactions on Algorithms. ACM, 2018. https://doi.org/10.1145/3230649.","ama":"Kazda A, Kolmogorov V, Rolinek M. Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. 2018;15(2). doi:10.1145/3230649","ista":"Kazda A, Kolmogorov V, Rolinek M. 2018. Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. 15(2), 22.","apa":"Kazda, A., Kolmogorov, V., & Rolinek, M. (2018). Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. ACM. https://doi.org/10.1145/3230649","ieee":"A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar boolean CSPs,” ACM Transactions on Algorithms, vol. 15, no. 2. ACM, 2018."}},{"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"oa":1,"doi":"10.15479/AT:ISTA:th_963","language":[{"iso":"eng"}],"supervisor":[{"full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","first_name":"Nicholas H"}],"degree_awarded":"PhD","publication_identifier":{"issn":["2663-337X"]},"month":"02","year":"2018","department":[{"_id":"NiBa"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"563"},{"status":"public","relation":"part_of_dissertation","id":"1074"}]},"author":[{"last_name":"Ringbauer","first_name":"Harald","orcid":"0000-0002-4884-9682","id":"417FCFF4-F248-11E8-B48F-1D18A9856A87","full_name":"Ringbauer, Harald"}],"date_updated":"2023-09-20T12:00:56Z","date_created":"2018-12-11T11:45:10Z","publist_id":"7713","file_date_updated":"2020-07-14T12:45:23Z","citation":{"chicago":"Ringbauer, Harald. “Inferring Recent Demography from Spatial Genetic Structure.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_963.","short":"H. Ringbauer, Inferring Recent Demography from Spatial Genetic Structure, Institute of Science and Technology Austria, 2018.","mla":"Ringbauer, Harald. Inferring Recent Demography from Spatial Genetic Structure. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_963.","ieee":"H. Ringbauer, “Inferring recent demography from spatial genetic structure,” Institute of Science and Technology Austria, 2018.","apa":"Ringbauer, H. (2018). Inferring recent demography from spatial genetic structure. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_963","ista":"Ringbauer H. 2018. Inferring recent demography from spatial genetic structure. Institute of Science and Technology Austria.","ama":"Ringbauer H. Inferring recent demography from spatial genetic structure. 2018. doi:10.15479/AT:ISTA:th_963"},"page":"146","date_published":"2018-02-21T00:00:00Z","has_accepted_license":"1","article_processing_charge":"No","day":"21","_id":"200","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Inferring recent demography from spatial genetic structure","status":"public","ddc":["576"],"pubrep_id":"963","file":[{"checksum":"8cc534d2b528ae017acf80874cce48c9","date_updated":"2020-07-14T12:45:23Z","date_created":"2018-12-12T10:14:55Z","file_id":"5111","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":5792935,"access_level":"open_access","file_name":"IST-2018-963-v1+1_thesis.pdf"},{"relation":"source_file","file_id":"6224","date_updated":"2020-07-14T12:45:23Z","date_created":"2019-04-05T09:30:12Z","checksum":"6af18d7e5a7e2728ceda2f41ee24f628","file_name":"2018_thesis_ringbauer_source.zip","access_level":"closed","content_type":"application/zip","file_size":113365,"creator":"dernst"}],"oa_version":"Published Version","type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"text":"This thesis is concerned with the inference of current population structure based on geo-referenced genetic data. The underlying idea is that population structure affects its spatial genetic structure. Therefore, genotype information can be utilized to estimate important demographic parameters such as migration rates. These indirect estimates of population structure have become very attractive, as genotype data is now widely available. However, there also has been much concern about these approaches. Importantly, genetic structure can be influenced by many complex patterns, which often cannot be disentangled. Moreover, many methods merely fit heuristic patterns of genetic structure, and do not build upon population genetics theory. Here, I describe two novel inference methods that address these shortcomings. In Chapter 2, I introduce an inference scheme based on a new type of signal, identity by descent (IBD) blocks. Recently, it has become feasible to detect such long blocks of genome shared between pairs of samples. These blocks are direct traces of recent coalescence events. As such, they contain ample signal for inferring recent demography. I examine sharing of IBD blocks in two-dimensional populations with local migration. Using a diffusion approximation, I derive formulas for an isolation by distance pattern of long IBD blocks and show that sharing of long IBD blocks approaches rapid exponential decay for growing sample distance. I describe an inference scheme based on these results. It can robustly estimate the dispersal rate and population density, which is demonstrated on simulated data. I also show an application to estimate mean migration and the rate of recent population growth within Eastern Europe. Chapter 3 is about a novel method to estimate barriers to gene flow in a two dimensional population. This inference scheme utilizes geographically localized allele frequency fluctuations - a classical isolation by distance signal. The strength of these local fluctuations increases on average next to a barrier, and there is less correlation across it. I again use a framework of diffusion of ancestral lineages to model this effect, and provide an efficient numerical implementation to fit the results to geo-referenced biallelic SNP data. This inference scheme is able to robustly estimate strong barriers to gene flow, as tests on simulated data confirm.","lang":"eng"}]},{"scopus_import":"1","day":"01","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","publication":"Discrete & Computational Geometry","citation":{"chicago":"Akopyan, Arseniy, Alexey Balitskiy, and Mikhail Grigorev. “On the Circle Covering Theorem by A.W. Goodman and R.E. Goodman.” Discrete & Computational Geometry. Springer, 2018. https://doi.org/10.1007/s00454-017-9883-x.","short":"A. Akopyan, A. Balitskiy, M. Grigorev, Discrete & Computational Geometry 59 (2018) 1001–1009.","mla":"Akopyan, Arseniy, et al. “On the Circle Covering Theorem by A.W. Goodman and R.E. Goodman.” Discrete & Computational Geometry, vol. 59, no. 4, Springer, 2018, pp. 1001–09, doi:10.1007/s00454-017-9883-x.","ieee":"A. Akopyan, A. Balitskiy, and M. Grigorev, “On the circle covering theorem by A.W. Goodman and R.E. Goodman,” Discrete & Computational Geometry, vol. 59, no. 4. Springer, pp. 1001–1009, 2018.","apa":"Akopyan, A., Balitskiy, A., & Grigorev, M. (2018). On the circle covering theorem by A.W. Goodman and R.E. Goodman. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-017-9883-x","ista":"Akopyan A, Balitskiy A, Grigorev M. 2018. On the circle covering theorem by A.W. Goodman and R.E. Goodman. Discrete & Computational Geometry. 59(4), 1001–1009.","ama":"Akopyan A, Balitskiy A, Grigorev M. On the circle covering theorem by A.W. Goodman and R.E. Goodman. Discrete & Computational Geometry. 2018;59(4):1001-1009. doi:10.1007/s00454-017-9883-x"},"article_type":"original","page":"1001-1009","date_published":"2018-06-01T00:00:00Z","type":"journal_article","abstract":[{"text":"In 1945, A.W. Goodman and R.E. Goodman proved the following conjecture by P. Erdős: Given a family of (round) disks of radii r1, … , rn in the plane, it is always possible to cover them by a disk of radius R= ∑ ri, provided they cannot be separated into two subfamilies by a straight line disjoint from the disks. In this note we show that essentially the same idea may work for different analogues and generalizations of their result. In particular, we prove the following: Given a family of positive homothetic copies of a fixed convex body K⊂ Rd with homothety coefficients τ1, … , τn> 0 , it is always possible to cover them by a translate of d+12(∑τi)K, provided they cannot be separated into two subfamilies by a hyperplane disjoint from the homothets.","lang":"eng"}],"issue":"4","_id":"1064","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","ddc":["516","000"],"title":"On the circle covering theorem by A.W. Goodman and R.E. Goodman","intvolume":" 59","file":[{"creator":"dernst","file_size":482518,"content_type":"application/pdf","file_name":"2018_DiscreteComp_Akopyan.pdf","access_level":"open_access","date_created":"2019-01-18T09:27:36Z","date_updated":"2019-01-18T09:27:36Z","success":1,"file_id":"5844","relation":"main_file"}],"oa_version":"Published Version","month":"06","publication_identifier":{"eissn":["14320444"],"issn":["01795376"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000432205500011"]},"isi":1,"quality_controlled":"1","project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"doi":"10.1007/s00454-017-9883-x","language":[{"iso":"eng"}],"file_date_updated":"2019-01-18T09:27:36Z","ec_funded":1,"publist_id":"6324","year":"2018","publication_status":"published","publisher":"Springer","department":[{"_id":"HeEd"}],"author":[{"first_name":"Arseniy","last_name":"Akopyan","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy"},{"full_name":"Balitskiy, Alexey","first_name":"Alexey","last_name":"Balitskiy"},{"full_name":"Grigorev, Mikhail","last_name":"Grigorev","first_name":"Mikhail"}],"date_created":"2018-12-11T11:49:57Z","date_updated":"2023-09-20T12:08:51Z","volume":59},{"alternative_title":["ISTA Thesis"],"type":"dissertation","abstract":[{"lang":"eng","text":"The aim of this thesis was the development of new strategies for optical and optogenetic control of proliferative and pro-survival signaling, and characterizing them from the molecular mechanism up to cellular effects. These new light-based methods have unique features, such as red light as an activator, or the avoidance of gene delivery, which enable to overcome current limitations, such as light delivery to target tissues and feasibility as therapeutic approach. A special focus was placed on implementing these new light-based approaches in pancreatic β-cells, as β-cells are the key players in diabetes and especially their loss in number negatively affects disease progression. Currently no treatment options are available to compensate the lack of functional β-cells in diabetic patients.\r\nIn a first approach, red-light-activated growth factor receptors, in particular receptor tyrosine kinases were engineered and characterized. Receptor activation with light allows spatio-temporal control compared to ligand-based activation, and especially red light exhibits deeper tissue penetration than other wavelengths of the visible spectrum. Red-light-activated receptor tyrosine kinases robustly activated major growth factor related signaling pathways with a high temporal resolution. Moreover, the remote activation of the proliferative MAPK/Erk pathway by red-light-activated receptor tyrosine kinases in a pancreatic β-cell line was also achieved, through one centimeter thick mouse tissue. Although red-light-activated receptor tyrosine kinases are particularly attractive for applications in animal models due to the deep tissue penetration of red light, a drawback, especially with regard to translation into humans, is the requirement of gene therapy.\r\nIn a second approach an endogenous light-sensitive mechanism was identified and its potential to promote proliferative and pro-survival signals was explored, towards light-based tissue regeneration without the need for gene transfer. Blue-green light illumination was found to be sufficient for the activation of proliferation and survival promoting signaling pathways in primary pancreatic murine and human islets. Blue-green light also led to an increase in proliferation of primary islet cells, an effect which was shown to be mostly β-cell specific in human islets. Moreover, it was demonstrated that this approach of pancreatic β-cell expansion did not have any negative effect on the β-cell function, in particular on their insulin secretion capacity. In contrast, a trend for enhanced insulin secretion under high glucose conditions after illumination was detected. In order to unravel the detailed characteristics of this endogenous light-sensitive mechanism, the precise light requirements were determined. In addition, the expression of light sensing proteins, OPN3 and rhodopsin, was detected. The observed effects were found to be independent of handling effects such as temperature differences and cytochrome c oxidase dependent ATP increase, but they were found to be enhanced through the knockout of OPN3. The exact mechanism of how islets cells sense light and the identity of the photoreceptor remains unknown.\r\nSummarized two new light-based systems with unique features were established that enable the activation of proliferative and pro-survival signaling pathways. While red-light-activated receptor tyrosine kinases open a new avenue for optogenetics research, by allowing non-invasive control of signaling in vivo, the identified endogenous light-sensitive mechanism has the potential to be the basis of a gene therapy-free therapeutical approach for light-based β-cell expansion."}],"title":"Optical and optogenetic control of proliferation and survival ","status":"public","ddc":["571","570"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"418","oa_version":"Published Version","file":[{"relation":"source_file","file_id":"6222","checksum":"697fa72ca36fb1b8ceabc133d58a73e5","date_created":"2019-04-05T09:28:03Z","date_updated":"2020-07-14T12:46:24Z","access_level":"closed","file_name":"2018_THESIS_Gschaider-Reichhart_source.docx","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_size":7012495,"creator":"dernst"},{"file_size":6355280,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2018_THESIS_Gschaider-Reichhart.pdf","checksum":"58d7d1e9e58aeb7f061ab686b1d8a48c","date_updated":"2020-07-14T12:46:24Z","date_created":"2019-04-05T09:28:03Z","relation":"main_file","file_id":"6223"}],"pubrep_id":"913","day":"08","article_processing_charge":"No","has_accepted_license":"1","page":"107","citation":{"chicago":"Gschaider-Reichhart, Eva. “Optical and Optogenetic Control of Proliferation and Survival .” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_913.","mla":"Gschaider-Reichhart, Eva. Optical and Optogenetic Control of Proliferation and Survival . Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_913.","short":"E. Gschaider-Reichhart, Optical and Optogenetic Control of Proliferation and Survival , Institute of Science and Technology Austria, 2018.","ista":"Gschaider-Reichhart E. 2018. Optical and optogenetic control of proliferation and survival . Institute of Science and Technology Austria.","ieee":"E. Gschaider-Reichhart, “Optical and optogenetic control of proliferation and survival ,” Institute of Science and Technology Austria, 2018.","apa":"Gschaider-Reichhart, E. (2018). Optical and optogenetic control of proliferation and survival . Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_913","ama":"Gschaider-Reichhart E. Optical and optogenetic control of proliferation and survival . 2018. doi:10.15479/AT:ISTA:th_913"},"date_published":"2018-01-08T00:00:00Z","file_date_updated":"2020-07-14T12:46:24Z","publist_id":"7405","publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"HaJa"}],"year":"2018","date_created":"2018-12-11T11:46:22Z","date_updated":"2023-09-22T09:20:10Z","author":[{"full_name":"Gschaider-Reichhart, Eva","id":"3FEE232A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7218-7738","first_name":"Eva","last_name":"Gschaider-Reichhart"}],"related_material":{"record":[{"id":"1441","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"1678"},{"status":"public","relation":"part_of_dissertation","id":"2084"},{"id":"1028","status":"public","relation":"part_of_dissertation"}]},"month":"01","publication_identifier":{"issn":["2663-337X"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"degree_awarded":"PhD","supervisor":[{"full_name":"Janovjak, Harald L","last_name":"Janovjak","first_name":"Harald L","orcid":"0000-0002-8023-9315","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}],"doi":"10.15479/AT:ISTA:th_913"},{"publist_id":"6383","ec_funded":1,"volume":2018,"date_created":"2018-12-11T11:49:41Z","date_updated":"2023-09-22T09:44:21Z","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"6179"}]},"author":[{"first_name":"László","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","full_name":"Erdös, László"},{"first_name":"Dominik J","last_name":"Schröder","id":"408ED176-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2904-1856","full_name":"Schröder, Dominik J"}],"department":[{"_id":"LaEr"}],"publisher":"Oxford University Press","publication_status":"published","year":"2018","publication_identifier":{"issn":["10737928"]},"month":"05","language":[{"iso":"eng"}],"doi":"10.1093/imrn/rnw330","project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems"}],"quality_controlled":"1","isi":1,"external_id":{"isi":["000441668300009"],"arxiv":["1608.05163"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1608.05163","open_access":"1"}],"issue":"10","abstract":[{"lang":"eng","text":"We prove a new central limit theorem (CLT) for the difference of linear eigenvalue statistics of a Wigner random matrix H and its minor H and find that the fluctuation is much smaller than the fluctuations of the individual linear statistics, as a consequence of the strong correlation between the eigenvalues of H and H. In particular, our theorem identifies the fluctuation of Kerov's rectangular Young diagrams, defined by the interlacing eigenvalues ofH and H, around their asymptotic shape, the Vershik'Kerov'Logan'Shepp curve. Young diagrams equipped with the Plancherel measure follow the same limiting shape. For this, algebraically motivated, ensemble a CLT has been obtained in Ivanov and Olshanski [20] which is structurally similar to our result but the variance is different, indicating that the analogy between the two models has its limitations. Moreover, our theorem shows that Borodin's result [7] on the convergence of the spectral distribution of Wigner matrices to a Gaussian free field also holds in derivative sense."}],"type":"journal_article","oa_version":"Preprint","intvolume":" 2018","title":"Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues","status":"public","_id":"1012","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","day":"18","scopus_import":"1","date_published":"2018-05-18T00:00:00Z","page":"3255-3298","citation":{"mla":"Erdös, László, and Dominik J. Schröder. “Fluctuations of Rectangular Young Diagrams of Interlacing Wigner Eigenvalues.” International Mathematics Research Notices, vol. 2018, no. 10, Oxford University Press, 2018, pp. 3255–98, doi:10.1093/imrn/rnw330.","short":"L. Erdös, D.J. Schröder, International Mathematics Research Notices 2018 (2018) 3255–3298.","chicago":"Erdös, László, and Dominik J Schröder. “Fluctuations of Rectangular Young Diagrams of Interlacing Wigner Eigenvalues.” International Mathematics Research Notices. Oxford University Press, 2018. https://doi.org/10.1093/imrn/rnw330.","ama":"Erdös L, Schröder DJ. Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues. International Mathematics Research Notices. 2018;2018(10):3255-3298. doi:10.1093/imrn/rnw330","ista":"Erdös L, Schröder DJ. 2018. Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues. International Mathematics Research Notices. 2018(10), 3255–3298.","ieee":"L. Erdös and D. J. Schröder, “Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues,” International Mathematics Research Notices, vol. 2018, no. 10. Oxford University Press, pp. 3255–3298, 2018.","apa":"Erdös, L., & Schröder, D. J. (2018). Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnw330"},"publication":"International Mathematics Research Notices"},{"file_date_updated":"2020-07-14T12:47:16Z","article_number":"39","related_material":{"record":[{"id":"1003","relation":"earlier_version","status":"public"}]},"author":[{"orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","first_name":"Guy","full_name":"Avni, Guy"},{"full_name":"Guha, Shibashis","last_name":"Guha","first_name":"Shibashis"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"}],"volume":9,"date_updated":"2023-09-22T09:48:59Z","date_created":"2019-02-14T14:17:54Z","year":"2018","department":[{"_id":"ToHe"}],"publisher":"MDPI AG","publication_status":"published","publication_identifier":{"issn":["2073-4336"]},"month":"09","doi":"10.3390/g9030039","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"project":[{"_id":"264B3912-B435-11E9-9278-68D0E5697425","grant_number":"M02369","call_identifier":"FWF","name":"Formal Methods meets Algorithmic Game Theory"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"quality_controlled":"1","issue":"3","abstract":[{"lang":"eng","text":"Network games (NGs) are played on directed graphs and are extensively used in network design and analysis. Search problems for NGs include finding special strategy profiles such as a Nash equilibrium and a globally-optimal solution. The networks modeled by NGs may be huge. In formal verification, abstraction has proven to be an extremely effective technique for reasoning about systems with big and even infinite state spaces. We describe an abstraction-refinement methodology for reasoning about NGs. Our methodology is based on an abstraction function that maps the state space of an NG to a much smaller state space. We search for a global optimum and a Nash equilibrium by reasoning on an under- and an over-approximation defined on top of this smaller state space. When the approximations are too coarse to find such profiles, we refine the abstraction function. We extend the abstraction-refinement methodology to labeled networks, where the objectives of the players are regular languages. Our experimental results demonstrate the effectiveness of the methodology. "}],"type":"journal_article","file":[{"file_id":"6008","relation":"main_file","date_created":"2019-02-14T14:20:31Z","date_updated":"2020-07-14T12:47:16Z","checksum":"749d65ca4ce74256a029d9644a1b1cb0","file_name":"2018_MDPI_Avni.pdf","access_level":"open_access","creator":"kschuh","file_size":505155,"content_type":"application/pdf"}],"oa_version":"Published Version","_id":"6006","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 9","title":"An abstraction-refinement methodology for reasoning about network games","status":"public","ddc":["004"],"has_accepted_license":"1","day":"01","scopus_import":1,"date_published":"2018-09-01T00:00:00Z","citation":{"ama":"Avni G, Guha S, Kupferman O. An abstraction-refinement methodology for reasoning about network games. Games. 2018;9(3). doi:10.3390/g9030039","ieee":"G. Avni, S. Guha, and O. Kupferman, “An abstraction-refinement methodology for reasoning about network games,” Games, vol. 9, no. 3. MDPI AG, 2018.","apa":"Avni, G., Guha, S., & Kupferman, O. (2018). An abstraction-refinement methodology for reasoning about network games. Games. MDPI AG. https://doi.org/10.3390/g9030039","ista":"Avni G, Guha S, Kupferman O. 2018. An abstraction-refinement methodology for reasoning about network games. Games. 9(3), 39.","short":"G. Avni, S. Guha, O. Kupferman, Games 9 (2018).","mla":"Avni, Guy, et al. “An Abstraction-Refinement Methodology for Reasoning about Network Games.” Games, vol. 9, no. 3, 39, MDPI AG, 2018, doi:10.3390/g9030039.","chicago":"Avni, Guy, Shibashis Guha, and Orna Kupferman. “An Abstraction-Refinement Methodology for Reasoning about Network Games.” Games. MDPI AG, 2018. https://doi.org/10.3390/g9030039."},"publication":"Games"},{"abstract":[{"text":"We consider planning problems for graphs, Markov decision processes (MDPs), and games on graphs. While graphs represent the most basic planning model, MDPs represent interaction with nature and games on graphs represent interaction with an adversarial environment. We consider two planning problems where there are k different target sets, and the problems are as follows: (a) the coverage problem asks whether there is a plan for each individual target set; and (b) the sequential target reachability problem asks whether the targets can be reached in sequence. For the coverage problem, we present a linear-time algorithm for graphs, and quadratic conditional lower bound for MDPs and games on graphs. For the sequential target problem, we present a linear-time algorithm for graphs, a sub-quadratic algorithm for MDPs, and a quadratic conditional lower bound for games on graphs. Our results with conditional lower bounds establish (i) model-separation results showing that for the coverage problem MDPs and games on graphs are harder than graphs and for the sequential reachability problem games on graphs are harder than MDPs and graphs; and (ii) objective-separation results showing that for MDPs the coverage problem is harder than the sequential target problem.","lang":"eng"}],"type":"conference","oa_version":"None","status":"public","title":"Algorithms and conditional lower bounds for planning problems","_id":"35","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"2018-06-01T00:00:00Z","citation":{"chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Alexander Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.” In 28th International Conference on Automated Planning and Scheduling . AAAI Press, 2018.","short":"K. Chatterjee, W. Dvorák, M.H. Henzinger, A. Svozil, in:, 28th International Conference on Automated Planning and Scheduling , AAAI Press, 2018.","mla":"Chatterjee, Krishnendu, et al. “Algorithms and Conditional Lower Bounds for Planning Problems.” 28th International Conference on Automated Planning and Scheduling , AAAI Press, 2018.","ieee":"K. Chatterjee, W. Dvorák, M. H. Henzinger, and A. Svozil, “Algorithms and conditional lower bounds for planning problems,” in 28th International Conference on Automated Planning and Scheduling , Delft, Netherlands, 2018.","apa":"Chatterjee, K., Dvorák, W., Henzinger, M. H., & Svozil, A. (2018). Algorithms and conditional lower bounds for planning problems. In 28th International Conference on Automated Planning and Scheduling . Delft, Netherlands: AAAI Press.","ista":"Chatterjee K, Dvorák W, Henzinger MH, Svozil A. 2018. Algorithms and conditional lower bounds for planning problems. 28th International Conference on Automated Planning and Scheduling . ICAPS: International Conference on Automated Planning and Scheduling.","ama":"Chatterjee K, Dvorák W, Henzinger MH, Svozil A. Algorithms and conditional lower bounds for planning problems. In: 28th International Conference on Automated Planning and Scheduling . AAAI Press; 2018."},"publication":"28th International Conference on Automated Planning and Scheduling ","publist_id":"8020","ec_funded":1,"date_updated":"2023-09-26T10:41:41Z","date_created":"2018-12-11T11:44:17Z","related_material":{"record":[{"status":"public","relation":"later_version","id":"9293"}]},"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"first_name":"Wolfgang","last_name":"Dvorák","full_name":"Dvorák, Wolfgang"},{"full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"last_name":"Svozil","first_name":"Alexander","full_name":"Svozil, Alexander"}],"publisher":"AAAI Press","department":[{"_id":"KrCh"}],"publication_status":"published","year":"2018","month":"06","language":[{"iso":"eng"}],"conference":{"name":"ICAPS: International Conference on Automated Planning and Scheduling","end_date":"2018-06-29","start_date":"2018-06-24","location":"Delft, Netherlands"},"project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"}],"isi":1,"quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.07031"}],"external_id":{"isi":["000492986200007"],"arxiv":["1804.07031"]}},{"scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"01","page":"166 - 207","citation":{"ama":"Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. 2018;54(1):166-207. doi:10.1007/s11241-017-9293-4","ista":"Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. 2018. Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. 54(1), 166–207.","ieee":"K. Chatterjee, A. Pavlogiannis, A. Kößler, and U. Schmid, “Automated competitive analysis of real time scheduling with graph games,” Real-Time Systems, vol. 54, no. 1. Springer, pp. 166–207, 2018.","apa":"Chatterjee, K., Pavlogiannis, A., Kößler, A., & Schmid, U. (2018). Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. Springer. https://doi.org/10.1007/s11241-017-9293-4","mla":"Chatterjee, Krishnendu, et al. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.” Real-Time Systems, vol. 54, no. 1, Springer, 2018, pp. 166–207, doi:10.1007/s11241-017-9293-4.","short":"K. Chatterjee, A. Pavlogiannis, A. Kößler, U. Schmid, Real-Time Systems 54 (2018) 166–207.","chicago":"Chatterjee, Krishnendu, Andreas Pavlogiannis, Alexander Kößler, and Ulrich Schmid. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.” Real-Time Systems. Springer, 2018. https://doi.org/10.1007/s11241-017-9293-4."},"publication":"Real-Time Systems","date_published":"2018-01-01T00:00:00Z","type":"journal_article","issue":"1","abstract":[{"text":"This paper is devoted to automatic competitive analysis of real-time scheduling algorithms for firm-deadline tasksets, where only completed tasks con- tribute some utility to the system. Given such a taskset T , the competitive ratio of an on-line scheduling algorithm A for T is the worst-case utility ratio of A over the utility achieved by a clairvoyant algorithm. We leverage the theory of quantitative graph games to address the competitive analysis and competitive synthesis problems. For the competitive analysis case, given any taskset T and any finite-memory on- line scheduling algorithm A , we show that the competitive ratio of A in T can be computed in polynomial time in the size of the state space of A . Our approach is flexible as it also provides ways to model meaningful constraints on the released task sequences that determine the competitive ratio. We provide an experimental study of many well-known on-line scheduling algorithms, which demonstrates the feasibility of our competitive analysis approach that effectively replaces human ingenuity (required Preliminary versions of this paper have appeared in Chatterjee et al. ( 2013 , 2014 ). B Andreas Pavlogiannis pavlogiannis@ist.ac.at Krishnendu Chatterjee krish.chat@ist.ac.at Alexander Kößler koe@ecs.tuwien.ac.at Ulrich Schmid s@ecs.tuwien.ac.at 1 IST Austria (Institute of Science and Technology Austria), Am Campus 1, 3400 Klosterneuburg, Austria 2 Embedded Computing Systems Group, Vienna University of Technology, Treitlstrasse 3, 1040 Vienna, Austria 123 Real-Time Syst for finding worst-case scenarios) by computing power. For the competitive synthesis case, we are just given a taskset T , and the goal is to automatically synthesize an opti- mal on-line scheduling algorithm A , i.e., one that guarantees the largest competitive ratio possible for T . We show how the competitive synthesis problem can be reduced to a two-player graph game with partial information, and establish that the compu- tational complexity of solving this game is Np -complete. The competitive synthesis problem is hence in Np in the size of the state space of the non-deterministic labeled transition system encoding the taskset. Overall, the proposed framework assists in the selection of suitable scheduling algorithms for a given taskset, which is in fact the most common situation in real-time systems design. ","lang":"eng"}],"intvolume":" 54","ddc":["000"],"status":"public","title":"Automated competitive analysis of real time scheduling with graph games","_id":"738","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"IST-2018-960-v1+1_2017_Chatterjee_Automated_competetive.pdf","creator":"system","file_size":1163507,"content_type":"application/pdf","file_id":"5267","relation":"main_file","checksum":"c2590ef160709d8054cf29ee173f1454","date_updated":"2020-07-14T12:47:56Z","date_created":"2018-12-12T10:17:14Z"}],"pubrep_id":"960","month":"01","project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"isi":1,"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000419955500006"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/s11241-017-9293-4","ec_funded":1,"publist_id":"6929","file_date_updated":"2020-07-14T12:47:56Z","department":[{"_id":"KrCh"}],"publisher":"Springer","publication_status":"published","year":"2018","volume":54,"date_updated":"2023-09-27T12:52:38Z","date_created":"2018-12-11T11:48:14Z","related_material":{"record":[{"id":"2820","relation":"earlier_version","status":"public"}]},"author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","first_name":"Andreas","last_name":"Pavlogiannis"},{"last_name":"Kößler","first_name":"Alexander","full_name":"Kößler, Alexander"},{"last_name":"Schmid","first_name":"Ulrich","full_name":"Schmid, Ulrich"}]},{"title":"Point interactions in systems of fermions","ddc":["515","530","519"],"status":"public","_id":"52","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","file":[{"file_name":"2018_Thesis_Moser.pdf","access_level":"open_access","creator":"dernst","file_size":851164,"content_type":"application/pdf","file_id":"6256","relation":"main_file","date_created":"2019-04-09T07:45:38Z","date_updated":"2020-07-14T12:46:37Z","checksum":"fbd8c747d148b468a21213b7cf175225"},{"access_level":"closed","file_name":"2018_Thesis_Moser_Source.zip","creator":"dernst","file_size":1531516,"content_type":"application/zip","file_id":"6257","relation":"source_file","checksum":"c28e16ecfc1126d3ce324ec96493c01e","date_updated":"2020-07-14T12:46:37Z","date_created":"2019-04-09T07:45:38Z"}],"pubrep_id":"1043","alternative_title":["ISTA Thesis"],"type":"dissertation","abstract":[{"text":"In this thesis we will discuss systems of point interacting fermions, their stability and other spectral properties. Whereas for bosons a point interacting system is always unstable this ques- tion is more subtle for a gas of two species of fermions. In particular the answer depends on the mass ratio between these two species. Most of this work will be focused on the N + M model which consists of two species of fermions with N, M particles respectively which interact via point interactions. We will introduce this model using a formal limit and discuss the N + 1 system in more detail. In particular, we will show that for mass ratios above a critical one, which does not depend on the particle number, the N + 1 system is stable. In the context of this model we will prove rigorous versions of Tan relations which relate various quantities of the point-interacting model. By restricting the N + 1 system to a box we define a finite density model with point in- teractions. In the context of this system we will discuss the energy change when introducing a point-interacting impurity into a system of non-interacting fermions. We will see that this change in energy is bounded independently of the particle number and in particular the bound only depends on the density and the scattering length. As another special case of the N + M model we will show stability of the 2 + 2 model for mass ratios in an interval around one. Further we will investigate a different model of point interactions which was discussed before in the literature and which is, contrary to the N + M model, not given by a limiting procedure but is based on a Dirichlet form. We will show that this system behaves trivially in the thermodynamic limit, i.e. the free energy per particle is the same as the one of the non-interacting system.","lang":"eng"}],"page":"115","citation":{"ama":"Moser T. Point interactions in systems of fermions. 2018. doi:10.15479/AT:ISTA:th_1043","ista":"Moser T. 2018. Point interactions in systems of fermions. Institute of Science and Technology Austria.","apa":"Moser, T. (2018). Point interactions in systems of fermions. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_1043","ieee":"T. Moser, “Point interactions in systems of fermions,” Institute of Science and Technology Austria, 2018.","mla":"Moser, Thomas. Point Interactions in Systems of Fermions. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_1043.","short":"T. Moser, Point Interactions in Systems of Fermions, Institute of Science and Technology Austria, 2018.","chicago":"Moser, Thomas. “Point Interactions in Systems of Fermions.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_1043."},"date_published":"2018-09-04T00:00:00Z","article_processing_charge":"No","has_accepted_license":"1","day":"04","department":[{"_id":"RoSe"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","year":"2018","date_updated":"2023-09-27T12:34:14Z","date_created":"2018-12-11T11:44:22Z","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"5856"},{"id":"154","status":"public","relation":"part_of_dissertation"},{"id":"1198","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"741"}]},"author":[{"id":"2B5FC9A4-F248-11E8-B48F-1D18A9856A87","last_name":"Moser","first_name":"Thomas","full_name":"Moser, Thomas"}],"publist_id":"8002","file_date_updated":"2020-07-14T12:46:37Z","project":[{"grant_number":"P27533_N27","_id":"25C878CE-B435-11E9-9278-68D0E5697425","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","call_identifier":"FWF"}],"oa":1,"language":[{"iso":"eng"}],"degree_awarded":"PhD","supervisor":[{"full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","first_name":"Robert","last_name":"Seiringer"}],"doi":"10.15479/AT:ISTA:th_1043","publication_identifier":{"issn":["2663-337X"]},"month":"09"},{"publication":"Journal of Cell Science","citation":{"short":"R. Tejos, C. Rodríguez Furlán, M. Adamowski, M. Sauer, L. Norambuena, J. Friml, Journal of Cell Science 131 (2018).","mla":"Tejos, Ricardo, et al. “PATELLINS Are Regulators of Auxin Mediated PIN1 Relocation and Plant Development in Arabidopsis Thaliana.” Journal of Cell Science, vol. 131, no. 2, jcs. 204198, Company of Biologists, 2018, doi:10.1242/jcs.204198.","chicago":"Tejos, Ricardo, Cecilia Rodríguez Furlán, Maciek Adamowski, Michael Sauer, Lorena Norambuena, and Jiří Friml. “PATELLINS Are Regulators of Auxin Mediated PIN1 Relocation and Plant Development in Arabidopsis Thaliana.” Journal of Cell Science. Company of Biologists, 2018. https://doi.org/10.1242/jcs.204198.","ama":"Tejos R, Rodríguez Furlán C, Adamowski M, Sauer M, Norambuena L, Friml J. PATELLINS are regulators of auxin mediated PIN1 relocation and plant development in Arabidopsis thaliana. Journal of Cell Science. 2018;131(2). doi:10.1242/jcs.204198","ieee":"R. Tejos, C. Rodríguez Furlán, M. Adamowski, M. Sauer, L. Norambuena, and J. Friml, “PATELLINS are regulators of auxin mediated PIN1 relocation and plant development in Arabidopsis thaliana,” Journal of Cell Science, vol. 131, no. 2. Company of Biologists, 2018.","apa":"Tejos, R., Rodríguez Furlán, C., Adamowski, M., Sauer, M., Norambuena, L., & Friml, J. (2018). PATELLINS are regulators of auxin mediated PIN1 relocation and plant development in Arabidopsis thaliana. Journal of Cell Science. Company of Biologists. https://doi.org/10.1242/jcs.204198","ista":"Tejos R, Rodríguez Furlán C, Adamowski M, Sauer M, Norambuena L, Friml J. 2018. PATELLINS are regulators of auxin mediated PIN1 relocation and plant development in Arabidopsis thaliana. Journal of Cell Science. 131(2), jcs. 204198."},"date_published":"2018-01-29T00:00:00Z","scopus_import":"1","day":"29","article_processing_charge":"No","has_accepted_license":"1","status":"public","title":"PATELLINS are regulators of auxin mediated PIN1 relocation and plant development in Arabidopsis thaliana","ddc":["581"],"intvolume":" 131","_id":"913","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","file":[{"file_size":14925985,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2017_adamowski_PATELLINS_are.pdf","checksum":"bf156c20a4f117b4b932370d54cbac8c","date_updated":"2020-07-14T12:48:15Z","date_created":"2019-04-12T08:46:32Z","relation":"main_file","file_id":"6299"}],"pubrep_id":"988","type":"journal_article","abstract":[{"lang":"eng","text":"Coordinated cell polarization in developing tissues is a recurrent theme in multicellular organisms. In plants, a directional distribution of the plant hormone auxin is at the core of many developmental programs. A feedback regulation of auxin on the polarized localization of PIN auxin transporters in individual cells has been proposed as a self-organizing mechanism for coordinated tissue polarization, but the molecular mechanisms linking auxin signalling to PIN-dependent auxin transport remain unknown. We performed a microarray-based approach to find regulators of the auxin-induced PIN relocation in the Arabidopsis thaliana root. We identified a subset of a family of phosphatidylinositol transfer proteins (PITP), the PATELLINs (PATL). Here, we show that PATLs are expressed in partially overlapping cells types in different tissues going through mitosis or initiating differentiation programs. PATLs are plasma membrane-associated proteins accumulated in Arabidopsis embryos, primary roots, lateral root primordia, and developing stomata. Higher order patl mutants display reduced PIN1 repolarization in response to auxin, shorter root apical meristem, and drastic defects in embryo and seedling development. This suggests PATLs redundantly play a crucial role in polarity and patterning in Arabidopsis."}],"issue":"2","quality_controlled":"1","isi":1,"project":[{"name":"Polarity and subcellular dynamics in plants","call_identifier":"FP7","_id":"25716A02-B435-11E9-9278-68D0E5697425","grant_number":"282300"}],"oa":1,"external_id":{"isi":["000424842400019"]},"language":[{"iso":"eng"}],"doi":"10.1242/jcs.204198","month":"01","publication_identifier":{"issn":["00219533"]},"publication_status":"published","department":[{"_id":"JiFr"}],"publisher":"Company of Biologists","year":"2018","date_updated":"2023-09-26T15:47:50Z","date_created":"2018-12-11T11:49:10Z","volume":131,"author":[{"first_name":"Ricardo","last_name":"Tejos","full_name":"Tejos, Ricardo"},{"last_name":"Rodríguez Furlán","first_name":"Cecilia","full_name":"Rodríguez Furlán, Cecilia"},{"orcid":"0000-0001-6463-5257","id":"45F536D2-F248-11E8-B48F-1D18A9856A87","last_name":"Adamowski","first_name":"Maciek","full_name":"Adamowski, Maciek"},{"last_name":"Sauer","first_name":"Michael","full_name":"Sauer, Michael"},{"full_name":"Norambuena, Lorena","first_name":"Lorena","last_name":"Norambuena"},{"first_name":"Jirí","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","full_name":"Friml, Jirí"}],"article_number":"jcs.204198","file_date_updated":"2020-07-14T12:48:15Z","ec_funded":1,"publist_id":"6530"},{"pubrep_id":"1047","file":[{"access_level":"open_access","file_name":"2018_Thesis_Vukusic.pdf","file_size":28452385,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"6247","checksum":"c570b656e30749cd65b1c7e13a9ce0a8","date_updated":"2020-07-14T12:47:44Z","date_created":"2019-04-09T07:00:40Z"},{"file_name":"2018_Thesis_Vukusic_source.zip","access_level":"closed","creator":"dernst","file_size":53058704,"content_type":"application/zip","file_id":"6248","relation":"source_file","date_updated":"2020-07-14T12:47:44Z","date_created":"2019-04-09T07:00:40Z","checksum":"7856771d9cd401fe0b311191076db6e1"}],"oa_version":"Published Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"69","status":"public","title":"Charge sensing and spin relaxation times of holes in Ge hut wires","ddc":["530","600"],"abstract":[{"lang":"eng","text":"A qubit, a unit of quantum information, is essentially any quantum mechanical two-level system which can be coherently controlled. Still, to be used for computation, it has to fulfill criteria. Qubits, regardless of the system in which they are realized, suffer from decoherence. This leads to loss of the information stored in the qubit. The upper bound of the time scale on which decoherence happens is set by the spin relaxation time. In this thesis I studied a two-level system consisting of a Zeeman-split hole spin confined in a quantum dot formed in a Ge hut wire. Such Ge hut wires have emerged as a promising material system for the realization of spin qubits, due to the combination of two significant properties: long spin coherence time as expected for group IV semiconductors due to the low hyperfine interaction and a strong valence band spin-orbit coupling. Here, I present how to fabricate quantum dot devices suitable for electrical transport measurements. Coupled quantum dot devices allowed the realization of a charge sensor, which is electrostatically and tunnel coupled to a quantum dot. By integrating the charge sensor into a radio-frequency reflectometry setup, I performed for the first time single-shot readout measurements of hole spins and extracted the hole spin relaxation times in Ge hut wires."}],"type":"dissertation","alternative_title":["ISTA Thesis"],"date_published":"2018-09-01T00:00:00Z","citation":{"ama":"Vukušić L. Charge sensing and spin relaxation times of holes in Ge hut wires. 2018. doi:10.15479/AT:ISTA:TH_1047","ista":"Vukušić L. 2018. Charge sensing and spin relaxation times of holes in Ge hut wires. Institute of Science and Technology Austria.","ieee":"L. Vukušić, “Charge sensing and spin relaxation times of holes in Ge hut wires,” Institute of Science and Technology Austria, 2018.","apa":"Vukušić, L. (2018). Charge sensing and spin relaxation times of holes in Ge hut wires. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_1047","mla":"Vukušić, Lada. Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH_1047.","short":"L. Vukušić, Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires, Institute of Science and Technology Austria, 2018.","chicago":"Vukušić, Lada. “Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH_1047."},"page":"103","day":"01","article_processing_charge":"No","has_accepted_license":"1","author":[{"full_name":"Vukušić, Lada","orcid":"0000-0003-2424-8636","id":"31E9F056-F248-11E8-B48F-1D18A9856A87","last_name":"Vukušić","first_name":"Lada"}],"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"23"},{"relation":"part_of_dissertation","status":"public","id":"840"}]},"date_updated":"2023-09-26T15:50:22Z","date_created":"2018-12-11T11:44:28Z","year":"2018","publication_status":"published","department":[{"_id":"GeKa"},{"_id":"GradSch"}],"publisher":"Institute of Science and Technology Austria","file_date_updated":"2020-07-14T12:47:44Z","publist_id":"7985","doi":"10.15479/AT:ISTA:TH_1047","degree_awarded":"PhD","supervisor":[{"first_name":"Georgios","last_name":"Katsaros","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8342-202X","full_name":"Katsaros, Georgios"}],"language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"month":"09","publication_identifier":{"issn":["2663-337X"]}},{"day":"01","has_accepted_license":"1","article_processing_charge":"No","date_published":"2018-03-01T00:00:00Z","citation":{"ama":"Chen C. Synaptotagmins ensure speed and efficiency of inhibitory neurotransmitter release. 2018. doi:10.15479/AT:ISTA:th_997","ista":"Chen C. 2018. Synaptotagmins ensure speed and efficiency of inhibitory neurotransmitter release. Institute of Science and Technology Austria.","ieee":"C. Chen, “Synaptotagmins ensure speed and efficiency of inhibitory neurotransmitter release,” Institute of Science and Technology Austria, 2018.","apa":"Chen, C. (2018). Synaptotagmins ensure speed and efficiency of inhibitory neurotransmitter release. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_997","mla":"Chen, Chong. Synaptotagmins Ensure Speed and Efficiency of Inhibitory Neurotransmitter Release. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_997.","short":"C. Chen, Synaptotagmins Ensure Speed and Efficiency of Inhibitory Neurotransmitter Release, Institute of Science and Technology Austria, 2018.","chicago":"Chen, Chong. “Synaptotagmins Ensure Speed and Efficiency of Inhibitory Neurotransmitter Release.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_997."},"page":"110","abstract":[{"lang":"eng","text":"Neuronal networks in the brain consist of two main types of neuron, glutamatergic principal neurons and GABAergic interneurons. Although these interneurons only represent 10–20% of the whole population, they mediate feedback and feedforward inhibition and are involved in the generation of high-frequency network oscillations. A hallmark functional property of GABAergic interneurons, especially of the parvalbumin‑expressing (PV+) subtypes, is the speed of signaling at their output synapse across species and brain regions. Several molecular and subcellular factors may underlie the submillisecond signaling at GABAergic synapses. Such as the selective use of P/Q type Ca2+ channels and the tight coupling between Ca2+ channels and Ca2+ sensors of exocytosis. However, whether the molecular identity of the release sensor contributes to these signaling properties remains unclear. Besides, these interneurons are mainly show depression in response to train of stimuli. How could they keep sufficient release to control the activity of postsynaptic principal neurons during high network activity, is largely elusive. For my Ph.D. work, we firstly examined the Ca2+ sensor of exocytosis at the GABAergic basket cell (BC) to Purkinje cell (PC) synapse in the cerebellum. Immunolabeling suggested that BC terminals selectively expressed synaptotagmin 2 (Syt2), whereas synaptotagmin 1 (Syt1) was enriched in excitatory terminals. Genetic elimination of Syt2 reduced action potential-evoked release to ~10% compared to the wild-type control, identifying Syt2 as the major Ca2+ sensor at BC‑PC synapses. Differential adenovirus-mediated rescue revealed Syt2 triggered release with shorter latency and higher temporal precision, and mediated faster vesicle pool replenishment than Syt1. Furthermore, deletion of Syt2 severely reduced and delayed disynaptic inhibition following parallel fiber stimulation. Thus, the selective use of Syt2 as the release sensor at BC–PC synapse ensures fast feedforward inhibition in cerebellar microcircuits. Additionally, we tested the function of another synaptotagmin member, Syt7, for inhibitory synaptic transmission at the BC–PC synapse. Syt7 is thought to be a Ca2+ sensor that mediates asynchronous transmitter release and facilitation at synapses. However, it is strongly expressed in fast-spiking, PV+ GABAergic interneurons and the output synapses of these neurons produce only minimal asynchronous release and show depression rather than facilitation. How could Syt7, a facilitation sensor, contribute to the depressed inhibitory synaptic transmission needs to be further investigated and understood. Our results indicated that at the BC–PC synapse, Syt7 contributes to asynchronous release, pool replenishment and facilitation. In combination, these three effects ensure efficient transmitter release during high‑frequency activity and guarantee frequency independence of inhibition. Taken together, our results confirmed that Syt2, which has the fastest kinetic properties among all synaptotagmin members, is mainly used by the inhibitory BC‑PC synapse for synaptic transmission, contributing to the speed and temporal precision of transmitter release. Furthermore, we showed that Syt7, another highly expressed synaptotagmin member in the output synapses of cerebellar BCs, is used for ensuring efficient inhibitor synaptic transmission during high activity."}],"type":"dissertation","alternative_title":["ISTA Thesis"],"pubrep_id":"997","oa_version":"Published Version","file":[{"file_name":"IST-2018-997-v1+1_Thesis_chong_a.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":8719458,"file_id":"5046","relation":"main_file","date_updated":"2020-07-14T12:46:04Z","date_created":"2018-12-12T10:13:58Z","checksum":"8e163ae9e927401b9fa7c1b3e6a3631a"},{"file_name":"2018_Thesis_chong_source.pages","access_level":"closed","creator":"dernst","content_type":"application/octet-stream","file_size":47841940,"file_id":"6221","relation":"source_file","date_created":"2019-04-05T09:25:26Z","date_updated":"2020-07-14T12:46:04Z","checksum":"f7d7260029a5fbb5c982db61328ade52"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"324","title":"Synaptotagmins ensure speed and efficiency of inhibitory neurotransmitter release","status":"public","ddc":["571"],"month":"03","publication_identifier":{"issn":["2663-337X"]},"doi":"10.15479/AT:ISTA:th_997","degree_awarded":"PhD","supervisor":[{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804","first_name":"Peter M","last_name":"Jonas","full_name":"Jonas, Peter M"}],"language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"file_date_updated":"2020-07-14T12:46:04Z","publist_id":"7541","author":[{"full_name":"Chen, Chong","id":"3DFD581A-F248-11E8-B48F-1D18A9856A87","last_name":"Chen","first_name":"Chong"}],"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"1117"},{"id":"749","relation":"part_of_dissertation","status":"public"}]},"date_created":"2018-12-11T11:45:49Z","date_updated":"2023-09-27T12:26:03Z","year":"2018","publication_status":"published","department":[{"_id":"PeJo"}],"publisher":"Institute of Science and Technology Austria"},{"month":"08","doi":"10.1007/s10711-017-0291-4","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000437122700017"]},"oa":1,"quality_controlled":"1","isi":1,"project":[{"grant_number":"PP00P2_138948","_id":"25FA3206-B435-11E9-9278-68D0E5697425","name":"Embeddings in Higher Dimensions: Algorithms and Combinatorics"}],"file_date_updated":"2020-07-14T12:47:58Z","publist_id":"6925","author":[{"full_name":"Dotterrer, Dominic","last_name":"Dotterrer","first_name":"Dominic"},{"last_name":"Kaufman","first_name":"Tali","full_name":"Kaufman, Tali"},{"orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","first_name":"Uli","full_name":"Wagner, Uli"}],"related_material":{"record":[{"id":"1378","relation":"earlier_version","status":"public"}]},"date_updated":"2023-09-27T12:29:57Z","date_created":"2018-12-11T11:48:16Z","volume":195,"year":"2018","publication_status":"published","department":[{"_id":"UlWa"}],"publisher":"Springer","day":"01","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","scopus_import":"1","date_published":"2018-08-01T00:00:00Z","publication":"Geometriae Dedicata","citation":{"chicago":"Dotterrer, Dominic, Tali Kaufman, and Uli Wagner. “On Expansion and Topological Overlap.” Geometriae Dedicata. Springer, 2018. https://doi.org/10.1007/s10711-017-0291-4.","short":"D. Dotterrer, T. Kaufman, U. Wagner, Geometriae Dedicata 195 (2018) 307–317.","mla":"Dotterrer, Dominic, et al. “On Expansion and Topological Overlap.” Geometriae Dedicata, vol. 195, no. 1, Springer, 2018, pp. 307–317, doi:10.1007/s10711-017-0291-4.","ieee":"D. Dotterrer, T. Kaufman, and U. Wagner, “On expansion and topological overlap,” Geometriae Dedicata, vol. 195, no. 1. Springer, pp. 307–317, 2018.","apa":"Dotterrer, D., Kaufman, T., & Wagner, U. (2018). On expansion and topological overlap. Geometriae Dedicata. Springer. https://doi.org/10.1007/s10711-017-0291-4","ista":"Dotterrer D, Kaufman T, Wagner U. 2018. On expansion and topological overlap. Geometriae Dedicata. 195(1), 307–317.","ama":"Dotterrer D, Kaufman T, Wagner U. On expansion and topological overlap. Geometriae Dedicata. 2018;195(1):307–317. doi:10.1007/s10711-017-0291-4"},"page":"307–317","abstract":[{"lang":"eng","text":"We give a detailed and easily accessible proof of Gromov’s Topological Overlap Theorem. Let X be a finite simplicial complex or, more generally, a finite polyhedral cell complex of dimension d. Informally, the theorem states that if X has sufficiently strong higher-dimensional expansion properties (which generalize edge expansion of graphs and are defined in terms of cellular cochains of X) then X has the following topological overlap property: for every continuous map (Formula presented.) there exists a point (Formula presented.) that is contained in the images of a positive fraction (Formula presented.) of the d-cells of X. More generally, the conclusion holds if (Formula presented.) is replaced by any d-dimensional piecewise-linear manifold M, with a constant (Formula presented.) that depends only on d and on the expansion properties of X, but not on M."}],"issue":"1","type":"journal_article","pubrep_id":"912","file":[{"creator":"kschuh","content_type":"application/pdf","file_size":412486,"access_level":"open_access","file_name":"s10711-017-0291-4.pdf","checksum":"d2f70fc132156504aa4c626aa378a7ab","date_created":"2019-01-15T13:44:05Z","date_updated":"2020-07-14T12:47:58Z","file_id":"5835","relation":"main_file"}],"oa_version":"Published Version","_id":"742","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","ddc":["514","516"],"title":"On expansion and topological overlap","intvolume":" 195"},{"date_created":"2018-12-11T11:44:28Z","date_updated":"2023-10-10T13:11:29Z","volume":15,"author":[{"first_name":"Peter","last_name":"Nejjar","id":"4BF426E2-F248-11E8-B48F-1D18A9856A87","full_name":"Nejjar, Peter"}],"publication_status":"published","department":[{"_id":"LaEr"},{"_id":"JaMa"}],"publisher":"Instituto Nacional de Matematica Pura e Aplicada","year":"2018","file_date_updated":"2020-07-14T12:47:46Z","ec_funded":1,"language":[{"iso":"eng"}],"doi":"10.30757/ALEA.v15-49","isi":1,"quality_controlled":"1","project":[{"name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804"},{"name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020","grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425"}],"external_id":{"isi":["000460475800022"],"arxiv":["1705.08836"]},"oa":1,"month":"10","publication_identifier":{"issn":["1980-0436"]},"oa_version":"Published Version","file":[{"date_updated":"2020-07-14T12:47:46Z","date_created":"2019-02-14T09:44:10Z","checksum":"2ded46aa284a836a8cbb34133a64f1cb","file_id":"5981","relation":"main_file","creator":"kschuh","file_size":394851,"content_type":"application/pdf","file_name":"2018_ALEA_Nejjar.pdf","access_level":"open_access"}],"title":"Transition to shocks in TASEP and decoupling of last passage times","ddc":["510"],"status":"public","intvolume":" 15","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"70","abstract":[{"lang":"eng","text":"We consider the totally asymmetric simple exclusion process in a critical scaling parametrized by a≥0, which creates a shock in the particle density of order aT−1/3, T the observation time. When starting from step initial data, we provide bounds on the limiting law which in particular imply that in the double limit lima→∞limT→∞ one recovers the product limit law and the degeneration of the correlation length observed at shocks of order 1. This result is shown to apply to a general last-passage percolation model. We also obtain bounds on the two-point functions of several airy processes."}],"issue":"2","type":"journal_article","date_published":"2018-10-01T00:00:00Z","article_type":"original","page":"1311-1334","publication":"Latin American Journal of Probability and Mathematical Statistics","citation":{"ama":"Nejjar P. Transition to shocks in TASEP and decoupling of last passage times. Latin American Journal of Probability and Mathematical Statistics. 2018;15(2):1311-1334. doi:10.30757/ALEA.v15-49","ieee":"P. Nejjar, “Transition to shocks in TASEP and decoupling of last passage times,” Latin American Journal of Probability and Mathematical Statistics, vol. 15, no. 2. Instituto Nacional de Matematica Pura e Aplicada, pp. 1311–1334, 2018.","apa":"Nejjar, P. (2018). Transition to shocks in TASEP and decoupling of last passage times. Latin American Journal of Probability and Mathematical Statistics. Instituto Nacional de Matematica Pura e Aplicada. https://doi.org/10.30757/ALEA.v15-49","ista":"Nejjar P. 2018. Transition to shocks in TASEP and decoupling of last passage times. Latin American Journal of Probability and Mathematical Statistics. 15(2), 1311–1334.","short":"P. Nejjar, Latin American Journal of Probability and Mathematical Statistics 15 (2018) 1311–1334.","mla":"Nejjar, Peter. “Transition to Shocks in TASEP and Decoupling of Last Passage Times.” Latin American Journal of Probability and Mathematical Statistics, vol. 15, no. 2, Instituto Nacional de Matematica Pura e Aplicada, 2018, pp. 1311–34, doi:10.30757/ALEA.v15-49.","chicago":"Nejjar, Peter. “Transition to Shocks in TASEP and Decoupling of Last Passage Times.” Latin American Journal of Probability and Mathematical Statistics. Instituto Nacional de Matematica Pura e Aplicada, 2018. https://doi.org/10.30757/ALEA.v15-49."},"day":"01","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1"},{"type":"journal_article","issue":"15","abstract":[{"text":"Recent realization of a kinetically constrained chain of Rydberg atoms by Bernien et al., [Nature (London) 551, 579 (2017)] resulted in the observation of unusual revivals in the many-body quantum dynamics. In our previous work [C. J. Turner et al., Nat. Phys. 14, 745 (2018)], such dynamics was attributed to the existence of “quantum scarred” eigenstates in the many-body spectrum of the experimentally realized model. Here, we present a detailed study of the eigenstate properties of the same model. We find that the majority of the eigenstates exhibit anomalous thermalization: the observable expectation values converge to their Gibbs ensemble values, but parametrically slower compared to the predictions of the eigenstate thermalization hypothesis (ETH). Amidst the thermalizing spectrum, we identify nonergodic eigenstates that strongly violate the ETH, whose number grows polynomially with system size. Previously, the same eigenstates were identified via large overlaps with certain product states, and were used to explain the revivals observed in experiment. Here, we find that these eigenstates, in addition to highly atypical expectation values of local observables, also exhibit subthermal entanglement entropy that scales logarithmically with the system size. Moreover, we identify an additional class of quantum scarred eigenstates, and discuss their manifestations in the dynamics starting from initial product states. We use forward scattering approximation to describe the structure and physical properties of quantum scarred eigenstates. Finally, we discuss the stability of quantum scars to various perturbations. We observe that quantum scars remain robust when the introduced perturbation is compatible with the forward scattering approximation. In contrast, the perturbations which most efficiently destroy quantum scars also lead to the restoration of “canonical” thermalization.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"44","intvolume":" 98","status":"public","title":"Quantum scarred eigenstates in a Rydberg atom chain: Entanglement, breakdown of thermalization, and stability to perturbations","oa_version":"Preprint","scopus_import":"1","article_processing_charge":"No","day":"22","citation":{"ama":"Turner CJ, Michailidis A, Abanin DA, Serbyn M, Papić Z. Quantum scarred eigenstates in a Rydberg atom chain: Entanglement, breakdown of thermalization, and stability to perturbations. Physical Review B. 2018;98(15). doi:10.1103/PhysRevB.98.155134","apa":"Turner, C. J., Michailidis, A., Abanin, D. A., Serbyn, M., & Papić, Z. (2018). Quantum scarred eigenstates in a Rydberg atom chain: Entanglement, breakdown of thermalization, and stability to perturbations. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.98.155134","ieee":"C. J. Turner, A. Michailidis, D. A. Abanin, M. Serbyn, and Z. Papić, “Quantum scarred eigenstates in a Rydberg atom chain: Entanglement, breakdown of thermalization, and stability to perturbations,” Physical Review B, vol. 98, no. 15. American Physical Society, 2018.","ista":"Turner CJ, Michailidis A, Abanin DA, Serbyn M, Papić Z. 2018. Quantum scarred eigenstates in a Rydberg atom chain: Entanglement, breakdown of thermalization, and stability to perturbations. Physical Review B. 98(15), 155134.","short":"C.J. Turner, A. Michailidis, D.A. Abanin, M. Serbyn, Z. Papić, Physical Review B 98 (2018).","mla":"Turner, C. J., et al. “Quantum Scarred Eigenstates in a Rydberg Atom Chain: Entanglement, Breakdown of Thermalization, and Stability to Perturbations.” Physical Review B, vol. 98, no. 15, 155134, American Physical Society, 2018, doi:10.1103/PhysRevB.98.155134.","chicago":"Turner, C J, Alexios Michailidis, D A Abanin, Maksym Serbyn, and Z Papić. “Quantum Scarred Eigenstates in a Rydberg Atom Chain: Entanglement, Breakdown of Thermalization, and Stability to Perturbations.” Physical Review B. American Physical Society, 2018. https://doi.org/10.1103/PhysRevB.98.155134."},"publication":"Physical Review B","date_published":"2018-10-22T00:00:00Z","article_number":"155134","publist_id":"8010","year":"2018","department":[{"_id":"MaSe"}],"publisher":"American Physical Society","publication_status":"published","author":[{"full_name":"Turner, C J","first_name":"C J","last_name":"Turner"},{"full_name":"Michailidis, Alexios","first_name":"Alexios","last_name":"Michailidis","id":"36EBAD38-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8443-1064"},{"full_name":"Abanin, D A","last_name":"Abanin","first_name":"D A"},{"full_name":"Serbyn, Maksym","last_name":"Serbyn","first_name":"Maksym","orcid":"0000-0002-2399-5827","id":"47809E7E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Z","last_name":"Papić","full_name":"Papić, Z"}],"volume":98,"date_created":"2018-12-11T11:44:19Z","date_updated":"2023-10-10T13:28:49Z","month":"10","external_id":{"arxiv":["1806.10933"],"isi":["000447919100001"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1806.10933","open_access":"1"}],"quality_controlled":"1","isi":1,"doi":"10.1103/PhysRevB.98.155134","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"ScienComp"}]},{"volume":120,"date_created":"2018-12-11T11:45:51Z","date_updated":"2023-10-10T13:27:44Z","author":[{"full_name":"Choueiri, George H","id":"448BD5BC-F248-11E8-B48F-1D18A9856A87","last_name":"Choueiri","first_name":"George H"},{"full_name":"Lopez Alonso, Jose M","first_name":"Jose M","last_name":"Lopez Alonso","id":"40770848-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0384-2022"},{"orcid":"0000-0003-2057-2754","id":"3A374330-F248-11E8-B48F-1D18A9856A87","last_name":"Hof","first_name":"Björn","full_name":"Hof, Björn"}],"department":[{"_id":"BjHo"}],"publisher":"American Physical Society","publication_status":"published","acknowledgement":"The authors thank Philipp Maier and the IST Austria workshop for their dedicated technical support.","year":"2018","ec_funded":1,"publist_id":"7537","article_number":"124501","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"SSU"}],"doi":"10.1103/PhysRevLett.120.124501","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"},{"grant_number":"306589","_id":"25152F3A-B435-11E9-9278-68D0E5697425","name":"Decoding the complexity of turbulence at its origin","call_identifier":"FP7"}],"quality_controlled":"1","isi":1,"external_id":{"isi":["000427804000005"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1703.06271"}],"oa":1,"month":"03","oa_version":"Preprint","intvolume":" 120","title":"Exceeding the asymptotic limit of polymer drag reduction","status":"public","_id":"328","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"12","abstract":[{"lang":"eng","text":"The drag of turbulent flows can be drastically decreased by adding small amounts of high molecular weight polymers. While drag reduction initially increases with polymer concentration, it eventually saturates to what is known as the maximum drag reduction (MDR) asymptote; this asymptote is generally attributed to the dynamics being reduced to a marginal yet persistent state of subdued turbulent motion. Contrary to this accepted view, we show that, for an appropriate choice of parameters, polymers can reduce the drag beyond the suggested asymptotic limit, eliminating turbulence and giving way to laminar flow. At higher polymer concentrations, however, the laminar state becomes unstable, resulting in a fluctuating flow with the characteristic drag of the MDR asymptote. Our findings indicate that the asymptotic state is hence dynamically disconnected from ordinary turbulence. © 2018 American Physical Society."}],"type":"journal_article","date_published":"2018-03-19T00:00:00Z","citation":{"chicago":"Choueiri, George H, Jose M Lopez Alonso, and Björn Hof. “Exceeding the Asymptotic Limit of Polymer Drag Reduction.” Physical Review Letters. American Physical Society, 2018. https://doi.org/10.1103/PhysRevLett.120.124501.","mla":"Choueiri, George H., et al. “Exceeding the Asymptotic Limit of Polymer Drag Reduction.” Physical Review Letters, vol. 120, no. 12, 124501, American Physical Society, 2018, doi:10.1103/PhysRevLett.120.124501.","short":"G.H. Choueiri, J.M. Lopez Alonso, B. Hof, Physical Review Letters 120 (2018).","ista":"Choueiri GH, Lopez Alonso JM, Hof B. 2018. Exceeding the asymptotic limit of polymer drag reduction. Physical Review Letters. 120(12), 124501.","apa":"Choueiri, G. H., Lopez Alonso, J. M., & Hof, B. (2018). Exceeding the asymptotic limit of polymer drag reduction. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.120.124501","ieee":"G. H. Choueiri, J. M. Lopez Alonso, and B. Hof, “Exceeding the asymptotic limit of polymer drag reduction,” Physical Review Letters, vol. 120, no. 12. American Physical Society, 2018.","ama":"Choueiri GH, Lopez Alonso JM, Hof B. Exceeding the asymptotic limit of polymer drag reduction. Physical Review Letters. 2018;120(12). doi:10.1103/PhysRevLett.120.124501"},"publication":"Physical Review Letters","article_processing_charge":"No","day":"19","scopus_import":"1"},{"year":"2018","publication_status":"published","department":[{"_id":"BjHo"}],"publisher":"American Physical Society","author":[{"full_name":"Suri, Balachandra","first_name":"Balachandra","last_name":"Suri","id":"47A5E706-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Tithof, Jeffrey","last_name":"Tithof","first_name":"Jeffrey"},{"full_name":"Grigoriev, Roman","first_name":"Roman","last_name":"Grigoriev"},{"full_name":"Schatz, Michael","first_name":"Michael","last_name":"Schatz"}],"date_created":"2018-12-11T11:44:49Z","date_updated":"2023-10-10T13:29:10Z","volume":98,"month":"08","external_id":{"isi":["000441466800010"],"arxiv":["1808.02088"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1808.02088","open_access":"1"}],"quality_controlled":"1","isi":1,"doi":"10.1103/PhysRevE.98.023105","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"lang":"eng","text":"Recent studies suggest that unstable, nonchaotic solutions of the Navier-Stokes equation may provide deep insights into fluid turbulence. In this article, we present a combined experimental and numerical study exploring the dynamical role of unstable equilibrium solutions and their invariant manifolds in a weakly turbulent, electromagnetically driven, shallow fluid layer. Identifying instants when turbulent evolution slows down, we compute 31 unstable equilibria of a realistic two-dimensional model of the flow. We establish the dynamical relevance of these unstable equilibria by showing that they are closely visited by the turbulent flow. We also establish the dynamical relevance of unstable manifolds by verifying that they are shadowed by turbulent trajectories departing from the neighborhoods of unstable equilibria over large distances in state space."}],"issue":"2","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"136","title":"Unstable equilibria and invariant manifolds in quasi-two-dimensional Kolmogorov-like flow","status":"public","intvolume":" 98","oa_version":"Submitted Version","scopus_import":"1","day":"13","article_processing_charge":"No","publication":"Physical Review E","citation":{"ama":"Suri B, Tithof J, Grigoriev R, Schatz M. Unstable equilibria and invariant manifolds in quasi-two-dimensional Kolmogorov-like flow. Physical Review E. 2018;98(2). doi:10.1103/PhysRevE.98.023105","ieee":"B. Suri, J. Tithof, R. Grigoriev, and M. Schatz, “Unstable equilibria and invariant manifolds in quasi-two-dimensional Kolmogorov-like flow,” Physical Review E, vol. 98, no. 2. American Physical Society, 2018.","apa":"Suri, B., Tithof, J., Grigoriev, R., & Schatz, M. (2018). Unstable equilibria and invariant manifolds in quasi-two-dimensional Kolmogorov-like flow. Physical Review E. American Physical Society. https://doi.org/10.1103/PhysRevE.98.023105","ista":"Suri B, Tithof J, Grigoriev R, Schatz M. 2018. Unstable equilibria and invariant manifolds in quasi-two-dimensional Kolmogorov-like flow. Physical Review E. 98(2).","short":"B. Suri, J. Tithof, R. Grigoriev, M. Schatz, Physical Review E 98 (2018).","mla":"Suri, Balachandra, et al. “Unstable Equilibria and Invariant Manifolds in Quasi-Two-Dimensional Kolmogorov-like Flow.” Physical Review E, vol. 98, no. 2, American Physical Society, 2018, doi:10.1103/PhysRevE.98.023105.","chicago":"Suri, Balachandra, Jeffrey Tithof, Roman Grigoriev, and Michael Schatz. “Unstable Equilibria and Invariant Manifolds in Quasi-Two-Dimensional Kolmogorov-like Flow.” Physical Review E. American Physical Society, 2018. https://doi.org/10.1103/PhysRevE.98.023105."},"date_published":"2018-08-13T00:00:00Z"},{"intvolume":" 55","title":"A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"691","oa_version":"Submitted Version","type":"journal_article","issue":"1","abstract":[{"text":"Background: Transport protein particle (TRAPP) is a multisubunit complex that regulates membrane trafficking through the Golgi apparatus. The clinical phenotype associated with mutations in various TRAPP subunits has allowed elucidation of their functions in specific tissues. The role of some subunits in human disease, however, has not been fully established, and their functions remain uncertain.\r\n\r\nObjective: We aimed to expand the range of neurodevelopmental disorders associated with mutations in TRAPP subunits by exome sequencing of consanguineous families.\r\n\r\nMethods: Linkage and homozygosity mapping and candidate gene analysis were used to identify homozygous mutations in families. Patient fibroblasts were used to study splicing defect and zebrafish to model the disease.\r\n\r\nResults: We identified six individuals from three unrelated families with a founder homozygous splice mutation in TRAPPC6B, encoding a core subunit of the complex TRAPP I. Patients manifested a neurodevelopmental disorder characterised by microcephaly, epilepsy and autistic features, and showed splicing defect. Zebrafish trappc6b morphants replicated the human phenotype, displaying decreased head size and neuronal hyperexcitability, leading to a lower seizure threshold.\r\n\r\nConclusion: This study provides clinical and functional evidence of the role of TRAPPC6B in brain development and function.","lang":"eng"}],"page":"48 - 54","article_type":"original","citation":{"ista":"Marin Valencia I, Novarino G, Johansen A, Rosti B, Issa M, Musaev D, Bhat G, Scott E, Silhavy J, Stanley V, Rosti R, Gleeson J, Imam F, Zaki M, Gleeson J. 2018. A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features. Journal of Medical Genetics. 55(1), 48–54.","apa":"Marin Valencia, I., Novarino, G., Johansen, A., Rosti, B., Issa, M., Musaev, D., … Gleeson, J. (2018). A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features. Journal of Medical Genetics. BMJ Publishing Group. https://doi.org/10.1136/jmedgenet-2017-104627","ieee":"I. Marin Valencia et al., “A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features,” Journal of Medical Genetics, vol. 55, no. 1. BMJ Publishing Group, pp. 48–54, 2018.","ama":"Marin Valencia I, Novarino G, Johansen A, et al. A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features. Journal of Medical Genetics. 2018;55(1):48-54. doi:10.1136/jmedgenet-2017-104627","chicago":"Marin Valencia, Isaac, Gaia Novarino, Anide Johansen, Başak Rosti, Mahmoud Issa, Damir Musaev, Gifty Bhat, et al. “A Homozygous Founder Mutation in TRAPPC6B Associates with a Neurodevelopmental Disorder Characterised by Microcephaly Epilepsy and Autistic Features.” Journal of Medical Genetics. BMJ Publishing Group, 2018. https://doi.org/10.1136/jmedgenet-2017-104627.","mla":"Marin Valencia, Isaac, et al. “A Homozygous Founder Mutation in TRAPPC6B Associates with a Neurodevelopmental Disorder Characterised by Microcephaly Epilepsy and Autistic Features.” Journal of Medical Genetics, vol. 55, no. 1, BMJ Publishing Group, 2018, pp. 48–54, doi:10.1136/jmedgenet-2017-104627.","short":"I. Marin Valencia, G. Novarino, A. Johansen, B. Rosti, M. Issa, D. Musaev, G. Bhat, E. Scott, J. Silhavy, V. Stanley, R. Rosti, J. Gleeson, F. Imam, M. Zaki, J. Gleeson, Journal of Medical Genetics 55 (2018) 48–54."},"publication":"Journal of Medical Genetics","date_published":"2018-01-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01","department":[{"_id":"GaNo"}],"publisher":"BMJ Publishing Group","publication_status":"published","pmid":1,"year":"2018","volume":55,"date_updated":"2023-10-16T09:55:43Z","date_created":"2018-12-11T11:47:57Z","author":[{"first_name":"Isaac","last_name":"Marin Valencia","full_name":"Marin Valencia, Isaac"},{"full_name":"Novarino, Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7673-7178","first_name":"Gaia","last_name":"Novarino"},{"full_name":"Johansen, Anide","last_name":"Johansen","first_name":"Anide"},{"first_name":"Başak","last_name":"Rosti","full_name":"Rosti, Başak"},{"full_name":"Issa, Mahmoud","last_name":"Issa","first_name":"Mahmoud"},{"last_name":"Musaev","first_name":"Damir","full_name":"Musaev, Damir"},{"full_name":"Bhat, Gifty","first_name":"Gifty","last_name":"Bhat"},{"first_name":"Eric","last_name":"Scott","full_name":"Scott, Eric"},{"first_name":"Jennifer","last_name":"Silhavy","full_name":"Silhavy, Jennifer"},{"full_name":"Stanley, Valentina","first_name":"Valentina","last_name":"Stanley"},{"full_name":"Rosti, Rasim","first_name":"Rasim","last_name":"Rosti"},{"first_name":"Jeremy","last_name":"Gleeson","full_name":"Gleeson, Jeremy"},{"full_name":"Imam, Farhad","first_name":"Farhad","last_name":"Imam"},{"full_name":"Zaki, Maha","last_name":"Zaki","first_name":"Maha"},{"first_name":"Joseph","last_name":"Gleeson","full_name":"Gleeson, Joseph"}],"publist_id":"7016","project":[{"name":"Probing development and reversibility of autism spectrum disorders","_id":"254BA948-B435-11E9-9278-68D0E5697425","grant_number":"401299"}],"isi":1,"quality_controlled":"1","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6056005/","open_access":"1"}],"external_id":{"pmid":["28626029"],"isi":["000418199800007"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1136/jmedgenet-2017-104627","publication_identifier":{"issn":["0022-2593"]},"month":"01"},{"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1802.03305","open_access":"1"}],"external_id":{"arxiv":["1802.03305"]},"language":[{"iso":"eng"}],"doi":"10.14232/actasm-018-753-y","publication_identifier":{"issn":["0001-6969"],"eissn":["2064-8316"]},"month":"06","department":[{"_id":"LaEr"}],"publisher":"Springer Nature","publication_status":"published","year":"2018","acknowledgement":"The author was supported by the ISTFELLOW program of the Institute of Science and Technol- ogy Austria (project code IC1027FELL01) and partially supported by the Hungarian National Research, Development and Innovation Office, NKFIH (grant no. K124152).","volume":84,"date_updated":"2023-10-16T10:29:22Z","date_created":"2018-12-11T11:45:36Z","author":[{"last_name":"Virosztek","first_name":"Daniel","orcid":"0000-0003-1109-5511","id":"48DB45DA-F248-11E8-B48F-1D18A9856A87","full_name":"Virosztek, Daniel"}],"ec_funded":1,"publist_id":"7615","page":"65 - 80","article_type":"original","citation":{"ista":"Virosztek D. 2018. Maps on probability measures preserving certain distances - a survey and some new results. Acta Scientiarum Mathematicarum. 84(1–2), 65–80.","ieee":"D. Virosztek, “Maps on probability measures preserving certain distances - a survey and some new results,” Acta Scientiarum Mathematicarum, vol. 84, no. 1–2. Springer Nature, pp. 65–80, 2018.","apa":"Virosztek, D. (2018). Maps on probability measures preserving certain distances - a survey and some new results. Acta Scientiarum Mathematicarum. Springer Nature. https://doi.org/10.14232/actasm-018-753-y","ama":"Virosztek D. Maps on probability measures preserving certain distances - a survey and some new results. Acta Scientiarum Mathematicarum. 2018;84(1-2):65-80. doi:10.14232/actasm-018-753-y","chicago":"Virosztek, Daniel. “Maps on Probability Measures Preserving Certain Distances - a Survey and Some New Results.” Acta Scientiarum Mathematicarum. Springer Nature, 2018. https://doi.org/10.14232/actasm-018-753-y.","mla":"Virosztek, Daniel. “Maps on Probability Measures Preserving Certain Distances - a Survey and Some New Results.” Acta Scientiarum Mathematicarum, vol. 84, no. 1–2, Springer Nature, 2018, pp. 65–80, doi:10.14232/actasm-018-753-y.","short":"D. Virosztek, Acta Scientiarum Mathematicarum 84 (2018) 65–80."},"publication":"Acta Scientiarum Mathematicarum","date_published":"2018-06-04T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"04","intvolume":" 84","status":"public","title":"Maps on probability measures preserving certain distances - a survey and some new results","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"284","oa_version":"Preprint","type":"journal_article","issue":"1-2","abstract":[{"lang":"eng","text":"Borel probability measures living on metric spaces are fundamental\r\nmathematical objects. There are several meaningful distance functions that make the collection of the probability measures living on a certain space a metric space. We are interested in the description of the structure of the isometries of such metric spaces. We overview some of the recent results of the topic and we also provide some new ones concerning the Wasserstein distance. More specifically, we consider the space of all Borel probability measures on the unit sphere of a Euclidean space endowed with the Wasserstein metric W_p for arbitrary p >= 1, and we show that the action of a Wasserstein isometry on the set of Dirac measures is induced by an isometry of the underlying unit sphere."}]},{"language":[{"iso":"eng"}],"doi":"10.5802/jep.64","project":[{"name":"Analysis of quantum many-body systems","call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227"},{"name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","call_identifier":"FWF","_id":"25C878CE-B435-11E9-9278-68D0E5697425","grant_number":"P27533_N27"}],"quality_controlled":"1","tmp":{"short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"oa":1,"external_id":{"arxiv":["1705.10676"]},"publication_identifier":{"issn":["2429-7100"],"eissn":["2270-518X"]},"month":"07","volume":5,"date_created":"2018-12-11T11:45:03Z","date_updated":"2023-10-17T08:05:28Z","author":[{"full_name":"Lewi, Mathieu","last_name":"Lewi","first_name":"Mathieu"},{"first_name":"Élliott","last_name":"Lieb","full_name":"Lieb, Élliott"},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","first_name":"Robert","last_name":"Seiringer","full_name":"Seiringer, Robert"}],"publisher":"Ecole Polytechnique","department":[{"_id":"RoSe"}],"publication_status":"published","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European\r\nUnion’s Horizon 2020 research and innovation programme (grant agreement 694227 for R.S. and MDFT 725528 for M.L.). Financial support by the Austrian Science Fund (FWF), project No P 27533-N27 (R.S.) and by the US National Science Foundation, grant No PHY12-1265118 (E.H.L.) are gratefully acknowledged.","year":"2018","license":"https://creativecommons.org/licenses/by-nd/4.0/","publist_id":"7741","ec_funded":1,"file_date_updated":"2020-07-14T12:45:16Z","date_published":"2018-07-01T00:00:00Z","page":"79 - 116","article_type":"original","citation":{"chicago":"Lewi, Mathieu, Élliott Lieb, and Robert Seiringer. “Statistical Mechanics of the Uniform Electron Gas.” Journal de l’Ecole Polytechnique - Mathematiques. Ecole Polytechnique, 2018. https://doi.org/10.5802/jep.64.","mla":"Lewi, Mathieu, et al. “Statistical Mechanics of the Uniform Electron Gas.” Journal de l’Ecole Polytechnique - Mathematiques, vol. 5, Ecole Polytechnique, 2018, pp. 79–116, doi:10.5802/jep.64.","short":"M. Lewi, É. Lieb, R. Seiringer, Journal de l’Ecole Polytechnique - Mathematiques 5 (2018) 79–116.","ista":"Lewi M, Lieb É, Seiringer R. 2018. Statistical mechanics of the uniform electron gas. Journal de l’Ecole Polytechnique - Mathematiques. 5, 79–116.","apa":"Lewi, M., Lieb, É., & Seiringer, R. (2018). Statistical mechanics of the uniform electron gas. Journal de l’Ecole Polytechnique - Mathematiques. Ecole Polytechnique. https://doi.org/10.5802/jep.64","ieee":"M. Lewi, É. Lieb, and R. Seiringer, “Statistical mechanics of the uniform electron gas,” Journal de l’Ecole Polytechnique - Mathematiques, vol. 5. Ecole Polytechnique, pp. 79–116, 2018.","ama":"Lewi M, Lieb É, Seiringer R. Statistical mechanics of the uniform electron gas. Journal de l’Ecole Polytechnique - Mathematiques. 2018;5:79-116. doi:10.5802/jep.64"},"publication":"Journal de l'Ecole Polytechnique - Mathematiques","article_processing_charge":"No","has_accepted_license":"1","day":"01","scopus_import":"1","file":[{"creator":"dernst","file_size":843938,"content_type":"application/pdf","file_name":"2018_JournaldeLecoleMath_Lewi.pdf","access_level":"open_access","date_created":"2018-12-17T16:38:18Z","date_updated":"2020-07-14T12:45:16Z","checksum":"1ba7cccdf3900f42c4f715ae75d6813c","file_id":"5726","relation":"main_file"}],"oa_version":"Published Version","intvolume":" 5","status":"public","ddc":["510"],"title":"Statistical mechanics of the uniform electron gas","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"180","abstract":[{"text":"In this paper we define and study the classical Uniform Electron Gas (UEG), a system of infinitely many electrons whose density is constant everywhere in space. The UEG is defined differently from Jellium, which has a positive constant background but no constraint on the density. We prove that the UEG arises in Density Functional Theory in the limit of a slowly varying density, minimizing the indirect Coulomb energy. We also construct the quantum UEG and compare it to the classical UEG at low density.","lang":"eng"}],"type":"journal_article"},{"department":[{"_id":"RySh"},{"_id":"EM-Fac"}],"publisher":"SAGE Publications","publication_status":"published","pmid":1,"year":"2018","volume":66,"date_created":"2018-12-11T11:44:57Z","date_updated":"2023-10-17T08:42:24Z","author":[{"full_name":"Reipert, Siegfried","first_name":"Siegfried","last_name":"Reipert"},{"full_name":"Goldammer, Helmuth","first_name":"Helmuth","last_name":"Goldammer"},{"full_name":"Richardson, Christine","first_name":"Christine","last_name":"Richardson"},{"full_name":"Goldberg, Martin","last_name":"Goldberg","first_name":"Martin"},{"first_name":"Timothy","last_name":"Hawkins","full_name":"Hawkins, Timothy"},{"full_name":"Hollergschwandtner, Elena","last_name":"Hollergschwandtner","first_name":"Elena","id":"3C054040-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-9735-5315","id":"3F99E422-F248-11E8-B48F-1D18A9856A87","last_name":"Kaufmann","first_name":"Walter","full_name":"Kaufmann, Walter"},{"last_name":"Antreich","first_name":"Sebastian","full_name":"Antreich, Sebastian"},{"full_name":"Stierhof, York","first_name":"York","last_name":"Stierhof"}],"isi":1,"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1369/0022155418786698"}],"external_id":{"pmid":["29969056"],"isi":["000452277700005"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1369/0022155418786698","publication_identifier":{"issn":["0022-1554"]},"month":"12","intvolume":" 66","status":"public","title":"Agitation modules: Flexible means to accelerate automated freeze substitution","_id":"163","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","type":"journal_article","issue":"12","abstract":[{"text":"For ultrafast fixation of biological samples to avoid artifacts, high-pressure freezing (HPF) followed by freeze substitution (FS) is preferred over chemical fixation at room temperature. After HPF, samples are maintained at low temperature during dehydration and fixation, while avoiding damaging recrystallization. This is a notoriously slow process. McDonald and Webb demonstrated, in 2011, that sample agitation during FS dramatically reduces the necessary time. Then, in 2015, we (H.G. and S.R.) introduced an agitation module into the cryochamber of an automated FS unit and demonstrated that the preparation of algae could be shortened from days to a couple of hours. We argued that variability in the processing, reproducibility, and safety issues are better addressed using automated FS units. For dissemination, we started low-cost manufacturing of agitation modules for two of the most widely used FS units, the Automatic Freeze Substitution Systems, AFS(1) and AFS2, from Leica Microsystems, using three dimensional (3D)-printing of the major components. To test them, several labs independently used the modules on a wide variety of specimens that had previously been processed by manual agitation, or without agitation. We demonstrate that automated processing with sample agitation saves time, increases flexibility with respect to sample requirements and protocols, and produces data of at least as good quality as other approaches.","lang":"eng"}],"page":"903-921","article_type":"original","citation":{"ista":"Reipert S, Goldammer H, Richardson C, Goldberg M, Hawkins T, Saeckl E, Kaufmann W, Antreich S, Stierhof Y. 2018. Agitation modules: Flexible means to accelerate automated freeze substitution. Journal of Histochemistry and Cytochemistry. 66(12), 903–921.","apa":"Reipert, S., Goldammer, H., Richardson, C., Goldberg, M., Hawkins, T., Saeckl, E., … Stierhof, Y. (2018). Agitation modules: Flexible means to accelerate automated freeze substitution. Journal of Histochemistry and Cytochemistry. SAGE Publications. https://doi.org/10.1369/0022155418786698","ieee":"S. Reipert et al., “Agitation modules: Flexible means to accelerate automated freeze substitution,” Journal of Histochemistry and Cytochemistry, vol. 66, no. 12. SAGE Publications, pp. 903–921, 2018.","ama":"Reipert S, Goldammer H, Richardson C, et al. Agitation modules: Flexible means to accelerate automated freeze substitution. Journal of Histochemistry and Cytochemistry. 2018;66(12):903-921. doi:10.1369/0022155418786698","chicago":"Reipert, Siegfried, Helmuth Goldammer, Christine Richardson, Martin Goldberg, Timothy Hawkins, Elena Saeckl, Walter Kaufmann, Sebastian Antreich, and York Stierhof. “Agitation Modules: Flexible Means to Accelerate Automated Freeze Substitution.” Journal of Histochemistry and Cytochemistry. SAGE Publications, 2018. https://doi.org/10.1369/0022155418786698.","mla":"Reipert, Siegfried, et al. “Agitation Modules: Flexible Means to Accelerate Automated Freeze Substitution.” Journal of Histochemistry and Cytochemistry, vol. 66, no. 12, SAGE Publications, 2018, pp. 903–21, doi:10.1369/0022155418786698.","short":"S. Reipert, H. Goldammer, C. Richardson, M. Goldberg, T. Hawkins, E. Saeckl, W. Kaufmann, S. Antreich, Y. Stierhof, Journal of Histochemistry and Cytochemistry 66 (2018) 903–921."},"publication":"Journal of Histochemistry and Cytochemistry","date_published":"2018-12-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01"},{"month":"02","project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"quality_controlled":"1","isi":1,"oa":1,"external_id":{"isi":["000683379204058"],"arxiv":["1806.07259"]},"main_file_link":[{"url":"https://arxiv.org/abs/1806.07259","open_access":"1"}],"language":[{"iso":"eng"}],"conference":{"name":"ICML: International Conference on Machine Learning","location":"Stockholm, Sweden","start_date":"2018-07-10","end_date":"2018-07-15"},"ec_funded":1,"publisher":"ML Research Press","department":[{"_id":"ChLa"}],"publication_status":"published","year":"2018","volume":80,"date_updated":"2023-10-17T09:50:53Z","date_created":"2019-02-14T15:21:07Z","related_material":{"link":[{"relation":"press_release","description":"News on IST Homepage","url":"https://ist.ac.at/en/news/first-machine-learning-method-capable-of-accurate-extrapolation/"}]},"author":[{"full_name":"Sahoo, Subham","first_name":"Subham","last_name":"Sahoo"},{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert"},{"full_name":"Martius, Georg S","id":"3A276B68-F248-11E8-B48F-1D18A9856A87","last_name":"Martius","first_name":"Georg S"}],"scopus_import":"1","article_processing_charge":"No","day":"01","page":"4442-4450","citation":{"chicago":"Sahoo, Subham, Christoph Lampert, and Georg S Martius. “Learning Equations for Extrapolation and Control.” In Proceedings of the 35th International Conference on Machine Learning, 80:4442–50. ML Research Press, 2018.","short":"S. Sahoo, C. Lampert, G.S. Martius, in:, Proceedings of the 35th International Conference on Machine Learning, ML Research Press, 2018, pp. 4442–4450.","mla":"Sahoo, Subham, et al. “Learning Equations for Extrapolation and Control.” Proceedings of the 35th International Conference on Machine Learning, vol. 80, ML Research Press, 2018, pp. 4442–50.","apa":"Sahoo, S., Lampert, C., & Martius, G. S. (2018). Learning equations for extrapolation and control. In Proceedings of the 35th International Conference on Machine Learning (Vol. 80, pp. 4442–4450). Stockholm, Sweden: ML Research Press.","ieee":"S. Sahoo, C. Lampert, and G. S. Martius, “Learning equations for extrapolation and control,” in Proceedings of the 35th International Conference on Machine Learning, Stockholm, Sweden, 2018, vol. 80, pp. 4442–4450.","ista":"Sahoo S, Lampert C, Martius GS. 2018. Learning equations for extrapolation and control. Proceedings of the 35th International Conference on Machine Learning. ICML: International Conference on Machine Learning vol. 80, 4442–4450.","ama":"Sahoo S, Lampert C, Martius GS. Learning equations for extrapolation and control. In: Proceedings of the 35th International Conference on Machine Learning. Vol 80. ML Research Press; 2018:4442-4450."},"publication":"Proceedings of the 35th International Conference on Machine Learning","date_published":"2018-02-01T00:00:00Z","type":"conference","abstract":[{"lang":"eng","text":"We present an approach to identify concise equations from data using a shallow neural network approach. In contrast to ordinary black-box regression, this approach allows understanding functional relations and generalizing them from observed data to unseen parts of the parameter space. We show how to extend the class of learnable equations for a recently proposed equation learning network to include divisions, and we improve the learning and model selection strategy to be useful for challenging real-world data. For systems governed by analytical expressions, our method can in many cases identify the true underlying equation and extrapolate to unseen domains. We demonstrate its effectiveness by experiments on a cart-pendulum system, where only 2 random rollouts are required to learn the forward dynamics and successfully achieve the swing-up task."}],"intvolume":" 80","status":"public","title":"Learning equations for extrapolation and control","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6012","oa_version":"Preprint"},{"ec_funded":1,"date_updated":"2023-10-17T09:51:13Z","date_created":"2019-02-14T14:51:57Z","volume":80,"author":[{"first_name":"Ilja","last_name":"Kuzborskij","full_name":"Kuzborskij, Ilja"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert","full_name":"Lampert, Christoph"}],"publication_status":"published","department":[{"_id":"ChLa"}],"publisher":"ML Research Press","year":"2018","month":"02","language":[{"iso":"eng"}],"conference":{"end_date":"2018-07-15","start_date":"2018-07-10","location":"Stockholm, Sweden","name":"ICML: International Conference on Machine Learning"},"quality_controlled":"1","isi":1,"project":[{"name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7","grant_number":"308036","_id":"2532554C-B435-11E9-9278-68D0E5697425"}],"external_id":{"isi":["000683379202095"],"arxiv":["1703.01678"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1703.01678"}],"oa":1,"abstract":[{"lang":"eng","text":"We establish a data-dependent notion of algorithmic stability for Stochastic Gradient Descent (SGD), and employ it to develop novel generalization bounds. This is in contrast to previous distribution-free algorithmic stability results for SGD which depend on the worst-case constants. By virtue of the data-dependent argument, our bounds provide new insights into learning with SGD on convex and non-convex problems. In the convex case, we show that the bound on the generalization error depends on the risk at the initialization point. In the non-convex case, we prove that the expected curvature of the objective function around the initialization point has crucial influence on the generalization error. In both cases, our results suggest a simple data-driven strategy to stabilize SGD by pre-screening its initialization. As a corollary, our results allow us to show optimistic generalization bounds that exhibit fast convergence rates for SGD subject to a vanishing empirical risk and low noise of stochastic gradient. "}],"type":"conference","oa_version":"Preprint","status":"public","title":"Data-dependent stability of stochastic gradient descent","intvolume":" 80","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6011","day":"01","article_processing_charge":"No","scopus_import":"1","date_published":"2018-02-01T00:00:00Z","page":"2815-2824","publication":"Proceedings of the 35 th International Conference on Machine Learning","citation":{"mla":"Kuzborskij, Ilja, and Christoph Lampert. “Data-Dependent Stability of Stochastic Gradient Descent.” Proceedings of the 35 Th International Conference on Machine Learning, vol. 80, ML Research Press, 2018, pp. 2815–24.","short":"I. Kuzborskij, C. Lampert, in:, Proceedings of the 35 Th International Conference on Machine Learning, ML Research Press, 2018, pp. 2815–2824.","chicago":"Kuzborskij, Ilja, and Christoph Lampert. “Data-Dependent Stability of Stochastic Gradient Descent.” In Proceedings of the 35 Th International Conference on Machine Learning, 80:2815–24. ML Research Press, 2018.","ama":"Kuzborskij I, Lampert C. Data-dependent stability of stochastic gradient descent. In: Proceedings of the 35 Th International Conference on Machine Learning. Vol 80. ML Research Press; 2018:2815-2824.","ista":"Kuzborskij I, Lampert C. 2018. Data-dependent stability of stochastic gradient descent. Proceedings of the 35 th International Conference on Machine Learning. ICML: International Conference on Machine Learning vol. 80, 2815–2824.","ieee":"I. Kuzborskij and C. Lampert, “Data-dependent stability of stochastic gradient descent,” in Proceedings of the 35 th International Conference on Machine Learning, Stockholm, Sweden, 2018, vol. 80, pp. 2815–2824.","apa":"Kuzborskij, I., & Lampert, C. (2018). Data-dependent stability of stochastic gradient descent. In Proceedings of the 35 th International Conference on Machine Learning (Vol. 80, pp. 2815–2824). Stockholm, Sweden: ML Research Press."}},{"date_published":"2018-05-09T00:00:00Z","doi":"10.5281/zenodo.1244154","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"citation":{"short":"P. Danowski, An Austrian Proposal for the Classification of Open Access Tuples (COAT) - Distinguish Different Open Access Types beyond Colors, 2018.","mla":"Danowski, Patrick. An Austrian Proposal for the Classification of Open Access Tuples (COAT) - Distinguish Different Open Access Types beyond Colors. 2018, doi:10.5281/zenodo.1244154.","chicago":"Danowski, Patrick. An Austrian Proposal for the Classification of Open Access Tuples (COAT) - Distinguish Different Open Access Types beyond Colors, 2018. https://doi.org/10.5281/zenodo.1244154.","ama":"Danowski P. An Austrian Proposal for the Classification of Open Access Tuples (COAT) - Distinguish Different Open Access Types beyond Colors.; 2018. doi:10.5281/zenodo.1244154","ieee":"P. Danowski, An Austrian proposal for the Classification of Open Access Tuples (COAT) - Distinguish different Open Access types beyond colors. 2018.","apa":"Danowski, P. (2018). An Austrian proposal for the Classification of Open Access Tuples (COAT) - Distinguish different Open Access types beyond colors. https://doi.org/10.5281/zenodo.1244154","ista":"Danowski P. 2018. An Austrian proposal for the Classification of Open Access Tuples (COAT) - Distinguish different Open Access types beyond colors, 5p."},"page":"5","day":"09","month":"05","has_accepted_license":"1","article_processing_charge":"No","scopus_import":1,"author":[{"full_name":"Danowski, Patrick","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6026-4409","first_name":"Patrick","last_name":"Danowski"}],"related_material":{"record":[{"id":"6657","status":"public","relation":"later_version"}]},"date_updated":"2023-10-17T11:33:57Z","date_created":"2018-12-17T10:28:26Z","file":[{"file_size":202798,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2018_WorkingPaper_Danowski.pdf","checksum":"6cb95f8772491d155ce77c6160655fff","date_updated":"2020-07-14T12:47:10Z","date_created":"2019-01-22T09:06:51Z","relation":"main_file","file_id":"5872"}],"oa_version":"Published Version","_id":"5686","year":"2018","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","ddc":["020"],"title":"An Austrian proposal for the Classification of Open Access Tuples (COAT) - Distinguish different Open Access types beyond colors","status":"public","publication_status":"published","department":[{"_id":"E-Lib"}],"file_date_updated":"2020-07-14T12:47:10Z","type":"working_paper"},{"date_published":"2018-12-01T00:00:00Z","citation":{"ama":"Alistarh D-A, Hoefler T, Johansson M, Konstantinov NH, Khirirat S, Renggli C. The convergence of sparsified gradient methods. In: Advances in Neural Information Processing Systems 31. Vol Volume 2018. Neural Information Processing Systems Foundation; 2018:5973-5983.","ieee":"D.-A. Alistarh, T. Hoefler, M. Johansson, N. H. Konstantinov, S. Khirirat, and C. Renggli, “The convergence of sparsified gradient methods,” in Advances in Neural Information Processing Systems 31, Montreal, Canada, 2018, vol. Volume 2018, pp. 5973–5983.","apa":"Alistarh, D.-A., Hoefler, T., Johansson, M., Konstantinov, N. H., Khirirat, S., & Renggli, C. (2018). The convergence of sparsified gradient methods. In Advances in Neural Information Processing Systems 31 (Vol. Volume 2018, pp. 5973–5983). Montreal, Canada: Neural Information Processing Systems Foundation.","ista":"Alistarh D-A, Hoefler T, Johansson M, Konstantinov NH, Khirirat S, Renggli C. 2018. The convergence of sparsified gradient methods. Advances in Neural Information Processing Systems 31. NeurIPS: Conference on Neural Information Processing Systems vol. Volume 2018, 5973–5983.","short":"D.-A. Alistarh, T. Hoefler, M. Johansson, N.H. Konstantinov, S. Khirirat, C. Renggli, in:, Advances in Neural Information Processing Systems 31, Neural Information Processing Systems Foundation, 2018, pp. 5973–5983.","mla":"Alistarh, Dan-Adrian, et al. “The Convergence of Sparsified Gradient Methods.” Advances in Neural Information Processing Systems 31, vol. Volume 2018, Neural Information Processing Systems Foundation, 2018, pp. 5973–83.","chicago":"Alistarh, Dan-Adrian, Torsten Hoefler, Mikael Johansson, Nikola H Konstantinov, Sarit Khirirat, and Cedric Renggli. “The Convergence of Sparsified Gradient Methods.” In Advances in Neural Information Processing Systems 31, Volume 2018:5973–83. Neural Information Processing Systems Foundation, 2018."},"publication":"Advances in Neural Information Processing Systems 31","page":"5973-5983","article_processing_charge":"No","day":"01","scopus_import":"1","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6589","title":"The convergence of sparsified gradient methods","status":"public","abstract":[{"text":"Distributed training of massive machine learning models, in particular deep neural networks, via Stochastic Gradient Descent (SGD) is becoming commonplace. Several families of communication-reduction methods, such as quantization, large-batch methods, and gradient sparsification, have been proposed. To date, gradient sparsification methods--where each node sorts gradients by magnitude, and only communicates a subset of the components, accumulating the rest locally--are known to yield some of the largest practical gains. Such methods can reduce the amount of communication per step by up to \\emph{three orders of magnitude}, while preserving model accuracy. Yet, this family of methods currently has no theoretical justification. This is the question we address in this paper. We prove that, under analytic assumptions, sparsifying gradients by magnitude with local error correction provides convergence guarantees, for both convex and non-convex smooth objectives, for data-parallel SGD. The main insight is that sparsification methods implicitly maintain bounds on the maximum impact of stale updates, thanks to selection by magnitude. Our analysis and empirical validation also reveal that these methods do require analytical conditions to converge well, justifying existing heuristics.","lang":"eng"}],"type":"conference","conference":{"name":"NeurIPS: Conference on Neural Information Processing Systems","end_date":"2018-12-08","location":"Montreal, Canada","start_date":"2018-12-02"},"language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.10505"}],"external_id":{"isi":["000461852000047"],"arxiv":["1809.10505"]},"project":[{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program"}],"isi":1,"quality_controlled":"1","month":"12","author":[{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian"},{"full_name":"Hoefler, Torsten","first_name":"Torsten","last_name":"Hoefler"},{"full_name":"Johansson, Mikael","first_name":"Mikael","last_name":"Johansson"},{"full_name":"Konstantinov, Nikola H","id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87","first_name":"Nikola H","last_name":"Konstantinov"},{"full_name":"Khirirat, Sarit","last_name":"Khirirat","first_name":"Sarit"},{"last_name":"Renggli","first_name":"Cedric","full_name":"Renggli, Cedric"}],"volume":"Volume 2018","date_created":"2019-06-27T09:32:55Z","date_updated":"2023-10-17T11:47:20Z","year":"2018","department":[{"_id":"DaAl"},{"_id":"ChLa"}],"publisher":"Neural Information Processing Systems Foundation","publication_status":"published","ec_funded":1},{"related_material":{"record":[{"status":"public","relation":"research_data","id":"13055"}],"link":[{"description":"News on IST Homepage","relation":"press_release","url":"https://ist.ac.at/en/news/for-ants-unity-is-strength-and-health/"}]},"author":[{"last_name":"Stroeymeyt","first_name":"Nathalie","full_name":"Stroeymeyt, Nathalie"},{"id":"406F989C-F248-11E8-B48F-1D18A9856A87","first_name":"Anna V","last_name":"Grasse","full_name":"Grasse, Anna V"},{"first_name":"Alessandro","last_name":"Crespi","full_name":"Crespi, Alessandro"},{"last_name":"Mersch","first_name":"Danielle","full_name":"Mersch, Danielle"},{"full_name":"Cremer, Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","first_name":"Sylvia","last_name":"Cremer"},{"first_name":"Laurent","last_name":"Keller","full_name":"Keller, Laurent"}],"volume":362,"date_updated":"2023-10-17T11:50:05Z","date_created":"2018-12-11T11:44:07Z","acknowledgement":"This project was funded by two European Research Council Advanced Grants (Social Life, 249375, and resiliANT, 741491) and two Swiss National Science Foundation grants (CR32I3_141063 and 310030_156732) to L.K. and a European Research Council Starting Grant (SocialVaccines, 243071) to S.C.","year":"2018","department":[{"_id":"SyCr"}],"publisher":"AAAS","publication_status":"published","publist_id":"8049","ec_funded":1,"doi":"10.1126/science.aat4793","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://serval.unil.ch/resource/serval:BIB_E9228C205467.P001/REF.pdf"}],"external_id":{"isi":["000451124500041"]},"project":[{"name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects","call_identifier":"FP7","_id":"25DC711C-B435-11E9-9278-68D0E5697425","grant_number":"243071"}],"isi":1,"quality_controlled":"1","publication_identifier":{"issn":["1095-9203"]},"month":"11","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7","intvolume":" 362","status":"public","title":"Social network plasticity decreases disease transmission in a eusocial insect","issue":"6417","abstract":[{"lang":"eng","text":"Animal social networks are shaped by multiple selection pressures, including the need to ensure efficient communication and functioning while simultaneously limiting disease transmission. Social animals could potentially further reduce epidemic risk by altering their social networks in the presence of pathogens, yet there is currently no evidence for such pathogen-triggered responses. We tested this hypothesis experimentally in the ant Lasius niger using a combination of automated tracking, controlled pathogen exposure, transmission quantification, and temporally explicit simulations. Pathogen exposure induced behavioral changes in both exposed ants and their nestmates, which helped contain the disease by reinforcing key transmission-inhibitory properties of the colony's contact network. This suggests that social network plasticity in response to pathogens is an effective strategy for mitigating the effects of disease in social groups."}],"type":"journal_article","date_published":"2018-11-23T00:00:00Z","citation":{"ama":"Stroeymeyt N, Grasse AV, Crespi A, Mersch D, Cremer S, Keller L. Social network plasticity decreases disease transmission in a eusocial insect. Science. 2018;362(6417):941-945. doi:10.1126/science.aat4793","ista":"Stroeymeyt N, Grasse AV, Crespi A, Mersch D, Cremer S, Keller L. 2018. Social network plasticity decreases disease transmission in a eusocial insect. Science. 362(6417), 941–945.","ieee":"N. Stroeymeyt, A. V. Grasse, A. Crespi, D. Mersch, S. Cremer, and L. Keller, “Social network plasticity decreases disease transmission in a eusocial insect,” Science, vol. 362, no. 6417. AAAS, pp. 941–945, 2018.","apa":"Stroeymeyt, N., Grasse, A. V., Crespi, A., Mersch, D., Cremer, S., & Keller, L. (2018). Social network plasticity decreases disease transmission in a eusocial insect. Science. AAAS. https://doi.org/10.1126/science.aat4793","mla":"Stroeymeyt, Nathalie, et al. “Social Network Plasticity Decreases Disease Transmission in a Eusocial Insect.” Science, vol. 362, no. 6417, AAAS, 2018, pp. 941–45, doi:10.1126/science.aat4793.","short":"N. Stroeymeyt, A.V. Grasse, A. Crespi, D. Mersch, S. Cremer, L. Keller, Science 362 (2018) 941–945.","chicago":"Stroeymeyt, Nathalie, Anna V Grasse, Alessandro Crespi, Danielle Mersch, Sylvia Cremer, and Laurent Keller. “Social Network Plasticity Decreases Disease Transmission in a Eusocial Insect.” Science. AAAS, 2018. https://doi.org/10.1126/science.aat4793."},"publication":"Science","page":"941 - 945","article_type":"original","article_processing_charge":"No","day":"23","scopus_import":"1"},{"publist_id":"8036","publication_status":"published","publisher":"Oxford University Press","department":[{"_id":"CaGu"},{"_id":"GaTk"}],"year":"2018","pmid":1,"date_updated":"2023-10-17T11:51:06Z","date_created":"2018-12-11T11:44:11Z","volume":35,"author":[{"full_name":"Palmer, Adam","last_name":"Palmer","first_name":"Adam"},{"last_name":"Chait","first_name":"Remy P","orcid":"0000-0003-0876-3187","id":"3464AE84-F248-11E8-B48F-1D18A9856A87","full_name":"Chait, Remy P"},{"last_name":"Kishony","first_name":"Roy","full_name":"Kishony, Roy"}],"month":"08","publication_identifier":{"issn":["0737-4038"]},"quality_controlled":"1","isi":1,"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pubmed/30169679"}],"oa":1,"external_id":{"pmid":["30169679"],"isi":["000452567200006"]},"language":[{"iso":"eng"}],"doi":"10.1093/molbev/msy163","type":"journal_article","abstract":[{"lang":"eng","text":"Bacteria regulate genes to survive antibiotic stress, but regulation can be far from perfect. When regulation is not optimal, mutations that change gene expression can contribute to antibiotic resistance. It is not systematically understood to what extent natural gene regulation is or is not optimal for distinct antibiotics, and how changes in expression of specific genes quantitatively affect antibiotic resistance. Here we discover a simple quantitative relation between fitness, gene expression, and antibiotic potency, which rationalizes our observation that a multitude of genes and even innate antibiotic defense mechanisms have expression that is critically nonoptimal under antibiotic treatment. First, we developed a pooled-strain drug-diffusion assay and screened Escherichia coli overexpression and knockout libraries, finding that resistance to a range of 31 antibiotics could result from changing expression of a large and functionally diverse set of genes, in a primarily but not exclusively drug-specific manner. Second, by synthetically controlling the expression of single-drug and multidrug resistance genes, we observed that their fitness-expression functions changed dramatically under antibiotic treatment in accordance with a log-sensitivity relation. Thus, because many genes are nonoptimally expressed under antibiotic treatment, many regulatory mutations can contribute to resistance by altering expression and by activating latent defenses."}],"issue":"11","title":"Nonoptimal gene expression creates latent potential for antibiotic resistance","status":"public","intvolume":" 35","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"19","oa_version":"Submitted Version","scopus_import":"1","day":"28","article_processing_charge":"No","article_type":"original","page":"2669 - 2684","publication":"Molecular Biology and Evolution","citation":{"chicago":"Palmer, Adam, Remy P Chait, and Roy Kishony. “Nonoptimal Gene Expression Creates Latent Potential for Antibiotic Resistance.” Molecular Biology and Evolution. Oxford University Press, 2018. https://doi.org/10.1093/molbev/msy163.","mla":"Palmer, Adam, et al. “Nonoptimal Gene Expression Creates Latent Potential for Antibiotic Resistance.” Molecular Biology and Evolution, vol. 35, no. 11, Oxford University Press, 2018, pp. 2669–84, doi:10.1093/molbev/msy163.","short":"A. Palmer, R.P. Chait, R. Kishony, Molecular Biology and Evolution 35 (2018) 2669–2684.","ista":"Palmer A, Chait RP, Kishony R. 2018. Nonoptimal gene expression creates latent potential for antibiotic resistance. Molecular Biology and Evolution. 35(11), 2669–2684.","ieee":"A. Palmer, R. P. Chait, and R. Kishony, “Nonoptimal gene expression creates latent potential for antibiotic resistance,” Molecular Biology and Evolution, vol. 35, no. 11. Oxford University Press, pp. 2669–2684, 2018.","apa":"Palmer, A., Chait, R. P., & Kishony, R. (2018). Nonoptimal gene expression creates latent potential for antibiotic resistance. Molecular Biology and Evolution. Oxford University Press. https://doi.org/10.1093/molbev/msy163","ama":"Palmer A, Chait RP, Kishony R. Nonoptimal gene expression creates latent potential for antibiotic resistance. Molecular Biology and Evolution. 2018;35(11):2669-2684. doi:10.1093/molbev/msy163"},"date_published":"2018-08-28T00:00:00Z"},{"day":"23","month":"10","article_processing_charge":"No","doi":"10.5281/ZENODO.1322669","date_published":"2018-10-23T00:00:00Z","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"citation":{"chicago":"Stroeymeyt, Nathalie, Anna V Grasse, Alessandro Crespi, Danielle Mersch, Sylvia Cremer, and Laurent Keller. “Social Network Plasticity Decreases Disease Transmission in a Eusocial Insect.” Zenodo, 2018. https://doi.org/10.5281/ZENODO.1322669.","short":"N. Stroeymeyt, A.V. Grasse, A. Crespi, D. Mersch, S. Cremer, L. Keller, (2018).","mla":"Stroeymeyt, Nathalie, et al. Social Network Plasticity Decreases Disease Transmission in a Eusocial Insect. Zenodo, 2018, doi:10.5281/ZENODO.1322669.","apa":"Stroeymeyt, N., Grasse, A. V., Crespi, A., Mersch, D., Cremer, S., & Keller, L. (2018). Social network plasticity decreases disease transmission in a eusocial insect. Zenodo. https://doi.org/10.5281/ZENODO.1322669","ieee":"N. Stroeymeyt, A. V. Grasse, A. Crespi, D. Mersch, S. Cremer, and L. Keller, “Social network plasticity decreases disease transmission in a eusocial insect.” Zenodo, 2018.","ista":"Stroeymeyt N, Grasse AV, Crespi A, Mersch D, Cremer S, Keller L. 2018. Social network plasticity decreases disease transmission in a eusocial insect, Zenodo, 10.5281/ZENODO.1322669.","ama":"Stroeymeyt N, Grasse AV, Crespi A, Mersch D, Cremer S, Keller L. Social network plasticity decreases disease transmission in a eusocial insect. 2018. doi:10.5281/ZENODO.1322669"},"main_file_link":[{"url":"https://doi.org/10.5281/zenodo.1480665","open_access":"1"}],"abstract":[{"text":"Dataset for manuscript 'Social network plasticity decreases disease transmission in a eusocial insect'\r\nCompared to previous versions: - raw image files added\r\n - correction of URLs within README.txt file\r\n","lang":"eng"}],"type":"research_data_reference","author":[{"first_name":"Nathalie","last_name":"Stroeymeyt","full_name":"Stroeymeyt, Nathalie"},{"id":"406F989C-F248-11E8-B48F-1D18A9856A87","last_name":"Grasse","first_name":"Anna V","full_name":"Grasse, Anna V"},{"full_name":"Crespi, Alessandro","last_name":"Crespi","first_name":"Alessandro"},{"full_name":"Mersch, Danielle","first_name":"Danielle","last_name":"Mersch"},{"full_name":"Cremer, Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","first_name":"Sylvia","last_name":"Cremer"},{"first_name":"Laurent","last_name":"Keller","full_name":"Keller, Laurent"}],"related_material":{"record":[{"id":"7","status":"public","relation":"used_in_publication"}]},"date_updated":"2023-10-17T11:50:04Z","date_created":"2023-05-23T13:24:51Z","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"13055","year":"2018","ddc":["570"],"title":"Social network plasticity decreases disease transmission in a eusocial insect","status":"public","department":[{"_id":"SyCr"}],"publisher":"Zenodo"},{"publist_id":"8033","publication_status":"published","department":[{"_id":"JoFi"}],"year":"2018","date_updated":"2023-10-17T12:12:40Z","date_created":"2018-12-11T11:44:12Z","volume":5,"author":[{"full_name":"Botello, Gabriel","last_name":"Botello","first_name":"Gabriel"},{"full_name":"Sedlmeir, Florian","last_name":"Sedlmeir","first_name":"Florian"},{"full_name":"Rueda Sanchez, Alfredo R","orcid":"0000-0001-6249-5860","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","last_name":"Rueda Sanchez","first_name":"Alfredo R"},{"full_name":"Abdalmalak, Kerlos","last_name":"Abdalmalak","first_name":"Kerlos"},{"first_name":"Elliott","last_name":"Brown","full_name":"Brown, Elliott"},{"first_name":"Gerd","last_name":"Leuchs","full_name":"Leuchs, Gerd"},{"full_name":"Preu, Sascha","last_name":"Preu","first_name":"Sascha"},{"full_name":"Segovia Vargas, Daniel","first_name":"Daniel","last_name":"Segovia Vargas"},{"first_name":"Dmitry","last_name":"Strekalov","full_name":"Strekalov, Dmitry"},{"first_name":"Luis","last_name":"Munoz","full_name":"Munoz, Luis"},{"first_name":"Harald","last_name":"Schwefel","full_name":"Schwefel, Harald"}],"month":"10","publication_identifier":{"issn":["23342536"]},"quality_controlled":"1","isi":1,"main_file_link":[{"open_access":"1","url":"www.doi.org/10.1364/OPTICA.5.001210 "}],"external_id":{"isi":["000447853100007"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1364/OPTICA.5.001210","type":"journal_article","abstract":[{"text":"Conventional ultra-high sensitivity detectors in the millimeter-wave range are usually cooled as their own thermal noise at room temperature would mask the weak received radiation. The need for cryogenic systems increases the cost and complexity of the instruments, hindering the development of, among others, airborne and space applications. In this work, the nonlinear parametric upconversion of millimeter-wave radiation to the optical domain inside high-quality (Q) lithium niobate whispering-gallery mode (WGM) resonators is proposed for ultra-low noise detection. We experimentally demonstrate coherent upconversion of millimeter-wave signals to a 1550 nm telecom carrier, with a photon conversion efficiency surpassing the state-of-the-art by 2 orders of magnitude. Moreover, a theoretical model shows that the thermal equilibrium of counterpropagating WGMs is broken by overcoupling the millimeter-wave WGM, effectively cooling the upconverted mode and allowing ultra-low noise detection. By theoretically estimating the sensitivity of a correlation radiometer based on the presented scheme, it is found that room-temperature radiometers with better sensitivity than state-of-the-art high-electron-mobility transistor (HEMT)-based radiometers can be designed. This detection paradigm can be used to develop room-temperature instrumentation for radio astronomy, earth observation, planetary missions, and imaging systems.","lang":"eng"}],"issue":"10","status":"public","title":"Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters","intvolume":" 5","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"22","oa_version":"Published Version","scopus_import":"1","day":"20","article_processing_charge":"No","article_type":"original","page":"1210 - 1219","publication":"Optica","citation":{"apa":"Botello, G., Sedlmeir, F., Rueda Sanchez, A. R., Abdalmalak, K., Brown, E., Leuchs, G., … Schwefel, H. (2018). Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters. Optica. https://doi.org/10.1364/OPTICA.5.001210","ieee":"G. Botello et al., “Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters,” Optica, vol. 5, no. 10. pp. 1210–1219, 2018.","ista":"Botello G, Sedlmeir F, Rueda Sanchez AR, Abdalmalak K, Brown E, Leuchs G, Preu S, Segovia Vargas D, Strekalov D, Munoz L, Schwefel H. 2018. Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters. Optica. 5(10), 1210–1219.","ama":"Botello G, Sedlmeir F, Rueda Sanchez AR, et al. Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters. Optica. 2018;5(10):1210-1219. doi:10.1364/OPTICA.5.001210","chicago":"Botello, Gabriel, Florian Sedlmeir, Alfredo R Rueda Sanchez, Kerlos Abdalmalak, Elliott Brown, Gerd Leuchs, Sascha Preu, et al. “Sensitivity Limits of Millimeter-Wave Photonic Radiometers Based on Efficient Electro-Optic Upconverters.” Optica, 2018. https://doi.org/10.1364/OPTICA.5.001210.","short":"G. Botello, F. Sedlmeir, A.R. Rueda Sanchez, K. Abdalmalak, E. Brown, G. Leuchs, S. Preu, D. Segovia Vargas, D. Strekalov, L. Munoz, H. Schwefel, Optica 5 (2018) 1210–1219.","mla":"Botello, Gabriel, et al. “Sensitivity Limits of Millimeter-Wave Photonic Radiometers Based on Efficient Electro-Optic Upconverters.” Optica, vol. 5, no. 10, 2018, pp. 1210–19, doi:10.1364/OPTICA.5.001210."},"date_published":"2018-10-20T00:00:00Z"},{"intvolume":" 12","title":"Contracts for system design","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5677","oa_version":"Submitted Version","type":"journal_article","issue":"2-3","abstract":[{"lang":"eng","text":"Recently, contract-based design has been proposed as an “orthogonal” approach that complements system design methodologies proposed so far to cope with the complexity of system design. Contract-based design provides a rigorous scaffolding for verification, analysis, abstraction/refinement, and even synthesis. A number of results have been obtained in this domain but a unified treatment of the topic that can help put contract-based design in perspective was missing. This monograph intends to provide such a treatment where contracts are precisely defined and characterized so that they can be used in design methodologies with no ambiguity. In particular, this monograph identifies the essence of complex system design using contracts through a mathematical “meta-theory”, where all the properties of the methodology are derived from a very abstract and generic notion of contract. We show that the meta-theory provides deep and illuminating links with existing contract and interface theories, as well as guidelines for designing new theories. Our study encompasses contracts for both software and systems, with emphasis on the latter. We illustrate the use of contracts with two examples: requirement engineering for a parking garage management, and the development of contracts for timing and scheduling in the context of the Autosar methodology in use in the automotive sector."}],"page":"124-400","article_type":"original","citation":{"apa":"Benveniste, A., Nickovic, D., Caillaud, B., Passerone, R., Raclet, J. B., Reinkemeier, P., … Larsen, K. G. (2018). Contracts for system design. Foundations and Trends in Electronic Design Automation. Now Publishers. https://doi.org/10.1561/1000000053","ieee":"A. Benveniste et al., “Contracts for system design,” Foundations and Trends in Electronic Design Automation, vol. 12, no. 2–3. Now Publishers, pp. 124–400, 2018.","ista":"Benveniste A, Nickovic D, Caillaud B, Passerone R, Raclet JB, Reinkemeier P, Sangiovanni-Vincentelli A, Damm W, Henzinger TA, Larsen KG. 2018. Contracts for system design. Foundations and Trends in Electronic Design Automation. 12(2–3), 124–400.","ama":"Benveniste A, Nickovic D, Caillaud B, et al. Contracts for system design. Foundations and Trends in Electronic Design Automation. 2018;12(2-3):124-400. doi:10.1561/1000000053","chicago":"Benveniste, Albert, Dejan Nickovic, Benoît Caillaud, Roberto Passerone, Jean Baptiste Raclet, Philipp Reinkemeier, Alberto Sangiovanni-Vincentelli, Werner Damm, Thomas A Henzinger, and Kim G. Larsen. “Contracts for System Design.” Foundations and Trends in Electronic Design Automation. Now Publishers, 2018. https://doi.org/10.1561/1000000053.","short":"A. Benveniste, D. Nickovic, B. Caillaud, R. Passerone, J.B. Raclet, P. Reinkemeier, A. Sangiovanni-Vincentelli, W. Damm, T.A. Henzinger, K.G. Larsen, Foundations and Trends in Electronic Design Automation 12 (2018) 124–400.","mla":"Benveniste, Albert, et al. “Contracts for System Design.” Foundations and Trends in Electronic Design Automation, vol. 12, no. 2–3, Now Publishers, 2018, pp. 124–400, doi:10.1561/1000000053."},"publication":"Foundations and Trends in Electronic Design Automation","date_published":"2018-05-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01","department":[{"_id":"ToHe"}],"publisher":"Now Publishers","publication_status":"published","year":"2018","volume":12,"date_updated":"2023-10-17T11:53:09Z","date_created":"2018-12-16T22:59:19Z","author":[{"first_name":"Albert","last_name":"Benveniste","full_name":"Benveniste, Albert"},{"full_name":"Nickovic, Dejan","last_name":"Nickovic","first_name":"Dejan"},{"full_name":"Caillaud, Benoît","last_name":"Caillaud","first_name":"Benoît"},{"full_name":"Passerone, Roberto","last_name":"Passerone","first_name":"Roberto"},{"full_name":"Raclet, Jean Baptiste","last_name":"Raclet","first_name":"Jean Baptiste"},{"first_name":"Philipp","last_name":"Reinkemeier","full_name":"Reinkemeier, Philipp"},{"last_name":"Sangiovanni-Vincentelli","first_name":"Alberto","full_name":"Sangiovanni-Vincentelli, Alberto"},{"first_name":"Werner","last_name":"Damm","full_name":"Damm, Werner"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"first_name":"Kim G.","last_name":"Larsen","full_name":"Larsen, Kim G."}],"quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://hal.inria.fr/hal-00757488/","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1561/1000000053","publication_identifier":{"issn":["1551-3939"]},"month":"05"},{"type":"journal_article","abstract":[{"lang":"eng","text":"It is shown that two fundamentally different phenomena, the bound states in continuum and the spectral singularity (or time-reversed spectral singularity), can occur simultaneously. This can be achieved in a rectangular core dielectric waveguide with an embedded active (or absorbing) layer. In such a system a two-dimensional bound state in a continuum is created in the plane of a waveguide cross section, and it is emitted or absorbed along the waveguide core. The idea can be used for experimental implementation of a laser or a coherent-perfect-absorber for a photonic bound state that resides in a continuous spectrum."}],"issue":"3","_id":"435","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Coherent-perfect-absorber and laser for bound states in a continuum","status":"public","intvolume":" 43","oa_version":"Preprint","scopus_import":"1","day":"01","article_processing_charge":"No","publication":"Optics Letters","citation":{"ama":"Midya B, Konotop V. Coherent-perfect-absorber and laser for bound states in a continuum. Optics Letters. 2018;43(3):607-610. doi:10.1364/OL.43.000607","ista":"Midya B, Konotop V. 2018. Coherent-perfect-absorber and laser for bound states in a continuum. Optics Letters. 43(3), 607–610.","ieee":"B. Midya and V. Konotop, “Coherent-perfect-absorber and laser for bound states in a continuum,” Optics Letters, vol. 43, no. 3. Optica Publishing Group, pp. 607–610, 2018.","apa":"Midya, B., & Konotop, V. (2018). Coherent-perfect-absorber and laser for bound states in a continuum. Optics Letters. Optica Publishing Group. https://doi.org/10.1364/OL.43.000607","mla":"Midya, Bikashkali, and Vladimir Konotop. “Coherent-Perfect-Absorber and Laser for Bound States in a Continuum.” Optics Letters, vol. 43, no. 3, Optica Publishing Group, 2018, pp. 607–10, doi:10.1364/OL.43.000607.","short":"B. Midya, V. Konotop, Optics Letters 43 (2018) 607–610.","chicago":"Midya, Bikashkali, and Vladimir Konotop. “Coherent-Perfect-Absorber and Laser for Bound States in a Continuum.” Optics Letters. Optica Publishing Group, 2018. https://doi.org/10.1364/OL.43.000607."},"page":"607 - 610","date_published":"2018-02-01T00:00:00Z","publist_id":"7388","ec_funded":1,"year":"2018","acknowledgement":"Seventh Framework Programme (FP7) People: Marie-Curie Actions (PEOPLE) (291734). B. M. acknowledges the financial support by the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/ 2007-2013) under REA.","publication_status":"published","department":[{"_id":"MiLe"}],"publisher":"Optica Publishing Group","author":[{"full_name":"Midya, Bikashkali","first_name":"Bikashkali","last_name":"Midya","id":"456187FC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Konotop","first_name":"Vladimir","full_name":"Konotop, Vladimir"}],"date_updated":"2023-10-17T12:15:06Z","date_created":"2018-12-11T11:46:27Z","volume":43,"month":"02","external_id":{"isi":["000423776600066"],"arxiv":["1711.01986"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1711.01986"}],"oa":1,"isi":1,"quality_controlled":"1","project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"doi":"10.1364/OL.43.000607","language":[{"iso":"eng"}]},{"month":"07","language":[{"iso":"eng"}],"doi":"10.7717/peerj.5198","isi":1,"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000440484800002"]},"file_date_updated":"2020-07-14T12:44:48Z","publist_id":"7784","article_number":"30083438","date_updated":"2023-10-17T12:25:28Z","date_created":"2018-12-11T11:44:50Z","volume":2018,"author":[{"first_name":"Christelle","last_name":"Fraisse","id":"32DF5794-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8441-5075","full_name":"Fraisse, Christelle"},{"full_name":"Roux, Camille","last_name":"Roux","first_name":"Camille"},{"last_name":"Gagnaire","first_name":"Pierre","full_name":"Gagnaire, Pierre"},{"full_name":"Romiguier, Jonathan","last_name":"Romiguier","first_name":"Jonathan"},{"first_name":"Nicolas","last_name":"Faivre","full_name":"Faivre, Nicolas"},{"last_name":"Welch","first_name":"John","full_name":"Welch, John"},{"first_name":"Nicolas","last_name":"Bierne","full_name":"Bierne, Nicolas"}],"publication_status":"published","department":[{"_id":"BeVi"},{"_id":"NiBa"}],"publisher":"PeerJ","year":"2018","day":"30","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","date_published":"2018-07-30T00:00:00Z","publication":"PeerJ","citation":{"ista":"Fraisse C, Roux C, Gagnaire P, Romiguier J, Faivre N, Welch J, Bierne N. 2018. The divergence history of European blue mussel species reconstructed from Approximate Bayesian Computation: The effects of sequencing techniques and sampling strategies. PeerJ. 2018(7), 30083438.","apa":"Fraisse, C., Roux, C., Gagnaire, P., Romiguier, J., Faivre, N., Welch, J., & Bierne, N. (2018). The divergence history of European blue mussel species reconstructed from Approximate Bayesian Computation: The effects of sequencing techniques and sampling strategies. PeerJ. PeerJ. https://doi.org/10.7717/peerj.5198","ieee":"C. Fraisse et al., “The divergence history of European blue mussel species reconstructed from Approximate Bayesian Computation: The effects of sequencing techniques and sampling strategies,” PeerJ, vol. 2018, no. 7. PeerJ, 2018.","ama":"Fraisse C, Roux C, Gagnaire P, et al. The divergence history of European blue mussel species reconstructed from Approximate Bayesian Computation: The effects of sequencing techniques and sampling strategies. PeerJ. 2018;2018(7). doi:10.7717/peerj.5198","chicago":"Fraisse, Christelle, Camille Roux, Pierre Gagnaire, Jonathan Romiguier, Nicolas Faivre, John Welch, and Nicolas Bierne. “The Divergence History of European Blue Mussel Species Reconstructed from Approximate Bayesian Computation: The Effects of Sequencing Techniques and Sampling Strategies.” PeerJ. PeerJ, 2018. https://doi.org/10.7717/peerj.5198.","mla":"Fraisse, Christelle, et al. “The Divergence History of European Blue Mussel Species Reconstructed from Approximate Bayesian Computation: The Effects of Sequencing Techniques and Sampling Strategies.” PeerJ, vol. 2018, no. 7, 30083438, PeerJ, 2018, doi:10.7717/peerj.5198.","short":"C. Fraisse, C. Roux, P. Gagnaire, J. Romiguier, N. Faivre, J. Welch, N. Bierne, PeerJ 2018 (2018)."},"abstract":[{"lang":"eng","text":"Genome-scale diversity data are increasingly available in a variety of biological systems, and can be used to reconstruct the past evolutionary history of species divergence. However, extracting the full demographic information from these data is not trivial, and requires inferential methods that account for the diversity of coalescent histories throughout the genome. Here, we evaluate the potential and limitations of one such approach. We reexamine a well-known system of mussel sister species, using the joint site frequency spectrum (jSFS) of synonymousmutations computed either fromexome capture or RNA-seq, in an Approximate Bayesian Computation (ABC) framework. We first assess the best sampling strategy (number of: individuals, loci, and bins in the jSFS), and show that model selection is robust to variation in the number of individuals and loci. In contrast, different binning choices when summarizing the jSFS, strongly affect the results: including classes of low and high frequency shared polymorphisms can more effectively reveal recent migration events. We then take advantage of the flexibility of ABC to compare more realistic models of speciation, including variation in migration rates through time (i.e., periodic connectivity) and across genes (i.e., genome-wide heterogeneity in migration rates). We show that these models were consistently selected as the most probable, suggesting that mussels have experienced a complex history of gene flow during divergence and that the species boundary is semi-permeable. Our work provides a comprehensive evaluation of ABC demographic inference in mussels based on the coding jSFS, and supplies guidelines for employing different sequencing techniques and sampling strategies. We emphasize, perhaps surprisingly, that inferences are less limited by the volume of data, than by the way in which they are analyzed."}],"issue":"7","type":"journal_article","file":[{"creator":"dernst","content_type":"application/pdf","file_size":1480792,"access_level":"open_access","file_name":"2018_PeerJ_Fraisse.pdf","checksum":"7d55ae22598a1c70759cd671600cff53","date_created":"2018-12-18T09:42:11Z","date_updated":"2020-07-14T12:44:48Z","file_id":"5739","relation":"main_file"}],"oa_version":"Published Version","title":"The divergence history of European blue mussel species reconstructed from Approximate Bayesian Computation: The effects of sequencing techniques and sampling strategies","ddc":["576"],"status":"public","intvolume":" 2018","_id":"139","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"intvolume":" 2018","status":"public","title":"Can secondary contact following range expansion be distinguished from barriers to gene flow?","ddc":["576"],"_id":"33","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"5692","checksum":"3334886c4b39678db4c4b74299ca14ba","date_updated":"2020-07-14T12:46:06Z","date_created":"2018-12-17T10:46:06Z","access_level":"open_access","file_name":"2018_PeerJ_Bertl.pdf","content_type":"application/pdf","file_size":1328344,"creator":"dernst"}],"type":"journal_article","issue":"10","abstract":[{"text":"Secondary contact is the reestablishment of gene flow between sister populations that have diverged. For instance, at the end of the Quaternary glaciations in Europe, secondary contact occurred during the northward expansion of the populations which had found refugia in the southern peninsulas. With the advent of multi-locus markers, secondary contact can be investigated using various molecular signatures including gradients of allele frequency, admixture clines, and local increase of genetic differentiation. We use coalescent simulations to investigate if molecular data provide enough information to distinguish between secondary contact following range expansion and an alternative evolutionary scenario consisting of a barrier to gene flow in an isolation-by-distance model. We find that an excess of linkage disequilibrium and of genetic diversity at the suture zone is a unique signature of secondary contact. We also find that the directionality index ψ, which was proposed to study range expansion, is informative to distinguish between the two hypotheses. However, although evidence for secondary contact is usually conveyed by statistics related to admixture coefficients, we find that they can be confounded by isolation-by-distance. We recommend to account for the spatial repartition of individuals when investigating secondary contact in order to better reflect the complex spatio-temporal evolution of populations and species.","lang":"eng"}],"citation":{"chicago":"Bertl, Johanna, Harald Ringbauer, and Michaël Blum. “Can Secondary Contact Following Range Expansion Be Distinguished from Barriers to Gene Flow?” PeerJ. PeerJ, 2018. https://doi.org/10.7717/peerj.5325.","short":"J. Bertl, H. Ringbauer, M. Blum, PeerJ 2018 (2018).","mla":"Bertl, Johanna, et al. “Can Secondary Contact Following Range Expansion Be Distinguished from Barriers to Gene Flow?” PeerJ, vol. 2018, no. 10, e5325, PeerJ, 2018, doi:10.7717/peerj.5325.","ieee":"J. Bertl, H. Ringbauer, and M. Blum, “Can secondary contact following range expansion be distinguished from barriers to gene flow?,” PeerJ, vol. 2018, no. 10. PeerJ, 2018.","apa":"Bertl, J., Ringbauer, H., & Blum, M. (2018). Can secondary contact following range expansion be distinguished from barriers to gene flow? PeerJ. PeerJ. https://doi.org/10.7717/peerj.5325","ista":"Bertl J, Ringbauer H, Blum M. 2018. Can secondary contact following range expansion be distinguished from barriers to gene flow? PeerJ. 2018(10), e5325.","ama":"Bertl J, Ringbauer H, Blum M. Can secondary contact following range expansion be distinguished from barriers to gene flow? PeerJ. 2018;2018(10). doi:10.7717/peerj.5325"},"publication":"PeerJ","date_published":"2018-10-01T00:00:00Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"01","department":[{"_id":"NiBa"}],"publisher":"PeerJ","publication_status":"published","pmid":1,"acknowledgement":"Johanna Bertl was supported by the Vienna Graduate School of Population Genetics (Austrian Science Fund (FWF): W1225-B20) and worked on this project while employed at the Department of Statistics and Operations Research, University of Vienna, Austria. This article was developed in the framework of the Grenoble Alpes Data Institute, which is supported by the French National Research Agency under the “Investissments d’avenir” program (ANR-15-IDEX-02).","year":"2018","volume":2018,"date_updated":"2023-10-17T12:24:43Z","date_created":"2018-12-11T11:44:16Z","author":[{"first_name":"Johanna","last_name":"Bertl","full_name":"Bertl, Johanna"},{"full_name":"Ringbauer, Harald","orcid":"0000-0002-4884-9682","id":"417FCFF4-F248-11E8-B48F-1D18A9856A87","last_name":"Ringbauer","first_name":"Harald"},{"last_name":"Blum","first_name":"Michaël","full_name":"Blum, Michaël"}],"article_number":"e5325","publist_id":"8022","file_date_updated":"2020-07-14T12:46:06Z","isi":1,"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"pmid":["30294507"],"isi":["000447204400001"]},"language":[{"iso":"eng"}],"doi":"10.7717/peerj.5325","month":"10"},{"citation":{"short":"M. Glanc, M. Fendrych, J. Friml, Nature Plants 4 (2018) 1082–1088.","mla":"Glanc, Matous, et al. “Mechanistic Framework for Cell-Intrinsic Re-Establishment of PIN2 Polarity after Cell Division.” Nature Plants, vol. 4, no. 12, Nature Research, 2018, pp. 1082–88, doi:10.1038/s41477-018-0318-3.","chicago":"Glanc, Matous, Matyas Fendrych, and Jiří Friml. “Mechanistic Framework for Cell-Intrinsic Re-Establishment of PIN2 Polarity after Cell Division.” Nature Plants. Nature Research, 2018. https://doi.org/10.1038/s41477-018-0318-3.","ama":"Glanc M, Fendrych M, Friml J. Mechanistic framework for cell-intrinsic re-establishment of PIN2 polarity after cell division. Nature Plants. 2018;4(12):1082-1088. doi:10.1038/s41477-018-0318-3","apa":"Glanc, M., Fendrych, M., & Friml, J. (2018). Mechanistic framework for cell-intrinsic re-establishment of PIN2 polarity after cell division. Nature Plants. Nature Research. https://doi.org/10.1038/s41477-018-0318-3","ieee":"M. Glanc, M. Fendrych, and J. Friml, “Mechanistic framework for cell-intrinsic re-establishment of PIN2 polarity after cell division,” Nature Plants, vol. 4, no. 12. Nature Research, pp. 1082–1088, 2018.","ista":"Glanc M, Fendrych M, Friml J. 2018. Mechanistic framework for cell-intrinsic re-establishment of PIN2 polarity after cell division. Nature Plants. 4(12), 1082–1088."},"publication":"Nature Plants","page":"1082-1088","date_published":"2018-12-03T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"03","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5673","intvolume":" 4","status":"public","title":"Mechanistic framework for cell-intrinsic re-establishment of PIN2 polarity after cell division","oa_version":"Submitted Version","type":"journal_article","issue":"12","abstract":[{"lang":"eng","text":"Cell polarity, manifested by the localization of proteins to distinct polar plasma membrane domains, is a key prerequisite of multicellular life. In plants, PIN auxin transporters are prominent polarity markers crucial for a plethora of developmental processes. Cell polarity mechanisms in plants are distinct from other eukaryotes and still largely elusive. In particular, how the cell polarities are propagated and maintained following cell division remains unknown. Plant cytokinesis is orchestrated by the cell plate—a transient centrifugally growing endomembrane compartment ultimately forming the cross wall1. Trafficking of polar membrane proteins is typically redirected to the cell plate, and these will consequently have opposite polarity in at least one of the daughter cells2–5. Here, we provide mechanistic insights into post-cytokinetic re-establishment of cell polarity as manifested by the apical, polar localization of PIN2. We show that the apical domain is defined in a cell-intrinsic manner and that re-establishment of PIN2 localization to this domain requires de novo protein secretion and endocytosis, but not basal-to-apical transcytosis. Furthermore, we identify a PINOID-related kinase WAG1, which phosphorylates PIN2 in vitro6 and is transcriptionally upregulated specifically in dividing cells, as a crucial regulator of post-cytokinetic PIN2 polarity re-establishment."}],"external_id":{"isi":["000454576600017"],"pmid":["30518833"]},"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pubmed/30518833","open_access":"1"}],"oa":1,"project":[{"_id":"261099A6-B435-11E9-9278-68D0E5697425","grant_number":"742985","call_identifier":"H2020","name":"Tracing Evolution of Auxin Transport and Polarity in Plants"}],"isi":1,"quality_controlled":"1","doi":"10.1038/s41477-018-0318-3","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2055-0278"]},"month":"12","pmid":1,"year":"2018","department":[{"_id":"JiFr"}],"publisher":"Nature Research","publication_status":"published","author":[{"full_name":"Glanc, Matous","id":"1AE1EA24-02D0-11E9-9BAA-DAF4881429F2","orcid":"0000-0003-0619-7783","first_name":"Matous","last_name":"Glanc"},{"full_name":"Fendrych, Matyas","last_name":"Fendrych","first_name":"Matyas","orcid":"0000-0002-9767-8699","id":"43905548-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Friml, Jirí","first_name":"Jirí","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596"}],"volume":4,"date_created":"2018-12-16T22:59:18Z","date_updated":"2023-10-17T12:19:28Z","ec_funded":1},{"abstract":[{"lang":"eng","text":"We consider a class of students learning a language from a teacher. The situation can be interpreted as a group of child learners receiving input from the linguistic environment. The teacher provides sample sentences. The students try to learn the grammar from the teacher. In addition to just listening to the teacher, the students can also communicate with each other. The students hold hypotheses about the grammar and change them if they receive counter evidence. The process stops when all students have converged to the correct grammar. We study how the time to convergence depends on the structure of the classroom by introducing and evaluating various complexity measures. We find that structured communication between students, although potentially introducing confusion, can greatly reduce some of the complexity measures. Our theory can also be interpreted as applying to the scientific process, where nature is the teacher and the scientists are the students."}],"issue":"140","type":"journal_article","oa_version":"Submitted Version","file":[{"checksum":"444e1a9d98eb0e780671be82b13025f3","date_updated":"2020-07-14T12:45:22Z","date_created":"2019-02-12T07:54:37Z","relation":"main_file","file_id":"5955","content_type":"application/pdf","file_size":219837,"creator":"dernst","access_level":"open_access","file_name":"2018_RS_IbsenJensen.pdf"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"198","status":"public","ddc":["000"],"title":"Language acquisition with communication between learners","intvolume":" 15","day":"01","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","date_published":"2018-03-01T00:00:00Z","publication":"Journal of the Royal Society Interface","citation":{"ama":"Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. Language acquisition with communication between learners. Journal of the Royal Society Interface. 2018;15(140). doi:10.1098/rsif.2018.0073","apa":"Ibsen-Jensen, R., Tkadlec, J., Chatterjee, K., & Nowak, M. (2018). Language acquisition with communication between learners. Journal of the Royal Society Interface. The Royal Society. https://doi.org/10.1098/rsif.2018.0073","ieee":"R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, and M. Nowak, “Language acquisition with communication between learners,” Journal of the Royal Society Interface, vol. 15, no. 140. The Royal Society, 2018.","ista":"Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. 2018. Language acquisition with communication between learners. Journal of the Royal Society Interface. 15(140), 20180073.","short":"R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, M. Nowak, Journal of the Royal Society Interface 15 (2018).","mla":"Ibsen-Jensen, Rasmus, et al. “Language Acquisition with Communication between Learners.” Journal of the Royal Society Interface, vol. 15, no. 140, 20180073, The Royal Society, 2018, doi:10.1098/rsif.2018.0073.","chicago":"Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Language Acquisition with Communication between Learners.” Journal of the Royal Society Interface. The Royal Society, 2018. https://doi.org/10.1098/rsif.2018.0073."},"article_type":"original","file_date_updated":"2020-07-14T12:45:22Z","publist_id":"7715","ec_funded":1,"article_number":"20180073","author":[{"last_name":"Ibsen-Jensen","first_name":"Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus"},{"last_name":"Tkadlec","first_name":"Josef","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","full_name":"Tkadlec, Josef"},{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"related_material":{"link":[{"url":"https://dx.doi.org/10.6084/m9.figshare.c.4028971","relation":"supplementary_material"}],"record":[{"status":"public","relation":"research_data","id":"9814"}]},"date_updated":"2023-10-18T06:36:00Z","date_created":"2018-12-11T11:45:09Z","volume":15,"year":"2018","pmid":1,"publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"The Royal Society","month":"03","publication_identifier":{"eissn":["1742-5662"]},"doi":"10.1098/rsif.2018.0073","language":[{"iso":"eng"}],"external_id":{"isi":["000428576200023"],"pmid":["29593089"]},"oa":1,"quality_controlled":"1","isi":1,"project":[{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"}]},{"scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"12","article_type":"original","citation":{"mla":"Corominas-Murtra, Bernat, et al. “Chromatic Transitions in the Emergence of Syntax Networks.” Royal Society Open Science, vol. 5, no. 12, 181286, The Royal Society, 2018, doi:10.1098/rsos.181286.","short":"B. Corominas-Murtra, M.S. Fibla, S. Valverde, R. Solé, Royal Society Open Science 5 (2018).","chicago":"Corominas-Murtra, Bernat, Martí Sànchez Fibla, Sergi Valverde, and Ricard Solé. “Chromatic Transitions in the Emergence of Syntax Networks.” Royal Society Open Science. The Royal Society, 2018. https://doi.org/10.1098/rsos.181286.","ama":"Corominas-Murtra B, Fibla MS, Valverde S, Solé R. Chromatic transitions in the emergence of syntax networks. Royal Society Open Science. 2018;5(12). doi:10.1098/rsos.181286","ista":"Corominas-Murtra B, Fibla MS, Valverde S, Solé R. 2018. Chromatic transitions in the emergence of syntax networks. Royal Society Open Science. 5(12), 181286.","ieee":"B. Corominas-Murtra, M. S. Fibla, S. Valverde, and R. Solé, “Chromatic transitions in the emergence of syntax networks,” Royal Society Open Science, vol. 5, no. 12. The Royal Society, 2018.","apa":"Corominas-Murtra, B., Fibla, M. S., Valverde, S., & Solé, R. (2018). Chromatic transitions in the emergence of syntax networks. Royal Society Open Science. The Royal Society. https://doi.org/10.1098/rsos.181286"},"publication":"Royal Society Open Science","date_published":"2018-12-12T00:00:00Z","type":"journal_article","issue":"12","abstract":[{"lang":"eng","text":"The emergence of syntax during childhood is a remarkable example of how complex correlations unfold in nonlinear ways through development. In particular, rapid transitions seem to occur as children reach the age of two, which seems to separate a two-word, tree-like network of syntactic relations among words from the scale-free graphs associated with the adult, complex grammar. Here, we explore the evolution of syntax networks through language acquisition using the chromatic number, which captures the transition and provides a natural link to standard theories on syntactic structures. The data analysis is compared to a null model of network growth dynamics which is shown to display non-trivial and sensible differences. At a more general level, we observe that the chromatic classes define independent regions of the graph, and thus, can be interpreted as the footprints of incompatibility relations, somewhat as opposed to modularity considerations."}],"intvolume":" 5","ddc":["570"],"title":"Chromatic transitions in the emergence of syntax networks","status":"public","_id":"5859","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"file_name":"2018_RoyalSocOS_Corominas.pdf","access_level":"open_access","creator":"dernst","content_type":"application/pdf","file_size":646732,"file_id":"5924","relation":"main_file","date_updated":"2020-07-14T12:47:13Z","date_created":"2019-02-05T14:38:09Z","checksum":"9664d4417f6b792242e31eea77ce9501"}],"publication_identifier":{"issn":["2054-5703"]},"month":"12","quality_controlled":"1","isi":1,"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000456566500027"],"pmid":["30662738"]},"language":[{"iso":"eng"}],"doi":"10.1098/rsos.181286","article_number":"181286","file_date_updated":"2020-07-14T12:47:13Z","department":[{"_id":"EdHa"}],"publisher":"The Royal Society","publication_status":"published","pmid":1,"year":"2018","acknowledgement":"This work was supported by the James McDonnell Foundation (B.C-M., S.V. and R.S.)","volume":5,"date_updated":"2023-10-18T06:41:12Z","date_created":"2019-01-20T22:59:18Z","author":[{"full_name":"Corominas-Murtra, Bernat","orcid":"0000-0001-9806-5643","id":"43BE2298-F248-11E8-B48F-1D18A9856A87","last_name":"Corominas-Murtra","first_name":"Bernat"},{"full_name":"Fibla, Martí Sànchez","last_name":"Fibla","first_name":"Martí Sànchez"},{"last_name":"Valverde","first_name":"Sergi","full_name":"Valverde, Sergi"},{"full_name":"Solé, Ricard","last_name":"Solé","first_name":"Ricard"}]},{"type":"journal_article","abstract":[{"text":"Pore-forming toxins (PFT) are virulence factors that transform from soluble to membrane-bound states. The Yersinia YaxAB system represents a family of binary α-PFTs with orthologues in human, insect, and plant pathogens, with unknown structures. YaxAB was shown to be cytotoxic and likely involved in pathogenesis, though the molecular basis for its two-component lytic mechanism remains elusive. Here, we present crystal structures of YaxA and YaxB, together with a cryo-electron microscopy map of the YaxAB complex. Our structures reveal a pore predominantly composed of decamers of YaxA–YaxB heterodimers. Both subunits bear membrane-active moieties, but only YaxA is capable of binding to membranes by itself. YaxB can subsequently be recruited to membrane-associated YaxA and induced to present its lytic transmembrane helices. Pore formation can progress by further oligomerization of YaxA–YaxB dimers. Our results allow for a comparison between pore assemblies belonging to the wider ClyA-like family of α-PFTs, highlighting diverse pore architectures.","lang":"eng"}],"_id":"14284","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Structure and mechanism of the two-component α-helical pore-forming toxin YaxAB","intvolume":" 9","oa_version":"Published Version","scopus_import":"1","keyword":["General Physics and Astronomy","General Biochemistry","Genetics and Molecular Biology","General Chemistry","Multidisciplinary"],"day":"04","article_processing_charge":"No","publication":"Nature Communications","citation":{"mla":"Bräuning, Bastian, et al. “Structure and Mechanism of the Two-Component α-Helical Pore-Forming Toxin YaxAB.” Nature Communications, vol. 9, 1806, Springer Nature, 2018, doi:10.1038/s41467-018-04139-2.","short":"B. Bräuning, E. Bertosin, F.M. Praetorius, C. Ihling, A. Schatt, A. Adler, K. Richter, A. Sinz, H. Dietz, M. Groll, Nature Communications 9 (2018).","chicago":"Bräuning, Bastian, Eva Bertosin, Florian M Praetorius, Christian Ihling, Alexandra Schatt, Agnes Adler, Klaus Richter, Andrea Sinz, Hendrik Dietz, and Michael Groll. “Structure and Mechanism of the Two-Component α-Helical Pore-Forming Toxin YaxAB.” Nature Communications. Springer Nature, 2018. https://doi.org/10.1038/s41467-018-04139-2.","ama":"Bräuning B, Bertosin E, Praetorius FM, et al. Structure and mechanism of the two-component α-helical pore-forming toxin YaxAB. Nature Communications. 2018;9. doi:10.1038/s41467-018-04139-2","ista":"Bräuning B, Bertosin E, Praetorius FM, Ihling C, Schatt A, Adler A, Richter K, Sinz A, Dietz H, Groll M. 2018. Structure and mechanism of the two-component α-helical pore-forming toxin YaxAB. Nature Communications. 9, 1806.","ieee":"B. Bräuning et al., “Structure and mechanism of the two-component α-helical pore-forming toxin YaxAB,” Nature Communications, vol. 9. Springer Nature, 2018.","apa":"Bräuning, B., Bertosin, E., Praetorius, F. M., Ihling, C., Schatt, A., Adler, A., … Groll, M. (2018). Structure and mechanism of the two-component α-helical pore-forming toxin YaxAB. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-018-04139-2"},"article_type":"original","date_published":"2018-05-04T00:00:00Z","article_number":"1806","extern":"1","year":"2018","pmid":1,"publication_status":"published","publisher":"Springer Nature","author":[{"last_name":"Bräuning","first_name":"Bastian","full_name":"Bräuning, Bastian"},{"first_name":"Eva","last_name":"Bertosin","full_name":"Bertosin, Eva"},{"full_name":"Praetorius, Florian M","id":"dfec9381-4341-11ee-8fd8-faa02bba7d62","first_name":"Florian M","last_name":"Praetorius"},{"full_name":"Ihling, Christian","last_name":"Ihling","first_name":"Christian"},{"last_name":"Schatt","first_name":"Alexandra","full_name":"Schatt, Alexandra"},{"full_name":"Adler, Agnes","first_name":"Agnes","last_name":"Adler"},{"first_name":"Klaus","last_name":"Richter","full_name":"Richter, Klaus"},{"full_name":"Sinz, Andrea","first_name":"Andrea","last_name":"Sinz"},{"last_name":"Dietz","first_name":"Hendrik","full_name":"Dietz, Hendrik"},{"first_name":"Michael","last_name":"Groll","full_name":"Groll, Michael"}],"date_updated":"2023-11-07T11:46:12Z","date_created":"2023-09-06T12:07:33Z","volume":9,"month":"05","publication_identifier":{"issn":["2041-1723"]},"external_id":{"pmid":["29728606"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1038/s41467-018-04139-2"}],"oa":1,"quality_controlled":"1","doi":"10.1038/s41467-018-04139-2","language":[{"iso":"eng"}]},{"abstract":[{"lang":"eng","text":"Function and activity of biomolecules often depend on their spatial arrangement. The method introduced here allows genetically encoding the spatial arrangement of proteins and DNA. The approach relies on staple proteins that fold double-stranded DNA into user-defined shapes. This thesis describes the development of staple proteins based on the DNA recognition of TAL effectors and presents experimentally derived rules for designing a variety of self-assembling nanoscale shapes featuring structural motifs such as curvature, vertices, corners, and multilayer helix packing. "}],"extern":"1","type":"dissertation","author":[{"first_name":"Florian M","last_name":"Praetorius","id":"dfec9381-4341-11ee-8fd8-faa02bba7d62","full_name":"Praetorius, Florian M"}],"date_updated":"2023-11-07T11:43:38Z","date_created":"2023-09-06T13:11:22Z","oa_version":"Published Version","_id":"14306","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2018","status":"public","title":"Genetically encoding the spatial arrangement of DNA and proteins in self-assembling nanostructures","publication_status":"published","publisher":"Technische Universität München","month":"01","day":"16","article_processing_charge":"No","date_published":"2018-01-16T00:00:00Z","supervisor":[{"first_name":"Hendrik","last_name":"Dietz","full_name":"Dietz, Hendrik"}],"degree_awarded":"PhD","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"url":"https://mediatum.ub.tum.de/1398662","open_access":"1"}],"citation":{"chicago":"Praetorius, Florian M. “Genetically Encoding the Spatial Arrangement of DNA and Proteins in Self-Assembling Nanostructures.” Technische Universität München, 2018.","mla":"Praetorius, Florian M. Genetically Encoding the Spatial Arrangement of DNA and Proteins in Self-Assembling Nanostructures. Technische Universität München, 2018.","short":"F.M. Praetorius, Genetically Encoding the Spatial Arrangement of DNA and Proteins in Self-Assembling Nanostructures, Technische Universität München, 2018.","ista":"Praetorius FM. 2018. Genetically encoding the spatial arrangement of DNA and proteins in self-assembling nanostructures. Technische Universität München.","apa":"Praetorius, F. M. (2018). Genetically encoding the spatial arrangement of DNA and proteins in self-assembling nanostructures. Technische Universität München.","ieee":"F. M. Praetorius, “Genetically encoding the spatial arrangement of DNA and proteins in self-assembling nanostructures,” Technische Universität München, 2018.","ama":"Praetorius FM. Genetically encoding the spatial arrangement of DNA and proteins in self-assembling nanostructures. 2018."}},{"article_number":"1804.07752","type":"preprint","abstract":[{"lang":"eng","text":"We study the unique solution $m$ of the Dyson equation \\[ -m(z)^{-1} = z - a\r\n+ S[m(z)] \\] on a von Neumann algebra $\\mathcal{A}$ with the constraint\r\n$\\mathrm{Im}\\,m\\geq 0$. Here, $z$ lies in the complex upper half-plane, $a$ is\r\na self-adjoint element of $\\mathcal{A}$ and $S$ is a positivity-preserving\r\nlinear operator on $\\mathcal{A}$. We show that $m$ is the Stieltjes transform\r\nof a compactly supported $\\mathcal{A}$-valued measure on $\\mathbb{R}$. Under\r\nsuitable assumptions, we establish that this measure has a uniformly\r\n$1/3$-H\\\"{o}lder continuous density with respect to the Lebesgue measure, which\r\nis supported on finitely many intervals, called bands. In fact, the density is\r\nanalytic inside the bands with a square-root growth at the edges and internal\r\ncubic root cusps whenever the gap between two bands vanishes. The shape of\r\nthese singularities is universal and no other singularity may occur. We give a\r\nprecise asymptotic description of $m$ near the singular points. These\r\nasymptotics generalize the analysis at the regular edges given in the companion\r\npaper on the Tracy-Widom universality for the edge eigenvalue statistics for\r\ncorrelated random matrices [arXiv:1804.07744] and they play a key role in the\r\nproof of the Pearcey universality at the cusp for Wigner-type matrices\r\n[arXiv:1809.03971,arXiv:1811.04055]. We also extend the finite dimensional band\r\nmass formula from [arXiv:1804.07744] to the von Neumann algebra setting by\r\nshowing that the spectral mass of the bands is topologically rigid under\r\ndeformations and we conclude that these masses are quantized in some important\r\ncases."}],"status":"public","title":"The Dyson equation with linear self-energy: Spectral bands, edges and cusps","publication_status":"submitted","department":[{"_id":"LaEr"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6183","year":"2018","date_updated":"2023-12-18T10:46:08Z","date_created":"2019-03-28T09:20:06Z","oa_version":"Preprint","author":[{"full_name":"Alt, Johannes","last_name":"Alt","first_name":"Johannes","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"László","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","full_name":"Erdös, László"},{"full_name":"Krüger, Torben H","last_name":"Krüger","first_name":"Torben H","orcid":"0000-0002-4821-3297","id":"3020C786-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"id":"149","status":"public","relation":"dissertation_contains"},{"id":"14694","status":"public","relation":"later_version"}]},"day":"20","month":"04","article_processing_charge":"No","publication":"arXiv","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.07752"}],"citation":{"chicago":"Alt, Johannes, László Erdös, and Torben H Krüger. “The Dyson Equation with Linear Self-Energy: Spectral Bands, Edges and Cusps.” ArXiv, n.d.","mla":"Alt, Johannes, et al. “The Dyson Equation with Linear Self-Energy: Spectral Bands, Edges and Cusps.” ArXiv, 1804.07752.","short":"J. Alt, L. Erdös, T.H. Krüger, ArXiv (n.d.).","ista":"Alt J, Erdös L, Krüger TH. The Dyson equation with linear self-energy: Spectral bands, edges and cusps. arXiv, 1804.07752.","apa":"Alt, J., Erdös, L., & Krüger, T. H. (n.d.). The Dyson equation with linear self-energy: Spectral bands, edges and cusps. arXiv.","ieee":"J. Alt, L. Erdös, and T. H. Krüger, “The Dyson equation with linear self-energy: Spectral bands, edges and cusps,” arXiv. .","ama":"Alt J, Erdös L, Krüger TH. The Dyson equation with linear self-energy: Spectral bands, edges and cusps. arXiv."},"external_id":{"arxiv":["1804.07752"]},"language":[{"iso":"eng"}],"date_published":"2018-04-20T00:00:00Z"},{"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"8156"}]},"author":[{"full_name":"Akopyan, Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","first_name":"Arseniy","last_name":"Akopyan"},{"full_name":"Avvakumov, Sergey","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","first_name":"Sergey","last_name":"Avvakumov"},{"first_name":"Roman","last_name":"Karasev","full_name":"Karasev, Roman"}],"oa_version":"Preprint","date_created":"2018-12-11T11:44:30Z","date_updated":"2023-12-18T10:51:02Z","_id":"75","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2018","publisher":"arXiv","department":[{"_id":"HeEd"},{"_id":"JaMa"}],"status":"public","publication_status":"published","title":"Convex fair partitions into arbitrary number of pieces","ec_funded":1,"abstract":[{"text":"We prove that any convex body in the plane can be partitioned into m convex parts of equal areas and perimeters for any integer m≥2; this result was previously known for prime powers m=pk. We also give a higher-dimensional generalization.","lang":"eng"}],"type":"preprint","article_number":"1804.03057","date_published":"2018-09-13T00:00:00Z","doi":"10.48550/arXiv.1804.03057","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.03057"}],"external_id":{"arxiv":["1804.03057"]},"citation":{"mla":"Akopyan, Arseniy, et al. Convex Fair Partitions into Arbitrary Number of Pieces. 1804.03057, arXiv, 2018, doi:10.48550/arXiv.1804.03057.","short":"A. Akopyan, S. Avvakumov, R. Karasev, (2018).","chicago":"Akopyan, Arseniy, Sergey Avvakumov, and Roman Karasev. “Convex Fair Partitions into Arbitrary Number of Pieces.” arXiv, 2018. https://doi.org/10.48550/arXiv.1804.03057.","ama":"Akopyan A, Avvakumov S, Karasev R. Convex fair partitions into arbitrary number of pieces. 2018. doi:10.48550/arXiv.1804.03057","ista":"Akopyan A, Avvakumov S, Karasev R. 2018. Convex fair partitions into arbitrary number of pieces. 1804.03057.","apa":"Akopyan, A., Avvakumov, S., & Karasev, R. (2018). Convex fair partitions into arbitrary number of pieces. arXiv. https://doi.org/10.48550/arXiv.1804.03057","ieee":"A. Akopyan, S. Avvakumov, and R. Karasev, “Convex fair partitions into arbitrary number of pieces.” arXiv, 2018."},"project":[{"grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425","name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020"}],"article_processing_charge":"No","day":"13","month":"09"},{"file_date_updated":"2020-07-14T12:47:03Z","ec_funded":1,"publist_id":"7258","date_created":"2018-12-11T11:47:09Z","date_updated":"2024-02-20T10:48:17Z","volume":19,"author":[{"first_name":"Dan","last_name":"Betea","full_name":"Betea, Dan"},{"full_name":"Bouttier, Jeremie","last_name":"Bouttier","first_name":"Jeremie"},{"id":"4BF426E2-F248-11E8-B48F-1D18A9856A87","last_name":"Nejjar","first_name":"Peter","full_name":"Nejjar, Peter"},{"first_name":"Mirjana","last_name":"Vuletic","full_name":"Vuletic, Mirjana"}],"publication_status":"published","department":[{"_id":"LaEr"},{"_id":"JaMa"}],"publisher":"Springer Nature","year":"2018","month":"11","publication_identifier":{"issn":["1424-0637"]},"language":[{"iso":"eng"}],"doi":"10.1007/s00023-018-0723-1","quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"},{"_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117","call_identifier":"H2020","name":"Optimal Transport and Stochastic Dynamics"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["1704.05809"]},"oa":1,"abstract":[{"text":"We investigate the free boundary Schur process, a variant of the Schur process introduced by Okounkov and Reshetikhin, where we allow the first and the last partitions to be arbitrary (instead of empty in the original setting). The pfaffian Schur process, previously studied by several authors, is recovered when just one of the boundary partitions is left free. We compute the correlation functions of the process in all generality via the free fermion formalism, which we extend with the thorough treatment of “free boundary states.” For the case of one free boundary, our approach yields a new proof that the process is pfaffian. For the case of two free boundaries, we find that the process is not pfaffian, but a closely related process is. We also study three different applications of the Schur process with one free boundary: fluctuations of symmetrized last passage percolation models, limit shapes and processes for symmetric plane partitions and for plane overpartitions.","lang":"eng"}],"issue":"12","type":"journal_article","file":[{"access_level":"open_access","file_name":"2018_Annales_Betea.pdf","file_size":3084674,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"5866","checksum":"0c38abe73569b7166b7487ad5d23cc68","date_created":"2019-01-21T15:18:55Z","date_updated":"2020-07-14T12:47:03Z"}],"oa_version":"Published Version","title":"The free boundary Schur process and applications I","ddc":["500"],"status":"public","intvolume":" 19","_id":"556","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"13","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","scopus_import":"1","date_published":"2018-11-13T00:00:00Z","article_type":"original","page":"3663-3742","publication":"Annales Henri Poincare","citation":{"short":"D. Betea, J. Bouttier, P. Nejjar, M. Vuletic, Annales Henri Poincare 19 (2018) 3663–3742.","mla":"Betea, Dan, et al. “The Free Boundary Schur Process and Applications I.” Annales Henri Poincare, vol. 19, no. 12, Springer Nature, 2018, pp. 3663–742, doi:10.1007/s00023-018-0723-1.","chicago":"Betea, Dan, Jeremie Bouttier, Peter Nejjar, and Mirjana Vuletic. “The Free Boundary Schur Process and Applications I.” Annales Henri Poincare. Springer Nature, 2018. https://doi.org/10.1007/s00023-018-0723-1.","ama":"Betea D, Bouttier J, Nejjar P, Vuletic M. The free boundary Schur process and applications I. Annales Henri Poincare. 2018;19(12):3663-3742. doi:10.1007/s00023-018-0723-1","ieee":"D. Betea, J. Bouttier, P. Nejjar, and M. Vuletic, “The free boundary Schur process and applications I,” Annales Henri Poincare, vol. 19, no. 12. Springer Nature, pp. 3663–3742, 2018.","apa":"Betea, D., Bouttier, J., Nejjar, P., & Vuletic, M. (2018). The free boundary Schur process and applications I. Annales Henri Poincare. Springer Nature. https://doi.org/10.1007/s00023-018-0723-1","ista":"Betea D, Bouttier J, Nejjar P, Vuletic M. 2018. The free boundary Schur process and applications I. Annales Henri Poincare. 19(12), 3663–3742."}},{"datarep_id":"82","type":"research_data","abstract":[{"text":"Graph matching problems for large displacement optical flow of RGB-D images.","lang":"eng"}],"file_date_updated":"2020-07-14T12:47:05Z","status":"public","title":"Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow","ddc":["001"],"department":[{"_id":"VlKo"}],"publisher":"Institute of Science and Technology Austria","_id":"5573","year":"2018","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-12T12:31:36Z","date_updated":"2024-02-21T13:41:17Z","oa_version":"Published Version","file":[{"date_updated":"2020-07-14T12:47:05Z","date_created":"2018-12-12T13:02:34Z","checksum":"53c17082848e12f3c2e1b4185b578208","relation":"main_file","file_id":"5600","content_type":"application/zip","file_size":1737958,"creator":"system","file_name":"IST-2018-82-v1+1_GraphFlowMatchingProblems.zip","access_level":"open_access"}],"author":[{"first_name":"Hassan","last_name":"Alhaija","full_name":"Alhaija, Hassan"},{"last_name":"Sellent","first_name":"Anita","full_name":"Sellent, Anita"},{"full_name":"Kondermann, Daniel","first_name":"Daniel","last_name":"Kondermann"},{"full_name":"Rother, Carsten","last_name":"Rother","first_name":"Carsten"}],"related_material":{"link":[{"relation":"research_paper","url":"https://doi.org/10.1007/978-3-319-24947-6_23"}]},"contributor":[{"last_name":"Swoboda","contributor_type":"researcher","first_name":"Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87"}],"keyword":["graph matching","quadratic assignment problem<"],"month":"01","day":"04","has_accepted_license":"1","article_processing_charge":"No","citation":{"ama":"Alhaija H, Sellent A, Kondermann D, Rother C. Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow. 2018. doi:10.15479/AT:ISTA:82","ista":"Alhaija H, Sellent A, Kondermann D, Rother C. 2018. Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow, Institute of Science and Technology Austria, 10.15479/AT:ISTA:82.","apa":"Alhaija, H., Sellent, A., Kondermann, D., & Rother, C. (2018). Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:82","ieee":"H. Alhaija, A. Sellent, D. Kondermann, and C. Rother, “Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow.” Institute of Science and Technology Austria, 2018.","mla":"Alhaija, Hassan, et al. Graph Matching Problems for GraphFlow – 6D Large Displacement Scene Flow. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:82.","short":"H. Alhaija, A. Sellent, D. Kondermann, C. Rother, (2018).","chicago":"Alhaija, Hassan, Anita Sellent, Daniel Kondermann, and Carsten Rother. “Graph Matching Problems for GraphFlow – 6D Large Displacement Scene Flow.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:82."},"tmp":{"short":"CC0 (1.0)","image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"oa":1,"doi":"10.15479/AT:ISTA:82","date_published":"2018-01-04T00:00:00Z"},{"day":"16","month":"01","article_processing_charge":"No","has_accepted_license":"1","keyword":["Publication analysis","Bibliography","Open Access"],"date_published":"2018-01-16T00:00:00Z","doi":"10.15479/AT:ISTA:89","oa":1,"tmp":{"short":"CC0 (1.0)","image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"citation":{"ama":"Villányi M. Emerald Austrian Publications 2013-2017. 2018. doi:10.15479/AT:ISTA:89","ieee":"M. Villányi, “Emerald Austrian Publications 2013-2017.” Institute of Science and Technology Austria, 2018.","apa":"Villányi, M. (2018). Emerald Austrian Publications 2013-2017. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:89","ista":"Villányi M. 2018. Emerald Austrian Publications 2013-2017, Institute of Science and Technology Austria, 10.15479/AT:ISTA:89.","short":"M. Villányi, (2018).","mla":"Villányi, Márton. Emerald Austrian Publications 2013-2017. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:89.","chicago":"Villányi, Márton. “Emerald Austrian Publications 2013-2017.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:89."},"abstract":[{"lang":"ger","text":"Data on Austrian open access publication output at Emerald from 2013-2017 including data analysis."}],"file_date_updated":"2020-07-14T12:47:06Z","datarep_id":"89","type":"research_data","date_created":"2018-12-12T12:31:37Z","date_updated":"2024-02-21T13:41:32Z","file":[{"content_type":"application/zip","file_size":222011,"creator":"system","file_name":"IST-2018-89-v1+1_Emerald_Austrian_Publications_2013-2017.zip","access_level":"open_access","date_updated":"2020-07-14T12:47:06Z","date_created":"2018-12-12T13:02:39Z","checksum":"786b599abfae6c355dee87835f414549","relation":"main_file","file_id":"5604"}],"oa_version":"Submitted Version","author":[{"full_name":"Villányi, Márton","id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8126-0426","first_name":"Márton","last_name":"Villányi"}],"related_material":{"record":[{"id":"278","relation":"part_of_dissertation","status":"public"}]},"status":"public","ddc":["020"],"title":"Emerald Austrian Publications 2013-2017","department":[{"_id":"E-Lib"}],"publisher":"Institute of Science and Technology Austria","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5577","year":"2018"},{"abstract":[{"lang":"ger","text":"Data on Austrian open access publication output at IOP from 2012-2015 including data analysis."}],"file_date_updated":"2020-07-14T12:47:06Z","datarep_id":"90","type":"research_data","author":[{"last_name":"Villányi","first_name":"Márton","orcid":"0000-0001-8126-0426","id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","full_name":"Villányi, Márton"}],"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"278"}]},"date_created":"2018-12-12T12:31:38Z","date_updated":"2024-02-21T13:42:36Z","file":[{"checksum":"a4f1bf041ccd4c35912e2d595b0c2883","date_updated":"2020-07-14T12:47:06Z","date_created":"2018-12-12T13:03:06Z","file_id":"5624","relation":"main_file","creator":"system","content_type":"application/zip","file_size":237067,"access_level":"open_access","file_name":"IST-2018-90-v1+1_IOP_Austrian_Publications_2012-2015.zip"}],"oa_version":"Submitted Version","_id":"5578","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2018","status":"public","title":"IOP Austrian Publications 2012-2015","ddc":["020"],"publisher":"Institute of Science and Technology Austria","department":[{"_id":"E-Lib"}],"day":"16","month":"01","has_accepted_license":"1","article_processing_charge":"No","keyword":["Publication analysis","Bibliography","Open Access"],"date_published":"2018-01-16T00:00:00Z","doi":"10.15479/AT:ISTA:90","tmp":{"short":"CC0 (1.0)","image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"oa":1,"citation":{"short":"M. Villányi, (2018).","mla":"Villányi, Márton. IOP Austrian Publications 2012-2015. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:90.","chicago":"Villányi, Márton. “IOP Austrian Publications 2012-2015.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:90.","ama":"Villányi M. IOP Austrian Publications 2012-2015. 2018. doi:10.15479/AT:ISTA:90","apa":"Villányi, M. (2018). IOP Austrian Publications 2012-2015. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:90","ieee":"M. Villányi, “IOP Austrian Publications 2012-2015.” Institute of Science and Technology Austria, 2018.","ista":"Villányi M. 2018. IOP Austrian Publications 2012-2015, Institute of Science and Technology Austria, 10.15479/AT:ISTA:90."}},{"keyword":["Publication analysis","Bibliography","Open Access"],"article_processing_charge":"No","has_accepted_license":"1","day":"16","month":"01","citation":{"chicago":"Villányi, Márton. “Data Check IOP Scopus vs. Publisher.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:86.","short":"M. Villányi, (2018).","mla":"Villányi, Márton. Data Check IOP Scopus vs. Publisher. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:86.","ieee":"M. Villányi, “Data Check IOP Scopus vs. Publisher.” Institute of Science and Technology Austria, 2018.","apa":"Villányi, M. (2018). Data Check IOP Scopus vs. Publisher. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:86","ista":"Villányi M. 2018. Data Check IOP Scopus vs. Publisher, Institute of Science and Technology Austria, 10.15479/AT:ISTA:86.","ama":"Villányi M. Data Check IOP Scopus vs. Publisher. 2018. doi:10.15479/AT:ISTA:86"},"tmp":{"short":"CC0 (1.0)","image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"oa":1,"doi":"10.15479/AT:ISTA:86","date_published":"2018-01-16T00:00:00Z","type":"research_data","datarep_id":"86","file_date_updated":"2020-07-14T12:47:05Z","abstract":[{"text":"Comparison of Scopus' and publisher's data on Austrian publication output at IOP. ","lang":"ger"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5574","year":"2018","department":[{"_id":"E-Lib"}],"publisher":"Institute of Science and Technology Austria","ddc":["020"],"status":"public","title":"Data Check IOP Scopus vs. Publisher","related_material":{"record":[{"id":"278","status":"public","relation":"part_of_dissertation"}]},"author":[{"last_name":"Villányi","first_name":"Márton","orcid":"0000-0001-8126-0426","id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","full_name":"Villányi, Márton"}],"file":[{"file_name":"IST-2018-86-v1+1_Data_Check_IOP_Scopus_vs._Publisher.zip","access_level":"open_access","creator":"system","content_type":"application/zip","file_size":12283857,"file_id":"5642","relation":"main_file","date_updated":"2020-07-14T12:47:05Z","date_created":"2018-12-12T13:05:14Z","checksum":"c7a61147bd15cb4ae45878d270628c06"}],"oa_version":"Submitted Version","date_created":"2018-12-12T12:31:37Z","date_updated":"2024-02-21T13:42:21Z"},{"page":"94","main_file_link":[{"open_access":"1","url":"http://othes.univie.ac.at/51113/"}],"oa":1,"citation":{"mla":"Villányi, Márton. Lizenzverträge mit Open-Access-Komponenten an österreichischen Bibliotheken. Universität Wien, 2018.","short":"M. Villányi, Lizenzverträge mit Open-Access-Komponenten an österreichischen Bibliotheken, Universität Wien, 2018.","chicago":"Villányi, Márton. “Lizenzverträge mit Open-Access-Komponenten an österreichischen Bibliotheken.” Universität Wien, 2018.","ama":"Villányi M. Lizenzverträge mit Open-Access-Komponenten an österreichischen Bibliotheken. 2018.","ista":"Villányi M. 2018. Lizenzverträge mit Open-Access-Komponenten an österreichischen Bibliotheken. Universität Wien.","ieee":"M. Villányi, “Lizenzverträge mit Open-Access-Komponenten an österreichischen Bibliotheken,” Universität Wien, 2018.","apa":"Villányi, M. (2018). Lizenzverträge mit Open-Access-Komponenten an österreichischen Bibliotheken. Universität Wien."},"language":[{"iso":"ger"}],"supervisor":[{"full_name":"Kromp, Brigitte","last_name":"Kromp","first_name":"Brigitte"}],"date_published":"2018-04-06T00:00:00Z","day":"06","month":"04","publisher":"Universität Wien","department":[{"_id":"E-Lib"}],"status":"public","title":"Lizenzverträge mit Open-Access-Komponenten an österreichischen Bibliotheken","publication_status":"published","year":"2018","_id":"278","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","date_updated":"2024-02-21T13:44:07Z","date_created":"2018-12-11T11:45:34Z","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"5577"},{"status":"public","relation":"dissertation_contains","id":"5574"},{"id":"5578","status":"public","relation":"dissertation_contains"},{"id":"5579","relation":"dissertation_contains","status":"public"},{"status":"public","relation":"dissertation_contains","id":"5576"},{"id":"5575","status":"public","relation":"dissertation_contains"},{"relation":"dissertation_contains","status":"public","id":"5582"},{"id":"5581","status":"public","relation":"dissertation_contains"},{"id":"5580","status":"public","relation":"dissertation_contains"}]},"author":[{"full_name":"Villányi, Márton","first_name":"Márton","last_name":"Villányi","id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8126-0426"}],"type":"dissertation","publist_id":"7624","abstract":[{"lang":"eng","text":"Consortial subscription contracts regulate the digital access to publications between publishers and scientific libraries. However, since a couple of years the tendency towards a freely accessible publishing (Open Access) intensifies. As a consequence of this trend the contractual relationship between licensor and licensee is gradually changing as well: More and more contracts exercise influence on open access publishing. The present study attempts to compare Austrian examples of consortial licence contracts, which include components of open access. It describes the difference between pure subscription contracts and differing innovative deals including open access components. Thereby it becomes obvious that for the evaluation of this licence contracts new methods are needed. An essential new element of such analyses is the evaluation of the open access publication numbers. So this study tries to carry out such publication analyses for Austrian open access deals focusing on quantitative questions: How does the number of publications evolve? How does the open access share change? Publications reports of the publishers and database queries from Scopus form the data basis. The analysis of the data points out that differing approaches of contracts result in highly divergent results: Particular deals can prioritize a saving in costs or else the increase of the open access rate. It is to be assumed that within the following years further numerous open access deals will be negotiated. The finding of this study shall provide guidance."}]},{"type":"research_data","datarep_id":"113","abstract":[{"text":"Script to perform a simple exponential lifetime fit of a ROI on time stacks acquired with a FLIM X16 TCSPC detector (+example data)","lang":"eng"}],"file_date_updated":"2020-07-14T12:47:08Z","year":"2018","_id":"5588","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"Bio"}],"publisher":"Institute of Science and Technology Austria","status":"public","title":"Fluorescence lifetime analysis of FLIM X16 TCSPC data","ddc":["570"],"author":[{"full_name":"Hauschild, Robert","first_name":"Robert","last_name":"Hauschild","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9843-3522"}],"oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"IST-2018-113-v1+1_FLIMX16TCSPCLifeTimeFit.zip","file_size":47866557,"content_type":"application/x-zip-compressed","creator":"rhauschild","relation":"main_file","file_id":"6296","checksum":"a4e160054c9114600624cf89a925fd7d","date_updated":"2020-07-14T12:47:08Z","date_created":"2019-04-11T18:15:01Z"}],"date_updated":"2024-02-21T13:44:21Z","date_created":"2018-12-12T12:31:41Z","keyword":["FLIM","FRET","fluorescence lifetime imaging"],"article_processing_charge":"No","has_accepted_license":"1","month":"11","day":"07","oa":1,"tmp":{"short":"CC0 (1.0)","image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"citation":{"short":"R. Hauschild, (2018).","mla":"Hauschild, Robert. Fluorescence Lifetime Analysis of FLIM X16 TCSPC Data. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:0113.","chicago":"Hauschild, Robert. “Fluorescence Lifetime Analysis of FLIM X16 TCSPC Data.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:0113.","ama":"Hauschild R. Fluorescence lifetime analysis of FLIM X16 TCSPC data. 2018. doi:10.15479/AT:ISTA:0113","apa":"Hauschild, R. (2018). Fluorescence lifetime analysis of FLIM X16 TCSPC data. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:0113","ieee":"R. Hauschild, “Fluorescence lifetime analysis of FLIM X16 TCSPC data.” Institute of Science and Technology Austria, 2018.","ista":"Hauschild R. 2018. Fluorescence lifetime analysis of FLIM X16 TCSPC data, Institute of Science and Technology Austria, 10.15479/AT:ISTA:0113."},"doi":"10.15479/AT:ISTA:0113","date_published":"2018-11-07T00:00:00Z"},{"has_accepted_license":"1","article_processing_charge":"No","day":"16","month":"01","keyword":["Publication analysis","Bibliography","Open Access"],"doi":"10.15479/AT:ISTA:94","date_published":"2018-01-16T00:00:00Z","oa":1,"tmp":{"short":"CC0 (1.0)","image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"citation":{"chicago":"Villányi, Márton. “Taylor&Francis Austrian Publications 2013-2017.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:94.","short":"M. Villányi, (2018).","mla":"Villányi, Márton. Taylor&Francis Austrian Publications 2013-2017. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:94.","apa":"Villányi, M. (2018). Taylor&Francis Austrian Publications 2013-2017. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:94","ieee":"M. Villányi, “Taylor&Francis Austrian Publications 2013-2017.” Institute of Science and Technology Austria, 2018.","ista":"Villányi M. 2018. Taylor&Francis Austrian Publications 2013-2017, Institute of Science and Technology Austria, 10.15479/AT:ISTA:94.","ama":"Villányi M. Taylor&Francis Austrian Publications 2013-2017. 2018. doi:10.15479/AT:ISTA:94"},"file_date_updated":"2020-07-14T12:47:07Z","abstract":[{"text":"Data on Austrian open access publication output at Taylor&Francis from 2013-2017 including data analysis.","lang":"eng"}],"type":"research_data","datarep_id":"94","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"278"}]},"author":[{"orcid":"0000-0001-8126-0426","id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","last_name":"Villányi","first_name":"Márton","full_name":"Villányi, Márton"}],"oa_version":"Submitted Version","file":[{"file_id":"5617","relation":"main_file","checksum":"3e000daf15d7eb9a47b234f3d20dd4b8","date_created":"2018-12-12T13:02:59Z","date_updated":"2020-07-14T12:47:07Z","access_level":"open_access","file_name":"IST-2018-94-v1+1_Taylor_Francis_Austrian_Publications_2013-2017.zip","creator":"system","content_type":"application/zip","file_size":2552326}],"date_created":"2018-12-12T12:31:39Z","date_updated":"2024-02-21T13:43:41Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5582","year":"2018","department":[{"_id":"E-Lib"}],"publisher":"Institute of Science and Technology Austria","status":"public","title":"Taylor&Francis Austrian Publications 2013-2017","ddc":["020"]},{"keyword":["Publication analysis","Bibliography","Open Access"],"day":"16","month":"01","article_processing_charge":"No","has_accepted_license":"1","tmp":{"short":"CC0 (1.0)","image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"oa":1,"citation":{"ama":"Villányi M. Springer Austrian Publications 2013-2016. 2018. doi:10.15479/AT:ISTA:93","ista":"Villányi M. 2018. Springer Austrian Publications 2013-2016, Institute of Science and Technology Austria, 10.15479/AT:ISTA:93.","ieee":"M. Villányi, “Springer Austrian Publications 2013-2016.” Institute of Science and Technology Austria, 2018.","apa":"Villányi, M. (2018). Springer Austrian Publications 2013-2016. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:93","mla":"Villányi, Márton. Springer Austrian Publications 2013-2016. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:93.","short":"M. Villányi, (2018).","chicago":"Villányi, Márton. “Springer Austrian Publications 2013-2016.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:93."},"date_published":"2018-01-16T00:00:00Z","doi":"10.15479/AT:ISTA:93","datarep_id":"93","type":"research_data","file_date_updated":"2020-07-14T12:47:06Z","abstract":[{"text":"Data on Austrian open access publication output at Springer from 2013-2016 including data analysis.","lang":"ger"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5581","year":"2018","status":"public","ddc":["020"],"title":"Springer Austrian Publications 2013-2016","publisher":"Institute of Science and Technology Austria","department":[{"_id":"E-Lib"}],"author":[{"full_name":"Villányi, Márton","id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8126-0426","first_name":"Márton","last_name":"Villányi"}],"related_material":{"record":[{"id":"278","relation":"part_of_dissertation","status":"public"}]},"date_updated":"2024-02-21T13:43:53Z","date_created":"2018-12-12T12:31:39Z","file":[{"checksum":"7cc8274975162a99ea4681dc344b927d","date_created":"2018-12-12T13:05:20Z","date_updated":"2020-07-14T12:47:06Z","relation":"main_file","file_id":"5646","content_type":"application/zip","file_size":304018,"creator":"system","access_level":"open_access","file_name":"IST-2018-93-v1+1_Springer_Austrian_Publications_2013-2016.zip"}],"oa_version":"Submitted Version"}]