---
_id: '10877'
abstract:
- lang: eng
text: 'This report presents the results of a friendly competition for formal verification
of continuous and hybrid systems with piecewise constant dynamics. The friendly
competition took place as part of the workshop Applied Verification for Continuous
and Hybrid Systems (ARCH) in 2019. In this third edition, six tools have been
applied to solve five different benchmark problems in the category for piecewise
constant dynamics: BACH, Lyse, Hy- COMP, PHAVer/SX, PHAVerLite, and VeriSiMPL.
Compared to last year, a new tool has participated (HyCOMP) and PHAVerLite has
replaced PHAVer-lite. The result is a snap- shot of the current landscape of tools
and the types of benchmarks they are particularly suited for. Due to the diversity
of problems, we are not ranking tools, yet the presented results probably provide
the most complete assessment of tools for the safety verification of continuous
and hybrid systems with piecewise constant dynamics up to this date.'
acknowledgement: "The authors gratefully acknowledge \fnancial support by the European
Commission project\r\nUnCoVerCPS under grant number 643921. Lei Bu is supported
by the National Natural Science\r\nFoundation of China (No.61572249)."
alternative_title:
- EPiC Series in Computing
article_processing_charge: No
author:
- first_name: Goran
full_name: Frehse, Goran
last_name: Frehse
- first_name: Alessandro
full_name: Abate, Alessandro
last_name: Abate
- first_name: Dieky
full_name: Adzkiya, Dieky
last_name: Adzkiya
- first_name: Anna
full_name: Becchi, Anna
last_name: Becchi
- first_name: Lei
full_name: Bu, Lei
last_name: Bu
- first_name: Alessandro
full_name: Cimatti, Alessandro
last_name: Cimatti
- first_name: Mirco
full_name: Giacobbe, Mirco
id: 3444EA5E-F248-11E8-B48F-1D18A9856A87
last_name: Giacobbe
orcid: 0000-0001-8180-0904
- first_name: Alberto
full_name: Griggio, Alberto
last_name: Griggio
- first_name: Sergio
full_name: Mover, Sergio
last_name: Mover
- first_name: Muhammad Syifa'ul
full_name: Mufid, Muhammad Syifa'ul
last_name: Mufid
- first_name: Idriss
full_name: Riouak, Idriss
last_name: Riouak
- first_name: Stefano
full_name: Tonetta, Stefano
last_name: Tonetta
- first_name: Enea
full_name: Zaffanella, Enea
last_name: Zaffanella
citation:
ama: 'Frehse G, Abate A, Adzkiya D, et al. ARCH-COMP19 Category Report: Hybrid systems
with piecewise constant dynamics. In: Frehse G, Althoff M, eds. ARCH19. 6th
International Workshop on Applied Verification of Continuous and Hybrid Systems.
Vol 61. EasyChair; 2019:1-13. doi:10.29007/rjwn'
apa: 'Frehse, G., Abate, A., Adzkiya, D., Becchi, A., Bu, L., Cimatti, A., … Zaffanella,
E. (2019). ARCH-COMP19 Category Report: Hybrid systems with piecewise constant
dynamics. In G. Frehse & M. Althoff (Eds.), ARCH19. 6th International Workshop
on Applied Verification of Continuous and Hybrid Systems (Vol. 61, pp. 1–13).
Montreal, Canada: EasyChair. https://doi.org/10.29007/rjwn'
chicago: 'Frehse, Goran, Alessandro Abate, Dieky Adzkiya, Anna Becchi, Lei Bu, Alessandro
Cimatti, Mirco Giacobbe, et al. “ARCH-COMP19 Category Report: Hybrid Systems with
Piecewise Constant Dynamics.” In ARCH19. 6th International Workshop on Applied
Verification of Continuous and Hybrid Systems, edited by Goran Frehse and
Matthias Althoff, 61:1–13. EasyChair, 2019. https://doi.org/10.29007/rjwn.'
ieee: 'G. Frehse et al., “ARCH-COMP19 Category Report: Hybrid systems with
piecewise constant dynamics,” in ARCH19. 6th International Workshop on Applied
Verification of Continuous and Hybrid Systems, Montreal, Canada, 2019, vol.
61, pp. 1–13.'
ista: 'Frehse G, Abate A, Adzkiya D, Becchi A, Bu L, Cimatti A, Giacobbe M, Griggio
A, Mover S, Mufid MS, Riouak I, Tonetta S, Zaffanella E. 2019. ARCH-COMP19 Category
Report: Hybrid systems with piecewise constant dynamics. ARCH19. 6th International
Workshop on Applied Verification of Continuous and Hybrid Systems. ARCH: International
Workshop on Applied Verification on Continuous and Hybrid Systems, EPiC Series
in Computing, vol. 61, 1–13.'
mla: 'Frehse, Goran, et al. “ARCH-COMP19 Category Report: Hybrid Systems with Piecewise
Constant Dynamics.” ARCH19. 6th International Workshop on Applied Verification
of Continuous and Hybrid Systems, edited by Goran Frehse and Matthias Althoff,
vol. 61, EasyChair, 2019, pp. 1–13, doi:10.29007/rjwn.'
short: G. Frehse, A. Abate, D. Adzkiya, A. Becchi, L. Bu, A. Cimatti, M. Giacobbe,
A. Griggio, S. Mover, M.S. Mufid, I. Riouak, S. Tonetta, E. Zaffanella, in:, G.
Frehse, M. Althoff (Eds.), ARCH19. 6th International Workshop on Applied Verification
of Continuous and Hybrid Systems, EasyChair, 2019, pp. 1–13.
conference:
end_date: 2019-04-15
location: Montreal, Canada
name: 'ARCH: International Workshop on Applied Verification on Continuous and Hybrid
Systems'
start_date: 2019-04-15
date_created: 2022-03-18T12:29:23Z
date_published: 2019-05-25T00:00:00Z
date_updated: 2022-05-17T07:09:47Z
day: '25'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.29007/rjwn
editor:
- first_name: Goran
full_name: Frehse, Goran
last_name: Frehse
- first_name: Matthias
full_name: Althoff, Matthias
last_name: Althoff
file:
- access_level: open_access
checksum: 4b92e333db7b4e2349501a804dfede69
content_type: application/pdf
creator: dernst
date_created: 2022-05-17T06:55:49Z
date_updated: 2022-05-17T06:55:49Z
file_id: '11391'
file_name: 2019_EPiCs_Frehse.pdf
file_size: 346415
relation: main_file
success: 1
file_date_updated: 2022-05-17T06:55:49Z
has_accepted_license: '1'
intvolume: ' 61'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 1-13
publication: ARCH19. 6th International Workshop on Applied Verification of Continuous
and Hybrid Systems
publication_identifier:
issn:
- 2398-7340
publication_status: published
publisher: EasyChair
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 61
year: '2019'
...
---
_id: '11061'
abstract:
- lang: eng
text: Many adult tissues contain postmitotic cells as old as the host organism.
The only organelle that does not turn over in these cells is the nucleus, and
its maintenance represents a formidable challenge, as it harbors regulatory proteins
that persist throughout adulthood. Here we developed strategies to visualize two
classes of such long-lived proteins, histones and nucleoporins, to understand
the function of protein longevity in nuclear maintenance. Genome-wide mapping
of histones revealed specific enrichment of long-lived variants at silent gene
loci. Interestingly, nuclear pores are maintained by piecemeal replacement of
subunits, resulting in mosaic complexes composed of polypeptides with vastly different
ages. In contrast, nondividing quiescent cells remove old nuclear pores in an
ESCRT-dependent manner. Our findings reveal distinct molecular strategies of nuclear
maintenance, linking lifelong protein persistence to gene regulation and nuclear
integrity.
article_processing_charge: No
article_type: original
author:
- first_name: Brandon H.
full_name: Toyama, Brandon H.
last_name: Toyama
- first_name: Rafael
full_name: Arrojo e Drigo, Rafael
last_name: Arrojo e Drigo
- first_name: Varda
full_name: Lev-Ram, Varda
last_name: Lev-Ram
- first_name: Ranjan
full_name: Ramachandra, Ranjan
last_name: Ramachandra
- first_name: Thomas J.
full_name: Deerinck, Thomas J.
last_name: Deerinck
- first_name: Claude
full_name: Lechene, Claude
last_name: Lechene
- first_name: Mark H.
full_name: Ellisman, Mark H.
last_name: Ellisman
- first_name: Martin W
full_name: HETZER, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: HETZER
orcid: 0000-0002-2111-992X
citation:
ama: Toyama BH, Arrojo e Drigo R, Lev-Ram V, et al. Visualization of long-lived
proteins reveals age mosaicism within nuclei of postmitotic cells. Journal
of Cell Biology. 2019;218(2):433-444. doi:10.1083/jcb.201809123
apa: Toyama, B. H., Arrojo e Drigo, R., Lev-Ram, V., Ramachandra, R., Deerinck,
T. J., Lechene, C., … Hetzer, M. (2019). Visualization of long-lived proteins
reveals age mosaicism within nuclei of postmitotic cells. Journal of Cell Biology.
Rockefeller University Press. https://doi.org/10.1083/jcb.201809123
chicago: Toyama, Brandon H., Rafael Arrojo e Drigo, Varda Lev-Ram, Ranjan Ramachandra,
Thomas J. Deerinck, Claude Lechene, Mark H. Ellisman, and Martin Hetzer. “Visualization
of Long-Lived Proteins Reveals Age Mosaicism within Nuclei of Postmitotic Cells.”
Journal of Cell Biology. Rockefeller University Press, 2019. https://doi.org/10.1083/jcb.201809123.
ieee: B. H. Toyama et al., “Visualization of long-lived proteins reveals
age mosaicism within nuclei of postmitotic cells,” Journal of Cell Biology,
vol. 218, no. 2. Rockefeller University Press, pp. 433–444, 2019.
ista: Toyama BH, Arrojo e Drigo R, Lev-Ram V, Ramachandra R, Deerinck TJ, Lechene
C, Ellisman MH, Hetzer M. 2019. Visualization of long-lived proteins reveals age
mosaicism within nuclei of postmitotic cells. Journal of Cell Biology. 218(2),
433–444.
mla: Toyama, Brandon H., et al. “Visualization of Long-Lived Proteins Reveals Age
Mosaicism within Nuclei of Postmitotic Cells.” Journal of Cell Biology,
vol. 218, no. 2, Rockefeller University Press, 2019, pp. 433–44, doi:10.1083/jcb.201809123.
short: B.H. Toyama, R. Arrojo e Drigo, V. Lev-Ram, R. Ramachandra, T.J. Deerinck,
C. Lechene, M.H. Ellisman, M. Hetzer, Journal of Cell Biology 218 (2019) 433–444.
date_created: 2022-04-07T07:45:11Z
date_published: 2019-02-04T00:00:00Z
date_updated: 2022-07-18T08:31:52Z
day: '04'
ddc:
- '570'
doi: 10.1083/jcb.201809123
extern: '1'
external_id:
pmid:
- '30552100'
file:
- access_level: open_access
checksum: 7964ebbf833b0b35f9fba840eea9531d
content_type: application/pdf
creator: dernst
date_created: 2022-04-08T08:26:32Z
date_updated: 2022-04-08T08:26:32Z
file_id: '11139'
file_name: 2019_JCB_Toyama.pdf
file_size: 2503838
relation: main_file
success: 1
file_date_updated: 2022-04-08T08:26:32Z
has_accepted_license: '1'
intvolume: ' 218'
issue: '2'
keyword:
- Cell Biology
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-sa/4.0/
month: '02'
oa: 1
oa_version: Published Version
page: 433-444
pmid: 1
publication: Journal of Cell Biology
publication_identifier:
eissn:
- 1540-8140
issn:
- 0021-9525
publication_status: published
publisher: Rockefeller University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Visualization of long-lived proteins reveals age mosaicism within nuclei of
postmitotic cells
tmp:
image: /images/cc_by_nc_sa.png
legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
BY-NC-SA 4.0)
short: CC BY-NC-SA (4.0)
type: journal_article
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 218
year: '2019'
...
---
_id: '11062'
abstract:
- lang: eng
text: Most neurons are not replaced during an animal’s lifetime. This nondividing
state is characterized by extreme longevity and age-dependent decline of key regulatory
proteins. To study the lifespans of cells and proteins in adult tissues, we combined
isotope labeling of mice with a hybrid imaging method (MIMS-EM). Using 15N mapping,
we show that liver and pancreas are composed of cells with vastly different ages,
many as old as the animal. Strikingly, we also found that a subset of fibroblasts
and endothelial cells, both known for their replicative potential, are characterized
by the absence of cell division during adulthood. In addition, we show that the
primary cilia of beta cells and neurons contains different structural regions
with vastly different lifespans. Based on these results, we propose that age mosaicism
across multiple scales is a fundamental principle of adult tissue, cell, and protein
complex organization.
article_processing_charge: No
article_type: original
author:
- first_name: Rafael
full_name: Arrojo e Drigo, Rafael
last_name: Arrojo e Drigo
- first_name: Varda
full_name: Lev-Ram, Varda
last_name: Lev-Ram
- first_name: Swati
full_name: Tyagi, Swati
last_name: Tyagi
- first_name: Ranjan
full_name: Ramachandra, Ranjan
last_name: Ramachandra
- first_name: Thomas
full_name: Deerinck, Thomas
last_name: Deerinck
- first_name: Eric
full_name: Bushong, Eric
last_name: Bushong
- first_name: Sebastien
full_name: Phan, Sebastien
last_name: Phan
- first_name: Victoria
full_name: Orphan, Victoria
last_name: Orphan
- first_name: Claude
full_name: Lechene, Claude
last_name: Lechene
- first_name: Mark H.
full_name: Ellisman, Mark H.
last_name: Ellisman
- first_name: Martin W
full_name: HETZER, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: HETZER
orcid: 0000-0002-2111-992X
citation:
ama: Arrojo e Drigo R, Lev-Ram V, Tyagi S, et al. Age mosaicism across multiple
scales in adult tissues. Cell Metabolism. 2019;30(2):343-351.e3. doi:10.1016/j.cmet.2019.05.010
apa: Arrojo e Drigo, R., Lev-Ram, V., Tyagi, S., Ramachandra, R., Deerinck, T.,
Bushong, E., … Hetzer, M. (2019). Age mosaicism across multiple scales in adult
tissues. Cell Metabolism. Elsevier. https://doi.org/10.1016/j.cmet.2019.05.010
chicago: Arrojo e Drigo, Rafael, Varda Lev-Ram, Swati Tyagi, Ranjan Ramachandra,
Thomas Deerinck, Eric Bushong, Sebastien Phan, et al. “Age Mosaicism across Multiple
Scales in Adult Tissues.” Cell Metabolism. Elsevier, 2019. https://doi.org/10.1016/j.cmet.2019.05.010.
ieee: R. Arrojo e Drigo et al., “Age mosaicism across multiple scales in
adult tissues,” Cell Metabolism, vol. 30, no. 2. Elsevier, p. 343–351.e3,
2019.
ista: Arrojo e Drigo R, Lev-Ram V, Tyagi S, Ramachandra R, Deerinck T, Bushong E,
Phan S, Orphan V, Lechene C, Ellisman MH, Hetzer M. 2019. Age mosaicism across
multiple scales in adult tissues. Cell Metabolism. 30(2), 343–351.e3.
mla: Arrojo e Drigo, Rafael, et al. “Age Mosaicism across Multiple Scales in Adult
Tissues.” Cell Metabolism, vol. 30, no. 2, Elsevier, 2019, p. 343–351.e3,
doi:10.1016/j.cmet.2019.05.010.
short: R. Arrojo e Drigo, V. Lev-Ram, S. Tyagi, R. Ramachandra, T. Deerinck, E.
Bushong, S. Phan, V. Orphan, C. Lechene, M.H. Ellisman, M. Hetzer, Cell Metabolism
30 (2019) 343–351.e3.
date_created: 2022-04-07T07:45:21Z
date_published: 2019-08-06T00:00:00Z
date_updated: 2022-07-18T08:32:30Z
day: '06'
doi: 10.1016/j.cmet.2019.05.010
extern: '1'
external_id:
pmid:
- '31178361'
intvolume: ' 30'
issue: '2'
keyword:
- Cell Biology
- Molecular Biology
- Physiology
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.cmet.2019.05.010
month: '08'
oa: 1
oa_version: Published Version
page: 343-351.e3
pmid: 1
publication: Cell Metabolism
publication_identifier:
issn:
- 1550-4131
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Age mosaicism across multiple scales in adult tissues
type: journal_article
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 30
year: '2019'
...
---
_id: '11059'
abstract:
- lang: eng
text: The genome is packaged and organized nonrandomly within the 3D space of the
nucleus to promote efficient gene expression and to faithfully maintain silencing
of heterochromatin. The genome is enclosed within the nucleus by the nuclear envelope
membrane, which contains a set of proteins that actively participate in chromatin
organization and gene regulation. Technological advances are providing views of
genome organization at unprecedented resolution and are beginning to reveal the
ways that cells co-opt the structures of the nuclear periphery for nuclear organization
and gene regulation. These genome regulatory roles of proteins of the nuclear
periphery have important influences on development, disease and ageing.
article_processing_charge: No
article_type: review
author:
- first_name: Abigail
full_name: Buchwalter, Abigail
last_name: Buchwalter
- first_name: Jeanae M.
full_name: Kaneshiro, Jeanae M.
last_name: Kaneshiro
- first_name: Martin W
full_name: HETZER, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: HETZER
orcid: 0000-0002-2111-992X
citation:
ama: 'Buchwalter A, Kaneshiro JM, Hetzer M. Coaching from the sidelines: The nuclear
periphery in genome regulation. Nature Reviews Genetics. 2019;20(1):39-50.
doi:10.1038/s41576-018-0063-5'
apa: 'Buchwalter, A., Kaneshiro, J. M., & Hetzer, M. (2019). Coaching from the
sidelines: The nuclear periphery in genome regulation. Nature Reviews Genetics.
Springer Nature. https://doi.org/10.1038/s41576-018-0063-5'
chicago: 'Buchwalter, Abigail, Jeanae M. Kaneshiro, and Martin Hetzer. “Coaching
from the Sidelines: The Nuclear Periphery in Genome Regulation.” Nature Reviews
Genetics. Springer Nature, 2019. https://doi.org/10.1038/s41576-018-0063-5.'
ieee: 'A. Buchwalter, J. M. Kaneshiro, and M. Hetzer, “Coaching from the sidelines:
The nuclear periphery in genome regulation,” Nature Reviews Genetics, vol.
20, no. 1. Springer Nature, pp. 39–50, 2019.'
ista: 'Buchwalter A, Kaneshiro JM, Hetzer M. 2019. Coaching from the sidelines:
The nuclear periphery in genome regulation. Nature Reviews Genetics. 20(1), 39–50.'
mla: 'Buchwalter, Abigail, et al. “Coaching from the Sidelines: The Nuclear Periphery
in Genome Regulation.” Nature Reviews Genetics, vol. 20, no. 1, Springer
Nature, 2019, pp. 39–50, doi:10.1038/s41576-018-0063-5.'
short: A. Buchwalter, J.M. Kaneshiro, M. Hetzer, Nature Reviews Genetics 20 (2019)
39–50.
date_created: 2022-04-07T07:44:45Z
date_published: 2019-01-01T00:00:00Z
date_updated: 2022-07-18T08:31:42Z
day: '01'
doi: 10.1038/s41576-018-0063-5
extern: '1'
external_id:
pmid:
- '30356165'
intvolume: ' 20'
issue: '1'
keyword:
- Genetics (clinical)
- Genetics
- Molecular Biology
language:
- iso: eng
month: '01'
oa_version: None
page: 39-50
pmid: 1
publication: Nature Reviews Genetics
publication_identifier:
eissn:
- 1471-0064
issn:
- 1471-0056
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Coaching from the sidelines: The nuclear periphery in genome regulation'
type: journal_article
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 20
year: '2019'
...
---
_id: '11499'
abstract:
- lang: eng
text: Deep optical spectroscopic surveys of galaxies provide a unique opportunity
to investigate rest-frame ultra-violet (UV) emission line properties of galaxies
at z ∼ 2 − 4.5. Here we combine VLT/MUSE Guaranteed Time Observations of the Hubble
Deep Field South, Ultra Deep Field, COSMOS, and several quasar fields with other
publicly available data from VLT/VIMOS and VLT/FORS2 to construct a catalogue
of He II λ1640 emitters at z ≳ 2. The deepest areas of our MUSE pointings reach
a 3σ line flux limit of 3.1 × 10−19 erg s−1 cm−2. After discarding broad-line
active galactic nuclei, we find 13 He II λ1640 detections from MUSE with a median
MUV = −20.1 and 21 tentative He II λ1640 detections from other public surveys.
Excluding Lyα, all except two galaxies in our sample show at least one other rest-UV
emission line, with C III] λ1907, λ1909 being the most prominent. We use multi-wavelength
data available in the Hubble legacy fields to derive basic galaxy properties of
our sample through spectral energy distribution fitting techniques. Taking advantage
of the high-quality spectra obtained by MUSE (∼10 − 30 h of exposure time per
pointing), we use photo-ionisation models to study the rest-UV emission line diagnostics
of the He II λ1640 emitters. Line ratios of our sample can be reproduced by moderately
sub-solar photo-ionisation models, however, we find that including effects of
binary stars lead to degeneracies in most free parameters. Even after considering
extra ionising photons produced by extreme sub-solar metallicity binary stellar
models, photo-ionisation models are unable to reproduce rest-frame He II λ1640
equivalent widths (∼0.2 − 10 Å), thus additional mechanisms are necessary in models
to match the observed He II λ1640 properties.
acknowledgement: 'The authors wish to thank the referee for constructive comments
that improved the paper substantially. We thank the BPASS team for making the stellar
population models available. We thank Elizabeth Stanway, Claus Leitherer, Daniel
Schaerer, Jorick Vink, and Nell Byler for insightful discussions. We thank the Lorentz
Centre and the scientific organizers of the Characterizing galaxies with spectroscopy
with a view for JWST workshop held at the Lorentz Centre in 2017 October, which
promoted useful discussions in the wider community. TN, JB, and RB acknowledges
the Nederlandse Organisatie voor Wetenschappelijk Onderzoek (NWO) top grant TOP1.16.057.
AF acknowledges support from the ERC via an Advanced Grant under grant agreement
no. 339659-MUSICOS. JB 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).
JR acknowledges support from the ERC Starting grant 336736 (CALENDS). This research
made use of astropy (http://www.astropy.org) a community-developed core Python package
for Astronomy (Astropy Collaboration 2013, 2018) and pandas (McKinney 2010). Figures
were generated using matplotlib (Hunter 2007) and seaborn (https://seaborn.pydata.org).
Facilities: VLT (MUSE).'
article_number: A89
article_processing_charge: No
article_type: original
author:
- first_name: Themiya
full_name: Nanayakkara, Themiya
last_name: Nanayakkara
- first_name: Jarle
full_name: Brinchmann, Jarle
last_name: Brinchmann
- first_name: Leindert
full_name: Boogaard, Leindert
last_name: Boogaard
- first_name: Rychard
full_name: Bouwens, Rychard
last_name: Bouwens
- first_name: Sebastiano
full_name: Cantalupo, Sebastiano
last_name: Cantalupo
- first_name: Anna
full_name: Feltre, Anna
last_name: Feltre
- first_name: Wolfram
full_name: Kollatschny, Wolfram
last_name: Kollatschny
- first_name: Raffaella Anna
full_name: Marino, Raffaella Anna
last_name: Marino
- first_name: Michael
full_name: Maseda, Michael
last_name: Maseda
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
- first_name: Mieke
full_name: Paalvast, Mieke
last_name: Paalvast
- first_name: Johan
full_name: Richard, Johan
last_name: Richard
- first_name: Anne
full_name: Verhamme, Anne
last_name: Verhamme
citation:
ama: Nanayakkara T, Brinchmann J, Boogaard L, et al. Exploring He II λ1640 emission
line properties at z ∼2−4. Astronomy & Astrophysics. 2019;648. doi:10.1051/0004-6361/201834565
apa: Nanayakkara, T., Brinchmann, J., Boogaard, L., Bouwens, R., Cantalupo, S.,
Feltre, A., … Verhamme, A. (2019). Exploring He II λ1640 emission line properties
at z ∼2−4. Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/201834565
chicago: Nanayakkara, Themiya, Jarle Brinchmann, Leindert Boogaard, Rychard Bouwens,
Sebastiano Cantalupo, Anna Feltre, Wolfram Kollatschny, et al. “Exploring He II Λ1640
Emission Line Properties at z ∼2−4.” Astronomy & Astrophysics. EDP
Sciences, 2019. https://doi.org/10.1051/0004-6361/201834565.
ieee: T. Nanayakkara et al., “Exploring He II λ1640 emission line properties
at z ∼2−4,” Astronomy & Astrophysics, vol. 648. EDP Sciences, 2019.
ista: Nanayakkara T, Brinchmann J, Boogaard L, Bouwens R, Cantalupo S, Feltre A,
Kollatschny W, Marino RA, Maseda M, Matthee JJ, Paalvast M, Richard J, Verhamme
A. 2019. Exploring He II λ1640 emission line properties at z ∼2−4. Astronomy &
Astrophysics. 648, A89.
mla: Nanayakkara, Themiya, et al. “Exploring He II Λ1640 Emission Line Properties
at z ∼2−4.” Astronomy & Astrophysics, vol. 648, A89, EDP Sciences,
2019, doi:10.1051/0004-6361/201834565.
short: T. Nanayakkara, J. Brinchmann, L. Boogaard, R. Bouwens, S. Cantalupo, A.
Feltre, W. Kollatschny, R.A. Marino, M. Maseda, J.J. Matthee, M. Paalvast, J.
Richard, A. Verhamme, Astronomy & Astrophysics 648 (2019).
date_created: 2022-07-06T09:07:06Z
date_published: 2019-04-16T00:00:00Z
date_updated: 2022-07-19T09:36:08Z
day: '16'
doi: 10.1051/0004-6361/201834565
extern: '1'
external_id:
arxiv:
- '1902.05960'
intvolume: ' 648'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- 'galaxies: ISM / galaxies: star formation / galaxies: evolution / galaxies: high-redshift'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1902.05960
month: '04'
oa: 1
oa_version: Published Version
publication: Astronomy & Astrophysics
publication_identifier:
eissn:
- 1432-0746
issn:
- 0004-6361
publication_status: published
publisher: EDP Sciences
quality_controlled: '1'
related_material:
link:
- relation: erratum
url: https://doi.org/10.1051/0004-6361/201834565e
scopus_import: '1'
status: public
title: Exploring He II λ1640 emission line properties at z ∼2−4
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 648
year: '2019'
...
---
_id: '11505'
abstract:
- lang: eng
text: "Contact. This paper presents the results obtained with the Multi-Unit Spectroscopic
Explorer (MUSE) at the ESO Very Large Telescope on the faint end of the Lyman-alpha
luminosity function (LF) based on deep observations of four lensing clusters.
The goal of our project is to set strong constraints on the relative contribution
of the Lyman-alpha emitter (LAE) population to cosmic reionization.\r\n\r\nAims.
The precise aim of the present study is to further constrain the abundance of
LAEs by taking advantage of the magnification provided by lensing clusters to
build a blindly selected sample of galaxies which is less biased than current
blank field samples in redshift and luminosity. By construction, this sample of
LAEs is complementary to those built from deep blank fields, whether observed
by MUSE or by other facilities, and makes it possible to determine the shape of
the LF at fainter levels, as well as its evolution with redshift.\r\n\r\nMethods.
We selected a sample of 156 LAEs with redshifts between 2.9 ≤ z ≤ 6.7 and magnification-corrected
luminosities in the range 39 ≲ log LLyα [erg s−1] ≲43. To properly take into account
the individual differences in detection conditions between the LAEs when computing
the LF, including lensing configurations, and spatial and spectral morphologies,
the non-parametric 1/Vmax method was adopted. The price to pay to benefit from
magnification is a reduction of the effective volume of the survey, together with
a more complex analysis procedure to properly determine the effective volume Vmax
for each galaxy. In this paper we present a complete procedure for the determination
of the LF based on IFU detections in lensing clusters. This procedure, including
some new methods for masking, effective volume integration and (individual) completeness
determinations, has been fully automated when possible, and it can be easily generalized
to the analysis of IFU observations in blank fields.\r\n\r\nResults. As a result
of this analysis, the Lyman-alpha LF has been obtained in four different redshift
bins: 2.9 < z < 6, 7, 2.9 < z < 4.0, 4.0 < z < 5.0, and 5.0 < z < 6.7
with constraints down to log LLyα = 40.5. From our data only, no significant evolution
of LF mean slope can be found. When performing a Schechter analysis also including
data from the literature to complete the present sample towards the brightest
luminosities, a steep faint end slope was measured varying from α = −1.69−0.08+0.08
to α = −1.87−0.12+0.12 between the lowest and the highest redshift bins.\r\n\r\nConclusions.
The contribution of the LAE population to the star formation rate density at z ∼ 6
is ≲50% depending on the luminosity limit considered, which is of the same order
as the Lyman-break galaxy (LBG) contribution. The evolution of the LAE contribution
with redshift depends on the assumed escape fraction of Lyman-alpha photons, and
appears to slightly increase with increasing redshift when this fraction is conservatively
set to one. Depending on the intersection between the LAE/LBG populations, the
contribution of the observed galaxies to the ionizing flux may suffice to keep
the universe ionized at z ∼ 6."
acknowledgement: We thank the anonymous referee for their critical review and useful
suggestions. This work has been carried out thanks to the support of the OCEVU Labex
(ANR-11-LABX-0060) and the A*MIDEX project (ANR-11-IDEX-0001-02) funded by the “Investissements
d’Avenir” French government programme managed by the ANR. Partially funded by the
ERC starting grant CALENDS (JR, VP, BC, JM), the Agence Nationale de la recherche
bearing the reference ANR-13-BS05-0010-02 (FOGHAR), and the “Programme National
de Cosmologie and Galaxies” (PNCG) of CNRS/INSU, France. GdV, RP, JR, GM, JM, BC,
and VP also acknowledge support by the Programa de Cooperacion Cientifica – ECOS
SUD Program C16U02. NL acknowledges funding from the European Research Council (ERC)
under the European Union’s Horizon 2020 research and innovation programme (grant
agreement No 669253), ABD acknowledges support from the ERC advanced grant “Cosmic
Gas”. LW acknowledges support by the Competitive Fund of the Leibniz Association
through grant SAW-2015-AIP-2, and TG acknowledges support from the European Research
Council under grant agreement ERC-stg-757258 (TRIPLE).. Based on observations made
with ESO Telescopes at the La Silla Paranal Observatory under programme IDs 060.A-9345,
094.A-0115, 095.A-0181, 096.A-0710, 097.A0269, 100.A-0249, and 294.A-5032. Also
based on observations obtained with the NASA/ESA Hubble Space Telescope, retrieved
from the Mikulski Archive for Space Telescopes (MAST) at the Space Telescope Science
Institute (STScI). STScI is operated by the Association of Universities for Research
in Astronomy, Inc. under NASA contract NAS 5-26555. This research made use of Astropy,
a community-developed core Python package for Astronomy (Astropy Collaboration 2013).
All plots in this paper were created using Matplotlib (Hunter 2007).
article_number: A3
article_processing_charge: No
article_type: original
author:
- first_name: G.
full_name: de La Vieuville, G.
last_name: de La Vieuville
- first_name: D.
full_name: Bina, D.
last_name: Bina
- first_name: R.
full_name: Pello, R.
last_name: Pello
- first_name: G.
full_name: Mahler, G.
last_name: Mahler
- first_name: J.
full_name: Richard, J.
last_name: Richard
- first_name: A. B.
full_name: Drake, A. B.
last_name: Drake
- first_name: E. C.
full_name: Herenz, E. C.
last_name: Herenz
- first_name: F. E.
full_name: Bauer, F. E.
last_name: Bauer
- first_name: B.
full_name: Clément, B.
last_name: Clément
- first_name: D.
full_name: Lagattuta, D.
last_name: Lagattuta
- first_name: N.
full_name: Laporte, N.
last_name: Laporte
- first_name: J.
full_name: Martinez, J.
last_name: Martinez
- first_name: V.
full_name: Patrício, V.
last_name: Patrício
- first_name: L.
full_name: Wisotzki, L.
last_name: Wisotzki
- first_name: J.
full_name: Zabl, J.
last_name: Zabl
- first_name: R. J.
full_name: Bouwens, R. J.
last_name: Bouwens
- first_name: T.
full_name: Contini, T.
last_name: Contini
- first_name: T.
full_name: Garel, T.
last_name: Garel
- first_name: B.
full_name: Guiderdoni, B.
last_name: Guiderdoni
- first_name: R. A.
full_name: Marino, R. A.
last_name: Marino
- first_name: M. V.
full_name: Maseda, M. V.
last_name: Maseda
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
- first_name: J.
full_name: Schaye, J.
last_name: Schaye
- first_name: G.
full_name: Soucail, G.
last_name: Soucail
citation:
ama: de La Vieuville G, Bina D, Pello R, et al. Faint end of the z ∼ 3–7 luminosity
function of Lyman-alpha emitters behind lensing clusters observed with MUSE. Astronomy
& Astrophysics. 2019;628. doi:10.1051/0004-6361/201834471
apa: de La Vieuville, G., Bina, D., Pello, R., Mahler, G., Richard, J., Drake, A.
B., … Soucail, G. (2019). Faint end of the z ∼ 3–7 luminosity function of Lyman-alpha
emitters behind lensing clusters observed with MUSE. Astronomy & Astrophysics.
EDP Sciences. https://doi.org/10.1051/0004-6361/201834471
chicago: La Vieuville, G. de, D. Bina, R. Pello, G. Mahler, J. Richard, A. B. Drake,
E. C. Herenz, et al. “Faint End of the z ∼ 3–7 Luminosity Function of Lyman-Alpha
Emitters behind Lensing Clusters Observed with MUSE.” Astronomy & Astrophysics.
EDP Sciences, 2019. https://doi.org/10.1051/0004-6361/201834471.
ieee: G. de La Vieuville et al., “Faint end of the z ∼ 3–7 luminosity function
of Lyman-alpha emitters behind lensing clusters observed with MUSE,” Astronomy
& Astrophysics, vol. 628. EDP Sciences, 2019.
ista: de La Vieuville G, Bina D, Pello R, Mahler G, Richard J, Drake AB, Herenz
EC, Bauer FE, Clément B, Lagattuta D, Laporte N, Martinez J, Patrício V, Wisotzki
L, Zabl J, Bouwens RJ, Contini T, Garel T, Guiderdoni B, Marino RA, Maseda MV,
Matthee JJ, Schaye J, Soucail G. 2019. Faint end of the z ∼ 3–7 luminosity function
of Lyman-alpha emitters behind lensing clusters observed with MUSE. Astronomy
& Astrophysics. 628, A3.
mla: de La Vieuville, G., et al. “Faint End of the z ∼ 3–7 Luminosity Function of
Lyman-Alpha Emitters behind Lensing Clusters Observed with MUSE.” Astronomy
& Astrophysics, vol. 628, A3, EDP Sciences, 2019, doi:10.1051/0004-6361/201834471.
short: G. de La Vieuville, D. Bina, R. Pello, G. Mahler, J. Richard, A.B. Drake,
E.C. Herenz, F.E. Bauer, B. Clément, D. Lagattuta, N. Laporte, J. Martinez, V.
Patrício, L. Wisotzki, J. Zabl, R.J. Bouwens, T. Contini, T. Garel, B. Guiderdoni,
R.A. Marino, M.V. Maseda, J.J. Matthee, J. Schaye, G. Soucail, Astronomy &
Astrophysics 628 (2019).
date_created: 2022-07-06T10:09:36Z
date_published: 2019-07-25T00:00:00Z
date_updated: 2022-07-19T09:36:31Z
day: '25'
doi: 10.1051/0004-6361/201834471
extern: '1'
external_id:
arxiv:
- '1905.13696'
intvolume: ' 628'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- 'gravitational lensing: strong / galaxies: high-redshift / dark ages'
- reionization
- 'first stars / galaxies: clusters: general / galaxies: luminosity function'
- mass function
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1905.13696
month: '07'
oa: 1
oa_version: Published Version
publication: Astronomy & Astrophysics
publication_identifier:
eissn:
- 1432-0746
issn:
- 0004-6361
publication_status: published
publisher: EDP Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: Faint end of the z ∼ 3–7 luminosity function of Lyman-alpha emitters behind
lensing clusters observed with MUSE
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 628
year: '2019'
...
---
_id: '11507'
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.'
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.
article_number: A157
article_processing_charge: No
article_type: original
author:
- first_name: David
full_name: Sobral, David
last_name: Sobral
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
citation:
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'
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'
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.'
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.'
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.'
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.'
short: D. Sobral, J.J. Matthee, Astronomy & Astrophysics 623 (2019).
date_created: 2022-07-06T11:08:16Z
date_published: 2019-03-26T00:00:00Z
date_updated: 2022-07-19T09:37:20Z
day: '26'
doi: 10.1051/0004-6361/201833075
extern: '1'
external_id:
arxiv:
- '1803.08923'
intvolume: ' 623'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- 'galaxies: high-redshift / galaxies: star formation / galaxies: statistics / galaxies:
evolution / galaxies: formation / galaxies: ISM'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1803.08923
month: '03'
oa: 1
oa_version: Published Version
publication: Astronomy & Astrophysics
publication_identifier:
eissn:
- 1432-0746
issn:
- 0004-6361
publication_status: published
publisher: EDP Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Predicting Lyα escape fractions with a simple observable: Lyα in emission
as an empirically calibrated star formation rate indicator'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 623
year: '2019'
...
---
_id: '11514'
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.
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."
article_number: '140'
article_processing_charge: No
article_type: original
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
full_name: González-López, Jorge
last_name: González-López
- first_name: Paul
full_name: van der Werf, Paul
last_name: van der Werf
- first_name: Fabian
full_name: Walter, Fabian
last_name: Walter
- first_name: Rychard
full_name: Bouwens, Rychard
last_name: Bouwens
- first_name: Manuel
full_name: Aravena, Manuel
last_name: Aravena
- first_name: Chris
full_name: Carilli, Chris
last_name: Carilli
- first_name: Franz Erik
full_name: Bauer, Franz Erik
last_name: Bauer
- first_name: Jarle
full_name: Brinchmann, Jarle
last_name: Brinchmann
- first_name: Thierry
full_name: Contini, Thierry
last_name: Contini
- first_name: Pierre
full_name: Cox, Pierre
last_name: Cox
- first_name: Elisabete
full_name: da Cunha, Elisabete
last_name: da Cunha
- first_name: Emanuele
full_name: Daddi, Emanuele
last_name: Daddi
- first_name: Tanio
full_name: Díaz-Santos, Tanio
last_name: Díaz-Santos
- first_name: Jacqueline
full_name: Hodge, Jacqueline
last_name: Hodge
- first_name: Hanae
full_name: Inami, Hanae
last_name: Inami
- first_name: Rob
full_name: Ivison, Rob
last_name: Ivison
- first_name: Michael
full_name: Maseda, Michael
last_name: Maseda
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
- first_name: Pascal
full_name: Oesch, Pascal
last_name: Oesch
- first_name: Gergö
full_name: Popping, Gergö
last_name: Popping
- first_name: Dominik
full_name: Riechers, Dominik
last_name: Riechers
- first_name: Joop
full_name: Schaye, Joop
last_name: Schaye
- first_name: Sander
full_name: Schouws, Sander
last_name: Schouws
- first_name: Ian
full_name: Smail, Ian
last_name: Smail
- first_name: Axel
full_name: Weiss, Axel
last_name: Weiss
- first_name: Lutz
full_name: Wisotzki, Lutz
last_name: Wisotzki
- first_name: Roland
full_name: Bacon, Roland
last_name: Bacon
- first_name: Paulo C.
full_name: Cortes, Paulo C.
last_name: Cortes
- first_name: Hans-Walter
full_name: Rix, Hans-Walter
last_name: Rix
- first_name: Rachel S.
full_name: Somerville, Rachel S.
last_name: Somerville
- first_name: Mark
full_name: Swinbank, Mark
last_name: Swinbank
- first_name: Jeff
full_name: Wagg, Jeff
last_name: Wagg
citation:
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'
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.'
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.'
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.'
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.'
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).
date_created: 2022-07-06T13:31:35Z
date_published: 2019-09-11T00:00:00Z
date_updated: 2022-07-19T09:50:55Z
day: '11'
doi: 10.3847/1538-4357/ab3102
extern: '1'
external_id:
arxiv:
- '1903.09167'
intvolume: ' 882'
issue: '2'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1903.09167
month: '09'
oa: 1
oa_version: Preprint
publication: The Astrophysical Journal
publication_identifier:
eissn:
- 1538-4357
issn:
- 0004-637X
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The ALMA spectroscopic survey in the HUDF: Nature and physical properties
of gas-mass selected galaxies using MUSE spectroscopy'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 882
year: '2019'
...
---
_id: '11516'
abstract:
- lang: eng
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.
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.
article_number: '47'
article_processing_charge: No
article_type: original
author:
- first_name: Raffaella Anna
full_name: Marino, Raffaella Anna
last_name: Marino
- first_name: Sebastiano
full_name: Cantalupo, Sebastiano
last_name: Cantalupo
- first_name: Gabriele
full_name: Pezzulli, Gabriele
last_name: Pezzulli
- first_name: Simon J.
full_name: Lilly, Simon J.
last_name: Lilly
- first_name: Sofia
full_name: Gallego, Sofia
last_name: Gallego
- first_name: Ruari
full_name: Mackenzie, Ruari
last_name: Mackenzie
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
- first_name: Jarle
full_name: Brinchmann, Jarle
last_name: Brinchmann
- first_name: Nicolas
full_name: Bouché, Nicolas
last_name: Bouché
- first_name: Anna
full_name: Feltre, Anna
last_name: Feltre
- first_name: Sowgat
full_name: Muzahid, Sowgat
last_name: Muzahid
- first_name: Ilane
full_name: Schroetter, Ilane
last_name: Schroetter
- first_name: Sean D.
full_name: Johnson, Sean D.
last_name: Johnson
- first_name: Themiya
full_name: Nanayakkara, Themiya
last_name: Nanayakkara
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
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.
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.
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.
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.
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).
date_created: 2022-07-06T13:50:33Z
date_published: 2019-07-24T00:00:00Z
date_updated: 2022-08-18T10:20:18Z
day: '24'
doi: 10.3847/1538-4357/ab2881
extern: '1'
external_id:
arxiv:
- '1906.06347'
intvolume: ' 880'
issue: '1'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1906.06347
month: '07'
oa: 1
oa_version: Preprint
publication: The Astrophysical Journal
publication_identifier:
eissn:
- 1538-4357
issn:
- 0004-637X
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: A giant Lyα nebula and a small-scale clumpy outflow in the system of the exotic
quasar J0952+0114 unveiled by MUSE
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 880
year: '2019'
...
---
_id: '11515'
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.
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.'
article_number: '124'
article_processing_charge: No
article_type: original
author:
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
- first_name: D.
full_name: Sobral, D.
last_name: Sobral
- first_name: L. A.
full_name: Boogaard, L. A.
last_name: Boogaard
- first_name: H.
full_name: Röttgering, H.
last_name: Röttgering
- first_name: L.
full_name: Vallini, L.
last_name: Vallini
- first_name: A.
full_name: Ferrara, A.
last_name: Ferrara
- first_name: A.
full_name: Paulino-Afonso, A.
last_name: Paulino-Afonso
- first_name: F.
full_name: Boone, F.
last_name: Boone
- first_name: D.
full_name: Schaerer, D.
last_name: Schaerer
- first_name: B.
full_name: Mobasher, B.
last_name: Mobasher
citation:
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
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
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.
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.
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).
date_created: 2022-07-06T13:38:15Z
date_published: 2019-08-21T00:00:00Z
date_updated: 2022-08-18T10:19:48Z
day: '21'
doi: 10.3847/1538-4357/ab2f81
extern: '1'
external_id:
arxiv:
- '1903.08171'
intvolume: ' 881'
issue: '2'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1903.08171
month: '08'
oa: 1
oa_version: Preprint
publication: The Astrophysical Journal
publication_identifier:
eissn:
- 1538-4357
issn:
- 0004-637X
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Resolved UV and [C ii] structures of luminous galaxies within the epoch of
reionization
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 881
year: '2019'
...
---
_id: '11517'
abstract:
- lang: eng
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.
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"
article_number: '132'
article_processing_charge: No
article_type: original
author:
- first_name: Enci
full_name: Wang, Enci
last_name: Wang
- first_name: Simon J.
full_name: Lilly, Simon J.
last_name: Lilly
- first_name: Gabriele
full_name: Pezzulli, Gabriele
last_name: Pezzulli
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
citation:
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
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.
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.
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.
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.
short: E. Wang, S.J. Lilly, G. Pezzulli, J.J. Matthee, The Astrophysical Journal
877 (2019).
date_created: 2022-07-07T08:38:24Z
date_published: 2019-06-04T00:00:00Z
date_updated: 2022-08-18T10:19:08Z
day: '04'
doi: 10.3847/1538-4357/ab1c5b
extern: '1'
external_id:
arxiv:
- '1901.10276'
intvolume: ' 877'
issue: '2'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1901.10276
month: '06'
oa: 1
oa_version: Preprint
publication: The Astrophysical Journal
publication_identifier:
eissn:
- 1538-4357
issn:
- 0004-637X
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the elevation and suppression of star formation within galaxies
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 877
year: '2019'
...
---
_id: '11535'
abstract:
- lang: eng
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.
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).
article_processing_charge: No
article_type: original
author:
- first_name: A A
full_name: Khostovan, A A
last_name: Khostovan
- first_name: D
full_name: Sobral, D
last_name: Sobral
- first_name: B
full_name: Mobasher, B
last_name: Mobasher
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
- 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
- first_name: A
full_name: Paulino-Afonso, A
last_name: Paulino-Afonso
- first_name: S
full_name: Santos, S
last_name: Santos
- first_name: J
full_name: Calhau, J
last_name: Calhau
citation:
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.'
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.'
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.'
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.
date_created: 2022-07-07T13:01:03Z
date_published: 2019-10-01T00:00:00Z
date_updated: 2022-08-19T06:38:42Z
day: '01'
doi: 10.1093/mnras/stz2149
extern: '1'
external_id:
arxiv:
- '1811.00556'
intvolume: ' 489'
issue: '1'
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
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1811.00556
month: '10'
oa: 1
oa_version: Preprint
page: 555-573
publication: Monthly Notices of the Royal Astronomical Society
publication_identifier:
eissn:
- 1365-2966
issn:
- 0035-8711
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The clustering of typical Ly α emitters from z ∼ 2.5–6: Host halo masses depend
on Ly α and UV luminosities'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 489
year: '2019'
...
---
_id: '11541'
abstract:
- lang: eng
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.
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.
article_processing_charge: No
article_type: original
author:
- first_name: David
full_name: Sobral, David
last_name: Sobral
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
- first_name: Gabriel
full_name: Brammer, Gabriel
last_name: Brammer
- first_name: Andrea
full_name: Ferrara, Andrea
last_name: Ferrara
- first_name: Lara
full_name: Alegre, Lara
last_name: Alegre
- first_name: Huub
full_name: Röttgering, Huub
last_name: Röttgering
- first_name: Daniel
full_name: Schaerer, Daniel
last_name: Schaerer
- first_name: Bahram
full_name: Mobasher, Bahram
last_name: Mobasher
- first_name: Behnam
full_name: Darvish, Behnam
last_name: Darvish
citation:
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
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.
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.
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.
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.
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.
date_created: 2022-07-08T10:40:05Z
date_published: 2019-01-01T00:00:00Z
date_updated: 2022-08-19T06:49:36Z
day: '01'
doi: 10.1093/mnras/sty2779
extern: '1'
external_id:
arxiv:
- '1710.08422'
intvolume: ' 482'
issue: '2'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- 'galaxies: evolution'
- 'galaxies: high-redshift'
- 'galaxies: ISM'
- 'cosmology: observations'
- dark ages
- reionization
- first stars
- early Universe
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1710.08422
month: '01'
oa: 1
oa_version: Preprint
page: 2422-2441
publication: Monthly Notices of the Royal Astronomical Society
publication_identifier:
eissn:
- 1365-2966
issn:
- 0035-8711
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the nature and physical conditions of the luminous Ly α emitter CR7 and
its rest-frame UV components
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 482
year: '2019'
...
---
_id: '11540'
abstract:
- lang: eng
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.
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).
article_processing_charge: No
article_type: original
author:
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
- first_name: Joop
full_name: Schaye, Joop
last_name: Schaye
citation:
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
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.
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.
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.
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.
short: J.J. Matthee, J. Schaye, Monthly Notices of the Royal Astronomical Society
484 (2019) 915–932.
date_created: 2022-07-08T07:48:31Z
date_published: 2019-03-01T00:00:00Z
date_updated: 2022-08-19T06:42:43Z
day: '01'
doi: 10.1093/mnras/stz030
extern: '1'
external_id:
arxiv:
- '1805.05956'
intvolume: ' 484'
issue: '1'
keyword:
- Space and Planetary Science
- 'Astronomy and Astrophysics : galaxies: evolution'
- 'galaxies: formation'
- 'galaxies: star formation'
- 'cosmology: theory'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1805.05956
month: '03'
oa: 1
oa_version: Preprint
page: 915-932
publication: Monthly Notices of the Royal Astronomical Society
publication_identifier:
eissn:
- 1365-2966
issn:
- 0035-8711
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: The origin of scatter in the star formation rate–stellar mass relation
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 484
year: '2019'
...
---
_id: '11616'
abstract:
- lang: eng
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.
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)."
article_number: '245'
article_processing_charge: No
article_type: original
author:
- first_name: Daniel
full_name: Huber, Daniel
last_name: Huber
- first_name: William J.
full_name: Chaplin, William J.
last_name: Chaplin
- first_name: Ashley
full_name: Chontos, Ashley
last_name: Chontos
- first_name: Hans
full_name: Kjeldsen, Hans
last_name: Kjeldsen
- first_name: Jørgen
full_name: Christensen-Dalsgaard, Jørgen
last_name: Christensen-Dalsgaard
- first_name: Timothy R.
full_name: Bedding, Timothy R.
last_name: Bedding
- first_name: Warrick
full_name: Ball, Warrick
last_name: Ball
- first_name: Rafael
full_name: Brahm, Rafael
last_name: Brahm
- first_name: Nestor
full_name: Espinoza, Nestor
last_name: Espinoza
- first_name: Thomas
full_name: Henning, Thomas
last_name: Henning
- first_name: Andrés
full_name: Jordán, Andrés
last_name: Jordán
- first_name: Paula
full_name: Sarkis, Paula
last_name: Sarkis
- first_name: Emil
full_name: Knudstrup, Emil
last_name: Knudstrup
- first_name: Simon
full_name: Albrecht, Simon
last_name: Albrecht
- first_name: Frank
full_name: Grundahl, Frank
last_name: Grundahl
- first_name: Mads Fredslund
full_name: Andersen, Mads Fredslund
last_name: Andersen
- first_name: Pere L.
full_name: Pallé, Pere L.
last_name: Pallé
- first_name: Ian
full_name: Crossfield, Ian
last_name: Crossfield
- first_name: Benjamin
full_name: Fulton, Benjamin
last_name: Fulton
- first_name: Andrew W.
full_name: Howard, Andrew W.
last_name: Howard
- first_name: Howard T.
full_name: Isaacson, Howard T.
last_name: Isaacson
- first_name: Lauren M.
full_name: Weiss, Lauren M.
last_name: Weiss
- first_name: Rasmus
full_name: Handberg, Rasmus
last_name: Handberg
- first_name: Mikkel N.
full_name: Lund, Mikkel N.
last_name: Lund
- first_name: Aldo M.
full_name: Serenelli, Aldo M.
last_name: Serenelli
- first_name: Jakob
full_name: Rørsted Mosumgaard, Jakob
last_name: Rørsted Mosumgaard
- first_name: Amalie
full_name: Stokholm, Amalie
last_name: Stokholm
- first_name: Allyson
full_name: Bieryla, Allyson
last_name: Bieryla
- first_name: Lars A.
full_name: Buchhave, Lars A.
last_name: Buchhave
- first_name: David W.
full_name: Latham, David W.
last_name: Latham
- first_name: Samuel N.
full_name: Quinn, Samuel N.
last_name: Quinn
- first_name: Eric
full_name: Gaidos, Eric
last_name: Gaidos
- first_name: Teruyuki
full_name: Hirano, Teruyuki
last_name: Hirano
- first_name: George R.
full_name: Ricker, George R.
last_name: Ricker
- first_name: Roland K.
full_name: Vanderspek, Roland K.
last_name: Vanderspek
- first_name: Sara
full_name: Seager, Sara
last_name: Seager
- first_name: Jon M.
full_name: Jenkins, Jon M.
last_name: Jenkins
- first_name: Joshua N.
full_name: Winn, Joshua N.
last_name: Winn
- first_name: H. M.
full_name: Antia, H. M.
last_name: Antia
- first_name: Thierry
full_name: Appourchaux, Thierry
last_name: Appourchaux
- first_name: Sarbani
full_name: Basu, Sarbani
last_name: Basu
- first_name: Keaton J.
full_name: Bell, Keaton J.
last_name: Bell
- first_name: Othman
full_name: Benomar, Othman
last_name: Benomar
- first_name: Alfio
full_name: Bonanno, Alfio
last_name: Bonanno
- first_name: Derek L.
full_name: Buzasi, Derek L.
last_name: Buzasi
- first_name: Tiago L.
full_name: Campante, Tiago L.
last_name: Campante
- first_name: Z.
full_name: Çelik Orhan, Z.
last_name: Çelik Orhan
- first_name: Enrico
full_name: Corsaro, Enrico
last_name: Corsaro
- first_name: Margarida S.
full_name: Cunha, Margarida S.
last_name: Cunha
- first_name: Guy R.
full_name: Davies, Guy R.
last_name: Davies
- first_name: Sebastien
full_name: Deheuvels, Sebastien
last_name: Deheuvels
- first_name: Samuel K.
full_name: Grunblatt, Samuel K.
last_name: Grunblatt
- first_name: Amir
full_name: Hasanzadeh, Amir
last_name: Hasanzadeh
- first_name: Maria Pia
full_name: Di Mauro, Maria Pia
last_name: Di Mauro
- first_name: Rafael
full_name: A. García, Rafael
last_name: A. García
- first_name: Patrick
full_name: Gaulme, Patrick
last_name: Gaulme
- first_name: Léo
full_name: Girardi, Léo
last_name: Girardi
- first_name: Joyce A.
full_name: Guzik, Joyce A.
last_name: Guzik
- first_name: Marc
full_name: Hon, Marc
last_name: Hon
- first_name: Chen
full_name: Jiang, Chen
last_name: Jiang
- first_name: Thomas
full_name: Kallinger, Thomas
last_name: Kallinger
- first_name: Steven D.
full_name: Kawaler, Steven D.
last_name: Kawaler
- first_name: James S.
full_name: Kuszlewicz, James S.
last_name: Kuszlewicz
- first_name: Yveline
full_name: Lebreton, Yveline
last_name: Lebreton
- first_name: Tanda
full_name: Li, Tanda
last_name: Li
- first_name: Miles
full_name: Lucas, Miles
last_name: Lucas
- first_name: Mia S.
full_name: Lundkvist, Mia S.
last_name: Lundkvist
- first_name: Andrew W.
full_name: Mann, Andrew W.
last_name: Mann
- first_name: Stéphane
full_name: Mathis, Stéphane
last_name: Mathis
- first_name: Savita
full_name: Mathur, Savita
last_name: Mathur
- first_name: Anwesh
full_name: Mazumdar, Anwesh
last_name: Mazumdar
- first_name: Travis S.
full_name: Metcalfe, Travis S.
last_name: Metcalfe
- first_name: Andrea
full_name: Miglio, Andrea
last_name: Miglio
- first_name: Mário J. P.
full_name: F. G. Monteiro, Mário J. P.
last_name: F. G. Monteiro
- first_name: Benoit
full_name: Mosser, Benoit
last_name: Mosser
- first_name: Anthony
full_name: Noll, Anthony
last_name: Noll
- first_name: Benard
full_name: Nsamba, Benard
last_name: Nsamba
- first_name: Jia Mian
full_name: Joel Ong, Jia Mian
last_name: Joel Ong
- first_name: S.
full_name: Örtel, S.
last_name: Örtel
- first_name: Filipe
full_name: Pereira, Filipe
last_name: Pereira
- first_name: Pritesh
full_name: Ranadive, Pritesh
last_name: Ranadive
- first_name: Clara
full_name: Régulo, Clara
last_name: Régulo
- first_name: Thaíse S.
full_name: Rodrigues, Thaíse S.
last_name: Rodrigues
- first_name: Ian W.
full_name: Roxburgh, Ian W.
last_name: Roxburgh
- first_name: Victor Silva
full_name: Aguirre, Victor Silva
last_name: Aguirre
- first_name: Barry
full_name: Smalley, Barry
last_name: Smalley
- first_name: Mathew
full_name: Schofield, Mathew
last_name: Schofield
- 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
- first_name: Dennis
full_name: Stello, Dennis
last_name: Stello
- first_name: Jamie
full_name: Tayar, Jamie
last_name: Tayar
- first_name: Timothy R.
full_name: White, Timothy R.
last_name: White
- first_name: Kuldeep
full_name: Verma, Kuldeep
last_name: Verma
- first_name: Mathieu
full_name: Vrard, Mathieu
last_name: Vrard
- first_name: M.
full_name: Yıldız, M.
last_name: Yıldız
- first_name: David
full_name: Baker, David
last_name: Baker
- first_name: Michaël
full_name: Bazot, Michaël
last_name: Bazot
- first_name: Charles
full_name: Beichmann, Charles
last_name: Beichmann
- first_name: Christoph
full_name: Bergmann, Christoph
last_name: Bergmann
- first_name: Lisa Annabelle
full_name: Bugnet, Lisa Annabelle
id: d9edb345-f866-11ec-9b37-d119b5234501
last_name: Bugnet
orcid: 0000-0003-0142-4000
- first_name: Bryson
full_name: Cale, Bryson
last_name: Cale
- first_name: Roberto
full_name: Carlino, Roberto
last_name: Carlino
- first_name: Scott M.
full_name: Cartwright, Scott M.
last_name: Cartwright
- first_name: Jessie L.
full_name: Christiansen, Jessie L.
last_name: Christiansen
- first_name: David R.
full_name: Ciardi, David R.
last_name: Ciardi
- first_name: Orlagh
full_name: Creevey, Orlagh
last_name: Creevey
- first_name: Jason A.
full_name: Dittmann, Jason A.
last_name: Dittmann
- first_name: Jose-Dias Do
full_name: Nascimento, Jose-Dias Do
last_name: Nascimento
- first_name: Vincent Van
full_name: Eylen, Vincent Van
last_name: Eylen
- first_name: Gabor
full_name: Fürész, Gabor
last_name: Fürész
- first_name: Jonathan
full_name: Gagné, Jonathan
last_name: Gagné
- first_name: Peter
full_name: Gao, Peter
last_name: Gao
- first_name: Kosmas
full_name: Gazeas, Kosmas
last_name: Gazeas
- first_name: Frank
full_name: Giddens, Frank
last_name: Giddens
- first_name: Oliver J.
full_name: Hall, Oliver J.
last_name: Hall
- first_name: Saskia
full_name: Hekker, Saskia
last_name: Hekker
- first_name: Michael J.
full_name: Ireland, Michael J.
last_name: Ireland
- first_name: Natasha
full_name: Latouf, Natasha
last_name: Latouf
- first_name: Danny
full_name: LeBrun, Danny
last_name: LeBrun
- first_name: Alan M.
full_name: Levine, Alan M.
last_name: Levine
- first_name: William
full_name: Matzko, William
last_name: Matzko
- first_name: Eva
full_name: Natinsky, Eva
last_name: Natinsky
- first_name: Emma
full_name: Page, Emma
last_name: Page
- first_name: Peter
full_name: Plavchan, Peter
last_name: Plavchan
- first_name: Masoud
full_name: Mansouri-Samani, Masoud
last_name: Mansouri-Samani
- first_name: Sean
full_name: McCauliff, Sean
last_name: McCauliff
- first_name: Susan E.
full_name: Mullally, Susan E.
last_name: Mullally
- first_name: Brendan
full_name: Orenstein, Brendan
last_name: Orenstein
- first_name: Aylin Garcia
full_name: Soto, Aylin Garcia
last_name: Soto
- first_name: Martin
full_name: Paegert, Martin
last_name: Paegert
- first_name: Jennifer L.
full_name: van Saders, Jennifer L.
last_name: van Saders
- first_name: Chloe
full_name: Schnaible, Chloe
last_name: Schnaible
- 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
full_name: Tanner, Angelle
last_name: Tanner
- first_name: C. G.
full_name: Tinney, C. G.
last_name: Tinney
- first_name: Johanna
full_name: Teske, Johanna
last_name: Teske
- first_name: Alexandra
full_name: Thomas, Alexandra
last_name: Thomas
- first_name: Regner
full_name: Trampedach, Regner
last_name: Trampedach
- first_name: Duncan
full_name: Wright, Duncan
last_name: Wright
- first_name: Thomas T.
full_name: Yuan, Thomas T.
last_name: Yuan
- first_name: Farzaneh
full_name: Zohrabi, Farzaneh
last_name: Zohrabi
citation:
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
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.
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.
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).
date_created: 2022-07-18T14:29:07Z
date_published: 2019-05-30T00:00:00Z
date_updated: 2022-08-22T07:38:34Z
day: '30'
doi: 10.3847/1538-3881/ab1488
extern: '1'
external_id:
arxiv:
- '1901.01643'
intvolume: ' 157'
issue: '6'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1901.01643
month: '05'
oa: 1
oa_version: Preprint
publication: The Astronomical Journal
publication_identifier:
issn:
- 0004-6256
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: A hot Saturn orbiting an oscillating late subgiant discovered by TESS
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 157
year: '2019'
...
---
_id: '11613'
abstract:
- lang: eng
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.
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).
article_number: '46'
article_processing_charge: No
article_type: original
author:
- first_name: Savita
full_name: Mathur, Savita
last_name: Mathur
- first_name: Rafael A.
full_name: García, Rafael A.
last_name: García
- first_name: Lisa Annabelle
full_name: Bugnet, Lisa Annabelle
id: d9edb345-f866-11ec-9b37-d119b5234501
last_name: Bugnet
orcid: 0000-0003-0142-4000
- first_name: Ângela R.G.
full_name: Santos, Ângela R.G.
last_name: Santos
- first_name: Netsha
full_name: Santiago, Netsha
last_name: Santiago
- first_name: Paul G.
full_name: Beck, Paul G.
last_name: Beck
citation:
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
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
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.
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.
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.
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.
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).
date_created: 2022-07-18T14:00:36Z
date_published: 2019-07-10T00:00:00Z
date_updated: 2022-08-22T07:29:55Z
day: '10'
doi: 10.3389/fspas.2019.00046
extern: '1'
external_id:
arxiv:
- '1907.01415'
intvolume: ' 6'
keyword:
- Astronomy and Astrophysics
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1907.01415
month: '07'
oa: 1
oa_version: Preprint
publication: Frontiers in Astronomy and Space Sciences
publication_identifier:
eissn:
- 2296-987X
publication_status: published
publisher: Frontiers Media
quality_controlled: '1'
scopus_import: '1'
status: public
title: Revisiting the impact of stellar magnetic activity on the detectability of
solar-like oscillations by Kepler
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2019'
...
---
_id: '11615'
abstract:
- lang: eng
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.
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.
article_processing_charge: No
article_type: original
author:
- first_name: Marc
full_name: Hon, Marc
last_name: Hon
- first_name: Dennis
full_name: Stello, Dennis
last_name: Stello
- first_name: Rafael A
full_name: García, Rafael A
last_name: García
- first_name: Savita
full_name: Mathur, Savita
last_name: Mathur
- first_name: Sanjib
full_name: Sharma, Sanjib
last_name: Sharma
- first_name: Isabel L
full_name: Colman, Isabel L
last_name: Colman
- first_name: Lisa Annabelle
full_name: Bugnet, Lisa Annabelle
id: d9edb345-f866-11ec-9b37-d119b5234501
last_name: Bugnet
orcid: 0000-0003-0142-4000
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
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.
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.
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.
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.
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.
date_created: 2022-07-18T14:26:03Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2022-08-22T07:35:19Z
day: '01'
doi: 10.1093/mnras/stz622
extern: '1'
external_id:
arxiv:
- '1903.00115'
intvolume: ' 485'
issue: '4'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- asteroseismology
- 'methods: data analysis'
- 'techniques: image processing'
- 'stars: oscillations'
- 'stars: statistics'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1903.00115
month: '06'
oa: 1
oa_version: Preprint
page: 5616-5630
publication: Monthly Notices of the Royal Astronomical Society
publication_identifier:
eissn:
- 1365-2966
issn:
- 0035-8711
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: A search for red giant solar-like oscillations in all Kepler data
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 485
year: '2019'
...
---
_id: '11614'
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.
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).
article_number: A79
article_processing_charge: No
article_type: original
author:
- first_name: Lisa Annabelle
full_name: Bugnet, Lisa Annabelle
id: d9edb345-f866-11ec-9b37-d119b5234501
last_name: Bugnet
orcid: 0000-0003-0142-4000
- first_name: R. A.
full_name: García, R. A.
last_name: García
- first_name: S.
full_name: Mathur, S.
last_name: Mathur
- first_name: G. R.
full_name: Davies, G. R.
last_name: Davies
- first_name: O. J.
full_name: Hall, O. J.
last_name: Hall
- first_name: M. N.
full_name: Lund, M. N.
last_name: Lund
- first_name: B. M.
full_name: Rendle, B. M.
last_name: Rendle
citation:
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'
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'
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.'
ieee: 'L. A. Bugnet et al., “FliPerClass: In search of solar-like pulsators
among TESS targets,” Astronomy & Astrophysics, vol. 624. EDP Science,
2019.'
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.'
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).
date_created: 2022-07-18T14:13:34Z
date_published: 2019-04-19T00:00:00Z
date_updated: 2022-08-22T07:32:51Z
day: '19'
doi: 10.1051/0004-6361/201834780
extern: '1'
external_id:
arxiv:
- '1902.09854'
intvolume: ' 624'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1902.09854
month: '04'
oa: 1
oa_version: Preprint
publication: Astronomy & Astrophysics
publication_identifier:
eissn:
- 1432-0746
issn:
- 0004-6361
publication_status: published
publisher: EDP Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'FliPerClass: In search of solar-like pulsators among TESS targets'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 624
year: '2019'
...
---
_id: '11623'
abstract:
- lang: eng
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.
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. -"
article_number: '21'
article_processing_charge: No
article_type: original
author:
- first_name: A. R. G.
full_name: Santos, A. R. G.
last_name: Santos
- first_name: R. A.
full_name: García, R. A.
last_name: García
- first_name: S.
full_name: Mathur, S.
last_name: Mathur
- first_name: Lisa Annabelle
full_name: Bugnet, Lisa Annabelle
id: d9edb345-f866-11ec-9b37-d119b5234501
last_name: Bugnet
orcid: 0000-0003-0142-4000
- first_name: J. L.
full_name: van Saders, J. L.
last_name: van Saders
- first_name: T. S.
full_name: Metcalfe, T. S.
last_name: Metcalfe
- 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
citation:
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
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
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.
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.
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.
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).
date_created: 2022-07-19T09:21:58Z
date_published: 2019-09-19T00:00:00Z
date_updated: 2022-08-22T08:10:38Z
day: '19'
doi: 10.3847/1538-4365/ab3b56
extern: '1'
external_id:
arxiv:
- '1908.05222'
intvolume: ' 244'
issue: '1'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- 'methods: data analysis'
- 'stars: activity'
- 'stars: low-mass'
- 'stars: rotation'
- starspots
- 'techniques: photometric'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1908.05222
month: '09'
oa: 1
oa_version: Preprint
publication: The Astrophysical Journal Supplement Series
publication_identifier:
issn:
- 0067-0049
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Surface rotation and photometric activity for Kepler targets. I. M and K main-sequence
stars
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 244
year: '2019'
...
---
_id: '11627'
abstract:
- lang: eng
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.'
article_number: '1906.09609'
article_processing_charge: No
author:
- first_name: S. N.
full_name: Breton, S. N.
last_name: Breton
- first_name: Lisa Annabelle
full_name: Bugnet, Lisa Annabelle
id: d9edb345-f866-11ec-9b37-d119b5234501
last_name: Bugnet
orcid: 0000-0003-0142-4000
- first_name: A. R. G.
full_name: Santos, A. R. G.
last_name: Santos
- first_name: A. Le
full_name: Saux, A. Le
last_name: Saux
- first_name: S.
full_name: Mathur, S.
last_name: Mathur
- first_name: P. L.
full_name: Palle, P. L.
last_name: Palle
- first_name: R. A.
full_name: Garcia, R. A.
last_name: Garcia
citation:
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
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.
ieee: S. N. Breton et al., “Determining surface rotation periods of solar-like
stars observed by the Kepler mission using machine learning techniques,” arXiv.
.
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.
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.
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.).
date_created: 2022-07-20T11:18:53Z
date_published: 2019-06-23T00:00:00Z
date_updated: 2022-08-22T08:16:53Z
day: '23'
doi: 10.48550/arXiv.1906.09609
extern: '1'
external_id:
arxiv:
- '1906.09609'
keyword:
- asteroseismology
- rotation
- solar-like stars
- kepler
- machine learning
- random forest
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1906.09609
month: '06'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
status: public
title: Determining surface rotation periods of solar-like stars observed by the Kepler
mission using machine learning techniques
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '11630'
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.'
article_number: '1906.09611'
article_processing_charge: No
author:
- first_name: A. Le
full_name: Saux, A. Le
last_name: Saux
- first_name: Lisa Annabelle
full_name: Bugnet, Lisa Annabelle
id: d9edb345-f866-11ec-9b37-d119b5234501
last_name: Bugnet
orcid: 0000-0003-0142-4000
- first_name: S.
full_name: Mathur, S.
last_name: Mathur
- first_name: S. N.
full_name: Breton, S. N.
last_name: Breton
- first_name: R. A.
full_name: Garcia, R. A.
last_name: Garcia
citation:
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
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
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.
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.
.
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.
short: A.L. Saux, L.A. Bugnet, S. Mathur, S.N. Breton, R.A. Garcia, ArXiv (n.d.).
date_created: 2022-07-21T06:57:10Z
date_published: 2019-06-23T00:00:00Z
date_updated: 2022-08-22T08:20:29Z
day: '23'
doi: 10.48550/arXiv.1906.09611
extern: '1'
external_id:
arxiv:
- '1906.09611'
keyword:
- asteroseismology - methods
- data analysis - thecniques
- machine learning - stars
- oscillations
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1906.09611
month: '06'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
status: public
title: Automatic classification of K2 pulsating stars using machine learning techniques
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '11826'
abstract:
- lang: eng
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."
alternative_title:
- LIPIcs
article_number: '13'
article_processing_charge: No
author:
- first_name: Bertie
full_name: Ancona, Bertie
last_name: Ancona
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Liam
full_name: Roditty, Liam
last_name: Roditty
- first_name: Virginia Vassilevska
full_name: Williams, Virginia Vassilevska
last_name: Williams
- first_name: Nicole
full_name: Wein, Nicole
last_name: Wein
citation:
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'
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.
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.
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.'
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.
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.
conference:
end_date: 2019-07-12
location: Patras, Greece
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 2019-07-09
date_created: 2022-08-12T08:14:51Z
date_published: 2019-07-04T00:00:00Z
date_updated: 2023-02-16T10:48:24Z
day: '04'
doi: 10.4230/LIPICS.ICALP.2019.13
extern: '1'
external_id:
arxiv:
- '811.12527'
intvolume: ' 132'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4230/LIPIcs.ICALP.2019.13
month: '07'
oa: 1
oa_version: Published Version
publication: 46th International Colloquium on Automata, Languages, and Programming
publication_identifier:
isbn:
- 978-3-95977-109-2
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Algorithms and hardness for diameter in dynamic graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 132
year: '2019'
...
---
_id: '11850'
abstract:
- lang: eng
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.'
article_processing_charge: No
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Stefan
full_name: Neumann, Stefan
last_name: Neumann
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
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'
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'
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.'
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.'
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.'
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.'
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.'
conference:
end_date: 2019-06-28
location: Phoenix, AZ, United States
name: 'SIGMETRICS: International Conference on Measurement and Modeling of Computer
Systems'
start_date: 2019-06-24
date_created: 2022-08-16T07:14:57Z
date_published: 2019-06-20T00:00:00Z
date_updated: 2023-02-17T09:41:45Z
day: '20'
doi: 10.1145/3309697.3331503
extern: '1'
external_id:
arxiv:
- '1904.05474'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1904.05474
month: '06'
oa: 1
oa_version: Preprint
page: 43–44
publication: 'SIGMETRICS''19: International Conference on Measurement and Modeling
of Computer Systems'
publication_identifier:
isbn:
- 978-1-4503-6678-6
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Efficient distributed workload (re-)embedding
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '11847'
abstract:
- lang: eng
text: This paper serves as a user guide to the Vienna graph clustering framework.
We review our general memetic algorithm, VieClus, to tackle the graph clustering
problem. A key component of our contribution are natural recombine operators that
employ ensemble clusterings as well as multi-level techniques. Lastly, we combine
these techniques with a scalable communication protocol, producing a system that
is able to compute high-quality solutions in a short amount of time. After giving
a description of the algorithms employed, we establish the connection of the graph
clustering problem to protein–protein interaction networks and moreover give a
description on how the software can be used, what file formats are expected, and
how this can be used to find functional groups in protein–protein interaction
networks.
alternative_title:
- Methods in Molecular Biology
article_processing_charge: No
author:
- first_name: Sonja
full_name: Biedermann, Sonja
last_name: Biedermann
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Christian
full_name: Schulz, Christian
last_name: Schulz
- first_name: Bernhard
full_name: Schuster, Bernhard
last_name: Schuster
citation:
ama: 'Biedermann S, Henzinger MH, Schulz C, Schuster B. Vienna Graph Clustering.
In: Canzar S, Rojas Ringeling F, eds. Protein-Protein Interaction Networks.
Vol 2074. MIMB. Springer Nature; 2019:215–231. doi:10.1007/978-1-4939-9873-9_16'
apa: Biedermann, S., Henzinger, M. H., Schulz, C., & Schuster, B. (2019). Vienna
Graph Clustering. In S. Canzar & F. Rojas Ringeling (Eds.), Protein-Protein
Interaction Networks (Vol. 2074, pp. 215–231). Springer Nature. https://doi.org/10.1007/978-1-4939-9873-9_16
chicago: Biedermann, Sonja, Monika H Henzinger, Christian Schulz, and Bernhard Schuster.
“Vienna Graph Clustering.” In Protein-Protein Interaction Networks, edited
by Stefan Canzar and Francisca Rojas Ringeling, 2074:215–231. MIMB. Springer Nature,
2019. https://doi.org/10.1007/978-1-4939-9873-9_16.
ieee: S. Biedermann, M. H. Henzinger, C. Schulz, and B. Schuster, “Vienna Graph
Clustering,” in Protein-Protein Interaction Networks, vol. 2074, S. Canzar
and F. Rojas Ringeling, Eds. Springer Nature, 2019, pp. 215–231.
ista: 'Biedermann S, Henzinger MH, Schulz C, Schuster B. 2019.Vienna Graph Clustering.
In: Protein-Protein Interaction Networks. Methods in Molecular Biology, vol. 2074,
215–231.'
mla: Biedermann, Sonja, et al. “Vienna Graph Clustering.” Protein-Protein Interaction
Networks, edited by Stefan Canzar and Francisca Rojas Ringeling, vol. 2074,
Springer Nature, 2019, pp. 215–231, doi:10.1007/978-1-4939-9873-9_16.
short: S. Biedermann, M.H. Henzinger, C. Schulz, B. Schuster, in:, S. Canzar, F.
Rojas Ringeling (Eds.), Protein-Protein Interaction Networks, Springer Nature,
2019, pp. 215–231.
date_created: 2022-08-16T06:54:48Z
date_published: 2019-10-04T00:00:00Z
date_updated: 2023-02-17T09:34:26Z
day: '04'
doi: 10.1007/978-1-4939-9873-9_16
editor:
- first_name: Stefan
full_name: Canzar, Stefan
last_name: Canzar
- first_name: Francisca
full_name: Rojas Ringeling, Francisca
last_name: Rojas Ringeling
extern: '1'
external_id:
pmid:
- '31583641'
intvolume: ' 2074'
language:
- iso: eng
month: '10'
oa_version: None
page: 215–231
pmid: 1
publication: Protein-Protein Interaction Networks
publication_identifier:
eisbn:
- '9781493998739'
eissn:
- 1940-6029
isbn:
- '9781493998722'
issn:
- 1064-3745
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: MIMB
status: public
title: Vienna Graph Clustering
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2074
year: '2019'
...
---
_id: '11853'
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.
article_processing_charge: No
author:
- first_name: Sayan
full_name: Bhattacharya, Sayan
last_name: Bhattacharya
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Danupon
full_name: Nanongkai, Danupon
last_name: Nanongkai
citation:
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'
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.
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.
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.
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.
conference:
end_date: 2019-11-12
location: Baltimore, MD, United States
name: 'FOCS: Annual Symposium on Foundations of Computer Science'
start_date: 2019-11-09
date_created: 2022-08-16T08:00:00Z
date_published: 2019-11-01T00:00:00Z
date_updated: 2023-02-17T09:50:37Z
day: '01'
doi: 10.1109/focs.2019.00033
extern: '1'
external_id:
arxiv:
- '1909.11600'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1909.11600
month: '11'
oa: 1
oa_version: Preprint
page: 406-423
publication: 60th Annual Symposium on Foundations of Computer Science
publication_identifier:
eisbn:
- 978-1-7281-4952-3
isbn:
- 978-1-7281-4953-0
issn:
- 2575-8454
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: A new deterministic algorithm for dynamic set cover
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '11851'
abstract:
- lang: eng
text: The minimum cut problem for an undirected edge-weighted graph asks us to divide
its set of nodes into two blocks while minimizing the weighted sum of the cut
edges. In this paper, we engineer the fastest known exact algorithm for the problem.
State-of-the-art algorithms like the algorithm of Padberg and Rinaldi or the algorithm
of Nagamochi, Ono and Ibaraki identify edges that can be contracted to reduce
the graph size such that at least one minimum cut is maintained in the contracted
graph. Our algorithm achieves improvements in running time over these algorithms
by a multitude of techniques. First, we use a recently developed fast and parallel
inexact minimum cut algorithm to obtain a better bound for the problem. Afterwards,
we use reductions that depend on this bound to reduce the size of the graph much
faster than previously possible. We use improved data structures to further lower
the running time of our algorithm. Additionally, we parallelize the contraction
routines of Nagamochi et al. . Overall, we arrive at a system that significantly
outperforms the fastest state-of-the-art solvers for the exact minimum cut problem.
article_number: '8820968'
article_processing_charge: No
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Alexander
full_name: Noe, Alexander
last_name: Noe
- first_name: Christian
full_name: Schulz, Christian
last_name: Schulz
citation:
ama: 'Henzinger MH, Noe A, Schulz C. Shared-memory exact minimum cuts. In: 33rd
International Parallel and Distributed Processing Symposium. Institute of
Electrical and Electronics Engineers; 2019. doi:10.1109/ipdps.2019.00013'
apa: 'Henzinger, M. H., Noe, A., & Schulz, C. (2019). Shared-memory exact minimum
cuts. In 33rd International Parallel and Distributed Processing Symposium.
Rio de Janeiro, Brazil: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ipdps.2019.00013'
chicago: Henzinger, Monika H, Alexander Noe, and Christian Schulz. “Shared-Memory
Exact Minimum Cuts.” In 33rd International Parallel and Distributed Processing
Symposium. Institute of Electrical and Electronics Engineers, 2019. https://doi.org/10.1109/ipdps.2019.00013.
ieee: M. H. Henzinger, A. Noe, and C. Schulz, “Shared-memory exact minimum cuts,”
in 33rd International Parallel and Distributed Processing Symposium, Rio
de Janeiro, Brazil, 2019.
ista: 'Henzinger MH, Noe A, Schulz C. 2019. Shared-memory exact minimum cuts. 33rd
International Parallel and Distributed Processing Symposium. IPDPS: International
Parallel and Distributed Processing Symposium, 8820968.'
mla: Henzinger, Monika H., et al. “Shared-Memory Exact Minimum Cuts.” 33rd International
Parallel and Distributed Processing Symposium, 8820968, Institute of Electrical
and Electronics Engineers, 2019, doi:10.1109/ipdps.2019.00013.
short: M.H. Henzinger, A. Noe, C. Schulz, in:, 33rd International Parallel and Distributed
Processing Symposium, Institute of Electrical and Electronics Engineers, 2019.
conference:
end_date: 2019-05-24
location: Rio de Janeiro, Brazil
name: 'IPDPS: International Parallel and Distributed Processing Symposium'
start_date: 2019-05-20
date_created: 2022-08-16T07:25:23Z
date_published: 2019-05-01T00:00:00Z
date_updated: 2023-02-21T16:30:34Z
day: '01'
doi: 10.1109/ipdps.2019.00013
extern: '1'
external_id:
arxiv:
- '1808.05458'
language:
- iso: eng
main_file_link:
- url: https://arxiv.org/abs/1808.05458
month: '05'
oa_version: Preprint
publication: 33rd International Parallel and Distributed Processing Symposium
publication_identifier:
eisbn:
- 978-1-7281-1246-6
eissn:
- 1530-2075
isbn:
- 978-1-7281-1247-3
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
related_material:
record:
- id: '11851'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Shared-memory exact minimum cuts
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '11865'
abstract:
- lang: eng
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.
article_processing_charge: No
author:
- first_name: Mohit
full_name: Daga, Mohit
last_name: Daga
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Danupon
full_name: Nanongkai, Danupon
last_name: Nanongkai
- first_name: Thatchaphol
full_name: Saranurak, Thatchaphol
last_name: Saranurak
citation:
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'
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'
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.
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.
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.
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.
conference:
end_date: 2019-06-26
location: Phoenix, AZ, United States
name: 'STOC: Symposium on Theory of Computing'
start_date: 2019-06-23
date_created: 2022-08-16T09:11:17Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2023-02-17T10:26:25Z
day: '01'
doi: 10.1145/3313276.3316346
extern: '1'
external_id:
arxiv:
- '1904.04341'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1904.04341
month: '06'
oa: 1
oa_version: Preprint
page: 343–354
publication: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
publication_identifier:
isbn:
- 978-1-4503-6705-9
issn:
- 0737-8017
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Distributed edge connectivity in sublinear time
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '11871'
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."
article_processing_charge: No
author:
- first_name: Aaron
full_name: Bernstein, Aaron
last_name: Bernstein
- first_name: Sebastian
full_name: Forster, Sebastian
last_name: Forster
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
citation:
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'
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.
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.
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.'
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.
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.
conference:
end_date: 2019-01-09
location: San Diego, CA, United States
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2019-01-06
date_created: 2022-08-16T09:50:33Z
date_published: 2019-01-01T00:00:00Z
date_updated: 2023-02-21T16:31:21Z
day: '01'
doi: 10.1137/1.9781611975482.115
extern: '1'
external_id:
arxiv:
- '1810.10932'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1810.10932
month: '01'
oa: 1
oa_version: Preprint
page: 1899-1918
publication: 30th Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
eisbn:
- 978-1-61197-548-2
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
related_material:
record:
- id: '11871'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: A deamortization approach for dynamic spanner and dynamic maximal matching
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '11898'
abstract:
- lang: eng
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."
article_processing_charge: No
article_type: original
author:
- first_name: Sayan
full_name: Bhattacharya, Sayan
last_name: Bhattacharya
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Stefan
full_name: Neumann, Stefan
last_name: Neumann
citation:
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
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
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.
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.
ista: Bhattacharya S, Henzinger MH, Neumann S. 2019. New amortized cell-probe lower
bounds for dynamic problems. Theoretical Computer Science. 779, 72–87.
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.
short: S. Bhattacharya, M.H. Henzinger, S. Neumann, Theoretical Computer Science
779 (2019) 72–87.
date_created: 2022-08-17T09:02:15Z
date_published: 2019-08-02T00:00:00Z
date_updated: 2022-09-09T11:29:04Z
day: '02'
doi: 10.1016/j.tcs.2019.01.043
extern: '1'
external_id:
arxiv:
- '1902.02304'
intvolume: ' 779'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1902.02304
month: '08'
oa: 1
oa_version: Preprint
page: 72-87
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: New amortized cell-probe lower bounds for dynamic problems
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 779
year: '2019'
...
---
_id: '11957'
abstract:
- lang: eng
text: Cross-coupling reactions mediated by dual nickel/photocatalysis are synthetically
attractive but rely mainly on expensive, non-recyclable noble-metal complexes
as photocatalysts. Heterogeneous semiconductors, which are commonly used for artificial
photosynthesis and wastewater treatment, are a sustainable alternative. Graphitic
carbon nitrides, a class of metal-free polymers that can be easily prepared from
bulk chemicals, are heterogeneous semiconductors with high potential for photocatalytic
organic transformations. Here, we demonstrate that graphitic carbon nitrides in
combination with nickel catalysis can induce selective C−O cross-couplings of
carboxylic acids with aryl halides, yielding the respective aryl esters in excellent
yield and selectivity. The heterogeneous organic photocatalyst exhibits a broad
substrate scope, is able to harvest green light, and can be recycled multiple
times. In situ FTIR was used to track the reaction progress to study this transformation
at different irradiation wavelengths and reaction scales.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Bartholomäus
full_name: Pieber, Bartholomäus
id: 93e5e5b2-0da6-11ed-8a41-af589a024726
last_name: Pieber
orcid: 0000-0001-8689-388X
- first_name: Jamal A.
full_name: Malik, Jamal A.
last_name: Malik
- first_name: Cristian
full_name: Cavedon, Cristian
last_name: Cavedon
- first_name: Sebastian
full_name: Gisbertz, Sebastian
last_name: Gisbertz
- first_name: Aleksandr
full_name: Savateev, Aleksandr
last_name: Savateev
- first_name: Daniel
full_name: Cruz, Daniel
last_name: Cruz
- first_name: Tobias
full_name: Heil, Tobias
last_name: Heil
- first_name: Guigang
full_name: Zhang, Guigang
last_name: Zhang
- first_name: Peter H.
full_name: Seeberger, Peter H.
last_name: Seeberger
citation:
ama: 'Pieber B, Malik JA, Cavedon C, et al. Semi‐heterogeneous dual nickel/photocatalysis
using carbon nitrides: Esterification of carboxylic acids with aryl halides. Angewandte
Chemie International Edition. 2019;58(28):9575-9580. doi:10.1002/anie.201902785'
apa: 'Pieber, B., Malik, J. A., Cavedon, C., Gisbertz, S., Savateev, A., Cruz, D.,
… Seeberger, P. H. (2019). Semi‐heterogeneous dual nickel/photocatalysis using
carbon nitrides: Esterification of carboxylic acids with aryl halides. Angewandte
Chemie International Edition. Wiley. https://doi.org/10.1002/anie.201902785'
chicago: 'Pieber, Bartholomäus, Jamal A. Malik, Cristian Cavedon, Sebastian Gisbertz,
Aleksandr Savateev, Daniel Cruz, Tobias Heil, Guigang Zhang, and Peter H. Seeberger.
“Semi‐heterogeneous Dual Nickel/Photocatalysis Using Carbon Nitrides: Esterification
of Carboxylic Acids with Aryl Halides.” Angewandte Chemie International Edition.
Wiley, 2019. https://doi.org/10.1002/anie.201902785.'
ieee: 'B. Pieber et al., “Semi‐heterogeneous dual nickel/photocatalysis using
carbon nitrides: Esterification of carboxylic acids with aryl halides,” Angewandte
Chemie International Edition, vol. 58, no. 28. Wiley, pp. 9575–9580, 2019.'
ista: 'Pieber B, Malik JA, Cavedon C, Gisbertz S, Savateev A, Cruz D, Heil T, Zhang
G, Seeberger PH. 2019. Semi‐heterogeneous dual nickel/photocatalysis using carbon
nitrides: Esterification of carboxylic acids with aryl halides. Angewandte Chemie
International Edition. 58(28), 9575–9580.'
mla: 'Pieber, Bartholomäus, et al. “Semi‐heterogeneous Dual Nickel/Photocatalysis
Using Carbon Nitrides: Esterification of Carboxylic Acids with Aryl Halides.”
Angewandte Chemie International Edition, vol. 58, no. 28, Wiley, 2019,
pp. 9575–80, doi:10.1002/anie.201902785.'
short: B. Pieber, J.A. Malik, C. Cavedon, S. Gisbertz, A. Savateev, D. Cruz, T.
Heil, G. Zhang, P.H. Seeberger, Angewandte Chemie International Edition 58 (2019)
9575–9580.
date_created: 2022-08-24T10:50:19Z
date_published: 2019-07-08T00:00:00Z
date_updated: 2023-02-21T10:09:16Z
day: '08'
doi: 10.1002/anie.201902785
extern: '1'
external_id:
pmid:
- '31050132'
intvolume: ' 58'
issue: '28'
language:
- iso: eng
month: '07'
oa_version: None
page: 9575-9580
pmid: 1
publication: Angewandte Chemie International Edition
publication_identifier:
eissn:
- 1521-3773
issn:
- 1433-7851
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification
of carboxylic acids with aryl halides'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 58
year: '2019'
...
---
_id: '11984'
abstract:
- lang: eng
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.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Mónica
full_name: Guberman, Mónica
last_name: Guberman
- first_name: Bartholomäus
full_name: Pieber, Bartholomäus
id: 93e5e5b2-0da6-11ed-8a41-af589a024726
last_name: Pieber
orcid: 0000-0001-8689-388X
- first_name: Peter H.
full_name: Seeberger, Peter H.
last_name: Seeberger
citation:
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
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.
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.
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.
short: M. Guberman, B. Pieber, P.H. Seeberger, Organic Process Research and Development
23 (2019) 2764–2770.
date_created: 2022-08-25T11:30:33Z
date_published: 2019-12-20T00:00:00Z
date_updated: 2023-02-21T10:10:23Z
day: '20'
doi: 10.1021/acs.oprd.9b00456
extern: '1'
intvolume: ' 23'
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1021/acs.oprd.9b00456
month: '12'
oa: 1
oa_version: Published Version
page: 2764-2770
publication: Organic Process Research and Development
publication_identifier:
eissn:
- 1520-586X
issn:
- 1083-6160
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Safe and scalable continuous flow azidophenylselenylation of galactal to prepare
galactosamine building blocks
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2019'
...
---
_id: '11982'
abstract:
- lang: eng
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.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Cristian
full_name: Cavedon, Cristian
last_name: Cavedon
- first_name: Amiera
full_name: Madani, Amiera
last_name: Madani
- first_name: Peter H.
full_name: Seeberger, Peter H.
last_name: Seeberger
- first_name: Bartholomäus
full_name: Pieber, Bartholomäus
id: 93e5e5b2-0da6-11ed-8a41-af589a024726
last_name: Pieber
orcid: 0000-0001-8689-388X
citation:
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.
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.
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.
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.
short: C. Cavedon, A. Madani, P.H. Seeberger, B. Pieber, Organic Letters 21 (2019)
5331–5334.
date_created: 2022-08-25T11:18:00Z
date_published: 2019-07-05T00:00:00Z
date_updated: 2023-02-21T10:10:19Z
day: '05'
doi: 10.1021/acs.orglett.9b01957
extern: '1'
external_id:
pmid:
- '31247752'
intvolume: ' 21'
issue: '13'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1021/acs.orglett.9b01957
month: '07'
oa: 1
oa_version: Published Version
page: 5331-5334
pmid: 1
publication: Organic Letters
publication_identifier:
eissn:
- 1523-7052
issn:
- 1523-7060
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon
nitrides
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 21
year: '2019'
...
---
_id: '170'
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 ℚ .
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
- first_name: Efthymios
full_name: Sofos, Efthymios
last_name: Sofos
citation:
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
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
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.
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.
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.
short: T.D. Browning, E. Sofos, Mathematische Annalen 373 (2019) 977–1016.
date_created: 2018-12-11T11:44:59Z
date_published: 2019-04-01T00:00:00Z
date_updated: 2021-01-12T06:52:37Z
day: '01'
ddc:
- '510'
doi: 10.1007/s00208-018-1716-6
extern: '1'
external_id:
arxiv:
- '1609.09057'
file:
- access_level: open_access
checksum: 4061dc2fe99bee25d9adf2d2018cf608
content_type: application/pdf
creator: dernst
date_created: 2019-05-23T07:53:27Z
date_updated: 2020-07-14T12:45:12Z
file_id: '6479'
file_name: 2019_MathAnnalen_Browning.pdf
file_size: 712847
relation: main_file
file_date_updated: 2020-07-14T12:45:12Z
has_accepted_license: '1'
intvolume: ' 373'
issue: 3-4
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 977-1016
publication: Mathematische Annalen
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Counting rational points on quartic del Pezzo surfaces with a rational conic
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 373
year: '2019'
...
---
_id: '441'
article_processing_charge: No
article_type: original
author:
- first_name: Nikita
full_name: Kalinin, Nikita
last_name: Kalinin
- first_name: Mikhail
full_name: Shkolnikov, Mikhail
id: 35084A62-F248-11E8-B48F-1D18A9856A87
last_name: Shkolnikov
orcid: 0000-0002-4310-178X
citation:
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
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
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.
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.
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.
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.
short: N. Kalinin, M. Shkolnikov, European Journal of Mathematics 5 (2019) 909–928.
date_created: 2018-12-11T11:46:29Z
date_published: 2019-09-15T00:00:00Z
date_updated: 2021-01-12T07:56:46Z
day: '15'
department:
- _id: TaHa
doi: 10.1007/s40879-018-0218-0
ec_funded: 1
external_id:
arxiv:
- '1711.02089'
intvolume: ' 5'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1711.02089
month: '09'
oa: 1
oa_version: Preprint
page: 909–928
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: European Journal of Mathematics
publication_identifier:
eissn:
- 2199-6768
issn:
- 2199-675X
publication_status: published
publisher: Springer Nature
publist_id: '7382'
quality_controlled: '1'
scopus_import: 1
status: public
title: Tropical formulae for summation over a part of SL(2,Z)
type: journal_article
user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425
volume: 5
year: '2019'
...
---
_id: '5793'
abstract:
- lang: eng
text: The transcription coactivator, Yes-associated protein (YAP), which is a nuclear
effector of the Hippo signaling pathway, has been shown to be a mechano-transducer.
By using mutant fish and human 3D spheroids, we have recently demonstrated that
YAP is also a mechano-effector. YAP functions in three-dimensional (3D) morphogenesis
of organ and global body shape by controlling actomyosin-mediated tissue tension.
In this chapter, we present a platform that links the findings in fish embryos
with human cells. The protocols for analyzing tissue tension-mediated global body
shape/organ morphogenesis in vivo and ex vivo using medaka fish embryos and in
vitro using human cell spheroids represent useful tools for unraveling the molecular
mechanisms by which YAP functions in regulating global body/organ morphogenesis.
alternative_title:
- MIMB
author:
- first_name: Yoichi
full_name: Asaoka, Yoichi
last_name: Asaoka
- first_name: Hitoshi
full_name: Morita, Hitoshi
last_name: Morita
- first_name: Hiroko
full_name: Furumoto, Hiroko
last_name: Furumoto
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
- first_name: Makoto
full_name: Furutani-Seiki, Makoto
last_name: Furutani-Seiki
citation:
ama: 'Asaoka Y, Morita H, Furumoto H, Heisenberg C-PJ, Furutani-Seiki M. Studying
YAP-mediated 3D morphogenesis using fish embryos and human spheroids. In: Hergovich
A, ed. The Hippo Pathway. Vol 1893. Methods in Molecular Biology. Springer;
2019:167-181. doi:10.1007/978-1-4939-8910-2_14'
apa: Asaoka, Y., Morita, H., Furumoto, H., Heisenberg, C.-P. J., & Furutani-Seiki,
M. (2019). Studying YAP-mediated 3D morphogenesis using fish embryos and human
spheroids. In A. Hergovich (Ed.), The hippo pathway (Vol. 1893, pp. 167–181).
Springer. https://doi.org/10.1007/978-1-4939-8910-2_14
chicago: Asaoka, Yoichi, Hitoshi Morita, Hiroko Furumoto, Carl-Philipp J Heisenberg,
and Makoto Furutani-Seiki. “Studying YAP-Mediated 3D Morphogenesis Using Fish
Embryos and Human Spheroids.” In The Hippo Pathway, edited by Alexander
Hergovich, 1893:167–81. Methods in Molecular Biology. Springer, 2019. https://doi.org/10.1007/978-1-4939-8910-2_14.
ieee: Y. Asaoka, H. Morita, H. Furumoto, C.-P. J. Heisenberg, and M. Furutani-Seiki,
“Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids,”
in The hippo pathway, vol. 1893, A. Hergovich, Ed. Springer, 2019, pp.
167–181.
ista: 'Asaoka Y, Morita H, Furumoto H, Heisenberg C-PJ, Furutani-Seiki M. 2019.Studying
YAP-mediated 3D morphogenesis using fish embryos and human spheroids. In: The
hippo pathway. MIMB, vol. 1893, 167–181.'
mla: Asaoka, Yoichi, et al. “Studying YAP-Mediated 3D Morphogenesis Using Fish Embryos
and Human Spheroids.” The Hippo Pathway, edited by Alexander Hergovich,
vol. 1893, Springer, 2019, pp. 167–81, doi:10.1007/978-1-4939-8910-2_14.
short: Y. Asaoka, H. Morita, H. Furumoto, C.-P.J. Heisenberg, M. Furutani-Seiki,
in:, A. Hergovich (Ed.), The Hippo Pathway, Springer, 2019, pp. 167–181.
date_created: 2019-01-06T22:59:11Z
date_published: 2019-01-01T00:00:00Z
date_updated: 2021-01-12T08:03:30Z
day: '01'
department:
- _id: CaHe
doi: 10.1007/978-1-4939-8910-2_14
editor:
- first_name: Alexander
full_name: Hergovich, Alexander
last_name: Hergovich
intvolume: ' 1893'
language:
- iso: eng
month: '01'
oa_version: None
page: 167-181
publication: The hippo pathway
publication_identifier:
isbn:
- 978-1-4939-8909-6
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: 1
series_title: Methods in Molecular Biology
status: public
title: Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1893
year: '2019'
...
---
_id: '5887'
abstract:
- lang: eng
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.'
article_processing_charge: No
article_type: original
author:
- first_name: Gregory
full_name: Demay, Gregory
last_name: Demay
- first_name: Peter
full_name: Gazi, Peter
id: 3E0BFE38-F248-11E8-B48F-1D18A9856A87
last_name: Gazi
- first_name: Ueli
full_name: Maurer, Ueli
last_name: Maurer
- first_name: Bjorn
full_name: Tackmann, Bjorn
last_name: Tackmann
citation:
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'
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'
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.'
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.'
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.'
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.'
short: G. Demay, P. Gazi, U. Maurer, B. Tackmann, Journal of Computer Security 27
(2019) 75–111.
date_created: 2019-01-27T22:59:10Z
date_published: 2019-01-01T00:00:00Z
date_updated: 2021-01-12T08:05:08Z
day: '1'
department:
- _id: KrPi
doi: 10.3233/JCS-181131
ec_funded: 1
intvolume: ' 27'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2016/166
month: '01'
oa: 1
oa_version: Preprint
page: 75-111
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: Journal of Computer Security
publication_identifier:
issn:
- 0926227X
publication_status: published
publisher: IOS Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Per-session security: Password-based cryptography revisited'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 27
year: '2019'
...
---
_id: '6163'
abstract:
- lang: eng
text: We propose a new non-orthogonal basis to express the 3D Euclidean space in
terms of a regular grid. Every grid point, each represented by integer 3-coordinates,
corresponds to rhombic dodecahedron centroid. Rhombic dodecahedron is a space
filling polyhedron which represents the close packing of spheres in 3D space and
the Voronoi structures of the face centered cubic (FCC) lattice. In order to illustrate
the interest of the new coordinate system, we propose the characterization of
3D digital plane with its topological features, such as the interrelation between
the thickness of the digital plane and the separability constraint we aim to obtain.
A characterization of a 3D digital sphere with relevant topological features is
proposed as well with the help of a 48 symmetry that comes with the new coordinate
system.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Ranita
full_name: Biswas, Ranita
id: 3C2B033E-F248-11E8-B48F-1D18A9856A87
last_name: Biswas
orcid: 0000-0002-5372-7890
- first_name: Gaëlle
full_name: Largeteau-Skapin, Gaëlle
last_name: Largeteau-Skapin
- first_name: Rita
full_name: Zrour, Rita
last_name: Zrour
- first_name: Eric
full_name: Andres, Eric
last_name: Andres
citation:
ama: 'Biswas R, Largeteau-Skapin G, Zrour R, Andres E. Rhombic dodecahedron grid—coordinate
system and 3D digital object definitions. In: 21st IAPR International Conference
on Discrete Geometry for Computer Imagery. Vol 11414. Berlin, Heidelberg:
Springer Berlin Heidelberg; 2019:27-37. doi:10.1007/978-3-030-14085-4_3'
apa: 'Biswas, R., Largeteau-Skapin, G., Zrour, R., & Andres, E. (2019). Rhombic
dodecahedron grid—coordinate system and 3D digital object definitions. In 21st
IAPR International Conference on Discrete Geometry for Computer Imagery (Vol.
11414, pp. 27–37). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-030-14085-4_3'
chicago: 'Biswas, Ranita, Gaëlle Largeteau-Skapin, Rita Zrour, and Eric Andres.
“Rhombic Dodecahedron Grid—Coordinate System and 3D Digital Object Definitions.”
In 21st IAPR International Conference on Discrete Geometry for Computer Imagery,
11414:27–37. Berlin, Heidelberg: Springer Berlin Heidelberg, 2019. https://doi.org/10.1007/978-3-030-14085-4_3.'
ieee: R. Biswas, G. Largeteau-Skapin, R. Zrour, and E. Andres, “Rhombic dodecahedron
grid—coordinate system and 3D digital object definitions,” in 21st IAPR International
Conference on Discrete Geometry for Computer Imagery, Marne-la-Vallée, France,
2019, vol. 11414, pp. 27–37.
ista: 'Biswas R, Largeteau-Skapin G, Zrour R, Andres E. 2019. Rhombic dodecahedron
grid—coordinate system and 3D digital object definitions. 21st IAPR International
Conference on Discrete Geometry for Computer Imagery. DGCI: International Conference
on Discrete Geometry for Computer Imagery, LNCS, vol. 11414, 27–37.'
mla: Biswas, Ranita, et al. “Rhombic Dodecahedron Grid—Coordinate System and 3D
Digital Object Definitions.” 21st IAPR International Conference on Discrete
Geometry for Computer Imagery, vol. 11414, Springer Berlin Heidelberg, 2019,
pp. 27–37, doi:10.1007/978-3-030-14085-4_3.
short: R. Biswas, G. Largeteau-Skapin, R. Zrour, E. Andres, in:, 21st IAPR International
Conference on Discrete Geometry for Computer Imagery, Springer Berlin Heidelberg,
Berlin, Heidelberg, 2019, pp. 27–37.
conference:
end_date: 2019-03-28
location: Marne-la-Vallée, France
name: 'DGCI: International Conference on Discrete Geometry for Computer Imagery'
start_date: 2019-03-26
date_created: 2019-03-21T12:12:19Z
date_published: 2019-02-23T00:00:00Z
date_updated: 2022-01-27T14:25:17Z
day: '23'
doi: 10.1007/978-3-030-14085-4_3
extern: '1'
intvolume: ' 11414'
language:
- iso: eng
month: '02'
oa_version: None
page: 27-37
place: Berlin, Heidelberg
publication: 21st IAPR International Conference on Discrete Geometry for Computer
Imagery
publication_identifier:
isbn:
- 978-3-6624-6446-5
- 978-3-6624-6447-2
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
quality_controlled: '1'
status: public
title: Rhombic dodecahedron grid—coordinate system and 3D digital object definitions
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 11414
year: '2019'
...
---
_id: '6515'
abstract:
- lang: eng
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.
author:
- first_name: Ramsay
full_name: Dyer, Ramsay
last_name: Dyer
- first_name: Gert
full_name: Vegter, Gert
last_name: Vegter
- first_name: Mathijs
full_name: Wintraecken, Mathijs
id: 307CFBC8-F248-11E8-B48F-1D18A9856A87
last_name: Wintraecken
orcid: 0000-0002-7472-2220
citation:
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
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
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.
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.
ista: Dyer R, Vegter G, Wintraecken M. 2019. Simplices modelled on spaces of constant
curvature. Journal of Computational Geometry . 10(1), 223–256.
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.
short: R. Dyer, G. Vegter, M. Wintraecken, Journal of Computational Geometry 10
(2019) 223–256.
date_created: 2019-06-03T09:35:33Z
date_published: 2019-07-01T00:00:00Z
date_updated: 2021-01-12T08:07:50Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.20382/jocg.v10i1a9
ec_funded: 1
file:
- access_level: open_access
checksum: 57b4df2f16a74eb499734ec8ee240178
content_type: application/pdf
creator: mwintrae
date_created: 2019-06-03T09:30:01Z
date_updated: 2020-07-14T12:47:32Z
file_id: '6516'
file_name: mainJournalFinal.pdf
file_size: 2170882
relation: main_file
file_date_updated: 2020-07-14T12:47:32Z
has_accepted_license: '1'
intvolume: ' 10'
issue: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 223–256
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: 'Journal of Computational Geometry '
publication_identifier:
issn:
- 1920-180X
publication_status: published
publisher: Carleton University
quality_controlled: '1'
scopus_import: 1
status: public
title: Simplices modelled on spaces of constant curvature
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 10
year: '2019'
...
---
_id: '6528'
abstract:
- lang: eng
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.
alternative_title:
- LIPIcs
article_number: '60'
article_processing_charge: No
author:
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
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'
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'
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.
ieee: K. Z. Pietrzak, “Simple verifiable delay functions,” in 10th Innovations
in Theoretical Computer Science Conference, San Diego, CA, United States,
2019, vol. 124.
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.'
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.
short: K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
conference:
end_date: 2019-01-12
location: San Diego, CA, United States
name: 'ITCS 2019: Innovations in Theoretical Computer Science'
start_date: 2019-01-10
date_created: 2019-06-06T14:12:36Z
date_published: 2019-01-10T00:00:00Z
date_updated: 2021-01-12T08:07:53Z
day: '10'
ddc:
- '000'
department:
- _id: KrPi
doi: 10.4230/LIPICS.ITCS.2019.60
ec_funded: 1
file:
- access_level: open_access
checksum: f0ae1bb161431d9db3dea5ace082bfb5
content_type: application/pdf
creator: dernst
date_created: 2019-06-06T14:22:04Z
date_updated: 2020-07-14T12:47:33Z
file_id: '6529'
file_name: 2019_LIPIcs_Pietrzak.pdf
file_size: 558770
relation: main_file
file_date_updated: 2020-07-14T12:47:33Z
has_accepted_license: '1'
intvolume: ' 124'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2018/627
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: 10th Innovations in Theoretical Computer Science Conference
publication_identifier:
isbn:
- 978-3-95977-095-8
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: 1
status: public
title: Simple verifiable delay functions
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 124
year: '2019'
...
---
_id: '6565'
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.
article_number: '8715598'
article_processing_charge: No
author:
- first_name: Atreyee
full_name: Kundu, Atreyee
last_name: Kundu
- first_name: Miriam
full_name: Garcia Soto, Miriam
id: 4B3207F6-F248-11E8-B48F-1D18A9856A87
last_name: Garcia Soto
orcid: 0000−0003−2936−5719
- first_name: Pavithra
full_name: Prabhakar, Pavithra
last_name: Prabhakar
citation:
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'
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'
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.
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.
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.
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.
short: A. Kundu, M. Garcia Soto, P. Prabhakar, in:, 5th Indian Control Conference
Proceedings, IEEE, 2019.
conference:
end_date: 2019-01-11
location: Delhi, India
name: ICC 2019 - Indian Control Conference
start_date: 2019-01-09
date_created: 2019-06-17T06:57:33Z
date_published: 2019-05-16T00:00:00Z
date_updated: 2021-01-12T08:08:01Z
day: '16'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1109/INDIANCC.2019.8715598
file:
- access_level: open_access
checksum: d622a91af1e427f6b1e0ba8e18a2b767
content_type: application/pdf
creator: dernst
date_created: 2020-10-21T13:13:49Z
date_updated: 2020-10-21T13:13:49Z
file_id: '8687'
file_name: 2019_ICC_Kundu.pdf
file_size: 396031
relation: main_file
success: 1
file_date_updated: 2020-10-21T13:13:49Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: 5th Indian Control Conference Proceedings
publication_identifier:
isbn:
- 978-153866246-5
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Formal synthesis of stabilizing controllers for periodically controlled linear
switched systems
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '6628'
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.
author:
- first_name: Gert
full_name: Vegter, Gert
last_name: Vegter
- first_name: Mathijs
full_name: Wintraecken, Mathijs
id: 307CFBC8-F248-11E8-B48F-1D18A9856A87
last_name: Wintraecken
orcid: 0000-0002-7472-2220
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.
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.
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.
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.'
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.
short: G. Vegter, M. Wintraecken, in:, The 31st Canadian Conference in Computational
Geometry, 2019, pp. 275–279.
conference:
end_date: 2019-08-10
location: Edmonton, Canada
name: 'CCCG: Canadian Conference in Computational Geometry'
start_date: 2019-08-08
date_created: 2019-07-12T08:34:57Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2021-01-12T08:08:16Z
day: '01'
ddc:
- '004'
department:
- _id: HeEd
ec_funded: 1
file:
- access_level: open_access
checksum: ceabd152cfa55170d57763f9c6c60a53
content_type: application/pdf
creator: mwintrae
date_created: 2019-07-12T08:32:46Z
date_updated: 2020-07-14T12:47:34Z
file_id: '6629'
file_name: IntrinsicExtrinsicCCCG2019.pdf
file_size: 321176
relation: main_file
file_date_updated: 2020-07-14T12:47:34Z
has_accepted_license: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
page: 275-279
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: The 31st Canadian Conference in Computational Geometry
publication_status: published
quality_controlled: '1'
scopus_import: 1
status: public
title: The extrinsic nature of the Hausdorff distance of optimal triangulations of
manifolds
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '6648'
abstract:
- lang: eng
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."
alternative_title:
- LIPIcs
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Ziga
full_name: Virk, Ziga
last_name: Virk
- first_name: Hubert
full_name: Wagner, Hubert
id: 379CA8B8-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
citation:
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'
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'
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.
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.
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.'
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.
conference:
end_date: 2019-06-21
location: Portland, OR, United States
name: 'SoCG 2019: Symposium on Computational Geometry'
start_date: 2019-06-18
date_created: 2019-07-17T10:36:09Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2021-01-12T08:08:23Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.4230/LIPICS.SOCG.2019.31
external_id:
arxiv:
- '1903.08510'
file:
- access_level: open_access
checksum: 8ec8720730d4c789bf7b06540f1c29f4
content_type: application/pdf
creator: dernst
date_created: 2019-07-24T06:40:01Z
date_updated: 2020-07-14T12:47:35Z
file_id: '6666'
file_name: 2019_LIPICS_Edelsbrunner.pdf
file_size: 1355179
relation: main_file
file_date_updated: 2020-07-14T12:47:35Z
has_accepted_license: '1'
intvolume: ' 129'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 31:1-31:14
project:
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I02979-N35
name: Persistence and stability of geometric complexes
publication: 35th International Symposium on Computational Geometry
publication_identifier:
isbn:
- '9783959771047'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: 1
status: public
title: Topological data analysis in information space
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 129
year: '2019'
...
---
_id: '6659'
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.
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.
article_processing_charge: No
article_type: original
author:
- first_name: Naoki
full_name: Zenmyo, Naoki
last_name: Zenmyo
- first_name: Hiroki
full_name: Tokumaru, Hiroki
last_name: Tokumaru
- first_name: Shohei
full_name: Uchinomiya, Shohei
last_name: Uchinomiya
- first_name: Hirokazu
full_name: Fuchida, Hirokazu
last_name: Fuchida
- first_name: Shigekazu
full_name: Tabata, Shigekazu
id: 4427179E-F248-11E8-B48F-1D18A9856A87
last_name: Tabata
- first_name: Itaru
full_name: Hamachi, Itaru
last_name: Hamachi
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Akio
full_name: Ojida, Akio
last_name: Ojida
citation:
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
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
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.
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.
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.
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.
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.
date_created: 2019-07-21T21:59:16Z
date_published: 2019-05-15T00:00:00Z
date_updated: 2021-01-12T08:08:26Z
day: '15'
ddc:
- '570'
department:
- _id: RySh
doi: 10.1246/bcsj.20190034
ec_funded: 1
file:
- access_level: open_access
checksum: 186de511d6e0ca93f5d981e2443eb8cd
content_type: application/pdf
creator: dernst
date_created: 2020-10-02T08:49:58Z
date_updated: 2020-10-02T08:49:58Z
file_id: '8594'
file_name: 2019_BCSJ_Zenmyo.pdf
file_size: 2464903
relation: main_file
success: 1
file_date_updated: 2020-10-02T08:49:58Z
has_accepted_license: '1'
intvolume: ' 92'
issue: '5'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 995-1000
project:
- _id: 25CA28EA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694539'
name: 'In situ analysis of single channel subunit composition in neurons: physiological
implication in synaptic plasticity and behaviour'
publication: Bulletin of the Chemical Society of Japan
publication_identifier:
issn:
- '00092673'
publication_status: published
publisher: Bulletin of the Chemical Society of Japan
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective
chemical labeling of membrane proteins
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 92
year: '2019'
...
---
_id: '6662'
abstract:
- lang: eng
text: "In phase retrieval, we want to recover an unknown signal \U0001D465∈ℂ\U0001D451
from n quadratic measurements of the form \U0001D466\U0001D456=|⟨\U0001D44E\U0001D456,\U0001D465⟩|2+\U0001D464\U0001D456,
where \U0001D44E\U0001D456∈ℂ\U0001D451 are known sensing vectors and \U0001D464\U0001D456
is measurement noise. We ask the following weak recovery question: What is the
minimum number of measurements n needed to produce an estimator \U0001D465^(\U0001D466)
that is positively correlated with the signal \U0001D465? We consider the case
of Gaussian vectors \U0001D44E\U0001D44E\U0001D456. 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 \U0001D45B≤\U0001D451−\U0001D45C(\U0001D451),
no estimator can do significantly better than random and achieve a strictly positive
correlation. For \U0001D45B≥\U0001D451+\U0001D45C(\U0001D451), 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 \U0001D466\U0001D456 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."
article_type: original
author:
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Andrea
full_name: Montanari, Andrea
last_name: Montanari
citation:
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
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
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.
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.
ista: Mondelli M, Montanari A. 2019. Fundamental limits of weak recovery with applications
to phase retrieval. Foundations of Computational Mathematics. 19(3), 703–773.
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.
short: M. Mondelli, A. Montanari, Foundations of Computational Mathematics 19 (2019)
703–773.
date_created: 2019-07-22T13:23:48Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2021-01-12T08:08:28Z
day: '01'
doi: 10.1007/s10208-018-9395-y
extern: '1'
external_id:
arxiv:
- '1708.05932'
intvolume: ' 19'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1708.05932
month: '06'
oa: 1
oa_version: Preprint
page: 703-773
publication: Foundations of Computational Mathematics
publication_identifier:
eissn:
- 1615-3383
publication_status: published
publisher: Springer
quality_controlled: '1'
status: public
title: Fundamental limits of weak recovery with applications to phase retrieval
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 19
year: '2019'
...
---
_id: '6672'
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.
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
full_name: Wintraecken, Mathijs
id: 307CFBC8-F248-11E8-B48F-1D18A9856A87
last_name: Wintraecken
orcid: 0000-0002-7472-2220
citation:
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
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.
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.
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.
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.
short: J.-D. Boissonnat, M. Rouxel-Labbé, M. Wintraecken, SIAM Journal on Computing
48 (2019) 1046–1097.
date_created: 2019-07-24T08:42:12Z
date_published: 2019-05-21T00:00:00Z
date_updated: 2021-01-12T08:08:30Z
day: '21'
doi: 10.1137/17m1152292
extern: '1'
external_id:
arxiv:
- '1703.06487'
intvolume: ' 48'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1703.06487
month: '05'
oa: 1
oa_version: Preprint
page: 1046-1097
publication: SIAM Journal on Computing
publication_identifier:
eissn:
- 1095-7111
issn:
- 0097-5397
publication_status: published
publisher: Society for Industrial & Applied Mathematics (SIAM)
quality_controlled: '1'
status: public
title: Anisotropic triangulations via discrete Riemannian Voronoi diagrams
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 48
year: '2019'
...
---
_id: '6725'
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."
alternative_title:
- LIPIcs
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
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'
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'
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.
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.
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.
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.
conference:
end_date: 2019-07-12
location: Patras, Greece
name: 'ICALP 2019: International Colloquim on Automata, Languages and Programming'
start_date: 2019-07-08
date_created: 2019-07-29T12:23:29Z
date_published: 2019-07-01T00:00:00Z
date_updated: 2021-01-12T08:08:40Z
day: '01'
ddc:
- '000'
department:
- _id: VlKo
doi: 10.4230/LIPICS.ICALP.2019.77
ec_funded: 1
external_id:
arxiv:
- '1803.02289'
file:
- access_level: open_access
checksum: f5ebee8eec6ae09e30365578ee63a492
content_type: application/pdf
creator: dernst
date_created: 2019-07-31T07:01:45Z
date_updated: 2020-07-14T12:47:38Z
file_id: '6738'
file_name: 2019_LIPICS_Kolmogorov.pdf
file_size: 575475
relation: main_file
file_date_updated: 2020-07-14T12:47:38Z
has_accepted_license: '1'
intvolume: ' 132'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 77:1-77:12
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: 46th International Colloquium on Automata, Languages and Programming
publication_identifier:
isbn:
- 978-3-95977-109-2
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: 1
status: public
title: Testing the complexity of a valued CSP language
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 132
year: '2019'
...
---
_id: '6726'
abstract:
- lang: eng
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.
article_processing_charge: No
author:
- first_name: Michael
full_name: Walter, Michael
id: 488F98B0-F248-11E8-B48F-1D18A9856A87
last_name: Walter
orcid: 0000-0003-3186-2482
citation:
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'
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'
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.'
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.'
ista: 'Walter M. 2019.Sampling the integers with low relative error. In: Progress
in Cryptology – AFRICACRYPT 2019. vol. 11627, 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.
short: M. Walter, in:, J. Buchmann, A. Nitaj, T. Rachidi (Eds.), Progress in Cryptology
– AFRICACRYPT 2019, Springer Nature, Cham, 2019, pp. 157–180.
conference:
end_date: 2019-07-11
location: Rabat, Morocco
name: 'AFRICACRYPT: International Conference on Cryptology in Africa'
start_date: 2019-07-09
date_created: 2019-07-29T12:25:31Z
date_published: 2019-06-29T00:00:00Z
date_updated: 2023-02-23T12:50:15Z
day: '29'
department:
- _id: KrPi
doi: 10.1007/978-3-030-23696-0_9
ec_funded: 1
editor:
- first_name: J
full_name: Buchmann, J
last_name: Buchmann
- first_name: A
full_name: Nitaj, A
last_name: Nitaj
- first_name: T
full_name: Rachidi, T
last_name: Rachidi
intvolume: ' 11627'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2019/068
month: '06'
oa: 1
oa_version: Preprint
page: 157-180
place: Cham
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: Progress in Cryptology – AFRICACRYPT 2019
publication_identifier:
eisbn:
- 978-3-0302-3696-0
isbn:
- 978-3-0302-3695-3
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: LNCS
status: public
title: Sampling the integers with low relative error
type: book_chapter
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 11627
year: '2019'
...
---
_id: '6663'
abstract:
- lang: eng
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.
author:
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Hamed
full_name: Hassani, Hamed
last_name: Hassani
- first_name: Rudiger
full_name: Urbanke, Rudiger
last_name: Urbanke
citation:
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
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.
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.
ista: Mondelli M, Hassani H, Urbanke R. 2019. Construction of polar codes with sublinear
complexity. IEEE. 65(5), 2782–2791.
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.
short: M. Mondelli, H. Hassani, R. Urbanke, IEEE 65 (2019) 2782–2791.
date_created: 2019-07-23T07:32:57Z
date_published: 2019-05-01T00:00:00Z
date_updated: 2023-02-23T12:50:20Z
day: '01'
doi: 10.1109/tit.2018.2889667
extern: '1'
external_id:
arxiv:
- '1612.05295'
intvolume: ' 65'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1612.05295
month: '05'
oa: 1
oa_version: Preprint
page: 2782-2791
publication: IEEE
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '6729'
relation: earlier_version
status: public
status: public
title: Construction of polar codes with sublinear complexity
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 65
year: '2019'
...
---
_id: '6747'
abstract:
- lang: eng
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\U0001D5B3ix),
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 \U0001D53C(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. "
article_processing_charge: No
author:
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Andrea
full_name: Montanari, Andrea
last_name: Montanari
citation:
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.'
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.'
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.
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.
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.
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.
conference:
end_date: 2019-04-18
location: Naha, Okinawa, Japan
name: 'AISTATS: Artificial Intelligence and Statistics'
start_date: 2019-04-16
date_created: 2019-07-31T09:31:26Z
date_published: 2019-04-01T00:00:00Z
date_updated: 2021-01-12T08:08:49Z
day: '01'
extern: '1'
external_id:
arxiv:
- '1802.07301'
intvolume: ' 89'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1802.07301
month: '04'
oa: 1
oa_version: Preprint
page: 1051-1060
publication: Proceedings of the 22nd International Conference on Artificial Intelligence
and Statistics
publication_status: published
publisher: Proceedings of Machine Learning Research
quality_controlled: '1'
status: public
title: On the connection between learning two-layers neural networks and tensor decomposition
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 89
year: '2019'
...
---
_id: '6750'
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. '
article_number: '8854897'
article_processing_charge: No
article_type: original
author:
- first_name: Seyyed Ali
full_name: Hashemi, Seyyed Ali
last_name: Hashemi
- first_name: Carlo
full_name: Condo, Carlo
last_name: Condo
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Warren J
full_name: Gross, Warren J
last_name: Gross
citation:
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
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
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.
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.
ista: Hashemi SA, Condo C, Mondelli M, Gross WJ. 2019. Rate-flexible fast polar
decoders. IEEE Transactions on Signal Processing. 67(22), 8854897.
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.
short: S.A. Hashemi, C. Condo, M. Mondelli, W.J. Gross, IEEE Transactions on Signal
Processing 67 (2019).
date_created: 2019-07-31T09:51:14Z
date_published: 2019-11-15T00:00:00Z
date_updated: 2021-01-12T08:08:51Z
day: '15'
department:
- _id: MaMo
doi: 10.1109/TSP.2019.2944738
external_id:
arxiv:
- '1903.09203'
intvolume: ' 67'
issue: '22'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1903.09203
month: '11'
oa: 1
oa_version: Preprint
publication: IEEE Transactions on Signal Processing
publication_identifier:
issn:
- 1053587X
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: 1
status: public
title: Rate-flexible fast polar decoders
type: journal_article
user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425
volume: 67
year: '2019'
...