[{"language":[{"iso":"eng"}],"publication":"SIAM Journal on Computing","arxiv":1,"title":"Commutativity in the algorithmic Lovász local lemma","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1506.08547"}],"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_published":"2018-11-08T00:00:00Z","day":"08","oa":1,"doi":"10.1137/16m1093306","oa_version":"Preprint","publication_identifier":{"eissn":["1095-7111"],"issn":["0097-5397"]},"issue":"6","scopus_import":"1","external_id":{"isi":["000453785100001"],"arxiv":["1506.08547"]},"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1193"}]},"type":"journal_article","_id":"5975","year":"2018","intvolume":"        47","date_created":"2019-02-13T12:59:33Z","isi":1,"ec_funded":1,"month":"11","project":[{"name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160","call_identifier":"FP7"}],"publication_status":"published","author":[{"last_name":"Kolmogorov","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"lang":"eng","text":"We consider the recent formulation of the algorithmic Lov ́asz Local Lemma  [N. Har-vey and J. Vondr ́ak, inProceedings of FOCS, 2015, pp. 1327–1345; D. Achlioptas and F. Iliopoulos,inProceedings of SODA, 2016, pp. 2024–2038; D. Achlioptas, F. Iliopoulos, and V. Kolmogorov,ALocal Lemma for Focused Stochastic Algorithms, arXiv preprint, 2018] for finding objects that avoid“bad  features,”  or  “flaws.”   It  extends  the  Moser–Tardos  resampling  algorithm  [R.  A.  Moser  andG. Tardos,J. ACM, 57 (2010), 11] to more general discrete spaces.  At each step the method picks aflaw present in the current state and goes to a new state according to some prespecified probabilitydistribution (which depends on the current state and the selected flaw).  However, the recent formu-lation is less flexible than the Moser–Tardos method since it requires a specific flaw selection rule,whereas the algorithm of Moser and Tardos allows an arbitrary rule (and thus can potentially beimplemented more efficiently).  We formulate a new “commutativity” condition and prove that it issufficient for an arbitrary rule to work.  It also enables an efficient parallelization under an additionalassumption.  We then show that existing resampling oracles for perfect matchings and permutationsdo satisfy this condition."}],"date_updated":"2023-09-19T14:24:58Z","quality_controlled":"1","citation":{"ista":"Kolmogorov V. 2018. Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. 47(6), 2029–2056.","ama":"Kolmogorov V. Commutativity in the algorithmic Lovász local lemma. <i>SIAM Journal on Computing</i>. 2018;47(6):2029-2056. doi:<a href=\"https://doi.org/10.1137/16m1093306\">10.1137/16m1093306</a>","ieee":"V. Kolmogorov, “Commutativity in the algorithmic Lovász local lemma,” <i>SIAM Journal on Computing</i>, vol. 47, no. 6. Society for Industrial &#38; Applied Mathematics (SIAM), pp. 2029–2056, 2018.","short":"V. Kolmogorov, SIAM Journal on Computing 47 (2018) 2029–2056.","chicago":"Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.” <i>SIAM Journal on Computing</i>. Society for Industrial &#38; Applied Mathematics (SIAM), 2018. <a href=\"https://doi.org/10.1137/16m1093306\">https://doi.org/10.1137/16m1093306</a>.","mla":"Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.” <i>SIAM Journal on Computing</i>, vol. 47, no. 6, Society for Industrial &#38; Applied Mathematics (SIAM), 2018, pp. 2029–56, doi:<a href=\"https://doi.org/10.1137/16m1093306\">10.1137/16m1093306</a>.","apa":"Kolmogorov, V. (2018). Commutativity in the algorithmic Lovász local lemma. <i>SIAM Journal on Computing</i>. Society for Industrial &#38; Applied Mathematics (SIAM). <a href=\"https://doi.org/10.1137/16m1093306\">https://doi.org/10.1137/16m1093306</a>"},"volume":47,"page":"2029-2056","publisher":"Society for Industrial & Applied Mathematics (SIAM)","department":[{"_id":"VlKo"}]},{"year":"2018","_id":"5976","article_number":"241","type":"journal_article","author":[{"last_name":"Malomo","first_name":"Luigi","full_name":"Malomo, Luigi"},{"full_name":"Perez Rodriguez, Jesus","last_name":"Perez Rodriguez","first_name":"Jesus","id":"2DC83906-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Iarussi","first_name":"Emmanuel","full_name":"Iarussi, Emmanuel","id":"33F19F16-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pietroni, Nico","first_name":"Nico","last_name":"Pietroni"},{"last_name":"Miguel","first_name":"Eder","full_name":"Miguel, Eder"},{"full_name":"Cignoni, Paolo","first_name":"Paolo","last_name":"Cignoni"},{"orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","last_name":"Bickel","full_name":"Bickel, Bernd"}],"month":"11","ec_funded":1,"isi":1,"project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"715767"},{"grant_number":"645599","call_identifier":"H2020","name":"Soft-bodied intelligence for Manipulation","_id":"25082902-B435-11E9-9278-68D0E5697425"},{"grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships"}],"publication_status":"published","date_created":"2019-02-13T13:12:53Z","intvolume":"        37","volume":37,"pubrep_id":"1068","citation":{"ama":"Malomo L, Perez Rodriguez J, Iarussi E, et al. FlexMaps: Computational design of flat flexible shells for shaping 3D objects. <i>ACM Transactions on Graphics</i>. 2018;37(6). doi:<a href=\"https://doi.org/10.1145/3272127.3275076\">10.1145/3272127.3275076</a>","ieee":"L. Malomo <i>et al.</i>, “FlexMaps: Computational design of flat flexible shells for shaping 3D objects,” <i>ACM Transactions on Graphics</i>, vol. 37, no. 6. Association for Computing Machinery (ACM), 2018.","short":"L. Malomo, J. Perez Rodriguez, E. Iarussi, N. Pietroni, E. Miguel, P. Cignoni, B. Bickel, ACM Transactions on Graphics 37 (2018).","chicago":"Malomo, Luigi, Jesus Perez Rodriguez, Emmanuel Iarussi, Nico Pietroni, Eder Miguel, Paolo Cignoni, and Bernd Bickel. “FlexMaps: Computational Design of Flat Flexible Shells for Shaping 3D Objects.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery (ACM), 2018. <a href=\"https://doi.org/10.1145/3272127.3275076\">https://doi.org/10.1145/3272127.3275076</a>.","mla":"Malomo, Luigi, et al. “FlexMaps: Computational Design of Flat Flexible Shells for Shaping 3D Objects.” <i>ACM Transactions on Graphics</i>, vol. 37, no. 6, 241, Association for Computing Machinery (ACM), 2018, doi:<a href=\"https://doi.org/10.1145/3272127.3275076\">10.1145/3272127.3275076</a>.","apa":"Malomo, L., Perez Rodriguez, J., Iarussi, E., Pietroni, N., Miguel, E., Cignoni, P., &#38; Bickel, B. (2018). FlexMaps: Computational design of flat flexible shells for shaping 3D objects. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery (ACM). <a href=\"https://doi.org/10.1145/3272127.3275076\">https://doi.org/10.1145/3272127.3275076</a>","ista":"Malomo L, Perez Rodriguez J, Iarussi E, Pietroni N, Miguel E, Cignoni P, Bickel B. 2018. FlexMaps: Computational design of flat flexible shells for shaping 3D objects. ACM Transactions on Graphics. 37(6), 241."},"has_accepted_license":"1","quality_controlled":"1","abstract":[{"text":"We propose FlexMaps, a novel framework for fabricating smooth shapes out of flat, flexible panels with tailored mechanical properties. We start by mapping the 3D surface onto a 2D domain as in traditional UV mapping to design a set of deformable flat panels called FlexMaps. For these panels, we design and obtain specific mechanical properties such that, once they are assembled, the static equilibrium configuration matches the desired 3D shape. FlexMaps can be fabricated from an almost rigid material, such as wood or plastic, and are made flexible in a controlled way by using computationally designed spiraling microstructures.","lang":"eng"}],"date_updated":"2023-09-19T14:25:30Z","department":[{"_id":"BeBi"}],"publisher":"Association for Computing Machinery (ACM)","file_date_updated":"2020-07-14T12:47:14Z","article_processing_charge":"No","title":"FlexMaps: Computational design of flat flexible shells for shaping 3D objects","language":[{"iso":"eng"}],"publication":"ACM Transactions on Graphics","article_type":"original","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_published":"2018-11-01T00:00:00Z","ddc":["000"],"status":"public","day":"01","oa":1,"scopus_import":"1","issue":"6","external_id":{"isi":["000455953100064"]},"file":[{"access_level":"open_access","date_updated":"2020-07-14T12:47:14Z","file_id":"6901","checksum":"d0529a41c78b37ab8840685579fb33b4","relation":"main_file","content_type":"application/pdf","file_name":"flexmaps_author_version.pdf","file_size":100109811,"date_created":"2019-09-23T12:48:52Z","creator":"bbickel"}],"publication_identifier":{"issn":["0730-0301"]},"doi":"10.1145/3272127.3275076","oa_version":"Published Version"},{"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_published":"2018-07-17T00:00:00Z","arxiv":1,"article_processing_charge":"No","title":"Computational approaches for stochastic shortest path on succinct MDPs","language":[{"iso":"eng"}],"publication":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","main_file_link":[{"url":"https://arxiv.org/abs/1804.08984","open_access":"1"}],"doi":"10.24963/ijcai.2018/653","oa_version":"Preprint","scopus_import":"1","external_id":{"isi":["000764175404118"],"arxiv":["1804.08984"]},"publication_identifier":{"issn":["10450823"],"isbn":["978-099924112-7"]},"day":"17","oa":1,"date_created":"2019-02-13T13:26:27Z","intvolume":"      2018","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"last_name":"Fu","first_name":"Hongfei","full_name":"Fu, Hongfei","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady","first_name":"Amir","full_name":"Goharshady, Amir"},{"first_name":"Nastaran","last_name":"Okati","full_name":"Okati, Nastaran"}],"isi":1,"month":"07","ec_funded":1,"publication_status":"published","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"},{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"_id":"5977","year":"2018","related_material":{"record":[{"id":"8934","status":"public","relation":"dissertation_contains"}]},"type":"conference","publisher":"IJCAI","conference":{"name":"IJCAI: International Joint Conference on Artificial Intelligence","end_date":"2018-07-19","start_date":"2018-07-13","location":"Stockholm, Sweden"},"department":[{"_id":"KrCh"}],"quality_controlled":"1","abstract":[{"lang":"eng","text":"We consider the stochastic shortest path (SSP)problem for succinct Markov decision processes(MDPs), where the MDP consists of a set of vari-ables, and a set of nondeterministic rules that up-date the variables. First, we show that several ex-amples from the AI literature can be modeled assuccinct MDPs.  Then we present computationalapproaches for upper and lower bounds for theSSP problem: (a) for computing upper bounds, ourmethod is polynomial-time in the implicit descrip-tion of the MDP; (b) for lower bounds, we present apolynomial-time (in the size of the implicit descrip-tion) reduction to quadratic programming. Our ap-proach is applicable even to infinite-state MDPs.Finally, we present experimental results to demon-strate the effectiveness of our approach on severalclassical examples from the AI literature."}],"date_updated":"2025-06-02T08:53:44Z","page":"4700-4707","volume":2018,"citation":{"ista":"Chatterjee K, Fu H, Goharshady AK, Okati N. 2018. Computational approaches for stochastic shortest path on succinct MDPs. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018, 4700–4707.","short":"K. Chatterjee, H. Fu, A.K. Goharshady, N. Okati, in:, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI, 2018, pp. 4700–4707.","ama":"Chatterjee K, Fu H, Goharshady AK, Okati N. Computational approaches for stochastic shortest path on succinct MDPs. In: <i>Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence</i>. Vol 2018. IJCAI; 2018:4700-4707. doi:<a href=\"https://doi.org/10.24963/ijcai.2018/653\">10.24963/ijcai.2018/653</a>","chicago":"Chatterjee, Krishnendu, Hongfei Fu, Amir Kafshdar Goharshady, and Nastaran Okati. “Computational Approaches for Stochastic Shortest Path on Succinct MDPs.” In <i>Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence</i>, 2018:4700–4707. IJCAI, 2018. <a href=\"https://doi.org/10.24963/ijcai.2018/653\">https://doi.org/10.24963/ijcai.2018/653</a>.","ieee":"K. Chatterjee, H. Fu, A. K. Goharshady, and N. Okati, “Computational approaches for stochastic shortest path on succinct MDPs,” in <i>Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence</i>, Stockholm, Sweden, 2018, vol. 2018, pp. 4700–4707.","mla":"Chatterjee, Krishnendu, et al. “Computational Approaches for Stochastic Shortest Path on Succinct MDPs.” <i>Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence</i>, vol. 2018, IJCAI, 2018, pp. 4700–07, doi:<a href=\"https://doi.org/10.24963/ijcai.2018/653\">10.24963/ijcai.2018/653</a>.","apa":"Chatterjee, K., Fu, H., Goharshady, A. K., &#38; Okati, N. (2018). Computational approaches for stochastic shortest path on succinct MDPs. In <i>Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence</i> (Vol. 2018, pp. 4700–4707). Stockholm, Sweden: IJCAI. <a href=\"https://doi.org/10.24963/ijcai.2018/653\">https://doi.org/10.24963/ijcai.2018/653</a>"}},{"conference":{"location":"New Orleans, LU, United States","start_date":"2018-02-02","end_date":"2018-02-07","name":"AAAI: Conference on Artificial Intelligence"},"oa_version":"Preprint","publisher":"AAAI Press","department":[{"_id":"VlKo"}],"scopus_import":"1","external_id":{"isi":["000485488906082"],"arxiv":["2004.06370"]},"abstract":[{"lang":"eng","text":"We consider the MAP-inference problem for graphical models,which is a valued constraint satisfaction problem defined onreal numbers with a natural summation operation. We proposea family of relaxations (different from the famous Sherali-Adams hierarchy), which naturally define lower bounds for itsoptimum. This family always contains a tight relaxation andwe give an algorithm able to find it and therefore, solve theinitial non-relaxed NP-hard problem.The relaxations we consider decompose the original probleminto two non-overlapping parts: an easy LP-tight part and adifficult one. For the latter part a combinatorial solver must beused. As we show in our experiments, in a number of applica-tions the second, difficult part constitutes only a small fractionof the whole problem. This property allows to significantlyreduce the computational time of the combinatorial solver andtherefore solve problems which were out of reach before."}],"date_updated":"2023-09-19T14:26:52Z","quality_controlled":"1","day":"01","citation":{"ista":"Haller S, Swoboda P, Savchynskyy B. 2018. Exact MAP-inference by confining combinatorial search with LP relaxation. Proceedings of the 32st AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence, 6581–6588.","short":"S. Haller, P. Swoboda, B. Savchynskyy, in:, Proceedings of the 32st AAAI Conference on Artificial Intelligence, AAAI Press, 2018, pp. 6581–6588.","chicago":"Haller, Stefan, Paul Swoboda, and Bogdan Savchynskyy. “Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation.” In <i>Proceedings of the 32st AAAI Conference on Artificial Intelligence</i>, 6581–88. AAAI Press, 2018.","ama":"Haller S, Swoboda P, Savchynskyy B. Exact MAP-inference by confining combinatorial search with LP relaxation. In: <i>Proceedings of the 32st AAAI Conference on Artificial Intelligence</i>. AAAI Press; 2018:6581-6588.","ieee":"S. Haller, P. Swoboda, and B. Savchynskyy, “Exact MAP-inference by confining combinatorial search with LP relaxation,” in <i>Proceedings of the 32st AAAI Conference on Artificial Intelligence</i>, New Orleans, LU, United States, 2018, pp. 6581–6588.","mla":"Haller, Stefan, et al. “Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation.” <i>Proceedings of the 32st AAAI Conference on Artificial Intelligence</i>, AAAI Press, 2018, pp. 6581–88.","apa":"Haller, S., Swoboda, P., &#38; Savchynskyy, B. (2018). Exact MAP-inference by confining combinatorial search with LP relaxation. In <i>Proceedings of the 32st AAAI Conference on Artificial Intelligence</i> (pp. 6581–6588). New Orleans, LU, United States: AAAI Press."},"oa":1,"page":"6581-6588","status":"public","date_created":"2019-02-13T13:32:48Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","isi":1,"month":"02","publication_status":"published","date_published":"2018-02-01T00:00:00Z","author":[{"full_name":"Haller, Stefan","first_name":"Stefan","last_name":"Haller"},{"id":"446560C6-F248-11E8-B48F-1D18A9856A87","full_name":"Swoboda, Paul","first_name":"Paul","last_name":"Swoboda"},{"full_name":"Savchynskyy, Bogdan","first_name":"Bogdan","last_name":"Savchynskyy"}],"language":[{"iso":"eng"}],"publication":"Proceedings of the 32st AAAI Conference on Artificial Intelligence","arxiv":1,"article_processing_charge":"No","title":"Exact MAP-inference by confining combinatorial search with LP relaxation","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2004.06370"}],"type":"conference","year":"2018","_id":"5978"},{"page":"17-47","citation":{"ista":"Chatterjee S, Kamath Hosdurg C, Kumar V. 2018. Private set-intersection with common set-up. American Institute of Mathematical Sciences. 12(1), 17–47.","ama":"Chatterjee S, Kamath Hosdurg C, Kumar V. Private set-intersection with common set-up. <i>American Institute of Mathematical Sciences</i>. 2018;12(1):17-47. doi:<a href=\"https://doi.org/10.3934/amc.2018002\">10.3934/amc.2018002</a>","short":"S. Chatterjee, C. Kamath Hosdurg, V. Kumar, American Institute of Mathematical Sciences 12 (2018) 17–47.","chicago":"Chatterjee, Sanjit, Chethan Kamath Hosdurg, and Vikas Kumar. “Private Set-Intersection with Common Set-Up.” <i>American Institute of Mathematical Sciences</i>. AIMS, 2018. <a href=\"https://doi.org/10.3934/amc.2018002\">https://doi.org/10.3934/amc.2018002</a>.","ieee":"S. Chatterjee, C. Kamath Hosdurg, and V. Kumar, “Private set-intersection with common set-up,” <i>American Institute of Mathematical Sciences</i>, vol. 12, no. 1. AIMS, pp. 17–47, 2018.","mla":"Chatterjee, Sanjit, et al. “Private Set-Intersection with Common Set-Up.” <i>American Institute of Mathematical Sciences</i>, vol. 12, no. 1, AIMS, 2018, pp. 17–47, doi:<a href=\"https://doi.org/10.3934/amc.2018002\">10.3934/amc.2018002</a>.","apa":"Chatterjee, S., Kamath Hosdurg, C., &#38; Kumar, V. (2018). Private set-intersection with common set-up. <i>American Institute of Mathematical Sciences</i>. AIMS. <a href=\"https://doi.org/10.3934/amc.2018002\">https://doi.org/10.3934/amc.2018002</a>"},"volume":12,"day":"01","quality_controlled":"1","date_updated":"2023-09-19T14:27:59Z","abstract":[{"lang":"eng","text":"The problem of private set-intersection (PSI) has been traditionally treated as an instance of the more general problem of multi-party computation (MPC). Consequently, in order to argue security, or compose these protocols one has to rely on the general theory that was developed for the purpose of MPC. The pursuit of efficient protocols, however, has resulted in designs that exploit properties pertaining to PSI. In almost all practical applications where a PSI protocol is deployed, it is expected to be executed multiple times, possibly on related inputs. In this work we initiate a dedicated study of PSI in the multi-interaction (MI) setting. In this model a server sets up the common system parameters and executes set-intersection multiple times with potentially different clients. We discuss a few attacks that arise when protocols are naïvely composed in this manner and, accordingly, craft security definitions for the MI setting and study their inter-relation. Finally, we suggest a set of protocols that are MI-secure, at the same time almost as efficient as their parent, stand-alone, protocols."}],"external_id":{"isi":["000430950400002"]},"scopus_import":"1","department":[{"_id":"KrPi"}],"issue":"1","oa_version":"None","publisher":"AIMS","doi":"10.3934/amc.2018002","year":"2018","_id":"5980","type":"journal_article","article_processing_charge":"No","title":"Private set-intersection with common set-up","publication":"American Institute of Mathematical Sciences","language":[{"iso":"eng"}],"author":[{"full_name":"Chatterjee, Sanjit","first_name":"Sanjit","last_name":"Chatterjee"},{"id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","first_name":"Chethan","last_name":"Kamath Hosdurg","full_name":"Kamath Hosdurg, Chethan"},{"last_name":"Kumar","first_name":"Vikas","full_name":"Kumar, Vikas"}],"publication_status":"published","date_published":"2018-02-01T00:00:00Z","month":"02","isi":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2019-02-13T13:49:41Z","status":"public","intvolume":"        12"},{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_published":"2018-12-21T00:00:00Z","article_type":"original","status":"public","main_file_link":[{"url":"https://upcommons.upc.edu/bitstream/2117/130444/1/Zhang%20preprint.pdf","open_access":"1"}],"language":[{"iso":"eng"}],"publication":"Angewandte Chemie International Edition","title":"Tin diselenide molecular precursor for solution-processable thermoelectric materials","article_processing_charge":"No","publication_identifier":{"issn":["1433-7851"]},"issue":"52","scopus_import":"1","external_id":{"isi":["000454575500020"]},"doi":"10.1002/anie.201809847","oa_version":"Submitted Version","day":"21","oa":1,"month":"12","isi":1,"publication_status":"published","author":[{"last_name":"Zhang","first_name":"Yu","full_name":"Zhang, Yu"},{"full_name":"Liu, Yu","first_name":"Yu","last_name":"Liu"},{"last_name":"Lim","first_name":"Khak Ho","full_name":"Lim, Khak Ho"},{"first_name":"Congcong","last_name":"Xing","full_name":"Xing, Congcong"},{"last_name":"Li","first_name":"Mengyao","full_name":"Li, Mengyao"},{"full_name":"Zhang, Ting","first_name":"Ting","last_name":"Zhang"},{"full_name":"Tang, Pengyi","first_name":"Pengyi","last_name":"Tang"},{"full_name":"Arbiol, Jordi","last_name":"Arbiol","first_name":"Jordi"},{"last_name":"Llorca","first_name":"Jordi","full_name":"Llorca, Jordi"},{"first_name":"Ka Ming","last_name":"Ng","full_name":"Ng, Ka Ming"},{"id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria","first_name":"Maria","last_name":"Ibáñez"},{"full_name":"Guardia, Pablo","first_name":"Pablo","last_name":"Guardia"},{"first_name":"Mirko","last_name":"Prato","full_name":"Prato, Mirko"},{"full_name":"Cadavid, Doris","first_name":"Doris","last_name":"Cadavid"},{"full_name":"Cabot, Andreu","last_name":"Cabot","first_name":"Andreu"}],"intvolume":"        57","date_created":"2019-02-14T10:23:27Z","type":"journal_article","year":"2018","_id":"5982","department":[{"_id":"MaIb"}],"publisher":"Wiley","page":"17063-17068","volume":57,"citation":{"short":"Y. Zhang, Y. Liu, K.H. Lim, C. Xing, M. Li, T. Zhang, P. Tang, J. Arbiol, J. Llorca, K.M. Ng, M. Ibáñez, P. Guardia, M. Prato, D. Cadavid, A. Cabot, Angewandte Chemie International Edition 57 (2018) 17063–17068.","ieee":"Y. Zhang <i>et al.</i>, “Tin diselenide molecular precursor for solution-processable thermoelectric materials,” <i>Angewandte Chemie International Edition</i>, vol. 57, no. 52. Wiley, pp. 17063–17068, 2018.","chicago":"Zhang, Yu, Yu Liu, Khak Ho Lim, Congcong Xing, Mengyao Li, Ting Zhang, Pengyi Tang, et al. “Tin Diselenide Molecular Precursor for Solution-Processable Thermoelectric Materials.” <i>Angewandte Chemie International Edition</i>. Wiley, 2018. <a href=\"https://doi.org/10.1002/anie.201809847\">https://doi.org/10.1002/anie.201809847</a>.","ama":"Zhang Y, Liu Y, Lim KH, et al. Tin diselenide molecular precursor for solution-processable thermoelectric materials. <i>Angewandte Chemie International Edition</i>. 2018;57(52):17063-17068. doi:<a href=\"https://doi.org/10.1002/anie.201809847\">10.1002/anie.201809847</a>","mla":"Zhang, Yu, et al. “Tin Diselenide Molecular Precursor for Solution-Processable Thermoelectric Materials.” <i>Angewandte Chemie International Edition</i>, vol. 57, no. 52, Wiley, 2018, pp. 17063–68, doi:<a href=\"https://doi.org/10.1002/anie.201809847\">10.1002/anie.201809847</a>.","apa":"Zhang, Y., Liu, Y., Lim, K. H., Xing, C., Li, M., Zhang, T., … Cabot, A. (2018). Tin diselenide molecular precursor for solution-processable thermoelectric materials. <i>Angewandte Chemie International Edition</i>. Wiley. <a href=\"https://doi.org/10.1002/anie.201809847\">https://doi.org/10.1002/anie.201809847</a>","ista":"Zhang Y, Liu Y, Lim KH, Xing C, Li M, Zhang T, Tang P, Arbiol J, Llorca J, Ng KM, Ibáñez M, Guardia P, Prato M, Cadavid D, Cabot A. 2018. Tin diselenide molecular precursor for solution-processable thermoelectric materials. Angewandte Chemie International Edition. 57(52), 17063–17068."},"abstract":[{"text":"In the present work, we detail a fast and simple solution-based method to synthesize hexagonal SnSe2 nanoplates (NPLs) and their use to produce crystallographically textured SnSe2 nanomaterials. We also demonstrate that the same strategy can be used to produce orthorhombic SnSe nanostructures and nanomaterials. NPLs are grown through a screw dislocation-driven mechanism. This mechanism typically results in pyramidal structures, but we demonstrate here that the growth from multiple dislocations results in flower-like structures. Crystallographically textured SnSe2 bulk nanomaterials obtained from the hot pressing of these SnSe2 structures display highly anisotropic charge and heat transport properties and thermoelectric (TE) figures of merit limited by relatively low electrical conductivities. To improve this parameter, SnSe2 NPLs are blended here with metal nanoparticles. The electrical conductivities of the blends are significantly improved with respect to bare SnSe2 NPLs, what translates into a three-fold increase of the TE Figure of merit, reaching unprecedented ZT values up to 0.65.","lang":"eng"}],"date_updated":"2023-09-19T14:28:31Z","quality_controlled":"1"},{"date_published":"2018-12-12T00:00:00Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.01204"}],"article_processing_charge":"No","title":"Theory of the rotating polaron: Spectrum and self-localization","arxiv":1,"publication":"Physical Review B","language":[{"iso":"eng"}],"external_id":{"isi":["000452992700008"],"arxiv":["1809.01204"]},"scopus_import":"1","issue":"22","publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"oa_version":"Preprint","doi":"10.1103/physrevb.98.224506","oa":1,"day":"12","author":[{"last_name":"Yakaboylu","first_name":"Enderalp","full_name":"Yakaboylu, Enderalp","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5973-0874"},{"id":"456187FC-F248-11E8-B48F-1D18A9856A87","full_name":"Midya, Bikashkali","last_name":"Midya","first_name":"Bikashkali"},{"orcid":"0000-0003-3146-6746","id":"4DA65CD0-F248-11E8-B48F-1D18A9856A87","full_name":"Deuchert, Andreas","first_name":"Andreas","last_name":"Deuchert"},{"first_name":"Nikolai K","last_name":"Leopold","full_name":"Leopold, Nikolai K","orcid":"0000-0002-0495-6822","id":"4BC40BEC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Lemeshko, Mikhail","first_name":"Mikhail","last_name":"Lemeshko","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"}],"project":[{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734"},{"grant_number":"694227","call_identifier":"H2020","name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","month":"12","ec_funded":1,"isi":1,"date_created":"2019-02-14T10:37:09Z","intvolume":"        98","year":"2018","_id":"5983","type":"journal_article","article_number":"224506","department":[{"_id":"MiLe"},{"_id":"RoSe"}],"publisher":"American Physical Society","volume":98,"citation":{"apa":"Yakaboylu, E., Midya, B., Deuchert, A., Leopold, N. K., &#38; Lemeshko, M. (2018). Theory of the rotating polaron: Spectrum and self-localization. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevb.98.224506\">https://doi.org/10.1103/physrevb.98.224506</a>","mla":"Yakaboylu, Enderalp, et al. “Theory of the Rotating Polaron: Spectrum and Self-Localization.” <i>Physical Review B</i>, vol. 98, no. 22, 224506, American Physical Society, 2018, doi:<a href=\"https://doi.org/10.1103/physrevb.98.224506\">10.1103/physrevb.98.224506</a>.","short":"E. Yakaboylu, B. Midya, A. Deuchert, N.K. Leopold, M. Lemeshko, Physical Review B 98 (2018).","ieee":"E. Yakaboylu, B. Midya, A. Deuchert, N. K. Leopold, and M. Lemeshko, “Theory of the rotating polaron: Spectrum and self-localization,” <i>Physical Review B</i>, vol. 98, no. 22. American Physical Society, 2018.","ama":"Yakaboylu E, Midya B, Deuchert A, Leopold NK, Lemeshko M. Theory of the rotating polaron: Spectrum and self-localization. <i>Physical Review B</i>. 2018;98(22). doi:<a href=\"https://doi.org/10.1103/physrevb.98.224506\">10.1103/physrevb.98.224506</a>","chicago":"Yakaboylu, Enderalp, Bikashkali Midya, Andreas Deuchert, Nikolai K Leopold, and Mikhail Lemeshko. “Theory of the Rotating Polaron: Spectrum and Self-Localization.” <i>Physical Review B</i>. American Physical Society, 2018. <a href=\"https://doi.org/10.1103/physrevb.98.224506\">https://doi.org/10.1103/physrevb.98.224506</a>.","ista":"Yakaboylu E, Midya B, Deuchert A, Leopold NK, Lemeshko M. 2018. Theory of the rotating polaron: Spectrum and self-localization. Physical Review B. 98(22), 224506."},"quality_controlled":"1","date_updated":"2023-09-19T14:29:03Z","abstract":[{"text":"We study a quantum impurity possessing both translational and internal rotational degrees of freedom interacting with a bosonic bath. Such a system corresponds to a “rotating polaron,” which can be used to model, e.g., a rotating molecule immersed in an ultracold Bose gas or superfluid helium. We derive the Hamiltonian of the rotating polaron and study its spectrum in the weak- and strong-coupling regimes using a combination of variational, diagrammatic, and mean-field approaches. We reveal how the coupling between linear and angular momenta affects stable quasiparticle states, and demonstrate that internal rotation leads to an enhanced self-localization in the translational degrees of freedom.","lang":"eng"}]},{"file_date_updated":"2020-07-14T12:47:14Z","title":"Optical functionalization of human class A orphan G-protein-coupled receptors","article_processing_charge":"No","language":[{"iso":"eng"}],"publication":"Nature Communications","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_published":"2018-12-01T00:00:00Z","ddc":["570"],"status":"public","day":"01","oa":1,"scopus_import":"1","issue":"1","external_id":{"isi":["000432280000006"]},"publication_identifier":{"issn":["2041-1723"]},"file":[{"file_size":1349914,"date_created":"2019-02-14T10:58:29Z","creator":"kschuh","checksum":"8325fcc194264af4749e662a73bf66b5","file_id":"5985","date_updated":"2020-07-14T12:47:14Z","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_name":"2018_Springer_Morri.pdf"}],"doi":"10.1038/s41467-018-04342-1","oa_version":"Published Version","_id":"5984","year":"2018","article_number":"1950","type":"journal_article","author":[{"id":"4863116E-F248-11E8-B48F-1D18A9856A87","first_name":"Maurizio","last_name":"Morri","full_name":"Morri, Maurizio"},{"id":"3D9C5D30-F248-11E8-B48F-1D18A9856A87","last_name":"Sanchez-Romero","first_name":"Inmaculada","full_name":"Sanchez-Romero, Inmaculada"},{"id":"29D8BB2C-F248-11E8-B48F-1D18A9856A87","full_name":"Tichy, Alexandra-Madelaine","first_name":"Alexandra-Madelaine","last_name":"Tichy"},{"id":"32CFBA64-F248-11E8-B48F-1D18A9856A87","full_name":"Kainrath, Stephanie","first_name":"Stephanie","last_name":"Kainrath"},{"first_name":"Elliot J.","last_name":"Gerrard","full_name":"Gerrard, Elliot J."},{"full_name":"Hirschfeld, Priscila","first_name":"Priscila","last_name":"Hirschfeld","id":"435ACB3A-F248-11E8-B48F-1D18A9856A87"},{"id":"346C1EC6-F248-11E8-B48F-1D18A9856A87","full_name":"Schwarz, Jan","first_name":"Jan","last_name":"Schwarz"},{"full_name":"Janovjak, Harald L","first_name":"Harald L","last_name":"Janovjak","orcid":"0000-0002-8023-9315","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87"}],"isi":1,"ec_funded":1,"month":"12","project":[{"call_identifier":"FP7","grant_number":"303564","_id":"25548C20-B435-11E9-9278-68D0E5697425","name":"Microbial Ion Channels for Synthetic Neurobiology"},{"call_identifier":"FWF","grant_number":"W1232-B24","name":"Molecular Drug Targets","_id":"255A6082-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","date_created":"2019-02-14T10:50:24Z","intvolume":"         9","citation":{"apa":"Morri, M., Sanchez-Romero, I., Tichy, A.-M., Kainrath, S., Gerrard, E. J., Hirschfeld, P., … Janovjak, H. L. (2018). Optical functionalization of human class A orphan G-protein-coupled receptors. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-018-04342-1\">https://doi.org/10.1038/s41467-018-04342-1</a>","mla":"Morri, Maurizio, et al. “Optical Functionalization of Human Class A Orphan G-Protein-Coupled Receptors.” <i>Nature Communications</i>, vol. 9, no. 1, 1950, Springer Nature, 2018, doi:<a href=\"https://doi.org/10.1038/s41467-018-04342-1\">10.1038/s41467-018-04342-1</a>.","ieee":"M. Morri <i>et al.</i>, “Optical functionalization of human class A orphan G-protein-coupled receptors,” <i>Nature Communications</i>, vol. 9, no. 1. Springer Nature, 2018.","ama":"Morri M, Sanchez-Romero I, Tichy A-M, et al. Optical functionalization of human class A orphan G-protein-coupled receptors. <i>Nature Communications</i>. 2018;9(1). doi:<a href=\"https://doi.org/10.1038/s41467-018-04342-1\">10.1038/s41467-018-04342-1</a>","chicago":"Morri, Maurizio, Inmaculada Sanchez-Romero, Alexandra-Madelaine Tichy, Stephanie Kainrath, Elliot J. Gerrard, Priscila Hirschfeld, Jan Schwarz, and Harald L Janovjak. “Optical Functionalization of Human Class A Orphan G-Protein-Coupled Receptors.” <i>Nature Communications</i>. Springer Nature, 2018. <a href=\"https://doi.org/10.1038/s41467-018-04342-1\">https://doi.org/10.1038/s41467-018-04342-1</a>.","short":"M. Morri, I. Sanchez-Romero, A.-M. Tichy, S. Kainrath, E.J. Gerrard, P. Hirschfeld, J. Schwarz, H.L. Janovjak, Nature Communications 9 (2018).","ista":"Morri M, Sanchez-Romero I, Tichy A-M, Kainrath S, Gerrard EJ, Hirschfeld P, Schwarz J, Janovjak HL. 2018. Optical functionalization of human class A orphan G-protein-coupled receptors. Nature Communications. 9(1), 1950."},"volume":9,"has_accepted_license":"1","quality_controlled":"1","abstract":[{"lang":"eng","text":"G-protein-coupled receptors (GPCRs) form the largest receptor family, relay environmental stimuli to changes in cell behavior and represent prime drug targets. Many GPCRs are classified as orphan receptors because of the limited knowledge on their ligands and coupling to cellular signaling machineries. Here, we engineer a library of 63 chimeric receptors that contain the signaling domains of human orphan and understudied GPCRs functionally linked to the light-sensing domain of rhodopsin. Upon stimulation with visible light, we identify activation of canonical cell signaling pathways, including cAMP-, Ca2+-, MAPK/ERK-, and Rho-dependent pathways, downstream of the engineered receptors. For the human pseudogene GPR33, we resurrect a signaling function that supports its hypothesized role as a pathogen entry site. These results demonstrate that substituting unknown chemical activators with a light switch can reveal information about protein function and provide an optically controlled protein library for exploring the physiology and therapeutic potential of understudied GPCRs."}],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2023-09-19T14:29:32Z","department":[{"_id":"HaJa"},{"_id":"CaGu"},{"_id":"MiSi"}],"publisher":"Springer Nature"},{"oa_version":"Published Version","doi":"10.1093/gbe/evy037","publication_identifier":{"issn":["1759-6653"]},"file":[{"file_name":"2018_GBE_Kincaid_Smith.pdf","access_level":"open_access","date_updated":"2020-07-14T12:47:15Z","file_id":"5991","checksum":"736a459cb77de5824354466bb0331caf","content_type":"application/pdf","relation":"main_file","creator":"dernst","file_size":529755,"date_created":"2019-02-14T12:20:01Z"}],"external_id":{"isi":["000429483700013"]},"scopus_import":"1","issue":"3","oa":1,"day":"01","status":"public","ddc":["570"],"license":"https://creativecommons.org/licenses/by-nc/4.0/","date_published":"2018-03-01T00:00:00Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication":"Genome Biology and Evolution","language":[{"iso":"eng"}],"title":"Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites","article_processing_charge":"No","file_date_updated":"2020-07-14T12:47:15Z","publisher":"Oxford University Press","department":[{"_id":"BeVi"}],"date_updated":"2023-09-19T14:39:08Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"abstract":[{"text":"Schistosomes are the causative agents of schistosomiasis, a neglected tropical disease affecting over 230 million people worldwide.Additionally to their major impact on human health, they are also models of choice in evolutionary biology. These parasitic flatwormsare unique among the common hermaphroditic trematodes as they have separate sexes. This so-called “evolutionary scandal”displays a female heterogametic genetic sex-determination system (ZZ males and ZW females), as well as a pronounced adult sexualdimorphism. These phenotypic differences are determined by a shared set of genes in both sexes, potentially leading to intralocussexual conflicts. To resolve these conflicts in sexually selected traits, molecular mechanisms such as sex-biased gene expression couldoccur, but parent-of-origin gene expression also provides an alternative. In this work we investigated the latter mechanism, that is,genes expressed preferentially from either the maternal or the paternal allele, inSchistosoma mansonispecies. To this end, tran-scriptomes from male and female hybrid adults obtained by strain crosses were sequenced. Strain-specific single nucleotide poly-morphism (SNP) markers allowed us to discriminate the parental origin, while reciprocal crosses helped to differentiate parentalexpression from strain-specific expression. We identified genes containing SNPs expressed in a parent-of-origin manner consistentwith paternal and maternal imprints. Although the majority of the SNPs was identified in mitochondrial and Z-specific loci, theremaining SNPs found in male and female transcriptomes were situated in genes that have the potential to explain sexual differencesin schistosome parasites. Furthermore, we identified and validated four new Z-specific scaffolds.","lang":"eng"}],"quality_controlled":"1","has_accepted_license":"1","volume":10,"citation":{"ista":"Kincaid-Smith J, Picard MAL, Cosseau C, Boissier J, Severac D, Grunau C, Toulza E. 2018. Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites. Genome Biology and Evolution. 10(3), 840–856.","ama":"Kincaid-Smith J, Picard MAL, Cosseau C, et al. Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites. <i>Genome Biology and Evolution</i>. 2018;10(3):840-856. doi:<a href=\"https://doi.org/10.1093/gbe/evy037\">10.1093/gbe/evy037</a>","chicago":"Kincaid-Smith, Julien, Marion A L Picard, Céline Cosseau, Jérôme Boissier, Dany Severac, Christoph Grunau, and Eve Toulza. “Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites.” <i>Genome Biology and Evolution</i>. Oxford University Press, 2018. <a href=\"https://doi.org/10.1093/gbe/evy037\">https://doi.org/10.1093/gbe/evy037</a>.","ieee":"J. Kincaid-Smith <i>et al.</i>, “Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites,” <i>Genome Biology and Evolution</i>, vol. 10, no. 3. Oxford University Press, pp. 840–856, 2018.","short":"J. Kincaid-Smith, M.A.L. Picard, C. Cosseau, J. Boissier, D. Severac, C. Grunau, E. Toulza, Genome Biology and Evolution 10 (2018) 840–856.","mla":"Kincaid-Smith, Julien, et al. “Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites.” <i>Genome Biology and Evolution</i>, vol. 10, no. 3, Oxford University Press, 2018, pp. 840–56, doi:<a href=\"https://doi.org/10.1093/gbe/evy037\">10.1093/gbe/evy037</a>.","apa":"Kincaid-Smith, J., Picard, M. A. L., Cosseau, C., Boissier, J., Severac, D., Grunau, C., &#38; Toulza, E. (2018). Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites. <i>Genome Biology and Evolution</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/gbe/evy037\">https://doi.org/10.1093/gbe/evy037</a>"},"page":"840-856","intvolume":"        10","date_created":"2019-02-14T12:13:52Z","publication_status":"published","isi":1,"month":"03","author":[{"last_name":"Kincaid-Smith","first_name":"Julien","full_name":"Kincaid-Smith, Julien"},{"id":"2C921A7A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8101-2518","last_name":"Picard","first_name":"Marion A L","full_name":"Picard, Marion A L"},{"last_name":"Cosseau","first_name":"Céline","full_name":"Cosseau, Céline"},{"last_name":"Boissier","first_name":"Jérôme","full_name":"Boissier, Jérôme"},{"last_name":"Severac","first_name":"Dany","full_name":"Severac, Dany"},{"full_name":"Grunau, Christoph","first_name":"Christoph","last_name":"Grunau"},{"first_name":"Eve","last_name":"Toulza","full_name":"Toulza, Eve"}],"type":"journal_article","_id":"5989","year":"2018"},{"day":"02","oa":1,"doi":"10.1002/adma.201802257","oa_version":"Preprint","publication_identifier":{"issn":["0935-9648"]},"issue":"44","scopus_import":"1","external_id":{"arxiv":["1809.08487"],"isi":["000450232800015"]},"language":[{"iso":"eng"}],"publication":"Advanced Materials","arxiv":1,"title":"Josephson effect in a few-hole quantum dot","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.08487"}],"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_published":"2018-11-02T00:00:00Z","abstract":[{"lang":"eng","text":"A Ge–Si core–shell nanowire is used to realize a Josephson field‐effect transistor with highly transparent contacts to superconducting leads. By changing the electric field, access to two distinct regimes, not combined before in a single device, is gained: in the accumulation mode the device is highly transparent and the supercurrent is carried by multiple subbands, while near depletion, the supercurrent is carried by single‐particle levels of a strongly coupled quantum dot operating in the few‐hole regime. These results establish Ge–Si nanowires as an important platform for hybrid superconductor–semiconductor physics and Majorana fermions."}],"date_updated":"2023-09-19T14:29:58Z","quality_controlled":"1","volume":30,"citation":{"chicago":"Ridderbos, Joost, Matthias Brauns, Jie Shen, Folkert K. de Vries, Ang Li, Erik P. A. M. Bakkers, Alexander Brinkman, and Floris A. Zwanenburg. “Josephson Effect in a Few-Hole Quantum Dot.” <i>Advanced Materials</i>. Wiley, 2018. <a href=\"https://doi.org/10.1002/adma.201802257\">https://doi.org/10.1002/adma.201802257</a>.","short":"J. Ridderbos, M. Brauns, J. Shen, F.K. de Vries, A. Li, E.P.A.M. Bakkers, A. Brinkman, F.A. Zwanenburg, Advanced Materials 30 (2018).","ama":"Ridderbos J, Brauns M, Shen J, et al. Josephson effect in a few-hole quantum dot. <i>Advanced Materials</i>. 2018;30(44). doi:<a href=\"https://doi.org/10.1002/adma.201802257\">10.1002/adma.201802257</a>","ieee":"J. Ridderbos <i>et al.</i>, “Josephson effect in a few-hole quantum dot,” <i>Advanced Materials</i>, vol. 30, no. 44. Wiley, 2018.","apa":"Ridderbos, J., Brauns, M., Shen, J., de Vries, F. K., Li, A., Bakkers, E. P. A. M., … Zwanenburg, F. A. (2018). Josephson effect in a few-hole quantum dot. <i>Advanced Materials</i>. Wiley. <a href=\"https://doi.org/10.1002/adma.201802257\">https://doi.org/10.1002/adma.201802257</a>","mla":"Ridderbos, Joost, et al. “Josephson Effect in a Few-Hole Quantum Dot.” <i>Advanced Materials</i>, vol. 30, no. 44, 1802257, Wiley, 2018, doi:<a href=\"https://doi.org/10.1002/adma.201802257\">10.1002/adma.201802257</a>.","ista":"Ridderbos J, Brauns M, Shen J, de Vries FK, Li A, Bakkers EPAM, Brinkman A, Zwanenburg FA. 2018. Josephson effect in a few-hole quantum dot. Advanced Materials. 30(44), 1802257."},"publisher":"Wiley","department":[{"_id":"GeKa"}],"article_number":"1802257","type":"journal_article","year":"2018","_id":"5990","intvolume":"        30","date_created":"2019-02-14T12:14:26Z","month":"11","isi":1,"publication_status":"published","author":[{"full_name":"Ridderbos, Joost","last_name":"Ridderbos","first_name":"Joost"},{"id":"33F94E3C-F248-11E8-B48F-1D18A9856A87","last_name":"Brauns","first_name":"Matthias","full_name":"Brauns, Matthias"},{"last_name":"Shen","first_name":"Jie","full_name":"Shen, Jie"},{"first_name":"Folkert K.","last_name":"de Vries","full_name":"de Vries, Folkert K."},{"full_name":"Li, Ang","last_name":"Li","first_name":"Ang"},{"first_name":"Erik P. A. M.","last_name":"Bakkers","full_name":"Bakkers, Erik P. A. M."},{"first_name":"Alexander","last_name":"Brinkman","full_name":"Brinkman, Alexander"},{"first_name":"Floris A.","last_name":"Zwanenburg","full_name":"Zwanenburg, Floris A."}]},{"abstract":[{"lang":"eng","text":"Lamellipodia are flat membrane protrusions formed during mesenchymal motion. Polymerization at the leading edge assembles the actin filament network and generates protrusion force. How this force is supported by the network and how the assembly rate is shared between protrusion and network retrograde flow determines the protrusion rate. We use mathematical modeling to understand experiments changing the F-actin density in lamellipodia of B16-F1 melanoma cells by modulation of Arp2/3 complex activity or knockout of the formins FMNL2 and FMNL3. Cells respond to a reduction of density with a decrease of protrusion velocity, an increase in the ratio of force to filament number, but constant network assembly rate. The relation between protrusion force and tension gradient in the F-actin network and the density dependency of friction, elasticity, and viscosity of the network explain the experimental observations. The formins act as filament nucleators and elongators with differential rates. Modulation of their activity suggests an effect on network assembly rate. Contrary to these expectations, the effect of changes in elongator composition is much weaker than the consequences of the density change. We conclude that the force acting on the leading edge membrane is the force required to drive F-actin network retrograde flow."}],"tmp":{"short":"CC BY-NC-SA (4.0)","image":"/images/cc_by_nc_sa.png","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode"},"date_updated":"2023-09-19T14:30:23Z","has_accepted_license":"1","quality_controlled":"1","page":"2674-2686","citation":{"ama":"Dolati S, Kage F, Mueller J, et al. On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility. <i>Molecular Biology of the Cell</i>. 2018;29(22):2674-2686. doi:<a href=\"https://doi.org/10.1091/mbc.e18-02-0082\">10.1091/mbc.e18-02-0082</a>","ieee":"S. Dolati <i>et al.</i>, “On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility,” <i>Molecular Biology of the Cell</i>, vol. 29, no. 22. American Society for Cell Biology , pp. 2674–2686, 2018.","short":"S. Dolati, F. Kage, J. Mueller, M. Müsken, M. Kirchner, G. Dittmar, M.K. Sixt, K. Rottner, M. Falcke, Molecular Biology of the Cell 29 (2018) 2674–2686.","chicago":"Dolati, Setareh, Frieda Kage, Jan Mueller, Mathias Müsken, Marieluise Kirchner, Gunnar Dittmar, Michael K Sixt, Klemens Rottner, and Martin Falcke. “On the Relation between Filament Density, Force Generation, and Protrusion Rate in Mesenchymal Cell Motility.” <i>Molecular Biology of the Cell</i>. American Society for Cell Biology , 2018. <a href=\"https://doi.org/10.1091/mbc.e18-02-0082\">https://doi.org/10.1091/mbc.e18-02-0082</a>.","apa":"Dolati, S., Kage, F., Mueller, J., Müsken, M., Kirchner, M., Dittmar, G., … Falcke, M. (2018). On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility. <i>Molecular Biology of the Cell</i>. American Society for Cell Biology . <a href=\"https://doi.org/10.1091/mbc.e18-02-0082\">https://doi.org/10.1091/mbc.e18-02-0082</a>","mla":"Dolati, Setareh, et al. “On the Relation between Filament Density, Force Generation, and Protrusion Rate in Mesenchymal Cell Motility.” <i>Molecular Biology of the Cell</i>, vol. 29, no. 22, American Society for Cell Biology , 2018, pp. 2674–86, doi:<a href=\"https://doi.org/10.1091/mbc.e18-02-0082\">10.1091/mbc.e18-02-0082</a>.","ista":"Dolati S, Kage F, Mueller J, Müsken M, Kirchner M, Dittmar G, Sixt MK, Rottner K, Falcke M. 2018. On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility. Molecular Biology of the Cell. 29(22), 2674–2686."},"volume":29,"pmid":1,"publisher":"American Society for Cell Biology ","department":[{"_id":"MiSi"}],"type":"journal_article","year":"2018","_id":"5992","intvolume":"        29","date_created":"2019-02-14T12:25:47Z","isi":1,"month":"11","publication_status":"published","author":[{"last_name":"Dolati","first_name":"Setareh","full_name":"Dolati, Setareh"},{"full_name":"Kage, Frieda","last_name":"Kage","first_name":"Frieda"},{"last_name":"Mueller","first_name":"Jan","full_name":"Mueller, Jan"},{"first_name":"Mathias","last_name":"Müsken","full_name":"Müsken, Mathias"},{"last_name":"Kirchner","first_name":"Marieluise","full_name":"Kirchner, Marieluise"},{"last_name":"Dittmar","first_name":"Gunnar","full_name":"Dittmar, Gunnar"},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","last_name":"Sixt","first_name":"Michael K"},{"last_name":"Rottner","first_name":"Klemens","full_name":"Rottner, Klemens"},{"full_name":"Falcke, Martin","first_name":"Martin","last_name":"Falcke"}],"day":"01","oa":1,"doi":"10.1091/mbc.e18-02-0082","oa_version":"Published Version","file":[{"creator":"kschuh","file_size":6668971,"date_created":"2019-02-14T12:34:29Z","file_name":"2018_ASCB_Dolati.pdf","date_updated":"2020-07-14T12:47:15Z","access_level":"open_access","file_id":"5994","checksum":"e98465b4416b3e804c47f40086932af2","relation":"main_file","content_type":"application/pdf"}],"publication_identifier":{"eissn":["1939-4586"]},"issue":"22","scopus_import":"1","external_id":{"isi":["000455641000011"],"pmid":["30156465"]},"language":[{"iso":"eng"}],"publication":"Molecular Biology of the Cell","article_processing_charge":"No","title":"On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility","file_date_updated":"2020-07-14T12:47:15Z","status":"public","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","ddc":["570"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_published":"2018-11-01T00:00:00Z"},{"abstract":[{"lang":"eng","text":"In this article, we consider the termination problem of probabilistic programs with real-valued variables. Thequestions concerned are: qualitative ones that ask (i) whether the program terminates with probability 1(almost-sure termination) and (ii) whether the expected termination time is finite (finite termination); andquantitative ones that ask (i) to approximate the expected termination time (expectation problem) and (ii) tocompute a boundBsuch that the probability not to terminate afterBsteps decreases exponentially (con-centration problem). To solve these questions, we utilize the notion of ranking supermartingales, which isa powerful approach for proving termination of probabilistic programs. In detail, we focus on algorithmicsynthesis of linear ranking-supermartingales over affine probabilistic programs (Apps) with both angelic anddemonic non-determinism. An important subclass of Apps is LRApp which is defined as the class of all Appsover which a linear ranking-supermartingale exists.Our main contributions are as follows. Firstly, we show that the membership problem of LRApp (i) canbe decided in polynomial time for Apps with at most demonic non-determinism, and (ii) isNP-hard and inPSPACEfor Apps with angelic non-determinism. Moreover, theNP-hardness result holds already for Appswithout probability and demonic non-determinism. Secondly, we show that the concentration problem overLRApp can be solved in the same complexity as for the membership problem of LRApp. Finally, we show thatthe expectation problem over LRApp can be solved in2EXPTIMEand isPSPACE-hard even for Apps withoutprobability and non-determinism (i.e., deterministic programs). Our experimental results demonstrate theeffectiveness of our approach to answer the qualitative and quantitative questions over Apps with at mostdemonic non-determinism."}],"date_updated":"2023-09-19T14:38:42Z","quality_controlled":"1","citation":{"apa":"Chatterjee, K., Fu, H., Novotný, P., &#38; Hasheminezhad, R. (2018). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. <i>ACM Transactions on Programming Languages and Systems</i>. Association for Computing Machinery (ACM). <a href=\"https://doi.org/10.1145/3174800\">https://doi.org/10.1145/3174800</a>","mla":"Chatterjee, Krishnendu, et al. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 40, no. 2, 7, Association for Computing Machinery (ACM), 2018, doi:<a href=\"https://doi.org/10.1145/3174800\">10.1145/3174800</a>.","ama":"Chatterjee K, Fu H, Novotný P, Hasheminezhad R. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. <i>ACM Transactions on Programming Languages and Systems</i>. 2018;40(2). doi:<a href=\"https://doi.org/10.1145/3174800\">10.1145/3174800</a>","chicago":"Chatterjee, Krishnendu, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.” <i>ACM Transactions on Programming Languages and Systems</i>. Association for Computing Machinery (ACM), 2018. <a href=\"https://doi.org/10.1145/3174800\">https://doi.org/10.1145/3174800</a>.","ieee":"K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, “Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs,” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 40, no. 2. Association for Computing Machinery (ACM), 2018.","short":"K. Chatterjee, H. Fu, P. Novotný, R. Hasheminezhad, ACM Transactions on Programming Languages and Systems 40 (2018).","ista":"Chatterjee K, Fu H, Novotný P, Hasheminezhad R. 2018. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems. 40(2), 7."},"volume":40,"publisher":"Association for Computing Machinery (ACM)","department":[{"_id":"KrCh"}],"article_number":"7","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1438"}]},"type":"journal_article","year":"2018","_id":"5993","intvolume":"        40","date_created":"2019-02-14T12:29:10Z","month":"06","isi":1,"ec_funded":1,"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF"},{"grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7"}],"publication_status":"published","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","full_name":"Fu, Hongfei","last_name":"Fu","first_name":"Hongfei"},{"full_name":"Novotný, Petr","first_name":"Petr","last_name":"Novotný","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hasheminezhad, Rouzbeh","first_name":"Rouzbeh","last_name":"Hasheminezhad"}],"day":"01","oa":1,"doi":"10.1145/3174800","oa_version":"Submitted Version","publication_identifier":{"issn":["0164-0925"]},"scopus_import":"1","issue":"2","external_id":{"isi":["000434634500003"],"arxiv":["1510.08517"]},"language":[{"iso":"eng"}],"publication":"ACM Transactions on Programming Languages and Systems","arxiv":1,"title":"Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1510.08517"}],"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_published":"2018-06-01T00:00:00Z"},{"type":"journal_article","year":"2018","_id":"5995","intvolume":"        34","date_created":"2019-02-14T12:48:00Z","isi":1,"ec_funded":1,"month":"11","publication_status":"published","project":[{"name":"Systematic investigation of epistasis in molecular evolution","_id":"26120F5C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"335980"}],"author":[{"full_name":"Usmanova, Dinara R","first_name":"Dinara R","last_name":"Usmanova"},{"full_name":"Bogatyreva, Natalya S","last_name":"Bogatyreva","first_name":"Natalya S"},{"full_name":"Ariño Bernad, Joan","last_name":"Ariño Bernad","first_name":"Joan"},{"first_name":"Aleksandra A","last_name":"Eremina","full_name":"Eremina, Aleksandra A"},{"full_name":"Gorshkova, Anastasiya A","first_name":"Anastasiya A","last_name":"Gorshkova"},{"first_name":"German M","last_name":"Kanevskiy","full_name":"Kanevskiy, German M"},{"full_name":"Lonishin, Lyubov R","last_name":"Lonishin","first_name":"Lyubov R"},{"full_name":"Meister, Alexander V","first_name":"Alexander V","last_name":"Meister"},{"full_name":"Yakupova, Alisa G","last_name":"Yakupova","first_name":"Alisa G"},{"orcid":"0000-0001-8243-4694","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","full_name":"Kondrashov, Fyodor","first_name":"Fyodor","last_name":"Kondrashov"},{"last_name":"Ivankov","first_name":"Dmitry","full_name":"Ivankov, Dmitry","id":"49FF1036-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"text":"Motivation\r\nComputational prediction of the effect of mutations on protein stability is used by researchers in many fields. The utility of the prediction methods is affected by their accuracy and bias. Bias, a systematic shift of the predicted change of stability, has been noted as an issue for several methods, but has not been investigated systematically. Presence of the bias may lead to misleading results especially when exploring the effects of combination of different mutations.\r\n\r\nResults\r\nHere we use a protocol to measure the bias as a function of the number of introduced mutations. It is based on a self-consistency test of the reciprocity the effect of a mutation. An advantage of the used approach is that it relies solely on crystal structures without experimentally measured stability values. We applied the protocol to four popular algorithms predicting change of protein stability upon mutation, FoldX, Eris, Rosetta and I-Mutant, and found an inherent bias. For one program, FoldX, we manage to substantially reduce the bias using additional relaxation by Modeller. Authors using algorithms for predicting effects of mutations should be aware of the bias described here.","lang":"eng"}],"date_updated":"2023-09-19T14:31:13Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"has_accepted_license":"1","quality_controlled":"1","citation":{"ista":"Usmanova DR, Bogatyreva NS, Ariño Bernad J, Eremina AA, Gorshkova AA, Kanevskiy GM, Lonishin LR, Meister AV, Yakupova AG, Kondrashov F, Ivankov D. 2018. Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation. Bioinformatics. 34(21), 3653–3658.","mla":"Usmanova, Dinara R., et al. “Self-Consistency Test Reveals Systematic Bias in Programs for Prediction Change of Stability upon Mutation.” <i>Bioinformatics</i>, vol. 34, no. 21, Oxford University Press , 2018, pp. 3653–58, doi:<a href=\"https://doi.org/10.1093/bioinformatics/bty340\">10.1093/bioinformatics/bty340</a>.","apa":"Usmanova, D. R., Bogatyreva, N. S., Ariño Bernad, J., Eremina, A. A., Gorshkova, A. A., Kanevskiy, G. M., … Ivankov, D. (2018). Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation. <i>Bioinformatics</i>. Oxford University Press . <a href=\"https://doi.org/10.1093/bioinformatics/bty340\">https://doi.org/10.1093/bioinformatics/bty340</a>","chicago":"Usmanova, Dinara R, Natalya S Bogatyreva, Joan Ariño Bernad, Aleksandra A Eremina, Anastasiya A Gorshkova, German M Kanevskiy, Lyubov R Lonishin, et al. “Self-Consistency Test Reveals Systematic Bias in Programs for Prediction Change of Stability upon Mutation.” <i>Bioinformatics</i>. Oxford University Press , 2018. <a href=\"https://doi.org/10.1093/bioinformatics/bty340\">https://doi.org/10.1093/bioinformatics/bty340</a>.","ieee":"D. R. Usmanova <i>et al.</i>, “Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation,” <i>Bioinformatics</i>, vol. 34, no. 21. Oxford University Press , pp. 3653–3658, 2018.","short":"D.R. Usmanova, N.S. Bogatyreva, J. Ariño Bernad, A.A. Eremina, A.A. Gorshkova, G.M. Kanevskiy, L.R. Lonishin, A.V. Meister, A.G. Yakupova, F. Kondrashov, D. Ivankov, Bioinformatics 34 (2018) 3653–3658.","ama":"Usmanova DR, Bogatyreva NS, Ariño Bernad J, et al. Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation. <i>Bioinformatics</i>. 2018;34(21):3653-3658. doi:<a href=\"https://doi.org/10.1093/bioinformatics/bty340\">10.1093/bioinformatics/bty340</a>"},"page":"3653-3658","volume":34,"pmid":1,"publisher":"Oxford University Press ","department":[{"_id":"FyKo"}],"language":[{"iso":"eng"}],"publication":"Bioinformatics","title":"Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation","article_processing_charge":"No","file_date_updated":"2020-07-14T12:47:15Z","status":"public","ddc":["570"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_published":"2018-11-01T00:00:00Z","day":"01","oa":1,"doi":"10.1093/bioinformatics/bty340","oa_version":"Published Version","file":[{"file_name":"2018_Oxford_Usmanova.pdf","relation":"main_file","content_type":"application/pdf","file_id":"5997","checksum":"7e0495153f44211479674601d7f6ee03","access_level":"open_access","date_updated":"2020-07-14T12:47:15Z","creator":"kschuh","date_created":"2019-02-14T13:00:55Z","file_size":291969}],"publication_identifier":{"issn":["1367-4803","1460-2059"]},"issue":"21","scopus_import":"1","external_id":{"pmid":["29722803"],"isi":["000450038900008"]}},{"publication_identifier":{"eissn":["1469-7645"],"issn":["0022-1120"]},"external_id":{"isi":["000437858300003"],"arxiv":["1709.06372"]},"scopus_import":"1","oa_version":"Preprint","doi":"10.1017/jfm.2017.923","oa":1,"day":"25","acknowledgement":" We  also  thank  Philipp  Maier  and  the  IST  Austria  workshop  for  theirdedicated technical support","date_published":"2018-03-25T00:00:00Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_type":"original","status":"public","main_file_link":[{"url":"https://arxiv.org/abs/1709.06372","open_access":"1"}],"publication":"Journal of Fluid Mechanics","language":[{"iso":"eng"}],"article_processing_charge":"No","title":"The critical point of the transition to turbulence in pipe flow","arxiv":1,"department":[{"_id":"BjHo"}],"publisher":"Cambridge University Press","volume":839,"page":"76-94","citation":{"ista":"Vasudevan M, Hof B. 2018. The critical point of the transition to turbulence in pipe flow. Journal of Fluid Mechanics. 839, 76–94.","short":"M. Vasudevan, B. Hof, Journal of Fluid Mechanics 839 (2018) 76–94.","ama":"Vasudevan M, Hof B. The critical point of the transition to turbulence in pipe flow. <i>Journal of Fluid Mechanics</i>. 2018;839:76-94. doi:<a href=\"https://doi.org/10.1017/jfm.2017.923\">10.1017/jfm.2017.923</a>","chicago":"Vasudevan, Mukund, and Björn Hof. “The Critical Point of the Transition to Turbulence in Pipe Flow.” <i>Journal of Fluid Mechanics</i>. Cambridge University Press, 2018. <a href=\"https://doi.org/10.1017/jfm.2017.923\">https://doi.org/10.1017/jfm.2017.923</a>.","ieee":"M. Vasudevan and B. Hof, “The critical point of the transition to turbulence in pipe flow,” <i>Journal of Fluid Mechanics</i>, vol. 839. Cambridge University Press, pp. 76–94, 2018.","mla":"Vasudevan, Mukund, and Björn Hof. “The Critical Point of the Transition to Turbulence in Pipe Flow.” <i>Journal of Fluid Mechanics</i>, vol. 839, Cambridge University Press, 2018, pp. 76–94, doi:<a href=\"https://doi.org/10.1017/jfm.2017.923\">10.1017/jfm.2017.923</a>.","apa":"Vasudevan, M., &#38; Hof, B. (2018). The critical point of the transition to turbulence in pipe flow. <i>Journal of Fluid Mechanics</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/jfm.2017.923\">https://doi.org/10.1017/jfm.2017.923</a>"},"date_updated":"2023-09-19T14:37:49Z","abstract":[{"lang":"eng","text":"In pipes, turbulence sets in despite the linear stability of the laminar Hagen–Poiseuille flow. The Reynolds number ( ) for which turbulence first appears in a given experiment – the ‘natural transition point’ – depends on imperfections of the set-up, or, more precisely, on the magnitude of finite amplitude perturbations. At onset, turbulence typically only occupies a certain fraction of the flow, and this fraction equally is found to differ from experiment to experiment. Despite these findings, Reynolds proposed that after sufficiently long times, flows may settle to steady conditions: below a critical velocity, flows should (regardless of initial conditions) always return to laminar, while above this velocity, eddying motion should persist. As will be shown, even in pipes several thousand diameters long, the spatio-temporal intermittent flow patterns observed at the end of the pipe strongly depend on the initial conditions, and there is no indication that different flow patterns would eventually settle to a (statistical) steady state. Exploiting the fact that turbulent puffs do not age (i.e. they are memoryless), we continuously recreate the puff sequence exiting the pipe at the pipe entrance, and in doing so introduce periodic boundary conditions for the puff pattern. This procedure allows us to study the evolution of the flow patterns for arbitrary long times, and we find that after times in excess of advective time units, indeed a statistical steady state is reached. Although the resulting flows remain spatio-temporally intermittent, puff splitting and decay rates eventually reach a balance, so that the turbulent fraction fluctuates around a well-defined level which only depends on . In accordance with Reynolds’ proposition, we find that at lower (here 2020), flows eventually always resume to laminar, while for higher ( ), turbulence persists. The critical point for pipe flow hence falls in the interval of $2020 , which is in very good agreement with the recently proposed value of . The latter estimate was based on single-puff statistics and entirely neglected puff interactions. Unlike in typical contact processes where such interactions strongly affect the percolation threshold, in pipe flow, the critical point is only marginally influenced. Interactions, on the other hand, are responsible for the approach to the statistical steady state. As shown, they strongly affect the resulting flow patterns, where they cause ‘puff clustering’, and these regions of large puff densities are observed to travel across the puff pattern in a wave-like fashion."}],"quality_controlled":"1","project":[{"_id":"25152F3A-B435-11E9-9278-68D0E5697425","name":"Decoding the complexity of turbulence at its origin","call_identifier":"FP7","grant_number":"306589"}],"publication_status":"published","ec_funded":1,"month":"03","isi":1,"author":[{"last_name":"Vasudevan","first_name":"Mukund","full_name":"Vasudevan, Mukund","id":"3C5A959A-F248-11E8-B48F-1D18A9856A87"},{"id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754","first_name":"Björn","last_name":"Hof","full_name":"Hof, Björn"}],"intvolume":"       839","date_created":"2019-02-14T12:50:50Z","type":"journal_article","_id":"5996","year":"2018"},{"isi":1,"month":"10","publication_status":"published","author":[{"orcid":"0000-0002-2340-7431","id":"39BDC62C-F248-11E8-B48F-1D18A9856A87","last_name":"Velicky","first_name":"Philipp","full_name":"Velicky, Philipp"},{"first_name":"Gudrun","last_name":"Meinhardt","full_name":"Meinhardt, Gudrun"},{"last_name":"Plessl","first_name":"Kerstin","full_name":"Plessl, Kerstin"},{"first_name":"Sigrid","last_name":"Vondra","full_name":"Vondra, Sigrid"},{"first_name":"Tamara","last_name":"Weiss","full_name":"Weiss, Tamara"},{"last_name":"Haslinger","first_name":"Peter","full_name":"Haslinger, Peter"},{"full_name":"Lendl, Thomas","first_name":"Thomas","last_name":"Lendl"},{"last_name":"Aumayr","first_name":"Karin","full_name":"Aumayr, Karin"},{"last_name":"Mairhofer","first_name":"Mario","full_name":"Mairhofer, Mario"},{"last_name":"Zhu","first_name":"Xiaowei","full_name":"Zhu, Xiaowei"},{"full_name":"Schütz, Birgit","last_name":"Schütz","first_name":"Birgit"},{"first_name":"Roberta L.","last_name":"Hannibal","full_name":"Hannibal, Roberta L."},{"full_name":"Lindau, Robert","first_name":"Robert","last_name":"Lindau"},{"full_name":"Weil, Beatrix","first_name":"Beatrix","last_name":"Weil"},{"full_name":"Ernerudh, Jan","last_name":"Ernerudh","first_name":"Jan"},{"last_name":"Neesen","first_name":"Jürgen","full_name":"Neesen, Jürgen"},{"last_name":"Egger","first_name":"Gerda","full_name":"Egger, Gerda"},{"last_name":"Mikula","first_name":"Mario","full_name":"Mikula, Mario"},{"full_name":"Röhrl, Clemens","first_name":"Clemens","last_name":"Röhrl"},{"full_name":"Urban, Alexander E.","last_name":"Urban","first_name":"Alexander E."},{"first_name":"Julie","last_name":"Baker","full_name":"Baker, Julie"},{"last_name":"Knöfler","first_name":"Martin","full_name":"Knöfler, Martin"},{"last_name":"Pollheimer","first_name":"Jürgen","full_name":"Pollheimer, Jürgen"}],"intvolume":"        14","date_created":"2019-02-14T13:07:45Z","article_number":"e1007698","type":"journal_article","_id":"5998","year":"2018","department":[{"_id":"JoDa"}],"publisher":"Public Library of Science","citation":{"apa":"Velicky, P., Meinhardt, G., Plessl, K., Vondra, S., Weiss, T., Haslinger, P., … Pollheimer, J. (2018). Genome amplification and cellular senescence are hallmarks of human placenta development. <i>PLOS Genetics</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pgen.1007698\">https://doi.org/10.1371/journal.pgen.1007698</a>","mla":"Velicky, Philipp, et al. “Genome Amplification and Cellular Senescence Are Hallmarks of Human Placenta Development.” <i>PLOS Genetics</i>, vol. 14, no. 10, e1007698, Public Library of Science, 2018, doi:<a href=\"https://doi.org/10.1371/journal.pgen.1007698\">10.1371/journal.pgen.1007698</a>.","chicago":"Velicky, Philipp, Gudrun Meinhardt, Kerstin Plessl, Sigrid Vondra, Tamara Weiss, Peter Haslinger, Thomas Lendl, et al. “Genome Amplification and Cellular Senescence Are Hallmarks of Human Placenta Development.” <i>PLOS Genetics</i>. Public Library of Science, 2018. <a href=\"https://doi.org/10.1371/journal.pgen.1007698\">https://doi.org/10.1371/journal.pgen.1007698</a>.","ama":"Velicky P, Meinhardt G, Plessl K, et al. Genome amplification and cellular senescence are hallmarks of human placenta development. <i>PLOS Genetics</i>. 2018;14(10). doi:<a href=\"https://doi.org/10.1371/journal.pgen.1007698\">10.1371/journal.pgen.1007698</a>","short":"P. Velicky, G. Meinhardt, K. Plessl, S. Vondra, T. Weiss, P. Haslinger, T. Lendl, K. Aumayr, M. Mairhofer, X. Zhu, B. Schütz, R.L. Hannibal, R. Lindau, B. Weil, J. Ernerudh, J. Neesen, G. Egger, M. Mikula, C. Röhrl, A.E. Urban, J. Baker, M. Knöfler, J. Pollheimer, PLOS Genetics 14 (2018).","ieee":"P. Velicky <i>et al.</i>, “Genome amplification and cellular senescence are hallmarks of human placenta development,” <i>PLOS Genetics</i>, vol. 14, no. 10. Public Library of Science, 2018.","ista":"Velicky P, Meinhardt G, Plessl K, Vondra S, Weiss T, Haslinger P, Lendl T, Aumayr K, Mairhofer M, Zhu X, Schütz B, Hannibal RL, Lindau R, Weil B, Ernerudh J, Neesen J, Egger G, Mikula M, Röhrl C, Urban AE, Baker J, Knöfler M, Pollheimer J. 2018. Genome amplification and cellular senescence are hallmarks of human placenta development. PLOS Genetics. 14(10), e1007698."},"volume":14,"abstract":[{"text":"Genome amplification and cellular senescence are commonly associated with pathological processes. While physiological roles for polyploidization and senescence have been described in mouse development, controversy exists over their significance in humans. Here, we describe tetraploidization and senescence as phenomena of normal human placenta development. During pregnancy, placental extravillous trophoblasts (EVTs) invade the pregnant endometrium, termed decidua, to establish an adapted microenvironment required for the developing embryo. This process is critically dependent on continuous cell proliferation and differentiation, which is thought to follow the classical model of cell cycle arrest prior to terminal differentiation. Strikingly, flow cytometry and DNAseq revealed that EVT formation is accompanied with a genome-wide polyploidization, independent of mitotic cycles. DNA replication in these cells was analysed by a fluorescent cell-cycle indicator reporter system, cell cycle marker expression and EdU incorporation. Upon invasion into the decidua, EVTs widely lose their replicative potential and enter a senescent state characterized by high senescence-associated (SA) β-galactosidase activity, induction of a SA secretory phenotype as well as typical metabolic alterations. Furthermore, we show that the shift from endocycle-dependent genome amplification to growth arrest is disturbed in androgenic complete hydatidiform moles (CHM), a hyperplastic pregnancy disorder associated with increased risk of developing choriocarinoma. Senescence is decreased in CHM-EVTs, accompanied by exacerbated endoreduplication and hyperploidy. We propose induction of cellular senescence as a ploidy-limiting mechanism during normal human placentation and unravel a link between excessive polyploidization and reduced senescence in CHM.","lang":"eng"}],"date_updated":"2023-09-19T14:31:43Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"quality_controlled":"1","has_accepted_license":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_published":"2018-10-12T00:00:00Z","status":"public","ddc":["570"],"file_date_updated":"2020-07-14T12:47:15Z","language":[{"iso":"eng"}],"publication":"PLOS Genetics","title":"Genome amplification and cellular senescence are hallmarks of human placenta development","article_processing_charge":"No","file":[{"file_size":4592947,"date_created":"2019-02-14T13:14:35Z","creator":"kschuh","checksum":"34aa9a5972f61889c19f18be8ee787a0","file_id":"6000","date_updated":"2020-07-14T12:47:15Z","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_name":"2018_PLOS_Velicky.pdf"}],"publication_identifier":{"issn":["1553-7404"]},"scopus_import":"1","issue":"10","external_id":{"isi":["000449328500025"]},"doi":"10.1371/journal.pgen.1007698","oa_version":"Published Version","day":"12","oa":1},{"publication":"Proceedings of the London Mathematical Society","language":[{"iso":"eng"}],"article_processing_charge":"No","title":"The cohomological Hall algebra of a preprojective algebra","arxiv":1,"main_file_link":[{"url":"https://arxiv.org/abs/1407.7994","open_access":"1"}],"status":"public","date_published":"2018-05-01T00:00:00Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"day":"01","oa_version":"Preprint","doi":"10.1112/plms.12111","publication_identifier":{"issn":["0024-6115"]},"external_id":{"isi":["000431506400001"],"arxiv":["1407.7994"]},"scopus_import":"1","issue":"5","type":"journal_article","year":"2018","_id":"5999","intvolume":"       116","date_created":"2019-02-14T13:14:22Z","publication_status":"published","isi":1,"month":"05","author":[{"first_name":"Yaping","last_name":"Yang","full_name":"Yang, Yaping"},{"id":"2BC2AC5E-F248-11E8-B48F-1D18A9856A87","first_name":"Gufang","last_name":"Zhao","full_name":"Zhao, Gufang"}],"date_updated":"2023-09-19T14:37:19Z","abstract":[{"text":"We introduce for each quiver Q and each algebraic oriented cohomology theory A, the cohomological Hall algebra (CoHA) of Q, as the A-homology of the moduli of representations of the preprojective algebra of Q. This generalizes the K-theoretic Hall algebra of commuting varieties defined by Schiffmann-Vasserot. When A is the Morava K-theory, we show evidence that this algebra is a candidate for Lusztig's reformulated conjecture on modular representations of algebraic groups.\r\nWe construct an action of the preprojective CoHA on the A-homology of Nakajima quiver varieties. We compare this with the action of the Borel subalgebra of Yangian when A is the intersection theory. We also give a shuffle algebra description of this CoHA in terms of the underlying formal group law of A. As applications, we obtain a shuffle description of the Yangian. ","lang":"eng"}],"quality_controlled":"1","citation":{"ista":"Yang Y, Zhao G. 2018. The cohomological Hall algebra of a preprojective algebra. Proceedings of the London Mathematical Society. 116(5), 1029–1074.","chicago":"Yang, Yaping, and Gufang Zhao. “The Cohomological Hall Algebra of a Preprojective Algebra.” <i>Proceedings of the London Mathematical Society</i>. Oxford University Press, 2018. <a href=\"https://doi.org/10.1112/plms.12111\">https://doi.org/10.1112/plms.12111</a>.","short":"Y. Yang, G. Zhao, Proceedings of the London Mathematical Society 116 (2018) 1029–1074.","ieee":"Y. Yang and G. Zhao, “The cohomological Hall algebra of a preprojective algebra,” <i>Proceedings of the London Mathematical Society</i>, vol. 116, no. 5. Oxford University Press, pp. 1029–1074, 2018.","ama":"Yang Y, Zhao G. The cohomological Hall algebra of a preprojective algebra. <i>Proceedings of the London Mathematical Society</i>. 2018;116(5):1029-1074. doi:<a href=\"https://doi.org/10.1112/plms.12111\">10.1112/plms.12111</a>","apa":"Yang, Y., &#38; Zhao, G. (2018). The cohomological Hall algebra of a preprojective algebra. <i>Proceedings of the London Mathematical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1112/plms.12111\">https://doi.org/10.1112/plms.12111</a>","mla":"Yang, Yaping, and Gufang Zhao. “The Cohomological Hall Algebra of a Preprojective Algebra.” <i>Proceedings of the London Mathematical Society</i>, vol. 116, no. 5, Oxford University Press, 2018, pp. 1029–74, doi:<a href=\"https://doi.org/10.1112/plms.12111\">10.1112/plms.12111</a>."},"volume":116,"page":"1029-1074","publisher":"Oxford University Press","department":[{"_id":"TaHa"}]},{"publist_id":"8050","quality_controlled":"1","date_updated":"2023-10-17T11:49:25Z","abstract":[{"lang":"eng","text":"Lesion and electrode location verification are traditionally done via histological examination of stained brain slices, a time-consuming procedure that requires manual estimation. Here, we describe a simple, straightforward method for quantifying lesions and locating electrodes in the brain that is less laborious and yields more detailed results. Whole brains are stained with osmium tetroxide, embedded in resin, and imaged with a micro-CT scanner. The scans result in 3D digital volumes of the brains with resolutions and virtual section thicknesses dependent on the sample size (12-15 and 5-6 µm per voxel for rat and zebra finch brains, respectively). Surface and deep lesions can be characterized, and single tetrodes, tetrode arrays, electrolytic lesions, and silicon probes can also be localized. Free and proprietary software allows experimenters to examine the sample volume from any plane and segment the volume manually or automatically. Because this method generates whole brain volume, lesions and electrodes can be quantified to a much higher degree than in current methods, which will help standardize comparisons within and across studies."}],"citation":{"ista":"Masís J, Mankus D, Wolff S, Guitchounts G, Jösch MA, Cox D. 2018. A micro-CT-based method for characterising lesions and locating electrodes in small animal brains. Journal of visualized experiments. 141.","apa":"Masís, J., Mankus, D., Wolff, S., Guitchounts, G., Jösch, M. A., &#38; Cox, D. (2018). A micro-CT-based method for characterising lesions and locating electrodes in small animal brains. <i>Journal of Visualized Experiments</i>. MyJove Corporation. <a href=\"https://doi.org/10.3791/58585\">https://doi.org/10.3791/58585</a>","mla":"Masís, Javier, et al. “A Micro-CT-Based Method for Characterising Lesions and Locating Electrodes in Small Animal Brains.” <i>Journal of Visualized Experiments</i>, vol. 141, MyJove Corporation, 2018, doi:<a href=\"https://doi.org/10.3791/58585\">10.3791/58585</a>.","short":"J. Masís, D. Mankus, S. Wolff, G. Guitchounts, M.A. Jösch, D. Cox, Journal of Visualized Experiments 141 (2018).","chicago":"Masís, Javier, David Mankus, Steffen Wolff, Grigori Guitchounts, Maximilian A Jösch, and David Cox. “A Micro-CT-Based Method for Characterising Lesions and Locating Electrodes in Small Animal Brains.” <i>Journal of Visualized Experiments</i>. MyJove Corporation, 2018. <a href=\"https://doi.org/10.3791/58585\">https://doi.org/10.3791/58585</a>.","ieee":"J. Masís, D. Mankus, S. Wolff, G. Guitchounts, M. A. Jösch, and D. Cox, “A micro-CT-based method for characterising lesions and locating electrodes in small animal brains,” <i>Journal of visualized experiments</i>, vol. 141. MyJove Corporation, 2018.","ama":"Masís J, Mankus D, Wolff S, Guitchounts G, Jösch MA, Cox D. A micro-CT-based method for characterising lesions and locating electrodes in small animal brains. <i>Journal of visualized experiments</i>. 2018;141. doi:<a href=\"https://doi.org/10.3791/58585\">10.3791/58585</a>"},"volume":141,"day":"08","oa_version":"None","publisher":"MyJove Corporation","doi":"10.3791/58585","external_id":{"isi":["000456469400103"]},"scopus_import":"1","department":[{"_id":"MaJö"}],"article_processing_charge":"No","title":"A micro-CT-based method for characterising lesions and locating electrodes in small animal brains","publication":"Journal of visualized experiments","language":[{"iso":"eng"}],"_id":"6","year":"2018","type":"journal_article","date_created":"2018-12-11T11:44:07Z","intvolume":"       141","status":"public","author":[{"last_name":"Masís","first_name":"Javier","full_name":"Masís, Javier"},{"full_name":"Mankus, David","last_name":"Mankus","first_name":"David"},{"last_name":"Wolff","first_name":"Steffen","full_name":"Wolff, Steffen"},{"full_name":"Guitchounts, Grigori","first_name":"Grigori","last_name":"Guitchounts"},{"id":"2BD278E6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3937-1330","last_name":"Jösch","first_name":"Maximilian A","full_name":"Jösch, Maximilian A"},{"full_name":"Cox, David","first_name":"David","last_name":"Cox"}],"publication_status":"published","date_published":"2018-11-08T00:00:00Z","isi":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"11"},{"title":"Introduction to model checking","publication":"Handbook of Model Checking","language":[{"iso":"eng"}],"_id":"60","year":"2018","type":"book_chapter","editor":[{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"date_created":"2018-12-11T11:44:25Z","status":"public","author":[{"first_name":"Edmund","last_name":"Clarke","full_name":"Clarke, Edmund"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Veith","first_name":"Helmut","full_name":"Veith, Helmut"}],"publication_status":"published","date_published":"2018-05-19T00:00:00Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"05","publist_id":"7994","quality_controlled":"1","date_updated":"2021-01-12T08:05:35Z","abstract":[{"text":"Model checking is a computer-assisted method for the analysis of dynamical systems that can be modeled by state-transition systems. Drawing from research traditions in mathematical logic, programming languages, hardware design, and theoretical computer science, model checking is now widely used for the verification of hardware and software in industry. This chapter is an introduction and short survey of model checking. The chapter aims to motivate and link the individual chapters of the handbook, and to provide context for readers who are not familiar with model checking.","lang":"eng"}],"citation":{"ista":"Clarke E, Henzinger TA, Veith H. 2018.Introduction to model checking. In: Handbook of Model Checking. , 1–26.","mla":"Clarke, Edmund, et al. “Introduction to Model Checking.” <i>Handbook of Model Checking</i>, edited by Thomas A Henzinger, Springer, 2018, pp. 1–26, doi:<a href=\"https://doi.org/10.1007/978-3-319-10575-8_1\">10.1007/978-3-319-10575-8_1</a>.","apa":"Clarke, E., Henzinger, T. A., &#38; Veith, H. (2018). Introduction to model checking. In T. A. Henzinger (Ed.), <i>Handbook of Model Checking</i> (pp. 1–26). Springer. <a href=\"https://doi.org/10.1007/978-3-319-10575-8_1\">https://doi.org/10.1007/978-3-319-10575-8_1</a>","short":"E. Clarke, T.A. Henzinger, H. Veith, in:, T.A. Henzinger (Ed.), Handbook of Model Checking, Springer, 2018, pp. 1–26.","ama":"Clarke E, Henzinger TA, Veith H. Introduction to model checking. In: Henzinger TA, ed. <i>Handbook of Model Checking</i>. Handbook of Model Checking. Springer; 2018:1-26. doi:<a href=\"https://doi.org/10.1007/978-3-319-10575-8_1\">10.1007/978-3-319-10575-8_1</a>","ieee":"E. Clarke, T. A. Henzinger, and H. Veith, “Introduction to model checking,” in <i>Handbook of Model Checking</i>, T. A. Henzinger, Ed. Springer, 2018, pp. 1–26.","chicago":"Clarke, Edmund, Thomas A Henzinger, and Helmut Veith. “Introduction to Model Checking.” In <i>Handbook of Model Checking</i>, edited by Thomas A Henzinger, 1–26. Handbook of Model Checking. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-10575-8_1\">https://doi.org/10.1007/978-3-319-10575-8_1</a>."},"page":"1 - 26","day":"19","oa_version":"None","publisher":"Springer","doi":"10.1007/978-3-319-10575-8_1","scopus_import":1,"department":[{"_id":"ToHe"}],"series_title":"Handbook of Model Checking"},{"doi":"10.1145/3201897","oa_version":"None","publisher":"Association for Computing Machinery","issue":"4","scopus_import":1,"department":[{"_id":"DaAl"}],"publication_identifier":{"issn":["2329-4949"]},"quality_controlled":"1","abstract":[{"text":"The concurrent memory reclamation problem is that of devising a way for a deallocating thread to verify that no other concurrent threads hold references to a memory block being deallocated. To date, in the absence of automatic garbage collection, there is no satisfactory solution to this problem; existing tracking methods like hazard pointers, reference counters, or epoch-based techniques like RCU are either prohibitively expensive or require significant programming expertise to the extent that implementing them efficiently can be worthy of a publication. None of the existing techniques are automatic or even semi-automated.\r\nIn this article, we take a new approach to concurrent memory reclamation. Instead of manually tracking access to memory locations as done in techniques like hazard pointers, or restricting shared accesses to specific epoch boundaries as in RCU, our algorithm, called ThreadScan, leverages operating system signaling to automatically detect which memory locations are being accessed by concurrent threads.\r\nInitial empirical evidence shows that ThreadScan scales surprisingly well and requires negligible programming effort beyond the standard use of Malloc and Free.","lang":"eng"}],"date_updated":"2023-02-23T13:17:54Z","day":"01","volume":4,"citation":{"ista":"Alistarh D-A, Leiserson W, Matveev A, Shavit N. 2018. ThreadScan: Automatic and scalable memory reclamation. ACM Transactions on Parallel Computing. 4(4), 18.","mla":"Alistarh, Dan-Adrian, et al. “ThreadScan: Automatic and Scalable Memory Reclamation.” <i>ACM Transactions on Parallel Computing</i>, vol. 4, no. 4, 18, Association for Computing Machinery, 2018, doi:<a href=\"https://doi.org/10.1145/3201897\">10.1145/3201897</a>.","apa":"Alistarh, D.-A., Leiserson, W., Matveev, A., &#38; Shavit, N. (2018). ThreadScan: Automatic and scalable memory reclamation. <i>ACM Transactions on Parallel Computing</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3201897\">https://doi.org/10.1145/3201897</a>","ieee":"D.-A. Alistarh, W. Leiserson, A. Matveev, and N. Shavit, “ThreadScan: Automatic and scalable memory reclamation,” <i>ACM Transactions on Parallel Computing</i>, vol. 4, no. 4. Association for Computing Machinery, 2018.","short":"D.-A. Alistarh, W. Leiserson, A. Matveev, N. Shavit, ACM Transactions on Parallel Computing 4 (2018).","chicago":"Alistarh, Dan-Adrian, William Leiserson, Alexander Matveev, and Nir Shavit. “ThreadScan: Automatic and Scalable Memory Reclamation.” <i>ACM Transactions on Parallel Computing</i>. Association for Computing Machinery, 2018. <a href=\"https://doi.org/10.1145/3201897\">https://doi.org/10.1145/3201897</a>.","ama":"Alistarh D-A, Leiserson W, Matveev A, Shavit N. ThreadScan: Automatic and scalable memory reclamation. <i>ACM Transactions on Parallel Computing</i>. 2018;4(4). doi:<a href=\"https://doi.org/10.1145/3201897\">10.1145/3201897</a>"},"date_created":"2019-02-14T13:24:11Z","status":"public","intvolume":"         4","author":[{"first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"},{"full_name":"Leiserson, William","first_name":"William","last_name":"Leiserson"},{"first_name":"Alexander","last_name":"Matveev","full_name":"Matveev, Alexander"},{"first_name":"Nir","last_name":"Shavit","full_name":"Shavit, Nir"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"09","publication_status":"published","date_published":"2018-09-01T00:00:00Z","title":"ThreadScan: Automatic and scalable memory reclamation","language":[{"iso":"eng"}],"publication":"ACM Transactions on Parallel Computing","_id":"6001","year":"2018","article_number":"18","related_material":{"record":[{"status":"public","id":"779","relation":"earlier_version"}]},"type":"journal_article"},{"department":[{"_id":"RoSe"}],"publisher":"Springer Nature","page":"1037-1090","citation":{"ista":"Napiórkowski MM, Reuvers R, Solovej JP. 2018. The Bogoliubov free energy functional I: Existence of minimizers and phase diagram. Archive for Rational Mechanics and Analysis. 229(3), 1037–1090.","mla":"Napiórkowski, Marcin M., et al. “The Bogoliubov Free Energy Functional I: Existence of Minimizers and Phase Diagram.” <i>Archive for Rational Mechanics and Analysis</i>, vol. 229, no. 3, Springer Nature, 2018, pp. 1037–90, doi:<a href=\"https://doi.org/10.1007/s00205-018-1232-6\">10.1007/s00205-018-1232-6</a>.","apa":"Napiórkowski, M. M., Reuvers, R., &#38; Solovej, J. P. (2018). The Bogoliubov free energy functional I: Existence of minimizers and phase diagram. <i>Archive for Rational Mechanics and Analysis</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00205-018-1232-6\">https://doi.org/10.1007/s00205-018-1232-6</a>","chicago":"Napiórkowski, Marcin M, Robin Reuvers, and Jan Philip Solovej. “The Bogoliubov Free Energy Functional I: Existence of Minimizers and Phase Diagram.” <i>Archive for Rational Mechanics and Analysis</i>. Springer Nature, 2018. <a href=\"https://doi.org/10.1007/s00205-018-1232-6\">https://doi.org/10.1007/s00205-018-1232-6</a>.","ama":"Napiórkowski MM, Reuvers R, Solovej JP. The Bogoliubov free energy functional I: Existence of minimizers and phase diagram. <i>Archive for Rational Mechanics and Analysis</i>. 2018;229(3):1037-1090. doi:<a href=\"https://doi.org/10.1007/s00205-018-1232-6\">10.1007/s00205-018-1232-6</a>","short":"M.M. Napiórkowski, R. Reuvers, J.P. Solovej, Archive for Rational Mechanics and Analysis 229 (2018) 1037–1090.","ieee":"M. M. Napiórkowski, R. Reuvers, and J. P. Solovej, “The Bogoliubov free energy functional I: Existence of minimizers and phase diagram,” <i>Archive for Rational Mechanics and Analysis</i>, vol. 229, no. 3. Springer Nature, pp. 1037–1090, 2018."},"volume":229,"quality_controlled":"1","abstract":[{"lang":"eng","text":"The Bogoliubov free energy functional is analysed. The functional serves as a model of a translation-invariant Bose gas at positive temperature. We prove the existence of minimizers in the case of repulsive interactions given by a sufficiently regular two-body potential. Furthermore, we prove the existence of a phase transition in this model and provide its phase diagram."}],"date_updated":"2023-09-19T14:33:12Z","author":[{"id":"4197AD04-F248-11E8-B48F-1D18A9856A87","first_name":"Marcin M","last_name":"Napiórkowski","full_name":"Napiórkowski, Marcin M"},{"first_name":"Robin","last_name":"Reuvers","full_name":"Reuvers, Robin"},{"full_name":"Solovej, Jan Philip","last_name":"Solovej","first_name":"Jan Philip"}],"month":"09","isi":1,"publication_status":"published","project":[{"call_identifier":"FWF","grant_number":"P27533_N27","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","_id":"25C878CE-B435-11E9-9278-68D0E5697425"}],"date_created":"2019-02-14T13:40:53Z","intvolume":"       229","year":"2018","_id":"6002","type":"journal_article","issue":"3","scopus_import":"1","external_id":{"isi":["000435367300003"],"arxiv":["1511.05935"]},"publication_identifier":{"issn":["0003-9527"],"eissn":["1432-0673"]},"doi":"10.1007/s00205-018-1232-6","oa_version":"Preprint","day":"01","oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_published":"2018-09-01T00:00:00Z","status":"public","main_file_link":[{"url":"https://arxiv.org/abs/1511.05935","open_access":"1"}],"arxiv":1,"article_processing_charge":"No","title":"The Bogoliubov free energy functional I: Existence of minimizers and phase diagram","language":[{"iso":"eng"}],"publication":"Archive for Rational Mechanics and Analysis"}]