[{"publication_identifier":{"eissn":["2010-3271"],"issn":["2010-3263"]},"author":[{"orcid":"0000-0001-5366-9603","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László","first_name":"László"},{"first_name":"Peter","full_name":"Mühlbacher, Peter","last_name":"Mühlbacher"}],"language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"lang":"eng","text":"We consider a Wigner-type ensemble, i.e. large hermitian N×N random matrices H=H∗ with centered independent entries and with a general matrix of variances Sxy=𝔼∣∣Hxy∣∣2. The norm of H is asymptotically given by the maximum of the support of the self-consistent density of states. We establish a bound on this maximum in terms of norms of powers of S that substantially improves the earlier bound 2∥S∥1/2∞ given in [O. Ajanki, L. Erdős and T. Krüger, Universality for general Wigner-type matrices, Prob. Theor. Rel. Fields169 (2017) 667–727]. The key element of the proof is an effective Markov chain approximation for the contributions of the weighted Dyck paths appearing in the iterative solution of the corresponding Dyson equation."}],"date_updated":"2023-09-19T14:24:05Z","article_processing_charge":"No","year":"2018","scopus_import":"1","title":"Bounds on the norm of Wigner-type random matrices","project":[{"grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems"}],"department":[{"_id":"LaEr"}],"_id":"5971","ec_funded":1,"publisher":"World Scientific Publishing","publication_status":"published","month":"09","arxiv":1,"quality_controlled":"1","type":"journal_article","date_created":"2019-02-13T10:40:54Z","citation":{"short":"L. Erdös, P. Mühlbacher, Random Matrices: Theory and Applications (2018).","ieee":"L. Erdös and P. Mühlbacher, “Bounds on the norm of Wigner-type random matrices,” <i>Random matrices: Theory and applications</i>. World Scientific Publishing, 2018.","chicago":"Erdös, László, and Peter Mühlbacher. “Bounds on the Norm of Wigner-Type Random Matrices.” <i>Random Matrices: Theory and Applications</i>. World Scientific Publishing, 2018. <a href=\"https://doi.org/10.1142/s2010326319500096\">https://doi.org/10.1142/s2010326319500096</a>.","ista":"Erdös L, Mühlbacher P. 2018. Bounds on the norm of Wigner-type random matrices. Random matrices: Theory and applications., 1950009.","ama":"Erdös L, Mühlbacher P. Bounds on the norm of Wigner-type random matrices. <i>Random matrices: Theory and applications</i>. 2018. doi:<a href=\"https://doi.org/10.1142/s2010326319500096\">10.1142/s2010326319500096</a>","mla":"Erdös, László, and Peter Mühlbacher. “Bounds on the Norm of Wigner-Type Random Matrices.” <i>Random Matrices: Theory and Applications</i>, 1950009, World Scientific Publishing, 2018, doi:<a href=\"https://doi.org/10.1142/s2010326319500096\">10.1142/s2010326319500096</a>.","apa":"Erdös, L., &#38; Mühlbacher, P. (2018). Bounds on the norm of Wigner-type random matrices. <i>Random Matrices: Theory and Applications</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/s2010326319500096\">https://doi.org/10.1142/s2010326319500096</a>"},"oa_version":"Preprint","publication":"Random matrices: Theory and applications","oa":1,"day":"26","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1802.05175"}],"external_id":{"isi":["000477677200002"],"arxiv":["1802.05175"]},"article_number":"1950009","isi":1,"date_published":"2018-09-26T00:00:00Z","doi":"10.1142/s2010326319500096","status":"public"},{"department":[{"_id":"VlKo"}],"project":[{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160"}],"page":"2029-2056","title":"Commutativity in the algorithmic Lovász local lemma","publication_status":"published","publisher":"Society for Industrial & Applied Mathematics (SIAM)","_id":"5975","ec_funded":1,"date_updated":"2023-09-19T14:24:58Z","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"lang":"eng","text":"We consider the recent formulation of the algorithmic Lov ́asz Local Lemma  [N. Har-vey and J. Vondr ́ak, inProceedings of FOCS, 2015, pp. 1327–1345; D. Achlioptas and F. Iliopoulos,inProceedings of SODA, 2016, pp. 2024–2038; D. Achlioptas, F. Iliopoulos, and V. Kolmogorov,ALocal Lemma for Focused Stochastic Algorithms, arXiv preprint, 2018] for finding objects that avoid“bad  features,”  or  “flaws.”   It  extends  the  Moser–Tardos  resampling  algorithm  [R.  A.  Moser  andG. Tardos,J. ACM, 57 (2010), 11] to more general discrete spaces.  At each step the method picks aflaw present in the current state and goes to a new state according to some prespecified probabilitydistribution (which depends on the current state and the selected flaw).  However, the recent formu-lation is less flexible than the Moser–Tardos method since it requires a specific flaw selection rule,whereas the algorithm of Moser and Tardos allows an arbitrary rule (and thus can potentially beimplemented more efficiently).  We formulate a new “commutativity” condition and prove that it issufficient for an arbitrary rule to work.  It also enables an efficient parallelization under an additionalassumption.  We then show that existing resampling oracles for perfect matchings and permutationsdo satisfy this condition."}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1095-7111"],"issn":["0097-5397"]},"author":[{"first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov"}],"year":"2018","scopus_import":"1","issue":"6","volume":47,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1506.08547"}],"day":"08","external_id":{"arxiv":["1506.08547"],"isi":["000453785100001"]},"oa":1,"status":"public","related_material":{"record":[{"id":"1193","relation":"earlier_version","status":"public"}]},"intvolume":"        47","doi":"10.1137/16m1093306","date_published":"2018-11-08T00:00:00Z","isi":1,"quality_controlled":"1","arxiv":1,"month":"11","publication":"SIAM Journal on Computing","date_created":"2019-02-13T12:59:33Z","oa_version":"Preprint","citation":{"short":"V. Kolmogorov, SIAM Journal on Computing 47 (2018) 2029–2056.","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.","ista":"Kolmogorov V. 2018. Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. 47(6), 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>.","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>","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>"},"type":"journal_article"},{"day":"01","external_id":{"isi":["000455953100064"]},"oa":1,"status":"public","intvolume":"        37","date_published":"2018-11-01T00:00:00Z","doi":"10.1145/3272127.3275076","article_number":"241","isi":1,"quality_controlled":"1","month":"11","pubrep_id":"1068","publication":"ACM Transactions on Graphics","date_created":"2019-02-13T13:12:53Z","citation":{"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>","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>","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>.","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.","short":"L. Malomo, J. Perez Rodriguez, E. Iarussi, N. Pietroni, E. Miguel, P. Cignoni, B. Bickel, ACM Transactions on Graphics 37 (2018).","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."},"oa_version":"Published Version","type":"journal_article","department":[{"_id":"BeBi"}],"project":[{"grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020"},{"_id":"25082902-B435-11E9-9278-68D0E5697425","name":"Soft-bodied intelligence for Manipulation","call_identifier":"H2020","grant_number":"645599"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"title":"FlexMaps: Computational design of flat flexible shells for shaping 3D objects","ddc":["000"],"publication_status":"published","file_date_updated":"2020-07-14T12:47:14Z","article_type":"original","publisher":"Association for Computing Machinery (ACM)","_id":"5976","ec_funded":1,"file":[{"checksum":"d0529a41c78b37ab8840685579fb33b4","date_updated":"2020-07-14T12:47:14Z","file_name":"flexmaps_author_version.pdf","relation":"main_file","file_id":"6901","creator":"bbickel","content_type":"application/pdf","access_level":"open_access","date_created":"2019-09-23T12:48:52Z","file_size":100109811}],"date_updated":"2023-09-19T14:25:30Z","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","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"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0730-0301"]},"author":[{"first_name":"Luigi","full_name":"Malomo, Luigi","last_name":"Malomo"},{"first_name":"Jesus","full_name":"Perez Rodriguez, Jesus","last_name":"Perez Rodriguez","id":"2DC83906-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Emmanuel","id":"33F19F16-F248-11E8-B48F-1D18A9856A87","full_name":"Iarussi, Emmanuel","last_name":"Iarussi"},{"last_name":"Pietroni","full_name":"Pietroni, Nico","first_name":"Nico"},{"first_name":"Eder","last_name":"Miguel","full_name":"Miguel, Eder"},{"last_name":"Cignoni","full_name":"Cignoni, Paolo","first_name":"Paolo"},{"orcid":"0000-0001-6511-9385","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd","first_name":"Bernd"}],"year":"2018","issue":"6","scopus_import":"1","volume":37,"has_accepted_license":"1"},{"language":[{"iso":"eng"}],"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Fu","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","full_name":"Fu, Hongfei","first_name":"Hongfei"},{"orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","full_name":"Goharshady, Amir","last_name":"Goharshady","first_name":"Amir"},{"first_name":"Nastaran","last_name":"Okati","full_name":"Okati, Nastaran"}],"publication_identifier":{"isbn":["978-099924112-7"],"issn":["10450823"]},"conference":{"end_date":"2018-07-19","location":"Stockholm, Sweden","name":"IJCAI: International Joint Conference on Artificial Intelligence","start_date":"2018-07-13"},"date_updated":"2025-06-02T08:53:44Z","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","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."}],"volume":2018,"year":"2018","scopus_import":"1","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"page":"4700-4707","title":"Computational approaches for stochastic shortest path on succinct MDPs","department":[{"_id":"KrCh"}],"publisher":"IJCAI","_id":"5977","ec_funded":1,"publication_status":"published","arxiv":1,"month":"07","quality_controlled":"1","type":"conference","publication":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","date_created":"2019-02-13T13:26:27Z","citation":{"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>","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>","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>.","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.","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.","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>.","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."},"oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/1804.08984","open_access":"1"}],"day":"17","external_id":{"arxiv":["1804.08984"],"isi":["000764175404118"]},"oa":1,"intvolume":"      2018","doi":"10.24963/ijcai.2018/653","date_published":"2018-07-17T00:00:00Z","isi":1,"status":"public","related_material":{"record":[{"status":"public","id":"8934","relation":"dissertation_contains"}]}},{"language":[{"iso":"eng"}],"arxiv":1,"conference":{"start_date":"2018-02-02","name":"AAAI: Conference on Artificial Intelligence","location":"New Orleans, LU, United States","end_date":"2018-02-07"},"month":"02","author":[{"first_name":"Stefan","full_name":"Haller, Stefan","last_name":"Haller"},{"first_name":"Paul","last_name":"Swoboda","id":"446560C6-F248-11E8-B48F-1D18A9856A87","full_name":"Swoboda, Paul"},{"first_name":"Bogdan","last_name":"Savchynskyy","full_name":"Savchynskyy, Bogdan"}],"date_updated":"2023-09-19T14:26:52Z","quality_controlled":"1","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"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.","lang":"eng"}],"type":"conference","publication":"Proceedings of the 32st AAAI Conference on Artificial Intelligence","year":"2018","scopus_import":"1","date_created":"2019-02-13T13:32:48Z","citation":{"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.","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.","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.","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.","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.","short":"S. Haller, P. Swoboda, B. Savchynskyy, in:, Proceedings of the 32st AAAI Conference on Artificial Intelligence, AAAI Press, 2018, pp. 6581–6588."},"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2004.06370"}],"day":"01","external_id":{"arxiv":["2004.06370"],"isi":["000485488906082"]},"title":"Exact MAP-inference by confining combinatorial search with LP relaxation","page":"6581-6588","oa":1,"department":[{"_id":"VlKo"}],"date_published":"2018-02-01T00:00:00Z","publisher":"AAAI Press","_id":"5978","isi":1,"status":"public","publication_status":"published"},{"article_type":"original","publisher":"Wiley","_id":"5982","publication_status":"published","page":"17063-17068","title":"Tin diselenide molecular precursor for solution-processable thermoelectric materials","department":[{"_id":"MaIb"}],"volume":57,"year":"2018","issue":"52","scopus_import":"1","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1433-7851"]},"author":[{"first_name":"Yu","full_name":"Zhang, Yu","last_name":"Zhang"},{"full_name":"Liu, Yu","last_name":"Liu","first_name":"Yu"},{"full_name":"Lim, Khak Ho","last_name":"Lim","first_name":"Khak Ho"},{"first_name":"Congcong","full_name":"Xing, Congcong","last_name":"Xing"},{"first_name":"Mengyao","full_name":"Li, Mengyao","last_name":"Li"},{"first_name":"Ting","last_name":"Zhang","full_name":"Zhang, Ting"},{"full_name":"Tang, Pengyi","last_name":"Tang","first_name":"Pengyi"},{"first_name":"Jordi","full_name":"Arbiol, Jordi","last_name":"Arbiol"},{"first_name":"Jordi","full_name":"Llorca, Jordi","last_name":"Llorca"},{"full_name":"Ng, Ka Ming","last_name":"Ng","first_name":"Ka Ming"},{"first_name":"Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez","full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843"},{"last_name":"Guardia","full_name":"Guardia, Pablo","first_name":"Pablo"},{"last_name":"Prato","full_name":"Prato, Mirko","first_name":"Mirko"},{"full_name":"Cadavid, Doris","last_name":"Cadavid","first_name":"Doris"},{"first_name":"Andreu","last_name":"Cabot","full_name":"Cabot, Andreu"}],"date_updated":"2023-09-19T14:28:31Z","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","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"}],"intvolume":"        57","doi":"10.1002/anie.201809847","date_published":"2018-12-21T00:00:00Z","isi":1,"status":"public","main_file_link":[{"open_access":"1","url":"https://upcommons.upc.edu/bitstream/2117/130444/1/Zhang%20preprint.pdf"}],"day":"21","external_id":{"isi":["000454575500020"]},"oa":1,"type":"journal_article","publication":"Angewandte Chemie International Edition","date_created":"2019-02-14T10:23:27Z","oa_version":"Submitted Version","citation":{"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>","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>","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>.","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>.","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."},"month":"12","quality_controlled":"1"},{"publisher":"American Physical Society","ec_funded":1,"_id":"5983","publication_status":"published","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"},{"grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems","call_identifier":"H2020"}],"title":"Theory of the rotating polaron: Spectrum and self-localization","department":[{"_id":"MiLe"},{"_id":"RoSe"}],"volume":98,"scopus_import":"1","issue":"22","year":"2018","language":[{"iso":"eng"}],"author":[{"last_name":"Yakaboylu","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","full_name":"Yakaboylu, Enderalp","first_name":"Enderalp","orcid":"0000-0001-5973-0874"},{"id":"456187FC-F248-11E8-B48F-1D18A9856A87","full_name":"Midya, Bikashkali","last_name":"Midya","first_name":"Bikashkali"},{"first_name":"Andreas","id":"4DA65CD0-F248-11E8-B48F-1D18A9856A87","last_name":"Deuchert","full_name":"Deuchert, Andreas","orcid":"0000-0003-3146-6746"},{"orcid":"0000-0002-0495-6822","full_name":"Leopold, Nikolai K","id":"4BC40BEC-F248-11E8-B48F-1D18A9856A87","last_name":"Leopold","first_name":"Nikolai K"},{"orcid":"0000-0002-6990-7802","first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","full_name":"Lemeshko, Mikhail","last_name":"Lemeshko"}],"publication_identifier":{"eissn":["2469-9969"],"issn":["2469-9950"]},"article_processing_charge":"No","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"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_published":"2018-12-12T00:00:00Z","doi":"10.1103/physrevb.98.224506","intvolume":"        98","isi":1,"article_number":"224506","status":"public","external_id":{"isi":["000452992700008"],"arxiv":["1809.01204"]},"day":"12","main_file_link":[{"url":"https://arxiv.org/abs/1809.01204","open_access":"1"}],"oa":1,"type":"journal_article","publication":"Physical Review B","oa_version":"Preprint","citation":{"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.","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.","short":"E. Yakaboylu, B. Midya, A. Deuchert, N.K. Leopold, M. Lemeshko, Physical Review B 98 (2018).","mla":"Yakaboylu, Enderalp, et al. “Theory of the Rotating Polaron: Spectrum and Self-Localization.” <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>.","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>","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>"},"date_created":"2019-02-14T10:37:09Z","arxiv":1,"month":"12","quality_controlled":"1"},{"date_published":"2018-12-01T00:00:00Z","doi":"10.1038/s41467-018-04342-1","intvolume":"         9","isi":1,"article_number":"1950","status":"public","external_id":{"isi":["000432280000006"]},"day":"01","oa":1,"type":"journal_article","publication":"Nature Communications","citation":{"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>","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.","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.","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>."},"oa_version":"Published Version","date_created":"2019-02-14T10:50:24Z","month":"12","quality_controlled":"1","publisher":"Springer Nature","ec_funded":1,"_id":"5984","publication_status":"published","ddc":["570"],"file_date_updated":"2020-07-14T12:47:14Z","project":[{"grant_number":"303564","_id":"25548C20-B435-11E9-9278-68D0E5697425","name":"Microbial Ion Channels for Synthetic Neurobiology","call_identifier":"FP7"},{"_id":"255A6082-B435-11E9-9278-68D0E5697425","name":"Molecular Drug Targets","call_identifier":"FWF","grant_number":"W1232-B24"}],"title":"Optical functionalization of human class A orphan G-protein-coupled receptors","department":[{"_id":"HaJa"},{"_id":"CaGu"},{"_id":"MiSi"}],"volume":9,"has_accepted_license":"1","scopus_import":"1","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"issue":"1","year":"2018","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2041-1723"]},"author":[{"last_name":"Morri","id":"4863116E-F248-11E8-B48F-1D18A9856A87","full_name":"Morri, Maurizio","first_name":"Maurizio"},{"first_name":"Inmaculada","id":"3D9C5D30-F248-11E8-B48F-1D18A9856A87","last_name":"Sanchez-Romero","full_name":"Sanchez-Romero, Inmaculada"},{"id":"29D8BB2C-F248-11E8-B48F-1D18A9856A87","full_name":"Tichy, Alexandra-Madelaine","last_name":"Tichy","first_name":"Alexandra-Madelaine"},{"last_name":"Kainrath","id":"32CFBA64-F248-11E8-B48F-1D18A9856A87","full_name":"Kainrath, Stephanie","first_name":"Stephanie"},{"first_name":"Elliot J.","full_name":"Gerrard, Elliot J.","last_name":"Gerrard"},{"first_name":"Priscila","id":"435ACB3A-F248-11E8-B48F-1D18A9856A87","last_name":"Hirschfeld","full_name":"Hirschfeld, Priscila"},{"first_name":"Jan","full_name":"Schwarz, Jan","id":"346C1EC6-F248-11E8-B48F-1D18A9856A87","last_name":"Schwarz"},{"orcid":"0000-0002-8023-9315","first_name":"Harald L","last_name":"Janovjak","full_name":"Janovjak, Harald L","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","file":[{"date_updated":"2020-07-14T12:47:14Z","file_name":"2018_Springer_Morri.pdf","checksum":"8325fcc194264af4749e662a73bf66b5","creator":"kschuh","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5985","date_created":"2019-02-14T10:58:29Z","file_size":1349914}],"date_updated":"2023-09-19T14:29:32Z","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."}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"day":"01","external_id":{"isi":["000429483700013"]},"oa":1,"intvolume":"        10","date_published":"2018-03-01T00:00:00Z","doi":"10.1093/gbe/evy037","isi":1,"status":"public","month":"03","quality_controlled":"1","license":"https://creativecommons.org/licenses/by-nc/4.0/","type":"journal_article","publication":"Genome Biology and Evolution","date_created":"2019-02-14T12:13:52Z","oa_version":"Published Version","citation":{"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>","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>","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.","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.","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>.","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."},"title":"Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites","page":"840-856","department":[{"_id":"BeVi"}],"publisher":"Oxford University Press","_id":"5989","file_date_updated":"2020-07-14T12:47:15Z","ddc":["570"],"publication_status":"published","language":[{"iso":"eng"}],"author":[{"last_name":"Kincaid-Smith","full_name":"Kincaid-Smith, Julien","first_name":"Julien"},{"full_name":"Picard, Marion A L","id":"2C921A7A-F248-11E8-B48F-1D18A9856A87","last_name":"Picard","first_name":"Marion A L","orcid":"0000-0002-8101-2518"},{"first_name":"Céline","last_name":"Cosseau","full_name":"Cosseau, Céline"},{"first_name":"Jérôme","last_name":"Boissier","full_name":"Boissier, Jérôme"},{"first_name":"Dany","last_name":"Severac","full_name":"Severac, Dany"},{"first_name":"Christoph","full_name":"Grunau, Christoph","last_name":"Grunau"},{"first_name":"Eve","full_name":"Toulza, Eve","last_name":"Toulza"}],"publication_identifier":{"issn":["1759-6653"]},"file":[{"creator":"dernst","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5991","date_created":"2019-02-14T12:20:01Z","file_size":529755,"date_updated":"2020-07-14T12:47:15Z","file_name":"2018_GBE_Kincaid_Smith.pdf","checksum":"736a459cb77de5824354466bb0331caf"}],"date_updated":"2023-09-19T14:39:08Z","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"lang":"eng","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."}],"volume":10,"has_accepted_license":"1","year":"2018","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","short":"CC BY-NC (4.0)"},"scopus_import":"1","issue":"3"},{"department":[{"_id":"GeKa"}],"title":"Josephson effect in a few-hole quantum dot","publication_status":"published","publisher":"Wiley","_id":"5990","date_updated":"2023-09-19T14:29:58Z","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"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.","lang":"eng"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0935-9648"]},"author":[{"last_name":"Ridderbos","full_name":"Ridderbos, Joost","first_name":"Joost"},{"id":"33F94E3C-F248-11E8-B48F-1D18A9856A87","full_name":"Brauns, Matthias","last_name":"Brauns","first_name":"Matthias"},{"first_name":"Jie","last_name":"Shen","full_name":"Shen, Jie"},{"first_name":"Folkert K.","full_name":"de Vries, Folkert K.","last_name":"de Vries"},{"last_name":"Li","full_name":"Li, Ang","first_name":"Ang"},{"full_name":"Bakkers, Erik P. A. M.","last_name":"Bakkers","first_name":"Erik P. A. M."},{"first_name":"Alexander","last_name":"Brinkman","full_name":"Brinkman, Alexander"},{"first_name":"Floris A.","full_name":"Zwanenburg, Floris A.","last_name":"Zwanenburg"}],"year":"2018","scopus_import":"1","issue":"44","volume":30,"day":"02","main_file_link":[{"url":"https://arxiv.org/abs/1809.08487","open_access":"1"}],"external_id":{"arxiv":["1809.08487"],"isi":["000450232800015"]},"oa":1,"status":"public","intvolume":"        30","date_published":"2018-11-02T00:00:00Z","doi":"10.1002/adma.201802257","article_number":"1802257","isi":1,"quality_controlled":"1","arxiv":1,"month":"11","publication":"Advanced Materials","date_created":"2019-02-14T12:14:26Z","oa_version":"Preprint","citation":{"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>.","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>","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.","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>.","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.","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)."},"type":"journal_article"},{"issue":"22","tmp":{"image":"/images/cc_by_nc_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","short":"CC BY-NC-SA (4.0)","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)"},"scopus_import":"1","year":"2018","volume":29,"has_accepted_license":"1","article_processing_charge":"No","file":[{"date_updated":"2020-07-14T12:47:15Z","file_name":"2018_ASCB_Dolati.pdf","checksum":"e98465b4416b3e804c47f40086932af2","date_created":"2019-02-14T12:34:29Z","file_size":6668971,"creator":"kschuh","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_id":"5994"}],"date_updated":"2023-09-19T14:30:23Z","abstract":[{"text":"Lamellipodia are flat membrane protrusions formed during mesenchymal motion. Polymerization at the leading edge assembles the actin filament network and generates protrusion force. How this force is supported by the network and how the assembly rate is shared between protrusion and network retrograde flow determines the protrusion rate. We use mathematical modeling to understand experiments changing the F-actin density in lamellipodia of B16-F1 melanoma cells by modulation of Arp2/3 complex activity or knockout of the formins FMNL2 and FMNL3. Cells respond to a reduction of density with a decrease of protrusion velocity, an increase in the ratio of force to filament number, but constant network assembly rate. The relation between protrusion force and tension gradient in the F-actin network and the density dependency of friction, elasticity, and viscosity of the network explain the experimental observations. The formins act as filament nucleators and elongators with differential rates. Modulation of their activity suggests an effect on network assembly rate. Contrary to these expectations, the effect of changes in elongator composition is much weaker than the consequences of the density change. We conclude that the force acting on the leading edge membrane is the force required to drive F-actin network retrograde flow.","lang":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","pmid":1,"language":[{"iso":"eng"}],"author":[{"first_name":"Setareh","full_name":"Dolati, Setareh","last_name":"Dolati"},{"first_name":"Frieda","full_name":"Kage, Frieda","last_name":"Kage"},{"first_name":"Jan","full_name":"Mueller, Jan","last_name":"Mueller"},{"first_name":"Mathias","last_name":"Müsken","full_name":"Müsken, Mathias"},{"last_name":"Kirchner","full_name":"Kirchner, Marieluise","first_name":"Marieluise"},{"first_name":"Gunnar","last_name":"Dittmar","full_name":"Dittmar, Gunnar"},{"first_name":"Michael K","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K","orcid":"0000-0002-6620-9179"},{"first_name":"Klemens","full_name":"Rottner, Klemens","last_name":"Rottner"},{"last_name":"Falcke","full_name":"Falcke, Martin","first_name":"Martin"}],"publication_identifier":{"eissn":["1939-4586"]},"ddc":["570"],"publication_status":"published","file_date_updated":"2020-07-14T12:47:15Z","publisher":"American Society for Cell Biology ","_id":"5992","department":[{"_id":"MiSi"}],"page":"2674-2686","title":"On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility","publication":"Molecular Biology of the Cell","citation":{"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>.","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>","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>.","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.","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.","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."},"oa_version":"Published Version","date_created":"2019-02-14T12:25:47Z","type":"journal_article","quality_controlled":"1","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","month":"11","status":"public","doi":"10.1091/mbc.e18-02-0082","date_published":"2018-11-01T00:00:00Z","intvolume":"        29","isi":1,"external_id":{"isi":["000455641000011"],"pmid":["30156465"]},"day":"01","oa":1},{"author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"first_name":"Hongfei","last_name":"Fu","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","full_name":"Fu, Hongfei"},{"first_name":"Petr","last_name":"Novotný","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","full_name":"Novotný, Petr"},{"last_name":"Hasheminezhad","full_name":"Hasheminezhad, Rouzbeh","first_name":"Rouzbeh"}],"publication_identifier":{"issn":["0164-0925"]},"language":[{"iso":"eng"}],"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."}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","date_updated":"2023-09-19T14:38:42Z","volume":40,"scopus_import":"1","issue":"2","year":"2018","title":"Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"department":[{"_id":"KrCh"}],"ec_funded":1,"_id":"5993","publisher":"Association for Computing Machinery (ACM)","publication_status":"published","month":"06","arxiv":1,"quality_controlled":"1","type":"journal_article","citation":{"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>","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>.","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.","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>."},"oa_version":"Submitted Version","date_created":"2019-02-14T12:29:10Z","publication":"ACM Transactions on Programming Languages and Systems","oa":1,"external_id":{"arxiv":["1510.08517"],"isi":["000434634500003"]},"day":"01","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1510.08517"}],"isi":1,"article_number":"7","doi":"10.1145/3174800","date_published":"2018-06-01T00:00:00Z","intvolume":"        40","related_material":{"record":[{"relation":"earlier_version","id":"1438","status":"public"}]},"status":"public"},{"project":[{"grant_number":"335980","_id":"26120F5C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Systematic investigation of epistasis in molecular evolution"}],"page":"3653-3658","title":"Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation","department":[{"_id":"FyKo"}],"publisher":"Oxford University Press ","_id":"5995","ec_funded":1,"publication_status":"published","file_date_updated":"2020-07-14T12:47:15Z","ddc":["570"],"language":[{"iso":"eng"}],"pmid":1,"author":[{"full_name":"Usmanova, Dinara R","last_name":"Usmanova","first_name":"Dinara R"},{"last_name":"Bogatyreva","full_name":"Bogatyreva, Natalya S","first_name":"Natalya S"},{"first_name":"Joan","full_name":"Ariño Bernad, Joan","last_name":"Ariño Bernad"},{"first_name":"Aleksandra A","last_name":"Eremina","full_name":"Eremina, Aleksandra A"},{"last_name":"Gorshkova","full_name":"Gorshkova, Anastasiya A","first_name":"Anastasiya A"},{"first_name":"German M","full_name":"Kanevskiy, German M","last_name":"Kanevskiy"},{"last_name":"Lonishin","full_name":"Lonishin, Lyubov R","first_name":"Lyubov R"},{"first_name":"Alexander V","last_name":"Meister","full_name":"Meister, Alexander V"},{"first_name":"Alisa G","last_name":"Yakupova","full_name":"Yakupova, Alisa G"},{"orcid":"0000-0001-8243-4694","full_name":"Kondrashov, Fyodor","last_name":"Kondrashov","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","first_name":"Fyodor"},{"first_name":"Dmitry","full_name":"Ivankov, Dmitry","id":"49FF1036-F248-11E8-B48F-1D18A9856A87","last_name":"Ivankov"}],"publication_identifier":{"issn":["1367-4803","1460-2059"]},"date_updated":"2023-09-19T14:31:13Z","file":[{"file_name":"2018_Oxford_Usmanova.pdf","date_updated":"2020-07-14T12:47:15Z","checksum":"7e0495153f44211479674601d7f6ee03","access_level":"open_access","content_type":"application/pdf","creator":"kschuh","file_id":"5997","relation":"main_file","file_size":291969,"date_created":"2019-02-14T13:00:55Z"}],"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","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"}],"volume":34,"has_accepted_license":"1","year":"2018","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","short":"CC BY-NC (4.0)"},"issue":"21","scopus_import":"1","day":"01","external_id":{"pmid":["29722803"],"isi":["000450038900008"]},"oa":1,"intvolume":"        34","date_published":"2018-11-01T00:00:00Z","doi":"10.1093/bioinformatics/bty340","isi":1,"status":"public","month":"11","quality_controlled":"1","type":"journal_article","publication":"Bioinformatics","date_created":"2019-02-14T12:48:00Z","oa_version":"Published Version","citation":{"short":"D.R. Usmanova, N.S. Bogatyreva, J. Ariño Bernad, A.A. Eremina, A.A. Gorshkova, G.M. Kanevskiy, L.R. Lonishin, A.V. Meister, A.G. Yakupova, F. Kondrashov, D. Ivankov, Bioinformatics 34 (2018) 3653–3658.","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.","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.","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>.","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>","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>"}},{"arxiv":1,"month":"03","quality_controlled":"1","acknowledgement":" We  also  thank  Philipp  Maier  and  the  IST  Austria  workshop  for  theirdedicated technical support","type":"journal_article","publication":"Journal of Fluid Mechanics","date_created":"2019-02-14T12:50:50Z","oa_version":"Preprint","citation":{"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>.","ista":"Vasudevan M, Hof B. 2018. The critical point of the transition to turbulence in pipe flow. Journal of Fluid Mechanics. 839, 76–94.","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.","short":"M. Vasudevan, B. Hof, Journal of Fluid Mechanics 839 (2018) 76–94.","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>","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>.","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>"},"main_file_link":[{"url":"https://arxiv.org/abs/1709.06372","open_access":"1"}],"day":"25","external_id":{"isi":["000437858300003"],"arxiv":["1709.06372"]},"oa":1,"intvolume":"       839","date_published":"2018-03-25T00:00:00Z","doi":"10.1017/jfm.2017.923","isi":1,"status":"public","language":[{"iso":"eng"}],"author":[{"first_name":"Mukund","id":"3C5A959A-F248-11E8-B48F-1D18A9856A87","last_name":"Vasudevan","full_name":"Vasudevan, Mukund"},{"full_name":"Hof, Björn","last_name":"Hof","id":"3A374330-F248-11E8-B48F-1D18A9856A87","first_name":"Björn","orcid":"0000-0003-2057-2754"}],"publication_identifier":{"issn":["0022-1120"],"eissn":["1469-7645"]},"date_updated":"2023-09-19T14:37:49Z","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","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."}],"volume":839,"year":"2018","scopus_import":"1","project":[{"grant_number":"306589","call_identifier":"FP7","name":"Decoding the complexity of turbulence at its origin","_id":"25152F3A-B435-11E9-9278-68D0E5697425"}],"title":"The critical point of the transition to turbulence in pipe flow","page":"76-94","department":[{"_id":"BjHo"}],"article_type":"original","publisher":"Cambridge University Press","_id":"5996","ec_funded":1,"publication_status":"published"},{"isi":1,"article_number":"e1007698","date_published":"2018-10-12T00:00:00Z","doi":"10.1371/journal.pgen.1007698","intvolume":"        14","status":"public","oa":1,"external_id":{"isi":["000449328500025"]},"day":"12","type":"journal_article","oa_version":"Published Version","citation":{"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>","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>.","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>","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.","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).","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>.","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."},"date_created":"2019-02-14T13:07:45Z","publication":"PLOS Genetics","month":"10","quality_controlled":"1","_id":"5998","publisher":"Public Library of Science","ddc":["570"],"file_date_updated":"2020-07-14T12:47:15Z","publication_status":"published","title":"Genome amplification and cellular senescence are hallmarks of human placenta development","department":[{"_id":"JoDa"}],"has_accepted_license":"1","volume":14,"issue":"10","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"scopus_import":"1","year":"2018","publication_identifier":{"issn":["1553-7404"]},"author":[{"first_name":"Philipp","id":"39BDC62C-F248-11E8-B48F-1D18A9856A87","last_name":"Velicky","full_name":"Velicky, Philipp","orcid":"0000-0002-2340-7431"},{"full_name":"Meinhardt, Gudrun","last_name":"Meinhardt","first_name":"Gudrun"},{"first_name":"Kerstin","full_name":"Plessl, Kerstin","last_name":"Plessl"},{"full_name":"Vondra, Sigrid","last_name":"Vondra","first_name":"Sigrid"},{"full_name":"Weiss, Tamara","last_name":"Weiss","first_name":"Tamara"},{"first_name":"Peter","full_name":"Haslinger, Peter","last_name":"Haslinger"},{"last_name":"Lendl","full_name":"Lendl, Thomas","first_name":"Thomas"},{"last_name":"Aumayr","full_name":"Aumayr, Karin","first_name":"Karin"},{"first_name":"Mario","last_name":"Mairhofer","full_name":"Mairhofer, Mario"},{"first_name":"Xiaowei","full_name":"Zhu, Xiaowei","last_name":"Zhu"},{"last_name":"Schütz","full_name":"Schütz, Birgit","first_name":"Birgit"},{"first_name":"Roberta L.","last_name":"Hannibal","full_name":"Hannibal, Roberta L."},{"last_name":"Lindau","full_name":"Lindau, Robert","first_name":"Robert"},{"first_name":"Beatrix","full_name":"Weil, Beatrix","last_name":"Weil"},{"first_name":"Jan","full_name":"Ernerudh, Jan","last_name":"Ernerudh"},{"first_name":"Jürgen","last_name":"Neesen","full_name":"Neesen, Jürgen"},{"first_name":"Gerda","full_name":"Egger, Gerda","last_name":"Egger"},{"first_name":"Mario","full_name":"Mikula, Mario","last_name":"Mikula"},{"first_name":"Clemens","full_name":"Röhrl, Clemens","last_name":"Röhrl"},{"first_name":"Alexander E.","full_name":"Urban, Alexander E.","last_name":"Urban"},{"full_name":"Baker, Julie","last_name":"Baker","first_name":"Julie"},{"last_name":"Knöfler","full_name":"Knöfler, Martin","first_name":"Martin"},{"first_name":"Jürgen","full_name":"Pollheimer, Jürgen","last_name":"Pollheimer"}],"language":[{"iso":"eng"}],"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"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","date_updated":"2023-09-19T14:31:43Z","file":[{"file_id":"6000","relation":"main_file","content_type":"application/pdf","access_level":"open_access","creator":"kschuh","file_size":4592947,"date_created":"2019-02-14T13:14:35Z","checksum":"34aa9a5972f61889c19f18be8ee787a0","file_name":"2018_PLOS_Velicky.pdf","date_updated":"2020-07-14T12:47:15Z"}]},{"publication_status":"published","publisher":"Oxford University Press","_id":"5999","department":[{"_id":"TaHa"}],"page":"1029-1074","title":"The cohomological Hall algebra of a preprojective algebra","scopus_import":"1","issue":"5","year":"2018","volume":116,"article_processing_charge":"No","date_updated":"2023-09-19T14:37:19Z","abstract":[{"lang":"eng","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. "}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"author":[{"first_name":"Yaping","last_name":"Yang","full_name":"Yang, Yaping"},{"id":"2BC2AC5E-F248-11E8-B48F-1D18A9856A87","last_name":"Zhao","full_name":"Zhao, Gufang","first_name":"Gufang"}],"publication_identifier":{"issn":["0024-6115"]},"status":"public","date_published":"2018-05-01T00:00:00Z","doi":"10.1112/plms.12111","intvolume":"       116","isi":1,"external_id":{"arxiv":["1407.7994"],"isi":["000431506400001"]},"main_file_link":[{"url":"https://arxiv.org/abs/1407.7994","open_access":"1"}],"day":"01","oa":1,"publication":"Proceedings of the London Mathematical Society","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.","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>.","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>"},"oa_version":"Preprint","date_created":"2019-02-14T13:14:22Z","type":"journal_article","quality_controlled":"1","arxiv":1,"month":"05"},{"_id":"6002","publisher":"Springer Nature","publication_status":"published","page":"1037-1090","title":"The Bogoliubov free energy functional I: Existence of minimizers and phase diagram","project":[{"grant_number":"P27533_N27","call_identifier":"FWF","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","_id":"25C878CE-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"RoSe"}],"volume":229,"year":"2018","issue":"3","scopus_import":"1","author":[{"id":"4197AD04-F248-11E8-B48F-1D18A9856A87","last_name":"Napiórkowski","full_name":"Napiórkowski, Marcin M","first_name":"Marcin M"},{"last_name":"Reuvers","full_name":"Reuvers, Robin","first_name":"Robin"},{"first_name":"Jan Philip","full_name":"Solovej, Jan Philip","last_name":"Solovej"}],"publication_identifier":{"issn":["0003-9527"],"eissn":["1432-0673"]},"language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"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.","lang":"eng"}],"date_updated":"2023-09-19T14:33:12Z","article_processing_charge":"No","isi":1,"intvolume":"       229","doi":"10.1007/s00205-018-1232-6","date_published":"2018-09-01T00:00:00Z","status":"public","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1511.05935","open_access":"1"}],"day":"01","external_id":{"arxiv":["1511.05935"],"isi":["000435367300003"]},"type":"journal_article","date_created":"2019-02-14T13:40:53Z","oa_version":"Preprint","citation":{"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>","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>.","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>","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.","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>.","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.","short":"M.M. Napiórkowski, R. Reuvers, J.P. Solovej, Archive for Rational Mechanics and Analysis 229 (2018) 1037–1090."},"publication":"Archive for Rational Mechanics and Analysis","month":"09","arxiv":1,"quality_controlled":"1"},{"oa":1,"external_id":{"isi":["000437272800019"]},"day":"01","status":"public","isi":1,"date_published":"2018-09-01T00:00:00Z","doi":"10.1111/cgf.13327","intvolume":"        37","quality_controlled":"1","month":"09","pubrep_id":"1051","citation":{"apa":"Bickel, B., Cignoni, P., Malomo, L., &#38; Pietroni, N. (2018). State of the art on stylized fabrication. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.13327\">https://doi.org/10.1111/cgf.13327</a>","mla":"Bickel, Bernd, et al. “State of the Art on Stylized Fabrication.” <i>Computer Graphics Forum</i>, vol. 37, no. 6, Wiley, 2018, pp. 325–42, doi:<a href=\"https://doi.org/10.1111/cgf.13327\">10.1111/cgf.13327</a>.","ama":"Bickel B, Cignoni P, Malomo L, Pietroni N. State of the art on stylized fabrication. <i>Computer Graphics Forum</i>. 2018;37(6):325-342. doi:<a href=\"https://doi.org/10.1111/cgf.13327\">10.1111/cgf.13327</a>","chicago":"Bickel, Bernd, Paolo Cignoni, Luigi Malomo, and Nico Pietroni. “State of the Art on Stylized Fabrication.” <i>Computer Graphics Forum</i>. Wiley, 2018. <a href=\"https://doi.org/10.1111/cgf.13327\">https://doi.org/10.1111/cgf.13327</a>.","ista":"Bickel B, Cignoni P, Malomo L, Pietroni N. 2018. State of the art on stylized fabrication. Computer Graphics Forum. 37(6), 325–342.","ieee":"B. Bickel, P. Cignoni, L. Malomo, and N. Pietroni, “State of the art on stylized fabrication,” <i>Computer Graphics Forum</i>, vol. 37, no. 6. Wiley, pp. 325–342, 2018.","short":"B. Bickel, P. Cignoni, L. Malomo, N. Pietroni, Computer Graphics Forum 37 (2018) 325–342."},"oa_version":"Submitted Version","date_created":"2019-02-14T13:52:25Z","publication":"Computer Graphics Forum","type":"journal_article","department":[{"_id":"BeBi"}],"page":"325-342","title":"State of the art on stylized fabrication","project":[{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020","grant_number":"715767"}],"file_date_updated":"2020-07-14T12:47:15Z","ddc":["004"],"publication_status":"published","ec_funded":1,"_id":"6003","publisher":"Wiley","abstract":[{"lang":"eng","text":"Digital fabrication devices are powerful tools for creating tangible reproductions of 3D digital models. Most available printing technologies aim at producing an accurate copy of a tridimensional shape. However, fabrication technologies can also be used to create a stylistic representation of a digital shape. We refer to this class of methods as ‘stylized fabrication methods’. These methods abstract geometric and physical features of a given shape to create an unconventional representation, to produce an optical illusion or to devise a particular interaction with the fabricated model. In this state‐of‐the‐art report, we classify and overview this broad and emerging class of approaches and also propose possible directions for future research."}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","file":[{"date_created":"2019-02-14T14:09:28Z","file_size":6209349,"creator":"kschuh","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"6004","date_updated":"2020-07-14T12:47:15Z","file_name":"StylizedFabricationSTAR-Personal.pdf","checksum":"d2bbe5c658d8159fbe9016a4f5e82b19"}],"date_updated":"2023-09-19T14:33:40Z","publication_identifier":{"issn":["0167-7055"]},"author":[{"full_name":"Bickel, Bernd","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","orcid":"0000-0001-6511-9385"},{"first_name":"Paolo","full_name":"Cignoni, Paolo","last_name":"Cignoni"},{"last_name":"Malomo","full_name":"Malomo, Luigi","first_name":"Luigi"},{"first_name":"Nico","full_name":"Pietroni, Nico","last_name":"Pietroni"}],"language":[{"iso":"eng"}],"issue":"6","scopus_import":"1","year":"2018","has_accepted_license":"1","volume":37},{"quality_controlled":"1","month":"08","oa_version":"Published Version","citation":{"ama":"Avni G, Guha S, Kupferman O. Timed network games with clocks. In: Vol 117. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:<a href=\"https://doi.org/10.4230/LIPICS.MFCS.2018.23\">10.4230/LIPICS.MFCS.2018.23</a>","apa":"Avni, G., Guha, S., &#38; Kupferman, O. (2018). Timed network games with clocks (Vol. 117). Presented at the MFCS: Mathematical Foundations of Computer Science, Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.MFCS.2018.23\">https://doi.org/10.4230/LIPICS.MFCS.2018.23</a>","mla":"Avni, Guy, et al. <i>Timed Network Games with Clocks</i>. Vol. 117, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:<a href=\"https://doi.org/10.4230/LIPICS.MFCS.2018.23\">10.4230/LIPICS.MFCS.2018.23</a>.","ieee":"G. Avni, S. Guha, and O. Kupferman, “Timed network games with clocks,” presented at the MFCS: Mathematical Foundations of Computer Science, Liverpool, United Kingdom, 2018, vol. 117.","short":"G. Avni, S. Guha, O. Kupferman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","chicago":"Avni, Guy, Shibashis Guha, and Orna Kupferman. “Timed Network Games with Clocks,” Vol. 117. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPICS.MFCS.2018.23\">https://doi.org/10.4230/LIPICS.MFCS.2018.23</a>.","ista":"Avni G, Guha S, Kupferman O. 2018. Timed network games with clocks. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 117, 23."},"date_created":"2019-02-14T14:12:09Z","type":"conference","oa":1,"day":"01","related_material":{"record":[{"status":"public","id":"963","relation":"earlier_version"}]},"status":"public","article_number":"23","date_published":"2018-08-01T00:00:00Z","doi":"10.4230/LIPICS.MFCS.2018.23","intvolume":"       117","abstract":[{"lang":"eng","text":"Network games are widely used as a model for selfish resource-allocation problems. In the classicalmodel, each player selects a path connecting her source and target vertices. The cost of traversingan edge depends on theload; namely, number of players that traverse it. Thus, it abstracts the factthat different users may use a resource at different times and for different durations, which playsan important role in determining the costs of the users in reality. For example, when transmittingpackets in a communication network, routing traffic in a road network, or processing a task in aproduction system, actual sharing and congestion of resources crucially depends on time.In [13], we introducedtimed network games, which add a time component to network games.Each vertexvin the network is associated with a cost function, mapping the load onvto theprice that a player pays for staying invfor one time unit with this load.  Each edge in thenetwork is guarded by the time intervals in which it can be traversed, which forces the players tospend time in the vertices. In this work we significantly extend the way time can be referred toin timed network games. In the model we study, the network is equipped withclocks, and, as intimed automata, edges are guarded by constraints on the values of the clocks, and their traversalmay involve a reset of some clocks. We argue that the stronger model captures many realisticnetworks.  The addition of clocks breaks the techniques we developed in [13] and we developnew techniques in order to show that positive results on classic network games carry over to thestronger timed setting."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","date_updated":"2023-02-23T14:02:58Z","file":[{"date_created":"2019-02-14T14:22:04Z","file_size":542889,"relation":"main_file","file_id":"6007","creator":"dernst","content_type":"application/pdf","access_level":"open_access","checksum":"41ab2ae9b63f5eb49fa995250c0ba128","date_updated":"2020-07-14T12:47:15Z","file_name":"2018_LIPIcs_Avni.pdf"}],"conference":{"name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2018-08-27","location":"Liverpool, United Kingdom","end_date":"2018-08-31"},"publication_identifier":{"issn":["1868-8969"]},"author":[{"orcid":"0000-0001-5588-8287","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Avni, Guy","last_name":"Avni"},{"first_name":"Shibashis","last_name":"Guha","full_name":"Guha, Shibashis"},{"last_name":"Kupferman","full_name":"Kupferman, Orna","first_name":"Orna"}],"language":[{"iso":"eng"}],"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"scopus_import":"1","year":"2018","has_accepted_license":"1","volume":117,"alternative_title":["LIPIcs"],"department":[{"_id":"ToHe"}],"title":"Timed network games with clocks","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"},{"grant_number":"M02369","_id":"264B3912-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Formal Methods meets Algorithmic Game Theory"}],"ddc":["000"],"file_date_updated":"2020-07-14T12:47:15Z","publication_status":"published","_id":"6005","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik"},{"department":[{"_id":"ToHe"}],"project":[{"_id":"264B3912-B435-11E9-9278-68D0E5697425","name":"Formal Methods meets Algorithmic Game Theory","call_identifier":"FWF","grant_number":"M02369"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z211"}],"title":"An abstraction-refinement methodology for reasoning about network games","file_date_updated":"2020-07-14T12:47:16Z","ddc":["004"],"publication_status":"published","publisher":"MDPI AG","_id":"6006","date_updated":"2023-09-22T09:48:59Z","file":[{"checksum":"749d65ca4ce74256a029d9644a1b1cb0","file_name":"2018_MDPI_Avni.pdf","date_updated":"2020-07-14T12:47:16Z","file_size":505155,"date_created":"2019-02-14T14:20:31Z","file_id":"6008","relation":"main_file","access_level":"open_access","content_type":"application/pdf","creator":"kschuh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Network games (NGs) are played on directed graphs and are extensively used in network design and analysis. Search problems for NGs include finding special strategy profiles such as a Nash equilibrium and a globally-optimal solution. The networks modeled by NGs may be huge. In formal verification, abstraction has proven to be an extremely effective technique for reasoning about systems with big and even infinite state spaces. We describe an abstraction-refinement methodology for reasoning about NGs. Our methodology is based on an abstraction function that maps the state space of an NG to a much smaller state space. We search for a global optimum and a Nash equilibrium by reasoning on an under- and an over-approximation defined on top of this smaller state space. When the approximations are too coarse to find such profiles, we refine the abstraction function. We extend the abstraction-refinement methodology to labeled networks, where the objectives of the players are regular languages. Our experimental results demonstrate the effectiveness of the methodology. "}],"language":[{"iso":"eng"}],"author":[{"orcid":"0000-0001-5588-8287","first_name":"Guy","last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Avni, Guy"},{"last_name":"Guha","full_name":"Guha, Shibashis","first_name":"Shibashis"},{"full_name":"Kupferman, Orna","last_name":"Kupferman","first_name":"Orna"}],"publication_identifier":{"issn":["2073-4336"]},"year":"2018","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"issue":"3","scopus_import":1,"volume":9,"has_accepted_license":"1","day":"01","oa":1,"status":"public","related_material":{"record":[{"relation":"earlier_version","id":"1003","status":"public"}]},"intvolume":"         9","doi":"10.3390/g9030039","date_published":"2018-09-01T00:00:00Z","article_number":"39","quality_controlled":"1","month":"09","publication":"Games","date_created":"2019-02-14T14:17:54Z","citation":{"ista":"Avni G, Guha S, Kupferman O. 2018. An abstraction-refinement methodology for reasoning about network games. Games. 9(3), 39.","chicago":"Avni, Guy, Shibashis Guha, and Orna Kupferman. “An Abstraction-Refinement Methodology for Reasoning about Network Games.” <i>Games</i>. MDPI AG, 2018. <a href=\"https://doi.org/10.3390/g9030039\">https://doi.org/10.3390/g9030039</a>.","ieee":"G. Avni, S. Guha, and O. Kupferman, “An abstraction-refinement methodology for reasoning about network games,” <i>Games</i>, vol. 9, no. 3. MDPI AG, 2018.","short":"G. Avni, S. Guha, O. Kupferman, Games 9 (2018).","mla":"Avni, Guy, et al. “An Abstraction-Refinement Methodology for Reasoning about Network Games.” <i>Games</i>, vol. 9, no. 3, 39, MDPI AG, 2018, doi:<a href=\"https://doi.org/10.3390/g9030039\">10.3390/g9030039</a>.","apa":"Avni, G., Guha, S., &#38; Kupferman, O. (2018). An abstraction-refinement methodology for reasoning about network games. <i>Games</i>. MDPI AG. <a href=\"https://doi.org/10.3390/g9030039\">https://doi.org/10.3390/g9030039</a>","ama":"Avni G, Guha S, Kupferman O. An abstraction-refinement methodology for reasoning about network games. <i>Games</i>. 2018;9(3). doi:<a href=\"https://doi.org/10.3390/g9030039\">10.3390/g9030039</a>"},"oa_version":"Published Version","type":"journal_article"}]