[{"department":[{"_id":"DaAl"}],"date_updated":"2025-06-03T11:16:28Z","abstract":[{"text":"The initial amount of pathogens required to start an infection within a susceptible host is called the infective dose and is known to vary to a large extent between different pathogen species. We investigate the hypothesis that the differences in infective doses are explained by the mode of action in the underlying mechanism of pathogenesis: Pathogens with locally acting mechanisms tend to have smaller infective doses than pathogens with distantly acting mechanisms. While empirical evidence tends to support the hypothesis, a formal theoretical explanation has been lacking. We give simple analytical models to gain insight into this phenomenon and also investigate a stochastic, spatially explicit, mechanistic within-host model for toxin-dependent bacterial infections. The model shows that pathogens secreting locally acting toxins have smaller infective doses than pathogens secreting diffusive toxins, as hypothesized. While local pathogenetic mechanisms require smaller infective doses, pathogens with distantly acting toxins tend to spread faster and may cause more damage to the host. The proposed model can serve as a basis for the spatially explicit analysis of various virulence factors also in the context of other problems in infection dynamics.","lang":"eng"}],"isi":1,"external_id":{"isi":["000447491300057"]},"ddc":["570","577"],"issue":"42","publisher":"National Academy of Sciences","date_published":"2018-10-02T00:00:00Z","publist_id":"8011","citation":{"ama":"Rybicki J, Kisdi E, Anttila J. Model of bacterial toxin-dependent pathogenesis explains infective dose. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. 2018;115(42):10690-10695. doi:<a href=\"https://doi.org/10.1073/pnas.1721061115\">10.1073/pnas.1721061115</a>","short":"J. Rybicki, E. Kisdi, J. Anttila, Proceedings of the National Academy of Sciences of the United States of America 115 (2018) 10690–10695.","apa":"Rybicki, J., Kisdi, E., &#38; Anttila, J. (2018). Model of bacterial toxin-dependent pathogenesis explains infective dose. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1721061115\">https://doi.org/10.1073/pnas.1721061115</a>","ieee":"J. Rybicki, E. Kisdi, and J. Anttila, “Model of bacterial toxin-dependent pathogenesis explains infective dose,” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 115, no. 42. National Academy of Sciences, pp. 10690–10695, 2018.","chicago":"Rybicki, Joel, Eva Kisdi, and Jani Anttila. “Model of Bacterial Toxin-Dependent Pathogenesis Explains Infective Dose.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences, 2018. <a href=\"https://doi.org/10.1073/pnas.1721061115\">https://doi.org/10.1073/pnas.1721061115</a>.","ista":"Rybicki J, Kisdi E, Anttila J. 2018. Model of bacterial toxin-dependent pathogenesis explains infective dose. Proceedings of the National Academy of Sciences of the United States of America. 115(42), 10690–10695.","mla":"Rybicki, Joel, et al. “Model of Bacterial Toxin-Dependent Pathogenesis Explains Infective Dose.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 115, no. 42, National Academy of Sciences, 2018, pp. 10690–95, doi:<a href=\"https://doi.org/10.1073/pnas.1721061115\">10.1073/pnas.1721061115</a>."},"oa_version":"Submitted Version","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Joel","last_name":"Rybicki","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","full_name":"Rybicki, Joel","orcid":"0000-0002-6432-6646"},{"full_name":"Kisdi, Eva","first_name":"Eva","last_name":"Kisdi"},{"full_name":"Anttila, Jani","last_name":"Anttila","first_name":"Jani"}],"has_accepted_license":"1","oa":1,"publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"doi":"10.1073/pnas.1721061115","_id":"43","quality_controlled":"1","status":"public","type":"journal_article","year":"2018","file_date_updated":"2020-07-14T12:46:26Z","publication_status":"published","month":"10","article_processing_charge":"No","file":[{"file_name":"2018_PNAS_Rybicki.pdf","date_updated":"2020-07-14T12:46:26Z","content_type":"application/pdf","file_size":4070777,"checksum":"df7ac544a587c06b75692653b9fabd18","date_created":"2019-04-09T08:02:50Z","relation":"main_file","file_id":"6258","creator":"dernst","access_level":"open_access"}],"volume":115,"project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"intvolume":"       115","page":"10690 - 10695","title":"Model of bacterial toxin-dependent pathogenesis explains infective dose","publication":"Proceedings of the National Academy of Sciences of the United States of America","acknowledgement":"J.R. and J.V.A. were also supported by the Academy of Finland Grants 1273253 and 267541.","date_created":"2018-12-11T11:44:19Z","ec_funded":1,"scopus_import":"1","day":"02","pubrep_id":"1063"},{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"first_name":"John","last_name":"Novembre","full_name":"Novembre, John"},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H"}],"language":[{"iso":"eng"}],"oa_version":"Published Version","publist_id":"7393","citation":{"apa":"Novembre, J., &#38; Barton, N. H. (2018). Tread lightly interpreting polygenic tests of selection. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.118.300786\">https://doi.org/10.1534/genetics.118.300786</a>","short":"J. Novembre, N.H. Barton, Genetics 208 (2018) 1351–1355.","ama":"Novembre J, Barton NH. Tread lightly interpreting polygenic tests of selection. <i>Genetics</i>. 2018;208(4):1351-1355. doi:<a href=\"https://doi.org/10.1534/genetics.118.300786\">10.1534/genetics.118.300786</a>","mla":"Novembre, John, and Nicholas H. Barton. “Tread Lightly Interpreting Polygenic Tests of Selection.” <i>Genetics</i>, vol. 208, no. 4, Genetics Society of America, 2018, pp. 1351–55, doi:<a href=\"https://doi.org/10.1534/genetics.118.300786\">10.1534/genetics.118.300786</a>.","ista":"Novembre J, Barton NH. 2018. Tread lightly interpreting polygenic tests of selection. Genetics. 208(4), 1351–1355.","chicago":"Novembre, John, and Nicholas H Barton. “Tread Lightly Interpreting Polygenic Tests of Selection.” <i>Genetics</i>. Genetics Society of America, 2018. <a href=\"https://doi.org/10.1534/genetics.118.300786\">https://doi.org/10.1534/genetics.118.300786</a>.","ieee":"J. Novembre and N. H. Barton, “Tread lightly interpreting polygenic tests of selection,” <i>Genetics</i>, vol. 208, no. 4. Genetics Society of America, pp. 1351–1355, 2018."},"date_published":"2018-04-01T00:00:00Z","issue":"4","publisher":"Genetics Society of America","ddc":["576"],"external_id":{"isi":["000429094400005"]},"isi":1,"date_updated":"2023-09-19T10:17:30Z","department":[{"_id":"NiBa"}],"abstract":[{"lang":"eng","text":"In this issue of GENETICS, a new method for detecting natural selection on polygenic traits is developed and applied to sev- eral human examples ( Racimo et al. 2018 ). By de fi nition, many loci contribute to variation in polygenic traits, and a challenge for evolutionary ge neticists has been that these traits can evolve by small, nearly undetectable shifts in allele frequencies across each of many, typically unknown, loci. Recently, a helpful remedy has arisen. Genome-wide associ- ation studies (GWAS) have been illuminating sets of loci that can be interrogated jointly for c hanges in allele frequencies. By aggregating small signal s of change across many such loci, directional natural selection is now in principle detect- able using genetic data, even for highly polygenic traits. This is an exciting arena of progress – with these methods, tests can be made for selection associated with traits, and we can now study selection in what may be its most prevalent mode. The continuing fast pace of GWAS publications suggest there will be many more polygenic tests of selection in the near future, as every new GWAS is an opportunity for an accom- panying test of polygenic selection. However, it is important to be aware of complications th at arise in interpretation, especially given that these studies may easily be misinter- preted both in and outside the evolutionary genetics commu- nity. Here, we provide context for understanding polygenic tests and urge caution regarding how these results are inter- preted and reported upon more broadly."}],"scopus_import":"1","date_created":"2018-12-11T11:46:26Z","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"day":"01","pubrep_id":"1012","publication":"Genetics","intvolume":"       208","title":"Tread lightly interpreting polygenic tests of selection","page":"1351 - 1355","article_processing_charge":"No","month":"04","volume":208,"file":[{"file_size":500129,"content_type":"application/pdf","date_updated":"2020-07-14T12:46:26Z","file_name":"IST-2018-1012-v1+1_2018_Barton_Tread.pdf","access_level":"open_access","relation":"main_file","file_id":"4958","creator":"system","date_created":"2018-12-12T10:12:40Z","checksum":"3d838dc285df394376555b794b6a5ad1"}],"quality_controlled":"1","publication_status":"published","year":"2018","file_date_updated":"2020-07-14T12:46:26Z","status":"public","type":"journal_article","_id":"430","doi":"10.1534/genetics.118.300786","has_accepted_license":"1","oa":1},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0001-8485-1774","full_name":"Fulek, Radoslav","first_name":"Radoslav","last_name":"Fulek","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pach, János","last_name":"Pach","first_name":"János"}],"corr_author":"1","publist_id":"7390","citation":{"ieee":"R. Fulek and J. Pach, “Thrackles: An improved upper bound,” presented at the GD: Graph Drawing and Network Visualization, Boston, MA, United States, 2018, vol. 10692, pp. 160–166.","chicago":"Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound,” 10692:160–66. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-73915-1_14\">https://doi.org/10.1007/978-3-319-73915-1_14</a>.","ista":"Fulek R, Pach J. 2018. Thrackles: An improved upper bound. GD: Graph Drawing and Network Visualization, LNCS, vol. 10692, 160–166.","mla":"Fulek, Radoslav, and János Pach. <i>Thrackles: An Improved Upper Bound</i>. Vol. 10692, Springer, 2018, pp. 160–66, doi:<a href=\"https://doi.org/10.1007/978-3-319-73915-1_14\">10.1007/978-3-319-73915-1_14</a>.","ama":"Fulek R, Pach J. Thrackles: An improved upper bound. In: Vol 10692. Springer; 2018:160-166. doi:<a href=\"https://doi.org/10.1007/978-3-319-73915-1_14\">10.1007/978-3-319-73915-1_14</a>","short":"R. Fulek, J. Pach, in:, Springer, 2018, pp. 160–166.","apa":"Fulek, R., &#38; Pach, J. (2018). Thrackles: An improved upper bound (Vol. 10692, pp. 160–166). Presented at the GD: Graph Drawing and Network Visualization, Boston, MA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-319-73915-1_14\">https://doi.org/10.1007/978-3-319-73915-1_14</a>"},"oa_version":"Submitted Version","language":[{"iso":"eng"}],"conference":{"start_date":"201-09-25","location":"Boston, MA, United States","name":"GD: Graph Drawing and Network Visualization","end_date":"2017-09-27"},"publisher":"Springer","related_material":{"record":[{"id":"5857","status":"public","relation":"later_version"}]},"date_published":"2018-01-21T00:00:00Z","arxiv":1,"department":[{"_id":"UlWa"}],"date_updated":"2026-04-16T09:48:11Z","abstract":[{"lang":"eng","text":"A thrackle is a graph drawn in the plane so that every pair of its edges meet exactly once: either at a common end vertex or in a proper crossing. We prove that any thrackle of n vertices has at most 1.3984n edges. Quasi-thrackles are defined similarly, except that every pair of edges that do not share a vertex are allowed to cross an odd number of times. It is also shown that the maximum number of edges of a quasi-thrackle on n vertices is 3/2(n-1), and that this bound is best possible for infinitely many values of n."}],"external_id":{"arxiv":["1708.08037"]},"date_created":"2018-12-11T11:46:27Z","scopus_import":"1","day":"21","article_processing_charge":"No","month":"01","volume":10692,"intvolume":"     10692","title":"Thrackles: An improved upper bound","page":"160 - 166","alternative_title":["LNCS"],"quality_controlled":"1","type":"conference","status":"public","publication_status":"published","year":"2018","oa":1,"doi":"10.1007/978-3-319-73915-1_14","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1708.08037"}],"_id":"433"},{"author":[{"full_name":"Jiang, Yu","first_name":"Yu","last_name":"Jiang"},{"last_name":"Liu","first_name":"Han","full_name":"Liu, Han"},{"full_name":"Song, Huobing","first_name":"Huobing","last_name":"Song"},{"id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87","first_name":"Hui","last_name":"Kong","full_name":"Kong, Hui","orcid":"0000-0002-3066-6941"},{"last_name":"Wang","first_name":"Rui","full_name":"Wang, Rui"},{"last_name":"Guan","first_name":"Yong","full_name":"Guan, Yong"},{"last_name":"Sha","first_name":"Lui","full_name":"Sha, Lui"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Jiang Y, Liu H, Song H, Kong H, Wang R, Guan Y, Sha L. 2018. Safety-assured model-driven design of the multifunction vehicle bus controller. IEEE Transactions on Intelligent Transportation Systems. 19(10), 3320–3333.","mla":"Jiang, Yu, et al. “Safety-Assured Model-Driven Design of the Multifunction Vehicle Bus Controller.” <i>IEEE Transactions on Intelligent Transportation Systems</i>, vol. 19, no. 10, IEEE, 2018, pp. 3320–33, doi:<a href=\"https://doi.org/10.1109/TITS.2017.2778077\">10.1109/TITS.2017.2778077</a>.","ieee":"Y. Jiang <i>et al.</i>, “Safety-assured model-driven design of the multifunction vehicle bus controller,” <i>IEEE Transactions on Intelligent Transportation Systems</i>, vol. 19, no. 10. IEEE, pp. 3320–3333, 2018.","chicago":"Jiang, Yu, Han Liu, Huobing Song, Hui Kong, Rui Wang, Yong Guan, and Lui Sha. “Safety-Assured Model-Driven Design of the Multifunction Vehicle Bus Controller.” <i>IEEE Transactions on Intelligent Transportation Systems</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/TITS.2017.2778077\">https://doi.org/10.1109/TITS.2017.2778077</a>.","ama":"Jiang Y, Liu H, Song H, et al. Safety-assured model-driven design of the multifunction vehicle bus controller. <i>IEEE Transactions on Intelligent Transportation Systems</i>. 2018;19(10):3320-3333. doi:<a href=\"https://doi.org/10.1109/TITS.2017.2778077\">10.1109/TITS.2017.2778077</a>","short":"Y. Jiang, H. Liu, H. Song, H. Kong, R. Wang, Y. Guan, L. Sha, IEEE Transactions on Intelligent Transportation Systems 19 (2018) 3320–3333.","apa":"Jiang, Y., Liu, H., Song, H., Kong, H., Wang, R., Guan, Y., &#38; Sha, L. (2018). Safety-assured model-driven design of the multifunction vehicle bus controller. <i>IEEE Transactions on Intelligent Transportation Systems</i>. IEEE. <a href=\"https://doi.org/10.1109/TITS.2017.2778077\">https://doi.org/10.1109/TITS.2017.2778077</a>"},"publist_id":"7389","language":[{"iso":"eng"}],"oa_version":"None","publisher":"IEEE","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1205"}]},"issue":"10","date_published":"2018-01-01T00:00:00Z","abstract":[{"lang":"eng","text":"In this paper, we present a formal model-driven design approach to establish a safety-assured implementation of multifunction vehicle bus controller (MVBC), which controls the data transmission among the devices of the vehicle. First, the generic models and safety requirements described in International Electrotechnical Commission Standard 61375 are formalized as time automata and timed computation tree logic formulas, respectively. With model checking tool Uppaal, we verify whether or not the constructed timed automata satisfy the formulas and several logic inconsistencies in the original standard are detected and corrected. Then, we apply the code generation tool Times to generate C code from the verified model, which is later synthesized into a real MVBC chip, with some handwriting glue code. Furthermore, the runtime verification tool RMOR is applied on the integrated code, to verify some safety requirements that cannot be formalized on the timed automata. For evaluation, we compare the proposed approach with existing MVBC design methods, such as BeagleBone, Galsblock, and Simulink. Experiments show that more ambiguousness or bugs in the standard are detected during Uppaal verification, and the generated code of Times outperforms the C code generated by others in terms of the synthesized binary code size. The errors in the standard have been confirmed and the resulting MVBC has been deployed in the real train communication network."}],"date_updated":"2025-09-22T09:39:54Z","department":[{"_id":"ToHe"}],"isi":1,"external_id":{"isi":["000446651100020"]},"publication":"IEEE Transactions on Intelligent Transportation Systems","day":"01","scopus_import":"1","date_created":"2018-12-11T11:46:27Z","volume":19,"article_processing_charge":"No","month":"01","title":"Safety-assured model-driven design of the multifunction vehicle bus controller","page":"3320 - 3333","intvolume":"        19","publication_status":"published","year":"2018","type":"journal_article","status":"public","quality_controlled":"1","_id":"434","doi":"10.1109/TITS.2017.2778077"},{"intvolume":"       141","title":"Superconcentrators of density 25.3","page":"269 - 304","month":"10","article_processing_charge":"No","volume":141,"date_created":"2018-12-11T11:44:11Z","scopus_import":"1","day":"01","publication":"Ars Combinatoria","publication_identifier":{"issn":["0381-7032"]},"main_file_link":[{"url":"https://arxiv.org/abs/1405.7828","open_access":"1"}],"_id":"18","oa":1,"quality_controlled":"1","status":"public","type":"journal_article","year":"2018","publication_status":"published","oa_version":"Preprint","language":[{"iso":"eng"}],"publist_id":"8037","citation":{"ieee":"V. Kolmogorov and M. Rolinek, “Superconcentrators of density 25.3,” <i>Ars Combinatoria</i>, vol. 141, no. 10. Charles Babbage Research Centre, pp. 269–304, 2018.","chicago":"Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” <i>Ars Combinatoria</i>. Charles Babbage Research Centre, 2018.","mla":"Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” <i>Ars Combinatoria</i>, vol. 141, no. 10, Charles Babbage Research Centre, 2018, pp. 269–304.","ista":"Kolmogorov V, Rolinek M. 2018. Superconcentrators of density 25.3. Ars Combinatoria. 141(10), 269–304.","ama":"Kolmogorov V, Rolinek M. Superconcentrators of density 25.3. <i>Ars Combinatoria</i>. 2018;141(10):269-304.","short":"V. Kolmogorov, M. Rolinek, Ars Combinatoria 141 (2018) 269–304.","apa":"Kolmogorov, V., &#38; Rolinek, M. (2018). Superconcentrators of density 25.3. <i>Ars Combinatoria</i>. Charles Babbage Research Centre."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir"},{"full_name":"Rolinek, Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","first_name":"Michal","last_name":"Rolinek"}],"external_id":{"isi":["000446809500022"],"arxiv":["1405.7828"]},"isi":1,"department":[{"_id":"VlKo"}],"date_updated":"2023-09-19T14:46:18Z","abstract":[{"lang":"eng","text":"An N-superconcentrator is a directed, acyclic graph with N input nodes and N output nodes such that every subset of the inputs and every subset of the outputs of same cardinality can be connected by node-disjoint paths. It is known that linear-size and bounded-degree superconcentrators exist. We prove the existence of such superconcentrators with asymptotic density 25.3 (where the density is the number of edges divided by N). The previously best known densities were 28 [12] and 27.4136 [17]."}],"date_published":"2018-10-01T00:00:00Z","arxiv":1,"issue":"10","publisher":"Charles Babbage Research Centre"},{"language":[{"iso":"eng"}],"oa_version":"Published Version","citation":{"ama":"Lewi M, Lieb É, Seiringer R. Statistical mechanics of the uniform electron gas. <i>Journal de l’Ecole Polytechnique - Mathematiques</i>. 2018;5:79-116. doi:<a href=\"https://doi.org/10.5802/jep.64\">10.5802/jep.64</a>","short":"M. Lewi, É. Lieb, R. Seiringer, Journal de l’Ecole Polytechnique - Mathematiques 5 (2018) 79–116.","apa":"Lewi, M., Lieb, É., &#38; Seiringer, R. (2018). Statistical mechanics of the uniform electron gas. <i>Journal de l’Ecole Polytechnique - Mathematiques</i>. Ecole Polytechnique. <a href=\"https://doi.org/10.5802/jep.64\">https://doi.org/10.5802/jep.64</a>","ieee":"M. Lewi, É. Lieb, and R. Seiringer, “Statistical mechanics of the uniform electron gas,” <i>Journal de l’Ecole Polytechnique - Mathematiques</i>, vol. 5. Ecole Polytechnique, pp. 79–116, 2018.","chicago":"Lewi, Mathieu, Élliott Lieb, and Robert Seiringer. “Statistical Mechanics of the Uniform Electron Gas.” <i>Journal de l’Ecole Polytechnique - Mathematiques</i>. Ecole Polytechnique, 2018. <a href=\"https://doi.org/10.5802/jep.64\">https://doi.org/10.5802/jep.64</a>.","mla":"Lewi, Mathieu, et al. “Statistical Mechanics of the Uniform Electron Gas.” <i>Journal de l’Ecole Polytechnique - Mathematiques</i>, vol. 5, Ecole Polytechnique, 2018, pp. 79–116, doi:<a href=\"https://doi.org/10.5802/jep.64\">10.5802/jep.64</a>.","ista":"Lewi M, Lieb É, Seiringer R. 2018. Statistical mechanics of the uniform electron gas. Journal de l’Ecole Polytechnique - Mathematiques. 5, 79–116."},"publist_id":"7741","author":[{"full_name":"Lewi, Mathieu","first_name":"Mathieu","last_name":"Lewi"},{"last_name":"Lieb","first_name":"Élliott","full_name":"Lieb, Élliott"},{"full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","last_name":"Seiringer"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["510"],"external_id":{"arxiv":["1705.10676"]},"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"}],"date_updated":"2025-04-14T07:26:59Z","department":[{"_id":"RoSe"}],"arxiv":1,"date_published":"2018-07-01T00:00:00Z","publisher":"Ecole Polytechnique","title":"Statistical mechanics of the uniform electron gas","page":"79 - 116","intvolume":"         5","project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Analysis of quantum many-body systems","grant_number":"694227"},{"_id":"25C878CE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","grant_number":"P27533_N27"}],"volume":5,"file":[{"file_size":843938,"date_updated":"2020-07-14T12:45:16Z","content_type":"application/pdf","file_name":"2018_JournaldeLecoleMath_Lewi.pdf","access_level":"open_access","relation":"main_file","file_id":"5726","creator":"dernst","date_created":"2018-12-17T16:38:18Z","checksum":"1ba7cccdf3900f42c4f715ae75d6813c"}],"article_processing_charge":"No","month":"07","tmp":{"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","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)"},"day":"01","scopus_import":"1","ec_funded":1,"date_created":"2018-12-11T11:45:03Z","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.","publication":"Journal de l'Ecole Polytechnique - Mathematiques","_id":"180","publication_identifier":{"issn":["2429-7100"],"eissn":["2270-518X"]},"doi":"10.5802/jep.64","article_type":"original","oa":1,"has_accepted_license":"1","file_date_updated":"2020-07-14T12:45:16Z","year":"2018","publication_status":"published","status":"public","type":"journal_article","quality_controlled":"1"},{"quality_controlled":"1","publication_status":"published","file_date_updated":"2020-07-14T12:45:17Z","year":"2018","status":"public","type":"conference","alternative_title":["HSCC Proceedings"],"_id":"182","doi":"10.1145/3178126.3178132","publication_identifier":{"isbn":["978-1-4503-5642-8 "]},"has_accepted_license":"1","oa":1,"scopus_import":"1","date_created":"2018-12-11T11:45:04Z","day":"11","publication":"Proceedings of the 21st International Conference on Hybrid Systems","project":[{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"page":"177 - 186","title":"Efficient parametric identification for STL","month":"04","article_processing_charge":"No","file":[{"access_level":"open_access","checksum":"81eabc96430e84336ea88310ac0a1ad0","date_created":"2020-05-14T12:18:29Z","relation":"main_file","file_id":"7833","creator":"dernst","content_type":"application/pdf","date_updated":"2020-07-14T12:45:17Z","file_size":5900421,"file_name":"2018_HSCC_Bakhirkin.pdf"}],"date_published":"2018-04-11T00:00:00Z","conference":{"end_date":"2018-04-13","name":"HSCC: Hybrid Systems - Computation and Control","location":"Porto, Portugal","start_date":"2018-04-11"},"publisher":"ACM","ddc":["000"],"isi":1,"external_id":{"isi":["000474781600020"]},"date_updated":"2025-07-10T11:51:21Z","department":[{"_id":"ToHe"}],"abstract":[{"text":"We describe a new algorithm for the parametric identification problem for signal temporal logic (STL), stated as follows. Given a densetime real-valued signal w and a parameterized temporal logic formula φ, compute the subset of the parameter space that renders the formula satisfied by the signal. Unlike previous solutions, which were based on search in the parameter space or quantifier elimination, our procedure works recursively on φ and computes the evolution over time of the set of valid parameter assignments. This procedure is similar to that of monitoring or computing the robustness of φ relative to w. Our implementation and experiments demonstrate that this approach can work well in practice.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Bakhirkin","first_name":"Alexey","full_name":"Bakhirkin, Alexey"},{"orcid":"0000-0001-5199-3143","full_name":"Ferrere, Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","last_name":"Ferrere"},{"first_name":"Oded","last_name":"Maler","full_name":"Maler, Oded"}],"language":[{"iso":"eng"}],"oa_version":"Submitted Version","publist_id":"7739","citation":{"chicago":"Bakhirkin, Alexey, Thomas Ferrere, and Oded Maler. “Efficient Parametric Identification for STL.” In <i>Proceedings of the 21st International Conference on Hybrid Systems</i>, 177–86. ACM, 2018. <a href=\"https://doi.org/10.1145/3178126.3178132\">https://doi.org/10.1145/3178126.3178132</a>.","ieee":"A. Bakhirkin, T. Ferrere, and O. Maler, “Efficient parametric identification for STL,” in <i>Proceedings of the 21st International Conference on Hybrid Systems</i>, Porto, Portugal, 2018, pp. 177–186.","mla":"Bakhirkin, Alexey, et al. “Efficient Parametric Identification for STL.” <i>Proceedings of the 21st International Conference on Hybrid Systems</i>, ACM, 2018, pp. 177–86, doi:<a href=\"https://doi.org/10.1145/3178126.3178132\">10.1145/3178126.3178132</a>.","ista":"Bakhirkin A, Ferrere T, Maler O. 2018. Efficient parametric identification for STL. Proceedings of the 21st International Conference on Hybrid Systems. HSCC: Hybrid Systems - Computation and Control, HSCC Proceedings, , 177–186.","apa":"Bakhirkin, A., Ferrere, T., &#38; Maler, O. (2018). Efficient parametric identification for STL. In <i>Proceedings of the 21st International Conference on Hybrid Systems</i> (pp. 177–186). Porto, Portugal: ACM. <a href=\"https://doi.org/10.1145/3178126.3178132\">https://doi.org/10.1145/3178126.3178132</a>","short":"A. Bakhirkin, T. Ferrere, O. Maler, in:, Proceedings of the 21st International Conference on Hybrid Systems, ACM, 2018, pp. 177–186.","ama":"Bakhirkin A, Ferrere T, Maler O. Efficient parametric identification for STL. In: <i>Proceedings of the 21st International Conference on Hybrid Systems</i>. ACM; 2018:177-186. doi:<a href=\"https://doi.org/10.1145/3178126.3178132\">10.1145/3178126.3178132</a>"}},{"quality_controlled":"1","year":"2018","publication_status":"published","status":"public","type":"conference","alternative_title":["HSCC Proceedings"],"_id":"183","doi":"10.1145/3178126.3178131","scopus_import":"1","acknowledgement":"This work was partially supported by the Austrian Science Fund (FWF) under grants S11402-N23 and S11405-N23 (RiSE/SHiNE), the CPS/IoT project (HRSM), the EU ICT COST Action IC1402 on Run-time Verification beyond Monitoring (ARVI), the AMASS project (ECSEL 692474), and the ENABLE-S3 project (ECSEL 692455). The CPS/IoT project receives support from the Austrian government through the Federal Ministry of Science, Research and Economy (BMWFW) in the funding program Hochschulraum-Strukturmittel (HRSM) 2016. The ECSEL Joint Undertaking receives support from the European Union’s Horizon 2020 research and innovation programme and Austria, Denmark, Germany, Finland, Czech Republic, Italy, Spain, Portugal, Poland, Ireland, Belgium, France, Netherlands, United Kingdom, Slovakia, Norway.","date_created":"2018-12-11T11:45:04Z","day":"11","project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"page":"197 - 206","title":"Localizing faults in simulink/stateflow models with STL","month":"04","article_processing_charge":"No","date_published":"2018-04-11T00:00:00Z","conference":{"end_date":"2018-04-13","name":"HSCC: Hybrid Systems - Computation and Control","location":"Porto, Portugal","start_date":"2018-04-11"},"publisher":"Association for Computing Machinery","isi":1,"external_id":{"isi":["000474781600022"]},"date_updated":"2025-07-10T11:51:22Z","department":[{"_id":"ToHe"}],"abstract":[{"lang":"eng","text":"Fault-localization is considered to be a very tedious and time-consuming activity in the design of complex Cyber-Physical Systems (CPS). This laborious task essentially requires expert knowledge of the system in order to discover the cause of the fault. In this context, we propose a new procedure that AIDS designers in debugging Simulink/Stateflow hybrid system models, guided by Signal Temporal Logic (STL) specifications. The proposed method relies on three main ingredients: (1) a monitoring and a trace diagnostics procedure that checks whether a tested behavior satisfies or violates an STL specification, localizes time segments and interfaces variables contributing to the property violations; (2) a slicing procedure that maps these observable behavior segments to the internal states and transitions of the Simulink model; and (3) a spectrum-based fault-localization method that combines the previous analysis from multiple tests to identify the internal states and/or transitions that are the most likely to explain the fault. We demonstrate the applicability of our approach on two Simulink models from the automotive and the avionics domain."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Ezio","last_name":"Bartocci","full_name":"Bartocci, Ezio"},{"last_name":"Ferrere","first_name":"Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","full_name":"Ferrere, Thomas","orcid":"0000-0001-5199-3143"},{"last_name":"Manjunath","first_name":"Niveditha","full_name":"Manjunath, Niveditha"},{"full_name":"Nickovic, Dejan","last_name":"Nickovic","first_name":"Dejan"}],"language":[{"iso":"eng"}],"oa_version":"None","publist_id":"7738","citation":{"ista":"Bartocci E, Ferrere T, Manjunath N, Nickovic D. 2018. Localizing faults in simulink/stateflow models with STL. HSCC: Hybrid Systems - Computation and Control, HSCC Proceedings, , 197–206.","mla":"Bartocci, Ezio, et al. <i>Localizing Faults in Simulink/Stateflow Models with STL</i>. Association for Computing Machinery, 2018, pp. 197–206, doi:<a href=\"https://doi.org/10.1145/3178126.3178131\">10.1145/3178126.3178131</a>.","ieee":"E. Bartocci, T. Ferrere, N. Manjunath, and D. Nickovic, “Localizing faults in simulink/stateflow models with STL,” presented at the HSCC: Hybrid Systems - Computation and Control, Porto, Portugal, 2018, pp. 197–206.","chicago":"Bartocci, Ezio, Thomas Ferrere, Niveditha Manjunath, and Dejan Nickovic. “Localizing Faults in Simulink/Stateflow Models with STL,” 197–206. Association for Computing Machinery, 2018. <a href=\"https://doi.org/10.1145/3178126.3178131\">https://doi.org/10.1145/3178126.3178131</a>.","short":"E. Bartocci, T. Ferrere, N. Manjunath, D. Nickovic, in:, Association for Computing Machinery, 2018, pp. 197–206.","ama":"Bartocci E, Ferrere T, Manjunath N, Nickovic D. Localizing faults in simulink/stateflow models with STL. In: Association for Computing Machinery; 2018:197-206. doi:<a href=\"https://doi.org/10.1145/3178126.3178131\">10.1145/3178126.3178131</a>","apa":"Bartocci, E., Ferrere, T., Manjunath, N., &#38; Nickovic, D. (2018). Localizing faults in simulink/stateflow models with STL (pp. 197–206). Presented at the HSCC: Hybrid Systems - Computation and Control, Porto, Portugal: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3178126.3178131\">https://doi.org/10.1145/3178126.3178131</a>"}},{"alternative_title":["Leibniz International Proceedings in Information, LIPIcs"],"status":"public","type":"conference","year":"2018","publication_status":"published","file_date_updated":"2020-07-14T12:45:18Z","quality_controlled":"1","oa":1,"has_accepted_license":"1","doi":"10.4230/LIPIcs.SoCG.2018.41","_id":"184","day":"11","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"acknowledgement":"Partially supported by the project EMBEDS II (CZ: 7AMB17FR029, FR: 38087RM) of Czech-French collaboration.","date_created":"2018-12-11T11:45:04Z","scopus_import":1,"file":[{"date_updated":"2020-07-14T12:45:18Z","content_type":"application/pdf","file_size":718414,"file_name":"2018_LIPIcs_Goaoc.pdf","access_level":"open_access","checksum":"d12bdd60f04a57307867704b5f930afd","date_created":"2018-12-17T16:35:02Z","relation":"main_file","creator":"dernst","file_id":"5725"}],"volume":99,"month":"06","page":"41:1 - 41:16","title":"Shellability is NP-complete","intvolume":"        99","related_material":{"record":[{"id":"7108","relation":"later_version","status":"public"}]},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","conference":{"location":"Budapest, Hungary","start_date":"2018-06-11","end_date":"2018-06-14","name":"SoCG: Symposium on Computational Geometry"},"date_published":"2018-06-11T00:00:00Z","abstract":[{"lang":"eng","text":"We prove that for every d ≥ 2, deciding if a pure, d-dimensional, simplicial complex is shellable is NP-hard, hence NP-complete. This resolves a question raised, e.g., by Danaraj and Klee in 1978. Our reduction also yields that for every d ≥ 2 and k ≥ 0, deciding if a pure, d-dimensional, simplicial complex is k-decomposable is NP-hard. For d ≥ 3, both problems remain NP-hard when restricted to contractible pure d-dimensional complexes."}],"department":[{"_id":"UlWa"}],"date_updated":"2025-06-04T07:49:02Z","ddc":["516","000"],"author":[{"full_name":"Goaoc, Xavier","last_name":"Goaoc","first_name":"Xavier"},{"first_name":"Pavel","last_name":"Paták","full_name":"Paták, Pavel"},{"id":"48B57058-F248-11E8-B48F-1D18A9856A87","last_name":"Patakova","first_name":"Zuzana","full_name":"Patakova, Zuzana","orcid":"0000-0002-3975-1683"},{"first_name":"Martin","last_name":"Tancer","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1191-6714","full_name":"Tancer, Martin"},{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","last_name":"Wagner","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Shellability is NP-complete,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99, p. 41:1-41:16.","chicago":"Goaoc, Xavier, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner. “Shellability Is NP-Complete,” 99:41:1-41:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.41\">https://doi.org/10.4230/LIPIcs.SoCG.2018.41</a>.","mla":"Goaoc, Xavier, et al. <i>Shellability Is NP-Complete</i>. Vol. 99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 41:1-41:16, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.41\">10.4230/LIPIcs.SoCG.2018.41</a>.","ista":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2018. Shellability is NP-complete. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 41:1-41:16.","short":"X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 41:1-41:16.","ama":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. Shellability is NP-complete. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:41:1-41:16. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.41\">10.4230/LIPIcs.SoCG.2018.41</a>","apa":"Goaoc, X., Paták, P., Patakova, Z., Tancer, M., &#38; Wagner, U. (2018). Shellability is NP-complete (Vol. 99, p. 41:1-41:16). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.41\">https://doi.org/10.4230/LIPIcs.SoCG.2018.41</a>"},"publist_id":"7736","oa_version":"Published Version","language":[{"iso":"eng"}]},{"issue":"22","publisher":"American Society for Cell Biology","date_published":"2018-11-01T00:00:00Z","department":[{"_id":"MiSi"}],"date_updated":"2026-07-06T12:25:34Z","abstract":[{"text":"Lamellipodia are flat membrane protrusions formed during mesenchymal motion. Polymerization at the leading edge assembles the actin filament network and generates protrusion force. How this force is supported by the network and how the assembly rate is shared between protrusion and network retrograde flow determines the protrusion rate. We use mathematical modeling to understand experiments changing the F-actin density in lamellipodia of B16-F1 melanoma cells by modulation of Arp2/3 complex activity or knockout of the formins FMNL2 and FMNL3. Cells respond to a reduction of density with a decrease of protrusion velocity, an increase in the ratio of force to filament number, but constant network assembly rate. The relation between protrusion force and tension gradient in the F-actin network and the density dependency of friction, elasticity, and viscosity of the network explain the experimental observations. The formins act as filament nucleators and elongators with differential rates. Modulation of their activity suggests an effect on network assembly rate. Contrary to these expectations, the effect of changes in elongator composition is much weaker than the consequences of the density change. We conclude that the force acting on the leading edge membrane is the force required to drive F-actin network retrograde flow.","lang":"eng"}],"external_id":{"pmid":["30156465"],"isi":["000455641000011"]},"isi":1,"ddc":["570"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Dolati, Setareh","last_name":"Dolati","first_name":"Setareh"},{"last_name":"Kage","first_name":"Frieda","full_name":"Kage, Frieda"},{"first_name":"Jan","last_name":"Mueller","full_name":"Mueller, Jan"},{"full_name":"Müsken, Mathias","last_name":"Müsken","first_name":"Mathias"},{"first_name":"Marieluise","last_name":"Kirchner","full_name":"Kirchner, Marieluise"},{"first_name":"Gunnar","last_name":"Dittmar","full_name":"Dittmar, Gunnar"},{"orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K","last_name":"Sixt"},{"full_name":"Rottner, Klemens","first_name":"Klemens","last_name":"Rottner"},{"full_name":"Falcke, Martin","last_name":"Falcke","first_name":"Martin"}],"citation":{"ama":"Dolati S, Kage F, Mueller J, et al. On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility. <i>Molecular Biology of the Cell</i>. 2018;29(22):2674-2686. doi:<a href=\"https://doi.org/10.1091/mbc.e18-02-0082\">10.1091/mbc.e18-02-0082</a>","short":"S. Dolati, F. Kage, J. Mueller, M. Müsken, M. Kirchner, G. Dittmar, M.K. Sixt, K. Rottner, M. Falcke, Molecular Biology of the Cell 29 (2018) 2674–2686.","apa":"Dolati, S., Kage, F., Mueller, J., Müsken, M., Kirchner, M., Dittmar, G., … Falcke, M. (2018). On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility. <i>Molecular Biology of the Cell</i>. American Society for Cell Biology. <a href=\"https://doi.org/10.1091/mbc.e18-02-0082\">https://doi.org/10.1091/mbc.e18-02-0082</a>","mla":"Dolati, Setareh, et al. “On the Relation between Filament Density, Force Generation, and Protrusion Rate in Mesenchymal Cell Motility.” <i>Molecular Biology of the Cell</i>, vol. 29, no. 22, American Society for Cell Biology, 2018, pp. 2674–86, doi:<a href=\"https://doi.org/10.1091/mbc.e18-02-0082\">10.1091/mbc.e18-02-0082</a>.","ista":"Dolati S, Kage F, Mueller J, Müsken M, Kirchner M, Dittmar G, Sixt MK, Rottner K, Falcke M. 2018. On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility. Molecular Biology of the Cell. 29(22), 2674–2686.","ieee":"S. Dolati <i>et al.</i>, “On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility,” <i>Molecular Biology of the Cell</i>, vol. 29, no. 22. American Society for Cell Biology, pp. 2674–2686, 2018.","chicago":"Dolati, Setareh, Frieda Kage, Jan Mueller, Mathias Müsken, Marieluise Kirchner, Gunnar Dittmar, Michael K Sixt, Klemens Rottner, and Martin Falcke. “On the Relation between Filament Density, Force Generation, and Protrusion Rate in Mesenchymal Cell Motility.” <i>Molecular Biology of the Cell</i>. American Society for Cell Biology, 2018. <a href=\"https://doi.org/10.1091/mbc.e18-02-0082\">https://doi.org/10.1091/mbc.e18-02-0082</a>."},"oa_version":"Published Version","language":[{"iso":"eng"}],"das_tickbox":"1","quality_controlled":"1","status":"public","type":"journal_article","publication_status":"published","year":"2018","file_date_updated":"2020-07-14T12:47:15Z","has_accepted_license":"1","oa":1,"publication_identifier":{"eissn":["1939-4586"]},"doi":"10.1091/mbc.e18-02-0082","_id":"5992","publication":"Molecular Biology of the Cell","date_created":"2019-02-14T12:25:47Z","scopus_import":"1","day":"01","tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","short":"CC BY-NC-SA (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png"},"pmid":1,"article_processing_charge":"No","month":"11","file":[{"file_name":"2018_ASCB_Dolati.pdf","date_updated":"2020-07-14T12:47:15Z","content_type":"application/pdf","file_size":6668971,"checksum":"e98465b4416b3e804c47f40086932af2","date_created":"2019-02-14T12:34:29Z","relation":"main_file","creator":"kschuh","file_id":"5994","access_level":"open_access"}],"volume":29,"intvolume":"        29","title":"On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility","page":"2674-2686"},{"doi":"10.1101/494088","_id":"8547","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/494088"}],"oa":1,"abstract":[{"text":"The cerebral cortex contains multiple hierarchically organized areas with distinctive cytoarchitectonical patterns, but the cellular mechanisms underlying the emergence of this diversity remain unclear. Here, we have quantitatively investigated the neuronal output of individual progenitor cells in the ventricular zone of the developing mouse neocortex using a combination of methods that together circumvent the biases and limitations of individual approaches. We found that individual cortical progenitor cells show a high degree of stochasticity and generate pyramidal cell lineages that adopt a wide range of laminar configurations. Mathematical modelling these lineage data suggests that a small number of progenitor cell populations, each generating pyramidal cells following different stochastic developmental programs, suffice to generate the heterogenous complement of pyramidal cell lineages that collectively build the complex cytoarchitecture of the neocortex.","lang":"eng"}],"department":[{"_id":"SiHi"}],"date_updated":"2026-07-06T12:52:50Z","status":"public","type":"preprint","publication_status":"submitted","year":"2018","date_published":"2018-12-13T00:00:00Z","das_tickbox":"1","oa_version":"Preprint","title":"Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture","language":[{"iso":"eng"}],"project":[{"name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development","grant_number":"725780","call_identifier":"H2020","_id":"260018B0-B435-11E9-9278-68D0E5697425"},{"grant_number":"M02416","name":"Molecular Mechanisms Regulating Gliogenesis in the Neocortex","call_identifier":"FWF","_id":"264E56E2-B435-11E9-9278-68D0E5697425"}],"citation":{"ieee":"A. Llorca <i>et al.</i>, “Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture,” <i>bioRxiv</i>. .","chicago":"Llorca, Alfredo, Gabriele Ciceri, Robert J Beattie, Fong K. Wong, Giovanni Diana, Eleni Serafeimidou, Marian Fernández-Otero, et al. “Heterogeneous Progenitor Cell Behaviors Underlie the Assembly of Neocortical Cytoarchitecture.” <i>BioRxiv</i>, n.d. <a href=\"https://doi.org/10.1101/494088\">https://doi.org/10.1101/494088</a>.","mla":"Llorca, Alfredo, et al. “Heterogeneous Progenitor Cell Behaviors Underlie the Assembly of Neocortical Cytoarchitecture.” <i>BioRxiv</i>, doi:<a href=\"https://doi.org/10.1101/494088\">10.1101/494088</a>.","ista":"Llorca A, Ciceri G, Beattie RJ, Wong FK, Diana G, Serafeimidou E, Fernández-Otero M, Streicher C, Arnold SJ, Meyer M, Hippenmeyer S, Maravall M, Marín O. Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture. bioRxiv, <a href=\"https://doi.org/10.1101/494088\">10.1101/494088</a>.","short":"A. Llorca, G. Ciceri, R.J. Beattie, F.K. Wong, G. Diana, E. Serafeimidou, M. Fernández-Otero, C. Streicher, S.J. Arnold, M. Meyer, S. Hippenmeyer, M. Maravall, O. Marín, BioRxiv (n.d.).","ama":"Llorca A, Ciceri G, Beattie RJ, et al. Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture. <i>bioRxiv</i>. doi:<a href=\"https://doi.org/10.1101/494088\">10.1101/494088</a>","apa":"Llorca, A., Ciceri, G., Beattie, R. J., Wong, F. K., Diana, G., Serafeimidou, E., … Marín, O. (n.d.). Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture. <i>bioRxiv</i>. <a href=\"https://doi.org/10.1101/494088\">https://doi.org/10.1101/494088</a>"},"month":"12","article_processing_charge":"No","day":"13","ec_funded":1,"acknowledgement":"We thank I. Andrew and S.E. Bae for excellent technical assistance, F. Gage for plasmids, and K. Nave (Nex-Cre) for mouse colonies. We thank members of the Marín and Rico laboratories for stimulating discussions and ideas. Our research on this topic is supported by grants from the European Research Council (ERC-2017-AdG 787355 to O.M and ERC2016-CoG 725780 to S.H.) and Wellcome Trust (103714MA) to O.M. L.L. was the recipient of an EMBO long-term postdoctoral fellowship, R.B. received support from FWF Lise-Meitner program (M 2416) and F.K.W. was supported by an EMBO postdoctoral fellowship and is currently a Marie Skłodowska-Curie Fellow from the European Commission under the H2020 Programme.","date_created":"2020-09-21T12:01:50Z","author":[{"full_name":"Llorca, Alfredo","last_name":"Llorca","first_name":"Alfredo"},{"first_name":"Gabriele","last_name":"Ciceri","full_name":"Ciceri, Gabriele"},{"orcid":"0000-0002-8483-8753","full_name":"Beattie, Robert J","id":"2E26DF60-F248-11E8-B48F-1D18A9856A87","first_name":"Robert J","last_name":"Beattie"},{"full_name":"Wong, Fong K.","last_name":"Wong","first_name":"Fong K."},{"last_name":"Diana","first_name":"Giovanni","full_name":"Diana, Giovanni"},{"last_name":"Serafeimidou","first_name":"Eleni","full_name":"Serafeimidou, Eleni"},{"first_name":"Marian","last_name":"Fernández-Otero","full_name":"Fernández-Otero, Marian"},{"full_name":"Streicher, Carmen","id":"36BCB99C-F248-11E8-B48F-1D18A9856A87","first_name":"Carmen","last_name":"Streicher"},{"full_name":"Arnold, Sebastian J.","last_name":"Arnold","first_name":"Sebastian J."},{"first_name":"Martin","last_name":"Meyer","full_name":"Meyer, Martin"},{"last_name":"Hippenmeyer","first_name":"Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87","full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061"},{"last_name":"Maravall","first_name":"Miguel","full_name":"Maravall, Miguel"},{"first_name":"Oscar","last_name":"Marín","full_name":"Marín, Oscar"}],"publication":"bioRxiv","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"ddc":["000"],"date_updated":"2026-07-06T13:16:35Z","department":[{"_id":"KrPi"}],"abstract":[{"text":"In this paper, we evaluate clock signals generated in ring oscillators and self-timed rings and the way their jitter can be transformed into random numbers. We show that counting the periods of the jittery clock signal produces random numbers of significantly better quality than the methods in which the jittery signal is simply sampled (the case in almost all current methods). Moreover, we use the counter values to characterize and continuously monitor the source of randomness. However, instead of using the widely used statistical variance, we propose to use Allan variance to do so. There are two main advantages: Allan variance is insensitive to low frequency noises such as flicker noise that are known to be autocorrelated and significantly less circuitry is required for its computation than that used to compute commonly used variance. We also show that it is essential to use a differential principle of randomness extraction from the jitter based on the use of two identical oscillators to avoid autocorrelations originating from external and internal global jitter sources and that this fact is valid for both kinds of rings. Last but not least, we propose a method of statistical testing based on high order Markov model to show the reduced dependencies when the proposed randomness extraction is applied.","lang":"eng"}],"date_published":"2018-01-01T00:00:00Z","issue":"3","publisher":"International Association for Cryptologic Research","language":[{"iso":"eng"}],"oa_version":"Published Version","citation":{"chicago":"Allini, Elie Noumon, Maciej Skórski, Oto Petura, Florent Bernard, Marek Laban, and Viktor Fischer. “Evaluation and Monitoring of Free Running Oscillators Serving as Source of Randomness.” <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>. International Association for Cryptologic Research, 2018. <a href=\"https://doi.org/10.13154/tches.v2018.i3.214-242\">https://doi.org/10.13154/tches.v2018.i3.214-242</a>.","ieee":"E. N. Allini, M. Skórski, O. Petura, F. Bernard, M. Laban, and V. Fischer, “Evaluation and monitoring of free running oscillators serving as source of randomness,” <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>, vol. 2018, no. 3. International Association for Cryptologic Research, pp. 214–242, 2018.","mla":"Allini, Elie Noumon, et al. “Evaluation and Monitoring of Free Running Oscillators Serving as Source of Randomness.” <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>, vol. 2018, no. 3, International Association for Cryptologic Research, 2018, pp. 214–42, doi:<a href=\"https://doi.org/10.13154/tches.v2018.i3.214-242\">10.13154/tches.v2018.i3.214-242</a>.","ista":"Allini EN, Skórski M, Petura O, Bernard F, Laban M, Fischer V. 2018. Evaluation and monitoring of free running oscillators serving as source of randomness. IACR Transactions on Cryptographic Hardware and Embedded Systems. 2018(3), 214–242.","apa":"Allini, E. N., Skórski, M., Petura, O., Bernard, F., Laban, M., &#38; Fischer, V. (2018). Evaluation and monitoring of free running oscillators serving as source of randomness. <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>. International Association for Cryptologic Research. <a href=\"https://doi.org/10.13154/tches.v2018.i3.214-242\">https://doi.org/10.13154/tches.v2018.i3.214-242</a>","ama":"Allini EN, Skórski M, Petura O, Bernard F, Laban M, Fischer V. Evaluation and monitoring of free running oscillators serving as source of randomness. <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>. 2018;2018(3):214-242. doi:<a href=\"https://doi.org/10.13154/tches.v2018.i3.214-242\">10.13154/tches.v2018.i3.214-242</a>","short":"E.N. Allini, M. Skórski, O. Petura, F. Bernard, M. Laban, V. Fischer, IACR Transactions on Cryptographic Hardware and Embedded Systems 2018 (2018) 214–242."},"corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Allini, Elie Noumon","first_name":"Elie Noumon","last_name":"Allini"},{"last_name":"Skórski","first_name":"Maciej","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","full_name":"Skórski, Maciej"},{"last_name":"Petura","first_name":"Oto","full_name":"Petura, Oto"},{"last_name":"Bernard","first_name":"Florent","full_name":"Bernard, Florent"},{"full_name":"Laban, Marek","last_name":"Laban","first_name":"Marek"},{"last_name":"Fischer","first_name":"Viktor","full_name":"Fischer, Viktor"}],"_id":"10286","doi":"10.13154/tches.v2018.i3.214-242","publication_identifier":{"eissn":["2569-2925"]},"has_accepted_license":"1","article_type":"original","oa":1,"quality_controlled":"1","publication_status":"published","year":"2018","file_date_updated":"2021-11-15T10:27:29Z","status":"public","type":"journal_article","das_tickbox":"1","intvolume":"      2018","title":"Evaluation and monitoring of free running oscillators serving as source of randomness","page":"214-242","month":"01","article_processing_charge":"No","volume":2018,"file":[{"date_updated":"2021-11-15T10:27:29Z","content_type":"application/pdf","file_size":955755,"file_name":"2018_IACR_Allini.pdf","success":1,"access_level":"open_access","date_created":"2021-11-15T10:27:29Z","checksum":"b816b848f046c48a8357700d9305dce5","file_id":"10289","creator":"cchlebak","relation":"main_file"}],"scopus_import":"1","OA_type":"diamond","date_created":"2021-11-14T23:01:25Z","OA_place":"publisher","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"day":"01","publication":"IACR Transactions on Cryptographic Hardware and Embedded Systems"},{"language":[{"iso":"eng"}],"oa_version":"Published Version","citation":{"short":"D.R. Usmanova, N.S. Bogatyreva, J. Ariño Bernad, A.A. Eremina, A.A. Gorshkova, G.M. Kanevskiy, L.R. Lonishin, A.V. Meister, A.G. Yakupova, F. Kondrashov, D. Ivankov, Bioinformatics 34 (2018) 3653–3658.","ama":"Usmanova DR, Bogatyreva NS, Ariño Bernad J, et al. Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation. <i>Bioinformatics</i>. 2018;34(21):3653-3658. doi:<a href=\"https://doi.org/10.1093/bioinformatics/bty340\">10.1093/bioinformatics/bty340</a>","apa":"Usmanova, D. R., Bogatyreva, N. S., Ariño Bernad, J., Eremina, A. A., Gorshkova, A. A., Kanevskiy, G. M., … Ivankov, D. (2018). Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation. <i>Bioinformatics</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/bioinformatics/bty340\">https://doi.org/10.1093/bioinformatics/bty340</a>","mla":"Usmanova, Dinara R., et al. “Self-Consistency Test Reveals Systematic Bias in Programs for Prediction Change of Stability upon Mutation.” <i>Bioinformatics</i>, vol. 34, no. 21, Oxford University Press, 2018, pp. 3653–58, doi:<a href=\"https://doi.org/10.1093/bioinformatics/bty340\">10.1093/bioinformatics/bty340</a>.","ista":"Usmanova DR, Bogatyreva NS, Ariño Bernad J, Eremina AA, Gorshkova AA, Kanevskiy GM, Lonishin LR, Meister AV, Yakupova AG, Kondrashov F, Ivankov D. 2018. Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation. Bioinformatics. 34(21), 3653–3658.","ieee":"D. R. Usmanova <i>et al.</i>, “Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation,” <i>Bioinformatics</i>, vol. 34, no. 21. Oxford University Press, pp. 3653–3658, 2018.","chicago":"Usmanova, Dinara R, Natalya S Bogatyreva, Joan Ariño Bernad, Aleksandra A Eremina, Anastasiya A Gorshkova, German M Kanevskiy, Lyubov R Lonishin, et al. “Self-Consistency Test Reveals Systematic Bias in Programs for Prediction Change of Stability upon Mutation.” <i>Bioinformatics</i>. Oxford University Press, 2018. <a href=\"https://doi.org/10.1093/bioinformatics/bty340\">https://doi.org/10.1093/bioinformatics/bty340</a>."},"author":[{"full_name":"Usmanova, Dinara R","first_name":"Dinara R","last_name":"Usmanova"},{"full_name":"Bogatyreva, Natalya S","first_name":"Natalya S","last_name":"Bogatyreva"},{"full_name":"Ariño Bernad, Joan","last_name":"Ariño Bernad","first_name":"Joan"},{"first_name":"Aleksandra A","last_name":"Eremina","full_name":"Eremina, Aleksandra A"},{"first_name":"Anastasiya A","last_name":"Gorshkova","full_name":"Gorshkova, Anastasiya A"},{"full_name":"Kanevskiy, German M","first_name":"German M","last_name":"Kanevskiy"},{"last_name":"Lonishin","first_name":"Lyubov R","full_name":"Lonishin, Lyubov R"},{"first_name":"Alexander V","last_name":"Meister","full_name":"Meister, Alexander V"},{"full_name":"Yakupova, Alisa G","last_name":"Yakupova","first_name":"Alisa G"},{"id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","last_name":"Kondrashov","first_name":"Fyodor","orcid":"0000-0001-8243-4694","full_name":"Kondrashov, Fyodor"},{"id":"49FF1036-F248-11E8-B48F-1D18A9856A87","last_name":"Ivankov","first_name":"Dmitry","orcid":"0000-0002-8224-4118","full_name":"Ivankov, Dmitry"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["570"],"isi":1,"external_id":{"pmid":["29722803"],"isi":["000450038900008"]},"abstract":[{"text":"Motivation\r\nComputational prediction of the effect of mutations on protein stability is used by researchers in many fields. The utility of the prediction methods is affected by their accuracy and bias. Bias, a systematic shift of the predicted change of stability, has been noted as an issue for several methods, but has not been investigated systematically. Presence of the bias may lead to misleading results especially when exploring the effects of combination of different mutations.\r\n\r\nResults\r\nHere we use a protocol to measure the bias as a function of the number of introduced mutations. It is based on a self-consistency test of the reciprocity the effect of a mutation. An advantage of the used approach is that it relies solely on crystal structures without experimentally measured stability values. We applied the protocol to four popular algorithms predicting change of protein stability upon mutation, FoldX, Eris, Rosetta and I-Mutant, and found an inherent bias. For one program, FoldX, we manage to substantially reduce the bias using additional relaxation by Modeller. Authors using algorithms for predicting effects of mutations should be aware of the bias described here.","lang":"eng"}],"date_updated":"2026-07-06T13:48:02Z","department":[{"_id":"FyKo"}],"date_published":"2018-11-01T00:00:00Z","publisher":"Oxford University Press","issue":"21","license":"https://creativecommons.org/licenses/by-nc/4.0/","title":"Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation","page":"3653-3658","intvolume":"        34","project":[{"grant_number":"335980","name":"Systematic investigation of epistasis in molecular evolution","call_identifier":"FP7","_id":"26120F5C-B435-11E9-9278-68D0E5697425"}],"volume":34,"file":[{"file_name":"2018_Oxford_Usmanova.pdf","file_size":291969,"content_type":"application/pdf","date_updated":"2020-07-14T12:47:15Z","file_id":"5997","creator":"kschuh","relation":"main_file","date_created":"2019-02-14T13:00:55Z","checksum":"7e0495153f44211479674601d7f6ee03","access_level":"open_access"}],"article_processing_charge":"No","month":"11","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"pmid":1,"day":"01","scopus_import":"1","date_created":"2019-02-14T12:48:00Z","ec_funded":1,"publication":"Bioinformatics","_id":"5995","doi":"10.1093/bioinformatics/bty340","publication_identifier":{"eissn":["1367-4811"]},"oa":1,"has_accepted_license":"1","year":"2018","publication_status":"published","file_date_updated":"2020-07-14T12:47:15Z","type":"journal_article","status":"public","quality_controlled":"1","das_tickbox":"1"},{"publication":"SIAM Journal on Mathematical Analysis","day":"30","date_created":"2018-12-11T11:46:17Z","scopus_import":"1","file":[{"date_updated":"2020-07-14T12:46:22Z","content_type":"application/pdf","file_size":557338,"file_name":"2018_SIAM_Fischer.pdf","access_level":"open_access","checksum":"89a8eae7c52bb356c04f52b44bff4b5a","date_created":"2019-11-07T12:20:25Z","relation":"main_file","creator":"dernst","file_id":"6992"}],"volume":50,"article_processing_charge":"No","month":"01","page":"411 - 455","title":"Existence of positive solutions to stochastic thin-film equations","intvolume":"        50","das_tickbox":"1","status":"public","type":"journal_article","publication_status":"published","file_date_updated":"2020-07-14T12:46:22Z","year":"2018","quality_controlled":"1","oa":1,"article_type":"original","has_accepted_license":"1","doi":"10.1137/16M1098796","_id":"404","author":[{"orcid":"0000-0002-0479-558X","full_name":"Fischer, Julian L","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","last_name":"Fischer","first_name":"Julian L"},{"first_name":"Günther","last_name":"Grün","full_name":"Grün, Günther"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1","citation":{"ista":"Fischer JL, Grün G. 2018. Existence of positive solutions to stochastic thin-film equations. SIAM Journal on Mathematical Analysis. 50(1), 411–455.","mla":"Fischer, Julian L., and Günther Grün. “Existence of Positive Solutions to Stochastic Thin-Film Equations.” <i>SIAM Journal on Mathematical Analysis</i>, vol. 50, no. 1, Society for Industrial and Applied Mathematics, 2018, pp. 411–55, doi:<a href=\"https://doi.org/10.1137/16M1098796\">10.1137/16M1098796</a>.","chicago":"Fischer, Julian L, and Günther Grün. “Existence of Positive Solutions to Stochastic Thin-Film Equations.” <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics, 2018. <a href=\"https://doi.org/10.1137/16M1098796\">https://doi.org/10.1137/16M1098796</a>.","ieee":"J. L. Fischer and G. Grün, “Existence of positive solutions to stochastic thin-film equations,” <i>SIAM Journal on Mathematical Analysis</i>, vol. 50, no. 1. Society for Industrial and Applied Mathematics, pp. 411–455, 2018.","apa":"Fischer, J. L., &#38; Grün, G. (2018). Existence of positive solutions to stochastic thin-film equations. <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/16M1098796\">https://doi.org/10.1137/16M1098796</a>","ama":"Fischer JL, Grün G. Existence of positive solutions to stochastic thin-film equations. <i>SIAM Journal on Mathematical Analysis</i>. 2018;50(1):411-455. doi:<a href=\"https://doi.org/10.1137/16M1098796\">10.1137/16M1098796</a>","short":"J.L. Fischer, G. Grün, SIAM Journal on Mathematical Analysis 50 (2018) 411–455."},"publist_id":"7425","oa_version":"Published Version","language":[{"iso":"eng"}],"publisher":"Society for Industrial and Applied Mathematics","issue":"1","date_published":"2018-01-30T00:00:00Z","abstract":[{"text":"We construct martingale solutions to stochastic thin-film equations by introducing a (spatial) semidiscretization and establishing convergence. The discrete scheme allows for variants of the energy and entropy estimates in the continuous setting as long as the discrete energy does not exceed certain threshold values depending on the spatial grid size $h$. Using a stopping time argument to prolongate high-energy paths constant in time, arbitrary moments of coupled energy/entropy functionals can be controlled. Having established Hölder regularity of approximate solutions, the convergence proof is then based on compactness arguments---in particular on Jakubowski's generalization of Skorokhod's theorem---weak convergence methods, and recent tools on martingale convergence.\r\n\r\n","lang":"eng"}],"department":[{"_id":"JuFi"}],"date_updated":"2026-07-06T14:01:18Z","isi":1,"external_id":{"isi":["000426630900015"]},"ddc":["510"]},{"das_tickbox":"1","quality_controlled":"1","type":"journal_article","status":"public","year":"2018","publication_status":"published","oa":1,"doi":"10.1137/17M1143125","main_file_link":[{"url":"https://arxiv.org/abs/1708.01546","open_access":"1"}],"_id":"181","publication":"SIAM Journal on Mathematical Analysis","date_created":"2018-12-11T11:45:03Z","ec_funded":1,"acknowledgement":"The work of the second author was also partially supported by the Hausdorff Center of Mathematics.","scopus_import":"1","day":"01","article_processing_charge":"No","month":"01","volume":50,"project":[{"grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"},{"_id":"258F40A4-B435-11E9-9278-68D0E5697425","name":"Structured Non-Hermitian Random Matrices","grant_number":"M02080","call_identifier":"FWF"}],"intvolume":"        50","page":"3271 - 3290","title":"Power law decay for systems of randomly coupled differential equations","issue":"3","publisher":"Society for Industrial and Applied Mathematics","date_published":"2018-01-01T00:00:00Z","arxiv":1,"department":[{"_id":"LaEr"}],"date_updated":"2026-07-06T14:02:06Z","abstract":[{"lang":"eng","text":"We consider large random matrices X with centered, independent entries but possibly di erent variances. We compute the normalized trace of f(X)g(X∗) for f, g functions analytic on the spectrum of X. We use these results to compute the long time asymptotics for systems of coupled di erential equations with random coe cients. We show that when the coupling is critical, the norm squared of the solution decays like t−1/2."}],"isi":1,"external_id":{"arxiv":["1708.01546"],"isi":["000437018500032"]},"ddc":["500"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0001-5366-9603","full_name":"Erdös, László","first_name":"László","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Krüger, Torben H","orcid":"0000-0002-4821-3297","id":"3020C786-F248-11E8-B48F-1D18A9856A87","first_name":"Torben H","last_name":"Krüger"},{"full_name":"Renfrew, David T","orcid":"0000-0003-3493-121X","last_name":"Renfrew","first_name":"David T","id":"4845BF6A-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"7740","citation":{"ista":"Erdös L, Krüger TH, Renfrew DT. 2018. Power law decay for systems of randomly coupled differential equations. SIAM Journal on Mathematical Analysis. 50(3), 3271–3290.","mla":"Erdös, László, et al. “Power Law Decay for Systems of Randomly Coupled Differential Equations.” <i>SIAM Journal on Mathematical Analysis</i>, vol. 50, no. 3, Society for Industrial and Applied Mathematics, 2018, pp. 3271–90, doi:<a href=\"https://doi.org/10.1137/17M1143125\">10.1137/17M1143125</a>.","chicago":"Erdös, László, Torben H Krüger, and David T Renfrew. “Power Law Decay for Systems of Randomly Coupled Differential Equations.” <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics, 2018. <a href=\"https://doi.org/10.1137/17M1143125\">https://doi.org/10.1137/17M1143125</a>.","ieee":"L. Erdös, T. H. Krüger, and D. T. Renfrew, “Power law decay for systems of randomly coupled differential equations,” <i>SIAM Journal on Mathematical Analysis</i>, vol. 50, no. 3. Society for Industrial and Applied Mathematics, pp. 3271–3290, 2018.","apa":"Erdös, L., Krüger, T. H., &#38; Renfrew, D. T. (2018). Power law decay for systems of randomly coupled differential equations. <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/17M1143125\">https://doi.org/10.1137/17M1143125</a>","ama":"Erdös L, Krüger TH, Renfrew DT. Power law decay for systems of randomly coupled differential equations. <i>SIAM Journal on Mathematical Analysis</i>. 2018;50(3):3271-3290. doi:<a href=\"https://doi.org/10.1137/17M1143125\">10.1137/17M1143125</a>","short":"L. Erdös, T.H. Krüger, D.T. Renfrew, SIAM Journal on Mathematical Analysis 50 (2018) 3271–3290."},"oa_version":"Published Version","language":[{"iso":"eng"}]},{"month":"03","article_processing_charge":"No","volume":32,"project":[{"name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"intvolume":"        32","page":"750 - 782","title":"On the optimality of the FCC lattice for soft sphere packing","publication":"SIAM J Discrete Math","acknowledgement":"This work was partially supported by the DFG Collaborative Research Center TRR 109, “Discretization in Geometry and Dynamics,” through grant I02979-N35 of the Austrian Science Fund (FWF).","date_created":"2018-12-11T11:45:46Z","scopus_import":"1","day":"29","oa":1,"article_type":"original","doi":"10.1137/16M1097201","publication_identifier":{"issn":["0895-4801"]},"main_file_link":[{"open_access":"1","url":"http://pdfs.semanticscholar.org/d2d5/6da00fbc674e6a8b1bb9d857167e54200dc6.pdf"}],"_id":"312","das_tickbox":"1","quality_controlled":"1","type":"journal_article","status":"public","year":"2018","publication_status":"published","publist_id":"7553","citation":{"mla":"Edelsbrunner, Herbert, and Mabel Iglesias Ham. “On the Optimality of the FCC Lattice for Soft Sphere Packing.” <i>SIAM J Discrete Math</i>, vol. 32, no. 1, Society for Industrial and Applied Mathematics, 2018, pp. 750–82, doi:<a href=\"https://doi.org/10.1137/16M1097201\">10.1137/16M1097201</a>.","ista":"Edelsbrunner H, Iglesias Ham M. 2018. On the optimality of the FCC lattice for soft sphere packing. SIAM J Discrete Math. 32(1), 750–782.","chicago":"Edelsbrunner, Herbert, and Mabel Iglesias Ham. “On the Optimality of the FCC Lattice for Soft Sphere Packing.” <i>SIAM J Discrete Math</i>. Society for Industrial and Applied Mathematics, 2018. <a href=\"https://doi.org/10.1137/16M1097201\">https://doi.org/10.1137/16M1097201</a>.","ieee":"H. Edelsbrunner and M. Iglesias Ham, “On the optimality of the FCC lattice for soft sphere packing,” <i>SIAM J Discrete Math</i>, vol. 32, no. 1. Society for Industrial and Applied Mathematics, pp. 750–782, 2018.","apa":"Edelsbrunner, H., &#38; Iglesias Ham, M. (2018). On the optimality of the FCC lattice for soft sphere packing. <i>SIAM J Discrete Math</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/16M1097201\">https://doi.org/10.1137/16M1097201</a>","ama":"Edelsbrunner H, Iglesias Ham M. On the optimality of the FCC lattice for soft sphere packing. <i>SIAM J Discrete Math</i>. 2018;32(1):750-782. doi:<a href=\"https://doi.org/10.1137/16M1097201\">10.1137/16M1097201</a>","short":"H. Edelsbrunner, M. Iglesias Ham, SIAM J Discrete Math 32 (2018) 750–782."},"oa_version":"Submitted Version","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"last_name":"Iglesias Ham","first_name":"Mabel","id":"41B58C0C-F248-11E8-B48F-1D18A9856A87","full_name":"Iglesias Ham, Mabel"}],"department":[{"_id":"HeEd"}],"date_updated":"2026-07-06T14:00:50Z","abstract":[{"text":"Motivated by biological questions, we study configurations of equal spheres that neither pack nor cover. Placing their centers on a lattice, we define the soft density of the configuration by penalizing multiple overlaps. Considering the 1-parameter family of diagonally distorted 3-dimensional integer lattices, we show that the soft density is maximized at the FCC lattice.","lang":"eng"}],"isi":1,"external_id":{"isi":["000428958900038"]},"issue":"1","publisher":"Society for Industrial and Applied Mathematics","date_published":"2018-03-29T00:00:00Z"},{"publisher":"Optica Publishing Group","issue":"10","date_published":"2018-10-20T00:00:00Z","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"}],"department":[{"_id":"JoFi"}],"date_updated":"2026-07-07T06:22:34Z","external_id":{"isi":["000447853100007"]},"isi":1,"ddc":["530"],"author":[{"full_name":"Botello, Gabriel","first_name":"Gabriel","last_name":"Botello"},{"full_name":"Sedlmeir, Florian","first_name":"Florian","last_name":"Sedlmeir"},{"last_name":"Rueda Sanchez","first_name":"Alfredo R","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","full_name":"Rueda Sanchez, Alfredo R","orcid":"0000-0001-6249-5860"},{"last_name":"Abdalmalak","first_name":"Kerlos","full_name":"Abdalmalak, Kerlos"},{"last_name":"Brown","first_name":"Elliott","full_name":"Brown, Elliott"},{"first_name":"Gerd","last_name":"Leuchs","full_name":"Leuchs, Gerd"},{"first_name":"Sascha","last_name":"Preu","full_name":"Preu, Sascha"},{"full_name":"Segovia Vargas, Daniel","first_name":"Daniel","last_name":"Segovia Vargas"},{"full_name":"Strekalov, Dmitry","first_name":"Dmitry","last_name":"Strekalov"},{"last_name":"Munoz","first_name":"Luis","full_name":"Munoz, Luis"},{"first_name":"Harald","last_name":"Schwefel","full_name":"Schwefel, Harald"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"G. Botello <i>et al.</i>, “Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters,” <i>Optica</i>, vol. 5, no. 10. Optica Publishing Group, pp. 1210–1219, 2018.","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.” <i>Optica</i>. Optica Publishing Group, 2018. <a href=\"https://doi.org/10.1364/OPTICA.5.001210\">https://doi.org/10.1364/OPTICA.5.001210</a>.","mla":"Botello, Gabriel, et al. “Sensitivity Limits of Millimeter-Wave Photonic Radiometers Based on Efficient Electro-Optic Upconverters.” <i>Optica</i>, vol. 5, no. 10, Optica Publishing Group, 2018, pp. 1210–19, doi:<a href=\"https://doi.org/10.1364/OPTICA.5.001210\">10.1364/OPTICA.5.001210</a>.","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.","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.","ama":"Botello G, Sedlmeir F, Rueda Sanchez AR, et al. Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters. <i>Optica</i>. 2018;5(10):1210-1219. doi:<a href=\"https://doi.org/10.1364/OPTICA.5.001210\">10.1364/OPTICA.5.001210</a>","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. <i>Optica</i>. Optica Publishing Group. <a href=\"https://doi.org/10.1364/OPTICA.5.001210\">https://doi.org/10.1364/OPTICA.5.001210</a>"},"publist_id":"8033","oa_version":"Published Version","language":[{"iso":"eng"}],"das_tickbox":"1","type":"journal_article","status":"public","publication_status":"published","year":"2018","quality_controlled":"1","oa":1,"article_type":"original","publication_identifier":{"issn":["2334-2536"]},"doi":"10.1364/OPTICA.5.001210","_id":"22","main_file_link":[{"open_access":"1","url":"www.doi.org/10.1364/OPTICA.5.001210 "}],"publication":"Optica","day":"20","date_created":"2018-12-11T11:44:12Z","scopus_import":"1","volume":5,"month":"10","article_processing_charge":"No","page":"1210-1219","title":"Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters","intvolume":"         5"},{"page":"5","title":"An Austrian proposal for the Classification of Open Access Tuples (COAT) - Distinguish different Open Access types beyond colors","month":"05","article_processing_charge":"No","file":[{"file_size":202798,"date_updated":"2020-07-14T12:47:10Z","content_type":"application/pdf","file_name":"2018_WorkingPaper_Danowski.pdf","access_level":"open_access","creator":"dernst","file_id":"5872","relation":"main_file","checksum":"6cb95f8772491d155ce77c6160655fff","date_created":"2019-01-22T09:06:51Z"}],"scopus_import":"1","date_created":"2018-12-17T10:28:26Z","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"day":"09","_id":"5686","doi":"10.5281/zenodo.1244154","has_accepted_license":"1","oa":1,"year":"2018","file_date_updated":"2020-07-14T12:47:10Z","publication_status":"published","type":"working_paper","status":"public","das_tickbox":"1","language":[{"iso":"eng"}],"oa_version":"Published Version","citation":{"ista":"Danowski P. 2018. An Austrian proposal for the Classification of Open Access Tuples (COAT) - Distinguish different Open Access types beyond colors, Zenodo, 5p.","mla":"Danowski, Patrick. <i>An Austrian Proposal for the Classification of Open Access Tuples (COAT) - Distinguish Different Open Access Types beyond Colors</i>. Zenodo, 2018, doi:<a href=\"https://doi.org/10.5281/zenodo.1244154\">10.5281/zenodo.1244154</a>.","ieee":"P. Danowski, <i>An Austrian proposal for the Classification of Open Access Tuples (COAT) - Distinguish different Open Access types beyond colors</i>. Zenodo, 2018.","chicago":"Danowski, Patrick. <i>An Austrian Proposal for the Classification of Open Access Tuples (COAT) - Distinguish Different Open Access Types beyond Colors</i>. Zenodo, 2018. <a href=\"https://doi.org/10.5281/zenodo.1244154\">https://doi.org/10.5281/zenodo.1244154</a>.","ama":"Danowski P. <i>An Austrian Proposal for the Classification of Open Access Tuples (COAT) - Distinguish Different Open Access Types beyond Colors</i>. Zenodo; 2018. doi:<a href=\"https://doi.org/10.5281/zenodo.1244154\">10.5281/zenodo.1244154</a>","short":"P. Danowski, An Austrian Proposal for the Classification of Open Access Tuples (COAT) - Distinguish Different Open Access Types beyond Colors, Zenodo, 2018.","apa":"Danowski, P. (2018). <i>An Austrian proposal for the Classification of Open Access Tuples (COAT) - Distinguish different Open Access types beyond colors</i>. Zenodo. <a href=\"https://doi.org/10.5281/zenodo.1244154\">https://doi.org/10.5281/zenodo.1244154</a>"},"corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Patrick","last_name":"Danowski","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","full_name":"Danowski, Patrick","orcid":"0000-0002-6026-4409"}],"ddc":["020"],"date_updated":"2026-07-07T06:28:30Z","department":[{"_id":"E-Lib"}],"abstract":[{"text":"In the working paper I describe in detail the approach for Open Access definitions which was presented in the Workshop \"Open Access Monitoring - Approaches and Perspectives\" in Vienna. It defines five criteria on which are the definitions build. Each criteria can be out of 4 classes. The minimum classes for the criteria which are used in a Open Access definition can be presented as the Classification of Open Access Tuples e.g. Open Access (Berlin Declaration) (1,1,1,1,3) this methods allows much easier to distinguish between different Open Access definitions. This is needed if the Open Access Universe should be measured in studies or monitoring approaches and the results should become more comparable.     ","lang":"eng"}],"date_published":"2018-05-09T00:00:00Z","related_material":{"record":[{"id":"6657","relation":"later_version","status":"public"}]},"publisher":"Zenodo"},{"article_processing_charge":"No","month":"09","volume":32,"project":[{"call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"intvolume":"        32","title":"Counting blanks in polygonal arrangements","page":"2242 - 2257","publication":"SIAM Journal on Discrete Mathematics","ec_funded":1,"date_created":"2018-12-11T11:44:24Z","scopus_import":"1","day":"06","oa":1,"doi":"10.1137/16M110407X","_id":"58","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.00960"}],"quality_controlled":"1","type":"journal_article","status":"public","publication_status":"published","year":"2018","publist_id":"7996","citation":{"ieee":"A. Akopyan and E. Segal Halevi, “Counting blanks in polygonal arrangements,” <i>SIAM Journal on Discrete Mathematics</i>, vol. 32, no. 3. Society for Industrial and Applied Mathematics, pp. 2242–2257, 2018.","chicago":"Akopyan, Arseniy, and Erel Segal Halevi. “Counting Blanks in Polygonal Arrangements.” <i>SIAM Journal on Discrete Mathematics</i>. Society for Industrial and Applied Mathematics, 2018. <a href=\"https://doi.org/10.1137/16M110407X\">https://doi.org/10.1137/16M110407X</a>.","mla":"Akopyan, Arseniy, and Erel Segal Halevi. “Counting Blanks in Polygonal Arrangements.” <i>SIAM Journal on Discrete Mathematics</i>, vol. 32, no. 3, Society for Industrial and Applied Mathematics, 2018, pp. 2242–57, doi:<a href=\"https://doi.org/10.1137/16M110407X\">10.1137/16M110407X</a>.","ista":"Akopyan A, Segal Halevi E. 2018. Counting blanks in polygonal arrangements. SIAM Journal on Discrete Mathematics. 32(3), 2242–2257.","short":"A. Akopyan, E. Segal Halevi, SIAM Journal on Discrete Mathematics 32 (2018) 2242–2257.","ama":"Akopyan A, Segal Halevi E. Counting blanks in polygonal arrangements. <i>SIAM Journal on Discrete Mathematics</i>. 2018;32(3):2242-2257. doi:<a href=\"https://doi.org/10.1137/16M110407X\">10.1137/16M110407X</a>","apa":"Akopyan, A., &#38; Segal Halevi, E. (2018). Counting blanks in polygonal arrangements. <i>SIAM Journal on Discrete Mathematics</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/16M110407X\">https://doi.org/10.1137/16M110407X</a>"},"oa_version":"Preprint","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Arseniy","last_name":"Akopyan","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy"},{"full_name":"Segal Halevi, Erel","last_name":"Segal Halevi","first_name":"Erel"}],"department":[{"_id":"HeEd"}],"date_updated":"2026-07-07T10:46:26Z","abstract":[{"lang":"eng","text":"Inside a two-dimensional region (``cake&quot;&quot;), there are m nonoverlapping tiles of a certain kind (``toppings&quot;&quot;). We want to expand the toppings while keeping them nonoverlapping, and possibly add some blank pieces of the same ``certain kind,&quot;&quot; such that the entire cake is covered. How many blanks must we add? We study this question in several cases: (1) The cake and toppings are general polygons. (2) The cake and toppings are convex figures. (3) The cake and toppings are axis-parallel rectangles. (4) The cake is an axis-parallel rectilinear polygon and the toppings are axis-parallel rectangles. In all four cases, we provide tight bounds on the number of blanks."}],"isi":1,"external_id":{"isi":["000450810500036"],"arxiv":["1604.00960"]},"issue":"3","publisher":"Society for Industrial and Applied Mathematics","date_published":"2018-09-06T00:00:00Z","arxiv":1},{"arxiv":1,"date_published":"2018-02-21T00:00:00Z","publisher":"American Physical Society","issue":"2","isi":1,"external_id":{"arxiv":["1802.07920"],"isi":["000425601000004"]},"abstract":[{"lang":"eng","text":"We investigate the quantum interference induced shifts between energetically close states in highly charged ions, with the energy structure being observed by laser spectroscopy. In this work, we focus on hyperfine states of lithiumlike heavy-Z isotopes and quantify how much quantum interference changes the observed transition frequencies. The process of photon excitation and subsequent photon decay for the transition 2s→2p→2s is implemented with fully relativistic and full-multipole frameworks, which are relevant for such relativistic atomic systems. We consider the isotopes Pb79+207 and Bi80+209 due to experimental interest, as well as other examples of isotopes with lower Z, namely Pr56+141 and Ho64+165. We conclude that quantum interference can induce shifts up to 11% of the linewidth in the measurable resonances of the considered isotopes, if interference between resonances is neglected. The inclusion of relativity decreases the cross section by 35%, mainly due to the complete retardation form of the electric dipole multipole. However, the contribution of the next higher multipoles (e.g., magnetic quadrupole) to the cross section is negligible. This makes the contribution of relativity and higher-order multipoles to the quantum interference induced shifts a minor effect, even for heavy-Z elements."}],"department":[{"_id":"MiLe"}],"date_updated":"2026-07-07T13:17:14Z","author":[{"last_name":"Amaro","first_name":"Pedro","full_name":"Amaro, Pedro"},{"first_name":"Ulisses","last_name":"Loureiro","full_name":"Loureiro, Ulisses"},{"full_name":"Safari, Laleh","first_name":"Laleh","last_name":"Safari","id":"3C325E5E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Fratini, Filippo","last_name":"Fratini","first_name":"Filippo"},{"full_name":"Indelicato, Paul","last_name":"Indelicato","first_name":"Paul"},{"last_name":"Stöhlker","first_name":"Thomas","full_name":"Stöhlker, Thomas"},{"full_name":"Santos, José","last_name":"Santos","first_name":"José"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","language":[{"iso":"eng"}],"citation":{"chicago":"Amaro, Pedro, Ulisses Loureiro, Laleh Safari, Filippo Fratini, Paul Indelicato, Thomas Stöhlker, and José Santos. “Quantum Interference in Laser Spectroscopy of Highly Charged Lithiumlike Ions.” <i>Physical Review A</i>. American Physical Society, 2018. <a href=\"https://doi.org/10.1103/PhysRevA.97.022510\">https://doi.org/10.1103/PhysRevA.97.022510</a>.","ieee":"P. Amaro <i>et al.</i>, “Quantum interference in laser spectroscopy of highly charged lithiumlike ions,” <i>Physical Review A</i>, vol. 97, no. 2. American Physical Society, 2018.","mla":"Amaro, Pedro, et al. “Quantum Interference in Laser Spectroscopy of Highly Charged Lithiumlike Ions.” <i>Physical Review A</i>, vol. 97, no. 2, 022510, American Physical Society, 2018, doi:<a href=\"https://doi.org/10.1103/PhysRevA.97.022510\">10.1103/PhysRevA.97.022510</a>.","ista":"Amaro P, Loureiro U, Safari L, Fratini F, Indelicato P, Stöhlker T, Santos J. 2018. Quantum interference in laser spectroscopy of highly charged lithiumlike ions. Physical Review A. 97(2), 022510.","apa":"Amaro, P., Loureiro, U., Safari, L., Fratini, F., Indelicato, P., Stöhlker, T., &#38; Santos, J. (2018). Quantum interference in laser spectroscopy of highly charged lithiumlike ions. <i>Physical Review A</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevA.97.022510\">https://doi.org/10.1103/PhysRevA.97.022510</a>","short":"P. Amaro, U. Loureiro, L. Safari, F. Fratini, P. Indelicato, T. Stöhlker, J. Santos, Physical Review A 97 (2018).","ama":"Amaro P, Loureiro U, Safari L, et al. Quantum interference in laser spectroscopy of highly charged lithiumlike ions. <i>Physical Review A</i>. 2018;97(2). doi:<a href=\"https://doi.org/10.1103/PhysRevA.97.022510\">10.1103/PhysRevA.97.022510</a>"},"publist_id":"7396","status":"public","type":"journal_article","publication_status":"published","year":"2018","quality_controlled":"1","das_tickbox":"1","article_number":"022510","doi":"10.1103/PhysRevA.97.022510","_id":"427","main_file_link":[{"url":"https://arxiv.org/abs/1802.07920","open_access":"1"}],"oa":1,"article_type":"original","day":"21","ec_funded":1,"acknowledgement":"This work was funded by the Portuguese Fundação para a Ciência e a Tecnologia (FCT/MCTES/PIDDAC) under Grant No. UID/FIS/04559/2013 (LIBPhys). P.A. acknowledges the support of the FCT, under Contract No. SFRH/BPD/92329/2013. L.S. acknowledges financial support from the People Programme (Marie Curie Actions) of the European Union's Seventh Framework Programme (FP7/2007-2013) under REA Grant Agreement No. (291734). Laboratoire Kastler Brossel (LKB) is “Unité Mixte de Recherche de Sorbonne Université, de ENS-PSL Research University, du Collège de France et du CNRS No. 8552.” APPENDIX:\r\n","date_created":"2018-12-11T11:46:25Z","scopus_import":"1","publication":"Physical Review A","title":"Quantum interference in laser spectroscopy of highly charged lithiumlike ions","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}],"intvolume":"        97","volume":97,"month":"02","article_processing_charge":"No"}]