[{"extern":"1","date_updated":"2022-07-19T09:37:20Z","status":"public","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: high-redshift / galaxies: star formation / galaxies: statistics / galaxies: evolution / galaxies: formation / galaxies: ISM"],"type":"journal_article","article_type":"original","_id":"11507","volume":623,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0004-6361"],"eissn":["1432-0746"]},"publication_status":"published","month":"03","intvolume":" 623","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1803.08923","open_access":"1"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Lyman-α (Lyα) is intrinsically the brightest line emitted from active galaxies. While it originates from many physical processes, for star-forming galaxies the intrinsic Lyα luminosity is a direct tracer of the Lyman-continuum (LyC) radiation produced by the most massive O- and early-type B-stars (M⋆ ≳ 10 M⊙) with lifetimes of a few Myrs. As such, Lyα luminosity should be an excellent instantaneous star formation rate (SFR) indicator. However, its resonant nature and susceptibility to dust as a rest-frame UV photon makes Lyα very hard to interpret due to the uncertain Lyα escape fraction, fesc, Lyα. Here we explore results from the CAlibrating LYMan-α with Hα (CALYMHA) survey at z = 2.2, follow-up of Lyα emitters (LAEs) at z = 2.2 − 2.6 and a z ∼ 0−0.3 compilation of LAEs to directly measure fesc, Lyα with Hα. We derive a simple empirical relation that robustly retrieves fesc, Lyα as a function of Lyα rest-frame EW (EW0): fesc,Lyα = 0.0048 EW0[Å] ± 0.05 and we show that it constrains a well-defined anti-correlation between ionisation efficiency (ξion) and dust extinction in LAEs. Observed Lyα luminosities and EW0 are easy measurable quantities at high redshift, thus making our relation a practical tool to estimate intrinsic Lyα and LyC luminosities under well controlled and simple assumptions. Our results allow observed Lyα luminosities to be used to compute SFRs for LAEs at z ∼ 0−2.6 within ±0.2 dex of the Hα dust corrected SFRs. We apply our empirical SFR(Lyα,EW0) calibration to several sources at z ≥ 2.6 to find that star-forming LAEs have SFRs typically ranging from 0.1 to 20 M⊙ yr−1 and that our calibration might be even applicable for the most luminous LAEs within the epoch of re-ionisation. Our results imply high ionisation efficiencies (log10[ξion/Hz erg−1] = 25.4−25.6) and low dust content in LAEs across cosmic time, and will be easily tested with future observations with JWST which can obtain Hα and Hβ measurements for high-redshift LAEs."}],"title":"Predicting Lyα escape fractions with a simple observable: Lyα in emission as an empirically calibrated star formation rate indicator","author":[{"first_name":"David","full_name":"Sobral, David","last_name":"Sobral"},{"first_name":"Jorryt J","id":"7439a258-f3c0-11ec-9501-9df22fe06720","last_name":"Matthee","orcid":"0000-0003-2871-127X","full_name":"Matthee, Jorryt J"}],"article_processing_charge":"No","external_id":{"arxiv":["1803.08923"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Sobral D, Matthee JJ. 2019. Predicting Lyα escape fractions with a simple observable: Lyα in emission as an empirically calibrated star formation rate indicator. Astronomy & Astrophysics. 623, A157.","chicago":"Sobral, David, and Jorryt J Matthee. “Predicting Lyα Escape Fractions with a Simple Observable: Lyα in Emission as an Empirically Calibrated Star Formation Rate Indicator.” Astronomy & Astrophysics. EDP Sciences, 2019. https://doi.org/10.1051/0004-6361/201833075.","short":"D. Sobral, J.J. Matthee, Astronomy & Astrophysics 623 (2019).","ieee":"D. Sobral and J. J. Matthee, “Predicting Lyα escape fractions with a simple observable: Lyα in emission as an empirically calibrated star formation rate indicator,” Astronomy & Astrophysics, vol. 623. EDP Sciences, 2019.","apa":"Sobral, D., & Matthee, J. J. (2019). Predicting Lyα escape fractions with a simple observable: Lyα in emission as an empirically calibrated star formation rate indicator. Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/201833075","ama":"Sobral D, Matthee JJ. Predicting Lyα escape fractions with a simple observable: Lyα in emission as an empirically calibrated star formation rate indicator. Astronomy & Astrophysics. 2019;623. doi:10.1051/0004-6361/201833075","mla":"Sobral, David, and Jorryt J. Matthee. “Predicting Lyα Escape Fractions with a Simple Observable: Lyα in Emission as an Empirically Calibrated Star Formation Rate Indicator.” Astronomy & Astrophysics, vol. 623, A157, EDP Sciences, 2019, doi:10.1051/0004-6361/201833075."},"article_number":"A157","doi":"10.1051/0004-6361/201833075","date_published":"2019-03-26T00:00:00Z","date_created":"2022-07-06T11:08:16Z","day":"26","publication":"Astronomy & Astrophysics","year":"2019","quality_controlled":"1","publisher":"EDP Sciences","oa":1,"acknowledgement":"We thank the anonymous referees for multiple comments and suggestions which have improved the manuscript. JM acknowledges the support of a Huygens PhD fellowship from Leiden University. We have benefited greatly from the publicly available programming language PYTHON, including the NUMPY & SCIPY (Van Der Walt et al. 2011; Jones et al. 2001), MATPLOTLIB (Hunter 2007) and ASTROPY (Astropy Collaboration 2013) packages, and the TOPCAT analysis program (Taylor 2013). The results and samples of LAEs used for this paper are publicly available (see e.g. Sobral et al. 2017, 2018a) and we also provide the toy model used as a PYTHON script."},{"publication_status":"published","publication_identifier":{"eissn":["1538-4357"],"issn":["0004-637X"]},"language":[{"iso":"eng"}],"issue":"2","volume":882,"abstract":[{"lang":"eng","text":"We discuss the nature and physical properties of gas-mass selected galaxies in the ALMA spectroscopic survey (ASPECS) of the Hubble Ultra Deep Field (HUDF). We capitalize on the deep optical integral-field spectroscopy from the Multi Unit Spectroscopic Explorer (MUSE) HUDF Survey and multiwavelength data to uniquely associate all 16 line emitters, detected in the ALMA data without preselection, with rotational transitions of carbon monoxide (CO). We identify 10 as CO(2–1) at 1 < z < 2, 5 as CO(3–2) at 2 < z < 3, and 1 as CO(4–3) at z = 3.6. Using the MUSE data as a prior, we identify two additional CO(2–1) emitters, increasing the total sample size to 18. We infer metallicities consistent with (super-)solar for the CO-detected galaxies at z ≤ 1.5, motivating our choice of a Galactic conversion factor between CO luminosity and molecular gas mass for these galaxies. Using deep Chandra imaging of the HUDF, we determine an X-ray AGN fraction of 20% and 60% among the CO emitters at z ∼ 1.4 and z ∼ 2.6, respectively. Being a CO-flux-limited survey, ASPECS-LP detects molecular gas in galaxies on, above, and below the main sequence (MS) at z ∼ 1.4. For stellar masses ≥1010 (1010.5) ${M}_{\\odot }$, we detect about 40% (50%) of all galaxies in the HUDF at 1 < z < 2 (2 < z < 3). The combination of ALMA and MUSE integral-field spectroscopy thus enables an unprecedented view of MS galaxies during the peak of galaxy formation."}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1903.09167"}],"scopus_import":"1","intvolume":" 882","month":"09","date_updated":"2022-07-19T09:50:55Z","extern":"1","_id":"11514","type":"journal_article","article_type":"original","keyword":["Space and Planetary Science","Astronomy and Astrophysics"],"status":"public","year":"2019","publication":"The Astrophysical Journal","day":"11","date_created":"2022-07-06T13:31:35Z","doi":"10.3847/1538-4357/ab3102","date_published":"2019-09-11T00:00:00Z","acknowledgement":"We are grateful to the referee for providing a constructive report. L.A.B. wants to thank Madusha L.P. Gunawardhana for her help with platefit. Based on observations collected at the European Southern Observatory under ESO programme(s): 094.A-2089(B), 095.A-0010(A), 096.A-0045(A), and 096.A-0045(B). This paper makes use of the following ALMA data: ADS/JAO.ALMA#2016.1.00324.L. ALMA is a partnership of ESO (representing its member states), NSF (USA) and NINS (Japan), together with NRC (Canada), NSC and ASIAA (Taiwan), and KASI (Republic of Korea), in cooperation with the Republic of Chile. The Joint ALMA Observatory is operated by ESO, AUI/NRAO, and NAOJ. The National Radio Astronomy Observatory is a facility of the National Science Foundation operated under cooperative agreement by Associated Universities, Inc.\r\n\r\n\"Este trabajo contó con el apoyo de CONICYT+Programa de Astronomía+ Fondo CHINA-CONICYT\" J.G-L. acknowledges partial support from ALMA-CONICYT project 31160033. F.E.B. acknowledges support from CONICYT grant Basal AFB-170002 (FEB), and the Ministry of Economy, Development, and Tourism's Millennium Science Initiative through grant IC120009, awarded to The Millennium Institute of Astrophysics, MAS (FEB). J.B. acknowledges support by Fundação para a Ciência e a Tecnologia (FCT) through national funds (UID/FIS/04434/2013) and Investigador FCT contract IF/01654/2014/CP1215/CT0003., and by FEDER through COMPETE2020 (POCI-01-0145-FEDER-007672). T.D-S. acknowledges support from ALMA-CONYCIT project 31130005 and FONDECYT project 1151239. J.H. acknowledges support of the VIDI research programme with project number 639.042.611, which is (partly) financed by the Netherlands Organization for Scientific Research (NWO). D.R. acknowledges support from the National Science Foundation under grant No. AST-1614213. I.R.S. acknowledges support from the ERC Advanced Grant DUSTYGAL (321334) and STFC (ST/P000541/1)\r\n\r\nWork on Gnuastro has been funded by the Japanese MEXT scholarship and its Grant-in-Aid for Scientific Research (21244012, 24253003), the ERC advanced grant 339659-MUSICOS, European Union's Horizon 2020 research and innovation programme under Marie Sklodowska-Curie grant agreement No. 721463 to the SUNDIAL ITN, and from the Spanish MINECO under grant No. AYA2016-76219-P.","oa":1,"quality_controlled":"1","publisher":"IOP Publishing","citation":{"short":"L.A. Boogaard, R. Decarli, J. González-López, P. van der Werf, F. Walter, R. Bouwens, M. Aravena, C. Carilli, F.E. Bauer, J. Brinchmann, T. Contini, P. Cox, E. da Cunha, E. Daddi, T. Díaz-Santos, J. Hodge, H. Inami, R. Ivison, M. Maseda, J.J. Matthee, P. Oesch, G. Popping, D. Riechers, J. Schaye, S. Schouws, I. Smail, A. Weiss, L. Wisotzki, R. Bacon, P.C. Cortes, H.-W. Rix, R.S. Somerville, M. Swinbank, J. Wagg, The Astrophysical Journal 882 (2019).","ieee":"L. A. Boogaard et al., “The ALMA spectroscopic survey in the HUDF: Nature and physical properties of gas-mass selected galaxies using MUSE spectroscopy,” The Astrophysical Journal, vol. 882, no. 2. IOP Publishing, 2019.","ama":"Boogaard LA, Decarli R, González-López J, et al. The ALMA spectroscopic survey in the HUDF: Nature and physical properties of gas-mass selected galaxies using MUSE spectroscopy. The Astrophysical Journal. 2019;882(2). doi:10.3847/1538-4357/ab3102","apa":"Boogaard, L. A., Decarli, R., González-López, J., van der Werf, P., Walter, F., Bouwens, R., … Wagg, J. (2019). The ALMA spectroscopic survey in the HUDF: Nature and physical properties of gas-mass selected galaxies using MUSE spectroscopy. The Astrophysical Journal. IOP Publishing. https://doi.org/10.3847/1538-4357/ab3102","mla":"Boogaard, Leindert A., et al. “The ALMA Spectroscopic Survey in the HUDF: Nature and Physical Properties of Gas-Mass Selected Galaxies Using MUSE Spectroscopy.” The Astrophysical Journal, vol. 882, no. 2, 140, IOP Publishing, 2019, doi:10.3847/1538-4357/ab3102.","ista":"Boogaard LA, Decarli R, González-López J, van der Werf P, Walter F, Bouwens R, Aravena M, Carilli C, Bauer FE, Brinchmann J, Contini T, Cox P, da Cunha E, Daddi E, Díaz-Santos T, Hodge J, Inami H, Ivison R, Maseda M, Matthee JJ, Oesch P, Popping G, Riechers D, Schaye J, Schouws S, Smail I, Weiss A, Wisotzki L, Bacon R, Cortes PC, Rix H-W, Somerville RS, Swinbank M, Wagg J. 2019. The ALMA spectroscopic survey in the HUDF: Nature and physical properties of gas-mass selected galaxies using MUSE spectroscopy. The Astrophysical Journal. 882(2), 140.","chicago":"Boogaard, Leindert A., Roberto Decarli, Jorge González-López, Paul van der Werf, Fabian Walter, Rychard Bouwens, Manuel Aravena, et al. “The ALMA Spectroscopic Survey in the HUDF: Nature and Physical Properties of Gas-Mass Selected Galaxies Using MUSE Spectroscopy.” The Astrophysical Journal. IOP Publishing, 2019. https://doi.org/10.3847/1538-4357/ab3102."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","external_id":{"arxiv":["1903.09167"]},"author":[{"first_name":"Leindert A.","full_name":"Boogaard, Leindert A.","last_name":"Boogaard"},{"first_name":"Roberto","full_name":"Decarli, Roberto","last_name":"Decarli"},{"first_name":"Jorge","last_name":"González-López","full_name":"González-López, Jorge"},{"first_name":"Paul","last_name":"van der Werf","full_name":"van der Werf, Paul"},{"full_name":"Walter, Fabian","last_name":"Walter","first_name":"Fabian"},{"full_name":"Bouwens, Rychard","last_name":"Bouwens","first_name":"Rychard"},{"first_name":"Manuel","full_name":"Aravena, Manuel","last_name":"Aravena"},{"first_name":"Chris","last_name":"Carilli","full_name":"Carilli, Chris"},{"full_name":"Bauer, Franz Erik","last_name":"Bauer","first_name":"Franz Erik"},{"first_name":"Jarle","full_name":"Brinchmann, Jarle","last_name":"Brinchmann"},{"last_name":"Contini","full_name":"Contini, Thierry","first_name":"Thierry"},{"full_name":"Cox, Pierre","last_name":"Cox","first_name":"Pierre"},{"first_name":"Elisabete","last_name":"da Cunha","full_name":"da Cunha, Elisabete"},{"full_name":"Daddi, Emanuele","last_name":"Daddi","first_name":"Emanuele"},{"last_name":"Díaz-Santos","full_name":"Díaz-Santos, Tanio","first_name":"Tanio"},{"first_name":"Jacqueline","full_name":"Hodge, Jacqueline","last_name":"Hodge"},{"first_name":"Hanae","last_name":"Inami","full_name":"Inami, Hanae"},{"last_name":"Ivison","full_name":"Ivison, Rob","first_name":"Rob"},{"first_name":"Michael","full_name":"Maseda, Michael","last_name":"Maseda"},{"first_name":"Jorryt J","id":"7439a258-f3c0-11ec-9501-9df22fe06720","last_name":"Matthee","orcid":"0000-0003-2871-127X","full_name":"Matthee, Jorryt J"},{"full_name":"Oesch, Pascal","last_name":"Oesch","first_name":"Pascal"},{"full_name":"Popping, Gergö","last_name":"Popping","first_name":"Gergö"},{"first_name":"Dominik","full_name":"Riechers, Dominik","last_name":"Riechers"},{"first_name":"Joop","full_name":"Schaye, Joop","last_name":"Schaye"},{"full_name":"Schouws, Sander","last_name":"Schouws","first_name":"Sander"},{"first_name":"Ian","full_name":"Smail, Ian","last_name":"Smail"},{"first_name":"Axel","full_name":"Weiss, Axel","last_name":"Weiss"},{"last_name":"Wisotzki","full_name":"Wisotzki, Lutz","first_name":"Lutz"},{"last_name":"Bacon","full_name":"Bacon, Roland","first_name":"Roland"},{"first_name":"Paulo C.","full_name":"Cortes, Paulo C.","last_name":"Cortes"},{"first_name":"Hans-Walter","last_name":"Rix","full_name":"Rix, Hans-Walter"},{"last_name":"Somerville","full_name":"Somerville, Rachel S.","first_name":"Rachel S."},{"first_name":"Mark","full_name":"Swinbank, Mark","last_name":"Swinbank"},{"first_name":"Jeff","full_name":"Wagg, Jeff","last_name":"Wagg"}],"title":"The ALMA spectroscopic survey in the HUDF: Nature and physical properties of gas-mass selected galaxies using MUSE spectroscopy","article_number":"140"},{"date_updated":"2022-08-18T10:20:18Z","extern":"1","_id":"11516","type":"journal_article","article_type":"original","status":"public","keyword":["Space and Planetary Science","Astronomy and Astrophysics"],"publication_identifier":{"eissn":["1538-4357"],"issn":["0004-637X"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":880,"issue":"1","abstract":[{"text":"The well-known quasar SDSS J095253.83+011421.9 (J0952+0114) at z = 3.02 has one of the most peculiar spectra discovered so far, showing the presence of narrow Lyα and broad metal emission lines. Although recent studies have suggested that a proximate damped Lyα absorption (PDLA) system causes this peculiar spectrum, the origin of the gas associated with the PDLA is unknown. Here we report the results of observations with the Multi Unit Spectroscopic Explorer (MUSE) that reveal a new giant (≈100 physical kpc) Lyα nebula. The detailed analysis of the Lyα velocity, velocity dispersion, and surface brightness profiles suggests that the J0952+0114 Lyα nebula shares similar properties with other QSO nebulae previously detected with MUSE, implying that the PDLA in J0952+0144 is covering only a small fraction of the solid angle of the QSO emission. We also detected bright and spectrally narrow C iv λ1550 and He ii λ1640 extended emission around J0952+0114 with velocity centroids similar to the peak of the extended and central narrow Lyα emission. The presence of a peculiarly bright, unresolved, and relatively broad He ii λ1640 emission in the central region at exactly the same PDLA redshift hints at the possibility that the PDLA originates in a clumpy outflow with a bulk velocity of about 500 km s−1. The smaller velocity dispersion of the large-scale Lyα emission suggests that the high-speed outflow is confined to the central region. Lastly, the derived spatially resolved He ii/Lyα and C iv/Lyα maps show a positive gradient with the distance to the QSO, hinting at a non-homogeneous distribution of the ionization parameter.","lang":"eng"}],"oa_version":"Preprint","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1906.06347","open_access":"1"}],"month":"07","intvolume":" 880","citation":{"ama":"Marino RA, Cantalupo S, Pezzulli G, et al. A giant Lyα nebula and a small-scale clumpy outflow in the system of the exotic quasar J0952+0114 unveiled by MUSE. The Astrophysical Journal. 2019;880(1). doi:10.3847/1538-4357/ab2881","apa":"Marino, R. A., Cantalupo, S., Pezzulli, G., Lilly, S. J., Gallego, S., Mackenzie, R., … Nanayakkara, T. (2019). A giant Lyα nebula and a small-scale clumpy outflow in the system of the exotic quasar J0952+0114 unveiled by MUSE. The Astrophysical Journal. IOP Publishing. https://doi.org/10.3847/1538-4357/ab2881","ieee":"R. A. Marino et al., “A giant Lyα nebula and a small-scale clumpy outflow in the system of the exotic quasar J0952+0114 unveiled by MUSE,” The Astrophysical Journal, vol. 880, no. 1. IOP Publishing, 2019.","short":"R.A. Marino, S. Cantalupo, G. Pezzulli, S.J. Lilly, S. Gallego, R. Mackenzie, J.J. Matthee, J. Brinchmann, N. Bouché, A. Feltre, S. Muzahid, I. Schroetter, S.D. Johnson, T. Nanayakkara, The Astrophysical Journal 880 (2019).","mla":"Marino, Raffaella Anna, et al. “A Giant Lyα Nebula and a Small-Scale Clumpy Outflow in the System of the Exotic Quasar J0952+0114 Unveiled by MUSE.” The Astrophysical Journal, vol. 880, no. 1, 47, IOP Publishing, 2019, doi:10.3847/1538-4357/ab2881.","ista":"Marino RA, Cantalupo S, Pezzulli G, Lilly SJ, Gallego S, Mackenzie R, Matthee JJ, Brinchmann J, Bouché N, Feltre A, Muzahid S, Schroetter I, Johnson SD, Nanayakkara T. 2019. A giant Lyα nebula and a small-scale clumpy outflow in the system of the exotic quasar J0952+0114 unveiled by MUSE. The Astrophysical Journal. 880(1), 47.","chicago":"Marino, Raffaella Anna, Sebastiano Cantalupo, Gabriele Pezzulli, Simon J. Lilly, Sofia Gallego, Ruari Mackenzie, Jorryt J Matthee, et al. “A Giant Lyα Nebula and a Small-Scale Clumpy Outflow in the System of the Exotic Quasar J0952+0114 Unveiled by MUSE.” The Astrophysical Journal. IOP Publishing, 2019. https://doi.org/10.3847/1538-4357/ab2881."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Raffaella Anna","last_name":"Marino","full_name":"Marino, Raffaella Anna"},{"first_name":"Sebastiano","last_name":"Cantalupo","full_name":"Cantalupo, Sebastiano"},{"first_name":"Gabriele","full_name":"Pezzulli, Gabriele","last_name":"Pezzulli"},{"first_name":"Simon J.","last_name":"Lilly","full_name":"Lilly, Simon J."},{"full_name":"Gallego, Sofia","last_name":"Gallego","first_name":"Sofia"},{"last_name":"Mackenzie","full_name":"Mackenzie, Ruari","first_name":"Ruari"},{"orcid":"0000-0003-2871-127X","full_name":"Matthee, Jorryt J","last_name":"Matthee","id":"7439a258-f3c0-11ec-9501-9df22fe06720","first_name":"Jorryt J"},{"first_name":"Jarle","last_name":"Brinchmann","full_name":"Brinchmann, Jarle"},{"first_name":"Nicolas","last_name":"Bouché","full_name":"Bouché, Nicolas"},{"last_name":"Feltre","full_name":"Feltre, Anna","first_name":"Anna"},{"full_name":"Muzahid, Sowgat","last_name":"Muzahid","first_name":"Sowgat"},{"first_name":"Ilane","full_name":"Schroetter, Ilane","last_name":"Schroetter"},{"first_name":"Sean D.","full_name":"Johnson, Sean D.","last_name":"Johnson"},{"last_name":"Nanayakkara","full_name":"Nanayakkara, Themiya","first_name":"Themiya"}],"external_id":{"arxiv":["1906.06347"]},"article_processing_charge":"No","title":"A giant Lyα nebula and a small-scale clumpy outflow in the system of the exotic quasar J0952+0114 unveiled by MUSE","article_number":"47","year":"2019","day":"24","publication":"The Astrophysical Journal","date_published":"2019-07-24T00:00:00Z","doi":"10.3847/1538-4357/ab2881","date_created":"2022-07-06T13:50:33Z","acknowledgement":"We thank Lutz Wisotzki for stimulating discussions. This work is based on observations taken at ESO/VLT in Paranal and we would like to thank the ESO staff for their assistance and support during the MUSE GTO campaigns. This work was supported by the Swiss National Science Foundation. This research made use of Astropy, a community-developed core PYTHON package for astronomy (Astropy Collaboration et al. 2013), NumPy and SciPy (Oliphant 2007), Matplotlib (Hunter 2007), IPython (Perez & Granger 2007), and of the NASA Astrophysics Data System Bibliographic Services. S.C. and G.P. gratefully acknowledge support from Swiss National Science Foundation grant PP00P2−163824. A.F. acknowledges support from the ERC via Advanced Grant under grants agreement no. 339659-MUSICOS. J.B. acknowledges support by FCT/MCTES through national funds by grant UID/FIS/04434/2019 and through Investigador FCT Contract No. IF/01654/2014/CP1215/CT0003. S.D.J. is supported by a NASA Hubble Fellowship (HST-HF2-51375.001-A). T.N. acknowledges the Nederlandse Organisatie voor Wetenschappelijk Onderzoek (NWO) top grant TOP1.16.057.","publisher":"IOP Publishing","quality_controlled":"1","oa":1},{"citation":{"chicago":"Matthee, Jorryt J, D. Sobral, L. A. Boogaard, H. Röttgering, L. Vallini, A. Ferrara, A. Paulino-Afonso, F. Boone, D. Schaerer, and B. Mobasher. “Resolved UV and [C Ii] Structures of Luminous Galaxies within the Epoch of Reionization.” The Astrophysical Journal. IOP Publishing, 2019. https://doi.org/10.3847/1538-4357/ab2f81.","ista":"Matthee JJ, Sobral D, Boogaard LA, Röttgering H, Vallini L, Ferrara A, Paulino-Afonso A, Boone F, Schaerer D, Mobasher B. 2019. Resolved UV and [C ii] structures of luminous galaxies within the epoch of reionization. The Astrophysical Journal. 881(2), 124.","mla":"Matthee, Jorryt J., et al. “Resolved UV and [C Ii] Structures of Luminous Galaxies within the Epoch of Reionization.” The Astrophysical Journal, vol. 881, no. 2, 124, IOP Publishing, 2019, doi:10.3847/1538-4357/ab2f81.","short":"J.J. Matthee, D. Sobral, L.A. Boogaard, H. Röttgering, L. Vallini, A. Ferrara, A. Paulino-Afonso, F. Boone, D. Schaerer, B. Mobasher, The Astrophysical Journal 881 (2019).","ieee":"J. J. Matthee et al., “Resolved UV and [C ii] structures of luminous galaxies within the epoch of reionization,” The Astrophysical Journal, vol. 881, no. 2. IOP Publishing, 2019.","apa":"Matthee, J. J., Sobral, D., Boogaard, L. A., Röttgering, H., Vallini, L., Ferrara, A., … Mobasher, B. (2019). Resolved UV and [C ii] structures of luminous galaxies within the epoch of reionization. The Astrophysical Journal. IOP Publishing. https://doi.org/10.3847/1538-4357/ab2f81","ama":"Matthee JJ, Sobral D, Boogaard LA, et al. Resolved UV and [C ii] structures of luminous galaxies within the epoch of reionization. The Astrophysical Journal. 2019;881(2). doi:10.3847/1538-4357/ab2f81"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","external_id":{"arxiv":["1903.08171"]},"author":[{"first_name":"Jorryt J","id":"7439a258-f3c0-11ec-9501-9df22fe06720","last_name":"Matthee","orcid":"0000-0003-2871-127X","full_name":"Matthee, Jorryt J"},{"first_name":"D.","last_name":"Sobral","full_name":"Sobral, D."},{"last_name":"Boogaard","full_name":"Boogaard, L. A.","first_name":"L. A."},{"full_name":"Röttgering, H.","last_name":"Röttgering","first_name":"H."},{"last_name":"Vallini","full_name":"Vallini, L.","first_name":"L."},{"first_name":"A.","last_name":"Ferrara","full_name":"Ferrara, A."},{"first_name":"A.","last_name":"Paulino-Afonso","full_name":"Paulino-Afonso, A."},{"last_name":"Boone","full_name":"Boone, F.","first_name":"F."},{"full_name":"Schaerer, D.","last_name":"Schaerer","first_name":"D."},{"first_name":"B.","last_name":"Mobasher","full_name":"Mobasher, B."}],"title":"Resolved UV and [C ii] structures of luminous galaxies within the epoch of reionization","article_number":"124","year":"2019","publication":"The Astrophysical Journal","day":"21","date_created":"2022-07-06T13:38:15Z","date_published":"2019-08-21T00:00:00Z","doi":"10.3847/1538-4357/ab2f81","acknowledgement":"We thank the anonymous referee for constructive comments and suggestions. We thank Max Gronke for comments on an earlier version of this paper. L.V. acknowledges funding from the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie grant agreement No. 746119. This paper makes use of the following ALMA data: ADS/JAO.ALMA#2017.1.01451.S. ALMA is a partnership of ESO (representing its member states), NSF (USA), and NINS (Japan), together with NRC (Canada), NSC and ASIAA (Taiwan), and KASI (Republic of Korea), in cooperation with the Republic of Chile. The Joint ALMA Observatory is operated by ESO, AUI/NRAO, and NAOJ. Based on observations obtained with the Very Large Telescope, programs 294.A-5018, 097.A-0943, and 99.A-0462. Based on observations made with the NASA/ESA Hubble Space Telescope, obtained (from the Data Archive) at the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5-26555. These observations are associated with program No. 14699.","oa":1,"publisher":"IOP Publishing","quality_controlled":"1","date_updated":"2022-08-18T10:19:48Z","extern":"1","_id":"11515","type":"journal_article","article_type":"original","keyword":["Space and Planetary Science","Astronomy and Astrophysics"],"status":"public","publication_status":"published","publication_identifier":{"eissn":["1538-4357"],"issn":["0004-637X"]},"language":[{"iso":"eng"}],"issue":"2","volume":881,"abstract":[{"lang":"eng","text":"We present new deep ALMA and Hubble Space Telescope (HST)/WFC3 observations of MASOSA and VR7, two luminous Lyα emitters (LAEs) at z = 6.5, for which the UV continuum levels differ by a factor of four. No IR dust continuum emission is detected in either, indicating little amounts of obscured star formation and/or high dust temperatures. MASOSA, with a UV luminosity M1500 = −20.9, compact size, and very high Lyα ${\\mathrm{EW}}_{0}\\approx 145\\,\\mathring{\\rm A} $, is undetected in [C ii] to a limit of L[C ii] < 2.2 × 107 L⊙, implying a metallicity Z ≲ 0.07 Z⊙. Intriguingly, our HST data indicate a red UV slope β = −1.1 ± 0.7, at odds with the low dust content. VR7, which is a bright (M1500 = −22.4) galaxy with moderate color (β = −1.4 ± 0.3) and Lyα EW0 = 34 Å, is clearly detected in [C ii] emission (S/N = 15). VR7's rest-frame UV morphology can be described by two components separated by ≈1.5 kpc and is globally more compact than the [C ii] emission. The global [C ii]/UV ratio indicates Z ≈ 0.2 Z⊙, but there are large variations in the UV/[C ii] ratio on kiloparsec scales. We also identify diffuse, possibly outflowing, [C ii]-emitting gas at ≈100 km s−1 with respect to the peak. VR7 appears to be assembling its components at a slightly more evolved stage than other luminous LAEs, with outflows already shaping its direct environment at z ∼ 7. Our results further indicate that the global [C ii]−UV relation steepens at SFR < 30 M⊙ yr−1, naturally explaining why the [C ii]/UV ratio is anticorrelated with Lyα EW in many, but not all, observed LAEs."}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1903.08171"}],"scopus_import":"1","intvolume":" 881","month":"08"},{"article_number":"132","citation":{"ista":"Wang E, Lilly SJ, Pezzulli G, Matthee JJ. 2019. On the elevation and suppression of star formation within galaxies. The Astrophysical Journal. 877(2), 132.","chicago":"Wang, Enci, Simon J. Lilly, Gabriele Pezzulli, and Jorryt J Matthee. “On the Elevation and Suppression of Star Formation within Galaxies.” The Astrophysical Journal. IOP Publishing, 2019. https://doi.org/10.3847/1538-4357/ab1c5b.","ama":"Wang E, Lilly SJ, Pezzulli G, Matthee JJ. On the elevation and suppression of star formation within galaxies. The Astrophysical Journal. 2019;877(2). doi:10.3847/1538-4357/ab1c5b","apa":"Wang, E., Lilly, S. J., Pezzulli, G., & Matthee, J. J. (2019). On the elevation and suppression of star formation within galaxies. The Astrophysical Journal. IOP Publishing. https://doi.org/10.3847/1538-4357/ab1c5b","short":"E. Wang, S.J. Lilly, G. Pezzulli, J.J. Matthee, The Astrophysical Journal 877 (2019).","ieee":"E. Wang, S. J. Lilly, G. Pezzulli, and J. J. Matthee, “On the elevation and suppression of star formation within galaxies,” The Astrophysical Journal, vol. 877, no. 2. IOP Publishing, 2019.","mla":"Wang, Enci, et al. “On the Elevation and Suppression of Star Formation within Galaxies.” The Astrophysical Journal, vol. 877, no. 2, 132, IOP Publishing, 2019, doi:10.3847/1538-4357/ab1c5b."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1901.10276"]},"article_processing_charge":"No","author":[{"first_name":"Enci","full_name":"Wang, Enci","last_name":"Wang"},{"first_name":"Simon J.","full_name":"Lilly, Simon J.","last_name":"Lilly"},{"full_name":"Pezzulli, Gabriele","last_name":"Pezzulli","first_name":"Gabriele"},{"first_name":"Jorryt J","id":"7439a258-f3c0-11ec-9501-9df22fe06720","orcid":"0000-0003-2871-127X","full_name":"Matthee, Jorryt J","last_name":"Matthee"}],"title":"On the elevation and suppression of star formation within galaxies","acknowledgement":"We are grateful to the anonymous referee for their thoughtful and constructive review of the paper and their several suggestions (including the analysis of Section 3.4), which have improved the paper. This research has been supported by the Swiss National Science Foundation.\r\n\r\nFunding for the Sloan Digital Sky Survey IV has been provided by the Alfred P. Sloan Foundation, the U.S. Department of Energy Office of Science, and the Participating Institutions. SDSS-IV acknowledges support and resources from the Center for High-Performance Computing at the University of Utah. The SDSS website is www.sdss.org.\r\n\r\nSDSS-IV is managed by the Astrophysical Research Consortium for the Participating Institutions of the SDSS Collaboration, including the Brazilian Participation Group, the Carnegie Institution for Science, Carnegie Mellon University, the Chilean Participation Group, the French Participation Group, Harvard-Smithsonian Center for Astrophysics, Instituto de Astrofísica de Canarias, the Johns Hopkins University, Kavli Institute for the Physics and Mathematics of the Universe (IPMU)/University of Tokyo, Lawrence Berkeley National Laboratory, Leibniz Institut für Astrophysik Potsdam (AIP), Max-Planck-Institut für Astronomie (MPIA Heidelberg), Max-Planck-Institut für Astrophysik (MPA Garching), Max-Planck-Institut für Extraterrestrische Physik (MPE), National Astronomical Observatory of China, New Mexico State University, New York University, University of Notre Dame, Observatário Nacional/MCTI, the Ohio State University, Pennsylvania State University, Shanghai Astronomical Observatory, United Kingdom Participation Group, Universidad Nacional Autónoma de México, University of Arizona, University of Colorado Boulder, University of Oxford, University of Portsmouth, University of Utah, University of Virginia, University of Washington, University of Wisconsin, Vanderbilt University, and Yale University","oa":1,"quality_controlled":"1","publisher":"IOP Publishing","year":"2019","publication":"The Astrophysical Journal","day":"04","date_created":"2022-07-07T08:38:24Z","doi":"10.3847/1538-4357/ab1c5b","date_published":"2019-06-04T00:00:00Z","_id":"11517","article_type":"original","type":"journal_article","keyword":["Space and Planetary Science","Astronomy and Astrophysics"],"status":"public","date_updated":"2022-08-18T10:19:08Z","extern":"1","abstract":[{"text":"To understand star formation in galaxies, we investigate the star formation rate (SFR) surface density (ΣSFR) profiles for galaxies, based on a well-defined sample of 976 star-forming MaNGA galaxies. We find that the typical ΣSFR profiles within 1.5Re of normal SF galaxies can be well described by an exponential function for different stellar mass intervals, while the sSFR profile shows positive gradients, especially for more massive SF galaxies. This is due to the more pronounced central cores or bulges rather than the onset of a `quenching' process. While galaxies that lie significantly above (or below) the star formation main sequence (SFMS) show overall an elevation (or suppression) of ΣSFR at all radii, this central elevation (or suppression) is more pronounced in more massive galaxies. The degree of central enhancement and suppression is quite symmetric, suggesting that both the elevation and suppression of star formation are following the same physical processes. Furthermore, we find that the dispersion in ΣSFR within and across the population is found to be tightly correlated with the inferred gas depletion time, whether based on the stellar surface mass density or the orbital dynamical time. This suggests that we are seeing the response of a simple gas-regulator system to variations in the accretion rate. This is explored using a heuristic model that can quantitatively explain the dependence of σ(ΣSFR) on gas depletion timescale. Variations in accretion rate are progressively more damped out in regions of low star-formation efficiency leading to a reduced amplitude of variations in star-formation.","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1901.10276"}],"scopus_import":"1","intvolume":" 877","month":"06","publication_status":"published","publication_identifier":{"issn":["0004-637X"],"eissn":["1538-4357"]},"language":[{"iso":"eng"}],"issue":"2","volume":877},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Khostovan, A. A., et al. “The Clustering of Typical Ly α Emitters from z ∼ 2.5–6: Host Halo Masses Depend on Ly α and UV Luminosities.” Monthly Notices of the Royal Astronomical Society, vol. 489, no. 1, Oxford University Press, 2019, pp. 555–73, doi:10.1093/mnras/stz2149.","short":"A.A. Khostovan, D. Sobral, B. Mobasher, J.J. Matthee, R.K. Cochrane, N. Chartab, M. Jafariyazani, A. Paulino-Afonso, S. Santos, J. Calhau, Monthly Notices of the Royal Astronomical Society 489 (2019) 555–573.","ieee":"A. A. Khostovan et al., “The clustering of typical Ly α emitters from z ∼ 2.5–6: Host halo masses depend on Ly α and UV luminosities,” Monthly Notices of the Royal Astronomical Society, vol. 489, no. 1. Oxford University Press, pp. 555–573, 2019.","ama":"Khostovan AA, Sobral D, Mobasher B, et al. The clustering of typical Ly α emitters from z ∼ 2.5–6: Host halo masses depend on Ly α and UV luminosities. Monthly Notices of the Royal Astronomical Society. 2019;489(1):555-573. doi:10.1093/mnras/stz2149","apa":"Khostovan, A. A., Sobral, D., Mobasher, B., Matthee, J. J., Cochrane, R. K., Chartab, N., … Calhau, J. (2019). The clustering of typical Ly α emitters from z ∼ 2.5–6: Host halo masses depend on Ly α and UV luminosities. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stz2149","chicago":"Khostovan, A A, D Sobral, B Mobasher, Jorryt J Matthee, R K Cochrane, N Chartab, M Jafariyazani, A Paulino-Afonso, S Santos, and J Calhau. “The Clustering of Typical Ly α Emitters from z ∼ 2.5–6: Host Halo Masses Depend on Ly α and UV Luminosities.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2019. https://doi.org/10.1093/mnras/stz2149.","ista":"Khostovan AA, Sobral D, Mobasher B, Matthee JJ, Cochrane RK, Chartab N, Jafariyazani M, Paulino-Afonso A, Santos S, Calhau J. 2019. The clustering of typical Ly α emitters from z ∼ 2.5–6: Host halo masses depend on Ly α and UV luminosities. Monthly Notices of the Royal Astronomical Society. 489(1), 555–573."},"title":"The clustering of typical Ly α emitters from z ∼ 2.5–6: Host halo masses depend on Ly α and UV luminosities","external_id":{"arxiv":["1811.00556"]},"article_processing_charge":"No","author":[{"first_name":"A A","full_name":"Khostovan, A A","last_name":"Khostovan"},{"full_name":"Sobral, D","last_name":"Sobral","first_name":"D"},{"first_name":"B","last_name":"Mobasher","full_name":"Mobasher, B"},{"orcid":"0000-0003-2871-127X","full_name":"Matthee, Jorryt J","last_name":"Matthee","first_name":"Jorryt J","id":"7439a258-f3c0-11ec-9501-9df22fe06720"},{"first_name":"R K","full_name":"Cochrane, R K","last_name":"Cochrane"},{"first_name":"N","full_name":"Chartab, N","last_name":"Chartab"},{"first_name":"M","full_name":"Jafariyazani, M","last_name":"Jafariyazani"},{"full_name":"Paulino-Afonso, A","last_name":"Paulino-Afonso","first_name":"A"},{"first_name":"S","last_name":"Santos","full_name":"Santos, S"},{"last_name":"Calhau","full_name":"Calhau, J","first_name":"J"}],"acknowledgement":"We thank the anonymous referee for their useful comments and suggestions that helped improve this study. AAK acknowledges that this work was supported by NASA Headquarters under the NASA Earth and Space Science Fellowship Program – Grant NNX16AO92H. JM acknowledges support from the ETH Zwicky fellowship. RKC acknowledges funding from STFC via a studentship. APA acknowledges support from the Fundac¸ao para a Ci ˜ encia e a Tecnologia FCT through the fellowship PD/BD/52706/2014 and the research grant UID/FIS/04434/2013. JC and SS both acknowledge their support from the Lancaster University PhD Fellowship. We have benefited greatly from the publicly available programming language PYTHON, including the NUMPY, SCIPY, MATPLOTLIB, SCIKIT-LEARN, and ASTROPY packages, as well as the TOPCAT analysis program. The SC4K samples used in this paper are all publicly available for use by the community (Sobral et al. 2018a). The catalogue is also available on the COSMOS IPAC website (https://irsa.ipac.caltech.edu/data/COSMOS/overview.html).","oa":1,"publisher":"Oxford University Press","quality_controlled":"1","publication":"Monthly Notices of the Royal Astronomical Society","day":"01","year":"2019","date_created":"2022-07-07T13:01:03Z","doi":"10.1093/mnras/stz2149","date_published":"2019-10-01T00:00:00Z","page":"555-573","_id":"11535","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: evolution","galaxies: haloes","galaxies: high-redshift","galaxies: star formation","cosmology: observations","large-scale structure of Universe"],"status":"public","article_type":"original","type":"journal_article","extern":"1","date_updated":"2022-08-19T06:38:42Z","oa_version":"Preprint","abstract":[{"text":"We investigate the clustering and halo properties of ∼5000 Ly α-selected emission-line galaxies (LAEs) from the Slicing COSMOS 4K (SC4K) and from archival NB497 imaging of SA22 split in 15 discrete redshift slices between z ∼ 2.5 and 6. We measure clustering lengths of r0 ∼ 3–6 h−1 Mpc and typical halo masses of ∼1011 M⊙ for our narrowband-selected LAEs with typical LLy α ∼ 1042–43 erg s−1. The intermediate-band-selected LAEs are observed to have r0 ∼ 3.5–15 h−1 Mpc with typical halo masses of ∼1011–12 M⊙ and typical LLy α ∼ 1043–43.6 erg s−1. We find a strong, redshift-independent correlation between halo mass and Ly α luminosity normalized by the characteristic Ly α luminosity, L⋆(z). The faintest LAEs (L ∼ 0.1 L⋆(z)) typically identified by deep narrowband surveys are found in 1010 M⊙ haloes and the brightest LAEs (L ∼ 7 L⋆(z)) are found in ∼5 × 1012 M⊙ haloes. A dependency on the rest-frame 1500 Å UV luminosity, MUV, is also observed where the halo masses increase from 1011 to 1013 M⊙ for MUV ∼ −19 to −23.5 mag. Halo mass is also observed to increase from 109.8 to 1012 M⊙ for dust-corrected UV star formation rates from ∼0.6 to 10 M⊙ yr−1 and continues to increase up to 1013 M⊙ in halo mass, where the majority of those sources are active galactic nuclei. All the trends we observe are found to be redshift independent. Our results reveal that LAEs are the likely progenitors of a wide range of galaxies depending on their luminosity, from dwarf-like, to Milky Way-type, to bright cluster galaxies. LAEs therefore provide unique insight into the early formation and evolution of the galaxies we observe in the local Universe.","lang":"eng"}],"intvolume":" 489","month":"10","main_file_link":[{"url":"https://arxiv.org/abs/1811.00556","open_access":"1"}],"scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0035-8711"],"eissn":["1365-2966"]},"volume":489,"issue":"1"},{"date_updated":"2022-08-19T06:49:36Z","extern":"1","type":"journal_article","article_type":"original","status":"public","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: evolution","galaxies: high-redshift","galaxies: ISM","cosmology: observations","dark ages","reionization","first stars","early Universe"],"_id":"11541","volume":482,"issue":"2","publication_identifier":{"issn":["0035-8711"],"eissn":["1365-2966"]},"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1710.08422","open_access":"1"}],"month":"01","intvolume":" 482","abstract":[{"text":"We present new Hubble Space Telescope (HST)/WFC3 observations and re-analyse VLT data to unveil the continuum, variability, and rest-frame ultraviolet (UV) lines of the multiple UV clumps of the most luminous Lyα emitter at z = 6.6, CR7 (COSMOS Redshift 7). Our re-reduced, flux-calibrated X-SHOOTER spectra of CR7 reveal an He II emission line in observations obtained along the major axis of Lyα emission with the best seeing conditions. He II is spatially offset by ≈+0.8 arcsec from the peak of Lyα emission, and it is found towards clump B. Our WFC3 grism spectra detects the UV continuum of CR7’s clump A, yielding a power law with β=−2.5+0.6−0.7 and MUV=−21.87+0.25−0.20. No significant variability is found for any of the UV clumps on their own, but there is tentative (≈2.2 σ) brightening of CR7 in F110W as a whole from 2012 to 2017. HST grism data fail to robustly detect rest-frame UV lines in any of the clumps, implying fluxes ≲2×10−17 erg s−1 cm−2 (3σ). We perform CLOUDY modelling to constrain the metallicity and the ionizing nature of CR7. CR7 seems to be actively forming stars without any clear active galactic nucleus activity in clump A, consistent with a metallicity of ∼0.05–0.2 Z⊙. Component C or an interclump component between B and C may host a high ionization source. Our results highlight the need for spatially resolved information to study the formation and assembly of early galaxies.","lang":"eng"}],"oa_version":"Preprint","author":[{"full_name":"Sobral, David","last_name":"Sobral","first_name":"David"},{"full_name":"Matthee, Jorryt J","orcid":"0000-0003-2871-127X","last_name":"Matthee","id":"7439a258-f3c0-11ec-9501-9df22fe06720","first_name":"Jorryt J"},{"full_name":"Brammer, Gabriel","last_name":"Brammer","first_name":"Gabriel"},{"full_name":"Ferrara, Andrea","last_name":"Ferrara","first_name":"Andrea"},{"full_name":"Alegre, Lara","last_name":"Alegre","first_name":"Lara"},{"first_name":"Huub","last_name":"Röttgering","full_name":"Röttgering, Huub"},{"first_name":"Daniel","full_name":"Schaerer, Daniel","last_name":"Schaerer"},{"first_name":"Bahram","last_name":"Mobasher","full_name":"Mobasher, Bahram"},{"last_name":"Darvish","full_name":"Darvish, Behnam","first_name":"Behnam"}],"external_id":{"arxiv":["1710.08422"]},"article_processing_charge":"No","title":"On the nature and physical conditions of the luminous Ly α emitter CR7 and its rest-frame UV components","citation":{"mla":"Sobral, David, et al. “On the Nature and Physical Conditions of the Luminous Ly α Emitter CR7 and Its Rest-Frame UV Components.” Monthly Notices of the Royal Astronomical Society, vol. 482, no. 2, Oxford University Press, 2019, pp. 2422–41, doi:10.1093/mnras/sty2779.","ama":"Sobral D, Matthee JJ, Brammer G, et al. On the nature and physical conditions of the luminous Ly α emitter CR7 and its rest-frame UV components. Monthly Notices of the Royal Astronomical Society. 2019;482(2):2422-2441. doi:10.1093/mnras/sty2779","apa":"Sobral, D., Matthee, J. J., Brammer, G., Ferrara, A., Alegre, L., Röttgering, H., … Darvish, B. (2019). On the nature and physical conditions of the luminous Ly α emitter CR7 and its rest-frame UV components. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/sty2779","short":"D. Sobral, J.J. Matthee, G. Brammer, A. Ferrara, L. Alegre, H. Röttgering, D. Schaerer, B. Mobasher, B. Darvish, Monthly Notices of the Royal Astronomical Society 482 (2019) 2422–2441.","ieee":"D. Sobral et al., “On the nature and physical conditions of the luminous Ly α emitter CR7 and its rest-frame UV components,” Monthly Notices of the Royal Astronomical Society, vol. 482, no. 2. Oxford University Press, pp. 2422–2441, 2019.","chicago":"Sobral, David, Jorryt J Matthee, Gabriel Brammer, Andrea Ferrara, Lara Alegre, Huub Röttgering, Daniel Schaerer, Bahram Mobasher, and Behnam Darvish. “On the Nature and Physical Conditions of the Luminous Ly α Emitter CR7 and Its Rest-Frame UV Components.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2019. https://doi.org/10.1093/mnras/sty2779.","ista":"Sobral D, Matthee JJ, Brammer G, Ferrara A, Alegre L, Röttgering H, Schaerer D, Mobasher B, Darvish B. 2019. On the nature and physical conditions of the luminous Ly α emitter CR7 and its rest-frame UV components. Monthly Notices of the Royal Astronomical Society. 482(2), 2422–2441."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"2422-2441","doi":"10.1093/mnras/sty2779","date_published":"2019-01-01T00:00:00Z","date_created":"2022-07-08T10:40:05Z","year":"2019","day":"01","publication":"Monthly Notices of the Royal Astronomical Society","quality_controlled":"1","publisher":"Oxford University Press","oa":1,"acknowledgement":"We thank the anonymous reviewer for the numerous detailed comments that led us to greatly improve the quality, extent, and statistical robustness of this work. DS acknowledges financial support from the Netherlands Organisation for Scientific research through a Veni fellowship. JM acknowledges the support of a Huygens PhD fellowship from Leiden University. AF acknowledges support from the ERC Advanced Grant INTERSTELLAR H2020/740120. BD acknowledges financial support from NASA through the Astrophysics Data Analysis Program, grant number NNX12AE20G and the National Science Foundation, grant number 1716907. We are thankful for several discussions and constructive comments from Johannes Zabl, Eros Vanzella, Bo Milvang-Jensen, Henry McCracken, Max Gronke, Mark Dijkstra, Richard Ellis, and Nicolas Laporte. We also thank Umar Burhanudin and Izzy Garland for taking part in the XGAL internship in Lancaster and for exploring the HST grism data independently. Based on observations obtained with HST/WFC3 programs 12578, 14495, and 14596. Based on observations of the National Japanese Observatory with the Suprime-Cam on the Subaru telescope (S14A-086) on the big island of Hawaii. This work is based in part on data products produced at TERAPIX available at the Canadian Astronomy Data Centre as part of the Canada–France–Hawaii Telescope Legacy Survey, a collaborative project of NRC and CNRS. Based on data products from observations made with ESO Telescopes at the La Silla Paranal Observatory under ESO programme IDs 294.A-5018, 294.A-5039, 092.A 0786, 093.A-0561, 097.A0043, 097.A-0943, 098.A-0819, 298.A-5012, and 179.A-2005, and on data products produced by TERAPIX and the Cambridge Astronomy Survey Unit on behalf of the UltraVISTA consortium. The authors acknowledge the award of service time (SW2014b20) on the William Herschel Telescope (WHT). WHT and its service programme are operated on the island of La Palma by the Isaac Newton Group in the Spanish Observatorio del Roque de los Muchachos of the Instituto de Astrofisica de Canarias. This research was supported by the Munich Institute for Astro- and Particle Physics of the DFG cluster of excellence ‘Origin and Structure of the Universe’. We have benefitted immensely from the public available programming language PYTHON, including NUMPY and SCIPY (Jones et al. 2001; Van Der Walt, Colbert & Varoquaux 2011), MATPLOTLIB (Hunter 2007), ASTROPY (Astropy Collaboration et al. 2013), and the TOPCAT analysis program (Taylor 2013). This research has made use of the VizieR catalogue access tool, CDS, Strasbourg, France. All data used for this paper are publicly available, and we make all reduced data available with the refereed paper."},{"year":"2019","publication":"Monthly Notices of the Royal Astronomical Society","day":"01","page":"915-932","date_created":"2022-07-08T07:48:31Z","date_published":"2019-03-01T00:00:00Z","doi":"10.1093/mnras/stz030","acknowledgement":"JM acknowledges the support of a Huygens PhD fellowship from Leiden University. We thank Camila Correa for help analysing snipshot merger trees. We thank the anonymous referee for constructive comments. We also thank Jarle Brinchmann, Rob Crain, Antonios Katsianis, Paola Popesso, and David Sobral for discussions and suggestions. We also thank the participants of the Lorentz Center workshop ‘A Decade of the Star-Forming Main Sequence’ held on 2017 September 4–8, for discussions and ideas. We have benefited from the public available programming language PYTHON, including the NUMPY, MATPLOTLIB, and SCIPY (Hunter 2007) packages and the TOPCAT analysis tool (Taylor 2013).","oa":1,"quality_controlled":"1","publisher":"Oxford University Press","citation":{"ista":"Matthee JJ, Schaye J. 2019. The origin of scatter in the star formation rate–stellar mass relation. Monthly Notices of the Royal Astronomical Society. 484(1), 915–932.","chicago":"Matthee, Jorryt J, and Joop Schaye. “The Origin of Scatter in the Star Formation Rate–Stellar Mass Relation.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2019. https://doi.org/10.1093/mnras/stz030.","ama":"Matthee JJ, Schaye J. The origin of scatter in the star formation rate–stellar mass relation. Monthly Notices of the Royal Astronomical Society. 2019;484(1):915-932. doi:10.1093/mnras/stz030","apa":"Matthee, J. J., & Schaye, J. (2019). The origin of scatter in the star formation rate–stellar mass relation. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stz030","ieee":"J. J. Matthee and J. Schaye, “The origin of scatter in the star formation rate–stellar mass relation,” Monthly Notices of the Royal Astronomical Society, vol. 484, no. 1. Oxford University Press, pp. 915–932, 2019.","short":"J.J. Matthee, J. Schaye, Monthly Notices of the Royal Astronomical Society 484 (2019) 915–932.","mla":"Matthee, Jorryt J., and Joop Schaye. “The Origin of Scatter in the Star Formation Rate–Stellar Mass Relation.” Monthly Notices of the Royal Astronomical Society, vol. 484, no. 1, Oxford University Press, 2019, pp. 915–32, doi:10.1093/mnras/stz030."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1805.05956"]},"article_processing_charge":"No","author":[{"full_name":"Matthee, Jorryt J","orcid":"0000-0003-2871-127X","last_name":"Matthee","first_name":"Jorryt J","id":"7439a258-f3c0-11ec-9501-9df22fe06720"},{"first_name":"Joop","full_name":"Schaye, Joop","last_name":"Schaye"}],"title":"The origin of scatter in the star formation rate–stellar mass relation","publication_status":"published","publication_identifier":{"eissn":["1365-2966"],"issn":["0035-8711"]},"language":[{"iso":"eng"}],"volume":484,"issue":"1","abstract":[{"text":"Observations have revealed that the star formation rate (SFR) and stellar mass (Mstar) of star-forming galaxies follow a tight relation known as the galaxy main sequence. However, what physical information is encoded in this relation is under debate. Here, we use the EAGLE cosmological hydrodynamical simulation to study the mass dependence, evolution, and origin of scatter in the SFR–Mstar relation. At z = 0, we find that the scatter decreases slightly with stellar mass from 0.35 dex at Mstar ≈ 109 M⊙ to 0.30 dex at Mstar ≳ 1010.5 M⊙. The scatter decreases from z = 0 to z = 5 by 0.05 dex at Mstar ≳ 1010 M⊙ and by 0.15 dex for lower masses. We show that the scatter at z = 0.1 originates from a combination of fluctuations on short time-scales (ranging from 0.2–2 Gyr) that are presumably associated with self-regulation from cooling, star formation, and outflows, but is dominated by long time-scale (∼10 Gyr) variations related to differences in halo formation times. Shorter time-scale fluctuations are relatively more important for lower mass galaxies. At high masses, differences in black hole formation efficiency cause additional scatter, but also diminish the scatter caused by different halo formation times. While individual galaxies cross the main sequence multiple times during their evolution, they fluctuate around tracks associated with their halo properties, i.e. galaxies above/below the main sequence at z = 0.1 tend to have been above/below the main sequence for ≫1 Gyr.","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/1805.05956","open_access":"1"}],"scopus_import":"1","intvolume":" 484","month":"03","date_updated":"2022-08-19T06:42:43Z","extern":"1","_id":"11540","type":"journal_article","article_type":"original","keyword":["Space and Planetary Science","Astronomy and Astrophysics : galaxies: evolution","galaxies: formation","galaxies: star formation","cosmology: theory"],"status":"public"},{"article_number":"245","citation":{"chicago":"Huber, Daniel, William J. Chaplin, Ashley Chontos, Hans Kjeldsen, Jørgen Christensen-Dalsgaard, Timothy R. Bedding, Warrick Ball, et al. “A Hot Saturn Orbiting an Oscillating Late Subgiant Discovered by TESS.” The Astronomical Journal. IOP Publishing, 2019. https://doi.org/10.3847/1538-3881/ab1488.","ista":"Huber D et al. 2019. A hot Saturn orbiting an oscillating late subgiant discovered by TESS. The Astronomical Journal. 157(6), 245.","mla":"Huber, Daniel, et al. “A Hot Saturn Orbiting an Oscillating Late Subgiant Discovered by TESS.” The Astronomical Journal, vol. 157, no. 6, 245, IOP Publishing, 2019, doi:10.3847/1538-3881/ab1488.","short":"D. Huber, W.J. Chaplin, A. Chontos, H. Kjeldsen, J. Christensen-Dalsgaard, T.R. Bedding, W. Ball, R. Brahm, N. Espinoza, T. Henning, A. Jordán, P. Sarkis, E. Knudstrup, S. Albrecht, F. Grundahl, M.F. Andersen, P.L. Pallé, I. Crossfield, B. Fulton, A.W. Howard, H.T. Isaacson, L.M. Weiss, R. Handberg, M.N. Lund, A.M. Serenelli, J. Rørsted Mosumgaard, A. Stokholm, A. Bieryla, L.A. Buchhave, D.W. Latham, S.N. Quinn, E. Gaidos, T. Hirano, G.R. Ricker, R.K. Vanderspek, S. Seager, J.M. Jenkins, J.N. Winn, H.M. Antia, T. Appourchaux, S. Basu, K.J. Bell, O. Benomar, A. Bonanno, D.L. Buzasi, T.L. Campante, Z. Çelik Orhan, E. Corsaro, M.S. Cunha, G.R. Davies, S. Deheuvels, S.K. Grunblatt, A. Hasanzadeh, M.P. Di Mauro, R. A. García, P. Gaulme, L. Girardi, J.A. Guzik, M. Hon, C. Jiang, T. Kallinger, S.D. Kawaler, J.S. Kuszlewicz, Y. Lebreton, T. Li, M. Lucas, M.S. Lundkvist, A.W. Mann, S. Mathis, S. Mathur, A. Mazumdar, T.S. Metcalfe, A. Miglio, M.J.P. F. G. Monteiro, B. Mosser, A. Noll, B. Nsamba, J.M. Joel Ong, S. Örtel, F. Pereira, P. Ranadive, C. Régulo, T.S. Rodrigues, I.W. Roxburgh, V.S. Aguirre, B. Smalley, M. Schofield, S.G. Sousa, K.G. Stassun, D. Stello, J. Tayar, T.R. White, K. Verma, M. Vrard, M. Yıldız, D. Baker, M. Bazot, C. Beichmann, C. Bergmann, L.A. Bugnet, B. Cale, R. Carlino, S.M. Cartwright, J.L. Christiansen, D.R. Ciardi, O. Creevey, J.A. Dittmann, J.-D.D. Nascimento, V.V. Eylen, G. Fürész, J. Gagné, P. Gao, K. Gazeas, F. Giddens, O.J. Hall, S. Hekker, M.J. Ireland, N. Latouf, D. LeBrun, A.M. Levine, W. Matzko, E. Natinsky, E. Page, P. Plavchan, M. Mansouri-Samani, S. McCauliff, S.E. Mullally, B. Orenstein, A.G. Soto, M. Paegert, J.L. van Saders, C. Schnaible, D.R. Soderblom, R. Szabó, A. Tanner, C.G. Tinney, J. Teske, A. Thomas, R. Trampedach, D. Wright, T.T. Yuan, F. Zohrabi, The Astronomical Journal 157 (2019).","ieee":"D. Huber et al., “A hot Saturn orbiting an oscillating late subgiant discovered by TESS,” The Astronomical Journal, vol. 157, no. 6. IOP Publishing, 2019.","ama":"Huber D, Chaplin WJ, Chontos A, et al. A hot Saturn orbiting an oscillating late subgiant discovered by TESS. The Astronomical Journal. 2019;157(6). doi:10.3847/1538-3881/ab1488","apa":"Huber, D., Chaplin, W. J., Chontos, A., Kjeldsen, H., Christensen-Dalsgaard, J., Bedding, T. R., … Zohrabi, F. (2019). A hot Saturn orbiting an oscillating late subgiant discovered by TESS. The Astronomical Journal. IOP Publishing. https://doi.org/10.3847/1538-3881/ab1488"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1901.01643"]},"article_processing_charge":"No","author":[{"full_name":"Huber, Daniel","last_name":"Huber","first_name":"Daniel"},{"full_name":"Chaplin, William J.","last_name":"Chaplin","first_name":"William J."},{"first_name":"Ashley","full_name":"Chontos, Ashley","last_name":"Chontos"},{"first_name":"Hans","last_name":"Kjeldsen","full_name":"Kjeldsen, Hans"},{"first_name":"Jørgen","full_name":"Christensen-Dalsgaard, Jørgen","last_name":"Christensen-Dalsgaard"},{"last_name":"Bedding","full_name":"Bedding, Timothy R.","first_name":"Timothy R."},{"first_name":"Warrick","full_name":"Ball, Warrick","last_name":"Ball"},{"full_name":"Brahm, Rafael","last_name":"Brahm","first_name":"Rafael"},{"last_name":"Espinoza","full_name":"Espinoza, Nestor","first_name":"Nestor"},{"first_name":"Thomas","full_name":"Henning, Thomas","last_name":"Henning"},{"full_name":"Jordán, Andrés","last_name":"Jordán","first_name":"Andrés"},{"first_name":"Paula","full_name":"Sarkis, Paula","last_name":"Sarkis"},{"last_name":"Knudstrup","full_name":"Knudstrup, Emil","first_name":"Emil"},{"first_name":"Simon","last_name":"Albrecht","full_name":"Albrecht, Simon"},{"first_name":"Frank","full_name":"Grundahl, Frank","last_name":"Grundahl"},{"last_name":"Andersen","full_name":"Andersen, Mads Fredslund","first_name":"Mads Fredslund"},{"last_name":"Pallé","full_name":"Pallé, Pere L.","first_name":"Pere L."},{"last_name":"Crossfield","full_name":"Crossfield, Ian","first_name":"Ian"},{"first_name":"Benjamin","full_name":"Fulton, Benjamin","last_name":"Fulton"},{"full_name":"Howard, Andrew W.","last_name":"Howard","first_name":"Andrew W."},{"last_name":"Isaacson","full_name":"Isaacson, Howard T.","first_name":"Howard T."},{"last_name":"Weiss","full_name":"Weiss, Lauren M.","first_name":"Lauren M."},{"first_name":"Rasmus","full_name":"Handberg, Rasmus","last_name":"Handberg"},{"first_name":"Mikkel N.","last_name":"Lund","full_name":"Lund, Mikkel N."},{"first_name":"Aldo M.","last_name":"Serenelli","full_name":"Serenelli, Aldo M."},{"last_name":"Rørsted Mosumgaard","full_name":"Rørsted Mosumgaard, Jakob","first_name":"Jakob"},{"last_name":"Stokholm","full_name":"Stokholm, Amalie","first_name":"Amalie"},{"first_name":"Allyson","full_name":"Bieryla, Allyson","last_name":"Bieryla"},{"first_name":"Lars A.","full_name":"Buchhave, Lars A.","last_name":"Buchhave"},{"full_name":"Latham, David W.","last_name":"Latham","first_name":"David W."},{"first_name":"Samuel N.","last_name":"Quinn","full_name":"Quinn, Samuel N."},{"last_name":"Gaidos","full_name":"Gaidos, Eric","first_name":"Eric"},{"last_name":"Hirano","full_name":"Hirano, Teruyuki","first_name":"Teruyuki"},{"full_name":"Ricker, George R.","last_name":"Ricker","first_name":"George R."},{"first_name":"Roland K.","last_name":"Vanderspek","full_name":"Vanderspek, Roland K."},{"first_name":"Sara","full_name":"Seager, Sara","last_name":"Seager"},{"first_name":"Jon M.","last_name":"Jenkins","full_name":"Jenkins, Jon M."},{"full_name":"Winn, Joshua N.","last_name":"Winn","first_name":"Joshua N."},{"full_name":"Antia, H. M.","last_name":"Antia","first_name":"H. M."},{"full_name":"Appourchaux, Thierry","last_name":"Appourchaux","first_name":"Thierry"},{"first_name":"Sarbani","last_name":"Basu","full_name":"Basu, Sarbani"},{"first_name":"Keaton J.","last_name":"Bell","full_name":"Bell, Keaton J."},{"first_name":"Othman","full_name":"Benomar, Othman","last_name":"Benomar"},{"last_name":"Bonanno","full_name":"Bonanno, Alfio","first_name":"Alfio"},{"first_name":"Derek L.","last_name":"Buzasi","full_name":"Buzasi, Derek L."},{"first_name":"Tiago L.","last_name":"Campante","full_name":"Campante, Tiago L."},{"last_name":"Çelik Orhan","full_name":"Çelik Orhan, Z.","first_name":"Z."},{"first_name":"Enrico","full_name":"Corsaro, Enrico","last_name":"Corsaro"},{"first_name":"Margarida S.","full_name":"Cunha, Margarida S.","last_name":"Cunha"},{"full_name":"Davies, Guy R.","last_name":"Davies","first_name":"Guy R."},{"first_name":"Sebastien","last_name":"Deheuvels","full_name":"Deheuvels, Sebastien"},{"first_name":"Samuel K.","full_name":"Grunblatt, Samuel K.","last_name":"Grunblatt"},{"full_name":"Hasanzadeh, Amir","last_name":"Hasanzadeh","first_name":"Amir"},{"full_name":"Di Mauro, Maria Pia","last_name":"Di Mauro","first_name":"Maria Pia"},{"first_name":"Rafael","last_name":"A. García","full_name":"A. García, Rafael"},{"full_name":"Gaulme, Patrick","last_name":"Gaulme","first_name":"Patrick"},{"first_name":"Léo","full_name":"Girardi, Léo","last_name":"Girardi"},{"first_name":"Joyce A.","last_name":"Guzik","full_name":"Guzik, Joyce A."},{"last_name":"Hon","full_name":"Hon, Marc","first_name":"Marc"},{"last_name":"Jiang","full_name":"Jiang, Chen","first_name":"Chen"},{"full_name":"Kallinger, Thomas","last_name":"Kallinger","first_name":"Thomas"},{"first_name":"Steven D.","last_name":"Kawaler","full_name":"Kawaler, Steven D."},{"last_name":"Kuszlewicz","full_name":"Kuszlewicz, James S.","first_name":"James S."},{"first_name":"Yveline","last_name":"Lebreton","full_name":"Lebreton, Yveline"},{"first_name":"Tanda","last_name":"Li","full_name":"Li, Tanda"},{"last_name":"Lucas","full_name":"Lucas, Miles","first_name":"Miles"},{"first_name":"Mia S.","full_name":"Lundkvist, Mia S.","last_name":"Lundkvist"},{"first_name":"Andrew W.","last_name":"Mann","full_name":"Mann, Andrew W."},{"full_name":"Mathis, Stéphane","last_name":"Mathis","first_name":"Stéphane"},{"first_name":"Savita","full_name":"Mathur, Savita","last_name":"Mathur"},{"first_name":"Anwesh","last_name":"Mazumdar","full_name":"Mazumdar, Anwesh"},{"full_name":"Metcalfe, Travis S.","last_name":"Metcalfe","first_name":"Travis S."},{"first_name":"Andrea","full_name":"Miglio, Andrea","last_name":"Miglio"},{"first_name":"Mário J. P.","last_name":"F. G. Monteiro","full_name":"F. G. Monteiro, Mário J. P."},{"full_name":"Mosser, Benoit","last_name":"Mosser","first_name":"Benoit"},{"first_name":"Anthony","full_name":"Noll, Anthony","last_name":"Noll"},{"last_name":"Nsamba","full_name":"Nsamba, Benard","first_name":"Benard"},{"first_name":"Jia Mian","last_name":"Joel Ong","full_name":"Joel Ong, Jia Mian"},{"full_name":"Örtel, S.","last_name":"Örtel","first_name":"S."},{"full_name":"Pereira, Filipe","last_name":"Pereira","first_name":"Filipe"},{"first_name":"Pritesh","full_name":"Ranadive, Pritesh","last_name":"Ranadive"},{"full_name":"Régulo, Clara","last_name":"Régulo","first_name":"Clara"},{"full_name":"Rodrigues, Thaíse S.","last_name":"Rodrigues","first_name":"Thaíse S."},{"last_name":"Roxburgh","full_name":"Roxburgh, Ian W.","first_name":"Ian W."},{"first_name":"Victor Silva","last_name":"Aguirre","full_name":"Aguirre, Victor Silva"},{"full_name":"Smalley, Barry","last_name":"Smalley","first_name":"Barry"},{"full_name":"Schofield, Mathew","last_name":"Schofield","first_name":"Mathew"},{"first_name":"Sérgio G.","full_name":"Sousa, Sérgio G.","last_name":"Sousa"},{"first_name":"Keivan G.","full_name":"Stassun, Keivan G.","last_name":"Stassun"},{"last_name":"Stello","full_name":"Stello, Dennis","first_name":"Dennis"},{"last_name":"Tayar","full_name":"Tayar, Jamie","first_name":"Jamie"},{"first_name":"Timothy R.","last_name":"White","full_name":"White, Timothy R."},{"last_name":"Verma","full_name":"Verma, Kuldeep","first_name":"Kuldeep"},{"last_name":"Vrard","full_name":"Vrard, Mathieu","first_name":"Mathieu"},{"first_name":"M.","last_name":"Yıldız","full_name":"Yıldız, M."},{"full_name":"Baker, David","last_name":"Baker","first_name":"David"},{"last_name":"Bazot","full_name":"Bazot, Michaël","first_name":"Michaël"},{"first_name":"Charles","last_name":"Beichmann","full_name":"Beichmann, Charles"},{"last_name":"Bergmann","full_name":"Bergmann, Christoph","first_name":"Christoph"},{"first_name":"Lisa Annabelle","id":"d9edb345-f866-11ec-9b37-d119b5234501","last_name":"Bugnet","orcid":"0000-0003-0142-4000","full_name":"Bugnet, Lisa Annabelle"},{"last_name":"Cale","full_name":"Cale, Bryson","first_name":"Bryson"},{"first_name":"Roberto","last_name":"Carlino","full_name":"Carlino, Roberto"},{"first_name":"Scott M.","full_name":"Cartwright, Scott M.","last_name":"Cartwright"},{"first_name":"Jessie L.","full_name":"Christiansen, Jessie L.","last_name":"Christiansen"},{"last_name":"Ciardi","full_name":"Ciardi, David R.","first_name":"David R."},{"full_name":"Creevey, Orlagh","last_name":"Creevey","first_name":"Orlagh"},{"first_name":"Jason A.","full_name":"Dittmann, Jason A.","last_name":"Dittmann"},{"full_name":"Nascimento, Jose-Dias Do","last_name":"Nascimento","first_name":"Jose-Dias Do"},{"full_name":"Eylen, Vincent Van","last_name":"Eylen","first_name":"Vincent Van"},{"first_name":"Gabor","last_name":"Fürész","full_name":"Fürész, Gabor"},{"full_name":"Gagné, Jonathan","last_name":"Gagné","first_name":"Jonathan"},{"first_name":"Peter","full_name":"Gao, Peter","last_name":"Gao"},{"last_name":"Gazeas","full_name":"Gazeas, Kosmas","first_name":"Kosmas"},{"first_name":"Frank","full_name":"Giddens, Frank","last_name":"Giddens"},{"first_name":"Oliver J.","last_name":"Hall","full_name":"Hall, Oliver J."},{"first_name":"Saskia","last_name":"Hekker","full_name":"Hekker, Saskia"},{"last_name":"Ireland","full_name":"Ireland, Michael J.","first_name":"Michael J."},{"first_name":"Natasha","last_name":"Latouf","full_name":"Latouf, Natasha"},{"full_name":"LeBrun, Danny","last_name":"LeBrun","first_name":"Danny"},{"first_name":"Alan M.","full_name":"Levine, Alan M.","last_name":"Levine"},{"last_name":"Matzko","full_name":"Matzko, William","first_name":"William"},{"first_name":"Eva","full_name":"Natinsky, Eva","last_name":"Natinsky"},{"first_name":"Emma","full_name":"Page, Emma","last_name":"Page"},{"last_name":"Plavchan","full_name":"Plavchan, Peter","first_name":"Peter"},{"last_name":"Mansouri-Samani","full_name":"Mansouri-Samani, Masoud","first_name":"Masoud"},{"last_name":"McCauliff","full_name":"McCauliff, Sean","first_name":"Sean"},{"first_name":"Susan E.","last_name":"Mullally","full_name":"Mullally, Susan E."},{"first_name":"Brendan","full_name":"Orenstein, Brendan","last_name":"Orenstein"},{"first_name":"Aylin Garcia","last_name":"Soto","full_name":"Soto, Aylin Garcia"},{"first_name":"Martin","full_name":"Paegert, Martin","last_name":"Paegert"},{"first_name":"Jennifer L.","full_name":"van Saders, Jennifer L.","last_name":"van Saders"},{"last_name":"Schnaible","full_name":"Schnaible, Chloe","first_name":"Chloe"},{"first_name":"David R.","full_name":"Soderblom, David R.","last_name":"Soderblom"},{"first_name":"Róbert","full_name":"Szabó, Róbert","last_name":"Szabó"},{"first_name":"Angelle","last_name":"Tanner","full_name":"Tanner, Angelle"},{"first_name":"C. G.","full_name":"Tinney, C. G.","last_name":"Tinney"},{"last_name":"Teske","full_name":"Teske, Johanna","first_name":"Johanna"},{"first_name":"Alexandra","last_name":"Thomas","full_name":"Thomas, Alexandra"},{"first_name":"Regner","full_name":"Trampedach, Regner","last_name":"Trampedach"},{"first_name":"Duncan","last_name":"Wright","full_name":"Wright, Duncan"},{"last_name":"Yuan","full_name":"Yuan, Thomas T.","first_name":"Thomas T."},{"first_name":"Farzaneh","last_name":"Zohrabi","full_name":"Zohrabi, Farzaneh"}],"title":"A hot Saturn orbiting an oscillating late subgiant discovered by TESS","acknowledgement":"The authors wish to recognize and acknowledge the very significant cultural role and reverence that the summit of Maunakea has always had within the indigenous Hawai'ian community. We are most fortunate to have the opportunity to conduct observations from this mountain. We thank Andrei Tokovinin for helpful information on the Speckle observations obtained with SOAR. D.H. acknowledges support by the National Aeronautics and Space Administration through the TESS Guest Investigator Program (80NSSC18K1585) and by the National Science Foundation (AST-1717000). A.C. acknowledges support by the National Science Foundation under the Graduate Research Fellowship Program. W.J.C., W.H.B., A.M., O.J.H., and G.R.D. acknowledge support from the Science and Technology Facilities Council and UK Space Agency. H.K. and F.G. acknowledge support from the European Social Fund via the Lithuanian Science Council grant No. 09.3.3-LMT-K-712-01-0103. Funding for the Stellar Astrophysics Centre is provided by The Danish National Research Foundation (grant DNRF106). A.J. acknowledges support from FONDECYT project 1171208, CONICYT project BASAL AFB-170002, and by the Ministry for the Economy, Development, and Tourism's Programa Iniciativa Científica Milenio through grant IC 120009, awarded to the Millennium Institute of Astrophysics (MAS). R.B. acknowledges support from FONDECYT Post-doctoral Fellowship Project 3180246, and from the Millennium Institute of Astrophysics (MAS). A.M.S. is supported by grants ESP2017-82674-R (MINECO) and SGR2017-1131 (AGAUR). R.A.G. and L.B. acknowledge the support of the PLATO grant from the CNES. The research leading to the presented results has received funding from the European Research Council under the European Community's Seventh Framework Programme (FP72007-2013)ERC grant agreement No. 338251 (StellarAges). S.M. acknowledges support from the European Research Council through the SPIRE grant 647383. This work was also supported by FCT (Portugal) through national funds and by FEDER through COMPETE2020 by these grants: UID/FIS/04434/2013 and POCI-01-0145-FEDER-007672, PTDC/FIS-AST/30389/2017, and POCI-01-0145-FEDER-030389. T.L.C. acknowledges support from the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 792848 (PULSATION). E.C. is funded by the European Union's Horizon 2020 research and innovation program under the Marie Sklodowska-Curie grant agreement No. 664931. V.S.A. acknowledges support from the Independent Research Fund Denmark (Research grant 7027-00096B). D.S. acknowledges support from the Australian Research Council. S.B. acknowledges NASA grant NNX16AI09G and NSF grant AST-1514676. T.R.W. acknowledges support from the Australian Research Council through grant DP150100250. A.M. acknowledges support from the ERC Consolidator Grant funding scheme (project ASTEROCHRONOMETRY, G.A. n. 772293). S.M. acknowledges support from the Ramon y Cajal fellowship number RYC-2015-17697. M.S.L. is supported by the Carlsberg Foundation (grant agreement No. CF17-0760). A.M. and P.R. acknowledge support from the HBCSE-NIUS programme. J.K.T. and J.T. acknowledge that support for this work was provided by NASA through Hubble Fellowship grants HST-HF2-51399.001 and HST-HF2-51424.001 awarded by the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., for NASA, under contract NAS5-26555. T.S.R. acknowledges financial support from Premiale 2015 MITiC (PI B. Garilli). This project has been supported by the NKFIH K-115709 grant and the Lendület Program of the Hungarian Academy of Sciences, project No. LP2018-7/2018.\r\n\r\nBased on observations made with the Hertzsprung SONG telescope operated on the Spanish Observatorio del Teide on the island of Tenerife by the Aarhus and Copenhagen Universities and by the Instituto de Astrofísica de Canarias. Funding for the TESS mission is provided by NASA's Science Mission directorate. We acknowledge the use of public TESS Alert data from pipelines at the TESS Science Office and at the TESS Science Processing Operations Center. This research has made use of the Exoplanet Follow-up Observation Program website, which is operated by the California Institute of Technology, under contract with the National Aeronautics and Space Administration under the Exoplanet Exploration Program. This paper includes data collected by the TESS mission, which are publicly available from the Mikulski Archive for Space Telescopes (MAST).\r\n\r\nSoftware: Astropy (Astropy Collaboration et al. 2018), Matplotlib (Hunter 2007), DIAMONDS (Corsaro & De Ridder 2014), isoclassify (Huber et al. 2017), EXOFASTv2 (Eastman 2017), ktransit (Barclay 2018).","oa":1,"publisher":"IOP Publishing","quality_controlled":"1","year":"2019","publication":"The Astronomical Journal","day":"30","date_created":"2022-07-18T14:29:07Z","doi":"10.3847/1538-3881/ab1488","date_published":"2019-05-30T00:00:00Z","_id":"11616","type":"journal_article","article_type":"original","keyword":["Space and Planetary Science","Astronomy and Astrophysics"],"status":"public","date_updated":"2022-08-22T07:38:34Z","extern":"1","abstract":[{"text":"We present the discovery of HD 221416 b, the first transiting planet identified by the Transiting Exoplanet Survey Satellite (TESS) for which asteroseismology of the host star is possible. HD 221416 b (HIP 116158, TOI-197) is a bright (V = 8.2 mag), spectroscopically classified subgiant that oscillates with an average frequency of about 430 μHz and displays a clear signature of mixed modes. The oscillation amplitude confirms that the redder TESS bandpass compared to Kepler has a small effect on the oscillations, supporting the expected yield of thousands of solar-like oscillators with TESS 2 minute cadence observations. Asteroseismic modeling yields a robust determination of the host star radius (R⋆ = 2.943 ± 0.064 R⊙), mass (M⋆ = 1.212 ± 0.074 M⊙), and age (4.9 ± 1.1 Gyr), and demonstrates that it has just started ascending the red-giant branch. Combining asteroseismology with transit modeling and radial-velocity observations, we show that the planet is a \"hot Saturn\" (Rp = 9.17 ± 0.33 R⊕) with an orbital period of ∼14.3 days, irradiance of F = 343 ± 24 F⊕, and moderate mass (Mp = 60.5 ± 5.7 M⊕) and density (ρp = 0.431 ± 0.062 g cm−3). The properties of HD 221416 b show that the host-star metallicity–planet mass correlation found in sub-Saturns (4–8 R⊕) does not extend to larger radii, indicating that planets in the transition between sub-Saturns and Jupiters follow a relatively narrow range of densities. With a density measured to ∼15%, HD 221416 b is one of the best characterized Saturn-size planets to date, augmenting the small number of known transiting planets around evolved stars and demonstrating the power of TESS to characterize exoplanets and their host stars using asteroseismology.","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1901.01643"}],"scopus_import":"1","intvolume":" 157","month":"05","publication_status":"published","publication_identifier":{"issn":["0004-6256"]},"language":[{"iso":"eng"}],"issue":"6","volume":157},{"acknowledgement":"This paper includes data collected by the Kepler mission. Funding for the Kepler mission is provided by the NASA Science Mission directorate. Some of the data presented in this paper were obtained from the Mikulski Archive for Space Telescopes (MAST). STScI is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS5-26555. Partly Based on observations obtained with the HERMES spectrograph on the Mercator Telescope, which was supported by the Research Foundation—Flanders (FWO), Belgium, the Research Council of KU Leuven, Belgium, the Fonds National de la Recherche Scientifique (F.R.S.-FNRS), Belgium, the Royal Observatory of Belgium, the Observatoire de Genève, Switzerland, and the Thüringer Landessternwarte Tautenburg, Germany. SM acknowledges support by the National Aeronautics and Space Administration under Grant NNX15AF13G, by the National Science Foundation grant AST-1411685, and the Ramon y Cajal fellowship number RYC-2015-17697. RG acknowledges the support from PLATO and GOLF CNES grants. ÂS acknowledges the support from National Aeronautics and Space Administration under Grant NNX17AF27G. PB acknowledges the support of the MINECO under the fellowship program Juan de la Cierva Incorporacion (IJCI-2015-26034).","publisher":"Frontiers Media","quality_controlled":"1","oa":1,"year":"2019","day":"10","publication":"Frontiers in Astronomy and Space Sciences","doi":"10.3389/fspas.2019.00046","date_published":"2019-07-10T00:00:00Z","date_created":"2022-07-18T14:00:36Z","article_number":"46","citation":{"short":"S. Mathur, R.A. García, L.A. Bugnet, Â.R.G. Santos, N. Santiago, P.G. Beck, Frontiers in Astronomy and Space Sciences 6 (2019).","ieee":"S. Mathur, R. A. García, L. A. Bugnet, Â. R. G. Santos, N. Santiago, and P. G. Beck, “Revisiting the impact of stellar magnetic activity on the detectability of solar-like oscillations by Kepler,” Frontiers in Astronomy and Space Sciences, vol. 6. Frontiers Media, 2019.","apa":"Mathur, S., García, R. A., Bugnet, L. A., Santos, Â. R. G., Santiago, N., & Beck, P. G. (2019). Revisiting the impact of stellar magnetic activity on the detectability of solar-like oscillations by Kepler. Frontiers in Astronomy and Space Sciences. Frontiers Media. https://doi.org/10.3389/fspas.2019.00046","ama":"Mathur S, García RA, Bugnet LA, Santos ÂRG, Santiago N, Beck PG. Revisiting the impact of stellar magnetic activity on the detectability of solar-like oscillations by Kepler. Frontiers in Astronomy and Space Sciences. 2019;6. doi:10.3389/fspas.2019.00046","mla":"Mathur, Savita, et al. “Revisiting the Impact of Stellar Magnetic Activity on the Detectability of Solar-like Oscillations by Kepler.” Frontiers in Astronomy and Space Sciences, vol. 6, 46, Frontiers Media, 2019, doi:10.3389/fspas.2019.00046.","ista":"Mathur S, García RA, Bugnet LA, Santos ÂRG, Santiago N, Beck PG. 2019. Revisiting the impact of stellar magnetic activity on the detectability of solar-like oscillations by Kepler. Frontiers in Astronomy and Space Sciences. 6, 46.","chicago":"Mathur, Savita, Rafael A. García, Lisa Annabelle Bugnet, Ângela R.G. Santos, Netsha Santiago, and Paul G. Beck. “Revisiting the Impact of Stellar Magnetic Activity on the Detectability of Solar-like Oscillations by Kepler.” Frontiers in Astronomy and Space Sciences. Frontiers Media, 2019. https://doi.org/10.3389/fspas.2019.00046."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Savita","full_name":"Mathur, Savita","last_name":"Mathur"},{"last_name":"García","full_name":"García, Rafael A.","first_name":"Rafael A."},{"full_name":"Bugnet, Lisa Annabelle","orcid":"0000-0003-0142-4000","last_name":"Bugnet","first_name":"Lisa Annabelle","id":"d9edb345-f866-11ec-9b37-d119b5234501"},{"first_name":"Ângela R.G.","last_name":"Santos","full_name":"Santos, Ângela R.G."},{"first_name":"Netsha","last_name":"Santiago","full_name":"Santiago, Netsha"},{"first_name":"Paul G.","full_name":"Beck, Paul G.","last_name":"Beck"}],"article_processing_charge":"No","external_id":{"arxiv":["1907.01415"]},"title":"Revisiting the impact of stellar magnetic activity on the detectability of solar-like oscillations by Kepler","abstract":[{"text":"Over 2,000 stars were observed for 1 month with a high enough cadence in order to look for acoustic modes during the survey phase of the Kepler mission. Solar-like oscillations have been detected in about 540 stars. The question of why no oscillations were detected in the remaining stars is still open. Previous works explained the non-detection of modes with the high level of magnetic activity of the stars. However, the sample of stars studied contained some classical pulsators and red giants that could have biased the results. In this work, we revisit this analysis on a cleaner sample of main-sequence solar-like stars that consists of 1,014 stars. First we compute the predicted amplitude of the modes of that sample and for the stars with detected oscillation and compare it to the noise at high frequency in the power spectrum. We find that the stars with detected modes have an amplitude to noise ratio larger than 0.94. We measure reliable rotation periods and the associated photometric magnetic index for 684 stars out of the full sample and in particular for 323 stars where the amplitude of the modes is predicted to be high enough to be detected. We find that among these 323 stars 32% of them have a level of magnetic activity larger than the Sun during its maximum activity, explaining the non-detection of acoustic modes. Interestingly, magnetic activity cannot be the primary reason responsible for the absence of detectable modes in the remaining 68% of the stars without acoustic modes detected and with reliable rotation periods. Thus, we investigate metallicity, inclination angle of the rotation axis, and binarity as possible causes of low mode amplitudes. Using spectroscopic observations for a subsample, we find that a low metallicity could be the reason for suppressed modes. No clear correlation with binarity nor inclination is found. We also derive the lower limit for our photometric activity index (of 20–30 ppm) below which rotation and magnetic activity are not detected. Finally, with our analysis we conclude that stars with a photometric activity index larger than 2,000 ppm have 98.3% probability of not having oscillations detected.","lang":"eng"}],"oa_version":"Preprint","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1907.01415","open_access":"1"}],"month":"07","intvolume":" 6","publication_identifier":{"eissn":["2296-987X"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":6,"_id":"11613","article_type":"original","type":"journal_article","status":"public","keyword":["Astronomy and Astrophysics"],"date_updated":"2022-08-22T07:29:55Z","extern":"1"},{"intvolume":" 485","month":"06","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1903.00115"}],"scopus_import":"1","oa_version":"Preprint","abstract":[{"text":"The recently published Kepler mission Data Release 25 (DR25) reported on ∼197 000 targets observed during the mission. Despite this, no wide search for red giants showing solar-like oscillations have been made across all stars observed in Kepler’s long-cadence mode. In this work, we perform this task using custom apertures on the Kepler pixel files and detect oscillations in 21 914 stars, representing the largest sample of solar-like oscillating stars to date. We measure their frequency at maximum power, νmax, down to νmax≃4μHz and obtain log (g) estimates with a typical uncertainty below 0.05 dex, which is superior to typical measurements from spectroscopy. Additionally, the νmax distribution of our detections show good agreement with results from a simulated model of the Milky Way, with a ratio of observed to predicted stars of 0.992 for stars with 10<νmax<270μHz. Among our red giant detections, we find 909 to be dwarf/subgiant stars whose flux signal is polluted by a neighbouring giant as a result of using larger photometric apertures than those used by the NASA Kepler science processing pipeline. We further find that only 293 of the polluting giants are known Kepler targets. The remainder comprises over 600 newly identified oscillating red giants, with many expected to belong to the Galactic halo, serendipitously falling within the Kepler pixel files of targeted stars.","lang":"eng"}],"issue":"4","volume":485,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0035-8711"],"eissn":["1365-2966"]},"keyword":["Space and Planetary Science","Astronomy and Astrophysics","asteroseismology","methods: data analysis","techniques: image processing","stars: oscillations","stars: statistics"],"status":"public","article_type":"original","type":"journal_article","_id":"11615","extern":"1","date_updated":"2022-08-22T07:35:19Z","oa":1,"publisher":"Oxford University Press","quality_controlled":"1","acknowledgement":"Funding for this Discovery mission is provided by NASA’s Science mission Directorate. We thank the entire Kepler team without whom this investigation would not be possible. DS is the recipient of an Australian Research Council Future Fellowship (project number FT1400147). RAG acknowledges the support from CNES. SM acknowledges support from NASA grant NNX15AF13G, NSF grant AST-1411685, and the Ramon y Cajal fellowship number RYC-2015-17697. ILC acknowledges scholarship support from the University of Sydney. We would like to thank Nicholas Barbara and Timothy Bedding for providing us with a list of variable stars that helped to validate a number of detections in this study. We also thank the group at the University of Sydney for fruitful discussions. Finally, we gratefully acknowledge the support of NVIDIA Corporation with the donation of the Titan Xp GPU used for this research.","date_created":"2022-07-18T14:26:03Z","doi":"10.1093/mnras/stz622","date_published":"2019-06-01T00:00:00Z","page":"5616-5630","publication":"Monthly Notices of the Royal Astronomical Society","day":"01","year":"2019","title":"A search for red giant solar-like oscillations in all Kepler data","article_processing_charge":"No","external_id":{"arxiv":["1903.00115"]},"author":[{"full_name":"Hon, Marc","last_name":"Hon","first_name":"Marc"},{"full_name":"Stello, Dennis","last_name":"Stello","first_name":"Dennis"},{"first_name":"Rafael A","last_name":"García","full_name":"García, Rafael A"},{"last_name":"Mathur","full_name":"Mathur, Savita","first_name":"Savita"},{"full_name":"Sharma, Sanjib","last_name":"Sharma","first_name":"Sanjib"},{"first_name":"Isabel L","last_name":"Colman","full_name":"Colman, Isabel L"},{"last_name":"Bugnet","orcid":"0000-0003-0142-4000","full_name":"Bugnet, Lisa Annabelle","id":"d9edb345-f866-11ec-9b37-d119b5234501","first_name":"Lisa Annabelle"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Hon M, Stello D, García RA, et al. A search for red giant solar-like oscillations in all Kepler data. Monthly Notices of the Royal Astronomical Society. 2019;485(4):5616-5630. doi:10.1093/mnras/stz622","apa":"Hon, M., Stello, D., García, R. A., Mathur, S., Sharma, S., Colman, I. L., & Bugnet, L. A. (2019). A search for red giant solar-like oscillations in all Kepler data. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stz622","short":"M. Hon, D. Stello, R.A. García, S. Mathur, S. Sharma, I.L. Colman, L.A. Bugnet, Monthly Notices of the Royal Astronomical Society 485 (2019) 5616–5630.","ieee":"M. Hon et al., “A search for red giant solar-like oscillations in all Kepler data,” Monthly Notices of the Royal Astronomical Society, vol. 485, no. 4. Oxford University Press, pp. 5616–5630, 2019.","mla":"Hon, Marc, et al. “A Search for Red Giant Solar-like Oscillations in All Kepler Data.” Monthly Notices of the Royal Astronomical Society, vol. 485, no. 4, Oxford University Press, 2019, pp. 5616–30, doi:10.1093/mnras/stz622.","ista":"Hon M, Stello D, García RA, Mathur S, Sharma S, Colman IL, Bugnet LA. 2019. A search for red giant solar-like oscillations in all Kepler data. Monthly Notices of the Royal Astronomical Society. 485(4), 5616–5630.","chicago":"Hon, Marc, Dennis Stello, Rafael A García, Savita Mathur, Sanjib Sharma, Isabel L Colman, and Lisa Annabelle Bugnet. “A Search for Red Giant Solar-like Oscillations in All Kepler Data.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2019. https://doi.org/10.1093/mnras/stz622."}},{"month":"04","intvolume":" 624","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1902.09854"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"The NASA Transiting Exoplanet Survey Satellite (TESS) is about to provide full-frame images of almost the entire sky. The amount of stellar data to be analysed represents hundreds of millions stars, which is several orders of magnitude more than the number of stars observed by the Convection, Rotation and planetary Transits satellite (CoRoT), and NASA Kepler and K2 missions. We aim at automatically classifying the newly observed stars with near real-time algorithms to better guide the subsequent detailed studies. In this paper, we present a classification algorithm built to recognise solar-like pulsators among classical pulsators. This algorithm relies on the global amount of power contained in the power spectral density (PSD), also known as the flicker in spectral power density (FliPer). Because each type of pulsating star has a characteristic background or pulsation pattern, the shape of the PSD at different frequencies can be used to characterise the type of pulsating star. The FliPer classifier (FliPerClass) uses different FliPer parameters along with the effective temperature as input parameters to feed a ML algorithm in order to automatically classify the pulsating stars observed by TESS. Using noisy TESS-simulated data from the TESS Asteroseismic Science Consortium (TASC), we classify pulsators with a 98% accuracy. Among them, solar-like pulsating stars are recognised with a 99% accuracy, which is of great interest for a further seismic analysis of these stars, which are like our Sun. Similar results are obtained when we trained our classifier and applied it to 27-day subsets of real Kepler data. FliPerClass is part of the large TASC classification pipeline developed by the TESS Data for Asteroseismology (T’DA) classification working group."}],"volume":624,"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1432-0746"],"issn":["0004-6361"]},"publication_status":"published","status":"public","keyword":["Space and Planetary Science","Astronomy and Astrophysics"],"article_type":"original","type":"journal_article","_id":"11614","extern":"1","date_updated":"2022-08-22T07:32:51Z","publisher":"EDP Science","quality_controlled":"1","oa":1,"acknowledgement":"We thank the enitre T’DA team for useful comments and discussions, in particular Andrew Tkachenko. We also acknowledge Marc Hon, Keaton Bell, and James Kuszlewicz for useful comments on the manuscript. L.B. and R.A.G. acknowledge the support from PLATO and GOLF CNES grants. S.M. acknowledges support by the Ramon y Cajal fellowship number RYC-2015-17697. O.J.H. and B.M.R. acknowledge the support of the UK Science and Technology Facilities Council (STFC). M.N.L. acknowledges the support of the ESA PRODEX programme (PEA 4000119301). Funding for the Stellar Astrophysics Centre is provided by the Danish National Research Foundation (Grant DNRF106).","date_published":"2019-04-19T00:00:00Z","doi":"10.1051/0004-6361/201834780","date_created":"2022-07-18T14:13:34Z","day":"19","publication":"Astronomy & Astrophysics","year":"2019","article_number":"A79","title":"FliPerClass: In search of solar-like pulsators among TESS targets","author":[{"orcid":"0000-0003-0142-4000","full_name":"Bugnet, Lisa Annabelle","last_name":"Bugnet","id":"d9edb345-f866-11ec-9b37-d119b5234501","first_name":"Lisa Annabelle"},{"first_name":"R. A.","last_name":"García","full_name":"García, R. A."},{"first_name":"S.","last_name":"Mathur","full_name":"Mathur, S."},{"last_name":"Davies","full_name":"Davies, G. R.","first_name":"G. R."},{"full_name":"Hall, O. J.","last_name":"Hall","first_name":"O. J."},{"full_name":"Lund, M. N.","last_name":"Lund","first_name":"M. N."},{"full_name":"Rendle, B. M.","last_name":"Rendle","first_name":"B. M."}],"article_processing_charge":"No","external_id":{"arxiv":["1902.09854"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Bugnet, Lisa Annabelle, R. A. García, S. Mathur, G. R. Davies, O. J. Hall, M. N. Lund, and B. M. Rendle. “FliPerClass: In Search of Solar-like Pulsators among TESS Targets.” Astronomy & Astrophysics. EDP Science, 2019. https://doi.org/10.1051/0004-6361/201834780.","ista":"Bugnet LA, García RA, Mathur S, Davies GR, Hall OJ, Lund MN, Rendle BM. 2019. FliPerClass: In search of solar-like pulsators among TESS targets. Astronomy & Astrophysics. 624, A79.","mla":"Bugnet, Lisa Annabelle, et al. “FliPerClass: In Search of Solar-like Pulsators among TESS Targets.” Astronomy & Astrophysics, vol. 624, A79, EDP Science, 2019, doi:10.1051/0004-6361/201834780.","ieee":"L. A. Bugnet et al., “FliPerClass: In search of solar-like pulsators among TESS targets,” Astronomy & Astrophysics, vol. 624. EDP Science, 2019.","short":"L.A. Bugnet, R.A. García, S. Mathur, G.R. Davies, O.J. Hall, M.N. Lund, B.M. Rendle, Astronomy & Astrophysics 624 (2019).","apa":"Bugnet, L. A., García, R. A., Mathur, S., Davies, G. R., Hall, O. J., Lund, M. N., & Rendle, B. M. (2019). FliPerClass: In search of solar-like pulsators among TESS targets. Astronomy & Astrophysics. EDP Science. https://doi.org/10.1051/0004-6361/201834780","ama":"Bugnet LA, García RA, Mathur S, et al. FliPerClass: In search of solar-like pulsators among TESS targets. Astronomy & Astrophysics. 2019;624. doi:10.1051/0004-6361/201834780"}},{"article_type":"original","type":"journal_article","status":"public","keyword":["Space and Planetary Science","Astronomy and Astrophysics","methods: data analysis","stars: activity","stars: low-mass","stars: rotation","starspots","techniques: photometric"],"_id":"11623","date_updated":"2022-08-22T08:10:38Z","extern":"1","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1908.05222","open_access":"1"}],"month":"09","intvolume":" 244","abstract":[{"text":"Brightness variations due to dark spots on the stellar surface encode information about stellar surface rotation and magnetic activity. In this work, we analyze the Kepler long-cadence data of 26,521 main-sequence stars of spectral types M and K in order to measure their surface rotation and photometric activity level. Rotation-period estimates are obtained by the combination of a wavelet analysis and autocorrelation function of the light curves. Reliable rotation estimates are determined by comparing the results from the different rotation diagnostics and four data sets. We also measure the photometric activity proxy Sph using the amplitude of the flux variations on an appropriate timescale. We report rotation periods and photometric activity proxies for about 60% of the sample, including 4431 targets for which McQuillan et al. did not report a rotation period. For the common targets with rotation estimates in this study and in McQuillan et al., our rotation periods agree within 99%. In this work, we also identify potential polluters, such as misclassified red giants and classical pulsator candidates. Within the parameter range we study, there is a mild tendency for hotter stars to have shorter rotation periods. The photometric activity proxy spans a wider range of values with increasing effective temperature. The rotation period and photometric activity proxy are also related, with Sph being larger for fast rotators. Similar to McQuillan et al., we find a bimodal distribution of rotation periods.","lang":"eng"}],"oa_version":"Preprint","issue":"1","volume":244,"publication_identifier":{"issn":["0067-0049"]},"publication_status":"published","language":[{"iso":"eng"}],"article_number":"21","author":[{"first_name":"A. R. G.","last_name":"Santos","full_name":"Santos, A. R. G."},{"full_name":"García, R. A.","last_name":"García","first_name":"R. A."},{"full_name":"Mathur, S.","last_name":"Mathur","first_name":"S."},{"last_name":"Bugnet","full_name":"Bugnet, Lisa Annabelle","orcid":"0000-0003-0142-4000","first_name":"Lisa Annabelle","id":"d9edb345-f866-11ec-9b37-d119b5234501"},{"first_name":"J. L.","full_name":"van Saders, J. L.","last_name":"van Saders"},{"first_name":"T. S.","last_name":"Metcalfe","full_name":"Metcalfe, T. S."},{"first_name":"G. V. A.","full_name":"Simonian, G. V. A.","last_name":"Simonian"},{"first_name":"M. H.","full_name":"Pinsonneault, M. H.","last_name":"Pinsonneault"}],"article_processing_charge":"No","external_id":{"arxiv":["1908.05222"]},"title":"Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence stars","citation":{"mla":"Santos, A. R. G., et al. “Surface Rotation and Photometric Activity for Kepler Targets. I. M and K Main-Sequence Stars.” The Astrophysical Journal Supplement Series, vol. 244, no. 1, 21, IOP Publishing, 2019, doi:10.3847/1538-4365/ab3b56.","short":"A.R.G. Santos, R.A. García, S. Mathur, L.A. Bugnet, J.L. van Saders, T.S. Metcalfe, G.V.A. Simonian, M.H. Pinsonneault, The Astrophysical Journal Supplement Series 244 (2019).","ieee":"A. R. G. Santos et al., “Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence stars,” The Astrophysical Journal Supplement Series, vol. 244, no. 1. IOP Publishing, 2019.","apa":"Santos, A. R. G., García, R. A., Mathur, S., Bugnet, L. A., van Saders, J. L., Metcalfe, T. S., … Pinsonneault, M. H. (2019). Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence stars. The Astrophysical Journal Supplement Series. IOP Publishing. https://doi.org/10.3847/1538-4365/ab3b56","ama":"Santos ARG, García RA, Mathur S, et al. Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence stars. The Astrophysical Journal Supplement Series. 2019;244(1). doi:10.3847/1538-4365/ab3b56","chicago":"Santos, A. R. G., R. A. García, S. Mathur, Lisa Annabelle Bugnet, J. L. van Saders, T. S. Metcalfe, G. V. A. Simonian, and M. H. Pinsonneault. “Surface Rotation and Photometric Activity for Kepler Targets. I. M and K Main-Sequence Stars.” The Astrophysical Journal Supplement Series. IOP Publishing, 2019. https://doi.org/10.3847/1538-4365/ab3b56.","ista":"Santos ARG, García RA, Mathur S, Bugnet LA, van Saders JL, Metcalfe TS, Simonian GVA, Pinsonneault MH. 2019. Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence stars. The Astrophysical Journal Supplement Series. 244(1), 21."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"IOP Publishing","quality_controlled":"1","oa":1,"acknowledgement":"The authors thank Róbert Szabó Paul G. Beck, Katrien Kolenberg, and Isabel L. Colman for helping on the classification of stars. This paper includes data collected by the Kepler mission and obtained from the MAST data archive at the Space Telescope Science Institute (STScI). Funding for the Kepler mission is provided by the National Aeronautics and Space Administration (NASA) Science Mission Directorate. STScI is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5–26555. A.R.G.S. acknowledges the support from NASA under grant NNX17AF27G. R.A.G. and L.B. acknowledge the support from PLATO and GOLF CNES grants. S.M. acknowledges the support from the Ramon y Cajal fellowship number RYC-2015-17697. T.S.M. acknowledges support from a Visiting Fellowship at the Max Planck Institute for Solar System Research. This research has made use of the NASA Exoplanet Archive, which is operated by the California Institute of Technology, under contract with the National Aeronautics and Space Administration under the Exoplanet Exploration Program.\r\n\r\nSoftware: KADACS (García et al. 2011), NumPy (van der Walt et al. 2011), SciPy (Jones et al. 2001), Matplotlib (Hunter 2007).\r\n\r\nFacilities: MAST - , Kepler Eclipsing Binary Catalog - , Exoplanet Archive. -","doi":"10.3847/1538-4365/ab3b56","date_published":"2019-09-19T00:00:00Z","date_created":"2022-07-19T09:21:58Z","year":"2019","day":"19","publication":"The Astrophysical Journal Supplement Series"},{"_id":"11627","article_number":"1906.09609","type":"preprint","status":"public","keyword":["asteroseismology","rotation","solar-like stars","kepler","machine learning","random forest"],"citation":{"mla":"Breton, S. N., et al. “Determining Surface Rotation Periods of Solar-like Stars Observed by the Kepler Mission Using Machine Learning Techniques.” ArXiv, 1906.09609, doi:10.48550/arXiv.1906.09609.","ama":"Breton SN, Bugnet LA, Santos ARG, et al. Determining surface rotation periods of solar-like stars observed by the Kepler mission using machine learning techniques. arXiv. doi:10.48550/arXiv.1906.09609","apa":"Breton, S. N., Bugnet, L. A., Santos, A. R. G., Saux, A. L., Mathur, S., Palle, P. L., & Garcia, R. A. (n.d.). Determining surface rotation periods of solar-like stars observed by the Kepler mission using machine learning techniques. arXiv. https://doi.org/10.48550/arXiv.1906.09609","ieee":"S. N. Breton et al., “Determining surface rotation periods of solar-like stars observed by the Kepler mission using machine learning techniques,” arXiv. .","short":"S.N. Breton, L.A. Bugnet, A.R.G. Santos, A.L. Saux, S. Mathur, P.L. Palle, R.A. Garcia, ArXiv (n.d.).","chicago":"Breton, S. N., Lisa Annabelle Bugnet, A. R. G. Santos, A. Le Saux, S. Mathur, P. L. Palle, and R. A. Garcia. “Determining Surface Rotation Periods of Solar-like Stars Observed by the Kepler Mission Using Machine Learning Techniques.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1906.09609.","ista":"Breton SN, Bugnet LA, Santos ARG, Saux AL, Mathur S, Palle PL, Garcia RA. Determining surface rotation periods of solar-like stars observed by the Kepler mission using machine learning techniques. arXiv, 1906.09609."},"date_updated":"2022-08-22T08:16:53Z","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"S. N.","last_name":"Breton","full_name":"Breton, S. N."},{"orcid":"0000-0003-0142-4000","full_name":"Bugnet, Lisa Annabelle","last_name":"Bugnet","first_name":"Lisa Annabelle","id":"d9edb345-f866-11ec-9b37-d119b5234501"},{"first_name":"A. R. G.","full_name":"Santos, A. R. G.","last_name":"Santos"},{"last_name":"Saux","full_name":"Saux, A. Le","first_name":"A. Le"},{"last_name":"Mathur","full_name":"Mathur, S.","first_name":"S."},{"first_name":"P. L.","full_name":"Palle, P. L.","last_name":"Palle"},{"last_name":"Garcia","full_name":"Garcia, R. A.","first_name":"R. A."}],"external_id":{"arxiv":["1906.09609"]},"article_processing_charge":"No","title":"Determining surface rotation periods of solar-like stars observed by the Kepler mission using machine learning techniques","abstract":[{"text":"For a solar-like star, the surface rotation evolves with time, allowing in principle to estimate the age of a star from its surface rotation period. Here we are interested in measuring surface rotation periods of solar-like stars observed by the NASA mission Kepler. Different methods have been developed to track rotation signals in Kepler photometric light curves: time-frequency analysis based on wavelet techniques, autocorrelation and composite spectrum. We use the learning abilities of random forest classifiers to take decisions during two crucial steps of the analysis. First, given some input parameters, we discriminate the considered Kepler targets between rotating MS stars, non-rotating MS stars, red giants, binaries and pulsators. We then use a second classifier only on the MS rotating targets to decide the best data analysis treatment.","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/1906.09609","open_access":"1"}],"oa":1,"month":"06","publication_status":"submitted","year":"2019","day":"23","language":[{"iso":"eng"}],"publication":"arXiv","date_published":"2019-06-23T00:00:00Z","doi":"10.48550/arXiv.1906.09609","date_created":"2022-07-20T11:18:53Z"},{"oa_version":"Preprint","abstract":[{"lang":"eng","text":"The second mission of NASA’s Kepler satellite, K2, has collected hundreds of thousands of lightcurves for stars close to the ecliptic plane. This new sample could increase the number of known pulsating stars and then improve our understanding of those stars. For the moment only a few stars have been properly classified and published. In this work, we present a method to automaticly classify K2 pulsating stars using a Machine Learning technique called Random Forest. The objective is to sort out the stars in four classes: red giant (RG), main-sequence Solar-like stars (SL), classical pulsators (PULS) and Other. To do this we use the effective temperatures and the luminosities of the stars as well as the FliPer features, that measures the amount of power contained in the power spectral density. The classifier now retrieves the right classification for more than 80% of the stars."}],"month":"06","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1906.09611"}],"day":"23","publication":"arXiv","language":[{"iso":"eng"}],"publication_status":"submitted","year":"2019","doi":"10.48550/arXiv.1906.09611","date_published":"2019-06-23T00:00:00Z","date_created":"2022-07-21T06:57:10Z","article_number":"1906.09611","_id":"11630","status":"public","keyword":["asteroseismology - methods","data analysis - thecniques","machine learning - stars","oscillations"],"type":"preprint","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Saux, A. Le, Lisa Annabelle Bugnet, S. Mathur, S. N. Breton, and R. A. Garcia. “Automatic Classification of K2 Pulsating Stars Using Machine Learning Techniques.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1906.09611.","ista":"Saux AL, Bugnet LA, Mathur S, Breton SN, Garcia RA. Automatic classification of K2 pulsating stars using machine learning techniques. arXiv, 1906.09611.","mla":"Saux, A. Le, et al. “Automatic Classification of K2 Pulsating Stars Using Machine Learning Techniques.” ArXiv, 1906.09611, doi:10.48550/arXiv.1906.09611.","apa":"Saux, A. L., Bugnet, L. A., Mathur, S., Breton, S. N., & Garcia, R. A. (n.d.). Automatic classification of K2 pulsating stars using machine learning techniques. arXiv. https://doi.org/10.48550/arXiv.1906.09611","ama":"Saux AL, Bugnet LA, Mathur S, Breton SN, Garcia RA. Automatic classification of K2 pulsating stars using machine learning techniques. arXiv. doi:10.48550/arXiv.1906.09611","ieee":"A. L. Saux, L. A. Bugnet, S. Mathur, S. N. Breton, and R. A. Garcia, “Automatic classification of K2 pulsating stars using machine learning techniques,” arXiv. .","short":"A.L. Saux, L.A. Bugnet, S. Mathur, S.N. Breton, R.A. Garcia, ArXiv (n.d.)."},"date_updated":"2022-08-22T08:20:29Z","title":"Automatic classification of K2 pulsating stars using machine learning techniques","author":[{"full_name":"Saux, A. Le","last_name":"Saux","first_name":"A. Le"},{"orcid":"0000-0003-0142-4000","full_name":"Bugnet, Lisa Annabelle","last_name":"Bugnet","id":"d9edb345-f866-11ec-9b37-d119b5234501","first_name":"Lisa Annabelle"},{"last_name":"Mathur","full_name":"Mathur, S.","first_name":"S."},{"last_name":"Breton","full_name":"Breton, S. N.","first_name":"S. N."},{"last_name":"Garcia","full_name":"Garcia, R. A.","first_name":"R. A."}],"external_id":{"arxiv":["1906.09611"]},"article_processing_charge":"No"},{"article_number":"13","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Ancona, Bertie, et al. “Algorithms and Hardness for Diameter in Dynamic Graphs.” 46th International Colloquium on Automata, Languages, and Programming, vol. 132, 13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.ICALP.2019.13.","ama":"Ancona B, Henzinger MH, Roditty L, Williams VV, Wein N. Algorithms and hardness for diameter in dynamic graphs. In: 46th International Colloquium on Automata, Languages, and Programming. Vol 132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.ICALP.2019.13","apa":"Ancona, B., Henzinger, M. H., Roditty, L., Williams, V. V., & Wein, N. (2019). Algorithms and hardness for diameter in dynamic graphs. In 46th International Colloquium on Automata, Languages, and Programming (Vol. 132). Patras, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ICALP.2019.13","ieee":"B. Ancona, M. H. Henzinger, L. Roditty, V. V. Williams, and N. Wein, “Algorithms and hardness for diameter in dynamic graphs,” in 46th International Colloquium on Automata, Languages, and Programming, Patras, Greece, 2019, vol. 132.","short":"B. Ancona, M.H. Henzinger, L. Roditty, V.V. Williams, N. Wein, in:, 46th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","chicago":"Ancona, Bertie, Monika H Henzinger, Liam Roditty, Virginia Vassilevska Williams, and Nicole Wein. “Algorithms and Hardness for Diameter in Dynamic Graphs.” In 46th International Colloquium on Automata, Languages, and Programming, Vol. 132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.ICALP.2019.13.","ista":"Ancona B, Henzinger MH, Roditty L, Williams VV, Wein N. 2019. Algorithms and hardness for diameter in dynamic graphs. 46th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 132, 13."},"title":"Algorithms and hardness for diameter in dynamic graphs","external_id":{"arxiv":["811.12527"]},"article_processing_charge":"No","author":[{"first_name":"Bertie","full_name":"Ancona, Bertie","last_name":"Ancona"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"first_name":"Liam","last_name":"Roditty","full_name":"Roditty, Liam"},{"first_name":"Virginia Vassilevska","full_name":"Williams, Virginia Vassilevska","last_name":"Williams"},{"full_name":"Wein, Nicole","last_name":"Wein","first_name":"Nicole"}],"oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication":"46th International Colloquium on Automata, Languages, and Programming","day":"04","year":"2019","date_created":"2022-08-12T08:14:51Z","date_published":"2019-07-04T00:00:00Z","doi":"10.4230/LIPICS.ICALP.2019.13","_id":"11826","status":"public","conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming","end_date":"2019-07-12","location":"Patras, Greece","start_date":"2019-07-09"},"type":"conference","extern":"1","date_updated":"2023-02-16T10:48:24Z","oa_version":"Published Version","abstract":[{"text":"The diameter, radius and eccentricities are natural graph parameters. While these problems have been studied extensively, there are no known dynamic algorithms for them beyond the ones that follow from trivial recomputation after each update or from solving dynamic All-Pairs Shortest Paths (APSP), which is very computationally intensive. This is the situation for dynamic approximation algorithms as well, and even if only edge insertions or edge deletions need to be supported.\r\nThis paper provides a comprehensive study of the dynamic approximation of Diameter, Radius and Eccentricities, providing both conditional lower bounds, and new algorithms whose bounds are optimal under popular hypotheses in fine-grained complexity. Some of the highlights include:\r\n- Under popular hardness hypotheses, there can be no significantly better fully dynamic approximation algorithms than recomputing the answer after each update, or maintaining full APSP.\r\n- Nearly optimal partially dynamic (incremental/decremental) algorithms can be achieved via efficient reductions to (incremental/decremental) maintenance of Single-Source Shortest Paths. For instance, a nearly (3/2+epsilon)-approximation to Diameter in directed or undirected n-vertex, m-edge graphs can be maintained decrementally in total time m^{1+o(1)}sqrt{n}/epsilon^2. This nearly matches the static 3/2-approximation algorithm for the problem that is known to be conditionally optimal.","lang":"eng"}],"intvolume":" 132","month":"07","main_file_link":[{"url":"https://doi.org/10.4230/LIPIcs.ICALP.2019.13","open_access":"1"}],"scopus_import":"1","alternative_title":["LIPIcs"],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-109-2"]},"volume":132},{"date_updated":"2023-02-17T09:41:45Z","citation":{"mla":"Henzinger, Monika H., et al. “Efficient Distributed Workload (Re-)Embedding.” SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2019, pp. 43–44, doi:10.1145/3309697.3331503.","apa":"Henzinger, M. H., Neumann, S., & Schmid, S. (2019). Efficient distributed workload (re-)embedding. In SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems (pp. 43–44). Phoenix, AZ, United States: Association for Computing Machinery. https://doi.org/10.1145/3309697.3331503","ama":"Henzinger MH, Neumann S, Schmid S. Efficient distributed workload (re-)embedding. In: SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems. Association for Computing Machinery; 2019:43–44. doi:10.1145/3309697.3331503","ieee":"M. H. Henzinger, S. Neumann, and S. Schmid, “Efficient distributed workload (re-)embedding,” in SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems, Phoenix, AZ, United States, 2019, pp. 43–44.","short":"M.H. Henzinger, S. Neumann, S. Schmid, in:, SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2019, pp. 43–44.","chicago":"Henzinger, Monika H, Stefan Neumann, and Stefan Schmid. “Efficient Distributed Workload (Re-)Embedding.” In SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems, 43–44. Association for Computing Machinery, 2019. https://doi.org/10.1145/3309697.3331503.","ista":"Henzinger MH, Neumann S, Schmid S. 2019. Efficient distributed workload (re-)embedding. SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems. SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems, 43–44."},"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"last_name":"Neumann","full_name":"Neumann, Stefan","first_name":"Stefan"},{"first_name":"Stefan","full_name":"Schmid, Stefan","last_name":"Schmid"}],"external_id":{"arxiv":["1904.05474"]},"article_processing_charge":"No","title":"Efficient distributed workload (re-)embedding","_id":"11850","type":"conference","conference":{"end_date":"2019-06-28","location":"Phoenix, AZ, United States","start_date":"2019-06-24","name":"SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems"},"status":"public","publication_identifier":{"isbn":["978-1-4503-6678-6"]},"year":"2019","publication_status":"published","day":"20","language":[{"iso":"eng"}],"publication":"SIGMETRICS'19: International Conference on Measurement and Modeling of Computer Systems","page":"43–44","date_published":"2019-06-20T00:00:00Z","doi":"10.1145/3309697.3331503","date_created":"2022-08-16T07:14:57Z","abstract":[{"text":"Modern networked systems are increasingly reconfigurable, enabling demand-aware infrastructures whose resources can be adjusted according to the workload they currently serve. Such dynamic adjustments can be exploited to improve network utilization and hence performance, by moving frequently interacting communication partners closer, e.g., collocating them in the same server or datacenter. However, dynamically changing the embedding of workloads is algorithmically challenging: communication patterns are often not known ahead of time, but must be learned. During the learning process, overheads related to unnecessary moves (i.e., re-embeddings) should be minimized. This paper studies a fundamental model which captures the tradeoff between the benefits and costs of dynamically collocating communication partners on l servers, in an online manner. Our main contribution is a distributed online algorithm which is asymptotically almost optimal, i.e., almost matches the lower bound (also derived in this paper) on the competitive ratio of any (distributed or centralized) online algorithm.","lang":"eng"}],"oa_version":"Preprint","scopus_import":"1","quality_controlled":"1","publisher":"Association for Computing Machinery","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1904.05474"}],"oa":1,"month":"06"},{"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-17T09:50:37Z","citation":{"chicago":"Bhattacharya, Sayan, Monika H Henzinger, and Danupon Nanongkai. “A New Deterministic Algorithm for Dynamic Set Cover.” In 60th Annual Symposium on Foundations of Computer Science, 406–23. Institute of Electrical and Electronics Engineers, 2019. https://doi.org/10.1109/focs.2019.00033.","ista":"Bhattacharya S, Henzinger MH, Nanongkai D. 2019. A new deterministic algorithm for dynamic set cover. 60th Annual Symposium on Foundations of Computer Science. FOCS: Annual Symposium on Foundations of Computer Science, 406–423.","mla":"Bhattacharya, Sayan, et al. “A New Deterministic Algorithm for Dynamic Set Cover.” 60th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2019, pp. 406–23, doi:10.1109/focs.2019.00033.","ama":"Bhattacharya S, Henzinger MH, Nanongkai D. A new deterministic algorithm for dynamic set cover. In: 60th Annual Symposium on Foundations of Computer Science. Institute of Electrical and Electronics Engineers; 2019:406-423. doi:10.1109/focs.2019.00033","apa":"Bhattacharya, S., Henzinger, M. H., & Nanongkai, D. (2019). A new deterministic algorithm for dynamic set cover. In 60th Annual Symposium on Foundations of Computer Science (pp. 406–423). Baltimore, MD, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/focs.2019.00033","ieee":"S. Bhattacharya, M. H. Henzinger, and D. Nanongkai, “A new deterministic algorithm for dynamic set cover,” in 60th Annual Symposium on Foundations of Computer Science, Baltimore, MD, United States, 2019, pp. 406–423.","short":"S. Bhattacharya, M.H. Henzinger, D. Nanongkai, in:, 60th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2019, pp. 406–423."},"title":"A new deterministic algorithm for dynamic set cover","author":[{"full_name":"Bhattacharya, Sayan","last_name":"Bhattacharya","first_name":"Sayan"},{"last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"full_name":"Nanongkai, Danupon","last_name":"Nanongkai","first_name":"Danupon"}],"external_id":{"arxiv":["1909.11600"]},"article_processing_charge":"No","_id":"11853","status":"public","type":"conference","conference":{"name":"FOCS: Annual Symposium on Foundations of Computer Science","end_date":"2019-11-12","location":"Baltimore, MD, United States","start_date":"2019-11-09"},"day":"01","language":[{"iso":"eng"}],"publication":"60th Annual Symposium on Foundations of Computer Science","publication_identifier":{"eisbn":["978-1-7281-4952-3"],"issn":["2575-8454"],"isbn":["978-1-7281-4953-0"]},"publication_status":"published","year":"2019","doi":"10.1109/focs.2019.00033","date_published":"2019-11-01T00:00:00Z","date_created":"2022-08-16T08:00:00Z","page":"406-423","oa_version":"Preprint","abstract":[{"lang":"eng","text":"We present a deterministic dynamic algorithm for maintaining a (1+ε)f-approximate minimum cost set cover with O(f log(Cn)/ε^2) amortized update time, when the input set system is undergoing element insertions and deletions. Here, n denotes the number of elements, each element appears in at most f sets, and the cost of each set lies in the range [1/C, 1]. Our result, together with that of Gupta~et~al.~[STOC'17], implies that there is a deterministic algorithm for this problem with O(f log(Cn)) amortized update time and O(min(log n, f)) -approximation ratio, which nearly matches the polynomial-time hardness of approximation for minimum set cover in the static setting. Our update time is only O(log (Cn)) away from a trivial lower bound. Prior to our work, the previous best approximation ratio guaranteed by deterministic algorithms was O(f^2), which was due to Bhattacharya~et~al.~[ICALP`15]. In contrast, the only result that guaranteed O(f) -approximation was obtained very recently by Abboud~et~al.~[STOC`19], who designed a dynamic algorithm with (1+ε)f-approximation ratio and O(f^2 log n/ε) amortized update time. Besides the extra O(f) factor in the update time compared to our and Gupta~et~al.'s results, the Abboud~et~al.~algorithm is randomized, and works only when the adversary is oblivious and the sets are unweighted (each set has the same cost). We achieve our result via the primal-dual approach, by maintaining a fractional packing solution as a dual certificate. This approach was pursued previously by Bhattacharya~et~al.~and Gupta~et~al., but not in the recent paper by Abboud~et~al. Unlike previous primal-dual algorithms that try to satisfy some local constraints for individual sets at all time, our algorithm basically waits until the dual solution changes significantly globally, and fixes the solution only where the fix is needed."}],"month":"11","quality_controlled":"1","scopus_import":"1","publisher":"Institute of Electrical and Electronics Engineers","main_file_link":[{"url":"https://arxiv.org/abs/1909.11600","open_access":"1"}],"oa":1},{"publication":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","language":[{"iso":"eng"}],"day":"01","publication_status":"published","year":"2019","publication_identifier":{"issn":["0737-8017"],"isbn":["978-1-4503-6705-9"]},"date_created":"2022-08-16T09:11:17Z","doi":"10.1145/3313276.3316346","date_published":"2019-06-01T00:00:00Z","page":"343–354","oa_version":"Preprint","abstract":[{"text":"We present the first sublinear-time algorithm that can compute the edge connectivity λ of a network exactly on distributed message-passing networks (the CONGEST model), as long as the network contains no multi-edge. We present the first sublinear-time algorithm for a distributed message-passing network sto compute its edge connectivity λ exactly in the CONGEST model, as long as there are no parallel edges. Our algorithm takes Õ(n1−1/353D1/353+n1−1/706) time to compute λ and a cut of cardinality λ with high probability, where n and D are the number of nodes and the diameter of the network, respectively, and Õ hides polylogarithmic factors. This running time is sublinear in n (i.e. Õ(n1−є)) whenever D is. Previous sublinear-time distributed algorithms can solve this problem either (i) exactly only when λ=O(n1/8−є) [Thurimella PODC’95; Pritchard, Thurimella, ACM Trans. Algorithms’11; Nanongkai, Su, DISC’14] or (ii) approximately [Ghaffari, Kuhn, DISC’13; Nanongkai, Su, DISC’14]. To achieve this we develop and combine several new techniques. First, we design the first distributed algorithm that can compute a k-edge connectivity certificate for any k=O(n1−є) in time Õ(√nk+D). The previous sublinear-time algorithm can do so only when k=o(√n) [Thurimella PODC’95]. In fact, our algorithm can be turned into the first parallel algorithm with polylogarithmic depth and near-linear work. Previous near-linear work algorithms are essentially sequential and previous polylogarithmic-depth algorithms require Ω(mk) work in the worst case (e.g. [Karger, Motwani, STOC’93]). Second, we show that by combining the recent distributed expander decomposition technique of [Chang, Pettie, Zhang, SODA’19] with techniques from the sequential deterministic edge connectivity algorithm of [Kawarabayashi, Thorup, STOC’15], we can decompose the network into a sublinear number of clusters with small average diameter and without any mincut separating a cluster (except the “trivial” ones). This leads to a simplification of the Kawarabayashi-Thorup framework (except that we are randomized while they are deterministic). This might make this framework more useful in other models of computation. Finally, by extending the tree packing technique from [Karger STOC’96], we can find the minimum cut in time proportional to the number of components. As a byproduct of this technique, we obtain an Õ(n)-time algorithm for computing exact minimum cut for weighted graphs.","lang":"eng"}],"month":"06","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1904.04341"}],"quality_controlled":"1","publisher":"Association for Computing Machinery","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","date_updated":"2023-02-17T10:26:25Z","citation":{"chicago":"Daga, Mohit, Monika H Henzinger, Danupon Nanongkai, and Thatchaphol Saranurak. “Distributed Edge Connectivity in Sublinear Time.” In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 343–354. Association for Computing Machinery, 2019. https://doi.org/10.1145/3313276.3316346.","ista":"Daga M, Henzinger MH, Nanongkai D, Saranurak T. 2019. Distributed edge connectivity in sublinear time. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 343–354.","mla":"Daga, Mohit, et al. “Distributed Edge Connectivity in Sublinear Time.” Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing Machinery, 2019, pp. 343–354, doi:10.1145/3313276.3316346.","ieee":"M. Daga, M. H. Henzinger, D. Nanongkai, and T. Saranurak, “Distributed edge connectivity in sublinear time,” in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Phoenix, AZ, United States, 2019, pp. 343–354.","short":"M. Daga, M.H. Henzinger, D. Nanongkai, T. Saranurak, in:, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing Machinery, 2019, pp. 343–354.","apa":"Daga, M., Henzinger, M. H., Nanongkai, D., & Saranurak, T. (2019). Distributed edge connectivity in sublinear time. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (pp. 343–354). Phoenix, AZ, United States: Association for Computing Machinery. https://doi.org/10.1145/3313276.3316346","ama":"Daga M, Henzinger MH, Nanongkai D, Saranurak T. Distributed edge connectivity in sublinear time. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery; 2019:343–354. doi:10.1145/3313276.3316346"},"title":"Distributed edge connectivity in sublinear time","external_id":{"arxiv":["1904.04341"]},"article_processing_charge":"No","author":[{"first_name":"Mohit","last_name":"Daga","full_name":"Daga, Mohit"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"full_name":"Nanongkai, Danupon","last_name":"Nanongkai","first_name":"Danupon"},{"last_name":"Saranurak","full_name":"Saranurak, Thatchaphol","first_name":"Thatchaphol"}],"_id":"11865","status":"public","conference":{"name":"STOC: Symposium on Theory of Computing","location":"Phoenix, AZ, United States","end_date":"2019-06-26","start_date":"2019-06-23"},"type":"conference"},{"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"11871"}]},"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eisbn":["978-1-61197-548-2"]},"month":"01","main_file_link":[{"url":"https://arxiv.org/abs/1810.10932","open_access":"1"}],"scopus_import":"1","oa_version":"Preprint","abstract":[{"lang":"eng","text":"Many dynamic graph algorithms have an amortized update time, rather than a stronger worst-case guarantee. But amortized data structures are not suitable for real-time systems, where each individual operation has to be executed quickly. For this reason, there exist many recent randomized results that aim to provide a guarantee stronger than amortized expected. The strongest possible guarantee for a randomized algorithm is that it is always correct (Las Vegas), and has high-probability worst-case update time, which gives a bound on the time for each individual operation that holds with high probability.\r\n\r\nIn this paper we present the first polylogarithmic high-probability worst-case time bounds for the dynamic spanner and the dynamic maximal matching problem.\r\n\r\n1.\t\r\nFor dynamic spanner, the only known o(n) worst-case bounds were O(n3/4) high-probability worst-case update time for maintaining a 3-spanner, and O(n5/9) for maintaining a 5-spanner. We give a O(1)k log3(n) high-probability worst-case time bound for maintaining a (2k – 1)-spanner, which yields the first worst-case polylog update time for all constant k. (All the results above maintain the optimal tradeoff of stretch 2k – 1 and Õ(n1+1/k) edges.)\r\n\r\n2.\t\r\nFor dynamic maximal matching, or dynamic 2-approximate maximum matching, no algorithm with o(n) worst-case time bound was known and we present an algorithm with O(log5 (n)) high-probability worst-case time; similar worst-case bounds existed only for maintaining a matching that was (2 + ∊)-approximate, and hence not maximal.\r\n\r\nOur results are achieved using a new approach for converting amortized guarantees to worst-case ones for randomized data structures by going through a third type of guarantee, which is a middle ground between the two above: an algorithm is said to have worst-case expected update time α if for every update σ, the expected time to process σ is at most α. Although stronger than amortized expected, the worst-case expected guarantee does not resolve the fundamental problem of amortization: a worst-case expected update time of O(1) still allows for the possibility that every 1/f(n) updates requires Θ(f(n)) time to process, for arbitrarily high f(n). In this paper we present a black-box reduction that converts any data structure with worst-case expected update time into one with a high-probability worst-case update time: the query time remains the same, while the update time increases by a factor of O(log2(n)).\r\n\r\nThus we achieve our results in two steps: (1) First we show how to convert existing dynamic graph algorithms with amortized expected polylogarithmic running times into algorithms with worst-case expected polylogarithmic running times. (2) Then we use our black-box reduction to achieve the polylogarithmic high-probability worst-case time bound. All our algorithms are Las-Vegas-type algorithms."}],"extern":"1","date_updated":"2023-02-21T16:31:21Z","status":"public","conference":{"name":"SODA: Symposium on Discrete Algorithms","end_date":"2019-01-09","location":"San Diego, CA, United States","start_date":"2019-01-06"},"type":"conference","_id":"11871","date_created":"2022-08-16T09:50:33Z","doi":"10.1137/1.9781611975482.115","date_published":"2019-01-01T00:00:00Z","page":"1899-1918","publication":"30th Annual ACM-SIAM Symposium on Discrete Algorithms","day":"01","year":"2019","oa":1,"quality_controlled":"1","publisher":"Society for Industrial and Applied Mathematics","title":"A deamortization approach for dynamic spanner and dynamic maximal matching","article_processing_charge":"No","external_id":{"arxiv":["1810.10932"]},"author":[{"first_name":"Aaron","last_name":"Bernstein","full_name":"Bernstein, Aaron"},{"first_name":"Sebastian","last_name":"Forster","full_name":"Forster, Sebastian"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"A. Bernstein, S. Forster, M.H. Henzinger, in:, 30th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2019, pp. 1899–1918.","ieee":"A. Bernstein, S. Forster, and M. H. Henzinger, “A deamortization approach for dynamic spanner and dynamic maximal matching,” in 30th Annual ACM-SIAM Symposium on Discrete Algorithms, San Diego, CA, United States, 2019, pp. 1899–1918.","ama":"Bernstein A, Forster S, Henzinger MH. A deamortization approach for dynamic spanner and dynamic maximal matching. In: 30th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2019:1899-1918. doi:10.1137/1.9781611975482.115","apa":"Bernstein, A., Forster, S., & Henzinger, M. H. (2019). A deamortization approach for dynamic spanner and dynamic maximal matching. In 30th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1899–1918). San Diego, CA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975482.115","mla":"Bernstein, Aaron, et al. “A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching.” 30th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2019, pp. 1899–918, doi:10.1137/1.9781611975482.115.","ista":"Bernstein A, Forster S, Henzinger MH. 2019. A deamortization approach for dynamic spanner and dynamic maximal matching. 30th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1899–1918.","chicago":"Bernstein, Aaron, Sebastian Forster, and Monika H Henzinger. “A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching.” In 30th Annual ACM-SIAM Symposium on Discrete Algorithms, 1899–1918. Society for Industrial and Applied Mathematics, 2019. https://doi.org/10.1137/1.9781611975482.115."}},{"volume":779,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0304-3975"]},"publication_status":"published","month":"08","intvolume":" 779","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1902.02304"}],"oa_version":"Preprint","abstract":[{"text":"We build upon the recent papers by Weinstein and Yu (FOCS'16), Larsen (FOCS'12), and Clifford et al. (FOCS'15) to present a general framework that gives amortized lower bounds on the update and query times of dynamic data structures. Using our framework, we present two concrete results.\r\n(1) For the dynamic polynomial evaluation problem, where the polynomial is defined over a finite field of size n1+Ω(1) and has degree n, any dynamic data structure must either have an amortized update time of Ω((lgn/lglgn)2) or an amortized query time of Ω((lgn/lglgn)2).\r\n(2) For the dynamic online matrix vector multiplication problem, where we get an n×n matrix whose entires are drawn from a finite field of size nΘ(1), any dynamic data structure must either have an amortized update time of Ω((lgn/lglgn)2) or an amortized query time of Ω(n⋅(lgn/lglgn)2).\r\nFor these two problems, the previous works by Larsen (FOCS'12) and Clifford et al. (FOCS'15) gave the same lower bounds, but only for worst case update and query times. Our bounds match the highest unconditional lower bounds known till date for any dynamic problem in the cell-probe model.","lang":"eng"}],"extern":"1","date_updated":"2022-09-09T11:29:04Z","status":"public","article_type":"original","type":"journal_article","_id":"11898","doi":"10.1016/j.tcs.2019.01.043","date_published":"2019-08-02T00:00:00Z","date_created":"2022-08-17T09:02:15Z","page":"72-87","day":"02","publication":"Theoretical Computer Science","year":"2019","publisher":"Elsevier","quality_controlled":"1","oa":1,"title":"New amortized cell-probe lower bounds for dynamic problems","author":[{"last_name":"Bhattacharya","full_name":"Bhattacharya, Sayan","first_name":"Sayan"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger"},{"full_name":"Neumann, Stefan","last_name":"Neumann","first_name":"Stefan"}],"external_id":{"arxiv":["1902.02304"]},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Bhattacharya, S., Henzinger, M. H., & Neumann, S. (2019). New amortized cell-probe lower bounds for dynamic problems. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2019.01.043","ama":"Bhattacharya S, Henzinger MH, Neumann S. New amortized cell-probe lower bounds for dynamic problems. Theoretical Computer Science. 2019;779:72-87. doi:10.1016/j.tcs.2019.01.043","short":"S. Bhattacharya, M.H. Henzinger, S. Neumann, Theoretical Computer Science 779 (2019) 72–87.","ieee":"S. Bhattacharya, M. H. Henzinger, and S. Neumann, “New amortized cell-probe lower bounds for dynamic problems,” Theoretical Computer Science, vol. 779. Elsevier, pp. 72–87, 2019.","mla":"Bhattacharya, Sayan, et al. “New Amortized Cell-Probe Lower Bounds for Dynamic Problems.” Theoretical Computer Science, vol. 779, Elsevier, 2019, pp. 72–87, doi:10.1016/j.tcs.2019.01.043.","ista":"Bhattacharya S, Henzinger MH, Neumann S. 2019. New amortized cell-probe lower bounds for dynamic problems. Theoretical Computer Science. 779, 72–87.","chicago":"Bhattacharya, Sayan, Monika H Henzinger, and Stefan Neumann. “New Amortized Cell-Probe Lower Bounds for Dynamic Problems.” Theoretical Computer Science. Elsevier, 2019. https://doi.org/10.1016/j.tcs.2019.01.043."}},{"oa_version":"Published Version","abstract":[{"text":"Differentially protected galactosamine building blocks are key components for the synthesis of human and bacterial oligosaccharides. The azidophenylselenylation of 3,4,6-tri-O-acetyl-d-galactal provides straightforward access to the corresponding 2-nitrogenated glycoside. Poor reproducibility and the use of azides that lead to the formation of potentially explosive and toxic species limit the scalability of this reaction and render it a bottleneck for carbohydrate synthesis. Here, we present a method for the safe, efficient, and reliable azidophenylselenylation of 3,4,6-tri-O-acetyl-d-galactal at room temperature, using continuous flow chemistry. Careful analysis of the transformation resulted in reaction conditions that produce minimal side products while the reaction time was reduced drastically when compared to batch reactions. The flow setup is readily scalable to process 5 mmol of galactal in 3 h, producing 1.2 mmol/h of product.","lang":"eng"}],"month":"12","intvolume":" 23","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1021/acs.oprd.9b00456"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1083-6160"],"eissn":["1520-586X"]},"publication_status":"published","issue":"12","volume":23,"_id":"11984","status":"public","type":"journal_article","article_type":"letter_note","extern":"1","date_updated":"2023-02-21T10:10:23Z","publisher":"American Chemical Society","quality_controlled":"1","oa":1,"day":"20","publication":"Organic Process Research and Development","year":"2019","date_published":"2019-12-20T00:00:00Z","doi":"10.1021/acs.oprd.9b00456","date_created":"2022-08-25T11:30:33Z","page":"2764-2770","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Guberman M, Pieber B, Seeberger PH. 2019. Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks. Organic Process Research and Development. 23(12), 2764–2770.","chicago":"Guberman, Mónica, Bartholomäus Pieber, and Peter H. Seeberger. “Safe and Scalable Continuous Flow Azidophenylselenylation of Galactal to Prepare Galactosamine Building Blocks.” Organic Process Research and Development. American Chemical Society, 2019. https://doi.org/10.1021/acs.oprd.9b00456.","ieee":"M. Guberman, B. Pieber, and P. H. Seeberger, “Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks,” Organic Process Research and Development, vol. 23, no. 12. American Chemical Society, pp. 2764–2770, 2019.","short":"M. Guberman, B. Pieber, P.H. Seeberger, Organic Process Research and Development 23 (2019) 2764–2770.","ama":"Guberman M, Pieber B, Seeberger PH. Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks. Organic Process Research and Development. 2019;23(12):2764-2770. doi:10.1021/acs.oprd.9b00456","apa":"Guberman, M., Pieber, B., & Seeberger, P. H. (2019). Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks. Organic Process Research and Development. American Chemical Society. https://doi.org/10.1021/acs.oprd.9b00456","mla":"Guberman, Mónica, et al. “Safe and Scalable Continuous Flow Azidophenylselenylation of Galactal to Prepare Galactosamine Building Blocks.” Organic Process Research and Development, vol. 23, no. 12, American Chemical Society, 2019, pp. 2764–70, doi:10.1021/acs.oprd.9b00456."},"title":"Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks","author":[{"last_name":"Guberman","full_name":"Guberman, Mónica","first_name":"Mónica"},{"id":"93e5e5b2-0da6-11ed-8a41-af589a024726","first_name":"Bartholomäus","last_name":"Pieber","full_name":"Pieber, Bartholomäus","orcid":"0000-0001-8689-388X"},{"first_name":"Peter H.","full_name":"Seeberger, Peter H.","last_name":"Seeberger"}],"article_processing_charge":"No"},{"date_created":"2022-08-25T11:18:00Z","date_published":"2019-07-05T00:00:00Z","doi":"10.1021/acs.orglett.9b01957","page":"5331-5334","publication":"Organic Letters","day":"05","year":"2019","oa":1,"quality_controlled":"1","publisher":"American Chemical Society","title":"Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides","external_id":{"pmid":["31247752"]},"article_processing_charge":"No","author":[{"first_name":"Cristian","last_name":"Cavedon","full_name":"Cavedon, Cristian"},{"first_name":"Amiera","full_name":"Madani, Amiera","last_name":"Madani"},{"full_name":"Seeberger, Peter H.","last_name":"Seeberger","first_name":"Peter H."},{"first_name":"Bartholomäus","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","last_name":"Pieber","full_name":"Pieber, Bartholomäus","orcid":"0000-0001-8689-388X"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Cavedon, Cristian, et al. “Semiheterogeneous Dual Nickel/Photocatalytic (Thio)Etherification Using Carbon Nitrides.” Organic Letters, vol. 21, no. 13, American Chemical Society, 2019, pp. 5331–34, doi:10.1021/acs.orglett.9b01957.","ieee":"C. Cavedon, A. Madani, P. H. Seeberger, and B. Pieber, “Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides,” Organic Letters, vol. 21, no. 13. American Chemical Society, pp. 5331–5334, 2019.","short":"C. Cavedon, A. Madani, P.H. Seeberger, B. Pieber, Organic Letters 21 (2019) 5331–5334.","ama":"Cavedon C, Madani A, Seeberger PH, Pieber B. Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides. Organic Letters. 2019;21(13):5331-5334. doi:10.1021/acs.orglett.9b01957","apa":"Cavedon, C., Madani, A., Seeberger, P. H., & Pieber, B. (2019). Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides. Organic Letters. American Chemical Society. https://doi.org/10.1021/acs.orglett.9b01957","chicago":"Cavedon, Cristian, Amiera Madani, Peter H. Seeberger, and Bartholomäus Pieber. “Semiheterogeneous Dual Nickel/Photocatalytic (Thio)Etherification Using Carbon Nitrides.” Organic Letters. American Chemical Society, 2019. https://doi.org/10.1021/acs.orglett.9b01957.","ista":"Cavedon C, Madani A, Seeberger PH, Pieber B. 2019. Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides. Organic Letters. 21(13), 5331–5334."},"volume":21,"issue":"13","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["1523-7060"],"eissn":["1523-7052"]},"intvolume":" 21","month":"07","main_file_link":[{"url":"https://doi.org/10.1021/acs.orglett.9b01957","open_access":"1"}],"scopus_import":"1","pmid":1,"oa_version":"Published Version","abstract":[{"text":"A carbon nitride material can be combined with homogeneous nickel catalysts for light-mediated cross-couplings of aryl bromides with alcohols under mild conditions. The metal-free heterogeneous semiconductor is fully recyclable and couples a broad range of electron-poor aryl bromides with primary and secondary alcohols as well as water. The application for intramolecular reactions and the synthesis of active pharmaceutical ingredients was demonstrated. The catalytic protocol is applicable for the coupling of aryl iodides with thiols as well.","lang":"eng"}],"extern":"1","date_updated":"2023-02-21T10:10:19Z","status":"public","article_type":"letter_note","type":"journal_article","_id":"11982"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Browning, Timothy D, and Efthymios Sofos. “Counting Rational Points on Quartic Del Pezzo Surfaces with a Rational Conic.” Mathematische Annalen. Springer Nature, 2019. https://doi.org/10.1007/s00208-018-1716-6.","ista":"Browning TD, Sofos E. 2019. Counting rational points on quartic del Pezzo surfaces with a rational conic. Mathematische Annalen. 373(3–4), 977–1016.","mla":"Browning, Timothy D., and Efthymios Sofos. “Counting Rational Points on Quartic Del Pezzo Surfaces with a Rational Conic.” Mathematische Annalen, vol. 373, no. 3–4, Springer Nature, 2019, pp. 977–1016, doi:10.1007/s00208-018-1716-6.","apa":"Browning, T. D., & Sofos, E. (2019). Counting rational points on quartic del Pezzo surfaces with a rational conic. Mathematische Annalen. Springer Nature. https://doi.org/10.1007/s00208-018-1716-6","ama":"Browning TD, Sofos E. Counting rational points on quartic del Pezzo surfaces with a rational conic. Mathematische Annalen. 2019;373(3-4):977-1016. doi:10.1007/s00208-018-1716-6","ieee":"T. D. Browning and E. Sofos, “Counting rational points on quartic del Pezzo surfaces with a rational conic,” Mathematische Annalen, vol. 373, no. 3–4. Springer Nature, pp. 977–1016, 2019.","short":"T.D. Browning, E. Sofos, Mathematische Annalen 373 (2019) 977–1016."},"title":"Counting rational points on quartic del Pezzo surfaces with a rational conic","external_id":{"arxiv":["1609.09057"]},"author":[{"last_name":"Browning","full_name":"Browning, Timothy D","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","first_name":"Timothy D"},{"full_name":"Sofos, Efthymios","last_name":"Sofos","first_name":"Efthymios"}],"publication":"Mathematische Annalen","day":"01","year":"2019","has_accepted_license":"1","date_created":"2018-12-11T11:44:59Z","date_published":"2019-04-01T00:00:00Z","doi":"10.1007/s00208-018-1716-6","page":"977-1016","oa":1,"publisher":"Springer Nature","quality_controlled":"1","ddc":["510"],"extern":"1","date_updated":"2021-01-12T06:52:37Z","file_date_updated":"2020-07-14T12:45:12Z","_id":"170","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","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"6479","checksum":"4061dc2fe99bee25d9adf2d2018cf608","date_updated":"2020-07-14T12:45:12Z","file_size":712847,"creator":"dernst","date_created":"2019-05-23T07:53:27Z","file_name":"2019_MathAnnalen_Browning.pdf"}],"publication_status":"published","license":"https://creativecommons.org/licenses/by/4.0/","volume":373,"issue":"3-4","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Upper and lower bounds, of the expected order of magnitude, are obtained for the number of rational points of bounded height on any quartic del Pezzo surface over ℚ that contains a conic defined over ℚ ."}],"intvolume":" 373","month":"04"},{"ec_funded":1,"volume":5,"issue":"3","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["2199-675X"],"eissn":["2199-6768"]},"intvolume":" 5","month":"09","main_file_link":[{"url":"https://arxiv.org/abs/1711.02089","open_access":"1"}],"scopus_import":1,"oa_version":"Preprint","department":[{"_id":"TaHa"}],"date_updated":"2021-01-12T07:56:46Z","status":"public","article_type":"original","type":"journal_article","_id":"441","date_created":"2018-12-11T11:46:29Z","doi":"10.1007/s40879-018-0218-0","date_published":"2019-09-15T00:00:00Z","page":"909–928","publication":"European Journal of Mathematics","day":"15","year":"2019","oa":1,"publisher":"Springer Nature","quality_controlled":"1","title":"Tropical formulae for summation over a part of SL(2,Z)","external_id":{"arxiv":["1711.02089"]},"article_processing_charge":"No","publist_id":"7382","author":[{"first_name":"Nikita","last_name":"Kalinin","full_name":"Kalinin, Nikita"},{"full_name":"Shkolnikov, Mikhail","orcid":"0000-0002-4310-178X","last_name":"Shkolnikov","id":"35084A62-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail"}],"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","citation":{"mla":"Kalinin, Nikita, and Mikhail Shkolnikov. “Tropical Formulae for Summation over a Part of SL(2,Z).” European Journal of Mathematics, vol. 5, no. 3, Springer Nature, 2019, pp. 909–928, doi:10.1007/s40879-018-0218-0.","apa":"Kalinin, N., & Shkolnikov, M. (2019). Tropical formulae for summation over a part of SL(2,Z). European Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s40879-018-0218-0","ama":"Kalinin N, Shkolnikov M. Tropical formulae for summation over a part of SL(2,Z). European Journal of Mathematics. 2019;5(3):909–928. doi:10.1007/s40879-018-0218-0","ieee":"N. Kalinin and M. Shkolnikov, “Tropical formulae for summation over a part of SL(2,Z),” European Journal of Mathematics, vol. 5, no. 3. Springer Nature, pp. 909–928, 2019.","short":"N. Kalinin, M. Shkolnikov, European Journal of Mathematics 5 (2019) 909–928.","chicago":"Kalinin, Nikita, and Mikhail Shkolnikov. “Tropical Formulae for Summation over a Part of SL(2,Z).” European Journal of Mathematics. Springer Nature, 2019. https://doi.org/10.1007/s40879-018-0218-0.","ista":"Kalinin N, Shkolnikov M. 2019. Tropical formulae for summation over a part of SL(2,Z). European Journal of Mathematics. 5(3), 909–928."},"project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}]},{"publication_status":"published","publication_identifier":{"issn":["0926227X"]},"language":[{"iso":"eng"}],"ec_funded":1,"volume":27,"issue":"1","abstract":[{"text":"Cryptographic security is usually defined as a guarantee that holds except when a bad event with negligible probability occurs, and nothing is guaranteed in that bad case. However, in settings where such failure can happen with substantial probability, one needs to provide guarantees even for the bad case. A typical example is where a (possibly weak) password is used instead of a secure cryptographic key to protect a session, the bad event being that the adversary correctly guesses the password. In a situation with multiple such sessions, a per-session guarantee is desired: any session for which the password has not been guessed remains secure, independently of whether other sessions have been compromised. A new formalism for stating such gracefully degrading security guarantees is introduced and applied to analyze the examples of password-based message authentication and password-based encryption. While a natural per-message guarantee is achieved for authentication, the situation of password-based encryption is more delicate: a per-session confidentiality guarantee only holds against attackers for which the distribution of password-guessing effort over the sessions is known in advance. In contrast, for more general attackers without such a restriction, a strong, composable notion of security cannot be achieved.","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"url":"https://eprint.iacr.org/2016/166","open_access":"1"}],"scopus_import":"1","intvolume":" 27","month":"01","date_updated":"2021-01-12T08:05:08Z","department":[{"_id":"KrPi"}],"_id":"5887","article_type":"original","type":"journal_article","status":"public","year":"2019","publication":"Journal of Computer Security","day":"1","page":"75-111","date_created":"2019-01-27T22:59:10Z","date_published":"2019-01-01T00:00:00Z","doi":"10.3233/JCS-181131","oa":1,"quality_controlled":"1","publisher":"IOS Press","citation":{"apa":"Demay, G., Gazi, P., Maurer, U., & Tackmann, B. (2019). Per-session security: Password-based cryptography revisited. Journal of Computer Security. IOS Press. https://doi.org/10.3233/JCS-181131","ama":"Demay G, Gazi P, Maurer U, Tackmann B. Per-session security: Password-based cryptography revisited. Journal of Computer Security. 2019;27(1):75-111. doi:10.3233/JCS-181131","short":"G. Demay, P. Gazi, U. Maurer, B. Tackmann, Journal of Computer Security 27 (2019) 75–111.","ieee":"G. Demay, P. Gazi, U. Maurer, and B. Tackmann, “Per-session security: Password-based cryptography revisited,” Journal of Computer Security, vol. 27, no. 1. IOS Press, pp. 75–111, 2019.","mla":"Demay, Gregory, et al. “Per-Session Security: Password-Based Cryptography Revisited.” Journal of Computer Security, vol. 27, no. 1, IOS Press, 2019, pp. 75–111, doi:10.3233/JCS-181131.","ista":"Demay G, Gazi P, Maurer U, Tackmann B. 2019. Per-session security: Password-based cryptography revisited. Journal of Computer Security. 27(1), 75–111.","chicago":"Demay, Gregory, Peter Gazi, Ueli Maurer, and Bjorn Tackmann. “Per-Session Security: Password-Based Cryptography Revisited.” Journal of Computer Security. IOS Press, 2019. https://doi.org/10.3233/JCS-181131."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"first_name":"Gregory","full_name":"Demay, Gregory","last_name":"Demay"},{"id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","last_name":"Gazi","full_name":"Gazi, Peter"},{"full_name":"Maurer, Ueli","last_name":"Maurer","first_name":"Ueli"},{"first_name":"Bjorn","full_name":"Tackmann, Bjorn","last_name":"Tackmann"}],"title":"Per-session security: Password-based cryptography revisited","project":[{"call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","grant_number":"682815"}]},{"language":[{"iso":"eng"}],"file":[{"file_name":"mainJournalFinal.pdf","date_created":"2019-06-03T09:30:01Z","creator":"mwintrae","file_size":2170882,"date_updated":"2020-07-14T12:47:32Z","checksum":"57b4df2f16a74eb499734ec8ee240178","file_id":"6516","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"publication_status":"published","publication_identifier":{"issn":["1920-180X"]},"ec_funded":1,"volume":10,"issue":"1","oa_version":"Published Version","abstract":[{"text":"We give non-degeneracy criteria for Riemannian simplices based on simplices in spaces of constant sectional curvature. It extends previous work on Riemannian simplices, where we developed Riemannian simplices with respect to Euclidean reference simplices. The criteria we give in this article are in terms of quality measures for spaces of constant curvature that we develop here. We see that simplices in spaces that have nearly constant curvature, are already non-degenerate under very weak quality demands. This is of importance because it allows for sampling of Riemannian manifolds based on anisotropy of the manifold and not (absolute) curvature.","lang":"eng"}],"intvolume":" 10","month":"07","scopus_import":1,"ddc":["510"],"date_updated":"2021-01-12T08:07:50Z","department":[{"_id":"HeEd"}],"file_date_updated":"2020-07-14T12:47:32Z","_id":"6515","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","publication":"Journal of Computational Geometry ","day":"01","year":"2019","has_accepted_license":"1","date_created":"2019-06-03T09:35:33Z","doi":"10.20382/jocg.v10i1a9","date_published":"2019-07-01T00:00:00Z","page":"223–256","oa":1,"publisher":"Carleton University","quality_controlled":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Dyer, Ramsay, et al. “Simplices Modelled on Spaces of Constant Curvature.” Journal of Computational Geometry , vol. 10, no. 1, Carleton University, 2019, pp. 223–256, doi:10.20382/jocg.v10i1a9.","ieee":"R. Dyer, G. Vegter, and M. Wintraecken, “Simplices modelled on spaces of constant curvature,” Journal of Computational Geometry , vol. 10, no. 1. Carleton University, pp. 223–256, 2019.","short":"R. Dyer, G. Vegter, M. Wintraecken, Journal of Computational Geometry 10 (2019) 223–256.","apa":"Dyer, R., Vegter, G., & Wintraecken, M. (2019). Simplices modelled on spaces of constant curvature. Journal of Computational Geometry . Carleton University. https://doi.org/10.20382/jocg.v10i1a9","ama":"Dyer R, Vegter G, Wintraecken M. Simplices modelled on spaces of constant curvature. Journal of Computational Geometry . 2019;10(1):223–256. doi:10.20382/jocg.v10i1a9","chicago":"Dyer, Ramsay, Gert Vegter, and Mathijs Wintraecken. “Simplices Modelled on Spaces of Constant Curvature.” Journal of Computational Geometry . Carleton University, 2019. https://doi.org/10.20382/jocg.v10i1a9.","ista":"Dyer R, Vegter G, Wintraecken M. 2019. Simplices modelled on spaces of constant curvature. Journal of Computational Geometry . 10(1), 223–256."},"title":"Simplices modelled on spaces of constant curvature","author":[{"full_name":"Dyer, Ramsay","last_name":"Dyer","first_name":"Ramsay"},{"first_name":"Gert","last_name":"Vegter","full_name":"Vegter, Gert"},{"first_name":"Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","last_name":"Wintraecken","orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs"}],"project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}]},{"oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","date_created":"2019-06-06T14:12:36Z","doi":"10.4230/LIPICS.ITCS.2019.60","date_published":"2019-01-10T00:00:00Z","year":"2019","has_accepted_license":"1","publication":"10th Innovations in Theoretical Computer Science Conference","day":"10","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","grant_number":"682815"}],"article_number":"60","article_processing_charge":"No","author":[{"first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z"}],"title":"Simple verifiable delay functions","citation":{"apa":"Pietrzak, K. Z. (2019). Simple verifiable delay functions. In 10th Innovations in Theoretical Computer Science Conference (Vol. 124). San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ITCS.2019.60","ama":"Pietrzak KZ. Simple verifiable delay functions. In: 10th Innovations in Theoretical Computer Science Conference. Vol 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.ITCS.2019.60","ieee":"K. Z. Pietrzak, “Simple verifiable delay functions,” in 10th Innovations in Theoretical Computer Science Conference, San Diego, CA, United States, 2019, vol. 124.","short":"K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","mla":"Pietrzak, Krzysztof Z. “Simple Verifiable Delay Functions.” 10th Innovations in Theoretical Computer Science Conference, vol. 124, 60, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.ITCS.2019.60.","ista":"Pietrzak KZ. 2019. Simple verifiable delay functions. 10th Innovations in Theoretical Computer Science Conference. ITCS 2019: Innovations in Theoretical Computer Science, LIPIcs, vol. 124, 60.","chicago":"Pietrzak, Krzysztof Z. “Simple Verifiable Delay Functions.” In 10th Innovations in Theoretical Computer Science Conference, Vol. 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.ITCS.2019.60."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"https://eprint.iacr.org/2018/627","open_access":"1"}],"scopus_import":1,"alternative_title":["LIPIcs"],"intvolume":" 124","month":"01","abstract":[{"text":"We construct a verifiable delay function (VDF) by showing how the Rivest-Shamir-Wagner time-lock puzzle can be made publicly verifiable. Concretely, we give a statistically sound public-coin protocol to prove that a tuple (N,x,T,y) satisfies y=x2T (mod N) where the prover doesn’t know the factorization of N and its running time is dominated by solving the puzzle, that is, compute x2T, which is conjectured to require T sequential squarings. To get a VDF we make this protocol non-interactive using the Fiat-Shamir heuristic.The motivation for this work comes from the Chia blockchain design, which uses a VDF as akey ingredient. For typical parameters (T≤2 40, N= 2048), our proofs are of size around 10K B, verification cost around three RSA exponentiations and computing the proof is 8000 times faster than solving the puzzle even without any parallelism.","lang":"eng"}],"oa_version":"Published Version","ec_funded":1,"volume":124,"publication_status":"published","publication_identifier":{"isbn":["978-3-95977-095-8"],"issn":["1868-8969"]},"language":[{"iso":"eng"}],"file":[{"creator":"dernst","date_updated":"2020-07-14T12:47:33Z","file_size":558770,"date_created":"2019-06-06T14:22:04Z","file_name":"2019_LIPIcs_Pietrzak.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"f0ae1bb161431d9db3dea5ace082bfb5","file_id":"6529"}],"conference":{"name":"ITCS 2019: Innovations in Theoretical Computer Science","end_date":"2019-01-12","location":"San Diego, CA, United States","start_date":"2019-01-10"},"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":"conference","status":"public","_id":"6528","department":[{"_id":"KrPi"}],"file_date_updated":"2020-07-14T12:47:33Z","date_updated":"2021-01-12T08:07:53Z","ddc":["000"]},{"project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"article_number":"8715598","title":"Formal synthesis of stabilizing controllers for periodically controlled linear switched systems","author":[{"first_name":"Atreyee","last_name":"Kundu","full_name":"Kundu, Atreyee"},{"id":"4B3207F6-F248-11E8-B48F-1D18A9856A87","first_name":"Miriam","last_name":"Garcia Soto","full_name":"Garcia Soto, Miriam","orcid":"0000−0003−2936−5719"},{"full_name":"Prabhakar, Pavithra","last_name":"Prabhakar","first_name":"Pavithra"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Kundu, Atreyee, et al. “Formal Synthesis of Stabilizing Controllers for Periodically Controlled Linear Switched Systems.” 5th Indian Control Conference Proceedings, 8715598, IEEE, 2019, doi:10.1109/INDIANCC.2019.8715598.","apa":"Kundu, A., Garcia Soto, M., & Prabhakar, P. (2019). Formal synthesis of stabilizing controllers for periodically controlled linear switched systems. In 5th Indian Control Conference Proceedings. Delhi, India: IEEE. https://doi.org/10.1109/INDIANCC.2019.8715598","ama":"Kundu A, Garcia Soto M, Prabhakar P. Formal synthesis of stabilizing controllers for periodically controlled linear switched systems. In: 5th Indian Control Conference Proceedings. IEEE; 2019. doi:10.1109/INDIANCC.2019.8715598","ieee":"A. Kundu, M. Garcia Soto, and P. Prabhakar, “Formal synthesis of stabilizing controllers for periodically controlled linear switched systems,” in 5th Indian Control Conference Proceedings, Delhi, India, 2019.","short":"A. Kundu, M. Garcia Soto, P. Prabhakar, in:, 5th Indian Control Conference Proceedings, IEEE, 2019.","chicago":"Kundu, Atreyee, Miriam Garcia Soto, and Pavithra Prabhakar. “Formal Synthesis of Stabilizing Controllers for Periodically Controlled Linear Switched Systems.” In 5th Indian Control Conference Proceedings. IEEE, 2019. https://doi.org/10.1109/INDIANCC.2019.8715598.","ista":"Kundu A, Garcia Soto M, Prabhakar P. 2019. Formal synthesis of stabilizing controllers for periodically controlled linear switched systems. 5th Indian Control Conference Proceedings. ICC 2019 - Indian Control Conference, 8715598."},"quality_controlled":"1","publisher":"IEEE","oa":1,"date_published":"2019-05-16T00:00:00Z","doi":"10.1109/INDIANCC.2019.8715598","date_created":"2019-06-17T06:57:33Z","day":"16","publication":"5th Indian Control Conference Proceedings","has_accepted_license":"1","year":"2019","status":"public","type":"conference","conference":{"location":"Delhi, India","end_date":"2019-01-11","start_date":"2019-01-09","name":"ICC 2019 - Indian Control Conference"},"_id":"6565","file_date_updated":"2020-10-21T13:13:49Z","department":[{"_id":"ToHe"}],"ddc":["000"],"date_updated":"2021-01-12T08:08:01Z","month":"05","scopus_import":"1","oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"In this paper, we address the problem of synthesizing periodic switching controllers for stabilizing a family of linear systems. Our broad approach consists of constructing a finite game graph based on the family of linear systems such that every winning strategy on the game graph corresponds to a stabilizing switching controller for the family of linear systems. The construction of a (finite) game graph, the synthesis of a winning strategy and the extraction of a stabilizing controller are all computationally feasible. We illustrate our method on an example."}],"file":[{"date_created":"2020-10-21T13:13:49Z","file_name":"2019_ICC_Kundu.pdf","date_updated":"2020-10-21T13:13:49Z","file_size":396031,"creator":"dernst","checksum":"d622a91af1e427f6b1e0ba8e18a2b767","file_id":"8687","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-153866246-5"]},"publication_status":"published"},{"quality_controlled":"1","scopus_import":1,"oa":1,"month":"08","abstract":[{"lang":"eng","text":"Fejes Tóth [5] and Schneider [9] studied approximations of smooth convex hypersurfaces in Euclidean space by piecewise flat triangular meshes with a given number of vertices on the hypersurface that are optimal with respect to Hausdorff distance. They proved that this Hausdorff distance decreases inversely proportional with m 2/(d−1), where m is the number of vertices and d is the dimension of Euclidean space. Moreover the pro-portionality constant can be expressed in terms of the Gaussian curvature, an intrinsic quantity. In this short note, we prove the extrinsic nature of this constant for manifolds of sufficiently high codimension. We do so by constructing an family of isometric embeddings of the flat torus in Euclidean space."}],"oa_version":"Submitted Version","page":"275-279","date_published":"2019-08-01T00:00:00Z","ec_funded":1,"date_created":"2019-07-12T08:34:57Z","has_accepted_license":"1","year":"2019","publication_status":"published","day":"01","file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"6629","checksum":"ceabd152cfa55170d57763f9c6c60a53","file_size":321176,"date_updated":"2020-07-14T12:47:34Z","creator":"mwintrae","file_name":"IntrinsicExtrinsicCCCG2019.pdf","date_created":"2019-07-12T08:32:46Z"}],"language":[{"iso":"eng"}],"publication":"The 31st Canadian Conference in Computational Geometry","type":"conference","conference":{"start_date":"2019-08-08","location":"Edmonton, Canada","end_date":"2019-08-10","name":"CCCG: Canadian Conference in Computational Geometry"},"status":"public","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"_id":"6628","author":[{"last_name":"Vegter","full_name":"Vegter, Gert","first_name":"Gert"},{"last_name":"Wintraecken","full_name":"Wintraecken, Mathijs","orcid":"0000-0002-7472-2220","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","first_name":"Mathijs"}],"department":[{"_id":"HeEd"}],"title":"The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds","file_date_updated":"2020-07-14T12:47:34Z","date_updated":"2021-01-12T08:08:16Z","citation":{"ama":"Vegter G, Wintraecken M. The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. In: The 31st Canadian Conference in Computational Geometry. ; 2019:275-279.","apa":"Vegter, G., & Wintraecken, M. (2019). The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. In The 31st Canadian Conference in Computational Geometry (pp. 275–279). Edmonton, Canada.","ieee":"G. Vegter and M. Wintraecken, “The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds,” in The 31st Canadian Conference in Computational Geometry, Edmonton, Canada, 2019, pp. 275–279.","short":"G. Vegter, M. Wintraecken, in:, The 31st Canadian Conference in Computational Geometry, 2019, pp. 275–279.","mla":"Vegter, Gert, and Mathijs Wintraecken. “The Extrinsic Nature of the Hausdorff Distance of Optimal Triangulations of Manifolds.” The 31st Canadian Conference in Computational Geometry, 2019, pp. 275–79.","ista":"Vegter G, Wintraecken M. 2019. The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. The 31st Canadian Conference in Computational Geometry. CCCG: Canadian Conference in Computational Geometry, 275–279.","chicago":"Vegter, Gert, and Mathijs Wintraecken. “The Extrinsic Nature of the Hausdorff Distance of Optimal Triangulations of Manifolds.” In The 31st Canadian Conference in Computational Geometry, 275–79, 2019."},"ddc":["004"],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"publication_identifier":{"isbn":["9783959771047"]},"publication_status":"published","file":[{"checksum":"8ec8720730d4c789bf7b06540f1c29f4","file_id":"6666","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2019-07-24T06:40:01Z","file_name":"2019_LIPICS_Edelsbrunner.pdf","date_updated":"2020-07-14T12:47:35Z","file_size":1355179,"creator":"dernst"}],"language":[{"iso":"eng"}],"volume":129,"abstract":[{"text":"Various kinds of data are routinely represented as discrete probability distributions. Examples include text documents summarized by histograms of word occurrences and images represented as histograms of oriented gradients. Viewing a discrete probability distribution as a point in the standard simplex of the appropriate dimension, we can understand collections of such objects in geometric and topological terms. Importantly, instead of using the standard Euclidean distance, we look into dissimilarity measures with information-theoretic justification, and we develop the theory\r\nneeded for applying topological data analysis in this setting. In doing so, we emphasize constructions that enable the usage of existing computational topology software in this context.","lang":"eng"}],"oa_version":"Published Version","scopus_import":1,"alternative_title":["LIPIcs"],"month":"06","intvolume":" 129","date_updated":"2021-01-12T08:08:23Z","ddc":["510"],"file_date_updated":"2020-07-14T12:47:35Z","department":[{"_id":"HeEd"}],"_id":"6648","type":"conference","conference":{"start_date":"2019-06-18","end_date":"2019-06-21","location":"Portland, OR, United States","name":"SoCG 2019: Symposium on Computational Geometry"},"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","has_accepted_license":"1","year":"2019","day":"01","publication":"35th International Symposium on Computational Geometry","page":"31:1-31:14","date_published":"2019-06-01T00:00:00Z","doi":"10.4230/LIPICS.SOCG.2019.31","date_created":"2019-07-17T10:36:09Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"citation":{"mla":"Edelsbrunner, Herbert, et al. “Topological Data Analysis in Information Space.” 35th International Symposium on Computational Geometry, vol. 129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 31:1-31:14, doi:10.4230/LIPICS.SOCG.2019.31.","short":"H. Edelsbrunner, Z. Virk, H. Wagner, in:, 35th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 31:1-31:14.","ieee":"H. Edelsbrunner, Z. Virk, and H. Wagner, “Topological data analysis in information space,” in 35th International Symposium on Computational Geometry, Portland, OR, United States, 2019, vol. 129, p. 31:1-31:14.","apa":"Edelsbrunner, H., Virk, Z., & Wagner, H. (2019). Topological data analysis in information space. In 35th International Symposium on Computational Geometry (Vol. 129, p. 31:1-31:14). Portland, OR, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.SOCG.2019.31","ama":"Edelsbrunner H, Virk Z, Wagner H. Topological data analysis in information space. In: 35th International Symposium on Computational Geometry. Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:31:1-31:14. doi:10.4230/LIPICS.SOCG.2019.31","chicago":"Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Topological Data Analysis in Information Space.” In 35th International Symposium on Computational Geometry, 129:31:1-31:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.SOCG.2019.31.","ista":"Edelsbrunner H, Virk Z, Wagner H. 2019. Topological data analysis in information space. 35th International Symposium on Computational Geometry. SoCG 2019: Symposium on Computational Geometry, LIPIcs, vol. 129, 31:1-31:14."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"first_name":"Ziga","full_name":"Virk, Ziga","last_name":"Virk"},{"last_name":"Wagner","full_name":"Wagner, Hubert","first_name":"Hubert","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"arxiv":["1903.08510"]},"title":"Topological data analysis in information space","project":[{"name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}]},{"project":[{"call_identifier":"H2020","_id":"25CA28EA-B435-11E9-9278-68D0E5697425","grant_number":"694539","name":"In situ analysis of single channel subunit composition in neurons: physiological implication in synaptic plasticity and behaviour"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Zenmyo, Naoki, et al. “Optimized Reaction Pair of the CysHis Tag and Ni(II)-NTA Probe for Highly Selective Chemical Labeling of Membrane Proteins.” Bulletin of the Chemical Society of Japan, vol. 92, no. 5, Bulletin of the Chemical Society of Japan, 2019, pp. 995–1000, doi:10.1246/bcsj.20190034.","apa":"Zenmyo, N., Tokumaru, H., Uchinomiya, S., Fuchida, H., Tabata, S., Hamachi, I., … Ojida, A. (2019). Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins. Bulletin of the Chemical Society of Japan. Bulletin of the Chemical Society of Japan. https://doi.org/10.1246/bcsj.20190034","ama":"Zenmyo N, Tokumaru H, Uchinomiya S, et al. Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins. Bulletin of the Chemical Society of Japan. 2019;92(5):995-1000. doi:10.1246/bcsj.20190034","ieee":"N. Zenmyo et al., “Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins,” Bulletin of the Chemical Society of Japan, vol. 92, no. 5. Bulletin of the Chemical Society of Japan, pp. 995–1000, 2019.","short":"N. Zenmyo, H. Tokumaru, S. Uchinomiya, H. Fuchida, S. Tabata, I. Hamachi, R. Shigemoto, A. Ojida, Bulletin of the Chemical Society of Japan 92 (2019) 995–1000.","chicago":"Zenmyo, Naoki, Hiroki Tokumaru, Shohei Uchinomiya, Hirokazu Fuchida, Shigekazu Tabata, Itaru Hamachi, Ryuichi Shigemoto, and Akio Ojida. “Optimized Reaction Pair of the CysHis Tag and Ni(II)-NTA Probe for Highly Selective Chemical Labeling of Membrane Proteins.” Bulletin of the Chemical Society of Japan. Bulletin of the Chemical Society of Japan, 2019. https://doi.org/10.1246/bcsj.20190034.","ista":"Zenmyo N, Tokumaru H, Uchinomiya S, Fuchida H, Tabata S, Hamachi I, Shigemoto R, Ojida A. 2019. Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins. Bulletin of the Chemical Society of Japan. 92(5), 995–1000."},"title":"Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins","author":[{"first_name":"Naoki","full_name":"Zenmyo, Naoki","last_name":"Zenmyo"},{"full_name":"Tokumaru, Hiroki","last_name":"Tokumaru","first_name":"Hiroki"},{"first_name":"Shohei","full_name":"Uchinomiya, Shohei","last_name":"Uchinomiya"},{"full_name":"Fuchida, Hirokazu","last_name":"Fuchida","first_name":"Hirokazu"},{"full_name":"Tabata, Shigekazu","last_name":"Tabata","first_name":"Shigekazu","id":"4427179E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Itaru","last_name":"Hamachi","full_name":"Hamachi, Itaru"},{"id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","orcid":"0000-0001-8761-9444","full_name":"Shigemoto, Ryuichi","last_name":"Shigemoto"},{"first_name":"Akio","last_name":"Ojida","full_name":"Ojida, Akio"}],"article_processing_charge":"No","acknowledgement":"his work was supported by the Grant-in-Aid for Scientific Research B (JSPS KAKENHI grant no. JP17H03090 to A. O.); the Scientific Research on Innovative Areas “Chemistry for Multimolecular Crowding Biosystems” (JSPS KAKENHI grant no. JP17H06349 to A. O.); and the European Union (European Research Council Advanced grant no. 694539 and Human Brain Project Ref. 720270 to R. S.). A. O. acknowledges the financial support of the Takeda Science Foundation.","quality_controlled":"1","publisher":"Bulletin of the Chemical Society of Japan","oa":1,"day":"15","publication":"Bulletin of the Chemical Society of Japan","has_accepted_license":"1","year":"2019","doi":"10.1246/bcsj.20190034","date_published":"2019-05-15T00:00:00Z","date_created":"2019-07-21T21:59:16Z","page":"995-1000","_id":"6659","status":"public","article_type":"original","type":"journal_article","ddc":["570"],"date_updated":"2021-01-12T08:08:26Z","file_date_updated":"2020-10-02T08:49:58Z","department":[{"_id":"RySh"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Chemical labeling of proteins with synthetic molecular probes offers the possibility to probe the functions of proteins of interest in living cells. However, the methods for covalently labeling targeted proteins using complementary peptide tag-probe pairs are still limited, irrespective of the versatility of such pairs in biological research. Herein, we report the new CysHis tag-Ni(II) probe pair for the specific covalent labeling of proteins. A broad-range evaluation of the reactivity profiles of the probe and the CysHis peptide tag afforded a tag-probe pair with an optimized and high labeling selectivity and reactivity. In particular, the labeling specificity of this pair was notably improved compared to the previously reported one. This pair was successfully utilized for the fluorescence imaging of membrane proteins on the surfaces of living cells, demonstrating its potential utility in biological research."}],"month":"05","intvolume":" 92","scopus_import":"1","file":[{"file_size":2464903,"date_updated":"2020-10-02T08:49:58Z","creator":"dernst","file_name":"2019_BCSJ_Zenmyo.pdf","date_created":"2020-10-02T08:49:58Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"checksum":"186de511d6e0ca93f5d981e2443eb8cd","file_id":"8594"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["00092673"]},"publication_status":"published","issue":"5","volume":92,"ec_funded":1},{"abstract":[{"text":"In phase retrieval, we want to recover an unknown signal 𝑥∈ℂ𝑑 from n quadratic measurements of the form 𝑦𝑖=|⟨𝑎𝑖,𝑥⟩|2+𝑤𝑖, where 𝑎𝑖∈ℂ𝑑 are known sensing vectors and 𝑤𝑖 is measurement noise. We ask the following weak recovery question: What is the minimum number of measurements n needed to produce an estimator 𝑥^(𝑦) that is positively correlated with the signal 𝑥? We consider the case of Gaussian vectors 𝑎𝑎𝑖. We prove that—in the high-dimensional limit—a sharp phase transition takes place, and we locate the threshold in the regime of vanishingly small noise. For 𝑛≤𝑑−𝑜(𝑑), no estimator can do significantly better than random and achieve a strictly positive correlation. For 𝑛≥𝑑+𝑜(𝑑), a simple spectral estimator achieves a positive correlation. Surprisingly, numerical simulations with the same spectral estimator demonstrate promising performance with realistic sensing matrices. Spectral methods are used to initialize non-convex optimization algorithms in phase retrieval, and our approach can boost the performance in this setting as well. Our impossibility result is based on classical information-theoretic arguments. The spectral algorithm computes the leading eigenvector of a weighted empirical covariance matrix. We obtain a sharp characterization of the spectral properties of this random matrix using tools from free probability and generalizing a recent result by Lu and Li. Both the upper bound and lower bound generalize beyond phase retrieval to measurements 𝑦𝑖 produced according to a generalized linear model. As a by-product of our analysis, we compare the threshold of the proposed spectral method with that of a message passing algorithm.","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1708.05932"}],"month":"06","intvolume":" 19","publication_identifier":{"eissn":["1615-3383"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":19,"issue":"3","_id":"6662","type":"journal_article","article_type":"original","status":"public","date_updated":"2021-01-12T08:08:28Z","extern":"1","quality_controlled":"1","publisher":"Springer","oa":1,"year":"2019","day":"01","publication":"Foundations of Computational Mathematics","page":"703-773","doi":"10.1007/s10208-018-9395-y","date_published":"2019-06-01T00:00:00Z","date_created":"2019-07-22T13:23:48Z","citation":{"mla":"Mondelli, Marco, and Andrea Montanari. “Fundamental Limits of Weak Recovery with Applications to Phase Retrieval.” Foundations of Computational Mathematics, vol. 19, no. 3, Springer, 2019, pp. 703–73, doi:10.1007/s10208-018-9395-y.","apa":"Mondelli, M., & Montanari, A. (2019). Fundamental limits of weak recovery with applications to phase retrieval. Foundations of Computational Mathematics. Springer. https://doi.org/10.1007/s10208-018-9395-y","ama":"Mondelli M, Montanari A. Fundamental limits of weak recovery with applications to phase retrieval. Foundations of Computational Mathematics. 2019;19(3):703-773. doi:10.1007/s10208-018-9395-y","ieee":"M. Mondelli and A. Montanari, “Fundamental limits of weak recovery with applications to phase retrieval,” Foundations of Computational Mathematics, vol. 19, no. 3. Springer, pp. 703–773, 2019.","short":"M. Mondelli, A. Montanari, Foundations of Computational Mathematics 19 (2019) 703–773.","chicago":"Mondelli, Marco, and Andrea Montanari. “Fundamental Limits of Weak Recovery with Applications to Phase Retrieval.” Foundations of Computational Mathematics. Springer, 2019. https://doi.org/10.1007/s10208-018-9395-y.","ista":"Mondelli M, Montanari A. 2019. Fundamental limits of weak recovery with applications to phase retrieval. Foundations of Computational Mathematics. 19(3), 703–773."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco"},{"first_name":"Andrea","full_name":"Montanari, Andrea","last_name":"Montanari"}],"external_id":{"arxiv":["1708.05932"]},"title":"Fundamental limits of weak recovery with applications to phase retrieval"},{"day":"21","publication":"SIAM Journal on Computing","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0097-5397"],"eissn":["1095-7111"]},"publication_status":"published","year":"2019","doi":"10.1137/17m1152292","issue":"3","volume":48,"date_published":"2019-05-21T00:00:00Z","date_created":"2019-07-24T08:42:12Z","page":"1046-1097","oa_version":"Preprint","abstract":[{"lang":"eng","text":"The construction of anisotropic triangulations is desirable for various applications, such as the numerical solving of partial differential equations and the representation of surfaces in graphics. To solve this notoriously difficult problem in a practical way, we introduce the discrete Riemannian Voronoi diagram, a discrete structure that approximates the Riemannian Voronoi diagram. This structure has been implemented and was shown to lead to good triangulations in $\\mathbb{R}^2$ and on surfaces embedded in $\\mathbb{R}^3$ as detailed in our experimental companion paper. In this paper, we study theoretical aspects of our structure. Given a finite set of points $\\mathcal{P}$ in a domain $\\Omega$ equipped with a Riemannian metric, we compare the discrete Riemannian Voronoi diagram of $\\mathcal{P}$ to its Riemannian Voronoi diagram. Both diagrams have dual structures called the discrete Riemannian Delaunay and the Riemannian Delaunay complex. We provide conditions that guarantee that these dual structures are identical. It then follows from previous results that the discrete Riemannian Delaunay complex can be embedded in $\\Omega$ under sufficient conditions, leading to an anisotropic triangulation with curved simplices. Furthermore, we show that, under similar conditions, the simplices of this triangulation can be straightened."}],"month":"05","intvolume":" 48","quality_controlled":"1","publisher":"Society for Industrial & Applied Mathematics (SIAM)","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1703.06487","open_access":"1"}],"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Boissonnat J-D, Rouxel-Labbé M, Wintraecken M. 2019. Anisotropic triangulations via discrete Riemannian Voronoi diagrams. SIAM Journal on Computing. 48(3), 1046–1097.","chicago":"Boissonnat, Jean-Daniel, Mael Rouxel-Labbé, and Mathijs Wintraecken. “Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams.” SIAM Journal on Computing. Society for Industrial & Applied Mathematics (SIAM), 2019. https://doi.org/10.1137/17m1152292.","short":"J.-D. Boissonnat, M. Rouxel-Labbé, M. Wintraecken, SIAM Journal on Computing 48 (2019) 1046–1097.","ieee":"J.-D. Boissonnat, M. Rouxel-Labbé, and M. Wintraecken, “Anisotropic triangulations via discrete Riemannian Voronoi diagrams,” SIAM Journal on Computing, vol. 48, no. 3. Society for Industrial & Applied Mathematics (SIAM), pp. 1046–1097, 2019.","ama":"Boissonnat J-D, Rouxel-Labbé M, Wintraecken M. Anisotropic triangulations via discrete Riemannian Voronoi diagrams. SIAM Journal on Computing. 2019;48(3):1046-1097. doi:10.1137/17m1152292","apa":"Boissonnat, J.-D., Rouxel-Labbé, M., & Wintraecken, M. (2019). Anisotropic triangulations via discrete Riemannian Voronoi diagrams. SIAM Journal on Computing. Society for Industrial & Applied Mathematics (SIAM). https://doi.org/10.1137/17m1152292","mla":"Boissonnat, Jean-Daniel, et al. “Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams.” SIAM Journal on Computing, vol. 48, no. 3, Society for Industrial & Applied Mathematics (SIAM), 2019, pp. 1046–97, doi:10.1137/17m1152292."},"date_updated":"2021-01-12T08:08:30Z","title":"Anisotropic triangulations via discrete Riemannian Voronoi diagrams","author":[{"first_name":"Jean-Daniel","full_name":"Boissonnat, Jean-Daniel","last_name":"Boissonnat"},{"first_name":"Mael","full_name":"Rouxel-Labbé, Mael","last_name":"Rouxel-Labbé"},{"first_name":"Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","last_name":"Wintraecken","orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs"}],"external_id":{"arxiv":["1703.06487"]},"_id":"6672","status":"public","type":"journal_article"},{"project":[{"grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"citation":{"chicago":"Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.” In 46th International Colloquium on Automata, Languages and Programming, 132:77:1-77:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.ICALP.2019.77.","ista":"Kolmogorov V. 2019. Testing the complexity of a valued CSP language. 46th International Colloquium on Automata, Languages and Programming. ICALP 2019: International Colloquim on Automata, Languages and Programming, LIPIcs, vol. 132, 77:1-77:12.","mla":"Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.” 46th International Colloquium on Automata, Languages and Programming, vol. 132, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12, doi:10.4230/LIPICS.ICALP.2019.77.","apa":"Kolmogorov, V. (2019). Testing the complexity of a valued CSP language. In 46th International Colloquium on Automata, Languages and Programming (Vol. 132, p. 77:1-77:12). Patras, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ICALP.2019.77","ama":"Kolmogorov V. Testing the complexity of a valued CSP language. In: 46th International Colloquium on Automata, Languages and Programming. Vol 132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:77:1-77:12. doi:10.4230/LIPICS.ICALP.2019.77","ieee":"V. Kolmogorov, “Testing the complexity of a valued CSP language,” in 46th International Colloquium on Automata, Languages and Programming, Patras, Greece, 2019, vol. 132, p. 77:1-77:12.","short":"V. Kolmogorov, in:, 46th International Colloquium on Automata, Languages and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov"}],"external_id":{"arxiv":["1803.02289"]},"title":"Testing the complexity of a valued CSP language","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"has_accepted_license":"1","year":"2019","day":"01","publication":"46th International Colloquium on Automata, Languages and Programming","page":"77:1-77:12","doi":"10.4230/LIPICS.ICALP.2019.77","date_published":"2019-07-01T00:00:00Z","date_created":"2019-07-29T12:23:29Z","_id":"6725","type":"conference","conference":{"name":"ICALP 2019: International Colloquim on Automata, Languages and Programming","end_date":"2019-07-12","location":"Patras, Greece","start_date":"2019-07-08"},"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","date_updated":"2021-01-12T08:08:40Z","ddc":["000"],"file_date_updated":"2020-07-14T12:47:38Z","department":[{"_id":"VlKo"}],"abstract":[{"lang":"eng","text":"A Valued Constraint Satisfaction Problem (VCSP) provides a common framework that can express a wide range of discrete optimization problems. A VCSP instance is given by a finite set of variables, a finite domain of labels, and an objective function to be minimized. This function is represented as a sum of terms where each term depends on a subset of the variables. To obtain different classes of optimization problems, one can restrict all terms to come from a fixed set Γ of cost functions, called a language. \r\nRecent breakthrough results have established a complete complexity classification of such classes with respect to language Γ: if all cost functions in Γ satisfy a certain algebraic condition then all Γ-instances can be solved in polynomial time, otherwise the problem is NP-hard. Unfortunately, testing this condition for a given language Γ is known to be NP-hard. We thus study exponential algorithms for this meta-problem. We show that the tractability condition of a finite-valued language Γ can be tested in O(3‾√3|D|⋅poly(size(Γ))) time, where D is the domain of Γ and poly(⋅) is some fixed polynomial. We also obtain a matching lower bound under the Strong Exponential Time Hypothesis (SETH). More precisely, we prove that for any constant δ<1 there is no O(3‾√3δ|D|) algorithm, assuming that SETH holds."}],"oa_version":"Published Version","scopus_import":1,"alternative_title":["LIPIcs"],"month":"07","intvolume":" 132","publication_identifier":{"isbn":["978-3-95977-109-2"],"issn":["1868-8969"]},"publication_status":"published","file":[{"file_name":"2019_LIPICS_Kolmogorov.pdf","date_created":"2019-07-31T07:01:45Z","file_size":575475,"date_updated":"2020-07-14T12:47:38Z","creator":"dernst","checksum":"f5ebee8eec6ae09e30365578ee63a492","file_id":"6738","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"volume":132,"ec_funded":1},{"project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","grant_number":"682815"}],"article_processing_charge":"No","author":[{"last_name":"Walter","full_name":"Walter, Michael","orcid":"0000-0003-3186-2482","first_name":"Michael","id":"488F98B0-F248-11E8-B48F-1D18A9856A87"}],"editor":[{"last_name":"Buchmann","full_name":"Buchmann, J","first_name":"J"},{"full_name":"Nitaj, A","last_name":"Nitaj","first_name":"A"},{"first_name":"T","last_name":"Rachidi","full_name":"Rachidi, T"}],"title":"Sampling the integers with low relative error","citation":{"apa":"Walter, M. (2019). Sampling the integers with low relative error. In J. Buchmann, A. Nitaj, & T. Rachidi (Eds.), Progress in Cryptology – AFRICACRYPT 2019 (Vol. 11627, pp. 157–180). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-23696-0_9","ama":"Walter M. Sampling the integers with low relative error. In: Buchmann J, Nitaj A, Rachidi T, eds. Progress in Cryptology – AFRICACRYPT 2019. Vol 11627. LNCS. Cham: Springer Nature; 2019:157-180. doi:10.1007/978-3-030-23696-0_9","short":"M. Walter, in:, J. Buchmann, A. Nitaj, T. Rachidi (Eds.), Progress in Cryptology – AFRICACRYPT 2019, Springer Nature, Cham, 2019, pp. 157–180.","ieee":"M. Walter, “Sampling the integers with low relative error,” in Progress in Cryptology – AFRICACRYPT 2019, vol. 11627, J. Buchmann, A. Nitaj, and T. Rachidi, Eds. Cham: Springer Nature, 2019, pp. 157–180.","mla":"Walter, Michael. “Sampling the Integers with Low Relative Error.” Progress in Cryptology – AFRICACRYPT 2019, edited by J Buchmann et al., vol. 11627, Springer Nature, 2019, pp. 157–80, doi:10.1007/978-3-030-23696-0_9.","ista":"Walter M. 2019.Sampling the integers with low relative error. In: Progress in Cryptology – AFRICACRYPT 2019. vol. 11627, 157–180.","chicago":"Walter, Michael. “Sampling the Integers with Low Relative Error.” In Progress in Cryptology – AFRICACRYPT 2019, edited by J Buchmann, A Nitaj, and T Rachidi, 11627:157–80. LNCS. Cham: Springer Nature, 2019. https://doi.org/10.1007/978-3-030-23696-0_9."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","oa":1,"publisher":"Springer Nature","quality_controlled":"1","page":"157-180","date_created":"2019-07-29T12:25:31Z","doi":"10.1007/978-3-030-23696-0_9","date_published":"2019-06-29T00:00:00Z","year":"2019","publication":"Progress in Cryptology – AFRICACRYPT 2019","day":"29","conference":{"name":"AFRICACRYPT: International Conference on Cryptology in Africa","location":"Rabat, Morocco","end_date":"2019-07-11","start_date":"2019-07-09"},"type":"book_chapter","status":"public","_id":"6726","series_title":"LNCS","department":[{"_id":"KrPi"}],"date_updated":"2023-02-23T12:50:15Z","main_file_link":[{"url":"https://eprint.iacr.org/2019/068","open_access":"1"}],"scopus_import":"1","intvolume":" 11627","month":"06","place":"Cham","abstract":[{"text":"Randomness is an essential part of any secure cryptosystem, but many constructions rely on distributions that are not uniform. This is particularly true for lattice based cryptosystems, which more often than not make use of discrete Gaussian distributions over the integers. For practical purposes it is crucial to evaluate the impact that approximation errors have on the security of a scheme to provide the best possible trade-off between security and performance. Recent years have seen surprising results allowing to use relatively low precision while maintaining high levels of security. A key insight in these results is that sampling a distribution with low relative error can provide very strong security guarantees. Since floating point numbers provide guarantees on the relative approximation error, they seem a suitable tool in this setting, but it is not obvious which sampling algorithms can actually profit from them. While previous works have shown that inversion sampling can be adapted to provide a low relative error (Pöppelmann et al., CHES 2014; Prest, ASIACRYPT 2017), other works have called into question if this is possible for other sampling techniques (Zheng et al., Eprint report 2018/309). In this work, we consider all sampling algorithms that are popular in the cryptographic setting and analyze the relationship of floating point precision and the resulting relative error. We show that all of the algorithms either natively achieve a low relative error or can be adapted to do so.","lang":"eng"}],"oa_version":"Preprint","ec_funded":1,"volume":11627,"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["978-3-0302-3695-3"],"eisbn":["978-3-0302-3696-0"]},"language":[{"iso":"eng"}]},{"abstract":[{"text":"Consider the problem of constructing a polar code of block length N for a given transmission channel W. Previous approaches require one to compute the reliability of the N synthetic channels and then use only those that are sufficiently reliable. However, we know from two independent works by Schürch and by Bardet et al. that the synthetic channels are partially ordered with respect to degradation. Hence, it is natural to ask whether the partial order can be exploited to reduce the computational burden of the construction problem. We show that, if we take advantage of the partial order, we can construct a polar code by computing the reliability of roughly a fraction 1/ log 3/2 N of the synthetic channels. In particular, we prove that N/ log 3/2 N is a lower bound on the number of synthetic channels to be considered and such a bound is tight up to a multiplicative factor log log N. This set of roughly N/ log 3/2 N synthetic channels is universal, in the sense that it allows one to construct polar codes for any W, and it can be identified by solving a maximum matching problem on a bipartite graph. Our proof technique consists of reducing the construction problem to the problem of computing the maximum cardinality of an antichain for a suitable partially ordered set. As such, this method is general, and it can be used to further improve the complexity of the construction problem, in case a refined partial order on the synthetic channels of polar codes is discovered.","lang":"eng"}],"oa_version":"Preprint","quality_controlled":"1","publisher":"IEEE","main_file_link":[{"url":"https://arxiv.org/abs/1612.05295","open_access":"1"}],"oa":1,"month":"05","intvolume":" 65","publication_status":"published","year":"2019","day":"01","publication":"IEEE","language":[{"iso":"eng"}],"page":"2782-2791","issue":"5","date_published":"2019-05-01T00:00:00Z","doi":"10.1109/tit.2018.2889667","volume":65,"related_material":{"record":[{"status":"public","id":"6729","relation":"earlier_version"}]},"date_created":"2019-07-23T07:32:57Z","_id":"6663","type":"journal_article","status":"public","citation":{"ista":"Mondelli M, Hassani H, Urbanke R. 2019. Construction of polar codes with sublinear complexity. IEEE. 65(5), 2782–2791.","chicago":"Mondelli, Marco, Hamed Hassani, and Rudiger Urbanke. “Construction of Polar Codes with Sublinear Complexity.” IEEE. IEEE, 2019. https://doi.org/10.1109/tit.2018.2889667.","short":"M. Mondelli, H. Hassani, R. Urbanke, IEEE 65 (2019) 2782–2791.","ieee":"M. Mondelli, H. Hassani, and R. Urbanke, “Construction of polar codes with sublinear complexity,” IEEE, vol. 65, no. 5. IEEE, pp. 2782–2791, 2019.","ama":"Mondelli M, Hassani H, Urbanke R. Construction of polar codes with sublinear complexity. IEEE. 2019;65(5):2782-2791. doi:10.1109/tit.2018.2889667","apa":"Mondelli, M., Hassani, H., & Urbanke, R. (2019). Construction of polar codes with sublinear complexity. IEEE. IEEE. https://doi.org/10.1109/tit.2018.2889667","mla":"Mondelli, Marco, et al. “Construction of Polar Codes with Sublinear Complexity.” IEEE, vol. 65, no. 5, IEEE, 2019, pp. 2782–91, doi:10.1109/tit.2018.2889667."},"date_updated":"2023-02-23T12:50:20Z","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco","last_name":"Mondelli","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425"},{"last_name":"Hassani","full_name":"Hassani, Hamed","first_name":"Hamed"},{"last_name":"Urbanke","full_name":"Urbanke, Rudiger","first_name":"Rudiger"}],"external_id":{"arxiv":["1612.05295"]},"title":"Construction of polar codes with sublinear complexity"},{"abstract":[{"text":"We establish connections between the problem of learning a two-layer neural network and tensor decomposition. We consider a model with feature vectors x∈ℝd, r hidden units with weights {wi}1≤i≤r and output y∈ℝ, i.e., y=∑ri=1σ(w𝖳ix), with activation functions given by low-degree polynomials. In particular, if σ(x)=a0+a1x+a3x3, we prove that no polynomial-time learning algorithm can outperform the trivial predictor that assigns to each example the response variable 𝔼(y), when d3/2≪r≪d2. Our conclusion holds for a `natural data distribution', namely standard Gaussian feature vectors x, and output distributed according to a two-layer neural network with random isotropic weights, and under a certain complexity-theoretic assumption on tensor decomposition. Roughly speaking, we assume that no polynomial-time algorithm can substantially outperform current methods for tensor decomposition based on the sum-of-squares hierarchy. We also prove generalizations of this statement for higher degree polynomial activations, and non-random weight vectors. Remarkably, several existing algorithms for learning two-layer networks with rigorous guarantees are based on tensor decomposition. Our results support the idea that this is indeed the core computational difficulty in learning such networks, under the stated generative model for the data. As a side result, we show that under this model learning the network requires accurate learning of its weights, a property that does not hold in a more general setting. ","lang":"eng"}],"oa_version":"Preprint","publisher":"Proceedings of Machine Learning Research","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1802.07301","open_access":"1"}],"oa":1,"month":"04","intvolume":" 89","year":"2019","publication_status":"published","day":"01","publication":"Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics","language":[{"iso":"eng"}],"page":"1051-1060","date_published":"2019-04-01T00:00:00Z","volume":89,"date_created":"2019-07-31T09:31:26Z","_id":"6747","type":"conference","conference":{"name":"AISTATS: Artificial Intelligence and Statistics","start_date":"2019-04-16","location":"Naha, Okinawa, Japan","end_date":"2019-04-18"},"status":"public","citation":{"chicago":"Mondelli, Marco, and Andrea Montanari. “On the Connection between Learning Two-Layers Neural Networks and Tensor Decomposition.” In Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 89:1051–60. Proceedings of Machine Learning Research, 2019.","ista":"Mondelli M, Montanari A. 2019. On the connection between learning two-layers neural networks and tensor decomposition. Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics. AISTATS: Artificial Intelligence and Statistics vol. 89, 1051–1060.","mla":"Mondelli, Marco, and Andrea Montanari. “On the Connection between Learning Two-Layers Neural Networks and Tensor Decomposition.” Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, vol. 89, Proceedings of Machine Learning Research, 2019, pp. 1051–60.","apa":"Mondelli, M., & Montanari, A. (2019). On the connection between learning two-layers neural networks and tensor decomposition. In Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics (Vol. 89, pp. 1051–1060). Naha, Okinawa, Japan: Proceedings of Machine Learning Research.","ama":"Mondelli M, Montanari A. On the connection between learning two-layers neural networks and tensor decomposition. In: Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics. Vol 89. Proceedings of Machine Learning Research; 2019:1051-1060.","ieee":"M. Mondelli and A. Montanari, “On the connection between learning two-layers neural networks and tensor decomposition,” in Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, Naha, Okinawa, Japan, 2019, vol. 89, pp. 1051–1060.","short":"M. Mondelli, A. Montanari, in:, Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, Proceedings of Machine Learning Research, 2019, pp. 1051–1060."},"date_updated":"2021-01-12T08:08:49Z","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco"},{"first_name":"Andrea","last_name":"Montanari","full_name":"Montanari, Andrea"}],"article_processing_charge":"No","external_id":{"arxiv":["1802.07301"]},"title":"On the connection between learning two-layers neural networks and tensor decomposition"},{"publisher":"IEEE","quality_controlled":"1","oa":1,"day":"15","publication":"IEEE Transactions on Signal Processing","year":"2019","date_published":"2019-11-15T00:00:00Z","doi":"10.1109/TSP.2019.2944738","date_created":"2019-07-31T09:51:14Z","article_number":"8854897","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","citation":{"ista":"Hashemi SA, Condo C, Mondelli M, Gross WJ. 2019. Rate-flexible fast polar decoders. IEEE Transactions on Signal Processing. 67(22), 8854897.","chicago":"Hashemi, Seyyed Ali, Carlo Condo, Marco Mondelli, and Warren J Gross. “Rate-Flexible Fast Polar Decoders.” IEEE Transactions on Signal Processing. IEEE, 2019. https://doi.org/10.1109/TSP.2019.2944738.","apa":"Hashemi, S. A., Condo, C., Mondelli, M., & Gross, W. J. (2019). Rate-flexible fast polar decoders. IEEE Transactions on Signal Processing. IEEE. https://doi.org/10.1109/TSP.2019.2944738","ama":"Hashemi SA, Condo C, Mondelli M, Gross WJ. Rate-flexible fast polar decoders. IEEE Transactions on Signal Processing. 2019;67(22). doi:10.1109/TSP.2019.2944738","ieee":"S. A. Hashemi, C. Condo, M. Mondelli, and W. J. Gross, “Rate-flexible fast polar decoders,” IEEE Transactions on Signal Processing, vol. 67, no. 22. IEEE, 2019.","short":"S.A. Hashemi, C. Condo, M. Mondelli, W.J. Gross, IEEE Transactions on Signal Processing 67 (2019).","mla":"Hashemi, Seyyed Ali, et al. “Rate-Flexible Fast Polar Decoders.” IEEE Transactions on Signal Processing, vol. 67, no. 22, 8854897, IEEE, 2019, doi:10.1109/TSP.2019.2944738."},"title":"Rate-flexible fast polar decoders","author":[{"full_name":"Hashemi, Seyyed Ali","last_name":"Hashemi","first_name":"Seyyed Ali"},{"first_name":"Carlo","full_name":"Condo, Carlo","last_name":"Condo"},{"id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020","last_name":"Mondelli"},{"first_name":"Warren J","last_name":"Gross","full_name":"Gross, Warren J"}],"external_id":{"arxiv":["1903.09203"]},"article_processing_charge":"No","oa_version":"Preprint","abstract":[{"lang":"eng","text":"Polar codes have gained extensive attention during the past few years and recently they have been selected for the next generation of wireless communications standards (5G). Successive-cancellation-based (SC-based) decoders, such as SC list (SCL) and SC flip (SCF), provide a reasonable error performance for polar codes at the cost of low decoding speed. Fast SC-based decoders, such as Fast-SSC, Fast-SSCL, and Fast-SSCF, identify the special constituent codes in a polar code graph off-line, produce a list of operations, store the list in memory, and feed the list to the decoder to decode the constituent codes in order efficiently, thus increasing the decoding speed. However, the list of operations is dependent on the code rate and as the rate changes, a new list is produced, making fast SC-based decoders not rate-flexible. In this paper, we propose a completely rate-flexible fast SC-based decoder by creating the list of operations directly in hardware, with low implementation complexity. We further propose a hardware architecture implementing the proposed method and show that the area occupation of the rate-flexible fast SC-based decoder in this paper is only 38% of the total area of the memory-based base-line decoder when 5G code rates are supported. "}],"month":"11","intvolume":" 67","scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1903.09203"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1053587X"]},"publication_status":"published","issue":"22","volume":67,"_id":"6750","status":"public","article_type":"original","type":"journal_article","date_updated":"2021-01-12T08:08:51Z","department":[{"_id":"MaMo"}]},{"quality_controlled":"1","publisher":"Electronic Journal of Combinatorics","oa":1,"doi":"10.37236/8096","date_published":"2019-07-19T00:00:00Z","date_created":"2019-08-04T21:59:20Z","day":"19","publication":"Electronic Journal of Combinatorics","has_accepted_license":"1","year":"2019","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program"}],"article_number":"P3.17","title":"On grounded L-graphs and their relatives","author":[{"full_name":"Jelínek, Vít","last_name":"Jelínek","first_name":"Vít"},{"id":"4B865388-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","full_name":"Töpfer, Martin","last_name":"Töpfer"}],"article_processing_charge":"No","external_id":{"arxiv":["1808.04148"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Jelínek, V., & Töpfer, M. (2019). On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. Electronic Journal of Combinatorics. https://doi.org/10.37236/8096","ama":"Jelínek V, Töpfer M. On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. 2019;26(3). doi:10.37236/8096","short":"V. Jelínek, M. Töpfer, Electronic Journal of Combinatorics 26 (2019).","ieee":"V. Jelínek and M. Töpfer, “On grounded L-graphs and their relatives,” Electronic Journal of Combinatorics, vol. 26, no. 3. Electronic Journal of Combinatorics, 2019.","mla":"Jelínek, Vít, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.” Electronic Journal of Combinatorics, vol. 26, no. 3, P3.17, Electronic Journal of Combinatorics, 2019, doi:10.37236/8096.","ista":"Jelínek V, Töpfer M. 2019. On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. 26(3), P3.17.","chicago":"Jelínek, Vít, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.” Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2019. https://doi.org/10.37236/8096."},"month":"07","intvolume":" 26","scopus_import":"1","oa_version":"Published Version","abstract":[{"text":"We consider the graph class Grounded-L corresponding to graphs that admit an intersection representation by L-shaped curves, where additionally the topmost points of each curve are assumed to belong to a common horizontal line. We prove that Grounded-L graphs admit an equivalent characterisation in terms of vertex ordering with forbidden patterns. \r\nWe also compare this class to related intersection classes, such as the grounded segment graphs, the monotone L-graphs (a.k.a. max point-tolerance graphs), or the outer-1-string graphs. We give constructions showing that these classes are all distinct and satisfy only trivial or previously known inclusions.","lang":"eng"}],"issue":"3","volume":26,"ec_funded":1,"file":[{"file_id":"6764","checksum":"20fc366fc6683ef0b074a019b73a663a","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2019_eJourCombinatorics_Jelinek.pdf","date_created":"2019-08-05T06:46:55Z","creator":"dernst","file_size":533697,"date_updated":"2020-07-14T12:47:39Z"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["10778926"]},"publication_status":"published","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":"6759","file_date_updated":"2020-07-14T12:47:39Z","department":[{"_id":"DaAl"}],"ddc":["510"],"date_updated":"2022-03-18T12:32:02Z"},{"date_created":"2019-08-19T07:58:10Z","doi":"10.1007/978-3-030-30806-3_1","date_published":"2019-09-06T00:00:00Z","page":"1-12","publication":" Proceedings of the 13th International Conference of Reachability Problems","day":"06","year":"2019","has_accepted_license":"1","oa":1,"quality_controlled":"1","publisher":"Springer","title":"Bidding games on Markov decision processes","author":[{"first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen"},{"full_name":"Novotny, Petr","last_name":"Novotny","first_name":"Petr"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Avni, Guy, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Petr Novotny. “Bidding Games on Markov Decision Processes.” In Proceedings of the 13th International Conference of Reachability Problems, 11674:1–12. Springer, 2019. https://doi.org/10.1007/978-3-030-30806-3_1.","ista":"Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. 2019. Bidding games on Markov decision processes. Proceedings of the 13th International Conference of Reachability Problems. RP: Reachability Problems, LNCS, vol. 11674, 1–12.","mla":"Avni, Guy, et al. “Bidding Games on Markov Decision Processes.” Proceedings of the 13th International Conference of Reachability Problems, vol. 11674, Springer, 2019, pp. 1–12, doi:10.1007/978-3-030-30806-3_1.","ieee":"G. Avni, T. A. Henzinger, R. Ibsen-Jensen, and P. Novotny, “Bidding games on Markov decision processes,” in Proceedings of the 13th International Conference of Reachability Problems, Brussels, Belgium, 2019, vol. 11674, pp. 1–12.","short":"G. Avni, T.A. Henzinger, R. Ibsen-Jensen, P. Novotny, in:, Proceedings of the 13th International Conference of Reachability Problems, Springer, 2019, pp. 1–12.","ama":"Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. Bidding games on Markov decision processes. In: Proceedings of the 13th International Conference of Reachability Problems. Vol 11674. Springer; 2019:1-12. doi:10.1007/978-3-030-30806-3_1","apa":"Avni, G., Henzinger, T. A., Ibsen-Jensen, R., & Novotny, P. (2019). Bidding games on Markov decision processes. In Proceedings of the 13th International Conference of Reachability Problems (Vol. 11674, pp. 1–12). Brussels, Belgium: Springer. https://doi.org/10.1007/978-3-030-30806-3_1"},"project":[{"call_identifier":"FWF","_id":"264B3912-B435-11E9-9278-68D0E5697425","grant_number":"M02369","name":"Formal Methods meets Algorithmic Game Theory"},{"grant_number":"S11402-N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"},{"name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"volume":11674,"language":[{"iso":"eng"}],"file":[{"file_name":"prob.pdf","date_created":"2019-08-19T07:56:40Z","creator":"gavni","file_size":436635,"date_updated":"2020-07-14T12:47:41Z","checksum":"45ebbc709af2b247d28c7c293c01504b","file_id":"6823","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"publication_status":"published","publication_identifier":{"isbn":["978-303030805-6"],"issn":["0302-9743"]},"intvolume":" 11674","month":"09","alternative_title":["LNCS"],"scopus_import":1,"oa_version":"Submitted Version","abstract":[{"text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the qualitative winner or quantitative payoff of the game. In bidding games, in each turn, we hold an auction between the two players to determine which player moves the token. Bidding games have largely been studied with concrete bidding mechanisms that are variants of a first-price auction: in each turn both players simultaneously submit bids, the higher\r\nbidder moves the token, and pays his bid to the lower bidder in Richman bidding, to the bank in poorman bidding, and in taxman bidding, the bid is split between the other player and the bank according to a predefined constant factor. Bidding games are deterministic games. They have an intriguing connection with a fragment of stochastic games called \r\n randomturn games. We study, for the first time, a combination of bidding games with probabilistic behavior; namely, we study bidding games that are played on Markov decision processes, where the players bid for the right to choose the next action, which determines the probability distribution according to which the next vertex is chosen. We study parity and meanpayoff bidding games on MDPs and extend results from the deterministic bidding setting to the probabilistic one.","lang":"eng"}],"file_date_updated":"2020-07-14T12:47:41Z","department":[{"_id":"ToHe"}],"ddc":["000"],"date_updated":"2021-01-12T08:09:12Z","status":"public","conference":{"location":"Brussels, Belgium","end_date":"2019-09-13","start_date":"2019-09-11","name":"RP: Reachability Problems"},"type":"conference","_id":"6822"},{"department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:47:43Z","date_updated":"2022-08-12T10:54:34Z","ddc":["000"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"location":"Amsterdam, Netherlands","end_date":"2019-08-30","start_date":"2019-08-27","name":"CONCUR: International Conference on Concurrency Theory"},"type":"conference","status":"public","_id":"6887","ec_funded":1,"volume":140,"publication_status":"published","language":[{"iso":"eng"}],"file":[{"date_created":"2019-10-01T08:20:30Z","file_name":"2019_LIPIcs_Chatterjee.pdf","creator":"kschuh","date_updated":"2020-07-14T12:47:43Z","file_size":730112,"file_id":"6922","checksum":"e1f0e4061212454574f34a1368d018ec","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"scopus_import":"1","alternative_title":["LIPIcs"],"intvolume":" 140","month":"08","abstract":[{"text":"The fundamental model-checking problem, given as input a model and a specification, asks for the algorithmic verification of whether the model satisfies the specification. Two classical models for reactive systems are graphs and Markov decision processes (MDPs). A basic specification formalism in the verification of reactive systems is the strong fairness (aka Streett) objective, where given different types of requests and corresponding grants, the requirement is that for each type, if the request event happens infinitely often, then the corresponding grant event must also happen infinitely often. All omega-regular objectives can be expressed as Streett objectives and hence they are canonical in verification. Consider graphs/MDPs with n vertices, m edges, and a Streett objectives with k pairs, and let b denote the size of the description of the Streett objective for the sets of requests and grants. The current best-known algorithm for the problem requires time O(min(n^2, m sqrt{m log n}) + b log n). In this work we present randomized near-linear time algorithms, with expected running time O~(m + b), where the O~ notation hides poly-log factors. Our randomized algorithms are near-linear in the size of the input, and hence optimal up to poly-log factors. ","lang":"eng"}],"oa_version":"Published Version","article_processing_charge":"No","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Dvorák","full_name":"Dvorák, Wolfgang","first_name":"Wolfgang"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger"},{"first_name":"Alexander","full_name":"Svozil, Alexander","last_name":"Svozil"}],"title":"Near-linear time algorithms for Streett objectives in graphs and MDPs","citation":{"ama":"Chatterjee K, Dvorák W, Henzinger MH, Svozil A. Near-linear time algorithms for Streett objectives in graphs and MDPs. In: Leibniz International Proceedings in Informatics. Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.7","apa":"Chatterjee, K., Dvorák, W., Henzinger, M. H., & Svozil, A. (2019). Near-linear time algorithms for Streett objectives in graphs and MDPs. In Leibniz International Proceedings in Informatics (Vol. 140). Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.7","ieee":"K. Chatterjee, W. Dvorák, M. H. Henzinger, and A. Svozil, “Near-linear time algorithms for Streett objectives in graphs and MDPs,” in Leibniz International Proceedings in Informatics, Amsterdam, Netherlands, 2019, vol. 140.","short":"K. Chatterjee, W. Dvorák, M.H. Henzinger, A. Svozil, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","mla":"Chatterjee, Krishnendu, et al. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.” Leibniz International Proceedings in Informatics, vol. 140, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.7.","ista":"Chatterjee K, Dvorák W, Henzinger MH, Svozil A. 2019. Near-linear time algorithms for Streett objectives in graphs and MDPs. Leibniz International Proceedings in Informatics. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 7.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Alexander Svozil. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.” In Leibniz International Proceedings in Informatics, Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.7."},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory","grant_number":"S11407"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"article_number":"7","date_created":"2019-09-18T08:07:58Z","date_published":"2019-08-01T00:00:00Z","doi":"10.4230/LIPICS.CONCUR.2019.7","year":"2019","has_accepted_license":"1","publication":"Leibniz International Proceedings in Informatics","day":"01","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1"},{"quality_controlled":"1","publisher":"IEEE","oa":1,"doi":"10.1109/icra.2019.8793840","date_published":"2019-05-01T00:00:00Z","date_created":"2019-09-18T08:09:51Z","day":"01","publication":"Proceedings - IEEE International Conference on Robotics and Automation","has_accepted_license":"1","year":"2019","project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"}],"article_number":"8793840","title":"Designing worm-inspired neural networks for interpretable robotic control","author":[{"last_name":"Lechner","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias"},{"last_name":"Hasani","full_name":"Hasani, Ramin","first_name":"Ramin"},{"full_name":"Zimmer, Manuel","last_name":"Zimmer","first_name":"Manuel"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Radu","last_name":"Grosu","full_name":"Grosu, Radu"}],"article_processing_charge":"No","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","citation":{"chicago":"Lechner, Mathias, Ramin Hasani, Manuel Zimmer, Thomas A Henzinger, and Radu Grosu. “Designing Worm-Inspired Neural Networks for Interpretable Robotic Control.” In Proceedings - IEEE International Conference on Robotics and Automation, Vol. 2019–May. IEEE, 2019. https://doi.org/10.1109/icra.2019.8793840.","ista":"Lechner M, Hasani R, Zimmer M, Henzinger TA, Grosu R. 2019. Designing worm-inspired neural networks for interpretable robotic control. Proceedings - IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and Automation, ICRA, vol. 2019–May, 8793840.","mla":"Lechner, Mathias, et al. “Designing Worm-Inspired Neural Networks for Interpretable Robotic Control.” Proceedings - IEEE International Conference on Robotics and Automation, vol. 2019–May, 8793840, IEEE, 2019, doi:10.1109/icra.2019.8793840.","ieee":"M. Lechner, R. Hasani, M. Zimmer, T. A. Henzinger, and R. Grosu, “Designing worm-inspired neural networks for interpretable robotic control,” in Proceedings - IEEE International Conference on Robotics and Automation, Montreal, QC, Canada, 2019, vol. 2019–May.","short":"M. Lechner, R. Hasani, M. Zimmer, T.A. Henzinger, R. Grosu, in:, Proceedings - IEEE International Conference on Robotics and Automation, IEEE, 2019.","ama":"Lechner M, Hasani R, Zimmer M, Henzinger TA, Grosu R. Designing worm-inspired neural networks for interpretable robotic control. In: Proceedings - IEEE International Conference on Robotics and Automation. Vol 2019-May. IEEE; 2019. doi:10.1109/icra.2019.8793840","apa":"Lechner, M., Hasani, R., Zimmer, M., Henzinger, T. A., & Grosu, R. (2019). Designing worm-inspired neural networks for interpretable robotic control. In Proceedings - IEEE International Conference on Robotics and Automation (Vol. 2019–May). Montreal, QC, Canada: IEEE. https://doi.org/10.1109/icra.2019.8793840"},"month":"05","scopus_import":"1","alternative_title":["ICRA"],"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"In this paper, we design novel liquid time-constant recurrent neural networks for robotic control, inspired by the brain of the nematode, C. elegans. In the worm's nervous system, neurons communicate through nonlinear time-varying synaptic links established amongst them by their particular wiring structure. This property enables neurons to express liquid time-constants dynamics and therefore allows the network to originate complex behaviors with a small number of neurons. We identify neuron-pair communication motifs as design operators and use them to configure compact neuronal network structures to govern sequential robotic tasks. The networks are systematically designed to map the environmental observations to motor actions, by their hierarchical topology from sensory neurons, through recurrently-wired interneurons, to motor neurons. The networks are then parametrized in a supervised-learning scheme by a search-based algorithm. We demonstrate that obtained networks realize interpretable dynamics. We evaluate their performance in controlling mobile and arm robots, and compare their attributes to other artificial neural network-based control agents. Finally, we experimentally show their superior resilience to environmental noise, compared to the existing machine learning-based methods."}],"volume":"2019-May","file":[{"checksum":"f5545a6b60c3ffd01feb3613f81d03b6","file_id":"8636","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2020-10-08T17:30:38Z","file_name":"2019_ICRA_Lechner.pdf","date_updated":"2020-10-08T17:30:38Z","file_size":3265107,"creator":"dernst"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9781538660270"]},"publication_status":"published","status":"public","type":"conference","conference":{"name":"ICRA: International Conference on Robotics and Automation","start_date":"2019-05-20","end_date":"2019-05-24","location":"Montreal, QC, Canada"},"_id":"6888","department":[{"_id":"ToHe"}],"file_date_updated":"2020-10-08T17:30:38Z","ddc":["000"],"date_updated":"2021-01-12T08:09:28Z"},{"alternative_title":["LIPIcs"],"scopus_import":"1","month":"08","intvolume":" 140","abstract":[{"text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner of the game. Such games are central in formal methods since they model the interaction between a non-terminating system and its environment. In bidding games the players bid for the right to move the token: in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Bidding games are known to have a clean and elegant mathematical structure that relies on the ability of the players to submit arbitrarily small bids. Many applications, however, require a fixed granularity for the bids, which can represent, for example, the monetary value expressed in cents. We study, for the first time, the combination of discrete-bidding and infinite-duration games. Our most important result proves that these games form a large determined subclass of concurrent games, where determinacy is the strong property that there always exists exactly one player who can guarantee winning the game. In particular, we show that, in contrast to non-discrete bidding games, the mechanism with which tied bids are resolved plays an important role in discrete-bidding games. We study several natural tie-breaking mechanisms and show that, while some do not admit determinacy, most natural mechanisms imply determinacy for every pair of initial budgets. ","lang":"eng"}],"oa_version":"Published Version","volume":140,"license":"https://creativecommons.org/licenses/by/3.0/","publication_status":"published","file":[{"checksum":"4df6d3575c506edb17215adada03cc8e","file_id":"6915","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2019-09-27T12:21:38Z","file_name":"2019_LIPIcs_Aghajohari.pdf","creator":"kschuh","date_updated":"2020-07-14T12:47:43Z","file_size":741425}],"language":[{"iso":"eng"}],"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":"CONCUR: International Conference on Concurrency Theory","start_date":"2019-08-27","location":"Amsterdam, Netherlands","end_date":"2019-08-30"},"status":"public","_id":"6886","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:47:43Z","date_updated":"2022-01-26T08:27:10Z","ddc":["000"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"doi":"10.4230/LIPICS.CONCUR.2019.20","date_published":"2019-08-01T00:00:00Z","date_created":"2019-09-18T08:06:58Z","has_accepted_license":"1","year":"2019","day":"01","project":[{"grant_number":"S11402-N23","name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"M02369","name":"Formal Methods meets Algorithmic Game Theory","_id":"264B3912-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"article_number":"20","author":[{"first_name":"Milad","full_name":"Aghajohari, Milad","last_name":"Aghajohari"},{"full_name":"Avni, Guy","orcid":"0000-0001-5588-8287","last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Guy"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"article_processing_charge":"No","external_id":{"arxiv":["1905.03588"]},"title":"Determinacy in discrete-bidding infinite-duration games","citation":{"chicago":"Aghajohari, Milad, Guy Avni, and Thomas A Henzinger. “Determinacy in Discrete-Bidding Infinite-Duration Games,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.20.","ista":"Aghajohari M, Avni G, Henzinger TA. 2019. Determinacy in discrete-bidding infinite-duration games. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 20.","mla":"Aghajohari, Milad, et al. Determinacy in Discrete-Bidding Infinite-Duration Games. Vol. 140, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.20.","apa":"Aghajohari, M., Avni, G., & Henzinger, T. A. (2019). Determinacy in discrete-bidding infinite-duration games (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.20","ama":"Aghajohari M, Avni G, Henzinger TA. Determinacy in discrete-bidding infinite-duration games. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.20","short":"M. Aghajohari, G. Avni, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","ieee":"M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding infinite-duration games,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9"},{"project":[{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S11402-N23"}],"article_number":"27","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jan","last_name":"Otop","full_name":"Otop, Jan"}],"title":"Long-run average behavior of vector addition systems with states","citation":{"mla":"Chatterjee, Krishnendu, et al. Long-Run Average Behavior of Vector Addition Systems with States. Vol. 140, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.27.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Long-run average behavior of vector addition systems with states,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","ama":"Chatterjee K, Henzinger TA, Otop J. Long-run average behavior of vector addition systems with states. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.27","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2019). Long-run average behavior of vector addition systems with states (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.27","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Long-Run Average Behavior of Vector Addition Systems with States,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.27.","ista":"Chatterjee K, Henzinger TA, Otop J. 2019. Long-run average behavior of vector addition systems with states. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 27."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"date_published":"2019-08-01T00:00:00Z","doi":"10.4230/LIPICS.CONCUR.2019.27","date_created":"2019-09-18T08:06:14Z","has_accepted_license":"1","year":"2019","day":"01","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"CONCUR: International Conference on Concurrency Theory","start_date":"2019-08-27","location":"Amsterdam, Netherlands","end_date":"2019-08-30"},"status":"public","_id":"6885","file_date_updated":"2020-07-14T12:47:43Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"date_updated":"2021-01-12T08:09:27Z","ddc":["000"],"alternative_title":["LIPIcs"],"scopus_import":1,"month":"08","intvolume":" 140","abstract":[{"lang":"eng","text":"A vector addition system with states (VASS) consists of a finite set of states and counters. A configuration is a state and a value for each counter; a transition changes the state and each counter is incremented, decremented, or left unchanged. While qualitative properties such as state and configuration reachability have been studied for VASS, we consider the long-run average cost of infinite computations of VASS. The cost of a configuration is for each state, a linear combination of the counter values. In the special case of uniform cost functions, the linear combination is the same for all states. The (regular) long-run emptiness problem is, given a VASS, a cost function, and a threshold value, if there is a (lasso-shaped) computation such that the long-run average value of the cost function does not exceed the threshold. For uniform cost functions, we show that the regular long-run emptiness problem is (a) decidable in polynomial time for integer-valued VASS, and (b) decidable but nonelementarily hard for natural-valued VASS (i.e., nonnegative counters). For general cost functions, we show that the problem is (c) NP-complete for integer-valued VASS, and (d) undecidable for natural-valued VASS. Our most interesting result is for (c) integer-valued VASS with general cost functions, where we establish a connection between the regular long-run emptiness problem and quadratic Diophantine inequalities. The general (nonregular) long-run emptiness problem is equally hard as the regular problem in all cases except (c), where it remains open. "}],"oa_version":"Published Version","volume":140,"publication_status":"published","file":[{"file_name":"2019_LIPIcs_Chatterjee.pdf","date_created":"2019-09-27T12:09:35Z","file_size":538120,"date_updated":"2020-07-14T12:47:43Z","creator":"kschuh","file_id":"6914","checksum":"4985e26e1572d1575d64d38acabd71d6","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}]},{"publication_status":"published","language":[{"iso":"eng"}],"file":[{"file_id":"6923","checksum":"7b2ecfd4d9d02360308c0ca986fc10a7","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2019-10-01T08:49:45Z","file_name":"2019_LIPIcs_Chatterjee.pdf","creator":"kschuh","date_updated":"2020-07-14T12:47:43Z","file_size":509163}],"volume":140,"abstract":[{"lang":"eng","text":"We study Markov decision processes and turn-based stochastic games with parity conditions. There are three qualitative winning criteria, namely, sure winning, which requires all paths to satisfy the condition, almost-sure winning, which requires the condition to be satisfied with probability 1, and limit-sure winning, which requires the condition to be satisfied with probability arbitrarily close to 1. We study the combination of two of these criteria for parity conditions, e.g., there are two parity conditions one of which must be won surely, and the other almost-surely. The problem has been studied recently by Berthon et al. for MDPs with combination of sure and almost-sure winning, under infinite-memory strategies, and the problem has been established to be in NP cap co-NP. Even in MDPs there is a difference between finite-memory and infinite-memory strategies. Our main results for combination of sure and almost-sure winning are as follows: (a) we show that for MDPs with finite-memory strategies the problem is in NP cap co-NP; (b) we show that for turn-based stochastic games the problem is co-NP-complete, both for finite-memory and infinite-memory strategies; and (c) we present algorithmic results for the finite-memory case, both for MDPs and turn-based stochastic games, by reduction to non-stochastic parity games. In addition we show that all the above complexity results also carry over to combination of sure and limit-sure winning, and results for all other combinations can be derived from existing results in the literature. Thus we present a complete picture for the study of combinations of two qualitative winning criteria for parity conditions in MDPs and turn-based stochastic games. "}],"oa_version":"Published Version","alternative_title":["LIPIcs"],"scopus_import":1,"intvolume":" 140","month":"08","date_updated":"2021-01-12T08:09:28Z","ddc":["000"],"department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:47:43Z","_id":"6889","conference":{"name":"CONCUR: International Conference on Concurrency Theory","location":"Amsterdam, Netherlands","end_date":"2019-08-30","start_date":"2019-08-27"},"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":"conference","status":"public","year":"2019","has_accepted_license":"1","day":"01","date_created":"2019-09-18T08:11:43Z","date_published":"2019-08-01T00:00:00Z","doi":"10.4230/LIPICS.CONCUR.2019.6","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","citation":{"ista":"Chatterjee K, Piterman N. 2019. Combinations of Qualitative Winning for Stochastic Parity Games. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 6.","chicago":"Chatterjee, Krishnendu, and Nir Piterman. “Combinations of Qualitative Winning for Stochastic Parity Games,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.6.","short":"K. Chatterjee, N. Piterman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","ieee":"K. Chatterjee and N. Piterman, “Combinations of Qualitative Winning for Stochastic Parity Games,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.","apa":"Chatterjee, K., & Piterman, N. (2019). Combinations of Qualitative Winning for Stochastic Parity Games (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.6","ama":"Chatterjee K, Piterman N. Combinations of Qualitative Winning for Stochastic Parity Games. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.6","mla":"Chatterjee, Krishnendu, and Nir Piterman. Combinations of Qualitative Winning for Stochastic Parity Games. Vol. 140, 6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.6."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Piterman, Nir","last_name":"Piterman","first_name":"Nir"}],"title":"Combinations of Qualitative Winning for Stochastic Parity Games","article_number":"6","project":[{"name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"}]},{"intvolume":" 146","scopus_import":1,"alternative_title":["LIPIcs"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Consider a distributed system with n processors out of which f can be Byzantine faulty. In the\r\napproximate agreement task, each processor i receives an input value xi and has to decide on an\r\noutput value yi such that\r\n1. the output values are in the convex hull of the non-faulty processors’ input values,\r\n2. the output values are within distance d of each other.\r\n\r\n\r\nClassically, the values are assumed to be from an m-dimensional Euclidean space, where m ≥ 1.\r\nIn this work, we study the task in a discrete setting, where input values with some structure\r\nexpressible as a graph. Namely, the input values are vertices of a finite graph G and the goal is to\r\noutput vertices that are within distance d of each other in G, but still remain in the graph-induced\r\nconvex hull of the input values. For d = 0, the task reduces to consensus and cannot be solved with\r\na deterministic algorithm in an asynchronous system even with a single crash fault. For any d ≥ 1,\r\nwe show that the task is solvable in asynchronous systems when G is chordal and n > (ω + 1)f,\r\nwhere ω is the clique number of G. In addition, we give the first Byzantine-tolerant algorithm for a\r\nvariant of lattice agreement. For synchronous systems, we show tight resilience bounds for the exact\r\nvariants of these and related tasks over a large class of combinatorial structures."}],"ec_funded":1,"volume":146,"language":[{"iso":"eng"}],"file":[{"file_name":"LIPIcs-DISC-2019-29.pdf","date_created":"2019-10-08T12:47:19Z","file_size":639378,"date_updated":"2020-07-14T12:47:44Z","creator":"jrybicki","file_id":"6934","checksum":"2d2202f90c6ac991e50876451627c4b5","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"publication_status":"published","publication_identifier":{"eisbn":["978-3-95977-126-9"]},"keyword":["consensus","approximate agreement","Byzantine faults","chordal graphs","lattice agreement"],"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)"},"conference":{"name":"DISC: International Symposium on Distributed Computing","start_date":"2019-10-14","end_date":"2019-10-18","location":"Budapest, Hungary"},"type":"conference","_id":"6931","file_date_updated":"2020-07-14T12:47:44Z","department":[{"_id":"DaAl"}],"ddc":["004"],"date_updated":"2021-01-12T08:09:38Z","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","date_created":"2019-10-08T12:41:38Z","date_published":"2019-01-01T00:00:00Z","doi":"10.4230/LIPICS.DISC.2019.29","page":"29:1--29:17","publication":"33rd International Symposium on Distributed Computing","year":"2019","has_accepted_license":"1","project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"}],"title":"Byzantine approximate agreement on graphs","article_processing_charge":"No","external_id":{"arxiv":["1908.02743"]},"author":[{"first_name":"Thomas","last_name":"Nowak","full_name":"Nowak, Thomas"},{"full_name":"Rybicki, Joel","orcid":"0000-0002-6432-6646","last_name":"Rybicki","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","first_name":"Joel"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"short":"T. Nowak, J. Rybicki, in:, 33rd International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 29:1--29:17.","ieee":"T. Nowak and J. Rybicki, “Byzantine approximate agreement on graphs,” in 33rd International Symposium on Distributed Computing, Budapest, Hungary, 2019, vol. 146, p. 29:1--29:17.","ama":"Nowak T, Rybicki J. Byzantine approximate agreement on graphs. In: 33rd International Symposium on Distributed Computing. Vol 146. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:29:1--29:17. doi:10.4230/LIPICS.DISC.2019.29","apa":"Nowak, T., & Rybicki, J. (2019). Byzantine approximate agreement on graphs. In 33rd International Symposium on Distributed Computing (Vol. 146, p. 29:1--29:17). Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.DISC.2019.29","mla":"Nowak, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.” 33rd International Symposium on Distributed Computing, vol. 146, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 29:1--29:17, doi:10.4230/LIPICS.DISC.2019.29.","ista":"Nowak T, Rybicki J. 2019. Byzantine approximate agreement on graphs. 33rd International Symposium on Distributed Computing. DISC: International Symposium on Distributed Computing, LIPIcs, vol. 146, 29:1--29:17.","chicago":"Nowak, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.” In 33rd International Symposium on Distributed Computing, 146:29:1--29:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.DISC.2019.29."}},{"_id":"6985","article_number":"8851954","conference":{"name":"IJCNN: International Joint Conference on Neural Networks","start_date":"2019-07-14","end_date":"2019-07-19","location":"Budapest, Hungary"},"type":"conference","status":"public","date_updated":"2021-01-12T08:11:19Z","citation":{"mla":"Hasani, Ramin, et al. “Response Characterization for Auditing Cell Dynamics in Long Short-Term Memory Networks.” Proceedings of the International Joint Conference on Neural Networks, 8851954, IEEE, 2019, doi:10.1109/ijcnn.2019.8851954.","short":"R. Hasani, A. Amini, M. Lechner, F. Naser, R. Grosu, D. Rus, in:, Proceedings of the International Joint Conference on Neural Networks, IEEE, 2019.","ieee":"R. Hasani, A. Amini, M. Lechner, F. Naser, R. Grosu, and D. Rus, “Response characterization for auditing cell dynamics in long short-term memory networks,” in Proceedings of the International Joint Conference on Neural Networks, Budapest, Hungary, 2019.","apa":"Hasani, R., Amini, A., Lechner, M., Naser, F., Grosu, R., & Rus, D. (2019). Response characterization for auditing cell dynamics in long short-term memory networks. In Proceedings of the International Joint Conference on Neural Networks. Budapest, Hungary: IEEE. https://doi.org/10.1109/ijcnn.2019.8851954","ama":"Hasani R, Amini A, Lechner M, Naser F, Grosu R, Rus D. Response characterization for auditing cell dynamics in long short-term memory networks. In: Proceedings of the International Joint Conference on Neural Networks. IEEE; 2019. doi:10.1109/ijcnn.2019.8851954","chicago":"Hasani, Ramin, Alexander Amini, Mathias Lechner, Felix Naser, Radu Grosu, and Daniela Rus. “Response Characterization for Auditing Cell Dynamics in Long Short-Term Memory Networks.” In Proceedings of the International Joint Conference on Neural Networks. IEEE, 2019. https://doi.org/10.1109/ijcnn.2019.8851954.","ista":"Hasani R, Amini A, Lechner M, Naser F, Grosu R, Rus D. 2019. Response characterization for auditing cell dynamics in long short-term memory networks. Proceedings of the International Joint Conference on Neural Networks. IJCNN: International Joint Conference on Neural Networks, 8851954."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1809.03864"]},"author":[{"first_name":"Ramin","last_name":"Hasani","full_name":"Hasani, Ramin"},{"full_name":"Amini, Alexander","last_name":"Amini","first_name":"Alexander"},{"full_name":"Lechner, Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias"},{"last_name":"Naser","full_name":"Naser, Felix","first_name":"Felix"},{"full_name":"Grosu, Radu","last_name":"Grosu","first_name":"Radu"},{"first_name":"Daniela","full_name":"Rus, Daniela","last_name":"Rus"}],"title":"Response characterization for auditing cell dynamics in long short-term memory networks","department":[{"_id":"ToHe"}],"abstract":[{"lang":"eng","text":"In this paper, we introduce a novel method to interpret recurrent neural networks (RNNs), particularly long short-term memory networks (LSTMs) at the cellular level. We propose a systematic pipeline for interpreting individual hidden state dynamics within the network using response characterization methods. The ranked contribution of individual cells to the network's output is computed by analyzing a set of interpretable metrics of their decoupled step and sinusoidal responses. As a result, our method is able to uniquely identify neurons with insightful dynamics, quantify relationships between dynamical properties and test accuracy through ablation analysis, and interpret the impact of network capacity on a network's dynamical distribution. Finally, we demonstrate the generalizability and scalability of our method by evaluating a series of different benchmark sequential datasets."}],"oa_version":"Preprint","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1809.03864","open_access":"1"}],"scopus_import":1,"publisher":"IEEE","quality_controlled":"1","month":"09","publication_status":"published","year":"2019","publication_identifier":{"isbn":["9781728119854"]},"publication":"Proceedings of the International Joint Conference on Neural Networks","language":[{"iso":"eng"}],"day":"30","date_created":"2019-11-04T15:59:58Z","date_published":"2019-09-30T00:00:00Z","doi":"10.1109/ijcnn.2019.8851954"},{"article_number":"218","citation":{"apa":"Mondelli, M., Hassani, S. H., & Urbanke, R. (2019). A new coding paradigm for the primitive relay channel. Algorithms. MDPI. https://doi.org/10.3390/a12100218","ama":"Mondelli M, Hassani SH, Urbanke R. A new coding paradigm for the primitive relay channel. Algorithms. 2019;12(10). doi:10.3390/a12100218","ieee":"M. Mondelli, S. H. Hassani, and R. Urbanke, “A new coding paradigm for the primitive relay channel,” Algorithms, vol. 12, no. 10. MDPI, 2019.","short":"M. Mondelli, S.H. Hassani, R. Urbanke, Algorithms 12 (2019).","mla":"Mondelli, Marco, et al. “A New Coding Paradigm for the Primitive Relay Channel.” Algorithms, vol. 12, no. 10, 218, MDPI, 2019, doi:10.3390/a12100218.","ista":"Mondelli M, Hassani SH, Urbanke R. 2019. A new coding paradigm for the primitive relay channel. Algorithms. 12(10), 218.","chicago":"Mondelli, Marco, S. Hamed Hassani, and Rüdiger Urbanke. “A New Coding Paradigm for the Primitive Relay Channel.” Algorithms. MDPI, 2019. https://doi.org/10.3390/a12100218."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","last_name":"Mondelli","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020"},{"first_name":"S. Hamed","full_name":"Hassani, S. Hamed","last_name":"Hassani"},{"full_name":"Urbanke, Rüdiger","last_name":"Urbanke","first_name":"Rüdiger"}],"external_id":{"arxiv":["1801.03153"]},"title":"A new coding paradigm for the primitive relay channel","quality_controlled":"1","publisher":"MDPI","oa":1,"has_accepted_license":"1","year":"2019","day":"18","publication":"Algorithms","date_published":"2019-10-18T00:00:00Z","doi":"10.3390/a12100218","date_created":"2019-11-12T14:46:19Z","_id":"7007","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","date_updated":"2023-02-23T12:49:28Z","ddc":["510"],"department":[{"_id":"MaMo"}],"file_date_updated":"2020-07-14T12:47:47Z","abstract":[{"text":"We consider the primitive relay channel, where the source sends a message to the relay and to the destination, and the relay helps the communication by transmitting an additional message to the destination via a separate channel. Two well-known coding techniques have been introduced for this setting: decode-and-forward and compress-and-forward. In decode-and-forward, the relay completely decodes the message and sends some information to the destination; in compress-and-forward, the relay does not decode, and it sends a compressed version of the received signal to the destination using Wyner–Ziv coding. In this paper, we present a novel coding paradigm that provides an improved achievable rate for the primitive relay channel. The idea is to combine compress-and-forward and decode-and-forward via a chaining construction. We transmit over pairs of blocks: in the first block, we use compress-and-forward; and, in the second block, we use decode-and-forward. More specifically, in the first block, the relay does not decode, it compresses the received signal via Wyner–Ziv, and it sends only part of the compression to the destination. In the second block, the relay completely decodes the message, it sends some information to the destination, and it also sends the remaining part of the compression coming from the first block. By doing so, we are able to strictly outperform both compress-and-forward and decode-and-forward. Note that the proposed coding scheme can be implemented with polar codes. As such, it has the typical attractive properties of polar coding schemes, namely, quasi-linear encoding and decoding complexity, and error probability that decays at super-polynomial speed. As a running example, we take into account the special case of the erasure relay channel, and we provide a comparison between the rates achievable by our proposed scheme and the existing upper and lower bounds.","lang":"eng"}],"oa_version":"Published Version","scopus_import":1,"month":"10","intvolume":" 12","publication_identifier":{"issn":["1999-4893"]},"publication_status":"published","file":[{"creator":"dernst","date_updated":"2020-07-14T12:47:47Z","file_size":696791,"date_created":"2019-11-12T14:48:45Z","file_name":"2019_Algorithms_Mondelli.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"7008","checksum":"267756d8f9db572f496cd1663c89d59a"}],"language":[{"iso":"eng"}],"issue":"10","volume":12,"related_material":{"record":[{"relation":"earlier_version","id":"6675","status":"public"}]}},{"volume":2125,"date_published":"2019-01-30T00:00:00Z","date_created":"2019-11-18T15:39:53Z","page":"34-41","day":"30","language":[{"iso":"eng"}],"publication":"Kyoto RIMS Kôkyûroku","year":"2019","publication_status":"published","month":"01","intvolume":" 2125","publisher":"Research Institute for Mathematical Sciences, Kyoto University","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://www.kurims.kyoto-u.ac.jp/~kyodo/kokyuroku/contents/2125.html"}],"oa":1,"oa_version":"Submitted Version","abstract":[{"text":"The aim of this short note is to expound one particular issue that was discussed during the talk [10] given at the symposium ”Researches on isometries as preserver problems and related topics” at Kyoto RIMS. That is, the role of Dirac masses by describing the isometry group of various metric spaces of probability measures. This article is of survey character, and it does not contain any essentially new results.From an isometric point of view, in some cases, metric spaces of measures are similar to C(K)-type function spaces. Similarity means here that their isometries are driven by some nice transformations of the underlying space. Of course, it depends on the particular choice of the metric how nice these transformations should be. Sometimes, as we will see, being a homeomorphism is enough to generate an isometry. But sometimes we need more: the transformation must preserve the underlying distance as well. Statements claiming that isometries in questions are necessarily induced by homeomorphisms are called Banach-Stone-type results, while results asserting that the underlying transformation is necessarily an isometry are termed as isometric rigidity results.As Dirac masses can be considered as building bricks of the set of all Borel measures, a natural question arises:Is it enough to understand how an isometry acts on the set of Dirac masses? Does this action extend uniquely to all measures?In what follows, we will thoroughly investigate this question.","lang":"eng"}],"department":[{"_id":"LaEr"}],"title":"Dirac masses and isometric rigidity","author":[{"first_name":"Gyorgy Pal","last_name":"Geher","full_name":"Geher, Gyorgy Pal"},{"first_name":"Tamas","full_name":"Titkos, Tamas","last_name":"Titkos"},{"first_name":"Daniel","id":"48DB45DA-F248-11E8-B48F-1D18A9856A87","full_name":"Virosztek, Daniel","orcid":"0000-0003-1109-5511","last_name":"Virosztek"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:11:33Z","citation":{"ista":"Geher GP, Titkos T, Virosztek D. 2019. Dirac masses and isometric rigidity. Kyoto RIMS Kôkyûroku. Research on isometries as preserver problems and related topics vol. 2125, 34–41.","chicago":"Geher, Gyorgy Pal, Tamas Titkos, and Daniel Virosztek. “Dirac Masses and Isometric Rigidity.” In Kyoto RIMS Kôkyûroku, 2125:34–41. Research Institute for Mathematical Sciences, Kyoto University, 2019.","ama":"Geher GP, Titkos T, Virosztek D. Dirac masses and isometric rigidity. In: Kyoto RIMS Kôkyûroku. Vol 2125. Research Institute for Mathematical Sciences, Kyoto University; 2019:34-41.","apa":"Geher, G. P., Titkos, T., & Virosztek, D. (2019). Dirac masses and isometric rigidity. In Kyoto RIMS Kôkyûroku (Vol. 2125, pp. 34–41). Kyoto, Japan: Research Institute for Mathematical Sciences, Kyoto University.","short":"G.P. Geher, T. Titkos, D. Virosztek, in:, Kyoto RIMS Kôkyûroku, Research Institute for Mathematical Sciences, Kyoto University, 2019, pp. 34–41.","ieee":"G. P. Geher, T. Titkos, and D. Virosztek, “Dirac masses and isometric rigidity,” in Kyoto RIMS Kôkyûroku, Kyoto, Japan, 2019, vol. 2125, pp. 34–41.","mla":"Geher, Gyorgy Pal, et al. “Dirac Masses and Isometric Rigidity.” Kyoto RIMS Kôkyûroku, vol. 2125, Research Institute for Mathematical Sciences, Kyoto University, 2019, pp. 34–41."},"status":"public","type":"conference","conference":{"name":"Research on isometries as preserver problems and related topics","location":"Kyoto, Japan","end_date":"2019-01-30","start_date":"2019-01-28"},"_id":"7035"}]