---
_id: '11079'
abstract:
- lang: eng
text: Aging is a major risk factor for many human diseases, and in vitro generation
of human neurons is an attractive approach for modeling aging-related brain disorders.
However, modeling aging in differentiated human neurons has proved challenging.
We generated neurons from human donors across a broad range of ages, either by
iPSC-based reprogramming and differentiation or by direct conversion into induced
neurons (iNs). While iPSCs and derived neurons did not retain aging-associated
gene signatures, iNs displayed age-specific transcriptional profiles and revealed
age-associated decreases in the nuclear transport receptor RanBP17. We detected
an age-dependent loss of nucleocytoplasmic compartmentalization (NCC) in donor
fibroblasts and corresponding iNs and found that reduced RanBP17 impaired NCC
in young cells, while iPSC rejuvenation restored NCC in aged cells. These results
show that iNs retain important aging-related signatures, thus allowing modeling
of the aging process in vitro, and they identify impaired NCC as an important
factor in human aging.
article_processing_charge: No
article_type: original
author:
- first_name: Jerome
full_name: Mertens, Jerome
last_name: Mertens
- first_name: Apuã C.M.
full_name: Paquola, Apuã C.M.
last_name: Paquola
- first_name: Manching
full_name: Ku, Manching
last_name: Ku
- first_name: Emily
full_name: Hatch, Emily
last_name: Hatch
- first_name: Lena
full_name: Böhnke, Lena
last_name: Böhnke
- first_name: Shauheen
full_name: Ladjevardi, Shauheen
last_name: Ladjevardi
- first_name: Sean
full_name: McGrath, Sean
last_name: McGrath
- first_name: Benjamin
full_name: Campbell, Benjamin
last_name: Campbell
- first_name: Hyungjun
full_name: Lee, Hyungjun
last_name: Lee
- first_name: Joseph R.
full_name: Herdy, Joseph R.
last_name: Herdy
- first_name: J. Tiago
full_name: Gonçalves, J. Tiago
last_name: Gonçalves
- first_name: Tomohisa
full_name: Toda, Tomohisa
last_name: Toda
- first_name: Yongsung
full_name: Kim, Yongsung
last_name: Kim
- first_name: Jürgen
full_name: Winkler, Jürgen
last_name: Winkler
- first_name: Jun
full_name: Yao, Jun
last_name: Yao
- first_name: Martin W
full_name: HETZER, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: HETZER
orcid: 0000-0002-2111-992X
- first_name: Fred H.
full_name: Gage, Fred H.
last_name: Gage
citation:
ama: Mertens J, Paquola ACM, Ku M, et al. Directly reprogrammed human neurons retain
aging-associated transcriptomic signatures and reveal age-related nucleocytoplasmic
defects. Cell Stem Cell. 2015;17(6):705-718. doi:10.1016/j.stem.2015.09.001
apa: Mertens, J., Paquola, A. C. M., Ku, M., Hatch, E., Böhnke, L., Ladjevardi,
S., … Gage, F. H. (2015). Directly reprogrammed human neurons retain aging-associated
transcriptomic signatures and reveal age-related nucleocytoplasmic defects. Cell
Stem Cell. Elsevier. https://doi.org/10.1016/j.stem.2015.09.001
chicago: Mertens, Jerome, Apuã C.M. Paquola, Manching Ku, Emily Hatch, Lena Böhnke,
Shauheen Ladjevardi, Sean McGrath, et al. “Directly Reprogrammed Human Neurons
Retain Aging-Associated Transcriptomic Signatures and Reveal Age-Related Nucleocytoplasmic
Defects.” Cell Stem Cell. Elsevier, 2015. https://doi.org/10.1016/j.stem.2015.09.001.
ieee: J. Mertens et al., “Directly reprogrammed human neurons retain aging-associated
transcriptomic signatures and reveal age-related nucleocytoplasmic defects,” Cell
Stem Cell, vol. 17, no. 6. Elsevier, pp. 705–718, 2015.
ista: Mertens J, Paquola ACM, Ku M, Hatch E, Böhnke L, Ladjevardi S, McGrath S,
Campbell B, Lee H, Herdy JR, Gonçalves JT, Toda T, Kim Y, Winkler J, Yao J, Hetzer
M, Gage FH. 2015. Directly reprogrammed human neurons retain aging-associated
transcriptomic signatures and reveal age-related nucleocytoplasmic defects. Cell
Stem Cell. 17(6), 705–718.
mla: Mertens, Jerome, et al. “Directly Reprogrammed Human Neurons Retain Aging-Associated
Transcriptomic Signatures and Reveal Age-Related Nucleocytoplasmic Defects.” Cell
Stem Cell, vol. 17, no. 6, Elsevier, 2015, pp. 705–18, doi:10.1016/j.stem.2015.09.001.
short: J. Mertens, A.C.M. Paquola, M. Ku, E. Hatch, L. Böhnke, S. Ladjevardi, S.
McGrath, B. Campbell, H. Lee, J.R. Herdy, J.T. Gonçalves, T. Toda, Y. Kim, J.
Winkler, J. Yao, M. Hetzer, F.H. Gage, Cell Stem Cell 17 (2015) 705–718.
date_created: 2022-04-07T07:49:51Z
date_published: 2015-12-03T00:00:00Z
date_updated: 2022-07-18T08:44:21Z
day: '03'
doi: 10.1016/j.stem.2015.09.001
extern: '1'
external_id:
pmid:
- '26456686'
intvolume: ' 17'
issue: '6'
keyword:
- Cell Biology
- Genetics
- Molecular Medicine
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.stem.2015.09.001
month: '12'
oa: 1
oa_version: Published Version
page: 705-718
pmid: 1
publication: Cell Stem Cell
publication_identifier:
issn:
- 1934-5909
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Directly reprogrammed human neurons retain aging-associated transcriptomic
signatures and reveal age-related nucleocytoplasmic defects
type: journal_article
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 17
year: '2015'
...
---
_id: '11519'
abstract:
- lang: eng
text: 'Faint Lyα emitters become increasingly rarer toward the reionization epoch
(z ∼ 6–7). However, observations from a very large (∼5 deg2) Lyα narrow-band survey
at z = 6.6 show that this is not the case for the most luminous emitters, capable
of ionizing their own local bubbles. Here we present follow-up observations of
the two most luminous Lyα candidates in the COSMOS field: “MASOSA” and “CR7.”
We used X-SHOOTER, SINFONI, and FORS2 on the Very Large Telescope, and DEIMOS
on Keck, to confirm both candidates beyond any doubt. We find redshifts of z =
6.541 and z = 6.604 for “MASOSA” and “CR7,” respectively. MASOSA has a strong
detection in Lyα with a line width of 386 ± 30 km s−1 (FWHM) and with very high
EW0 (>200 Å), but undetected in the continuum, implying very low stellar mass
and a likely young, metal-poor stellar population. “CR7,” with an observed Lyα
luminosity of 1043.92±0.05 erg s−1 is the most luminous Lyα emitter ever found
at z > 6 and is spatially extended (∼16 kpc). “CR7” reveals a narrow Lyα line
with 266 ± 15 km s−1 FWHM, being detected in the near-infrared (NIR) (rest-frame
UV; β = −2.3 ± 0.1) and in IRAC/Spitzer. We detect a narrow He II 1640 Å emission
line (6σ, FWHM = 130 ± 30 km s−1 ) in CR7 which can explain the clear excess seen
in the J-band photometry (EW0 ∼ 80 Å). We find no other emission lines from the
UV to the NIR in our X-SHOOTER spectra (He II/O III] 1663 Å > 3 and He II/C III]
1908 Å > 2.5). We conclude that CR7 is best explained by a combination of a PopIII-like
population, which dominates the rest-frame UV and the nebular emission, and a
more normal stellar population, which presumably dominates the mass. Hubble Space
Telescope/WFC3 observations show that the light is indeed spatially separated
between a very blue component, coincident with Lyα and He II emission, and two
red components (∼5 kpc away), which dominate the mass. Our findings are consistent
with theoretical predictions of a PopIII wave, with PopIII star formation migrating
away from the original sites of star formation.'
acknowledgement: We thank the anonymous reviewer for useful and constructive comments
and suggestions which greatly improved the quality and clarity of our work. D.S.
acknowledges financial support from the Netherlands Organisation for Scientific
research (NWO) through a Veni fellowship, from FCT through a FCT Investigator Starting
Grant and Start-up Grant (IF/01154/2012/CP0189/CT0010), from FCT grant UID/FIS/04434/2013,
and from LSF and LKBF. J.M. acknowledges the award of a Huygens PhD fellowship.
H.R. acknowledges support from the ERC Advanced Investigator program NewClusters
321271. The authors thank Mark Dijkstra, Bhaskar Agarwal, Jarrett Johnson, Andrea
Ferrara, Jarle Brinchmann, Rebecca Bowler, George Becker, Emma Curtis-Lake, Milos
Milosavljevic, Raffaella Schneider, Paul Shapiro, and Erik Zackrisson for interesting,
stimulating and helpful discussions. The authors are extremely grateful to ESO for
the award of ESO DDT time (294.A-5018 and 294.A-5039) which allowed the spectroscopic
confirmation of both sources and the detailed investigation of their nature. Observations
are also based on data from W.M. Keck Observatory. The W.M. Keck Observatory is
operated as a scientific partnership of Caltech, the University of California and
the National Aeronautics and Space Administration. Based on observations obtained
with MegaPrime/Megacam, a joint project of CFHT and CEA/IRFU, at the Canada–France–Hawaii
Telescope (CFHT) which is operated by the National Research Council (NRC) of Canada,
the Institut National des Science de lUnivers of the Centre National de la Recherche
Scientifique (CNRS) of France, and the University 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, 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.
article_processing_charge: No
article_type: original
arxiv: 1
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: Behnam
full_name: Darvish, Behnam
last_name: Darvish
- first_name: Daniel
full_name: Schaerer, Daniel
last_name: Schaerer
- first_name: Bahram
full_name: Mobasher, Bahram
last_name: Mobasher
- first_name: Huub
full_name: Röttgering, Huub
last_name: Röttgering
- first_name: Sérgio
full_name: Santos, Sérgio
last_name: Santos
- first_name: Shoubaneh
full_name: Hemmati, Shoubaneh
last_name: Hemmati
citation:
ama: 'Sobral D, Matthee JJ, Darvish B, et al. Evidence for PopIII-like stellar populations
in the most luminous Lyα emitters at the epoch of reionisation: Spectroscopic
confirmation. The Astrophysical Journal. 2015;808(2):139. doi:10.1088/0004-637X/808/2/139'
apa: 'Sobral, D., Matthee, J. J., Darvish, B., Schaerer, D., Mobasher, B., Röttgering,
H., … Hemmati, S. (2015). Evidence for PopIII-like stellar populations in the
most luminous Lyα emitters at the epoch of reionisation: Spectroscopic confirmation.
The Astrophysical Journal. IOP Publishing. https://doi.org/10.1088/0004-637X/808/2/139'
chicago: 'Sobral, David, Jorryt J Matthee, Behnam Darvish, Daniel Schaerer, Bahram
Mobasher, Huub Röttgering, Sérgio Santos, and Shoubaneh Hemmati. “Evidence for
PopIII-like Stellar Populations in the Most Luminous Lyα Emitters at the Epoch
of Reionisation: Spectroscopic Confirmation.” The Astrophysical Journal.
IOP Publishing, 2015. https://doi.org/10.1088/0004-637X/808/2/139.'
ieee: 'D. Sobral et al., “Evidence for PopIII-like stellar populations in
the most luminous Lyα emitters at the epoch of reionisation: Spectroscopic confirmation,”
The Astrophysical Journal, vol. 808, no. 2. IOP Publishing, p. 139, 2015.'
ista: 'Sobral D, Matthee JJ, Darvish B, Schaerer D, Mobasher B, Röttgering H, Santos
S, Hemmati S. 2015. Evidence for PopIII-like stellar populations in the most luminous
Lyα emitters at the epoch of reionisation: Spectroscopic confirmation. The Astrophysical
Journal. 808(2), 139.'
mla: 'Sobral, David, et al. “Evidence for PopIII-like Stellar Populations in the
Most Luminous Lyα Emitters at the Epoch of Reionisation: Spectroscopic Confirmation.”
The Astrophysical Journal, vol. 808, no. 2, IOP Publishing, 2015, p. 139,
doi:10.1088/0004-637X/808/2/139.'
short: D. Sobral, J.J. Matthee, B. Darvish, D. Schaerer, B. Mobasher, H. Röttgering,
S. Santos, S. Hemmati, The Astrophysical Journal 808 (2015) 139.
date_created: 2022-07-07T09:00:58Z
date_published: 2015-07-28T00:00:00Z
date_updated: 2022-08-18T10:30:13Z
day: '28'
doi: 10.1088/0004-637X/808/2/139
extern: '1'
external_id:
arxiv:
- '1504.01734'
intvolume: ' 808'
issue: '2'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- dark ages
- reionization
- 'first stars – early universe – galaxies: evolution'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1504.01734
month: '07'
oa: 1
oa_version: Preprint
page: '139'
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: 'Evidence for PopIII-like stellar populations in the most luminous Lyα emitters
at the epoch of reionisation: Spectroscopic confirmation'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 808
year: '2015'
...
---
_id: '11579'
abstract:
- lang: eng
text: CR7 is the brightest z = 6.6 Ly α emitter (LAE) known to date, and spectroscopic
follow-up by Sobral et al. suggests that CR7 might host Population (Pop) III stars.
We examine this interpretation using cosmological hydrodynamical simulations.
Several simulated galaxies show the same ‘Pop III wave’ pattern observed in CR7.
However, to reproduce the extreme CR7 Ly α/He II1640 line luminosities (Lα/HeII)
a top-heavy initial mass function and a massive ( ≳ 107 M⊙) Pop III burst with
age ≲ 2 Myr are required. Assuming that the observed properties of Ly α and He II
emission are typical for Pop III, we predict that in the COSMOS/UDS/SA22 fields,
14 out of the 30 LAEs at z = 6.6 with Lα > 1043.3 erg s−1 should also host Pop
III stars producing an observable LHeII≳1042.7ergs−1. As an alternate explanation,
we explore the possibility that CR7 is instead powered by accretion on to a direct
collapse black hole. Our model predicts Lα, LHeII, and X-ray luminosities that
are in agreement with the observations. In any case, the observed properties of
CR7 indicate that this galaxy is most likely powered by sources formed from pristine
gas. We propose that further X-ray observations can distinguish between the two
above scenarios.
acknowledgement: SS acknowledges support from the Netherlands Organization for Scientific
research (NWO), VENI grant 639.041.233. RS acknowledges support from the European
Research Council under the European Union (FP/2007-2013)/ERC grant agreement no.
306476. DS acknowledges (i) financial support from the NWO through a Veni fellowship
and (ii) funding from FCT through a FCT Investigator Starting Grant and Start-up
Grant (IF/01154/2012/CP0189/CT0010) and from FCT grant PEstOE/FIS/UI2751/2014.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: A.
full_name: Pallottini, A.
last_name: Pallottini
- first_name: A.
full_name: Ferrara, A.
last_name: Ferrara
- first_name: F.
full_name: Pacucci, F.
last_name: Pacucci
- first_name: S.
full_name: Gallerani, S.
last_name: Gallerani
- first_name: S.
full_name: Salvadori, S.
last_name: Salvadori
- first_name: R.
full_name: Schneider, R.
last_name: Schneider
- first_name: D.
full_name: Schaerer, D.
last_name: Schaerer
- first_name: D.
full_name: Sobral, D.
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: 'Pallottini A, Ferrara A, Pacucci F, et al. The brightest Lyα emitter: Pop
III or black hole? Monthly Notices of the Royal Astronomical Society. 2015;453(3):2465-2470.
doi:10.1093/mnras/stv1795'
apa: 'Pallottini, A., Ferrara, A., Pacucci, F., Gallerani, S., Salvadori, S., Schneider,
R., … Matthee, J. J. (2015). The brightest Lyα emitter: Pop III or black hole?
Monthly Notices of the Royal Astronomical Society. Oxford University Press.
https://doi.org/10.1093/mnras/stv1795'
chicago: 'Pallottini, A., A. Ferrara, F. Pacucci, S. Gallerani, S. Salvadori, R.
Schneider, D. Schaerer, D. Sobral, and Jorryt J Matthee. “The Brightest Lyα Emitter:
Pop III or Black Hole?” Monthly Notices of the Royal Astronomical Society.
Oxford University Press, 2015. https://doi.org/10.1093/mnras/stv1795.'
ieee: 'A. Pallottini et al., “The brightest Lyα emitter: Pop III or black
hole?,” Monthly Notices of the Royal Astronomical Society, vol. 453, no.
3. Oxford University Press, pp. 2465–2470, 2015.'
ista: 'Pallottini A, Ferrara A, Pacucci F, Gallerani S, Salvadori S, Schneider R,
Schaerer D, Sobral D, Matthee JJ. 2015. The brightest Lyα emitter: Pop III or
black hole? Monthly Notices of the Royal Astronomical Society. 453(3), 2465–2470.'
mla: 'Pallottini, A., et al. “The Brightest Lyα Emitter: Pop III or Black Hole?”
Monthly Notices of the Royal Astronomical Society, vol. 453, no. 3, Oxford
University Press, 2015, pp. 2465–70, doi:10.1093/mnras/stv1795.'
short: A. Pallottini, A. Ferrara, F. Pacucci, S. Gallerani, S. Salvadori, R. Schneider,
D. Schaerer, D. Sobral, J.J. Matthee, Monthly Notices of the Royal Astronomical
Society 453 (2015) 2465–2470.
date_created: 2022-07-14T08:58:36Z
date_published: 2015-11-01T00:00:00Z
date_updated: 2022-08-19T08:19:23Z
day: '01'
doi: 10.1093/mnras/stv1795
extern: '1'
external_id:
arxiv:
- '1506.07173'
intvolume: ' 453'
issue: '3'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- black hole physics
- 'stars: Population III'
- 'galaxies: high-redshift'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1506.07173
month: '11'
oa: 1
oa_version: Preprint
page: 2465-2470
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 brightest Lyα emitter: Pop III or black hole?'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 453
year: '2015'
...
---
_id: '11580'
abstract:
- lang: eng
text: 'We present results from the largest contiguous narrow-band survey in the
near-infrared. We have used the wide-field infrared camera/Canada–France–Hawaii
Telescope and the lowOH2 filter (1.187 ± 0.005 μm) to survey ≈10 deg2 of contiguous
extragalactic sky in the SA22 field. A total of ∼6000 candidate emission-line
galaxies are found. We use deep ugrizJK data to obtain robust photometric redshifts.
We combine our data with the High-redshift(Z) Emission Line Survey (HiZELS), explore
spectroscopic surveys (VVDS, VIPERS) and obtain our own spectroscopic follow-up
with KMOS, FMOS and MOSFIRE to derive large samples of high-redshift emission-line
selected galaxies: 3471 Hα emitters at z = 0.8, 1343 [O III] + Hβ emitters at
z = 1.4 and 572 [O II] emitters at z = 2.2. We probe comoving volumes of >106
Mpc3 and find significant overdensities, including an 8.5σ (spectroscopically
confirmed) overdensity of Hα emitters at z = 0.81. We derive Hα, [O III] + Hβ
and [O II] luminosity functions at z = 0.8, 1.4, 2.2, respectively, and present
implications for future surveys such as Euclid. Our uniquely large volumes/areas
allow us to subdivide the samples in thousands of randomized combinations of areas
and provide a robust empirical measurement of sample/cosmic variance. We show
that surveys for star-forming/emission-line galaxies at a depth similar to ours
can only overcome cosmic-variance (errors <10 per cent) if they are based on volumes
>5 × 105 Mpc3; errors on L* and ϕ* due to sample (cosmic) variance on surveys
probing ∼104 and ∼105 Mpc3 are typically very high: ∼300 and ∼40–60 per cent,
respectively.'
acknowledgement: The authors wish to thank the anonymous reviewer for many helpful
comments and suggestions which greatly improved the clarity and quality of this
work. DS acknowledges financial support from the Netherlands Organization for Scientific
research (NWO) through a Veni fellowship, from FCT through an FCT Investigator Starting
Grant and Start-up Grant (IF/01154/2012/CP0189/CT0010), from FCT grant PEst-OE/FIS/UI2751/2014,
and from LSF and LKBF. JM acknowledges the award of a Huygens PhD fellowship. PNB
is grateful for support from STFC. IRS acknowledges support from STFC, a Leverhulme
Fellowship, the ERC Advanced Investigator programme DUSTYGAL and a Royal Society/Wolfson
Merit Award. BMJ acknowledges support from the ERC-StG grant EGGS-278202. The Dark
Cosmology Centre is funded by the DNRF. The Dark Cosmology Centre is funded by the
DNRF. JWK acknowledges support from the National Research Foundation of Korea (NRF)
grant, no. 2008-0060544, funded by the Korea government (MSIP). JPS acknowledges
support from STFC (ST/I001573/1). JC acknowledges support from the FCT-IF grant
IF/01154/2012/CP0189/CT0010. The work was only possible due to OPTICON/FP7 and the
invaluable access that it granted to the CFHT telescope. We would also like to acknowledge
the excellent work done by CFHT staff in conducting the observations in service
mode, and on delivering truly excellent data. We are also tremendously thankful
to Kentaro Aoki for the incredible support while observing at Subaru with FMOS,
and also to the Keck staff for the help with the observations with MOSFIRE. This
work is based on observations obtained with WIRCam on the CFHT, OPTICON programme
2011B/029, 2012A019 and 2012B/016. Based on observations made with ESO telescopes
at the La Silla Paranal Observatory under programmes IDs 60.A-9460 (data can be
accessed through the ESO data archive), 087.A 0337 and 089.A-0965. Based on observations
done with FMOS on Subaru under programme S14A-084, and on MOSFIRE/Keck observations
under programme U066M. Part of the data on which this analysis is based are available
from Sobral et al. (2013a). Dedicated to the memory of C. M. Sobral (1953-2014).
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: D.
full_name: Sobral, D.
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: P. N.
full_name: Best, P. N.
last_name: Best
- first_name: I.
full_name: Smail, I.
last_name: Smail
- first_name: A. A.
full_name: Khostovan, A. A.
last_name: Khostovan
- first_name: B.
full_name: Milvang-Jensen, B.
last_name: Milvang-Jensen
- first_name: J.-W.
full_name: Kim, J.-W.
last_name: Kim
- first_name: J.
full_name: Stott, J.
last_name: Stott
- first_name: J.
full_name: Calhau, J.
last_name: Calhau
- first_name: H.
full_name: Nayyeri, H.
last_name: Nayyeri
- first_name: B.
full_name: Mobasher, B.
last_name: Mobasher
citation:
ama: 'Sobral D, Matthee JJ, Best PN, et al. CF-HiZELS, an ∼10 deg2 emission-line
survey with spectroscopic follow-up: Hα, [O III] + Hβ and [O II] luminosity functions
at z = 0.8, 1.4 and 2.2 . Monthly Notices of the Royal Astronomical Society.
2015;451(3):2303-2323. doi:10.1093/mnras/stv1076'
apa: 'Sobral, D., Matthee, J. J., Best, P. N., Smail, I., Khostovan, A. A., Milvang-Jensen,
B., … Mobasher, B. (2015). CF-HiZELS, an ∼10 deg2 emission-line survey with spectroscopic
follow-up: Hα, [O III] + Hβ and [O II] luminosity functions at z = 0.8, 1.4 and
2.2 . Monthly Notices of the Royal Astronomical Society. Oxford University
Press. https://doi.org/10.1093/mnras/stv1076'
chicago: 'Sobral, D., Jorryt J Matthee, P. N. Best, I. Smail, A. A. Khostovan, B.
Milvang-Jensen, J.-W. Kim, et al. “CF-HiZELS, an ∼10 Deg2 Emission-Line Survey
with Spectroscopic Follow-up: Hα, [O III] + Hβ and [O II] Luminosity Functions
at z = 0.8, 1.4 and 2.2 .” Monthly Notices of the Royal Astronomical Society.
Oxford University Press, 2015. https://doi.org/10.1093/mnras/stv1076.'
ieee: 'D. Sobral et al., “CF-HiZELS, an ∼10 deg2 emission-line survey with
spectroscopic follow-up: Hα, [O III] + Hβ and [O II] luminosity functions at z
= 0.8, 1.4 and 2.2 ,” Monthly Notices of the Royal Astronomical Society,
vol. 451, no. 3. Oxford University Press, pp. 2303–2323, 2015.'
ista: 'Sobral D, Matthee JJ, Best PN, Smail I, Khostovan AA, Milvang-Jensen B, Kim
J-W, Stott J, Calhau J, Nayyeri H, Mobasher B. 2015. CF-HiZELS, an ∼10 deg2 emission-line
survey with spectroscopic follow-up: Hα, [O III] + Hβ and [O II] luminosity functions
at z = 0.8, 1.4 and 2.2 . Monthly Notices of the Royal Astronomical Society. 451(3),
2303–2323.'
mla: 'Sobral, D., et al. “CF-HiZELS, an ∼10 Deg2 Emission-Line Survey with Spectroscopic
Follow-up: Hα, [O III] + Hβ and [O II] Luminosity Functions at z = 0.8, 1.4 and
2.2 .” Monthly Notices of the Royal Astronomical Society, vol. 451, no.
3, Oxford University Press, 2015, pp. 2303–23, doi:10.1093/mnras/stv1076.'
short: D. Sobral, J.J. Matthee, P.N. Best, I. Smail, A.A. Khostovan, B. Milvang-Jensen,
J.-W. Kim, J. Stott, J. Calhau, H. Nayyeri, B. Mobasher, Monthly Notices of the
Royal Astronomical Society 451 (2015) 2303–2323.
date_created: 2022-07-14T09:02:22Z
date_published: 2015-08-11T00:00:00Z
date_updated: 2022-08-19T08:23:18Z
day: '11'
doi: 10.1093/mnras/stv1076
extern: '1'
external_id:
arxiv:
- '1502.06602'
intvolume: ' 451'
issue: '3'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- 'galaxies: evolution'
- 'galaxies: formation'
- 'galaxies: luminosity function'
- mass function
- 'cosmology: observations'
- early Universe
- large-scale structure of Universe
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1502.06602
month: '08'
oa: 1
oa_version: Preprint
page: 2303-2323
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: 'CF-HiZELS, an ∼10 deg2 emission-line survey with spectroscopic follow-up:
Hα, [O III] + Hβ and [O II] luminosity functions at z = 0.8, 1.4 and 2.2 '
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 451
year: '2015'
...
---
_id: '11581'
abstract:
- lang: eng
text: Using wide-field narrow-band surveys, we provide a new measurement of the
z = 6.6 Lymanα emitter (LAE) luminosity function (LF), which constraints the bright
end for the first time. We use a combination of archival narrow-band NB921 data
in UDS and new NB921 measurements in SA22 and COSMOS/UltraVISTA, all observed
with the Subaru telescope, with a total area of ∼5 deg2. We exclude lower redshift
interlopers by using broad-band optical and near-infrared photometry and also
exclude three supernovae with data split over multiple epochs. Combining the UDS
and COSMOS samples, we find no evolution of the bright end of the Lyα LF between
z = 5.7 and 6.6, which is supported by spectroscopic follow-up, and conclude that
sources with Himiko-like luminosity are not as rare as previously thought, with
number densities of ∼1.5 × 10−5 Mpc−3. Combined with our wide-field SA22 measurements,
our results indicate a non-Schechter-like bright end of the LF at z = 6.6 and
a different evolution of observed faint and bright LAEs, overcoming cosmic variance.
This differential evolution is also seen in the spectroscopic follow-up of UV-selected
galaxies and is now also confirmed for LAEs, and we argue that it may be an effect
of reionization. Using a toy model, we show that such differential evolution of
the LF is expected, since brighter sources are able to ionize their surroundings
earlier, such that Lyα photons are able to escape. Our targets are excellent candidates
for detailed follow-up studies and provide the possibility to give a unique view
on the earliest stages in the formation of galaxies and reionization process.
acknowledgement: "We thank the anonymous referee for the comments and suggestions
which have improved the quality of this work. We thank Masami Ouchi for his useful
comments on an earlier version of this paper. JM acknowledges the support of a Huygens
PhD fellowship from Leiden University and is thankful for the hospitality of the
Center for Astronomy and Astrophysics of the University of Lisbon where part of
this research has been done. DS acknowledges financial support from the Netherlands
Organization for Scientific research (NWO) through a Veni fellowship, from FCT through
a FCT Investigator Starting Grant and Start-up Grant (IF/01154/2012/CP0189/CT0010)
and from FCT grant PEstOE/FIS/UI2751/2014. HR acknowledges support from the ERC
Advanced Investigator programme NewClusters 321271. We acknowledge the award of
ESO DDT time (294.A-5018) for providing the possibility of a timely publication
of this work.\r\nBased on observations with the Subaru Telescope (Programme IDs:
our observations: S14A-086; archival: S05B-027, S06A-025, S06B-010, S07A-013, S07B-008,
S08B-008 and S09A-017) and the W.M. Keck Observatory. The Subaru telescope is operated
by the National Astronomical Observatory of Japan. The W.M. Keck Observatory is
operated as a scientific partnership among the California Institute of Technology,
the University of California and the National Aeronautics and Space Administration.
Based on observations made with ESO Telescopes at the La Silla Paranal Observatory
under programme ID 294.A-5018. Based on observations obtained with MegaPrime/Megacam,
a joint project of CFHT and CEA/IRFU, at the Canada–France-Hawaii Telescope (CFHT)
which is operated by the National Research Council (NRC) of Canada, the Institut
National des Science de l’Univers of the Centre National de la Recherche Scientifique
(CNRS) of France, and the University 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 CFHT 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 ID 179.A-2005 and on data products produced by TERAPIX
and the Cambridge Astronomy Survey Unit on behalf of the UltraVISTA consortium.\r\nIn
addition to the CFHT-LS and COSMOS-UltraVISTA surveys, we are grateful for the excellent
data sets from the UKIRT-DXS, SXDF and S-COSMOS survey teams, without these legacy
surveys, this research would have been impossible. We have benefited greatly from
the public available programming language PYTHON, including the NUMPY, MATPLOTLIB,
PYFITS, SCIPY and ASTROPY packages, the astronomical imaging tools SEXTRACTOR, SWARP
and SCAMP and the indispensable TOPCAT analysis tool (Taylor 2013)"
article_processing_charge: No
article_type: original
arxiv: 1
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: David
full_name: Sobral, David
last_name: Sobral
- first_name: Sérgio
full_name: Santos, Sérgio
last_name: Santos
- first_name: Huub
full_name: Röttgering, Huub
last_name: Röttgering
- first_name: Behnam
full_name: Darvish, Behnam
last_name: Darvish
- first_name: Bahram
full_name: Mobasher, Bahram
last_name: Mobasher
citation:
ama: 'Matthee JJ, Sobral D, Santos S, Röttgering H, Darvish B, Mobasher B. Identification
of the brightest Lyα emitters at z = 6.6: implications for the evolution of the
luminosity function in the reionization era. Monthly Notices of the Royal Astronomical
Society. 2015;451(1):400-417. doi:10.1093/mnras/stv947'
apa: 'Matthee, J. J., Sobral, D., Santos, S., Röttgering, H., Darvish, B., &
Mobasher, B. (2015). Identification of the brightest Lyα emitters at z = 6.6:
implications for the evolution of the luminosity function in the reionization
era. Monthly Notices of the Royal Astronomical Society. Oxford University
Press. https://doi.org/10.1093/mnras/stv947'
chicago: 'Matthee, Jorryt J, David Sobral, Sérgio Santos, Huub Röttgering, Behnam
Darvish, and Bahram Mobasher. “Identification of the Brightest Lyα Emitters at
z = 6.6: Implications for the Evolution of the Luminosity Function in the Reionization
Era.” Monthly Notices of the Royal Astronomical Society. Oxford University
Press, 2015. https://doi.org/10.1093/mnras/stv947.'
ieee: 'J. J. Matthee, D. Sobral, S. Santos, H. Röttgering, B. Darvish, and B. Mobasher,
“Identification of the brightest Lyα emitters at z = 6.6: implications for the
evolution of the luminosity function in the reionization era,” Monthly Notices
of the Royal Astronomical Society, vol. 451, no. 1. Oxford University Press,
pp. 400–417, 2015.'
ista: 'Matthee JJ, Sobral D, Santos S, Röttgering H, Darvish B, Mobasher B. 2015.
Identification of the brightest Lyα emitters at z = 6.6: implications for the
evolution of the luminosity function in the reionization era. Monthly Notices
of the Royal Astronomical Society. 451(1), 400–417.'
mla: 'Matthee, Jorryt J., et al. “Identification of the Brightest Lyα Emitters at
z = 6.6: Implications for the Evolution of the Luminosity Function in the Reionization
Era.” Monthly Notices of the Royal Astronomical Society, vol. 451, no.
1, Oxford University Press, 2015, pp. 400–17, doi:10.1093/mnras/stv947.'
short: J.J. Matthee, D. Sobral, S. Santos, H. Röttgering, B. Darvish, B. Mobasher,
Monthly Notices of the Royal Astronomical Society 451 (2015) 400–417.
date_created: 2022-07-14T11:57:03Z
date_published: 2015-07-21T00:00:00Z
date_updated: 2022-08-19T08:25:25Z
day: '21'
doi: 10.1093/mnras/stv947
extern: '1'
external_id:
arxiv:
- '1502.07355'
intvolume: ' 451'
issue: '1'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1502.07355
month: '07'
oa: 1
oa_version: Preprint
page: 400-417
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: 'Identification of the brightest Lyα emitters at z = 6.6: implications for
the evolution of the luminosity function in the reionization era'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 451
year: '2015'
...
---
_id: '11668'
abstract:
- lang: eng
text: "We study multiple keyword sponsored search auctions with budgets. Each keyword
has multiple ad slots with a click-through rate. The bidders have additive valuations,
which are linear in the click-through rates, and budgets, which are restricting
their overall payments. Additionally, the number of slots per keyword assigned
to a bidder is bounded.\r\n\r\nWe show the following results: (1) We give the
first mechanism for multiple keywords, where click-through rates differ among
slots. Our mechanism is incentive compatible in expectation, individually rational
in expectation, and Pareto optimal. (2) We study the combinatorial setting, where
each bidder is only interested in a subset of the keywords. We give an incentive
compatible, individually rational, Pareto-optimal, and deterministic mechanism
for identical click-through rates. (3) We give an impossibility result for incentive
compatible, individually rational, Pareto-optimal, and deterministic mechanisms
for bidders with diminishing marginal valuations."
article_number: '2'
article_processing_charge: No
article_type: original
author:
- first_name: Riccardo
full_name: Colini-Baldeschi, Riccardo
last_name: Colini-Baldeschi
- first_name: Stefano
full_name: Leonardi, Stefano
last_name: Leonardi
- 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: Martin
full_name: Starnberger, Martin
last_name: Starnberger
citation:
ama: Colini-Baldeschi R, Leonardi S, Henzinger MH, Starnberger M. On multiple keyword
sponsored search auctions with budgets. ACM Transactions on Economics and Computation.
2015;4(1). doi:10.1145/2818357
apa: Colini-Baldeschi, R., Leonardi, S., Henzinger, M. H., & Starnberger, M.
(2015). On multiple keyword sponsored search auctions with budgets. ACM Transactions
on Economics and Computation. Association for Computing Machinery. https://doi.org/10.1145/2818357
chicago: Colini-Baldeschi, Riccardo, Stefano Leonardi, Monika H Henzinger, and Martin
Starnberger. “On Multiple Keyword Sponsored Search Auctions with Budgets.” ACM
Transactions on Economics and Computation. Association for Computing Machinery,
2015. https://doi.org/10.1145/2818357.
ieee: R. Colini-Baldeschi, S. Leonardi, M. H. Henzinger, and M. Starnberger, “On
multiple keyword sponsored search auctions with budgets,” ACM Transactions
on Economics and Computation, vol. 4, no. 1. Association for Computing Machinery,
2015.
ista: Colini-Baldeschi R, Leonardi S, Henzinger MH, Starnberger M. 2015. On multiple
keyword sponsored search auctions with budgets. ACM Transactions on Economics
and Computation. 4(1), 2.
mla: Colini-Baldeschi, Riccardo, et al. “On Multiple Keyword Sponsored Search Auctions
with Budgets.” ACM Transactions on Economics and Computation, vol. 4, no.
1, 2, Association for Computing Machinery, 2015, doi:10.1145/2818357.
short: R. Colini-Baldeschi, S. Leonardi, M.H. Henzinger, M. Starnberger, ACM Transactions
on Economics and Computation 4 (2015).
date_created: 2022-07-27T11:54:56Z
date_published: 2015-12-05T00:00:00Z
date_updated: 2023-02-09T10:03:35Z
day: '05'
doi: 10.1145/2818357
extern: '1'
intvolume: ' 4'
issue: '1'
keyword:
- Algorithms
- Economics
- Clinching ascending auction
- auctions with budgets
- Sponsored search auctions
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://eprints.cs.univie.ac.at/3510/
month: '12'
oa: 1
oa_version: Submitted Version
publication: ACM Transactions on Economics and Computation
publication_identifier:
eissn:
- 2167-8383
issn:
- 2167-8375
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: On multiple keyword sponsored search auctions with budgets
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2015'
...
---
_id: '11669'
abstract:
- lang: eng
text: We study individual rational, Pareto-optimal, and incentive compatible mechanisms
for auctions with heterogeneous items and budget limits. We consider settings
with multiunit demand and additive valuations. For single-dimensional valuations
we prove a positive result for randomized mechanisms, and a negative result for
deterministic mechanisms. While the positive result allows for private budgets,
the negative result is for public budgets. For multidimensional valuations and
public budgets we prove an impossibility result that applies to deterministic
and randomized mechanisms. Taken together this shows the power of randomization
in certain settings with heterogeneous items, but it also shows its limitations.
article_number: '4'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Paul
full_name: Dütting, Paul
last_name: Dütting
- 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: Martin
full_name: Starnberger, Martin
last_name: Starnberger
citation:
ama: Dütting P, Henzinger MH, Starnberger M. Auctions for heterogeneous items and
budget limits. ACM Transactions on Economics and Computation. 2015;4(1).
doi:10.1145/2818351
apa: Dütting, P., Henzinger, M. H., & Starnberger, M. (2015). Auctions for heterogeneous
items and budget limits. ACM Transactions on Economics and Computation.
Association for Computing Machinery. https://doi.org/10.1145/2818351
chicago: Dütting, Paul, Monika H Henzinger, and Martin Starnberger. “Auctions for
Heterogeneous Items and Budget Limits.” ACM Transactions on Economics and Computation.
Association for Computing Machinery, 2015. https://doi.org/10.1145/2818351.
ieee: P. Dütting, M. H. Henzinger, and M. Starnberger, “Auctions for heterogeneous
items and budget limits,” ACM Transactions on Economics and Computation,
vol. 4, no. 1. Association for Computing Machinery, 2015.
ista: Dütting P, Henzinger MH, Starnberger M. 2015. Auctions for heterogeneous items
and budget limits. ACM Transactions on Economics and Computation. 4(1), 4.
mla: Dütting, Paul, et al. “Auctions for Heterogeneous Items and Budget Limits.”
ACM Transactions on Economics and Computation, vol. 4, no. 1, 4, Association
for Computing Machinery, 2015, doi:10.1145/2818351.
short: P. Dütting, M.H. Henzinger, M. Starnberger, ACM Transactions on Economics
and Computation 4 (2015).
date_created: 2022-07-27T12:09:15Z
date_published: 2015-12-05T00:00:00Z
date_updated: 2022-09-09T12:08:37Z
day: '05'
doi: 10.1145/2818351
extern: '1'
external_id:
arxiv:
- '1209.6448'
intvolume: ' 4'
issue: '1'
keyword:
- Algorithmic game theory
- auction theory
- Clinching auction
- Pareto optimality
- Budget limits
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1209.6448
month: '12'
oa: 1
oa_version: Preprint
publication: ACM Transactions on Economics and Computation
publication_identifier:
eissn:
- 2167-8383
issn:
- 2167-8375
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Auctions for heterogeneous items and budget limits
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2015'
...
---
_id: '11773'
abstract:
- lang: eng
text: "Ad exchanges are an emerging platform for trading advertisement slots on
the web with billions of dollars revenue per year. Every time a user visits a
web page, the publisher of that web page can ask an ad exchange to auction off
the ad slots on this page to determine which advertisements are shown at which
price. Due to the high volume of traffic, ad networks typically act as mediators
for individual advertisers at ad exchanges. If multiple advertisers in an ad network
are interested in the ad slots of the same auction, the ad network might use a
“local” auction to resell the obtained ad slots among its advertisers.\r\n\r\nIn
this work we want to deepen the theoretical understanding of these new markets
by analyzing them from the viewpoint of combinatorial auctions. Prior work studied
mostly single-item auctions, while we allow the advertisers to express richer
preferences over multiple items. We develop a game-theoretic model for the entanglement
of the central auction at the ad exchange with the local auctions at the ad networks.
We consider the incentives of all three involved parties and suggest a three-party
competitive equilibrium, an extension of the Walrasian equilibrium that ensures
envy-freeness for all participants. We show the existence of a three-party competitive
equilibrium and a polynomial-time algorithm to find one for gross-substitute bidder
valuations."
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Oren
full_name: Ben-Zwi, Oren
last_name: Ben-Zwi
- 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: Veronika
full_name: Loitzenbauer, Veronika
last_name: Loitzenbauer
citation:
ama: 'Ben-Zwi O, Henzinger MH, Loitzenbauer V. Ad exchange: Envy-free auctions with
mediators. In: 11th International Conference on Web and Internet Economics.
Vol 9470. Springer Nature; 2015:104–117. doi:10.1007/978-3-662-48995-6_8'
apa: 'Ben-Zwi, O., Henzinger, M. H., & Loitzenbauer, V. (2015). Ad exchange:
Envy-free auctions with mediators. In 11th International Conference on Web
and Internet Economics (Vol. 9470, pp. 104–117). Amsterdam, Netherlands: Springer
Nature. https://doi.org/10.1007/978-3-662-48995-6_8'
chicago: 'Ben-Zwi, Oren, Monika H Henzinger, and Veronika Loitzenbauer. “Ad Exchange:
Envy-Free Auctions with Mediators.” In 11th International Conference on Web
and Internet Economics, 9470:104–117. Springer Nature, 2015. https://doi.org/10.1007/978-3-662-48995-6_8.'
ieee: 'O. Ben-Zwi, M. H. Henzinger, and V. Loitzenbauer, “Ad exchange: Envy-free
auctions with mediators,” in 11th International Conference on Web and Internet
Economics, Amsterdam, Netherlands, 2015, vol. 9470, pp. 104–117.'
ista: 'Ben-Zwi O, Henzinger MH, Loitzenbauer V. 2015. Ad exchange: Envy-free auctions
with mediators. 11th International Conference on Web and Internet Economics. WINE:
International Conference on Web and Internet Economics, LNCS, vol. 9470, 104–117.'
mla: 'Ben-Zwi, Oren, et al. “Ad Exchange: Envy-Free Auctions with Mediators.” 11th
International Conference on Web and Internet Economics, vol. 9470, Springer
Nature, 2015, pp. 104–117, doi:10.1007/978-3-662-48995-6_8.'
short: O. Ben-Zwi, M.H. Henzinger, V. Loitzenbauer, in:, 11th International Conference
on Web and Internet Economics, Springer Nature, 2015, pp. 104–117.
conference:
end_date: 2015-09-12
location: Amsterdam, Netherlands
name: 'WINE: International Conference on Web and Internet Economics'
start_date: 2015-09-09
date_created: 2022-08-08T13:33:56Z
date_published: 2015-12-09T00:00:00Z
date_updated: 2023-02-10T09:06:23Z
day: '09'
doi: 10.1007/978-3-662-48995-6_8
extern: '1'
external_id:
arxiv:
- '1604.05562'
intvolume: ' 9470'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1604.05562
month: '12'
oa: 1
oa_version: Preprint
page: 104–117
publication: 11th International Conference on Web and Internet Economics
publication_identifier:
eisbn:
- '9783662489956'
isbn:
- '9783662489949'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Ad exchange: Envy-free auctions with mediators'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9470
year: '2015'
...
---
_id: '11774'
abstract:
- lang: eng
text: "Combinatorial auctions (CA) are a well-studied area in algorithmic mechanism
design. However, contrary to the standard model, empirical studies suggest that
a bidder’s valuation often does not depend solely on the goods assigned to him.
For instance, in adwords auctions an advertiser might not want his ads to be displayed
next to his competitors’ ads. In this paper, we propose and analyze several natural
graph-theoretic models that incorporate such negative externalities, in which
bidders form a directed conflict graph with maximum out-degree Δ. We design algorithms
and truthful mechanisms for social welfare maximization that attain approximation
ratios depending on Δ.\r\n\r\nFor CA, our results are twofold: (1) A lottery that
eliminates conflicts by discarding bidders/items independent of the bids. It allows
to apply any truthful \U0001D6FC-approximation mechanism for conflict-free valuations
and yields an \U0001D4AA(\U0001D6FCΔ)-approximation mechanism. (2) For fractionally
sub-additive valuations, we design a rounding algorithm via a novel combination
of a semi-definite program and a linear program, resulting in a cone program;
the approximation ratio is \U0001D4AA((ΔloglogΔ)/logΔ). The ratios are almost
optimal given existing hardness results.\r\n\r\nFor adwords auctions, we present
several algorithms for the most relevant scenario when the number of items is
small. In particular, we design a truthful mechanism with approximation ratio
\U0001D45C(Δ) when the number of items is only logarithmic in the number of bidders."
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Yun Kuen
full_name: Cheung, Yun Kuen
last_name: Cheung
- 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: Martin
full_name: Hoefer, Martin
last_name: Hoefer
- first_name: Martin
full_name: Starnberger, Martin
last_name: Starnberger
citation:
ama: 'Cheung YK, Henzinger MH, Hoefer M, Starnberger M. Combinatorial auctions with
conflict-based externalities. In: 11th International Conference on Web and
Internet Economics. Vol 9470. Springer Nature; 2015:230–243. doi:10.1007/978-3-662-48995-6_17'
apa: 'Cheung, Y. K., Henzinger, M. H., Hoefer, M., & Starnberger, M. (2015).
Combinatorial auctions with conflict-based externalities. In 11th International
Conference on Web and Internet Economics (Vol. 9470, pp. 230–243). Amsterdam,
Netherlands: Springer Nature. https://doi.org/10.1007/978-3-662-48995-6_17'
chicago: Cheung, Yun Kuen, Monika H Henzinger, Martin Hoefer, and Martin Starnberger.
“Combinatorial Auctions with Conflict-Based Externalities.” In 11th International
Conference on Web and Internet Economics, 9470:230–243. Springer Nature, 2015.
https://doi.org/10.1007/978-3-662-48995-6_17.
ieee: Y. K. Cheung, M. H. Henzinger, M. Hoefer, and M. Starnberger, “Combinatorial
auctions with conflict-based externalities,” in 11th International Conference
on Web and Internet Economics, Amsterdam, Netherlands, 2015, vol. 9470, pp.
230–243.
ista: 'Cheung YK, Henzinger MH, Hoefer M, Starnberger M. 2015. Combinatorial auctions
with conflict-based externalities. 11th International Conference on Web and Internet
Economics. WINE: International Conference on Web and Internet Economics, LNCS,
vol. 9470, 230–243.'
mla: Cheung, Yun Kuen, et al. “Combinatorial Auctions with Conflict-Based Externalities.”
11th International Conference on Web and Internet Economics, vol. 9470,
Springer Nature, 2015, pp. 230–243, doi:10.1007/978-3-662-48995-6_17.
short: Y.K. Cheung, M.H. Henzinger, M. Hoefer, M. Starnberger, in:, 11th International
Conference on Web and Internet Economics, Springer Nature, 2015, pp. 230–243.
conference:
end_date: 2015-12-12
location: Amsterdam, Netherlands
name: 'WINE: International Conference on Web and Internet Economics'
start_date: 2015-12-09
date_created: 2022-08-08T13:54:32Z
date_published: 2015-12-09T00:00:00Z
date_updated: 2023-02-10T09:08:30Z
day: '09'
doi: 10.1007/978-3-662-48995-6_17
extern: '1'
external_id:
arxiv:
- '1509.09147'
intvolume: ' 9470'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1509.09147
month: '12'
oa: 1
oa_version: Preprint
page: 230–243
publication: 11th International Conference on Web and Internet Economics
publication_identifier:
eisbn:
- '9783662489956'
isbn:
- '9783662489949'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Combinatorial auctions with conflict-based externalities
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9470
year: '2015'
...
---
_id: '11785'
abstract:
- lang: eng
text: "Recently we presented the first algorithm for maintaining the set of nodes
reachable from a source node in a directed graph that is modified by edge deletions
with \U0001D45C(\U0001D45A\U0001D45B) total update time, where \U0001D45A is the
number of edges and \U0001D45B is the number of nodes in the graph [Henzinger
et al. STOC 2014]. The algorithm is a combination of several different algorithms,
each for a different \U0001D45A vs. \U0001D45B trade-off. For the case of \U0001D45A=Θ(\U0001D45B1.5)
the running time is \U0001D442(\U0001D45B2.47), just barely below \U0001D45A\U0001D45B=Θ(\U0001D45B2.5).
In this paper we simplify the previous algorithm using new algorithmic ideas and
achieve an improved running time of \U0001D442̃ (min(\U0001D45A7/6\U0001D45B2/3,\U0001D45A3/4\U0001D45B5/4+\U0001D45C(1),\U0001D45A2/3\U0001D45B4/3+\U0001D45C(1)+\U0001D45A3/7\U0001D45B12/7+\U0001D45C(1))).
This gives, e.g., \U0001D442(\U0001D45B2.36) for the notorious case \U0001D45A=Θ(\U0001D45B1.5).
We obtain the same upper bounds for the problem of maintaining the strongly connected
components of a directed graph undergoing edge deletions. Our algorithms are correct
with high probabililty against an oblivious adversary."
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
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: Sebastian
full_name: Krinninger, Sebastian
last_name: Krinninger
- first_name: Danupon
full_name: Nanongkai, Danupon
last_name: Nanongkai
citation:
ama: 'Henzinger MH, Krinninger S, Nanongkai D. Improved algorithms for decremental
single-source reachability on directed graphs. In: 42nd International Colloquium
on Automata, Languages and Programming. Vol 9134. Springer Nature; 2015:725-736.
doi:10.1007/978-3-662-47672-7_59'
apa: 'Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2015). Improved algorithms
for decremental single-source reachability on directed graphs. In 42nd International
Colloquium on Automata, Languages and Programming (Vol. 9134, pp. 725–736).
Kyoto, Japan: Springer Nature. https://doi.org/10.1007/978-3-662-47672-7_59'
chicago: Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Improved
Algorithms for Decremental Single-Source Reachability on Directed Graphs.” In
42nd International Colloquium on Automata, Languages and Programming, 9134:725–36.
Springer Nature, 2015. https://doi.org/10.1007/978-3-662-47672-7_59.
ieee: M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Improved algorithms for
decremental single-source reachability on directed graphs,” in 42nd International
Colloquium on Automata, Languages and Programming, Kyoto, Japan, 2015, vol.
9134, pp. 725–736.
ista: 'Henzinger MH, Krinninger S, Nanongkai D. 2015. Improved algorithms for decremental
single-source reachability on directed graphs. 42nd International Colloquium on
Automata, Languages and Programming. ICALP: International Colloquium on Automata,
Languages, and Programming, LNCS, vol. 9134, 725–736.'
mla: Henzinger, Monika H., et al. “Improved Algorithms for Decremental Single-Source
Reachability on Directed Graphs.” 42nd International Colloquium on Automata,
Languages and Programming, vol. 9134, Springer Nature, 2015, pp. 725–36, doi:10.1007/978-3-662-47672-7_59.
short: M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, 42nd International Colloquium
on Automata, Languages and Programming, Springer Nature, 2015, pp. 725–736.
conference:
end_date: 2015-07-10
location: Kyoto, Japan
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 2015-07-06
date_created: 2022-08-11T08:51:32Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2023-02-10T09:10:26Z
day: '01'
doi: 10.1007/978-3-662-47672-7_59
extern: '1'
external_id:
arxiv:
- '1612.03856'
intvolume: ' 9134'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1612.03856
month: '01'
oa: 1
oa_version: Preprint
page: 725 - 736
publication: 42nd International Colloquium on Automata, Languages and Programming
publication_identifier:
isbn:
- '9783662476710'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Improved algorithms for decremental single-source reachability on directed
graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9134
year: '2015'
...
---
_id: '11786'
abstract:
- lang: eng
text: "In this paper, we develop a dynamic version of the primal-dual method for
optimization problems, and apply it to obtain the following results. (1) For the
dynamic set-cover problem, we maintain an \U0001D442(\U0001D4532)-approximately
optimal solution in \U0001D442(\U0001D453⋅log(\U0001D45A+\U0001D45B)) amortized
update time, where \U0001D453 is the maximum “frequency” of an element, \U0001D45B
is the number of sets, and \U0001D45A is the maximum number of elements in the
universe at any point in time. (2) For the dynamic \U0001D44F-matching problem,
we maintain an \U0001D442(1)-approximately optimal solution in \U0001D442(log3\U0001D45B)
amortized update time, where \U0001D45B is the number of nodes in the graph."
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
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: Giuseppe F.
full_name: Italiano, Giuseppe F.
last_name: Italiano
citation:
ama: 'Bhattacharya S, Henzinger MH, Italiano GF. Design of dynamic algorithms via
primal-dual method. In: 42nd International Colloquium on Automata, Languages
and Programming. Vol 9134. Springer Nature; 2015:206-218. doi:10.1007/978-3-662-47672-7_17'
apa: 'Bhattacharya, S., Henzinger, M. H., & Italiano, G. F. (2015). Design of
dynamic algorithms via primal-dual method. In 42nd International Colloquium
on Automata, Languages and Programming (Vol. 9134, pp. 206–218). Kyoto, Japan:
Springer Nature. https://doi.org/10.1007/978-3-662-47672-7_17'
chicago: Bhattacharya, Sayan, Monika H Henzinger, and Giuseppe F. Italiano. “Design
of Dynamic Algorithms via Primal-Dual Method.” In 42nd International Colloquium
on Automata, Languages and Programming, 9134:206–18. Springer Nature, 2015.
https://doi.org/10.1007/978-3-662-47672-7_17.
ieee: S. Bhattacharya, M. H. Henzinger, and G. F. Italiano, “Design of dynamic algorithms
via primal-dual method,” in 42nd International Colloquium on Automata, Languages
and Programming, Kyoto, Japan, 2015, vol. 9134, pp. 206–218.
ista: 'Bhattacharya S, Henzinger MH, Italiano GF. 2015. Design of dynamic algorithms
via primal-dual method. 42nd International Colloquium on Automata, Languages and
Programming. ICALP: International Colloquium on Automata, Languages, and Programming,
LNCS, vol. 9134, 206–218.'
mla: Bhattacharya, Sayan, et al. “Design of Dynamic Algorithms via Primal-Dual Method.”
42nd International Colloquium on Automata, Languages and Programming, vol.
9134, Springer Nature, 2015, pp. 206–18, doi:10.1007/978-3-662-47672-7_17.
short: S. Bhattacharya, M.H. Henzinger, G.F. Italiano, in:, 42nd International Colloquium
on Automata, Languages and Programming, Springer Nature, 2015, pp. 206–218.
conference:
end_date: 2015-07-10
location: Kyoto, Japan
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 2015-07-06
date_created: 2022-08-11T09:28:49Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2023-02-10T09:13:31Z
day: '01'
doi: 10.1007/978-3-662-47672-7_17
extern: '1'
external_id:
arxiv:
- '1604.05337'
intvolume: ' 9134'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1604.05337
month: '01'
oa: 1
oa_version: Preprint
page: 206 - 218
publication: 42nd International Colloquium on Automata, Languages and Programming
publication_identifier:
isbn:
- '9783662476710'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Design of dynamic algorithms via primal-dual method
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9134
year: '2015'
...
---
_id: '11787'
abstract:
- lang: eng
text: "We present faster algorithms for computing the 2-edge and 2-vertex strongly
connected components of a directed graph. While in undirected graphs the 2-edge
and 2-vertex connected components can be found in linear time, in directed graphs
with m edges and n vertices only rather simple O(m n)-time algorithms were known.
We use a hierarchical sparsification technique to obtain algorithms that run in
time \U0001D442(\U0001D45B2). For 2-edge strongly connected components our algorithm
gives the first running time improvement in 20 years. Additionally we present
an \U0001D442(\U0001D45A2/log\U0001D45B)-time algorithm for 2-edge strongly connected
components, and thus improve over the O(m n) running time also when \U0001D45A=\U0001D442(\U0001D45B).
Our approach extends to k-edge and k-vertex strongly connected components for
any constant k with a running time of \U0001D442(\U0001D45B2log\U0001D45B) for
k-edge-connectivity and \U0001D442(\U0001D45B3) for k-vertex-connectivity."
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
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: Sebastian
full_name: Krinninger, Sebastian
last_name: Krinninger
- first_name: Veronika
full_name: Loitzenbauer, Veronika
last_name: Loitzenbauer
citation:
ama: 'Henzinger MH, Krinninger S, Loitzenbauer V. Finding 2-edge and 2-vertex strongly
connected components in quadratic time. In: 2nd International Colloquium on
Automata, Languages and Programming. Vol 9134. Springer Nature; 2015:713-724.
doi:10.1007/978-3-662-47672-7_58'
apa: 'Henzinger, M. H., Krinninger, S., & Loitzenbauer, V. (2015). Finding 2-edge
and 2-vertex strongly connected components in quadratic time. In 2nd International
Colloquium on Automata, Languages and Programming (Vol. 9134, pp. 713–724).
Kyoto, Japan: Springer Nature. https://doi.org/10.1007/978-3-662-47672-7_58'
chicago: Henzinger, Monika H, Sebastian Krinninger, and Veronika Loitzenbauer. “Finding
2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time.” In 2nd
International Colloquium on Automata, Languages and Programming, 9134:713–24.
Springer Nature, 2015. https://doi.org/10.1007/978-3-662-47672-7_58.
ieee: M. H. Henzinger, S. Krinninger, and V. Loitzenbauer, “Finding 2-edge and 2-vertex
strongly connected components in quadratic time,” in 2nd International Colloquium
on Automata, Languages and Programming, Kyoto, Japan, 2015, vol. 9134, pp.
713–724.
ista: 'Henzinger MH, Krinninger S, Loitzenbauer V. 2015. Finding 2-edge and 2-vertex
strongly connected components in quadratic time. 2nd International Colloquium
on Automata, Languages and Programming. ICALP: International Colloquium on Automata,
Languages, and Programming, LNCS, vol. 9134, 713–724.'
mla: Henzinger, Monika H., et al. “Finding 2-Edge and 2-Vertex Strongly Connected
Components in Quadratic Time.” 2nd International Colloquium on Automata, Languages
and Programming, vol. 9134, Springer Nature, 2015, pp. 713–24, doi:10.1007/978-3-662-47672-7_58.
short: M.H. Henzinger, S. Krinninger, V. Loitzenbauer, in:, 2nd International Colloquium
on Automata, Languages and Programming, Springer Nature, 2015, pp. 713–724.
conference:
end_date: 2015-07-10
location: Kyoto, Japan
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 2015-07-06
date_created: 2022-08-11T09:38:34Z
date_published: 2015-07-06T00:00:00Z
date_updated: 2023-02-10T09:21:47Z
day: '06'
doi: 10.1007/978-3-662-47672-7_58
extern: '1'
external_id:
arxiv:
- '1412.6466'
intvolume: ' 9134'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1412.6466
month: '07'
oa: 1
oa_version: Preprint
page: 713 - 724
publication: 2nd International Colloquium on Automata, Languages and Programming
publication_identifier:
isbn:
- '9783662476710'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Finding 2-edge and 2-vertex strongly connected components in quadratic time
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9134
year: '2015'
...
---
_id: '11788'
abstract:
- lang: eng
text: "Ad exchanges are becoming an increasingly popular way to sell advertisement
slots on the internet. An ad exchange is basically a spot market for ad impressions.
A publisher who has already signed contracts reserving advertisement impressions
on his pages can choose between assigning a new ad impression for a new page view
to a contracted advertiser or to sell it at an ad exchange. This leads to an online
revenue maximization problem for the publisher. Given a new impression to sell
decide whether (a) to assign it to a contracted advertiser and if so to which
one or (b) to sell it at the ad exchange and if so at which reserve price. We
make no assumptions about the distribution of the advertiser valuations that participate
in the ad exchange and show that there exists a simple primal-dual based online
algorithm, whose lower bound for the revenue converges to \U0001D445\U0001D434\U0001D437\U0001D44B+\U0001D445\U0001D434(1−1/\U0001D452),
where \U0001D445\U0001D434\U0001D437\U0001D44B is the revenue that the optimum
algorithm achieves from the ad exchange and \U0001D445\U0001D434 is the revenue
that the optimum algorithm achieves from the contracted advertisers."
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Wolfgang
full_name: Dvořák, Wolfgang
last_name: Dvořák
- 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: 'Dvořák W, Henzinger MH. Online ad assignment with an ad exchange. In: 12th
International Workshop of Approximation and Online Algorithms. Vol 8952. Springer
Nature; 2015:156–167. doi:10.1007/978-3-319-18263-6_14'
apa: 'Dvořák, W., & Henzinger, M. H. (2015). Online ad assignment with an ad
exchange. In 12th International Workshop of Approximation and Online Algorithms
(Vol. 8952, pp. 156–167). Wroclaw, Poland: Springer Nature. https://doi.org/10.1007/978-3-319-18263-6_14'
chicago: Dvořák, Wolfgang, and Monika H Henzinger. “Online Ad Assignment with an
Ad Exchange.” In 12th International Workshop of Approximation and Online Algorithms,
8952:156–167. Springer Nature, 2015. https://doi.org/10.1007/978-3-319-18263-6_14.
ieee: W. Dvořák and M. H. Henzinger, “Online ad assignment with an ad exchange,”
in 12th International Workshop of Approximation and Online Algorithms,
Wroclaw, Poland, 2015, vol. 8952, pp. 156–167.
ista: 'Dvořák W, Henzinger MH. 2015. Online ad assignment with an ad exchange. 12th
International Workshop of Approximation and Online Algorithms. WAOA: International
Workshop on Approximation and Online Algorithms, LNCS, vol. 8952, 156–167.'
mla: Dvořák, Wolfgang, and Monika H. Henzinger. “Online Ad Assignment with an Ad
Exchange.” 12th International Workshop of Approximation and Online Algorithms,
vol. 8952, Springer Nature, 2015, pp. 156–167, doi:10.1007/978-3-319-18263-6_14.
short: W. Dvořák, M.H. Henzinger, in:, 12th International Workshop of Approximation
and Online Algorithms, Springer Nature, 2015, pp. 156–167.
conference:
end_date: 2014-09-12
location: Wroclaw, Poland
name: 'WAOA: International Workshop on Approximation and Online Algorithms'
start_date: 2014-09-11
date_created: 2022-08-11T09:43:32Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2023-02-10T09:26:06Z
day: '01'
doi: 10.1007/978-3-319-18263-6_14
extern: '1'
external_id:
arxiv:
- '1604.05603'
intvolume: ' 8952'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1604.05603
month: '01'
oa: 1
oa_version: Preprint
page: 156–167
publication: 12th International Workshop of Approximation and Online Algorithms
publication_identifier:
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Online ad assignment with an ad exchange
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8952
year: '2015'
...
---
_id: '7779'
abstract:
- lang: eng
text: "The fact that a disordered material is not constrained in its properties
in\r\nthe same way as a crystal presents significant and yet largely untapped\r\npotential
for novel material design. However, unlike their crystalline\r\ncounterparts,
disordered solids are not well understood. One of the primary\r\nobstacles is
the lack of a theoretical framework for thinking about disorder\r\nand its relation
to mechanical properties. To this end, we study an idealized\r\nsystem of frictionless
athermal soft spheres that, when compressed, undergoes a\r\njamming phase transition
with diverging length scales and clean power-law\r\nsignatures. This critical
point is the cornerstone of a much larger \"jamming\r\nscenario\" that has the
potential to provide the essential theoretical\r\nfoundation necessary for a unified
understanding of the mechanics of disordered\r\nsolids. We begin by showing that
jammed sphere packings have a valid linear\r\nregime despite the presence of \"contact
nonlinearities.\" We then investigate\r\nthe critical nature of the transition,
focusing on diverging length scales and\r\nfinite-size effects. Next, we argue
that jamming plays the same role for\r\ndisordered solids as the perfect crystal
plays for crystalline solids. Not only\r\ncan it be considered an idealized starting
point for understanding disordered\r\nmaterials, but it can even influence systems
that have a relatively high amount\r\nof crystalline order. The behavior of solids
can thus be thought of as existing\r\non a spectrum, with the perfect crystal
and the jamming transition at opposing\r\nends. Finally, we introduce a new principle
wherein the contribution of an\r\nindividual bond to one global property is independent
of its contribution to\r\nanother. This principle allows the different global
responses of a disordered\r\nsystem to be manipulated independently and provides
a great deal of flexibility\r\nin designing materials with unique, textured and
tunable properties."
article_processing_charge: No
arxiv: 1
author:
- first_name: Carl Peter
full_name: Goodrich, Carl Peter
id: EB352CD2-F68A-11E9-89C5-A432E6697425
last_name: Goodrich
orcid: 0000-0002-1307-5074
citation:
ama: 'Goodrich CP. Unearthing the anticrystal: Criticality in the linear response
of disordered solids. arXiv:151008820. 2015.'
apa: 'Goodrich, C. P. (2015). Unearthing the anticrystal: Criticality in the linear
response of disordered solids. arXiv:1510.08820.'
chicago: 'Goodrich, Carl Peter. “Unearthing the Anticrystal: Criticality in the
Linear Response of Disordered Solids.” ArXiv:1510.08820, 2015.'
ieee: 'C. P. Goodrich, “Unearthing the anticrystal: Criticality in the linear response
of disordered solids,” arXiv:1510.08820. 2015.'
ista: 'Goodrich CP. 2015. Unearthing the anticrystal: Criticality in the linear
response of disordered solids. arXiv:1510.08820, .'
mla: 'Goodrich, Carl Peter. “Unearthing the Anticrystal: Criticality in the Linear
Response of Disordered Solids.” ArXiv:1510.08820, 2015.'
short: C.P. Goodrich, ArXiv:1510.08820 (2015).
date_created: 2020-04-30T12:16:18Z
date_published: 2015-10-29T00:00:00Z
date_updated: 2021-01-12T08:15:28Z
day: '29'
extern: '1'
external_id:
arxiv:
- '1510.08820'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1510.08820
month: '10'
oa: 1
oa_version: Preprint
page: '242'
publication: arXiv:1510.08820
publication_status: published
status: public
title: 'Unearthing the anticrystal: Criticality in the linear response of disordered
solids'
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '778'
abstract:
- lang: eng
text: Several Hybrid Transactional Memory (HyTM) schemes have recently been proposed
to complement the fast, but best-effort nature of Hardware Transactional Memory
(HTM) with a slow, reliable software backup. However, the costs of providing concurrency
between hardware and software transactions in HyTM are still not well understood.
In this paper, we propose a general model for HyTM implementations, which captures
the ability of hardware transactions to buffer memory accesses. The model allows
us to formally quantify and analyze the amount of overhead (instrumentation) caused
by the potential presence of software transactions.We prove that (1) it is impossible
to build a strictly serializable HyTM implementation that has both uninstrumented
reads and writes, even for very weak progress guarantees, and (2) the instrumentation
cost incurred by a hardware transaction in any progressive opaque HyTM is linear
in the size of the transaction’s data set.We further describe two implementations
which exhibit optimal instrumentation costs for two different progress conditions.
In sum, this paper proposes the first formal HyTM model and captures for the first
time the trade-off between the degree of hardware-software TM concurrency and
the amount of instrumentation overhead.
acknowledgement: P. Kuznetsov-The author is supported by the Agence Nationale de la
Recherche, ANR-14-CE35-0010-01, project DISCMAT. N. Shavit-Support is gratfeully
acknowledgedfrom the National Science Foundation under grants CCF-1217921, CCF-1201926,
and IIS-1447786, the Department of Energy under grant ER26116/DE-SC0008923, and
the Oracle and Intel corporations.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Justin
full_name: Kopinsky, Justin
last_name: Kopinsky
- first_name: Petr
full_name: Kuznetsov, Petr
last_name: Kuznetsov
- first_name: Srivatsan
full_name: Ravi, Srivatsan
last_name: Ravi
- first_name: Nir
full_name: Shavit, Nir
last_name: Shavit
citation:
ama: 'Alistarh D-A, Kopinsky J, Kuznetsov P, Ravi S, Shavit N. Inherent limitations
of hybrid transactional memory. In: Vol 9363. Springer; 2015:185-199. doi:10.1007/978-3-662-48653-5_13'
apa: 'Alistarh, D.-A., Kopinsky, J., Kuznetsov, P., Ravi, S., & Shavit, N. (2015).
Inherent limitations of hybrid transactional memory (Vol. 9363, pp. 185–199).
Presented at the DISC: Distributed Computing, Springer. https://doi.org/10.1007/978-3-662-48653-5_13'
chicago: Alistarh, Dan-Adrian, Justin Kopinsky, Petr Kuznetsov, Srivatsan Ravi,
and Nir Shavit. “Inherent Limitations of Hybrid Transactional Memory,” 9363:185–99.
Springer, 2015. https://doi.org/10.1007/978-3-662-48653-5_13.
ieee: 'D.-A. Alistarh, J. Kopinsky, P. Kuznetsov, S. Ravi, and N. Shavit, “Inherent
limitations of hybrid transactional memory,” presented at the DISC: Distributed
Computing, 2015, vol. 9363, pp. 185–199.'
ista: 'Alistarh D-A, Kopinsky J, Kuznetsov P, Ravi S, Shavit N. 2015. Inherent limitations
of hybrid transactional memory. DISC: Distributed Computing, LNCS, vol. 9363,
185–199.'
mla: Alistarh, Dan-Adrian, et al. Inherent Limitations of Hybrid Transactional
Memory. Vol. 9363, Springer, 2015, pp. 185–99, doi:10.1007/978-3-662-48653-5_13.
short: D.-A. Alistarh, J. Kopinsky, P. Kuznetsov, S. Ravi, N. Shavit, in:, Springer,
2015, pp. 185–199.
conference:
name: 'DISC: Distributed Computing'
date_created: 2018-12-11T11:48:27Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2023-02-23T13:17:35Z
day: '01'
doi: 10.1007/978-3-662-48653-5_13
extern: '1'
external_id:
arxiv:
- '1405.5689'
intvolume: ' 9363'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1405.5689
month: '01'
oa: 1
oa_version: None
page: 185 - 199
publication_status: published
publisher: Springer
publist_id: '6880'
quality_controlled: '1'
status: public
title: Inherent limitations of hybrid transactional memory
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9363
year: '2015'
...
---
_id: '780'
abstract:
- lang: eng
text: 'Population protocols are networks of finite-state agents, interacting randomly,
and updating their states using simple rules. Despite their extreme simplicity,
these systems have been shown to cooperatively perform complex computational tasks,
such as simulating register machines to compute standard arithmetic functions.
The election of a unique leader agent is a key requirement in such computational
constructions. Yet, the fastest currently known population protocol for electing
a leader only has linear convergence time, and it has recently been shown that
no population protocol using a constant number of states per node may overcome
this linear bound. In this paper, we give the first population protocol for leader
election with polylogarithmic convergence time, using polylogarithmic memory states
per node. The protocol structure is quite simple: each node has an associated
value, and is either a leader (still in contention) or a minion (following some
leader). A leader keeps incrementing its value and “defeats” other leaders in
one-to-one interactions, and will drop from contention and become a minion if
it meets a leader with higher value. Importantly, a leader also drops out if it
meets a minion with higher absolute value. While these rules are quite simple,
the proof that this algorithm achieves polylogarithmic convergence time is non-trivial.
In particular, the argument combines careful use of concentration inequalities
with anti-concentration bounds, showing that the leaders’ values become spread
apart as the execution progresses, which in turn implies that straggling leaders
get quickly eliminated. We complement our analysis with empirical results, showing
that our protocol converges extremely fast, even for large network sizes.'
acknowledgement: Support is gratefully acknowledged from the National Science Foundation
under grants CCF-1217921, CCF-1301926, and IIS-1447786, the Department of Energy
under grant ER26116/DE-SC0008923, and the Oracle and Intel corporations.”
arxiv: 1
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Rati
full_name: Gelashvili, Rati
last_name: Gelashvili
citation:
ama: 'Alistarh D-A, Gelashvili R. Polylogarithmic-time leader election in population
protocols. In: Vol 9135. Springer; 2015:479-491. doi:10.1007/978-3-662-47666-6_38'
apa: 'Alistarh, D.-A., & Gelashvili, R. (2015). Polylogarithmic-time leader
election in population protocols (Vol. 9135, pp. 479–491). Presented at the ICALP:
International Colloquium on Automota, Languages and Programming, Springer. https://doi.org/10.1007/978-3-662-47666-6_38'
chicago: Alistarh, Dan-Adrian, and Rati Gelashvili. “Polylogarithmic-Time Leader
Election in Population Protocols,” 9135:479–91. Springer, 2015. https://doi.org/10.1007/978-3-662-47666-6_38.
ieee: 'D.-A. Alistarh and R. Gelashvili, “Polylogarithmic-time leader election in
population protocols,” presented at the ICALP: International Colloquium on Automota,
Languages and Programming, 2015, vol. 9135, pp. 479–491.'
ista: 'Alistarh D-A, Gelashvili R. 2015. Polylogarithmic-time leader election in
population protocols. ICALP: International Colloquium on Automota, Languages and
Programming vol. 9135, 479–491.'
mla: Alistarh, Dan-Adrian, and Rati Gelashvili. Polylogarithmic-Time Leader Election
in Population Protocols. Vol. 9135, Springer, 2015, pp. 479–91, doi:10.1007/978-3-662-47666-6_38.
short: D.-A. Alistarh, R. Gelashvili, in:, Springer, 2015, pp. 479–491.
conference:
name: 'ICALP: International Colloquium on Automota, Languages and Programming'
date_created: 2018-12-11T11:48:28Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2023-02-23T13:18:11Z
day: '01'
doi: 10.1007/978-3-662-47666-6_38
extern: '1'
external_id:
arxiv:
- '1502.05745'
intvolume: ' 9135'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1502.05745
month: '01'
oa: 1
oa_version: Preprint
page: 479 - 491
publication_status: published
publisher: Springer
publist_id: '6877'
status: public
title: Polylogarithmic-time leader election in population protocols
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9135
year: '2015'
...
---
_id: '783'
abstract:
- lang: eng
text: 'The problem of electing a leader from among n contenders is one of the fundamental
questions in distributed computing. In its simplest formulation, the task is as
follows: given n processors, all participants must eventually return a win or
lose indication, such that a single contender may win. Despite a considerable
amount of work on leader election, the following question is still open: can we
elect a leader in an asynchronous fault-prone system faster than just running
a Θ(log n)-time tournament, against a strong adaptive adversary? In this paper,
we answer this question in the affirmative, improving on a decades-old upper bound.
We introduce two new algorithmic ideas to reduce the time complexity of electing
a leader to O(log∗ n), using O(n2) point-to-point messages. A non-trivial application
of our algorithm is a new upper bound for the tight renaming problem, assigning
n items to the n participants in expected O(log2 n) time and O(n2) messages. We
complement our results with lower bound of Ω(n2) messages for solving these two
problems, closing the question of their message complexity.'
acknowledgement: "Support is gratefully acknowledged from the National Science Foundation
under grants CCF-1217921, CCF-1301926,\r\nand IIS-1447786, the Department of
\ Energy under grant\r\nER26116/DE-SC0008923, and the Oracle and Intel corporations.\r\nThe
authors would like to thank Prof. Nir Shavit for ad-\r\nvice and encouragement
during this work, and the anonymous reviewers for their very useful suggestions."
article_processing_charge: No
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Rati
full_name: Gelashvili, Rati
last_name: Gelashvili
- first_name: Adrian
full_name: Vladu, Adrian
last_name: Vladu
citation:
ama: 'Alistarh D-A, Gelashvili R, Vladu A. How to elect a leader faster than a tournament.
In: Vol 2015-July. ACM; 2015:365-374. doi:10.1145/2767386.2767420'
apa: 'Alistarh, D.-A., Gelashvili, R., & Vladu, A. (2015). How to elect a leader
faster than a tournament (Vol. 2015–July, pp. 365–374). Presented at the PODC:
Principles of Distributed Computing, ACM. https://doi.org/10.1145/2767386.2767420'
chicago: Alistarh, Dan-Adrian, Rati Gelashvili, and Adrian Vladu. “How to Elect
a Leader Faster than a Tournament,” 2015–July:365–74. ACM, 2015. https://doi.org/10.1145/2767386.2767420.
ieee: 'D.-A. Alistarh, R. Gelashvili, and A. Vladu, “How to elect a leader faster
than a tournament,” presented at the PODC: Principles of Distributed Computing,
2015, vol. 2015–July, pp. 365–374.'
ista: 'Alistarh D-A, Gelashvili R, Vladu A. 2015. How to elect a leader faster than
a tournament. PODC: Principles of Distributed Computing vol. 2015–July, 365–374.'
mla: Alistarh, Dan-Adrian, et al. How to Elect a Leader Faster than a Tournament.
Vol. 2015–July, ACM, 2015, pp. 365–74, doi:10.1145/2767386.2767420.
short: D.-A. Alistarh, R. Gelashvili, A. Vladu, in:, ACM, 2015, pp. 365–374.
conference:
name: 'PODC: Principles of Distributed Computing'
date_created: 2018-12-11T11:48:28Z
date_published: 2015-07-21T00:00:00Z
date_updated: 2023-02-23T13:18:55Z
day: '21'
doi: 10.1145/2767386.2767420
extern: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1411.1001
month: '07'
oa: 1
oa_version: None
page: 365 - 374
publication_status: published
publisher: ACM
publist_id: '6875'
status: public
title: How to elect a leader faster than a tournament
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2015-July
year: '2015'
...
---
_id: '8183'
abstract:
- lang: eng
text: "We study conditions under which a finite simplicial complex $K$ can be mapped
to $\\mathbb R^d$ without higher-multiplicity intersections. An almost $r$-embedding
is a map $f: K\\to \\mathbb R^d$ such that the images of any $r$\r\npairwise disjoint
simplices of $K$ do not have a common point. We show that if $r$ is not a prime
power and $d\\geq 2r+1$, then there is a counterexample to the topological Tverberg
conjecture, i.e., there is an almost $r$-embedding of\r\nthe $(d+1)(r-1)$-simplex
in $\\mathbb R^d$. This improves on previous constructions of counterexamples
(for $d\\geq 3r$) based on a series of papers by M. \\\"Ozaydin, M. Gromov, P.
Blagojevi\\'c, F. Frick, G. Ziegler, and the second and fourth present authors.
The counterexamples are obtained by proving the following algebraic criterion
in codimension 2: If $r\\ge3$ and if $K$ is a finite $2(r-1)$-complex then there
exists an almost $r$-embedding $K\\to \\mathbb R^{2r}$ if and only if there exists
a general position PL map $f:K\\to \\mathbb R^{2r}$ such that the algebraic intersection
number of the $f$-images of any $r$ pairwise disjoint simplices of $K$ is zero.
This result can be restated in terms of cohomological obstructions or equivariant
maps, and extends an analogous codimension 3 criterion by the second and fourth
authors. As another application we classify ornaments $f:S^3 \\sqcup S^3\\sqcup
S^3\\to \\mathbb R^5$ up to ornament\r\nconcordance. It follows from work of M.
Freedman, V. Krushkal and P. Teichner that the analogous criterion for $r=2$ is
false. We prove a lemma on singular higher-dimensional Borromean rings, yielding
an elementary proof of the counterexample."
acknowledgement: We would like to thank A. Klyachko, V. Krushkal, S. Melikhov, M.
Tancer, P. Teichner and anonymous referees for helpful discussions.
article_number: '1511.03501'
article_processing_charge: No
arxiv: 1
author:
- first_name: Sergey
full_name: Avvakumov, Sergey
id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
last_name: Avvakumov
- first_name: Isaac
full_name: Mabillard, Isaac
id: 32BF9DAA-F248-11E8-B48F-1D18A9856A87
last_name: Mabillard
- first_name: A.
full_name: Skopenkov, A.
last_name: Skopenkov
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: Avvakumov S, Mabillard I, Skopenkov A, Wagner U. Eliminating higher-multiplicity
intersections, III. Codimension 2. arXiv.
apa: Avvakumov, S., Mabillard, I., Skopenkov, A., & Wagner, U. (n.d.). Eliminating
higher-multiplicity intersections, III. Codimension 2. arXiv.
chicago: Avvakumov, Sergey, Isaac Mabillard, A. Skopenkov, and Uli Wagner. “Eliminating
Higher-Multiplicity Intersections, III. Codimension 2.” ArXiv, n.d.
ieee: S. Avvakumov, I. Mabillard, A. Skopenkov, and U. Wagner, “Eliminating higher-multiplicity
intersections, III. Codimension 2,” arXiv. .
ista: Avvakumov S, Mabillard I, Skopenkov A, Wagner U. Eliminating higher-multiplicity
intersections, III. Codimension 2. arXiv, 1511.03501.
mla: Avvakumov, Sergey, et al. “Eliminating Higher-Multiplicity Intersections, III.
Codimension 2.” ArXiv, 1511.03501.
short: S. Avvakumov, I. Mabillard, A. Skopenkov, U. Wagner, ArXiv (n.d.).
date_created: 2020-07-30T10:45:19Z
date_published: 2015-11-15T00:00:00Z
date_updated: 2023-09-07T13:12:17Z
day: '15'
department:
- _id: UlWa
external_id:
arxiv:
- '1511.03501'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1511.03501
month: '11'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
related_material:
record:
- id: '9308'
relation: later_version
status: public
- id: '10220'
relation: later_version
status: public
- id: '8156'
relation: dissertation_contains
status: public
status: public
title: Eliminating higher-multiplicity intersections, III. Codimension 2
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1615'
abstract:
- lang: eng
text: Loss-of-function mutations in the synaptic adhesion protein Neuroligin-4 are
among the most common genetic abnormalities associated with autism spectrum disorders,
but little is known about the function of Neuroligin-4 and the consequences of
its loss. We assessed synaptic and network characteristics in Neuroligin-4 knockout
mice, focusing on the hippocampus as a model brain region with a critical role
in cognition and memory, and found that Neuroligin-4 deletion causes subtle defects
of the protein composition and function of GABAergic synapses in the hippocampal
CA3 region. Interestingly, these subtle synaptic changes are accompanied by pronounced
perturbations of γ-oscillatory network activity, which has been implicated in
cognitive function and is altered in multiple psychiatric and neurodevelopmental
disorders. Our data provide important insights into the mechanisms by which Neuroligin-4-dependent
GABAergic synapses may contribute to autism phenotypes and indicate new strategies
for therapeutic approaches.
acknowledgement: This work was supported by the Max Planck Society (N.B. and H.E.),
the European Commission (EU-AIMS FP7-115300, N.B. and H.E.; Marie Curie IRG, D.K.-B.),
the German Research Foundation (CNMPB, N.B., H.E., and F.V.), the Alexander von
Humboldt-Foundation (D.K.-B.), and the Austrian Fond zur Förderung der Wissenschaftlichen
Forschung (P 24909-B24, P.J.). M.H. was a student of the doctoral program Molecular
Physiology of the Brain. Dr. J.-M. Fritschy generously provided the GABAARγ2 antibody.
We thank F. Benseler, I. Thanhäuser, D. Schwerdtfeger, A. Ronnenberg, and D. Winkler
for valuable advice and excellent technical support. We are grateful to the staff
at the animal facility of the Max Planck Institute of Experimental Medicine for
mouse husbandry.
author:
- first_name: Matthieu
full_name: Hammer, Matthieu
last_name: Hammer
- first_name: Dilja
full_name: Krueger Burg, Dilja
last_name: Krueger Burg
- first_name: Liam
full_name: Tuffy, Liam
last_name: Tuffy
- first_name: Benjamin
full_name: Cooper, Benjamin
last_name: Cooper
- first_name: Holger
full_name: Taschenberger, Holger
last_name: Taschenberger
- first_name: Sarit
full_name: Goswami, Sarit
id: 3A578F32-F248-11E8-B48F-1D18A9856A87
last_name: Goswami
- first_name: Hannelore
full_name: Ehrenreich, Hannelore
last_name: Ehrenreich
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
- first_name: Frederique
full_name: Varoqueaux, Frederique
last_name: Varoqueaux
- first_name: Jeong
full_name: Rhee, Jeong
last_name: Rhee
- first_name: Nils
full_name: Brose, Nils
last_name: Brose
citation:
ama: Hammer M, Krueger Burg D, Tuffy L, et al. Perturbed hippocampal synaptic inhibition
and γ-oscillations in a neuroligin-4 knockout mouse model of autism. Cell Reports.
2015;13(3):516-523. doi:10.1016/j.celrep.2015.09.011
apa: Hammer, M., Krueger Burg, D., Tuffy, L., Cooper, B., Taschenberger, H., Goswami,
S., … Brose, N. (2015). Perturbed hippocampal synaptic inhibition and γ-oscillations
in a neuroligin-4 knockout mouse model of autism. Cell Reports. Cell Press.
https://doi.org/10.1016/j.celrep.2015.09.011
chicago: Hammer, Matthieu, Dilja Krueger Burg, Liam Tuffy, Benjamin Cooper, Holger
Taschenberger, Sarit Goswami, Hannelore Ehrenreich, et al. “Perturbed Hippocampal
Synaptic Inhibition and γ-Oscillations in a Neuroligin-4 Knockout Mouse Model
of Autism.” Cell Reports. Cell Press, 2015. https://doi.org/10.1016/j.celrep.2015.09.011.
ieee: M. Hammer et al., “Perturbed hippocampal synaptic inhibition and γ-oscillations
in a neuroligin-4 knockout mouse model of autism,” Cell Reports, vol. 13,
no. 3. Cell Press, pp. 516–523, 2015.
ista: Hammer M, Krueger Burg D, Tuffy L, Cooper B, Taschenberger H, Goswami S, Ehrenreich
H, Jonas PM, Varoqueaux F, Rhee J, Brose N. 2015. Perturbed hippocampal synaptic
inhibition and γ-oscillations in a neuroligin-4 knockout mouse model of autism.
Cell Reports. 13(3), 516–523.
mla: Hammer, Matthieu, et al. “Perturbed Hippocampal Synaptic Inhibition and γ-Oscillations
in a Neuroligin-4 Knockout Mouse Model of Autism.” Cell Reports, vol. 13,
no. 3, Cell Press, 2015, pp. 516–23, doi:10.1016/j.celrep.2015.09.011.
short: M. Hammer, D. Krueger Burg, L. Tuffy, B. Cooper, H. Taschenberger, S. Goswami,
H. Ehrenreich, P.M. Jonas, F. Varoqueaux, J. Rhee, N. Brose, Cell Reports 13 (2015)
516–523.
date_created: 2018-12-11T11:53:02Z
date_published: 2015-10-20T00:00:00Z
date_updated: 2021-01-12T06:52:01Z
day: '20'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.1016/j.celrep.2015.09.011
file:
- access_level: open_access
checksum: 44d30fbb543774b076b4938bd36af9d7
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:23Z
date_updated: 2020-07-14T12:45:07Z
file_id: '5005'
file_name: IST-2016-470-v1+1_1-s2.0-S2211124715010220-main.pdf
file_size: 2314406
relation: main_file
file_date_updated: 2020-07-14T12:45:07Z
has_accepted_license: '1'
intvolume: ' 13'
issue: '3'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 516 - 523
publication: Cell Reports
publication_status: published
publisher: Cell Press
publist_id: '5551'
pubrep_id: '470'
quality_controlled: '1'
scopus_import: 1
status: public
title: Perturbed hippocampal synaptic inhibition and γ-oscillations in a neuroligin-4
knockout mouse model of autism
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: 13
year: '2015'
...
---
_id: '1618'
abstract:
- lang: eng
text: CCL19 and CCL21 are chemokines involved in the trafficking of immune cells,
particularly within the lymphatic system, through activation of CCR7. Concurrent
expression of PSGL-1 and CCR7 in naive T-cells enhances recruitment of these cells
to secondary lymphoid organs by CCL19 and CCL21. Here the solution structure of
CCL19 is reported. It contains a canonical chemokine domain. Chemical shift mapping
shows the N-termini of PSGL-1 and CCR7 have overlapping binding sites for CCL19
and binding is competitive. Implications for the mechanism of PSGL-1's enhancement
of resting T-cell recruitment are discussed.
article_processing_charge: No
author:
- first_name: Christopher
full_name: Veldkamp, Christopher
last_name: Veldkamp
- first_name: Eva
full_name: Kiermaier, Eva
id: 3EB04B78-F248-11E8-B48F-1D18A9856A87
last_name: Kiermaier
orcid: 0000-0001-6165-5738
- first_name: Skylar
full_name: Gabel Eissens, Skylar
last_name: Gabel Eissens
- first_name: Miranda
full_name: Gillitzer, Miranda
last_name: Gillitzer
- first_name: David
full_name: Lippner, David
last_name: Lippner
- first_name: Frank
full_name: Disilvio, Frank
last_name: Disilvio
- first_name: Casey
full_name: Mueller, Casey
last_name: Mueller
- first_name: Paeton
full_name: Wantuch, Paeton
last_name: Wantuch
- first_name: Gary
full_name: Chaffee, Gary
last_name: Chaffee
- first_name: Michael
full_name: Famiglietti, Michael
last_name: Famiglietti
- first_name: Danielle
full_name: Zgoba, Danielle
last_name: Zgoba
- first_name: Asha
full_name: Bailey, Asha
last_name: Bailey
- first_name: Yaya
full_name: Bah, Yaya
last_name: Bah
- first_name: Samantha
full_name: Engebretson, Samantha
last_name: Engebretson
- first_name: David
full_name: Graupner, David
last_name: Graupner
- first_name: Emily
full_name: Lackner, Emily
last_name: Lackner
- first_name: Vincent
full_name: Larosa, Vincent
last_name: Larosa
- first_name: Tysha
full_name: Medeiros, Tysha
last_name: Medeiros
- first_name: Michael
full_name: Olson, Michael
last_name: Olson
- first_name: Andrew
full_name: Phillips, Andrew
last_name: Phillips
- first_name: Harley
full_name: Pyles, Harley
last_name: Pyles
- first_name: Amanda
full_name: Richard, Amanda
last_name: Richard
- first_name: Scott
full_name: Schoeller, Scott
last_name: Schoeller
- first_name: Boris
full_name: Touzeau, Boris
last_name: Touzeau
- first_name: Larry
full_name: Williams, Larry
last_name: Williams
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
- first_name: Francis
full_name: Peterson, Francis
last_name: Peterson
citation:
ama: Veldkamp C, Kiermaier E, Gabel Eissens S, et al. Solution structure of CCL19
and identification of overlapping CCR7 and PSGL-1 binding sites. Biochemistry.
2015;54(27):4163-4166. doi:10.1021/acs.biochem.5b00560
apa: Veldkamp, C., Kiermaier, E., Gabel Eissens, S., Gillitzer, M., Lippner, D.,
Disilvio, F., … Peterson, F. (2015). Solution structure of CCL19 and identification
of overlapping CCR7 and PSGL-1 binding sites. Biochemistry. American Chemical
Society. https://doi.org/10.1021/acs.biochem.5b00560
chicago: Veldkamp, Christopher, Eva Kiermaier, Skylar Gabel Eissens, Miranda Gillitzer,
David Lippner, Frank Disilvio, Casey Mueller, et al. “Solution Structure of CCL19
and Identification of Overlapping CCR7 and PSGL-1 Binding Sites.” Biochemistry.
American Chemical Society, 2015. https://doi.org/10.1021/acs.biochem.5b00560.
ieee: C. Veldkamp et al., “Solution structure of CCL19 and identification
of overlapping CCR7 and PSGL-1 binding sites,” Biochemistry, vol. 54, no.
27. American Chemical Society, pp. 4163–4166, 2015.
ista: Veldkamp C, Kiermaier E, Gabel Eissens S, Gillitzer M, Lippner D, Disilvio
F, Mueller C, Wantuch P, Chaffee G, Famiglietti M, Zgoba D, Bailey A, Bah Y, Engebretson
S, Graupner D, Lackner E, Larosa V, Medeiros T, Olson M, Phillips A, Pyles H,
Richard A, Schoeller S, Touzeau B, Williams L, Sixt MK, Peterson F. 2015. Solution
structure of CCL19 and identification of overlapping CCR7 and PSGL-1 binding sites.
Biochemistry. 54(27), 4163–4166.
mla: Veldkamp, Christopher, et al. “Solution Structure of CCL19 and Identification
of Overlapping CCR7 and PSGL-1 Binding Sites.” Biochemistry, vol. 54, no.
27, American Chemical Society, 2015, pp. 4163–66, doi:10.1021/acs.biochem.5b00560.
short: C. Veldkamp, E. Kiermaier, S. Gabel Eissens, M. Gillitzer, D. Lippner, F.
Disilvio, C. Mueller, P. Wantuch, G. Chaffee, M. Famiglietti, D. Zgoba, A. Bailey,
Y. Bah, S. Engebretson, D. Graupner, E. Lackner, V. Larosa, T. Medeiros, M. Olson,
A. Phillips, H. Pyles, A. Richard, S. Schoeller, B. Touzeau, L. Williams, M.K.
Sixt, F. Peterson, Biochemistry 54 (2015) 4163–4166.
date_created: 2018-12-11T11:53:03Z
date_published: 2015-06-26T00:00:00Z
date_updated: 2023-03-30T11:32:57Z
day: '26'
department:
- _id: MiSi
doi: 10.1021/acs.biochem.5b00560
ec_funded: 1
external_id:
pmid:
- '26115234'
intvolume: ' 54'
issue: '27'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4809050/
month: '06'
oa: 1
oa_version: Submitted Version
page: 4163 - 4166
pmid: 1
project:
- _id: 25A603A2-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '281556'
name: Cytoskeletal force generation and force transduction of migrating leukocytes
(EU)
publication: Biochemistry
publication_status: published
publisher: American Chemical Society
publist_id: '5548'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Solution structure of CCL19 and identification of overlapping CCR7 and PSGL-1
binding sites
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 54
year: '2015'
...