[{"type":"journal_article","abstract":[{"text":"African cichlids display a remarkable assortment of jaw morphologies, pigmentation patterns, and mating behaviors. In addition to this previously documented diversity, recent studies have documented a rich diversity of sex chromosomes within these fishes. Here we review the known sex-determination network within vertebrates, and the extraordinary number of sex chromosomes systems segregating in African cichlids. We also propose a model for understanding the unusual number of sex chromosome systems within this clade.","lang":"eng"}],"issue":"10","status":"public","ddc":["570"],"title":"Unusual diversity of sex chromosomes in African cichlid fishes","intvolume":" 9","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"63","file":[{"checksum":"bec527692e2c9b56919c0429634ff337","date_updated":"2020-07-14T12:47:27Z","date_created":"2018-12-18T09:54:46Z","relation":"main_file","file_id":"5743","content_type":"application/pdf","file_size":1415791,"creator":"dernst","access_level":"open_access","file_name":"2018_Genes_Gammerdinger.pdf"}],"oa_version":"Published Version","scopus_import":"1","day":"04","has_accepted_license":"1","article_processing_charge":"No","publication":"Genes","citation":{"mla":"Gammerdinger, William J., and Thomas Kocher. “Unusual Diversity of Sex Chromosomes in African Cichlid Fishes.” Genes, vol. 9, no. 10, 480, MDPI AG, 2018, doi:10.3390/genes9100480.","short":"W.J. Gammerdinger, T. Kocher, Genes 9 (2018).","chicago":"Gammerdinger, William J, and Thomas Kocher. “Unusual Diversity of Sex Chromosomes in African Cichlid Fishes.” Genes. MDPI AG, 2018. https://doi.org/10.3390/genes9100480.","ama":"Gammerdinger WJ, Kocher T. Unusual diversity of sex chromosomes in African cichlid fishes. Genes. 2018;9(10). doi:10.3390/genes9100480","ista":"Gammerdinger WJ, Kocher T. 2018. Unusual diversity of sex chromosomes in African cichlid fishes. Genes. 9(10), 480.","ieee":"W. J. Gammerdinger and T. Kocher, “Unusual diversity of sex chromosomes in African cichlid fishes,” Genes, vol. 9, no. 10. MDPI AG, 2018.","apa":"Gammerdinger, W. J., & Kocher, T. (2018). Unusual diversity of sex chromosomes in African cichlid fishes. Genes. MDPI AG. https://doi.org/10.3390/genes9100480"},"date_published":"2018-10-04T00:00:00Z","article_number":"480","license":"https://creativecommons.org/licenses/by/4.0/","file_date_updated":"2020-07-14T12:47:27Z","publist_id":"7991","ec_funded":1,"publication_status":"published","publisher":"MDPI AG","department":[{"_id":"BeVi"}],"acknowledgement":"NSF DEB-1830753 and ISTPlus Fellowship","year":"2018","date_created":"2018-12-11T11:44:26Z","date_updated":"2023-09-19T10:37:03Z","volume":9,"author":[{"full_name":"Gammerdinger, William J","last_name":"Gammerdinger","first_name":"William J","orcid":"0000-0001-9638-1220","id":"3A7E01BC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kocher","first_name":"Thomas","full_name":"Kocher, Thomas"}],"month":"10","isi":1,"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"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":["000448656700018"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.3390/genes9100480"},{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"296","status":"public","title":"Weak ergodicity breaking from quantum many-body scars","intvolume":" 14","oa_version":"Submitted Version","type":"journal_article","abstract":[{"lang":"eng","text":"The thermodynamic description of many-particle systems rests on the assumption of ergodicity, the ability of a system to explore all allowed configurations in the phase space. Recent studies on many-body localization have revealed the existence of systems that strongly violate ergodicity in the presence of quenched disorder. Here, we demonstrate that ergodicity can be weakly broken by a different mechanism, arising from the presence of special eigenstates in the many-body spectrum that are reminiscent of quantum scars in chaotic non-interacting systems. In the single-particle case, quantum scars correspond to wavefunctions that concentrate in the vicinity of unstable periodic classical trajectories. We show that many-body scars appear in the Fibonacci chain, a model with a constrained local Hilbert space that has recently been experimentally realized in a Rydberg-atom quantum simulator. The quantum scarred eigenstates are embedded throughout the otherwise thermalizing many-body spectrum but lead to direct experimental signatures, as we show for periodic recurrences that reproduce those observed in the experiment. Our results suggest that scarred many-body bands give rise to a new universality class of quantum dynamics, opening up opportunities for the creation of novel states with long-lived coherence in systems that are now experimentally realizable."}],"publication":"Nature Physics","citation":{"ama":"Turner C, Michailidis A, Abanin D, Serbyn M, Papić Z. Weak ergodicity breaking from quantum many-body scars. Nature Physics. 2018;14:745-749. doi:10.1038/s41567-018-0137-5","ista":"Turner C, Michailidis A, Abanin D, Serbyn M, Papić Z. 2018. Weak ergodicity breaking from quantum many-body scars. Nature Physics. 14, 745–749.","apa":"Turner, C., Michailidis, A., Abanin, D., Serbyn, M., & Papić, Z. (2018). Weak ergodicity breaking from quantum many-body scars. Nature Physics. Nature Publishing Group. https://doi.org/10.1038/s41567-018-0137-5","ieee":"C. Turner, A. Michailidis, D. Abanin, M. Serbyn, and Z. Papić, “Weak ergodicity breaking from quantum many-body scars,” Nature Physics, vol. 14. Nature Publishing Group, pp. 745–749, 2018.","mla":"Turner, Christopher, et al. “Weak Ergodicity Breaking from Quantum Many-Body Scars.” Nature Physics, vol. 14, Nature Publishing Group, 2018, pp. 745–49, doi:10.1038/s41567-018-0137-5.","short":"C. Turner, A. Michailidis, D. Abanin, M. Serbyn, Z. Papić, Nature Physics 14 (2018) 745–749.","chicago":"Turner, Christopher, Alexios Michailidis, Dmitry Abanin, Maksym Serbyn, and Zlatko Papić. “Weak Ergodicity Breaking from Quantum Many-Body Scars.” Nature Physics. Nature Publishing Group, 2018. https://doi.org/10.1038/s41567-018-0137-5."},"article_type":"original","page":"745 - 749","date_published":"2018-05-14T00:00:00Z","scopus_import":"1","day":"14","article_processing_charge":"No","acknowledgement":"C.J.T., A.M. and Z.P. acknowledge support from EPSRC grants EP/P009409/1 and EP/M50807X/1, and Royal Society Research Grant RG160635. D.A. acknowledges support from the Swiss National Science Foundation.","year":"2018","publication_status":"published","department":[{"_id":"MaSe"}],"publisher":"Nature Publishing Group","author":[{"full_name":"Turner, Christopher","last_name":"Turner","first_name":"Christopher"},{"id":"36EBAD38-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8443-1064","first_name":"Alexios","last_name":"Michailidis","full_name":"Michailidis, Alexios"},{"last_name":"Abanin","first_name":"Dmitry","full_name":"Abanin, Dmitry"},{"first_name":"Maksym","last_name":"Serbyn","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2399-5827","full_name":"Serbyn, Maksym"},{"first_name":"Zlatko","last_name":"Papić","full_name":"Papić, Zlatko"}],"date_updated":"2023-09-19T10:37:55Z","date_created":"2018-12-11T11:45:40Z","volume":14,"publist_id":"7585","external_id":{"isi":["000438253600028"]},"main_file_link":[{"url":"http://eprints.whiterose.ac.uk/130860/","open_access":"1"}],"oa":1,"quality_controlled":"1","isi":1,"doi":"10.1038/s41567-018-0137-5","language":[{"iso":"eng"}],"month":"05"},{"article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"2018-08-01T00:00:00Z","citation":{"chicago":"Bodova, Katarina, Jan Haskovec, and Peter Markowich. “Well Posedness and Maximum Entropy Approximation for the Dynamics of Quantitative Traits.” Physica D: Nonlinear Phenomena. Elsevier, 2018. https://doi.org/10.1016/j.physd.2017.10.015.","mla":"Bodova, Katarina, et al. “Well Posedness and Maximum Entropy Approximation for the Dynamics of Quantitative Traits.” Physica D: Nonlinear Phenomena, vol. 376–377, Elsevier, 2018, pp. 108–20, doi:10.1016/j.physd.2017.10.015.","short":"K. Bodova, J. Haskovec, P. Markowich, Physica D: Nonlinear Phenomena 376–377 (2018) 108–120.","ista":"Bodova K, Haskovec J, Markowich P. 2018. Well posedness and maximum entropy approximation for the dynamics of quantitative traits. Physica D: Nonlinear Phenomena. 376–377, 108–120.","apa":"Bodova, K., Haskovec, J., & Markowich, P. (2018). Well posedness and maximum entropy approximation for the dynamics of quantitative traits. Physica D: Nonlinear Phenomena. Elsevier. https://doi.org/10.1016/j.physd.2017.10.015","ieee":"K. Bodova, J. Haskovec, and P. Markowich, “Well posedness and maximum entropy approximation for the dynamics of quantitative traits,” Physica D: Nonlinear Phenomena, vol. 376–377. Elsevier, pp. 108–120, 2018.","ama":"Bodova K, Haskovec J, Markowich P. Well posedness and maximum entropy approximation for the dynamics of quantitative traits. Physica D: Nonlinear Phenomena. 2018;376-377:108-120. doi:10.1016/j.physd.2017.10.015"},"publication":"Physica D: Nonlinear Phenomena","page":"108-120","abstract":[{"text":"We study the Fokker-Planck equation derived in the large system limit of the Markovian process describing the dynamics of quantitative traits. The Fokker-Planck equation is posed on a bounded domain and its transport and diffusion coefficients vanish on the domain's boundary. We first argue that, despite this degeneracy, the standard no-flux boundary condition is valid. We derive the weak formulation of the problem and prove the existence and uniqueness of its solutions by constructing the corresponding contraction semigroup on a suitable function space. Then, we prove that for the parameter regime with high enough mutation rate the problem exhibits a positive spectral gap, which implies exponential convergence to equilibrium.Next, we provide a simple derivation of the so-called Dynamic Maximum Entropy (DynMaxEnt) method for approximation of observables (moments) of the Fokker-Planck solution, which can be interpreted as a nonlinear Galerkin approximation. The limited applicability of the DynMaxEnt method inspires us to introduce its modified version that is valid for the whole range of admissible parameters. Finally, we present several numerical experiments to demonstrate the performance of both the original and modified DynMaxEnt methods. We observe that in the parameter regimes where both methods are valid, the modified one exhibits slightly better approximation properties compared to the original one.","lang":"eng"}],"type":"journal_article","oa_version":"Submitted Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"607","status":"public","title":"Well posedness and maximum entropy approximation for the dynamics of quantitative traits","month":"08","doi":"10.1016/j.physd.2017.10.015","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1704.08757"}],"external_id":{"arxiv":["1704.08757"],"isi":["000437962900012"]},"quality_controlled":"1","isi":1,"publist_id":"7198","author":[{"full_name":"Bodova, Katarina","id":"2BA24EA0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7214-0171","first_name":"Katarina","last_name":"Bodova"},{"first_name":"Jan","last_name":"Haskovec","full_name":"Haskovec, Jan"},{"first_name":"Peter","last_name":"Markowich","full_name":"Markowich, Peter"}],"volume":"376-377","date_updated":"2023-09-19T10:38:34Z","date_created":"2018-12-11T11:47:28Z","year":"2018","acknowledgement":"JH and PM are funded by KAUST baseline funds and grant no. 1000000193 .\r\nWe thank Nicholas Barton (IST Austria) for his useful comments and suggestions. \r\n\r\n","publisher":"Elsevier","department":[{"_id":"NiBa"},{"_id":"GaTk"}],"publication_status":"published"},{"citation":{"ama":"Fratini F, Safari L, Amaro P, Santos J. Two-photon processes based on quantum commutators. Physical Review A - Atomic, Molecular, and Optical Physics. 2018;97(4). doi:10.1103/PhysRevA.97.043842","apa":"Fratini, F., Safari, L., Amaro, P., & Santos, J. (2018). Two-photon processes based on quantum commutators. Physical Review A - Atomic, Molecular, and Optical Physics. American Physical Society. https://doi.org/10.1103/PhysRevA.97.043842","ieee":"F. Fratini, L. Safari, P. Amaro, and J. Santos, “Two-photon processes based on quantum commutators,” Physical Review A - Atomic, Molecular, and Optical Physics, vol. 97, no. 4. American Physical Society, 2018.","ista":"Fratini F, Safari L, Amaro P, Santos J. 2018. Two-photon processes based on quantum commutators. Physical Review A - Atomic, Molecular, and Optical Physics. 97(4).","short":"F. Fratini, L. Safari, P. Amaro, J. Santos, Physical Review A - Atomic, Molecular, and Optical Physics 97 (2018).","mla":"Fratini, Filippo, et al. “Two-Photon Processes Based on Quantum Commutators.” Physical Review A - Atomic, Molecular, and Optical Physics, vol. 97, no. 4, American Physical Society, 2018, doi:10.1103/PhysRevA.97.043842.","chicago":"Fratini, Filippo, Laleh Safari, Pedro Amaro, and José Santos. “Two-Photon Processes Based on Quantum Commutators.” Physical Review A - Atomic, Molecular, and Optical Physics. American Physical Society, 2018. https://doi.org/10.1103/PhysRevA.97.043842."},"publication":"Physical Review A - Atomic, Molecular, and Optical Physics","date_published":"2018-04-18T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"18","_id":"294","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 97","status":"public","title":"Two-photon processes based on quantum commutators","oa_version":"Submitted Version","type":"journal_article","issue":"4","abstract":[{"lang":"eng","text":"We developed a method to calculate two-photon processes in quantum mechanics that replaces the infinite summation over the intermediate states by a perturbation expansion. This latter consists of a series of commutators that involve position, momentum, and Hamiltonian quantum operators. We analyzed several single- and many-particle cases for which a closed-form solution to the perturbation expansion exists, as well as more complicated cases for which a solution is found by convergence. Throughout the article, Rayleigh and Raman scattering are taken as examples of two-photon processes. The present method provides a clear distinction between the Thomson scattering, regarded as classical scattering, and quantum contributions. Such a distinction lets us derive general results concerning light scattering. Finally, possible extensions to the developed formalism are discussed."}],"main_file_link":[{"url":"https://arxiv.org/abs/1801.06892","open_access":"1"}],"oa":1,"external_id":{"arxiv":["1801.06892"],"isi":["000430296800008"]},"project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"quality_controlled":"1","isi":1,"doi":"10.1103/PhysRevA.97.043842","language":[{"iso":"eng"}],"month":"04","year":"2018","department":[{"_id":"MiLe"}],"publisher":"American Physical Society","publication_status":"published","author":[{"full_name":"Fratini, Filippo","first_name":"Filippo","last_name":"Fratini"},{"last_name":"Safari","first_name":"Laleh","id":"3C325E5E-F248-11E8-B48F-1D18A9856A87","full_name":"Safari, Laleh"},{"full_name":"Amaro, Pedro","last_name":"Amaro","first_name":"Pedro"},{"last_name":"Santos","first_name":"José","full_name":"Santos, José"}],"volume":97,"date_updated":"2023-09-19T10:17:56Z","date_created":"2018-12-11T11:45:40Z","publist_id":"7587","ec_funded":1},{"_id":"606","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 35","status":"public","title":"Well-posedness for mean-field evolutions arising in superconductivity","oa_version":"Submitted Version","type":"journal_article","issue":"5","abstract":[{"text":"We establish the existence of a global solution for a new family of fluid-like equations, which are obtained in certain regimes in as the mean-field evolution of the supercurrent density in a (2D section of a) type-II superconductor with pinning and with imposed electric current. We also consider general vortex-sheet initial data, and investigate the uniqueness and regularity properties of the solution. For some choice of parameters, the equation under investigation coincides with the so-called lake equation from 2D shallow water fluid dynamics, and our analysis then leads to a new existence result for rough initial data.","lang":"eng"}],"citation":{"ama":"Duerinckx M, Fischer JL. Well-posedness for mean-field evolutions arising in superconductivity. Annales de l’Institut Henri Poincare (C) Non Linear Analysis. 2018;35(5):1267-1319. doi:10.1016/j.anihpc.2017.11.004","apa":"Duerinckx, M., & Fischer, J. L. (2018). Well-posedness for mean-field evolutions arising in superconductivity. Annales de l’Institut Henri Poincare (C) Non Linear Analysis. Elsevier. https://doi.org/10.1016/j.anihpc.2017.11.004","ieee":"M. Duerinckx and J. L. Fischer, “Well-posedness for mean-field evolutions arising in superconductivity,” Annales de l’Institut Henri Poincare (C) Non Linear Analysis, vol. 35, no. 5. Elsevier, pp. 1267–1319, 2018.","ista":"Duerinckx M, Fischer JL. 2018. Well-posedness for mean-field evolutions arising in superconductivity. Annales de l’Institut Henri Poincare (C) Non Linear Analysis. 35(5), 1267–1319.","short":"M. Duerinckx, J.L. Fischer, Annales de l’Institut Henri Poincare (C) Non Linear Analysis 35 (2018) 1267–1319.","mla":"Duerinckx, Mitia, and Julian L. Fischer. “Well-Posedness for Mean-Field Evolutions Arising in Superconductivity.” Annales de l’Institut Henri Poincare (C) Non Linear Analysis, vol. 35, no. 5, Elsevier, 2018, pp. 1267–319, doi:10.1016/j.anihpc.2017.11.004.","chicago":"Duerinckx, Mitia, and Julian L Fischer. “Well-Posedness for Mean-Field Evolutions Arising in Superconductivity.” Annales de l’Institut Henri Poincare (C) Non Linear Analysis. Elsevier, 2018. https://doi.org/10.1016/j.anihpc.2017.11.004."},"publication":"Annales de l'Institut Henri Poincare (C) Non Linear Analysis","page":"1267-1319","date_published":"2018-08-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01","acknowledgement":"The work of the author is supported by F.R.S.-FNRS ( Fonds de la Recherche Scientifique - FNRS ) through a Research Fellowship.\r\n\r\n","year":"2018","publisher":"Elsevier","department":[{"_id":"JuFi"}],"publication_status":"published","author":[{"last_name":"Duerinckx","first_name":"Mitia","full_name":"Duerinckx, Mitia"},{"full_name":"Fischer, Julian L","last_name":"Fischer","first_name":"Julian L","orcid":"0000-0002-0479-558X","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87"}],"volume":35,"date_updated":"2023-09-19T10:39:09Z","date_created":"2018-12-11T11:47:27Z","publist_id":"7199","external_id":{"arxiv":["1607.00268"],"isi":["000437975500005"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1607.00268"}],"oa":1,"isi":1,"quality_controlled":"1","doi":"10.1016/j.anihpc.2017.11.004","language":[{"iso":"eng"}],"month":"08"},{"scopus_import":"1","day":"30","has_accepted_license":"1","article_processing_charge":"No","publication":"2018 International Conference on Embedded Software","citation":{"apa":"Bakhirkin, A., Ferrere, T., Henzinger, T. A., & Nickovicl, D. (2018). Keynote: The first-order logic of signals. In 2018 International Conference on Embedded Software (pp. 1–10). Turin, Italy: IEEE. https://doi.org/10.1109/emsoft.2018.8537203","ieee":"A. Bakhirkin, T. Ferrere, T. A. Henzinger, and D. Nickovicl, “Keynote: The first-order logic of signals,” in 2018 International Conference on Embedded Software, Turin, Italy, 2018, pp. 1–10.","ista":"Bakhirkin A, Ferrere T, Henzinger TA, Nickovicl D. 2018. Keynote: The first-order logic of signals. 2018 International Conference on Embedded Software. EMSOFT: International Conference on Embedded Software, 1–10.","ama":"Bakhirkin A, Ferrere T, Henzinger TA, Nickovicl D. Keynote: The first-order logic of signals. In: 2018 International Conference on Embedded Software. IEEE; 2018:1-10. doi:10.1109/emsoft.2018.8537203","chicago":"Bakhirkin, Alexey, Thomas Ferrere, Thomas A Henzinger, and Deian Nickovicl. “Keynote: The First-Order Logic of Signals.” In 2018 International Conference on Embedded Software, 1–10. IEEE, 2018. https://doi.org/10.1109/emsoft.2018.8537203.","short":"A. Bakhirkin, T. Ferrere, T.A. Henzinger, D. Nickovicl, in:, 2018 International Conference on Embedded Software, IEEE, 2018, pp. 1–10.","mla":"Bakhirkin, Alexey, et al. “Keynote: The First-Order Logic of Signals.” 2018 International Conference on Embedded Software, IEEE, 2018, pp. 1–10, doi:10.1109/emsoft.2018.8537203."},"page":"1-10","date_published":"2018-09-30T00:00:00Z","type":"conference","abstract":[{"text":"Formalizing properties of systems with continuous dynamics is a challenging task. In this paper, we propose a formal framework for specifying and monitoring rich temporal properties of real-valued signals. We introduce signal first-order logic (SFO) as a specification language that combines first-order logic with linear-real arithmetic and unary function symbols interpreted as piecewise-linear signals. We first show that while the satisfiability problem for SFO is undecidable, its membership and monitoring problems are decidable. We develop an offline monitoring procedure for SFO that has polynomial complexity in the size of the input trace and the specification, for a fixed number of quantifiers and function symbols. We show that the algorithm has computation time linear in the size of the input trace for the important fragment of bounded-response specifications interpreted over input traces with finite variability. We can use our results to extend signal temporal logic with first-order quantifiers over time and value parameters, while preserving its efficient monitoring. We finally demonstrate the practical appeal of our logic through a case study in the micro-electronics domain.","lang":"eng"}],"_id":"5959","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","title":"Keynote: The first-order logic of signals","ddc":["000"],"file":[{"access_level":"open_access","file_name":"2018_EMSOFT_Bakhirkin.pdf","file_size":338006,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"7839","checksum":"234a33ad9055b3458fcdda6af251b33a","date_created":"2020-05-14T16:01:29Z","date_updated":"2020-07-14T12:47:13Z"}],"oa_version":"Published Version","month":"09","publication_identifier":{"isbn":["9781538655603"]},"external_id":{"isi":["000492828500005"]},"oa":1,"isi":1,"quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"conference":{"start_date":"2018-09-30","location":"Turin, Italy","end_date":"2018-10-05","name":"EMSOFT: International Conference on Embedded Software"},"doi":"10.1109/emsoft.2018.8537203","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:47:13Z","year":"2018","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"IEEE","author":[{"full_name":"Bakhirkin, Alexey","first_name":"Alexey","last_name":"Bakhirkin"},{"full_name":"Ferrere, Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5199-3143","first_name":"Thomas","last_name":"Ferrere"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Deian","last_name":"Nickovicl","full_name":"Nickovicl, Deian"}],"date_updated":"2023-09-19T10:41:29Z","date_created":"2019-02-13T09:19:28Z"},{"article_processing_charge":"No","day":"23","scopus_import":"1","date_published":"2018-07-23T00:00:00Z","page":"169-178","citation":{"ama":"Alistarh D-A, De Sa C, Konstantinov NH. The convergence of stochastic gradient descent in asynchronous shared memory. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. ACM Press; 2018:169-178. doi:10.1145/3212734.3212763","ieee":"D.-A. Alistarh, C. De Sa, and N. H. Konstantinov, “The convergence of stochastic gradient descent in asynchronous shared memory,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, Egham, United Kingdom, 2018, pp. 169–178.","apa":"Alistarh, D.-A., De Sa, C., & Konstantinov, N. H. (2018). The convergence of stochastic gradient descent in asynchronous shared memory. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18 (pp. 169–178). Egham, United Kingdom: ACM Press. https://doi.org/10.1145/3212734.3212763","ista":"Alistarh D-A, De Sa C, Konstantinov NH. 2018. The convergence of stochastic gradient descent in asynchronous shared memory. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. PODC: Principles of Distributed Computing, 169–178.","short":"D.-A. Alistarh, C. De Sa, N.H. Konstantinov, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 169–178.","mla":"Alistarh, Dan-Adrian, et al. “The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory.” Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 169–78, doi:10.1145/3212734.3212763.","chicago":"Alistarh, Dan-Adrian, Christopher De Sa, and Nikola H Konstantinov. “The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, 169–78. ACM Press, 2018. https://doi.org/10.1145/3212734.3212763."},"publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","abstract":[{"text":"Stochastic Gradient Descent (SGD) is a fundamental algorithm in machine learning, representing the optimization backbone for training several classic models, from regression to neural networks. Given the recent practical focus on distributed machine learning, significant work has been dedicated to the convergence properties of this algorithm under the inconsistent and noisy updates arising from execution in a distributed environment. However, surprisingly, the convergence properties of this classic algorithm in the standard shared-memory model are still not well-understood. In this work, we address this gap, and provide new convergence bounds for lock-free concurrent stochastic gradient descent, executing in the classic asynchronous shared memory model, against a strong adaptive adversary. Our results give improved upper and lower bounds on the \"price of asynchrony'' when executing the fundamental SGD algorithm in a concurrent setting. They show that this classic optimization tool can converge faster and with a wider range of parameters than previously known under asynchronous iterations. At the same time, we exhibit a fundamental trade-off between the maximum delay in the system and the rate at which SGD can converge, which governs the set of parameters under which this algorithm can still work efficiently.","lang":"eng"}],"type":"conference","oa_version":"Preprint","status":"public","title":"The convergence of stochastic gradient descent in asynchronous shared memory","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5962","publication_identifier":{"isbn":["9781450357951"]},"month":"07","language":[{"iso":"eng"}],"doi":"10.1145/3212734.3212763","conference":{"name":"PODC: Principles of Distributed Computing","start_date":"2018-07-23","location":"Egham, United Kingdom","end_date":"2018-07-27"},"quality_controlled":"1","isi":1,"external_id":{"arxiv":["1803.08841"],"isi":["000458186900022"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1803.08841"}],"date_updated":"2023-09-19T10:42:53Z","date_created":"2019-02-13T09:58:58Z","author":[{"full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"},{"full_name":"De Sa, Christopher","last_name":"De Sa","first_name":"Christopher"},{"full_name":"Konstantinov, Nikola H","first_name":"Nikola H","last_name":"Konstantinov","id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"DaAl"}],"publisher":"ACM Press","publication_status":"published","year":"2018"},{"doi":"10.1098/rsif.2018.0395","language":[{"iso":"eng"}],"external_id":{"isi":["000456783800002"],"arxiv":["1612.01605"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1612.01605"}],"isi":1,"quality_controlled":"1","month":"12","publication_identifier":{"issn":["17425689"]},"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":"Seoane, Luís F.","last_name":"Seoane","first_name":"Luís F."},{"last_name":"Solé","first_name":"Ricard","full_name":"Solé, Ricard"}],"date_created":"2019-01-20T22:59:19Z","date_updated":"2023-09-19T10:40:38Z","volume":15,"year":"2018","publication_status":"published","department":[{"_id":"EdHa"}],"publisher":"Royal Society Publishing","article_number":"20180395","date_published":"2018-12-12T00:00:00Z","publication":"Journal of the Royal Society Interface","citation":{"chicago":"Corominas-Murtra, Bernat, Luís F. Seoane, and Ricard Solé. “Zipf’s Law, Unbounded Complexity and Open-Ended Evolution.” Journal of the Royal Society Interface. Royal Society Publishing, 2018. https://doi.org/10.1098/rsif.2018.0395.","short":"B. Corominas-Murtra, L.F. Seoane, R. Solé, Journal of the Royal Society Interface 15 (2018).","mla":"Corominas-Murtra, Bernat, et al. “Zipf’s Law, Unbounded Complexity and Open-Ended Evolution.” Journal of the Royal Society Interface, vol. 15, no. 149, 20180395, Royal Society Publishing, 2018, doi:10.1098/rsif.2018.0395.","apa":"Corominas-Murtra, B., Seoane, L. F., & Solé, R. (2018). Zipf’s Law, unbounded complexity and open-ended evolution. Journal of the Royal Society Interface. Royal Society Publishing. https://doi.org/10.1098/rsif.2018.0395","ieee":"B. Corominas-Murtra, L. F. Seoane, and R. Solé, “Zipf’s Law, unbounded complexity and open-ended evolution,” Journal of the Royal Society Interface, vol. 15, no. 149. Royal Society Publishing, 2018.","ista":"Corominas-Murtra B, Seoane LF, Solé R. 2018. Zipf’s Law, unbounded complexity and open-ended evolution. Journal of the Royal Society Interface. 15(149), 20180395.","ama":"Corominas-Murtra B, Seoane LF, Solé R. Zipf’s Law, unbounded complexity and open-ended evolution. Journal of the Royal Society Interface. 2018;15(149). doi:10.1098/rsif.2018.0395"},"day":"12","article_processing_charge":"No","scopus_import":"1","oa_version":"Preprint","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5860","status":"public","title":"Zipf's Law, unbounded complexity and open-ended evolution","intvolume":" 15","abstract":[{"text":"A major problem for evolutionary theory is understanding the so-called open-ended nature of evolutionary change, from its definition to its origins. Open-ended evolution (OEE) refers to the unbounded increase in complexity that seems to characterize evolution on multiple scales. This property seems to be a characteristic feature of biological and technological evolution and is strongly tied to the generative potential associated with combinatorics, which allows the system to grow and expand their available state spaces. Interestingly, many complex systems presumably displaying OEE, from language to proteins, share a common statistical property: the presence of Zipf's Law. Given an inventory of basic items (such as words or protein domains) required to build more complex structures (sentences or proteins) Zipf's Law tells us that most of these elements are rare whereas a few of them are extremely common. Using algorithmic information theory, in this paper we provide a fundamental definition for open-endedness, which can be understood as postulates. Its statistical counterpart, based on standard Shannon information theory, has the structure of a variational problem which is shown to lead to Zipf's Law as the expected consequence of an evolutionary process displaying OEE. We further explore the problem of information conservation through an OEE process and we conclude that statistical information (standard Shannon information) is not conserved, resulting in the paradoxical situation in which the increase of information content has the effect of erasing itself. We prove that this paradox is solved if we consider non-statistical forms of information. This last result implies that standard information theory may not be a suitable theoretical framework to explore the persistence and increase of the information content in OEE systems.","lang":"eng"}],"issue":"149","type":"journal_article"},{"page":"487-488","isi":1,"quality_controlled":"1","citation":{"ama":"Alistarh D-A. A brief tutorial on distributed and concurrent machine learning. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. ACM Press; 2018:487-488. doi:10.1145/3212734.3212798","ista":"Alistarh D-A. 2018. A brief tutorial on distributed and concurrent machine learning. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. PODC: Principles of Distributed Computing, 487–488.","apa":"Alistarh, D.-A. (2018). A brief tutorial on distributed and concurrent machine learning. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18 (pp. 487–488). Egham, United Kingdom: ACM Press. https://doi.org/10.1145/3212734.3212798","ieee":"D.-A. Alistarh, “A brief tutorial on distributed and concurrent machine learning,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, Egham, United Kingdom, 2018, pp. 487–488.","mla":"Alistarh, Dan-Adrian. “A Brief Tutorial on Distributed and Concurrent Machine Learning.” Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 487–88, doi:10.1145/3212734.3212798.","short":"D.-A. Alistarh, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 487–488.","chicago":"Alistarh, Dan-Adrian. “A Brief Tutorial on Distributed and Concurrent Machine Learning.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, 487–88. ACM Press, 2018. https://doi.org/10.1145/3212734.3212798."},"external_id":{"isi":["000458186900063"]},"publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","language":[{"iso":"eng"}],"date_published":"2018-07-27T00:00:00Z","doi":"10.1145/3212734.3212798","conference":{"name":"PODC: Principles of Distributed Computing","end_date":"2018-07-27","start_date":"2018-07-23","location":"Egham, United Kingdom"},"scopus_import":"1","publication_identifier":{"isbn":["9781450357951"]},"article_processing_charge":"No","month":"07","day":"27","department":[{"_id":"DaAl"}],"publisher":"ACM Press","status":"public","publication_status":"published","title":"A brief tutorial on distributed and concurrent machine learning","year":"2018","_id":"5961","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"None","date_updated":"2023-09-19T10:42:28Z","date_created":"2019-02-13T09:48:55Z","author":[{"full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"}],"type":"conference","abstract":[{"text":"The area of machine learning has made considerable progress over the past decade, enabled by the widespread availability of large datasets, as well as by improved algorithms and models. Given the large computational demands of machine learning workloads, parallelism, implemented either through single-node concurrency or through multi-node distribution, has been a third key ingredient to advances in machine learning.\r\nThe goal of this tutorial is to provide the audience with an overview of standard distribution techniques in machine learning, with an eye towards the intriguing trade-offs between synchronization and communication costs of distributed machine learning algorithms, on the one hand, and their convergence, on the other.The tutorial will focus on parallelization strategies for the fundamental stochastic gradient descent (SGD) algorithm, which is a key tool when training machine learning models, from classical instances such as linear regression, to state-of-the-art neural network architectures.\r\nThe tutorial will describe the guarantees provided by this algorithm in the sequential case, and then move on to cover both shared-memory and message-passing parallelization strategies, together with the guarantees they provide, and corresponding trade-offs. The presentation will conclude with a broad overview of ongoing research in distributed and concurrent machine learning. The tutorial will assume no prior knowledge beyond familiarity with basic concepts in algebra and analysis.\r\n","lang":"eng"}]},{"type":"journal_article","abstract":[{"lang":"eng","text":"In this paper we present a reliable method to verify the existence of loops along the uncertain trajectory of a robot, based on proprioceptive measurements only, within a bounded-error context. The loop closure detection is one of the key points in simultaneous localization and mapping (SLAM) methods, especially in homogeneous environments with difficult scenes recognitions. The proposed approach is generic and could be coupled with conventional SLAM algorithms to reliably reduce their computing burden, thus improving the localization and mapping processes in the most challenging environments such as unexplored underwater extents. To prove that a robot performed a loop whatever the uncertainties in its evolution, we employ the notion of topological degree that originates in the field of differential topology. We show that a verification tool based on the topological degree is an optimal method for proving robot loops. This is demonstrated both on datasets from real missions involving autonomous underwater vehicles and by a mathematical discussion."}],"issue":"12","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5960","title":"Proving the existence of loops in robot trajectories","status":"public","intvolume":" 37","oa_version":"Preprint","scopus_import":"1","day":"24","article_processing_charge":"No","publication":"The International Journal of Robotics Research","citation":{"apa":"Rohou, S., Franek, P., Aubry, C., & Jaulin, L. (2018). Proving the existence of loops in robot trajectories. The International Journal of Robotics Research. SAGE Publications. https://doi.org/10.1177/0278364918808367","ieee":"S. Rohou, P. Franek, C. Aubry, and L. Jaulin, “Proving the existence of loops in robot trajectories,” The International Journal of Robotics Research, vol. 37, no. 12. SAGE Publications, pp. 1500–1516, 2018.","ista":"Rohou S, Franek P, Aubry C, Jaulin L. 2018. Proving the existence of loops in robot trajectories. The International Journal of Robotics Research. 37(12), 1500–1516.","ama":"Rohou S, Franek P, Aubry C, Jaulin L. Proving the existence of loops in robot trajectories. The International Journal of Robotics Research. 2018;37(12):1500-1516. doi:10.1177/0278364918808367","chicago":"Rohou, Simon, Peter Franek, Clément Aubry, and Luc Jaulin. “Proving the Existence of Loops in Robot Trajectories.” The International Journal of Robotics Research. SAGE Publications, 2018. https://doi.org/10.1177/0278364918808367.","short":"S. Rohou, P. Franek, C. Aubry, L. Jaulin, The International Journal of Robotics Research 37 (2018) 1500–1516.","mla":"Rohou, Simon, et al. “Proving the Existence of Loops in Robot Trajectories.” The International Journal of Robotics Research, vol. 37, no. 12, SAGE Publications, 2018, pp. 1500–16, doi:10.1177/0278364918808367."},"page":"1500-1516","date_published":"2018-10-24T00:00:00Z","year":"2018","publication_status":"published","department":[{"_id":"UlWa"}],"publisher":"SAGE Publications","author":[{"full_name":"Rohou, Simon","first_name":"Simon","last_name":"Rohou"},{"orcid":"0000-0001-8878-8397","id":"473294AE-F248-11E8-B48F-1D18A9856A87","last_name":"Franek","first_name":"Peter","full_name":"Franek, Peter"},{"full_name":"Aubry, Clément","first_name":"Clément","last_name":"Aubry"},{"last_name":"Jaulin","first_name":"Luc","full_name":"Jaulin, Luc"}],"date_created":"2019-02-13T09:36:20Z","date_updated":"2023-09-19T10:41:59Z","volume":37,"month":"10","publication_identifier":{"eissn":["1741-3176"],"issn":["0278-3649"]},"external_id":{"isi":["000456881100004"],"arxiv":["1712.01341"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1712.01341"}],"quality_controlled":"1","isi":1,"doi":"10.1177/0278364918808367","language":[{"iso":"eng"}]},{"author":[{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh"},{"last_name":"Brown","first_name":"Trevor A","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","full_name":"Brown, Trevor A"},{"full_name":"Kopinsky, Justin","first_name":"Justin","last_name":"Kopinsky"},{"full_name":"Nadiradze, Giorgi","last_name":"Nadiradze","first_name":"Giorgi"}],"date_updated":"2023-09-19T10:43:21Z","date_created":"2019-02-13T10:03:25Z","year":"2018","publication_status":"published","publisher":"ACM Press","department":[{"_id":"DaAl"}],"conference":{"end_date":"2018-07-27","location":"Egham, United Kingdom","start_date":"2018-07-23","name":"PODC: Principles of Distributed Computing"},"doi":"10.1145/3212734.3212756","language":[{"iso":"eng"}],"external_id":{"arxiv":["1808.04155"],"isi":["000458186900048"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1808.04155"}],"oa":1,"isi":1,"quality_controlled":"1","month":"07","publication_identifier":{"isbn":["9781450357951"]},"oa_version":"Preprint","_id":"5963","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","title":"Relaxed schedulers can efficiently parallelize iterative algorithms","abstract":[{"text":"There has been significant progress in understanding the parallelism inherent to iterative sequential algorithms: for many classic algorithms, the depth of the dependence structure is now well understood, and scheduling techniques have been developed to exploit this shallow dependence structure for efficient parallel implementations. A related, applied research strand has studied methods by which certain iterative task-based algorithms can be efficiently parallelized via relaxed concurrent priority schedulers. These allow for high concurrency when inserting and removing tasks, at the cost of executing superfluous work due to the relaxed semantics of the scheduler. In this work, we take a step towards unifying these two research directions, by showing that there exists a family of relaxed priority schedulers that can efficiently and deterministically execute classic iterative algorithms such as greedy maximal independent set (MIS) and matching. Our primary result shows that, given a randomized scheduler with an expected relaxation factor of k in terms of the maximum allowed priority inversions on a task, and any graph on n vertices, the scheduler is able to execute greedy MIS with only an additive factor of \\poly(k) expected additional iterations compared to an exact (but not scalable) scheduler. This counter-intuitive result demonstrates that the overhead of relaxation when computing MIS is not dependent on the input size or structure of the input graph. Experimental results show that this overhead can be clearly offset by the gain in performance due to the highly scalable scheduler. In sum, we present an efficient method to deterministically parallelize iterative sequential algorithms, with provable runtime guarantees in terms of the number of executed tasks to completion.","lang":"eng"}],"type":"conference","date_published":"2018-07-23T00:00:00Z","publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","citation":{"chicago":"Alistarh, Dan-Adrian, Trevor A Brown, Justin Kopinsky, and Giorgi Nadiradze. “Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, 377–86. ACM Press, 2018. https://doi.org/10.1145/3212734.3212756.","short":"D.-A. Alistarh, T.A. Brown, J. Kopinsky, G. Nadiradze, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 377–386.","mla":"Alistarh, Dan-Adrian, et al. “Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms.” Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 377–86, doi:10.1145/3212734.3212756.","ieee":"D.-A. Alistarh, T. A. Brown, J. Kopinsky, and G. Nadiradze, “Relaxed schedulers can efficiently parallelize iterative algorithms,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, Egham, United Kingdom, 2018, pp. 377–386.","apa":"Alistarh, D.-A., Brown, T. A., Kopinsky, J., & Nadiradze, G. (2018). Relaxed schedulers can efficiently parallelize iterative algorithms. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18 (pp. 377–386). Egham, United Kingdom: ACM Press. https://doi.org/10.1145/3212734.3212756","ista":"Alistarh D-A, Brown TA, Kopinsky J, Nadiradze G. 2018. Relaxed schedulers can efficiently parallelize iterative algorithms. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. PODC: Principles of Distributed Computing, 377–386.","ama":"Alistarh D-A, Brown TA, Kopinsky J, Nadiradze G. Relaxed schedulers can efficiently parallelize iterative algorithms. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. ACM Press; 2018:377-386. doi:10.1145/3212734.3212756"},"page":"377-386","day":"23","article_processing_charge":"No","scopus_import":"1"},{"date_created":"2019-02-13T10:17:19Z","date_updated":"2023-09-19T10:44:13Z","related_material":{"record":[{"id":"10429","relation":"dissertation_contains","status":"public"}]},"author":[{"full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"},{"last_name":"Brown","first_name":"Trevor A","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","full_name":"Brown, Trevor A"},{"last_name":"Kopinsky","first_name":"Justin","full_name":"Kopinsky, Justin"},{"full_name":"Li, Jerry Z.","first_name":"Jerry Z.","last_name":"Li"},{"first_name":"Giorgi","last_name":"Nadiradze","full_name":"Nadiradze, Giorgi"}],"department":[{"_id":"DaAl"}],"publisher":"ACM Press","publication_status":"published","year":"2018","language":[{"iso":"eng"}],"doi":"10.1145/3210377.3210411","conference":{"name":"SPAA: Symposium on Parallelism in Algorithms and Architectures","end_date":"2018-07-18","location":"Vienna, Austria","start_date":"2018-07-16"},"isi":1,"quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1804.01018","open_access":"1"}],"external_id":{"isi":["000545269600016"],"arxiv":["1804.01018"]},"oa":1,"publication_identifier":{"isbn":["9781450357999"]},"month":"07","oa_version":"Preprint","status":"public","title":"Distributionally linearizable data structures","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5965","abstract":[{"lang":"eng","text":"Relaxed concurrent data structures have become increasingly popular, due to their scalability in graph processing and machine learning applications (\\citeNguyen13, gonzalez2012powergraph ). Despite considerable interest, there exist families of natural, high performing randomized relaxed concurrent data structures, such as the popular MultiQueue~\\citeMQ pattern for implementing relaxed priority queue data structures, for which no guarantees are known in the concurrent setting~\\citeAKLN17. Our main contribution is in showing for the first time that, under a set of analytic assumptions, a family of relaxed concurrent data structures, including variants of MultiQueues, but also a new approximate counting algorithm we call the MultiCounter, provides strong probabilistic guarantees on the degree of relaxation with respect to the sequential specification, in arbitrary concurrent executions. We formalize these guarantees via a new correctness condition called distributional linearizability, tailored to concurrent implementations with randomized relaxations. Our result is based on a new analysis of an asynchronous variant of the classic power-of-two-choices load balancing algorithm, in which placement choices can be based on inconsistent, outdated information (this result may be of independent interest). We validate our results empirically, showing that the MultiCounter algorithm can implement scalable relaxed timestamps."}],"type":"conference","date_published":"2018-07-16T00:00:00Z","page":"133-142","citation":{"apa":"Alistarh, D.-A., Brown, T. A., Kopinsky, J., Li, J. Z., & Nadiradze, G. (2018). Distributionally linearizable data structures. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18 (pp. 133–142). Vienna, Austria: ACM Press. https://doi.org/10.1145/3210377.3210411","ieee":"D.-A. Alistarh, T. A. Brown, J. Kopinsky, J. Z. Li, and G. Nadiradze, “Distributionally linearizable data structures,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, Vienna, Austria, 2018, pp. 133–142.","ista":"Alistarh D-A, Brown TA, Kopinsky J, Li JZ, Nadiradze G. 2018. Distributionally linearizable data structures. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. SPAA: Symposium on Parallelism in Algorithms and Architectures, 133–142.","ama":"Alistarh D-A, Brown TA, Kopinsky J, Li JZ, Nadiradze G. Distributionally linearizable data structures. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. ACM Press; 2018:133-142. doi:10.1145/3210377.3210411","chicago":"Alistarh, Dan-Adrian, Trevor A Brown, Justin Kopinsky, Jerry Z. Li, and Giorgi Nadiradze. “Distributionally Linearizable Data Structures.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, 133–42. ACM Press, 2018. https://doi.org/10.1145/3210377.3210411.","short":"D.-A. Alistarh, T.A. Brown, J. Kopinsky, J.Z. Li, G. Nadiradze, in:, Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, ACM Press, 2018, pp. 133–142.","mla":"Alistarh, Dan-Adrian, et al. “Distributionally Linearizable Data Structures.” Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, ACM Press, 2018, pp. 133–42, doi:10.1145/3210377.3210411."},"publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18","article_processing_charge":"No","day":"16","scopus_import":"1"},{"file_date_updated":"2020-07-14T12:47:14Z","year":"2018","publication_status":"published","publisher":"ACM Press","department":[{"_id":"KrCh"}],"author":[{"last_name":"Hansen","first_name":"Kristoffer Arnsfelt","full_name":"Hansen, Kristoffer Arnsfelt"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","first_name":"Rasmus","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus"},{"last_name":"Neyman","first_name":"Abraham","full_name":"Neyman, Abraham"}],"date_updated":"2023-09-19T10:45:15Z","date_created":"2019-02-13T10:31:41Z","month":"06","publication_identifier":{"isbn":["9781450358293"]},"external_id":{"isi":["000492755100020"]},"oa":1,"quality_controlled":"1","isi":1,"conference":{"name":"EC: Conference on Economics and Computation","end_date":"2018-06-22","location":"Ithaca, NY, United States","start_date":"2018-06-18"},"doi":"10.1145/3219166.3219198","language":[{"iso":"eng"}],"type":"conference","abstract":[{"lang":"eng","text":"The Big Match is a multi-stage two-player game. In each stage Player 1 hides one or two pebbles in his hand, and his opponent has to guess that number; Player 1 loses a point if Player 2 is correct, and otherwise he wins a point. As soon as Player 1 hides one pebble, the players cannot change their choices in any future stage.\r\nBlackwell and Ferguson (1968) give an ε-optimal strategy for Player 1 that hides, in each stage, one pebble with a probability that depends on the entire past history. Any strategy that depends just on the clock or on a finite memory is worthless. The long-standing natural open problem has been whether every strategy that depends just on the clock and a finite memory is worthless. We prove that there is such a strategy that is ε-optimal. In fact, we show that just two states of memory are sufficient.\r\n"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5967","status":"public","ddc":["000"],"title":"The Big Match with a clock and a bit of memory","oa_version":"Submitted Version","file":[{"file_name":"2018_EC18_Hansen.pdf","access_level":"open_access","content_type":"application/pdf","file_size":302539,"creator":"dernst","relation":"main_file","file_id":"7054","date_updated":"2020-07-14T12:47:14Z","date_created":"2019-11-19T08:24:24Z","checksum":"bb52683e349cfd864f4769a8f38f2798"}],"scopus_import":"1","day":"18","article_processing_charge":"No","has_accepted_license":"1","publication":"Proceedings of the 2018 ACM Conference on Economics and Computation - EC '18","citation":{"ista":"Hansen KA, Ibsen-Jensen R, Neyman A. 2018. The Big Match with a clock and a bit of memory. Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18. EC: Conference on Economics and Computation, 149–150.","ieee":"K. A. Hansen, R. Ibsen-Jensen, and A. Neyman, “The Big Match with a clock and a bit of memory,” in Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18, Ithaca, NY, United States, 2018, pp. 149–150.","apa":"Hansen, K. A., Ibsen-Jensen, R., & Neyman, A. (2018). The Big Match with a clock and a bit of memory. In Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18 (pp. 149–150). Ithaca, NY, United States: ACM Press. https://doi.org/10.1145/3219166.3219198","ama":"Hansen KA, Ibsen-Jensen R, Neyman A. The Big Match with a clock and a bit of memory. In: Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18. ACM Press; 2018:149-150. doi:10.1145/3219166.3219198","chicago":"Hansen, Kristoffer Arnsfelt, Rasmus Ibsen-Jensen, and Abraham Neyman. “The Big Match with a Clock and a Bit of Memory.” In Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18, 149–50. ACM Press, 2018. https://doi.org/10.1145/3219166.3219198.","mla":"Hansen, Kristoffer Arnsfelt, et al. “The Big Match with a Clock and a Bit of Memory.” Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18, ACM Press, 2018, pp. 149–50, doi:10.1145/3219166.3219198.","short":"K.A. Hansen, R. Ibsen-Jensen, A. Neyman, in:, Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18, ACM Press, 2018, pp. 149–150."},"page":"149-150","date_published":"2018-06-18T00:00:00Z"},{"article_processing_charge":"No","day":"16","scopus_import":"1","date_published":"2018-07-16T00:00:00Z","page":"383-392","citation":{"ama":"Alistarh D-A, Haider SK, Kübler R, Nadiradze G. The transactional conflict problem. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. ACM Press; 2018:383-392. doi:10.1145/3210377.3210406","ista":"Alistarh D-A, Haider SK, Kübler R, Nadiradze G. 2018. The transactional conflict problem. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. SPAA: Symposium on Parallelism in Algorithms and Architectures, 383–392.","ieee":"D.-A. Alistarh, S. K. Haider, R. Kübler, and G. Nadiradze, “The transactional conflict problem,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, Vienna, Austria, 2018, pp. 383–392.","apa":"Alistarh, D.-A., Haider, S. K., Kübler, R., & Nadiradze, G. (2018). The transactional conflict problem. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18 (pp. 383–392). Vienna, Austria: ACM Press. https://doi.org/10.1145/3210377.3210406","mla":"Alistarh, Dan-Adrian, et al. “The Transactional Conflict Problem.” Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, ACM Press, 2018, pp. 383–92, doi:10.1145/3210377.3210406.","short":"D.-A. Alistarh, S.K. Haider, R. Kübler, G. Nadiradze, in:, Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, ACM Press, 2018, pp. 383–392.","chicago":"Alistarh, Dan-Adrian, Syed Kamran Haider, Raphael Kübler, and Giorgi Nadiradze. “The Transactional Conflict Problem.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, 383–92. ACM Press, 2018. https://doi.org/10.1145/3210377.3210406."},"publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18","abstract":[{"text":"The transactional conflict problem arises in transactional systems whenever two or more concurrent transactions clash on a data item. While the standard solution to such conflicts is to immediately abort one of the transactions, some practical systems consider the alternative of delaying conflict resolution for a short interval, which may allow one of the transactions to commit. The challenge in the transactional conflict problem is to choose the optimal length of this delay interval so as to minimize the overall running time penalty for the conflicting transactions. In this paper, we propose a family of optimal online algorithms for the transactional conflict problem. Specifically, we consider variants of this problem which arise in different implementations of transactional systems, namely \"requestor wins'' and \"requestor aborts'' implementations: in the former, the recipient of a coherence request is aborted, whereas in the latter, it is the requestor which has to abort. Both strategies are implemented by real systems. We show that the requestor aborts case can be reduced to a classic instance of the ski rental problem, while the requestor wins case leads to a new version of this classical problem, for which we derive optimal deterministic and randomized algorithms. Moreover, we prove that, under a simplified adversarial model, our algorithms are constant-competitive with the offline optimum in terms of throughput. We validate our algorithmic results empirically through a hardware simulation of hardware transactional memory (HTM), showing that our algorithms can lead to non-trivial performance improvements for classic concurrent data structures.","lang":"eng"}],"type":"conference","oa_version":"Preprint","status":"public","title":"The transactional conflict problem","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5966","publication_identifier":{"isbn":["9781450357999"]},"month":"07","language":[{"iso":"eng"}],"doi":"10.1145/3210377.3210406","conference":{"name":"SPAA: Symposium on Parallelism in Algorithms and Architectures","end_date":"2018-07-18","location":"Vienna, Austria","start_date":"2018-07-16"},"isi":1,"quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.00947"}],"external_id":{"isi":["000545269600046"],"arxiv":["1804.00947"]},"date_created":"2019-02-13T10:26:07Z","date_updated":"2023-09-19T10:44:49Z","author":[{"full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"},{"full_name":"Haider, Syed Kamran","last_name":"Haider","first_name":"Syed Kamran"},{"full_name":"Kübler, Raphael","last_name":"Kübler","first_name":"Raphael"},{"full_name":"Nadiradze, Giorgi","last_name":"Nadiradze","first_name":"Giorgi"}],"department":[{"_id":"DaAl"}],"publisher":"ACM Press","publication_status":"published","year":"2018"},{"date_created":"2019-02-13T12:59:33Z","date_updated":"2023-09-19T14:24:58Z","volume":47,"author":[{"full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov"}],"related_material":{"record":[{"id":"1193","status":"public","relation":"earlier_version"}]},"publication_status":"published","publisher":"Society for Industrial & Applied Mathematics (SIAM)","department":[{"_id":"VlKo"}],"year":"2018","ec_funded":1,"language":[{"iso":"eng"}],"doi":"10.1137/16m1093306","isi":1,"quality_controlled":"1","project":[{"grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7"}],"external_id":{"arxiv":["1506.08547"],"isi":["000453785100001"]},"main_file_link":[{"url":"https://arxiv.org/abs/1506.08547","open_access":"1"}],"oa":1,"month":"11","publication_identifier":{"eissn":["1095-7111"],"issn":["0097-5397"]},"oa_version":"Preprint","title":"Commutativity in the algorithmic Lovász local lemma","status":"public","intvolume":" 47","_id":"5975","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"lang":"eng","text":"We consider the recent formulation of the algorithmic Lov ́asz Local Lemma [N. Har-vey and J. Vondr ́ak, inProceedings of FOCS, 2015, pp. 1327–1345; D. Achlioptas and F. Iliopoulos,inProceedings of SODA, 2016, pp. 2024–2038; D. Achlioptas, F. Iliopoulos, and V. Kolmogorov,ALocal Lemma for Focused Stochastic Algorithms, arXiv preprint, 2018] for finding objects that avoid“bad features,” or “flaws.” It extends the Moser–Tardos resampling algorithm [R. A. Moser andG. Tardos,J. ACM, 57 (2010), 11] to more general discrete spaces. At each step the method picks aflaw present in the current state and goes to a new state according to some prespecified probabilitydistribution (which depends on the current state and the selected flaw). However, the recent formu-lation is less flexible than the Moser–Tardos method since it requires a specific flaw selection rule,whereas the algorithm of Moser and Tardos allows an arbitrary rule (and thus can potentially beimplemented more efficiently). We formulate a new “commutativity” condition and prove that it issufficient for an arbitrary rule to work. It also enables an efficient parallelization under an additionalassumption. We then show that existing resampling oracles for perfect matchings and permutationsdo satisfy this condition."}],"issue":"6","type":"journal_article","date_published":"2018-11-08T00:00:00Z","page":"2029-2056","publication":"SIAM Journal on Computing","citation":{"short":"V. Kolmogorov, SIAM Journal on Computing 47 (2018) 2029–2056.","mla":"Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.” SIAM Journal on Computing, vol. 47, no. 6, Society for Industrial & Applied Mathematics (SIAM), 2018, pp. 2029–56, doi:10.1137/16m1093306.","chicago":"Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.” SIAM Journal on Computing. Society for Industrial & Applied Mathematics (SIAM), 2018. https://doi.org/10.1137/16m1093306.","ama":"Kolmogorov V. Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. 2018;47(6):2029-2056. doi:10.1137/16m1093306","apa":"Kolmogorov, V. (2018). Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. Society for Industrial & Applied Mathematics (SIAM). https://doi.org/10.1137/16m1093306","ieee":"V. Kolmogorov, “Commutativity in the algorithmic Lovász local lemma,” SIAM Journal on Computing, vol. 47, no. 6. Society for Industrial & Applied Mathematics (SIAM), pp. 2029–2056, 2018.","ista":"Kolmogorov V. 2018. Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. 47(6), 2029–2056."},"day":"08","article_processing_charge":"No","scopus_import":"1"},{"scopus_import":"1","day":"23","article_processing_charge":"No","page":"411-413","publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","citation":{"chicago":"Aksenov, Vitaly, Dan-Adrian Alistarh, and Petr Kuznetsov. “Brief Announcement: Performance Prediction for Coarse-Grained Locking.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, 411–13. ACM Press, 2018. https://doi.org/10.1145/3212734.3212785.","short":"V. Aksenov, D.-A. Alistarh, P. Kuznetsov, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 411–413.","mla":"Aksenov, Vitaly, et al. “Brief Announcement: Performance Prediction for Coarse-Grained Locking.” Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 411–13, doi:10.1145/3212734.3212785.","apa":"Aksenov, V., Alistarh, D.-A., & Kuznetsov, P. (2018). Brief Announcement: Performance prediction for coarse-grained locking. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18 (pp. 411–413). Egham, United Kingdom: ACM Press. https://doi.org/10.1145/3212734.3212785","ieee":"V. Aksenov, D.-A. Alistarh, and P. Kuznetsov, “Brief Announcement: Performance prediction for coarse-grained locking,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, Egham, United Kingdom, 2018, pp. 411–413.","ista":"Aksenov V, Alistarh D-A, Kuznetsov P. 2018. Brief Announcement: Performance prediction for coarse-grained locking. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. PODC: Principles of Distributed Computing, 411–413.","ama":"Aksenov V, Alistarh D-A, Kuznetsov P. Brief Announcement: Performance prediction for coarse-grained locking. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. ACM Press; 2018:411-413. doi:10.1145/3212734.3212785"},"date_published":"2018-07-23T00:00:00Z","type":"conference","abstract":[{"text":"A standard design pattern found in many concurrent data structures, such as hash tables or ordered containers, is an alternation of parallelizable sections that incur no data conflicts and critical sections that must run sequentially and are protected with locks. A lock can be viewed as a queue that arbitrates the order in which the critical sections are executed, and a natural question is whether we can use stochastic analysis to predict the resulting throughput. As a preliminary evidence to the affirmative, we describe a simple model that can be used to predict the throughput of coarse-grained lock-based algorithms. We show that our model works well for CLH lock, and we expect it to work for other popular lock designs such as TTAS, MCS, etc.","lang":"eng"}],"title":"Brief Announcement: Performance prediction for coarse-grained locking","status":"public","_id":"5964","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Submitted Version","month":"07","publication_identifier":{"isbn":["9781450357951"]},"isi":1,"quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://hal-univ-lyon3.archives-ouvertes.fr/INRIA/hal-01887733v1","open_access":"1"}],"external_id":{"isi":["000458186900052"]},"language":[{"iso":"eng"}],"conference":{"location":"Egham, United Kingdom","start_date":"2018-07-23","end_date":"2018-07-27","name":"PODC: Principles of Distributed Computing"},"doi":"10.1145/3212734.3212785","publication_status":"published","department":[{"_id":"DaAl"}],"publisher":"ACM Press","year":"2018","date_updated":"2023-09-19T10:43:45Z","date_created":"2019-02-13T10:08:19Z","author":[{"full_name":"Aksenov, Vitaly","first_name":"Vitaly","last_name":"Aksenov"},{"last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"},{"first_name":"Petr","last_name":"Kuznetsov","full_name":"Kuznetsov, Petr"}]},{"month":"09","publication_identifier":{"eissn":["2010-3271"],"issn":["2010-3263"]},"doi":"10.1142/s2010326319500096","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1802.05175","open_access":"1"}],"external_id":{"isi":["000477677200002"],"arxiv":["1802.05175"]},"isi":1,"quality_controlled":"1","project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7"}],"ec_funded":1,"article_number":"1950009","author":[{"full_name":"Erdös, László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","first_name":"László"},{"full_name":"Mühlbacher, Peter","last_name":"Mühlbacher","first_name":"Peter"}],"date_updated":"2023-09-19T14:24:05Z","date_created":"2019-02-13T10:40:54Z","year":"2018","publication_status":"published","department":[{"_id":"LaEr"}],"publisher":"World Scientific Publishing","day":"26","article_processing_charge":"No","scopus_import":"1","date_published":"2018-09-26T00:00:00Z","publication":"Random matrices: Theory and applications","citation":{"chicago":"Erdös, László, and Peter Mühlbacher. “Bounds on the Norm of Wigner-Type Random Matrices.” Random Matrices: Theory and Applications. World Scientific Publishing, 2018. https://doi.org/10.1142/s2010326319500096.","mla":"Erdös, László, and Peter Mühlbacher. “Bounds on the Norm of Wigner-Type Random Matrices.” Random Matrices: Theory and Applications, 1950009, World Scientific Publishing, 2018, doi:10.1142/s2010326319500096.","short":"L. Erdös, P. Mühlbacher, Random Matrices: Theory and Applications (2018).","ista":"Erdös L, Mühlbacher P. 2018. Bounds on the norm of Wigner-type random matrices. Random matrices: Theory and applications., 1950009.","apa":"Erdös, L., & Mühlbacher, P. (2018). Bounds on the norm of Wigner-type random matrices. Random Matrices: Theory and Applications. World Scientific Publishing. https://doi.org/10.1142/s2010326319500096","ieee":"L. Erdös and P. Mühlbacher, “Bounds on the norm of Wigner-type random matrices,” Random matrices: Theory and applications. World Scientific Publishing, 2018.","ama":"Erdös L, Mühlbacher P. Bounds on the norm of Wigner-type random matrices. Random matrices: Theory and applications. 2018. doi:10.1142/s2010326319500096"},"abstract":[{"text":"We consider a Wigner-type ensemble, i.e. large hermitian N×N random matrices H=H∗ with centered independent entries and with a general matrix of variances Sxy=𝔼∣∣Hxy∣∣2. The norm of H is asymptotically given by the maximum of the support of the self-consistent density of states. We establish a bound on this maximum in terms of norms of powers of S that substantially improves the earlier bound 2∥S∥1/2∞ given in [O. Ajanki, L. Erdős and T. Krüger, Universality for general Wigner-type matrices, Prob. Theor. Rel. Fields169 (2017) 667–727]. The key element of the proof is an effective Markov chain approximation for the contributions of the weighted Dyck paths appearing in the iterative solution of the corresponding Dyson equation.","lang":"eng"}],"type":"journal_article","oa_version":"Preprint","_id":"5971","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Bounds on the norm of Wigner-type random matrices","status":"public"},{"month":"12","publication_identifier":{"issn":["2041-1723"]},"isi":1,"quality_controlled":"1","project":[{"name":"Microbial Ion Channels for Synthetic Neurobiology","call_identifier":"FP7","_id":"25548C20-B435-11E9-9278-68D0E5697425","grant_number":"303564"},{"grant_number":"W1232-B24","_id":"255A6082-B435-11E9-9278-68D0E5697425","name":"Molecular Drug Targets","call_identifier":"FWF"}],"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":["000432280000006"]},"language":[{"iso":"eng"}],"doi":"10.1038/s41467-018-04342-1","article_number":"1950","file_date_updated":"2020-07-14T12:47:14Z","ec_funded":1,"publication_status":"published","publisher":"Springer Nature","department":[{"_id":"HaJa"},{"_id":"CaGu"},{"_id":"MiSi"}],"year":"2018","date_created":"2019-02-14T10:50:24Z","date_updated":"2023-09-19T14:29:32Z","volume":9,"author":[{"id":"4863116E-F248-11E8-B48F-1D18A9856A87","last_name":"Morri","first_name":"Maurizio","full_name":"Morri, Maurizio"},{"full_name":"Sanchez-Romero, Inmaculada","last_name":"Sanchez-Romero","first_name":"Inmaculada","id":"3D9C5D30-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Tichy","first_name":"Alexandra-Madelaine","id":"29D8BB2C-F248-11E8-B48F-1D18A9856A87","full_name":"Tichy, Alexandra-Madelaine"},{"first_name":"Stephanie","last_name":"Kainrath","id":"32CFBA64-F248-11E8-B48F-1D18A9856A87","full_name":"Kainrath, Stephanie"},{"full_name":"Gerrard, Elliot J.","first_name":"Elliot J.","last_name":"Gerrard"},{"id":"435ACB3A-F248-11E8-B48F-1D18A9856A87","last_name":"Hirschfeld","first_name":"Priscila","full_name":"Hirschfeld, Priscila"},{"full_name":"Schwarz, Jan","last_name":"Schwarz","first_name":"Jan","id":"346C1EC6-F248-11E8-B48F-1D18A9856A87"},{"id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8023-9315","first_name":"Harald L","last_name":"Janovjak","full_name":"Janovjak, Harald L"}],"scopus_import":"1","day":"01","article_processing_charge":"No","has_accepted_license":"1","publication":"Nature Communications","citation":{"apa":"Morri, M., Sanchez-Romero, I., Tichy, A.-M., Kainrath, S., Gerrard, E. J., Hirschfeld, P., … Janovjak, H. L. (2018). Optical functionalization of human class A orphan G-protein-coupled receptors. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-018-04342-1","ieee":"M. Morri et al., “Optical functionalization of human class A orphan G-protein-coupled receptors,” Nature Communications, vol. 9, no. 1. Springer Nature, 2018.","ista":"Morri M, Sanchez-Romero I, Tichy A-M, Kainrath S, Gerrard EJ, Hirschfeld P, Schwarz J, Janovjak HL. 2018. Optical functionalization of human class A orphan G-protein-coupled receptors. Nature Communications. 9(1), 1950.","ama":"Morri M, Sanchez-Romero I, Tichy A-M, et al. Optical functionalization of human class A orphan G-protein-coupled receptors. Nature Communications. 2018;9(1). doi:10.1038/s41467-018-04342-1","chicago":"Morri, Maurizio, Inmaculada Sanchez-Romero, Alexandra-Madelaine Tichy, Stephanie Kainrath, Elliot J. Gerrard, Priscila Hirschfeld, Jan Schwarz, and Harald L Janovjak. “Optical Functionalization of Human Class A Orphan G-Protein-Coupled Receptors.” Nature Communications. Springer Nature, 2018. https://doi.org/10.1038/s41467-018-04342-1.","short":"M. Morri, I. Sanchez-Romero, A.-M. Tichy, S. Kainrath, E.J. Gerrard, P. Hirschfeld, J. Schwarz, H.L. Janovjak, Nature Communications 9 (2018).","mla":"Morri, Maurizio, et al. “Optical Functionalization of Human Class A Orphan G-Protein-Coupled Receptors.” Nature Communications, vol. 9, no. 1, 1950, Springer Nature, 2018, doi:10.1038/s41467-018-04342-1."},"date_published":"2018-12-01T00:00:00Z","type":"journal_article","abstract":[{"text":"G-protein-coupled receptors (GPCRs) form the largest receptor family, relay environmental stimuli to changes in cell behavior and represent prime drug targets. Many GPCRs are classified as orphan receptors because of the limited knowledge on their ligands and coupling to cellular signaling machineries. Here, we engineer a library of 63 chimeric receptors that contain the signaling domains of human orphan and understudied GPCRs functionally linked to the light-sensing domain of rhodopsin. Upon stimulation with visible light, we identify activation of canonical cell signaling pathways, including cAMP-, Ca2+-, MAPK/ERK-, and Rho-dependent pathways, downstream of the engineered receptors. For the human pseudogene GPR33, we resurrect a signaling function that supports its hypothesized role as a pathogen entry site. These results demonstrate that substituting unknown chemical activators with a light switch can reveal information about protein function and provide an optically controlled protein library for exploring the physiology and therapeutic potential of understudied GPCRs.","lang":"eng"}],"issue":"1","ddc":["570"],"title":"Optical functionalization of human class A orphan G-protein-coupled receptors","status":"public","intvolume":" 9","_id":"5984","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"relation":"main_file","file_id":"5985","checksum":"8325fcc194264af4749e662a73bf66b5","date_created":"2019-02-14T10:58:29Z","date_updated":"2020-07-14T12:47:14Z","access_level":"open_access","file_name":"2018_Springer_Morri.pdf","file_size":1349914,"content_type":"application/pdf","creator":"kschuh"}],"oa_version":"Published Version"},{"article_number":"241","file_date_updated":"2020-07-14T12:47:14Z","ec_funded":1,"publication_status":"published","department":[{"_id":"BeBi"}],"publisher":"Association for Computing Machinery (ACM)","year":"2018","date_created":"2019-02-13T13:12:53Z","date_updated":"2023-09-19T14:25:30Z","volume":37,"author":[{"last_name":"Malomo","first_name":"Luigi","full_name":"Malomo, Luigi"},{"full_name":"Perez Rodriguez, Jesus","first_name":"Jesus","last_name":"Perez Rodriguez","id":"2DC83906-F248-11E8-B48F-1D18A9856A87"},{"id":"33F19F16-F248-11E8-B48F-1D18A9856A87","last_name":"Iarussi","first_name":"Emmanuel","full_name":"Iarussi, Emmanuel"},{"full_name":"Pietroni, Nico","first_name":"Nico","last_name":"Pietroni"},{"full_name":"Miguel, Eder","last_name":"Miguel","first_name":"Eder"},{"full_name":"Cignoni, Paolo","first_name":"Paolo","last_name":"Cignoni"},{"full_name":"Bickel, Bernd","first_name":"Bernd","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385"}],"month":"11","publication_identifier":{"issn":["0730-0301"]},"quality_controlled":"1","isi":1,"project":[{"grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"},{"call_identifier":"H2020","name":"Soft-bodied intelligence for Manipulation","grant_number":"645599","_id":"25082902-B435-11E9-9278-68D0E5697425"},{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"external_id":{"isi":["000455953100064"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1145/3272127.3275076","type":"journal_article","abstract":[{"text":"We propose FlexMaps, a novel framework for fabricating smooth shapes out of flat, flexible panels with tailored mechanical properties. We start by mapping the 3D surface onto a 2D domain as in traditional UV mapping to design a set of deformable flat panels called FlexMaps. For these panels, we design and obtain specific mechanical properties such that, once they are assembled, the static equilibrium configuration matches the desired 3D shape. FlexMaps can be fabricated from an almost rigid material, such as wood or plastic, and are made flexible in a controlled way by using computationally designed spiraling microstructures.","lang":"eng"}],"issue":"6","title":"FlexMaps: Computational design of flat flexible shells for shaping 3D objects","ddc":["000"],"status":"public","intvolume":" 37","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5976","oa_version":"Published Version","file":[{"date_created":"2019-09-23T12:48:52Z","date_updated":"2020-07-14T12:47:14Z","checksum":"d0529a41c78b37ab8840685579fb33b4","file_id":"6901","relation":"main_file","creator":"bbickel","content_type":"application/pdf","file_size":100109811,"file_name":"flexmaps_author_version.pdf","access_level":"open_access"}],"pubrep_id":"1068","scopus_import":"1","day":"01","article_processing_charge":"No","has_accepted_license":"1","article_type":"original","publication":"ACM Transactions on Graphics","citation":{"chicago":"Malomo, Luigi, Jesus Perez Rodriguez, Emmanuel Iarussi, Nico Pietroni, Eder Miguel, Paolo Cignoni, and Bernd Bickel. “FlexMaps: Computational Design of Flat Flexible Shells for Shaping 3D Objects.” ACM Transactions on Graphics. Association for Computing Machinery (ACM), 2018. https://doi.org/10.1145/3272127.3275076.","short":"L. Malomo, J. Perez Rodriguez, E. Iarussi, N. Pietroni, E. Miguel, P. Cignoni, B. Bickel, ACM Transactions on Graphics 37 (2018).","mla":"Malomo, Luigi, et al. “FlexMaps: Computational Design of Flat Flexible Shells for Shaping 3D Objects.” ACM Transactions on Graphics, vol. 37, no. 6, 241, Association for Computing Machinery (ACM), 2018, doi:10.1145/3272127.3275076.","apa":"Malomo, L., Perez Rodriguez, J., Iarussi, E., Pietroni, N., Miguel, E., Cignoni, P., & Bickel, B. (2018). FlexMaps: Computational design of flat flexible shells for shaping 3D objects. ACM Transactions on Graphics. Association for Computing Machinery (ACM). https://doi.org/10.1145/3272127.3275076","ieee":"L. Malomo et al., “FlexMaps: Computational design of flat flexible shells for shaping 3D objects,” ACM Transactions on Graphics, vol. 37, no. 6. Association for Computing Machinery (ACM), 2018.","ista":"Malomo L, Perez Rodriguez J, Iarussi E, Pietroni N, Miguel E, Cignoni P, Bickel B. 2018. FlexMaps: Computational design of flat flexible shells for shaping 3D objects. ACM Transactions on Graphics. 37(6), 241.","ama":"Malomo L, Perez Rodriguez J, Iarussi E, et al. FlexMaps: Computational design of flat flexible shells for shaping 3D objects. ACM Transactions on Graphics. 2018;37(6). doi:10.1145/3272127.3275076"},"date_published":"2018-11-01T00:00:00Z"},{"language":[{"iso":"eng"}],"doi":"10.1103/physrevb.98.224506","quality_controlled":"1","isi":1,"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"},{"grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems","call_identifier":"H2020"}],"oa":1,"external_id":{"isi":["000452992700008"],"arxiv":["1809.01204"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.01204"}],"month":"12","publication_identifier":{"eissn":["2469-9969"],"issn":["2469-9950"]},"date_updated":"2023-09-19T14:29:03Z","date_created":"2019-02-14T10:37:09Z","volume":98,"author":[{"full_name":"Yakaboylu, Enderalp","first_name":"Enderalp","last_name":"Yakaboylu","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5973-0874"},{"last_name":"Midya","first_name":"Bikashkali","id":"456187FC-F248-11E8-B48F-1D18A9856A87","full_name":"Midya, Bikashkali"},{"full_name":"Deuchert, Andreas","orcid":"0000-0003-3146-6746","id":"4DA65CD0-F248-11E8-B48F-1D18A9856A87","last_name":"Deuchert","first_name":"Andreas"},{"full_name":"Leopold, Nikolai K","orcid":"0000-0002-0495-6822","id":"4BC40BEC-F248-11E8-B48F-1D18A9856A87","last_name":"Leopold","first_name":"Nikolai K"},{"first_name":"Mikhail","last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail"}],"publication_status":"published","publisher":"American Physical Society","department":[{"_id":"MiLe"},{"_id":"RoSe"}],"year":"2018","ec_funded":1,"article_number":"224506","date_published":"2018-12-12T00:00:00Z","publication":"Physical Review B","citation":{"ama":"Yakaboylu E, Midya B, Deuchert A, Leopold NK, Lemeshko M. Theory of the rotating polaron: Spectrum and self-localization. Physical Review B. 2018;98(22). doi:10.1103/physrevb.98.224506","apa":"Yakaboylu, E., Midya, B., Deuchert, A., Leopold, N. K., & Lemeshko, M. (2018). Theory of the rotating polaron: Spectrum and self-localization. Physical Review B. American Physical Society. https://doi.org/10.1103/physrevb.98.224506","ieee":"E. Yakaboylu, B. Midya, A. Deuchert, N. K. Leopold, and M. Lemeshko, “Theory of the rotating polaron: Spectrum and self-localization,” Physical Review B, vol. 98, no. 22. American Physical Society, 2018.","ista":"Yakaboylu E, Midya B, Deuchert A, Leopold NK, Lemeshko M. 2018. Theory of the rotating polaron: Spectrum and self-localization. Physical Review B. 98(22), 224506.","short":"E. Yakaboylu, B. Midya, A. Deuchert, N.K. Leopold, M. Lemeshko, Physical Review B 98 (2018).","mla":"Yakaboylu, Enderalp, et al. “Theory of the Rotating Polaron: Spectrum and Self-Localization.” Physical Review B, vol. 98, no. 22, 224506, American Physical Society, 2018, doi:10.1103/physrevb.98.224506.","chicago":"Yakaboylu, Enderalp, Bikashkali Midya, Andreas Deuchert, Nikolai K Leopold, and Mikhail Lemeshko. “Theory of the Rotating Polaron: Spectrum and Self-Localization.” Physical Review B. American Physical Society, 2018. https://doi.org/10.1103/physrevb.98.224506."},"day":"12","article_processing_charge":"No","scopus_import":"1","oa_version":"Preprint","title":"Theory of the rotating polaron: Spectrum and self-localization","status":"public","intvolume":" 98","_id":"5983","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"lang":"eng","text":"We study a quantum impurity possessing both translational and internal rotational degrees of freedom interacting with a bosonic bath. Such a system corresponds to a “rotating polaron,” which can be used to model, e.g., a rotating molecule immersed in an ultracold Bose gas or superfluid helium. We derive the Hamiltonian of the rotating polaron and study its spectrum in the weak- and strong-coupling regimes using a combination of variational, diagrammatic, and mean-field approaches. We reveal how the coupling between linear and angular momenta affects stable quasiparticle states, and demonstrate that internal rotation leads to an enhanced self-localization in the translational degrees of freedom."}],"issue":"22","type":"journal_article"}]