---
_id: '6563'
abstract:
- lang: eng
text: "This paper presents two algorithms. The first decides the existence of a
pointed homotopy between given simplicial maps \U0001D453,\U0001D454:\U0001D44B→\U0001D44C,
and the second computes the group [\U0001D6F4\U0001D44B,\U0001D44C]∗ of pointed
homotopy classes of maps from a suspension; in both cases, the target Y is assumed
simply connected. More generally, these algorithms work relative to \U0001D434⊆\U0001D44B."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Marek
full_name: Filakovský, Marek
id: 3E8AF77E-F248-11E8-B48F-1D18A9856A87
last_name: Filakovský
- first_name: Lukas
full_name: Vokřínek, Lukas
last_name: Vokřínek
citation:
ama: Filakovský M, Vokřínek L. Are two given maps homotopic? An algorithmic viewpoint.
Foundations of Computational Mathematics. 2020;20:311-330. doi:10.1007/s10208-019-09419-x
apa: Filakovský, M., & Vokřínek, L. (2020). Are two given maps homotopic? An
algorithmic viewpoint. Foundations of Computational Mathematics. Springer
Nature. https://doi.org/10.1007/s10208-019-09419-x
chicago: Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An
Algorithmic Viewpoint.” Foundations of Computational Mathematics. Springer
Nature, 2020. https://doi.org/10.1007/s10208-019-09419-x.
ieee: M. Filakovský and L. Vokřínek, “Are two given maps homotopic? An algorithmic
viewpoint,” Foundations of Computational Mathematics, vol. 20. Springer
Nature, pp. 311–330, 2020.
ista: Filakovský M, Vokřínek L. 2020. Are two given maps homotopic? An algorithmic
viewpoint. Foundations of Computational Mathematics. 20, 311–330.
mla: Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An Algorithmic
Viewpoint.” Foundations of Computational Mathematics, vol. 20, Springer
Nature, 2020, pp. 311–30, doi:10.1007/s10208-019-09419-x.
short: M. Filakovský, L. Vokřínek, Foundations of Computational Mathematics 20 (2020)
311–330.
date_created: 2019-06-16T21:59:14Z
date_published: 2020-04-01T00:00:00Z
date_updated: 2025-07-10T11:53:32Z
day: '01'
department:
- _id: UlWa
doi: 10.1007/s10208-019-09419-x
external_id:
arxiv:
- '1312.2337'
isi:
- '000522437400004'
intvolume: ' 20'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1312.2337
month: '04'
oa: 1
oa_version: Preprint
page: 311-330
project:
- _id: 26611F5C-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P31312
name: Algorithms for Embeddings and Homotopy Theory
publication: Foundations of Computational Mathematics
publication_identifier:
eissn:
- 1615-3383
issn:
- 1615-3375
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Are two given maps homotopic? An algorithmic viewpoint
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 20
year: '2020'
...
---
_id: '6593'
abstract:
- lang: eng
text: 'We consider the monotone variational inequality problem in a Hilbert space
and describe a projection-type method with inertial terms under the following
properties: (a) The method generates a strongly convergent iteration sequence;
(b) The method requires, at each iteration, only one projection onto the feasible
set and two evaluations of the operator; (c) The method is designed for variational
inequality for which the underline operator is monotone and uniformly continuous;
(d) The method includes an inertial term. The latter is also shown to speed up
the convergence in our numerical results. A comparison with some related methods
is given and indicates that the new method is promising.'
acknowledgement: The research of this author is supported by the ERC grant at the
IST.
article_processing_charge: No
article_type: original
author:
- first_name: Yekini
full_name: Shehu, Yekini
id: 3FC7CB58-F248-11E8-B48F-1D18A9856A87
last_name: Shehu
orcid: 0000-0001-9224-7139
- first_name: Xiao-Huan
full_name: Li, Xiao-Huan
last_name: Li
- first_name: Qiao-Li
full_name: Dong, Qiao-Li
last_name: Dong
citation:
ama: Shehu Y, Li X-H, Dong Q-L. An efficient projection-type method for monotone
variational inequalities in Hilbert spaces. Numerical Algorithms. 2020;84:365-388.
doi:10.1007/s11075-019-00758-y
apa: Shehu, Y., Li, X.-H., & Dong, Q.-L. (2020). An efficient projection-type
method for monotone variational inequalities in Hilbert spaces. Numerical Algorithms.
Springer Nature. https://doi.org/10.1007/s11075-019-00758-y
chicago: Shehu, Yekini, Xiao-Huan Li, and Qiao-Li Dong. “An Efficient Projection-Type
Method for Monotone Variational Inequalities in Hilbert Spaces.” Numerical
Algorithms. Springer Nature, 2020. https://doi.org/10.1007/s11075-019-00758-y.
ieee: Y. Shehu, X.-H. Li, and Q.-L. Dong, “An efficient projection-type method for
monotone variational inequalities in Hilbert spaces,” Numerical Algorithms,
vol. 84. Springer Nature, pp. 365–388, 2020.
ista: Shehu Y, Li X-H, Dong Q-L. 2020. An efficient projection-type method for monotone
variational inequalities in Hilbert spaces. Numerical Algorithms. 84, 365–388.
mla: Shehu, Yekini, et al. “An Efficient Projection-Type Method for Monotone Variational
Inequalities in Hilbert Spaces.” Numerical Algorithms, vol. 84, Springer
Nature, 2020, pp. 365–88, doi:10.1007/s11075-019-00758-y.
short: Y. Shehu, X.-H. Li, Q.-L. Dong, Numerical Algorithms 84 (2020) 365–388.
corr_author: '1'
date_created: 2019-06-27T20:09:33Z
date_published: 2020-05-01T00:00:00Z
date_updated: 2024-11-04T13:52:40Z
day: '01'
ddc:
- '000'
department:
- _id: VlKo
doi: 10.1007/s11075-019-00758-y
ec_funded: 1
external_id:
isi:
- '000528979000015'
file:
- access_level: open_access
checksum: bb1a1eb3ebb2df380863d0db594673ba
content_type: application/pdf
creator: kschuh
date_created: 2019-10-01T13:14:10Z
date_updated: 2020-07-14T12:47:34Z
file_id: '6927'
file_name: ExtragradientMethodPaper.pdf
file_size: 359654
relation: main_file
file_date_updated: 2020-07-14T12:47:34Z
has_accepted_license: '1'
intvolume: ' 84'
isi: 1
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 365-388
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: Numerical Algorithms
publication_identifier:
eissn:
- 1572-9265
issn:
- 1017-1398
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: An efficient projection-type method for monotone variational inequalities in
Hilbert spaces
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 84
year: '2020'
...
---
_id: '6649'
abstract:
- lang: eng
text: "While Hartree–Fock theory is well established as a fundamental approximation
for interacting fermions, it has been unclear how to describe corrections to it
due to many-body correlations. In this paper we start from the Hartree–Fock state
given by plane waves and introduce collective particle–hole pair excitations.
These pairs can be approximately described by a bosonic quadratic Hamiltonian.
We use Bogoliubov theory to construct a trial state yielding a rigorous Gell-Mann–Brueckner–type
upper bound to the ground state energy. Our result justifies the random-phase
approximation in the mean-field scaling regime, for repulsive, regular interaction
potentials.\r\n"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Niels P
full_name: Benedikter, Niels P
id: 3DE6C32A-F248-11E8-B48F-1D18A9856A87
last_name: Benedikter
orcid: 0000-0002-1071-6091
- first_name: Phan Thành
full_name: Nam, Phan Thành
last_name: Nam
- first_name: Marcello
full_name: Porta, Marcello
last_name: Porta
- first_name: Benjamin
full_name: Schlein, Benjamin
last_name: Schlein
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Benedikter NP, Nam PT, Porta M, Schlein B, Seiringer R. Optimal upper bound
for the correlation energy of a Fermi gas in the mean-field regime. Communications
in Mathematical Physics. 2020;374:2097–2150. doi:10.1007/s00220-019-03505-5
apa: Benedikter, N. P., Nam, P. T., Porta, M., Schlein, B., & Seiringer, R.
(2020). Optimal upper bound for the correlation energy of a Fermi gas in the mean-field
regime. Communications in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s00220-019-03505-5
chicago: Benedikter, Niels P, Phan Thành Nam, Marcello Porta, Benjamin Schlein,
and Robert Seiringer. “Optimal Upper Bound for the Correlation Energy of a Fermi
Gas in the Mean-Field Regime.” Communications in Mathematical Physics.
Springer Nature, 2020. https://doi.org/10.1007/s00220-019-03505-5.
ieee: N. P. Benedikter, P. T. Nam, M. Porta, B. Schlein, and R. Seiringer, “Optimal
upper bound for the correlation energy of a Fermi gas in the mean-field regime,”
Communications in Mathematical Physics, vol. 374. Springer Nature, pp.
2097–2150, 2020.
ista: Benedikter NP, Nam PT, Porta M, Schlein B, Seiringer R. 2020. Optimal upper
bound for the correlation energy of a Fermi gas in the mean-field regime. Communications
in Mathematical Physics. 374, 2097–2150.
mla: Benedikter, Niels P., et al. “Optimal Upper Bound for the Correlation Energy
of a Fermi Gas in the Mean-Field Regime.” Communications in Mathematical Physics,
vol. 374, Springer Nature, 2020, pp. 2097–2150, doi:10.1007/s00220-019-03505-5.
short: N.P. Benedikter, P.T. Nam, M. Porta, B. Schlein, R. Seiringer, Communications
in Mathematical Physics 374 (2020) 2097–2150.
corr_author: '1'
date_created: 2019-07-18T13:30:04Z
date_published: 2020-03-01T00:00:00Z
date_updated: 2025-04-14T07:27:00Z
day: '01'
ddc:
- '530'
department:
- _id: RoSe
doi: 10.1007/s00220-019-03505-5
ec_funded: 1
external_id:
arxiv:
- '1809.01902'
isi:
- '000527910700019'
file:
- access_level: open_access
checksum: f9dd6dd615a698f1d3636c4a092fed23
content_type: application/pdf
creator: dernst
date_created: 2019-07-24T07:19:10Z
date_updated: 2020-07-14T12:47:35Z
file_id: '6668'
file_name: 2019_CommMathPhysics_Benedikter.pdf
file_size: 853289
relation: main_file
file_date_updated: 2020-07-14T12:47:35Z
has_accepted_license: '1'
intvolume: ' 374'
isi: 1
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 2097–2150
project:
- _id: 3AC91DDA-15DF-11EA-824D-93A3E7B544D1
call_identifier: FWF
name: FWF Open Access Fund
- _id: 25C878CE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P27533_N27
name: Structure of the Excitation Spectrum for Many-Body Quantum Systems
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: Communications in Mathematical Physics
publication_identifier:
eissn:
- 1432-0916
issn:
- 0010-3616
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optimal upper bound for the correlation energy of a Fermi gas in the mean-field
regime
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 374
year: '2020'
...
---
_id: '6748'
abstract:
- lang: eng
text: "Fitting a function by using linear combinations of a large number N of `simple'
components is one of the most fruitful ideas in statistical learning. This idea
lies at the core of a variety of methods, from two-layer neural networks to kernel
regression, to boosting. In general, the resulting risk minimization problem is
non-convex and is solved by gradient descent or its variants. Unfortunately, little
is known about global convergence properties of these approaches.\r\nHere we consider
the problem of learning a concave function f on a compact convex domain Ω⊆ℝd,
using linear combinations of `bump-like' components (neurons). The parameters
to be fitted are the centers of N bumps, and the resulting empirical risk minimization
problem is highly non-convex. We prove that, in the limit in which the number
of neurons diverges, the evolution of gradient descent converges to a Wasserstein
gradient flow in the space of probability distributions over Ω. Further, when
the bump width δ tends to 0, this gradient flow has a limit which is a viscous
porous medium equation. Remarkably, the cost function optimized by this gradient
flow exhibits a special property known as displacement convexity, which implies
exponential convergence rates for N→∞, δ→0. Surprisingly, this asymptotic theory
appears to capture well the behavior for moderate values of δ,N. Explaining this
phenomenon, and understanding the dependence on δ,N in a quantitative manner remains
an outstanding challenge."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Adel
full_name: Javanmard, Adel
last_name: Javanmard
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Andrea
full_name: Montanari, Andrea
last_name: Montanari
citation:
ama: Javanmard A, Mondelli M, Montanari A. Analysis of a two-layer neural network
via displacement convexity. Annals of Statistics. 2020;48(6):3619-3642.
doi:10.1214/20-AOS1945
apa: Javanmard, A., Mondelli, M., & Montanari, A. (2020). Analysis of a two-layer
neural network via displacement convexity. Annals of Statistics. Institute
of Mathematical Statistics. https://doi.org/10.1214/20-AOS1945
chicago: Javanmard, Adel, Marco Mondelli, and Andrea Montanari. “Analysis of a Two-Layer
Neural Network via Displacement Convexity.” Annals of Statistics. Institute
of Mathematical Statistics, 2020. https://doi.org/10.1214/20-AOS1945.
ieee: A. Javanmard, M. Mondelli, and A. Montanari, “Analysis of a two-layer neural
network via displacement convexity,” Annals of Statistics, vol. 48, no.
6. Institute of Mathematical Statistics, pp. 3619–3642, 2020.
ista: Javanmard A, Mondelli M, Montanari A. 2020. Analysis of a two-layer neural
network via displacement convexity. Annals of Statistics. 48(6), 3619–3642.
mla: Javanmard, Adel, et al. “Analysis of a Two-Layer Neural Network via Displacement
Convexity.” Annals of Statistics, vol. 48, no. 6, Institute of Mathematical
Statistics, 2020, pp. 3619–42, doi:10.1214/20-AOS1945.
short: A. Javanmard, M. Mondelli, A. Montanari, Annals of Statistics 48 (2020) 3619–3642.
date_created: 2019-07-31T09:39:42Z
date_published: 2020-12-11T00:00:00Z
date_updated: 2024-10-21T06:02:33Z
day: '11'
department:
- _id: MaMo
doi: 10.1214/20-AOS1945
external_id:
arxiv:
- '1901.01375'
isi:
- '000598369200021'
intvolume: ' 48'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1901.01375
month: '12'
oa: 1
oa_version: Preprint
page: 3619-3642
publication: Annals of Statistics
publication_identifier:
eissn:
- 1941-7330
issn:
- 1932-6157
publication_status: published
publisher: Institute of Mathematical Statistics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Analysis of a two-layer neural network via displacement convexity
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 48
year: '2020'
...
---
_id: '6761'
abstract:
- lang: eng
text: In resource allocation games, selfish players share resources that are needed
in order to fulfill their objectives. The cost of using a resource depends on
the load on it. In the traditional setting, the players make their choices concurrently
and in one-shot. That is, a strategy for a player is a subset of the resources.
We introduce and study dynamic resource allocation games. In this setting, the
game proceeds in phases. In each phase each player chooses one resource. A scheduler
dictates the order in which the players proceed in a phase, possibly scheduling
several players to proceed concurrently. The game ends when each player has collected
a set of resources that fulfills his objective. The cost for each player then
depends on this set as well as on the load on the resources in it – we consider
both congestion and cost-sharing games. We argue that the dynamic setting is the
suitable setting for many applications in practice. We study the stability of
dynamic resource allocation games, where the appropriate notion of stability is
that of subgame perfect equilibrium, study the inefficiency incurred due to selfish
behavior, and also study problems that are particular to the dynamic setting,
like constraints on the order in which resources can be chosen or the problem
of finding a scheduler that achieves stability.
article_processing_charge: No
article_type: original
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: Avni G, Henzinger TA, Kupferman O. Dynamic resource allocation games. Theoretical
Computer Science. 2020;807:42-55. doi:10.1016/j.tcs.2019.06.031
apa: Avni, G., Henzinger, T. A., & Kupferman, O. (2020). Dynamic resource allocation
games. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2019.06.031
chicago: Avni, Guy, Thomas A Henzinger, and Orna Kupferman. “Dynamic Resource Allocation
Games.” Theoretical Computer Science. Elsevier, 2020. https://doi.org/10.1016/j.tcs.2019.06.031.
ieee: G. Avni, T. A. Henzinger, and O. Kupferman, “Dynamic resource allocation games,”
Theoretical Computer Science, vol. 807. Elsevier, pp. 42–55, 2020.
ista: Avni G, Henzinger TA, Kupferman O. 2020. Dynamic resource allocation games.
Theoretical Computer Science. 807, 42–55.
mla: Avni, Guy, et al. “Dynamic Resource Allocation Games.” Theoretical Computer
Science, vol. 807, Elsevier, 2020, pp. 42–55, doi:10.1016/j.tcs.2019.06.031.
short: G. Avni, T.A. Henzinger, O. Kupferman, Theoretical Computer Science 807 (2020)
42–55.
date_created: 2019-08-04T21:59:20Z
date_published: 2020-02-06T00:00:00Z
date_updated: 2026-04-16T09:35:15Z
day: '06'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1016/j.tcs.2019.06.031
external_id:
isi:
- '000512219400004'
file:
- access_level: open_access
checksum: e86635417f45eb2cd75778f91382f737
content_type: application/pdf
creator: dernst
date_created: 2020-10-09T06:31:22Z
date_updated: 2020-10-09T06:31:22Z
file_id: '8639'
file_name: 2020_TheoreticalCS_Avni.pdf
file_size: 1413001
relation: main_file
success: 1
file_date_updated: 2020-10-09T06:31:22Z
has_accepted_license: '1'
intvolume: ' 807'
isi: 1
language:
- iso: eng
month: '02'
oa: 1
oa_version: Submitted Version
page: 42-55
project:
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _id: 264B3912-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02369
name: Formal Methods meets Algorithmic Game Theory
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
record:
- id: '1341'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Dynamic resource allocation games
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 807
year: '2020'
...
---
_id: '6796'
abstract:
- lang: eng
text: Nearby grid cells have been observed to express a remarkable degree of long-rangeorder,
which is often idealized as extending potentially to infinity. Yet their strict
peri-odic firing and ensemble coherence are theoretically possible only in flat
environments, much unlike the burrows which rodents usually live in. Are the symmetrical,
coherent grid maps inferred in the lab relevant to chart their way in their natural
habitat? We consider spheres as simple models of curved environments and waiting
for the appropriate experiments to be performed, we use our adaptation model to
predict what grid maps would emerge in a network with the same type of recurrent
connections, which on the plane produce coherence among the units. We find that
on the sphere such connections distort the maps that single grid units would express
on their own, and aggregate them into clusters. When remapping to a different
spherical environment, units in each cluster maintain only partial coherence,
similar to what is observed in disordered materials, such as spin glasses.
article_processing_charge: No
article_type: original
author:
- first_name: Federico
full_name: Stella, Federico
id: 39AF1E74-F248-11E8-B48F-1D18A9856A87
last_name: Stella
orcid: 0000-0001-9439-3148
- first_name: Eugenio
full_name: Urdapilleta, Eugenio
last_name: Urdapilleta
- first_name: Yifan
full_name: Luo, Yifan
last_name: Luo
- first_name: Alessandro
full_name: Treves, Alessandro
last_name: Treves
citation:
ama: Stella F, Urdapilleta E, Luo Y, Treves A. Partial coherence and frustration
in self-organizing spherical grids. Hippocampus. 2020;30(4):302-313. doi:10.1002/hipo.23144
apa: Stella, F., Urdapilleta, E., Luo, Y., & Treves, A. (2020). Partial coherence
and frustration in self-organizing spherical grids. Hippocampus. Wiley.
https://doi.org/10.1002/hipo.23144
chicago: Stella, Federico, Eugenio Urdapilleta, Yifan Luo, and Alessandro Treves.
“Partial Coherence and Frustration in Self-Organizing Spherical Grids.” Hippocampus.
Wiley, 2020. https://doi.org/10.1002/hipo.23144.
ieee: F. Stella, E. Urdapilleta, Y. Luo, and A. Treves, “Partial coherence and frustration
in self-organizing spherical grids,” Hippocampus, vol. 30, no. 4. Wiley,
pp. 302–313, 2020.
ista: Stella F, Urdapilleta E, Luo Y, Treves A. 2020. Partial coherence and frustration
in self-organizing spherical grids. Hippocampus. 30(4), 302–313.
mla: Stella, Federico, et al. “Partial Coherence and Frustration in Self-Organizing
Spherical Grids.” Hippocampus, vol. 30, no. 4, Wiley, 2020, pp. 302–13,
doi:10.1002/hipo.23144.
short: F. Stella, E. Urdapilleta, Y. Luo, A. Treves, Hippocampus 30 (2020) 302–313.
date_created: 2019-08-11T21:59:24Z
date_published: 2020-04-01T00:00:00Z
date_updated: 2025-05-22T11:13:25Z
day: '01'
ddc:
- '570'
department:
- _id: JoCs
doi: 10.1002/hipo.23144
external_id:
isi:
- '000477299600001'
pmid:
- '31339190'
file:
- access_level: open_access
checksum: 7b54d22bfbfc0d1188a9ea24d985bfb2
content_type: application/pdf
creator: dernst
date_created: 2019-08-12T07:53:33Z
date_updated: 2020-07-14T12:47:40Z
file_id: '6800'
file_name: 2019_Hippocampus_Stella.pdf
file_size: 2370658
relation: main_file
file_date_updated: 2020-07-14T12:47:40Z
has_accepted_license: '1'
intvolume: ' 30'
isi: 1
issue: '4'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 302-313
pmid: 1
publication: Hippocampus
publication_identifier:
eissn:
- 1098-1063
issn:
- 1050-9631
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Partial coherence and frustration in self-organizing spherical grids
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: 9947682f-b9fa-11ee-9c4a-b3ffaafe6614
volume: 30
year: '2020'
...
---
_id: '6808'
abstract:
- lang: eng
text: Super-resolution fluorescence microscopy has become an important catalyst
for discovery in the life sciences. In STimulated Emission Depletion (STED) microscopy,
a pattern of light drives fluorophores from a signal-emitting on-state to a non-signalling
off-state. Only emitters residing in a sub-diffraction volume around an intensity
minimum are allowed to fluoresce, rendering them distinguishable from the nearby,
but dark fluorophores. STED routinely achieves resolution in the few tens of nanometers
range in biological samples and is suitable for live imaging. Here, we review
the working principle of STED and provide general guidelines for successful STED
imaging. The strive for ever higher resolution comes at the cost of increased
light burden. We discuss techniques to reduce light exposure and mitigate its
detrimental effects on the specimen. These include specialized illumination strategies
as well as protecting fluorophores from photobleaching mediated by high-intensity
STED light. This opens up the prospect of volumetric imaging in living cells and
tissues with diffraction-unlimited resolution in all three spatial dimensions.
article_processing_charge: No
article_type: original
author:
- first_name: Wiebke
full_name: Jahr, Wiebke
id: 425C1CE8-F248-11E8-B48F-1D18A9856A87
last_name: Jahr
- first_name: Philipp
full_name: Velicky, Philipp
id: 39BDC62C-F248-11E8-B48F-1D18A9856A87
last_name: Velicky
orcid: 0000-0002-2340-7431
- first_name: Johann G
full_name: Danzl, Johann G
id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87
last_name: Danzl
orcid: 0000-0001-8559-3973
citation:
ama: Jahr W, Velicky P, Danzl JG. Strategies to maximize performance in STimulated
Emission Depletion (STED) nanoscopy of biological specimens. Methods. 2020;174(3):27-41.
doi:10.1016/j.ymeth.2019.07.019
apa: Jahr, W., Velicky, P., & Danzl, J. G. (2020). Strategies to maximize performance
in STimulated Emission Depletion (STED) nanoscopy of biological specimens. Methods.
Elsevier. https://doi.org/10.1016/j.ymeth.2019.07.019
chicago: Jahr, Wiebke, Philipp Velicky, and Johann G Danzl. “Strategies to Maximize
Performance in STimulated Emission Depletion (STED) Nanoscopy of Biological Specimens.”
Methods. Elsevier, 2020. https://doi.org/10.1016/j.ymeth.2019.07.019.
ieee: W. Jahr, P. Velicky, and J. G. Danzl, “Strategies to maximize performance
in STimulated Emission Depletion (STED) nanoscopy of biological specimens,” Methods,
vol. 174, no. 3. Elsevier, pp. 27–41, 2020.
ista: Jahr W, Velicky P, Danzl JG. 2020. Strategies to maximize performance in STimulated
Emission Depletion (STED) nanoscopy of biological specimens. Methods. 174(3),
27–41.
mla: Jahr, Wiebke, et al. “Strategies to Maximize Performance in STimulated Emission
Depletion (STED) Nanoscopy of Biological Specimens.” Methods, vol. 174,
no. 3, Elsevier, 2020, pp. 27–41, doi:10.1016/j.ymeth.2019.07.019.
short: W. Jahr, P. Velicky, J.G. Danzl, Methods 174 (2020) 27–41.
date_created: 2019-08-12T16:36:32Z
date_published: 2020-03-01T00:00:00Z
date_updated: 2025-04-14T09:39:25Z
day: '01'
department:
- _id: JoDa
doi: 10.1016/j.ymeth.2019.07.019
external_id:
isi:
- '000525860400005'
pmid:
- '31344404'
intvolume: ' 174'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7100895/
month: '03'
oa: 1
oa_version: Submitted Version
page: 27-41
pmid: 1
project:
- _id: 265CB4D0-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I03600
name: Optical control of synaptic function via adhesion molecules
- _id: 2668BFA0-B435-11E9-9278-68D0E5697425
grant_number: LT00057
name: High-speed 3D-nanoscopy to study the role of adhesion during 3D cell migration
publication: Methods
publication_identifier:
issn:
- 1046-2023
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Strategies to maximize performance in STimulated Emission Depletion (STED)
nanoscopy of biological specimens
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 174
year: '2020'
...
---
_id: '6906'
abstract:
- lang: eng
text: We consider systems of bosons trapped in a box, in the Gross–Pitaevskii regime.
We show that low-energy states exhibit complete Bose–Einstein condensation with
an optimal bound on the number of orthogonal excitations. This extends recent
results obtained in Boccato et al. (Commun Math Phys 359(3):975–1026, 2018), removing
the assumption of small interaction potential.
acknowledgement: "We would like to thank P. T. Nam and R. Seiringer for several useful
discussions and\r\nfor suggesting us to use the localization techniques from [9].
C. Boccato has received funding from the\r\nEuropean Research Council (ERC) under
the programme Horizon 2020 (Grant Agreement 694227). B. Schlein gratefully acknowledges
support from the NCCR SwissMAP and from the Swiss National Foundation of Science
(Grant No. 200020_1726230) through the SNF Grant “Dynamical and energetic properties
of Bose–Einstein condensates”."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Chiara
full_name: Boccato, Chiara
id: 342E7E22-F248-11E8-B48F-1D18A9856A87
last_name: Boccato
- first_name: Christian
full_name: Brennecke, Christian
last_name: Brennecke
- first_name: Serena
full_name: Cenatiempo, Serena
last_name: Cenatiempo
- first_name: Benjamin
full_name: Schlein, Benjamin
last_name: Schlein
citation:
ama: Boccato C, Brennecke C, Cenatiempo S, Schlein B. Optimal rate for Bose-Einstein
condensation in the Gross-Pitaevskii regime. Communications in Mathematical
Physics. 2020;376:1311-1395. doi:10.1007/s00220-019-03555-9
apa: Boccato, C., Brennecke, C., Cenatiempo, S., & Schlein, B. (2020). Optimal
rate for Bose-Einstein condensation in the Gross-Pitaevskii regime. Communications
in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-019-03555-9
chicago: Boccato, Chiara, Christian Brennecke, Serena Cenatiempo, and Benjamin Schlein.
“Optimal Rate for Bose-Einstein Condensation in the Gross-Pitaevskii Regime.”
Communications in Mathematical Physics. Springer, 2020. https://doi.org/10.1007/s00220-019-03555-9.
ieee: C. Boccato, C. Brennecke, S. Cenatiempo, and B. Schlein, “Optimal rate for
Bose-Einstein condensation in the Gross-Pitaevskii regime,” Communications
in Mathematical Physics, vol. 376. Springer, pp. 1311–1395, 2020.
ista: Boccato C, Brennecke C, Cenatiempo S, Schlein B. 2020. Optimal rate for Bose-Einstein
condensation in the Gross-Pitaevskii regime. Communications in Mathematical Physics.
376, 1311–1395.
mla: Boccato, Chiara, et al. “Optimal Rate for Bose-Einstein Condensation in the
Gross-Pitaevskii Regime.” Communications in Mathematical Physics, vol.
376, Springer, 2020, pp. 1311–95, doi:10.1007/s00220-019-03555-9.
short: C. Boccato, C. Brennecke, S. Cenatiempo, B. Schlein, Communications in Mathematical
Physics 376 (2020) 1311–1395.
date_created: 2019-09-24T17:30:59Z
date_published: 2020-06-01T00:00:00Z
date_updated: 2025-04-14T07:27:00Z
day: '01'
department:
- _id: RoSe
doi: 10.1007/s00220-019-03555-9
ec_funded: 1
external_id:
arxiv:
- '1812.03086'
isi:
- '000536053300012'
intvolume: ' 376'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1812.03086
month: '06'
oa: 1
oa_version: Preprint
page: 1311-1395
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: Communications in Mathematical Physics
publication_identifier:
eissn:
- 1432-0916
issn:
- 0010-3616
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 376
year: '2020'
...
---
_id: '6944'
abstract:
- lang: eng
text: 'We study the problem of automatically detecting if a given multi-class classifier
operates outside of its specifications (out-of-specs), i.e. on input data from
a different distribution than what it was trained for. This is an important problem
to solve on the road towards creating reliable computer vision systems for real-world
applications, because the quality of a classifier’s predictions cannot be guaranteed
if it operates out-of-specs. Previously proposed methods for out-of-specs detection
make decisions on the level of single inputs. This, however, is insufficient to
achieve low false positive rate and high false negative rates at the same time.
In this work, we describe a new procedure named KS(conf), based on statistical
reasoning. Its main component is a classical Kolmogorov–Smirnov test that is applied
to the set of predicted confidence values for batches of samples. Working with
batches instead of single samples allows increasing the true positive rate without
negatively affecting the false positive rate, thereby overcoming a crucial limitation
of single sample tests. We show by extensive experiments using a variety of convolutional
network architectures and datasets that KS(conf) reliably detects out-of-specs
situations even under conditions where other tests fail. It furthermore has a
number of properties that make it an excellent candidate for practical deployment:
it is easy to implement, adds almost no overhead to the system, works with any
classifier that outputs confidence scores, and requires no a priori knowledge
about how the data distribution could change.'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Rémy
full_name: Sun, Rémy
last_name: Sun
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Sun R, Lampert C. KS(conf): A light-weight test if a multiclass classifier
operates outside of its specifications. International Journal of Computer Vision.
2020;128(4):970-995. doi:10.1007/s11263-019-01232-x'
apa: 'Sun, R., & Lampert, C. (2020). KS(conf): A light-weight test if a multiclass
classifier operates outside of its specifications. International Journal of
Computer Vision. Springer Nature. https://doi.org/10.1007/s11263-019-01232-x'
chicago: 'Sun, Rémy, and Christoph Lampert. “KS(Conf): A Light-Weight Test If a
Multiclass Classifier Operates Outside of Its Specifications.” International
Journal of Computer Vision. Springer Nature, 2020. https://doi.org/10.1007/s11263-019-01232-x.'
ieee: 'R. Sun and C. Lampert, “KS(conf): A light-weight test if a multiclass classifier
operates outside of its specifications,” International Journal of Computer
Vision, vol. 128, no. 4. Springer Nature, pp. 970–995, 2020.'
ista: 'Sun R, Lampert C. 2020. KS(conf): A light-weight test if a multiclass classifier
operates outside of its specifications. International Journal of Computer Vision.
128(4), 970–995.'
mla: 'Sun, Rémy, and Christoph Lampert. “KS(Conf): A Light-Weight Test If a Multiclass
Classifier Operates Outside of Its Specifications.” International Journal of
Computer Vision, vol. 128, no. 4, Springer Nature, 2020, pp. 970–95, doi:10.1007/s11263-019-01232-x.'
short: R. Sun, C. Lampert, International Journal of Computer Vision 128 (2020) 970–995.
corr_author: '1'
date_created: 2019-10-14T09:14:28Z
date_published: 2020-04-01T00:00:00Z
date_updated: 2025-04-15T07:10:25Z
day: '01'
ddc:
- '004'
department:
- _id: ChLa
doi: 10.1007/s11263-019-01232-x
ec_funded: 1
external_id:
isi:
- '000494406800001'
file:
- access_level: open_access
checksum: 155e63edf664dcacb3bdc1c2223e606f
content_type: application/pdf
creator: dernst
date_created: 2019-11-26T10:30:02Z
date_updated: 2020-07-14T12:47:45Z
file_id: '7110'
file_name: 2019_IJCV_Sun.pdf
file_size: 1715072
relation: main_file
file_date_updated: 2020-07-14T12:47:45Z
has_accepted_license: '1'
intvolume: ' 128'
isi: 1
issue: '4'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 970-995
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: International Journal of Computer Vision
publication_identifier:
eissn:
- 1573-1405
issn:
- 0920-5691
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- relation: erratum
url: https://doi.org/10.1007/s11263-019-01262-5
record:
- id: '6482'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: 'KS(conf): A light-weight test if a multiclass classifier operates outside
of its specifications'
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: 128
year: '2020'
...
---
_id: '6976'
abstract:
- lang: eng
text: Origami is rapidly transforming the design of robots1,2, deployable structures3,4,5,6
and metamaterials7,8,9,10,11,12,13,14. However, as foldability requires a large
number of complex compatibility conditions that are difficult to satisfy, the
design of crease patterns is limited to heuristics and computer optimization.
Here we introduce a systematic strategy that enables intuitive and effective design
of complex crease patterns that are guaranteed to fold. First, we exploit symmetries
to construct 140 distinct foldable motifs, and represent these as jigsaw puzzle
pieces. We then show that when these pieces are fitted together they encode foldable
crease patterns. This maps origami design to solving combinatorial problems, which
allows us to systematically create, count and classify a vast number of crease
patterns. We show that all of these crease patterns are pluripotent—capable of
folding into multiple shapes—and solve exactly for the number of possible shapes
for each pattern. Finally, we employ our framework to rationally design a crease
pattern that folds into two independently defined target shapes, and fabricate
such pluripotent origami. Our results provide physicists, mathematicians and engineers
with a powerful new design strategy.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Peter
full_name: Dieleman, Peter
last_name: Dieleman
- first_name: Niek
full_name: Vasmel, Niek
last_name: Vasmel
- 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: Martin
full_name: van Hecke, Martin
last_name: van Hecke
citation:
ama: Dieleman P, Vasmel N, Waitukaitis SR, van Hecke M. Jigsaw puzzle design of
pluripotent origami. Nature Physics. 2020;16(1):63–68. doi:10.1038/s41567-019-0677-3
apa: Dieleman, P., Vasmel, N., Waitukaitis, S. R., & van Hecke, M. (2020). Jigsaw
puzzle design of pluripotent origami. Nature Physics. Springer Nature.
https://doi.org/10.1038/s41567-019-0677-3
chicago: Dieleman, Peter, Niek Vasmel, Scott R Waitukaitis, and Martin van Hecke.
“Jigsaw Puzzle Design of Pluripotent Origami.” Nature Physics. Springer
Nature, 2020. https://doi.org/10.1038/s41567-019-0677-3.
ieee: P. Dieleman, N. Vasmel, S. R. Waitukaitis, and M. van Hecke, “Jigsaw puzzle
design of pluripotent origami,” Nature Physics, vol. 16, no. 1. Springer
Nature, pp. 63–68, 2020.
ista: Dieleman P, Vasmel N, Waitukaitis SR, van Hecke M. 2020. Jigsaw puzzle design
of pluripotent origami. Nature Physics. 16(1), 63–68.
mla: Dieleman, Peter, et al. “Jigsaw Puzzle Design of Pluripotent Origami.” Nature
Physics, vol. 16, no. 1, Springer Nature, 2020, pp. 63–68, doi:10.1038/s41567-019-0677-3.
short: P. Dieleman, N. Vasmel, S.R. Waitukaitis, M. van Hecke, Nature Physics 16
(2020) 63–68.
date_created: 2019-10-31T07:51:44Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2021-01-12T08:11:16Z
day: '01'
doi: 10.1038/s41567-019-0677-3
extern: '1'
intvolume: ' 16'
issue: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 63–68
publication: Nature Physics
publication_identifier:
eissn:
- 1745-2481
issn:
- 1745-2473
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Jigsaw puzzle design of pluripotent origami
type: journal_article
user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425
volume: 16
year: '2020'
...
---
_id: '6997'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Yuzhou
full_name: Zhang, Yuzhou
id: 3B6137F2-F248-11E8-B48F-1D18A9856A87
last_name: Zhang
orcid: 0000-0003-2627-6956
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Zhang Y, Friml J. Auxin guides roots to avoid obstacles during gravitropic
growth. New Phytologist. 2020;225(3):1049-1052. doi:10.1111/nph.16203
apa: Zhang, Y., & Friml, J. (2020). Auxin guides roots to avoid obstacles during
gravitropic growth. New Phytologist. Wiley. https://doi.org/10.1111/nph.16203
chicago: Zhang, Yuzhou, and Jiří Friml. “Auxin Guides Roots to Avoid Obstacles during
Gravitropic Growth.” New Phytologist. Wiley, 2020. https://doi.org/10.1111/nph.16203.
ieee: Y. Zhang and J. Friml, “Auxin guides roots to avoid obstacles during gravitropic
growth,” New Phytologist, vol. 225, no. 3. Wiley, pp. 1049–1052, 2020.
ista: Zhang Y, Friml J. 2020. Auxin guides roots to avoid obstacles during gravitropic
growth. New Phytologist. 225(3), 1049–1052.
mla: Zhang, Yuzhou, and Jiří Friml. “Auxin Guides Roots to Avoid Obstacles during
Gravitropic Growth.” New Phytologist, vol. 225, no. 3, Wiley, 2020, pp.
1049–52, doi:10.1111/nph.16203.
short: Y. Zhang, J. Friml, New Phytologist 225 (2020) 1049–1052.
corr_author: '1'
date_created: 2019-11-12T11:41:32Z
date_published: 2020-02-01T00:00:00Z
date_updated: 2025-04-14T07:45:04Z
day: '01'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.1111/nph.16203
ec_funded: 1
external_id:
isi:
- '000489638800001'
pmid:
- '31603260'
file:
- access_level: open_access
checksum: cd42ffdb381fd52812b9583d4d407139
content_type: application/pdf
creator: dernst
date_created: 2020-11-18T16:42:48Z
date_updated: 2020-11-18T16:42:48Z
file_id: '8772'
file_name: 2020_NewPhytologist_Zhang.pdf
file_size: 717345
relation: main_file
success: 1
file_date_updated: 2020-11-18T16:42:48Z
has_accepted_license: '1'
intvolume: ' 225'
isi: 1
issue: '3'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 1049-1052
pmid: 1
project:
- _id: 261099A6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '742985'
name: Tracing Evolution of Auxin Transport and Polarity in Plants
- _id: 26538374-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I03630
name: Molecular mechanisms of endocytic cargo recognition in plants
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: New Phytologist
publication_identifier:
eissn:
- 1469-8137
issn:
- 0028-646x
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Auxin guides roots to avoid obstacles during gravitropic growth
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 225
year: '2020'
...
---
_id: '7004'
abstract:
- lang: eng
text: We define an action of the (double of) Cohomological Hall algebra of Kontsevich
and Soibelman on the cohomology of the moduli space of spiked instantons of Nekrasov.
We identify this action with the one of the affine Yangian of gl(1). Based on
that we derive the vertex algebra at the corner Wr1,r2,r3 of Gaiotto and Rapčák.
We conjecture that our approach works for a big class of Calabi–Yau categories,
including those associated with toric Calabi–Yau 3-folds.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Miroslav
full_name: Rapcak, Miroslav
last_name: Rapcak
- first_name: Yan
full_name: Soibelman, Yan
last_name: Soibelman
- first_name: Yaping
full_name: Yang, Yaping
last_name: Yang
- first_name: Gufang
full_name: Zhao, Gufang
id: 2BC2AC5E-F248-11E8-B48F-1D18A9856A87
last_name: Zhao
citation:
ama: Rapcak M, Soibelman Y, Yang Y, Zhao G. Cohomological Hall algebras, vertex
algebras and instantons. Communications in Mathematical Physics. 2020;376:1803-1873.
doi:10.1007/s00220-019-03575-5
apa: Rapcak, M., Soibelman, Y., Yang, Y., & Zhao, G. (2020). Cohomological Hall
algebras, vertex algebras and instantons. Communications in Mathematical Physics.
Springer Nature. https://doi.org/10.1007/s00220-019-03575-5
chicago: Rapcak, Miroslav, Yan Soibelman, Yaping Yang, and Gufang Zhao. “Cohomological
Hall Algebras, Vertex Algebras and Instantons.” Communications in Mathematical
Physics. Springer Nature, 2020. https://doi.org/10.1007/s00220-019-03575-5.
ieee: M. Rapcak, Y. Soibelman, Y. Yang, and G. Zhao, “Cohomological Hall algebras,
vertex algebras and instantons,” Communications in Mathematical Physics,
vol. 376. Springer Nature, pp. 1803–1873, 2020.
ista: Rapcak M, Soibelman Y, Yang Y, Zhao G. 2020. Cohomological Hall algebras,
vertex algebras and instantons. Communications in Mathematical Physics. 376, 1803–1873.
mla: Rapcak, Miroslav, et al. “Cohomological Hall Algebras, Vertex Algebras and
Instantons.” Communications in Mathematical Physics, vol. 376, Springer
Nature, 2020, pp. 1803–73, doi:10.1007/s00220-019-03575-5.
short: M. Rapcak, Y. Soibelman, Y. Yang, G. Zhao, Communications in Mathematical
Physics 376 (2020) 1803–1873.
date_created: 2019-11-12T14:01:27Z
date_published: 2020-06-01T00:00:00Z
date_updated: 2025-04-14T09:12:46Z
day: '01'
department:
- _id: TaHa
doi: 10.1007/s00220-019-03575-5
ec_funded: 1
external_id:
arxiv:
- '1810.10402'
isi:
- '000536255500004'
intvolume: ' 376'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1810.10402
month: '06'
oa: 1
oa_version: Preprint
page: 1803-1873
project:
- _id: 25E549F4-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '320593'
name: Arithmetic and physics of Higgs moduli spaces
publication: Communications in Mathematical Physics
publication_identifier:
eissn:
- 1432-0916
issn:
- 0010-3616
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Cohomological Hall algebras, vertex algebras and instantons
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 376
year: '2020'
...
---
_id: '7033'
abstract:
- lang: eng
text: Removal of the Bax gene from mice completely protects the somas of retinal
ganglion cells (RGCs) from apoptosis following optic nerve injury. This makes
BAX a promising therapeutic target to prevent neurodegeneration. In this study,
Bax+/− mice were used to test the hypothesis that lowering the quantity of BAX
in RGCs would delay apoptosis following optic nerve injury. RGCs were damaged
by performing optic nerve crush (ONC) and then immunostaining for phospho-cJUN,
and quantitative PCR were used to monitor the status of the BAX activation mechanism
in the months following injury. The apoptotic susceptibility of injured cells
was directly tested by virally introducing GFP-BAX into Bax−/− RGCs after injury.
The competency of quiescent RGCs to reactivate their BAX activation mechanism
was tested by intravitreal injection of the JNK pathway agonist, anisomycin. Twenty-four
weeks after ONC, Bax+/− mice had significantly less cell loss in their RGC layer
than Bax+/+ mice 3 weeks after ONC. Bax+/− and Bax+/+ RGCs exhibited similar patterns
of nuclear phospho-cJUN accumulation immediately after ONC, which persisted in
Bax+/− RGCs for up to 7 weeks before abating. The transcriptional activation of
BAX-activating genes was similar in Bax+/− and Bax+/+ RGCs following ONC. Intriguingly,
cells deactivated their BAX activation mechanism between 7 and 12 weeks after
crush. Introduction of GFP-BAX into Bax−/− cells at 4 weeks after ONC showed that
these cells had a nearly normal capacity to activate this protein, but this capacity
was lost 8 weeks after crush. Collectively, these data suggest that 8–12 weeks
after crush, damaged cells no longer displayed increased susceptibility to BAX
activation relative to their naïve counterparts. In this same timeframe, retinal
glial activation and the signaling of the pro-apoptotic JNK pathway also abated.
Quiescent RGCs did not show a timely reactivation of their JNK pathway following
intravitreal injection with anisomycin. These findings demonstrate that lowering
the quantity of BAX in RGCs is neuroprotective after acute injury. Damaged RGCs
enter a quiescent state months after injury and are no longer responsive to an
apoptotic stimulus. Quiescent RGCs will require rejuvenation to reacquire functionality.
acknowledgement: This work was supported by National Eye Institute grants R01 EY012223
(RWN), R01 EY030123 (RWN), T32 EY027721 (Department of Ophthalmology and Visual
Sciences, University of Wisconsin-Madison), and a Vision Science Core grant P30
EY016665 (Department of Ophthalmology and Visual Sciences, University of Wisconsin-Madison),
an unrestricted funding grant from Research to Prevent Blindness (Department of
Ophthalmology and Visual Sciences, University of Wisconsin-Madison), the Frederick
A. Davis Endowment (RWN), and the Mr. and Mrs. George Taylor Foundation (RWN).
article_processing_charge: No
article_type: original
author:
- first_name: RJ
full_name: Donahue, RJ
last_name: Donahue
- first_name: Margaret E
full_name: Maes, Margaret E
id: 3838F452-F248-11E8-B48F-1D18A9856A87
last_name: Maes
orcid: 0000-0001-9642-1085
- first_name: JA
full_name: Grosser, JA
last_name: Grosser
- first_name: RW
full_name: Nickells, RW
last_name: Nickells
citation:
ama: Donahue R, Maes ME, Grosser J, Nickells R. BAX-depleted retinal ganglion cells
survive and become quiescent following optic nerve damage. Molecular Neurobiology.
2020;57(2):1070–1084. doi:10.1007/s12035-019-01783-7
apa: Donahue, R., Maes, M. E., Grosser, J., & Nickells, R. (2020). BAX-depleted
retinal ganglion cells survive and become quiescent following optic nerve damage.
Molecular Neurobiology. Springer Nature. https://doi.org/10.1007/s12035-019-01783-7
chicago: Donahue, RJ, Margaret E Maes, JA Grosser, and RW Nickells. “BAX-Depleted
Retinal Ganglion Cells Survive and Become Quiescent Following Optic Nerve Damage.”
Molecular Neurobiology. Springer Nature, 2020. https://doi.org/10.1007/s12035-019-01783-7.
ieee: R. Donahue, M. E. Maes, J. Grosser, and R. Nickells, “BAX-depleted retinal
ganglion cells survive and become quiescent following optic nerve damage,” Molecular
Neurobiology, vol. 57, no. 2. Springer Nature, pp. 1070–1084, 2020.
ista: Donahue R, Maes ME, Grosser J, Nickells R. 2020. BAX-depleted retinal ganglion
cells survive and become quiescent following optic nerve damage. Molecular Neurobiology.
57(2), 1070–1084.
mla: Donahue, RJ, et al. “BAX-Depleted Retinal Ganglion Cells Survive and Become
Quiescent Following Optic Nerve Damage.” Molecular Neurobiology, vol. 57,
no. 2, Springer Nature, 2020, pp. 1070–1084, doi:10.1007/s12035-019-01783-7.
short: R. Donahue, M.E. Maes, J. Grosser, R. Nickells, Molecular Neurobiology 57
(2020) 1070–1084.
date_created: 2019-11-18T14:18:39Z
date_published: 2020-02-01T00:00:00Z
date_updated: 2023-08-17T14:05:48Z
day: '01'
department:
- _id: SaSi
doi: 10.1007/s12035-019-01783-7
external_id:
isi:
- '000493754200001'
pmid:
- '31673950'
intvolume: ' 57'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7035206/
month: '02'
oa: 1
oa_version: Submitted Version
page: 1070–1084
pmid: 1
publication: Molecular Neurobiology
publication_identifier:
eissn:
- 1559-1182
issn:
- 0893-7648
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: BAX-depleted retinal ganglion cells survive and become quiescent following
optic nerve damage
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 57
year: '2020'
...
---
_id: '7084'
abstract:
- lang: eng
text: The unusual correlated state that emerges in URu2Si2 below THO = 17.5 K is
known as “hidden order” because even basic characteristics of the order parameter,
such as its dimensionality (whether it has one component or two), are “hidden.”
We use resonant ultrasound spectroscopy to measure the symmetry-resolved elastic
anomalies across THO. We observe no anomalies in the shear elastic moduli, providing
strong thermodynamic evidence for a one-component order parameter. We develop
a machine learning framework that reaches this conclusion directly from the raw
data, even in a crystal that is too small for traditional resonant ultrasound.
Our result rules out a broad class of theories of hidden order based on two-component
order parameters, and constrains the nature of the fluctuations from which unconventional
superconductivity emerges at lower temperature. Our machine learning framework
is a powerful new tool for classifying the ubiquitous competing orders in correlated
electron systems.
article_number: eaaz4074
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Sayak
full_name: Ghosh, Sayak
last_name: Ghosh
- first_name: Michael
full_name: Matty, Michael
last_name: Matty
- first_name: Ryan
full_name: Baumbach, Ryan
last_name: Baumbach
- first_name: Eric D.
full_name: Bauer, Eric D.
last_name: Bauer
- first_name: Kimberly A
full_name: Modic, Kimberly A
id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425
last_name: Modic
orcid: 0000-0001-9760-3147
- first_name: Arkady
full_name: Shekhter, Arkady
last_name: Shekhter
- first_name: J. A.
full_name: Mydosh, J. A.
last_name: Mydosh
- first_name: Eun-Ah
full_name: Kim, Eun-Ah
last_name: Kim
- first_name: B. J.
full_name: Ramshaw, B. J.
last_name: Ramshaw
citation:
ama: Ghosh S, Matty M, Baumbach R, et al. One-component order parameter in URu2Si2
uncovered by resonant ultrasound spectroscopy and machine learning. Science
Advances. 2020;6(10). doi:10.1126/sciadv.aaz4074
apa: Ghosh, S., Matty, M., Baumbach, R., Bauer, E. D., Modic, K. A., Shekhter, A.,
… Ramshaw, B. J. (2020). One-component order parameter in URu2Si2 uncovered by
resonant ultrasound spectroscopy and machine learning. Science Advances.
American Association for the Advancement of Science. https://doi.org/10.1126/sciadv.aaz4074
chicago: Ghosh, Sayak, Michael Matty, Ryan Baumbach, Eric D. Bauer, Kimberly A Modic,
Arkady Shekhter, J. A. Mydosh, Eun-Ah Kim, and B. J. Ramshaw. “One-Component Order
Parameter in URu2Si2 Uncovered by Resonant Ultrasound Spectroscopy and Machine
Learning.” Science Advances. American Association for the Advancement of
Science, 2020. https://doi.org/10.1126/sciadv.aaz4074.
ieee: S. Ghosh et al., “One-component order parameter in URu2Si2 uncovered
by resonant ultrasound spectroscopy and machine learning,” Science Advances,
vol. 6, no. 10. American Association for the Advancement of Science, 2020.
ista: Ghosh S, Matty M, Baumbach R, Bauer ED, Modic KA, Shekhter A, Mydosh JA, Kim
E-A, Ramshaw BJ. 2020. One-component order parameter in URu2Si2 uncovered by resonant
ultrasound spectroscopy and machine learning. Science Advances. 6(10), eaaz4074.
mla: Ghosh, Sayak, et al. “One-Component Order Parameter in URu2Si2 Uncovered by
Resonant Ultrasound Spectroscopy and Machine Learning.” Science Advances,
vol. 6, no. 10, eaaz4074, American Association for the Advancement of Science,
2020, doi:10.1126/sciadv.aaz4074.
short: S. Ghosh, M. Matty, R. Baumbach, E.D. Bauer, K.A. Modic, A. Shekhter, J.A.
Mydosh, E.-A. Kim, B.J. Ramshaw, Science Advances 6 (2020).
date_created: 2019-11-19T14:01:10Z
date_published: 2020-03-06T00:00:00Z
date_updated: 2022-08-25T15:08:41Z
day: '06'
doi: 10.1126/sciadv.aaz4074
extern: '1'
external_id:
arxiv:
- '1903.00552'
pmid:
- '32181367'
intvolume: ' 6'
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1903.00552
month: '03'
oa: 1
oa_version: Preprint
pmid: 1
publication: Science Advances
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
status: public
title: One-component order parameter in URu2Si2 uncovered by resonant ultrasound
spectroscopy and machine learning
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2020'
...
---
_id: '71'
abstract:
- lang: eng
text: "We consider dynamical transport metrics for probability measures on discretisations
of a bounded convex domain in ℝd. These metrics are natural discrete counterparts
to the Kantorovich metric \U0001D54E2, defined using a Benamou-Brenier type formula.
Under mild assumptions we prove an asymptotic upper bound for the discrete transport
metric Wt in terms of \U0001D54E2, as the size of the mesh T tends to 0. However,
we show that the corresponding lower bound may fail in general, even on certain
one-dimensional and symmetric two-dimensional meshes. In addition, we show that
the asymptotic lower bound holds under an isotropy assumption on the mesh, which
turns out to be essentially necessary. This assumption is satisfied, e.g., for
tilings by convex regular polygons, and it implies Gromov-Hausdorff convergence
of the transport metric."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Peter
full_name: Gladbach, Peter
last_name: Gladbach
- first_name: Eva
full_name: Kopfer, Eva
last_name: Kopfer
- first_name: Jan
full_name: Maas, Jan
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
citation:
ama: Gladbach P, Kopfer E, Maas J. Scaling limits of discrete optimal transport.
SIAM Journal on Mathematical Analysis. 2020;52(3):2759-2802. doi:10.1137/19M1243440
apa: Gladbach, P., Kopfer, E., & Maas, J. (2020). Scaling limits of discrete
optimal transport. SIAM Journal on Mathematical Analysis. Society for Industrial
and Applied Mathematics. https://doi.org/10.1137/19M1243440
chicago: Gladbach, Peter, Eva Kopfer, and Jan Maas. “Scaling Limits of Discrete
Optimal Transport.” SIAM Journal on Mathematical Analysis. Society for
Industrial and Applied Mathematics, 2020. https://doi.org/10.1137/19M1243440.
ieee: P. Gladbach, E. Kopfer, and J. Maas, “Scaling limits of discrete optimal transport,”
SIAM Journal on Mathematical Analysis, vol. 52, no. 3. Society for Industrial
and Applied Mathematics, pp. 2759–2802, 2020.
ista: Gladbach P, Kopfer E, Maas J. 2020. Scaling limits of discrete optimal transport.
SIAM Journal on Mathematical Analysis. 52(3), 2759–2802.
mla: Gladbach, Peter, et al. “Scaling Limits of Discrete Optimal Transport.” SIAM
Journal on Mathematical Analysis, vol. 52, no. 3, Society for Industrial and
Applied Mathematics, 2020, pp. 2759–802, doi:10.1137/19M1243440.
short: P. Gladbach, E. Kopfer, J. Maas, SIAM Journal on Mathematical Analysis 52
(2020) 2759–2802.
date_created: 2018-12-11T11:44:28Z
date_published: 2020-10-01T00:00:00Z
date_updated: 2025-07-10T11:54:14Z
day: '01'
department:
- _id: JaMa
doi: 10.1137/19M1243440
external_id:
arxiv:
- '1809.01092'
isi:
- '000546975100017'
intvolume: ' 52'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1809.01092
month: '10'
oa: 1
oa_version: Preprint
page: 2759-2802
publication: SIAM Journal on Mathematical Analysis
publication_identifier:
eissn:
- 1095-7154
issn:
- 0036-1410
publication_status: published
publisher: Society for Industrial and Applied Mathematics
publist_id: '7983'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Scaling limits of discrete optimal transport
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 52
year: '2020'
...
---
_id: '7142'
abstract:
- lang: eng
text: The phytohormone auxin acts as an amazingly versatile coordinator of plant
growth and development. With its morphogen-like properties, auxin controls sites
and timing of differentiation and/or growth responses both, in quantitative and
qualitative terms. Specificity in the auxin response depends largely on distinct
modes of signal transmission, by which individual cells perceive and convert auxin
signals into a remarkable diversity of responses. The best understood, or so-called
canonical mechanism of auxin perception ultimately results in variable adjustments
of the cellular transcriptome, via a short, nuclear signal transduction pathway.
Additional findings that accumulated over decades implied that an additional,
presumably, cell surface-based auxin perception mechanism mediates very rapid
cellular responses and decisively contributes to the cell's overall hormonal response.
Recent investigations into both, nuclear and cell surface auxin signalling challenged
this assumed partition of roles for different auxin signalling pathways and revealed
an unexpected complexity in transcriptional and non-transcriptional cellular responses
mediated by auxin.
acknowledgement: Research in J.F. laboratory is funded by the European Union's Horizon
2020 program (ERC grant agreement n° 742985); C.L. is supported by the Austrian
Science Fund (FWF grant P 31493).
article_processing_charge: No
article_type: original
author:
- first_name: Michelle C
full_name: Gallei, Michelle C
id: 35A03822-F248-11E8-B48F-1D18A9856A87
last_name: Gallei
orcid: 0000-0003-1286-7368
- first_name: Christian
full_name: Luschnig, Christian
last_name: Luschnig
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: 'Gallei MC, Luschnig C, Friml J. Auxin signalling in growth: Schrödinger’s
cat out of the bag. Current Opinion in Plant Biology. 2020;53(2):43-49.
doi:10.1016/j.pbi.2019.10.003'
apa: 'Gallei, M. C., Luschnig, C., & Friml, J. (2020). Auxin signalling in growth:
Schrödinger’s cat out of the bag. Current Opinion in Plant Biology. Elsevier.
https://doi.org/10.1016/j.pbi.2019.10.003'
chicago: 'Gallei, Michelle C, Christian Luschnig, and Jiří Friml. “Auxin Signalling
in Growth: Schrödinger’s Cat out of the Bag.” Current Opinion in Plant Biology.
Elsevier, 2020. https://doi.org/10.1016/j.pbi.2019.10.003.'
ieee: 'M. C. Gallei, C. Luschnig, and J. Friml, “Auxin signalling in growth: Schrödinger’s
cat out of the bag,” Current Opinion in Plant Biology, vol. 53, no. 2.
Elsevier, pp. 43–49, 2020.'
ista: 'Gallei MC, Luschnig C, Friml J. 2020. Auxin signalling in growth: Schrödinger’s
cat out of the bag. Current Opinion in Plant Biology. 53(2), 43–49.'
mla: 'Gallei, Michelle C., et al. “Auxin Signalling in Growth: Schrödinger’s Cat
out of the Bag.” Current Opinion in Plant Biology, vol. 53, no. 2, Elsevier,
2020, pp. 43–49, doi:10.1016/j.pbi.2019.10.003.'
short: M.C. Gallei, C. Luschnig, J. Friml, Current Opinion in Plant Biology 53 (2020)
43–49.
corr_author: '1'
date_created: 2019-12-02T12:05:26Z
date_published: 2020-02-01T00:00:00Z
date_updated: 2026-04-07T14:18:57Z
day: '01'
department:
- _id: JiFr
doi: 10.1016/j.pbi.2019.10.003
ec_funded: 1
external_id:
isi:
- '000521120600007'
pmid:
- '31760231'
intvolume: ' 53'
isi: 1
issue: '2'
language:
- iso: eng
month: '02'
oa_version: None
page: 43-49
pmid: 1
project:
- _id: 261099A6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '742985'
name: Tracing Evolution of Auxin Transport and Polarity in Plants
publication: Current Opinion in Plant Biology
publication_identifier:
eissn:
- 1879-0356
issn:
- 1369-5266
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
record:
- id: '11626'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'Auxin signalling in growth: Schrödinger''s cat out of the bag'
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 53
year: '2020'
...
---
_id: '7148'
abstract:
- lang: eng
text: In the cerebellum, GluD2 is exclusively expressed in Purkinje cells, where
it regulates synapse formation and regeneration, synaptic plasticity, and motor
learning. Delayed cognitive development in humans with GluD2 gene mutations suggests
extracerebellar functions of GluD2. However, extracerebellar expression of GluD2
and its relationship with that of GluD1 are poorly understood. GluD2 mRNA and
protein were widely detected, with relatively high levels observed in the olfactory
glomerular layer, medial prefrontal cortex, cingulate cortex, retrosplenial granular
cortex, olfactory tubercle, subiculum, striatum, lateral septum, anterodorsal
thalamic nucleus, and arcuate hypothalamic nucleus. These regions were also enriched
for GluD1, and many individual neurons coexpressed the two GluDs. In the retrosplenial
granular cortex, GluD1 and GluD2 were selectively expressed at PSD‐95‐expressing
glutamatergic synapses, and their coexpression on the same synapses was shown
by SDS‐digested freeze‐fracture replica labeling. Biochemically, GluD1 and GluD2
formed coimmunoprecipitable complex formation in HEK293T cells and in the cerebral
cortex and hippocampus. We further estimated the relative protein amount by quantitative
immunoblotting using GluA2/GluD2 and GluA2/GluD1 chimeric proteins as standards
for titration of GluD1 and GluD2 antibodies. Intriguingly, the relative amount
of GluD2 was almost comparable to that of GluD1 in the postsynaptic density fraction
prepared from the cerebral cortex and hippocampus. In contrast, GluD2 was overwhelmingly
predominant in the cerebellum. Thus, we have determined the relative extracerebellar
expression of GluD1 and GluD2 at regional, neuronal, and synaptic levels. These
data provide a molecular–anatomical basis for possible competitive and cooperative
interactions of GluD family members at synapses in various brain regions.
acknowledgement: This study was supported by Grants-in-Aid for Scientific Research
to K.K. (18K06813), Y.M. (17K08503, 17H0631319), and K.S. (16H04650) and a grant
for Scientific Research on Innovative Areas to K.S (16H06276) from the Ministry
of Education, Culture, Sports, Science and Technology of Japan (MEXT). We thank
K. Akashi, I. Watanabe-Iida, Y. Suzuki, and H. Azechi for technical assistance and
advice, and H. Uchida for valuable discussions. We thank E. Kushiya,I. Yabe, C.
Ohori, Y. Mochizuki, Y. Ishikawa, and N. Ishimoto for technical assistance in generating
GluD1-KO mice.
article_processing_charge: No
article_type: original
author:
- first_name: Chihiro
full_name: Nakamoto, Chihiro
last_name: Nakamoto
- first_name: Kohtarou
full_name: Konno, Kohtarou
last_name: Konno
- first_name: Taisuke
full_name: Miyazaki, Taisuke
last_name: Miyazaki
- first_name: Ena
full_name: Nakatsukasa, Ena
last_name: Nakatsukasa
- first_name: Rie
full_name: Natsume, Rie
last_name: Natsume
- first_name: Manabu
full_name: Abe, Manabu
last_name: Abe
- first_name: Meiko
full_name: Kawamura, Meiko
last_name: Kawamura
- first_name: Yugo
full_name: Fukazawa, Yugo
last_name: Fukazawa
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Miwako
full_name: Yamasaki, Miwako
last_name: Yamasaki
- first_name: Kenji
full_name: Sakimura, Kenji
last_name: Sakimura
- first_name: Masahiko
full_name: Watanabe, Masahiko
last_name: Watanabe
citation:
ama: Nakamoto C, Konno K, Miyazaki T, et al. Expression mapping, quantification,
and complex formation of GluD1 and GluD2 glutamate receptors in adult mouse brain.
Journal of Comparative Neurology. 2020;528(6):1003-1027. doi:10.1002/cne.24792
apa: Nakamoto, C., Konno, K., Miyazaki, T., Nakatsukasa, E., Natsume, R., Abe, M.,
… Watanabe, M. (2020). Expression mapping, quantification, and complex formation
of GluD1 and GluD2 glutamate receptors in adult mouse brain. Journal of Comparative
Neurology. Wiley. https://doi.org/10.1002/cne.24792
chicago: Nakamoto, Chihiro, Kohtarou Konno, Taisuke Miyazaki, Ena Nakatsukasa, Rie
Natsume, Manabu Abe, Meiko Kawamura, et al. “Expression Mapping, Quantification,
and Complex Formation of GluD1 and GluD2 Glutamate Receptors in Adult Mouse Brain.”
Journal of Comparative Neurology. Wiley, 2020. https://doi.org/10.1002/cne.24792.
ieee: C. Nakamoto et al., “Expression mapping, quantification, and complex
formation of GluD1 and GluD2 glutamate receptors in adult mouse brain,” Journal
of Comparative Neurology, vol. 528, no. 6. Wiley, pp. 1003–1027, 2020.
ista: Nakamoto C, Konno K, Miyazaki T, Nakatsukasa E, Natsume R, Abe M, Kawamura
M, Fukazawa Y, Shigemoto R, Yamasaki M, Sakimura K, Watanabe M. 2020. Expression
mapping, quantification, and complex formation of GluD1 and GluD2 glutamate receptors
in adult mouse brain. Journal of Comparative Neurology. 528(6), 1003–1027.
mla: Nakamoto, Chihiro, et al. “Expression Mapping, Quantification, and Complex
Formation of GluD1 and GluD2 Glutamate Receptors in Adult Mouse Brain.” Journal
of Comparative Neurology, vol. 528, no. 6, Wiley, 2020, pp. 1003–27, doi:10.1002/cne.24792.
short: C. Nakamoto, K. Konno, T. Miyazaki, E. Nakatsukasa, R. Natsume, M. Abe, M.
Kawamura, Y. Fukazawa, R. Shigemoto, M. Yamasaki, K. Sakimura, M. Watanabe, Journal
of Comparative Neurology 528 (2020) 1003–1027.
date_created: 2019-12-04T16:09:29Z
date_published: 2020-04-01T00:00:00Z
date_updated: 2023-08-17T14:06:50Z
day: '01'
ddc:
- '571'
- '599'
department:
- _id: RySh
doi: 10.1002/cne.24792
external_id:
isi:
- '000496410200001'
pmid:
- '31625608'
has_accepted_license: '1'
intvolume: ' 528'
isi: 1
issue: '6'
language:
- iso: eng
month: '04'
oa_version: None
page: 1003-1027
pmid: 1
publication: Journal of Comparative Neurology
publication_identifier:
eissn:
- 1096-9861
issn:
- 0021-9967
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Expression mapping, quantification, and complex formation of GluD1 and GluD2
glutamate receptors in adult mouse brain
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 528
year: '2020'
...
---
_id: '7149'
abstract:
- lang: eng
text: In recent years, many genes have been associated with chromatinopathies classified
as “Cornelia de Lange Syndrome‐like.” It is known that the phenotype of these
patients becomes less recognizable, overlapping to features characteristic of
other syndromes caused by genetic variants affecting different regulators of chromatin
structure and function. Therefore, Cornelia de Lange syndrome diagnosis might
be arduous due to the seldom discordance between unexpected molecular diagnosis
and clinical evaluation. Here, we review the molecular features of Cornelia de
Lange syndrome, supporting the hypothesis that “CdLS‐like syndromes” are part
of a larger “rare disease family” sharing multiple clinical features and common
disrupted molecular pathways.
acknowledgement: ' Dipartimento DiSS, Università degli Studi di Milano, Grant/Award
Number: Linea 2; Fondazione Cariplo, Grant/Award Number: 2015-0783; German Federal
Ministry of Education and Research (BMBF), Grant/Award Number: CHROMATIN-Net; Medical
Faculty of the University of Lübeck, Grant/Award Number: J09-2017; Nickel & Co S.p.A.;
Università degli Studi di Milano, Grant/Award Numbers: Molecular & Translational
Medicine PhD Scholarship, Translational Medicine PhD Scholarship'
article_processing_charge: No
article_type: review
author:
- first_name: Laura
full_name: Avagliano, Laura
last_name: Avagliano
- first_name: Ilaria
full_name: Parenti, Ilaria
id: D93538B0-5B71-11E9-AC62-02EBE5697425
last_name: Parenti
- first_name: Paolo
full_name: Grazioli, Paolo
last_name: Grazioli
- first_name: Elisabetta
full_name: Di Fede, Elisabetta
last_name: Di Fede
- first_name: Chiara
full_name: Parodi, Chiara
last_name: Parodi
- first_name: Milena
full_name: Mariani, Milena
last_name: Mariani
- first_name: Frank J.
full_name: Kaiser, Frank J.
last_name: Kaiser
- first_name: Angelo
full_name: Selicorni, Angelo
last_name: Selicorni
- first_name: Cristina
full_name: Gervasini, Cristina
last_name: Gervasini
- first_name: Valentina
full_name: Massa, Valentina
last_name: Massa
citation:
ama: 'Avagliano L, Parenti I, Grazioli P, et al. Chromatinopathies: A focus on Cornelia
de Lange syndrome. Clinical Genetics. 2020;97(1):3-11. doi:10.1111/cge.13674'
apa: 'Avagliano, L., Parenti, I., Grazioli, P., Di Fede, E., Parodi, C., Mariani,
M., … Massa, V. (2020). Chromatinopathies: A focus on Cornelia de Lange syndrome.
Clinical Genetics. Wiley. https://doi.org/10.1111/cge.13674'
chicago: 'Avagliano, Laura, Ilaria Parenti, Paolo Grazioli, Elisabetta Di Fede,
Chiara Parodi, Milena Mariani, Frank J. Kaiser, Angelo Selicorni, Cristina Gervasini,
and Valentina Massa. “Chromatinopathies: A Focus on Cornelia de Lange Syndrome.”
Clinical Genetics. Wiley, 2020. https://doi.org/10.1111/cge.13674.'
ieee: 'L. Avagliano et al., “Chromatinopathies: A focus on Cornelia de Lange
syndrome,” Clinical Genetics, vol. 97, no. 1. Wiley, pp. 3–11, 2020.'
ista: 'Avagliano L, Parenti I, Grazioli P, Di Fede E, Parodi C, Mariani M, Kaiser
FJ, Selicorni A, Gervasini C, Massa V. 2020. Chromatinopathies: A focus on Cornelia
de Lange syndrome. Clinical Genetics. 97(1), 3–11.'
mla: 'Avagliano, Laura, et al. “Chromatinopathies: A Focus on Cornelia de Lange
Syndrome.” Clinical Genetics, vol. 97, no. 1, Wiley, 2020, pp. 3–11, doi:10.1111/cge.13674.'
short: L. Avagliano, I. Parenti, P. Grazioli, E. Di Fede, C. Parodi, M. Mariani,
F.J. Kaiser, A. Selicorni, C. Gervasini, V. Massa, Clinical Genetics 97 (2020)
3–11.
date_created: 2019-12-04T16:10:59Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2023-08-17T14:06:20Z
day: '01'
department:
- _id: GaNo
doi: 10.1111/cge.13674
external_id:
isi:
- '000562561800001'
pmid:
- '31721174'
intvolume: ' 97'
isi: 1
issue: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 3-11
pmid: 1
publication: Clinical Genetics
publication_identifier:
eissn:
- 1399-0004
issn:
- 0009-9163
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Chromatinopathies: A focus on Cornelia de Lange syndrome'
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 97
year: '2020'
...
---
_id: '7160'
abstract:
- lang: eng
text: 'Nocturnal animals that rely on their visual system for foraging, mating,
and navigation usually exhibit specific traits associated with living in scotopic
conditions. Most nocturnal birds have several visual specializations, such as
enlarged eyes and an increased orbital convergence. However, the actual role of
binocular vision in nocturnal foraging is still debated. Nightjars (Aves: Caprimulgidae)
are predators that actively pursue and capture flying insects in crepuscular and
nocturnal environments, mainly using a conspicuous “sit-and-wait” tactic on which
pursuit begins with an insect flying over the bird that sits on the ground. In
this study, we describe the visual system of the band-winged nightjar (Systellura
longirostris), with emphasis on anatomical features previously described as relevant
for nocturnal birds. Orbit convergence, determined by 3D scanning of the skull,
was 73.28°. The visual field, determined by ophthalmoscopic reflex, exhibits an
area of maximum binocular overlap of 42°, and it is dorsally oriented. The eyes
showed a nocturnal-like normalized corneal aperture/axial length index. Retinal
ganglion cells (RGCs) were relatively scant, and distributed in an unusual oblique-band
pattern, with higher concentrations in the ventrotemporal quadrant. Together,
these results indicate that the band-winged nightjar exhibits a retinal specialization
associated with the binocular area of their dorsal visual field, a relevant area
for pursuit triggering and prey attacks. The RGC distribution observed is unusual
among birds, but similar to that of some visually dependent insectivorous bats,
suggesting that those features might be convergent in relation to feeding strategies.'
article_processing_charge: No
article_type: original
author:
- first_name: Juan Esteban
full_name: Salazar, Juan Esteban
last_name: Salazar
- first_name: Daniel
full_name: Severin, Daniel
last_name: Severin
- first_name: Tomas A
full_name: Vega Zuniga, Tomas A
id: 2E7C4E78-F248-11E8-B48F-1D18A9856A87
last_name: Vega Zuniga
- first_name: Pedro
full_name: Fernández-Aburto, Pedro
last_name: Fernández-Aburto
- first_name: Alfonso
full_name: Deichler, Alfonso
last_name: Deichler
- first_name: Michel
full_name: Sallaberry A., Michel
last_name: Sallaberry A.
- first_name: Jorge
full_name: Mpodozis, Jorge
last_name: Mpodozis
citation:
ama: 'Salazar JE, Severin D, Vega Zuniga TA, et al. Anatomical specializations related
to foraging in the visual system of a nocturnal insectivorous bird, the band-winged
nightjar (Aves: Caprimulgiformes). Brain, Behavior and Evolution. 2020;94(1-4):27-36.
doi:10.1159/000504162'
apa: 'Salazar, J. E., Severin, D., Vega Zuniga, T. A., Fernández-Aburto, P., Deichler,
A., Sallaberry A., M., & Mpodozis, J. (2020). Anatomical specializations related
to foraging in the visual system of a nocturnal insectivorous bird, the band-winged
nightjar (Aves: Caprimulgiformes). Brain, Behavior and Evolution. Karger
Publishers. https://doi.org/10.1159/000504162'
chicago: 'Salazar, Juan Esteban, Daniel Severin, Tomas A Vega Zuniga, Pedro Fernández-Aburto,
Alfonso Deichler, Michel Sallaberry A., and Jorge Mpodozis. “Anatomical Specializations
Related to Foraging in the Visual System of a Nocturnal Insectivorous Bird, the
Band-Winged Nightjar (Aves: Caprimulgiformes).” Brain, Behavior and Evolution.
Karger Publishers, 2020. https://doi.org/10.1159/000504162.'
ieee: 'J. E. Salazar et al., “Anatomical specializations related to foraging
in the visual system of a nocturnal insectivorous bird, the band-winged nightjar
(Aves: Caprimulgiformes),” Brain, Behavior and Evolution, vol. 94, no.
1–4. Karger Publishers, pp. 27–36, 2020.'
ista: 'Salazar JE, Severin D, Vega Zuniga TA, Fernández-Aburto P, Deichler A, Sallaberry A.
M, Mpodozis J. 2020. Anatomical specializations related to foraging in the visual
system of a nocturnal insectivorous bird, the band-winged nightjar (Aves: Caprimulgiformes).
Brain, Behavior and Evolution. 94(1–4), 27–36.'
mla: 'Salazar, Juan Esteban, et al. “Anatomical Specializations Related to Foraging
in the Visual System of a Nocturnal Insectivorous Bird, the Band-Winged Nightjar
(Aves: Caprimulgiformes).” Brain, Behavior and Evolution, vol. 94, no.
1–4, Karger Publishers, 2020, pp. 27–36, doi:10.1159/000504162.'
short: J.E. Salazar, D. Severin, T.A. Vega Zuniga, P. Fernández-Aburto, A. Deichler,
M. Sallaberry A., J. Mpodozis, Brain, Behavior and Evolution 94 (2020) 27–36.
date_created: 2019-12-09T09:04:13Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2024-02-22T15:18:34Z
day: '01'
department:
- _id: MaJö
doi: 10.1159/000504162
external_id:
isi:
- '000522856600004'
pmid:
- '31751995'
intvolume: ' 94'
isi: 1
issue: 1-4
language:
- iso: eng
month: '01'
oa_version: None
page: 27-36
pmid: 1
publication: Brain, Behavior and Evolution
publication_identifier:
eissn:
- 1421-9743
issn:
- 0006-8977
publication_status: published
publisher: Karger Publishers
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Anatomical specializations related to foraging in the visual system of a nocturnal
insectivorous bird, the band-winged nightjar (Aves: Caprimulgiformes)'
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 94
year: '2020'
...
---
OA_place: publisher
_id: '7196'
abstract:
- lang: eng
text: 'In this thesis we study certain mathematical aspects of evolution. The two
primary forces that drive an evolutionary process are mutation and selection.
Mutation generates new variants in a population. Selection chooses among the variants
depending on the reproductive rates of individuals. Evolutionary processes are
intrinsically random – a new mutation that is initially present in the population
at low frequency can go extinct, even if it confers a reproductive advantage.
The overall rate of evolution is largely determined by two quantities: the probability
that an invading advantageous mutation spreads through the population (called
fixation probability) and the time until it does so (called fixation time). Both
those quantities crucially depend not only on the strength of the invading mutation
but also on the population structure. In this thesis, we aim to understand how
the underlying population structure affects the overall rate of evolution. Specifically,
we study population structures that increase the fixation probability of advantageous
mutants (called amplifiers of selection). Broadly speaking, our results are of
three different types: We present various strong amplifiers, we identify regimes
under which only limited amplification is feasible, and we propose population
structures that provide different tradeoffs between high fixation probability
and short fixation time.'
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
citation:
ama: Tkadlec J. A role of graphs in evolutionary processes. 2020. doi:10.15479/AT:ISTA:7196
apa: Tkadlec, J. (2020). A role of graphs in evolutionary processes. Institute
of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:7196
chicago: Tkadlec, Josef. “A Role of Graphs in Evolutionary Processes.” Institute
of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:7196.
ieee: J. Tkadlec, “A role of graphs in evolutionary processes,” Institute of Science
and Technology Austria, 2020.
ista: Tkadlec J. 2020. A role of graphs in evolutionary processes. Institute of
Science and Technology Austria.
mla: Tkadlec, Josef. A Role of Graphs in Evolutionary Processes. Institute
of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:7196.
short: J. Tkadlec, A Role of Graphs in Evolutionary Processes, Institute of Science
and Technology Austria, 2020.
corr_author: '1'
date_created: 2019-12-20T12:26:36Z
date_published: 2020-01-12T00:00:00Z
date_updated: 2026-04-16T08:32:37Z
day: '12'
ddc:
- '519'
degree_awarded: PhD
department:
- _id: KrCh
- _id: GradSch
doi: 10.15479/AT:ISTA:7196
file:
- access_level: closed
checksum: 451f8e64b0eb26bf297644ac72bfcbe9
content_type: application/zip
creator: jtkadlec
date_created: 2020-01-12T11:49:49Z
date_updated: 2020-07-14T12:47:52Z
file_id: '7255'
file_name: thesis.zip
file_size: 21100497
relation: source_file
- access_level: open_access
checksum: d8c44cbc4f939c49a8efc9d4b8bb3985
content_type: application/pdf
creator: dernst
date_created: 2020-01-28T07:32:42Z
date_updated: 2020-07-14T12:47:52Z
file_id: '7367'
file_name: 2020_Tkadlec_Thesis.pdf
file_size: 11670983
relation: main_file
file_date_updated: 2020-07-14T12:47:52Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: '144'
publication_identifier:
eissn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '5751'
relation: dissertation_contains
status: public
- id: '7210'
relation: dissertation_contains
status: public
- id: '7212'
relation: dissertation_contains
status: public
status: public
supervisor:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
title: A role of graphs in evolutionary processes
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2020'
...