---
_id: '163'
abstract:
- lang: eng
text: For ultrafast fixation of biological samples to avoid artifacts, high-pressure
freezing (HPF) followed by freeze substitution (FS) is preferred over chemical
fixation at room temperature. After HPF, samples are maintained at low temperature
during dehydration and fixation, while avoiding damaging recrystallization. This
is a notoriously slow process. McDonald and Webb demonstrated, in 2011, that sample
agitation during FS dramatically reduces the necessary time. Then, in 2015, we
(H.G. and S.R.) introduced an agitation module into the cryochamber of an automated
FS unit and demonstrated that the preparation of algae could be shortened from
days to a couple of hours. We argued that variability in the processing, reproducibility,
and safety issues are better addressed using automated FS units. For dissemination,
we started low-cost manufacturing of agitation modules for two of the most widely
used FS units, the Automatic Freeze Substitution Systems, AFS(1) and AFS2, from
Leica Microsystems, using three dimensional (3D)-printing of the major components.
To test them, several labs independently used the modules on a wide variety of
specimens that had previously been processed by manual agitation, or without agitation.
We demonstrate that automated processing with sample agitation saves time, increases
flexibility with respect to sample requirements and protocols, and produces data
of at least as good quality as other approaches.
article_processing_charge: No
article_type: original
author:
- first_name: Siegfried
full_name: Reipert, Siegfried
last_name: Reipert
- first_name: Helmuth
full_name: Goldammer, Helmuth
last_name: Goldammer
- first_name: Christine
full_name: Richardson, Christine
last_name: Richardson
- first_name: Martin
full_name: Goldberg, Martin
last_name: Goldberg
- first_name: Timothy
full_name: Hawkins, Timothy
last_name: Hawkins
- first_name: Elena
full_name: Hollergschwandtner, Elena
id: 3C054040-F248-11E8-B48F-1D18A9856A87
last_name: Hollergschwandtner
- first_name: Walter
full_name: Kaufmann, Walter
id: 3F99E422-F248-11E8-B48F-1D18A9856A87
last_name: Kaufmann
orcid: 0000-0001-9735-5315
- first_name: Sebastian
full_name: Antreich, Sebastian
last_name: Antreich
- first_name: York
full_name: Stierhof, York
last_name: Stierhof
citation:
ama: 'Reipert S, Goldammer H, Richardson C, et al. Agitation modules: Flexible means
to accelerate automated freeze substitution. Journal of Histochemistry and
Cytochemistry. 2018;66(12):903-921. doi:10.1369/0022155418786698'
apa: 'Reipert, S., Goldammer, H., Richardson, C., Goldberg, M., Hawkins, T., Saeckl,
E., … Stierhof, Y. (2018). Agitation modules: Flexible means to accelerate automated
freeze substitution. Journal of Histochemistry and Cytochemistry. SAGE
Publications. https://doi.org/10.1369/0022155418786698'
chicago: 'Reipert, Siegfried, Helmuth Goldammer, Christine Richardson, Martin Goldberg,
Timothy Hawkins, Elena Saeckl, Walter Kaufmann, Sebastian Antreich, and York Stierhof.
“Agitation Modules: Flexible Means to Accelerate Automated Freeze Substitution.”
Journal of Histochemistry and Cytochemistry. SAGE Publications, 2018. https://doi.org/10.1369/0022155418786698.'
ieee: 'S. Reipert et al., “Agitation modules: Flexible means to accelerate
automated freeze substitution,” Journal of Histochemistry and Cytochemistry,
vol. 66, no. 12. SAGE Publications, pp. 903–921, 2018.'
ista: 'Reipert S, Goldammer H, Richardson C, Goldberg M, Hawkins T, Saeckl E, Kaufmann
W, Antreich S, Stierhof Y. 2018. Agitation modules: Flexible means to accelerate
automated freeze substitution. Journal of Histochemistry and Cytochemistry. 66(12),
903–921.'
mla: 'Reipert, Siegfried, et al. “Agitation Modules: Flexible Means to Accelerate
Automated Freeze Substitution.” Journal of Histochemistry and Cytochemistry,
vol. 66, no. 12, SAGE Publications, 2018, pp. 903–21, doi:10.1369/0022155418786698.'
short: S. Reipert, H. Goldammer, C. Richardson, M. Goldberg, T. Hawkins, E. Saeckl,
W. Kaufmann, S. Antreich, Y. Stierhof, Journal of Histochemistry and Cytochemistry
66 (2018) 903–921.
date_created: 2018-12-11T11:44:57Z
date_published: 2018-12-01T00:00:00Z
date_updated: 2023-10-17T08:42:24Z
day: '01'
department:
- _id: RySh
- _id: EM-Fac
doi: 10.1369/0022155418786698
external_id:
isi:
- '000452277700005'
pmid:
- '29969056'
intvolume: ' 66'
isi: 1
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1369/0022155418786698
month: '12'
oa: 1
oa_version: Published Version
page: 903-921
pmid: 1
publication: Journal of Histochemistry and Cytochemistry
publication_identifier:
issn:
- 0022-1554
publication_status: published
publisher: SAGE Publications
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Agitation modules: Flexible means to accelerate automated freeze substitution'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 66
year: '2018'
...
---
_id: '17'
abstract:
- lang: eng
text: Creeping flow of polymeric fluid without inertia exhibits elastic instabilities
and elastic turbulence accompanied by drag enhancement due to elastic stress produced
by flow-stretched polymers. However, in inertia-dominated flow at high Re and
low fluid elasticity El, a reduction in turbulent frictional drag is caused by
an intricate competition between inertial and elastic stresses. Here we explore
the effect of inertia on the stability of viscoelastic flow in a broad range of
control parameters El and (Re,Wi). We present the stability diagram of observed
flow regimes in Wi-Re coordinates and find that the instabilities' onsets show
an unexpectedly nonmonotonic dependence on El. Further, three distinct regions
in the diagram are identified based on El. Strikingly, for high-elasticity fluids
we discover a complete relaminarization of flow at Reynolds number in the range
of 1 to 10, different from a well-known turbulent drag reduction. These counterintuitive
effects may be explained by a finite polymer extensibility and a suppression of
vorticity at high Wi. Our results call for further theoretical and numerical development
to uncover the role of inertial effect on elastic turbulence in a viscoelastic
flow.
article_number: '103302 '
article_processing_charge: No
author:
- first_name: Atul
full_name: Varshney, Atul
id: 2A2006B2-F248-11E8-B48F-1D18A9856A87
last_name: Varshney
orcid: 0000-0002-3072-5999
- first_name: Victor
full_name: Steinberg, Victor
last_name: Steinberg
citation:
ama: Varshney A, Steinberg V. Drag enhancement and drag reduction in viscoelastic
flow. Physical Review Fluids. 2018;3(10). doi:10.1103/PhysRevFluids.3.103302
apa: Varshney, A., & Steinberg, V. (2018). Drag enhancement and drag reduction
in viscoelastic flow. Physical Review Fluids. American Physical Society.
https://doi.org/10.1103/PhysRevFluids.3.103302
chicago: Varshney, Atul, and Victor Steinberg. “Drag Enhancement and Drag Reduction
in Viscoelastic Flow.” Physical Review Fluids. American Physical Society,
2018. https://doi.org/10.1103/PhysRevFluids.3.103302.
ieee: A. Varshney and V. Steinberg, “Drag enhancement and drag reduction in viscoelastic
flow,” Physical Review Fluids, vol. 3, no. 10. American Physical Society,
2018.
ista: Varshney A, Steinberg V. 2018. Drag enhancement and drag reduction in viscoelastic
flow. Physical Review Fluids. 3(10), 103302.
mla: Varshney, Atul, and Victor Steinberg. “Drag Enhancement and Drag Reduction
in Viscoelastic Flow.” Physical Review Fluids, vol. 3, no. 10, 103302,
American Physical Society, 2018, doi:10.1103/PhysRevFluids.3.103302.
short: A. Varshney, V. Steinberg, Physical Review Fluids 3 (2018).
date_created: 2018-12-11T11:44:11Z
date_published: 2018-10-15T00:00:00Z
date_updated: 2023-09-11T12:59:28Z
day: '15'
ddc:
- '532'
department:
- _id: BjHo
doi: 10.1103/PhysRevFluids.3.103302
ec_funded: 1
external_id:
isi:
- '000447311500001'
file:
- access_level: open_access
checksum: e1445be33e8165114e96246275600750
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:14Z
date_updated: 2020-07-14T12:45:12Z
file_id: '4800'
file_name: IST-2018-1061-v1+1_PhysRevFluids.3.103302.pdf
file_size: 1409040
relation: main_file
file_date_updated: 2020-07-14T12:45:12Z
has_accepted_license: '1'
intvolume: ' 3'
isi: 1
issue: '10'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Physical Review Fluids
publication_status: published
publisher: American Physical Society
publist_id: '8038'
pubrep_id: '1061'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Drag enhancement and drag reduction in viscoelastic flow
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 3
year: '2018'
...
---
_id: '174'
abstract:
- lang: eng
text: We survey recent efforts to quantify failures of the Hasse principle in families
of rationally connected varieties.
alternative_title:
- Proceedings of Symposia in Pure Mathematics
article_processing_charge: No
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
citation:
ama: 'Browning TD. How often does the Hasse principle hold? In: Vol 97. American
Mathematical Society; 2018:89-102. doi:10.1090/pspum/097.2/01700'
apa: 'Browning, T. D. (2018). How often does the Hasse principle hold? (Vol. 97,
pp. 89–102). Presented at the Algebraic Geometry, Salt Lake City, Utah, USA: American
Mathematical Society. https://doi.org/10.1090/pspum/097.2/01700'
chicago: Browning, Timothy D. “How Often Does the Hasse Principle Hold?,” 97:89–102.
American Mathematical Society, 2018. https://doi.org/10.1090/pspum/097.2/01700.
ieee: T. D. Browning, “How often does the Hasse principle hold?,” presented at the
Algebraic Geometry, Salt Lake City, Utah, USA, 2018, vol. 97, no. 2, pp. 89–102.
ista: Browning TD. 2018. How often does the Hasse principle hold? Algebraic Geometry,
Proceedings of Symposia in Pure Mathematics, vol. 97, 89–102.
mla: Browning, Timothy D. How Often Does the Hasse Principle Hold? Vol. 97,
no. 2, American Mathematical Society, 2018, pp. 89–102, doi:10.1090/pspum/097.2/01700.
short: T.D. Browning, in:, American Mathematical Society, 2018, pp. 89–102.
conference:
end_date: 2015-07-10
location: Salt Lake City, Utah, USA
name: Algebraic Geometry
start_date: 2015-07-06
date_created: 2018-12-11T11:45:01Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2021-01-12T06:52:54Z
day: '01'
doi: 10.1090/pspum/097.2/01700
extern: '1'
intvolume: ' 97'
issue: '2'
language:
- iso: eng
month: '01'
oa_version: None
page: 89 - 102
publication_status: published
publisher: American Mathematical Society
quality_controlled: '1'
status: public
title: How often does the Hasse principle hold?
type: conference
user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425
volume: 97
year: '2018'
...
---
_id: '176'
abstract:
- lang: eng
text: For a general class of non-negative functions defined on integral ideals of
number fields, upper bounds are established for their average over the values
of certain principal ideals that are associated to irreducible binary forms with
integer coefficients.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
- first_name: Efthymios
full_name: Sofos, Efthymios
last_name: Sofos
citation:
ama: Browning TD, Sofos E. Averages of arithmetic functions over principal ideals.
International Journal of Nuber Theory. 2018;15(3):547-567. doi:10.1142/S1793042119500283
apa: Browning, T. D., & Sofos, E. (2018). Averages of arithmetic functions over
principal ideals. International Journal of Nuber Theory. World Scientific
Publishing. https://doi.org/10.1142/S1793042119500283
chicago: Browning, Timothy D, and Efthymios Sofos. “Averages of Arithmetic Functions
over Principal Ideals.” International Journal of Nuber Theory. World Scientific
Publishing, 2018. https://doi.org/10.1142/S1793042119500283.
ieee: T. D. Browning and E. Sofos, “Averages of arithmetic functions over principal
ideals,” International Journal of Nuber Theory, vol. 15, no. 3. World Scientific
Publishing, pp. 547–567, 2018.
ista: Browning TD, Sofos E. 2018. Averages of arithmetic functions over principal
ideals. International Journal of Nuber Theory. 15(3), 547–567.
mla: Browning, Timothy D., and Efthymios Sofos. “Averages of Arithmetic Functions
over Principal Ideals.” International Journal of Nuber Theory, vol. 15,
no. 3, World Scientific Publishing, 2018, pp. 547–67, doi:10.1142/S1793042119500283.
short: T.D. Browning, E. Sofos, International Journal of Nuber Theory 15 (2018)
547–567.
date_created: 2018-12-11T11:45:01Z
date_published: 2018-11-16T00:00:00Z
date_updated: 2021-01-12T06:53:01Z
day: '16'
doi: 10.1142/S1793042119500283
extern: '1'
external_id:
arxiv:
- '1706.04331'
intvolume: ' 15'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1706.04331
month: '11'
oa: 1
oa_version: Preprint
page: 547-567
publication: International Journal of Nuber Theory
publication_status: published
publisher: World Scientific Publishing
status: public
title: Averages of arithmetic functions over principal ideals
type: journal_article
user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425
volume: 15
year: '2018'
...
---
_id: '178'
abstract:
- lang: eng
text: We give an upper bound for the number of rational points of height at most
B, lying on a surface defined by a quadratic form Q. The bound shows an explicit
dependence on Q. It is optimal with respect to B, and is also optimal for typical
forms Q.
article_processing_charge: No
arxiv: 1
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
- first_name: Roger
full_name: Heath-Brown, Roger
last_name: Heath-Brown
citation:
ama: Browning TD, Heath-Brown R. Counting rational points on quadric surfaces. Discrete
Analysis. 2018;15:1-29. doi:10.19086/da.4375
apa: Browning, T. D., & Heath-Brown, R. (2018). Counting rational points on
quadric surfaces. Discrete Analysis. Alliance of Diamond Open Access Journals.
https://doi.org/10.19086/da.4375
chicago: Browning, Timothy D, and Roger Heath-Brown. “Counting Rational Points on
Quadric Surfaces.” Discrete Analysis. Alliance of Diamond Open Access Journals,
2018. https://doi.org/10.19086/da.4375.
ieee: T. D. Browning and R. Heath-Brown, “Counting rational points on quadric surfaces,”
Discrete Analysis, vol. 15. Alliance of Diamond Open Access Journals, pp.
1–29, 2018.
ista: Browning TD, Heath-Brown R. 2018. Counting rational points on quadric surfaces.
Discrete Analysis. 15, 1–29.
mla: Browning, Timothy D., and Roger Heath-Brown. “Counting Rational Points on Quadric
Surfaces.” Discrete Analysis, vol. 15, Alliance of Diamond Open Access
Journals, 2018, pp. 1–29, doi:10.19086/da.4375.
short: T.D. Browning, R. Heath-Brown, Discrete Analysis 15 (2018) 1–29.
date_created: 2018-12-11T11:45:02Z
date_published: 2018-09-07T00:00:00Z
date_updated: 2022-08-26T09:13:02Z
day: '07'
ddc:
- '512'
doi: 10.19086/da.4375
extern: '1'
external_id:
arxiv:
- '1801.00979'
intvolume: ' 15'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1801.00979
month: '09'
oa: 1
oa_version: Preprint
page: 1 - 29
publication: Discrete Analysis
publication_identifier:
eissn:
- 2397-3129
publication_status: published
publisher: Alliance of Diamond Open Access Journals
quality_controlled: '1'
status: public
title: Counting rational points on quadric surfaces
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2018'
...
---
_id: '18'
abstract:
- lang: eng
text: An N-superconcentrator is a directed, acyclic graph with N input nodes and
N output nodes such that every subset of the inputs and every subset of the outputs
of same cardinality can be connected by node-disjoint paths. It is known that
linear-size and bounded-degree superconcentrators exist. We prove the existence
of such superconcentrators with asymptotic density 25.3 (where the density is
the number of edges divided by N). The previously best known densities were 28
[12] and 27.4136 [17].
article_processing_charge: No
arxiv: 1
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Michal
full_name: Rolinek, Michal
id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87
last_name: Rolinek
citation:
ama: Kolmogorov V, Rolinek M. Superconcentrators of density 25.3. Ars Combinatoria.
2018;141(10):269-304.
apa: Kolmogorov, V., & Rolinek, M. (2018). Superconcentrators of density 25.3.
Ars Combinatoria. Charles Babbage Research Centre.
chicago: Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density
25.3.” Ars Combinatoria. Charles Babbage Research Centre, 2018.
ieee: V. Kolmogorov and M. Rolinek, “Superconcentrators of density 25.3,” Ars
Combinatoria, vol. 141, no. 10. Charles Babbage Research Centre, pp. 269–304,
2018.
ista: Kolmogorov V, Rolinek M. 2018. Superconcentrators of density 25.3. Ars Combinatoria.
141(10), 269–304.
mla: Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.”
Ars Combinatoria, vol. 141, no. 10, Charles Babbage Research Centre, 2018,
pp. 269–304.
short: V. Kolmogorov, M. Rolinek, Ars Combinatoria 141 (2018) 269–304.
date_created: 2018-12-11T11:44:11Z
date_published: 2018-10-01T00:00:00Z
date_updated: 2023-09-19T14:46:18Z
day: '01'
department:
- _id: VlKo
external_id:
arxiv:
- '1405.7828'
isi:
- '000446809500022'
intvolume: ' 141'
isi: 1
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1405.7828
month: '10'
oa: 1
oa_version: Preprint
page: 269 - 304
publication: Ars Combinatoria
publication_identifier:
issn:
- 0381-7032
publication_status: published
publisher: Charles Babbage Research Centre
publist_id: '8037'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Superconcentrators of density 25.3
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 141
year: '2018'
...
---
_id: '180'
abstract:
- lang: eng
text: In this paper we define and study the classical Uniform Electron Gas (UEG),
a system of infinitely many electrons whose density is constant everywhere in
space. The UEG is defined differently from Jellium, which has a positive constant
background but no constraint on the density. We prove that the UEG arises in Density
Functional Theory in the limit of a slowly varying density, minimizing the indirect
Coulomb energy. We also construct the quantum UEG and compare it to the classical
UEG at low density.
acknowledgement: "This project has received funding from the European Research Council
(ERC) under the European\r\nUnion’s Horizon 2020 research and innovation programme
(grant agreement 694227 for R.S. and MDFT 725528 for M.L.). Financial support by
the Austrian Science Fund (FWF), project No P 27533-N27 (R.S.) and by the US National
Science Foundation, grant No PHY12-1265118 (E.H.L.) are gratefully acknowledged."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Mathieu
full_name: Lewi, Mathieu
last_name: Lewi
- first_name: Élliott
full_name: Lieb, Élliott
last_name: Lieb
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Lewi M, Lieb É, Seiringer R. Statistical mechanics of the uniform electron
gas. Journal de l’Ecole Polytechnique - Mathematiques. 2018;5:79-116. doi:10.5802/jep.64
apa: Lewi, M., Lieb, É., & Seiringer, R. (2018). Statistical mechanics of the
uniform electron gas. Journal de l’Ecole Polytechnique - Mathematiques.
Ecole Polytechnique. https://doi.org/10.5802/jep.64
chicago: Lewi, Mathieu, Élliott Lieb, and Robert Seiringer. “Statistical Mechanics
of the Uniform Electron Gas.” Journal de l’Ecole Polytechnique - Mathematiques.
Ecole Polytechnique, 2018. https://doi.org/10.5802/jep.64.
ieee: M. Lewi, É. Lieb, and R. Seiringer, “Statistical mechanics of the uniform
electron gas,” Journal de l’Ecole Polytechnique - Mathematiques, vol. 5.
Ecole Polytechnique, pp. 79–116, 2018.
ista: Lewi M, Lieb É, Seiringer R. 2018. Statistical mechanics of the uniform electron
gas. Journal de l’Ecole Polytechnique - Mathematiques. 5, 79–116.
mla: Lewi, Mathieu, et al. “Statistical Mechanics of the Uniform Electron Gas.”
Journal de l’Ecole Polytechnique - Mathematiques, vol. 5, Ecole Polytechnique,
2018, pp. 79–116, doi:10.5802/jep.64.
short: M. Lewi, É. Lieb, R. Seiringer, Journal de l’Ecole Polytechnique - Mathematiques
5 (2018) 79–116.
date_created: 2018-12-11T11:45:03Z
date_published: 2018-07-01T00:00:00Z
date_updated: 2023-10-17T08:05:28Z
day: '01'
ddc:
- '510'
department:
- _id: RoSe
doi: 10.5802/jep.64
ec_funded: 1
external_id:
arxiv:
- '1705.10676'
file:
- access_level: open_access
checksum: 1ba7cccdf3900f42c4f715ae75d6813c
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T16:38:18Z
date_updated: 2020-07-14T12:45:16Z
file_id: '5726'
file_name: 2018_JournaldeLecoleMath_Lewi.pdf
file_size: 843938
relation: main_file
file_date_updated: 2020-07-14T12:45:16Z
has_accepted_license: '1'
intvolume: ' 5'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 79 - 116
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
- _id: 25C878CE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P27533_N27
name: Structure of the Excitation Spectrum for Many-Body Quantum Systems
publication: Journal de l'Ecole Polytechnique - Mathematiques
publication_identifier:
eissn:
- 2270-518X
issn:
- 2429-7100
publication_status: published
publisher: Ecole Polytechnique
publist_id: '7741'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Statistical mechanics of the uniform electron gas
tmp:
image: /image/cc_by_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
short: CC BY-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2018'
...
---
_id: '181'
abstract:
- lang: eng
text: We consider large random matrices X with centered, independent entries but
possibly di erent variances. We compute the normalized trace of f(X)g(X∗) for
f, g functions analytic on the spectrum of X. We use these results to compute
the long time asymptotics for systems of coupled di erential equations with random
coe cients. We show that when the coupling is critical, the norm squared of the
solution decays like t−1/2.
acknowledgement: The work of the second author was also partially supported by the
Hausdorff Center of Mathematics.
article_processing_charge: No
arxiv: 1
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: Torben H
full_name: Krüger, Torben H
id: 3020C786-F248-11E8-B48F-1D18A9856A87
last_name: Krüger
orcid: 0000-0002-4821-3297
- first_name: David T
full_name: Renfrew, David T
id: 4845BF6A-F248-11E8-B48F-1D18A9856A87
last_name: Renfrew
orcid: 0000-0003-3493-121X
citation:
ama: Erdös L, Krüger TH, Renfrew DT. Power law decay for systems of randomly coupled
differential equations. SIAM Journal on Mathematical Analysis. 2018;50(3):3271-3290.
doi:10.1137/17M1143125
apa: Erdös, L., Krüger, T. H., & Renfrew, D. T. (2018). Power law decay for
systems of randomly coupled differential equations. SIAM Journal on Mathematical
Analysis. Society for Industrial and Applied Mathematics . https://doi.org/10.1137/17M1143125
chicago: Erdös, László, Torben H Krüger, and David T Renfrew. “Power Law Decay for
Systems of Randomly Coupled Differential Equations.” SIAM Journal on Mathematical
Analysis. Society for Industrial and Applied Mathematics , 2018. https://doi.org/10.1137/17M1143125.
ieee: L. Erdös, T. H. Krüger, and D. T. Renfrew, “Power law decay for systems of
randomly coupled differential equations,” SIAM Journal on Mathematical Analysis,
vol. 50, no. 3. Society for Industrial and Applied Mathematics , pp. 3271–3290,
2018.
ista: Erdös L, Krüger TH, Renfrew DT. 2018. Power law decay for systems of randomly
coupled differential equations. SIAM Journal on Mathematical Analysis. 50(3),
3271–3290.
mla: Erdös, László, et al. “Power Law Decay for Systems of Randomly Coupled Differential
Equations.” SIAM Journal on Mathematical Analysis, vol. 50, no. 3, Society
for Industrial and Applied Mathematics , 2018, pp. 3271–90, doi:10.1137/17M1143125.
short: L. Erdös, T.H. Krüger, D.T. Renfrew, SIAM Journal on Mathematical Analysis
50 (2018) 3271–3290.
date_created: 2018-12-11T11:45:03Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2023-09-15T12:05:52Z
day: '01'
department:
- _id: LaEr
doi: 10.1137/17M1143125
ec_funded: 1
external_id:
arxiv:
- '1708.01546'
isi:
- '000437018500032'
intvolume: ' 50'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1708.01546
month: '01'
oa: 1
oa_version: Published Version
page: 3271 - 3290
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
- _id: 258F40A4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02080
name: Structured Non-Hermitian Random Matrices
publication: SIAM Journal on Mathematical Analysis
publication_status: published
publisher: 'Society for Industrial and Applied Mathematics '
publist_id: '7740'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Power law decay for systems of randomly coupled differential equations
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 50
year: '2018'
...
---
_id: '182'
abstract:
- lang: eng
text: We describe a new algorithm for the parametric identification problem for
signal temporal logic (STL), stated as follows. Given a densetime real-valued
signal w and a parameterized temporal logic formula φ, compute the subset of the
parameter space that renders the formula satisfied by the signal. Unlike previous
solutions, which were based on search in the parameter space or quantifier elimination,
our procedure works recursively on φ and computes the evolution over time of the
set of valid parameter assignments. This procedure is similar to that of monitoring
or computing the robustness of φ relative to w. Our implementation and experiments
demonstrate that this approach can work well in practice.
alternative_title:
- HSCC Proceedings
article_processing_charge: No
author:
- first_name: Alexey
full_name: Bakhirkin, Alexey
last_name: Bakhirkin
- first_name: Thomas
full_name: Ferrere, Thomas
id: 40960E6E-F248-11E8-B48F-1D18A9856A87
last_name: Ferrere
orcid: 0000-0001-5199-3143
- first_name: Oded
full_name: Maler, Oded
last_name: Maler
citation:
ama: 'Bakhirkin A, Ferrere T, Maler O. Efficient parametric identification for STL.
In: Proceedings of the 21st International Conference on Hybrid Systems.
ACM; 2018:177-186. doi:10.1145/3178126.3178132'
apa: 'Bakhirkin, A., Ferrere, T., & Maler, O. (2018). Efficient parametric identification
for STL. In Proceedings of the 21st International Conference on Hybrid Systems
(pp. 177–186). Porto, Portugal: ACM. https://doi.org/10.1145/3178126.3178132'
chicago: Bakhirkin, Alexey, Thomas Ferrere, and Oded Maler. “Efficient Parametric
Identification for STL.” In Proceedings of the 21st International Conference
on Hybrid Systems, 177–86. ACM, 2018. https://doi.org/10.1145/3178126.3178132.
ieee: A. Bakhirkin, T. Ferrere, and O. Maler, “Efficient parametric identification
for STL,” in Proceedings of the 21st International Conference on Hybrid Systems,
Porto, Portugal, 2018, pp. 177–186.
ista: 'Bakhirkin A, Ferrere T, Maler O. 2018. Efficient parametric identification
for STL. Proceedings of the 21st International Conference on Hybrid Systems. HSCC:
Hybrid Systems: Computation and Control, HSCC Proceedings, , 177–186.'
mla: Bakhirkin, Alexey, et al. “Efficient Parametric Identification for STL.” Proceedings
of the 21st International Conference on Hybrid Systems, ACM, 2018, pp. 177–86,
doi:10.1145/3178126.3178132.
short: A. Bakhirkin, T. Ferrere, O. Maler, in:, Proceedings of the 21st International
Conference on Hybrid Systems, ACM, 2018, pp. 177–186.
conference:
end_date: 2018-04-13
location: Porto, Portugal
name: 'HSCC: Hybrid Systems: Computation and Control'
start_date: 2018-04-11
date_created: 2018-12-11T11:45:04Z
date_published: 2018-04-11T00:00:00Z
date_updated: 2023-09-11T13:30:51Z
day: '11'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1145/3178126.3178132
external_id:
isi:
- '000474781600020'
file:
- access_level: open_access
checksum: 81eabc96430e84336ea88310ac0a1ad0
content_type: application/pdf
creator: dernst
date_created: 2020-05-14T12:18:29Z
date_updated: 2020-07-14T12:45:17Z
file_id: '7833'
file_name: 2018_HSCC_Bakhirkin.pdf
file_size: 5900421
relation: main_file
file_date_updated: 2020-07-14T12:45:17Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Submitted Version
page: 177 - 186
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: Proceedings of the 21st International Conference on Hybrid Systems
publication_identifier:
isbn:
- '978-1-4503-5642-8 '
publication_status: published
publisher: ACM
publist_id: '7739'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Efficient parametric identification for STL
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '183'
abstract:
- lang: eng
text: 'Fault-localization is considered to be a very tedious and time-consuming
activity in the design of complex Cyber-Physical Systems (CPS). This laborious
task essentially requires expert knowledge of the system in order to discover
the cause of the fault. In this context, we propose a new procedure that AIDS
designers in debugging Simulink/Stateflow hybrid system models, guided by Signal
Temporal Logic (STL) specifications. The proposed method relies on three main
ingredients: (1) a monitoring and a trace diagnostics procedure that checks whether
a tested behavior satisfies or violates an STL specification, localizes time segments
and interfaces variables contributing to the property violations; (2) a slicing
procedure that maps these observable behavior segments to the internal states
and transitions of the Simulink model; and (3) a spectrum-based fault-localization
method that combines the previous analysis from multiple tests to identify the
internal states and/or transitions that are the most likely to explain the fault.
We demonstrate the applicability of our approach on two Simulink models from the
automotive and the avionics domain.'
acknowledgement: This work was partially supported by the Austrian Science Fund (FWF)
under grants S11402-N23 and S11405-N23 (RiSE/SHiNE), the CPS/IoT project (HRSM),
the EU ICT COST Action IC1402 on Run-time Verification beyond Monitoring (ARVI),
the AMASS project (ECSEL 692474), and the ENABLE-S3 project (ECSEL 692455). The
CPS/IoT project receives support from the Austrian government through the Federal
Ministry of Science, Research and Economy (BMWFW) in the funding program Hochschulraum-Strukturmittel
(HRSM) 2016. The ECSEL Joint Undertaking receives support from the European Union’s
Horizon 2020 research and innovation programme and Austria, Denmark, Germany, Finland,
Czech Republic, Italy, Spain, Portugal, Poland, Ireland, Belgium, France, Netherlands,
United Kingdom, Slovakia, Norway.
alternative_title:
- HSCC Proceedings
article_processing_charge: No
author:
- first_name: Ezio
full_name: Bartocci, Ezio
last_name: Bartocci
- first_name: Thomas
full_name: Ferrere, Thomas
id: 40960E6E-F248-11E8-B48F-1D18A9856A87
last_name: Ferrere
orcid: 0000-0001-5199-3143
- first_name: Niveditha
full_name: Manjunath, Niveditha
last_name: Manjunath
- first_name: Dejan
full_name: Nickovic, Dejan
last_name: Nickovic
citation:
ama: 'Bartocci E, Ferrere T, Manjunath N, Nickovic D. Localizing faults in simulink/stateflow
models with STL. In: Association for Computing Machinery, Inc; 2018:197-206. doi:10.1145/3178126.3178131'
apa: 'Bartocci, E., Ferrere, T., Manjunath, N., & Nickovic, D. (2018). Localizing
faults in simulink/stateflow models with STL (pp. 197–206). Presented at the HSCC:
Hybrid Systems: Computation and Control, Porto, Portugal: Association for Computing
Machinery, Inc. https://doi.org/10.1145/3178126.3178131'
chicago: Bartocci, Ezio, Thomas Ferrere, Niveditha Manjunath, and Dejan Nickovic.
“Localizing Faults in Simulink/Stateflow Models with STL,” 197–206. Association
for Computing Machinery, Inc, 2018. https://doi.org/10.1145/3178126.3178131.
ieee: 'E. Bartocci, T. Ferrere, N. Manjunath, and D. Nickovic, “Localizing faults
in simulink/stateflow models with STL,” presented at the HSCC: Hybrid Systems:
Computation and Control, Porto, Portugal, 2018, pp. 197–206.'
ista: 'Bartocci E, Ferrere T, Manjunath N, Nickovic D. 2018. Localizing faults in
simulink/stateflow models with STL. HSCC: Hybrid Systems: Computation and Control,
HSCC Proceedings, , 197–206.'
mla: Bartocci, Ezio, et al. Localizing Faults in Simulink/Stateflow Models with
STL. Association for Computing Machinery, Inc, 2018, pp. 197–206, doi:10.1145/3178126.3178131.
short: E. Bartocci, T. Ferrere, N. Manjunath, D. Nickovic, in:, Association for
Computing Machinery, Inc, 2018, pp. 197–206.
conference:
end_date: 2018-04-13
location: Porto, Portugal
name: 'HSCC: Hybrid Systems: Computation and Control'
start_date: 2018-04-11
date_created: 2018-12-11T11:45:04Z
date_published: 2018-04-11T00:00:00Z
date_updated: 2023-09-13T08:48:46Z
day: '11'
department:
- _id: ToHe
doi: 10.1145/3178126.3178131
external_id:
isi:
- '000474781600022'
isi: 1
language:
- iso: eng
month: '04'
oa_version: None
page: 197 - 206
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: Association for Computing Machinery, Inc
publist_id: '7738'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Localizing faults in simulink/stateflow models with STL
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '184'
abstract:
- lang: eng
text: We prove that for every d ≥ 2, deciding if a pure, d-dimensional, simplicial
complex is shellable is NP-hard, hence NP-complete. This resolves a question raised,
e.g., by Danaraj and Klee in 1978. Our reduction also yields that for every d
≥ 2 and k ≥ 0, deciding if a pure, d-dimensional, simplicial complex is k-decomposable
is NP-hard. For d ≥ 3, both problems remain NP-hard when restricted to contractible
pure d-dimensional complexes.
acknowledgement: 'Partially supported by the project EMBEDS II (CZ: 7AMB17FR029, FR:
38087RM) of Czech-French collaboration.'
alternative_title:
- Leibniz International Proceedings in Information, LIPIcs
author:
- first_name: Xavier
full_name: Goaoc, Xavier
last_name: Goaoc
- first_name: Pavel
full_name: Paták, Pavel
last_name: Paták
- first_name: Zuzana
full_name: Patakova, Zuzana
id: 48B57058-F248-11E8-B48F-1D18A9856A87
last_name: Patakova
orcid: 0000-0002-3975-1683
- first_name: Martin
full_name: Tancer, Martin
id: 38AC689C-F248-11E8-B48F-1D18A9856A87
last_name: Tancer
orcid: 0000-0002-1191-6714
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: 'Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. Shellability is NP-complete.
In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:41:1-41:16.
doi:10.4230/LIPIcs.SoCG.2018.41'
apa: 'Goaoc, X., Paták, P., Patakova, Z., Tancer, M., & Wagner, U. (2018). Shellability
is NP-complete (Vol. 99, p. 41:1-41:16). Presented at the SoCG: Symposium on Computational
Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.SoCG.2018.41'
chicago: Goaoc, Xavier, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner.
“Shellability Is NP-Complete,” 99:41:1-41:16. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.41.
ieee: 'X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Shellability
is NP-complete,” presented at the SoCG: Symposium on Computational Geometry, Budapest,
Hungary, 2018, vol. 99, p. 41:1-41:16.'
ista: 'Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2018. Shellability is NP-complete.
SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in
Information, LIPIcs, vol. 99, 41:1-41:16.'
mla: Goaoc, Xavier, et al. Shellability Is NP-Complete. Vol. 99, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 41:1-41:16, doi:10.4230/LIPIcs.SoCG.2018.41.
short: X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2018, p. 41:1-41:16.
conference:
end_date: 2018-06-14
location: Budapest, Hungary
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2018-06-11
date_created: 2018-12-11T11:45:04Z
date_published: 2018-06-11T00:00:00Z
date_updated: 2023-09-06T11:10:57Z
day: '11'
ddc:
- '516'
- '000'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2018.41
file:
- access_level: open_access
checksum: d12bdd60f04a57307867704b5f930afd
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T16:35:02Z
date_updated: 2020-07-14T12:45:18Z
file_id: '5725'
file_name: 2018_LIPIcs_Goaoc.pdf
file_size: 718414
relation: main_file
file_date_updated: 2020-07-14T12:45:18Z
has_accepted_license: '1'
intvolume: ' 99'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 41:1 - 41:16
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7736'
quality_controlled: '1'
related_material:
record:
- id: '7108'
relation: later_version
status: public
scopus_import: 1
status: public
title: Shellability is NP-complete
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 99
year: '2018'
...
---
_id: '185'
abstract:
- lang: eng
text: We resolve in the affirmative conjectures of A. Skopenkov and Repovš (1998),
and M. Skopenkov (2003) generalizing the classical Hanani-Tutte theorem to the
setting of approximating maps of graphs on 2-dimensional surfaces by embeddings.
Our proof of this result is constructive and almost immediately implies an efficient
algorithm for testing whether a given piecewise linear map of a graph in a surface
is approximable by an embedding. More precisely, an instance of this problem consists
of (i) a graph G whose vertices are partitioned into clusters and whose inter-cluster
edges are partitioned into bundles, and (ii) a region R of a 2-dimensional compact
surface M given as the union of a set of pairwise disjoint discs corresponding
to the clusters and a set of pairwise disjoint "pipes" corresponding
to the bundles, connecting certain pairs of these discs. We are to decide whether
G can be embedded inside M so that the vertices in every cluster are drawn in
the corresponding disc, the edges in every bundle pass only through its corresponding
pipe, and every edge crosses the boundary of each disc at most once.
alternative_title:
- Leibniz International Proceedings in Information, LIPIcs
article_number: '39'
author:
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: Jan
full_name: Kynčl, Jan
last_name: Kynčl
citation:
ama: 'Fulek R, Kynčl J. Hanani-Tutte for approximating maps of graphs. In: Vol 99.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.SoCG.2018.39'
apa: 'Fulek, R., & Kynčl, J. (2018). Hanani-Tutte for approximating maps of
graphs (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry,
Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.39'
chicago: Fulek, Radoslav, and Jan Kynčl. “Hanani-Tutte for Approximating Maps of
Graphs,” Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.39.
ieee: 'R. Fulek and J. Kynčl, “Hanani-Tutte for approximating maps of graphs,” presented
at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol.
99.'
ista: 'Fulek R, Kynčl J. 2018. Hanani-Tutte for approximating maps of graphs. SoCG:
Symposium on Computational Geometry, Leibniz International Proceedings in Information,
LIPIcs, vol. 99, 39.'
mla: Fulek, Radoslav, and Jan Kynčl. Hanani-Tutte for Approximating Maps of Graphs.
Vol. 99, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.SoCG.2018.39.
short: R. Fulek, J. Kynčl, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2018.
conference:
end_date: 2018-06-14
location: Budapest, Hungary
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2018-06-11
date_created: 2018-12-11T11:45:04Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2021-01-12T06:53:36Z
day: '01'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2018.39
file:
- access_level: open_access
checksum: f1b94f1a75b37c414a1f61d59fb2cd4c
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T12:33:52Z
date_updated: 2020-07-14T12:45:19Z
file_id: '5701'
file_name: 2018_LIPIcs_Fulek.pdf
file_size: 718857
relation: main_file
file_date_updated: 2020-07-14T12:45:19Z
has_accepted_license: '1'
intvolume: ' 99'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 261FA626-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02281
name: Eliminating intersections in drawings of graphs
publication_identifier:
isbn:
- 978-3-95977-066-8
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7735'
quality_controlled: '1'
scopus_import: 1
status: public
title: Hanani-Tutte for approximating maps of graphs
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 99
year: '2018'
...
---
_id: '186'
abstract:
- lang: eng
text: 'A drawing of a graph on a surface is independently even if every pair of
nonadjacent edges in the drawing crosses an even number of times. The ℤ2-genus
of a graph G is the minimum g such that G has an independently even drawing on
the orientable surface of genus g. An unpublished result by Robertson and Seymour
implies that for every t, every graph of sufficiently large genus contains as
a minor a projective t × t grid or one of the following so-called t-Kuratowski
graphs: K3, t, or t copies of K5 or K3,3 sharing at most 2 common vertices. We
show that the ℤ2-genus of graphs in these families is unbounded in t; in fact,
equal to their genus. Together, this implies that the genus of a graph is bounded
from above by a function of its ℤ2-genus, solving a problem posed by Schaefer
and Štefankovič, and giving an approximate version of the Hanani-Tutte theorem
on orientable surfaces.'
alternative_title:
- LIPIcs
article_processing_charge: No
arxiv: 1
author:
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: Jan
full_name: Kynčl, Jan
last_name: Kynčl
citation:
ama: 'Fulek R, Kynčl J. The ℤ2-Genus of Kuratowski minors. In: Vol 99. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2018:40.1-40.14. doi:10.4230/LIPIcs.SoCG.2018.40'
apa: 'Fulek, R., & Kynčl, J. (2018). The ℤ2-Genus of Kuratowski minors (Vol.
99, p. 40.1-40.14). Presented at the SoCG: Symposium on Computational Geometry,
Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.40'
chicago: Fulek, Radoslav, and Jan Kynčl. “The ℤ2-Genus of Kuratowski Minors,” 99:40.1-40.14.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.40.
ieee: 'R. Fulek and J. Kynčl, “The ℤ2-Genus of Kuratowski minors,” presented at
the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99,
p. 40.1-40.14.'
ista: 'Fulek R, Kynčl J. 2018. The ℤ2-Genus of Kuratowski minors. SoCG: Symposium
on Computational Geometry, LIPIcs, vol. 99, 40.1-40.14.'
mla: Fulek, Radoslav, and Jan Kynčl. The ℤ2-Genus of Kuratowski Minors. Vol.
99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 40.1-40.14, doi:10.4230/LIPIcs.SoCG.2018.40.
short: R. Fulek, J. Kynčl, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2018, p. 40.1-40.14.
conference:
end_date: 2018-06-14
location: Budapest, Hungary
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2018-06-11
date_created: 2018-12-11T11:45:05Z
date_published: 2018-06-11T00:00:00Z
date_updated: 2023-08-14T12:43:51Z
day: '11'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2018.40
external_id:
arxiv:
- '1803.05085'
intvolume: ' 99'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1803.05085
month: '06'
oa: 1
oa_version: Submitted Version
page: 40.1 - 40.14
project:
- _id: 261FA626-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02281
name: Eliminating intersections in drawings of graphs
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7734'
quality_controlled: '1'
related_material:
record:
- id: '11593'
relation: later_version
status: public
scopus_import: '1'
status: public
title: The ℤ2-Genus of Kuratowski minors
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 99
year: '2018'
...
---
_id: '187'
abstract:
- lang: eng
text: 'Given a locally finite X ⊆ ℝd and a radius r ≥ 0, the k-fold cover of X and
r consists of all points in ℝd that have k or more points of X within distance
r. We consider two filtrations - one in scale obtained by fixing k and increasing
r, and the other in depth obtained by fixing r and decreasing k - and we compute
the persistence diagrams of both. While standard methods suffice for the filtration
in scale, we need novel geometric and topological concepts for the filtration
in depth. In particular, we introduce a rhomboid tiling in ℝd+1 whose horizontal
integer slices are the order-k Delaunay mosaics of X, and construct a zigzag module
from Delaunay mosaics that is isomorphic to the persistence module of the multi-covers. '
acknowledgement: This work is partially supported by the DFG Collaborative Research
Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35
of the Austrian Science Fund (FWF).
alternative_title:
- LIPIcs
article_number: '34'
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Georg F
full_name: Osang, Georg F
id: 464B40D6-F248-11E8-B48F-1D18A9856A87
last_name: Osang
orcid: 0000-0002-8882-5116
citation:
ama: 'Edelsbrunner H, Osang GF. The multi-cover persistence of Euclidean balls.
In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.SoCG.2018.34'
apa: 'Edelsbrunner, H., & Osang, G. F. (2018). The multi-cover persistence of
Euclidean balls (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry,
Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.34'
chicago: Edelsbrunner, Herbert, and Georg F Osang. “The Multi-Cover Persistence
of Euclidean Balls,” Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.34.
ieee: 'H. Edelsbrunner and G. F. Osang, “The multi-cover persistence of Euclidean
balls,” presented at the SoCG: Symposium on Computational Geometry, Budapest,
Hungary, 2018, vol. 99.'
ista: 'Edelsbrunner H, Osang GF. 2018. The multi-cover persistence of Euclidean
balls. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 99, 34.'
mla: Edelsbrunner, Herbert, and Georg F. Osang. The Multi-Cover Persistence of
Euclidean Balls. Vol. 99, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2018, doi:10.4230/LIPIcs.SoCG.2018.34.
short: H. Edelsbrunner, G.F. Osang, in:, Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2018.
conference:
end_date: 2018-06-14
location: Budapest, Hungary
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2018-06-11
date_created: 2018-12-11T11:45:05Z
date_published: 2018-06-11T00:00:00Z
date_updated: 2023-09-07T13:29:00Z
day: '11'
ddc:
- '516'
department:
- _id: HeEd
doi: 10.4230/LIPIcs.SoCG.2018.34
file:
- access_level: open_access
checksum: d8c0533ad0018eb4ed1077475eb8fc18
content_type: application/pdf
creator: dernst
date_created: 2018-12-18T09:27:22Z
date_updated: 2020-07-14T12:45:19Z
file_id: '5738'
file_name: 2018_LIPIcs_Edelsbrunner_Osang.pdf
file_size: 528018
relation: main_file
file_date_updated: 2020-07-14T12:45:19Z
has_accepted_license: '1'
intvolume: ' 99'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I02979-N35
name: Persistence and stability of geometric complexes
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7732'
quality_controlled: '1'
related_material:
record:
- id: '9317'
relation: later_version
status: public
- id: '9056'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: The multi-cover persistence of Euclidean balls
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 99
year: '2018'
...
---
_id: '188'
abstract:
- lang: eng
text: Smallest enclosing spheres of finite point sets are central to methods in
topological data analysis. Focusing on Bregman divergences to measure dissimilarity,
we prove bounds on the location of the center of a smallest enclosing sphere.
These bounds depend on the range of radii for which Bregman balls are convex.
acknowledgement: This research is partially supported by the Office of Naval Research,
through grant no. N62909-18-1-2038, and the DFG Collaborative Research Center TRR
109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of
the Austrian Science Fund
alternative_title:
- Leibniz International Proceedings in Information, LIPIcs
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Ziga
full_name: Virk, Ziga
last_name: Virk
- first_name: Hubert
full_name: Wagner, Hubert
id: 379CA8B8-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
citation:
ama: 'Edelsbrunner H, Virk Z, Wagner H. Smallest enclosing spheres and Chernoff
points in Bregman geometry. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik; 2018:35:1-35:13. doi:10.4230/LIPIcs.SoCG.2018.35'
apa: 'Edelsbrunner, H., Virk, Z., & Wagner, H. (2018). Smallest enclosing spheres
and Chernoff points in Bregman geometry (Vol. 99, p. 35:1-35:13). Presented at
the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.35'
chicago: Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Smallest Enclosing
Spheres and Chernoff Points in Bregman Geometry,” 99:35:1-35:13. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.35.
ieee: 'H. Edelsbrunner, Z. Virk, and H. Wagner, “Smallest enclosing spheres and
Chernoff points in Bregman geometry,” presented at the SoCG: Symposium on Computational
Geometry, Budapest, Hungary, 2018, vol. 99, p. 35:1-35:13.'
ista: 'Edelsbrunner H, Virk Z, Wagner H. 2018. Smallest enclosing spheres and Chernoff
points in Bregman geometry. SoCG: Symposium on Computational Geometry, Leibniz
International Proceedings in Information, LIPIcs, vol. 99, 35:1-35:13.'
mla: Edelsbrunner, Herbert, et al. Smallest Enclosing Spheres and Chernoff Points
in Bregman Geometry. Vol. 99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2018, p. 35:1-35:13, doi:10.4230/LIPIcs.SoCG.2018.35.
short: H. Edelsbrunner, Z. Virk, H. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2018, p. 35:1-35:13.
conference:
end_date: 2018-06-14
location: Budapest, Hungary
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2018-06-11
date_created: 2018-12-11T11:45:05Z
date_published: 2018-06-11T00:00:00Z
date_updated: 2021-01-12T06:53:48Z
day: '11'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.4230/LIPIcs.SoCG.2018.35
file:
- access_level: open_access
checksum: 7509403803b3ac1aee94bbc2ad293d21
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T16:31:31Z
date_updated: 2020-07-14T12:45:20Z
file_id: '5724'
file_name: 2018_LIPIcs_Edelsbrunner.pdf
file_size: 489080
relation: main_file
file_date_updated: 2020-07-14T12:45:20Z
has_accepted_license: '1'
intvolume: ' 99'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 35:1 - 35:13
project:
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I02979-N35
name: Persistence and stability of geometric complexes
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7733'
quality_controlled: '1'
scopus_import: 1
status: public
title: Smallest enclosing spheres and Chernoff points in Bregman geometry
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 99
year: '2018'
...
---
_id: '19'
abstract:
- lang: eng
text: Bacteria regulate genes to survive antibiotic stress, but regulation can be
far from perfect. When regulation is not optimal, mutations that change gene expression
can contribute to antibiotic resistance. It is not systematically understood to
what extent natural gene regulation is or is not optimal for distinct antibiotics,
and how changes in expression of specific genes quantitatively affect antibiotic
resistance. Here we discover a simple quantitative relation between fitness, gene
expression, and antibiotic potency, which rationalizes our observation that a
multitude of genes and even innate antibiotic defense mechanisms have expression
that is critically nonoptimal under antibiotic treatment. First, we developed
a pooled-strain drug-diffusion assay and screened Escherichia coli overexpression
and knockout libraries, finding that resistance to a range of 31 antibiotics could
result from changing expression of a large and functionally diverse set of genes,
in a primarily but not exclusively drug-specific manner. Second, by synthetically
controlling the expression of single-drug and multidrug resistance genes, we observed
that their fitness-expression functions changed dramatically under antibiotic
treatment in accordance with a log-sensitivity relation. Thus, because many genes
are nonoptimally expressed under antibiotic treatment, many regulatory mutations
can contribute to resistance by altering expression and by activating latent defenses.
article_processing_charge: No
article_type: original
author:
- first_name: Adam
full_name: Palmer, Adam
last_name: Palmer
- first_name: Remy P
full_name: Chait, Remy P
id: 3464AE84-F248-11E8-B48F-1D18A9856A87
last_name: Chait
orcid: 0000-0003-0876-3187
- first_name: Roy
full_name: Kishony, Roy
last_name: Kishony
citation:
ama: Palmer A, Chait RP, Kishony R. Nonoptimal gene expression creates latent potential
for antibiotic resistance. Molecular Biology and Evolution. 2018;35(11):2669-2684.
doi:10.1093/molbev/msy163
apa: Palmer, A., Chait, R. P., & Kishony, R. (2018). Nonoptimal gene expression
creates latent potential for antibiotic resistance. Molecular Biology and Evolution.
Oxford University Press. https://doi.org/10.1093/molbev/msy163
chicago: Palmer, Adam, Remy P Chait, and Roy Kishony. “Nonoptimal Gene Expression
Creates Latent Potential for Antibiotic Resistance.” Molecular Biology and
Evolution. Oxford University Press, 2018. https://doi.org/10.1093/molbev/msy163.
ieee: A. Palmer, R. P. Chait, and R. Kishony, “Nonoptimal gene expression creates
latent potential for antibiotic resistance,” Molecular Biology and Evolution,
vol. 35, no. 11. Oxford University Press, pp. 2669–2684, 2018.
ista: Palmer A, Chait RP, Kishony R. 2018. Nonoptimal gene expression creates latent
potential for antibiotic resistance. Molecular Biology and Evolution. 35(11),
2669–2684.
mla: Palmer, Adam, et al. “Nonoptimal Gene Expression Creates Latent Potential for
Antibiotic Resistance.” Molecular Biology and Evolution, vol. 35, no. 11,
Oxford University Press, 2018, pp. 2669–84, doi:10.1093/molbev/msy163.
short: A. Palmer, R.P. Chait, R. Kishony, Molecular Biology and Evolution 35 (2018)
2669–2684.
date_created: 2018-12-11T11:44:11Z
date_published: 2018-08-28T00:00:00Z
date_updated: 2023-10-17T11:51:06Z
day: '28'
department:
- _id: CaGu
- _id: GaTk
doi: 10.1093/molbev/msy163
external_id:
isi:
- '000452567200006'
pmid:
- '30169679'
intvolume: ' 35'
isi: 1
issue: '11'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pubmed/30169679
month: '08'
oa: 1
oa_version: Submitted Version
page: 2669 - 2684
pmid: 1
publication: Molecular Biology and Evolution
publication_identifier:
issn:
- 0737-4038
publication_status: published
publisher: Oxford University Press
publist_id: '8036'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nonoptimal gene expression creates latent potential for antibiotic resistance
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2018'
...
---
_id: '190'
abstract:
- lang: eng
text: The German cockroach, Blattella germanica, is a worldwide pest that infests
buildings, including homes, restaurants, and hospitals, often living in unsanitary
conditions. As a disease vector and producer of allergens, this species has major
health and economic impacts on humans. Factors contributing to the success of
the German cockroach include its resistance to a broad range of insecticides,
immunity to many pathogens, and its ability, as an extreme generalist omnivore,
to survive on most food sources. The recently published genome shows that B. germanica
has an exceptionally high number of protein coding genes. In this study, we investigate
the functions of the 93 significantly expanded gene families with the aim to better
understand the success of B. germanica as a major pest despite such inhospitable
conditions. We find major expansions in gene families with functions related to
the detoxification of insecticides and allelochemicals, defense against pathogens,
digestion, sensory perception, and gene regulation. These expansions might have
allowed B. germanica to develop multiple resistance mechanisms to insecticides
and pathogens, and enabled a broad, flexible diet, thus explaining its success
in unsanitary conditions and under recurrent chemical control. The findings and
resources presented here provide insights for better understanding molecular mechanisms
that will facilitate more effective cockroach control.
article_processing_charge: No
article_type: original
author:
- first_name: Mark
full_name: Harrison, Mark
last_name: Harrison
- first_name: Nicolas
full_name: Arning, Nicolas
last_name: Arning
- first_name: Lucas
full_name: Kremer, Lucas
last_name: Kremer
- first_name: Guillem
full_name: Ylla, Guillem
last_name: Ylla
- first_name: Xavier
full_name: Belles, Xavier
last_name: Belles
- first_name: Erich
full_name: Bornberg Bauer, Erich
last_name: Bornberg Bauer
- first_name: Ann K
full_name: Huylmans, Ann K
id: 4C0A3874-F248-11E8-B48F-1D18A9856A87
last_name: Huylmans
orcid: 0000-0001-8871-4961
- first_name: Evelien
full_name: Jongepier, Evelien
last_name: Jongepier
- first_name: Maria
full_name: Puilachs, Maria
last_name: Puilachs
- first_name: Stephen
full_name: Richards, Stephen
last_name: Richards
- first_name: Coby
full_name: Schal, Coby
last_name: Schal
citation:
ama: 'Harrison M, Arning N, Kremer L, et al. Expansions of key protein families
in the German cockroach highlight the molecular basis of its remarkable success
as a global indoor pest. Journal of Experimental Zoology Part B: Molecular
and Developmental Evolution. 2018;330:254-264. doi:10.1002/jez.b.22824'
apa: 'Harrison, M., Arning, N., Kremer, L., Ylla, G., Belles, X., Bornberg Bauer,
E., … Schal, C. (2018). Expansions of key protein families in the German cockroach
highlight the molecular basis of its remarkable success as a global indoor pest.
Journal of Experimental Zoology Part B: Molecular and Developmental Evolution.
Wiley. https://doi.org/10.1002/jez.b.22824'
chicago: 'Harrison, Mark, Nicolas Arning, Lucas Kremer, Guillem Ylla, Xavier Belles,
Erich Bornberg Bauer, Ann K Huylmans, et al. “Expansions of Key Protein Families
in the German Cockroach Highlight the Molecular Basis of Its Remarkable Success
as a Global Indoor Pest.” Journal of Experimental Zoology Part B: Molecular
and Developmental Evolution. Wiley, 2018. https://doi.org/10.1002/jez.b.22824.'
ieee: 'M. Harrison et al., “Expansions of key protein families in the German
cockroach highlight the molecular basis of its remarkable success as a global
indoor pest,” Journal of Experimental Zoology Part B: Molecular and Developmental
Evolution, vol. 330. Wiley, pp. 254–264, 2018.'
ista: 'Harrison M, Arning N, Kremer L, Ylla G, Belles X, Bornberg Bauer E, Huylmans
AK, Jongepier E, Puilachs M, Richards S, Schal C. 2018. Expansions of key protein
families in the German cockroach highlight the molecular basis of its remarkable
success as a global indoor pest. Journal of Experimental Zoology Part B: Molecular
and Developmental Evolution. 330, 254–264.'
mla: 'Harrison, Mark, et al. “Expansions of Key Protein Families in the German Cockroach
Highlight the Molecular Basis of Its Remarkable Success as a Global Indoor Pest.”
Journal of Experimental Zoology Part B: Molecular and Developmental Evolution,
vol. 330, Wiley, 2018, pp. 254–64, doi:10.1002/jez.b.22824.'
short: 'M. Harrison, N. Arning, L. Kremer, G. Ylla, X. Belles, E. Bornberg Bauer,
A.K. Huylmans, E. Jongepier, M. Puilachs, S. Richards, C. Schal, Journal of Experimental
Zoology Part B: Molecular and Developmental Evolution 330 (2018) 254–264.'
date_created: 2018-12-11T11:45:06Z
date_published: 2018-07-11T00:00:00Z
date_updated: 2023-09-11T13:59:54Z
day: '11'
department:
- _id: BeVi
doi: 10.1002/jez.b.22824
external_id:
isi:
- '000443231000002'
pmid:
- '29998472'
intvolume: ' 330'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://onlinelibrary.wiley.com/doi/am-pdf/10.1002/jez.b.22824
month: '07'
oa: 1
oa_version: Submitted Version
page: 254-264
pmid: 1
publication: 'Journal of Experimental Zoology Part B: Molecular and Developmental
Evolution'
publication_status: published
publisher: Wiley
publist_id: '7730'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Expansions of key protein families in the German cockroach highlight the molecular
basis of its remarkable success as a global indoor pest
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 330
year: '2018'
...
---
_id: '191'
abstract:
- lang: eng
text: Intercellular distribution of the plant hormone auxin largely depends on the
polar subcellular distribution of the plasma membrane PIN-FORMED (PIN) auxin transporters.
PIN polarity switches in response to different developmental and environmental
signals have been shown to redirect auxin fluxes mediating certain developmental
responses. PIN phosphorylation at different sites and by different kinases is
crucial for PIN function. Here we investigate the role of PIN phosphorylation
during gravitropic response. Loss- and gain-of-function mutants in PINOID and
related kinases but not in D6PK kinase as well as mutations mimicking constitutive
dephosphorylated or phosphorylated status of two clusters of predicted phosphorylation
sites partially disrupted PIN3 phosphorylation and caused defects in gravitropic
bending in roots and hypocotyls. In particular, they impacted PIN3 polarity rearrangements
in response to gravity and during feed-back regulation by auxin itself. Thus PIN
phosphorylation, besides regulating transport activity and apical-basal targeting,
is also important for the rapid polarity switches in response to environmental
and endogenous signals.
article_number: '10279'
article_processing_charge: No
author:
- first_name: Peter
full_name: Grones, Peter
id: 399876EC-F248-11E8-B48F-1D18A9856A87
last_name: Grones
- first_name: Melinda F
full_name: Abas, Melinda F
id: 3CFB3B1C-F248-11E8-B48F-1D18A9856A87
last_name: Abas
- first_name: Jakub
full_name: Hajny, Jakub
id: 4800CC20-F248-11E8-B48F-1D18A9856A87
last_name: Hajny
orcid: 0000-0003-2140-7195
- first_name: Angharad
full_name: Jones, Angharad
last_name: Jones
- first_name: Sascha
full_name: Waidmann, Sascha
last_name: Waidmann
- first_name: Jürgen
full_name: Kleine Vehn, Jürgen
last_name: Kleine Vehn
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Grones P, Abas MF, Hajny J, et al. PID/WAG-mediated phosphorylation of the
Arabidopsis PIN3 auxin transporter mediates polarity switches during gravitropism.
Scientific Reports. 2018;8(1). doi:10.1038/s41598-018-28188-1
apa: Grones, P., Abas, M. F., Hajny, J., Jones, A., Waidmann, S., Kleine Vehn, J.,
& Friml, J. (2018). PID/WAG-mediated phosphorylation of the Arabidopsis PIN3
auxin transporter mediates polarity switches during gravitropism. Scientific
Reports. Springer. https://doi.org/10.1038/s41598-018-28188-1
chicago: Grones, Peter, Melinda F Abas, Jakub Hajny, Angharad Jones, Sascha Waidmann,
Jürgen Kleine Vehn, and Jiří Friml. “PID/WAG-Mediated Phosphorylation of the Arabidopsis
PIN3 Auxin Transporter Mediates Polarity Switches during Gravitropism.” Scientific
Reports. Springer, 2018. https://doi.org/10.1038/s41598-018-28188-1.
ieee: P. Grones et al., “PID/WAG-mediated phosphorylation of the Arabidopsis
PIN3 auxin transporter mediates polarity switches during gravitropism,” Scientific
Reports, vol. 8, no. 1. Springer, 2018.
ista: Grones P, Abas MF, Hajny J, Jones A, Waidmann S, Kleine Vehn J, Friml J. 2018.
PID/WAG-mediated phosphorylation of the Arabidopsis PIN3 auxin transporter mediates
polarity switches during gravitropism. Scientific Reports. 8(1), 10279.
mla: Grones, Peter, et al. “PID/WAG-Mediated Phosphorylation of the Arabidopsis
PIN3 Auxin Transporter Mediates Polarity Switches during Gravitropism.” Scientific
Reports, vol. 8, no. 1, 10279, Springer, 2018, doi:10.1038/s41598-018-28188-1.
short: P. Grones, M.F. Abas, J. Hajny, A. Jones, S. Waidmann, J. Kleine Vehn, J.
Friml, Scientific Reports 8 (2018).
date_created: 2018-12-11T11:45:06Z
date_published: 2018-07-06T00:00:00Z
date_updated: 2025-05-07T11:12:31Z
day: '06'
ddc:
- '581'
department:
- _id: JiFr
- _id: EvBe
doi: 10.1038/s41598-018-28188-1
ec_funded: 1
external_id:
isi:
- '000437673200053'
file:
- access_level: open_access
checksum: 266b03f4fb8198e83141617aaa99dcab
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T15:38:56Z
date_updated: 2020-07-14T12:45:20Z
file_id: '5714'
file_name: 2018_ScientificReports_Grones.pdf
file_size: 2413876
relation: main_file
file_date_updated: 2020-07-14T12:45:20Z
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
issue: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '282300'
name: Polarity and subcellular dynamics in plants
- _id: 261099A6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '742985'
name: Tracing Evolution of Auxin Transport and Polarity in Plants
publication: Scientific Reports
publication_status: published
publisher: Springer
publist_id: '7729'
quality_controlled: '1'
related_material:
record:
- id: '8822'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: PID/WAG-mediated phosphorylation of the Arabidopsis PIN3 auxin transporter
mediates polarity switches during gravitropism
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 8
year: '2018'
...
---
_id: '192'
abstract:
- lang: eng
text: The phytohormone auxin is the information carrier in a plethora of developmental
and physiological processes in plants(1). It has been firmly established that
canonical, nuclear auxin signalling acts through regulation of gene transcription(2).
Here, we combined microfluidics, live imaging, genetic engineering and computational
modelling to reanalyse the classical case of root growth inhibition(3) by auxin.
We show that Arabidopsis roots react to addition and removal of auxin by extremely
rapid adaptation of growth rate. This process requires intracellular auxin perception
but not transcriptional reprogramming. The formation of the canonical TIR1/AFB-Aux/IAA
co-receptor complex is required for the growth regulation, hinting to a novel,
non-transcriptional branch of this signalling pathway. Our results challenge the
current understanding of root growth regulation by auxin and suggest another,
presumably non-transcriptional, signalling output of the canonical auxin pathway.
article_processing_charge: No
article_type: original
author:
- first_name: Matyas
full_name: Fendrych, Matyas
id: 43905548-F248-11E8-B48F-1D18A9856A87
last_name: Fendrych
orcid: 0000-0002-9767-8699
- first_name: Maria
full_name: Akhmanova, Maria
id: 3425EC26-F248-11E8-B48F-1D18A9856A87
last_name: Akhmanova
orcid: 0000-0003-1522-3162
- first_name: Jack
full_name: Merrin, Jack
id: 4515C308-F248-11E8-B48F-1D18A9856A87
last_name: Merrin
orcid: 0000-0001-5145-4609
- first_name: Matous
full_name: Glanc, Matous
last_name: Glanc
- first_name: Shinya
full_name: Hagihara, Shinya
last_name: Hagihara
- first_name: Koji
full_name: Takahashi, Koji
last_name: Takahashi
- first_name: Naoyuki
full_name: Uchida, Naoyuki
last_name: Uchida
- first_name: Keiko U
full_name: Torii, Keiko U
last_name: Torii
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Fendrych M, Akhmanova M, Merrin J, et al. Rapid and reversible root growth
inhibition by TIR1 auxin signalling. Nature Plants. 2018;4(7):453-459.
doi:10.1038/s41477-018-0190-1
apa: Fendrych, M., Akhmanova, M., Merrin, J., Glanc, M., Hagihara, S., Takahashi,
K., … Friml, J. (2018). Rapid and reversible root growth inhibition by TIR1 auxin
signalling. Nature Plants. Springer Nature. https://doi.org/10.1038/s41477-018-0190-1
chicago: Fendrych, Matyas, Maria Akhmanova, Jack Merrin, Matous Glanc, Shinya Hagihara,
Koji Takahashi, Naoyuki Uchida, Keiko U Torii, and Jiří Friml. “Rapid and Reversible
Root Growth Inhibition by TIR1 Auxin Signalling.” Nature Plants. Springer
Nature, 2018. https://doi.org/10.1038/s41477-018-0190-1.
ieee: M. Fendrych et al., “Rapid and reversible root growth inhibition by
TIR1 auxin signalling,” Nature Plants, vol. 4, no. 7. Springer Nature,
pp. 453–459, 2018.
ista: Fendrych M, Akhmanova M, Merrin J, Glanc M, Hagihara S, Takahashi K, Uchida
N, Torii KU, Friml J. 2018. Rapid and reversible root growth inhibition by TIR1
auxin signalling. Nature Plants. 4(7), 453–459.
mla: Fendrych, Matyas, et al. “Rapid and Reversible Root Growth Inhibition by TIR1
Auxin Signalling.” Nature Plants, vol. 4, no. 7, Springer Nature, 2018,
pp. 453–59, doi:10.1038/s41477-018-0190-1.
short: M. Fendrych, M. Akhmanova, J. Merrin, M. Glanc, S. Hagihara, K. Takahashi,
N. Uchida, K.U. Torii, J. Friml, Nature Plants 4 (2018) 453–459.
date_created: 2018-12-11T11:45:07Z
date_published: 2018-06-25T00:00:00Z
date_updated: 2023-09-15T12:11:03Z
day: '25'
department:
- _id: JiFr
- _id: DaSi
- _id: NanoFab
doi: 10.1038/s41477-018-0190-1
external_id:
isi:
- '000443221200017'
pmid:
- '29942048'
intvolume: ' 4'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pubmed/29942048
month: '06'
oa: 1
oa_version: Submitted Version
page: 453 - 459
pmid: 1
publication: Nature Plants
publication_status: published
publisher: Springer Nature
publist_id: '7728'
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/new-mechanism-for-the-plant-hormone-auxin-discovered/
scopus_import: '1'
status: public
title: Rapid and reversible root growth inhibition by TIR1 auxin signalling
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 4
year: '2018'
...
---
_id: '193'
abstract:
- lang: eng
text: 'We show attacks on five data-independent memory-hard functions (iMHF) that
were submitted to the password hashing competition (PHC). Informally, an MHF is
a function which cannot be evaluated on dedicated hardware, like ASICs, at significantly
lower hardware and/or energy cost than evaluating a single instance on a standard
single-core architecture. Data-independent means the memory access pattern of
the function is independent of the input; this makes iMHFs harder to construct
than data-dependent ones, but the latter can be attacked by various side-channel
attacks. Following [Alwen-Blocki''16], we capture the evaluation of an iMHF as
a directed acyclic graph (DAG). The cumulative parallel pebbling complexity of
this DAG is a measure for the hardware cost of evaluating the iMHF on an ASIC.
Ideally, one would like the complexity of a DAG underlying an iMHF to be as close
to quadratic in the number of nodes of the graph as possible. Instead, we show
that (the DAGs underlying) the following iMHFs are far from this bound: Rig.v2,
TwoCats and Gambit each having an exponent no more than 1.75. Moreover, we show
that the complexity of the iMHF modes of the PHC finalists Pomelo and Lyra2 have
exponents at most 1.83 and 1.67 respectively. To show this we investigate a combinatorial
property of each underlying DAG (called its depth-robustness. By establishing
upper bounds on this property we are then able to apply the general technique
of [Alwen-Block''16] for analyzing the hardware costs of an iMHF.'
acknowledgement: Leonid Reyzin was supported in part by IST Austria and by US NSF
grants 1012910, 1012798, and 1422965; this research was performed while he was visiting
IST Austria.
article_processing_charge: No
author:
- first_name: Joel F
full_name: Alwen, Joel F
id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87
last_name: Alwen
- first_name: Peter
full_name: Gazi, Peter
last_name: Gazi
- first_name: Chethan
full_name: Kamath Hosdurg, Chethan
id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87
last_name: Kamath Hosdurg
- first_name: Karen
full_name: Klein, Karen
id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87
last_name: Klein
- first_name: Georg F
full_name: Osang, Georg F
id: 464B40D6-F248-11E8-B48F-1D18A9856A87
last_name: Osang
orcid: 0000-0002-8882-5116
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Lenoid
full_name: Reyzin, Lenoid
last_name: Reyzin
- first_name: Michal
full_name: Rolinek, Michal
id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87
last_name: Rolinek
- first_name: Michal
full_name: Rybar, Michal
id: 2B3E3DE8-F248-11E8-B48F-1D18A9856A87
last_name: Rybar
citation:
ama: 'Alwen JF, Gazi P, Kamath Hosdurg C, et al. On the memory hardness of data
independent password hashing functions. In: Proceedings of the 2018 on Asia
Conference on Computer and Communication Security. ACM; 2018:51-65. doi:10.1145/3196494.3196534'
apa: 'Alwen, J. F., Gazi, P., Kamath Hosdurg, C., Klein, K., Osang, G. F., Pietrzak,
K. Z., … Rybar, M. (2018). On the memory hardness of data independent password
hashing functions. In Proceedings of the 2018 on Asia Conference on Computer
and Communication Security (pp. 51–65). Incheon, Republic of Korea: ACM. https://doi.org/10.1145/3196494.3196534'
chicago: Alwen, Joel F, Peter Gazi, Chethan Kamath Hosdurg, Karen Klein, Georg F
Osang, Krzysztof Z Pietrzak, Lenoid Reyzin, Michal Rolinek, and Michal Rybar.
“On the Memory Hardness of Data Independent Password Hashing Functions.” In Proceedings
of the 2018 on Asia Conference on Computer and Communication Security, 51–65.
ACM, 2018. https://doi.org/10.1145/3196494.3196534.
ieee: J. F. Alwen et al., “On the memory hardness of data independent password
hashing functions,” in Proceedings of the 2018 on Asia Conference on Computer
and Communication Security, Incheon, Republic of Korea, 2018, pp. 51–65.
ista: 'Alwen JF, Gazi P, Kamath Hosdurg C, Klein K, Osang GF, Pietrzak KZ, Reyzin
L, Rolinek M, Rybar M. 2018. On the memory hardness of data independent password
hashing functions. Proceedings of the 2018 on Asia Conference on Computer and
Communication Security. ASIACCS: Asia Conference on Computer and Communications
Security , 51–65.'
mla: Alwen, Joel F., et al. “On the Memory Hardness of Data Independent Password
Hashing Functions.” Proceedings of the 2018 on Asia Conference on Computer
and Communication Security, ACM, 2018, pp. 51–65, doi:10.1145/3196494.3196534.
short: J.F. Alwen, P. Gazi, C. Kamath Hosdurg, K. Klein, G.F. Osang, K.Z. Pietrzak,
L. Reyzin, M. Rolinek, M. Rybar, in:, Proceedings of the 2018 on Asia Conference
on Computer and Communication Security, ACM, 2018, pp. 51–65.
conference:
end_date: 2018-06-08
location: Incheon, Republic of Korea
name: 'ASIACCS: Asia Conference on Computer and Communications Security '
start_date: 2018-06-04
date_created: 2018-12-11T11:45:07Z
date_published: 2018-06-01T00:00:00Z
date_updated: 2023-09-13T09:13:12Z
day: '01'
department:
- _id: KrPi
- _id: HeEd
- _id: VlKo
doi: 10.1145/3196494.3196534
ec_funded: 1
external_id:
isi:
- '000516620100005'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2016/783
month: '06'
oa: 1
oa_version: Submitted Version
page: 51 - 65
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: Proceedings of the 2018 on Asia Conference on Computer and Communication
Security
publication_status: published
publisher: ACM
publist_id: '7723'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the memory hardness of data independent password hashing functions
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...