[{"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":"research_data","status":"public","_id":"8254","article_processing_charge":"No","author":[{"id":"2CFCFF98-F248-11E8-B48F-1D18A9856A87","first_name":"Louise S","last_name":"Arathoon","orcid":"0000-0003-1771-714X","full_name":"Arathoon, Louise S"}],"title":"Estimating inbreeding and its effects in a long-term study of snapdragons (Antirrhinum majus)","department":[{"_id":"NiBa"}],"file_date_updated":"2020-08-18T08:03:23Z","citation":{"ista":"Arathoon LS. 2020. Estimating inbreeding and its effects in a long-term study of snapdragons (Antirrhinum majus), Institute of Science and Technology Austria, 10.15479/AT:ISTA:8254.","chicago":"Arathoon, Louise S. “Estimating Inbreeding and Its Effects in a Long-Term Study of Snapdragons (Antirrhinum Majus).” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8254.","ama":"Arathoon LS. Estimating inbreeding and its effects in a long-term study of snapdragons (Antirrhinum majus). 2020. doi:10.15479/AT:ISTA:8254","apa":"Arathoon, L. S. (2020). Estimating inbreeding and its effects in a long-term study of snapdragons (Antirrhinum majus). Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8254","ieee":"L. S. Arathoon, “Estimating inbreeding and its effects in a long-term study of snapdragons (Antirrhinum majus).” Institute of Science and Technology Austria, 2020.","short":"L.S. Arathoon, (2020).","mla":"Arathoon, Louise S. Estimating Inbreeding and Its Effects in a Long-Term Study of Snapdragons (Antirrhinum Majus). Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8254."},"date_updated":"2024-02-21T12:41:09Z","ddc":["576"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publisher":"Institute of Science and Technology Austria","month":"08","abstract":[{"text":"Here are the research data underlying the publication \"Estimating inbreeding and its effects in a long-term study of snapdragons (Antirrhinum majus)\". Further information are summed up in the README document.\r\nThe files for this record have been updated and are now found in the linked DOI https://doi.org/10.15479/AT:ISTA:9192.","lang":"eng"}],"oa_version":"Published Version","license":"https://creativecommons.org/licenses/by/4.0/","contributor":[{"id":"2CFCFF98-F248-11E8-B48F-1D18A9856A87","contributor_type":"data_collector","first_name":"Louise S","last_name":"Arathoon"},{"last_name":"Surendranadh","contributor_type":"project_member","id":"455235B8-F248-11E8-B48F-1D18A9856A87","first_name":"Parvathy"},{"last_name":"Barton","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","contributor_type":"project_member","first_name":"Nicholas H"},{"orcid":"0000-0002-4014-8478","last_name":"Field","contributor_type":"project_member","first_name":"David","id":"419049E2-F248-11E8-B48F-1D18A9856A87"},{"contributor_type":"project_member","first_name":"Melinda","id":"2C78037E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6118-0541","last_name":"Pickup"},{"first_name":"Carina","id":"3B4A7CE2-F248-11E8-B48F-1D18A9856A87","contributor_type":"project_member","last_name":"Baskett"}],"date_created":"2020-08-12T12:49:23Z","date_published":"2020-08-18T00:00:00Z","related_material":{"record":[{"relation":"later_version","status":"public","id":"11321"},{"id":"9192","status":"public","relation":"later_version"}]},"doi":"10.15479/AT:ISTA:8254","year":"2020","has_accepted_license":"1","day":"18","file":[{"creator":"dernst","file_size":5778420,"date_updated":"2020-08-18T08:03:23Z","file_name":"Data_Rcode_MathematicaNB.zip","date_created":"2020-08-18T08:03:23Z","relation":"main_file","access_level":"open_access","content_type":"application/x-zip-compressed","success":1,"file_id":"8280","checksum":"4f1382ed4384751b6013398c11557bf6"}]},{"doi":"10.1002/adma.201906523","date_published":"2020-04-23T00:00:00Z","date_created":"2020-02-28T09:47:00Z","has_accepted_license":"1","isi":1,"year":"2020","day":"23","publication":"Advanced Materials","publisher":"Wiley","quality_controlled":"1","oa":1,"acknowledgement":"This work was supported by the National Key R&D Program of China (Grant Nos. 2016YFA0301701 and 2016YFA0300600), the NSFC (Grant Nos. 11574356, 11434010, and 11404252), the Strategic Priority Research Program of CAS (Grant No. XDB30000000), the ERC Starting Grant No. 335497, the FWF P32235 project, and the European Union's Horizon 2020 research and innovation program under Grant Agreement #862046. This research was supported by the Scientific Service Units of IST Austria through resources provided by the MIBA Machine Shop and the nanofabrication facility. F.L. thanks support from DOE (Grant No. DE‐FG02‐04ER46148). H.H. thanks the Startup Funding from Xi'an Jiaotong University.","author":[{"first_name":"Fei","full_name":"Gao, Fei","last_name":"Gao"},{"first_name":"Jian-Huan","last_name":"Wang","full_name":"Wang, Jian-Huan"},{"first_name":"Hannes","id":"35DF8E50-F248-11E8-B48F-1D18A9856A87","last_name":"Watzinger","full_name":"Watzinger, Hannes"},{"first_name":"Hao","last_name":"Hu","full_name":"Hu, Hao"},{"first_name":"Marko J.","last_name":"Rančić","full_name":"Rančić, Marko J."},{"full_name":"Zhang, Jie-Yin","last_name":"Zhang","first_name":"Jie-Yin"},{"first_name":"Ting","last_name":"Wang","full_name":"Wang, Ting"},{"last_name":"Yao","full_name":"Yao, Yuan","first_name":"Yuan"},{"full_name":"Wang, Gui-Lei","last_name":"Wang","first_name":"Gui-Lei"},{"first_name":"Josip","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87","last_name":"Kukucka","full_name":"Kukucka, Josip"},{"first_name":"Lada","id":"31E9F056-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2424-8636","full_name":"Vukušić, Lada","last_name":"Vukušić"},{"full_name":"Kloeffel, Christoph","last_name":"Kloeffel","first_name":"Christoph"},{"last_name":"Loss","full_name":"Loss, Daniel","first_name":"Daniel"},{"first_name":"Feng","full_name":"Liu, Feng","last_name":"Liu"},{"id":"38DB5788-F248-11E8-B48F-1D18A9856A87","first_name":"Georgios","last_name":"Katsaros","orcid":"0000-0001-8342-202X","full_name":"Katsaros, Georgios"},{"last_name":"Zhang","full_name":"Zhang, Jian-Jun","first_name":"Jian-Jun"}],"article_processing_charge":"Yes (via OA deal)","external_id":{"isi":["000516660900001"]},"title":"Site-controlled uniform Ge/Si hut wires with electrically tunable spin-orbit coupling","citation":{"mla":"Gao, Fei, et al. “Site-Controlled Uniform Ge/Si Hut Wires with Electrically Tunable Spin-Orbit Coupling.” Advanced Materials, vol. 32, no. 16, 1906523, Wiley, 2020, doi:10.1002/adma.201906523.","apa":"Gao, F., Wang, J.-H., Watzinger, H., Hu, H., Rančić, M. J., Zhang, J.-Y., … Zhang, J.-J. (2020). Site-controlled uniform Ge/Si hut wires with electrically tunable spin-orbit coupling. Advanced Materials. Wiley. https://doi.org/10.1002/adma.201906523","ama":"Gao F, Wang J-H, Watzinger H, et al. Site-controlled uniform Ge/Si hut wires with electrically tunable spin-orbit coupling. Advanced Materials. 2020;32(16). doi:10.1002/adma.201906523","short":"F. Gao, J.-H. Wang, H. Watzinger, H. Hu, M.J. Rančić, J.-Y. Zhang, T. Wang, Y. Yao, G.-L. Wang, J. Kukucka, L. Vukušić, C. Kloeffel, D. Loss, F. Liu, G. Katsaros, J.-J. Zhang, Advanced Materials 32 (2020).","ieee":"F. Gao et al., “Site-controlled uniform Ge/Si hut wires with electrically tunable spin-orbit coupling,” Advanced Materials, vol. 32, no. 16. Wiley, 2020.","chicago":"Gao, Fei, Jian-Huan Wang, Hannes Watzinger, Hao Hu, Marko J. Rančić, Jie-Yin Zhang, Ting Wang, et al. “Site-Controlled Uniform Ge/Si Hut Wires with Electrically Tunable Spin-Orbit Coupling.” Advanced Materials. Wiley, 2020. https://doi.org/10.1002/adma.201906523.","ista":"Gao F, Wang J-H, Watzinger H, Hu H, Rančić MJ, Zhang J-Y, Wang T, Yao Y, Wang G-L, Kukucka J, Vukušić L, Kloeffel C, Loss D, Liu F, Katsaros G, Zhang J-J. 2020. Site-controlled uniform Ge/Si hut wires with electrically tunable spin-orbit coupling. Advanced Materials. 32(16), 1906523."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"_id":"25517E86-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Towards Spin qubits and Majorana fermions in Germanium selfassembled hut-wires","grant_number":"335497"},{"name":"Towards scalable hut wire quantum devices","grant_number":"P32235","call_identifier":"FWF","_id":"237B3DA4-32DE-11EA-91FC-C7463DDC885E"},{"grant_number":"862046","name":"TOPOLOGICALLY PROTECTED AND SCALABLE QUANTUM BITS","call_identifier":"H2020","_id":"237E5020-32DE-11EA-91FC-C7463DDC885E"}],"article_number":"1906523","issue":"16","related_material":{"record":[{"relation":"dissertation_contains","id":"7996","status":"public"},{"relation":"research_data","status":"public","id":"9222"}]},"volume":32,"ec_funded":1,"publication_identifier":{"issn":["0935-9648"]},"publication_status":"published","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"8782","checksum":"c622737dc295972065782558337124a2","success":1,"creator":"dernst","date_updated":"2020-11-20T10:11:35Z","file_size":5242880,"date_created":"2020-11-20T10:11:35Z","file_name":"2020_AdvancedMaterials_Gao.pdf"}],"language":[{"iso":"eng"}],"scopus_import":"1","month":"04","intvolume":" 32","acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"abstract":[{"text":"Semiconductor nanowires have been playing a crucial role in the development of nanoscale devices for the realization of spin qubits, Majorana fermions, single photon emitters, nanoprocessors, etc. The monolithic growth of site‐controlled nanowires is a prerequisite toward the next generation of devices that will require addressability and scalability. Here, combining top‐down nanofabrication and bottom‐up self‐assembly, the growth of Ge wires on prepatterned Si (001) substrates with controllable position, distance, length, and structure is reported. This is achieved by a novel growth process that uses a SiGe strain‐relaxation template and can be potentially generalized to other material combinations. Transport measurements show an electrically tunable spin–orbit coupling, with a spin–orbit length similar to that of III–V materials. Also, charge sensing between quantum dots in closely spaced wires is observed, which underlines their potential for the realization of advanced quantum devices. The reported results open a path toward scalable qubit devices using nanowires on silicon.","lang":"eng"}],"oa_version":"Published Version","file_date_updated":"2020-11-20T10:11:35Z","department":[{"_id":"GeKa"}],"date_updated":"2024-02-21T12:42:12Z","ddc":["530"],"type":"journal_article","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","_id":"7541"},{"year":"2020","has_accepted_license":"1","file":[{"file_id":"8932","checksum":"60a818edeffaa7da1ebf5f8fbea9ba18","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/zip","date_created":"2020-12-09T15:00:19Z","file_name":"PLoSCompBiol2020_datarep.zip","creator":"bkavcic","date_updated":"2020-12-09T15:00:19Z","file_size":315494370}],"day":"10","date_created":"2020-12-09T15:04:02Z","contributor":[{"last_name":"Tkačik","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gašper","contributor_type":"supervisor"},{"last_name":"Bollenbach","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","contributor_type":"supervisor","first_name":"Tobias"}],"related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"8997"}]},"date_published":"2020-12-10T00:00:00Z","doi":"10.15479/AT:ISTA:8930","abstract":[{"text":"Phenomenological relations such as Ohm’s or Fourier’s law have a venerable history in physics but are still scarce in biology. This situation restrains predictive theory. Here, we build on bacterial “growth laws,” which capture physiological feedback between translation and cell growth, to construct a minimal biophysical model for the combined action of ribosome-targeting antibiotics. Our model predicts drug interactions like antagonism or synergy solely from responses to individual drugs. We provide analytical results for limiting cases, which agree well with numerical results. We systematically refine the model by including direct physical interactions of different antibiotics on the ribosome. In a limiting case, our model provides a mechanistic underpinning for recent predictions of higher-order interactions that were derived using entropy maximization. We further refine the model to include the effects of antibiotics that mimic starvation and the presence of resistance genes. We describe the impact of a starvation-mimicking antibiotic on drug interactions analytically and verify it experimentally. Our extended model suggests a change in the type of drug interaction that depends on the strength of resistance, which challenges established rescaling paradigms. We experimentally show that the presence of unregulated resistance genes can lead to altered drug interaction, which agrees with the prediction of the model. While minimal, the model is readily adaptable and opens the door to predicting interactions of second and higher-order in a broad range of biological systems.","lang":"eng"}],"oa_version":"Published Version","oa":1,"publisher":"Institute of Science and Technology Austria","month":"12","citation":{"ista":"Kavcic B. 2020. Analysis scripts and research data for the paper ‘Minimal biophysical model of combined antibiotic action’, Institute of Science and Technology Austria, 10.15479/AT:ISTA:8930.","chicago":"Kavcic, Bor. “Analysis Scripts and Research Data for the Paper ‘Minimal Biophysical Model of Combined Antibiotic Action.’” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8930.","short":"B. Kavcic, (2020).","ieee":"B. Kavcic, “Analysis scripts and research data for the paper ‘Minimal biophysical model of combined antibiotic action.’” Institute of Science and Technology Austria, 2020.","apa":"Kavcic, B. (2020). Analysis scripts and research data for the paper “Minimal biophysical model of combined antibiotic action.” Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8930","ama":"Kavcic B. Analysis scripts and research data for the paper “Minimal biophysical model of combined antibiotic action.” 2020. doi:10.15479/AT:ISTA:8930","mla":"Kavcic, Bor. Analysis Scripts and Research Data for the Paper “Minimal Biophysical Model of Combined Antibiotic Action.” Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8930."},"date_updated":"2024-02-21T12:41:42Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["570"],"article_processing_charge":"No","author":[{"id":"350F91D2-F248-11E8-B48F-1D18A9856A87","first_name":"Bor","orcid":"0000-0001-6041-254X","full_name":"Kavcic, Bor","last_name":"Kavcic"}],"file_date_updated":"2020-12-09T15:00:19Z","title":"Analysis scripts and research data for the paper \"Minimal biophysical model of combined antibiotic action\"","department":[{"_id":"GaTk"}],"_id":"8930","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":"research_data","keyword":["Escherichia coli","antibiotic combinations","translation","growth laws","drug interactions","bacterial physiology","translation inhibitors"],"status":"public"},{"_id":"8951","status":"public","keyword":["Gene regulatory networks","Gene expression","Escherichia coli","Synthetic Biology"],"type":"research_data","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["570"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-02-21T12:41:57Z","citation":{"chicago":"Nagy-Staron, Anna A. “Sequences of Gene Regulatory Network Permutations for the Article ‘Local Genetic Context Shapes the Function of a Gene Regulatory Network.’” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8951.","ista":"Nagy-Staron AA. 2020. Sequences of gene regulatory network permutations for the article ‘Local genetic context shapes the function of a gene regulatory network’, Institute of Science and Technology Austria, 10.15479/AT:ISTA:8951.","mla":"Nagy-Staron, Anna A. Sequences of Gene Regulatory Network Permutations for the Article “Local Genetic Context Shapes the Function of a Gene Regulatory Network.” Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8951.","ama":"Nagy-Staron AA. Sequences of gene regulatory network permutations for the article “Local genetic context shapes the function of a gene regulatory network.” 2020. doi:10.15479/AT:ISTA:8951","apa":"Nagy-Staron, A. A. (2020). Sequences of gene regulatory network permutations for the article “Local genetic context shapes the function of a gene regulatory network.” Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8951","short":"A.A. Nagy-Staron, (2020).","ieee":"A. A. Nagy-Staron, “Sequences of gene regulatory network permutations for the article ‘Local genetic context shapes the function of a gene regulatory network.’” Institute of Science and Technology Austria, 2020."},"department":[{"_id":"CaGu"}],"file_date_updated":"2020-12-20T22:01:44Z","title":"Sequences of gene regulatory network permutations for the article \"Local genetic context shapes the function of a gene regulatory network\"","author":[{"id":"3ABC5BA6-F248-11E8-B48F-1D18A9856A87","first_name":"Anna A","full_name":"Nagy-Staron, Anna A","orcid":"0000-0002-1391-8377","last_name":"Nagy-Staron"}],"article_processing_charge":"No","oa_version":"Published Version","abstract":[{"text":"Gene expression levels are influenced by multiple coexisting molecular mechanisms. Some of these interactions, such as those of transcription factors and promoters have been studied extensively. However, predicting phenotypes of gene regulatory networks remains a major challenge. Here, we use a well-defined synthetic gene regulatory network to study how network phenotypes depend on local genetic context, i.e. the genetic neighborhood of a transcription factor and its relative position. We show that one gene regulatory network with fixed topology can display not only quantitatively but also qualitatively different phenotypes, depending solely on the local genetic context of its components. Our results demonstrate that changes in local genetic context can place a single transcriptional unit within two separate regulons without the need for complex regulatory sequences. We propose that relative order of individual transcriptional units, with its potential for combinatorial complexity, plays an important role in shaping phenotypes of gene regulatory networks.","lang":"eng"}],"month":"12","publisher":"Institute of Science and Technology Austria","oa":1,"day":"21","file":[{"date_created":"2020-12-20T09:52:52Z","file_name":"readme.txt","date_updated":"2020-12-20T09:52:52Z","file_size":523,"creator":"bkavcic","checksum":"f57862aeee1690c7effd2b1117d40ed1","file_id":"8952","success":1,"content_type":"text/plain","access_level":"open_access","relation":"main_file"},{"relation":"main_file","access_level":"open_access","content_type":"application/octet-stream","success":1,"file_id":"8954","checksum":"f2c6d5232ec6d551b6993991e8689e9f","creator":"bkavcic","file_size":379228,"date_updated":"2020-12-20T22:01:44Z","file_name":"GRNs Research depository.gb","date_created":"2020-12-20T22:01:44Z"}],"has_accepted_license":"1","year":"2020","doi":"10.15479/AT:ISTA:8951","related_material":{"record":[{"id":"9283","status":"public","relation":"used_in_publication"}]},"date_published":"2020-12-21T00:00:00Z","date_created":"2020-12-20T10:00:26Z","contributor":[{"last_name":"Nagy-Staron","id":"3ABC5BA6-F248-11E8-B48F-1D18A9856A87","contributor_type":"project_member","first_name":"Anna A"},{"id":"3AEC8556-F248-11E8-B48F-1D18A9856A87","contributor_type":"project_member","first_name":"Kathrin","last_name":"Tomasek"},{"contributor_type":"project_member","first_name":"Caroline","last_name":"Caruso Carter"},{"first_name":"Elisabeth","contributor_type":"project_member","last_name":"Sonnleitner"},{"contributor_type":"project_member","id":"350F91D2-F248-11E8-B48F-1D18A9856A87","first_name":"Bor","last_name":"Kavcic","orcid":"0000-0001-6041-254X"},{"contributor_type":"project_member","first_name":"Tiago","last_name":"Paixão"},{"orcid":"0000-0001-6220-2052","last_name":"Guet","first_name":"Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","contributor_type":"project_manager"}]},{"date_created":"2020-01-28T10:41:49Z","contributor":[{"contributor_type":"project_leader","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","first_name":"Calin C","orcid":"0000-0001-6220-2052","last_name":"Guet"}],"date_published":"2020-01-28T00:00:00Z","doi":"10.15479/AT:ISTA:7383","related_material":{"record":[{"relation":"used_in_publication","id":"7652","status":"public"}]},"year":"2020","has_accepted_license":"1","day":"28","file":[{"creator":"rgrah","file_size":73363365,"date_updated":"2020-07-14T12:47:57Z","file_name":"Scripts.zip","date_created":"2020-01-28T10:39:40Z","relation":"main_file","access_level":"open_access","content_type":"application/zip","file_id":"7384","checksum":"9d292cf5207b3829225f44c044cdb3fd"},{"file_id":"7385","checksum":"4076ceab32ef588cc233802bab24c1ab","relation":"main_file","access_level":"open_access","content_type":"text/plain","file_name":"READ_ME_MAIN.txt","date_created":"2020-01-28T10:39:30Z","creator":"rgrah","file_size":962,"date_updated":"2020-07-14T12:47:57Z"}],"oa":1,"publisher":"Institute of Science and Technology Austria","month":"01","abstract":[{"lang":"eng","text":"Organisms cope with change by employing transcriptional regulators. However, when faced with rare environments, the evolution of transcriptional regulators and their promoters may be too slow. We ask whether the intrinsic instability of gene duplication and amplification provides a generic alternative to canonical gene regulation. By real-time monitoring of gene copy number mutations in E. coli, we show that gene duplications and amplifications enable adaptation to fluctuating environments by rapidly generating copy number, and hence expression level, polymorphism. This ‘amplification-mediated gene expression tuning’ occurs on timescales similar to canonical gene regulation and can deal with rapid environmental changes. Mathematical modeling shows that amplifications also tune gene expression in stochastic environments where transcription factor-based schemes are hard to evolve or maintain. The fleeting nature of gene amplifications gives rise to a generic population-level mechanism that relies on genetic heterogeneity to rapidly tune expression of any gene, without leaving any genomic signature."}],"oa_version":"Published Version","article_processing_charge":"No","author":[{"first_name":"Rok","id":"483E70DE-F248-11E8-B48F-1D18A9856A87","last_name":"Grah","full_name":"Grah, Rok","orcid":"0000-0003-2539-3560"}],"title":"Matlab scripts for the Paper: Gene Amplification as a Form of Population-Level Gene Expression regulation","file_date_updated":"2020-07-14T12:47:57Z","department":[{"_id":"CaGu"},{"_id":"GaTk"}],"citation":{"chicago":"Grah, Rok. “Matlab Scripts for the Paper: Gene Amplification as a Form of Population-Level Gene Expression Regulation.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:7383.","ista":"Grah R. 2020. Matlab scripts for the Paper: Gene Amplification as a Form of Population-Level Gene Expression regulation, Institute of Science and Technology Austria, 10.15479/AT:ISTA:7383.","mla":"Grah, Rok. Matlab Scripts for the Paper: Gene Amplification as a Form of Population-Level Gene Expression Regulation. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:7383.","short":"R. Grah, (2020).","ieee":"R. Grah, “Matlab scripts for the Paper: Gene Amplification as a Form of Population-Level Gene Expression regulation.” Institute of Science and Technology Austria, 2020.","ama":"Grah R. Matlab scripts for the Paper: Gene Amplification as a Form of Population-Level Gene Expression regulation. 2020. doi:10.15479/AT:ISTA:7383","apa":"Grah, R. (2020). Matlab scripts for the Paper: Gene Amplification as a Form of Population-Level Gene Expression regulation. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:7383"},"date_updated":"2024-02-21T12:42:31Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"research_data","keyword":["Matlab scripts","analysis of microfluidics","mathematical model"],"status":"public","_id":"7383"},{"file":[{"creator":"gkatsaro","date_updated":"2021-03-05T17:50:45Z","file_size":13317557,"date_created":"2021-03-05T17:50:45Z","file_name":"DOI_SiteControlledHWs.zip","access_level":"open_access","relation":"main_file","content_type":"application/x-zip-compressed","checksum":"41b66e195ed3dbd73077feee77b05652","file_id":"9223"},{"success":1,"file_id":"9233","checksum":"a1dc5f710ba4b3bb7f248195ba754ab2","content_type":"text/plain","relation":"main_file","access_level":"open_access","file_name":"Readme.txt","date_created":"2021-03-10T07:31:50Z","file_size":3515,"date_updated":"2021-03-10T07:31:50Z","creator":"dernst"}],"day":"16","has_accepted_license":"1","year":"2020","date_published":"2020-03-16T00:00:00Z","related_material":{"record":[{"relation":"used_in_publication","id":"7541","status":"public"}]},"doi":"10.15479/AT:ISTA:9222","contributor":[{"contributor_type":"research_group","first_name":"Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","last_name":"Katsaros"}],"license":"https://creativecommons.org/publicdomain/zero/1.0/","date_created":"2021-03-05T18:00:47Z","oa_version":"Published Version","month":"03","publisher":"Institute of Science and Technology Austria","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["530"],"citation":{"chicago":"Katsaros, Georgios. “Transport Data for: Site‐controlled Uniform Ge/Si Hut Wires with Electrically Tunable Spin–Orbit Coupling.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:9222.","ista":"Katsaros G. 2020. Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling, Institute of Science and Technology Austria, 10.15479/AT:ISTA:9222.","mla":"Katsaros, Georgios. Transport Data for: Site‐controlled Uniform Ge/Si Hut Wires with Electrically Tunable Spin–Orbit Coupling. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:9222.","short":"G. Katsaros, (2020).","ieee":"G. Katsaros, “Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling.” Institute of Science and Technology Austria, 2020.","apa":"Katsaros, G. (2020). Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:9222","ama":"Katsaros G. Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling. 2020. doi:10.15479/AT:ISTA:9222"},"date_updated":"2024-02-21T12:42:13Z","title":"Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling","file_date_updated":"2021-03-10T07:31:50Z","department":[{"_id":"GeKa"}],"author":[{"last_name":"Katsaros","orcid":"0000-0001-8342-202X","full_name":"Katsaros, Georgios","first_name":"Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","_id":"9222","status":"public","type":"research_data","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)"}},{"title":"Computational design of curved thin shells: From glass façades to programmable matter","article_processing_charge":"No","author":[{"last_name":"Guseinov","orcid":"0000-0001-9819-5077","full_name":"Guseinov, Ruslan","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","first_name":"Ruslan"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Guseinov, Ruslan. “Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8366.","ista":"Guseinov R. 2020. Computational design of curved thin shells: From glass façades to programmable matter. Institute of Science and Technology Austria.","mla":"Guseinov, Ruslan. Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8366.","short":"R. Guseinov, Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter, Institute of Science and Technology Austria, 2020.","ieee":"R. Guseinov, “Computational design of curved thin shells: From glass façades to programmable matter,” Institute of Science and Technology Austria, 2020.","ama":"Guseinov R. Computational design of curved thin shells: From glass façades to programmable matter. 2020. doi:10.15479/AT:ISTA:8366","apa":"Guseinov, R. (2020). Computational design of curved thin shells: From glass façades to programmable matter. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8366"},"project":[{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"715767","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"}],"date_created":"2020-09-10T16:19:55Z","doi":"10.15479/AT:ISTA:8366","date_published":"2020-09-21T00:00:00Z","page":"118","day":"21","year":"2020","has_accepted_license":"1","oa":1,"publisher":"Institute of Science and Technology Austria","acknowledgement":"During the work on this thesis, I received substantial support from IST Austria’s scientific service units. A big thank you to Todor Asenov and other Miba Machine Shop team members for their help with fabrication of experimental prototypes. In addition, I would like to thank Scientific Computing team for the support with high performance computing.\r\nFinancial support was provided by the European Research Council (ERC) under grant agreement No 715767 - MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling, which I gratefully acknowledge.","department":[{"_id":"BeBi"}],"file_date_updated":"2020-09-16T15:11:01Z","ddc":["000"],"date_updated":"2024-02-21T12:44:29Z","supervisor":[{"id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","last_name":"Bickel","full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385"}],"keyword":["computer-aided design","shape modeling","self-morphing","mechanical engineering"],"status":"public","type":"dissertation","_id":"8366","ec_funded":1,"related_material":{"record":[{"id":"7151","status":"deleted","relation":"research_data"},{"relation":"part_of_dissertation","status":"public","id":"7262"},{"status":"public","id":"8562","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"1001"},{"relation":"research_data","status":"public","id":"8375"}]},"language":[{"iso":"eng"}],"file":[{"file_size":70950442,"date_updated":"2020-09-10T16:11:49Z","creator":"rguseino","file_name":"thesis_rguseinov.pdf","date_created":"2020-09-10T16:11:49Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"checksum":"f8da89553da36037296b0a80f14ebf50","file_id":"8367"},{"creator":"rguseino","date_updated":"2020-09-16T15:11:01Z","file_size":76207597,"date_created":"2020-09-11T09:39:48Z","file_name":"thesis_source.zip","access_level":"closed","relation":"source_file","content_type":"application/x-zip-compressed","checksum":"e8fd944c960c20e0e27e6548af69121d","file_id":"8374"}],"degree_awarded":"PhD","publication_status":"published","publication_identifier":{"isbn":["978-3-99078-010-7"],"issn":["2663-337X"]},"month":"09","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Fabrication of curved shells plays an important role in modern design, industry, and science. Among their remarkable properties are, for example, aesthetics of organic shapes, ability to evenly distribute loads, or efficient flow separation. They find applications across vast length scales ranging from sky-scraper architecture to microscopic devices. But, at\r\nthe same time, the design of curved shells and their manufacturing process pose a variety of challenges. In this thesis, they are addressed from several perspectives. In particular, this thesis presents approaches based on the transformation of initially flat sheets into the target curved surfaces. This involves problems of interactive design of shells with nontrivial mechanical constraints, inverse design of complex structural materials, and data-driven modeling of delicate and time-dependent physical properties. At the same time, two newly-developed self-morphing mechanisms targeting flat-to-curved transformation are presented.\r\nIn architecture, doubly curved surfaces can be realized as cold bent glass panelizations. Originally flat glass panels are bent into frames and remain stressed. This is a cost-efficient fabrication approach compared to hot bending, when glass panels are shaped plastically. However such constructions are prone to breaking during bending, and it is highly\r\nnontrivial to navigate the design space, keeping the panels fabricable and aesthetically pleasing at the same time. We introduce an interactive design system for cold bent glass façades, while previously even offline optimization for such scenarios has not been sufficiently developed. Our method is based on a deep learning approach providing quick\r\nand high precision estimation of glass panel shape and stress while handling the shape\r\nmultimodality.\r\nFabrication of smaller objects of scales below 1 m, can also greatly benefit from shaping originally flat sheets. In this respect, we designed new self-morphing shell mechanisms transforming from an initial flat state to a doubly curved state with high precision and detail. Our so-called CurveUps demonstrate the encodement of the geometric information\r\ninto the shell. Furthermore, we explored the frontiers of programmable materials and showed how temporal information can additionally be encoded into a flat shell. This allows prescribing deformation sequences for doubly curved surfaces and, thus, facilitates self-collision avoidance enabling complex shapes and functionalities otherwise impossible.\r\nBoth of these methods include inverse design tools keeping the user in the design loop."}],"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"ScienComp"}]},{"project":[{"grant_number":"715767","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"article_number":"208","title":"Computational design of cold bent glass façades","article_processing_charge":"No","external_id":{"arxiv":["2009.03667"],"isi":["000595589100048"]},"author":[{"last_name":"Gavriil","full_name":"Gavriil, Konstantinos","first_name":"Konstantinos"},{"last_name":"Guseinov","orcid":"0000-0001-9819-5077","full_name":"Guseinov, Ruslan","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","first_name":"Ruslan"},{"first_name":"Jesus","id":"2DC83906-F248-11E8-B48F-1D18A9856A87","last_name":"Perez Rodriguez","full_name":"Perez Rodriguez, Jesus"},{"first_name":"Davide","last_name":"Pellis","full_name":"Pellis, Davide"},{"last_name":"Henderson","full_name":"Henderson, Paul M","orcid":"0000-0002-5198-7445","first_name":"Paul M","id":"13C09E74-18D9-11E9-8878-32CFE5697425"},{"last_name":"Rist","full_name":"Rist, Florian","first_name":"Florian"},{"last_name":"Pottmann","full_name":"Pottmann, Helmut","first_name":"Helmut"},{"last_name":"Bickel","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"ama":"Gavriil K, Guseinov R, Perez Rodriguez J, et al. Computational design of cold bent glass façades. ACM Transactions on Graphics. 2020;39(6). doi:10.1145/3414685.3417843","apa":"Gavriil, K., Guseinov, R., Perez Rodriguez, J., Pellis, D., Henderson, P. M., Rist, F., … Bickel, B. (2020). Computational design of cold bent glass façades. ACM Transactions on Graphics. Association for Computing Machinery. https://doi.org/10.1145/3414685.3417843","ieee":"K. Gavriil et al., “Computational design of cold bent glass façades,” ACM Transactions on Graphics, vol. 39, no. 6. Association for Computing Machinery, 2020.","short":"K. Gavriil, R. Guseinov, J. Perez Rodriguez, D. Pellis, P.M. Henderson, F. Rist, H. Pottmann, B. Bickel, ACM Transactions on Graphics 39 (2020).","mla":"Gavriil, Konstantinos, et al. “Computational Design of Cold Bent Glass Façades.” ACM Transactions on Graphics, vol. 39, no. 6, 208, Association for Computing Machinery, 2020, doi:10.1145/3414685.3417843.","ista":"Gavriil K, Guseinov R, Perez Rodriguez J, Pellis D, Henderson PM, Rist F, Pottmann H, Bickel B. 2020. Computational design of cold bent glass façades. ACM Transactions on Graphics. 39(6), 208.","chicago":"Gavriil, Konstantinos, Ruslan Guseinov, Jesus Perez Rodriguez, Davide Pellis, Paul M Henderson, Florian Rist, Helmut Pottmann, and Bernd Bickel. “Computational Design of Cold Bent Glass Façades.” ACM Transactions on Graphics. Association for Computing Machinery, 2020. https://doi.org/10.1145/3414685.3417843."},"oa":1,"publisher":"Association for Computing Machinery","quality_controlled":"1","acknowledgement":"We thank IST Austria’s Scientific Computing team for their support, Corinna Datsiou and Sophie Pennetier for their expert input on the practical applications of cold bent glass, and Zaha Hadid Architects and Waagner Biro for providing the architectural datasets. Photo of Fondation Louis Vuitton by Francisco Anzola / CC BY 2.0 / cropped.\r\nPhoto of Opus by Danica O. Kus. This project has received funding from the European Union’s\r\nHorizon 2020 research and innovation program under grant agreement No 675789 - Algebraic Representations in Computer-Aided Design for complEx Shapes (ARCADES), from the European Research Council (ERC) under grant agreement No 715767 - MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling, and SFB-Transregio “Discretization in Geometry and Dynamics” through grant I 2978 of the Austrian Science Fund (FWF). F. Rist and K. Gavriil have been partially supported by KAUST baseline funding.","date_created":"2020-09-23T11:30:02Z","doi":"10.1145/3414685.3417843","date_published":"2020-11-26T00:00:00Z","publication":"ACM Transactions on Graphics","day":"26","year":"2020","isi":1,"has_accepted_license":"1","status":"public","type":"journal_article","article_type":"original","_id":"8562","file_date_updated":"2023-05-23T20:54:43Z","department":[{"_id":"BeBi"}],"ddc":["000"],"date_updated":"2024-02-21T12:43:21Z","intvolume":" 39","month":"11","scopus_import":"1","oa_version":"Submitted Version","abstract":[{"text":"Cold bent glass is a promising and cost-efficient method for realizing doubly curved glass facades. They are produced by attaching planar glass sheets to curved frames and require keeping the occurring stress within safe limits.\r\nHowever, it is very challenging to navigate the design space of cold bent glass panels due to the fragility of the material, which impedes the form-finding for practically feasible and aesthetically pleasing cold bent glass facades. We propose an interactive, data-driven approach for designing cold bent glass facades that can be seamlessly integrated into a typical architectural design pipeline. Our method allows non-expert users to interactively edit a parametric surface while providing real-time feedback on the deformed shape and maximum stress of cold bent glass panels. Designs are automatically refined to minimize several fairness criteria while maximal stresses are kept within glass limits. We achieve interactive frame rates by using a differentiable Mixture Density Network trained from more than a million simulations. Given a curved boundary, our regression model is capable of handling multistable\r\nconfigurations and accurately predicting the equilibrium shape of the panel and its corresponding maximal stress. We show predictions are highly accurate and validate our results with a physical realization of a cold bent glass surface.","lang":"eng"}],"acknowledged_ssus":[{"_id":"ScienComp"}],"ec_funded":1,"volume":39,"related_material":{"link":[{"url":"https://ist.ac.at/en/news/bend-dont-break/","relation":"press_release","description":"News on IST Homepage"}],"record":[{"status":"public","id":"8366","relation":"dissertation_contains"},{"relation":"research_data","status":"public","id":"8761"}]},"issue":"6","language":[{"iso":"eng"}],"file":[{"success":1,"file_id":"13084","checksum":"c7f67717ad74e670b7daeae732abe151","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"coldglass.pdf","date_created":"2023-05-23T20:54:43Z","file_size":28964641,"date_updated":"2023-05-23T20:54:43Z","creator":"bbickel"}],"publication_status":"published","publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]}},{"title":"Zero field splitting of heavy-hole states in quantum dots","author":[{"id":"38DB5788-F248-11E8-B48F-1D18A9856A87","first_name":"Georgios","last_name":"Katsaros","full_name":"Katsaros, Georgios","orcid":"0000-0001-8342-202X"},{"last_name":"Kukucka","full_name":"Kukucka, Josip","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87","first_name":"Josip"},{"last_name":"Vukušić","orcid":"0000-0003-2424-8636","full_name":"Vukušić, Lada","id":"31E9F056-F248-11E8-B48F-1D18A9856A87","first_name":"Lada"},{"last_name":"Watzinger","full_name":"Watzinger, Hannes","first_name":"Hannes","id":"35DF8E50-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Fei","last_name":"Gao","full_name":"Gao, Fei"},{"orcid":"0000-0002-4619-9575","full_name":"Wang, Ting","last_name":"Wang","first_name":"Ting"},{"first_name":"Jian-Jun","last_name":"Zhang","full_name":"Zhang, Jian-Jun"},{"first_name":"Karsten","full_name":"Held, Karsten","last_name":"Held"}],"external_id":{"isi":["000548893200066"],"pmid":["32479090"]},"article_processing_charge":"Yes (via OA deal)","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"mla":"Katsaros, Georgios, et al. “Zero Field Splitting of Heavy-Hole States in Quantum Dots.” Nano Letters, vol. 20, no. 7, American Chemical Society, 2020, pp. 5201–06, doi:10.1021/acs.nanolett.0c01466.","ieee":"G. Katsaros et al., “Zero field splitting of heavy-hole states in quantum dots,” Nano Letters, vol. 20, no. 7. American Chemical Society, pp. 5201–5206, 2020.","short":"G. Katsaros, J. Kukucka, L. Vukušić, H. Watzinger, F. Gao, T. Wang, J.-J. Zhang, K. Held, Nano Letters 20 (2020) 5201–5206.","apa":"Katsaros, G., Kukucka, J., Vukušić, L., Watzinger, H., Gao, F., Wang, T., … Held, K. (2020). Zero field splitting of heavy-hole states in quantum dots. Nano Letters. American Chemical Society. https://doi.org/10.1021/acs.nanolett.0c01466","ama":"Katsaros G, Kukucka J, Vukušić L, et al. Zero field splitting of heavy-hole states in quantum dots. Nano Letters. 2020;20(7):5201-5206. doi:10.1021/acs.nanolett.0c01466","chicago":"Katsaros, Georgios, Josip Kukucka, Lada Vukušić, Hannes Watzinger, Fei Gao, Ting Wang, Jian-Jun Zhang, and Karsten Held. “Zero Field Splitting of Heavy-Hole States in Quantum Dots.” Nano Letters. American Chemical Society, 2020. https://doi.org/10.1021/acs.nanolett.0c01466.","ista":"Katsaros G, Kukucka J, Vukušić L, Watzinger H, Gao F, Wang T, Zhang J-J, Held K. 2020. Zero field splitting of heavy-hole states in quantum dots. Nano Letters. 20(7), 5201–5206."},"project":[{"grant_number":"P32235","name":"Towards scalable hut wire quantum devices","_id":"237B3DA4-32DE-11EA-91FC-C7463DDC885E","call_identifier":"FWF"},{"call_identifier":"H2020","_id":"237E5020-32DE-11EA-91FC-C7463DDC885E","grant_number":"862046","name":"TOPOLOGICALLY PROTECTED AND SCALABLE QUANTUM BITS"}],"doi":"10.1021/acs.nanolett.0c01466","date_published":"2020-06-01T00:00:00Z","date_created":"2020-08-06T09:25:04Z","page":"5201-5206","day":"01","publication":"Nano Letters","isi":1,"has_accepted_license":"1","year":"2020","publisher":"American Chemical Society","quality_controlled":"1","oa":1,"acknowledgement":"We acknowledge G. Burkard, V. N. Golovach, C. Kloeffel, D.Loss, P. Rabl, and M. Rancič ́ for helpful discussions. We\r\nfurther acknowledge T. Adletzberger, J. Aguilera, T. Asenov, S. Bagiante, T. Menner, L. Shafeek, P. Taus, P. Traunmüller, and D. Waldhausl for their invaluable assistance. This research was supported by the Scientific Service Units of IST Austria through resources provided by the MIBA Machine Shop and the nanofabrication facility, by the FWF-P 32235 project, by the National Key R&D Program of China (2016YFA0301701, 2016YFA0300600), and by the European Union’s Horizon 2020 research and innovation program under grant agreement no. 862046. All data of this publication are available at 10.15479/AT:ISTA:7689.","file_date_updated":"2020-08-06T09:35:37Z","department":[{"_id":"GeKa"}],"ddc":["530"],"date_updated":"2024-02-21T12:44:01Z","status":"public","type":"journal_article","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"8203","related_material":{"record":[{"relation":"research_data","status":"public","id":"7689"}]},"volume":20,"issue":"7","ec_funded":1,"file":[{"date_created":"2020-08-06T09:35:37Z","file_name":"2020_NanoLetters_Katsaros.pdf","date_updated":"2020-08-06T09:35:37Z","file_size":3308906,"creator":"dernst","file_id":"8204","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1530-6984"],"eissn":["1530-6992"]},"publication_status":"published","month":"06","intvolume":" 20","scopus_import":"1","pmid":1,"oa_version":"Published Version","abstract":[{"text":"Using inelastic cotunneling spectroscopy we observe a zero field splitting within the spin triplet manifold of Ge hut wire quantum dots. The states with spin ±1 in the confinement direction are energetically favored by up to 55 μeV compared to the spin 0 triplet state because of the strong spin–orbit coupling. The reported effect should be observable in a broad class of strongly confined hole quantum-dot systems and might need to be considered when operating hole spin qubits.","lang":"eng"}],"acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}]},{"title":"Optogenetic inhibition-mediated activity-dependent modification of CA1 pyramidal-interneuron connections during behavior","author":[{"full_name":"Gridchyn, Igor","orcid":"0000-0002-1807-1929","last_name":"Gridchyn","first_name":"Igor","id":"4B60654C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Philipp","id":"3B9D816C-F248-11E8-B48F-1D18A9856A87","last_name":"Schönenberger","full_name":"Schönenberger, Philipp"},{"full_name":"O'Neill, Joseph","last_name":"O'Neill","id":"426376DC-F248-11E8-B48F-1D18A9856A87","first_name":"Joseph"},{"first_name":"Jozsef L","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","full_name":"Csicsvari, Jozsef L","orcid":"0000-0002-5193-4036","last_name":"Csicsvari"}],"article_processing_charge":"No","external_id":{"isi":["000584369000001"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"ista":"Gridchyn I, Schönenberger P, O’Neill J, Csicsvari JL. 2020. Optogenetic inhibition-mediated activity-dependent modification of CA1 pyramidal-interneuron connections during behavior. eLife. 9, 61106.","chicago":"Gridchyn, Igor, Philipp Schönenberger, Joseph O’Neill, and Jozsef L Csicsvari. “Optogenetic Inhibition-Mediated Activity-Dependent Modification of CA1 Pyramidal-Interneuron Connections during Behavior.” ELife. eLife Sciences Publications, 2020. https://doi.org/10.7554/eLife.61106.","ieee":"I. Gridchyn, P. Schönenberger, J. O’Neill, and J. L. Csicsvari, “Optogenetic inhibition-mediated activity-dependent modification of CA1 pyramidal-interneuron connections during behavior,” eLife, vol. 9. eLife Sciences Publications, 2020.","short":"I. Gridchyn, P. Schönenberger, J. O’Neill, J.L. Csicsvari, ELife 9 (2020).","apa":"Gridchyn, I., Schönenberger, P., O’Neill, J., & Csicsvari, J. L. (2020). Optogenetic inhibition-mediated activity-dependent modification of CA1 pyramidal-interneuron connections during behavior. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.61106","ama":"Gridchyn I, Schönenberger P, O’Neill J, Csicsvari JL. Optogenetic inhibition-mediated activity-dependent modification of CA1 pyramidal-interneuron connections during behavior. eLife. 2020;9. doi:10.7554/eLife.61106","mla":"Gridchyn, Igor, et al. “Optogenetic Inhibition-Mediated Activity-Dependent Modification of CA1 Pyramidal-Interneuron Connections during Behavior.” ELife, vol. 9, 61106, eLife Sciences Publications, 2020, doi:10.7554/eLife.61106."},"project":[{"name":"Interneuron plasticity during spatial learning","grant_number":"I2072-B27","_id":"257D4372-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"2654F984-B435-11E9-9278-68D0E5697425","grant_number":"I03713","name":"Interneuro Plasticity During Spatial Learning"}],"article_number":"61106","date_published":"2020-10-05T00:00:00Z","doi":"10.7554/eLife.61106","date_created":"2020-11-08T23:01:25Z","day":"05","publication":"eLife","has_accepted_license":"1","isi":1,"year":"2020","publisher":"eLife Sciences Publications","quality_controlled":"1","oa":1,"acknowledgement":"We thank Michele Nardin and Federico Stella for comments on an earlier version of the manuscript. K Deisseroth for providing the pAAV-CaMKIIα::eNpHR3.0-YFP plasmid through Addgene. E Boyden for providing AAV2/1.CaMKII::ArchT.GFP.WPRE.SV40 plasmid through Penn Vector Core. This work was supported by the Austrian Science Fund (I02072 and I03713) and a Swiss National Science Foundation grant to PS. The authors declare no conflicts of interest.","department":[{"_id":"JoCs"}],"file_date_updated":"2020-11-09T09:17:40Z","ddc":["570"],"date_updated":"2024-02-21T12:43:40Z","status":"public","article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"8740","related_material":{"record":[{"id":"8563","status":"public","relation":"research_data"}]},"volume":9,"file":[{"date_created":"2020-11-09T09:17:40Z","file_name":"2020_eLife_Gridchyn.pdf","creator":"dernst","date_updated":"2020-11-09T09:17:40Z","file_size":447669,"file_id":"8749","checksum":"6a7b0543c440f4c000a1864e69377d95","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2050084X"]},"publication_status":"published","month":"10","intvolume":" 9","scopus_import":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"In vitro work revealed that excitatory synaptic inputs to hippocampal inhibitory interneurons could undergo Hebbian, associative, or non-associative plasticity. Both behavioral and learning-dependent reorganization of these connections has also been demonstrated by measuring spike transmission probabilities in pyramidal cell-interneuron spike cross-correlations that indicate monosynaptic connections. Here we investigated the activity-dependent modification of these connections during exploratory behavior in rats by optogenetically inhibiting pyramidal cell and interneuron subpopulations. Light application and associated firing alteration of pyramidal and interneuron populations led to lasting changes in pyramidal-interneuron connection weights as indicated by spike transmission changes. Spike transmission alterations were predicted by the light-mediated changes in the number of pre- and postsynaptic spike pairing events and by firing rate changes of interneurons but not pyramidal cells. This work demonstrates the presence of activity-dependent associative and non-associative reorganization of pyramidal-interneuron connections triggered by the optogenetic modification of the firing rate and spike synchrony of cells."}]},{"file":[{"file_id":"8376","checksum":"4029ffd65fb82ef2366b2fc2a4908e16","success":1,"access_level":"open_access","relation":"main_file","content_type":"video/mp4","date_created":"2020-09-11T09:45:21Z","file_name":"supplementary_movie_1.mp4","creator":"rguseino","date_updated":"2020-09-11T09:45:21Z","file_size":29214988},{"content_type":"video/mp4","access_level":"open_access","relation":"main_file","file_id":"8377","checksum":"8ed03b04d80f1a4e622cb22e6100afd8","success":1,"date_updated":"2020-09-11T09:45:25Z","file_size":28449475,"creator":"rguseino","date_created":"2020-09-11T09:45:25Z","file_name":"supplementary_movie_2.mp4"},{"date_created":"2020-09-11T09:45:28Z","file_name":"supplementary_movie_3.mp4","creator":"rguseino","date_updated":"2020-09-11T09:45:28Z","file_size":26315853,"checksum":"ad6864afb5e694e5c52a88fba4e02eea","file_id":"8378","success":1,"access_level":"open_access","relation":"main_file","content_type":"video/mp4"},{"date_updated":"2020-09-11T09:45:33Z","file_size":25198755,"creator":"rguseino","date_created":"2020-09-11T09:45:33Z","file_name":"supplementary_movie_4.mp4","content_type":"video/mp4","access_level":"open_access","relation":"main_file","checksum":"b079cef7871fe1afb69af0e2b099f3b1","file_id":"8379","success":1},{"success":1,"checksum":"9d1d48a8ed5c109a999c51b044ee523d","file_id":"8380","content_type":"video/mp4","relation":"main_file","access_level":"open_access","file_name":"supplementary_movie_5.mp4","date_created":"2020-09-11T09:45:36Z","file_size":29011354,"date_updated":"2020-09-11T09:45:36Z","creator":"rguseino"},{"content_type":"text/plain","access_level":"open_access","relation":"main_file","file_id":"8381","checksum":"d414d0059e982d752d218756b3c3ce05","success":1,"date_updated":"2020-09-11T09:52:36Z","file_size":586,"creator":"rguseino","date_created":"2020-09-11T09:52:36Z","file_name":"readme.txt"}],"day":"21","has_accepted_license":"1","year":"2020","date_published":"2020-09-21T00:00:00Z","related_material":{"record":[{"relation":"used_in_publication","id":"8366","status":"public"}]},"doi":"10.15479/AT:ISTA:8375","contributor":[{"contributor_type":"researcher","first_name":"Ruslan","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","last_name":"Guseinov","orcid":"0000-0001-9819-5077"},{"last_name":"McMahan","first_name":"Connor","contributor_type":"researcher"},{"id":"2DC83906-F248-11E8-B48F-1D18A9856A87","first_name":"Jesus","contributor_type":"researcher","last_name":"Perez Rodriguez"},{"last_name":"Daraio","contributor_type":"researcher","first_name":"Chiara"},{"contributor_type":"researcher","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","orcid":"0000-0001-6511-9385","last_name":"Bickel"}],"date_created":"2020-09-11T09:52:54Z","ec_funded":1,"oa_version":"Published Version","abstract":[{"text":"Supplementary movies showing the following sequences for spatio-temporarily programmed shells: input geometry and actuation time landscape; comparison of morphing processes from a camera recording and a simulation; final actuated shape.","lang":"eng"}],"month":"09","publisher":"Institute of Science and Technology Austria","oa":1,"ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-02-21T12:44:29Z","citation":{"ista":"Guseinov R. 2020. Supplementary data for ‘Computational design of curved thin shells: from glass façades to programmable matter’, Institute of Science and Technology Austria, 10.15479/AT:ISTA:8375.","chicago":"Guseinov, Ruslan. “Supplementary Data for ‘Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter.’” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8375.","ama":"Guseinov R. Supplementary data for “Computational design of curved thin shells: from glass façades to programmable matter.” 2020. doi:10.15479/AT:ISTA:8375","apa":"Guseinov, R. (2020). Supplementary data for “Computational design of curved thin shells: from glass façades to programmable matter.” Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8375","short":"R. Guseinov, (2020).","ieee":"R. Guseinov, “Supplementary data for ‘Computational design of curved thin shells: from glass façades to programmable matter.’” Institute of Science and Technology Austria, 2020.","mla":"Guseinov, Ruslan. Supplementary Data for “Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter.” Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8375."},"file_date_updated":"2020-09-11T09:52:36Z","title":"Supplementary data for \"Computational design of curved thin shells: from glass façades to programmable matter\"","department":[{"_id":"BeBi"}],"author":[{"first_name":"Ruslan","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9819-5077","full_name":"Guseinov, Ruslan","last_name":"Guseinov"}],"article_processing_charge":"No","_id":"8375","status":"public","project":[{"call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767"}],"type":"research_data","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)"}},{"_id":"7689","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)"},"type":"research_data","project":[{"name":"TOPOLOGICALLY PROTECTED AND SCALABLE QUANTUM BITS","grant_number":"862046","call_identifier":"H2020","_id":"237E5020-32DE-11EA-91FC-C7463DDC885E"},{"_id":"237B3DA4-32DE-11EA-91FC-C7463DDC885E","call_identifier":"FWF","name":"Towards scalable hut wire quantum devices","grant_number":"P32235"}],"status":"public","date_updated":"2024-02-21T12:44:02Z","citation":{"mla":"Katsaros, Georgios. Supplementary Data for “Zero Field Splitting of Heavy-Hole States in Quantum Dots.” Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:7689.","ieee":"G. Katsaros, “Supplementary data for ‘Zero field splitting of heavy-hole states in quantum dots.’” Institute of Science and Technology Austria, 2020.","short":"G. Katsaros, (2020).","ama":"Katsaros G. Supplementary data for “Zero field splitting of heavy-hole states in quantum dots.” 2020. doi:10.15479/AT:ISTA:7689","apa":"Katsaros, G. (2020). Supplementary data for “Zero field splitting of heavy-hole states in quantum dots.” Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:7689","chicago":"Katsaros, Georgios. “Supplementary Data for ‘Zero Field Splitting of Heavy-Hole States in Quantum Dots.’” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:7689.","ista":"Katsaros G. 2020. Supplementary data for ‘Zero field splitting of heavy-hole states in quantum dots’, Institute of Science and Technology Austria, 10.15479/AT:ISTA:7689."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["530"],"article_processing_charge":"No","author":[{"id":"38DB5788-F248-11E8-B48F-1D18A9856A87","first_name":"Georgios","orcid":"0000-0001-8342-202X","full_name":"Katsaros, Georgios","last_name":"Katsaros"}],"file_date_updated":"2020-07-14T12:48:02Z","department":[{"_id":"GeKa"}],"title":"Supplementary data for \"Zero field splitting of heavy-hole states in quantum dots\"","abstract":[{"lang":"eng","text":"These are the supplementary research data to the publication \"Zero field splitting of heavy-hole states in quantum dots\". All matrix files have the same format. Within each column the bias voltage is changed. Each column corresponds to either a different gate voltage or magnetic field. The voltage values are given in mV, the current values in pA. Find a specific description in the included Readme file.\r\n"}],"oa_version":"Published Version","oa":1,"publisher":"Institute of Science and Technology Austria","month":"05","year":"2020","has_accepted_license":"1","day":"01","file":[{"creator":"gkatsaro","file_size":5514403,"date_updated":"2020-07-14T12:48:02Z","file_name":"DOI_ZeroFieldSplitting.zip","date_created":"2020-05-01T15:13:28Z","relation":"main_file","access_level":"open_access","content_type":"application/x-zip-compressed","checksum":"d23c0cb9e2d19e14e2f902b88b97c05d","file_id":"7786"}],"date_created":"2020-05-01T15:14:46Z","contributor":[{"contributor_type":"contact_person","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","first_name":"Georgios","last_name":"Katsaros"}],"ec_funded":1,"related_material":{"record":[{"relation":"used_in_publication","id":"8203","status":"public"}]},"date_published":"2020-05-01T00:00:00Z","doi":"10.15479/AT:ISTA:7689"},{"_id":"8761","status":"public","project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"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":"research_data","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"date_updated":"2024-02-21T12:43:22Z","citation":{"ama":"Guseinov R. Supplementary data for “Computational design of cold bent glass façades.” 2020. doi:10.15479/AT:ISTA:8761","apa":"Guseinov, R. (2020). Supplementary data for “Computational design of cold bent glass façades.” Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8761","short":"R. Guseinov, (2020).","ieee":"R. Guseinov, “Supplementary data for ‘Computational design of cold bent glass façades.’” Institute of Science and Technology Austria, 2020.","mla":"Guseinov, Ruslan. Supplementary Data for “Computational Design of Cold Bent Glass Façades.” Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8761.","ista":"Guseinov R. 2020. Supplementary data for ‘Computational design of cold bent glass façades’, Institute of Science and Technology Austria, 10.15479/AT:ISTA:8761.","chicago":"Guseinov, Ruslan. “Supplementary Data for ‘Computational Design of Cold Bent Glass Façades.’” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8761."},"department":[{"_id":"BeBi"}],"file_date_updated":"2020-11-18T10:04:59Z","title":"Supplementary data for \"Computational design of cold bent glass façades\"","article_processing_charge":"No","author":[{"orcid":"0000-0001-9819-5077","full_name":"Guseinov, Ruslan","last_name":"Guseinov","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","first_name":"Ruslan"}],"oa_version":"Published Version","acknowledged_ssus":[{"_id":"ScienComp"}],"month":"11","oa":1,"publisher":"Institute of Science and Technology Austria","file":[{"file_size":15378270,"date_updated":"2020-11-16T10:31:29Z","creator":"rguseino","file_name":"mdn_model.tar.gz","date_created":"2020-11-16T10:31:29Z","content_type":"application/x-gzip","relation":"main_file","access_level":"open_access","success":1,"file_id":"8762","checksum":"f5ae57b97017b9f61081032703361233"},{"date_created":"2020-11-16T10:43:23Z","file_name":"optimal_panels_data.tar.gz","creator":"rguseino","date_updated":"2020-11-16T10:43:23Z","file_size":615387734,"file_id":"8763","checksum":"b0d25e04060ee78c585ee2f23542c744","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/x-gzip"},{"date_created":"2020-11-18T10:04:59Z","file_name":"readme.txt","date_updated":"2020-11-18T10:04:59Z","file_size":1228,"creator":"rguseino","file_id":"8770","checksum":"69c1dde3434ada86d125e0c2588caf1e","success":1,"content_type":"text/plain","access_level":"open_access","relation":"main_file"}],"day":"23","year":"2020","has_accepted_license":"1","contributor":[{"last_name":"Gavriil","contributor_type":"researcher","first_name":"Konstantinos"},{"orcid":"0000-0001-9819-5077","last_name":"Guseinov","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","contributor_type":"researcher","first_name":"Ruslan"},{"first_name":"Jesus","id":"2DC83906-F248-11E8-B48F-1D18A9856A87","contributor_type":"researcher","last_name":"Perez Rodriguez"},{"first_name":"Davide","contributor_type":"researcher","last_name":"Pellis"},{"contributor_type":"researcher","id":"13C09E74-18D9-11E9-8878-32CFE5697425","first_name":"Paul M","last_name":"Henderson","orcid":"0000-0002-5198-7445"},{"last_name":"Rist","first_name":"Florian","contributor_type":"researcher"},{"contributor_type":"researcher","first_name":"Helmut","last_name":"Pottmann"},{"contributor_type":"researcher","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","last_name":"Bickel"}],"ec_funded":1,"date_created":"2020-11-16T10:47:18Z","related_material":{"link":[{"relation":"software","url":"https://github.com/russelmann/cold-glass-acm"}],"record":[{"relation":"used_in_publication","id":"8562","status":"public"}]},"doi":"10.15479/AT:ISTA:8761","date_published":"2020-11-23T00:00:00Z"},{"department":[{"_id":"JoCs"}],"title":"Optogenetic alteration of hippocampal network activity","file_date_updated":"2020-10-19T10:12:29Z","author":[{"id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L","full_name":"Csicsvari, Jozsef L","orcid":"0000-0002-5193-4036","last_name":"Csicsvari"},{"orcid":"0000-0002-1807-1929","full_name":"Gridchyn, Igor","last_name":"Gridchyn","id":"4B60654C-F248-11E8-B48F-1D18A9856A87","first_name":"Igor"},{"full_name":"Schönenberger, Philipp","last_name":"Schönenberger","id":"3B9D816C-F248-11E8-B48F-1D18A9856A87","first_name":"Philipp"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["570"],"citation":{"ista":"Csicsvari JL, Gridchyn I, Schönenberger P. 2020. Optogenetic alteration of hippocampal network activity, Institute of Science and Technology Austria, 10.15479/AT:ISTA:8563.","chicago":"Csicsvari, Jozsef L, Igor Gridchyn, and Philipp Schönenberger. “Optogenetic Alteration of Hippocampal Network Activity.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8563.","apa":"Csicsvari, J. L., Gridchyn, I., & Schönenberger, P. (2020). Optogenetic alteration of hippocampal network activity. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8563","ama":"Csicsvari JL, Gridchyn I, Schönenberger P. Optogenetic alteration of hippocampal network activity. 2020. doi:10.15479/AT:ISTA:8563","ieee":"J. L. Csicsvari, I. Gridchyn, and P. Schönenberger, “Optogenetic alteration of hippocampal network activity.” Institute of Science and Technology Austria, 2020.","short":"J.L. Csicsvari, I. Gridchyn, P. Schönenberger, (2020).","mla":"Csicsvari, Jozsef L., et al. Optogenetic Alteration of Hippocampal Network Activity. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8563."},"date_updated":"2024-02-21T12:43:41Z","status":"public","type":"research_data","tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"_id":"8563","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"8740"}]},"date_published":"2020-10-19T00:00:00Z","doi":"10.15479/AT:ISTA:8563","date_created":"2020-09-23T14:39:54Z","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","contributor":[{"id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L","contributor_type":"project_leader","orcid":"0000-0002-5193-4036","last_name":"Csicsvari"}],"day":"19","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/x-compressed","success":1,"checksum":"a16098a6d172f9c42ab5af5f6991668c","file_id":"8564","creator":"jozsef","file_size":145243906,"date_updated":"2020-09-23T14:36:17Z","file_name":"upload.tgz","date_created":"2020-09-23T14:36:17Z"},{"file_name":"redme.docx","date_created":"2020-10-19T10:12:29Z","file_size":11648,"date_updated":"2020-10-19T10:12:29Z","creator":"jozsef","success":1,"file_id":"8675","checksum":"0bfc54b7e14c0694cd081617318ba606","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","relation":"main_file","access_level":"open_access"}],"has_accepted_license":"1","year":"2020","month":"10","publisher":"Institute of Science and Technology Austria","oa":1,"oa_version":"Published Version","abstract":[{"text":"Supplementary data provided for the provided for the publication:\r\nIgor Gridchyn , Philipp Schoenenberger , Joseph O'Neill , Jozsef Csicsvari (2020) Optogenetic inhibition-mediated activity-dependent modification of CA1 pyramidal-interneuron connections during behavior. Elife.","lang":"eng"}]},{"publisher":"Springer Nature","quality_controlled":"1","oa":1,"day":"13","publication":"Nature Communications","has_accepted_license":"1","isi":1,"year":"2020","date_published":"2020-01-13T00:00:00Z","doi":"10.1038/s41467-019-14015-2","date_created":"2020-01-13T16:54:26Z","article_number":"237","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"},{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"ista":"Guseinov R, McMahan C, Perez Rodriguez J, Daraio C, Bickel B. 2020. Programming temporal morphing of self-actuated shells. Nature Communications. 11, 237.","chicago":"Guseinov, Ruslan, Connor McMahan, Jesus Perez Rodriguez, Chiara Daraio, and Bernd Bickel. “Programming Temporal Morphing of Self-Actuated Shells.” Nature Communications. Springer Nature, 2020. https://doi.org/10.1038/s41467-019-14015-2.","ama":"Guseinov R, McMahan C, Perez Rodriguez J, Daraio C, Bickel B. Programming temporal morphing of self-actuated shells. Nature Communications. 2020;11. doi:10.1038/s41467-019-14015-2","apa":"Guseinov, R., McMahan, C., Perez Rodriguez, J., Daraio, C., & Bickel, B. (2020). Programming temporal morphing of self-actuated shells. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-019-14015-2","ieee":"R. Guseinov, C. McMahan, J. Perez Rodriguez, C. Daraio, and B. Bickel, “Programming temporal morphing of self-actuated shells,” Nature Communications, vol. 11. Springer Nature, 2020.","short":"R. Guseinov, C. McMahan, J. Perez Rodriguez, C. Daraio, B. Bickel, Nature Communications 11 (2020).","mla":"Guseinov, Ruslan, et al. “Programming Temporal Morphing of Self-Actuated Shells.” Nature Communications, vol. 11, 237, Springer Nature, 2020, doi:10.1038/s41467-019-14015-2."},"title":"Programming temporal morphing of self-actuated shells","author":[{"id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","first_name":"Ruslan","full_name":"Guseinov, Ruslan","orcid":"0000-0001-9819-5077","last_name":"Guseinov"},{"first_name":"Connor","last_name":"McMahan","full_name":"McMahan, Connor"},{"first_name":"Jesus","id":"2DC83906-F248-11E8-B48F-1D18A9856A87","full_name":"Perez Rodriguez, Jesus","last_name":"Perez Rodriguez"},{"first_name":"Chiara","full_name":"Daraio, Chiara","last_name":"Daraio"},{"last_name":"Bickel","full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd"}],"external_id":{"isi":["000511916800015"]},"article_processing_charge":"No","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Advances in shape-morphing materials, such as hydrogels, shape-memory polymers and light-responsive polymers have enabled prescribing self-directed deformations of initially flat geometries. However, most proposed solutions evolve towards a target geometry without considering time-dependent actuation paths. To achieve more complex geometries and avoid self-collisions, it is critical to encode a spatial and temporal shape evolution within the initially flat shell. Recent realizations of time-dependent morphing are limited to the actuation of few, discrete hinges and cannot form doubly curved surfaces. Here, we demonstrate a method for encoding temporal shape evolution in architected shells that assume complex shapes and doubly curved geometries. The shells are non-periodic tessellations of pre-stressed contractile unit cells that soften in water at rates prescribed locally by mesostructure geometry. The ensuing midplane contraction is coupled to the formation of encoded curvatures. We propose an inverse design tool based on a data-driven model for unit cells’ temporal responses."}],"month":"01","intvolume":" 11","scopus_import":"1","file":[{"date_created":"2020-01-15T14:35:34Z","file_name":"2020_NatureComm_Guseinov.pdf","date_updated":"2020-07-14T12:47:55Z","file_size":1315270,"creator":"rguseino","file_id":"7336","checksum":"7db23fef2f4cda712f17f1004116ddff","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2041-1723"]},"publication_status":"published","related_material":{"link":[{"description":"News on IST Homepage","relation":"press_release","url":"https://ist.ac.at/en/news/geometry-meets-time/"}],"record":[{"relation":"dissertation_contains","status":"public","id":"8366"},{"relation":"research_data","status":"public","id":"7154"}]},"volume":11,"ec_funded":1,"_id":"7262","status":"public","keyword":["Design","Synthesis and processing","Mechanical engineering","Polymers"],"type":"journal_article","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["000"],"date_updated":"2024-02-21T12:45:02Z","file_date_updated":"2020-07-14T12:47:55Z","department":[{"_id":"BeBi"}]},{"year":"2020","has_accepted_license":"1","day":"01","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/zip","checksum":"0108616e2a59e51879ea51299a29b091","file_id":"14593","success":1,"creator":"fschur","date_updated":"2023-11-22T14:58:44Z","file_size":49297,"date_created":"2023-11-22T14:58:44Z","file_name":"3Dprint-files_download_v2.zip"},{"date_updated":"2023-12-01T10:39:59Z","file_size":641,"creator":"cchlebak","date_created":"2023-12-01T10:39:59Z","file_name":"readme.txt","content_type":"text/plain","access_level":"open_access","relation":"main_file","checksum":"4c66ddedee4d01c1c4a7978208350cfc","file_id":"14637","success":1}],"date_created":"2023-11-22T15:00:57Z","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","contributor":[{"orcid":"0000-0001-7149-769X","last_name":"Fäßler","first_name":"Florian","contributor_type":"researcher","id":"404F5528-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Zens","id":"45FD126C-F248-11E8-B48F-1D18A9856A87","first_name":"Bettina","contributor_type":"researcher"},{"contributor_type":"researcher","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","last_name":"Hauschild"},{"contributor_type":"researcher","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","first_name":"Florian KM","last_name":"Schur","orcid":"0000-0003-4790-8078"}],"date_published":"2020-12-01T00:00:00Z","related_material":{"record":[{"relation":"research_data","id":"8586","status":"public"}]},"doi":"10.15479/AT:ISTA:14592","abstract":[{"text":"Cryo-electron microscopy (cryo-EM) of cellular specimens provides insights into biological processes and structures within a native context. However, a major challenge still lies in the efficient and reproducible preparation of adherent cells for subsequent cryo-EM analysis. This is due to the sensitivity of many cellular specimens to the varying seeding and culturing conditions required for EM experiments, the often limited amount of cellular material and also the fragility of EM grids and their substrate. Here, we present low-cost and reusable 3D printed grid holders, designed to improve specimen preparation when culturing challenging cellular samples directly on grids. The described grid holders increase cell culture reproducibility and throughput, and reduce the resources required for cell culturing. We show that grid holders can be integrated into various cryo-EM workflows, including micro-patterning approaches to control cell seeding on grids, and for generating samples for cryo-focused ion beam milling and cryo-electron tomography experiments. Their adaptable design allows for the generation of specialized grid holders customized to a large variety of applications.","lang":"eng"}],"oa_version":"Published Version","oa":1,"publisher":"Institute of Science and Technology Austria","month":"12","citation":{"mla":"Schur, Florian KM. STL-Files for 3D-Printed Grid Holders Described in Fäßler F, Zens B, et Al.; 3D Printed Cell Culture Grid Holders for Improved Cellular Specimen Preparation in Cryo-Electron Microscopy. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:14592.","short":"F.K. Schur, (2020).","ieee":"F. K. Schur, “STL-files for 3D-printed grid holders described in Fäßler F, Zens B, et al.; 3D printed cell culture grid holders for improved cellular specimen preparation in cryo-electron microscopy.” Institute of Science and Technology Austria, 2020.","ama":"Schur FK. STL-files for 3D-printed grid holders described in Fäßler F, Zens B, et al.; 3D printed cell culture grid holders for improved cellular specimen preparation in cryo-electron microscopy. 2020. doi:10.15479/AT:ISTA:14592","apa":"Schur, F. K. (2020). STL-files for 3D-printed grid holders described in Fäßler F, Zens B, et al.; 3D printed cell culture grid holders for improved cellular specimen preparation in cryo-electron microscopy. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:14592","chicago":"Schur, Florian KM. “STL-Files for 3D-Printed Grid Holders Described in Fäßler F, Zens B, et Al.; 3D Printed Cell Culture Grid Holders for Improved Cellular Specimen Preparation in Cryo-Electron Microscopy.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:14592.","ista":"Schur FK. 2020. STL-files for 3D-printed grid holders described in Fäßler F, Zens B, et al.; 3D printed cell culture grid holders for improved cellular specimen preparation in cryo-electron microscopy, Institute of Science and Technology Austria, 10.15479/AT:ISTA:14592."},"date_updated":"2024-02-21T12:44:48Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["570"],"article_processing_charge":"No","author":[{"id":"48AD8942-F248-11E8-B48F-1D18A9856A87","first_name":"Florian KM","last_name":"Schur","orcid":"0000-0003-4790-8078","full_name":"Schur, Florian KM"}],"department":[{"_id":"FlSc"}],"file_date_updated":"2023-12-01T10:39:59Z","title":"STL-files for 3D-printed grid holders described in Fäßler F, Zens B, et al.; 3D printed cell culture grid holders for improved cellular specimen preparation in cryo-electron microscopy","_id":"14592","tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","image":"/images/cc_by_nc_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","short":"CC BY-NC-SA (4.0)"},"type":"research_data","status":"public","project":[{"_id":"9B954C5C-BA93-11EA-9121-9846C619BF3A","name":"Structure and isoform diversity of the Arp2/3 complex","grant_number":"P33367"}]},{"oa":1,"quality_controlled":"1","publisher":"Springer Nature","year":"2020","has_accepted_license":"1","isi":1,"publication":"Complex Networks and their applications VIII","day":"01","page":"27-39","date_created":"2019-12-29T23:00:45Z","date_published":"2020-01-01T00:00:00Z","doi":"10.1007/978-3-030-36687-2_3","project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"citation":{"mla":"Bhatia, Sumit, et al. “A Persistent Homology Perspective to the Link Prediction Problem.” Complex Networks and Their Applications VIII, vol. 881, Springer Nature, 2020, pp. 27–39, doi:10.1007/978-3-030-36687-2_3.","apa":"Bhatia, S., Chatterjee, B., Nathani, D., & Kaul, M. (2020). A persistent homology perspective to the link prediction problem. In Complex Networks and their applications VIII (Vol. 881, pp. 27–39). Lisbon, Portugal: Springer Nature. https://doi.org/10.1007/978-3-030-36687-2_3","ama":"Bhatia S, Chatterjee B, Nathani D, Kaul M. A persistent homology perspective to the link prediction problem. In: Complex Networks and Their Applications VIII. Vol 881. Springer Nature; 2020:27-39. doi:10.1007/978-3-030-36687-2_3","ieee":"S. Bhatia, B. Chatterjee, D. Nathani, and M. Kaul, “A persistent homology perspective to the link prediction problem,” in Complex Networks and their applications VIII, Lisbon, Portugal, 2020, vol. 881, pp. 27–39.","short":"S. Bhatia, B. Chatterjee, D. Nathani, M. Kaul, in:, Complex Networks and Their Applications VIII, Springer Nature, 2020, pp. 27–39.","chicago":"Bhatia, Sumit, Bapi Chatterjee, Deepak Nathani, and Manohar Kaul. “A Persistent Homology Perspective to the Link Prediction Problem.” In Complex Networks and Their Applications VIII, 881:27–39. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-36687-2_3.","ista":"Bhatia S, Chatterjee B, Nathani D, Kaul M. 2020. A persistent homology perspective to the link prediction problem. Complex Networks and their applications VIII. COMPLEX: International Conference on Complex Networks and their Applications, SCI, vol. 881, 27–39."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","external_id":{"isi":["000843927300003"]},"author":[{"first_name":"Sumit","last_name":"Bhatia","full_name":"Bhatia, Sumit"},{"last_name":"Chatterjee","full_name":"Chatterjee, Bapi","orcid":"0000-0002-2742-4028","id":"3C41A08A-F248-11E8-B48F-1D18A9856A87","first_name":"Bapi"},{"first_name":"Deepak","full_name":"Nathani, Deepak","last_name":"Nathani"},{"first_name":"Manohar","last_name":"Kaul","full_name":"Kaul, Manohar"}],"title":"A persistent homology perspective to the link prediction problem","abstract":[{"lang":"eng","text":"Persistent homology is a powerful tool in Topological Data Analysis (TDA) to capture the topological properties of data succinctly at different spatial resolutions. For graphical data, the shape, and structure of the neighborhood of individual data items (nodes) are an essential means of characterizing their properties. We propose the use of persistent homology methods to capture structural and topological properties of graphs and use it to address the problem of link prediction. We achieve encouraging results on nine different real-world datasets that attest to the potential of persistent homology-based methods for network analysis."}],"oa_version":"Submitted Version","alternative_title":["SCI"],"scopus_import":"1","intvolume":" 881","month":"01","publication_status":"published","publication_identifier":{"isbn":["9783030366865"],"eissn":["18609503"],"issn":["1860949X"]},"language":[{"iso":"eng"}],"file":[{"success":1,"checksum":"8951f094c8c7dae9ff8db885199bc296","file_id":"8625","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"main.pdf","date_created":"2020-10-08T08:16:48Z","creator":"bchatter","file_size":310598,"date_updated":"2020-10-08T08:16:48Z"}],"ec_funded":1,"volume":881,"_id":"7213","conference":{"start_date":"2019-12-10","end_date":"2019-12-12","location":"Lisbon, Portugal","name":"COMPLEX: International Conference on Complex Networks and their Applications"},"type":"conference","status":"public","date_updated":"2024-02-22T13:16:06Z","ddc":["004"],"file_date_updated":"2020-10-08T08:16:48Z","department":[{"_id":"DaAl"}]},{"citation":{"chicago":"Kokoris Kogias, Eleftherios, Dahlia Malkhi, and Alexander Spiegelman. “Asynchronous Distributed Key Generation for Computationally-Secure Randomness, Consensus, and Threshold Signatures.” In Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, 1751–1767. Association for Computing Machinery, 2020. https://doi.org/10.1145/3372297.3423364.","ista":"Kokoris Kogias E, Malkhi D, Spiegelman A. 2020. Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures. Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security. CCS: Computer and Communications Security, 1751–1767.","mla":"Kokoris Kogias, Eleftherios, et al. “Asynchronous Distributed Key Generation for Computationally-Secure Randomness, Consensus, and Threshold Signatures.” Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, Association for Computing Machinery, 2020, pp. 1751–1767, doi:10.1145/3372297.3423364.","short":"E. Kokoris Kogias, D. Malkhi, A. Spiegelman, in:, Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, Association for Computing Machinery, 2020, pp. 1751–1767.","ieee":"E. Kokoris Kogias, D. Malkhi, and A. Spiegelman, “Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures,” in Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, Virtual, United States, 2020, pp. 1751–1767.","ama":"Kokoris Kogias E, Malkhi D, Spiegelman A. Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security. Association for Computing Machinery; 2020:1751–1767. doi:10.1145/3372297.3423364","apa":"Kokoris Kogias, E., Malkhi, D., & Spiegelman, A. (2020). Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures. In Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security (pp. 1751–1767). Virtual, United States: Association for Computing Machinery. https://doi.org/10.1145/3372297.3423364"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Kokoris Kogias, Eleftherios","last_name":"Kokoris Kogias","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","first_name":"Eleftherios"},{"last_name":"Malkhi","full_name":"Malkhi, Dahlia","first_name":"Dahlia"},{"first_name":"Alexander","full_name":"Spiegelman, Alexander","last_name":"Spiegelman"}],"external_id":{"isi":["000768470400104"]},"article_processing_charge":"No","title":"Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures","isi":1,"year":"2020","day":"30","publication":"Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security","page":"1751–1767","date_published":"2020-10-30T00:00:00Z","doi":"10.1145/3372297.3423364","date_created":"2021-12-16T13:23:27Z","acknowledgement":"We would like to thank Ittai Abraham for the discussions and guidance during the initial conception of the project, especially for HAVSS. Furthermore, we would like to thank the anonymous reviewers for pointing out the relevance of this work to MPC protocols.","quality_controlled":"1","publisher":"Association for Computing Machinery","oa":1,"date_updated":"2024-02-22T13:10:45Z","department":[{"_id":"ElKo"}],"_id":"10556","type":"conference","conference":{"name":"CCS: Computer and Communications Security","location":"Virtual, United States","end_date":"2020-11-13","start_date":"2020-11-09"},"status":"public","publication_identifier":{"isbn":["978-1-4503-7089-9"]},"publication_status":"published","language":[{"iso":"eng"}],"abstract":[{"text":"In this paper, we present the first Asynchronous Distributed Key Generation (ADKG) algorithm which is also the first distributed key generation algorithm that can generate cryptographic keys with a dual (f,2f+1)-threshold (where f is the number of faulty parties). As a result, using our ADKG we remove the trusted setup assumption that the most scalable consensus algorithms make. In order to create a DKG with a dual (f,2f+1)- threshold we first answer in the affirmative the open question posed by Cachin et al. [7] on how to create an Asynchronous Verifiable Secret Sharing (AVSS) protocol with a reconstruction threshold of f+12020 IEEE Real-Time Systems Symposium, 244–56. IEEE, 2020. https://doi.org/10.1109/RTSS49844.2020.00031.","ista":"Garcia Soto M, Prabhakar P. 2020. Hybridization for stability verification of nonlinear switched systems. 2020 IEEE Real-Time Systems Symposium. RTTS: Real-Time Systems Symposium, 244–256.","mla":"Garcia Soto, Miriam, and Pavithra Prabhakar. “Hybridization for Stability Verification of Nonlinear Switched Systems.” 2020 IEEE Real-Time Systems Symposium, IEEE, 2020, pp. 244–56, doi:10.1109/RTSS49844.2020.00031.","ieee":"M. Garcia Soto and P. Prabhakar, “Hybridization for stability verification of nonlinear switched systems,” in 2020 IEEE Real-Time Systems Symposium, Houston, TX, USA , 2020, pp. 244–256.","short":"M. Garcia Soto, P. Prabhakar, in:, 2020 IEEE Real-Time Systems Symposium, IEEE, 2020, pp. 244–256.","apa":"Garcia Soto, M., & Prabhakar, P. (2020). Hybridization for stability verification of nonlinear switched systems. In 2020 IEEE Real-Time Systems Symposium (pp. 244–256). Houston, TX, USA : IEEE. https://doi.org/10.1109/RTSS49844.2020.00031","ama":"Garcia Soto M, Prabhakar P. Hybridization for stability verification of nonlinear switched systems. In: 2020 IEEE Real-Time Systems Symposium. IEEE; 2020:244-256. doi:10.1109/RTSS49844.2020.00031"},"title":"Hybridization for stability verification of nonlinear switched systems","author":[{"last_name":"Garcia Soto","orcid":"0000-0003-2936-5719","full_name":"Garcia Soto, Miriam","id":"4B3207F6-F248-11E8-B48F-1D18A9856A87","first_name":"Miriam"},{"last_name":"Prabhakar","full_name":"Prabhakar, Pavithra","first_name":"Pavithra"}],"article_processing_charge":"No","external_id":{"isi":["000680435100021"]},"acknowledgement":"Miriam Garc´ıa Soto was partially supported by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Pavithra Prabhakar was partially supported by NSF CAREER Award No. 1552668, NSF Award No. 2008957 and ONR YIP Award No. N000141712577.","quality_controlled":"1","publisher":"IEEE","oa":1,"day":"01","publication":"2020 IEEE Real-Time Systems Symposium","isi":1,"has_accepted_license":"1","year":"2020","doi":"10.1109/RTSS49844.2020.00031","date_published":"2020-12-01T00:00:00Z","date_created":"2021-02-26T16:38:24Z","page":"244-256"},{"acknowledgement":"We would like to thank P. T. Nam and R. Seiringer for several useful discussions and\r\nfor suggesting us to use the localization techniques from [9]. C. Boccato has received funding from the\r\nEuropean Research Council (ERC) under the programme Horizon 2020 (Grant Agreement 694227). B. Schlein gratefully acknowledges support from the NCCR SwissMAP and from the Swiss National Foundation of Science (Grant No. 200020_1726230) through the SNF Grant “Dynamical and energetic properties of Bose–Einstein condensates”.","publisher":"Springer","quality_controlled":"1","oa":1,"day":"01","publication":"Communications in Mathematical Physics","isi":1,"year":"2020","doi":"10.1007/s00220-019-03555-9","date_published":"2020-06-01T00:00:00Z","date_created":"2019-09-24T17:30:59Z","page":"1311-1395","project":[{"call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227","name":"Analysis of quantum many-body systems"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"C. Boccato, C. Brennecke, S. Cenatiempo, and B. Schlein, “Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime,” Communications in Mathematical Physics, vol. 376. Springer, pp. 1311–1395, 2020.","short":"C. Boccato, C. Brennecke, S. Cenatiempo, B. Schlein, Communications in Mathematical Physics 376 (2020) 1311–1395.","apa":"Boccato, C., Brennecke, C., Cenatiempo, S., & Schlein, B. (2020). Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-019-03555-9","ama":"Boccato C, Brennecke C, Cenatiempo S, Schlein B. Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime. Communications in Mathematical Physics. 2020;376:1311-1395. doi:10.1007/s00220-019-03555-9","mla":"Boccato, Chiara, et al. “Optimal Rate for Bose-Einstein Condensation in the Gross-Pitaevskii Regime.” Communications in Mathematical Physics, vol. 376, Springer, 2020, pp. 1311–95, doi:10.1007/s00220-019-03555-9.","ista":"Boccato C, Brennecke C, Cenatiempo S, Schlein B. 2020. Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime. Communications in Mathematical Physics. 376, 1311–1395.","chicago":"Boccato, Chiara, Christian Brennecke, Serena Cenatiempo, and Benjamin Schlein. “Optimal Rate for Bose-Einstein Condensation in the Gross-Pitaevskii Regime.” Communications in Mathematical Physics. Springer, 2020. https://doi.org/10.1007/s00220-019-03555-9."},"title":"Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime","author":[{"full_name":"Boccato, Chiara","last_name":"Boccato","first_name":"Chiara","id":"342E7E22-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Christian","last_name":"Brennecke","full_name":"Brennecke, Christian"},{"first_name":"Serena","last_name":"Cenatiempo","full_name":"Cenatiempo, Serena"},{"first_name":"Benjamin","last_name":"Schlein","full_name":"Schlein, Benjamin"}],"external_id":{"isi":["000536053300012"],"arxiv":["1812.03086"]},"article_processing_charge":"No","oa_version":"Preprint","abstract":[{"text":"We consider systems of bosons trapped in a box, in the Gross–Pitaevskii regime. We show that low-energy states exhibit complete Bose–Einstein condensation with an optimal bound on the number of orthogonal excitations. This extends recent results obtained in Boccato et al. (Commun Math Phys 359(3):975–1026, 2018), removing the assumption of small interaction potential.","lang":"eng"}],"month":"06","intvolume":" 376","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1812.03086","open_access":"1"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0010-3616"],"eissn":["1432-0916"]},"publication_status":"published","volume":376,"ec_funded":1,"_id":"6906","status":"public","type":"journal_article","article_type":"original","date_updated":"2024-02-22T13:33:02Z","department":[{"_id":"RoSe"}]},{"status":"public","type":"book_chapter","series_title":"Current Topics in Developmental Biology","_id":"7410","department":[{"_id":"CaHe"}],"date_updated":"2024-02-22T13:23:09Z","month":"01","intvolume":" 136","scopus_import":"1","oa_version":"None","abstract":[{"text":"Epiboly is a conserved gastrulation movement describing the thinning and spreading of a sheet or multi-layer of cells. The zebrafish embryo has emerged as a vital model system to address the cellular and molecular mechanisms that drive epiboly. In the zebrafish embryo, the blastoderm, consisting of a simple squamous epithelium (the enveloping layer) and an underlying mass of deep cells, as well as a yolk nuclear syncytium (the yolk syncytial layer) undergo epiboly to internalize the yolk cell during gastrulation. The major events during zebrafish epiboly are: expansion of the enveloping layer and the internal yolk syncytial layer, reduction and removal of the yolk membrane ahead of the advancing blastoderm margin and deep cell rearrangements between the enveloping layer and yolk syncytial layer to thin the blastoderm. Here, work addressing the cellular and molecular mechanisms as well as the sources of the mechanical forces that underlie these events is reviewed. The contribution of recent findings to the current model of epiboly as well as open questions and future prospects are also discussed.","lang":"eng"}],"volume":136,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0070-2153"],"isbn":["9780128127988"]},"publication_status":"published","title":"Mechanisms of zebrafish epiboly: A current view","editor":[{"full_name":"Solnica-Krezel, Lilianna ","last_name":"Solnica-Krezel","first_name":"Lilianna "}],"author":[{"first_name":"Ashley E.E.","last_name":"Bruce","full_name":"Bruce, Ashley E.E."},{"orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg","first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"isi":["000611830600012"]},"article_processing_charge":"No","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Bruce, Ashley E.E., and Carl-Philipp J Heisenberg. “Mechanisms of Zebrafish Epiboly: A Current View.” In Gastrulation: From Embryonic Pattern to Form, edited by Lilianna Solnica-Krezel, 136:319–41. Current Topics in Developmental Biology. Elsevier, 2020. https://doi.org/10.1016/bs.ctdb.2019.07.001.","ista":"Bruce AEE, Heisenberg C-PJ. 2020.Mechanisms of zebrafish epiboly: A current view. In: Gastrulation: From Embryonic Pattern to Form. vol. 136, 319–341.","mla":"Bruce, Ashley E. E., and Carl-Philipp J. Heisenberg. “Mechanisms of Zebrafish Epiboly: A Current View.” Gastrulation: From Embryonic Pattern to Form, edited by Lilianna Solnica-Krezel, vol. 136, Elsevier, 2020, pp. 319–41, doi:10.1016/bs.ctdb.2019.07.001.","ama":"Bruce AEE, Heisenberg C-PJ. Mechanisms of zebrafish epiboly: A current view. In: Solnica-Krezel L, ed. Gastrulation: From Embryonic Pattern to Form. Vol 136. Current Topics in Developmental Biology. Elsevier; 2020:319-341. doi:10.1016/bs.ctdb.2019.07.001","apa":"Bruce, A. E. E., & Heisenberg, C.-P. J. (2020). Mechanisms of zebrafish epiboly: A current view. In L. Solnica-Krezel (Ed.), Gastrulation: From Embryonic Pattern to Form (Vol. 136, pp. 319–341). Elsevier. https://doi.org/10.1016/bs.ctdb.2019.07.001","short":"A.E.E. Bruce, C.-P.J. Heisenberg, in:, L. Solnica-Krezel (Ed.), Gastrulation: From Embryonic Pattern to Form, Elsevier, 2020, pp. 319–341.","ieee":"A. E. E. Bruce and C.-P. J. Heisenberg, “Mechanisms of zebrafish epiboly: A current view,” in Gastrulation: From Embryonic Pattern to Form, vol. 136, L. Solnica-Krezel, Ed. Elsevier, 2020, pp. 319–341."},"publisher":"Elsevier","quality_controlled":"1","doi":"10.1016/bs.ctdb.2019.07.001","date_published":"2020-01-01T00:00:00Z","date_created":"2020-01-30T09:24:06Z","page":"319-341","day":"01","publication":"Gastrulation: From Embryonic Pattern to Form","isi":1,"year":"2020"},{"ec_funded":1,"related_material":{"record":[{"id":"6482","status":"public","relation":"earlier_version"}],"link":[{"url":"https://doi.org/10.1007/s11263-019-01262-5","relation":"erratum"}]},"issue":"4","volume":128,"publication_status":"published","publication_identifier":{"eissn":["1573-1405"],"issn":["0920-5691"]},"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"155e63edf664dcacb3bdc1c2223e606f","file_id":"7110","file_size":1715072,"date_updated":"2020-07-14T12:47:45Z","creator":"dernst","file_name":"2019_IJCV_Sun.pdf","date_created":"2019-11-26T10:30:02Z"}],"scopus_import":"1","intvolume":" 128","month":"04","abstract":[{"lang":"eng","text":"We study the problem of automatically detecting if a given multi-class classifier operates outside of its specifications (out-of-specs), i.e. on input data from a different distribution than what it was trained for. This is an important problem to solve on the road towards creating reliable computer vision systems for real-world applications, because the quality of a classifier’s predictions cannot be guaranteed if it operates out-of-specs. Previously proposed methods for out-of-specs detection make decisions on the level of single inputs. This, however, is insufficient to achieve low false positive rate and high false negative rates at the same time. In this work, we describe a new procedure named KS(conf), based on statistical reasoning. Its main component is a classical Kolmogorov–Smirnov test that is applied to the set of predicted confidence values for batches of samples. Working with batches instead of single samples allows increasing the true positive rate without negatively affecting the false positive rate, thereby overcoming a crucial limitation of single sample tests. We show by extensive experiments using a variety of convolutional network architectures and datasets that KS(conf) reliably detects out-of-specs situations even under conditions where other tests fail. It furthermore has a number of properties that make it an excellent candidate for practical deployment: it is easy to implement, adds almost no overhead to the system, works with any classifier that outputs confidence scores, and requires no a priori knowledge about how the data distribution could change."}],"oa_version":"Published Version","file_date_updated":"2020-07-14T12:47:45Z","department":[{"_id":"ChLa"}],"date_updated":"2024-02-22T14:57:30Z","ddc":["004"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"original","type":"journal_article","status":"public","_id":"6944","page":"970-995","date_created":"2019-10-14T09:14:28Z","date_published":"2020-04-01T00:00:00Z","doi":"10.1007/s11263-019-01232-x","year":"2020","isi":1,"has_accepted_license":"1","publication":"International Journal of Computer Vision","day":"01","oa":1,"quality_controlled":"1","publisher":"Springer Nature","external_id":{"isi":["000494406800001"]},"article_processing_charge":"Yes (via OA deal)","author":[{"last_name":"Sun","full_name":"Sun, Rémy","first_name":"Rémy"},{"last_name":"Lampert","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"title":"KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications","citation":{"mla":"Sun, Rémy, and Christoph Lampert. “KS(Conf): A Light-Weight Test If a Multiclass Classifier Operates Outside of Its Specifications.” International Journal of Computer Vision, vol. 128, no. 4, Springer Nature, 2020, pp. 970–95, doi:10.1007/s11263-019-01232-x.","apa":"Sun, R., & Lampert, C. (2020). KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications. International Journal of Computer Vision. Springer Nature. https://doi.org/10.1007/s11263-019-01232-x","ama":"Sun R, Lampert C. KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications. International Journal of Computer Vision. 2020;128(4):970-995. doi:10.1007/s11263-019-01232-x","short":"R. Sun, C. Lampert, International Journal of Computer Vision 128 (2020) 970–995.","ieee":"R. Sun and C. Lampert, “KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications,” International Journal of Computer Vision, vol. 128, no. 4. Springer Nature, pp. 970–995, 2020.","chicago":"Sun, Rémy, and Christoph Lampert. “KS(Conf): A Light-Weight Test If a Multiclass Classifier Operates Outside of Its Specifications.” International Journal of Computer Vision. Springer Nature, 2020. https://doi.org/10.1007/s11263-019-01232-x.","ista":"Sun R, Lampert C. 2020. KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications. International Journal of Computer Vision. 128(4), 970–995."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding","_id":"2532554C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}]},{"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)"},"_id":"8324","file_date_updated":"2020-09-01T11:12:58Z","department":[{"_id":"KrCh"}],"ddc":["004"],"date_updated":"2024-02-22T15:16:45Z","month":"01","intvolume":" 4","scopus_import":"1","oa_version":"Published Version","abstract":[{"text":"The notion of program sensitivity (aka Lipschitz continuity) specifies that changes in the program input result in proportional changes to the program output. For probabilistic programs the notion is naturally extended to expected sensitivity. A previous approach develops a relational program logic framework for proving expected sensitivity of probabilistic while loops, where the number of iterations is fixed and bounded. In this work, we consider probabilistic while loops where the number of iterations is not fixed, but randomized and depends on the initial input values. We present a sound approach for proving expected sensitivity of such programs. Our sound approach is martingale-based and can be automated through existing martingale-synthesis algorithms. Furthermore, our approach is compositional for sequential composition of while loops under a mild side condition. We demonstrate the effectiveness of our approach on several classical examples from Gambler's Ruin, stochastic hybrid systems and stochastic gradient descent. We also present experimental results showing that our automated approach can handle various probabilistic programs in the literature.","lang":"eng"}],"related_material":{"link":[{"url":"https://doi.org/10.5281/zenodo.3533633","relation":"software"}]},"issue":"POPL","volume":4,"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"8328","checksum":"c6193d109ff4ecb17e7a6513d8eb34c0","file_size":564151,"date_updated":"2020-09-01T11:12:58Z","creator":"cziletti","file_name":"2019_ACM_POPL_Wang.pdf","date_created":"2020-09-01T11:12:58Z"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2475-1421"]},"publication_status":"published","project":[{"name":"Game Theory","grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"}],"article_number":"25","title":"Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time","author":[{"first_name":"Peixin","last_name":"Wang","full_name":"Wang, Peixin"},{"first_name":"Hongfei","last_name":"Fu","full_name":"Fu, Hongfei"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Deng, Yuxin","last_name":"Deng","first_name":"Yuxin"},{"last_name":"Xu","full_name":"Xu, Ming","first_name":"Ming"}],"article_processing_charge":"No","external_id":{"arxiv":["1902.04744"]},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Wang, P., Fu, H., Chatterjee, K., Deng, Y., & Xu, M. (2020). Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time. In Proceedings of the ACM on Programming Languages (Vol. 4). ACM. https://doi.org/10.1145/3371093","ama":"Wang P, Fu H, Chatterjee K, Deng Y, Xu M. Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time. In: Proceedings of the ACM on Programming Languages. Vol 4. ACM; 2020. doi:10.1145/3371093","short":"P. Wang, H. Fu, K. Chatterjee, Y. Deng, M. Xu, in:, Proceedings of the ACM on Programming Languages, ACM, 2020.","ieee":"P. Wang, H. Fu, K. Chatterjee, Y. Deng, and M. Xu, “Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time,” in Proceedings of the ACM on Programming Languages, 2020, vol. 4, no. POPL.","mla":"Wang, Peixin, et al. “Proving Expected Sensitivity of Probabilistic Programs with Randomized Variable-Dependent Termination Time.” Proceedings of the ACM on Programming Languages, vol. 4, no. POPL, 25, ACM, 2020, doi:10.1145/3371093.","ista":"Wang P, Fu H, Chatterjee K, Deng Y, Xu M. 2020. Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time. Proceedings of the ACM on Programming Languages. vol. 4, 25.","chicago":"Wang, Peixin, Hongfei Fu, Krishnendu Chatterjee, Yuxin Deng, and Ming Xu. “Proving Expected Sensitivity of Probabilistic Programs with Randomized Variable-Dependent Termination Time.” In Proceedings of the ACM on Programming Languages, Vol. 4. ACM, 2020. https://doi.org/10.1145/3371093."},"quality_controlled":"1","publisher":"ACM","oa":1,"acknowledgement":"We thank anonymous reviewers for helpful comments, especially for pointing to us a scenario of piecewise-linear approximation (Remark5). The research was partially supported by the National Natural Science Foundation of China (NSFC) under Grant No. 61802254, 61672229, 61832015,61772336,11871221 and Austrian Science Fund (FWF) NFN under Grant No. S11407-N23 (RiSE/SHiNE). We thank Prof. Yuxi Fu, director of the BASICS Lab at Shanghai Jiao Tong University, for his support.","date_published":"2020-01-01T00:00:00Z","doi":"10.1145/3371093","date_created":"2020-08-30T22:01:12Z","day":"01","publication":"Proceedings of the ACM on Programming Languages","has_accepted_license":"1","year":"2020"},{"article_processing_charge":"No","external_id":{"pmid":["31751995"],"isi":["000522856600004"]},"author":[{"first_name":"Juan Esteban","full_name":"Salazar, Juan Esteban","last_name":"Salazar"},{"first_name":"Daniel","full_name":"Severin, Daniel","last_name":"Severin"},{"last_name":"Vega Zuniga","full_name":"Vega Zuniga, Tomas A","id":"2E7C4E78-F248-11E8-B48F-1D18A9856A87","first_name":"Tomas A"},{"last_name":"Fernández-Aburto","full_name":"Fernández-Aburto, Pedro","first_name":"Pedro"},{"first_name":"Alfonso","last_name":"Deichler","full_name":"Deichler, Alfonso"},{"last_name":"Sallaberry A.","full_name":"Sallaberry A., Michel","first_name":"Michel"},{"full_name":"Mpodozis, Jorge","last_name":"Mpodozis","first_name":"Jorge"}],"title":"Anatomical specializations related to foraging in the visual system of a nocturnal insectivorous bird, the band-winged nightjar (Aves: Caprimulgiformes)","citation":{"ista":"Salazar JE, Severin D, Vega Zuniga TA, Fernández-Aburto P, Deichler A, Sallaberry A. M, Mpodozis J. 2020. Anatomical specializations related to foraging in the visual system of a nocturnal insectivorous bird, the band-winged nightjar (Aves: Caprimulgiformes). Brain, Behavior and Evolution. 94(1–4), 27–36.","chicago":"Salazar, Juan Esteban, Daniel Severin, Tomas A Vega Zuniga, Pedro Fernández-Aburto, Alfonso Deichler, Michel Sallaberry A., and Jorge Mpodozis. “Anatomical Specializations Related to Foraging in the Visual System of a Nocturnal Insectivorous Bird, the Band-Winged Nightjar (Aves: Caprimulgiformes).” Brain, Behavior and Evolution. Karger Publishers, 2020. https://doi.org/10.1159/000504162.","ieee":"J. E. Salazar et al., “Anatomical specializations related to foraging in the visual system of a nocturnal insectivorous bird, the band-winged nightjar (Aves: Caprimulgiformes),” Brain, Behavior and Evolution, vol. 94, no. 1–4. Karger Publishers, pp. 27–36, 2020.","short":"J.E. Salazar, D. Severin, T.A. Vega Zuniga, P. Fernández-Aburto, A. Deichler, M. Sallaberry A., J. Mpodozis, Brain, Behavior and Evolution 94 (2020) 27–36.","apa":"Salazar, J. E., Severin, D., Vega Zuniga, T. A., Fernández-Aburto, P., Deichler, A., Sallaberry A., M., & Mpodozis, J. (2020). Anatomical specializations related to foraging in the visual system of a nocturnal insectivorous bird, the band-winged nightjar (Aves: Caprimulgiformes). Brain, Behavior and Evolution. Karger Publishers. https://doi.org/10.1159/000504162","ama":"Salazar JE, Severin D, Vega Zuniga TA, et al. Anatomical specializations related to foraging in the visual system of a nocturnal insectivorous bird, the band-winged nightjar (Aves: Caprimulgiformes). Brain, Behavior and Evolution. 2020;94(1-4):27-36. doi:10.1159/000504162","mla":"Salazar, Juan Esteban, et al. “Anatomical Specializations Related to Foraging in the Visual System of a Nocturnal Insectivorous Bird, the Band-Winged Nightjar (Aves: Caprimulgiformes).” Brain, Behavior and Evolution, vol. 94, no. 1–4, Karger Publishers, 2020, pp. 27–36, doi:10.1159/000504162."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"Karger Publishers","quality_controlled":"1","page":"27-36","date_created":"2019-12-09T09:04:13Z","doi":"10.1159/000504162","date_published":"2020-01-01T00:00:00Z","year":"2020","isi":1,"publication":"Brain, Behavior and Evolution","day":"01","article_type":"original","type":"journal_article","status":"public","_id":"7160","department":[{"_id":"MaJö"}],"date_updated":"2024-02-22T15:18:34Z","scopus_import":"1","intvolume":" 94","month":"01","abstract":[{"text":"Nocturnal animals that rely on their visual system for foraging, mating, and navigation usually exhibit specific traits associated with living in scotopic conditions. Most nocturnal birds have several visual specializations, such as enlarged eyes and an increased orbital convergence. However, the actual role of binocular vision in nocturnal foraging is still debated. Nightjars (Aves: Caprimulgidae) are predators that actively pursue and capture flying insects in crepuscular and nocturnal environments, mainly using a conspicuous “sit-and-wait” tactic on which pursuit begins with an insect flying over the bird that sits on the ground. In this study, we describe the visual system of the band-winged nightjar (Systellura longirostris), with emphasis on anatomical features previously described as relevant for nocturnal birds. Orbit convergence, determined by 3D scanning of the skull, was 73.28°. The visual field, determined by ophthalmoscopic reflex, exhibits an area of maximum binocular overlap of 42°, and it is dorsally oriented. The eyes showed a nocturnal-like normalized corneal aperture/axial length index. Retinal ganglion cells (RGCs) were relatively scant, and distributed in an unusual oblique-band pattern, with higher concentrations in the ventrotemporal quadrant. Together, these results indicate that the band-winged nightjar exhibits a retinal specialization associated with the binocular area of their dorsal visual field, a relevant area for pursuit triggering and prey attacks. The RGC distribution observed is unusual among birds, but similar to that of some visually dependent insectivorous bats, suggesting that those features might be convergent in relation to feeding strategies.","lang":"eng"}],"pmid":1,"oa_version":"None","volume":94,"issue":"1-4","publication_status":"published","publication_identifier":{"issn":["0006-8977"],"eissn":["1421-9743"]},"language":[{"iso":"eng"}]},{"related_material":{"record":[{"status":"public","id":"149","relation":"dissertation_contains"},{"relation":"dissertation_contains","id":"6179","status":"public"}]},"volume":48,"issue":"2","ec_funded":1,"publication_identifier":{"issn":["0091-1798"]},"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1804.07744","open_access":"1"}],"month":"03","intvolume":" 48","abstract":[{"lang":"eng","text":"We prove edge universality for a general class of correlated real symmetric or complex Hermitian Wigner matrices with arbitrary expectation. Our theorem also applies to internal edges of the self-consistent density of states. In particular, we establish a strong form of band rigidity which excludes mismatches between location and label of eigenvalues close to internal edges in these general models."}],"oa_version":"Preprint","department":[{"_id":"LaEr"}],"date_updated":"2024-02-22T14:34:33Z","article_type":"original","type":"journal_article","status":"public","_id":"6184","page":"963-1001","date_published":"2020-03-01T00:00:00Z","doi":"10.1214/19-AOP1379","date_created":"2019-03-28T09:20:08Z","isi":1,"year":"2020","day":"01","publication":"Annals of Probability","publisher":"Institute of Mathematical Statistics","quality_controlled":"1","oa":1,"author":[{"id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes","last_name":"Alt","full_name":"Alt, Johannes"},{"first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","full_name":"Erdös, László","orcid":"0000-0001-5366-9603"},{"full_name":"Krüger, Torben H","orcid":"0000-0002-4821-3297","last_name":"Krüger","id":"3020C786-F248-11E8-B48F-1D18A9856A87","first_name":"Torben H"},{"full_name":"Schröder, Dominik J","orcid":"0000-0002-2904-1856","last_name":"Schröder","id":"408ED176-F248-11E8-B48F-1D18A9856A87","first_name":"Dominik J"}],"external_id":{"arxiv":["1804.07744"],"isi":["000528269100013"]},"article_processing_charge":"No","title":"Correlated random matrices: Band rigidity and edge universality","citation":{"ista":"Alt J, Erdös L, Krüger TH, Schröder DJ. 2020. Correlated random matrices: Band rigidity and edge universality. Annals of Probability. 48(2), 963–1001.","chicago":"Alt, Johannes, László Erdös, Torben H Krüger, and Dominik J Schröder. “Correlated Random Matrices: Band Rigidity and Edge Universality.” Annals of Probability. Institute of Mathematical Statistics, 2020. https://doi.org/10.1214/19-AOP1379.","ama":"Alt J, Erdös L, Krüger TH, Schröder DJ. Correlated random matrices: Band rigidity and edge universality. Annals of Probability. 2020;48(2):963-1001. doi:10.1214/19-AOP1379","apa":"Alt, J., Erdös, L., Krüger, T. H., & Schröder, D. J. (2020). Correlated random matrices: Band rigidity and edge universality. Annals of Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/19-AOP1379","ieee":"J. Alt, L. Erdös, T. H. Krüger, and D. J. Schröder, “Correlated random matrices: Band rigidity and edge universality,” Annals of Probability, vol. 48, no. 2. Institute of Mathematical Statistics, pp. 963–1001, 2020.","short":"J. Alt, L. Erdös, T.H. Krüger, D.J. Schröder, Annals of Probability 48 (2020) 963–1001.","mla":"Alt, Johannes, et al. “Correlated Random Matrices: Band Rigidity and Edge Universality.” Annals of Probability, vol. 48, no. 2, Institute of Mathematical Statistics, 2020, pp. 963–1001, doi:10.1214/19-AOP1379."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems","grant_number":"338804"}]},{"intvolume":" 13","month":"05","pmid":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Protein abundance and localization at the plasma membrane (PM) shapes plant development and mediates adaptation to changing environmental conditions. It is regulated by ubiquitination, a post-translational modification crucial for the proper sorting of endocytosed PM proteins to the vacuole for subsequent degradation. To understand the significance and the variety of roles played by this reversible modification, the function of ubiquitin receptors, which translate the ubiquitin signature into a cellular response, needs to be elucidated. In this study, we show that TOL (TOM1-like) proteins function in plants as multivalent ubiquitin receptors, governing ubiquitinated cargo delivery to the vacuole via the conserved Endosomal Sorting Complex Required for Transport (ESCRT) pathway. TOL2 and TOL6 interact with components of the ESCRT machinery and bind to K63-linked ubiquitin via two tandemly arranged conserved ubiquitin-binding domains. Mutation of these domains results not only in a loss of ubiquitin binding but also altered localization, abolishing TOL6 ubiquitin receptor activity. Function and localization of TOL6 is itself regulated by ubiquitination, whereby TOL6 ubiquitination potentially modulates degradation of PM-localized cargoes, assisting in the fine-tuning of the delicate interplay between protein recycling and downregulation. Taken together, our findings demonstrate the function and regulation of a ubiquitin receptor that mediates vacuolar degradation of PM proteins in higher plants."}],"volume":13,"issue":"5","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"15038","checksum":"c538a5008f7827f62d17d40a3bfabe65","file_size":3089212,"date_updated":"2024-02-28T12:39:56Z","creator":"dernst","file_name":"2020_MolecularPlant_MoulinierAnzola.pdf","date_created":"2024-02-28T12:39:56Z"}],"publication_status":"published","publication_identifier":{"issn":["1674-2052"]},"keyword":["Plant Science","Molecular Biology"],"status":"public","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","_id":"15037","file_date_updated":"2024-02-28T12:39:56Z","department":[{"_id":"EvBe"}],"ddc":["580"],"date_updated":"2024-02-28T12:41:52Z","oa":1,"publisher":"Elsevier","quality_controlled":"1","date_created":"2024-02-28T08:55:56Z","doi":"10.1016/j.molp.2020.02.012","date_published":"2020-05-04T00:00:00Z","page":"717-731","publication":"Molecular Plant","day":"04","year":"2020","has_accepted_license":"1","title":"TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants","article_processing_charge":"No","external_id":{"pmid":["32087370"]},"author":[{"first_name":"Jeanette","full_name":"Moulinier-Anzola, Jeanette","last_name":"Moulinier-Anzola"},{"last_name":"Schwihla","full_name":"Schwihla, Maximilian","first_name":"Maximilian"},{"full_name":"De-Araújo, Lucinda","last_name":"De-Araújo","first_name":"Lucinda"},{"full_name":"Artner, Christina","last_name":"Artner","id":"45DF286A-F248-11E8-B48F-1D18A9856A87","first_name":"Christina"},{"first_name":"Lisa","full_name":"Jörg, Lisa","last_name":"Jörg"},{"first_name":"Nataliia","last_name":"Konstantinova","full_name":"Konstantinova, Nataliia"},{"last_name":"Luschnig","full_name":"Luschnig, Christian","first_name":"Christian"},{"first_name":"Barbara","last_name":"Korbei","full_name":"Korbei, Barbara"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Moulinier-Anzola J, Schwihla M, De-Araújo L, Artner C, Jörg L, Konstantinova N, Luschnig C, Korbei B. 2020. TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants. Molecular Plant. 13(5), 717–731.","chicago":"Moulinier-Anzola, Jeanette, Maximilian Schwihla, Lucinda De-Araújo, Christina Artner, Lisa Jörg, Nataliia Konstantinova, Christian Luschnig, and Barbara Korbei. “TOLs Function as Ubiquitin Receptors in the Early Steps of the ESCRT Pathway in Higher Plants.” Molecular Plant. Elsevier, 2020. https://doi.org/10.1016/j.molp.2020.02.012.","short":"J. Moulinier-Anzola, M. Schwihla, L. De-Araújo, C. Artner, L. Jörg, N. Konstantinova, C. Luschnig, B. Korbei, Molecular Plant 13 (2020) 717–731.","ieee":"J. Moulinier-Anzola et al., “TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants,” Molecular Plant, vol. 13, no. 5. Elsevier, pp. 717–731, 2020.","apa":"Moulinier-Anzola, J., Schwihla, M., De-Araújo, L., Artner, C., Jörg, L., Konstantinova, N., … Korbei, B. (2020). TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants. Molecular Plant. Elsevier. https://doi.org/10.1016/j.molp.2020.02.012","ama":"Moulinier-Anzola J, Schwihla M, De-Araújo L, et al. TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants. Molecular Plant. 2020;13(5):717-731. doi:10.1016/j.molp.2020.02.012","mla":"Moulinier-Anzola, Jeanette, et al. “TOLs Function as Ubiquitin Receptors in the Early Steps of the ESCRT Pathway in Higher Plants.” Molecular Plant, vol. 13, no. 5, Elsevier, 2020, pp. 717–31, doi:10.1016/j.molp.2020.02.012."}},{"date_updated":"2024-02-28T12:37:54Z","department":[{"_id":"MaLo"}],"_id":"15036","status":"public","keyword":["Molecular Biology","Structural Biology"],"type":"journal_article","article_type":"original","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0022-2836"]},"publication_status":"published","volume":432,"issue":"21","oa_version":"Published Version","pmid":1,"abstract":[{"lang":"eng","text":"The assembly of a septin filament requires that homologous monomers must distinguish between one another in establishing appropriate interfaces with their neighbors. To understand this phenomenon at the molecular level, we present the first four crystal structures of heterodimeric septin complexes. We describe in detail the two distinct types of G-interface present within the octameric particles, which must polymerize to form filaments. These are formed between SEPT2 and SEPT6 and between SEPT7 and SEPT3, and their description permits an understanding of the structural basis for the selectivity necessary for correct filament assembly. By replacing SEPT6 by SEPT8 or SEPT11, it is possible to rationalize Kinoshita's postulate, which predicts the exchangeability of septins from within a subgroup. Switches I and II, which in classical small GTPases provide a mechanism for nucleotide-dependent conformational change, have been repurposed in septins to play a fundamental role in molecular recognition. Specifically, it is switch I which holds the key to discriminating between the two different G-interfaces. Moreover, residues which are characteristic for a given subgroup play subtle, but pivotal, roles in guaranteeing that the correct interfaces are formed."}],"month":"10","intvolume":" 432","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.jmb.2020.09.001"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Rosa, H. V. D., Leonardo, D. A., Brognara, G., Brandão-Neto, J., D’Muniz Pereira, H., Araújo, A. P. U., & Garratt, R. C. (2020). Molecular recognition at septin interfaces: The switches hold the key. Journal of Molecular Biology. Elsevier. https://doi.org/10.1016/j.jmb.2020.09.001","ama":"Rosa HVD, Leonardo DA, Brognara G, et al. Molecular recognition at septin interfaces: The switches hold the key. Journal of Molecular Biology. 2020;432(21):5784-5801. doi:10.1016/j.jmb.2020.09.001","ieee":"H. V. D. Rosa et al., “Molecular recognition at septin interfaces: The switches hold the key,” Journal of Molecular Biology, vol. 432, no. 21. Elsevier, pp. 5784–5801, 2020.","short":"H.V.D. Rosa, D.A. Leonardo, G. Brognara, J. Brandão-Neto, H. D’Muniz Pereira, A.P.U. Araújo, R.C. Garratt, Journal of Molecular Biology 432 (2020) 5784–5801.","mla":"Rosa, Higor Vinícius Dias, et al. “Molecular Recognition at Septin Interfaces: The Switches Hold the Key.” Journal of Molecular Biology, vol. 432, no. 21, Elsevier, 2020, pp. 5784–801, doi:10.1016/j.jmb.2020.09.001.","ista":"Rosa HVD, Leonardo DA, Brognara G, Brandão-Neto J, D’Muniz Pereira H, Araújo APU, Garratt RC. 2020. Molecular recognition at septin interfaces: The switches hold the key. Journal of Molecular Biology. 432(21), 5784–5801.","chicago":"Rosa, Higor Vinícius Dias, Diego Antonio Leonardo, Gabriel Brognara, José Brandão-Neto, Humberto D’Muniz Pereira, Ana Paula Ulian Araújo, and Richard Charles Garratt. “Molecular Recognition at Septin Interfaces: The Switches Hold the Key.” Journal of Molecular Biology. Elsevier, 2020. https://doi.org/10.1016/j.jmb.2020.09.001."},"title":"Molecular recognition at septin interfaces: The switches hold the key","author":[{"full_name":"Rosa, Higor Vinícius Dias","last_name":"Rosa","first_name":"Higor Vinícius Dias"},{"full_name":"Leonardo, Diego Antonio","last_name":"Leonardo","first_name":"Diego Antonio"},{"full_name":"Brognara, Gabriel","last_name":"Brognara","first_name":"Gabriel","id":"D96FFDA0-A884-11E9-9968-DC26E6697425"},{"first_name":"José","full_name":"Brandão-Neto, José","last_name":"Brandão-Neto"},{"first_name":"Humberto","last_name":"D'Muniz Pereira","full_name":"D'Muniz Pereira, Humberto"},{"full_name":"Araújo, Ana Paula Ulian","last_name":"Araújo","first_name":"Ana Paula Ulian"},{"first_name":"Richard Charles","full_name":"Garratt, Richard Charles","last_name":"Garratt"}],"article_processing_charge":"No","external_id":{"pmid":["32910969"]},"day":"02","publication":"Journal of Molecular Biology","year":"2020","doi":"10.1016/j.jmb.2020.09.001","date_published":"2020-10-02T00:00:00Z","date_created":"2024-02-28T08:50:34Z","page":"5784-5801","publisher":"Elsevier","quality_controlled":"1","oa":1},{"language":[{"iso":"eng"}],"file":[{"file_name":"2020_soapfilm_submitted.pdf","date_created":"2020-11-23T09:03:19Z","file_size":14935529,"date_updated":"2020-11-23T09:03:19Z","creator":"dernst","success":1,"file_id":"8795","checksum":"813831ca91319d794d9748c276b24578","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"publication_status":"published","publication_identifier":{"issn":["07300301"],"eissn":["15577368"]},"ec_funded":1,"issue":"4","volume":39,"oa_version":"Submitted Version","acknowledged_ssus":[{"_id":"ScienComp"}],"abstract":[{"lang":"eng","text":"Previous research on animations of soap bubbles, films, and foams largely focuses on the motion and geometric shape of the bubble surface. These works neglect the evolution of the bubble’s thickness, which is normally responsible for visual phenomena like surface vortices, Newton’s interference patterns, capillary waves, and deformation-dependent rupturing of films in a foam. In this paper, we model these natural phenomena by introducing the film thickness as a reduced degree of freedom in the Navier-Stokes equations and deriving their equations of motion. We discretize the equations on a nonmanifold triangle mesh surface and couple it to an existing bubble solver. In doing so, we also introduce an incompressible fluid solver for 2.5D films and a novel advection algorithm for convecting fields across non-manifold surface junctions. Our simulations enhance state-of-the-art bubble solvers with additional effects caused by convection, rippling, draining, and evaporation of the thin film."}],"intvolume":" 39","month":"07","main_file_link":[{"url":"https://doi.org/10.1145/3386569.3392405","open_access":"1"}],"scopus_import":"1","ddc":["000"],"date_updated":"2024-02-28T12:57:31Z","file_date_updated":"2020-11-23T09:03:19Z","department":[{"_id":"ChWo"}],"_id":"8384","status":"public","type":"journal_article","article_type":"original","publication":"ACM Transactions on Graphics","day":"08","year":"2020","has_accepted_license":"1","isi":1,"date_created":"2020-09-13T22:01:18Z","doi":"10.1145/3386569.3392405","date_published":"2020-07-08T00:00:00Z","acknowledgement":"We wish to thank the anonymous reviewers and the members of the Visual Computing Group at IST Austria for their valuable feedback, especially Camille Schreck for her help in rendering. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing. We would like to thank the authors of [Belcour and Barla 2017] for providing their implementation, the authors of [Atkins and Elliott 2010] and [Seychelles et al. 2008] for allowing us to use their results, and Rok Grah for helpful discussions. Finally, we thank Ryoichi Ando for many discussions from the beginning of the project that resulted in important contents of the paper including our formulation, numerical scheme, and initial implementation. This project has received funding from the\r\nEuropean Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No. 638176.","oa":1,"quality_controlled":"1","publisher":"Association for Computing Machinery","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Ishida, Sadashige, Peter Synak, Fumiya Narita, Toshiya Hachisuka, and Chris Wojtan. “A Model for Soap Film Dynamics with Evolving Thickness.” ACM Transactions on Graphics. Association for Computing Machinery, 2020. https://doi.org/10.1145/3386569.3392405.","ista":"Ishida S, Synak P, Narita F, Hachisuka T, Wojtan C. 2020. A model for soap film dynamics with evolving thickness. ACM Transactions on Graphics. 39(4), 31.","mla":"Ishida, Sadashige, et al. “A Model for Soap Film Dynamics with Evolving Thickness.” ACM Transactions on Graphics, vol. 39, no. 4, 31, Association for Computing Machinery, 2020, doi:10.1145/3386569.3392405.","ama":"Ishida S, Synak P, Narita F, Hachisuka T, Wojtan C. A model for soap film dynamics with evolving thickness. ACM Transactions on Graphics. 2020;39(4). doi:10.1145/3386569.3392405","apa":"Ishida, S., Synak, P., Narita, F., Hachisuka, T., & Wojtan, C. (2020). A model for soap film dynamics with evolving thickness. ACM Transactions on Graphics. Association for Computing Machinery. https://doi.org/10.1145/3386569.3392405","short":"S. Ishida, P. Synak, F. Narita, T. Hachisuka, C. Wojtan, ACM Transactions on Graphics 39 (2020).","ieee":"S. Ishida, P. Synak, F. Narita, T. Hachisuka, and C. Wojtan, “A model for soap film dynamics with evolving thickness,” ACM Transactions on Graphics, vol. 39, no. 4. Association for Computing Machinery, 2020."},"title":"A model for soap film dynamics with evolving thickness","article_processing_charge":"No","external_id":{"isi":["000583700300004"]},"author":[{"last_name":"Ishida","full_name":"Ishida, Sadashige","id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425","first_name":"Sadashige"},{"id":"331776E2-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","last_name":"Synak","full_name":"Synak, Peter"},{"first_name":"Fumiya","full_name":"Narita, Fumiya","last_name":"Narita"},{"last_name":"Hachisuka","full_name":"Hachisuka, Toshiya","first_name":"Toshiya"},{"full_name":"Wojtan, Christopher J","orcid":"0000-0001-6646-5546","last_name":"Wojtan","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J"}],"article_number":"31","project":[{"call_identifier":"H2020","_id":"2533E772-B435-11E9-9278-68D0E5697425","grant_number":"638176","name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales"}]},{"month":"07","main_file_link":[{"url":"https://arxiv.org/abs/1912.05390","open_access":"1"}],"scopus_import":"1","oa_version":"Preprint","abstract":[{"text":"The Massively Parallel Computation (MPC) model is an emerging model which distills core aspects of distributed and parallel computation. It has been developed as a tool to solve (typically graph) problems in systems where the input is distributed over many machines with limited space.\r\n\t\r\nRecent work has focused on the regime in which machines have sublinear (in $n$, the number of nodes in the input graph) space, with randomized algorithms presented for fundamental graph problems of Maximal Matching and Maximal Independent Set. However, there have been no prior corresponding deterministic algorithms.\r\n\t\r\n\tA major challenge underlying the sublinear space setting is that the local space of each machine might be too small to store all the edges incident to a single node. This poses a considerable obstacle compared to the classical models in which each node is assumed to know and have easy access to its incident edges. To overcome this barrier we introduce a new graph sparsification technique that deterministically computes a low-degree subgraph with additional desired properties. The degree of the nodes in this subgraph is small in the sense that the edges of each node can be now stored on a single machine. This low-degree subgraph also has the property that solving the problem on this subgraph provides \\emph{significant} global progress, i.e., progress towards solving the problem for the original input graph.\r\n\t\r\nUsing this framework to derandomize the well-known randomized algorithm of Luby [SICOMP'86], we obtain $O(\\log \\Delta+\\log\\log n)$-round deterministic MPC algorithms for solving the fundamental problems of Maximal Matching and Maximal Independent Set with $O(n^{\\epsilon})$ space on each machine for any constant $\\epsilon > 0$. Based on the recent work of Ghaffari et al. [FOCS'18], this additive $O(\\log\\log n)$ factor is conditionally essential. These algorithms can also be shown to run in $O(\\log \\Delta)$ rounds in the closely related model of CONGESTED CLIQUE, improving upon the state-of-the-art bound of $O(\\log^2 \\Delta)$ rounds by Censor-Hillel et al. [DISC'17].","lang":"eng"}],"ec_funded":1,"related_material":{"record":[{"relation":"later_version","status":"public","id":"9541"}]},"issue":"7","language":[{"iso":"eng"}],"publication_status":"published","status":"public","conference":{"name":"SPAA: Symposium on Parallelism in Algorithms and Architectures","end_date":"2020-07-17","location":"Virtual Event, United States","start_date":"2020-07-15"},"type":"conference","_id":"7802","department":[{"_id":"DaAl"}],"date_updated":"2024-02-28T12:53:09Z","oa":1,"quality_controlled":"1","publisher":"Association for Computing Machinery","date_created":"2020-05-06T08:53:34Z","doi":"10.1145/3350755.3400282","date_published":"2020-07-01T00:00:00Z","page":"175-185","publication":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020)","day":"01","year":"2020","isi":1,"project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"title":"Graph sparsification for derandomizing massively parallel computation with low space","external_id":{"isi":["000744436200015"],"arxiv":["1912.05390"]},"article_processing_charge":"No","author":[{"full_name":"Czumaj, Artur","orcid":"0000-0002-5646-9524","last_name":"Czumaj","first_name":"Artur"},{"id":"11396234-BB50-11E9-B24C-90FCE5697425","first_name":"Peter","full_name":"Davies, Peter","orcid":"0000-0002-5646-9524","last_name":"Davies"},{"last_name":"Parter","full_name":"Parter, Merav","first_name":"Merav"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"mla":"Czumaj, Artur, et al. “Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space.” Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020), no. 7, Association for Computing Machinery, 2020, pp. 175–85, doi:10.1145/3350755.3400282.","short":"A. Czumaj, P. Davies, M. Parter, in:, Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020), Association for Computing Machinery, 2020, pp. 175–185.","ieee":"A. Czumaj, P. Davies, and M. Parter, “Graph sparsification for derandomizing massively parallel computation with low space,” in Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020), Virtual Event, United States, 2020, no. 7, pp. 175–185.","ama":"Czumaj A, Davies P, Parter M. Graph sparsification for derandomizing massively parallel computation with low space. In: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020). Association for Computing Machinery; 2020:175-185. doi:10.1145/3350755.3400282","apa":"Czumaj, A., Davies, P., & Parter, M. (2020). Graph sparsification for derandomizing massively parallel computation with low space. In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020) (pp. 175–185). Virtual Event, United States: Association for Computing Machinery. https://doi.org/10.1145/3350755.3400282","chicago":"Czumaj, Artur, Peter Davies, and Merav Parter. “Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space.” In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020), 175–85. Association for Computing Machinery, 2020. https://doi.org/10.1145/3350755.3400282.","ista":"Czumaj A, Davies P, Parter M. 2020. Graph sparsification for derandomizing massively parallel computation with low space. Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020). SPAA: Symposium on Parallelism in Algorithms and Architectures, 175–185."}},{"main_file_link":[{"url":"https://doi.org/10.1145/3332466.3374542","open_access":"1"}],"scopus_import":"1","month":"02","abstract":[{"lang":"eng","text":"Balanced search trees typically use key comparisons to guide their operations, and achieve logarithmic running time. By relying on numerical properties of the keys, interpolation search achieves lower search complexity and better performance. Although interpolation-based data structures were investigated in the past, their non-blocking concurrent variants have received very little attention so far.\r\nIn this paper, we propose the first non-blocking implementation of the classic interpolation search tree (IST) data structure. For arbitrary key distributions, the data structure ensures worst-case O(log n + p) amortized time for search, insertion and deletion traversals. When the input key distributions are smooth, lookups run in expected O(log log n + p) time, and insertion and deletion run in expected amortized O(log log n + p) time, where p is a bound on the number of threads. To improve the scalability of concurrent insertion and deletion, we propose a novel parallel rebuilding technique, which should be of independent interest.\r\nWe evaluate whether the theoretical improvements translate to practice by implementing the concurrent interpolation search tree, and benchmarking it on uniform and nonuniform key distributions, for dataset sizes in the millions to billions of keys. Relative to the state-of-the-art concurrent data structures, the concurrent interpolation search tree achieves performance improvements of up to 15% under high update rates, and of up to 50% under moderate update rates. Further, ISTs exhibit up to 2X less cache-misses, and consume 1.2 -- 2.6X less memory compared to the next best alternative on typical dataset sizes. We find that the results are surprisingly robust to distributional skew, which suggests that our data structure can be a promising alternative to classic concurrent search structures."}],"oa_version":"Published Version","ec_funded":1,"publication_status":"published","publication_identifier":{"isbn":["9781450368186"]},"language":[{"iso":"eng"}],"conference":{"name":"PPOPP: Principles and Practice of Parallel Programming","start_date":"2020-02-22","end_date":"2020-02-26","location":"San Diego, CA, United States"},"type":"conference","status":"public","_id":"7636","department":[{"_id":"DaAl"}],"date_updated":"2024-02-28T12:55:14Z","oa":1,"quality_controlled":"1","publisher":"Association for Computing Machinery","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union Horizon 2020 research and innovation program, grant agreement No 805223, ERC Starting Grant ScaleML. We acknowledge the support of the Natural Sciences and\r\nEngineering Research Council of Canada (NSERC). ","page":"276-291","date_created":"2020-04-05T22:00:49Z","date_published":"2020-02-19T00:00:00Z","doi":"10.1145/3332466.3374542","year":"2020","isi":1,"publication":"Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","day":"19","project":[{"name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"external_id":{"isi":["000564476500020"]},"article_processing_charge":"No","author":[{"full_name":"Brown, Trevor A","last_name":"Brown","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","first_name":"Trevor A"},{"full_name":"Prokopec, Aleksandar","last_name":"Prokopec","first_name":"Aleksandar"},{"last_name":"Alistarh","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"title":"Non-blocking interpolation search trees with doubly-logarithmic running time","citation":{"ista":"Brown TA, Prokopec A, Alistarh D-A. 2020. Non-blocking interpolation search trees with doubly-logarithmic running time. Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. PPOPP: Principles and Practice of Parallel Programming, 276–291.","chicago":"Brown, Trevor A, Aleksandar Prokopec, and Dan-Adrian Alistarh. “Non-Blocking Interpolation Search Trees with Doubly-Logarithmic Running Time.” In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 276–91. Association for Computing Machinery, 2020. https://doi.org/10.1145/3332466.3374542.","ieee":"T. A. Brown, A. Prokopec, and D.-A. Alistarh, “Non-blocking interpolation search trees with doubly-logarithmic running time,” in Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, San Diego, CA, United States, 2020, pp. 276–291.","short":"T.A. Brown, A. Prokopec, D.-A. Alistarh, in:, Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2020, pp. 276–291.","ama":"Brown TA, Prokopec A, Alistarh D-A. Non-blocking interpolation search trees with doubly-logarithmic running time. In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. Association for Computing Machinery; 2020:276-291. doi:10.1145/3332466.3374542","apa":"Brown, T. A., Prokopec, A., & Alistarh, D.-A. (2020). Non-blocking interpolation search trees with doubly-logarithmic running time. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (pp. 276–291). San Diego, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3332466.3374542","mla":"Brown, Trevor A., et al. “Non-Blocking Interpolation Search Trees with Doubly-Logarithmic Running Time.” Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2020, pp. 276–91, doi:10.1145/3332466.3374542."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"date_created":"2020-08-02T22:00:58Z","issue":"7","doi":"10.1145/3350755.3400213","date_published":"2020-07-06T00:00:00Z","page":"37-49","language":[{"iso":"eng"}],"publication":"Annual ACM Symposium on Parallelism in Algorithms and Architectures","day":"06","publication_status":"published","year":"2020","publication_identifier":{"isbn":["9781450369350"]},"isi":1,"month":"07","scopus_import":"1","publisher":"Association for Computing Machinery","quality_controlled":"1","oa_version":"None","abstract":[{"text":"There has been a significant amount of research on hardware and software support for efficient concurrent data structures; yet, the question of how to build correct, simple, and scalable data structures has not yet been definitively settled. In this paper, we revisit this question from a minimalist perspective, and ask: what is the smallest amount of synchronization required for correct and efficient concurrent search data structures, and how could this minimal synchronization support be provided in hardware?\r\n\r\nTo address these questions, we introduce memory tagging, a simple hardware mechanism which enables the programmer to \"tag\" a dynamic set of memory locations, at cache-line granularity, and later validate whether the memory has been concurrently modified, with the possibility of updating one of the underlying locations atomically if validation succeeds. We provide several examples showing that this mechanism can enable fast and arguably simple concurrent data structure designs, such as lists, binary search trees, balanced search trees, range queries, and Software Transactional Memory (STM) implementations. We provide an implementation of memory tags in the Graphite multi-core simulator, showing that the mechanism can be implemented entirely at the level of L1 cache, and that it can enable non-trivial speedups versus existing implementations of the above data structures.","lang":"eng"}],"title":"Memory tagging: Minimalist synchronization for scalable concurrent data structures","department":[{"_id":"DaAl"}],"article_processing_charge":"No","external_id":{"isi":["000744436200004"]},"author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"},{"first_name":"Trevor A","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","last_name":"Brown","full_name":"Brown, Trevor A"},{"first_name":"Nandini","last_name":"Singhal","full_name":"Singhal, Nandini"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-02-28T12:56:32Z","citation":{"chicago":"Alistarh, Dan-Adrian, Trevor A Brown, and Nandini Singhal. “Memory Tagging: Minimalist Synchronization for Scalable Concurrent Data Structures.” In Annual ACM Symposium on Parallelism in Algorithms and Architectures, 37–49. Association for Computing Machinery, 2020. https://doi.org/10.1145/3350755.3400213.","ista":"Alistarh D-A, Brown TA, Singhal N. 2020. Memory tagging: Minimalist synchronization for scalable concurrent data structures. Annual ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures, 37–49.","mla":"Alistarh, Dan-Adrian, et al. “Memory Tagging: Minimalist Synchronization for Scalable Concurrent Data Structures.” Annual ACM Symposium on Parallelism in Algorithms and Architectures, no. 7, Association for Computing Machinery, 2020, pp. 37–49, doi:10.1145/3350755.3400213.","short":"D.-A. Alistarh, T.A. Brown, N. Singhal, in:, Annual ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2020, pp. 37–49.","ieee":"D.-A. Alistarh, T. A. Brown, and N. Singhal, “Memory tagging: Minimalist synchronization for scalable concurrent data structures,” in Annual ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, United States, 2020, no. 7, pp. 37–49.","apa":"Alistarh, D.-A., Brown, T. A., & Singhal, N. (2020). Memory tagging: Minimalist synchronization for scalable concurrent data structures. In Annual ACM Symposium on Parallelism in Algorithms and Architectures (pp. 37–49). Virtual Event, United States: Association for Computing Machinery. https://doi.org/10.1145/3350755.3400213","ama":"Alistarh D-A, Brown TA, Singhal N. Memory tagging: Minimalist synchronization for scalable concurrent data structures. In: Annual ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery; 2020:37-49. doi:10.1145/3350755.3400213"},"status":"public","conference":{"name":"SPAA: Symposium on Parallelism in Algorithms and Architectures","end_date":"2020-07-17","location":"Virtual Event, United States","start_date":"2020-07-15"},"type":"conference","_id":"8191"},{"oa_version":"None","abstract":[{"lang":"eng","text":"Concurrent programming can be notoriously complex and error-prone. Programming bugs can arise from a variety of sources, such as operation re-reordering, or incomplete understanding of the memory model. A variety of formal and model checking methods have been developed to address this fundamental difficulty. While technically interesting, existing academic methods are still hard to apply to the large codebases typical of industrial deployments, which limits their practical impact."}],"month":"02","scopus_import":"1","publisher":"Association for Computing Machinery","quality_controlled":"1","day":"19","publication":"Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9781450368186"]},"year":"2020","publication_status":"published","doi":"10.1145/3332466.3374503","date_published":"2020-02-19T00:00:00Z","date_created":"2020-04-05T22:00:48Z","page":"423-424","_id":"7635","status":"public","type":"conference","conference":{"start_date":"2020-02-22","end_date":"2020-02-26","location":"San Diego, CA, United States","name":"PPOPP: Principles and Practice of Parallel Programming"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Koval, Nikita, Mariia Sokolova, Alexander Fedorov, Dan-Adrian Alistarh, and Dmitry Tsitelov. “Testing Concurrency on the JVM with Lincheck.” In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, 423–24. Association for Computing Machinery, 2020. https://doi.org/10.1145/3332466.3374503.","ista":"Koval N, Sokolova M, Fedorov A, Alistarh D-A, Tsitelov D. 2020. Testing concurrency on the JVM with Lincheck. Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP. PPOPP: Principles and Practice of Parallel Programming, 423–424.","mla":"Koval, Nikita, et al. “Testing Concurrency on the JVM with Lincheck.” Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, Association for Computing Machinery, 2020, pp. 423–24, doi:10.1145/3332466.3374503.","ieee":"N. Koval, M. Sokolova, A. Fedorov, D.-A. Alistarh, and D. Tsitelov, “Testing concurrency on the JVM with Lincheck,” in Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, San Diego, CA, United States, 2020, pp. 423–424.","short":"N. Koval, M. Sokolova, A. Fedorov, D.-A. Alistarh, D. Tsitelov, in:, Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, Association for Computing Machinery, 2020, pp. 423–424.","ama":"Koval N, Sokolova M, Fedorov A, Alistarh D-A, Tsitelov D. Testing concurrency on the JVM with Lincheck. In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP. Association for Computing Machinery; 2020:423-424. doi:10.1145/3332466.3374503","apa":"Koval, N., Sokolova, M., Fedorov, A., Alistarh, D.-A., & Tsitelov, D. (2020). Testing concurrency on the JVM with Lincheck. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP (pp. 423–424). San Diego, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3332466.3374503"},"date_updated":"2024-02-28T12:53:46Z","title":"Testing concurrency on the JVM with Lincheck","department":[{"_id":"DaAl"}],"author":[{"id":"2F4DB10C-F248-11E8-B48F-1D18A9856A87","first_name":"Nikita","last_name":"Koval","full_name":"Koval, Nikita"},{"id":"26217AE4-77FF-11EA-8101-AD24D49E41F4","first_name":"Mariia","last_name":"Sokolova","full_name":"Sokolova, Mariia"},{"first_name":"Alexander","last_name":"Fedorov","full_name":"Fedorov, Alexander"},{"orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian"},{"first_name":"Dmitry","full_name":"Tsitelov, Dmitry","last_name":"Tsitelov"}],"article_processing_charge":"No"},{"scopus_import":"1","publisher":"Association for Computing Machinery","quality_controlled":"1","month":"07","abstract":[{"lang":"eng","text":"We introduce extension-based proofs, a class of impossibility proofs that includes valency arguments. They are modelled as an interaction between a prover and a protocol. Using proofs based on combinatorial topology, it has been shown that it is impossible to deterministically solve k-set agreement among n > k ≥ 2 processes in a wait-free manner. However, it was unknown whether proofs based on simpler techniques were possible. We explain why this impossibility result cannot be obtained by an extension-based proof and, hence, extension-based proofs are limited in power."}],"oa_version":"None","page":"54-56","date_published":"2020-07-31T00:00:00Z","doi":"10.1145/3382734.3405743","date_created":"2020-09-13T22:01:18Z","publication_identifier":{"isbn":["9781450375825"]},"year":"2020","publication_status":"published","day":"31","publication":"Proceedings of the 39th Symposium on Principles of Distributed Computing","language":[{"iso":"eng"}],"type":"conference","conference":{"start_date":"2020-08-03","end_date":"2020-08-07","location":"Virtual, Italy","name":"PODC: Principles of Distributed Computing"},"status":"public","_id":"8383","author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh"},{"last_name":"Aspnes","full_name":"Aspnes, James","first_name":"James"},{"first_name":"Faith","full_name":"Ellen, Faith","last_name":"Ellen"},{"first_name":"Rati","full_name":"Gelashvili, Rati","last_name":"Gelashvili"},{"last_name":"Zhu","full_name":"Zhu, Leqi","first_name":"Leqi"}],"article_processing_charge":"No","title":"Brief Announcement: Why Extension-Based Proofs Fail","department":[{"_id":"DaAl"}],"date_updated":"2024-02-28T12:54:19Z","citation":{"mla":"Alistarh, Dan-Adrian, et al. “Brief Announcement: Why Extension-Based Proofs Fail.” Proceedings of the 39th Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 54–56, doi:10.1145/3382734.3405743.","ieee":"D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, and L. Zhu, “Brief Announcement: Why Extension-Based Proofs Fail,” in Proceedings of the 39th Symposium on Principles of Distributed Computing, Virtual, Italy, 2020, pp. 54–56.","short":"D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, L. Zhu, in:, Proceedings of the 39th Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 54–56.","ama":"Alistarh D-A, Aspnes J, Ellen F, Gelashvili R, Zhu L. Brief Announcement: Why Extension-Based Proofs Fail. In: Proceedings of the 39th Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2020:54-56. doi:10.1145/3382734.3405743","apa":"Alistarh, D.-A., Aspnes, J., Ellen, F., Gelashvili, R., & Zhu, L. (2020). Brief Announcement: Why Extension-Based Proofs Fail. In Proceedings of the 39th Symposium on Principles of Distributed Computing (pp. 54–56). Virtual, Italy: Association for Computing Machinery. https://doi.org/10.1145/3382734.3405743","chicago":"Alistarh, Dan-Adrian, James Aspnes, Faith Ellen, Rati Gelashvili, and Leqi Zhu. “Brief Announcement: Why Extension-Based Proofs Fail.” In Proceedings of the 39th Symposium on Principles of Distributed Computing, 54–56. Association for Computing Machinery, 2020. https://doi.org/10.1145/3382734.3405743.","ista":"Alistarh D-A, Aspnes J, Ellen F, Gelashvili R, Zhu L. 2020. Brief Announcement: Why Extension-Based Proofs Fail. Proceedings of the 39th Symposium on Principles of Distributed Computing. PODC: Principles of Distributed Computing, 54–56."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"article_number":"48","project":[{"grant_number":"638176","name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","_id":"2533E772-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Sperl, Georg, et al. “Homogenized Yarn-Level Cloth.” ACM Transactions on Graphics, vol. 39, no. 4, 48, Association for Computing Machinery, 2020, doi:10.1145/3386569.3392412.","apa":"Sperl, G., Narain, R., & Wojtan, C. (2020). Homogenized yarn-level cloth. ACM Transactions on Graphics. Association for Computing Machinery. https://doi.org/10.1145/3386569.3392412","ama":"Sperl G, Narain R, Wojtan C. Homogenized yarn-level cloth. ACM Transactions on Graphics. 2020;39(4). doi:10.1145/3386569.3392412","ieee":"G. Sperl, R. Narain, and C. Wojtan, “Homogenized yarn-level cloth,” ACM Transactions on Graphics, vol. 39, no. 4. Association for Computing Machinery, 2020.","short":"G. Sperl, R. Narain, C. Wojtan, ACM Transactions on Graphics 39 (2020).","chicago":"Sperl, Georg, Rahul Narain, and Chris Wojtan. “Homogenized Yarn-Level Cloth.” ACM Transactions on Graphics. Association for Computing Machinery, 2020. https://doi.org/10.1145/3386569.3392412.","ista":"Sperl G, Narain R, Wojtan C. 2020. Homogenized yarn-level cloth. ACM Transactions on Graphics. 39(4), 48."},"title":"Homogenized yarn-level cloth","author":[{"last_name":"Sperl","full_name":"Sperl, Georg","id":"4DD40360-F248-11E8-B48F-1D18A9856A87","first_name":"Georg"},{"first_name":"Rahul","full_name":"Narain, Rahul","last_name":"Narain"},{"first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","last_name":"Wojtan","orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J"}],"article_processing_charge":"No","external_id":{"isi":["000583700300021"]},"acknowledgement":"We wish to thank the anonymous reviewers and the members of the Visual Computing Group at IST Austria for their valuable feedback. We also thank the creators of the Berkeley Garment Library [de Joya et al. 2012] for providing garment meshes, [Krishnamurthy and Levoy 1996] and [Turk and Levoy 1994] for the armadillo and bunny meshes, the creators of libWetCloth [Fei et al. 2018] for their implementation of discrete elastic rod forces, and Tomáš Skřivan for\r\ninspiring discussions and help with Mathematica code generation. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No. 638176. Rahul Narain is supported by a Pankaj Gupta Young Faculty Fellowship and a gift from Adobe Inc.","publisher":"Association for Computing Machinery","quality_controlled":"1","oa":1,"day":"08","publication":"ACM Transactions on Graphics","has_accepted_license":"1","isi":1,"year":"2020","date_published":"2020-07-08T00:00:00Z","doi":"10.1145/3386569.3392412","date_created":"2020-09-13T22:01:18Z","_id":"8385","status":"public","article_type":"original","type":"journal_article","ddc":["000"],"date_updated":"2024-02-28T12:57:47Z","department":[{"_id":"ChWo"}],"file_date_updated":"2020-11-23T09:01:22Z","oa_version":"Submitted Version","acknowledged_ssus":[{"_id":"ScienComp"}],"abstract":[{"lang":"eng","text":"We present a method for animating yarn-level cloth effects using a thin-shell solver. We accomplish this through numerical homogenization: we first use a large number of yarn-level simulations to build a model of the potential energy density of the cloth, and then use this energy density function to compute forces in a thin shell simulator. We model several yarn-based materials, including both woven and knitted fabrics. Our model faithfully reproduces expected effects like the stiffness of woven fabrics, and the highly deformable nature and anisotropy of knitted fabrics. Our approach does not require any real-world experiments nor measurements; because the method is based entirely on simulations, it can generate entirely new material models quickly, without the need for testing apparatuses or human intervention. We provide data-driven models of several woven and knitted fabrics, which can be used for efficient simulation with an off-the-shelf cloth solver."}],"month":"07","intvolume":" 39","scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.1145/3386569.3392412","open_access":"1"}],"file":[{"date_updated":"2020-11-23T09:01:22Z","file_size":38922662,"creator":"dernst","date_created":"2020-11-23T09:01:22Z","file_name":"2020_hylc_submitted.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"8794","checksum":"cf4c1d361c3196c4bd424520a5588205","success":1}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["07300301"],"eissn":["15577368"]},"publication_status":"published","related_material":{"record":[{"status":"public","id":"12358","relation":"dissertation_contains"}]},"volume":39,"issue":"4","ec_funded":1},{"title":"Shear-induced ordering in systems with competing interactions: A machine learning study","author":[{"first_name":"J.","full_name":"Pȩkalski, J.","last_name":"Pȩkalski"},{"last_name":"Rzadkowski","full_name":"Rzadkowski, Wojciech","orcid":"0000-0002-1106-4419","first_name":"Wojciech","id":"48C55298-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Panagiotopoulos","full_name":"Panagiotopoulos, A. Z.","first_name":"A. Z."}],"article_processing_charge":"No","external_id":{"isi":["000537900300001"],"arxiv":["2002.07294"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"J. Pȩkalski, W. Rzadkowski, and A. Z. Panagiotopoulos, “Shear-induced ordering in systems with competing interactions: A machine learning study,” The Journal of chemical physics, vol. 152, no. 20. AIP Publishing, 2020.","short":"J. Pȩkalski, W. Rzadkowski, A.Z. Panagiotopoulos, The Journal of Chemical Physics 152 (2020).","apa":"Pȩkalski, J., Rzadkowski, W., & Panagiotopoulos, A. Z. (2020). Shear-induced ordering in systems with competing interactions: A machine learning study. The Journal of Chemical Physics. AIP Publishing. https://doi.org/10.1063/5.0005194","ama":"Pȩkalski J, Rzadkowski W, Panagiotopoulos AZ. Shear-induced ordering in systems with competing interactions: A machine learning study. The Journal of chemical physics. 2020;152(20). doi:10.1063/5.0005194","mla":"Pȩkalski, J., et al. “Shear-Induced Ordering in Systems with Competing Interactions: A Machine Learning Study.” The Journal of Chemical Physics, vol. 152, no. 20, 204905, AIP Publishing, 2020, doi:10.1063/5.0005194.","ista":"Pȩkalski J, Rzadkowski W, Panagiotopoulos AZ. 2020. Shear-induced ordering in systems with competing interactions: A machine learning study. The Journal of chemical physics. 152(20), 204905.","chicago":"Pȩkalski, J., Wojciech Rzadkowski, and A. Z. Panagiotopoulos. “Shear-Induced Ordering in Systems with Competing Interactions: A Machine Learning Study.” The Journal of Chemical Physics. AIP Publishing, 2020. https://doi.org/10.1063/5.0005194."},"project":[{"name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"article_number":"204905","doi":"10.1063/5.0005194","date_published":"2020-05-29T00:00:00Z","date_created":"2020-06-14T22:00:49Z","day":"29","publication":"The Journal of chemical physics","isi":1,"year":"2020","quality_controlled":"1","publisher":"AIP Publishing","oa":1,"department":[{"_id":"MiLe"}],"date_updated":"2024-02-28T13:00:28Z","status":"public","article_type":"original","type":"journal_article","_id":"7956","issue":"20","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10759"}]},"volume":152,"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["10897690"]},"publication_status":"published","month":"05","intvolume":" 152","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1063/5.0005194"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"When short-range attractions are combined with long-range repulsions in colloidal particle systems, complex microphases can emerge. Here, we study a system of isotropic particles, which can form lamellar structures or a disordered fluid phase when temperature is varied. We show that, at equilibrium, the lamellar structure crystallizes, while out of equilibrium, the system forms a variety of structures at different shear rates and temperatures above melting. The shear-induced ordering is analyzed by means of principal component analysis and artificial neural networks, which are applied to data of reduced dimensionality. Our results reveal the possibility of inducing ordering by shear, potentially providing a feasible route to the fabrication of ordered lamellar structures from isotropic particles."}]},{"title":"Long-lived snapshots with polylogarithmic amortized step complexity","author":[{"last_name":"Baig","full_name":"Baig, Mirza Ahad","id":"3EDE6DE4-AA5A-11E9-986D-341CE6697425","first_name":"Mirza Ahad"},{"last_name":"Hendler","full_name":"Hendler, Danny","first_name":"Danny"},{"first_name":"Alessia","full_name":"Milani, Alessia","last_name":"Milani"},{"first_name":"Corentin","last_name":"Travers","full_name":"Travers, Corentin"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-02-28T12:54:30Z","citation":{"mla":"Baig, Mirza Ahad, et al. “Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity.” Proceedings of the 39th Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 31–40, doi:10.1145/3382734.3406005.","short":"M.A. Baig, D. Hendler, A. Milani, C. Travers, in:, Proceedings of the 39th Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 31–40.","ieee":"M. A. Baig, D. Hendler, A. Milani, and C. Travers, “Long-lived snapshots with polylogarithmic amortized step complexity,” in Proceedings of the 39th Symposium on Principles of Distributed Computing, Virtual, Italy, 2020, pp. 31–40.","apa":"Baig, M. A., Hendler, D., Milani, A., & Travers, C. (2020). Long-lived snapshots with polylogarithmic amortized step complexity. In Proceedings of the 39th Symposium on Principles of Distributed Computing (pp. 31–40). Virtual, Italy: Association for Computing Machinery. https://doi.org/10.1145/3382734.3406005","ama":"Baig MA, Hendler D, Milani A, Travers C. Long-lived snapshots with polylogarithmic amortized step complexity. In: Proceedings of the 39th Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2020:31-40. doi:10.1145/3382734.3406005","chicago":"Baig, Mirza Ahad, Danny Hendler, Alessia Milani, and Corentin Travers. “Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity.” In Proceedings of the 39th Symposium on Principles of Distributed Computing, 31–40. Association for Computing Machinery, 2020. https://doi.org/10.1145/3382734.3406005.","ista":"Baig MA, Hendler D, Milani A, Travers C. 2020. Long-lived snapshots with polylogarithmic amortized step complexity. Proceedings of the 39th Symposium on Principles of Distributed Computing. PODC: Principles of Distributed Computing, 31–40."},"status":"public","type":"conference","conference":{"name":"PODC: Principles of Distributed Computing","location":"Virtual, Italy","end_date":"2020-08-07","start_date":"2020-08-03"},"_id":"8382","date_published":"2020-07-31T00:00:00Z","doi":"10.1145/3382734.3406005","date_created":"2020-09-13T22:01:17Z","page":"31-40","day":"31","language":[{"iso":"eng"}],"publication":"Proceedings of the 39th Symposium on Principles of Distributed Computing","publication_identifier":{"isbn":["9781450375825"]},"year":"2020","publication_status":"published","month":"07","scopus_import":"1","publisher":"Association for Computing Machinery","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://hal.archives-ouvertes.fr/hal-02860087/document"}],"oa":1,"oa_version":"Preprint","abstract":[{"text":"We present the first deterministic wait-free long-lived snapshot algorithm, using only read and write operations, that guarantees polylogarithmic amortized step complexity in all executions. This is the first non-blocking snapshot algorithm, using reads and writes only, that has sub-linear amortized step complexity in executions of arbitrary length. The key to our construction is a novel implementation of a 2-component max array object which may be of independent interest.","lang":"eng"}]},{"date_updated":"2024-02-28T13:11:13Z","department":[{"_id":"MiLe"}],"_id":"7428","status":"public","article_type":"original","type":"journal_article","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["24699969"],"issn":["24699950"]},"publication_status":"published","volume":101,"issue":"2","oa_version":"Preprint","abstract":[{"text":"In the superconducting regime of FeTe(1−x)Sex, there exist two types of vortices which are distinguished by the presence or absence of zero-energy states in their core. To understand their origin, we examine the interplay of Zeeman coupling and superconducting pairings in three-dimensional metals with band inversion. Weak Zeeman fields are found to suppress intraorbital spin-singlet pairing, known to localize the states at the ends of the vortices on the surface. On the other hand, an orbital-triplet pairing is shown to be stable against Zeeman interactions, but leads to delocalized zero-energy Majorana modes which extend through the vortex. In contrast, the finite-energy vortex modes remain localized at the vortex ends even when the pairing is of orbital-triplet form. Phenomenologically, this manifests as an observed disappearance of zero-bias peaks within the cores of topological vortices upon an increase of the applied magnetic field. The presence of magnetic impurities in FeTe(1−x)Sex, which are attracted to the vortices, would lead to such Zeeman-induced delocalization of Majorana modes in a fraction of vortices that capture a large enough number of magnetic impurities. Our results provide an explanation for the dichotomy between topological and nontopological vortices recently observed in FeTe(1−x)Sex.","lang":"eng"}],"month":"01","intvolume":" 101","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1907.02077","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Ghazaryan, Areg, et al. “Effect of Zeeman Coupling on the Majorana Vortex Modes in Iron-Based Topological Superconductors.” Physical Review B, vol. 101, no. 2, 020504, American Physical Society, 2020, doi:10.1103/PhysRevB.101.020504.","ieee":"A. Ghazaryan, P. L. S. Lopes, P. Hosur, M. J. Gilbert, and P. Ghaemi, “Effect of Zeeman coupling on the Majorana vortex modes in iron-based topological superconductors,” Physical Review B, vol. 101, no. 2. American Physical Society, 2020.","short":"A. Ghazaryan, P.L.S. Lopes, P. Hosur, M.J. Gilbert, P. Ghaemi, Physical Review B 101 (2020).","ama":"Ghazaryan A, Lopes PLS, Hosur P, Gilbert MJ, Ghaemi P. Effect of Zeeman coupling on the Majorana vortex modes in iron-based topological superconductors. Physical Review B. 2020;101(2). doi:10.1103/PhysRevB.101.020504","apa":"Ghazaryan, A., Lopes, P. L. S., Hosur, P., Gilbert, M. J., & Ghaemi, P. (2020). Effect of Zeeman coupling on the Majorana vortex modes in iron-based topological superconductors. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.101.020504","chicago":"Ghazaryan, Areg, P. L.S. Lopes, Pavan Hosur, Matthew J. Gilbert, and Pouyan Ghaemi. “Effect of Zeeman Coupling on the Majorana Vortex Modes in Iron-Based Topological Superconductors.” Physical Review B. American Physical Society, 2020. https://doi.org/10.1103/PhysRevB.101.020504.","ista":"Ghazaryan A, Lopes PLS, Hosur P, Gilbert MJ, Ghaemi P. 2020. Effect of Zeeman coupling on the Majorana vortex modes in iron-based topological superconductors. Physical Review B. 101(2), 020504."},"title":"Effect of Zeeman coupling on the Majorana vortex modes in iron-based topological superconductors","author":[{"first_name":"Areg","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87","last_name":"Ghazaryan","full_name":"Ghazaryan, Areg","orcid":"0000-0001-9666-3543"},{"last_name":"Lopes","full_name":"Lopes, P. L.S.","first_name":"P. L.S."},{"first_name":"Pavan","full_name":"Hosur, Pavan","last_name":"Hosur"},{"last_name":"Gilbert","full_name":"Gilbert, Matthew J.","first_name":"Matthew J."},{"full_name":"Ghaemi, Pouyan","last_name":"Ghaemi","first_name":"Pouyan"}],"article_processing_charge":"No","external_id":{"isi":["000506843500001"],"arxiv":["1907.02077"]},"article_number":"020504","day":"13","publication":"Physical Review B","isi":1,"year":"2020","date_published":"2020-01-13T00:00:00Z","doi":"10.1103/PhysRevB.101.020504","date_created":"2020-02-02T23:01:01Z","quality_controlled":"1","publisher":"American Physical Society","oa":1},{"scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1912.08334","open_access":"1"}],"month":"07","intvolume":" 102","abstract":[{"lang":"eng","text":"We demonstrate that releasing atoms into free space from an optical lattice does not deteriorate cavity-generated spin squeezing for metrological purposes. In this work, an ensemble of 500000 spin-squeezed atoms in a high-finesse optical cavity with near-uniform atom-cavity coupling is prepared, released into free space, recaptured in the cavity, and probed. Up to ∼10 dB of metrologically relevant squeezing is retrieved for 700μs free-fall times, and decaying levels of squeezing are realized for up to 3 ms free-fall times. The degradation of squeezing results from loss of atom-cavity coupling homogeneity between the initial squeezed state generation and final collective state readout. A theoretical model is developed to quantify this degradation and this model is experimentally validated."}],"oa_version":"Preprint","issue":"1","volume":102,"publication_identifier":{"eissn":["24699934"],"issn":["24699926"]},"publication_status":"published","language":[{"iso":"eng"}],"article_type":"original","type":"journal_article","status":"public","_id":"8319","department":[{"_id":"OnHo"}],"date_updated":"2024-02-28T13:11:28Z","publisher":"American Physical Society","quality_controlled":"1","oa":1,"acknowledgement":"We thank N. Engelsen for comments on the manuscript. This work was supported by the Office of Naval Research, Vannevar Bush Faculty Fellowship, Department of Energy, and Defense Threat Reduction Agency. R.K. was partly supported by the AQT/INQNET program at Caltech.","doi":"10.1103/PhysRevA.102.012224","date_published":"2020-07-30T00:00:00Z","date_created":"2020-08-30T22:01:10Z","isi":1,"year":"2020","day":"30","publication":"Physical Review A","article_number":"012224","author":[{"full_name":"Wu, Yunfan","last_name":"Wu","first_name":"Yunfan"},{"first_name":"Rajiv","full_name":"Krishnakumar, Rajiv","last_name":"Krishnakumar"},{"first_name":"Julián","last_name":"Martínez-Rincón","full_name":"Martínez-Rincón, Julián"},{"last_name":"Malia","full_name":"Malia, Benjamin K.","first_name":"Benjamin K."},{"last_name":"Hosten","orcid":"0000-0002-2031-204X","full_name":"Hosten, Onur","first_name":"Onur","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Mark A.","last_name":"Kasevich","full_name":"Kasevich, Mark A."}],"article_processing_charge":"No","external_id":{"arxiv":["1912.08334"],"isi":["000555104200011"]},"title":"Retrieval of cavity-generated atomic spin squeezing after free-space release","citation":{"ista":"Wu Y, Krishnakumar R, Martínez-Rincón J, Malia BK, Hosten O, Kasevich MA. 2020. Retrieval of cavity-generated atomic spin squeezing after free-space release. Physical Review A. 102(1), 012224.","chicago":"Wu, Yunfan, Rajiv Krishnakumar, Julián Martínez-Rincón, Benjamin K. Malia, Onur Hosten, and Mark A. Kasevich. “Retrieval of Cavity-Generated Atomic Spin Squeezing after Free-Space Release.” Physical Review A. American Physical Society, 2020. https://doi.org/10.1103/PhysRevA.102.012224.","short":"Y. Wu, R. Krishnakumar, J. Martínez-Rincón, B.K. Malia, O. Hosten, M.A. Kasevich, Physical Review A 102 (2020).","ieee":"Y. Wu, R. Krishnakumar, J. Martínez-Rincón, B. K. Malia, O. Hosten, and M. A. Kasevich, “Retrieval of cavity-generated atomic spin squeezing after free-space release,” Physical Review A, vol. 102, no. 1. American Physical Society, 2020.","ama":"Wu Y, Krishnakumar R, Martínez-Rincón J, Malia BK, Hosten O, Kasevich MA. Retrieval of cavity-generated atomic spin squeezing after free-space release. Physical Review A. 2020;102(1). doi:10.1103/PhysRevA.102.012224","apa":"Wu, Y., Krishnakumar, R., Martínez-Rincón, J., Malia, B. K., Hosten, O., & Kasevich, M. A. (2020). Retrieval of cavity-generated atomic spin squeezing after free-space release. Physical Review A. American Physical Society. https://doi.org/10.1103/PhysRevA.102.012224","mla":"Wu, Yunfan, et al. “Retrieval of Cavity-Generated Atomic Spin Squeezing after Free-Space Release.” Physical Review A, vol. 102, no. 1, 012224, American Physical Society, 2020, doi:10.1103/PhysRevA.102.012224."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"date_updated":"2024-02-28T13:58:11Z","department":[{"_id":"ChWo"},{"_id":"BeBi"}],"_id":"8766","status":"public","article_type":"original","type":"journal_article","conference":{"start_date":"2020-10-06","location":"Online Symposium","end_date":"2020-10-09","name":"SCA: Symposium on Computer Animation"},"language":[{"iso":"eng"}],"publication_status":"published","issue":"8","volume":39,"ec_funded":1,"oa_version":"None","abstract":[{"text":"The “procedural” approach to animating ocean waves is the dominant algorithm for animating larger bodies of water in\r\ninteractive applications as well as in off-line productions — it provides high visual quality with a low computational demand. In this paper, we widen the applicability of procedural water wave animation with an extension that guarantees the satisfaction of boundary conditions imposed by terrain while still approximating physical wave behavior. In combination with a particle system that models wave breaking, foam, and spray, this allows us to naturally model waves interacting with beaches and rocks. Our system is able to animate waves at large scales at interactive frame rates on a commodity PC.","lang":"eng"}],"month":"12","intvolume":" 39","scopus_import":"1","user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Jeschke, Stefan, Christian Hafner, Nuttapong Chentanez, Miles Macklin, Matthias Müller-Fischer, and Chris Wojtan. “Making Procedural Water Waves Boundary-Aware.” Computer Graphics Forum. Wiley, 2020. https://doi.org/10.1111/cgf.14100.","ista":"Jeschke S, Hafner C, Chentanez N, Macklin M, Müller-Fischer M, Wojtan C. 2020. Making procedural water waves boundary-aware. Computer Graphics forum. 39(8), 47–54.","mla":"Jeschke, Stefan, et al. “Making Procedural Water Waves Boundary-Aware.” Computer Graphics Forum, vol. 39, no. 8, Wiley, 2020, pp. 47–54, doi:10.1111/cgf.14100.","apa":"Jeschke, S., Hafner, C., Chentanez, N., Macklin, M., Müller-Fischer, M., & Wojtan, C. (2020). Making procedural water waves boundary-aware. Computer Graphics Forum. Online Symposium: Wiley. https://doi.org/10.1111/cgf.14100","ama":"Jeschke S, Hafner C, Chentanez N, Macklin M, Müller-Fischer M, Wojtan C. Making procedural water waves boundary-aware. Computer Graphics forum. 2020;39(8):47-54. doi:10.1111/cgf.14100","short":"S. Jeschke, C. Hafner, N. Chentanez, M. Macklin, M. Müller-Fischer, C. Wojtan, Computer Graphics Forum 39 (2020) 47–54.","ieee":"S. Jeschke, C. Hafner, N. Chentanez, M. Macklin, M. Müller-Fischer, and C. Wojtan, “Making procedural water waves boundary-aware,” Computer Graphics forum, vol. 39, no. 8. Wiley, pp. 47–54, 2020."},"title":"Making procedural water waves boundary-aware","author":[{"last_name":"Jeschke","full_name":"Jeschke, Stefan","id":"44D6411A-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan"},{"id":"400429CC-F248-11E8-B48F-1D18A9856A87","first_name":"Christian","full_name":"Hafner, Christian","last_name":"Hafner"},{"first_name":"Nuttapong","last_name":"Chentanez","full_name":"Chentanez, Nuttapong"},{"full_name":"Macklin, Miles","last_name":"Macklin","first_name":"Miles"},{"first_name":"Matthias","full_name":"Müller-Fischer, Matthias","last_name":"Müller-Fischer"},{"last_name":"Wojtan","orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J","first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","external_id":{"isi":["000591780400005"]},"project":[{"name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","grant_number":"638176","_id":"2533E772-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"grant_number":"715767","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"day":"01","publication":"Computer Graphics forum","isi":1,"year":"2020","date_published":"2020-12-01T00:00:00Z","doi":"10.1111/cgf.14100","date_created":"2020-11-17T10:47:48Z","page":"47-54","publisher":"Wiley","quality_controlled":"1"},{"project":[{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"}],"author":[{"last_name":"Brázdil","full_name":"Brázdil, Tomáš","first_name":"Tomáš"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Novotný","full_name":"Novotný, Petr","first_name":"Petr"},{"first_name":"Jiří","full_name":"Vahala, Jiří","last_name":"Vahala"}],"external_id":{"arxiv":["2002.12086"]},"article_processing_charge":"No","title":"Reinforcement learning of risk-constrained policies in Markov decision processes","citation":{"chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Petr Novotný, and Jiří Vahala. “Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes.” Proceedings of the 34th AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2020. https://doi.org/10.1609/aaai.v34i06.6531.","ista":"Brázdil T, Chatterjee K, Novotný P, Vahala J. 2020. Reinforcement learning of risk-constrained policies in Markov decision processes. Proceedings of the 34th AAAI Conference on Artificial Intelligence. 34(06), 9794–9801.","mla":"Brázdil, Tomáš, et al. “Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes.” Proceedings of the 34th AAAI Conference on Artificial Intelligence, vol. 34, no. 06, Association for the Advancement of Artificial Intelligence, 2020, pp. 9794–801, doi:10.1609/aaai.v34i06.6531.","short":"T. Brázdil, K. Chatterjee, P. Novotný, J. Vahala, Proceedings of the 34th AAAI Conference on Artificial Intelligence 34 (2020) 9794–9801.","ieee":"T. Brázdil, K. Chatterjee, P. Novotný, and J. Vahala, “Reinforcement learning of risk-constrained policies in Markov decision processes,” Proceedings of the 34th AAAI Conference on Artificial Intelligence, vol. 34, no. 06. Association for the Advancement of Artificial Intelligence, pp. 9794–9801, 2020.","apa":"Brázdil, T., Chatterjee, K., Novotný, P., & Vahala, J. (2020). Reinforcement learning of risk-constrained policies in Markov decision processes. Proceedings of the 34th AAAI Conference on Artificial Intelligence. New York, NY, United States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v34i06.6531","ama":"Brázdil T, Chatterjee K, Novotný P, Vahala J. Reinforcement learning of risk-constrained policies in Markov decision processes. Proceedings of the 34th AAAI Conference on Artificial Intelligence. 2020;34(06):9794-9801. doi:10.1609/aaai.v34i06.6531"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Association for the Advancement of Artificial Intelligence","quality_controlled":"1","oa":1,"acknowledgement":"Krishnendu Chatterjee is supported by the Austrian Science Fund (FWF) NFN Grant No. S11407-N23 (RiSE/SHiNE), and COST Action GAMENET. Tomas Brazdil is supported by the Grant Agency of Masaryk University grant no. MUNI/G/0739/2017 and by the Czech Science Foundation grant No. 18-11193S. Petr Novotny and Jirı Vahala are supported by the Czech Science Foundation grant No. GJ19-15134Y.","page":"9794-9801","date_published":"2020-04-03T00:00:00Z","doi":"10.1609/aaai.v34i06.6531","date_created":"2024-03-04T08:07:22Z","year":"2020","day":"03","publication":"Proceedings of the 34th AAAI Conference on Artificial Intelligence","article_type":"original","type":"journal_article","conference":{"start_date":"2020-02-07","location":"New York, NY, United States","end_date":"2020-02-12","name":"AAAI: Conference on Artificial Intelligence"},"status":"public","keyword":["General Medicine"],"_id":"15055","department":[{"_id":"KrCh"}],"date_updated":"2024-03-04T08:30:16Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2002.12086"}],"month":"04","intvolume":" 34","abstract":[{"text":"Markov decision processes (MDPs) are the defacto framework for sequential decision making in the presence of stochastic uncertainty. A classical optimization criterion for MDPs is to maximize the expected discounted-sum payoff, which ignores low probability catastrophic events with highly negative impact on the system. On the other hand, risk-averse policies require the probability of undesirable events to be below a given threshold, but they do not account for optimization of the expected payoff. We consider MDPs with discounted-sum payoff with failure states which represent catastrophic outcomes. The objective of risk-constrained planning is to maximize the expected discounted-sum payoff among risk-averse policies that ensure the probability to encounter a failure state is below a desired threshold. Our main contribution is an efficient risk-constrained planning algorithm that combines UCT-like search with a predictor learned through interaction with the MDP (in the style of AlphaZero) and with a risk-constrained action selection via linear programming. We demonstrate the effectiveness of our approach with experiments on classical MDPs from the literature, including benchmarks with an order of 106 states.","lang":"eng"}],"oa_version":"Preprint","volume":34,"issue":"06","publication_identifier":{"issn":["2374-3468"]},"publication_status":"published","language":[{"iso":"eng"}]},{"date_created":"2024-03-04T09:41:57Z","date_published":"2020-07-01T00:00:00Z","doi":"10.1126/sciadv.aaw7824","year":"2020","has_accepted_license":"1","publication":"Science Advances","day":"01","oa":1,"publisher":"American Association for the Advancement of Science","quality_controlled":"1","acknowledgement":"This research was supported by grants NRF-2019R1A3B2067745 and NRF-2017R1A5A1015366 funded by the Korean Government (MSIT) through the National Research Foundation (NRF) of Korea to S.-J.V.L. and by grant Basic Science Research Program (No. 2019R1A2C2009440) funded by the Korean Government (MSIT) through the NRF of Korea to K.-T.K. ","article_processing_charge":"No","author":[{"full_name":"Park, Sangsoon","last_name":"Park","first_name":"Sangsoon"},{"first_name":"Murat","id":"C407B586-6052-11E9-B3AE-7006E6697425","last_name":"Artan","orcid":"0000-0001-8945-6992","full_name":"Artan, Murat"},{"first_name":"Seung Hyun","full_name":"Han, Seung Hyun","last_name":"Han"},{"full_name":"Park, Hae-Eun H.","last_name":"Park","first_name":"Hae-Eun H."},{"full_name":"Jung, Yoonji","last_name":"Jung","first_name":"Yoonji"},{"full_name":"Hwang, Ara B.","last_name":"Hwang","first_name":"Ara B."},{"first_name":"Won Sik","last_name":"Shin","full_name":"Shin, Won Sik"},{"full_name":"Kim, Kyong-Tai","last_name":"Kim","first_name":"Kyong-Tai"},{"last_name":"Lee","full_name":"Lee, Seung-Jae V.","first_name":"Seung-Jae V."}],"title":"VRK-1 extends life span by activation of AMPK via phosphorylation","citation":{"ista":"Park S, Artan M, Han SH, Park H-EH, Jung Y, Hwang AB, Shin WS, Kim K-T, Lee S-JV. 2020. VRK-1 extends life span by activation of AMPK via phosphorylation. Science Advances. 6(27), aaw7824.","chicago":"Park, Sangsoon, Murat Artan, Seung Hyun Han, Hae-Eun H. Park, Yoonji Jung, Ara B. Hwang, Won Sik Shin, Kyong-Tai Kim, and Seung-Jae V. Lee. “VRK-1 Extends Life Span by Activation of AMPK via Phosphorylation.” Science Advances. American Association for the Advancement of Science, 2020. https://doi.org/10.1126/sciadv.aaw7824.","short":"S. Park, M. Artan, S.H. Han, H.-E.H. Park, Y. Jung, A.B. Hwang, W.S. Shin, K.-T. Kim, S.-J.V. Lee, Science Advances 6 (2020).","ieee":"S. Park et al., “VRK-1 extends life span by activation of AMPK via phosphorylation,” Science Advances, vol. 6, no. 27. American Association for the Advancement of Science, 2020.","ama":"Park S, Artan M, Han SH, et al. VRK-1 extends life span by activation of AMPK via phosphorylation. Science Advances. 2020;6(27). doi:10.1126/sciadv.aaw7824","apa":"Park, S., Artan, M., Han, S. H., Park, H.-E. H., Jung, Y., Hwang, A. B., … Lee, S.-J. V. (2020). VRK-1 extends life span by activation of AMPK via phosphorylation. Science Advances. American Association for the Advancement of Science. https://doi.org/10.1126/sciadv.aaw7824","mla":"Park, Sangsoon, et al. “VRK-1 Extends Life Span by Activation of AMPK via Phosphorylation.” Science Advances, vol. 6, no. 27, aaw7824, American Association for the Advancement of Science, 2020, doi:10.1126/sciadv.aaw7824."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"aaw7824","license":"https://creativecommons.org/licenses/by-nc/4.0/","issue":"27","volume":6,"publication_status":"published","publication_identifier":{"eissn":["2375-2548"]},"language":[{"iso":"eng"}],"file":[{"date_updated":"2024-03-04T09:46:41Z","file_size":1864415,"creator":"dernst","date_created":"2024-03-04T09:46:41Z","file_name":"2020_ScienceAdvances_Park.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"15058","checksum":"a37157cd0de709dce5fe03f4a31cd0b6","success":1}],"intvolume":" 6","month":"07","abstract":[{"lang":"eng","text":"Vaccinia virus–related kinase (VRK) is an evolutionarily conserved nuclear protein kinase. VRK-1, the single Caenorhabditis elegans VRK ortholog, functions in cell division and germline proliferation. However, the role of VRK-1 in postmitotic cells and adult life span remains unknown. Here, we show that VRK-1 increases organismal longevity by activating the cellular energy sensor, AMP-activated protein kinase (AMPK), via direct phosphorylation. We found that overexpression of vrk-1 in the soma of adult C. elegans increased life span and, conversely, inhibition of vrk-1 decreased life span. In addition, vrk-1 was required for longevity conferred by mutations that inhibit C. elegans mitochondrial respiration, which requires AMPK. VRK-1 directly phosphorylated and up-regulated AMPK in both C. elegans and cultured human cells. Thus, our data show that the somatic nuclear kinase, VRK-1, promotes longevity through AMPK activation, and this function appears to be conserved between C. elegans and humans."}],"oa_version":"Published Version","file_date_updated":"2024-03-04T09:46:41Z","department":[{"_id":"MaDe"}],"date_updated":"2024-03-04T09:52:09Z","ddc":["570"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"article_type":"original","type":"journal_article","status":"public","_id":"15057"},{"citation":{"chicago":"Pinotsis, Nikos, Karolina Zielinska, Mrigya Babuta, Joan L. Arolas, Julius Kostan, Muhammad Bashir Khan, Claudia Schreiner, et al. “Calcium Modulates the Domain Flexibility and Function of an α-Actinin Similar to the Ancestral α-Actinin.” Proceedings of the National Academy of Sciences. Proceedings of the National Academy of Sciences, 2020. https://doi.org/10.1073/pnas.1917269117.","ista":"Pinotsis N, Zielinska K, Babuta M, Arolas JL, Kostan J, Khan MB, Schreiner C, Testa Salmazo AP, Ciccarelli L, Puchinger M, Gkougkoulia EA, Ribeiro E de A, Marlovits TC, Bhattacharya A, Djinovic-Carugo K. 2020. Calcium modulates the domain flexibility and function of an α-actinin similar to the ancestral α-actinin. Proceedings of the National Academy of Sciences. 117(36), 22101–22112.","mla":"Pinotsis, Nikos, et al. “Calcium Modulates the Domain Flexibility and Function of an α-Actinin Similar to the Ancestral α-Actinin.” Proceedings of the National Academy of Sciences, vol. 117, no. 36, Proceedings of the National Academy of Sciences, 2020, pp. 22101–12, doi:10.1073/pnas.1917269117.","ieee":"N. Pinotsis et al., “Calcium modulates the domain flexibility and function of an α-actinin similar to the ancestral α-actinin,” Proceedings of the National Academy of Sciences, vol. 117, no. 36. Proceedings of the National Academy of Sciences, pp. 22101–22112, 2020.","short":"N. Pinotsis, K. Zielinska, M. Babuta, J.L. Arolas, J. Kostan, M.B. Khan, C. Schreiner, A.P. Testa Salmazo, L. Ciccarelli, M. Puchinger, E.A. Gkougkoulia, E. de A. Ribeiro, T.C. Marlovits, A. Bhattacharya, K. Djinovic-Carugo, Proceedings of the National Academy of Sciences 117 (2020) 22101–22112.","ama":"Pinotsis N, Zielinska K, Babuta M, et al. Calcium modulates the domain flexibility and function of an α-actinin similar to the ancestral α-actinin. Proceedings of the National Academy of Sciences. 2020;117(36):22101-22112. doi:10.1073/pnas.1917269117","apa":"Pinotsis, N., Zielinska, K., Babuta, M., Arolas, J. L., Kostan, J., Khan, M. B., … Djinovic-Carugo, K. (2020). Calcium modulates the domain flexibility and function of an α-actinin similar to the ancestral α-actinin. Proceedings of the National Academy of Sciences. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.1917269117"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","external_id":{"pmid":["32848067"]},"author":[{"last_name":"Pinotsis","full_name":"Pinotsis, Nikos","first_name":"Nikos"},{"full_name":"Zielinska, Karolina","last_name":"Zielinska","first_name":"Karolina"},{"last_name":"Babuta","full_name":"Babuta, Mrigya","first_name":"Mrigya"},{"last_name":"Arolas","full_name":"Arolas, Joan L.","first_name":"Joan L."},{"first_name":"Julius","last_name":"Kostan","full_name":"Kostan, Julius"},{"first_name":"Muhammad Bashir","full_name":"Khan, Muhammad Bashir","last_name":"Khan"},{"first_name":"Claudia","full_name":"Schreiner, Claudia","last_name":"Schreiner"},{"last_name":"Testa Salmazo","full_name":"Testa Salmazo, Anita P","first_name":"Anita P","id":"41F1F098-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Luciano","last_name":"Ciccarelli","full_name":"Ciccarelli, Luciano"},{"first_name":"Martin","last_name":"Puchinger","full_name":"Puchinger, Martin"},{"first_name":"Eirini A.","full_name":"Gkougkoulia, Eirini A.","last_name":"Gkougkoulia"},{"last_name":"Ribeiro","full_name":"Ribeiro, Euripedes de Almeida","first_name":"Euripedes de Almeida"},{"first_name":"Thomas C.","full_name":"Marlovits, Thomas C.","last_name":"Marlovits"},{"full_name":"Bhattacharya, Alok","last_name":"Bhattacharya","first_name":"Alok"},{"last_name":"Djinovic-Carugo","full_name":"Djinovic-Carugo, Kristina","first_name":"Kristina"}],"title":"Calcium modulates the domain flexibility and function of an α-actinin similar to the ancestral α-actinin","acknowledgement":"We thank the staff of the macromolecular crystallography (MX) and SAXS beamlines at the European Synchrotron Radiation facility, Diamond, and Swiss Light Source for excellent support, and the Life Sciences Facility of the Institute of Science and Technology Austria for usage of the rheometer. We thank Life Sciences editors for editing assistance. EM data were\r\nrecorded at the EM Facility of the Vienna BioCenter Core Facilities (Austria). Confocal microscopy was carried out at the Advanced Instrument Research Facility, Jawaharlal Nehru University. K.D.-C.’s research was supported by the Initial Training Network MUZIC (ITN-MUZIC) (N°238423), Austrian Science Fund (FWF) Projects I525, I1593, P22276, P19060, and W1221, Laura Bassi Centre of Optimized Structural Studies (N°253275), a Wellcome Trust Collaborative Award (201543/Z/16/Z), COST Action BM1405, Vienna Science and Technology Fund (WWTF) Chemical Biology Project LS17-008, and Christian Doppler Laboratory for High-Content Structural Biology and Biotechnology. K.Z., J.L.A., C.S., E.A.G., and A.S. were supported by the University of Vienna, J.K. by a Wellcome Trust Collaborative Award and by the Centre of Optimized Structural Studies, M.P. by FWF Project I1593, E.d.A.R. ITN-MUZIC, and FWF Projects I525 and I1593, and T.C.M. and L.C. by FWF Project I 2408-B22. E.A.G. acknowledges the PhD program Structure and Interaction of Biological Macromolecules. M.B. acknowledges the University Grant Commission, India, for a senior research fellowship. A.B. acknowledges a JC Bose Fellowship from the Science Engineering Research Council. ","oa":1,"quality_controlled":"1","publisher":"Proceedings of the National Academy of Sciences","year":"2020","publication":"Proceedings of the National Academy of Sciences","day":"08","page":"22101-22112","date_created":"2024-03-04T10:03:52Z","doi":"10.1073/pnas.1917269117","date_published":"2020-09-08T00:00:00Z","_id":"15061","article_type":"original","type":"journal_article","status":"public","date_updated":"2024-03-04T10:14:44Z","department":[{"_id":"CaBe"}],"abstract":[{"lang":"eng","text":"The actin cytoskeleton, a dynamic network of actin filaments and associated F-actin–binding proteins, is fundamentally important in eukaryotes. α-Actinins are major F-actin bundlers that are inhibited by Ca2+ in nonmuscle cells. Here we report the mechanism of Ca2+-mediated regulation of Entamoeba histolytica α-actinin-2 (EhActn2) with features expected for the common ancestor of Entamoeba and higher eukaryotic α-actinins. Crystal structures of Ca2+-free and Ca2+-bound EhActn2 reveal a calmodulin-like domain (CaMD) uniquely inserted within the rod domain. Integrative studies reveal an exceptionally high affinity of the EhActn2 CaMD for Ca2+, binding of which can only be regulated in the presence of physiological concentrations of Mg2+. Ca2+ binding triggers an increase in protein multidomain rigidity, reducing conformational flexibility of F-actin–binding domains via interdomain cross-talk and consequently inhibiting F-actin bundling. In vivo studies uncover that EhActn2 plays an important role in phagocytic cup formation and might constitute a new drug target for amoebic dysentery."}],"acknowledged_ssus":[{"_id":"LifeSc"}],"oa_version":"Published Version","pmid":1,"main_file_link":[{"url":"https://doi.org/10.1073/pnas.191726911","open_access":"1"}],"intvolume":" 117","month":"09","publication_status":"published","publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"language":[{"iso":"eng"}],"issue":"36","volume":117},{"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":"15064","file_date_updated":"2024-03-04T10:52:42Z","department":[{"_id":"HeEd"}],"date_updated":"2024-03-04T10:54:04Z","ddc":["500"],"scopus_import":"1","intvolume":" 4","month":"12","abstract":[{"text":"We call a continuous self-map that reveals itself through a discrete set of point-value pairs a sampled dynamical system. Capturing the available information with chain maps on Delaunay complexes, we use persistent homology to quantify the evidence of recurrent behavior. We establish a sampling theorem to recover the eigenspaces of the endomorphism on homology induced by the self-map. Using a combinatorial gradient flow arising from the discrete Morse theory for Čech and Delaunay complexes, we construct a chain map to transform the problem from the natural but expensive Čech complexes to the computationally efficient Delaunay triangulations. The fast chain map algorithm has applications beyond dynamical systems.","lang":"eng"}],"oa_version":"Published Version","volume":4,"issue":"4","publication_status":"published","publication_identifier":{"eissn":["2367-1734"],"issn":["2367-1726"]},"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"15065","checksum":"eed1168b6e66cd55272c19bb7fca8a1c","file_size":851190,"date_updated":"2024-03-04T10:52:42Z","creator":"dernst","file_name":"2020_JourApplCompTopology_Bauer.pdf","date_created":"2024-03-04T10:52:42Z"}],"article_processing_charge":"Yes (via OA deal)","author":[{"last_name":"Bauer","full_name":"Bauer, U.","first_name":"U."},{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-3536-9866","full_name":"Jablonski, Grzegorz","last_name":"Jablonski","first_name":"Grzegorz","id":"4483EF78-F248-11E8-B48F-1D18A9856A87"},{"first_name":"M.","full_name":"Mrozek, M.","last_name":"Mrozek"}],"title":"Čech-Delaunay gradient flow and homology inference for self-maps","citation":{"ieee":"U. Bauer, H. Edelsbrunner, G. Jablonski, and M. Mrozek, “Čech-Delaunay gradient flow and homology inference for self-maps,” Journal of Applied and Computational Topology, vol. 4, no. 4. Springer Nature, pp. 455–480, 2020.","short":"U. Bauer, H. Edelsbrunner, G. Jablonski, M. Mrozek, Journal of Applied and Computational Topology 4 (2020) 455–480.","apa":"Bauer, U., Edelsbrunner, H., Jablonski, G., & Mrozek, M. (2020). Čech-Delaunay gradient flow and homology inference for self-maps. Journal of Applied and Computational Topology. Springer Nature. https://doi.org/10.1007/s41468-020-00058-8","ama":"Bauer U, Edelsbrunner H, Jablonski G, Mrozek M. Čech-Delaunay gradient flow and homology inference for self-maps. Journal of Applied and Computational Topology. 2020;4(4):455-480. doi:10.1007/s41468-020-00058-8","mla":"Bauer, U., et al. “Čech-Delaunay Gradient Flow and Homology Inference for Self-Maps.” Journal of Applied and Computational Topology, vol. 4, no. 4, Springer Nature, 2020, pp. 455–80, doi:10.1007/s41468-020-00058-8.","ista":"Bauer U, Edelsbrunner H, Jablonski G, Mrozek M. 2020. Čech-Delaunay gradient flow and homology inference for self-maps. Journal of Applied and Computational Topology. 4(4), 455–480.","chicago":"Bauer, U., Herbert Edelsbrunner, Grzegorz Jablonski, and M. Mrozek. “Čech-Delaunay Gradient Flow and Homology Inference for Self-Maps.” Journal of Applied and Computational Topology. Springer Nature, 2020. https://doi.org/10.1007/s41468-020-00058-8."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"quality_controlled":"1","publisher":"Springer Nature","acknowledgement":"This research has been supported by the DFG Collaborative Research Center SFB/TRR 109 “Discretization in Geometry and Dynamics”, by Polish MNiSzW Grant No. 2621/7.PR/12/2013/2, by the Polish National Science Center under Maestro Grant No. 2014/14/A/ST1/00453 and Grant No. DEC-2013/09/N/ST6/02995. Open Access funding provided by Projekt DEAL.","page":"455-480","date_created":"2024-03-04T10:47:49Z","date_published":"2020-12-01T00:00:00Z","doi":"10.1007/s41468-020-00058-8","year":"2020","has_accepted_license":"1","publication":"Journal of Applied and Computational Topology","day":"01"},{"date_updated":"2024-03-04T10:33:15Z","department":[{"_id":"LaEr"}],"_id":"15063","article_type":"original","type":"journal_article","keyword":["General Medicine"],"status":"public","publication_status":"published","publication_identifier":{"issn":["2690-1005","2690-0998"]},"language":[{"iso":"eng"}],"ec_funded":1,"issue":"1","volume":1,"abstract":[{"text":"We consider the least singular value of a large random matrix with real or complex i.i.d. Gaussian entries shifted by a constant z∈C. We prove an optimal lower tail estimate on this singular value in the critical regime where z is around the spectral edge, thus improving the classical bound of Sankar, Spielman and Teng (SIAM J. Matrix Anal. Appl. 28:2 (2006), 446–476) for the particular shift-perturbation in the edge regime. Lacking Brézin–Hikami formulas in the real case, we rely on the superbosonization formula (Comm. Math. Phys. 283:2 (2008), 343–395).","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1908.01653"}],"scopus_import":"1","intvolume":" 1","month":"11","citation":{"ieee":"G. Cipolloni, L. Erdös, and D. J. Schröder, “Optimal lower bound on the least singular value of the shifted Ginibre ensemble,” Probability and Mathematical Physics, vol. 1, no. 1. Mathematical Sciences Publishers, pp. 101–146, 2020.","short":"G. Cipolloni, L. Erdös, D.J. Schröder, Probability and Mathematical Physics 1 (2020) 101–146.","ama":"Cipolloni G, Erdös L, Schröder DJ. Optimal lower bound on the least singular value of the shifted Ginibre ensemble. Probability and Mathematical Physics. 2020;1(1):101-146. doi:10.2140/pmp.2020.1.101","apa":"Cipolloni, G., Erdös, L., & Schröder, D. J. (2020). Optimal lower bound on the least singular value of the shifted Ginibre ensemble. Probability and Mathematical Physics. Mathematical Sciences Publishers. https://doi.org/10.2140/pmp.2020.1.101","mla":"Cipolloni, Giorgio, et al. “Optimal Lower Bound on the Least Singular Value of the Shifted Ginibre Ensemble.” Probability and Mathematical Physics, vol. 1, no. 1, Mathematical Sciences Publishers, 2020, pp. 101–46, doi:10.2140/pmp.2020.1.101.","ista":"Cipolloni G, Erdös L, Schröder DJ. 2020. Optimal lower bound on the least singular value of the shifted Ginibre ensemble. Probability and Mathematical Physics. 1(1), 101–146.","chicago":"Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “Optimal Lower Bound on the Least Singular Value of the Shifted Ginibre Ensemble.” Probability and Mathematical Physics. Mathematical Sciences Publishers, 2020. https://doi.org/10.2140/pmp.2020.1.101."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1908.01653"]},"article_processing_charge":"No","author":[{"first_name":"Giorgio","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","last_name":"Cipolloni","orcid":"0000-0002-4901-7992","full_name":"Cipolloni, Giorgio"},{"first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","orcid":"0000-0001-5366-9603","full_name":"Erdös, László"},{"orcid":"0000-0002-2904-1856","full_name":"Schröder, Dominik J","last_name":"Schröder","id":"408ED176-F248-11E8-B48F-1D18A9856A87","first_name":"Dominik J"}],"title":"Optimal lower bound on the least singular value of the shifted Ginibre ensemble","project":[{"name":"Random matrices, universality and disordered quantum systems","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"665385","name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"year":"2020","publication":"Probability and Mathematical Physics","day":"16","page":"101-146","date_created":"2024-03-04T10:27:57Z","date_published":"2020-11-16T00:00:00Z","doi":"10.2140/pmp.2020.1.101","acknowledgement":"Partially supported by ERC Advanced Grant No. 338804. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie Grant Agreement No. 66538","oa":1,"publisher":"Mathematical Sciences Publishers","quality_controlled":"1"},{"abstract":[{"text":"In this paper we present a room temperature radiometer that can eliminate the need of using cryostats in satellite payload reducing its weight and improving reliability. The proposed radiometer is based on an electro-optic upconverter that boosts up microwave photons energy by upconverting them into an optical domain what makes them immune to thermal noise even if operating at room temperature. The converter uses a high-quality factor whispering gallery\r\nmode (WGM) resonator providing naturally narrow bandwidth and therefore might be useful for applications like microwave hyperspectral sensing. The upconversion process is explained by\r\nproviding essential information about photon conversion efficiency and sensitivity. To prove the concept, we describe an experiment which shows state-of-the-art photon conversion efficiency n=10-5 per mW of pump power at the frequency of 80 GHz.","lang":"eng"}],"oa_version":"None","acknowledgement":"This work has been financially supported by Comunidad de Madrid S2018/NMT-4333 ARTINLARA-CM projects, and “FUNDACIÓN SENER” REFTA projects.","publisher":"IEEE","quality_controlled":"1","month":"07","publication_identifier":{"eisbn":["9788831299008"]},"publication_status":"published","year":"2020","day":"08","language":[{"iso":"eng"}],"publication":"14th European Conference on Antennas and Propagation","date_published":"2020-07-08T00:00:00Z","doi":"10.23919/eucap48036.2020.9135962","date_created":"2024-03-04T09:57:48Z","_id":"15059","type":"conference","conference":{"name":"EuCAP: European Conference on Antennas and Propagation","location":"Copenhagen, Denmark","end_date":"2020-03-20","start_date":"2020-03-15"},"status":"public","date_updated":"2024-03-04T10:02:49Z","citation":{"mla":"Wasiak, Michal, et al. “Compact Millimeter and Submillimeter-Wave Photonic Radiometer for Cubesats.” 14th European Conference on Antennas and Propagation, IEEE, 2020, doi:10.23919/eucap48036.2020.9135962.","short":"M. Wasiak, G.S. Botello, K.A. Abdalmalak, F. Sedlmeir, A.R. Rueda Sanchez, D. Segovia-Vargas, H.G.L. Schwefel, L.E.G. Munoz, in:, 14th European Conference on Antennas and Propagation, IEEE, 2020.","ieee":"M. Wasiak et al., “Compact millimeter and submillimeter-wave photonic radiometer for cubesats,” in 14th European Conference on Antennas and Propagation, Copenhagen, Denmark, 2020.","apa":"Wasiak, M., Botello, G. S., Abdalmalak, K. A., Sedlmeir, F., Rueda Sanchez, A. R., Segovia-Vargas, D., … Munoz, L. E. G. (2020). Compact millimeter and submillimeter-wave photonic radiometer for cubesats. In 14th European Conference on Antennas and Propagation. Copenhagen, Denmark: IEEE. https://doi.org/10.23919/eucap48036.2020.9135962","ama":"Wasiak M, Botello GS, Abdalmalak KA, et al. Compact millimeter and submillimeter-wave photonic radiometer for cubesats. In: 14th European Conference on Antennas and Propagation. IEEE; 2020. doi:10.23919/eucap48036.2020.9135962","chicago":"Wasiak, Michal, Gabriel Santamaria Botello, Kerlos Atia Abdalmalak, Florian Sedlmeir, Alfredo R Rueda Sanchez, Daniel Segovia-Vargas, Harald G. L. Schwefel, and Luis Enrique Garcia Munoz. “Compact Millimeter and Submillimeter-Wave Photonic Radiometer for Cubesats.” In 14th European Conference on Antennas and Propagation. IEEE, 2020. https://doi.org/10.23919/eucap48036.2020.9135962.","ista":"Wasiak M, Botello GS, Abdalmalak KA, Sedlmeir F, Rueda Sanchez AR, Segovia-Vargas D, Schwefel HGL, Munoz LEG. 2020. Compact millimeter and submillimeter-wave photonic radiometer for cubesats. 14th European Conference on Antennas and Propagation. EuCAP: European Conference on Antennas and Propagation."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Wasiak","full_name":"Wasiak, Michal","first_name":"Michal"},{"full_name":"Botello, Gabriel Santamaria","last_name":"Botello","first_name":"Gabriel Santamaria"},{"last_name":"Abdalmalak","full_name":"Abdalmalak, Kerlos Atia","first_name":"Kerlos Atia"},{"last_name":"Sedlmeir","full_name":"Sedlmeir, Florian","first_name":"Florian"},{"full_name":"Rueda Sanchez, Alfredo R","orcid":"0000-0001-6249-5860","last_name":"Rueda Sanchez","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","first_name":"Alfredo R"},{"last_name":"Segovia-Vargas","full_name":"Segovia-Vargas, Daniel","first_name":"Daniel"},{"last_name":"Schwefel","full_name":"Schwefel, Harald G. L.","first_name":"Harald G. L."},{"first_name":"Luis Enrique Garcia","full_name":"Munoz, Luis Enrique Garcia","last_name":"Munoz"}],"article_processing_charge":"No","department":[{"_id":"JoFi"}],"title":"Compact millimeter and submillimeter-wave photonic radiometer for cubesats"},{"article_number":"40","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. 2020. Brief announcement: Efficient load-balancing through distributed token dropping. 34th International Symposium on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol. 179, 40.","chicago":"Brandt, Sebastian, Barbara Keller, Joel Rybicki, Jukka Suomela, and Jara Uitto. “Brief Announcement: Efficient Load-Balancing through Distributed Token Dropping.” In 34th International Symposium on Distributed Computing, Vol. 179. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.DISC.2020.40.","ieee":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, and J. Uitto, “Brief announcement: Efficient load-balancing through distributed token dropping,” in 34th International Symposium on Distributed Computing, Virtual, 2020, vol. 179.","short":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, J. Uitto, in:, 34th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ama":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. Brief announcement: Efficient load-balancing through distributed token dropping. In: 34th International Symposium on Distributed Computing. Vol 179. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.DISC.2020.40","apa":"Brandt, S., Keller, B., Rybicki, J., Suomela, J., & Uitto, J. (2020). Brief announcement: Efficient load-balancing through distributed token dropping. In 34th International Symposium on Distributed Computing (Vol. 179). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2020.40","mla":"Brandt, Sebastian, et al. “Brief Announcement: Efficient Load-Balancing through Distributed Token Dropping.” 34th International Symposium on Distributed Computing, vol. 179, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.DISC.2020.40."},"title":"Brief announcement: Efficient load-balancing through distributed token dropping","author":[{"full_name":"Brandt, Sebastian","last_name":"Brandt","first_name":"Sebastian"},{"last_name":"Keller","full_name":"Keller, Barbara","first_name":"Barbara"},{"last_name":"Rybicki","full_name":"Rybicki, Joel","orcid":"0000-0002-6432-6646","first_name":"Joel","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jukka","full_name":"Suomela, Jukka","last_name":"Suomela"},{"first_name":"Jara","full_name":"Uitto, Jara","last_name":"Uitto"}],"article_processing_charge":"No","external_id":{"arxiv":["2005.07761"]},"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"day":"07","publication":"34th International Symposium on Distributed Computing","has_accepted_license":"1","year":"2020","doi":"10.4230/LIPIcs.DISC.2020.40","date_published":"2020-10-07T00:00:00Z","date_created":"2024-03-05T07:09:12Z","_id":"15074","status":"public","type":"conference","conference":{"start_date":"2020-10-12","location":"Virtual","end_date":"2020-10-16","name":"DISC: Symposium on Distributed Computing"},"tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"ddc":["000"],"date_updated":"2024-03-05T07:13:13Z","file_date_updated":"2024-03-05T07:08:27Z","department":[{"_id":"DaAl"}],"oa_version":"Published Version","abstract":[{"text":"We introduce a new graph problem, the token dropping game, and we show how to solve it efficiently in a distributed setting. We use the token dropping game as a tool to design an efficient distributed algorithm for the stable orientation problem, which is a special case of the more general locally optimal semi-matching problem. The prior work by Czygrinow et al. (DISC 2012) finds a locally optimal semi-matching in O(Δ⁵) rounds in graphs of maximum degree Δ, which directly implies an algorithm with the same runtime for stable orientations. We improve the runtime to O(Δ⁴) for stable orientations and prove a lower bound of Ω(Δ) rounds.","lang":"eng"}],"month":"10","intvolume":" 179","scopus_import":"1","alternative_title":["LIPIcs"],"file":[{"creator":"dernst","file_size":303529,"date_updated":"2024-03-05T07:08:27Z","file_name":"2020_LIPIcs_Brandt.pdf","date_created":"2024-03-05T07:08:27Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"15075","checksum":"23e2d9321aef53092dc1e24a8ab82d72"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":179,"related_material":{"record":[{"id":"9678","status":"public","relation":"later_version"}]},"license":"https://creativecommons.org/licenses/by/3.0/"},{"department":[{"_id":"DaAl"}],"file_date_updated":"2024-03-05T07:25:15Z","date_updated":"2024-03-05T07:35:53Z","ddc":["000"],"type":"conference","tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming","start_date":"2020-07-08","end_date":"2020-07-11","location":"Saarbrücken, Germany, Virtual"},"status":"public","_id":"15077","volume":168,"related_material":{"record":[{"relation":"later_version","id":"8286","status":"public"}]},"ec_funded":1,"publication_status":"published","file":[{"creator":"dernst","date_updated":"2024-03-05T07:25:15Z","file_size":782987,"date_created":"2024-03-05T07:25:15Z","file_name":"2020_LIPIcs_Alistarh.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"15078","checksum":"e5eb16199f4ccfd77a321977eb3f026f","success":1}],"language":[{"iso":"eng"}],"alternative_title":["LIPIcs"],"scopus_import":"1","month":"06","intvolume":" 168","abstract":[{"lang":"eng","text":"We consider the following dynamic load-balancing process: given an underlying graph G with n nodes, in each step t≥ 0, one unit of load is created, and placed at a randomly chosen graph node. In the same step, the chosen node picks a random neighbor, and the two nodes balance their loads by averaging them. We are interested in the expected gap between the minimum and maximum loads at nodes as the process progresses, and its dependence on n and on the graph structure. Variants of the above graphical balanced allocation process have been studied previously by Peres, Talwar, and Wieder [Peres et al., 2015], and by Sauerwald and Sun [Sauerwald and Sun, 2015]. These authors left as open the question of characterizing the gap in the case of cycle graphs in the dynamic case, where weights are created during the algorithm’s execution. For this case, the only known upper bound is of 𝒪(n log n), following from a majorization argument due to [Peres et al., 2015], which analyzes a related graphical allocation process. In this paper, we provide an upper bound of 𝒪 (√n log n) on the expected gap of the above process for cycles of length n. We introduce a new potential analysis technique, which enables us to bound the difference in load between k-hop neighbors on the cycle, for any k ≤ n/2. We complement this with a \"gap covering\" argument, which bounds the maximum value of the gap by bounding its value across all possible subsets of a certain structure, and recursively bounding the gaps within each subset. We provide analytical and experimental evidence that our upper bound on the gap is tight up to a logarithmic factor."}],"oa_version":"Published Version","author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh"},{"first_name":"Giorgi","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","full_name":"Nadiradze, Giorgi","orcid":"0000-0001-5634-0731","last_name":"Nadiradze"},{"first_name":"Amirmojtaba","id":"bcc145fd-e77f-11ea-ae8b-80d661dbff67","full_name":"Sabour, Amirmojtaba","last_name":"Sabour"}],"external_id":{"arxiv":["2003.09297"]},"article_processing_charge":"No","title":"Dynamic averaging load balancing on cycles","citation":{"mla":"Alistarh, Dan-Adrian, et al. “Dynamic Averaging Load Balancing on Cycles.” 47th International Colloquium on Automata, Languages, and Programming, vol. 168, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.ICALP.2020.7.","ieee":"D.-A. Alistarh, G. Nadiradze, and A. Sabour, “Dynamic averaging load balancing on cycles,” in 47th International Colloquium on Automata, Languages, and Programming, Saarbrücken, Germany, Virtual, 2020, vol. 168.","short":"D.-A. Alistarh, G. Nadiradze, A. Sabour, in:, 47th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ama":"Alistarh D-A, Nadiradze G, Sabour A. Dynamic averaging load balancing on cycles. In: 47th International Colloquium on Automata, Languages, and Programming. Vol 168. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.ICALP.2020.7","apa":"Alistarh, D.-A., Nadiradze, G., & Sabour, A. (2020). Dynamic averaging load balancing on cycles. In 47th International Colloquium on Automata, Languages, and Programming (Vol. 168). Saarbrücken, Germany, Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2020.7","chicago":"Alistarh, Dan-Adrian, Giorgi Nadiradze, and Amirmojtaba Sabour. “Dynamic Averaging Load Balancing on Cycles.” In 47th International Colloquium on Automata, Languages, and Programming, Vol. 168. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.ICALP.2020.7.","ista":"Alistarh D-A, Nadiradze G, Sabour A. 2020. Dynamic averaging load balancing on cycles. 47th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 168, 7."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"article_number":"7","date_published":"2020-06-29T00:00:00Z","doi":"10.4230/LIPIcs.ICALP.2020.7","date_created":"2024-03-05T07:25:37Z","has_accepted_license":"1","year":"2020","day":"29","publication":"47th International Colloquium on Automata, Languages, and Programming","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"acknowledgement":"The authors sincerely thank Thomas Sauerwald and George Giakkoupis for insightful discussions, and Mohsen Ghaffari, Yuval Peres, and Udi Wieder for feedback on earlier\r\nversions of this draft. We also thank the ICALP anonymous reviewers for their very useful comments.\r\nFunding: European Research Council funding award PR1042ERC01"},{"article_processing_charge":"No","author":[{"full_name":"Aichholzer, Oswin","last_name":"Aichholzer","first_name":"Oswin"},{"first_name":"Julia","full_name":"Obmann, Julia","last_name":"Obmann"},{"last_name":"Patak","full_name":"Patak, Pavel","first_name":"Pavel","id":"B593B804-1035-11EA-B4F1-947645A5BB83"},{"full_name":"Perz, Daniel","last_name":"Perz","first_name":"Daniel"},{"last_name":"Tkadlec","full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef"}],"title":"Disjoint tree-compatible plane perfect matchings","department":[{"_id":"KrCh"},{"_id":"UlWa"}],"citation":{"chicago":"Aichholzer, Oswin, Julia Obmann, Pavel Patak, Daniel Perz, and Josef Tkadlec. “Disjoint Tree-Compatible Plane Perfect Matchings.” In 36th European Workshop on Computational Geometry, 2020.","ista":"Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. 2020. Disjoint tree-compatible plane perfect matchings. 36th European Workshop on Computational Geometry. EuroCG: European Workshop on Computational Geometry, 56.","mla":"Aichholzer, Oswin, et al. “Disjoint Tree-Compatible Plane Perfect Matchings.” 36th European Workshop on Computational Geometry, 56, 2020.","apa":"Aichholzer, O., Obmann, J., Patak, P., Perz, D., & Tkadlec, J. (2020). Disjoint tree-compatible plane perfect matchings. In 36th European Workshop on Computational Geometry. Würzburg, Germany, Virtual.","ama":"Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. Disjoint tree-compatible plane perfect matchings. In: 36th European Workshop on Computational Geometry. ; 2020.","ieee":"O. Aichholzer, J. Obmann, P. Patak, D. Perz, and J. Tkadlec, “Disjoint tree-compatible plane perfect matchings,” in 36th European Workshop on Computational Geometry, Würzburg, Germany, Virtual, 2020.","short":"O. Aichholzer, J. Obmann, P. Patak, D. Perz, J. Tkadlec, in:, 36th European Workshop on Computational Geometry, 2020."},"date_updated":"2024-03-05T09:00:07Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Würzburg, Germany, Virtual","end_date":"2020-03-18","start_date":"2020-03-16","name":"EuroCG: European Workshop on Computational Geometry"},"type":"conference","status":"public","_id":"15082","article_number":"56","date_created":"2024-03-05T08:57:17Z","date_published":"2020-04-01T00:00:00Z","year":"2020","publication_status":"published","language":[{"iso":"eng"}],"publication":"36th European Workshop on Computational Geometry","day":"01","oa":1,"main_file_link":[{"open_access":"1","url":"https://www1.pub.informatik.uni-wuerzburg.de/eurocg2020/data/uploads/papers/eurocg20_paper_56.pdf"}],"quality_controlled":"1","month":"04","abstract":[{"lang":"eng","text":"Two plane drawings of geometric graphs on the same set of points are called disjoint compatible if their union is plane and they do not have an edge in common. For a given set S of 2n points two plane drawings of perfect matchings M1 and M2 (which do not need to be disjoint nor compatible) are disjoint tree-compatible if there exists a plane drawing of a spanning tree T on S which is disjoint compatible to both M1 and M2.\r\nWe show that the graph of all disjoint tree-compatible perfect geometric matchings on 2n points in convex position is connected if and only if 2n ≥ 10. Moreover, in that case the diameter\r\nof this graph is either 4 or 5, independent of n."}],"acknowledgement":"Research on this work was initiated at the 6th Austrian-Japanese-Mexican-Spanish Workshop on Discrete Geometry and continued during the 16th European Geometric Graph-Week, both held near Strobl, Austria. We are grateful to the participants for the inspiring atmosphere. We especially thank Alexander Pilz for bringing this class of problems to our attention and Birgit Vogtenhuber for inspiring discussions. D.P. is partially supported by the FWF grant I 3340-N35 (Collaborative DACH project Arrangements and Drawings). The research stay of P.P. at IST Austria is funded by the project CZ.02.2.69/0.0/0.0/17_050/0008466 Improvement of internationalization in the field of research and development at Charles University, through the support of quality projects MSCA-IF. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 734922.","oa_version":"Published Version"},{"year":"2020","isi":1,"publication":"Annals of Statistics","day":"11","page":"3619-3642","date_created":"2019-07-31T09:39:42Z","date_published":"2020-12-11T00:00:00Z","doi":"10.1214/20-AOS1945","oa":1,"quality_controlled":"1","publisher":"Institute of Mathematical Statistics","citation":{"ieee":"A. Javanmard, M. Mondelli, and A. Montanari, “Analysis of a two-layer neural network via displacement convexity,” Annals of Statistics, vol. 48, no. 6. Institute of Mathematical Statistics, pp. 3619–3642, 2020.","short":"A. Javanmard, M. Mondelli, A. Montanari, Annals of Statistics 48 (2020) 3619–3642.","apa":"Javanmard, A., Mondelli, M., & Montanari, A. (2020). Analysis of a two-layer neural network via displacement convexity. Annals of Statistics. Institute of Mathematical Statistics. https://doi.org/10.1214/20-AOS1945","ama":"Javanmard A, Mondelli M, Montanari A. Analysis of a two-layer neural network via displacement convexity. Annals of Statistics. 2020;48(6):3619-3642. doi:10.1214/20-AOS1945","mla":"Javanmard, Adel, et al. “Analysis of a Two-Layer Neural Network via Displacement Convexity.” Annals of Statistics, vol. 48, no. 6, Institute of Mathematical Statistics, 2020, pp. 3619–42, doi:10.1214/20-AOS1945.","ista":"Javanmard A, Mondelli M, Montanari A. 2020. Analysis of a two-layer neural network via displacement convexity. Annals of Statistics. 48(6), 3619–3642.","chicago":"Javanmard, Adel, Marco Mondelli, and Andrea Montanari. “Analysis of a Two-Layer Neural Network via Displacement Convexity.” Annals of Statistics. Institute of Mathematical Statistics, 2020. https://doi.org/10.1214/20-AOS1945."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"isi":["000598369200021"],"arxiv":["1901.01375"]},"article_processing_charge":"No","author":[{"last_name":"Javanmard","full_name":"Javanmard, Adel","first_name":"Adel"},{"last_name":"Mondelli","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425"},{"first_name":"Andrea","full_name":"Montanari, Andrea","last_name":"Montanari"}],"title":"Analysis of a two-layer neural network via displacement convexity","publication_status":"published","publication_identifier":{"issn":["1932-6157"],"eissn":["1941-7330"]},"language":[{"iso":"eng"}],"issue":"6","volume":48,"abstract":[{"text":"Fitting a function by using linear combinations of a large number N of `simple' components is one of the most fruitful ideas in statistical learning. This idea lies at the core of a variety of methods, from two-layer neural networks to kernel regression, to boosting. In general, the resulting risk minimization problem is non-convex and is solved by gradient descent or its variants. Unfortunately, little is known about global convergence properties of these approaches.\r\nHere we consider the problem of learning a concave function f on a compact convex domain Ω⊆ℝd, using linear combinations of `bump-like' components (neurons). The parameters to be fitted are the centers of N bumps, and the resulting empirical risk minimization problem is highly non-convex. We prove that, in the limit in which the number of neurons diverges, the evolution of gradient descent converges to a Wasserstein gradient flow in the space of probability distributions over Ω. Further, when the bump width δ tends to 0, this gradient flow has a limit which is a viscous porous medium equation. Remarkably, the cost function optimized by this gradient flow exhibits a special property known as displacement convexity, which implies exponential convergence rates for N→∞, δ→0. Surprisingly, this asymptotic theory appears to capture well the behavior for moderate values of δ,N. Explaining this phenomenon, and understanding the dependence on δ,N in a quantitative manner remains an outstanding challenge.","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1901.01375"}],"intvolume":" 48","month":"12","date_updated":"2024-03-06T08:28:50Z","department":[{"_id":"MaMo"}],"_id":"6748","type":"journal_article","article_type":"original","status":"public"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-03-11T09:20:34Z","citation":{"ista":"Anderson L, Hausel T, Mazzeo R, Schaposnik L. 2020. Geometry and physics of Higgs bundles. Oberwolfach Reports. 16(2), 1357–1417.","chicago":"Anderson, Lara, Tamás Hausel, Rafe Mazzeo, and Laura Schaposnik. “Geometry and Physics of Higgs Bundles.” Oberwolfach Reports. European Mathematical Society, 2020. https://doi.org/10.4171/owr/2019/23.","short":"L. Anderson, T. Hausel, R. Mazzeo, L. Schaposnik, Oberwolfach Reports 16 (2020) 1357–1417.","ieee":"L. Anderson, T. Hausel, R. Mazzeo, and L. Schaposnik, “Geometry and physics of Higgs bundles,” Oberwolfach Reports, vol. 16, no. 2. European Mathematical Society, pp. 1357–1417, 2020.","apa":"Anderson, L., Hausel, T., Mazzeo, R., & Schaposnik, L. (2020). Geometry and physics of Higgs bundles. Oberwolfach Reports. European Mathematical Society. https://doi.org/10.4171/owr/2019/23","ama":"Anderson L, Hausel T, Mazzeo R, Schaposnik L. Geometry and physics of Higgs bundles. Oberwolfach Reports. 2020;16(2):1357-1417. doi:10.4171/owr/2019/23","mla":"Anderson, Lara, et al. “Geometry and Physics of Higgs Bundles.” Oberwolfach Reports, vol. 16, no. 2, European Mathematical Society, 2020, pp. 1357–417, doi:10.4171/owr/2019/23."},"title":"Geometry and physics of Higgs bundles","department":[{"_id":"TaHa"}],"author":[{"first_name":"Lara","last_name":"Anderson","full_name":"Anderson, Lara"},{"first_name":"Tamás","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","full_name":"Hausel, Tamás","last_name":"Hausel"},{"last_name":"Mazzeo","full_name":"Mazzeo, Rafe","first_name":"Rafe"},{"last_name":"Schaposnik","full_name":"Schaposnik, Laura","first_name":"Laura"}],"article_processing_charge":"No","_id":"15070","status":"public","keyword":["Organic Chemistry","Biochemistry"],"type":"journal_article","article_type":"original","day":"04","publication":"Oberwolfach Reports","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1660-8933"]},"publication_status":"published","year":"2020","issue":"2","date_published":"2020-06-04T00:00:00Z","doi":"10.4171/owr/2019/23","volume":16,"date_created":"2024-03-04T11:36:31Z","page":"1357-1417","oa_version":"None","abstract":[{"text":"This workshop focused on interactions between the various perspectives on the moduli space of Higgs bundles over a Riemann surface. This subject draws on algebraic geometry, geometric topology, geometric analysis and mathematical physics, and the goal was to promote interactions between these various branches of the subject. The main current directions of research were well represented by the participants, and the talks included many from both senior and junior participants.","lang":"eng"}],"month":"06","intvolume":" 16","quality_controlled":"1","publisher":"European Mathematical Society"}]