[{"oa":1,"quality_controlled":"1","publisher":"eLife Sciences Publications","date_created":"2021-09-12T22:01:23Z","date_published":"2021-08-27T00:00:00Z","doi":"10.7554/eLife.66483","year":"2021","isi":1,"has_accepted_license":"1","publication":"eLife","day":"27","project":[{"name":"Interaction and feedback between cell mechanics and fate specification in vertebrate gastrulation","grant_number":"742573","call_identifier":"H2020","_id":"260F1432-B435-11E9-9278-68D0E5697425"}],"article_number":"e66483","article_processing_charge":"Yes","external_id":{"pmid":["34448451"],"isi":["000700428500001"]},"author":[{"last_name":"Pulgar","full_name":"Pulgar, Eduardo","first_name":"Eduardo"},{"last_name":"Schwayer","full_name":"Schwayer, Cornelia","orcid":"0000-0001-5130-2226","first_name":"Cornelia","id":"3436488C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Guerrero, Néstor","last_name":"Guerrero","first_name":"Néstor"},{"last_name":"López","full_name":"López, Loreto","first_name":"Loreto"},{"last_name":"Márquez","full_name":"Márquez, Susana","first_name":"Susana"},{"last_name":"Härtel","full_name":"Härtel, Steffen","first_name":"Steffen"},{"last_name":"Soto","full_name":"Soto, Rodrigo","first_name":"Rodrigo"},{"first_name":"Carl Philipp","full_name":"Heisenberg, Carl Philipp","last_name":"Heisenberg"},{"full_name":"Concha, Miguel L.","last_name":"Concha","first_name":"Miguel L."}],"title":"Apical contacts stemming from incomplete delamination guide progenitor cell allocation through a dragging mechanism","citation":{"ista":"Pulgar E, Schwayer C, Guerrero N, López L, Márquez S, Härtel S, Soto R, Heisenberg CP, Concha ML. 2021. Apical contacts stemming from incomplete delamination guide progenitor cell allocation through a dragging mechanism. eLife. 10, e66483.","chicago":"Pulgar, Eduardo, Cornelia Schwayer, Néstor Guerrero, Loreto López, Susana Márquez, Steffen Härtel, Rodrigo Soto, Carl Philipp Heisenberg, and Miguel L. Concha. “Apical Contacts Stemming from Incomplete Delamination Guide Progenitor Cell Allocation through a Dragging Mechanism.” ELife. eLife Sciences Publications, 2021. https://doi.org/10.7554/eLife.66483.","short":"E. Pulgar, C. Schwayer, N. Guerrero, L. López, S. Márquez, S. Härtel, R. Soto, C.P. Heisenberg, M.L. Concha, ELife 10 (2021).","ieee":"E. Pulgar et al., “Apical contacts stemming from incomplete delamination guide progenitor cell allocation through a dragging mechanism,” eLife, vol. 10. eLife Sciences Publications, 2021.","ama":"Pulgar E, Schwayer C, Guerrero N, et al. Apical contacts stemming from incomplete delamination guide progenitor cell allocation through a dragging mechanism. eLife. 2021;10. doi:10.7554/eLife.66483","apa":"Pulgar, E., Schwayer, C., Guerrero, N., López, L., Márquez, S., Härtel, S., … Concha, M. L. (2021). Apical contacts stemming from incomplete delamination guide progenitor cell allocation through a dragging mechanism. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.66483","mla":"Pulgar, Eduardo, et al. “Apical Contacts Stemming from Incomplete Delamination Guide Progenitor Cell Allocation through a Dragging Mechanism.” ELife, vol. 10, e66483, eLife Sciences Publications, 2021, doi:10.7554/eLife.66483."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","scopus_import":"1","intvolume":" 10","month":"08","abstract":[{"lang":"eng","text":"The developmental strategies used by progenitor cells to endure a safe journey from their induction place towards the site of terminal differentiation are still poorly understood. Here we uncovered a progenitor cell allocation mechanism that stems from an incomplete process of epithelial delamination that allows progenitors to coordinate their movement with adjacent extra-embryonic tissues. Progenitors of the zebrafish laterality organ originate from the surface epithelial enveloping layer by an apical constriction process of cell delamination. During this process, progenitors retain long-term apical contacts that enable the epithelial layer to pull a subset of progenitors along their way towards the vegetal pole. The remaining delaminated progenitors follow apically-attached progenitors’ movement by a co-attraction mechanism, avoiding sequestration by the adjacent endoderm, ensuring their fate and collective allocation at the differentiation site. Thus, we reveal that incomplete delamination serves as a cellular platform for coordinated tissue movements during development. Impact Statement: Incomplete delamination serves as a cellular platform for coordinated tissue movements during development, guiding newly formed progenitor cell groups to the differentiation site."}],"oa_version":"Published Version","pmid":1,"ec_funded":1,"volume":10,"publication_status":"published","publication_identifier":{"eissn":["2050-084X"]},"language":[{"iso":"eng"}],"file":[{"file_size":9010446,"date_updated":"2022-05-13T08:03:37Z","creator":"dernst","file_name":"2021_eLife_Pulgar.pdf","date_created":"2022-05-13T08:03:37Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"11371","checksum":"a3f82b0499cc822ac1eab48a01f3f57e"}],"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)"},"article_type":"original","type":"journal_article","keyword":["cell delamination","apical constriction","dragging","mechanical forces","collective 18 locomotion","dorsal forerunner cells","zebrafish"],"status":"public","_id":"9999","file_date_updated":"2022-05-13T08:03:37Z","department":[{"_id":"CaHe"}],"date_updated":"2023-08-14T06:53:33Z","ddc":["570"]},{"department":[{"_id":"KrCh"}],"date_updated":"2023-08-14T06:51:33Z","conference":{"name":"LICS: Symposium on Logic in Computer Science","start_date":"2021-06-29","end_date":"2021-07-02","location":"Rome, Italy"},"type":"conference","keyword":["Computer science","Computational modeling","Markov processes","Probabilistic logic","Formal verification","Game Theory"],"status":"public","_id":"10002","ec_funded":1,"publication_status":"published","publication_identifier":{"issn":["1043-6871"],"isbn":["978-1-6654-4896-3"],"eisbn":["978-1-6654-4895-6"]},"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2104.07466"}],"scopus_import":"1","month":"07","abstract":[{"lang":"eng","text":"We present a faster symbolic algorithm for the following central problem in probabilistic verification: Compute the maximal end-component (MEC) decomposition of Markov decision processes (MDPs). This problem generalizes the SCC decomposition problem of graphs and closed recurrent sets of Markov chains. The model of symbolic algorithms is widely used in formal verification and model-checking, where access to the input model is restricted to only symbolic operations (e.g., basic set operations and computation of one-step neighborhood). For an input MDP with n vertices and m edges, the classical symbolic algorithm from the 1990s for the MEC decomposition requires O(n2) symbolic operations and O(1) symbolic space. The only other symbolic algorithm for the MEC decomposition requires O(nm−−√) symbolic operations and O(m−−√) symbolic space. A main open question is whether the worst-case O(n2) bound for symbolic operations can be beaten. We present a symbolic algorithm that requires O˜(n1.5) symbolic operations and O˜(n−−√) symbolic space. Moreover, the parametrization of our algorithm provides a trade-off between symbolic operations and symbolic space: for all 0<ϵ≤1/2 the symbolic algorithm requires O˜(n2−ϵ) symbolic operations and O˜(nϵ) symbolic space ( O˜ hides poly-logarithmic factors). Using our techniques we present faster algorithms for computing the almost-sure winning regions of ω -regular objectives for MDPs. We consider the canonical parity objectives for ω -regular objectives, and for parity objectives with d -priorities we present an algorithm that computes the almost-sure winning region with O˜(n2−ϵ) symbolic operations and O˜(nϵ) symbolic space, for all 0<ϵ≤1/2 ."}],"oa_version":"Preprint","external_id":{"arxiv":["2104.07466"],"isi":["000947350400089"]},"article_processing_charge":"No","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Wolfgang","last_name":"Dvorak","full_name":"Dvorak, Wolfgang"},{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Alexander","full_name":"Svozil, Alexander","last_name":"Svozil"}],"title":"Symbolic time and space tradeoffs for probabilistic verification","citation":{"ama":"Chatterjee K, Dvorak W, Henzinger MH, Svozil A. Symbolic time and space tradeoffs for probabilistic verification. In: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. Institute of Electrical and Electronics Engineers; 2021:1-13. doi:10.1109/LICS52264.2021.9470739","apa":"Chatterjee, K., Dvorak, W., Henzinger, M. H., & Svozil, A. (2021). Symbolic time and space tradeoffs for probabilistic verification. In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13). Rome, Italy: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/LICS52264.2021.9470739","short":"K. Chatterjee, W. Dvorak, M.H. Henzinger, A. Svozil, in:, Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13.","ieee":"K. Chatterjee, W. Dvorak, M. H. Henzinger, and A. Svozil, “Symbolic time and space tradeoffs for probabilistic verification,” in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 2021, pp. 1–13.","mla":"Chatterjee, Krishnendu, et al. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.” Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13, doi:10.1109/LICS52264.2021.9470739.","ista":"Chatterjee K, Dvorak W, Henzinger MH, Svozil A. 2021. Symbolic time and space tradeoffs for probabilistic verification. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Symposium on Logic in Computer Science, 1–13.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorak, Monika H Henzinger, and Alexander Svozil. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.” In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 1–13. Institute of Electrical and Electronics Engineers, 2021. https://doi.org/10.1109/LICS52264.2021.9470739."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"}],"page":"1-13","date_created":"2021-09-12T22:01:24Z","doi":"10.1109/LICS52264.2021.9470739","date_published":"2021-07-07T00:00:00Z","year":"2021","isi":1,"publication":"Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science","day":"07","oa":1,"publisher":"Institute of Electrical and Electronics Engineers","quality_controlled":"1","acknowledgement":"The authors are grateful to the anonymous referees for their valuable comments. A. S. is fully supported by the Vienna Science and Technology Fund (WWTF) through project ICT15–003. K. C. is supported by the Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and by the ERC CoG 863818 (ForM-SMArt). For M. H. the research leading to these results has received funding from the European Research Council under the European Unions Seventh Framework Programme (FP/2007–2013) / ERC Grant Agreement no. 340506."},{"isi":1,"has_accepted_license":"1","year":"2021","day":"27","publication":"Stochastic Processes and their Applications","page":"124-158","date_published":"2021-08-27T00:00:00Z","doi":"10.1016/j.spa.2021.08.006","date_created":"2021-09-19T22:01:25Z","acknowledgement":"The authors would like to thank Marek Biskup and Alberto Chiarini for useful suggestions and Cristian Giardina, Frank den Hollander and Shubhamoy Nandan for inspiring discussions. S.F. acknowledges Simona Villa for her help in creating the picture. Furthermore, the authors thank two anonymous referees for the careful reading of the manuscript. S.F. acknowledges financial support from NWO, The Netherlands via the grant TOP1.17.019. F.S. acknowledges financial support from NWO via the TOP1 grant 613.001.552 as well as funding from the European Union’s Horizon 2020 research and innovation programme under the Marie-Skłodowska-Curie grant agreement No. 754411.","quality_controlled":"1","publisher":"Elsevier","oa":1,"citation":{"mla":"Floreani, Simone, et al. “Hydrodynamics for the Partial Exclusion Process in Random Environment.” Stochastic Processes and Their Applications, vol. 142, Elsevier, 2021, pp. 124–58, doi:10.1016/j.spa.2021.08.006.","ieee":"S. Floreani, F. Redig, and F. Sau, “Hydrodynamics for the partial exclusion process in random environment,” Stochastic Processes and their Applications, vol. 142. Elsevier, pp. 124–158, 2021.","short":"S. Floreani, F. Redig, F. Sau, Stochastic Processes and Their Applications 142 (2021) 124–158.","apa":"Floreani, S., Redig, F., & Sau, F. (2021). Hydrodynamics for the partial exclusion process in random environment. Stochastic Processes and Their Applications. Elsevier. https://doi.org/10.1016/j.spa.2021.08.006","ama":"Floreani S, Redig F, Sau F. Hydrodynamics for the partial exclusion process in random environment. Stochastic Processes and their Applications. 2021;142:124-158. doi:10.1016/j.spa.2021.08.006","chicago":"Floreani, Simone, Frank Redig, and Federico Sau. “Hydrodynamics for the Partial Exclusion Process in Random Environment.” Stochastic Processes and Their Applications. Elsevier, 2021. https://doi.org/10.1016/j.spa.2021.08.006.","ista":"Floreani S, Redig F, Sau F. 2021. Hydrodynamics for the partial exclusion process in random environment. Stochastic Processes and their Applications. 142, 124–158."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"full_name":"Floreani, Simone","last_name":"Floreani","first_name":"Simone"},{"first_name":"Frank","full_name":"Redig, Frank","last_name":"Redig"},{"first_name":"Federico","id":"E1836206-9F16-11E9-8814-AEFDE5697425","full_name":"Sau, Federico","last_name":"Sau"}],"external_id":{"arxiv":["1911.12564"],"isi":["000697748500005"]},"article_processing_charge":"Yes","title":"Hydrodynamics for the partial exclusion process in random environment","project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"publication_identifier":{"issn":["0304-4149"]},"publication_status":"published","file":[{"date_created":"2022-05-13T07:55:50Z","file_name":"2021_StochasticProcessesAppl_Floreani.pdf","date_updated":"2022-05-13T07:55:50Z","file_size":2115791,"creator":"dernst","checksum":"56768c553d7218ee5714902ffec90ec4","file_id":"11370","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"volume":142,"ec_funded":1,"abstract":[{"lang":"eng","text":"In this paper, we introduce a random environment for the exclusion process in obtained by assigning a maximal occupancy to each site. This maximal occupancy is allowed to randomly vary among sites, and partial exclusion occurs. Under the assumption of ergodicity under translation and uniform ellipticity of the environment, we derive a quenched hydrodynamic limit in path space by strengthening the mild solution approach initiated in Nagy (2002) and Faggionato (2007). To this purpose, we prove, employing the technology developed for the random conductance model, a homogenization result in the form of an arbitrary starting point quenched invariance principle for a single particle in the same environment, which is a result of independent interest. The self-duality property of the partial exclusion process allows us to transfer this homogenization result to the particle system and, then, apply the tightness criterion in Redig et al. (2020)."}],"oa_version":"Published Version","scopus_import":"1","month":"08","intvolume":" 142","date_updated":"2023-08-14T06:52:43Z","ddc":["519"],"file_date_updated":"2022-05-13T07:55:50Z","department":[{"_id":"JaMa"}],"_id":"10024","article_type":"original","type":"journal_article","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)"},"status":"public","keyword":["hydrodynamic limit","random environment","random conductance model","arbitrary starting point quenched invariance principle","duality","mild solution"]},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.” Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13, doi:10.1109/LICS52264.2021.9470595.","short":"K. Chatterjee, L. Doyen, in:, Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13.","ieee":"K. Chatterjee and L. Doyen, “Stochastic processes with expected stopping time,” in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 2021, pp. 1–13.","ama":"Chatterjee K, Doyen L. Stochastic processes with expected stopping time. In: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. Institute of Electrical and Electronics Engineers; 2021:1-13. doi:10.1109/LICS52264.2021.9470595","apa":"Chatterjee, K., & Doyen, L. (2021). Stochastic processes with expected stopping time. In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13). Rome, Italy: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/LICS52264.2021.9470595","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.” In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 1–13. Institute of Electrical and Electronics Engineers, 2021. https://doi.org/10.1109/LICS52264.2021.9470595.","ista":"Chatterjee K, Doyen L. 2021. Stochastic processes with expected stopping time. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Symposium on Logic in Computer Science, 1–13."},"title":"Stochastic processes with expected stopping time","article_processing_charge":"No","external_id":{"isi":["000947350400036"],"arxiv":["2104.07278"]},"author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"}],"project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"publication":"Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science","day":"07","year":"2021","isi":1,"date_created":"2021-09-12T22:01:25Z","date_published":"2021-07-07T00:00:00Z","doi":"10.1109/LICS52264.2021.9470595","page":"1-13","acknowledgement":"We are grateful to the anonymous reviewers of LICS 2021 and of a previous version of this paper for insightful comments that helped improving the presentation. This research was partially supported by the grant ERC CoG 863818 (ForM-SMArt).","oa":1,"quality_controlled":"1","publisher":"Institute of Electrical and Electronics Engineers","date_updated":"2023-08-14T06:52:07Z","department":[{"_id":"KrCh"}],"_id":"10004","keyword":["Computer science","Heuristic algorithms","Memory management","Automata","Markov processes","Probability distribution","Complexity theory"],"status":"public","conference":{"name":"LICS: Symposium on Logic in Computer Science","start_date":"2021-06-29","end_date":"2021-07-02","location":"Rome, Italy"},"type":"conference","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["1043-6871"],"isbn":["978-1-6654-4896-3"],"eisbn":["978-1-6654-4895-6"]},"ec_funded":1,"oa_version":"Preprint","abstract":[{"text":"Markov chains are the de facto finite-state model for stochastic dynamical systems, and Markov decision processes (MDPs) extend Markov chains by incorporating non-deterministic behaviors. Given an MDP and rewards on states, a classical optimization criterion is the maximal expected total reward where the MDP stops after T steps, which can be computed by a simple dynamic programming algorithm. We consider a natural generalization of the problem where the stopping times can be chosen according to a probability distribution, such that the expected stopping time is T, to optimize the expected total reward. Quite surprisingly we establish inter-reducibility of the expected stopping-time problem for Markov chains with the Positivity problem (which is related to the well-known Skolem problem), for which establishing either decidability or undecidability would be a major breakthrough. Given the hardness of the exact problem, we consider the approximate version of the problem: we show that it can be solved in exponential time for Markov chains and in exponential space for MDPs.","lang":"eng"}],"month":"07","main_file_link":[{"url":"https://arxiv.org/abs/2104.07278","open_access":"1"}],"scopus_import":"1"},{"acknowledgement":"S. A. Hashemi is supported by a Postdoctoral Fellowship from the Natural Sciences and Engineering Research Council\r\nof Canada (NSERC) and by Huawei. M. Mondelli is partially supported by the 2019 Lopez-Loreta Prize. A. Fazeli and A. Vardy were supported in part by the National Science Foundation under Grant CCF-1764104.","publisher":"Institute of Electrical and Electronics Engineers","quality_controlled":"1","oa":1,"isi":1,"year":"2021","day":"01","publication":"2021 IEEE International Symposium on Information Theory","page":"2369-2374","date_published":"2021-09-01T00:00:00Z","doi":"10.1109/ISIT45174.2021.9518153","date_created":"2021-09-27T14:33:14Z","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"citation":{"ista":"Hashemi SA, Mondelli M, Fazeli A, Vardy A, Cioffi J, Goldsmith A. 2021. Parallelism versus latency in simplified successive-cancellation decoding of polar codes. 2021 IEEE International Symposium on Information Theory. ISIT: International Symposium on Information Theory, 2369–2374.","chicago":"Hashemi, Seyyed Ali, Marco Mondelli, Arman Fazeli, Alexander Vardy, John Cioffi, and Andrea Goldsmith. “Parallelism versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes.” In 2021 IEEE International Symposium on Information Theory, 2369–74. Institute of Electrical and Electronics Engineers, 2021. https://doi.org/10.1109/ISIT45174.2021.9518153.","short":"S.A. Hashemi, M. Mondelli, A. Fazeli, A. Vardy, J. Cioffi, A. Goldsmith, in:, 2021 IEEE International Symposium on Information Theory, Institute of Electrical and Electronics Engineers, 2021, pp. 2369–2374.","ieee":"S. A. Hashemi, M. Mondelli, A. Fazeli, A. Vardy, J. Cioffi, and A. Goldsmith, “Parallelism versus latency in simplified successive-cancellation decoding of polar codes,” in 2021 IEEE International Symposium on Information Theory, Melbourne, Australia, 2021, pp. 2369–2374.","apa":"Hashemi, S. A., Mondelli, M., Fazeli, A., Vardy, A., Cioffi, J., & Goldsmith, A. (2021). Parallelism versus latency in simplified successive-cancellation decoding of polar codes. In 2021 IEEE International Symposium on Information Theory (pp. 2369–2374). Melbourne, Australia: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ISIT45174.2021.9518153","ama":"Hashemi SA, Mondelli M, Fazeli A, Vardy A, Cioffi J, Goldsmith A. Parallelism versus latency in simplified successive-cancellation decoding of polar codes. In: 2021 IEEE International Symposium on Information Theory. Institute of Electrical and Electronics Engineers; 2021:2369-2374. doi:10.1109/ISIT45174.2021.9518153","mla":"Hashemi, Seyyed Ali, et al. “Parallelism versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes.” 2021 IEEE International Symposium on Information Theory, Institute of Electrical and Electronics Engineers, 2021, pp. 2369–74, doi:10.1109/ISIT45174.2021.9518153."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"last_name":"Hashemi","full_name":"Hashemi, Seyyed Ali","first_name":"Seyyed Ali"},{"last_name":"Mondelli","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco"},{"first_name":"Arman","full_name":"Fazeli, Arman","last_name":"Fazeli"},{"last_name":"Vardy","full_name":"Vardy, Alexander","first_name":"Alexander"},{"full_name":"Cioffi, John","last_name":"Cioffi","first_name":"John"},{"full_name":"Goldsmith, Andrea","last_name":"Goldsmith","first_name":"Andrea"}],"article_processing_charge":"No","external_id":{"isi":["000701502202078"],"arxiv":["2012.13378"]},"title":"Parallelism versus latency in simplified successive-cancellation decoding of polar codes","abstract":[{"lang":"eng","text":"This paper characterizes the latency of the simplified successive-cancellation (SSC) decoding scheme for polar codes under hardware resource constraints. In particular, when the number of processing elements P that can perform SSC decoding operations in parallel is limited, as is the case in practice, the latency of SSC decoding is O(N1−1 μ+NPlog2log2NP), where N is the block length of the code and μ is the scaling exponent of polar codes for the channel. Three direct consequences of this bound are presented. First, in a fully-parallel implementation where P=N2 , the latency of SSC decoding is O(N1−1/μ) , which is sublinear in the block length. This recovers a result from an earlier work. Second, in a fully-serial implementation where P=1 , the latency of SSC decoding scales as O(Nlog2log2N) . The multiplicative constant is also calculated: we show that the latency of SSC decoding when P=1 is given by (2+o(1))Nlog2log2N . Third, in a semi-parallel implementation, the smallest P that gives the same latency as that of the fully-parallel implementation is P=N1/μ . The tightness of our bound on SSC decoding latency and the applicability of the foregoing results is validated through extensive simulations."}],"oa_version":"Preprint","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2012.13378"}],"month":"09","publication_identifier":{"eisbn":["978-1-5386-8209-8"],"issn":["2157-8095"],"isbn":["978-1-5386-8210-4"]},"publication_status":"published","language":[{"iso":"eng"}],"related_material":{"record":[{"status":"public","id":"10364","relation":"later_version"}]},"_id":"10053","type":"conference","conference":{"location":"Melbourne, Australia","end_date":"2021-07-20","start_date":"2021-07-12","name":"ISIT: International Symposium on Information Theory"},"status":"public","date_updated":"2023-08-14T06:55:58Z","department":[{"_id":"MaMo"}]},{"file_date_updated":"2021-09-21T15:58:52Z","department":[{"_id":"TaHa"}],"date_updated":"2023-08-14T06:54:35Z","ddc":["514"],"type":"journal_article","article_type":"original","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)"},"status":"public","keyword":["Chiral algebras","Chiral homology","Factorization algebras","Koszul duality","Ran space"],"_id":"10033","volume":392,"publication_identifier":{"eissn":["1090-2082"],"issn":["0001-8708"]},"publication_status":"published","file":[{"date_created":"2021-09-21T15:58:52Z","file_name":"1-s2.0-S000187082100431X-main.pdf","creator":"qho","date_updated":"2021-09-21T15:58:52Z","file_size":840635,"checksum":"f3c0086d41af11db31c00014efb38072","file_id":"10034","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"scopus_import":"1","month":"09","intvolume":" 392","abstract":[{"text":"The ⊗*-monoidal structure on the category of sheaves on the Ran space is not pro-nilpotent in the sense of [3]. However, under some connectivity assumptions, we prove that Koszul duality induces an equivalence of categories and that this equivalence behaves nicely with respect to Verdier duality on the Ran space and integrating along the Ran space, i.e. taking factorization homology. Based on ideas sketched in [4], we show that these results also offer a simpler alternative to one of the two main steps in the proof of the Atiyah-Bott formula given in [7] and [5].","lang":"eng"}],"oa_version":"Published Version","author":[{"id":"3DD82E3C-F248-11E8-B48F-1D18A9856A87","first_name":"Quoc P","last_name":"Ho","orcid":"0000-0001-6889-1418","full_name":"Ho, Quoc P"}],"external_id":{"isi":["000707040300031"],"arxiv":["1610.00212"]},"article_processing_charge":"Yes (via OA deal)","title":"The Atiyah-Bott formula and connectivity in chiral Koszul duality","citation":{"chicago":"Ho, Quoc P. “The Atiyah-Bott Formula and Connectivity in Chiral Koszul Duality.” Advances in Mathematics. Elsevier, 2021. https://doi.org/10.1016/j.aim.2021.107992.","ista":"Ho QP. 2021. The Atiyah-Bott formula and connectivity in chiral Koszul duality. Advances in Mathematics. 392, 107992.","mla":"Ho, Quoc P. “The Atiyah-Bott Formula and Connectivity in Chiral Koszul Duality.” Advances in Mathematics, vol. 392, 107992, Elsevier, 2021, doi:10.1016/j.aim.2021.107992.","apa":"Ho, Q. P. (2021). The Atiyah-Bott formula and connectivity in chiral Koszul duality. Advances in Mathematics. Elsevier. https://doi.org/10.1016/j.aim.2021.107992","ama":"Ho QP. The Atiyah-Bott formula and connectivity in chiral Koszul duality. Advances in Mathematics. 2021;392. doi:10.1016/j.aim.2021.107992","ieee":"Q. P. Ho, “The Atiyah-Bott formula and connectivity in chiral Koszul duality,” Advances in Mathematics, vol. 392. Elsevier, 2021.","short":"Q.P. Ho, Advances in Mathematics 392 (2021)."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"call_identifier":"FWF","_id":"26B96266-B435-11E9-9278-68D0E5697425","name":"Algebro-Geometric Applications of Factorization Homology","grant_number":"M02751"}],"article_number":"107992","date_published":"2021-09-21T00:00:00Z","doi":"10.1016/j.aim.2021.107992","date_created":"2021-09-21T15:58:59Z","has_accepted_license":"1","isi":1,"year":"2021","day":"21","publication":"Advances in Mathematics","publisher":"Elsevier","quality_controlled":"1","oa":1,"acknowledgement":"The author would like to express his gratitude to D. Gaitsgory, without whose tireless guidance and encouragement in pursuing this problem, this work would not have been possible. The author is grateful to his advisor B.C. Ngô for many years of patient guidance and support. This paper is revised while the author is a postdoc in Hausel group at IST Austria. We thank him and the group for providing a wonderful research environment. The author also gratefully acknowledges the support of the Lise Meitner fellowship “Algebro-Geometric Applications of Factorization Homology,” Austrian Science Fund (FWF): M 2751."},{"oa_version":"Published Version","pmid":1,"abstract":[{"text":"Rab-interacting molecule (RIM)-binding protein 2 (BP2) is a multidomain protein of the presynaptic active zone (AZ). By binding to RIM, bassoon (Bsn), and voltage-gated Ca2+ channels (CaV), it is considered to be a central organizer of the topography of CaV and release sites of synaptic vesicles (SVs) at the AZ. Here, we used RIM-BP2 knock-out (KO) mice and their wild-type (WT) littermates of either sex to investigate the role of RIM-BP2 at the endbulb of Held synapse of auditory nerve fibers (ANFs) with bushy cells (BCs) of the cochlear nucleus, a fast relay of the auditory pathway with high release probability. Disruption of RIM-BP2 lowered release probability altering short-term plasticity and reduced evoked EPSCs. Analysis of SV pool dynamics during high-frequency train stimulation indicated a reduction of SVs with high release probability but an overall normal size of the readily releasable SV pool (RRP). The Ca2+-dependent fast component of SV replenishment after RRP depletion was slowed. Ultrastructural analysis by superresolution light and electron microscopy revealed an impaired topography of presynaptic CaV and a reduction of docked and membrane-proximal SVs at the AZ. We conclude that RIM-BP2 organizes the topography of CaV, and promotes SV tethering and docking. This way RIM-BP2 is critical for establishing a high initial release probability as required to reliably signal sound onset information that we found to be degraded in BCs of RIM-BP2-deficient mice in vivo. SIGNIFICANCE STATEMENT: Rab-interacting molecule (RIM)-binding proteins (BPs) are key organizers of the active zone (AZ). Using a multidisciplinary approach to the calyceal endbulb of Held synapse that transmits auditory information at rates of up to hundreds of Hertz with submillisecond precision we demonstrate a requirement for RIM-BP2 for normal auditory signaling. Endbulb synapses lacking RIM-BP2 show a reduced release probability despite normal whole-terminal Ca2+ influx and abundance of the key priming protein Munc13-1, a reduced rate of SV replenishment, as well as an altered topography of voltage-gated (CaV)2.1 Ca2+ channels, and fewer docked and membrane proximal synaptic vesicles (SVs). This hampers transmission of sound onset information likely affecting downstream neural computations such as of sound localization.","lang":"eng"}],"month":"09","intvolume":" 41","scopus_import":"1","file":[{"date_created":"2022-05-31T09:10:15Z","file_name":"2021_JourNeuroscience_Butola.pdf","creator":"dernst","date_updated":"2022-05-31T09:10:15Z","file_size":11571961,"checksum":"769ab627c7355a50ccfd445e43a5f351","file_id":"11423","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0270-6474"],"eissn":["1529-2401"]},"publication_status":"published","volume":41,"issue":"37","_id":"10051","status":"public","article_type":"original","type":"journal_article","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)"},"ddc":["570"],"date_updated":"2023-08-14T06:56:30Z","file_date_updated":"2022-05-31T09:10:15Z","department":[{"_id":"RySh"}],"acknowledgement":"This work was supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) through the Collaborative Sensory Research Center 1286 [to C.W. (A4) and T.M. (B5)] and under Germany’s Excellence Strategy Grant EXC 2067/1-390729940. We thank S. Gerke, A.J. Goldak, and C. Senger-Freitag for expert technical assistance; G. Hoch for developing image analysis routines; and S. Chepurwar and N. Strenzke for technical support and discussion regarding in vivo experiments. We also thank Dr. Christian Rosenmund, Dr. Katharina Grauel, and Dr. Stephan Sigrist for providing RIM-BP2 KO mice and Dr. Masahiko Watanabe for providing the anti-neurexin-antibody, and Dr. Toshihisa Ohtsuka for the anti-ELKS-antibody. J. Neef for help with the STED imaging and image analysis; E. Neher and S. Rizzoli for discussion and comments on the manuscript; K. Eguchi for help with the statistical analysis; and C. H. Huang and J. Neef for constant support and scientific discussion.","quality_controlled":"1","publisher":"Society for Neuroscience","oa":1,"day":"15","publication":"Journal of Neuroscience","isi":1,"has_accepted_license":"1","year":"2021","date_published":"2021-09-15T00:00:00Z","doi":"10.1523/JNEUROSCI.0586-21.2021","date_created":"2021-09-27T14:33:13Z","page":"7742-7767","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"mla":"Butola, Tanvi, et al. “RIM-Binding Protein 2 Organizes Ca21 Channel Topography and Regulates Release Probability and Vesicle Replenishment at a Fast Central Synapse.” Journal of Neuroscience, vol. 41, no. 37, Society for Neuroscience, 2021, pp. 7742–67, doi:10.1523/JNEUROSCI.0586-21.2021.","short":"T. Butola, T. Alvanos, A. Hintze, P. Koppensteiner, D. Kleindienst, R. Shigemoto, C. Wichmann, T. Moser, Journal of Neuroscience 41 (2021) 7742–7767.","ieee":"T. Butola et al., “RIM-binding protein 2 organizes Ca21 channel topography and regulates release probability and vesicle replenishment at a fast central synapse,” Journal of Neuroscience, vol. 41, no. 37. Society for Neuroscience, pp. 7742–7767, 2021.","apa":"Butola, T., Alvanos, T., Hintze, A., Koppensteiner, P., Kleindienst, D., Shigemoto, R., … Moser, T. (2021). RIM-binding protein 2 organizes Ca21 channel topography and regulates release probability and vesicle replenishment at a fast central synapse. Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.0586-21.2021","ama":"Butola T, Alvanos T, Hintze A, et al. RIM-binding protein 2 organizes Ca21 channel topography and regulates release probability and vesicle replenishment at a fast central synapse. Journal of Neuroscience. 2021;41(37):7742-7767. doi:10.1523/JNEUROSCI.0586-21.2021","chicago":"Butola, Tanvi, Theocharis Alvanos, Anika Hintze, Peter Koppensteiner, David Kleindienst, Ryuichi Shigemoto, Carolin Wichmann, and Tobias Moser. “RIM-Binding Protein 2 Organizes Ca21 Channel Topography and Regulates Release Probability and Vesicle Replenishment at a Fast Central Synapse.” Journal of Neuroscience. Society for Neuroscience, 2021. https://doi.org/10.1523/JNEUROSCI.0586-21.2021.","ista":"Butola T, Alvanos T, Hintze A, Koppensteiner P, Kleindienst D, Shigemoto R, Wichmann C, Moser T. 2021. RIM-binding protein 2 organizes Ca21 channel topography and regulates release probability and vesicle replenishment at a fast central synapse. Journal of Neuroscience. 41(37), 7742–7767."},"title":"RIM-binding protein 2 organizes Ca21 channel topography and regulates release probability and vesicle replenishment at a fast central synapse","author":[{"first_name":"Tanvi","full_name":"Butola, Tanvi","last_name":"Butola"},{"first_name":"Theocharis","full_name":"Alvanos, Theocharis","last_name":"Alvanos"},{"last_name":"Hintze","full_name":"Hintze, Anika","first_name":"Anika"},{"id":"3B8B25A8-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","orcid":"0000-0002-3509-1948","full_name":"Koppensteiner, Peter","last_name":"Koppensteiner"},{"id":"42E121A4-F248-11E8-B48F-1D18A9856A87","first_name":"David","full_name":"Kleindienst, David","last_name":"Kleindienst"},{"first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Shigemoto, Ryuichi","orcid":"0000-0001-8761-9444","last_name":"Shigemoto"},{"first_name":"Carolin","full_name":"Wichmann, Carolin","last_name":"Wichmann"},{"last_name":"Moser","full_name":"Moser, Tobias","first_name":"Tobias"}],"external_id":{"pmid":["34353898"],"isi":["000752287700005"]},"article_processing_charge":"No"},{"project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"article_number":"44","author":[{"full_name":"Jecker, Ismael R","last_name":"Jecker","first_name":"Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425"}],"external_id":{"isi":["000635691700044"]},"article_processing_charge":"No","title":"A Ramsey theorem for finite monoids","citation":{"ista":"Jecker IR. 2021. A Ramsey theorem for finite monoids. 38th International Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 187, 44.","chicago":"Jecker, Ismael R. “A Ramsey Theorem for Finite Monoids.” In 38th International Symposium on Theoretical Aspects of Computer Science, Vol. 187. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.STACS.2021.44.","ama":"Jecker IR. A Ramsey theorem for finite monoids. In: 38th International Symposium on Theoretical Aspects of Computer Science. Vol 187. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.STACS.2021.44","apa":"Jecker, I. R. (2021). A Ramsey theorem for finite monoids. In 38th International Symposium on Theoretical Aspects of Computer Science (Vol. 187). Saarbrücken, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2021.44","ieee":"I. R. Jecker, “A Ramsey theorem for finite monoids,” in 38th International Symposium on Theoretical Aspects of Computer Science, Saarbrücken, Germany, 2021, vol. 187.","short":"I.R. Jecker, in:, 38th International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.","mla":"Jecker, Ismael R. “A Ramsey Theorem for Finite Monoids.” 38th International Symposium on Theoretical Aspects of Computer Science, vol. 187, 44, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.STACS.2021.44."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","oa":1,"acknowledgement":"This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411. I wish to thank Michaël Cadilhac, Emmanuel Filiot and Charles Paperman for their valuable insights concerning Green’s relations.","doi":"10.4230/LIPIcs.STACS.2021.44","date_published":"2021-03-10T00:00:00Z","date_created":"2021-09-27T14:33:15Z","has_accepted_license":"1","isi":1,"year":"2021","day":"10","publication":"38th International Symposium on Theoretical Aspects of Computer Science","type":"conference","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)"},"conference":{"name":"STACS: Symposium on Theoretical Aspects of Computer Science","start_date":"2021-03-16","location":"Saarbrücken, Germany","end_date":"2021-03-19"},"status":"public","_id":"10055","department":[{"_id":"KrCh"}],"file_date_updated":"2021-10-01T09:55:00Z","date_updated":"2023-08-14T07:03:23Z","ddc":["000"],"scopus_import":"1","alternative_title":["LIPIcs"],"month":"03","intvolume":" 187","abstract":[{"lang":"eng","text":"Repeated idempotent elements are commonly used to characterise iterable behaviours in abstract models of computation. Therefore, given a monoid M, it is natural to ask how long a sequence of elements of M needs to be to ensure the presence of consecutive idempotent factors. This question is formalised through the notion of the Ramsey function R_M associated to M, obtained by mapping every k ∈ ℕ to the minimal integer R_M(k) such that every word u ∈ M^* of length R_M(k) contains k consecutive non-empty factors that correspond to the same idempotent element of M. In this work, we study the behaviour of the Ramsey function R_M by investigating the regular 𝒟-length of M, defined as the largest size L(M) of a submonoid of M isomorphic to the set of natural numbers {1,2, …, L(M)} equipped with the max operation. We show that the regular 𝒟-length of M determines the degree of R_M, by proving that k^L(M) ≤ R_M(k) ≤ (k|M|⁴)^L(M). To allow applications of this result, we provide the value of the regular 𝒟-length of diverse monoids. In particular, we prove that the full monoid of n × n Boolean matrices, which is used to express transition monoids of non-deterministic automata, has a regular 𝒟-length of (n²+n+2)/2."}],"oa_version":"Published Version","volume":187,"ec_funded":1,"publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-9597-7180-1"]},"publication_status":"published","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"10063","checksum":"17432a05733f408de300e17e390a90e4","success":1,"creator":"cchlebak","date_updated":"2021-10-01T09:55:00Z","file_size":720250,"date_created":"2021-10-01T09:55:00Z","file_name":"2021_LIPIcs_Jecker.pdf"}],"language":[{"iso":"eng"}]},{"year":"2021","isi":1,"has_accepted_license":"1","publication":"Scientific Reports","day":"28","date_created":"2021-10-03T22:01:21Z","doi":"10.1038/s41598-021-98411-z","date_published":"2021-09-28T00:00:00Z","acknowledgement":"This project was funded by an SNSF Eccellenza Grant to MRR (PCEGP3-181181), and by core funding from the Institute of Science and Technology Austria. We would like to thank the participants of the study and all the midwives and doctors for the computerized obstetrical data.","oa":1,"publisher":"Springer Nature","quality_controlled":"1","citation":{"ista":"Robinson MR, Patxot M, Stojanov M, Blum S, Baud D. 2021. Postpartum hemorrhage risk is driven by changes in blood composition through pregnancy. Scientific Reports. 11, 19238.","chicago":"Robinson, Matthew Richard, Marion Patxot, Miloš Stojanov, Sabine Blum, and David Baud. “Postpartum Hemorrhage Risk Is Driven by Changes in Blood Composition through Pregnancy.” Scientific Reports. Springer Nature, 2021. https://doi.org/10.1038/s41598-021-98411-z.","short":"M.R. Robinson, M. Patxot, M. Stojanov, S. Blum, D. Baud, Scientific Reports 11 (2021).","ieee":"M. R. Robinson, M. Patxot, M. Stojanov, S. Blum, and D. Baud, “Postpartum hemorrhage risk is driven by changes in blood composition through pregnancy,” Scientific Reports, vol. 11. Springer Nature, 2021.","apa":"Robinson, M. R., Patxot, M., Stojanov, M., Blum, S., & Baud, D. (2021). Postpartum hemorrhage risk is driven by changes in blood composition through pregnancy. Scientific Reports. Springer Nature. https://doi.org/10.1038/s41598-021-98411-z","ama":"Robinson MR, Patxot M, Stojanov M, Blum S, Baud D. Postpartum hemorrhage risk is driven by changes in blood composition through pregnancy. Scientific Reports. 2021;11. doi:10.1038/s41598-021-98411-z","mla":"Robinson, Matthew Richard, et al. “Postpartum Hemorrhage Risk Is Driven by Changes in Blood Composition through Pregnancy.” Scientific Reports, vol. 11, 19238, Springer Nature, 2021, doi:10.1038/s41598-021-98411-z."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","external_id":{"pmid":["34584125"],"isi":["000701575500083"]},"article_processing_charge":"Yes","author":[{"orcid":"0000-0001-8982-8813","full_name":"Robinson, Matthew Richard","last_name":"Robinson","first_name":"Matthew Richard","id":"E5D42276-F5DA-11E9-8E24-6303E6697425"},{"first_name":"Marion","full_name":"Patxot, Marion","last_name":"Patxot"},{"last_name":"Stojanov","full_name":"Stojanov, Miloš","first_name":"Miloš"},{"full_name":"Blum, Sabine","last_name":"Blum","first_name":"Sabine"},{"full_name":"Baud, David","last_name":"Baud","first_name":"David"}],"title":"Postpartum hemorrhage risk is driven by changes in blood composition through pregnancy","article_number":"19238","publication_status":"published","publication_identifier":{"eissn":["2045-2322"]},"language":[{"iso":"eng"}],"file":[{"success":1,"file_id":"10091","checksum":"f002ec22f609f58e1263b79e7f79601e","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"2021_ScientificReports_Robinson.pdf","date_created":"2021-10-05T14:56:48Z","file_size":6970368,"date_updated":"2021-10-05T14:56:48Z","creator":"cchlebak"}],"volume":11,"abstract":[{"lang":"eng","text":"The extent to which women differ in the course of blood cell counts throughout pregnancy, and the importance of these changes to pregnancy outcomes has not been well defined. Here, we develop a series of statistical analyses of repeated measures data to reveal the degree to which women differ in the course of pregnancy, predict the changes that occur, and determine the importance of these changes for post-partum hemorrhage (PPH) which is one of the leading causes of maternal mortality. We present a prospective cohort of 4082 births recorded at the University Hospital, Lausanne, Switzerland between 2009 and 2014 where full labour records could be obtained, along with complete blood count data taken at hospital admission. We find significant differences, at a [Formula: see text] level, among women in how blood count values change through pregnancy for mean corpuscular hemoglobin, mean corpuscular volume, mean platelet volume, platelet count and red cell distribution width. We find evidence that almost all complete blood count values show trimester-specific associations with PPH. For example, high platelet count (OR 1.20, 95% CI 1.01-1.53), high mean platelet volume (OR 1.58, 95% CI 1.04-2.08), and high erythrocyte levels (OR 1.36, 95% CI 1.01-1.57) in trimester 1 increased PPH, but high values in trimester 3 decreased PPH risk (OR 0.85, 0.79, 0.67 respectively). We show that differences among women in the course of blood cell counts throughout pregnancy have an important role in shaping pregnancy outcome and tracking blood count value changes through pregnancy improves identification of women at increased risk of postpartum hemorrhage. This study provides greater understanding of the complex changes in blood count values that occur through pregnancy and provides indicators to guide the stratification of patients into risk groups."}],"oa_version":"Published Version","pmid":1,"scopus_import":"1","intvolume":" 11","month":"09","date_updated":"2023-08-14T07:05:15Z","ddc":["618"],"department":[{"_id":"MaRo"}],"file_date_updated":"2021-10-05T14:56:48Z","_id":"10069","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)"},"type":"journal_article","article_type":"original","status":"public"},{"_id":"10025","status":"public","keyword":["condensed matter - mesoscale and nanoscale physics","condensed matter - strongly correlated electrons","multidisciplinary"],"article_type":"original","type":"journal_article","date_updated":"2023-08-14T07:04:06Z","department":[{"_id":"MaSe"},{"_id":"MiLe"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"Ferromagnetism is most common in transition metal compounds but may also arise in low-density two-dimensional electron systems, with signatures observed in silicon, III-V semiconductor systems, and graphene moiré heterostructures. Here we show that gate-tuned van Hove singularities in rhombohedral trilayer graphene drive the spontaneous ferromagnetic polarization of the electron system into one or more spin- and valley flavors. Using capacitance measurements on graphite-gated van der Waals heterostructures, we find a cascade of density- and electronic displacement field tuned phase transitions marked by negative electronic compressibility. The transitions define the boundaries between phases where quantum oscillations have either four-fold, two-fold, or one-fold degeneracy, associated with a spin and valley degenerate normal metal, spin-polarized `half-metal', and spin and valley polarized `quarter metal', respectively. For electron doping, the salient features are well captured by a phenomenological Stoner model with a valley-anisotropic Hund's coupling, likely arising from interactions at the lattice scale. For hole filling, we observe a richer phase diagram featuring a delicate interplay of broken symmetries and transitions in the Fermi surface topology. Finally, by rotational alignment of a hexagonal boron nitride substrate to induce a moiré superlattice, we find that the superlattice perturbs the preexisting isospin order only weakly, leaving the basic phase diagram intact while catalyzing the formation of topologically nontrivial gapped states whenever itinerant half- or quarter metal states occur at half- or quarter superlattice band filling. Our results show that rhombohedral trilayer graphene is an ideal platform for well-controlled tests of many-body theory and reveal magnetism in moiré materials to be fundamentally itinerant in nature."}],"month":"09","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2104.00653"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1476-4687"],"issn":["0028-0836"]},"publication_status":"published","related_material":{"link":[{"url":"https://doi.org/10.1038/s41586-021-04181-z","relation":"erratum"}]},"ec_funded":1,"project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"apa":"Zhou, H., Xie, T., Ghazaryan, A., Holder, T., Ehrets, J. R., Spanton, E. M., … Young, A. F. (2021). Half and quarter metals in rhombohedral trilayer graphene. Nature. Springer Nature. https://doi.org/10.1038/s41586-021-03938-w","ama":"Zhou H, Xie T, Ghazaryan A, et al. Half and quarter metals in rhombohedral trilayer graphene. Nature. 2021. doi:10.1038/s41586-021-03938-w","ieee":"H. Zhou et al., “Half and quarter metals in rhombohedral trilayer graphene,” Nature. Springer Nature, 2021.","short":"H. Zhou, T. Xie, A. Ghazaryan, T. Holder, J.R. Ehrets, E.M. Spanton, T. Taniguchi, K. Watanabe, E. Berg, M. Serbyn, A.F. Young, Nature (2021).","mla":"Zhou, Haoxin, et al. “Half and Quarter Metals in Rhombohedral Trilayer Graphene.” Nature, Springer Nature, 2021, doi:10.1038/s41586-021-03938-w.","ista":"Zhou H, Xie T, Ghazaryan A, Holder T, Ehrets JR, Spanton EM, Taniguchi T, Watanabe K, Berg E, Serbyn M, Young AF. 2021. Half and quarter metals in rhombohedral trilayer graphene. Nature.","chicago":"Zhou, Haoxin, Tian Xie, Areg Ghazaryan, Tobias Holder, James R. Ehrets, Eric M. Spanton, Takashi Taniguchi, et al. “Half and Quarter Metals in Rhombohedral Trilayer Graphene.” Nature. Springer Nature, 2021. https://doi.org/10.1038/s41586-021-03938-w."},"title":"Half and quarter metals in rhombohedral trilayer graphene","author":[{"last_name":"Zhou","full_name":"Zhou, Haoxin","first_name":"Haoxin"},{"first_name":"Tian","last_name":"Xie","full_name":"Xie, Tian"},{"full_name":"Ghazaryan, Areg","orcid":"0000-0001-9666-3543","last_name":"Ghazaryan","first_name":"Areg","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Tobias","last_name":"Holder","full_name":"Holder, Tobias"},{"first_name":"James R.","full_name":"Ehrets, James R.","last_name":"Ehrets"},{"first_name":"Eric M.","full_name":"Spanton, Eric M.","last_name":"Spanton"},{"first_name":"Takashi","full_name":"Taniguchi, Takashi","last_name":"Taniguchi"},{"first_name":"Kenji","last_name":"Watanabe","full_name":"Watanabe, Kenji"},{"last_name":"Berg","full_name":"Berg, Erez","first_name":"Erez"},{"orcid":"0000-0002-2399-5827","full_name":"Serbyn, Maksym","last_name":"Serbyn","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","first_name":"Maksym"},{"first_name":"Andrea F.","full_name":"Young, Andrea F.","last_name":"Young"}],"article_processing_charge":"No","external_id":{"isi":["000706977400002"],"arxiv":["2104.00653"]},"acknowledgement":"The authors acknowledge discussions with A. Macdonald, L. Fu, F. Wang and M. Zaletel. AFY acknowledges support of the National Science Foundation under DMR1654186, and the Gordon and Betty Moore Foundation under award GBMF9471. The authors acknowledge the use of the research facilities within the California NanoSystems Institute, supported by the University of California, Santa Barbara and the University of California, Office of the President.\r\nK.W. and T.T. acknowledge support from the Elemental Strategy Initiative conducted by the MEXT, Japan, Grant Number JPMXP0112101001 and JSPS KAKENHI, Grant Number JP20H00354. EB and TH were supported by the European Research Council (ERC) under grant HQMAT (Grant Agreement No. 817799). A.G. acknowledges support by the European Unions Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement\r\nNo. 754411.\r\n","publisher":"Springer Nature","quality_controlled":"1","oa":1,"day":"01","publication":"Nature","isi":1,"year":"2021","doi":"10.1038/s41586-021-03938-w","date_published":"2021-09-01T00:00:00Z","date_created":"2021-09-19T22:01:25Z"}]