---
_id: '2699'
abstract:
- lang: eng
text: "We prove the universality of the β-ensembles with convex analytic potentials
and for any β >\r\n0, i.e. we show that the spacing distributions of log-gases
at any inverse temperature β coincide with those of the Gaussian β-ensembles."
author:
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Paul
full_name: Bourgade, Paul
last_name: Bourgade
- first_name: Horng
full_name: Yau, Horng
last_name: Yau
citation:
ama: Erdös L, Bourgade P, Yau H. Universality of general β-ensembles. Duke Mathematical
Journal. 2014;163(6):1127-1190. doi:10.1215/00127094-2649752
apa: Erdös, L., Bourgade, P., & Yau, H. (2014). Universality of general β-ensembles.
Duke Mathematical Journal. Duke University Press. https://doi.org/10.1215/00127094-2649752
chicago: Erdös, László, Paul Bourgade, and Horng Yau. “Universality of General β-Ensembles.”
Duke Mathematical Journal. Duke University Press, 2014. https://doi.org/10.1215/00127094-2649752.
ieee: L. Erdös, P. Bourgade, and H. Yau, “Universality of general β-ensembles,”
Duke Mathematical Journal, vol. 163, no. 6. Duke University Press, pp.
1127–1190, 2014.
ista: Erdös L, Bourgade P, Yau H. 2014. Universality of general β-ensembles. Duke
Mathematical Journal. 163(6), 1127–1190.
mla: Erdös, László, et al. “Universality of General β-Ensembles.” Duke Mathematical
Journal, vol. 163, no. 6, Duke University Press, 2014, pp. 1127–90, doi:10.1215/00127094-2649752.
short: L. Erdös, P. Bourgade, H. Yau, Duke Mathematical Journal 163 (2014) 1127–1190.
date_created: 2018-12-11T11:59:08Z
date_published: 2014-04-01T00:00:00Z
date_updated: 2021-01-12T06:59:07Z
day: '01'
department:
- _id: LaEr
doi: 10.1215/00127094-2649752
intvolume: ' 163'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1104.2272
month: '04'
oa: 1
oa_version: Preprint
page: 1127 - 1190
publication: Duke Mathematical Journal
publication_status: published
publisher: Duke University Press
publist_id: '4197'
quality_controlled: '1'
scopus_import: 1
status: public
title: Universality of general β-ensembles
type: journal_article
user_id: 3FFCCD3A-F248-11E8-B48F-1D18A9856A87
volume: 163
year: '2014'
...
---
_id: '2716'
abstract:
- lang: eng
text: Multi-dimensional mean-payoff and energy games provide the mathematical foundation
for the quantitative study of reactive systems, and play a central role in the
emerging quantitative theory of verification and synthesis. In this work, we study
the strategy synthesis problem for games with such multi-dimensional objectives
along with a parity condition, a canonical way to express ω ω -regular conditions.
While in general, the winning strategies in such games may require infinite memory,
for synthesis the most relevant problem is the construction of a finite-memory
winning strategy (if one exists). Our main contributions are as follows. First,
we show a tight exponential bound (matching upper and lower bounds) on the memory
required for finite-memory winning strategies in both multi-dimensional mean-payoff
and energy games along with parity objectives. This significantly improves the
triple exponential upper bound for multi energy games (without parity) that could
be derived from results in literature for games on vector addition systems with
states. Second, we present an optimal symbolic and incremental algorithm to compute
a finite-memory winning strategy (if one exists) in such games. Finally, we give
a complete characterization of when finite memory of strategies can be traded
off for randomness. In particular, we show that for one-dimension mean-payoff
parity games, randomized memoryless strategies are as powerful as their pure finite-memory
counterparts.
acknowledgement: "Krishnendu Chatterjee is supported by Austrian Science Fund (FWF)
Grant No P 23499-N23, FWF NFN Grant No S11407 (RiSE), ERC Starting Grant (279307:
Graph Games) and Microsoft faculty fellowship. Mickael Randour is supported by F.R.S.-FNRS.
fellowship. \r\nJean-François Raskin is supported by ERC Starting Grant (279499:
inVEST).Thanks to D. Sbabo for useful pointers, V. Bruyère for comments on a preliminary
draft, and A. Bohy for fruitful discussions about the Acacia+ tool. We are grateful
to the anonymous reviewers for their insightful comments. "
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Mickael
full_name: Randour, Mickael
last_name: Randour
- first_name: Jean
full_name: Raskin, Jean
last_name: Raskin
citation:
ama: Chatterjee K, Randour M, Raskin J. Strategy synthesis for multi-dimensional
quantitative objectives. Acta Informatica. 2014;51(3-4):129-163. doi:10.1007/s00236-013-0182-6
apa: Chatterjee, K., Randour, M., & Raskin, J. (2014). Strategy synthesis for
multi-dimensional quantitative objectives. Acta Informatica. Springer.
https://doi.org/10.1007/s00236-013-0182-6
chicago: Chatterjee, Krishnendu, Mickael Randour, and Jean Raskin. “Strategy Synthesis
for Multi-Dimensional Quantitative Objectives.” Acta Informatica. Springer,
2014. https://doi.org/10.1007/s00236-013-0182-6.
ieee: K. Chatterjee, M. Randour, and J. Raskin, “Strategy synthesis for multi-dimensional
quantitative objectives,” Acta Informatica, vol. 51, no. 3–4. Springer,
pp. 129–163, 2014.
ista: Chatterjee K, Randour M, Raskin J. 2014. Strategy synthesis for multi-dimensional
quantitative objectives. Acta Informatica. 51(3–4), 129–163.
mla: Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative
Objectives.” Acta Informatica, vol. 51, no. 3–4, Springer, 2014, pp. 129–63,
doi:10.1007/s00236-013-0182-6.
short: K. Chatterjee, M. Randour, J. Raskin, Acta Informatica 51 (2014) 129–163.
date_created: 2018-12-11T11:59:14Z
date_published: 2014-06-01T00:00:00Z
date_updated: 2023-02-21T16:06:56Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/s00236-013-0182-6
external_id:
arxiv:
- '1201.5073'
intvolume: ' 51'
issue: 3-4
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1201.5073
month: '06'
oa: 1
oa_version: Preprint
page: 129 - 163
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: Acta Informatica
publication_status: published
publisher: Springer
publist_id: '4176'
quality_controlled: '1'
related_material:
record:
- id: '10904'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Strategy synthesis for multi-dimensional quantitative objectives
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 51
year: '2014'
...
---
_id: '2905'
abstract:
- lang: eng
text: "Persistent homology is a recent grandchild of homology that has found use
in\r\nscience and engineering as well as in mathematics. This paper surveys the
method as well\r\nas the applications, neglecting completeness in favor of highlighting
ideas and directions."
acknowledgement: This research is partially supported by NSF under grant DBI-0820624,
by ESF under the Research Networking Programme, and by the Russian Government Project
11.G34.31.0053.
article_processing_charge: No
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Dmitriy
full_name: Morozovy, Dmitriy
last_name: Morozovy
citation:
ama: 'Edelsbrunner H, Morozovy D. Persistent homology: Theory and practice. In:
European Mathematical Society Publishing House; 2014:31-50. doi:10.4171/120-1/3'
apa: 'Edelsbrunner, H., & Morozovy, D. (2014). Persistent homology: Theory and
practice (pp. 31–50). Presented at the ECM: European Congress of Mathematics,
Kraków, Poland: European Mathematical Society Publishing House. https://doi.org/10.4171/120-1/3'
chicago: 'Edelsbrunner, Herbert, and Dmitriy Morozovy. “Persistent Homology: Theory
and Practice,” 31–50. European Mathematical Society Publishing House, 2014. https://doi.org/10.4171/120-1/3.'
ieee: 'H. Edelsbrunner and D. Morozovy, “Persistent homology: Theory and practice,”
presented at the ECM: European Congress of Mathematics, Kraków, Poland, 2014,
pp. 31–50.'
ista: 'Edelsbrunner H, Morozovy D. 2014. Persistent homology: Theory and practice.
ECM: European Congress of Mathematics, 31–50.'
mla: 'Edelsbrunner, Herbert, and Dmitriy Morozovy. Persistent Homology: Theory
and Practice. European Mathematical Society Publishing House, 2014, pp. 31–50,
doi:10.4171/120-1/3.'
short: H. Edelsbrunner, D. Morozovy, in:, European Mathematical Society Publishing
House, 2014, pp. 31–50.
conference:
end_date: 2012-07-07
location: Kraków, Poland
name: 'ECM: European Congress of Mathematics'
start_date: 2012-07-02
date_created: 2018-12-11T12:00:16Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T07:00:36Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.4171/120-1/3
file:
- access_level: open_access
checksum: 1d4a046f1af945c407c5c4d411d4c5e4
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:43Z
date_updated: 2020-07-14T12:45:52Z
file_id: '5232'
file_name: IST-2016-544-v1+1_2012-P-11-PHTheoryPractice.pdf
file_size: 435320
relation: main_file
file_date_updated: 2020-07-14T12:45:52Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 31 - 50
publication_status: published
publisher: European Mathematical Society Publishing House
publist_id: '3842'
pubrep_id: '544'
quality_controlled: '1'
status: public
title: 'Persistent homology: Theory and practice'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '3263'
abstract:
- lang: eng
text: Adaptation in the retina is thought to optimize the encoding of natural light
signals into sequences of spikes sent to the brain. While adaptive changes in
retinal processing to the variations of the mean luminance level and second-order
stimulus statistics have been documented before, no such measurements have been
performed when higher-order moments of the light distribution change. We therefore
measured the ganglion cell responses in the tiger salamander retina to controlled
changes in the second (contrast), third (skew) and fourth (kurtosis) moments of
the light intensity distribution of spatially uniform temporally independent stimuli.
The skew and kurtosis of the stimuli were chosen to cover the range observed in
natural scenes. We quantified adaptation in ganglion cells by studying linear-nonlinear
models that capture well the retinal encoding properties across all stimuli. We
found that the encoding properties of retinal ganglion cells change only marginally
when higher-order statistics change, compared to the changes observed in response
to the variation in contrast. By analyzing optimal coding in LN-type models, we
showed that neurons can maintain a high information rate without large dynamic
adaptation to changes in skew or kurtosis. This is because, for uncorrelated stimuli,
spatio-temporal summation within the receptive field averages away non-gaussian
aspects of the light intensity distribution.
acknowledgement: "This work was supported by The Israel Science Foundation and The
Human Frontiers Science Program.\r\nWe thank the referees for helping significantly
improve this paper. We also thank Vijay Balasubramanian, Kristina Simmons, and Jason
Prentice for stimulating discussions. GT wishes to thank the faculty and students
of the “Methods in Computational Neuroscience” course at Marine Biological Laboratory,
Woods Hole.\r\n"
article_number: e85841
author:
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
- first_name: Anandamohan
full_name: Ghosh, Anandamohan
last_name: Ghosh
- first_name: Elad
full_name: Schneidman, Elad
last_name: Schneidman
- first_name: Ronen
full_name: Segev, Ronen
last_name: Segev
citation:
ama: Tkačik G, Ghosh A, Schneidman E, Segev R. Adaptation to changes in higher-order
stimulus statistics in the salamander retina. PLoS One. 2014;9(1). doi:10.1371/journal.pone.0085841
apa: Tkačik, G., Ghosh, A., Schneidman, E., & Segev, R. (2014). Adaptation to
changes in higher-order stimulus statistics in the salamander retina. PLoS
One. Public Library of Science. https://doi.org/10.1371/journal.pone.0085841
chicago: Tkačik, Gašper, Anandamohan Ghosh, Elad Schneidman, and Ronen Segev. “Adaptation
to Changes in Higher-Order Stimulus Statistics in the Salamander Retina.” PLoS
One. Public Library of Science, 2014. https://doi.org/10.1371/journal.pone.0085841.
ieee: G. Tkačik, A. Ghosh, E. Schneidman, and R. Segev, “Adaptation to changes in
higher-order stimulus statistics in the salamander retina,” PLoS One, vol.
9, no. 1. Public Library of Science, 2014.
ista: Tkačik G, Ghosh A, Schneidman E, Segev R. 2014. Adaptation to changes in higher-order
stimulus statistics in the salamander retina. PLoS One. 9(1), e85841.
mla: Tkačik, Gašper, et al. “Adaptation to Changes in Higher-Order Stimulus Statistics
in the Salamander Retina.” PLoS One, vol. 9, no. 1, e85841, Public Library
of Science, 2014, doi:10.1371/journal.pone.0085841.
short: G. Tkačik, A. Ghosh, E. Schneidman, R. Segev, PLoS One 9 (2014).
date_created: 2018-12-11T12:02:20Z
date_published: 2014-01-21T00:00:00Z
date_updated: 2021-01-12T07:42:14Z
day: '21'
ddc:
- '570'
department:
- _id: GaTk
doi: 10.1371/journal.pone.0085841
file:
- access_level: open_access
checksum: 1d5816b343abe5eadc3eb419bcece971
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:28Z
date_updated: 2020-07-14T12:46:06Z
file_id: '5011'
file_name: IST-2016-432-v1+1_journal.pone.0085841.pdf
file_size: 1568524
relation: main_file
file_date_updated: 2020-07-14T12:46:06Z
has_accepted_license: '1'
intvolume: ' 9'
issue: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '01'
oa: 1
oa_version: Published Version
publication: PLoS One
publication_status: published
publisher: Public Library of Science
publist_id: '3385'
pubrep_id: '432'
quality_controlled: '1'
scopus_import: 1
status: public
title: Adaptation to changes in higher-order stimulus statistics in the salamander
retina
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: 3FFCCD3A-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2014'
...
---
_id: '10884'
abstract:
- lang: eng
text: "We revisit the parameterized model checking problem for token-passing systems
and specifications in indexed CTL ∗ \\X. Emerson and Namjoshi (1995, 2003) have
shown that parameterized model checking of indexed CTL ∗ \\X in uni-directional
token rings can be reduced to checking rings up to some cutoff size. Clarke et
al. (2004) have shown a similar result for general topologies and indexed LTL
\\X, provided processes cannot choose the directions for sending or receiving
the token.\r\nWe unify and substantially extend these results by systematically
exploring fragments of indexed CTL ∗ \\X with respect to general topologies.
For each fragment we establish whether a cutoff exists, and for some concrete
topologies, such as rings, cliques and stars, we infer small cutoffs. Finally,
we show that the problem becomes undecidable, and thus no cutoffs exist, if processes
are allowed to choose the directions in which they send or from which they receive
the token."
acknowledgement: "This work was supported by the Austrian Science Fund through grant
P23499-N23\r\nand through the RiSE network (S11403, S11405, S11406, S11407-N23);
ERC Starting Grant (279307: Graph Games); Vienna Science and Technology Fund (WWTF)\r\ngrants
PROSEED, ICT12-059, and VRG11-005."
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Benjamin
full_name: Aminof, Benjamin
id: 4A55BD00-F248-11E8-B48F-1D18A9856A87
last_name: Aminof
- first_name: Swen
full_name: Jacobs, Swen
last_name: Jacobs
- first_name: Ayrat
full_name: Khalimov, Ayrat
last_name: Khalimov
- first_name: Sasha
full_name: Rubin, Sasha
id: 2EC51194-F248-11E8-B48F-1D18A9856A87
last_name: Rubin
citation:
ama: 'Aminof B, Jacobs S, Khalimov A, Rubin S. Parameterized model checking of token-passing
systems. In: Verification, Model Checking, and Abstract Interpretation.
Vol 8318. Springer Nature; 2014:262-281. doi:10.1007/978-3-642-54013-4_15'
apa: 'Aminof, B., Jacobs, S., Khalimov, A., & Rubin, S. (2014). Parameterized
model checking of token-passing systems. In Verification, Model Checking, and
Abstract Interpretation (Vol. 8318, pp. 262–281). San Diego, CA, United States:
Springer Nature. https://doi.org/10.1007/978-3-642-54013-4_15'
chicago: Aminof, Benjamin, Swen Jacobs, Ayrat Khalimov, and Sasha Rubin. “Parameterized
Model Checking of Token-Passing Systems.” In Verification, Model Checking,
and Abstract Interpretation, 8318:262–81. Springer Nature, 2014. https://doi.org/10.1007/978-3-642-54013-4_15.
ieee: B. Aminof, S. Jacobs, A. Khalimov, and S. Rubin, “Parameterized model checking
of token-passing systems,” in Verification, Model Checking, and Abstract Interpretation,
San Diego, CA, United States, 2014, vol. 8318, pp. 262–281.
ista: 'Aminof B, Jacobs S, Khalimov A, Rubin S. 2014. Parameterized model checking
of token-passing systems. Verification, Model Checking, and Abstract Interpretation.
VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318,
262–281.'
mla: Aminof, Benjamin, et al. “Parameterized Model Checking of Token-Passing Systems.”
Verification, Model Checking, and Abstract Interpretation, vol. 8318, Springer
Nature, 2014, pp. 262–81, doi:10.1007/978-3-642-54013-4_15.
short: B. Aminof, S. Jacobs, A. Khalimov, S. Rubin, in:, Verification, Model Checking,
and Abstract Interpretation, Springer Nature, 2014, pp. 262–281.
conference:
end_date: 2014-01-21
location: San Diego, CA, United States
name: 'VMCAI: Verifcation, Model Checking, and Abstract Interpretation'
start_date: 2014-01-19
date_created: 2022-03-18T13:01:22Z
date_published: 2014-01-30T00:00:00Z
date_updated: 2022-05-17T08:36:01Z
day: '30'
department:
- _id: KrCh
doi: 10.1007/978-3-642-54013-4_15
ec_funded: 1
external_id:
arxiv:
- '1311.4425'
intvolume: ' 8318'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.1311.4425'
month: '01'
oa: 1
oa_version: Preprint
page: 262-281
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: Verification, Model Checking, and Abstract Interpretation
publication_identifier:
eisbn:
- '9783642540134'
eissn:
- 1611-3349
isbn:
- '9783642540127'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Parameterized model checking of token-passing systems
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8318
year: '2014'
...
---
_id: '11080'
abstract:
- lang: eng
text: The spindle assembly checkpoint prevents separation of sister chromatids until
each kinetochore is attached to the mitotic spindle. Rodriguez-Bravo et al. report
that the nuclear pore complex scaffolds spindle assembly checkpoint signaling
in interphase, providing a store of inhibitory signals that limits the speed of
the subsequent mitosis.
article_processing_charge: No
article_type: original
author:
- first_name: Abigail
full_name: Buchwalter, Abigail
last_name: Buchwalter
- first_name: Martin W
full_name: HETZER, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: HETZER
orcid: 0000-0002-2111-992X
citation:
ama: Buchwalter A, Hetzer M. Nuclear pores set the speed limit for mitosis. Cell.
2014;156(5):868-869. doi:10.1016/j.cell.2014.02.004
apa: Buchwalter, A., & Hetzer, M. (2014). Nuclear pores set the speed limit
for mitosis. Cell. Elsevier. https://doi.org/10.1016/j.cell.2014.02.004
chicago: Buchwalter, Abigail, and Martin Hetzer. “Nuclear Pores Set the Speed Limit
for Mitosis.” Cell. Elsevier, 2014. https://doi.org/10.1016/j.cell.2014.02.004.
ieee: A. Buchwalter and M. Hetzer, “Nuclear pores set the speed limit for mitosis,”
Cell, vol. 156, no. 5. Elsevier, pp. 868–869, 2014.
ista: Buchwalter A, Hetzer M. 2014. Nuclear pores set the speed limit for mitosis.
Cell. 156(5), 868–869.
mla: Buchwalter, Abigail, and Martin Hetzer. “Nuclear Pores Set the Speed Limit
for Mitosis.” Cell, vol. 156, no. 5, Elsevier, 2014, pp. 868–69, doi:10.1016/j.cell.2014.02.004.
short: A. Buchwalter, M. Hetzer, Cell 156 (2014) 868–869.
date_created: 2022-04-07T07:50:04Z
date_published: 2014-02-27T00:00:00Z
date_updated: 2022-07-18T08:44:33Z
day: '27'
doi: 10.1016/j.cell.2014.02.004
extern: '1'
external_id:
pmid:
- '24581486'
intvolume: ' 156'
issue: '5'
keyword:
- General Biochemistry
- Genetics and Molecular Biology
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.cell.2014.02.004
month: '02'
oa: 1
oa_version: Published Version
page: 868-869
pmid: 1
publication: Cell
publication_identifier:
issn:
- 0092-8674
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nuclear pores set the speed limit for mitosis
type: journal_article
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 156
year: '2014'
...
---
_id: '11081'
abstract:
- lang: eng
text: In eukaryotic cells the nuclear genome is enclosed by the nuclear envelope
(NE). In metazoans, the NE breaks down in mitosis and it has been assumed that
the physical barrier separating nucleoplasm and cytoplasm remains intact during
the rest of the cell cycle and cell differentiation. However, recent studies suggest
that nonmitotic NE remodeling plays a critical role in development, virus infection,
laminopathies, and cancer. Although the mechanisms underlying these NE restructuring
events are currently being defined, one common theme is activation of protein
kinase C family members in the interphase nucleus to disrupt the nuclear lamina,
demonstrating the importance of the lamina in maintaining nuclear integrity.
article_processing_charge: No
article_type: review
author:
- first_name: Emily
full_name: Hatch, Emily
last_name: Hatch
- first_name: Martin W
full_name: HETZER, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: HETZER
orcid: 0000-0002-2111-992X
citation:
ama: Hatch E, Hetzer M. Breaching the nuclear envelope in development and disease.
Journal of Cell Biology. 2014;205(2):133-141. doi:10.1083/jcb.201402003
apa: Hatch, E., & Hetzer, M. (2014). Breaching the nuclear envelope in development
and disease. Journal of Cell Biology. Rockefeller University Press. https://doi.org/10.1083/jcb.201402003
chicago: Hatch, Emily, and Martin Hetzer. “Breaching the Nuclear Envelope in Development
and Disease.” Journal of Cell Biology. Rockefeller University Press, 2014.
https://doi.org/10.1083/jcb.201402003.
ieee: E. Hatch and M. Hetzer, “Breaching the nuclear envelope in development and
disease,” Journal of Cell Biology, vol. 205, no. 2. Rockefeller University
Press, pp. 133–141, 2014.
ista: Hatch E, Hetzer M. 2014. Breaching the nuclear envelope in development and
disease. Journal of Cell Biology. 205(2), 133–141.
mla: Hatch, Emily, and Martin Hetzer. “Breaching the Nuclear Envelope in Development
and Disease.” Journal of Cell Biology, vol. 205, no. 2, Rockefeller University
Press, 2014, pp. 133–41, doi:10.1083/jcb.201402003.
short: E. Hatch, M. Hetzer, Journal of Cell Biology 205 (2014) 133–141.
date_created: 2022-04-07T07:50:13Z
date_published: 2014-04-21T00:00:00Z
date_updated: 2022-07-18T08:45:09Z
day: '21'
doi: 10.1083/jcb.201402003
extern: '1'
external_id:
pmid:
- '24751535'
intvolume: ' 205'
issue: '2'
keyword:
- Cell Biology
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1083/jcb.201402003
month: '04'
oa: 1
oa_version: Published Version
page: 133-141
pmid: 1
publication: Journal of Cell Biology
publication_identifier:
issn:
- 1540-8140
- 0021-9525
publication_status: published
publisher: Rockefeller University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Breaching the nuclear envelope in development and disease
type: journal_article
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 205
year: '2014'
...
---
_id: '11082'
abstract:
- lang: eng
text: The nuclear pore complex (NPC) plays a critical role in gene expression by
mediating import of transcription regulators into the nucleus and export of RNA
transcripts to the cytoplasm. Emerging evidence suggests that in addition to mediating
transport, a subset of nucleoporins (Nups) engage in transcriptional activation
and elongation at genomic loci that are not associated with NPCs. The underlying
mechanism and regulation of Nup mobility on and off nuclear pores remain unclear.
Here we show that Nup50 is a mobile Nup with a pronounced presence both at the
NPC and in the nucleoplasm that can move between these different localizations.
Strikingly, the dynamic behavior of Nup50 in both locations is dependent on active
transcription by RNA polymerase II and requires the N-terminal half of the protein,
which contains importin α– and Nup153-binding domains. However, Nup50 dynamics
are independent of importin α, Nup153, and Nup98, even though the latter two proteins
also exhibit transcription-dependent mobility. Of interest, depletion of Nup50
from C2C12 myoblasts does not affect cell proliferation but inhibits differentiation
into myotubes. Taken together, our results suggest a transport-independent role
for Nup50 in chromatin biology that occurs away from the NPC.
article_processing_charge: No
article_type: original
author:
- first_name: Abigail L.
full_name: Buchwalter, Abigail L.
last_name: Buchwalter
- first_name: Yun
full_name: Liang, Yun
last_name: Liang
- first_name: Martin W
full_name: HETZER, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: HETZER
orcid: 0000-0002-2111-992X
citation:
ama: Buchwalter AL, Liang Y, Hetzer M. Nup50 is required for cell differentiation
and exhibits transcription-dependent dynamics. Molecular Biology of the Cell.
2014;25(16):2472-2484. doi:10.1091/mbc.e14-04-0865
apa: Buchwalter, A. L., Liang, Y., & Hetzer, M. (2014). Nup50 is required for
cell differentiation and exhibits transcription-dependent dynamics. Molecular
Biology of the Cell. American Society for Cell Biology. https://doi.org/10.1091/mbc.e14-04-0865
chicago: Buchwalter, Abigail L., Yun Liang, and Martin Hetzer. “Nup50 Is Required
for Cell Differentiation and Exhibits Transcription-Dependent Dynamics.” Molecular
Biology of the Cell. American Society for Cell Biology, 2014. https://doi.org/10.1091/mbc.e14-04-0865.
ieee: A. L. Buchwalter, Y. Liang, and M. Hetzer, “Nup50 is required for cell differentiation
and exhibits transcription-dependent dynamics,” Molecular Biology of the Cell,
vol. 25, no. 16. American Society for Cell Biology, pp. 2472–2484, 2014.
ista: Buchwalter AL, Liang Y, Hetzer M. 2014. Nup50 is required for cell differentiation
and exhibits transcription-dependent dynamics. Molecular Biology of the Cell.
25(16), 2472–2484.
mla: Buchwalter, Abigail L., et al. “Nup50 Is Required for Cell Differentiation
and Exhibits Transcription-Dependent Dynamics.” Molecular Biology of the Cell,
vol. 25, no. 16, American Society for Cell Biology, 2014, pp. 2472–84, doi:10.1091/mbc.e14-04-0865.
short: A.L. Buchwalter, Y. Liang, M. Hetzer, Molecular Biology of the Cell 25 (2014)
2472–2484.
date_created: 2022-04-07T07:50:24Z
date_published: 2014-08-15T00:00:00Z
date_updated: 2022-07-18T08:45:20Z
day: '15'
doi: 10.1091/mbc.e14-04-0865
extern: '1'
intvolume: ' 25'
issue: '16'
keyword:
- Cell Biology
- Molecular Biology
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1091/mbc.e14-04-0865
month: '08'
oa: 1
oa_version: Published Version
page: 2472-2484
publication: Molecular Biology of the Cell
publication_identifier:
issn:
- 1059-1524
- 1939-4586
publication_status: published
publisher: American Society for Cell Biology
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nup50 is required for cell differentiation and exhibits transcription-dependent
dynamics
type: journal_article
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 25
year: '2014'
...
---
_id: '11582'
abstract:
- lang: eng
text: We have observed a sample of typical z ∼ 1 star-forming galaxies, selected
from the HiZELS survey, with the new K-band Multi-Object Spectrograph (KMOS) near-infrared,
multi-integral field unit instrument on the Very Large Telescope (VLT), in order
to obtain their dynamics and metallicity gradients. The majority of our galaxies
have a metallicity gradient consistent with being flat or negative (i.e. higher
metallicity cores than outskirts). Intriguingly, we find a trend between metallicity
gradient and specific star formation rate (sSFR), such that galaxies with a high
sSFR tend to have relatively metal poor centres, a result which is strengthened
when combined with data sets from the literature. This result appears to explain
the discrepancies reported between different high-redshift studies and varying
claims for evolution. From a galaxy evolution perspective, the trend we see would
mean that a galaxy's sSFR is governed by the amount of metal-poor gas that can
be funnelled into its core, triggered either by merging or through efficient accretion.
In fact, merging may play a significant role as it is the starburst galaxies at
all epochs, which have the more positive metallicity gradients. Our results may
help to explain the origin of the fundamental metallicity relation, in which galaxies
at a fixed mass are observed to have lower metallicities at higher star formation
rates, especially if the metallicity is measured in an aperture encompassing only
the central regions of the galaxy. Finally, we note that this study demonstrates
the power of KMOS as an efficient instrument for large-scale resolved galaxy surveys.
acknowledgement: First, we acknowledge the referee for their comments, which have
improved the clarity of this paper. JPS and IRS acknowledge support from STFC (ST/I001573/1).
IRS also acknowledges support from the ERC Advanced Investigator programme DUSTYGAL
and a Royal Society/Wolfson Merit Award. DS acknowledges financial support from
NWO through a Veni fellowship and from FCT through the award of an FCT-IF starting
grant. PNB acknowledges STFC for financial support.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: John P.
full_name: Stott, John P.
last_name: Stott
- first_name: David
full_name: Sobral, David
last_name: Sobral
- first_name: A. M.
full_name: Swinbank, A. M.
last_name: Swinbank
- first_name: Ian
full_name: Smail, Ian
last_name: Smail
- first_name: Richard
full_name: Bower, Richard
last_name: Bower
- first_name: Philip N.
full_name: Best, Philip N.
last_name: Best
- first_name: Ray M.
full_name: Sharples, Ray M.
last_name: Sharples
- first_name: James E.
full_name: Geach, James E.
last_name: Geach
- 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: Stott JP, Sobral D, Swinbank AM, et al. A relationship between specific star
formation rate and metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS.
Monthly Notices of the Royal Astronomical Society. 2014;443(3):2695-2704.
doi:10.1093/mnras/stu1343
apa: Stott, J. P., Sobral, D., Swinbank, A. M., Smail, I., Bower, R., Best, P. N.,
… Matthee, J. J. (2014). A relationship between specific star formation rate and
metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS. Monthly Notices
of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stu1343
chicago: Stott, John P., David Sobral, A. M. Swinbank, Ian Smail, Richard Bower,
Philip N. Best, Ray M. Sharples, James E. Geach, and Jorryt J Matthee. “A Relationship
between Specific Star Formation Rate and Metallicity Gradient within z ∼ 1 Galaxies
from KMOS-HiZELS.” Monthly Notices of the Royal Astronomical Society. Oxford
University Press, 2014. https://doi.org/10.1093/mnras/stu1343.
ieee: J. P. Stott et al., “A relationship between specific star formation
rate and metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS,” Monthly
Notices of the Royal Astronomical Society, vol. 443, no. 3. Oxford University
Press, pp. 2695–2704, 2014.
ista: Stott JP, Sobral D, Swinbank AM, Smail I, Bower R, Best PN, Sharples RM, Geach
JE, Matthee JJ. 2014. A relationship between specific star formation rate and
metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS. Monthly Notices of
the Royal Astronomical Society. 443(3), 2695–2704.
mla: Stott, John P., et al. “A Relationship between Specific Star Formation Rate
and Metallicity Gradient within z ∼ 1 Galaxies from KMOS-HiZELS.” Monthly Notices
of the Royal Astronomical Society, vol. 443, no. 3, Oxford University Press,
2014, pp. 2695–704, doi:10.1093/mnras/stu1343.
short: J.P. Stott, D. Sobral, A.M. Swinbank, I. Smail, R. Bower, P.N. Best, R.M.
Sharples, J.E. Geach, J.J. Matthee, Monthly Notices of the Royal Astronomical
Society 443 (2014) 2695–2704.
date_created: 2022-07-14T12:16:10Z
date_published: 2014-09-21T00:00:00Z
date_updated: 2022-08-19T08:27:25Z
day: '21'
doi: 10.1093/mnras/stu1343
extern: '1'
external_id:
arxiv:
- '1407.1047'
intvolume: ' 443'
issue: '3'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- 'galaxies: abundances'
- 'galaxies: evolution'
- 'galaxies: kinematics and dynamics'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1407.1047
month: '09'
oa: 1
oa_version: Preprint
page: 2695-2704
publication: Monthly Notices of the Royal Astronomical Society
publication_identifier:
eissn:
- 1365-2966
issn:
- 0035-8711
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: A relationship between specific star formation rate and metallicity gradient
within z ∼ 1 galaxies from KMOS-HiZELS
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 443
year: '2014'
...
---
_id: '11583'
abstract:
- lang: eng
text: 'Candidate galaxies at redshifts of z ∼ 10 are now being found in extremely
deep surveys, probing very small areas. As a consequence, candidates are very
faint, making spectroscopic confirmation practically impossible. In order to overcome
such limitations, we have undertaken the CF-HiZELS survey, which is a large-area,
medium-depth near-infrared narrow-band survey targeted at z = 8.8 Lyman α (Lyα)
emitters (LAEs) and covering 10 deg2 in part of the SSA22 field with the Canada–France–Hawaii
Telescope (CFHT). We surveyed a comoving volume of 4.7 × 106 Mpc3 to a Lyα luminosity
limit of 6.3 × 1043舁erg舁s−1. We look for Lyα candidates by applying the following
criteria: (i) clear emission-line source, (ii) no optical detections (ugriz from
CFHTLS), (iii) no visible detection in the optical stack (ugriz > 27), (iv) visually
checked reliable NBJ and J detections and (v) J − K ≤ 0. We compute photometric
redshifts and remove a significant amount of dusty lower redshift line-emitters
at z ∼ 1.4 or 2.2. A total of 13 Lyα candidates were found, of which two are marked
as strong candidates, but the majority have very weak constraints on their spectral
energy distributions. Using follow-up observations with SINFONI/VLT, we are able
to exclude the most robust candidates as LAEs. We put a strong constraint on the
Lyα luminosity function at z ∼ 9 and make realistic predictions for ongoing and
future surveys. Our results show that surveys for the highest redshift LAEs are
susceptible of multiple contaminations and that spectroscopic follow-up is absolutely
necessary.'
acknowledgement: We thank the anonymous referee for the comments and suggestions which
improved both the quality and clarity of this work. DS acknowledges financial support
from the Netherlands Organisation for Scientific Research (NWO) through a Veni fellowship.
IRS acknowledges support from STFC (ST/I001573/1), a Leverhulme Fellowship, the
ERC Advanced Investigator programme DUSTYGAL 321334 and a Royal Society/Wolfson
Merit Award. PNB acknowledges support from the Leverhulme Trust. JWK acknowledges
the support from the Creative Research Initiative Program, no. 2008- 0060544, of
the National Research Foundation of Korea (NRF) funded by the Korean government
(MSIP). JPUF and BMJ acknowledge support from the ERC-StG grant EGGS-278202. The
Dark Cosmology Centre is funded by the Danish National Research Foundation. This
work is based in part on data obtained as part of the UKIRT Infrared Deep Sky Survey.
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 Canada-France-Hawaii
Telescope Legacy Survey, a collaborative project of NRC and CNRS. This work was
only possible due to OPTICON/FP7 and the access that it granted to the CFHT telescope.
The authors also wish to acknowledge the CFHTLS and UKIDSS surveys for their excellent
legacy and complementary value – without such high-quality data sets, this research
would not have been possible.
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: A. M.
full_name: Swinbank, A. M.
last_name: Swinbank
- first_name: Ian
full_name: Smail, Ian
last_name: Smail
- first_name: P. N.
full_name: Best, P. N.
last_name: Best
- first_name: Jae-Woo
full_name: Kim, Jae-Woo
last_name: Kim
- first_name: Marijn
full_name: Franx, Marijn
last_name: Franx
- first_name: Bo
full_name: Milvang-Jensen, Bo
last_name: Milvang-Jensen
- first_name: Johan
full_name: Fynbo, Johan
last_name: Fynbo
citation:
ama: 'Matthee JJ, Sobral D, Swinbank AM, et al. A 10 deg2 Lyman α survey at z=8.8
with spectroscopic follow-up: Strong constraints on the luminosity function and
implications for other surveys. Monthly Notices of the Royal Astronomical Society.
2014;440(3):2375-2387. doi:10.1093/mnras/stu392'
apa: 'Matthee, J. J., Sobral, D., Swinbank, A. M., Smail, I., Best, P. N., Kim,
J.-W., … Fynbo, J. (2014). A 10 deg2 Lyman α survey at z=8.8 with spectroscopic
follow-up: Strong constraints on the luminosity function and implications for
other surveys. Monthly Notices of the Royal Astronomical Society. Oxford
University Press. https://doi.org/10.1093/mnras/stu392'
chicago: 'Matthee, Jorryt J, David Sobral, A. M. Swinbank, Ian Smail, P. N. Best,
Jae-Woo Kim, Marijn Franx, Bo Milvang-Jensen, and Johan Fynbo. “A 10 Deg2 Lyman
α Survey at Z=8.8 with Spectroscopic Follow-up: Strong Constraints on the Luminosity
Function and Implications for Other Surveys.” Monthly Notices of the Royal
Astronomical Society. Oxford University Press, 2014. https://doi.org/10.1093/mnras/stu392.'
ieee: 'J. J. Matthee et al., “A 10 deg2 Lyman α survey at z=8.8 with spectroscopic
follow-up: Strong constraints on the luminosity function and implications for
other surveys,” Monthly Notices of the Royal Astronomical Society, vol.
440, no. 3. Oxford University Press, pp. 2375–2387, 2014.'
ista: 'Matthee JJ, Sobral D, Swinbank AM, Smail I, Best PN, Kim J-W, Franx M, Milvang-Jensen
B, Fynbo J. 2014. A 10 deg2 Lyman α survey at z=8.8 with spectroscopic follow-up:
Strong constraints on the luminosity function and implications for other surveys.
Monthly Notices of the Royal Astronomical Society. 440(3), 2375–2387.'
mla: 'Matthee, Jorryt J., et al. “A 10 Deg2 Lyman α Survey at Z=8.8 with Spectroscopic
Follow-up: Strong Constraints on the Luminosity Function and Implications for
Other Surveys.” Monthly Notices of the Royal Astronomical Society, vol.
440, no. 3, Oxford University Press, 2014, pp. 2375–87, doi:10.1093/mnras/stu392.'
short: J.J. Matthee, D. Sobral, A.M. Swinbank, I. Smail, P.N. Best, J.-W. Kim, M.
Franx, B. Milvang-Jensen, J. Fynbo, Monthly Notices of the Royal Astronomical
Society 440 (2014) 2375–2387.
date_created: 2022-07-14T12:33:24Z
date_published: 2014-05-21T00:00:00Z
date_updated: 2022-08-19T08:30:30Z
day: '21'
doi: 10.1093/mnras/stu392
extern: '1'
external_id:
arxiv:
- '1402.6697'
intvolume: ' 440'
issue: '3'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- 'galaxies: evolution'
- 'galaxies: high-redshift'
- 'cosmology: observations'
- dark ages
- reionization
- first stars
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1402.6697
month: '05'
oa: 1
oa_version: Preprint
page: 2375-2387
publication: Monthly Notices of the Royal Astronomical Society
publication_identifier:
eissn:
- 1365-2966
issn:
- 0035-8711
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'A 10 deg2 Lyman α survey at z=8.8 with spectroscopic follow-up: Strong constraints
on the luminosity function and implications for other surveys'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 440
year: '2014'
...
---
_id: '11789'
abstract:
- lang: eng
text: "We study a weighted online bipartite matching problem: G(V 1, V 2, E) is
a weighted bipartite graph where V 1 is known beforehand and the vertices of V
2 arrive online. The goal is to match vertices of V 2 as they arrive to vertices
in V 1, so as to maximize the sum of weights of edges in the matching. If assignments
to V 1 cannot be changed, no bounded competitive ratio is achievable. We study
the weighted online matching problem with free disposal, where vertices in V 1
can be assigned multiple times, but only get credit for the maximum weight edge
assigned to them over the course of the algorithm. For this problem, the greedy
algorithm is 0.5-competitive and determining whether a better competitive ratio
is achievable is a well known open problem.\r\n\r\nWe identify an interesting
special case where the edge weights are decomposable as the product of two factors,
one corresponding to each end point of the edge. This is analogous to the well
studied related machines model in the scheduling literature, although the objective
functions are different. For this case of decomposable edge weights, we design
a 0.5664 competitive randomized algorithm in complete bipartite graphs. We show
that such instances with decomposable weights are non-trivial by establishing
upper bounds of 0.618 for deterministic and 0.8 for randomized algorithms.\r\n\r\nA
tight competitive ratio of 1 − 1/e ≈ 0.632 was known previously for both the 0-1
case as well as the case where edge weights depend on the offline vertices only,
but for these cases, reassignments cannot change the quality of the solution.
Beating 0.5 for weighted matching where reassignments are necessary has been a
significant challenge. We thus give the first online algorithm with competitive
ratio strictly better than 0.5 for a non-trivial case of weighted matching with
free disposal."
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Moses
full_name: Charikar, Moses
last_name: Charikar
- 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: Huy L.
full_name: Nguyễn, Huy L.
last_name: Nguyễn
citation:
ama: 'Charikar M, Henzinger MH, Nguyễn HL. Online bipartite matching with decomposable
weights. In: 22nd Annual European Symposium on Algorithms. Vol 8737. Springer
Nature; 2014:260-271. doi:10.1007/978-3-662-44777-2_22'
apa: 'Charikar, M., Henzinger, M. H., & Nguyễn, H. L. (2014). Online bipartite
matching with decomposable weights. In 22nd Annual European Symposium on Algorithms
(Vol. 8737, pp. 260–271). Wroclaw, Poland: Springer Nature. https://doi.org/10.1007/978-3-662-44777-2_22'
chicago: Charikar, Moses, Monika H Henzinger, and Huy L. Nguyễn. “Online Bipartite
Matching with Decomposable Weights.” In 22nd Annual European Symposium on Algorithms,
8737:260–71. Springer Nature, 2014. https://doi.org/10.1007/978-3-662-44777-2_22.
ieee: M. Charikar, M. H. Henzinger, and H. L. Nguyễn, “Online bipartite matching
with decomposable weights,” in 22nd Annual European Symposium on Algorithms,
Wroclaw, Poland, 2014, vol. 8737, pp. 260–271.
ista: 'Charikar M, Henzinger MH, Nguyễn HL. 2014. Online bipartite matching with
decomposable weights. 22nd Annual European Symposium on Algorithms. ESA: Annual
European Symposium on Algorithms, LNCS, vol. 8737, 260–271.'
mla: Charikar, Moses, et al. “Online Bipartite Matching with Decomposable Weights.”
22nd Annual European Symposium on Algorithms, vol. 8737, Springer Nature,
2014, pp. 260–71, doi:10.1007/978-3-662-44777-2_22.
short: M. Charikar, M.H. Henzinger, H.L. Nguyễn, in:, 22nd Annual European Symposium
on Algorithms, Springer Nature, 2014, pp. 260–271.
conference:
end_date: 2014-09-10
location: Wroclaw, Poland
name: 'ESA: Annual European Symposium on Algorithms'
start_date: 2014-09-08
date_created: 2022-08-11T10:41:47Z
date_published: 2014-09-01T00:00:00Z
date_updated: 2023-02-13T11:16:24Z
day: '01'
doi: 10.1007/978-3-662-44777-2_22
extern: '1'
external_id:
arxiv:
- '1409.2139'
intvolume: ' 8737'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1409.2139
month: '09'
oa: 1
oa_version: Preprint
page: 260 - 271
publication: 22nd Annual European Symposium on Algorithms
publication_identifier:
isbn:
- 978-366244776-5
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Online bipartite matching with decomposable weights
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8737
year: '2014'
...
---
_id: '11855'
abstract:
- lang: eng
text: 'The decremental single-source shortest paths (SSSP) problem concerns maintaining
the distances between a given source node s to every node in an n-node m-edge
graph G undergoing edge deletions. While its static counterpart can be easily
solved in near-linear time, this decremental problem is much more challenging
even in the undirected unweighted case. In this case, the classic O(mn) total
update time of Even and Shiloach (JACM 1981) has been the fastest known algorithm
for three decades. With the loss of a (1 + ε)-approximation factor, the running
time was recently improved to O(n 2+o(1) ) by Bernstein and Roditty (SODA 2011),
and more recently to O(n 1.8+o(1) + m 1+o(1) ) by Henzinger, Krinninger, and Nanongkai
(SODA 2014). In this paper, we finally bring the running time of this case down
to near-linear: We give a (1 + ε)-approximation algorithm with O(m 1+o(1) ) total
update time, thus obtaining near-linear time. Moreover, we obtain O(m 1+o(1) log
W) time for the weighted case, where the edge weights are integers from 1 to W.
The only prior work on weighted graphs in o(mn log W) time is the O(mn 0.986 log
W)-time algorithm by Henzinger, Krinninger, and Nanongkai (STOC 2014) which works
for the general weighted directed case. In contrast to the previous results which
rely on maintaining a sparse emulator, our algorithm relies on maintaining a so-called
sparse (d, ε)-hop set introduced by Cohen (JACM 2000) in the PRAM literature.
A (d, ε)-hop set of a graph G = (V, E) is a set E'' of weighted edges such that
the distance between any pair of nodes in G can be (1 + ε)-approximated by their
d-hop distance (given by a path containing at most d edges) on G''=(V, E∪E'').
Our algorithm can maintain an (n o(1) , ε)-hop set of near-linear size in near-linear
time under edge deletions. It is the first of its kind to the best of our knowledge.
To maintain the distances on this hop set, we develop a monotone bounded-hop Even-Shiloach
tree. It results from extending and combining the monotone Even-Shiloach tree
of Henzinger, Krinninger, and Nanongkai (FOCS 2013) with the bounded-hop SSSP
technique of Bernstein (STOC 2013). These two new tools might be of independent
interest.'
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. Decremental single-source shortest
paths on undirected graphs in near-linear total update time. In: 55th Annual
Symposium on Foundations of Computer Science. Institute of Electrical and
Electronics Engineers; 2014:146-155. doi:10.1109/focs.2014.24'
apa: 'Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2014). Decremental
single-source shortest paths on undirected graphs in near-linear total update
time. In 55th Annual Symposium on Foundations of Computer Science (pp.
146–155). Philadelphia, PA, United States: Institute of Electrical and Electronics
Engineers. https://doi.org/10.1109/focs.2014.24'
chicago: Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Decremental
Single-Source Shortest Paths on Undirected Graphs in near-Linear Total Update
Time.” In 55th Annual Symposium on Foundations of Computer Science, 146–55.
Institute of Electrical and Electronics Engineers, 2014. https://doi.org/10.1109/focs.2014.24.
ieee: M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Decremental single-source
shortest paths on undirected graphs in near-linear total update time,” in 55th
Annual Symposium on Foundations of Computer Science, Philadelphia, PA, United
States, 2014, pp. 146–155.
ista: 'Henzinger MH, Krinninger S, Nanongkai D. 2014. Decremental single-source
shortest paths on undirected graphs in near-linear total update time. 55th Annual
Symposium on Foundations of Computer Science. FOCS: Annual Symposium on Foundations
of Computer Science, 146–155.'
mla: Henzinger, Monika H., et al. “Decremental Single-Source Shortest Paths on Undirected
Graphs in near-Linear Total Update Time.” 55th Annual Symposium on Foundations
of Computer Science, Institute of Electrical and Electronics Engineers, 2014,
pp. 146–55, doi:10.1109/focs.2014.24.
short: M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, 55th Annual Symposium on
Foundations of Computer Science, Institute of Electrical and Electronics Engineers,
2014, pp. 146–155.
conference:
end_date: 2014-10-21
location: Philadelphia, PA, United States
name: 'FOCS: Annual Symposium on Foundations of Computer Science'
start_date: 2014-10-18
date_created: 2022-08-16T08:14:33Z
date_published: 2014-10-01T00:00:00Z
date_updated: 2023-02-21T16:27:34Z
day: '01'
doi: 10.1109/focs.2014.24
extern: '1'
external_id:
arxiv:
- '1402.0054'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1402.0054
month: '10'
oa: 1
oa_version: Preprint
page: 146-155
publication: 55th Annual Symposium on Foundations of Computer Science
publication_identifier:
eisbn:
- 978-1-4799-6517-5
issn:
- 0272-5428
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
related_material:
record:
- id: '11768'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Decremental single-source shortest paths on undirected graphs in near-linear
total update time
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '11870'
abstract:
- lang: eng
text: "We consider dynamic algorithms for maintaining Single-Source Reachability
(SSR) and approximate Single-Source Shortest Paths (SSSP) on n-node m-edge directed
graphs under edge deletions (decremental algorithms). The previous fastest algorithm
for SSR and SSSP goes back three decades to Even and Shiloach (JACM 1981); it
has O(1) query time and O(mn) total update time (i.e., linear amortized update
time if all edges are deleted). This algorithm serves as a building block for
several other dynamic algorithms. The question whether its total update time can
be improved is a major, long standing, open problem.\r\n\r\nIn this paper, we
answer this question affirmatively. We obtain a randomized algorithm which, in
a simplified form, achieves an Õ(mn0.984) expected total update time for SSR and
(1 + ε)-approximate SSSP, where Õ(·) hides poly log n. We also extend our algorithm
to achieve roughly the same running time for Strongly Connected Components (SCC),
improving the algorithm of Roditty and Zwick (FOCS 2002), and an algorithm that
improves the Õ (mn log W)-time algorithm of Bernstein (STOC 2013) for approximating
SSSP on weighted directed graphs, where the edge weights are integers from 1 to
W. All our algorithms have constant query time in the worst case."
article_number: 674 - 683
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. Sublinear-time decremental algorithms
for single-source reachability and shortest paths on directed graphs. In: 46th
Annual ACM Symposium on Theory of Computing. Association for Computing Machinery;
2014. doi:10.1145/2591796.2591869'
apa: 'Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2014). Sublinear-time
decremental algorithms for single-source reachability and shortest paths on directed
graphs. In 46th Annual ACM Symposium on Theory of Computing. New York,
NY, United States: Association for Computing Machinery. https://doi.org/10.1145/2591796.2591869'
chicago: Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Sublinear-Time
Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed
Graphs.” In 46th Annual ACM Symposium on Theory of Computing. Association
for Computing Machinery, 2014. https://doi.org/10.1145/2591796.2591869.
ieee: M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Sublinear-time decremental
algorithms for single-source reachability and shortest paths on directed graphs,”
in 46th Annual ACM Symposium on Theory of Computing, New York, NY, United
States, 2014.
ista: 'Henzinger MH, Krinninger S, Nanongkai D. 2014. Sublinear-time decremental
algorithms for single-source reachability and shortest paths on directed graphs.
46th Annual ACM Symposium on Theory of Computing. STOC: Symposium on Theory of
Computing, 674–683.'
mla: Henzinger, Monika H., et al. “Sublinear-Time Decremental Algorithms for Single-Source
Reachability and Shortest Paths on Directed Graphs.” 46th Annual ACM Symposium
on Theory of Computing, 674–683, Association for Computing Machinery, 2014,
doi:10.1145/2591796.2591869.
short: M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, 46th Annual ACM Symposium
on Theory of Computing, Association for Computing Machinery, 2014.
conference:
end_date: 2014-06-03
location: New York, NY, United States
name: 'STOC: Symposium on Theory of Computing'
start_date: 2014-05-31
date_created: 2022-08-16T09:41:57Z
date_published: 2014-05-01T00:00:00Z
date_updated: 2023-02-17T11:18:52Z
day: '01'
doi: 10.1145/2591796.2591869
extern: '1'
external_id:
arxiv:
- '1504.07959'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1504.07959
month: '05'
oa: 1
oa_version: Preprint
publication: 46th Annual ACM Symposium on Theory of Computing
publication_identifier:
isbn:
- 978-145032710-7
issn:
- 0737-8017
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sublinear-time decremental algorithms for single-source reachability and shortest
paths on directed graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '11875'
abstract:
- lang: eng
text: We present the first deterministic data structures for maintaining approximate
minimum vertex cover and maximum matching in a fully dynamic graph in time per
update. In particular, for minimum vertex cover we provide deterministic data
structures for maintaining a (2 + ε) approximation in O(log n/ε2) amortized time
per update. For maximum matching, we show how to maintain a (3 + e) approximation
in O(m1/3/ε2) amortized time per update, and a (4 + ε) approximation in O(m1/3/ε2)
worst-case time per update. Our data structure for fully dynamic minimum vertex
cover is essentially near-optimal and settles an open problem by Onak and Rubinfeld
[13].
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. Deterministic fully dynamic data
structures for vertex cover and matching. In: 26th Annual ACM-SIAM Symposium
on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2014:785-804.
doi:10.1137/1.9781611973730.54'
apa: 'Bhattacharya, S., Henzinger, M. H., & Italiano, G. F. (2014). Deterministic
fully dynamic data structures for vertex cover and matching. In 26th Annual
ACM-SIAM Symposium on Discrete Algorithms (pp. 785–804). San Diego, CA, United
States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611973730.54'
chicago: Bhattacharya, Sayan, Monika H Henzinger, and Giuseppe F. Italiano. “Deterministic
Fully Dynamic Data Structures for Vertex Cover and Matching.” In 26th Annual
ACM-SIAM Symposium on Discrete Algorithms, 785–804. Society for Industrial
and Applied Mathematics, 2014. https://doi.org/10.1137/1.9781611973730.54.
ieee: S. Bhattacharya, M. H. Henzinger, and G. F. Italiano, “Deterministic fully
dynamic data structures for vertex cover and matching,” in 26th Annual ACM-SIAM
Symposium on Discrete Algorithms, San Diego, CA, United States, 2014, pp.
785–804.
ista: 'Bhattacharya S, Henzinger MH, Italiano GF. 2014. Deterministic fully dynamic
data structures for vertex cover and matching. 26th Annual ACM-SIAM Symposium
on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 785–804.'
mla: Bhattacharya, Sayan, et al. “Deterministic Fully Dynamic Data Structures for
Vertex Cover and Matching.” 26th Annual ACM-SIAM Symposium on Discrete Algorithms,
Society for Industrial and Applied Mathematics, 2014, pp. 785–804, doi:10.1137/1.9781611973730.54.
short: S. Bhattacharya, M.H. Henzinger, G.F. Italiano, in:, 26th Annual ACM-SIAM
Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics,
2014, pp. 785–804.
conference:
end_date: 2015-01-06
location: San Diego, CA, United States
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2015-01-04
date_created: 2022-08-16T12:36:42Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2023-02-21T16:32:06Z
day: '01'
doi: 10.1137/1.9781611973730.54
extern: '1'
external_id:
arxiv:
- '1412.1318'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1412.1318
month: '01'
oa: 1
oa_version: Preprint
page: 785-804
publication: 26th Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
eisbn:
- 978-1-61197-373-0
isbn:
- 978-1-61197-374-7
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
related_material:
record:
- id: '11890'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Deterministic fully dynamic data structures for vertex cover and matching
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '11876'
abstract:
- lang: eng
text: "We study dynamic (1 + ∊)-approximation algorithms for the single-source shortest
paths problem in an unweighted undirected n-node m-edge graph under edge deletions.
The fastest algorithm for this problem is an algorithm with O(n2+o(1)) total update
time and constant query time by Bernstein and Roditty (SODA 2011). In this paper,
we improve the total update time to O(n1.8+o(1) + m1+o(1)) while keeping the query
time constant. This running time is essentially tight when m = Ω(n1.8) since we
need Ω(m) time even in the static setting. For smaller values of m, the running
time of our algorithm is subquadratic, and is the first that breaks through the
quadratic time barrier.\r\n\r\nIn obtaining this result, we develop a fast algorithm
for what we call center cover data structure. We also make non-trivial extensions
to our previous techniques called lazy-update and monotone Even-Shiloach trees
(ICALP 2013 and FOCS 2013). As by-products of our new techniques, we obtain two
new results for the decremental all-pairs shortest-paths problem. Our first result
is the first approximation algorithm whose total update time is faster than Õ(mn)
for all values of m. Our second result is a new trade-off between the total update
time and the additive approximation guarantee."
article_processing_charge: No
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: 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. A subquadratic-time algorithm for
decremental single-source shortest paths. In: 25th Annual ACM-SIAM Symposium
on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2014:1053-1072.
doi:10.1137/1.9781611973402.79'
apa: 'Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2014). A subquadratic-time
algorithm for decremental single-source shortest paths. In 25th Annual ACM-SIAM
Symposium on Discrete Algorithms (pp. 1053–1072). Portland, OR, United States:
Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611973402.79'
chicago: Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “A Subquadratic-Time
Algorithm for Decremental Single-Source Shortest Paths.” In 25th Annual ACM-SIAM
Symposium on Discrete Algorithms, 1053–72. Society for Industrial and Applied
Mathematics, 2014. https://doi.org/10.1137/1.9781611973402.79.
ieee: M. H. Henzinger, S. Krinninger, and D. Nanongkai, “A subquadratic-time algorithm
for decremental single-source shortest paths,” in 25th Annual ACM-SIAM Symposium
on Discrete Algorithms, Portland, OR, United States, 2014, pp. 1053–1072.
ista: 'Henzinger MH, Krinninger S, Nanongkai D. 2014. A subquadratic-time algorithm
for decremental single-source shortest paths. 25th Annual ACM-SIAM Symposium on
Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1053–1072.'
mla: Henzinger, Monika H., et al. “A Subquadratic-Time Algorithm for Decremental
Single-Source Shortest Paths.” 25th Annual ACM-SIAM Symposium on Discrete Algorithms,
Society for Industrial and Applied Mathematics, 2014, pp. 1053–72, doi:10.1137/1.9781611973402.79.
short: M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, 25th Annual ACM-SIAM Symposium
on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2014,
pp. 1053–1072.
conference:
end_date: 2014-01-07
location: Portland, OR, United States
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2014-01-05
date_created: 2022-08-16T12:58:31Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2023-02-17T11:58:42Z
day: '01'
doi: 10.1137/1.9781611973402.79
extern: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1137/1.9781611973402.79
month: '01'
oa: 1
oa_version: Published Version
page: 1053-1072
publication: 25th Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
eisbn:
- 978-1-61197-340-2
isbn:
- 978-1-61197-338-9
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: A subquadratic-time algorithm for decremental single-source shortest paths
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '119'
abstract:
- lang: eng
text: Observations of flowing granular matter have suggested that same-material
tribocharging depends on particle size, typically rendering large grains positive
and small ones negative. Models assuming the transfer of trapped electrons can
account for this trend, but have not been validated. Tracking individual grains
in an electric field, we show quantitatively that charge is transferred based
on size between materially identical grains. However, the surface density of trapped
electrons, measured independently by thermoluminescence techniques, is orders
of magnitude too small to account for the scale of charge transferred. This reveals
that trapped electrons are not a necessary ingredient for same-material tribocharging.
acknowledgement: This work was supported by the NSF through DMR-1309611. Access to
the shared experimental facilities provided by the NSF-supported Chicago MRSEC (DMR-0820054)
is gratefully acknowledged. S. L. F. and J. L. P. acknowledge funding from UIC NSF
Grants No. 0850830 and No. 0602308. S. R. W. acknowledges support from a University
of Chicago Millikan Fellowship and from Mrs. Joan Winstein through the Winstein
Prize for Instrumentation.
article_number: '218001'
arxiv: 1
author:
- first_name: Scott R
full_name: Waitukaitis, Scott R
id: 3A1FFC16-F248-11E8-B48F-1D18A9856A87
last_name: Waitukaitis
orcid: 0000-0002-2299-3176
- first_name: Victor
full_name: Lee, Victor
last_name: Lee
- first_name: James
full_name: Pierson, James
last_name: Pierson
- first_name: Steven
full_name: Forman, Steven
last_name: Forman
- first_name: Heinrich
full_name: Jaeger, Heinrich
last_name: Jaeger
citation:
ama: Waitukaitis SR, Lee V, Pierson J, Forman S, Jaeger H. Size-dependent same-material
tribocharging in insulating grains. APS Physics, Physical Review Letters.
2014;112(21). doi:10.1103/PhysRevLett.112.218001
apa: Waitukaitis, S. R., Lee, V., Pierson, J., Forman, S., & Jaeger, H. (2014).
Size-dependent same-material tribocharging in insulating grains. APS Physics,
Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.112.218001
chicago: Waitukaitis, Scott R, Victor Lee, James Pierson, Steven Forman, and Heinrich
Jaeger. “Size-Dependent Same-Material Tribocharging in Insulating Grains.” APS
Physics, Physical Review Letters. American Physical Society, 2014. https://doi.org/10.1103/PhysRevLett.112.218001.
ieee: S. R. Waitukaitis, V. Lee, J. Pierson, S. Forman, and H. Jaeger, “Size-dependent
same-material tribocharging in insulating grains,” APS Physics, Physical Review
Letters, vol. 112, no. 21. American Physical Society, 2014.
ista: Waitukaitis SR, Lee V, Pierson J, Forman S, Jaeger H. 2014. Size-dependent
same-material tribocharging in insulating grains. APS Physics, Physical Review
Letters. 112(21), 218001.
mla: Waitukaitis, Scott R., et al. “Size-Dependent Same-Material Tribocharging in
Insulating Grains.” APS Physics, Physical Review Letters, vol. 112, no.
21, 218001, American Physical Society, 2014, doi:10.1103/PhysRevLett.112.218001.
short: S.R. Waitukaitis, V. Lee, J. Pierson, S. Forman, H. Jaeger, APS Physics,
Physical Review Letters 112 (2014).
date_created: 2018-12-11T11:44:44Z
date_published: 2014-05-30T00:00:00Z
date_updated: 2021-01-12T06:48:58Z
day: '30'
doi: 10.1103/PhysRevLett.112.218001
extern: '1'
external_id:
arxiv:
- '1309.2578'
intvolume: ' 112'
issue: '21'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1309.2578
month: '05'
oa: 1
oa_version: Submitted Version
publication: APS Physics, Physical Review Letters
publication_status: published
publisher: American Physical Society
publist_id: '7935'
quality_controlled: '1'
status: public
title: Size-dependent same-material tribocharging in insulating grains
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 112
year: '2014'
...
---
_id: '11968'
abstract:
- lang: eng
text: 'Membrane phospholipids typically contain fatty acids (FAs) of 16 and 18 carbon
atoms. This particular chain length is evolutionarily highly conserved and presumably
provides maximum stability and dynamic properties to biological membranes in response
to nutritional or environmental cues. Here, we show that the relative proportion
of C16 versus C18 FAs is regulated by the activity of acetyl-CoA carboxylase (Acc1),
the first and rate-limiting enzyme of FA de novo synthesis. Acc1 activity is attenuated
by AMPK/Snf1-dependent phosphorylation, which is required to maintain an appropriate
acyl-chain length distribution. Moreover, we find that the transcriptional repressor
Opi1 preferentially binds to C16 over C18 phosphatidic acid (PA) species: thus,
C16-chain containing PA sequesters Opi1 more effectively to the ER, enabling AMPK/Snf1
control of PA acyl-chain length to determine the degree of derepression of Opi1
target genes. These findings reveal an unexpected regulatory link between the
major energy-sensing kinase, membrane lipid composition, and transcription.'
article_processing_charge: No
article_type: original
author:
- first_name: Harald F.
full_name: Hofbauer, Harald F.
last_name: Hofbauer
- first_name: Florian H.
full_name: Schopf, Florian H.
last_name: Schopf
- first_name: Hannes
full_name: Schleifer, Hannes
last_name: Schleifer
- first_name: Oskar L.
full_name: Knittelfelder, Oskar L.
last_name: Knittelfelder
- first_name: Bartholomäus
full_name: Pieber, Bartholomäus
id: 93e5e5b2-0da6-11ed-8a41-af589a024726
last_name: Pieber
orcid: 0000-0001-8689-388X
- first_name: Gerald N.
full_name: Rechberger, Gerald N.
last_name: Rechberger
- first_name: Heimo
full_name: Wolinski, Heimo
last_name: Wolinski
- first_name: Maria L.
full_name: Gaspar, Maria L.
last_name: Gaspar
- first_name: C. Oliver
full_name: Kappe, C. Oliver
last_name: Kappe
- first_name: Johannes
full_name: Stadlmann, Johannes
last_name: Stadlmann
- first_name: Karl
full_name: Mechtler, Karl
last_name: Mechtler
- first_name: Alexandra
full_name: Zenz, Alexandra
last_name: Zenz
- first_name: Karl
full_name: Lohner, Karl
last_name: Lohner
- first_name: Oksana
full_name: Tehlivets, Oksana
last_name: Tehlivets
- first_name: Susan A.
full_name: Henry, Susan A.
last_name: Henry
- first_name: Sepp D.
full_name: Kohlwein, Sepp D.
last_name: Kohlwein
citation:
ama: Hofbauer HF, Schopf FH, Schleifer H, et al. Regulation of gene expression through
a transcriptional repressor that senses acyl-chain length in membrane phospholipids.
Developmental Cell. 2014;29(6):P729-739. doi:10.1016/j.devcel.2014.04.025
apa: Hofbauer, H. F., Schopf, F. H., Schleifer, H., Knittelfelder, O. L., Pieber,
B., Rechberger, G. N., … Kohlwein, S. D. (2014). Regulation of gene expression
through a transcriptional repressor that senses acyl-chain length in membrane
phospholipids. Developmental Cell. Elsevier. https://doi.org/10.1016/j.devcel.2014.04.025
chicago: Hofbauer, Harald F., Florian H. Schopf, Hannes Schleifer, Oskar L. Knittelfelder,
Bartholomäus Pieber, Gerald N. Rechberger, Heimo Wolinski, et al. “Regulation
of Gene Expression through a Transcriptional Repressor That Senses Acyl-Chain
Length in Membrane Phospholipids.” Developmental Cell. Elsevier, 2014.
https://doi.org/10.1016/j.devcel.2014.04.025.
ieee: H. F. Hofbauer et al., “Regulation of gene expression through a transcriptional
repressor that senses acyl-chain length in membrane phospholipids,” Developmental
Cell, vol. 29, no. 6. Elsevier, pp. P729-739, 2014.
ista: Hofbauer HF, Schopf FH, Schleifer H, Knittelfelder OL, Pieber B, Rechberger
GN, Wolinski H, Gaspar ML, Kappe CO, Stadlmann J, Mechtler K, Zenz A, Lohner K,
Tehlivets O, Henry SA, Kohlwein SD. 2014. Regulation of gene expression through
a transcriptional repressor that senses acyl-chain length in membrane phospholipids.
Developmental Cell. 29(6), P729-739.
mla: Hofbauer, Harald F., et al. “Regulation of Gene Expression through a Transcriptional
Repressor That Senses Acyl-Chain Length in Membrane Phospholipids.” Developmental
Cell, vol. 29, no. 6, Elsevier, 2014, pp. P729-739, doi:10.1016/j.devcel.2014.04.025.
short: H.F. Hofbauer, F.H. Schopf, H. Schleifer, O.L. Knittelfelder, B. Pieber,
G.N. Rechberger, H. Wolinski, M.L. Gaspar, C.O. Kappe, J. Stadlmann, K. Mechtler,
A. Zenz, K. Lohner, O. Tehlivets, S.A. Henry, S.D. Kohlwein, Developmental Cell
29 (2014) P729-739.
date_created: 2022-08-25T08:42:42Z
date_published: 2014-06-23T00:00:00Z
date_updated: 2023-02-21T10:09:45Z
day: '23'
doi: 10.1016/j.devcel.2014.04.025
extern: '1'
external_id:
pmid:
- '24960695'
intvolume: ' 29'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.devcel.2014.04.025
month: '06'
oa: 1
oa_version: Published Version
page: P729-739
pmid: 1
publication: Developmental Cell
publication_identifier:
eissn:
- 1878-1551
issn:
- 1534-5807
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Regulation of gene expression through a transcriptional repressor that senses
acyl-chain length in membrane phospholipids
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 29
year: '2014'
...
---
_id: '12638'
abstract:
- lang: eng
text: Central Asian water resources largely depend on melt water generated in the
Pamir and Tien Shan mountain ranges. To estimate future water availability in
this region, it is necessary to use climate projections to estimate the future
glacier extent and volume. In this study, we evaluate the impact of uncertainty
in climate change projections on the future glacier extent in the Amu and Syr
Darya river basins. To this end we use the latest climate change projections generated
for the upcoming IPCC report (CMIP5) and, for comparison, projections used in
the fourth IPCC assessment (CMIP3). With these projections we force a regionalized
glacier mass balance model, and estimate changes in the basins' glacier extent
as a function of the glacier size distribution in the basins and projected temperature
and precipitation. This glacier mass balance model is specifically developed for
implementation in large scale hydrological models, where the spatial resolution
does not allow for simulating individual glaciers and data scarcity is an issue.
Although the CMIP5 ensemble results in greater regional warming than the CMIP3
ensemble and the range in projections for temperature as well as precipitation
is wider for the CMIP5 than for the CMIP3, the spread in projections of future
glacier extent in Central Asia is similar for both ensembles. This is because
differences in temperature rise are small during periods of maximum melt (July–September)
while differences in precipitation change are small during the period of maximum
accumulation (October–February). However, the model uncertainty due to parameter
uncertainty is high, and has roughly the same importance as uncertainty in the
climate projections. Uncertainty about the size of the decline in glacier extent
remains large, making estimates of future Central Asian glacier evolution and
downstream water availability uncertain.
article_processing_charge: No
article_type: original
author:
- first_name: A. F.
full_name: Lutz, A. F.
last_name: Lutz
- first_name: W. W.
full_name: Immerzeel, W. W.
last_name: Immerzeel
- first_name: A.
full_name: Gobiet, A.
last_name: Gobiet
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
- first_name: M. F. P.
full_name: Bierkens, M. F. P.
last_name: Bierkens
citation:
ama: Lutz AF, Immerzeel WW, Gobiet A, Pellicciotti F, Bierkens MFP. Comparison of
climate change signals in CMIP3 and CMIP5 multi-model ensembles and implications
for Central Asian glaciers. Hydrology and Earth System Sciences. 2013;17(9):3661-3677.
doi:10.5194/hess-17-3661-2013
apa: Lutz, A. F., Immerzeel, W. W., Gobiet, A., Pellicciotti, F., & Bierkens,
M. F. P. (2013). Comparison of climate change signals in CMIP3 and CMIP5 multi-model
ensembles and implications for Central Asian glaciers. Hydrology and Earth
System Sciences. Copernicus GmbH. https://doi.org/10.5194/hess-17-3661-2013
chicago: Lutz, A. F., W. W. Immerzeel, A. Gobiet, Francesca Pellicciotti, and M.
F. P. Bierkens. “Comparison of Climate Change Signals in CMIP3 and CMIP5 Multi-Model
Ensembles and Implications for Central Asian Glaciers.” Hydrology and Earth
System Sciences. Copernicus GmbH, 2013. https://doi.org/10.5194/hess-17-3661-2013.
ieee: A. F. Lutz, W. W. Immerzeel, A. Gobiet, F. Pellicciotti, and M. F. P. Bierkens,
“Comparison of climate change signals in CMIP3 and CMIP5 multi-model ensembles
and implications for Central Asian glaciers,” Hydrology and Earth System Sciences,
vol. 17, no. 9. Copernicus GmbH, pp. 3661–3677, 2013.
ista: Lutz AF, Immerzeel WW, Gobiet A, Pellicciotti F, Bierkens MFP. 2013. Comparison
of climate change signals in CMIP3 and CMIP5 multi-model ensembles and implications
for Central Asian glaciers. Hydrology and Earth System Sciences. 17(9), 3661–3677.
mla: Lutz, A. F., et al. “Comparison of Climate Change Signals in CMIP3 and CMIP5
Multi-Model Ensembles and Implications for Central Asian Glaciers.” Hydrology
and Earth System Sciences, vol. 17, no. 9, Copernicus GmbH, 2013, pp. 3661–77,
doi:10.5194/hess-17-3661-2013.
short: A.F. Lutz, W.W. Immerzeel, A. Gobiet, F. Pellicciotti, M.F.P. Bierkens, Hydrology
and Earth System Sciences 17 (2013) 3661–3677.
date_created: 2023-02-20T08:17:05Z
date_published: 2013-09-01T00:00:00Z
date_updated: 2023-02-24T08:19:48Z
day: '01'
doi: 10.5194/hess-17-3661-2013
extern: '1'
intvolume: ' 17'
issue: '9'
keyword:
- General Earth and Planetary Sciences
- General Engineering
- General Environmental Science
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.5194/hess-17-3661-2013
month: '09'
oa: 1
oa_version: Published Version
page: 3661-3677
publication: Hydrology and Earth System Sciences
publication_identifier:
issn:
- 1607-7938
publication_status: published
publisher: Copernicus GmbH
quality_controlled: '1'
scopus_import: '1'
status: public
title: Comparison of climate change signals in CMIP3 and CMIP5 multi-model ensembles
and implications for Central Asian glaciers
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 17
year: '2013'
...
---
_id: '12639'
abstract:
- lang: eng
text: 'In the headwater catchments of the main Asian rivers, glaciohydrological
models are a useful tool to anticipate impacts of climatic changes. However, the
reliability of their projections strongly depends on the quality and quantity
of data that are available for parameter estimation, model calibration and validation,
as well as on the accuracy of climate change projections. In this study the physically
oriented, glaciohydrological model TOPKAPI-ETH is used to simulate future changes
in snow, glacier, and runoff from the Hunza River Basin in northern Pakistan.
Three key sources of model uncertainty in future runoff projections are compared:
model parameters, climate projections, and natural climate variability. A novel
approach, applicable also to ungauged catchments, is used to determine which model
parameters and model components significantly affect the overall model uncertainty.
We show that the model is capable of reproducing streamflow and glacier mass balances,
but that all analyzed sources of uncertainty significantly affect the reliability
of future projections, and that their effect is variable in time and in space.
The effect of parametric uncertainty often exceeds the impact of climate uncertainty
and natural climate variability, especially in heavily glacierized subcatchments.
The results of the uncertainty analysis allow detailed recommendations on network
design and the timing and location of field measurements, which could efficiently
help to reduce model uncertainty in the future.'
article_processing_charge: No
article_type: original
author:
- first_name: S.
full_name: Ragettli, S.
last_name: Ragettli
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
- first_name: R.
full_name: Bordoy, R.
last_name: Bordoy
- first_name: W. W.
full_name: Immerzeel, W. W.
last_name: Immerzeel
citation:
ama: Ragettli S, Pellicciotti F, Bordoy R, Immerzeel WW. Sources of uncertainty
in modeling the glaciohydrological response of a Karakoram watershed to climate
change. Water Resources Research. 2013;49(9):6048-6066. doi:10.1002/wrcr.20450
apa: Ragettli, S., Pellicciotti, F., Bordoy, R., & Immerzeel, W. W. (2013).
Sources of uncertainty in modeling the glaciohydrological response of a Karakoram
watershed to climate change. Water Resources Research. American Geophysical
Union. https://doi.org/10.1002/wrcr.20450
chicago: Ragettli, S., Francesca Pellicciotti, R. Bordoy, and W. W. Immerzeel. “Sources
of Uncertainty in Modeling the Glaciohydrological Response of a Karakoram Watershed
to Climate Change.” Water Resources Research. American Geophysical Union,
2013. https://doi.org/10.1002/wrcr.20450.
ieee: S. Ragettli, F. Pellicciotti, R. Bordoy, and W. W. Immerzeel, “Sources of
uncertainty in modeling the glaciohydrological response of a Karakoram watershed
to climate change,” Water Resources Research, vol. 49, no. 9. American
Geophysical Union, pp. 6048–6066, 2013.
ista: Ragettli S, Pellicciotti F, Bordoy R, Immerzeel WW. 2013. Sources of uncertainty
in modeling the glaciohydrological response of a Karakoram watershed to climate
change. Water Resources Research. 49(9), 6048–6066.
mla: Ragettli, S., et al. “Sources of Uncertainty in Modeling the Glaciohydrological
Response of a Karakoram Watershed to Climate Change.” Water Resources Research,
vol. 49, no. 9, American Geophysical Union, 2013, pp. 6048–66, doi:10.1002/wrcr.20450.
short: S. Ragettli, F. Pellicciotti, R. Bordoy, W.W. Immerzeel, Water Resources
Research 49 (2013) 6048–6066.
date_created: 2023-02-20T08:17:12Z
date_published: 2013-03-01T00:00:00Z
date_updated: 2023-02-24T08:16:19Z
day: '01'
doi: 10.1002/wrcr.20450
extern: '1'
intvolume: ' 49'
issue: '9'
keyword:
- Water Science and Technology
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1002/wrcr.20450
month: '03'
oa: 1
oa_version: Published Version
page: 6048-6066
publication: Water Resources Research
publication_identifier:
issn:
- 0043-1397
publication_status: published
publisher: American Geophysical Union
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sources of uncertainty in modeling the glaciohydrological response of a Karakoram
watershed to climate change
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 49
year: '2013'
...
---
_id: '12641'
abstract:
- lang: eng
text: We investigate the sensitivity of a distributed enhanced temperature-index
(ETI) melt model, in order to understand which parameters have the largest influence
on model outputs and thus need to be accurately known. We use melt and meteorological
data from two Alpine glaciers and one glacier in the Andes of Chile. Sensitivity
analysis is conducted in a systematic way in terms of parameters and the different
conditions (day, night, clear-sky, overcast), melt seasons and glaciers examined.
The sensitivity of total melt to changes in individual parameters is calculated
using a local method around the optimal value of the parameters. We verify that
the parameters are optimal at the distributed scale and assess the model uncertainty
induced by uncertainty in the parameters using a Monte Carlo technique. Model
sensitivity to parameters is consistent across melt seasons, glaciers, different
conditions and the daily statistics examined. The parameters to which the model
is most sensitive are the shortwave-radiation factor, the temperature lapse rate
for extrapolation of air temperature, the albedo parameters, the temperature threshold
and the cloud transmittance factor parameters. A parameter uncertainty of 5% results
in a model uncertainty of 5.6% of mean melt on Haut Glacier d’Arolla, Switzerland.
article_processing_charge: No
article_type: original
author:
- first_name: Martin
full_name: Heynen, Martin
last_name: Heynen
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
- first_name: Marco
full_name: Carenzo, Marco
last_name: Carenzo
citation:
ama: Heynen M, Pellicciotti F, Carenzo M. Parameter sensitivity of a distributed
enhanced temperature-index melt model. Annals of Glaciology. 2013;54(63):311-321.
doi:10.3189/2013aog63a537
apa: Heynen, M., Pellicciotti, F., & Carenzo, M. (2013). Parameter sensitivity
of a distributed enhanced temperature-index melt model. Annals of Glaciology.
International Glaciological Society. https://doi.org/10.3189/2013aog63a537
chicago: Heynen, Martin, Francesca Pellicciotti, and Marco Carenzo. “Parameter Sensitivity
of a Distributed Enhanced Temperature-Index Melt Model.” Annals of Glaciology.
International Glaciological Society, 2013. https://doi.org/10.3189/2013aog63a537.
ieee: M. Heynen, F. Pellicciotti, and M. Carenzo, “Parameter sensitivity of a distributed
enhanced temperature-index melt model,” Annals of Glaciology, vol. 54,
no. 63. International Glaciological Society, pp. 311–321, 2013.
ista: Heynen M, Pellicciotti F, Carenzo M. 2013. Parameter sensitivity of a distributed
enhanced temperature-index melt model. Annals of Glaciology. 54(63), 311–321.
mla: Heynen, Martin, et al. “Parameter Sensitivity of a Distributed Enhanced Temperature-Index
Melt Model.” Annals of Glaciology, vol. 54, no. 63, International Glaciological
Society, 2013, pp. 311–21, doi:10.3189/2013aog63a537.
short: M. Heynen, F. Pellicciotti, M. Carenzo, Annals of Glaciology 54 (2013) 311–321.
date_created: 2023-02-20T08:17:21Z
date_published: 2013-08-01T00:00:00Z
date_updated: 2023-02-21T10:43:42Z
day: '01'
doi: 10.3189/2013aog63a537
extern: '1'
intvolume: ' 54'
issue: '63'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.3189/2013aog63a537
month: '08'
oa: 1
oa_version: Published Version
page: 311-321
publication: Annals of Glaciology
publication_identifier:
eissn:
- 1727-5644
issn:
- 0260-3055
publication_status: published
publisher: International Glaciological Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Parameter sensitivity of a distributed enhanced temperature-index melt model
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 54
year: '2013'
...