[{"doi":"10.1145/3286976","publication_identifier":{"issn":["0004-5411"]},"article_processing_charge":"No","publisher":"ACM","publication_status":"published","citation":{"ista":"Ferrere T, Maler O, Ničković D, Pnueli A. 2019. From real-time logic to timed automata. Journal of the ACM. 66(3), 19.","mla":"Ferrere, Thomas, et al. “From Real-Time Logic to Timed Automata.” <i>Journal of the ACM</i>, vol. 66, no. 3, 19, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3286976\">10.1145/3286976</a>.","ieee":"T. Ferrere, O. Maler, D. Ničković, and A. Pnueli, “From real-time logic to timed automata,” <i>Journal of the ACM</i>, vol. 66, no. 3. ACM, 2019.","apa":"Ferrere, T., Maler, O., Ničković, D., &#38; Pnueli, A. (2019). From real-time logic to timed automata. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/3286976\">https://doi.org/10.1145/3286976</a>","short":"T. Ferrere, O. Maler, D. Ničković, A. Pnueli, Journal of the ACM 66 (2019).","chicago":"Ferrere, Thomas, Oded Maler, Dejan Ničković, and Amir Pnueli. “From Real-Time Logic to Timed Automata.” <i>Journal of the ACM</i>. ACM, 2019. <a href=\"https://doi.org/10.1145/3286976\">https://doi.org/10.1145/3286976</a>.","ama":"Ferrere T, Maler O, Ničković D, Pnueli A. From real-time logic to timed automata. <i>Journal of the ACM</i>. 2019;66(3). doi:<a href=\"https://doi.org/10.1145/3286976\">10.1145/3286976</a>"},"year":"2019","date_published":"2019-05-01T00:00:00Z","article_number":"19","isi":1,"title":"From real-time logic to timed automata","department":[{"_id":"ToHe"}],"month":"05","date_updated":"2025-04-15T06:26:06Z","project":[{"grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"external_id":{"isi":["000495406300005"]},"quality_controlled":"1","volume":66,"oa_version":"None","day":"01","article_type":"original","abstract":[{"lang":"eng","text":"We show how to construct temporal testers for the logic MITL, a prominent linear-time logic for real-time systems. A temporal tester is a transducer that inputs a signal holding the Boolean value of atomic propositions and outputs the truth value of a formula along time. Here we consider testers over continuous-time Boolean signals that use clock variables to enforce duration constraints, as in timed automata. We first rewrite the MITL formula into a “simple” formula using a limited set of temporal modalities. We then build testers for these specific modalities and show how to compose testers for simple formulae into complex ones. Temporal testers can be turned into acceptors, yielding a compositional translation from MITL to timed automata. This construction is much simpler than previously known and remains asymptotically optimal. It supports both past and future operators and can easily be extended."}],"_id":"7109","type":"journal_article","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"first_name":"Thomas","orcid":"0000-0001-5199-3143","full_name":"Ferrere, Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","last_name":"Ferrere"},{"first_name":"Oded","full_name":"Maler, Oded","last_name":"Maler"},{"first_name":"Dejan","last_name":"Ničković","full_name":"Ničković, Dejan"},{"first_name":"Amir","full_name":"Pnueli, Amir","last_name":"Pnueli"}],"issue":"3","language":[{"iso":"eng"}],"publication":"Journal of the ACM","date_created":"2019-11-26T10:22:32Z","status":"public","scopus_import":"1","intvolume":"        66"},{"quality_controlled":"1","external_id":{"isi":["000458114800023"]},"publication":"2018 IEEE Conference on Decision and Control","language":[{"iso":"eng"}],"day":"21","oa_version":"None","scopus_import":"1","status":"public","date_created":"2019-11-26T15:07:49Z","conference":{"name":"CDC: Conference on Decision and Control","end_date":"2018-12-19","location":"Miami Beach, FL, United States","start_date":"2018-12-17"},"abstract":[{"lang":"eng","text":"Data-rich applications in machine-learning and control have motivated an intense research on large-scale optimization. Novel algorithms have been proposed and shown to have optimal convergence rates in terms of iteration counts. However, their practical performance is severely degraded by the cost of exchanging high-dimensional gradient vectors between computing nodes. Several gradient compression heuristics have recently been proposed to reduce communications, but few theoretical results exist that quantify how they impact algorithm convergence. This paper establishes and strengthens the convergence guarantees for gradient descent under a family of gradient compression techniques. For convex optimization problems, we derive admissible step sizes and quantify both the number of iterations and the number of bits that need to be exchanged to reach a target accuracy. Finally, we validate the performance of different gradient compression techniques in simulations. The numerical results highlight the properties of different gradient compression algorithms and confirm that fast convergence with limited information exchange is possible."}],"_id":"7122","publication_status":"published","publication_identifier":{"issn":["0743-1546"],"isbn":["9781538613955"]},"publisher":"IEEE","article_processing_charge":"No","doi":"10.1109/cdc.2018.8619625","date_published":"2019-01-21T00:00:00Z","year":"2019","citation":{"ieee":"S. Khirirat, M. Johansson, and D.-A. Alistarh, “Gradient compression for communication-limited convex optimization,” in <i>2018 IEEE Conference on Decision and Control</i>, Miami Beach, FL, United States, 2019.","mla":"Khirirat, Sarit, et al. “Gradient Compression for Communication-Limited Convex Optimization.” <i>2018 IEEE Conference on Decision and Control</i>, 8619625, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/cdc.2018.8619625\">10.1109/cdc.2018.8619625</a>.","ista":"Khirirat S, Johansson M, Alistarh D-A. 2019. Gradient compression for communication-limited convex optimization. 2018 IEEE Conference on Decision and Control. CDC: Conference on Decision and Control, 8619625.","ama":"Khirirat S, Johansson M, Alistarh D-A. Gradient compression for communication-limited convex optimization. In: <i>2018 IEEE Conference on Decision and Control</i>. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/cdc.2018.8619625\">10.1109/cdc.2018.8619625</a>","chicago":"Khirirat, Sarit, Mikael Johansson, and Dan-Adrian Alistarh. “Gradient Compression for Communication-Limited Convex Optimization.” In <i>2018 IEEE Conference on Decision and Control</i>. IEEE, 2019. <a href=\"https://doi.org/10.1109/cdc.2018.8619625\">https://doi.org/10.1109/cdc.2018.8619625</a>.","short":"S. Khirirat, M. Johansson, D.-A. Alistarh, in:, 2018 IEEE Conference on Decision and Control, IEEE, 2019.","apa":"Khirirat, S., Johansson, M., &#38; Alistarh, D.-A. (2019). Gradient compression for communication-limited convex optimization. In <i>2018 IEEE Conference on Decision and Control</i>. Miami Beach, FL, United States: IEEE. <a href=\"https://doi.org/10.1109/cdc.2018.8619625\">https://doi.org/10.1109/cdc.2018.8619625</a>"},"title":"Gradient compression for communication-limited convex optimization","author":[{"last_name":"Khirirat","full_name":"Khirirat, Sarit","first_name":"Sarit"},{"first_name":"Mikael","last_name":"Johansson","full_name":"Johansson, Mikael"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","isi":1,"article_number":"8619625","type":"conference","date_updated":"2023-09-06T11:14:55Z","department":[{"_id":"DaAl"}],"month":"01"},{"publication_identifier":{"isbn":["9781538692912"]},"publisher":"IEEE","article_processing_charge":"No","doi":"10.1109/isit.2019.8849240","publication_status":"published","year":"2019","date_published":"2019-07-01T00:00:00Z","citation":{"ieee":"M. Skórski, “Strong chain rules for min-entropy under few bits spoiled,” in <i>2019 IEEE International Symposium on Information Theory</i>, Paris, France, 2019.","mla":"Skórski, Maciej. “Strong Chain Rules for Min-Entropy under Few Bits Spoiled.” <i>2019 IEEE International Symposium on Information Theory</i>, 8849240, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/isit.2019.8849240\">10.1109/isit.2019.8849240</a>.","ista":"Skórski M. 2019. Strong chain rules for min-entropy under few bits spoiled. 2019 IEEE International Symposium on Information Theory. ISIT: International Symposium on Information Theory, 8849240.","ama":"Skórski M. Strong chain rules for min-entropy under few bits spoiled. In: <i>2019 IEEE International Symposium on Information Theory</i>. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/isit.2019.8849240\">10.1109/isit.2019.8849240</a>","chicago":"Skórski, Maciej. “Strong Chain Rules for Min-Entropy under Few Bits Spoiled.” In <i>2019 IEEE International Symposium on Information Theory</i>. IEEE, 2019. <a href=\"https://doi.org/10.1109/isit.2019.8849240\">https://doi.org/10.1109/isit.2019.8849240</a>.","short":"M. Skórski, in:, 2019 IEEE International Symposium on Information Theory, IEEE, 2019.","apa":"Skórski, M. (2019). Strong chain rules for min-entropy under few bits spoiled. In <i>2019 IEEE International Symposium on Information Theory</i>. Paris, France: IEEE. <a href=\"https://doi.org/10.1109/isit.2019.8849240\">https://doi.org/10.1109/isit.2019.8849240</a>"},"article_number":"8849240","isi":1,"title":"Strong chain rules for min-entropy under few bits spoiled","date_updated":"2023-09-06T11:15:41Z","department":[{"_id":"KrPi"}],"month":"07","quality_controlled":"1","external_id":{"isi":["000489100301043"],"arxiv":["1702.08476"]},"day":"01","oa_version":"Preprint","conference":{"end_date":"2019-07-12","name":"ISIT: International Symposium on Information Theory","location":"Paris, France","start_date":"2019-07-07"},"abstract":[{"lang":"eng","text":"It is well established that the notion of min-entropy fails to satisfy the \\emph{chain rule} of the form H(X,Y)=H(X|Y)+H(Y), known for Shannon Entropy. Such a property would help to analyze how min-entropy is split among smaller blocks. Problems of this kind arise for example when constructing extractors and dispersers.\r\nWe show that any sequence of variables exhibits a very strong strong block-source structure (conditional distributions of blocks are nearly flat) when we \\emph{spoil few correlated bits}. This implies, conditioned on the spoiled bits, that \\emph{splitting-recombination properties} hold. In particular, we have many nice properties that min-entropy doesn't obey in general, for example strong chain rules, \"information can't hurt\" inequalities, equivalences of average and worst-case conditional entropy definitions and others. Quantitatively, for any sequence X1,…,Xt of random variables over an alphabet X we prove that, when conditioned on m=t⋅O(loglog|X|+loglog(1/ϵ)+logt) bits of auxiliary information, all conditional distributions of the form Xi|X<i are ϵ-close to be nearly flat (only a constant factor away). The argument is combinatorial (based on simplex coverings).\r\nThis result may be used as a generic tool for \\emph{exhibiting block-source structures}. We demonstrate this by reproving the fundamental converter due to Nisan and Zuckermann (\\emph{J. Computer and System Sciences, 1996}), which shows that sampling blocks from a min-entropy source roughly preserves the entropy rate. Our bound implies, only by straightforward chain rules, an additive loss of o(1) (for sufficiently many samples), which qualitatively meets the first tighter analysis of this problem due to Vadhan (\\emph{CRYPTO'03}), obtained by large deviation techniques. "}],"main_file_link":[{"url":"https://arxiv.org/abs/1702.08476","open_access":"1"}],"arxiv":1,"_id":"7136","oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"first_name":"Maciej","full_name":"Skórski, Maciej","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","last_name":"Skórski"}],"type":"conference","publication":"2019 IEEE International Symposium on Information Theory","language":[{"iso":"eng"}],"scopus_import":"1","date_created":"2019-11-28T10:19:21Z","status":"public"},{"oa":1,"_id":"7143","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"first_name":"Scott A","orcid":"0000-0002-4566-0593","id":"2D99FE6A-F248-11E8-B48F-1D18A9856A87","full_name":"Sinclair, Scott A","last_name":"Sinclair"},{"last_name":"Friml","full_name":"Friml, Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří","orcid":"0000-0002-8302-7596"}],"type":"journal_article","scopus_import":"1","date_created":"2019-12-02T12:30:48Z","status":"public","publication":"Cell Research","language":[{"iso":"eng"}],"pmid":1,"page":"965-966","intvolume":"        29","date_published":"2019-12-01T00:00:00Z","year":"2019","citation":{"ista":"Sinclair SA, Friml J. 2019. Defying gravity: a plant’s quest for moisture. Cell Research. 29, 965–966.","mla":"Sinclair, Scott A., and Jiří Friml. “Defying Gravity: A Plant’s Quest for Moisture.” <i>Cell Research</i>, vol. 29, Springer Nature, 2019, pp. 965–66, doi:<a href=\"https://doi.org/10.1038/s41422-019-0254-4\">10.1038/s41422-019-0254-4</a>.","ieee":"S. A. Sinclair and J. Friml, “Defying gravity: a plant’s quest for moisture,” <i>Cell Research</i>, vol. 29. Springer Nature, pp. 965–966, 2019.","apa":"Sinclair, S. A., &#38; Friml, J. (2019). Defying gravity: a plant’s quest for moisture. <i>Cell Research</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41422-019-0254-4\">https://doi.org/10.1038/s41422-019-0254-4</a>","short":"S.A. Sinclair, J. Friml, Cell Research 29 (2019) 965–966.","chicago":"Sinclair, Scott A, and Jiří Friml. “Defying Gravity: A Plant’s Quest for Moisture.” <i>Cell Research</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1038/s41422-019-0254-4\">https://doi.org/10.1038/s41422-019-0254-4</a>.","ama":"Sinclair SA, Friml J. Defying gravity: a plant’s quest for moisture. <i>Cell Research</i>. 2019;29:965-966. doi:<a href=\"https://doi.org/10.1038/s41422-019-0254-4\">10.1038/s41422-019-0254-4</a>"},"publication_identifier":{"eissn":["1748-7838"],"issn":["1001-0602"]},"article_processing_charge":"No","publisher":"Springer Nature","doi":"10.1038/s41422-019-0254-4","publication_status":"published","date_updated":"2023-09-06T11:20:58Z","month":"12","department":[{"_id":"JiFr"}],"isi":1,"title":"Defying gravity: a plant's quest for moisture","volume":29,"day":"01","oa_version":"Published Version","external_id":{"pmid":["31745287"],"isi":["000500749600001"]},"quality_controlled":"1","article_type":"original","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1038/s41422-019-0254-4"}],"abstract":[{"text":"Roots grow downwards parallel to the gravity vector, to anchor a plant in soil and acquire water and nutrients, using a gravitropic mechanism dependent on the asymmetric distribution of the phytohormone auxin. Recently, Chang et al. demonstrate that asymmetric distribution of another phytohormone, cytokinin, directs root growth towards higher water content.","lang":"eng"}]},{"citation":{"apa":"Anselmetti, G. L. R., Martinez, E. A., Ménard, G. C., Puglia, D., Malinowski, F. K., Lee, J. S., … Higginbotham, A. P. (2019). End-to-end correlated subgap states in hybrid nanowires. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevb.100.205412\">https://doi.org/10.1103/physrevb.100.205412</a>","short":"G.L.R. Anselmetti, E.A. Martinez, G.C. Ménard, D. Puglia, F.K. Malinowski, J.S. Lee, S. Choi, M. Pendharkar, C.J. Palmstrøm, C.M. Marcus, L. Casparis, A.P. Higginbotham, Physical Review B 100 (2019).","chicago":"Anselmetti, G. L. R., E. A. Martinez, G. C. Ménard, D. Puglia, F. K. Malinowski, J. S. Lee, S. Choi, et al. “End-to-End Correlated Subgap States in Hybrid Nanowires.” <i>Physical Review B</i>. American Physical Society, 2019. <a href=\"https://doi.org/10.1103/physrevb.100.205412\">https://doi.org/10.1103/physrevb.100.205412</a>.","ama":"Anselmetti GLR, Martinez EA, Ménard GC, et al. End-to-end correlated subgap states in hybrid nanowires. <i>Physical Review B</i>. 2019;100(20). doi:<a href=\"https://doi.org/10.1103/physrevb.100.205412\">10.1103/physrevb.100.205412</a>","ista":"Anselmetti GLR, Martinez EA, Ménard GC, Puglia D, Malinowski FK, Lee JS, Choi S, Pendharkar M, Palmstrøm CJ, Marcus CM, Casparis L, Higginbotham AP. 2019. End-to-end correlated subgap states in hybrid nanowires. Physical Review B. 100(20), 205412.","mla":"Anselmetti, G. L. R., et al. “End-to-End Correlated Subgap States in Hybrid Nanowires.” <i>Physical Review B</i>, vol. 100, no. 20, 205412, American Physical Society, 2019, doi:<a href=\"https://doi.org/10.1103/physrevb.100.205412\">10.1103/physrevb.100.205412</a>.","ieee":"G. L. R. Anselmetti <i>et al.</i>, “End-to-end correlated subgap states in hybrid nanowires,” <i>Physical Review B</i>, vol. 100, no. 20. American Physical Society, 2019."},"year":"2019","date_published":"2019-11-15T00:00:00Z","doi":"10.1103/physrevb.100.205412","publisher":"American Physical Society","publication_identifier":{"eissn":["2469-9969"],"issn":["2469-9950"]},"article_processing_charge":"No","publication_status":"published","department":[{"_id":"AnHi"}],"month":"11","date_updated":"2024-02-28T13:13:51Z","article_number":"205412","isi":1,"title":"End-to-end correlated subgap states in hybrid nanowires","volume":100,"oa_version":"Preprint","day":"15","quality_controlled":"1","external_id":{"arxiv":["1908.05549"],"isi":["000495967500006"]},"article_type":"original","abstract":[{"lang":"eng","text":"End-to-end correlated bound states are investigated in superconductor-semiconductor hybrid nanowires at zero magnetic field. Peaks in subgap conductance are independently identified from each wire end, and a cross-correlation function is computed that counts end-to-end coincidences, averaging over thousands of subgap features. Strong correlations in a short, 300-nm device are reduced by a factor of 4 in a long, 900-nm device. In addition, subgap conductance distributions are investigated, and correlations between the left and right distributions are identified based on their mutual information."}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1908.05549"}],"oa":1,"arxiv":1,"_id":"7145","issue":"20","type":"journal_article","author":[{"first_name":"G. L. R.","full_name":"Anselmetti, G. L. R.","last_name":"Anselmetti"},{"full_name":"Martinez, E. A.","last_name":"Martinez","first_name":"E. A."},{"first_name":"G. C.","full_name":"Ménard, G. C.","last_name":"Ménard"},{"full_name":"Puglia, D.","last_name":"Puglia","first_name":"D."},{"full_name":"Malinowski, F. K.","last_name":"Malinowski","first_name":"F. K."},{"full_name":"Lee, J. S.","last_name":"Lee","first_name":"J. S."},{"first_name":"S.","full_name":"Choi, S.","last_name":"Choi"},{"full_name":"Pendharkar, M.","last_name":"Pendharkar","first_name":"M."},{"first_name":"C. J.","full_name":"Palmstrøm, C. J.","last_name":"Palmstrøm"},{"first_name":"C. M.","full_name":"Marcus, C. M.","last_name":"Marcus"},{"first_name":"L.","last_name":"Casparis","full_name":"Casparis, L."},{"full_name":"Higginbotham, Andrew P","id":"4AD6785A-F248-11E8-B48F-1D18A9856A87","last_name":"Higginbotham","orcid":"0000-0003-2607-2363","first_name":"Andrew P"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2019-12-04T16:02:25Z","status":"public","scopus_import":"1","language":[{"iso":"eng"}],"publication":"Physical Review B","intvolume":"       100"},{"volume":3,"oa_version":"None","day":"25","ec_funded":1,"external_id":{"isi":["000500728800009"]},"quality_controlled":"1","project":[{"grant_number":"715257","call_identifier":"H2020","_id":"250BDE62-B435-11E9-9278-68D0E5697425","name":"Prevalence and Influence of Sexual Antagonism on Genome Evolution"}],"abstract":[{"text":"Prevailing models of sex-chromosome evolution were largely inspired by the stable and highly differentiated XY pairs of model organisms, such as those of mammals and flies. Recent work has uncovered an incredible diversity of sex-determining systems, bringing some of the assumptions of these traditional models into question. One particular question that has arisen is what drives some sex chromosomes to be maintained over millions of years and differentiate fully, while others are replaced by new sex-determining chromosomes before differentiation has occurred. Here, I review recent data on the variability of sex-determining genes and sex chromosomes in different non-model vertebrates and invertebrates, and discuss some theoretical models that have been put forward to account for this diversity.","lang":"eng"}],"article_type":"original","year":"2019","date_published":"2019-11-25T00:00:00Z","citation":{"ista":"Vicoso B. 2019. Molecular and evolutionary dynamics of animal sex-chromosome turnover. Nature Ecology &#38; Evolution. 3(12), 1632–1641.","ieee":"B. Vicoso, “Molecular and evolutionary dynamics of animal sex-chromosome turnover,” <i>Nature Ecology &#38; Evolution</i>, vol. 3, no. 12. Springer Nature, pp. 1632–1641, 2019.","mla":"Vicoso, Beatriz. “Molecular and Evolutionary Dynamics of Animal Sex-Chromosome Turnover.” <i>Nature Ecology &#38; Evolution</i>, vol. 3, no. 12, Springer Nature, 2019, pp. 1632–41, doi:<a href=\"https://doi.org/10.1038/s41559-019-1050-8\">10.1038/s41559-019-1050-8</a>.","short":"B. Vicoso, Nature Ecology &#38; Evolution 3 (2019) 1632–1641.","apa":"Vicoso, B. (2019). Molecular and evolutionary dynamics of animal sex-chromosome turnover. <i>Nature Ecology &#38; Evolution</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41559-019-1050-8\">https://doi.org/10.1038/s41559-019-1050-8</a>","ama":"Vicoso B. Molecular and evolutionary dynamics of animal sex-chromosome turnover. <i>Nature Ecology &#38; Evolution</i>. 2019;3(12):1632-1641. doi:<a href=\"https://doi.org/10.1038/s41559-019-1050-8\">10.1038/s41559-019-1050-8</a>","chicago":"Vicoso, Beatriz. “Molecular and Evolutionary Dynamics of Animal Sex-Chromosome Turnover.” <i>Nature Ecology &#38; Evolution</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1038/s41559-019-1050-8\">https://doi.org/10.1038/s41559-019-1050-8</a>."},"publication_status":"published","article_processing_charge":"No","publication_identifier":{"issn":["2397-334X"]},"publisher":"Springer Nature","doi":"10.1038/s41559-019-1050-8","date_updated":"2025-04-14T07:41:21Z","month":"11","department":[{"_id":"BeVi"}],"title":"Molecular and evolutionary dynamics of animal sex-chromosome turnover","isi":1,"scopus_import":"1","status":"public","date_created":"2019-12-04T16:05:25Z","publication":"Nature Ecology & Evolution","language":[{"iso":"eng"}],"intvolume":"         3","page":"1632-1641","_id":"7146","issue":"12","author":[{"last_name":"Vicoso","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","full_name":"Vicoso, Beatriz","orcid":"0000-0002-4579-8306","first_name":"Beatriz"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","type":"journal_article"},{"file_date_updated":"2020-07-14T12:47:50Z","tmp":{"name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png"},"contributor":[{"first_name":"Ruslan","orcid":"0000-0001-9819-5077","last_name":"Guseinov","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Connor","last_name":"McMahan"},{"first_name":"Jesus","id":"2DC83906-F248-11E8-B48F-1D18A9856A87","last_name":"Perez Rodriguez"},{"last_name":"Daraio","first_name":"Chiara"},{"first_name":"Bernd","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel"}],"month":"12","department":[{"_id":"BeBi"}],"date_updated":"2025-06-12T06:58:31Z","title":"Supplementary data for \"Programming temporal morphing of self-actuated shells\"","type":"research_data","author":[{"id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","full_name":"Guseinov, Ruslan","last_name":"Guseinov","orcid":"0000-0001-9819-5077","first_name":"Ruslan"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Guseinov R. 2019. Supplementary data for ‘Programming temporal morphing of self-actuated shells’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:7154\">10.15479/AT:ISTA:7154</a>.","mla":"Guseinov, Ruslan. <i>Supplementary Data for “Programming Temporal Morphing of Self-Actuated Shells.”</i> Institute of Science and Technology Austria, 2019, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7154\">10.15479/AT:ISTA:7154</a>.","ieee":"R. Guseinov, “Supplementary data for ‘Programming temporal morphing of self-actuated shells.’” Institute of Science and Technology Austria, 2019.","apa":"Guseinov, R. (2019). Supplementary data for “Programming temporal morphing of self-actuated shells.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:7154\">https://doi.org/10.15479/AT:ISTA:7154</a>","short":"R. Guseinov, (2019).","chicago":"Guseinov, Ruslan. “Supplementary Data for ‘Programming Temporal Morphing of Self-Actuated Shells.’” Institute of Science and Technology Austria, 2019. <a href=\"https://doi.org/10.15479/AT:ISTA:7154\">https://doi.org/10.15479/AT:ISTA:7154</a>.","ama":"Guseinov R. Supplementary data for “Programming temporal morphing of self-actuated shells.” 2019. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:7154\">10.15479/AT:ISTA:7154</a>"},"related_material":{"record":[{"status":"deleted","id":"8433","relation":"used_in_publication"},{"relation":"used_in_publication","status":"public","id":"7262"}]},"date_published":"2019-12-06T00:00:00Z","oa":1,"year":"2019","_id":"7154","doi":"10.15479/AT:ISTA:7154","publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","file":[{"file_id":"7155","creator":"dernst","file_name":"temporal_morphing_supp_data.zip","date_updated":"2020-07-14T12:47:50Z","content_type":"application/x-zip-compressed","access_level":"open_access","file_size":65307107,"relation":"main_file","date_created":"2019-12-09T07:52:17Z","checksum":"155133e6e188e85b3c0676a5e70b9341"}],"ddc":["000"],"oa_version":"Published Version","day":"06","ec_funded":1,"status":"public","date_created":"2019-12-09T07:52:46Z","has_accepted_license":"1","project":[{"name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411"}]},{"publication_status":"published","doi":"10.1242/dev.176297","article_processing_charge":"No","publisher":"The Company of Biologists","publication_identifier":{"issn":["0950-1991"],"eissn":["1477-9129"]},"citation":{"mla":"Guerrero, Pilar, et al. “Neuronal Differentiation Influences Progenitor Arrangement in the Vertebrate Neuroepithelium.” <i>Development</i>, vol. 146, no. 23, dev176297, The Company of Biologists, 2019, doi:<a href=\"https://doi.org/10.1242/dev.176297\">10.1242/dev.176297</a>.","ieee":"P. Guerrero <i>et al.</i>, “Neuronal differentiation influences progenitor arrangement in the vertebrate neuroepithelium,” <i>Development</i>, vol. 146, no. 23. The Company of Biologists, 2019.","ista":"Guerrero P, Perez-Carrasco R, Zagórski MP, Page D, Kicheva A, Briscoe J, Page KM. 2019. Neuronal differentiation influences progenitor arrangement in the vertebrate neuroepithelium. Development. 146(23), dev176297.","chicago":"Guerrero, Pilar, Ruben Perez-Carrasco, Marcin P Zagórski, David Page, Anna Kicheva, James Briscoe, and Karen M. Page. “Neuronal Differentiation Influences Progenitor Arrangement in the Vertebrate Neuroepithelium.” <i>Development</i>. The Company of Biologists, 2019. <a href=\"https://doi.org/10.1242/dev.176297\">https://doi.org/10.1242/dev.176297</a>.","ama":"Guerrero P, Perez-Carrasco R, Zagórski MP, et al. Neuronal differentiation influences progenitor arrangement in the vertebrate neuroepithelium. <i>Development</i>. 2019;146(23). doi:<a href=\"https://doi.org/10.1242/dev.176297\">10.1242/dev.176297</a>","apa":"Guerrero, P., Perez-Carrasco, R., Zagórski, M. P., Page, D., Kicheva, A., Briscoe, J., &#38; Page, K. M. (2019). Neuronal differentiation influences progenitor arrangement in the vertebrate neuroepithelium. <i>Development</i>. The Company of Biologists. <a href=\"https://doi.org/10.1242/dev.176297\">https://doi.org/10.1242/dev.176297</a>","short":"P. Guerrero, R. Perez-Carrasco, M.P. Zagórski, D. Page, A. Kicheva, J. Briscoe, K.M. Page, Development 146 (2019)."},"year":"2019","date_published":"2019-12-04T00:00:00Z","title":"Neuronal differentiation influences progenitor arrangement in the vertebrate neuroepithelium","isi":1,"article_number":"dev176297","tmp":{"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)","short":"CC BY (4.0)"},"department":[{"_id":"AnKi"}],"month":"12","date_updated":"2025-04-14T07:27:30Z","project":[{"name":"Coordination of Patterning And Growth In the Spinal Cord","_id":"B6FC0238-B512-11E9-945C-1524E6697425","call_identifier":"H2020","grant_number":"680037"}],"quality_controlled":"1","external_id":{"pmid":["31784457"],"isi":["000507575700004"]},"volume":146,"oa_version":"Published Version","day":"04","ec_funded":1,"abstract":[{"lang":"eng","text":"Cell division, movement and differentiation contribute to pattern formation in developing tissues. This is the case in the vertebrate neural tube, in which neurons differentiate in a characteristic pattern from a highly dynamic proliferating pseudostratified epithelium. To investigate how progenitor proliferation and differentiation affect cell arrangement and growth of the neural tube, we used experimental measurements to develop a mechanical model of the apical surface of the neuroepithelium that incorporates the effect of interkinetic nuclear movement and spatially varying rates of neuronal differentiation. Simulations predict that tissue growth and the shape of lineage-related clones of cells differ with the rate of differentiation. Growth is isotropic in regions of high differentiation, but dorsoventrally biased in regions of low differentiation. This is consistent with experimental observations. The absence of directional signalling in the simulations indicates that global mechanical constraints are sufficient to explain the observed differences in anisotropy. This provides insight into how the tissue growth rate affects cell dynamics and growth anisotropy and opens up possibilities to study the coupling between mechanics, pattern formation and growth in the neural tube."}],"article_type":"original","_id":"7165","oa":1,"type":"journal_article","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"full_name":"Guerrero, Pilar","last_name":"Guerrero","first_name":"Pilar"},{"first_name":"Ruben","last_name":"Perez-Carrasco","full_name":"Perez-Carrasco, Ruben"},{"orcid":"0000-0001-7896-7762","first_name":"Marcin P","last_name":"Zagórski","full_name":"Zagórski, Marcin P","id":"343DA0DC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"David","last_name":"Page","full_name":"Page, David"},{"orcid":"0000-0003-4509-4998","first_name":"Anna","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","full_name":"Kicheva, Anna","last_name":"Kicheva"},{"last_name":"Briscoe","full_name":"Briscoe, James","first_name":"James"},{"last_name":"Page","full_name":"Page, Karen M.","first_name":"Karen M."}],"file_date_updated":"2020-07-14T12:47:50Z","issue":"23","corr_author":"1","has_accepted_license":"1","language":[{"iso":"eng"}],"publication":"Development","scopus_import":"1","status":"public","date_created":"2019-12-10T14:39:50Z","intvolume":"       146","pmid":1,"file":[{"relation":"main_file","file_size":7797881,"access_level":"open_access","checksum":"b6533c37dc8fbd803ffeca216e0a8b8a","date_created":"2019-12-13T07:34:06Z","file_id":"7177","creator":"dernst","content_type":"application/pdf","date_updated":"2020-07-14T12:47:50Z","file_name":"2019_Development_Guerrero.pdf"}],"ddc":["570"]},{"day":"30","oa_version":"None","date_created":"2019-12-11T14:15:56Z","edition":"1","status":"public","quality_controlled":"1","language":[{"iso":"ger"}],"abstract":[{"lang":"ger","text":"Wissen Sie, was sich hinter künstlicher Intelligenz und maschinellem Lernen verbirgt? \r\nDieses Sachbuch erklärt Ihnen leicht verständlich und ohne komplizierte Formeln die grundlegenden Methoden und Vorgehensweisen des maschinellen Lernens. Mathematisches Vorwissen ist dafür nicht nötig. Kurzweilig und informativ illustriert Lisa, die Protagonistin des Buches, diese anhand von Alltagssituationen. \r\nEin Buch für alle, die in Diskussionen über Chancen und Risiken der aktuellen Entwicklung der künstlichen Intelligenz und des maschinellen Lernens mit Faktenwissen punkten möchten. Auch für Schülerinnen und Schüler geeignet!"}],"page":"XIV, 245","editor":[{"first_name":"Kristian","full_name":"Kersting, Kristian","last_name":"Kersting"},{"orcid":"0000-0001-8622-7887","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","last_name":"Lampert"},{"first_name":"Constantin","full_name":"Rothkopf, Constantin","last_name":"Rothkopf"}],"citation":{"apa":"Kersting, K., Lampert, C., &#38; Rothkopf, C. (Eds.). (2019). <i>Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt</i> (1st ed.). Wiesbaden: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-658-26763-6\">https://doi.org/10.1007/978-3-658-26763-6</a>","short":"K. Kersting, C. Lampert, C. Rothkopf, eds., Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt, 1st ed., Springer Nature, Wiesbaden, 2019.","chicago":"Kersting, Kristian, Christoph Lampert, and Constantin Rothkopf, eds. <i>Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt</i>. 1st ed. Wiesbaden: Springer Nature, 2019. <a href=\"https://doi.org/10.1007/978-3-658-26763-6\">https://doi.org/10.1007/978-3-658-26763-6</a>.","ama":"Kersting K, Lampert C, Rothkopf C, eds. <i>Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt</i>. 1st ed. Wiesbaden: Springer Nature; 2019. doi:<a href=\"https://doi.org/10.1007/978-3-658-26763-6\">10.1007/978-3-658-26763-6</a>","ista":"Kersting K, Lampert C, Rothkopf C eds. 2019. Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt 1st ed., Wiesbaden: Springer Nature, XIV, 245p.","mla":"Kersting, Kristian, et al., editors. <i>Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt</i>. 1st ed., Springer Nature, 2019, doi:<a href=\"https://doi.org/10.1007/978-3-658-26763-6\">10.1007/978-3-658-26763-6</a>.","ieee":"K. Kersting, C. Lampert, and C. Rothkopf, Eds., <i>Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt</i>, 1st ed. Wiesbaden: Springer Nature, 2019."},"year":"2019","related_material":{"link":[{"relation":"press_release","description":"News on IST Website","url":"https://ist.ac.at/en/news/book-release-how-machines-learn/"}]},"date_published":"2019-10-30T00:00:00Z","publication_status":"published","_id":"7171","doi":"10.1007/978-3-658-26763-6","article_processing_charge":"No","place":"Wiesbaden","publisher":"Springer Nature","publication_identifier":{"isbn":["978-3-658-26762-9"],"eisbn":["978-3-658-26763-6"]},"department":[{"_id":"ChLa"}],"month":"10","date_updated":"2021-12-22T14:40:58Z","title":"Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt","type":"book_editor","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9"},{"ec_funded":1,"volume":37,"oa_version":"Submitted Version","day":"01","external_id":{"pmid":["31792410"],"isi":["000500748900021"]},"quality_controlled":"1","project":[{"call_identifier":"H2020","_id":"26580278-B435-11E9-9278-68D0E5697425","name":"Characterizing the fitness landscape on population and global scales","grant_number":"771209"}],"article_type":"original","abstract":[{"lang":"eng","text":"Multiple sequence alignments (MSAs) are used for structural1,2 and evolutionary predictions1,2, but the complexity of aligning large datasets requires the use of approximate solutions3, including the progressive algorithm4. Progressive MSA methods start by aligning the most similar sequences and subsequently incorporate the remaining sequences, from leaf-to-root, based on a guide-tree. Their accuracy declines substantially as the number of sequences is scaled up5. We introduce a regressive algorithm that enables MSA of up to 1.4 million sequences on a standard workstation and substantially improves accuracy on datasets larger than 10,000 sequences. Our regressive algorithm works the other way around to the progressive algorithm and begins by aligning the most dissimilar sequences. It uses an efficient divide-and-conquer strategy to run third-party alignment methods in linear time, regardless of their original complexity. Our approach will enable analyses of extremely large genomic datasets such as the recently announced Earth BioGenome Project, which comprises 1.5 million eukaryotic genomes6."}],"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6894943/"}],"date_published":"2019-12-01T00:00:00Z","year":"2019","citation":{"apa":"Garriga, E., Di Tommaso, P., Magis, C., Erb, I., Mansouri, L., Baltzis, A., … Notredame, C. (2019). Large multiple sequence alignments with a root-to-leaf regressive method. <i>Nature Biotechnology</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41587-019-0333-6\">https://doi.org/10.1038/s41587-019-0333-6</a>","short":"E. Garriga, P. Di Tommaso, C. Magis, I. Erb, L. Mansouri, A. Baltzis, H. Laayouni, F. Kondrashov, E. Floden, C. Notredame, Nature Biotechnology 37 (2019) 1466–1470.","chicago":"Garriga, Edgar, Paolo Di Tommaso, Cedrik Magis, Ionas Erb, Leila Mansouri, Athanasios Baltzis, Hafid Laayouni, Fyodor Kondrashov, Evan Floden, and Cedric Notredame. “Large Multiple Sequence Alignments with a Root-to-Leaf Regressive Method.” <i>Nature Biotechnology</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1038/s41587-019-0333-6\">https://doi.org/10.1038/s41587-019-0333-6</a>.","ama":"Garriga E, Di Tommaso P, Magis C, et al. Large multiple sequence alignments with a root-to-leaf regressive method. <i>Nature Biotechnology</i>. 2019;37(12):1466-1470. doi:<a href=\"https://doi.org/10.1038/s41587-019-0333-6\">10.1038/s41587-019-0333-6</a>","ista":"Garriga E, Di Tommaso P, Magis C, Erb I, Mansouri L, Baltzis A, Laayouni H, Kondrashov F, Floden E, Notredame C. 2019. Large multiple sequence alignments with a root-to-leaf regressive method. Nature Biotechnology. 37(12), 1466–1470.","mla":"Garriga, Edgar, et al. “Large Multiple Sequence Alignments with a Root-to-Leaf Regressive Method.” <i>Nature Biotechnology</i>, vol. 37, no. 12, Springer Nature, 2019, pp. 1466–70, doi:<a href=\"https://doi.org/10.1038/s41587-019-0333-6\">10.1038/s41587-019-0333-6</a>.","ieee":"E. Garriga <i>et al.</i>, “Large multiple sequence alignments with a root-to-leaf regressive method,” <i>Nature Biotechnology</i>, vol. 37, no. 12. Springer Nature, pp. 1466–1470, 2019."},"publication_identifier":{"issn":["1087-0156"],"eissn":["1546-1696"]},"publisher":"Springer Nature","article_processing_charge":"No","doi":"10.1038/s41587-019-0333-6","publication_status":"published","date_updated":"2025-07-10T11:54:19Z","department":[{"_id":"FyKo"}],"month":"12","isi":1,"title":"Large multiple sequence alignments with a root-to-leaf regressive method","date_created":"2019-12-15T23:00:43Z","scopus_import":"1","status":"public","publication":"Nature Biotechnology","language":[{"iso":"eng"}],"pmid":1,"intvolume":"        37","page":"1466-1470","oa":1,"related_material":{"record":[{"relation":"research_data","status":"public","id":"13059"}]},"_id":"7181","issue":"12","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Garriga","full_name":"Garriga, Edgar","first_name":"Edgar"},{"last_name":"Di Tommaso","full_name":"Di Tommaso, Paolo","first_name":"Paolo"},{"last_name":"Magis","full_name":"Magis, Cedrik","first_name":"Cedrik"},{"first_name":"Ionas","full_name":"Erb, Ionas","last_name":"Erb"},{"last_name":"Mansouri","full_name":"Mansouri, Leila","first_name":"Leila"},{"first_name":"Athanasios","last_name":"Baltzis","full_name":"Baltzis, Athanasios"},{"full_name":"Laayouni, Hafid","last_name":"Laayouni","first_name":"Hafid"},{"first_name":"Fyodor","orcid":"0000-0001-8243-4694","last_name":"Kondrashov","full_name":"Kondrashov, Fyodor","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Evan","full_name":"Floden, Evan","last_name":"Floden"},{"first_name":"Cedric","last_name":"Notredame","full_name":"Notredame, Cedric"}],"type":"journal_article"},{"type":"journal_article","author":[{"full_name":"Huber, D.","last_name":"Huber","first_name":"D."},{"last_name":"Hammer","full_name":"Hammer, H.-W.","first_name":"H.-W."},{"last_name":"Volosniev","full_name":"Volosniev, Artem","id":"37D278BC-F248-11E8-B48F-1D18A9856A87","first_name":"Artem","orcid":"0000-0003-0393-5525"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:47:52Z","issue":"3","corr_author":"1","_id":"7190","arxiv":1,"oa":1,"intvolume":"         1","file":[{"creator":"dernst","file_id":"7193","content_type":"application/pdf","date_updated":"2020-07-14T12:47:52Z","file_name":"2019_PhysRevResearch_Huber.pdf","file_size":1370022,"relation":"main_file","access_level":"open_access","checksum":"382eb67e62a77052a23887332d363f96","date_created":"2019-12-18T07:13:14Z"}],"ddc":["530"],"has_accepted_license":"1","language":[{"iso":"eng"}],"publication":"Physical Review Research","date_created":"2019-12-17T13:03:41Z","scopus_import":"1","status":"public","title":"In-medium bound states of two bosonic impurities in a one-dimensional Fermi gas","article_number":"033177","tmp":{"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)","short":"CC BY (4.0)"},"month":"12","department":[{"_id":"MiLe"}],"date_updated":"2025-04-14T07:44:06Z","publication_status":"published","doi":"10.1103/physrevresearch.1.033177","publication_identifier":{"issn":["2643-1564"]},"article_processing_charge":"No","publisher":"American Physical Society","citation":{"ama":"Huber D, Hammer H-W, Volosniev A. In-medium bound states of two bosonic impurities in a one-dimensional Fermi gas. <i>Physical Review Research</i>. 2019;1(3). doi:<a href=\"https://doi.org/10.1103/physrevresearch.1.033177\">10.1103/physrevresearch.1.033177</a>","chicago":"Huber, D., H.-W. Hammer, and Artem Volosniev. “In-Medium Bound States of Two Bosonic Impurities in a One-Dimensional Fermi Gas.” <i>Physical Review Research</i>. American Physical Society, 2019. <a href=\"https://doi.org/10.1103/physrevresearch.1.033177\">https://doi.org/10.1103/physrevresearch.1.033177</a>.","short":"D. Huber, H.-W. Hammer, A. Volosniev, Physical Review Research 1 (2019).","apa":"Huber, D., Hammer, H.-W., &#38; Volosniev, A. (2019). In-medium bound states of two bosonic impurities in a one-dimensional Fermi gas. <i>Physical Review Research</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevresearch.1.033177\">https://doi.org/10.1103/physrevresearch.1.033177</a>","ieee":"D. Huber, H.-W. Hammer, and A. Volosniev, “In-medium bound states of two bosonic impurities in a one-dimensional Fermi gas,” <i>Physical Review Research</i>, vol. 1, no. 3. American Physical Society, 2019.","mla":"Huber, D., et al. “In-Medium Bound States of Two Bosonic Impurities in a One-Dimensional Fermi Gas.” <i>Physical Review Research</i>, vol. 1, no. 3, 033177, American Physical Society, 2019, doi:<a href=\"https://doi.org/10.1103/physrevresearch.1.033177\">10.1103/physrevresearch.1.033177</a>.","ista":"Huber D, Hammer H-W, Volosniev A. 2019. In-medium bound states of two bosonic impurities in a one-dimensional Fermi gas. Physical Review Research. 1(3), 033177."},"year":"2019","date_published":"2019-12-16T00:00:00Z","abstract":[{"lang":"eng","text":"We investigate the ground-state energy of a one-dimensional Fermi gas with two bosonic impurities. We consider spinless fermions with no fermion-fermion interactions. The fermion-impurity and impurity-impurity interactions are modeled with Dirac delta functions. First, we study the case where impurity and fermion have equal masses, and the impurity-impurity two-body interaction is identical to the fermion-impurity interaction, such that the system is solvable with the Bethe ansatz. For attractive interactions, we find that the energy of the impurity-impurity subsystem is below the energy of the bound state that exists without the Fermi gas. We interpret this as a manifestation of attractive boson-boson interactions induced by the fermionic medium, and refer to the impurity-impurity subsystem as an in-medium bound state. For repulsive interactions, we find no in-medium bound states. Second, we construct an effective model to describe these interactions, and compare its predictions to the exact solution. We use this effective model to study nonintegrable systems with unequal masses and/or potentials. We discuss parameter regimes for which impurity-impurity attraction induced by the Fermi gas can lead to the formation of in-medium bound states made of bosons that repel each other in the absence of the Fermi gas."}],"article_type":"original","project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"external_id":{"arxiv":["1908.02483"]},"quality_controlled":"1","day":"16","oa_version":"Published Version","volume":1,"ec_funded":1},{"project":[{"grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"H2020","name":"Optimal Transport and Stochastic Dynamics","_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117"}],"quality_controlled":"1","external_id":{"isi":["000487763200001"],"arxiv":["1710.02323"]},"ec_funded":1,"day":"25","oa_version":"Preprint","volume":55,"article_type":"original","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1710.02323"}],"abstract":[{"text":"We consider the totally asymmetric simple exclusion process (TASEP) with non-random initial condition having density ρ on ℤ− and λ on ℤ+, and a second class particle initially at the origin. For ρ&lt;λ, there is a shock and the second class particle moves with speed 1−λ−ρ. For large time t, we show that the position of the second class particle fluctuates on a t1/3 scale and determine its limiting law. We also obtain the limiting distribution of the number of steps made by the second class particle until time t.","lang":"eng"}],"doi":"10.1214/18-AIHP916","publisher":"Institute of Mathematical Statistics","publication_identifier":{"issn":["0246-0203"]},"article_processing_charge":"No","publication_status":"published","citation":{"ista":"Ferrari P, Ghosal P, Nejjar P. 2019. Limit law of a second class particle in TASEP with non-random initial condition. Annales de l’institut Henri Poincare (B) Probability and Statistics. 55(3), 1203–1225.","ieee":"P. Ferrari, P. Ghosal, and P. Nejjar, “Limit law of a second class particle in TASEP with non-random initial condition,” <i>Annales de l’institut Henri Poincare (B) Probability and Statistics</i>, vol. 55, no. 3. Institute of Mathematical Statistics, pp. 1203–1225, 2019.","mla":"Ferrari, Patrick, et al. “Limit Law of a Second Class Particle in TASEP with Non-Random Initial Condition.” <i>Annales de l’institut Henri Poincare (B) Probability and Statistics</i>, vol. 55, no. 3, Institute of Mathematical Statistics, 2019, pp. 1203–25, doi:<a href=\"https://doi.org/10.1214/18-AIHP916\">10.1214/18-AIHP916</a>.","short":"P. Ferrari, P. Ghosal, P. Nejjar, Annales de l’institut Henri Poincare (B) Probability and Statistics 55 (2019) 1203–1225.","apa":"Ferrari, P., Ghosal, P., &#38; Nejjar, P. (2019). Limit law of a second class particle in TASEP with non-random initial condition. <i>Annales de l’institut Henri Poincare (B) Probability and Statistics</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/18-AIHP916\">https://doi.org/10.1214/18-AIHP916</a>","ama":"Ferrari P, Ghosal P, Nejjar P. Limit law of a second class particle in TASEP with non-random initial condition. <i>Annales de l’institut Henri Poincare (B) Probability and Statistics</i>. 2019;55(3):1203-1225. doi:<a href=\"https://doi.org/10.1214/18-AIHP916\">10.1214/18-AIHP916</a>","chicago":"Ferrari, Patrick, Promit Ghosal, and Peter Nejjar. “Limit Law of a Second Class Particle in TASEP with Non-Random Initial Condition.” <i>Annales de l’institut Henri Poincare (B) Probability and Statistics</i>. Institute of Mathematical Statistics, 2019. <a href=\"https://doi.org/10.1214/18-AIHP916\">https://doi.org/10.1214/18-AIHP916</a>."},"year":"2019","date_published":"2019-09-25T00:00:00Z","isi":1,"title":"Limit law of a second class particle in TASEP with non-random initial condition","month":"09","department":[{"_id":"LaEr"},{"_id":"JaMa"}],"date_updated":"2025-04-14T07:27:49Z","language":[{"iso":"eng"}],"publication":"Annales de l'institut Henri Poincare (B) Probability and Statistics","scopus_import":"1","status":"public","date_created":"2018-12-11T11:44:29Z","intvolume":"        55","page":"1203-1225","arxiv":1,"_id":"72","oa":1,"type":"journal_article","author":[{"first_name":"Patrick","full_name":"Ferrari, Patrick","last_name":"Ferrari"},{"first_name":"Promit","full_name":"Ghosal, Promit","last_name":"Ghosal"},{"first_name":"Peter","full_name":"Nejjar, Peter","id":"4BF426E2-F248-11E8-B48F-1D18A9856A87","last_name":"Nejjar"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"3"},{"arxiv":1,"_id":"7200","oa":1,"type":"journal_article","author":[{"orcid":"0000-0002-7969-2729","first_name":"Pietro","last_name":"Brighi","full_name":"Brighi, Pietro","id":"4115AF5C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Marco","full_name":"Grilli, Marco","last_name":"Grilli"},{"full_name":"Leridon, Brigitte","last_name":"Leridon","first_name":"Brigitte"},{"full_name":"Caprara, Sergio","last_name":"Caprara","first_name":"Sergio"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"17","language":[{"iso":"eng"}],"publication":"Physical Review B","date_created":"2019-12-22T23:00:41Z","status":"public","scopus_import":"1","intvolume":"       100","doi":"10.1103/PhysRevB.100.174518","article_processing_charge":"No","publisher":"American Physical Society","publication_identifier":{"eissn":["2469-9969"],"issn":["2469-9950"]},"publication_status":"published","citation":{"chicago":"Brighi, Pietro, Marco Grilli, Brigitte Leridon, and Sergio Caprara. “Effect of Anomalous Diffusion of Fluctuating Cooper Pairs on the Density of States of Superconducting NbN Thin Films.” <i>Physical Review B</i>. American Physical Society, 2019. <a href=\"https://doi.org/10.1103/PhysRevB.100.174518\">https://doi.org/10.1103/PhysRevB.100.174518</a>.","ama":"Brighi P, Grilli M, Leridon B, Caprara S. Effect of anomalous diffusion of fluctuating Cooper pairs on the density of states of superconducting NbN thin films. <i>Physical Review B</i>. 2019;100(17). doi:<a href=\"https://doi.org/10.1103/PhysRevB.100.174518\">10.1103/PhysRevB.100.174518</a>","apa":"Brighi, P., Grilli, M., Leridon, B., &#38; Caprara, S. (2019). Effect of anomalous diffusion of fluctuating Cooper pairs on the density of states of superconducting NbN thin films. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.100.174518\">https://doi.org/10.1103/PhysRevB.100.174518</a>","short":"P. Brighi, M. Grilli, B. Leridon, S. Caprara, Physical Review B 100 (2019).","mla":"Brighi, Pietro, et al. “Effect of Anomalous Diffusion of Fluctuating Cooper Pairs on the Density of States of Superconducting NbN Thin Films.” <i>Physical Review B</i>, vol. 100, no. 17, 174518, American Physical Society, 2019, doi:<a href=\"https://doi.org/10.1103/PhysRevB.100.174518\">10.1103/PhysRevB.100.174518</a>.","ieee":"P. Brighi, M. Grilli, B. Leridon, and S. Caprara, “Effect of anomalous diffusion of fluctuating Cooper pairs on the density of states of superconducting NbN thin films,” <i>Physical Review B</i>, vol. 100, no. 17. American Physical Society, 2019.","ista":"Brighi P, Grilli M, Leridon B, Caprara S. 2019. Effect of anomalous diffusion of fluctuating Cooper pairs on the density of states of superconducting NbN thin films. Physical Review B. 100(17), 174518."},"date_published":"2019-11-25T00:00:00Z","year":"2019","isi":1,"article_number":"174518","title":"Effect of anomalous diffusion of fluctuating Cooper pairs on the density of states of superconducting NbN thin films","department":[{"_id":"MaSe"}],"month":"11","date_updated":"2024-02-28T13:14:08Z","external_id":{"isi":["000498845700006"],"arxiv":["1907.13579"]},"quality_controlled":"1","oa_version":"Preprint","volume":100,"day":"25","article_type":"original","abstract":[{"lang":"eng","text":"Recent scanning tunneling microscopy experiments in NbN thin disordered superconducting films found an emergent inhomogeneity at the scale of tens of nanometers. This inhomogeneity is mirrored by an apparent dimensional crossover in the paraconductivity measured in transport above the superconducting critical temperature Tc. This behavior was interpreted in terms of an anomalous diffusion of fluctuating Cooper pairs that display a quasiconfinement (i.e., a slowing down of their diffusive dynamics) on length scales shorter than the inhomogeneity identified by tunneling experiments. Here, we assume this anomalous diffusive behavior of fluctuating Cooper pairs and calculate the effect of these fluctuations on the electron density of states above Tc. We find that the density of states is substantially suppressed up to temperatures well above Tc. This behavior, which is closely reminiscent of a pseudogap, only arises from the anomalous diffusion of fluctuating Cooper pairs in the absence of stable preformed pairs, setting the stage for an intermediate behavior between the two common paradigms in the superconducting-insulator transition, namely, the localization of Cooper pairs (the so-called bosonic scenario) and the breaking of Cooper pairs into unpaired electrons due to strong disorder (the so-called fermionic scenario)."}],"main_file_link":[{"url":"https://arxiv.org/abs/1907.13579","open_access":"1"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Cedric","last_name":"Renggli","full_name":"Renggli, Cedric"},{"first_name":"Saleh","full_name":"Ashkboos, Saleh","id":"0D0A9058-257B-11EA-A937-9341C3D8BC8A","last_name":"Ashkboos"},{"first_name":"Mehdi","full_name":"Aghagolzadeh, Mehdi","last_name":"Aghagolzadeh"},{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X"},{"full_name":"Hoefler, Torsten","last_name":"Hoefler","first_name":"Torsten"}],"type":"conference","_id":"7201","arxiv":1,"oa":1,"publication":"International Conference for High Performance Computing, Networking, Storage and Analysis, SC","language":[{"iso":"eng"}],"date_created":"2019-12-22T23:00:42Z","scopus_import":"1","status":"public","title":"SparCML: High-performance sparse communication for machine learning","article_number":"a11","isi":1,"date_updated":"2025-07-10T11:54:21Z","month":"11","department":[{"_id":"DaAl"}],"publication_status":"published","publisher":"ACM","publication_identifier":{"isbn":["9781450362290"],"eissn":["2167-4337"],"issn":["2167-4329"]},"article_processing_charge":"No","doi":"10.1145/3295500.3356222","year":"2019","date_published":"2019-11-17T00:00:00Z","citation":{"ama":"Renggli C, Ashkboos S, Aghagolzadeh M, Alistarh D-A, Hoefler T. SparCML: High-performance sparse communication for machine learning. In: <i>International Conference for High Performance Computing, Networking, Storage and Analysis, SC</i>. ACM; 2019. doi:<a href=\"https://doi.org/10.1145/3295500.3356222\">10.1145/3295500.3356222</a>","chicago":"Renggli, Cedric, Saleh Ashkboos, Mehdi Aghagolzadeh, Dan-Adrian Alistarh, and Torsten Hoefler. “SparCML: High-Performance Sparse Communication for Machine Learning.” In <i>International Conference for High Performance Computing, Networking, Storage and Analysis, SC</i>. ACM, 2019. <a href=\"https://doi.org/10.1145/3295500.3356222\">https://doi.org/10.1145/3295500.3356222</a>.","short":"C. Renggli, S. Ashkboos, M. Aghagolzadeh, D.-A. Alistarh, T. Hoefler, in:, International Conference for High Performance Computing, Networking, Storage and Analysis, SC, ACM, 2019.","apa":"Renggli, C., Ashkboos, S., Aghagolzadeh, M., Alistarh, D.-A., &#38; Hoefler, T. (2019). SparCML: High-performance sparse communication for machine learning. In <i>International Conference for High Performance Computing, Networking, Storage and Analysis, SC</i>. Denver, CO, Unites States: ACM. <a href=\"https://doi.org/10.1145/3295500.3356222\">https://doi.org/10.1145/3295500.3356222</a>","ieee":"C. Renggli, S. Ashkboos, M. Aghagolzadeh, D.-A. Alistarh, and T. Hoefler, “SparCML: High-performance sparse communication for machine learning,” in <i>International Conference for High Performance Computing, Networking, Storage and Analysis, SC</i>, Denver, CO, Unites States, 2019.","mla":"Renggli, Cedric, et al. “SparCML: High-Performance Sparse Communication for Machine Learning.” <i>International Conference for High Performance Computing, Networking, Storage and Analysis, SC</i>, a11, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3295500.3356222\">10.1145/3295500.3356222</a>.","ista":"Renggli C, Ashkboos S, Aghagolzadeh M, Alistarh D-A, Hoefler T. 2019. SparCML: High-performance sparse communication for machine learning. International Conference for High Performance Computing, Networking, Storage and Analysis, SC. SC: Conference for High Performance Computing, Networking, Storage and Analysis, a11."},"conference":{"start_date":"2019-11-17","location":"Denver, CO, Unites States","name":"SC: Conference for High Performance Computing, Networking, Storage and Analysis","end_date":"2019-11-19"},"abstract":[{"text":"Applying machine learning techniques to the quickly growing data in science and industry requires highly-scalable algorithms. Large datasets are most commonly processed \"data parallel\" distributed across many nodes. Each node's contribution to the overall gradient is summed using a global allreduce. This allreduce is the single communication and thus scalability bottleneck for most machine learning workloads. We observe that frequently, many gradient values are (close to) zero, leading to sparse of sparsifyable communications. To exploit this insight, we analyze, design, and implement a set of communication-efficient protocols for sparse input data, in conjunction with efficient machine learning algorithms which can leverage these primitives. Our communication protocols generalize standard collective operations, by allowing processes to contribute arbitrary sparse input data vectors. Our generic communication library, SparCML1, extends MPI to support additional features, such as non-blocking (asynchronous) operations and low-precision data representations. As such, SparCML and its techniques will form the basis of future highly-scalable machine learning frameworks.","lang":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1802.08021","open_access":"1"}],"quality_controlled":"1","external_id":{"arxiv":["1802.08021"],"isi":["000545976800011"]},"project":[{"call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223"}],"day":"17","oa_version":"Preprint","ec_funded":1},{"_id":"7216","publication_status":"published","article_processing_charge":"No","publication_identifier":{"isbn":["9781538670248"]},"publisher":"IEEE","doi":"10.1109/ITSC.2019.8917514","date_published":"2019-11-28T00:00:00Z","year":"2019","citation":{"ista":"Osang GF, Cook J, Fabrikant A, Gruteser M. 2019. LiveTraVeL: Real-time matching of transit vehicle trajectories to transit routes at scale. 2019 IEEE Intelligent Transportation Systems Conference. ITSC: Intelligent Transportation Systems Conference, 8917514.","ieee":"G. F. Osang, J. Cook, A. Fabrikant, and M. Gruteser, “LiveTraVeL: Real-time matching of transit vehicle trajectories to transit routes at scale,” in <i>2019 IEEE Intelligent Transportation Systems Conference</i>, Auckland, New Zealand, 2019.","mla":"Osang, Georg F., et al. “LiveTraVeL: Real-Time Matching of Transit Vehicle Trajectories to Transit Routes at Scale.” <i>2019 IEEE Intelligent Transportation Systems Conference</i>, 8917514, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/ITSC.2019.8917514\">10.1109/ITSC.2019.8917514</a>.","short":"G.F. Osang, J. Cook, A. Fabrikant, M. Gruteser, in:, 2019 IEEE Intelligent Transportation Systems Conference, IEEE, 2019.","apa":"Osang, G. F., Cook, J., Fabrikant, A., &#38; Gruteser, M. (2019). LiveTraVeL: Real-time matching of transit vehicle trajectories to transit routes at scale. In <i>2019 IEEE Intelligent Transportation Systems Conference</i>. Auckland, New Zealand: IEEE. <a href=\"https://doi.org/10.1109/ITSC.2019.8917514\">https://doi.org/10.1109/ITSC.2019.8917514</a>","ama":"Osang GF, Cook J, Fabrikant A, Gruteser M. LiveTraVeL: Real-time matching of transit vehicle trajectories to transit routes at scale. In: <i>2019 IEEE Intelligent Transportation Systems Conference</i>. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/ITSC.2019.8917514\">10.1109/ITSC.2019.8917514</a>","chicago":"Osang, Georg F, James Cook, Alex Fabrikant, and Marco Gruteser. “LiveTraVeL: Real-Time Matching of Transit Vehicle Trajectories to Transit Routes at Scale.” In <i>2019 IEEE Intelligent Transportation Systems Conference</i>. IEEE, 2019. <a href=\"https://doi.org/10.1109/ITSC.2019.8917514\">https://doi.org/10.1109/ITSC.2019.8917514</a>."},"title":"LiveTraVeL: Real-time matching of transit vehicle trajectories to transit routes at scale","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"last_name":"Osang","full_name":"Osang, Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","first_name":"Georg F","orcid":"0000-0002-8882-5116"},{"first_name":"James","last_name":"Cook","full_name":"Cook, James"},{"first_name":"Alex","full_name":"Fabrikant, Alex","last_name":"Fabrikant"},{"first_name":"Marco","full_name":"Gruteser, Marco","last_name":"Gruteser"}],"article_number":"8917514","isi":1,"type":"conference","date_updated":"2023-09-06T14:50:28Z","month":"11","department":[{"_id":"HeEd"}],"quality_controlled":"1","external_id":{"isi":["000521238102050"]},"publication":"2019 IEEE Intelligent Transportation Systems Conference","language":[{"iso":"eng"}],"day":"28","oa_version":"None","status":"public","scopus_import":"1","date_created":"2019-12-29T23:00:47Z","conference":{"end_date":"2019-10-30","name":"ITSC: Intelligent Transportation Systems Conference","location":"Auckland, New Zealand","start_date":"2019-10-27"},"abstract":[{"lang":"eng","text":"We present LiveTraVeL (Live Transit Vehicle Labeling), a real-time system to label a stream of noisy observations of transit vehicle trajectories with the transit routes they are serving (e.g., northbound bus #5). In order to scale efficiently to large transit networks, our system first retrieves a small set of candidate routes from a geometrically indexed data structure, then applies a fine-grained scoring step to choose the best match. Given that real-time data remains unavailable for the majority of the world’s transit agencies, these inferences can help feed a real-time map of a transit system’s trips, infer transit trip delays in real time, or measure and correct noisy transit tracking data. This system can run on vehicle observations from a variety of sources that don’t attach route information to vehicle observations, such as public imagery streams or user-contributed transit vehicle sightings.We abstract away the specifics of the sensing system and demonstrate the effectiveness of our system on a \"semisynthetic\" dataset of all New York City buses, where we simulate sensed trajectories by starting with fully labeled vehicle trajectories reported via the GTFS-Realtime protocol, removing the transit route IDs, and perturbing locations with synthetic noise. Using just the geometric shapes of the trajectories, we demonstrate that our system converges on the correct route ID within a few minutes, even after a vehicle switches from serving one trip to the next."}]},{"citation":{"ista":"Jaksic V, Seiringer R. 2019. Introduction to the Special Collection: International Congress on Mathematical Physics (ICMP) 2018. Journal of Mathematical Physics. 60(12), 123504.","ieee":"V. Jaksic and R. Seiringer, “Introduction to the Special Collection: International Congress on Mathematical Physics (ICMP) 2018,” <i>Journal of Mathematical Physics</i>, vol. 60, no. 12. AIP Publishing, 2019.","mla":"Jaksic, Vojkan, and Robert Seiringer. “Introduction to the Special Collection: International Congress on Mathematical Physics (ICMP) 2018.” <i>Journal of Mathematical Physics</i>, vol. 60, no. 12, 123504, AIP Publishing, 2019, doi:<a href=\"https://doi.org/10.1063/1.5138135\">10.1063/1.5138135</a>.","short":"V. Jaksic, R. Seiringer, Journal of Mathematical Physics 60 (2019).","apa":"Jaksic, V., &#38; Seiringer, R. (2019). Introduction to the Special Collection: International Congress on Mathematical Physics (ICMP) 2018. <i>Journal of Mathematical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/1.5138135\">https://doi.org/10.1063/1.5138135</a>","ama":"Jaksic V, Seiringer R. Introduction to the Special Collection: International Congress on Mathematical Physics (ICMP) 2018. <i>Journal of Mathematical Physics</i>. 2019;60(12). doi:<a href=\"https://doi.org/10.1063/1.5138135\">10.1063/1.5138135</a>","chicago":"Jaksic, Vojkan, and Robert Seiringer. “Introduction to the Special Collection: International Congress on Mathematical Physics (ICMP) 2018.” <i>Journal of Mathematical Physics</i>. AIP Publishing, 2019. <a href=\"https://doi.org/10.1063/1.5138135\">https://doi.org/10.1063/1.5138135</a>."},"year":"2019","date_published":"2019-12-01T00:00:00Z","publication_status":"published","doi":"10.1063/1.5138135","publisher":"AIP Publishing","publication_identifier":{"issn":["0022-2488"]},"article_processing_charge":"No","department":[{"_id":"RoSe"}],"month":"12","date_updated":"2025-07-10T11:54:25Z","title":"Introduction to the Special Collection: International Congress on Mathematical Physics (ICMP) 2018","article_number":"123504","isi":1,"oa_version":"Published Version","day":"01","volume":60,"quality_controlled":"1","external_id":{"isi":["000505529800002"]},"article_type":"letter_note","oa":1,"_id":"7226","file_date_updated":"2020-07-14T12:47:54Z","issue":"12","type":"journal_article","author":[{"first_name":"Vojkan","last_name":"Jaksic","full_name":"Jaksic, Vojkan"},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert","last_name":"Seiringer","first_name":"Robert","orcid":"0000-0002-6781-0521"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","scopus_import":"1","date_created":"2020-01-05T23:00:46Z","has_accepted_license":"1","language":[{"iso":"eng"}],"publication":"Journal of Mathematical Physics","file":[{"access_level":"open_access","relation":"main_file","file_size":1025015,"date_created":"2020-01-07T14:59:13Z","checksum":"bbd12ad1999a9ad7ba4d3c6f2e579c22","creator":"dernst","file_id":"7244","file_name":"2019_JournalMathPhysics_Jaksic.pdf","date_updated":"2020-07-14T12:47:54Z","content_type":"application/pdf"}],"ddc":["500"],"intvolume":"        60"},{"oa_version":"None","day":"13","volume":11725,"quality_controlled":"1","external_id":{"isi":["000851061400023"]},"alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"Traditional concurrent programming involves manipulating shared mutable state. Alternatives to this programming style are communicating sequential processes (CSP) and actor models, which share data via explicit communication. These models have been known for almost half a century, and have recently had started to gain significant traction among modern programming languages. The common abstraction for communication between several processes is the channel. Although channels are similar to producer-consumer data structures, they have different semantics and support additional operations, such as the select expression. Despite their growing popularity, most known implementations of channels use lock-based data structures and can be rather inefficient.\r\n\r\nIn this paper, we present the first efficient lock-free algorithm for implementing a communication channel for CSP programming. We provide implementations and experimental results in the Kotlin and Go programming languages. Our new algorithm outperforms existing implementations on many workloads, while providing non-blocking progress guarantee. Our design can serve as an example of how to construct general communication data structures for CSP and actor models. "}],"conference":{"end_date":"2019-08-30","name":"Euro-Par: European Conference on Parallel Processing","location":"Göttingen, Germany","start_date":"2019-08-26"},"citation":{"ieee":"N. Koval, D.-A. Alistarh, and R. Elizarov, “Scalable FIFO channels for programming via communicating sequential processes,” in <i>25th Anniversary of Euro-Par</i>, Göttingen, Germany, 2019, vol. 11725, pp. 317–333.","mla":"Koval, Nikita, et al. “Scalable FIFO Channels for Programming via Communicating Sequential Processes.” <i>25th Anniversary of Euro-Par</i>, vol. 11725, Springer Nature, 2019, pp. 317–33, doi:<a href=\"https://doi.org/10.1007/978-3-030-29400-7_23\">10.1007/978-3-030-29400-7_23</a>.","ista":"Koval N, Alistarh D-A, Elizarov R. 2019. Scalable FIFO channels for programming via communicating sequential processes. 25th Anniversary of Euro-Par. Euro-Par: European Conference on Parallel Processing, LNCS, vol. 11725, 317–333.","ama":"Koval N, Alistarh D-A, Elizarov R. Scalable FIFO channels for programming via communicating sequential processes. In: <i>25th Anniversary of Euro-Par</i>. Vol 11725. Springer Nature; 2019:317-333. doi:<a href=\"https://doi.org/10.1007/978-3-030-29400-7_23\">10.1007/978-3-030-29400-7_23</a>","chicago":"Koval, Nikita, Dan-Adrian Alistarh, and Roman Elizarov. “Scalable FIFO Channels for Programming via Communicating Sequential Processes.” In <i>25th Anniversary of Euro-Par</i>, 11725:317–33. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/978-3-030-29400-7_23\">https://doi.org/10.1007/978-3-030-29400-7_23</a>.","short":"N. Koval, D.-A. Alistarh, R. Elizarov, in:, 25th Anniversary of Euro-Par, Springer Nature, 2019, pp. 317–333.","apa":"Koval, N., Alistarh, D.-A., &#38; Elizarov, R. (2019). Scalable FIFO channels for programming via communicating sequential processes. In <i>25th Anniversary of Euro-Par</i> (Vol. 11725, pp. 317–333). Göttingen, Germany: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-29400-7_23\">https://doi.org/10.1007/978-3-030-29400-7_23</a>"},"date_published":"2019-08-13T00:00:00Z","year":"2019","publication_status":"published","doi":"10.1007/978-3-030-29400-7_23","article_processing_charge":"No","publication_identifier":{"isbn":["978-3-0302-9399-4"],"issn":["0302-9743"],"eissn":["1611-3349"]},"publisher":"Springer Nature","department":[{"_id":"DaAl"}],"month":"08","date_updated":"2023-09-06T14:53:59Z","title":"Scalable FIFO channels for programming via communicating sequential processes","isi":1,"scopus_import":"1","status":"public","date_created":"2020-01-05T23:00:46Z","language":[{"iso":"eng"}],"publication":"25th Anniversary of Euro-Par","intvolume":"     11725","page":"317-333","_id":"7228","type":"conference","author":[{"first_name":"Nikita","last_name":"Koval","full_name":"Koval, Nikita","id":"2F4DB10C-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"},{"last_name":"Elizarov","full_name":"Elizarov, Roman","first_name":"Roman"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"author":[{"orcid":"0000-0003-2401-8670","first_name":"Alan M","last_name":"Arroyo Guevara","id":"3207FDC6-F248-11E8-B48F-1D18A9856A87","full_name":"Arroyo Guevara, Alan M"},{"first_name":"Martin","full_name":"Derka, Martin","last_name":"Derka"},{"first_name":"Irene","full_name":"Parada, Irene","last_name":"Parada"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","type":"conference","_id":"7230","arxiv":1,"oa":1,"page":"230-243","intvolume":"     11904","publication":"27th International Symposium on Graph Drawing and Network Visualization","language":[{"iso":"eng"}],"scopus_import":"1","date_created":"2020-01-05T23:00:47Z","status":"public","title":"Extending simple drawings","isi":1,"date_updated":"2025-04-14T07:44:07Z","month":"11","department":[{"_id":"UlWa"}],"publication_status":"published","publication_identifier":{"isbn":["978-3-0303-5801-3"],"issn":["0302-9743"],"eissn":["1611-3349"]},"article_processing_charge":"No","publisher":"Springer Nature","doi":"10.1007/978-3-030-35802-0_18","date_published":"2019-11-28T00:00:00Z","year":"2019","citation":{"chicago":"Arroyo Guevara, Alan M, Martin Derka, and Irene Parada. “Extending Simple Drawings.” In <i>27th International Symposium on Graph Drawing and Network Visualization</i>, 11904:230–43. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/978-3-030-35802-0_18\">https://doi.org/10.1007/978-3-030-35802-0_18</a>.","ama":"Arroyo Guevara AM, Derka M, Parada I. Extending simple drawings. In: <i>27th International Symposium on Graph Drawing and Network Visualization</i>. Vol 11904. Springer Nature; 2019:230-243. doi:<a href=\"https://doi.org/10.1007/978-3-030-35802-0_18\">10.1007/978-3-030-35802-0_18</a>","apa":"Arroyo Guevara, A. M., Derka, M., &#38; Parada, I. (2019). Extending simple drawings. In <i>27th International Symposium on Graph Drawing and Network Visualization</i> (Vol. 11904, pp. 230–243). Prague, Czech Republic: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-35802-0_18\">https://doi.org/10.1007/978-3-030-35802-0_18</a>","short":"A.M. Arroyo Guevara, M. Derka, I. Parada, in:, 27th International Symposium on Graph Drawing and Network Visualization, Springer Nature, 2019, pp. 230–243.","mla":"Arroyo Guevara, Alan M., et al. “Extending Simple Drawings.” <i>27th International Symposium on Graph Drawing and Network Visualization</i>, vol. 11904, Springer Nature, 2019, pp. 230–43, doi:<a href=\"https://doi.org/10.1007/978-3-030-35802-0_18\">10.1007/978-3-030-35802-0_18</a>.","ieee":"A. M. Arroyo Guevara, M. Derka, and I. Parada, “Extending simple drawings,” in <i>27th International Symposium on Graph Drawing and Network Visualization</i>, Prague, Czech Republic, 2019, vol. 11904, pp. 230–243.","ista":"Arroyo Guevara AM, Derka M, Parada I. 2019. Extending simple drawings. 27th International Symposium on Graph Drawing and Network Visualization. GD: Graph Drawing and Network Visualization, LNCS, vol. 11904, 230–243."},"conference":{"location":"Prague, Czech Republic","start_date":"2019-09-17","end_date":"2019-09-20","name":"GD: Graph Drawing and Network Visualization"},"abstract":[{"lang":"eng","text":"Simple drawings of graphs are those in which each pair of edges share at most one point, either a common endpoint or a proper crossing. In this paper we study the problem of extending a simple drawing D(G) of a graph G by inserting a set of edges from the complement of G into D(G) such that the result is a simple drawing. In the context of rectilinear drawings, the problem is trivial. For pseudolinear drawings, the existence of such an extension follows from Levi’s enlargement lemma. In contrast, we prove that deciding if a given set of edges can be inserted into a simple drawing is NP-complete. Moreover, we show that the maximization version of the problem is APX-hard. We also present a polynomial-time algorithm for deciding whether one edge uv can be inserted into D(G) when {u,v} is a dominating set for the graph G."}],"main_file_link":[{"url":"https://arxiv.org/abs/1908.08129","open_access":"1"}],"quality_controlled":"1","external_id":{"isi":["000612918800018"],"arxiv":["1908.08129"]},"project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"alternative_title":["LNCS"],"oa_version":"Preprint","day":"28","volume":11904,"ec_funded":1},{"page":"123-141","intvolume":"     11750","publication":"17th International Conference on Formal Modeling and Analysis of Timed Systems","language":[{"iso":"eng"}],"scopus_import":"1","date_created":"2020-01-05T23:00:47Z","status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"orcid":"0000-0002-3066-6941","first_name":"Hui","last_name":"Kong","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87","full_name":"Kong, Hui"},{"first_name":"Ezio","full_name":"Bartocci, Ezio","last_name":"Bartocci"},{"full_name":"Jiang, Yu","last_name":"Jiang","first_name":"Yu"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"type":"conference","_id":"7231","arxiv":1,"oa":1,"conference":{"start_date":"2019-08-27","location":"Amsterdam, The Netherlands","name":"FORMATS: Formal Modeling and Analysis of Timed Systems","end_date":"2019-08-29"},"main_file_link":[{"url":"https://arxiv.org/abs/1907.11514","open_access":"1"}],"abstract":[{"text":"Piecewise Barrier Tubes (PBT) is a new technique for flowpipe overapproximation for nonlinear systems with polynomial dynamics, which leverages a combination of barrier certificates. PBT has advantages over traditional time-step based methods in dealing with those nonlinear dynamical systems in which there is a large difference in speed between trajectories, producing an overapproximation that is time independent. However, the existing approach for PBT is not efficient due to the application of interval methods for enclosure-box computation, and it can only deal with continuous dynamical systems without uncertainty. In this paper, we extend the approach with the ability to handle both continuous and hybrid dynamical systems with uncertainty that can reside in parameters and/or noise. We also improve the efficiency of the method significantly, by avoiding the use of interval-based methods for the enclosure-box computation without loosing soundness. We have developed a C++ prototype implementing the proposed approach and we evaluate it on several benchmarks. The experiments show that our approach is more efficient and precise than other methods in the literature.","lang":"eng"}],"external_id":{"isi":["000611677700008"],"arxiv":["1907.11514"]},"quality_controlled":"1","project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211"}],"alternative_title":["LNCS"],"day":"13","volume":11750,"oa_version":"Preprint","title":"Piecewise robust barrier tubes for nonlinear hybrid systems with uncertainty","isi":1,"date_updated":"2025-04-15T06:26:06Z","department":[{"_id":"ToHe"}],"month":"08","publication_status":"published","publication_identifier":{"isbn":["978-3-0302-9661-2"],"eissn":["1611-3349"],"issn":["0302-9743"]},"publisher":"Springer Nature","article_processing_charge":"No","doi":"10.1007/978-3-030-29662-9_8","year":"2019","date_published":"2019-08-13T00:00:00Z","citation":{"mla":"Kong, Hui, et al. “Piecewise Robust Barrier Tubes for Nonlinear Hybrid Systems with Uncertainty.” <i>17th International Conference on Formal Modeling and Analysis of Timed Systems</i>, vol. 11750, Springer Nature, 2019, pp. 123–41, doi:<a href=\"https://doi.org/10.1007/978-3-030-29662-9_8\">10.1007/978-3-030-29662-9_8</a>.","ieee":"H. Kong, E. Bartocci, Y. Jiang, and T. A. Henzinger, “Piecewise robust barrier tubes for nonlinear hybrid systems with uncertainty,” in <i>17th International Conference on Formal Modeling and Analysis of Timed Systems</i>, Amsterdam, The Netherlands, 2019, vol. 11750, pp. 123–141.","ista":"Kong H, Bartocci E, Jiang Y, Henzinger TA. 2019. Piecewise robust barrier tubes for nonlinear hybrid systems with uncertainty. 17th International Conference on Formal Modeling and Analysis of Timed Systems. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 11750, 123–141.","chicago":"Kong, Hui, Ezio Bartocci, Yu Jiang, and Thomas A Henzinger. “Piecewise Robust Barrier Tubes for Nonlinear Hybrid Systems with Uncertainty.” In <i>17th International Conference on Formal Modeling and Analysis of Timed Systems</i>, 11750:123–41. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/978-3-030-29662-9_8\">https://doi.org/10.1007/978-3-030-29662-9_8</a>.","ama":"Kong H, Bartocci E, Jiang Y, Henzinger TA. Piecewise robust barrier tubes for nonlinear hybrid systems with uncertainty. In: <i>17th International Conference on Formal Modeling and Analysis of Timed Systems</i>. Vol 11750. Springer Nature; 2019:123-141. doi:<a href=\"https://doi.org/10.1007/978-3-030-29662-9_8\">10.1007/978-3-030-29662-9_8</a>","apa":"Kong, H., Bartocci, E., Jiang, Y., &#38; Henzinger, T. A. (2019). Piecewise robust barrier tubes for nonlinear hybrid systems with uncertainty. In <i>17th International Conference on Formal Modeling and Analysis of Timed Systems</i> (Vol. 11750, pp. 123–141). Amsterdam, The Netherlands: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-29662-9_8\">https://doi.org/10.1007/978-3-030-29662-9_8</a>","short":"H. Kong, E. Bartocci, Y. Jiang, T.A. Henzinger, in:, 17th International Conference on Formal Modeling and Analysis of Timed Systems, Springer Nature, 2019, pp. 123–141."}},{"_id":"7232","type":"conference","author":[{"orcid":"0000-0001-5199-3143","first_name":"Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","full_name":"Ferrere, Thomas","last_name":"Ferrere"},{"first_name":"Oded","full_name":"Maler, Oded","last_name":"Maler"},{"first_name":"Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","full_name":"Nickovic, Dejan","last_name":"Nickovic"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"publication":"17th International Conference on Formal Modeling and Analysis of Timed Systems","status":"public","scopus_import":"1","date_created":"2020-01-05T23:00:48Z","page":"59-75","intvolume":"     11750","publication_status":"published","doi":"10.1007/978-3-030-29662-9_4","publication_identifier":{"isbn":["978-3-0302-9661-2"],"issn":["0302-9743"],"eissn":["1611-3349"]},"publisher":"Springer Nature","article_processing_charge":"No","citation":{"ista":"Ferrere T, Maler O, Nickovic D. 2019. Mixed-time signal temporal logic. 17th International Conference on Formal Modeling and Analysis of Timed Systems. FORMATS: Formal Modeling and Anaysis of Timed Systems, LNCS, vol. 11750, 59–75.","mla":"Ferrere, Thomas, et al. “Mixed-Time Signal Temporal Logic.” <i>17th International Conference on Formal Modeling and Analysis of Timed Systems</i>, vol. 11750, Springer Nature, 2019, pp. 59–75, doi:<a href=\"https://doi.org/10.1007/978-3-030-29662-9_4\">10.1007/978-3-030-29662-9_4</a>.","ieee":"T. Ferrere, O. Maler, and D. Nickovic, “Mixed-time signal temporal logic,” in <i>17th International Conference on Formal Modeling and Analysis of Timed Systems</i>, Amsterdam, The Netherlands, 2019, vol. 11750, pp. 59–75.","apa":"Ferrere, T., Maler, O., &#38; Nickovic, D. (2019). Mixed-time signal temporal logic. In <i>17th International Conference on Formal Modeling and Analysis of Timed Systems</i> (Vol. 11750, pp. 59–75). Amsterdam, The Netherlands: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-29662-9_4\">https://doi.org/10.1007/978-3-030-29662-9_4</a>","short":"T. Ferrere, O. Maler, D. Nickovic, in:, 17th International Conference on Formal Modeling and Analysis of Timed Systems, Springer Nature, 2019, pp. 59–75.","chicago":"Ferrere, Thomas, Oded Maler, and Dejan Nickovic. “Mixed-Time Signal Temporal Logic.” In <i>17th International Conference on Formal Modeling and Analysis of Timed Systems</i>, 11750:59–75. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/978-3-030-29662-9_4\">https://doi.org/10.1007/978-3-030-29662-9_4</a>.","ama":"Ferrere T, Maler O, Nickovic D. Mixed-time signal temporal logic. In: <i>17th International Conference on Formal Modeling and Analysis of Timed Systems</i>. Vol 11750. Springer Nature; 2019:59-75. doi:<a href=\"https://doi.org/10.1007/978-3-030-29662-9_4\">10.1007/978-3-030-29662-9_4</a>"},"year":"2019","date_published":"2019-08-13T00:00:00Z","title":"Mixed-time signal temporal logic","isi":1,"department":[{"_id":"ToHe"}],"month":"08","date_updated":"2025-04-15T06:26:06Z","project":[{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"},{"call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"quality_controlled":"1","external_id":{"isi":["000611677700004"]},"alternative_title":["LNCS"],"volume":11750,"oa_version":"None","day":"13","conference":{"location":"Amsterdam, The Netherlands","start_date":"2019-08-27","end_date":"2019-08-29","name":"FORMATS: Formal Modeling and Anaysis of Timed Systems"},"abstract":[{"text":"We present Mixed-time Signal Temporal Logic (STL−MX), a specification formalism which extends STL by capturing the discrete/ continuous time duality found in many cyber-physical systems (CPS), as well as mixed-signal electronic designs. In STL−MX, properties of components with continuous dynamics are expressed in STL, while specifications of components with discrete dynamics are written in LTL. To combine the two layers, we evaluate formulas on two traces, discrete- and continuous-time, and introduce two interface operators that map signals, properties and their satisfaction signals across the two time domains. We show that STL-mx has the expressive power of STL supplemented with an implicit T-periodic clock signal. We develop and implement an algorithm for monitoring STL-mx formulas and illustrate the approach using a mixed-signal example. ","lang":"eng"}]}]