[{"related_material":{"record":[{"id":"7435","status":"deleted","relation":"part_of_dissertation"},{"status":"public","id":"7481","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"9416"},{"id":"7479","status":"public","relation":"part_of_dissertation"}]},"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"checksum":"4f0abe64114cfed264f9d36e8d1197e3","file_id":"9419","file_size":2673905,"date_updated":"2021-05-24T11:22:29Z","creator":"bphuong","file_name":"mph-thesis-v519-pdfimages.pdf","date_created":"2021-05-24T11:22:29Z"},{"checksum":"f5699e876bc770a9b0df8345a77720a2","file_id":"9420","access_level":"closed","relation":"source_file","content_type":"application/zip","date_created":"2021-05-24T11:56:02Z","file_name":"thesis.zip","creator":"bphuong","date_updated":"2021-05-24T11:56:02Z","file_size":92995100}],"degree_awarded":"PhD","publication_status":"published","publication_identifier":{"issn":["2663-337X"]},"month":"05","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Deep learning is best known for its empirical success across a wide range of applications\r\nspanning computer vision, natural language processing and speech. Of equal significance,\r\nthough perhaps less known, are its ramifications for learning theory: deep networks have\r\nbeen observed to perform surprisingly well in the high-capacity regime, aka the overfitting\r\nor underspecified regime. Classically, this regime on the far right of the bias-variance curve\r\nis associated with poor generalisation; however, recent experiments with deep networks\r\nchallenge this view.\r\n\r\nThis thesis is devoted to investigating various aspects of underspecification in deep learning.\r\nFirst, we argue that deep learning models are underspecified on two levels: a) any given\r\ntraining dataset can be fit by many different functions, and b) any given function can be\r\nexpressed by many different parameter configurations. We refer to the second kind of\r\nunderspecification as parameterisation redundancy and we precisely characterise its extent.\r\nSecond, we characterise the implicit criteria (the inductive bias) that guide learning in the\r\nunderspecified regime. Specifically, we consider a nonlinear but tractable classification\r\nsetting, and show that given the choice, neural networks learn classifiers with a large margin.\r\nThird, we consider learning scenarios where the inductive bias is not by itself sufficient to\r\ndeal with underspecification. We then study different ways of ‘tightening the specification’: i)\r\nIn the setting of representation learning with variational autoencoders, we propose a hand-\r\ncrafted regulariser based on mutual information. ii) In the setting of binary classification, we\r\nconsider soft-label (real-valued) supervision. We derive a generalisation bound for linear\r\nnetworks supervised in this way and verify that soft labels facilitate fast learning. Finally, we\r\nexplore an application of soft-label supervision to the training of multi-exit models."}],"acknowledged_ssus":[{"_id":"ScienComp"},{"_id":"CampIT"},{"_id":"E-Lib"}],"file_date_updated":"2021-05-24T11:56:02Z","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"ddc":["000"],"date_updated":"2023-09-08T11:11:12Z","supervisor":[{"first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"}],"status":"public","type":"dissertation","_id":"9418","date_created":"2021-05-24T13:06:23Z","date_published":"2021-05-30T00:00:00Z","doi":"10.15479/AT:ISTA:9418","page":"125","day":"30","year":"2021","has_accepted_license":"1","oa":1,"publisher":"Institute of Science and Technology Austria","title":"Underspecification in deep learning","article_processing_charge":"No","author":[{"first_name":"Phuong","id":"3EC6EE64-F248-11E8-B48F-1D18A9856A87","last_name":"Bui Thi Mai","full_name":"Bui Thi Mai, Phuong"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Phuong M. 2021. Underspecification in deep learning. Institute of Science and Technology Austria.","chicago":"Phuong, Mary. “Underspecification in Deep Learning.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/AT:ISTA:9418.","ama":"Phuong M. Underspecification in deep learning. 2021. doi:10.15479/AT:ISTA:9418","apa":"Phuong, M. (2021). Underspecification in deep learning. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:9418","short":"M. Phuong, Underspecification in Deep Learning, Institute of Science and Technology Austria, 2021.","ieee":"M. Phuong, “Underspecification in deep learning,” Institute of Science and Technology Austria, 2021.","mla":"Phuong, Mary. Underspecification in Deep Learning. Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:9418."}},{"day":"23","language":[{"iso":"eng"}],"publication":"arXiv","year":"2021","publication_status":"submitted","doi":"10.48550/ARXIV.2111.12171","date_published":"2021-11-23T00:00:00Z","date_created":"2023-09-06T08:35:43Z","oa_version":"Preprint","abstract":[{"text":"The Birkhoff conjecture says that the boundary of a strictly convex integrable billiard table is necessarily an ellipse. In this article, we consider a stronger notion of integrability, namely, integrability close to the boundary, and prove a local version of this conjecture: a small perturbation of almost every ellipse that preserves integrability near the boundary, is itself an ellipse. We apply this result to study local spectral rigidity of ellipses using the connection between the wave trace of the Laplacian and the dynamics near the boundary and establish rigidity for almost all of them.","lang":"eng"}],"month":"11","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2111.12171","open_access":"1"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-09-15T06:44:00Z","citation":{"mla":"Koval, Illya. “Local Strong Birkhoff Conjecture and Local Spectral Rigidity of Almost Every Ellipse.” ArXiv, 2111.12171, doi:10.48550/ARXIV.2111.12171.","ieee":"I. Koval, “Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse,” arXiv. .","short":"I. Koval, ArXiv (n.d.).","apa":"Koval, I. (n.d.). Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse. arXiv. https://doi.org/10.48550/ARXIV.2111.12171","ama":"Koval I. Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse. arXiv. doi:10.48550/ARXIV.2111.12171","chicago":"Koval, Illya. “Local Strong Birkhoff Conjecture and Local Spectral Rigidity of Almost Every Ellipse.” ArXiv, n.d. https://doi.org/10.48550/ARXIV.2111.12171.","ista":"Koval I. Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse. arXiv, 2111.12171."},"department":[{"_id":"GradSch"}],"title":"Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse","author":[{"first_name":"Illya","id":"2eed1f3b-896a-11ed-bdf8-93c7c4bf159e","last_name":"Koval","full_name":"Koval, Illya"}],"external_id":{"arxiv":["2111.12171"]},"article_processing_charge":"No","article_number":"2111.12171","_id":"14278","status":"public","type":"preprint"},{"project":[{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","grant_number":"665385"},{"name":"Rigorous Systems Engineering","grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"},{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"}],"article_processing_charge":"No","author":[{"id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","first_name":"Viktor","last_name":"Toman","full_name":"Toman, Viktor","orcid":"0000-0001-9036-063X"}],"title":"Improved verification techniques for concurrent systems","citation":{"chicago":"Toman, Viktor. “Improved Verification Techniques for Concurrent Systems.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10199.","ista":"Toman V. 2021. Improved verification techniques for concurrent systems. Institute of Science and Technology Austria.","mla":"Toman, Viktor. Improved Verification Techniques for Concurrent Systems. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10199.","ieee":"V. Toman, “Improved verification techniques for concurrent systems,” Institute of Science and Technology Austria, 2021.","short":"V. Toman, Improved Verification Techniques for Concurrent Systems, Institute of Science and Technology Austria, 2021.","ama":"Toman V. Improved verification techniques for concurrent systems. 2021. doi:10.15479/at:ista:10199","apa":"Toman, V. (2021). Improved verification techniques for concurrent systems. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10199"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"publisher":"Institute of Science and Technology Austria","page":"166","date_created":"2021-10-29T20:09:01Z","date_published":"2021-10-31T00:00:00Z","doi":"10.15479/at:ista:10199","year":"2021","has_accepted_license":"1","day":"31","type":"dissertation","keyword":["concurrency","verification","model checking"],"status":"public","_id":"10199","file_date_updated":"2021-11-09T09:00:50Z","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"date_updated":"2023-09-19T09:59:54Z","supervisor":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"}],"ddc":["000"],"alternative_title":["ISTA Thesis"],"month":"10","abstract":[{"text":"The design and verification of concurrent systems remains an open challenge due to the non-determinism that arises from the inter-process communication. In particular, concurrent programs are notoriously difficult both to be written correctly and to be analyzed formally, as complex thread interaction has to be accounted for. The difficulties are further exacerbated when concurrent programs get executed on modern-day hardware, which contains various buffering and caching mechanisms for efficiency reasons. This causes further subtle non-determinism, which can often produce very unintuitive behavior of the concurrent programs. Model checking is at the forefront of tackling the verification problem, where the task is to decide, given as input a concurrent system and a desired property, whether the system satisfies the property. The inherent state-space explosion problem in model checking of concurrent systems causes naïve explicit methods not to scale, thus more inventive methods are required. One such method is stateless model checking (SMC), which explores in memory-efficient manner the program executions rather than the states of the program. State-of-the-art SMC is typically coupled with partial order reduction (POR) techniques, which argue that certain executions provably produce identical system behavior, thus limiting the amount of executions one needs to explore in order to cover all possible behaviors. Another method to tackle the state-space explosion is symbolic model checking, where the considered techniques operate on a succinct implicit representation of the input system rather than explicitly accessing the system. In this thesis we present new techniques for verification of concurrent systems. We present several novel POR methods for SMC of concurrent programs under various models of semantics, some of which account for write-buffering mechanisms. Additionally, we present novel algorithms for symbolic model checking of finite-state concurrent systems, where the desired property of the systems is to ensure a formally defined notion of fairness.","lang":"eng"}],"acknowledged_ssus":[{"_id":"SSU"}],"oa_version":"Published Version","ec_funded":1,"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"10190"},{"status":"public","id":"10191","relation":"part_of_dissertation"},{"id":"9987","status":"public","relation":"part_of_dissertation"},{"id":"141","status":"public","relation":"part_of_dissertation"}]},"degree_awarded":"PhD","publication_status":"published","publication_identifier":{"issn":["2663-337X"]},"language":[{"iso":"eng"}],"file":[{"file_id":"10225","checksum":"4f412a1ee60952221b499a4b1268df35","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2021-11-08T14:12:22Z","file_name":"toman_th_final.pdf","date_updated":"2021-11-08T14:12:22Z","file_size":2915234,"creator":"vtoman"},{"creator":"vtoman","file_size":8616056,"date_updated":"2021-11-09T09:00:50Z","file_name":"toman_thesis.zip","date_created":"2021-11-08T14:12:46Z","relation":"source_file","access_level":"closed","content_type":"application/zip","checksum":"9584943f99127be2dd2963f6784c37d4","file_id":"10226"}]},{"article_number":"6972","external_id":{"isi":["000724450600023"]},"article_processing_charge":"No","author":[{"full_name":"Patxot, Marion","last_name":"Patxot","first_name":"Marion"},{"full_name":"Trejo Banos, Daniel","last_name":"Trejo Banos","first_name":"Daniel"},{"last_name":"Kousathanas","full_name":"Kousathanas, Athanasios","first_name":"Athanasios"},{"first_name":"Etienne J","full_name":"Orliac, Etienne J","last_name":"Orliac"},{"last_name":"Ojavee","full_name":"Ojavee, Sven E","first_name":"Sven E"},{"first_name":"Gerhard","full_name":"Moser, Gerhard","last_name":"Moser"},{"full_name":"Sidorenko, Julia","last_name":"Sidorenko","first_name":"Julia"},{"last_name":"Kutalik","full_name":"Kutalik, Zoltan","first_name":"Zoltan"},{"full_name":"Magi, Reedik","last_name":"Magi","first_name":"Reedik"},{"first_name":"Peter M","full_name":"Visscher, Peter M","last_name":"Visscher"},{"first_name":"Lars","last_name":"Ronnegard","full_name":"Ronnegard, Lars"},{"first_name":"Matthew Richard","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","full_name":"Robinson, Matthew Richard","orcid":"0000-0001-8982-8813","last_name":"Robinson"}],"title":"Probabilistic inference of the genetic architecture underlying functional enrichment of complex traits","citation":{"ista":"Patxot M, Trejo Banos D, Kousathanas A, Orliac EJ, Ojavee SE, Moser G, Sidorenko J, Kutalik Z, Magi R, Visscher PM, Ronnegard L, Robinson MR. 2021. Probabilistic inference of the genetic architecture underlying functional enrichment of complex traits. Nature Communications. 12(1), 6972.","chicago":"Patxot, Marion, Daniel Trejo Banos, Athanasios Kousathanas, Etienne J Orliac, Sven E Ojavee, Gerhard Moser, Julia Sidorenko, et al. “Probabilistic Inference of the Genetic Architecture Underlying Functional Enrichment of Complex Traits.” Nature Communications. Springer Nature, 2021. https://doi.org/10.1038/s41467-021-27258-9.","short":"M. Patxot, D. Trejo Banos, A. Kousathanas, E.J. Orliac, S.E. Ojavee, G. Moser, J. Sidorenko, Z. Kutalik, R. Magi, P.M. Visscher, L. Ronnegard, M.R. Robinson, Nature Communications 12 (2021).","ieee":"M. Patxot et al., “Probabilistic inference of the genetic architecture underlying functional enrichment of complex traits,” Nature Communications, vol. 12, no. 1. Springer Nature, 2021.","apa":"Patxot, M., Trejo Banos, D., Kousathanas, A., Orliac, E. J., Ojavee, S. E., Moser, G., … Robinson, M. R. (2021). Probabilistic inference of the genetic architecture underlying functional enrichment of complex traits. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-021-27258-9","ama":"Patxot M, Trejo Banos D, Kousathanas A, et al. Probabilistic inference of the genetic architecture underlying functional enrichment of complex traits. Nature Communications. 2021;12(1). doi:10.1038/s41467-021-27258-9","mla":"Patxot, Marion, et al. “Probabilistic Inference of the Genetic Architecture Underlying Functional Enrichment of Complex Traits.” Nature Communications, vol. 12, no. 1, 6972, Springer Nature, 2021, doi:10.1038/s41467-021-27258-9."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa":1,"publisher":"Springer Nature","quality_controlled":"1","acknowledgement":"This project was funded by an SNSF Eccellenza Grant to MRR (PCEGP3-181181), and by core funding from the Institute of Science and Technology Austria. We would like to thank the participants of the cohort studies, and the Ecole Polytechnique Federal Lausanne (EPFL) SCITAS for their excellent compute resources, their generosity with their time and the kindness of their support. P.M.V. acknowledges funding from the Australian National Health and Medical Research Council (1113400) and the Australian Research Council (FL180100072). L.R. acknowledges funding from the Kjell & Märta Beijer Foundation (Stockholm, Sweden). We also would like to acknowledge Simone Rubinacci, Oliver Delanau, Alexander Terenin, Eleonora Porcu, and Mike Goddard for their useful comments and suggestions.","date_created":"2020-09-17T10:52:38Z","doi":"10.1038/s41467-021-27258-9","date_published":"2021-11-30T00:00:00Z","year":"2021","isi":1,"has_accepted_license":"1","publication":"Nature Communications","day":"30","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","status":"public","_id":"8429","department":[{"_id":"MaRo"}],"file_date_updated":"2021-12-06T07:47:11Z","date_updated":"2023-09-26T10:36:14Z","ddc":["610"],"scopus_import":"1","intvolume":" 12","month":"11","abstract":[{"lang":"eng","text":"We develop a Bayesian model (BayesRR-RC) that provides robust SNP-heritability estimation, an alternative to marker discovery, and accurate genomic prediction, taking 22 seconds per iteration to estimate 8.4 million SNP-effects and 78 SNP-heritability parameters in the UK Biobank. We find that only ≤10% of the genetic variation captured for height, body mass index, cardiovascular disease, and type 2 diabetes is attributable to proximal regulatory regions within 10kb upstream of genes, while 12-25% is attributed to coding regions, 32–44% to introns, and 22-28% to distal 10-500kb upstream regions. Up to 24% of all cis and coding regions of each chromosome are associated with each trait, with over 3,100 independent exonic and intronic regions and over 5,400 independent regulatory regions having ≥95% probability of contributing ≥0.001% to the genetic variance of these four traits. Our open-source software (GMRM) provides a scalable alternative to current approaches for biobank data."}],"oa_version":"Published Version","related_material":{"record":[{"relation":"research_data","id":"13063","status":"public"}]},"volume":12,"issue":"1","publication_status":"published","publication_identifier":{"eissn":["2041-1723"]},"language":[{"iso":"eng"}],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"checksum":"384681be17aff902c149a48f52d13d4f","file_id":"10419","creator":"cchlebak","file_size":6519771,"date_updated":"2021-12-06T07:47:11Z","file_name":"2021_NatComm_Paxtot.pdf","date_created":"2021-12-06T07:47:11Z"}]},{"related_material":{"record":[{"relation":"extended_version","id":"10855","status":"public"}]},"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9781450380720"]},"publication_status":"published","month":"05","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/2005.07637","open_access":"1"}],"oa_version":"Preprint","abstract":[{"text":"Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explore the following question: if some of the local inputs change, can an existing solution be updated efficiently, in a dynamic and distributed manner?\r\nTo address this question, we define the batch dynamic CONGEST model in which we are given a bandwidth-limited communication network and a dynamic edge labelling defines the problem input. The task is to maintain a solution to a graph problem on the labelled graph under batch changes. We investigate, when a batch of alpha edge label changes arrive, - how much time as a function of alpha we need to update an existing solution, and - how much information the nodes have to keep in local memory between batches in order to update the solution quickly.\r\nOur work lays the foundations for the theory of input-dynamic distributed network algorithms. We give a general picture of the complexity landscape in this model, design both universal algorithms and algorithms for concrete problems, and present a general framework for lower bounds. The diverse time complexity of our model spans from constant time, through time polynomial in alpha, and to alpha time, which we show to be enough for any task.","lang":"eng"}],"department":[{"_id":"DaAl"}],"date_updated":"2023-09-26T10:40:55Z","status":"public","type":"conference","conference":{"start_date":"2021-06-14","end_date":"2021-06-18","location":"Virtual, Online","name":"SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems"},"_id":"10854","doi":"10.1145/3410220.3453923","date_published":"2021-05-01T00:00:00Z","date_created":"2022-03-18T08:48:41Z","page":"71-72","day":"01","publication":"Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems","year":"2021","publisher":"Association for Computing Machinery","quality_controlled":"1","oa":1,"acknowledgement":"We thank Jukka Suomela for discussions. We also thank our shepherd Mohammad Hajiesmaili and the reviewers for their time and suggestions on how to improve the paper. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML), from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska–Curie grant agreement No. 840605, from the Vienna Science and Technology Fund (WWTF) project WHATIF, ICT19-045, 2020-2024, and from the Austrian Science Fund (FWF) and netIDEE SCIENCE project P 33775-N.","title":"Input-dynamic distributed algorithms for communication networks","author":[{"last_name":"Foerster","full_name":"Foerster, Klaus-Tycho","first_name":"Klaus-Tycho"},{"last_name":"Korhonen","full_name":"Korhonen, Janne","first_name":"Janne","id":"C5402D42-15BC-11E9-A202-CA2BE6697425"},{"first_name":"Ami","last_name":"Paz","full_name":"Paz, Ami"},{"id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","first_name":"Joel","full_name":"Rybicki, Joel","orcid":"0000-0002-6432-6646","last_name":"Rybicki"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"}],"article_processing_charge":"No","external_id":{"arxiv":["2005.07637"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Foerster, Klaus-Tycho, Janne Korhonen, Ami Paz, Joel Rybicki, and Stefan Schmid. “Input-Dynamic Distributed Algorithms for Communication Networks.” In Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 71–72. Association for Computing Machinery, 2021. https://doi.org/10.1145/3410220.3453923.","ista":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. 2021. Input-dynamic distributed algorithms for communication networks. Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems. SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems, 71–72.","mla":"Foerster, Klaus-Tycho, et al. “Input-Dynamic Distributed Algorithms for Communication Networks.” Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2021, pp. 71–72, doi:10.1145/3410220.3453923.","ama":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed algorithms for communication networks. In: Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems. Association for Computing Machinery; 2021:71-72. doi:10.1145/3410220.3453923","apa":"Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., & Schmid, S. (2021). Input-dynamic distributed algorithms for communication networks. In Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems (pp. 71–72). Virtual, Online: Association for Computing Machinery. https://doi.org/10.1145/3410220.3453923","ieee":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic distributed algorithms for communication networks,” in Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Virtual, Online, 2021, pp. 71–72.","short":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, in:, Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2021, pp. 71–72."},"project":[{"grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"26A5D39A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"840605","name":"Coordination in constrained and natural distributed systems"}]},{"_id":"10855","keyword":["Computer Networks and Communications","Hardware and Architecture","Safety","Risk","Reliability and Quality","Computer Science (miscellaneous)"],"status":"public","article_type":"original","type":"journal_article","date_updated":"2023-09-26T10:40:55Z","department":[{"_id":"DaAl"}],"oa_version":"Preprint","abstract":[{"text":"Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explore the following question: if some of the local inputs change, can an existing solution be updated efficiently, in a dynamic and distributed manner? To address this question, we define the batch dynamic \\congest model in which we are given a bandwidth-limited communication network and a dynamic edge labelling defines the problem input. The task is to maintain a solution to a graph problem on the labeled graph under batch changes. We investigate, when a batch of α edge label changes arrive, \\beginitemize \\item how much time as a function of α we need to update an existing solution, and \\item how much information the nodes have to keep in local memory between batches in order to update the solution quickly. \\enditemize Our work lays the foundations for the theory of input-dynamic distributed network algorithms. We give a general picture of the complexity landscape in this model, design both universal algorithms and algorithms for concrete problems, and present a general framework for lower bounds. In particular, we derive non-trivial upper bounds for two selected, contrasting problems: maintaining a minimum spanning tree and detecting cliques.","lang":"eng"}],"intvolume":" 5","month":"03","main_file_link":[{"url":"https://arxiv.org/abs/2005.07637","open_access":"1"}],"scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["2476-1249"]},"ec_funded":1,"issue":"1","volume":5,"related_material":{"record":[{"id":"10854","status":"public","relation":"shorter_version"}]},"project":[{"name":"Coordination in constrained and natural distributed systems","grant_number":"840605","call_identifier":"H2020","_id":"26A5D39A-B435-11E9-9278-68D0E5697425"},{"name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Foerster, Klaus-Tycho, Janne Korhonen, Ami Paz, Joel Rybicki, and Stefan Schmid. “Input-Dynamic Distributed Algorithms for Communication Networks.” Proceedings of the ACM on Measurement and Analysis of Computing Systems. Association for Computing Machinery, 2021. https://doi.org/10.1145/3447384.","ista":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. 2021. Input-dynamic distributed algorithms for communication networks. Proceedings of the ACM on Measurement and Analysis of Computing Systems. 5(1), 1–33.","mla":"Foerster, Klaus-Tycho, et al. “Input-Dynamic Distributed Algorithms for Communication Networks.” Proceedings of the ACM on Measurement and Analysis of Computing Systems, vol. 5, no. 1, Association for Computing Machinery, 2021, pp. 1–33, doi:10.1145/3447384.","apa":"Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., & Schmid, S. (2021). Input-dynamic distributed algorithms for communication networks. Proceedings of the ACM on Measurement and Analysis of Computing Systems. Association for Computing Machinery. https://doi.org/10.1145/3447384","ama":"Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed algorithms for communication networks. Proceedings of the ACM on Measurement and Analysis of Computing Systems. 2021;5(1):1-33. doi:10.1145/3447384","short":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, Proceedings of the ACM on Measurement and Analysis of Computing Systems 5 (2021) 1–33.","ieee":"K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic distributed algorithms for communication networks,” Proceedings of the ACM on Measurement and Analysis of Computing Systems, vol. 5, no. 1. Association for Computing Machinery, pp. 1–33, 2021."},"title":"Input-dynamic distributed algorithms for communication networks","external_id":{"arxiv":["2005.07637"]},"article_processing_charge":"No","author":[{"full_name":"Foerster, Klaus-Tycho","last_name":"Foerster","first_name":"Klaus-Tycho"},{"first_name":"Janne","id":"C5402D42-15BC-11E9-A202-CA2BE6697425","full_name":"Korhonen, Janne","last_name":"Korhonen"},{"full_name":"Paz, Ami","last_name":"Paz","first_name":"Ami"},{"last_name":"Rybicki","full_name":"Rybicki, Joel","orcid":"0000-0002-6432-6646","first_name":"Joel","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Stefan","full_name":"Schmid, Stefan","last_name":"Schmid"}],"acknowledgement":"We thank Jukka Suomela for discussions. We also thank our shepherd Mohammad Hajiesmaili\r\nand the reviewers for their time and suggestions on how to improve the paper. This project\r\nhas received funding from the European Research Council (ERC) under the European Union’s\r\nHorizon 2020 research and innovation programme (grant agreement No 805223 ScaleML), from the European Union’s Horizon 2020 research and innovation programme under the Marie\r\nSk lodowska–Curie grant agreement No. 840605, from the Vienna Science and Technology Fund (WWTF) project WHATIF, ICT19-045, 2020-2024, and from the Austrian Science Fund (FWF) and netIDEE SCIENCE project P 33775-N.","oa":1,"quality_controlled":"1","publisher":"Association for Computing Machinery","publication":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","day":"01","year":"2021","date_created":"2022-03-18T09:10:27Z","date_published":"2021-03-01T00:00:00Z","doi":"10.1145/3447384","page":"1-33"},{"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"last_name":"Dvořák","full_name":"Dvořák, Wolfgang","first_name":"Wolfgang"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger"},{"last_name":"Svozil","full_name":"Svozil, Alexander","first_name":"Alexander"}],"article_processing_charge":"No","external_id":{"isi":["000657537500003"],"arxiv":["1804.07031"]},"title":"Algorithms and conditional lower bounds for planning problems","citation":{"ista":"Chatterjee K, Dvořák W, Henzinger MH, Svozil A. 2021. Algorithms and conditional lower bounds for planning problems. Artificial Intelligence. 297(8), 103499.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvořák, Monika H Henzinger, and Alexander Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.” Artificial Intelligence. Elsevier, 2021. https://doi.org/10.1016/j.artint.2021.103499.","ieee":"K. Chatterjee, W. Dvořák, M. H. Henzinger, and A. Svozil, “Algorithms and conditional lower bounds for planning problems,” Artificial Intelligence, vol. 297, no. 8. Elsevier, 2021.","short":"K. Chatterjee, W. Dvořák, M.H. Henzinger, A. Svozil, Artificial Intelligence 297 (2021).","ama":"Chatterjee K, Dvořák W, Henzinger MH, Svozil A. Algorithms and conditional lower bounds for planning problems. Artificial Intelligence. 2021;297(8). doi:10.1016/j.artint.2021.103499","apa":"Chatterjee, K., Dvořák, W., Henzinger, M. H., & Svozil, A. (2021). Algorithms and conditional lower bounds for planning problems. Artificial Intelligence. Elsevier. https://doi.org/10.1016/j.artint.2021.103499","mla":"Chatterjee, Krishnendu, et al. “Algorithms and Conditional Lower Bounds for Planning Problems.” Artificial Intelligence, vol. 297, no. 8, 103499, Elsevier, 2021, doi:10.1016/j.artint.2021.103499."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"103499","doi":"10.1016/j.artint.2021.103499","date_published":"2021-03-16T00:00:00Z","date_created":"2021-03-28T22:01:40Z","isi":1,"year":"2021","day":"16","publication":"Artificial Intelligence","quality_controlled":"1","publisher":"Elsevier","oa":1,"department":[{"_id":"KrCh"}],"date_updated":"2023-09-26T10:41:42Z","article_type":"original","type":"journal_article","status":"public","_id":"9293","volume":297,"issue":"8","related_material":{"record":[{"id":"35","status":"public","relation":"earlier_version"}]},"publication_identifier":{"issn":["0004-3702"]},"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.07031"}],"month":"03","intvolume":" 297","abstract":[{"lang":"eng","text":"We consider planning problems for graphs, Markov Decision Processes (MDPs), and games on graphs in an explicit state space. While graphs represent the most basic planning model, MDPs represent interaction with nature and games on graphs represent interaction with an adversarial environment. We consider two planning problems with k different target sets: (a) the coverage problem asks whether there is a plan for each individual target set; and (b) the sequential target reachability problem asks whether the targets can be reached in a given sequence. For the coverage problem, we present a linear-time algorithm for graphs, and quadratic conditional lower bound for MDPs and games on graphs. For the sequential target problem, we present a linear-time algorithm for graphs, a sub-quadratic algorithm for MDPs, and a quadratic conditional lower bound for games on graphs. Our results with conditional lower bounds, based on the boolean matrix multiplication (BMM) conjecture and strong exponential time hypothesis (SETH), establish (i) model-separation results showing that for the coverage problem MDPs and games on graphs are harder than graphs, and for the sequential reachability problem games on graphs are harder than MDPs and graphs; and (ii) problem-separation results showing that for MDPs the coverage problem is harder than the sequential target problem."}],"oa_version":"Preprint"},{"status":"public","type":"research_data_reference","tmp":{"image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)"},"_id":"13063","department":[{"_id":"MaRo"}],"title":"Probabilistic inference of the genetic architecture of functional enrichment of complex traits","author":[{"last_name":"Robinson","full_name":"Robinson, Matthew Richard","orcid":"0000-0001-8982-8813","first_name":"Matthew Richard","id":"E5D42276-F5DA-11E9-8E24-6303E6697425"}],"article_processing_charge":"No","ddc":["570"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Robinson, Matthew Richard. “Probabilistic Inference of the Genetic Architecture of Functional Enrichment of Complex Traits.” Dryad, 2021. https://doi.org/10.5061/dryad.sqv9s4n51.","ista":"Robinson MR. 2021. Probabilistic inference of the genetic architecture of functional enrichment of complex traits, Dryad, 10.5061/dryad.sqv9s4n51.","mla":"Robinson, Matthew Richard. Probabilistic Inference of the Genetic Architecture of Functional Enrichment of Complex Traits. Dryad, 2021, doi:10.5061/dryad.sqv9s4n51.","apa":"Robinson, M. R. (2021). Probabilistic inference of the genetic architecture of functional enrichment of complex traits. Dryad. https://doi.org/10.5061/dryad.sqv9s4n51","ama":"Robinson MR. Probabilistic inference of the genetic architecture of functional enrichment of complex traits. 2021. doi:10.5061/dryad.sqv9s4n51","short":"M.R. Robinson, (2021).","ieee":"M. R. Robinson, “Probabilistic inference of the genetic architecture of functional enrichment of complex traits.” Dryad, 2021."},"date_updated":"2023-09-26T10:36:15Z","month":"11","publisher":"Dryad","main_file_link":[{"url":"https://doi.org/10.5061/dryad.sqv9s4n51","open_access":"1"}],"oa":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We develop a Bayesian model (BayesRR-RC) that provides robust SNP-heritability estimation, an alternative to marker discovery, and accurate genomic prediction, taking 22 seconds per iteration to estimate 8.4 million SNP-effects and 78 SNP-heritability parameters in the UK Biobank. We find that only $\\leq$ 10\\% of the genetic variation captured for height, body mass index, cardiovascular disease, and type 2 diabetes is attributable to proximal regulatory regions within 10kb upstream of genes, while 12-25% is attributed to coding regions, 32-44% to introns, and 22-28% to distal 10-500kb upstream regions. Up to 24% of all cis and coding regions of each chromosome are associated with each trait, with over 3,100 independent exonic and intronic regions and over 5,400 independent regulatory regions having >95% probability of contributing >0.001% to the genetic variance of these four traits. Our open-source software (GMRM) provides a scalable alternative to current approaches for biobank data."}],"doi":"10.5061/dryad.sqv9s4n51","related_material":{"record":[{"id":"8429","status":"public","relation":"used_in_publication"}],"link":[{"url":"https://github.com/medical-genomics-group/gmrm","relation":"software"}]},"date_published":"2021-11-04T00:00:00Z","date_created":"2023-05-23T16:20:16Z","day":"04","year":"2021"},{"acknowledgement":"This work was supported by the European Regional Development Funds and by the Generalitat de Catalunya through the project 2017SGR1246. Y.Z, C.X, M.L, K.X and X.H thank the China Scholarship Council for the scholarship support. MI acknowledges financial support from IST Austria. YL acknowledges funding from the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie grant agreement No. 754411. ICN2\r\nacknowledges funding from Generalitat de Catalunya 2017 SGR 327 and the Spanish MINECO project ENE2017-85087-C3. ICN2 is supported by the Severo Ochoa program from the Spanish MINECO (grant no. SEV-2017-0706) and is funded by the CERCA Program/Generalitat de Catalunya. Part of the present work has been performed in the framework of Universitat Autònoma de Barcelona Materials Science PhD program.","publisher":"Elsevier","quality_controlled":"1","oa":1,"day":"15","publication":"Chemical Engineering Journal","isi":1,"year":"2021","doi":"10.1016/j.cej.2021.129374","date_published":"2021-08-15T00:00:00Z","date_created":"2021-04-04T22:01:20Z","article_number":"129374","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Zhang Y, Xing C, Liu Y, Li M, Xiao K, Guardia P, Lee S, Han X, Moghaddam A, Roa JJ, Arbiol J, Ibáñez M, Pan K, Prato M, Xie Y, Cabot A. 2021. Influence of copper telluride nanodomains on the transport properties of n-type bismuth telluride. Chemical Engineering Journal. 418(8), 129374.","chicago":"Zhang, Yu, Congcong Xing, Yu Liu, Mengyao Li, Ke Xiao, Pablo Guardia, Seungho Lee, et al. “Influence of Copper Telluride Nanodomains on the Transport Properties of N-Type Bismuth Telluride.” Chemical Engineering Journal. Elsevier, 2021. https://doi.org/10.1016/j.cej.2021.129374.","ieee":"Y. Zhang et al., “Influence of copper telluride nanodomains on the transport properties of n-type bismuth telluride,” Chemical Engineering Journal, vol. 418, no. 8. Elsevier, 2021.","short":"Y. Zhang, C. Xing, Y. Liu, M. Li, K. Xiao, P. Guardia, S. Lee, X. Han, A. Moghaddam, J.J. Roa, J. Arbiol, M. Ibáñez, K. Pan, M. Prato, Y. Xie, A. Cabot, Chemical Engineering Journal 418 (2021).","apa":"Zhang, Y., Xing, C., Liu, Y., Li, M., Xiao, K., Guardia, P., … Cabot, A. (2021). Influence of copper telluride nanodomains on the transport properties of n-type bismuth telluride. Chemical Engineering Journal. Elsevier. https://doi.org/10.1016/j.cej.2021.129374","ama":"Zhang Y, Xing C, Liu Y, et al. Influence of copper telluride nanodomains on the transport properties of n-type bismuth telluride. Chemical Engineering Journal. 2021;418(8). doi:10.1016/j.cej.2021.129374","mla":"Zhang, Yu, et al. “Influence of Copper Telluride Nanodomains on the Transport Properties of N-Type Bismuth Telluride.” Chemical Engineering Journal, vol. 418, no. 8, 129374, Elsevier, 2021, doi:10.1016/j.cej.2021.129374."},"title":"Influence of copper telluride nanodomains on the transport properties of n-type bismuth telluride","author":[{"last_name":"Zhang","full_name":"Zhang, Yu","first_name":"Yu"},{"full_name":"Xing, Congcong","last_name":"Xing","first_name":"Congcong"},{"last_name":"Liu","full_name":"Liu, Yu","orcid":"0000-0001-7313-6740","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","first_name":"Yu"},{"full_name":"Li, Mengyao","last_name":"Li","first_name":"Mengyao"},{"first_name":"Ke","last_name":"Xiao","full_name":"Xiao, Ke"},{"last_name":"Guardia","full_name":"Guardia, Pablo","first_name":"Pablo"},{"id":"BB243B88-D767-11E9-B658-BC13E6697425","first_name":"Seungho","last_name":"Lee","orcid":"0000-0002-6962-8598","full_name":"Lee, Seungho"},{"full_name":"Han, Xu","last_name":"Han","first_name":"Xu"},{"first_name":"Ahmad","last_name":"Moghaddam","full_name":"Moghaddam, Ahmad"},{"first_name":"Joan J","last_name":"Roa","full_name":"Roa, Joan J"},{"first_name":"Jordi","full_name":"Arbiol, Jordi","last_name":"Arbiol"},{"full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87","first_name":"Maria"},{"first_name":"Kai","last_name":"Pan","full_name":"Pan, Kai"},{"last_name":"Prato","full_name":"Prato, Mirko","first_name":"Mirko"},{"first_name":"Ying","last_name":"Xie","full_name":"Xie, Ying"},{"full_name":"Cabot, Andreu","last_name":"Cabot","first_name":"Andreu"}],"external_id":{"isi":["000655672000005"]},"article_processing_charge":"No","oa_version":"Submitted Version","abstract":[{"text":"The high processing cost, poor mechanical properties and moderate performance of Bi2Te3–based alloys used in thermoelectric devices limit the cost-effectiveness of this energy conversion technology. Towards solving these current challenges, in the present work, we detail a low temperature solution-based approach to produce Bi2Te3-Cu2-xTe nanocomposites with improved thermoelectric performance. Our approach consists in combining proper ratios of colloidal nanoparticles and to consolidate the resulting mixture into nanocomposites using a hot press. The transport properties of the nanocomposites are characterized and compared with those of pure Bi2Te3 nanomaterials obtained following the same procedure. In contrast with most previous works, the presence of Cu2-xTe nanodomains does not result in a significant reduction of the lattice thermal conductivity of the reference Bi2Te3 nanomaterial, which is already very low. However, the introduction of Cu2-xTe yields a nearly threefold increase of the power factor associated to a simultaneous increase of the Seebeck coefficient and electrical conductivity at temperatures above 400 K. Taking into account the band alignment of the two materials, we rationalize this increase by considering that Cu2-xTe nanostructures, with a relatively low electron affinity, are able to inject electrons into Bi2Te3, enhancing in this way its electrical conductivity. The simultaneous increase of the Seebeck coefficient is related to the energy filtering of charge carriers at energy barriers within Bi2Te3 domains associated with the accumulation of electrons in regions nearby a Cu2-xTe/Bi2Te3 heterojunction. Overall, with the incorporation of a proper amount of Cu2-xTe nanoparticles, we demonstrate a 250% improvement of the thermoelectric figure of merit of Bi2Te3.","lang":"eng"}],"month":"08","intvolume":" 418","scopus_import":"1","main_file_link":[{"url":"https://ddd.uab.cat/record/271949","open_access":"1"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1385-8947"]},"publication_status":"published","volume":418,"issue":"8","ec_funded":1,"_id":"9304","status":"public","type":"journal_article","article_type":"original","date_updated":"2023-09-27T07:36:29Z","department":[{"_id":"MaIb"}]},{"date_updated":"2023-09-27T07:46:09Z","department":[{"_id":"SiHi"}],"_id":"9793","status":"public","type":"journal_article","article_type":"original","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0896-6273"],"eissn":["1097-4199"]},"ec_funded":1,"volume":109,"issue":"15","pmid":1,"oa_version":"Published Version","abstract":[{"text":"Astrocytes extensively infiltrate the neuropil to regulate critical aspects of synaptic development and function. This process is regulated by transcellular interactions between astrocytes and neurons via cell adhesion molecules. How astrocytes coordinate developmental processes among one another to parse out the synaptic neuropil and form non-overlapping territories is unknown. Here we identify a molecular mechanism regulating astrocyte-astrocyte interactions during development to coordinate astrocyte morphogenesis and gap junction coupling. We show that hepaCAM, a disease-linked, astrocyte-enriched cell adhesion molecule, regulates astrocyte competition for territory and morphological complexity in the developing mouse cortex. Furthermore, conditional deletion of Hepacam from developing astrocytes significantly impairs gap junction coupling between astrocytes and disrupts the balance between synaptic excitation and inhibition. Mutations in HEPACAM cause megalencephalic leukoencephalopathy with subcortical cysts in humans. Therefore, our findings suggest that disruption of astrocyte self-organization mechanisms could be an underlying cause of neural pathology.","lang":"eng"}],"intvolume":" 109","month":"08","main_file_link":[{"url":"https://doi.org/10.1016/j.neuron.2021.05.025","open_access":"1"}],"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Baldwin, Katherine T., et al. “HepaCAM Controls Astrocyte Self-Organization and Coupling.” Neuron, vol. 109, no. 15, Elsevier, 2021, p. 2427–2442.e10, doi:10.1016/j.neuron.2021.05.025.","apa":"Baldwin, K. T., Tan, C. X., Strader, S. T., Jiang, C., Savage, J. T., Elorza-Vidal, X., … Eroglu, C. (2021). HepaCAM controls astrocyte self-organization and coupling. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2021.05.025","ama":"Baldwin KT, Tan CX, Strader ST, et al. HepaCAM controls astrocyte self-organization and coupling. Neuron. 2021;109(15):2427-2442.e10. doi:10.1016/j.neuron.2021.05.025","short":"K.T. Baldwin, C.X. Tan, S.T. Strader, C. Jiang, J.T. Savage, X. Elorza-Vidal, X. Contreras, T. Rülicke, S. Hippenmeyer, R. Estévez, R.-R. Ji, C. Eroglu, Neuron 109 (2021) 2427–2442.e10.","ieee":"K. T. Baldwin et al., “HepaCAM controls astrocyte self-organization and coupling,” Neuron, vol. 109, no. 15. Elsevier, p. 2427–2442.e10, 2021.","chicago":"Baldwin, Katherine T., Christabel X. Tan, Samuel T. Strader, Changyu Jiang, Justin T. Savage, Xabier Elorza-Vidal, Ximena Contreras, et al. “HepaCAM Controls Astrocyte Self-Organization and Coupling.” Neuron. Elsevier, 2021. https://doi.org/10.1016/j.neuron.2021.05.025.","ista":"Baldwin KT, Tan CX, Strader ST, Jiang C, Savage JT, Elorza-Vidal X, Contreras X, Rülicke T, Hippenmeyer S, Estévez R, Ji R-R, Eroglu C. 2021. HepaCAM controls astrocyte self-organization and coupling. Neuron. 109(15), 2427–2442.e10."},"title":"HepaCAM controls astrocyte self-organization and coupling","external_id":{"pmid":["34171291"],"isi":["000692851900010"]},"article_processing_charge":"No","author":[{"first_name":"Katherine T.","last_name":"Baldwin","full_name":"Baldwin, Katherine T."},{"first_name":"Christabel X.","full_name":"Tan, Christabel X.","last_name":"Tan"},{"full_name":"Strader, Samuel T.","last_name":"Strader","first_name":"Samuel T."},{"first_name":"Changyu","full_name":"Jiang, Changyu","last_name":"Jiang"},{"full_name":"Savage, Justin T.","last_name":"Savage","first_name":"Justin T."},{"first_name":"Xabier","full_name":"Elorza-Vidal, Xabier","last_name":"Elorza-Vidal"},{"first_name":"Ximena","id":"475990FE-F248-11E8-B48F-1D18A9856A87","full_name":"Contreras, Ximena","last_name":"Contreras"},{"first_name":"Thomas","last_name":"Rülicke","full_name":"Rülicke, Thomas"},{"full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061","last_name":"Hippenmeyer","id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon"},{"full_name":"Estévez, Raúl","last_name":"Estévez","first_name":"Raúl"},{"last_name":"Ji","full_name":"Ji, Ru-Rong","first_name":"Ru-Rong"},{"full_name":"Eroglu, Cagla","last_name":"Eroglu","first_name":"Cagla"}],"project":[{"_id":"260018B0-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development","grant_number":"725780"}],"publication":"Neuron","day":"04","year":"2021","isi":1,"date_created":"2021-08-06T09:08:25Z","doi":"10.1016/j.neuron.2021.05.025","date_published":"2021-08-04T00:00:00Z","page":"2427-2442.e10","acknowledgement":"This work was supported by the National Institutes of Health (R01 DA047258 and R01 NS102237 to C.E., F32 NS100392 to K.T.B.) and the Holland-Trice Brain Research Award (to C.E.). K.T.B. was supported by postdoctoral fellowships from the Foerster-Bernstein Family and The Hartwell Foundation. The Hippenmeyer lab was supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovations program (725780 LinPro) to S.H. R.E. was supported by Ministerio de Ciencia y Tecnología (RTI2018-093493-B-I00). We thank the Duke Light Microscopy Core Facility, the Duke Transgenic Mouse Facility, Dr. U. Schulte for assistance with proteomic experiments, and Dr. D. Silver for critical review of the manuscript. Cartoon elements of figure panels were created using BioRender.com.","oa":1,"publisher":"Elsevier","quality_controlled":"1"},{"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"}],"article_number":"105991","title":"Doping-mediated stabilization of copper vacancies to promote thermoelectric properties of Cu2-xS","author":[{"last_name":"Zhang","full_name":"Zhang, Yu","first_name":"Yu"},{"full_name":"Xing, Congcong","last_name":"Xing","first_name":"Congcong"},{"last_name":"Liu","orcid":"0000-0001-7313-6740","full_name":"Liu, Yu","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","first_name":"Yu"},{"full_name":"Spadaro, Maria Chiara","last_name":"Spadaro","first_name":"Maria Chiara"},{"last_name":"Wang","full_name":"Wang, Xiang","first_name":"Xiang"},{"last_name":"Li","full_name":"Li, Mengyao","first_name":"Mengyao"},{"last_name":"Xiao","full_name":"Xiao, Ke","first_name":"Ke"},{"last_name":"Zhang","full_name":"Zhang, Ting","first_name":"Ting"},{"first_name":"Pablo","last_name":"Guardia","full_name":"Guardia, Pablo"},{"last_name":"Lim","full_name":"Lim, Khak Ho","first_name":"Khak Ho"},{"first_name":"Ahmad Ostovari","last_name":"Moghaddam","full_name":"Moghaddam, Ahmad Ostovari"},{"full_name":"Llorca, Jordi","last_name":"Llorca","first_name":"Jordi"},{"first_name":"Jordi","full_name":"Arbiol, Jordi","last_name":"Arbiol"},{"orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria","last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87","first_name":"Maria"},{"full_name":"Cabot, Andreu","last_name":"Cabot","first_name":"Andreu"}],"external_id":{"isi":["000663442200004"]},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"Y. Zhang, C. Xing, Y. Liu, M.C. Spadaro, X. Wang, M. Li, K. Xiao, T. Zhang, P. Guardia, K.H. Lim, A.O. Moghaddam, J. Llorca, J. Arbiol, M. Ibáñez, A. Cabot, Nano Energy 85 (2021).","ieee":"Y. Zhang et al., “Doping-mediated stabilization of copper vacancies to promote thermoelectric properties of Cu2-xS,” Nano Energy, vol. 85, no. 7. Elsevier, 2021.","apa":"Zhang, Y., Xing, C., Liu, Y., Spadaro, M. C., Wang, X., Li, M., … Cabot, A. (2021). Doping-mediated stabilization of copper vacancies to promote thermoelectric properties of Cu2-xS. Nano Energy. Elsevier. https://doi.org/10.1016/j.nanoen.2021.105991","ama":"Zhang Y, Xing C, Liu Y, et al. Doping-mediated stabilization of copper vacancies to promote thermoelectric properties of Cu2-xS. Nano Energy. 2021;85(7). doi:10.1016/j.nanoen.2021.105991","mla":"Zhang, Yu, et al. “Doping-Mediated Stabilization of Copper Vacancies to Promote Thermoelectric Properties of Cu2-XS.” Nano Energy, vol. 85, no. 7, 105991, Elsevier, 2021, doi:10.1016/j.nanoen.2021.105991.","ista":"Zhang Y, Xing C, Liu Y, Spadaro MC, Wang X, Li M, Xiao K, Zhang T, Guardia P, Lim KH, Moghaddam AO, Llorca J, Arbiol J, Ibáñez M, Cabot A. 2021. Doping-mediated stabilization of copper vacancies to promote thermoelectric properties of Cu2-xS. Nano Energy. 85(7), 105991.","chicago":"Zhang, Yu, Congcong Xing, Yu Liu, Maria Chiara Spadaro, Xiang Wang, Mengyao Li, Ke Xiao, et al. “Doping-Mediated Stabilization of Copper Vacancies to Promote Thermoelectric Properties of Cu2-XS.” Nano Energy. Elsevier, 2021. https://doi.org/10.1016/j.nanoen.2021.105991."},"quality_controlled":"1","publisher":"Elsevier","oa":1,"acknowledgement":"This work was supported by the European Regional Development Fund and by the Spanish Ministerio de Economía y Competitividad through the project SEHTOP (ENE2016-77798-C4-3-R). MI acknowledges financial support from IST Austria. YL acknowledges funding from the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie grant agreement No. 754411. YZ, CX, XW, KX and TZ thank the China Scholarship Council for the scholarship support. ICN2 acknowledges funding from Generalitat de Catalunya 2017 SGR 327 and the Spanish MINECO project ENE2017-85087-C3. ICN2 is supported by the Severo Ochoa program from the Spanish MINECO (grant no. SEV-2017-0706) and is funded by the CERCA program/Generalitat de Catalunya. Part of the present work has been performed in the framework of Universitat Autònoma de Barcelona Materials Science Ph.D. program. M.C.S. has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754510 (PROBIST) and the Severo Ochoa programme. P.G. acknowledges financial support from the Spanish government (MICIU) through the RTI2018-102006-J-I00 project and the Catalan Agency of Competitiveness (ACCIO) through the TecnioSpring+ Marie Sklodowska-Curie action TECSPR16-1-0082. YZ and CX contributed equally to this work.","doi":"10.1016/j.nanoen.2021.105991","date_published":"2021-07-01T00:00:00Z","date_created":"2021-04-04T22:01:21Z","day":"01","publication":"Nano Energy","isi":1,"year":"2021","status":"public","article_type":"original","type":"journal_article","_id":"9305","department":[{"_id":"MaIb"}],"date_updated":"2023-09-27T07:41:00Z","month":"07","intvolume":" 85","scopus_import":"1","main_file_link":[{"url":"https://ddd.uab.cat/record/271947","open_access":"1"}],"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"Copper chalcogenides are outstanding thermoelectric materials for applications in the medium-high temperature range. Among different chalcogenides, while Cu2−xSe is characterized by higher thermoelectric figures of merit, Cu2−xS provides advantages in terms of low cost and element abundance. In the present work, we investigate the effect of different dopants to enhance the Cu2−xS performance and also its thermal stability. Among the tested options, Pb-doped Cu2−xS shows the highest improvement in stability against sulfur volatilization. Additionally, Pb incorporation allows tuning charge carrier concentration, which enables a significant improvement of the power factor. We demonstrate here that the introduction of an optimal additive amount of just 0.3% results in a threefold increase of the power factor in the middle-temperature range (500–800 K) and a record dimensionless thermoelectric figure of merit above 2 at 880 K."}],"issue":"7","volume":85,"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2211-2855"]},"publication_status":"published"},{"acknowledgement":"We apologize to all the authors whose scientific work could not be cited and discussed because of space restrictions. We thank Dr. Inge Verstraeten (ISTAustria) and Dr. Juan Carlos Montesinos-Lopez (ETH Zürich) for helpful suggestions. This work was supported by the DOC Fellowship Programme of the Austrian Academy of Sciences (25008) to C.A.","oa":1,"quality_controlled":"1","publisher":"Cold Spring Harbor Laboratory Press","year":"2021","isi":1,"publication":"Cold Spring Harbor Perspectives in Biology","day":"01","date_created":"2021-03-01T10:08:32Z","doi":"10.1101/cshperspect.a039941","date_published":"2021-07-01T00:00:00Z","article_number":"a039941","project":[{"name":"Hormonal regulation of plant adaptive responses to environmental signals","_id":"2685A872-B435-11E9-9278-68D0E5697425"}],"citation":{"ista":"Cavallari N, Artner C, Benková E. 2021. Auxin-regulated lateral root organogenesis. Cold Spring Harbor Perspectives in Biology. 13(7), a039941.","chicago":"Cavallari, Nicola, Christina Artner, and Eva Benková. “Auxin-Regulated Lateral Root Organogenesis.” Cold Spring Harbor Perspectives in Biology. Cold Spring Harbor Laboratory Press, 2021. https://doi.org/10.1101/cshperspect.a039941.","ama":"Cavallari N, Artner C, Benková E. Auxin-regulated lateral root organogenesis. Cold Spring Harbor Perspectives in Biology. 2021;13(7). doi:10.1101/cshperspect.a039941","apa":"Cavallari, N., Artner, C., & Benková, E. (2021). Auxin-regulated lateral root organogenesis. Cold Spring Harbor Perspectives in Biology. Cold Spring Harbor Laboratory Press. https://doi.org/10.1101/cshperspect.a039941","ieee":"N. Cavallari, C. Artner, and E. Benková, “Auxin-regulated lateral root organogenesis,” Cold Spring Harbor Perspectives in Biology, vol. 13, no. 7. Cold Spring Harbor Laboratory Press, 2021.","short":"N. Cavallari, C. Artner, E. Benková, Cold Spring Harbor Perspectives in Biology 13 (2021).","mla":"Cavallari, Nicola, et al. “Auxin-Regulated Lateral Root Organogenesis.” Cold Spring Harbor Perspectives in Biology, vol. 13, no. 7, a039941, Cold Spring Harbor Laboratory Press, 2021, doi:10.1101/cshperspect.a039941."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","external_id":{"pmid":["33558367"],"isi":["000692069100001"]},"author":[{"last_name":"Cavallari","full_name":"Cavallari, Nicola","first_name":"Nicola","id":"457160E6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Christina","id":"45DF286A-F248-11E8-B48F-1D18A9856A87","last_name":"Artner","full_name":"Artner, Christina"},{"first_name":"Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8510-9739","full_name":"Benková, Eva","last_name":"Benková"}],"title":"Auxin-regulated lateral root organogenesis","abstract":[{"text":"Plant fitness is largely dependent on the root, the underground organ, which, besides its anchoring function, supplies the plant body with water and all nutrients necessary for growth and development. To exploit the soil effectively, roots must constantly integrate environmental signals and react through adjustment of growth and development. Important components of the root management strategy involve a rapid modulation of the root growth kinetics and growth direction, as well as an increase of the root system radius through formation of lateral roots (LRs). At the molecular level, such a fascinating growth and developmental flexibility of root organ requires regulatory networks that guarantee stability of the developmental program but also allows integration of various environmental inputs. The plant hormone auxin is one of the principal endogenous regulators of root system architecture by controlling primary root growth and formation of LR. In this review, we discuss recent progress in understanding molecular networks where auxin is one of the main players shaping the root system and acting as mediator between endogenous cues and environmental factors.","lang":"eng"}],"pmid":1,"oa_version":"Published Version","main_file_link":[{"url":"https://doi.org/10.1101/cshperspect.a039941","open_access":"1"}],"scopus_import":"1","intvolume":" 13","month":"07","publication_status":"published","publication_identifier":{"issn":["1943-0264"]},"language":[{"iso":"eng"}],"volume":13,"issue":"7","_id":"9212","article_type":"original","type":"journal_article","status":"public","date_updated":"2023-09-27T06:44:06Z","department":[{"_id":"EvBe"}]},{"publication":"Brain, Behavior, and Immunity","day":"01","year":"2021","isi":1,"date_created":"2021-08-22T22:01:21Z","date_published":"2021-10-01T00:00:00Z","doi":"10.1016/j.bbi.2021.07.022","page":"423-439","acknowledgement":"We acknowledge that Université Laval stands on the traditional and unceded land of the Huron-Wendat peoples; and that the University of Victoria exists on the territory of the Lekwungen peoples and that the Songhees, Esquimalt and WSÁNEÆ peoples have relationships to this land. We thank Emmanuel Planel for the access to the epifluorescence microscope and Julie-Christine Lévesque at the Bioimaging Platform of CRCHU de Québec-Université Laval for technical assistance. We also thank the Centre for Advanced Materials and Related Technology for the access to the confocal microscope with Airyscan. K.P. was supported by a doctoral scholarship from Fonds de Recherche du Québec – Santé (FRQS), an excellence award from Fondation du CHU de Québec, as well as from Centre Thématique de Recherche en Neurosciences and from Fondation Famille-Choquette. K.B. was supported by excellence scholarships from Université Laval and Fondation du CHU de Québec. S.G. is supported by FIRC-AIRC fellowship for Italy 22329/2018 and by Pilot ARISLA NKINALS 2019. C.W.H. and J.C.S. were supported by postdoctoral fellowships from FRQS. This study was funded by a Natural Sciences and Engineering Research Council of Canada (NSERC) Discovery grant (RGPIN-2014-05308) awarded to M.E.T., by ERANET neuron 2017 MicroSynDep to M.E.T. and I.B., and by the Italian Ministry of Health, grant RF-2018-12367249 to I.B, by PRIN 2017, AIRC 2019 and Ministero della Salute RF2018 to C.L. M.E.T. is a Tier II Canada Research Chair in Neurobiology of Aging and Cognition.","oa":1,"publisher":"Elsevier","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Picard, K., Bisht, K., Poggini, S., Garofalo, S., Golia, M. T., Basilico, B., … Tremblay, M. È. (2021). Microglial-glucocorticoid receptor depletion alters the response of hippocampal microglia and neurons in a chronic unpredictable mild stress paradigm in female mice. Brain, Behavior, and Immunity. Elsevier. https://doi.org/10.1016/j.bbi.2021.07.022","ama":"Picard K, Bisht K, Poggini S, et al. Microglial-glucocorticoid receptor depletion alters the response of hippocampal microglia and neurons in a chronic unpredictable mild stress paradigm in female mice. Brain, Behavior, and Immunity. 2021;97:423-439. doi:10.1016/j.bbi.2021.07.022","ieee":"K. Picard et al., “Microglial-glucocorticoid receptor depletion alters the response of hippocampal microglia and neurons in a chronic unpredictable mild stress paradigm in female mice,” Brain, Behavior, and Immunity, vol. 97. Elsevier, pp. 423–439, 2021.","short":"K. Picard, K. Bisht, S. Poggini, S. Garofalo, M.T. Golia, B. Basilico, F. Abdallah, N. Ciano Albanese, I. Amrein, N. Vernoux, K. Sharma, C.W. Hui, J. C. Savage, C. Limatola, D. Ragozzino, L. Maggi, I. Branchi, M.È. Tremblay, Brain, Behavior, and Immunity 97 (2021) 423–439.","mla":"Picard, Katherine, et al. “Microglial-Glucocorticoid Receptor Depletion Alters the Response of Hippocampal Microglia and Neurons in a Chronic Unpredictable Mild Stress Paradigm in Female Mice.” Brain, Behavior, and Immunity, vol. 97, Elsevier, 2021, pp. 423–39, doi:10.1016/j.bbi.2021.07.022.","ista":"Picard K, Bisht K, Poggini S, Garofalo S, Golia MT, Basilico B, Abdallah F, Ciano Albanese N, Amrein I, Vernoux N, Sharma K, Hui CW, C. Savage J, Limatola C, Ragozzino D, Maggi L, Branchi I, Tremblay MÈ. 2021. Microglial-glucocorticoid receptor depletion alters the response of hippocampal microglia and neurons in a chronic unpredictable mild stress paradigm in female mice. Brain, Behavior, and Immunity. 97, 423–439.","chicago":"Picard, Katherine, Kanchan Bisht, Silvia Poggini, Stefano Garofalo, Maria Teresa Golia, Bernadette Basilico, Fatima Abdallah, et al. “Microglial-Glucocorticoid Receptor Depletion Alters the Response of Hippocampal Microglia and Neurons in a Chronic Unpredictable Mild Stress Paradigm in Female Mice.” Brain, Behavior, and Immunity. Elsevier, 2021. https://doi.org/10.1016/j.bbi.2021.07.022."},"title":"Microglial-glucocorticoid receptor depletion alters the response of hippocampal microglia and neurons in a chronic unpredictable mild stress paradigm in female mice","article_processing_charge":"No","external_id":{"pmid":["34343616"],"isi":["000702878400007"]},"author":[{"first_name":"Katherine","last_name":"Picard","full_name":"Picard, Katherine"},{"last_name":"Bisht","full_name":"Bisht, Kanchan","first_name":"Kanchan"},{"last_name":"Poggini","full_name":"Poggini, Silvia","first_name":"Silvia"},{"first_name":"Stefano","full_name":"Garofalo, Stefano","last_name":"Garofalo"},{"first_name":"Maria Teresa","last_name":"Golia","full_name":"Golia, Maria Teresa"},{"id":"36035796-5ACA-11E9-A75E-7AF2E5697425","first_name":"Bernadette","last_name":"Basilico","orcid":"0000-0003-1843-3173","full_name":"Basilico, Bernadette"},{"last_name":"Abdallah","full_name":"Abdallah, Fatima","first_name":"Fatima"},{"full_name":"Ciano Albanese, Naomi","last_name":"Ciano Albanese","first_name":"Naomi"},{"first_name":"Irmgard","last_name":"Amrein","full_name":"Amrein, Irmgard"},{"first_name":"Nathalie","last_name":"Vernoux","full_name":"Vernoux, Nathalie"},{"last_name":"Sharma","full_name":"Sharma, Kaushik","first_name":"Kaushik"},{"full_name":"Hui, Chin Wai","last_name":"Hui","first_name":"Chin Wai"},{"first_name":"Julie","full_name":"C. Savage, Julie","last_name":"C. Savage"},{"full_name":"Limatola, Cristina","last_name":"Limatola","first_name":"Cristina"},{"full_name":"Ragozzino, Davide","last_name":"Ragozzino","first_name":"Davide"},{"full_name":"Maggi, Laura","last_name":"Maggi","first_name":"Laura"},{"first_name":"Igor","last_name":"Branchi","full_name":"Branchi, Igor"},{"first_name":"Marie Ève","last_name":"Tremblay","full_name":"Tremblay, Marie Ève"}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0889-1591"]},"volume":97,"oa_version":"Submitted Version","pmid":1,"abstract":[{"text":"Chronic psychological stress is one of the most important triggers and environmental risk factors for neuropsychiatric disorders. Chronic stress can influence all organs via the secretion of stress hormones, including glucocorticoids by the adrenal glands, which coordinate the stress response across the body. In the brain, glucocorticoid receptors (GR) are expressed by various cell types including microglia, which are its resident immune cells regulating stress-induced inflammatory processes. To study the roles of microglial GR under normal homeostatic conditions and following chronic stress, we generated a mouse model in which the GR gene is depleted in microglia specifically at adulthood to prevent developmental confounds. We first confirmed that microglia were depleted in GR in our model in males and females among the cingulate cortex and the hippocampus, both stress-sensitive brain regions. Then, cohorts of microglial-GR depleted and wild-type (WT) adult female mice were housed for 3 weeks in a standard or stressful condition, using a chronic unpredictable mild stress (CUMS) paradigm. CUMS induced stress-related behavior in both microglial-GR depleted and WT animals as demonstrated by a decrease of both saccharine preference and progressive ratio breakpoint. Nevertheless, the hippocampal microglial and neural mechanisms underlying the adaptation to stress occurred differently between the two genotypes. Upon CUMS exposure, microglial morphology was altered in the WT controls, without any apparent effect in microglial-GR depleted mice. Furthermore, in the standard environment condition, GR depleted-microglia showed increased expression of pro-inflammatory genes, and genes involved in microglial homeostatic functions (such as Trem2, Cx3cr1 and Mertk). On the contrary, in CUMS condition, GR depleted-microglia showed reduced expression levels of pro-inflammatory genes and increased neuroprotective as well as anti-inflammatory genes compared to WT-microglia. Moreover, in microglial-GR depleted mice, but not in WT mice, CUMS led to a significant reduction of CA1 long-term potentiation and paired-pulse ratio. Lastly, differences in adult hippocampal neurogenesis were observed between the genotypes during normal homeostatic conditions, with microglial-GR deficiency increasing the formation of newborn neurons in the dentate gyrus subgranular zone independently from stress exposure. Together, these findings indicate that, although the deletion of microglial GR did not prevent the animal’s ability to respond to stress, it contributed to modulating hippocampal functions in both standard and stressful conditions, notably by shaping the microglial response to chronic stress.","lang":"eng"}],"intvolume":" 97","month":"10","main_file_link":[{"open_access":"1","url":"https://www.zora.uzh.ch/id/eprint/208855/1/ZORA208855.pdf"}],"scopus_import":"1","date_updated":"2023-10-03T09:49:18Z","department":[{"_id":"GaNo"}],"_id":"9953","status":"public","article_type":"original","type":"journal_article"},{"citation":{"chicago":"Li, Mengyao, Yu Liu, Yu Zhang, Xu Han, Ke Xiao, Mehran Nabahat, Jordi Arbiol, Jordi Llorca, Maria Ibáñez, and Andreu Cabot. “PbS–Pb–CuxS Composites for Thermoelectric Application.” ACS Applied Materials and Interfaces. American Chemical Society , 2021. https://doi.org/10.1021/acsami.1c15609.","ista":"Li M, Liu Y, Zhang Y, Han X, Xiao K, Nabahat M, Arbiol J, Llorca J, Ibáñez M, Cabot A. 2021. PbS–Pb–CuxS composites for thermoelectric application. ACS Applied Materials and Interfaces. 13(43), 51373–51382.","mla":"Li, Mengyao, et al. “PbS–Pb–CuxS Composites for Thermoelectric Application.” ACS Applied Materials and Interfaces, vol. 13, no. 43, American Chemical Society , 2021, pp. 51373–51382, doi:10.1021/acsami.1c15609.","ieee":"M. Li et al., “PbS–Pb–CuxS composites for thermoelectric application,” ACS Applied Materials and Interfaces, vol. 13, no. 43. American Chemical Society , pp. 51373–51382, 2021.","short":"M. Li, Y. Liu, Y. Zhang, X. Han, K. Xiao, M. Nabahat, J. Arbiol, J. Llorca, M. Ibáñez, A. Cabot, ACS Applied Materials and Interfaces 13 (2021) 51373–51382.","ama":"Li M, Liu Y, Zhang Y, et al. PbS–Pb–CuxS composites for thermoelectric application. ACS Applied Materials and Interfaces. 2021;13(43):51373–51382. doi:10.1021/acsami.1c15609","apa":"Li, M., Liu, Y., Zhang, Y., Han, X., Xiao, K., Nabahat, M., … Cabot, A. (2021). PbS–Pb–CuxS composites for thermoelectric application. ACS Applied Materials and Interfaces. American Chemical Society . https://doi.org/10.1021/acsami.1c15609"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Mengyao","last_name":"Li","full_name":"Li, Mengyao"},{"full_name":"Liu, Yu","orcid":"0000-0001-7313-6740","last_name":"Liu","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","first_name":"Yu"},{"first_name":"Yu","last_name":"Zhang","full_name":"Zhang, Yu"},{"full_name":"Han, Xu","last_name":"Han","first_name":"Xu"},{"last_name":"Xiao","full_name":"Xiao, Ke","first_name":"Ke"},{"first_name":"Mehran","full_name":"Nabahat, Mehran","last_name":"Nabahat"},{"first_name":"Jordi","last_name":"Arbiol","full_name":"Arbiol, Jordi"},{"first_name":"Jordi","full_name":"Llorca, Jordi","last_name":"Llorca"},{"first_name":"Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez","orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria"},{"first_name":"Andreu","last_name":"Cabot","full_name":"Cabot, Andreu"}],"article_processing_charge":"No","external_id":{"pmid":["34665616"],"isi":["000715852100070"]},"title":"PbS–Pb–CuxS composites for thermoelectric application","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"},{"_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A","name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery"}],"isi":1,"year":"2021","day":"19","publication":"ACS Applied Materials and Interfaces","page":"51373–51382","doi":"10.1021/acsami.1c15609","date_published":"2021-10-19T00:00:00Z","date_created":"2021-11-21T23:01:30Z","acknowledgement":"This work was supported by the European Regional Development Funds. M.L., Y.Z., X.H., and K.X. thank the China Scholarship Council for scholarship support. M. I. has been financially supported by IST Austria and the Werner Siemens Foundation. Y.L. acknowledges funding from the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie grant agreement No. 754411. J.L. is a Serra Húnter fellow and is grateful to ICREA Academia program and projects MICINN/FEDER RTI2018-093996-B-C31 and GC 2017 SGR 128. ICN2 acknowledges funding from Generalitat de Catalunya 2017 SGR 327 and the Spanish MINECO project NANOGEN (PID2020-116093RB-C43). ICN2 was supported by the Severo Ochoa program from Spanish MINECO (grant no. SEV-2017-0706) and was funded by the CERCA Programme/Generalitat de Catalunya. X.H. thanks China Scholarship Council for scholarship support (201804910551). Part of the present work was performed in the framework of Universitat Autònoma de Barcelona Materials Science Ph.D. program.","quality_controlled":"1","publisher":"American Chemical Society ","oa":1,"date_updated":"2023-10-03T09:55:33Z","department":[{"_id":"MaIb"}],"_id":"10327","article_type":"original","type":"journal_article","status":"public","keyword":["CuxS","PbS","energy conversion","nanocomposite","nanoparticle","solution synthesis","thermoelectric"],"publication_identifier":{"eissn":["1944-8252"],"issn":["1944-8244"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":13,"issue":"43","ec_funded":1,"abstract":[{"lang":"eng","text":"Composite materials offer numerous advantages in a wide range of applications, including thermoelectrics. Here, semiconductor–metal composites are produced by just blending nanoparticles of a sulfide semiconductor obtained in aqueous solution and at room temperature with a metallic Cu powder. The obtained blend is annealed in a reducing atmosphere and afterward consolidated into dense polycrystalline pellets through spark plasma sintering (SPS). We observe that, during the annealing process, the presence of metallic copper activates a partial reduction of the PbS, resulting in the formation of PbS–Pb–CuxS composites. The presence of metallic lead during the SPS process habilitates the liquid-phase sintering of the composite. Besides, by comparing the transport properties of PbS, the PbS–Pb–CuxS composites, and PbS–CuxS composites obtained by blending PbS and CuxS nanoparticles, we demonstrate that the presence of metallic lead decisively contributes to a strong increase of the charge carrier concentration through spillover of charge carriers enabled by the low work function of lead. The increase in charge carrier concentration translates into much higher electrical conductivities and moderately lower Seebeck coefficients. These properties translate into power factors up to 2.1 mW m–1 K–2 at ambient temperature, well above those of PbS and PbS + CuxS. Additionally, the presence of multiple phases in the final composite results in a notable decrease in the lattice thermal conductivity. Overall, the introduction of metallic copper in the initial blend results in a significant improvement of the thermoelectric performance of PbS, reaching a dimensionless thermoelectric figure of merit ZT = 1.1 at 750 K, which represents about a 400% increase over bare PbS. Besides, an average ZTave = 0.72 in the temperature range 320–773 K is demonstrated."}],"pmid":1,"oa_version":"Submitted Version","scopus_import":"1","main_file_link":[{"url":"https://upcommons.upc.edu/bitstream/2117/363528/1/Pb%20mengyao.pdf","open_access":"1"}],"month":"10","intvolume":" 13"},{"_id":"9235","article_type":"original","type":"journal_article","status":"public","keyword":["General Engineering","General Physics and Astronomy","General Materials Science"],"date_updated":"2023-10-03T09:59:55Z","department":[{"_id":"MaIb"}],"abstract":[{"text":"Cu2–xS has become one of the most promising thermoelectric materials for application in the middle-high temperature range. Its advantages include the abundance, low cost, and safety of its elements and a high performance at relatively elevated temperatures. However, stability issues limit its operation current and temperature, thus calling for the optimization of the material performance in the middle temperature range. Here, we present a synthetic protocol for large scale production of covellite CuS nanoparticles at ambient temperature and atmosphere, and using water as a solvent. The crystal phase and stoichiometry of the particles are afterward tuned through an annealing process at a moderate temperature under inert or reducing atmosphere. While annealing under argon results in Cu1.8S nanopowder with a rhombohedral crystal phase, annealing in an atmosphere containing hydrogen leads to tetragonal Cu1.96S. High temperature X-ray diffraction analysis shows the material annealed in argon to transform to the cubic phase at ca. 400 K, while the material annealed in the presence of hydrogen undergoes two phase transitions, first to hexagonal and then to the cubic structure. The annealing atmosphere, temperature, and time allow adjustment of the density of copper vacancies and thus tuning of the charge carrier concentration and material transport properties. In this direction, the material annealed under Ar is characterized by higher electrical conductivities but lower Seebeck coefficients than the material annealed in the presence of hydrogen. By optimizing the charge carrier concentration through the annealing time, Cu2–xS with record figures of merit in the middle temperature range, up to 1.41 at 710 K, is obtained. We finally demonstrate that this strategy, based on a low-cost and scalable solution synthesis process, is also suitable for the production of high performance Cu2–xS layers using high throughput and cost-effective printing technologies.","lang":"eng"}],"oa_version":"Submitted Version","pmid":1,"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://upcommons.upc.edu/bitstream/handle/2117/363528/Pb%20mengyao.pdf?sequence=1&isAllowed=y"}],"month":"03","intvolume":" 15","publication_identifier":{"eissn":["1936-086X"],"issn":["1936-0851"]},"publication_status":"published","language":[{"iso":"eng"}],"issue":"3","volume":15,"citation":{"short":"M. Li, Y. Liu, Y. Zhang, X. Han, T. Zhang, Y. Zuo, C. Xie, K. Xiao, J. Arbiol, J. Llorca, M. Ibáñez, J. Liu, A. Cabot, ACS Nano 15 (2021) 4967–4978.","ieee":"M. Li et al., “Effect of the annealing atmosphere on crystal phase and thermoelectric properties of copper sulfide,” ACS Nano, vol. 15, no. 3. American Chemical Society , pp. 4967–4978, 2021.","apa":"Li, M., Liu, Y., Zhang, Y., Han, X., Zhang, T., Zuo, Y., … Cabot, A. (2021). Effect of the annealing atmosphere on crystal phase and thermoelectric properties of copper sulfide. ACS Nano. American Chemical Society . https://doi.org/10.1021/acsnano.0c09866","ama":"Li M, Liu Y, Zhang Y, et al. Effect of the annealing atmosphere on crystal phase and thermoelectric properties of copper sulfide. ACS Nano. 2021;15(3):4967–4978. doi:10.1021/acsnano.0c09866","mla":"Li, Mengyao, et al. “Effect of the Annealing Atmosphere on Crystal Phase and Thermoelectric Properties of Copper Sulfide.” ACS Nano, vol. 15, no. 3, American Chemical Society , 2021, pp. 4967–4978, doi:10.1021/acsnano.0c09866.","ista":"Li M, Liu Y, Zhang Y, Han X, Zhang T, Zuo Y, Xie C, Xiao K, Arbiol J, Llorca J, Ibáñez M, Liu J, Cabot A. 2021. Effect of the annealing atmosphere on crystal phase and thermoelectric properties of copper sulfide. ACS Nano. 15(3), 4967–4978.","chicago":"Li, Mengyao, Yu Liu, Yu Zhang, Xu Han, Ting Zhang, Yong Zuo, Chenyang Xie, et al. “Effect of the Annealing Atmosphere on Crystal Phase and Thermoelectric Properties of Copper Sulfide.” ACS Nano. American Chemical Society , 2021. https://doi.org/10.1021/acsnano.0c09866."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Mengyao","last_name":"Li","full_name":"Li, Mengyao"},{"last_name":"Liu","orcid":"0000-0001-7313-6740","full_name":"Liu, Yu","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","first_name":"Yu"},{"first_name":"Yu","full_name":"Zhang, Yu","last_name":"Zhang"},{"last_name":"Han","full_name":"Han, Xu","first_name":"Xu"},{"last_name":"Zhang","full_name":"Zhang, Ting","first_name":"Ting"},{"full_name":"Zuo, Yong","last_name":"Zuo","first_name":"Yong"},{"full_name":"Xie, Chenyang","last_name":"Xie","first_name":"Chenyang"},{"last_name":"Xiao","full_name":"Xiao, Ke","first_name":"Ke"},{"last_name":"Arbiol","full_name":"Arbiol, Jordi","first_name":"Jordi"},{"last_name":"Llorca","full_name":"Llorca, Jordi","first_name":"Jordi"},{"last_name":"Ibáñez","full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87","first_name":"Maria"},{"last_name":"Liu","full_name":"Liu, Junfeng","first_name":"Junfeng"},{"first_name":"Andreu","last_name":"Cabot","full_name":"Cabot, Andreu"}],"article_processing_charge":"No","external_id":{"pmid":["33645986"],"isi":["000634569100106"]},"title":"Effect of the annealing atmosphere on crystal phase and thermoelectric properties of copper sulfide","acknowledgement":"This work was supported by the European Regional Development Funds. M.Y.L., X.H., T.Z., and K.X. thank the China Scholarship Council for scholarship support. M.I. acknowledges financial support from IST Austria. J.L. acknowledges support from the National Natural Science Foundation of China (No. 22008091), the funding for scientific research startup of Jiangsu University (No. 19JDG044), and Jiangsu Provincial Program for High-Level Innovative and Entrepreneurial Talents Introduction. J.L. is a Serra Húnter fellow and is grateful to the ICREA Academia program and projects MICINN/FEDER RTI2018-093996-B-C31 and GC 2017 SGR 128. ICN2 acknowledges funding from Generalitat de Catalunya 2017 SGR 327 and the Spanish MINECO ENE2017-85087-C3. ICN2 is supported by the Severo Ochoa program from Spanish MINECO (Grant No. SEV-2017-0706) and is funded by the CERCA Programme/Generalitat de Catalunya. Part of the present work has been performed in the framework of Universitat Autònoma de Barcelona Materials Science PhD program. T.Z. has received funding from the CSC-UAB PhD scholarship program.","publisher":"American Chemical Society ","quality_controlled":"1","oa":1,"isi":1,"year":"2021","day":"01","publication":"ACS Nano","page":"4967–4978","date_published":"2021-03-01T00:00:00Z","doi":"10.1021/acsnano.0c09866","date_created":"2021-03-10T20:12:45Z"},{"_id":"10204","type":"journal_article","article_type":"original","status":"public","date_updated":"2023-10-03T09:24:27Z","ddc":["540"],"file_date_updated":"2023-10-03T09:21:42Z","department":[{"_id":"HeEd"}],"abstract":[{"text":"Two common representations of close packings of identical spheres consisting of hexagonal layers, called Barlow stackings, appear abundantly in minerals and metals. These motifs, however, occupy an identical portion of space and bear identical first-order topological signatures as measured by persistent homology. Here we present a novel method based on k-fold covers that unambiguously distinguishes between these patterns. Moreover, our approach provides topological evidence that the FCC motif is the more stable of the two in the context of evolving experimental sphere packings during the transition from disordered to an ordered state. We conclude that our approach can be generalised to distinguish between various Barlow stackings manifested in minerals and metals.","lang":"eng"}],"pmid":1,"oa_version":"Submitted Version","scopus_import":"1","month":"10","intvolume":" 17","publication_identifier":{"issn":["1744-683X"],"eissn":["1744-6848"]},"publication_status":"published","file":[{"file_id":"14385","checksum":"b4da0c420530295e61b153960f6cb350","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2023-10-03T09:21:42Z","file_name":"2021_SoftMatter_acceptedversion_Osang.pdf","date_updated":"2023-10-03T09:21:42Z","file_size":4678788,"creator":"dernst"}],"language":[{"iso":"eng"}],"issue":"40","volume":17,"ec_funded":1,"project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"788183","name":"Alpha Shape Theory Extended"},{"call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","name":"The Wittgenstein Prize"}],"citation":{"short":"G.F. Osang, H. Edelsbrunner, M. Saadatfar, Soft Matter 17 (2021) 9107–9115.","ieee":"G. F. Osang, H. Edelsbrunner, and M. Saadatfar, “Topological signatures and stability of hexagonal close packing and Barlow stackings,” Soft Matter, vol. 17, no. 40. Royal Society of Chemistry , pp. 9107–9115, 2021.","apa":"Osang, G. F., Edelsbrunner, H., & Saadatfar, M. (2021). Topological signatures and stability of hexagonal close packing and Barlow stackings. Soft Matter. Royal Society of Chemistry . https://doi.org/10.1039/d1sm00774b","ama":"Osang GF, Edelsbrunner H, Saadatfar M. Topological signatures and stability of hexagonal close packing and Barlow stackings. Soft Matter. 2021;17(40):9107-9115. doi:10.1039/d1sm00774b","mla":"Osang, Georg F., et al. “Topological Signatures and Stability of Hexagonal Close Packing and Barlow Stackings.” Soft Matter, vol. 17, no. 40, Royal Society of Chemistry , 2021, pp. 9107–15, doi:10.1039/d1sm00774b.","ista":"Osang GF, Edelsbrunner H, Saadatfar M. 2021. Topological signatures and stability of hexagonal close packing and Barlow stackings. Soft Matter. 17(40), 9107–9115.","chicago":"Osang, Georg F, Herbert Edelsbrunner, and Mohammad Saadatfar. “Topological Signatures and Stability of Hexagonal Close Packing and Barlow Stackings.” Soft Matter. Royal Society of Chemistry , 2021. https://doi.org/10.1039/d1sm00774b."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"464B40D6-F248-11E8-B48F-1D18A9856A87","first_name":"Georg F","full_name":"Osang, Georg F","orcid":"0000-0002-8882-5116","last_name":"Osang"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner"},{"first_name":"Mohammad","last_name":"Saadatfar","full_name":"Saadatfar, Mohammad"}],"external_id":{"isi":["000700090000001"],"pmid":["34569592"]},"article_processing_charge":"No","title":"Topological signatures and stability of hexagonal close packing and Barlow stackings","acknowledgement":"MS acknowledges the support by Australian Research Council funding through the ARC Training Centre for M3D Innovation (IC180100008). MS thanks M. Hanifpour and N. Francois for their input and valuable discussions. This project has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme, grant no. 788183 and from the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31.","publisher":"Royal Society of Chemistry ","quality_controlled":"1","oa":1,"isi":1,"has_accepted_license":"1","year":"2021","day":"20","publication":"Soft Matter","page":"9107-9115","doi":"10.1039/d1sm00774b","date_published":"2021-10-20T00:00:00Z","date_created":"2021-10-31T23:01:30Z"},{"department":[{"_id":"GeKa"}],"date_updated":"2023-10-03T12:51:59Z","status":"public","type":"conference","conference":{"name":"EDTM: IEEE Electron Devices Technology and Manufacturing Conference","start_date":"2021-04-08","location":"Virtual, Online","end_date":"2021-04-11"},"_id":"9464","ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9781728181769"]},"publication_status":"published","month":"04","scopus_import":"1","oa_version":"None","abstract":[{"text":"We firstly introduce the self-assembled growth of highly uniform Ge quantum wires with controllable position, distance and length on patterned Si (001) substrates. We then present the electrically tunable strong spin-orbit coupling, the first Ge hole spin qubit and ultrafast operation of hole spin qubit in the Ge/Si quantum wires.","lang":"eng"}],"title":"Ge/Si quantum wires for quantum computing","author":[{"full_name":"Gao, Fei","last_name":"Gao","first_name":"Fei"},{"first_name":"Jie Yin","full_name":"Zhang, Jie Yin","last_name":"Zhang"},{"full_name":"Wang, Jian Huan","last_name":"Wang","first_name":"Jian Huan"},{"last_name":"Ming","full_name":"Ming, Ming","first_name":"Ming"},{"first_name":"Tina","full_name":"Wang, Tina","last_name":"Wang"},{"first_name":"Jian Jun","last_name":"Zhang","full_name":"Zhang, Jian Jun"},{"id":"35DF8E50-F248-11E8-B48F-1D18A9856A87","first_name":"Hannes","full_name":"Watzinger, Hannes","last_name":"Watzinger"},{"first_name":"Josip","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87","full_name":"Kukucka, Josip","last_name":"Kukucka"},{"orcid":"0000-0003-2424-8636","full_name":"Vukušić, Lada","last_name":"Vukušić","id":"31E9F056-F248-11E8-B48F-1D18A9856A87","first_name":"Lada"},{"last_name":"Katsaros","full_name":"Katsaros, Georgios","orcid":"0000-0001-8342-202X","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","first_name":"Georgios"},{"first_name":"Ke","full_name":"Wang, Ke","last_name":"Wang"},{"first_name":"Gang","full_name":"Xu, Gang","last_name":"Xu"},{"first_name":"Hai Ou","full_name":"Li, Hai Ou","last_name":"Li"},{"first_name":"Guo Ping","full_name":"Guo, Guo Ping","last_name":"Guo"}],"external_id":{"isi":["000675595800006"]},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Gao F, Zhang JY, Wang JH, Ming M, Wang T, Zhang JJ, Watzinger H, Kukucka J, Vukušić L, Katsaros G, Wang K, Xu G, Li HO, Guo GP. 2021. Ge/Si quantum wires for quantum computing. 2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021. EDTM: IEEE Electron Devices Technology and Manufacturing Conference, 9420817.","chicago":"Gao, Fei, Jie Yin Zhang, Jian Huan Wang, Ming Ming, Tina Wang, Jian Jun Zhang, Hannes Watzinger, et al. “Ge/Si Quantum Wires for Quantum Computing.” In 2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021. IEEE, 2021. https://doi.org/10.1109/EDTM50988.2021.9420817.","short":"F. Gao, J.Y. Zhang, J.H. Wang, M. Ming, T. Wang, J.J. Zhang, H. Watzinger, J. Kukucka, L. Vukušić, G. Katsaros, K. Wang, G. Xu, H.O. Li, G.P. Guo, in:, 2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021, IEEE, 2021.","ieee":"F. Gao et al., “Ge/Si quantum wires for quantum computing,” in 2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021, Virtual, Online, 2021.","apa":"Gao, F., Zhang, J. Y., Wang, J. H., Ming, M., Wang, T., Zhang, J. J., … Guo, G. P. (2021). Ge/Si quantum wires for quantum computing. In 2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021. Virtual, Online: IEEE. https://doi.org/10.1109/EDTM50988.2021.9420817","ama":"Gao F, Zhang JY, Wang JH, et al. Ge/Si quantum wires for quantum computing. In: 2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021. IEEE; 2021. doi:10.1109/EDTM50988.2021.9420817","mla":"Gao, Fei, et al. “Ge/Si Quantum Wires for Quantum Computing.” 2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021, 9420817, IEEE, 2021, doi:10.1109/EDTM50988.2021.9420817."},"project":[{"name":"Towards Spin qubits and Majorana fermions in Germanium selfassembled hut-wires","grant_number":"335497","call_identifier":"FP7","_id":"25517E86-B435-11E9-9278-68D0E5697425"}],"article_number":"9420817","date_published":"2021-04-08T00:00:00Z","doi":"10.1109/EDTM50988.2021.9420817","date_created":"2021-06-06T22:01:29Z","day":"08","publication":"2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021","isi":1,"year":"2021","publisher":"IEEE","quality_controlled":"1","acknowledgement":"This work was supported by the National Key R&D Program of China (Grant No. 2016YFA0301700) and the ERC Starting Grant no. 335497."},{"status":"public","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"end_date":"2021-06-11","location":"Online","start_date":"2021-06-07","name":"SoCG: International Symposium on Computational Geometry"},"_id":"9605","department":[{"_id":"HeEd"}],"file_date_updated":"2021-06-28T12:40:47Z","ddc":["516"],"date_updated":"2023-10-04T12:03:39Z","month":"06","intvolume":" 189","alternative_title":["LIPIcs"],"scopus_import":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Given a finite set A ⊂ ℝ^d, let Cov_{r,k} denote the set of all points within distance r to at least k points of A. Allowing r and k to vary, we obtain a 2-parameter family of spaces that grow larger when r increases or k decreases, called the multicover bifiltration. Motivated by the problem of computing the homology of this bifiltration, we introduce two closely related combinatorial bifiltrations, one polyhedral and the other simplicial, which are both topologically equivalent to the multicover bifiltration and far smaller than a Čech-based model considered in prior work of Sheehy. Our polyhedral construction is a bifiltration of the rhomboid tiling of Edelsbrunner and Osang, and can be efficiently computed using a variant of an algorithm given by these authors as well. Using an implementation for dimension 2 and 3, we provide experimental results. Our simplicial construction is useful for understanding the polyhedral construction and proving its correctness. "}],"volume":189,"related_material":{"record":[{"id":"12709","status":"public","relation":"later_version"}],"link":[{"url":"https://arxiv.org/abs/2103.07823","relation":"extended_version"}]},"file":[{"creator":"cziletti","date_updated":"2021-06-28T12:40:47Z","file_size":"1367983","date_created":"2021-06-28T12:40:47Z","file_name":"2021_LIPIcs_Corbet.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"9610","checksum":"0de217501e7ba8b267d58deed0d51761","success":1}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["18688969"],"isbn":["9783959771849"]},"publication_status":"published","article_number":"27","title":"Computing the multicover bifiltration","author":[{"full_name":"Corbet, René","last_name":"Corbet","first_name":"René"},{"last_name":"Kerber","full_name":"Kerber, Michael","first_name":"Michael"},{"first_name":"Michael","full_name":"Lesnick, Michael","last_name":"Lesnick"},{"first_name":"Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","last_name":"Osang","full_name":"Osang, Georg F","orcid":"0000-0002-8882-5116"}],"external_id":{"arxiv":["2103.07823"]},"article_processing_charge":"No","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","citation":{"chicago":"Corbet, René, Michael Kerber, Michael Lesnick, and Georg F Osang. “Computing the Multicover Bifiltration.” In Leibniz International Proceedings in Informatics, Vol. 189. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.SoCG.2021.27.","ista":"Corbet R, Kerber M, Lesnick M, Osang GF. 2021. Computing the multicover bifiltration. Leibniz International Proceedings in Informatics. SoCG: International Symposium on Computational Geometry, LIPIcs, vol. 189, 27.","mla":"Corbet, René, et al. “Computing the Multicover Bifiltration.” Leibniz International Proceedings in Informatics, vol. 189, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.SoCG.2021.27.","ieee":"R. Corbet, M. Kerber, M. Lesnick, and G. F. Osang, “Computing the multicover bifiltration,” in Leibniz International Proceedings in Informatics, Online, 2021, vol. 189.","short":"R. Corbet, M. Kerber, M. Lesnick, G.F. Osang, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","ama":"Corbet R, Kerber M, Lesnick M, Osang GF. Computing the multicover bifiltration. In: Leibniz International Proceedings in Informatics. Vol 189. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.SoCG.2021.27","apa":"Corbet, R., Kerber, M., Lesnick, M., & Osang, G. F. (2021). Computing the multicover bifiltration. In Leibniz International Proceedings in Informatics (Vol. 189). Online: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2021.27"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"acknowledgement":"The authors want to thank the reviewers for many helpful comments and suggestions.","doi":"10.4230/LIPIcs.SoCG.2021.27","date_published":"2021-06-02T00:00:00Z","date_created":"2021-06-27T22:01:49Z","day":"02","publication":"Leibniz International Proceedings in Informatics","has_accepted_license":"1","year":"2021"},{"ec_funded":1,"related_material":{"record":[{"id":"12960","status":"public","relation":"later_version"}]},"volume":189,"publication_status":"published","publication_identifier":{"isbn":["978-3-95977-184-9"],"issn":["1868-8969"]},"language":[{"iso":"eng"}],"file":[{"creator":"mwintrae","date_updated":"2021-06-02T10:22:33Z","file_size":1972902,"date_created":"2021-06-02T10:22:33Z","file_name":"LIPIcs-SoCG-2021-17.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"c322aa48d5d35a35877896cc565705b6","file_id":"9442","success":1}],"alternative_title":["LIPIcs"],"intvolume":" 189","month":"06","place":"Dagstuhl, Germany","abstract":[{"lang":"eng","text":"Isomanifolds are the generalization of isosurfaces to arbitrary dimension and codimension, i.e. submanifolds of ℝ^d defined as the zero set of some multivariate multivalued smooth function f: ℝ^d → ℝ^{d-n}, where n is the intrinsic dimension of the manifold. A natural way to approximate a smooth isomanifold M is to consider its Piecewise-Linear (PL) approximation M̂ based on a triangulation 𝒯 of the ambient space ℝ^d. In this paper, we describe a simple algorithm to trace isomanifolds from a given starting point. The algorithm works for arbitrary dimensions n and d, and any precision D. Our main result is that, when f (or M) has bounded complexity, the complexity of the algorithm is polynomial in d and δ = 1/D (and unavoidably exponential in n). Since it is known that for δ = Ω (d^{2.5}), M̂ is O(D²)-close and isotopic to M, our algorithm produces a faithful PL-approximation of isomanifolds of bounded complexity in time polynomial in d. Combining this algorithm with dimensionality reduction techniques, the dependency on d in the size of M̂ can be completely removed with high probability. We also show that the algorithm can handle isomanifolds with boundary and, more generally, isostratifolds. The algorithm for isomanifolds with boundary has been implemented and experimental results are reported, showing that it is practical and can handle cases that are far ahead of the state-of-the-art. "}],"oa_version":"Published Version","file_date_updated":"2021-06-02T10:22:33Z","department":[{"_id":"HeEd"}],"date_updated":"2023-10-10T07:34:34Z","ddc":["005","516","514"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"start_date":"2021-06-07","end_date":"2021-06-11","location":"Virtual","name":"SoCG: Symposium on Computational Geometry"},"type":"conference","status":"public","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","_id":"9441","page":"17:1-17:16","date_created":"2021-06-02T10:10:55Z","date_published":"2021-06-02T00:00:00Z","doi":"10.4230/LIPIcs.SoCG.2021.17","year":"2021","has_accepted_license":"1","publication":"37th International Symposium on Computational Geometry (SoCG 2021)","day":"02","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","acknowledgement":"We thank Dominique Attali, Guilherme de Fonseca, Arijit Ghosh, Vincent Pilaud and Aurélien Alvarez for their comments and suggestions. We also acknowledge the reviewers.","article_processing_charge":"No","author":[{"first_name":"Jean-Daniel","full_name":"Boissonnat, Jean-Daniel","last_name":"Boissonnat"},{"first_name":"Siargey","last_name":"Kachanovich","full_name":"Kachanovich, Siargey"},{"full_name":"Wintraecken, Mathijs","orcid":"0000-0002-7472-2220","last_name":"Wintraecken","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","first_name":"Mathijs"}],"title":"Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations","citation":{"mla":"Boissonnat, Jean-Daniel, et al. “Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn Triangulations.” 37th International Symposium on Computational Geometry (SoCG 2021), vol. 189, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 17:1-17:16, doi:10.4230/LIPIcs.SoCG.2021.17.","apa":"Boissonnat, J.-D., Kachanovich, S., & Wintraecken, M. (2021). Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. In 37th International Symposium on Computational Geometry (SoCG 2021) (Vol. 189, p. 17:1-17:16). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2021.17","ama":"Boissonnat J-D, Kachanovich S, Wintraecken M. Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. In: 37th International Symposium on Computational Geometry (SoCG 2021). Vol 189. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021:17:1-17:16. doi:10.4230/LIPIcs.SoCG.2021.17","short":"J.-D. Boissonnat, S. Kachanovich, M. Wintraecken, in:, 37th International Symposium on Computational Geometry (SoCG 2021), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2021, p. 17:1-17:16.","ieee":"J.-D. Boissonnat, S. Kachanovich, and M. Wintraecken, “Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations,” in 37th International Symposium on Computational Geometry (SoCG 2021), Virtual, 2021, vol. 189, p. 17:1-17:16.","chicago":"Boissonnat, Jean-Daniel, Siargey Kachanovich, and Mathijs Wintraecken. “Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn Triangulations.” In 37th International Symposium on Computational Geometry (SoCG 2021), 189:17:1-17:16. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.SoCG.2021.17.","ista":"Boissonnat J-D, Kachanovich S, Wintraecken M. 2021. Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. 37th International Symposium on Computational Geometry (SoCG 2021). SoCG: Symposium on Computational GeometryLeibniz International Proceedings in Informatics (LIPIcs), LIPIcs, vol. 189, 17:1-17:16."},"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}]},{"project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"title":"Faster algorithms for quantitative verification in bounded treewidth graphs","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722"}],"article_processing_charge":"No","external_id":{"arxiv":["1504.07384"],"isi":["000645490300001"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2021). Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-021-00373-5","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design. 2021;57:401-428. doi:10.1007/s10703-021-00373-5","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Formal Methods in System Design 57 (2021) 401–428.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for quantitative verification in bounded treewidth graphs,” Formal Methods in System Design, vol. 57. Springer, pp. 401–428, 2021.","mla":"Chatterjee, Krishnendu, et al. “Faster Algorithms for Quantitative Verification in Bounded Treewidth Graphs.” Formal Methods in System Design, vol. 57, Springer, 2021, pp. 401–28, doi:10.1007/s10703-021-00373-5.","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2021. Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design. 57, 401–428.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Verification in Bounded Treewidth Graphs.” Formal Methods in System Design. Springer, 2021. https://doi.org/10.1007/s10703-021-00373-5."},"quality_controlled":"1","publisher":"Springer","oa":1,"acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499- N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start Grant (279307: Graph Games), and Microsoft faculty fellows award.","date_published":"2021-09-01T00:00:00Z","doi":"10.1007/s10703-021-00373-5","date_created":"2021-05-16T22:01:47Z","page":"401-428","day":"01","publication":"Formal Methods in System Design","isi":1,"year":"2021","status":"public","article_type":"original","type":"journal_article","_id":"9393","department":[{"_id":"KrCh"}],"date_updated":"2023-10-10T11:13:20Z","month":"09","intvolume":" 57","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1504.07384"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean-payoff, the ratio, and the minimum initial credit for energy property. The algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with bounded treewidth—a class that contains the control flow graphs of most programs. Let n denote the number of nodes of a graph, m the number of edges (for bounded treewidth 𝑚=𝑂(𝑛)) and W the largest absolute value of the weights. Our main theoretical results are as follows. First, for the minimum initial credit problem we show that (1) for general graphs the problem can be solved in 𝑂(𝑛2⋅𝑚) time and the associated decision problem in 𝑂(𝑛⋅𝑚) time, improving the previous known 𝑂(𝑛3⋅𝑚⋅log(𝑛⋅𝑊)) and 𝑂(𝑛2⋅𝑚) bounds, respectively; and (2) for bounded treewidth graphs we present an algorithm that requires 𝑂(𝑛⋅log𝑛) time. Second, for bounded treewidth graphs we present an algorithm that approximates the mean-payoff value within a factor of 1+𝜖 in time 𝑂(𝑛⋅log(𝑛/𝜖)) as compared to the classical exact algorithms on general graphs that require quadratic time. Third, for the ratio property we present an algorithm that for bounded treewidth graphs works in time 𝑂(𝑛⋅log(|𝑎⋅𝑏|))=𝑂(𝑛⋅log(𝑛⋅𝑊)), when the output is 𝑎𝑏, as compared to the previously best known algorithm on general graphs with running time 𝑂(𝑛2⋅log(𝑛⋅𝑊)). We have implemented some of our algorithms and show that they present a significant speedup on standard benchmarks."}],"volume":57,"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1572-8102"],"issn":["0925-9856"]},"publication_status":"published"}]