---
_id: '9022'
abstract:
- lang: eng
text: "In the first part of the thesis we consider Hermitian random matrices. Firstly,
we consider sample covariance matrices XX∗ with X having independent identically
distributed (i.i.d.) centred entries. We prove a Central Limit Theorem for differences
of linear statistics of XX∗ and its minor after removing the first column of X.
Secondly, we consider Wigner-type matrices and prove that the eigenvalue statistics
near cusp singularities of the limiting density of states are universal and that
they form a Pearcey process. Since the limiting eigenvalue distribution admits
only square root (edge) and cubic root (cusp) singularities, this concludes the
third and last remaining case of the Wigner-Dyson-Mehta universality conjecture.
The main technical ingredients are an optimal local law at the cusp, and the proof
of the fast relaxation to equilibrium of the Dyson Brownian motion in the cusp
regime.\r\nIn the second part we consider non-Hermitian matrices X with centred
i.i.d. entries. We normalise the entries of X to have variance N −1. It is well
known that the empirical eigenvalue density converges to the uniform distribution
on the unit disk (circular law). In the first project, we prove universality of
the local eigenvalue statistics close to the edge of the spectrum. This is the
non-Hermitian analogue of the TracyWidom universality at the Hermitian edge. Technically
we analyse the evolution of the spectral distribution of X along the Ornstein-Uhlenbeck
flow for very long time\r\n(up to t = +∞). In the second project, we consider
linear statistics of eigenvalues for macroscopic test functions f in the Sobolev
space H2+ϵ and prove their convergence to the projection of the Gaussian Free
Field on the unit disk. We prove this result for non-Hermitian matrices with real
or complex entries. The main technical ingredients are: (i) local law for products
of two resolvents at different spectral parameters, (ii) analysis of correlated
Dyson Brownian motions.\r\nIn the third and final part we discuss the mathematically
rigorous application of supersymmetric techniques (SUSY ) to give a lower tail
estimate of the lowest singular value of X − z, with z ∈ C. More precisely, we
use superbosonisation formula to give an integral representation of the resolvent
of (X − z)(X − z)∗ which reduces to two and three contour integrals in the complex
and real case, respectively. The rigorous analysis of these integrals is quite
challenging since simple saddle point analysis cannot be applied (the main contribution
comes from a non-trivial manifold). Our result\r\nimproves classical smoothing
inequalities in the regime |z| ≈ 1; this result is essential to prove edge universality
for i.i.d. non-Hermitian matrices."
acknowledgement: I gratefully acknowledge the financial support from the European
Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie
Grant Agreement No. 665385 and my advisor’s ERC Advanced Grant No. 338804.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Giorgio
full_name: Cipolloni, Giorgio
id: 42198EFA-F248-11E8-B48F-1D18A9856A87
last_name: Cipolloni
orcid: 0000-0002-4901-7992
citation:
ama: Cipolloni G. Fluctuations in the spectrum of random matrices. 2021. doi:10.15479/AT:ISTA:9022
apa: Cipolloni, G. (2021). Fluctuations in the spectrum of random matrices.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:9022
chicago: Cipolloni, Giorgio. “Fluctuations in the Spectrum of Random Matrices.”
Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/AT:ISTA:9022.
ieee: G. Cipolloni, “Fluctuations in the spectrum of random matrices,” Institute
of Science and Technology Austria, 2021.
ista: Cipolloni G. 2021. Fluctuations in the spectrum of random matrices. Institute
of Science and Technology Austria.
mla: Cipolloni, Giorgio. Fluctuations in the Spectrum of Random Matrices.
Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:9022.
short: G. Cipolloni, Fluctuations in the Spectrum of Random Matrices, Institute
of Science and Technology Austria, 2021.
date_created: 2021-01-21T18:16:54Z
date_published: 2021-01-25T00:00:00Z
date_updated: 2023-09-07T13:29:32Z
day: '25'
ddc:
- '510'
degree_awarded: PhD
department:
- _id: GradSch
- _id: LaEr
doi: 10.15479/AT:ISTA:9022
ec_funded: 1
file:
- access_level: open_access
checksum: 5a93658a5f19478372523ee232887e2b
content_type: application/pdf
creator: gcipollo
date_created: 2021-01-25T14:19:03Z
date_updated: 2021-01-25T14:19:03Z
file_id: '9043'
file_name: thesis.pdf
file_size: 4127796
relation: main_file
success: 1
- access_level: closed
checksum: e8270eddfe6a988e92a53c88d1d19b8c
content_type: application/zip
creator: gcipollo
date_created: 2021-01-25T14:19:10Z
date_updated: 2021-01-25T14:19:10Z
file_id: '9044'
file_name: Thesis_files.zip
file_size: 12775206
relation: source_file
file_date_updated: 2021-01-25T14:19:10Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: '380'
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
status: public
supervisor:
- 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
title: Fluctuations in the spectrum of random matrices
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2021'
...
---
_id: '9416'
abstract:
- lang: eng
text: 'We study the inductive bias of two-layer ReLU networks trained by gradient
flow. We identify a class of easy-to-learn (`orthogonally separable'') datasets,
and characterise the solution that ReLU networks trained on such datasets converge
to. Irrespective of network width, the solution turns out to be a combination
of two max-margin classifiers: one corresponding to the positive data subset and
one corresponding to the negative data subset. The proof is based on the recently
introduced concept of extremal sectors, for which we prove a number of properties
in the context of orthogonal separability. In particular, we prove stationarity
of activation patterns from some time onwards, which enables a reduction of the
ReLU network to an ensemble of linear subnetworks.'
article_processing_charge: No
author:
- first_name: Phuong
full_name: Bui Thi Mai, Phuong
id: 3EC6EE64-F248-11E8-B48F-1D18A9856A87
last_name: Bui Thi Mai
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Phuong M, Lampert C. The inductive bias of ReLU networks on orthogonally separable
data. In: 9th International Conference on Learning Representations. ; 2021.'
apa: Phuong, M., & Lampert, C. (2021). The inductive bias of ReLU networks on
orthogonally separable data. In 9th International Conference on Learning Representations.
Virtual.
chicago: Phuong, Mary, and Christoph Lampert. “The Inductive Bias of ReLU Networks
on Orthogonally Separable Data.” In 9th International Conference on Learning
Representations, 2021.
ieee: M. Phuong and C. Lampert, “The inductive bias of ReLU networks on orthogonally
separable data,” in 9th International Conference on Learning Representations,
Virtual, 2021.
ista: 'Phuong M, Lampert C. 2021. The inductive bias of ReLU networks on orthogonally
separable data. 9th International Conference on Learning Representations. ICLR:
International Conference on Learning Representations.'
mla: Phuong, Mary, and Christoph Lampert. “The Inductive Bias of ReLU Networks on
Orthogonally Separable Data.” 9th International Conference on Learning Representations,
2021.
short: M. Phuong, C. Lampert, in:, 9th International Conference on Learning Representations,
2021.
conference:
end_date: 2021-05-07
location: Virtual
name: ' ICLR: International Conference on Learning Representations'
start_date: 2021-05-03
date_created: 2021-05-24T11:16:46Z
date_published: 2021-05-01T00:00:00Z
date_updated: 2023-09-07T13:29:50Z
day: '01'
ddc:
- '000'
department:
- _id: GradSch
- _id: ChLa
file:
- access_level: open_access
checksum: f34ff17017527db5ba6927f817bdd125
content_type: application/pdf
creator: bphuong
date_created: 2021-05-24T11:15:57Z
date_updated: 2021-05-24T11:15:57Z
file_id: '9417'
file_name: iclr2021_conference.pdf
file_size: 502356
relation: main_file
file_date_updated: 2021-05-24T11:15:57Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://openreview.net/pdf?id=krz7T0xU9Z_
month: '05'
oa: 1
oa_version: Published Version
publication: 9th International Conference on Learning Representations
publication_status: published
quality_controlled: '1'
related_material:
record:
- id: '9418'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: The inductive bias of ReLU networks on orthogonally separable data
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '9225'
abstract:
- lang: eng
text: "The Landau–Pekar equations describe the dynamics of a strongly coupled polaron.\r\nHere,
we provide a class of initial data for which the associated effective Hamiltonian\r\nhas
a uniform spectral gap for all times. For such initial data, this allows us to
extend the\r\nresults on the adiabatic theorem for the Landau–Pekar equations
and their derivation\r\nfrom the Fröhlich model obtained in previous works to
larger times."
acknowledgement: Funding from the European Union’s Horizon 2020 research and innovation
programme under the ERC Grant Agreement No 694227 (D.F. and R.S.) and under the
Marie Skłodowska-Curie Grant Agreement No. 754411 (S.R.) is gratefully acknowledged.
Open Access funding provided by Institute of Science and Technology (IST Austria)
article_number: '19'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Dario
full_name: Feliciangeli, Dario
id: 41A639AA-F248-11E8-B48F-1D18A9856A87
last_name: Feliciangeli
orcid: 0000-0003-0754-8530
- first_name: Simone Anna Elvira
full_name: Rademacher, Simone Anna Elvira
id: 856966FE-A408-11E9-977E-802DE6697425
last_name: Rademacher
orcid: 0000-0001-5059-4466
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Feliciangeli D, Rademacher SAE, Seiringer R. Persistence of the spectral gap
for the Landau–Pekar equations. Letters in Mathematical Physics. 2021;111.
doi:10.1007/s11005-020-01350-5
apa: Feliciangeli, D., Rademacher, S. A. E., & Seiringer, R. (2021). Persistence
of the spectral gap for the Landau–Pekar equations. Letters in Mathematical
Physics. Springer Nature. https://doi.org/10.1007/s11005-020-01350-5
chicago: Feliciangeli, Dario, Simone Anna Elvira Rademacher, and Robert Seiringer.
“Persistence of the Spectral Gap for the Landau–Pekar Equations.” Letters in
Mathematical Physics. Springer Nature, 2021. https://doi.org/10.1007/s11005-020-01350-5.
ieee: D. Feliciangeli, S. A. E. Rademacher, and R. Seiringer, “Persistence of the
spectral gap for the Landau–Pekar equations,” Letters in Mathematical Physics,
vol. 111. Springer Nature, 2021.
ista: Feliciangeli D, Rademacher SAE, Seiringer R. 2021. Persistence of the spectral
gap for the Landau–Pekar equations. Letters in Mathematical Physics. 111, 19.
mla: Feliciangeli, Dario, et al. “Persistence of the Spectral Gap for the Landau–Pekar
Equations.” Letters in Mathematical Physics, vol. 111, 19, Springer Nature,
2021, doi:10.1007/s11005-020-01350-5.
short: D. Feliciangeli, S.A.E. Rademacher, R. Seiringer, Letters in Mathematical
Physics 111 (2021).
date_created: 2021-03-07T23:01:25Z
date_published: 2021-02-11T00:00:00Z
date_updated: 2023-09-07T13:30:11Z
day: '11'
ddc:
- '510'
department:
- _id: RoSe
doi: 10.1007/s11005-020-01350-5
ec_funded: 1
external_id:
isi:
- '000617195700001'
file:
- access_level: open_access
checksum: ffbfe1aad623bce7ff529c207e343b53
content_type: application/pdf
creator: dernst
date_created: 2021-03-09T11:44:34Z
date_updated: 2021-03-09T11:44:34Z
file_id: '9232'
file_name: 2021_LettersMathPhysics_Feliciangeli.pdf
file_size: 391205
relation: main_file
success: 1
file_date_updated: 2021-03-09T11:44:34Z
has_accepted_license: '1'
intvolume: ' 111'
isi: 1
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '02'
oa: 1
oa_version: Published Version
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Letters in Mathematical Physics
publication_identifier:
eissn:
- '15730530'
issn:
- '03779017'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '9733'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Persistence of the spectral gap for the Landau–Pekar equations
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: 111
year: '2021'
...
---
_id: '9787'
abstract:
- lang: eng
text: We investigate the Fröhlich polaron model on a three-dimensional torus, and
give a proof of the second-order quantum corrections to its ground-state energy
in the strong-coupling limit. Compared to previous work in the confined case,
the translational symmetry (and its breaking in the Pekar approximation) makes
the analysis substantially more challenging.
acknowledgement: "Funding from the European Union’s Horizon 2020 research and innovation
programme under the ERC grant agreement No 694227 is gratefully acknowledged. We
would also like to thank Rupert Frank for many helpful discussions, especially related
to the Gross coordinate transformation defined in Def. 4.1.\r\n"
article_number: '2101.12566'
article_processing_charge: No
author:
- first_name: Dario
full_name: Feliciangeli, Dario
id: 41A639AA-F248-11E8-B48F-1D18A9856A87
last_name: Feliciangeli
orcid: 0000-0003-0754-8530
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: 'Feliciangeli D, Seiringer R. The strongly coupled polaron on the torus: Quantum
corrections to the Pekar asymptotics. arXiv.'
apa: 'Feliciangeli, D., & Seiringer, R. (n.d.). The strongly coupled polaron
on the torus: Quantum corrections to the Pekar asymptotics. arXiv.'
chicago: 'Feliciangeli, Dario, and Robert Seiringer. “The Strongly Coupled Polaron
on the Torus: Quantum Corrections to the Pekar Asymptotics.” ArXiv, n.d.'
ieee: 'D. Feliciangeli and R. Seiringer, “The strongly coupled polaron on the torus:
Quantum corrections to the Pekar asymptotics,” arXiv. .'
ista: 'Feliciangeli D, Seiringer R. The strongly coupled polaron on the torus: Quantum
corrections to the Pekar asymptotics. arXiv, 2101.12566.'
mla: 'Feliciangeli, Dario, and Robert Seiringer. “The Strongly Coupled Polaron on
the Torus: Quantum Corrections to the Pekar Asymptotics.” ArXiv, 2101.12566.'
short: D. Feliciangeli, R. Seiringer, ArXiv (n.d.).
date_created: 2021-08-06T08:25:57Z
date_published: 2021-02-01T00:00:00Z
date_updated: 2023-09-07T13:30:10Z
day: '01'
ddc:
- '510'
department:
- _id: RoSe
ec_funded: 1
external_id:
arxiv:
- '2101.12566'
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2101.12566
month: '02'
oa: 1
oa_version: Preprint
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: arXiv
publication_status: submitted
related_material:
record:
- id: '10224'
relation: later_version
status: public
- id: '9733'
relation: dissertation_contains
status: public
status: public
title: 'The strongly coupled polaron on the torus: Quantum corrections to the Pekar
asymptotics'
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: preprint
user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425
year: '2021'
...
---
_id: '9987'
abstract:
- lang: eng
text: 'Stateless model checking (SMC) is one of the standard approaches to the verification
of concurrent programs. As scheduling non-determinism creates exponentially large
spaces of thread interleavings, SMC attempts to partition this space into equivalence
classes and explore only a few representatives from each class. The efficiency
of this approach depends on two factors: (a) the coarseness of the partitioning,
and (b) the time to generate representatives in each class. For this reason, the
search for coarse partitionings that are efficiently explorable is an active research
challenge. In this work we present RVF-SMC , a new SMC algorithm that uses a
novel reads-value-from (RVF) partitioning. Intuitively, two interleavings are
deemed equivalent if they agree on the value obtained in each read event, and
read events induce consistent causal orderings between them. The RVF partitioning
is provably coarser than recent approaches based on Mazurkiewicz and “reads-from”
partitionings. Our experimental evaluation reveals that RVF is quite often a very
effective equivalence, as the underlying partitioning is exponentially coarser
than other approaches. Moreover, RVF-SMC generates representatives very efficiently,
as the reduction in the partitioning is often met with significant speed-ups in
the model checking task.'
acknowledgement: The research was partially funded by the ERC CoG 863818 (ForM-SMArt)
and the Vienna Science and Technology Fund (WWTF) through project ICT15-003.
alternative_title:
- LNCS
article_processing_charge: Yes
author:
- first_name: Pratyush
full_name: Agarwal, Pratyush
last_name: Agarwal
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Shreya
full_name: Pathak, Shreya
last_name: Pathak
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Viktor
full_name: Toman, Viktor
id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87
last_name: Toman
orcid: 0000-0001-9036-063X
citation:
ama: 'Agarwal P, Chatterjee K, Pathak S, Pavlogiannis A, Toman V. Stateless model
checking under a reads-value-from equivalence. In: 33rd International Conference
on Computer-Aided Verification . Vol 12759. Springer Nature; 2021:341-366.
doi:10.1007/978-3-030-81685-8_16'
apa: 'Agarwal, P., Chatterjee, K., Pathak, S., Pavlogiannis, A., & Toman, V.
(2021). Stateless model checking under a reads-value-from equivalence. In 33rd
International Conference on Computer-Aided Verification (Vol. 12759, pp.
341–366). Virtual: Springer Nature. https://doi.org/10.1007/978-3-030-81685-8_16'
chicago: Agarwal, Pratyush, Krishnendu Chatterjee, Shreya Pathak, Andreas Pavlogiannis,
and Viktor Toman. “Stateless Model Checking under a Reads-Value-from Equivalence.”
In 33rd International Conference on Computer-Aided Verification , 12759:341–66.
Springer Nature, 2021. https://doi.org/10.1007/978-3-030-81685-8_16.
ieee: P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, and V. Toman, “Stateless
model checking under a reads-value-from equivalence,” in 33rd International
Conference on Computer-Aided Verification , Virtual, 2021, vol. 12759, pp.
341–366.
ista: 'Agarwal P, Chatterjee K, Pathak S, Pavlogiannis A, Toman V. 2021. Stateless
model checking under a reads-value-from equivalence. 33rd International Conference
on Computer-Aided Verification . CAV: Computer Aided Verification , LNCS, vol.
12759, 341–366.'
mla: Agarwal, Pratyush, et al. “Stateless Model Checking under a Reads-Value-from
Equivalence.” 33rd International Conference on Computer-Aided Verification
, vol. 12759, Springer Nature, 2021, pp. 341–66, doi:10.1007/978-3-030-81685-8_16.
short: P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, V. Toman, in:, 33rd
International Conference on Computer-Aided Verification , Springer Nature, 2021,
pp. 341–366.
conference:
end_date: 2021-07-23
location: Virtual
name: 'CAV: Computer Aided Verification '
start_date: 2021-07-20
date_created: 2021-09-05T22:01:24Z
date_published: 2021-07-15T00:00:00Z
date_updated: 2023-09-07T13:30:27Z
day: '15'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-030-81685-8_16
ec_funded: 1
external_id:
arxiv:
- '2105.06424'
isi:
- '000698732400016'
file:
- access_level: open_access
checksum: 4b346e5fbaa8b9bdf107819c7b2aadee
content_type: application/pdf
creator: dernst
date_created: 2022-05-13T07:00:20Z
date_updated: 2022-05-13T07:00:20Z
file_id: '11368'
file_name: 2021_LNCS_Agarwal.pdf
file_size: 1516756
relation: main_file
success: 1
file_date_updated: 2022-05-13T07:00:20Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 341-366
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: '33rd International Conference on Computer-Aided Verification '
publication_identifier:
eisbn:
- 978-3-030-81685-8
eissn:
- 1611-3349
isbn:
- 978-3-030-81684-1
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '10199'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Stateless model checking under a reads-value-from equivalence
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: '12759 '
year: '2021'
...
---
_id: '10007'
abstract:
- lang: eng
text: The present thesis is concerned with the derivation of weak-strong uniqueness
principles for curvature driven interface evolution problems not satisfying a
comparison principle. The specific examples being treated are two-phase Navier-Stokes
flow with surface tension, modeling the evolution of two incompressible, viscous
and immiscible fluids separated by a sharp interface, and multiphase mean curvature
flow, which serves as an idealized model for the motion of grain boundaries in
an annealing polycrystalline material. Our main results - obtained in joint works
with Julian Fischer, Tim Laux and Theresa M. Simon - state that prior to the formation
of geometric singularities due to topology changes, the weak solution concept
of Abels (Interfaces Free Bound. 9, 2007) to two-phase Navier-Stokes flow with
surface tension and the weak solution concept of Laux and Otto (Calc. Var. Partial
Differential Equations 55, 2016) to multiphase mean curvature flow (for networks
in R^2 or double bubbles in R^3) represents the unique solution to these interface
evolution problems within the class of classical solutions, respectively. To the
best of the author's knowledge, for interface evolution problems not admitting
a geometric comparison principle the derivation of a weak-strong uniqueness principle
represented an open problem, so that the works contained in the present thesis
constitute the first positive results in this direction. The key ingredient of
our approach consists of the introduction of a novel concept of relative entropies
for a class of curvature driven interface evolution problems, for which the associated
energy contains an interfacial contribution being proportional to the surface
area of the evolving (network of) interface(s). The interfacial part of the relative
entropy gives sufficient control on the interface error between a weak and a classical
solution, and its time evolution can be computed, at least in principle, for any
energy dissipating weak solution concept. A resulting stability estimate for the
relative entropy essentially entails the above mentioned weak-strong uniqueness
principles. The present thesis contains a detailed introduction to our relative
entropy approach, which in particular highlights potential applications to other
problems in curvature driven interface evolution not treated in this thesis.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Sebastian
full_name: Hensel, Sebastian
id: 4D23B7DA-F248-11E8-B48F-1D18A9856A87
last_name: Hensel
orcid: 0000-0001-7252-8072
citation:
ama: 'Hensel S. Curvature driven interface evolution: Uniqueness properties of weak
solution concepts. 2021. doi:10.15479/at:ista:10007'
apa: 'Hensel, S. (2021). Curvature driven interface evolution: Uniqueness properties
of weak solution concepts. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10007'
chicago: 'Hensel, Sebastian. “Curvature Driven Interface Evolution: Uniqueness Properties
of Weak Solution Concepts.” Institute of Science and Technology Austria, 2021.
https://doi.org/10.15479/at:ista:10007.'
ieee: 'S. Hensel, “Curvature driven interface evolution: Uniqueness properties of
weak solution concepts,” Institute of Science and Technology Austria, 2021.'
ista: 'Hensel S. 2021. Curvature driven interface evolution: Uniqueness properties
of weak solution concepts. Institute of Science and Technology Austria.'
mla: 'Hensel, Sebastian. Curvature Driven Interface Evolution: Uniqueness Properties
of Weak Solution Concepts. Institute of Science and Technology Austria, 2021,
doi:10.15479/at:ista:10007.'
short: 'S. Hensel, Curvature Driven Interface Evolution: Uniqueness Properties of
Weak Solution Concepts, Institute of Science and Technology Austria, 2021.'
date_created: 2021-09-13T11:12:34Z
date_published: 2021-09-14T00:00:00Z
date_updated: 2023-09-07T13:30:45Z
day: '14'
ddc:
- '515'
degree_awarded: PhD
department:
- _id: GradSch
- _id: JuFi
doi: 10.15479/at:ista:10007
ec_funded: 1
file:
- access_level: closed
checksum: c8475faaf0b680b4971f638f1db16347
content_type: application/x-zip-compressed
creator: shensel
date_created: 2021-09-13T11:03:24Z
date_updated: 2021-09-15T14:37:30Z
file_id: '10008'
file_name: thesis_final_Hensel.zip
file_size: 15022154
relation: source_file
- access_level: open_access
checksum: 1a609937aa5275452822f45f2da17f07
content_type: application/pdf
creator: shensel
date_created: 2021-09-13T14:18:56Z
date_updated: 2021-09-14T09:52:47Z
file_id: '10014'
file_name: thesis_final_Hensel.pdf
file_size: 6583638
relation: main_file
file_date_updated: 2021-09-15T14:37:30Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '300'
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 0aa76401-070f-11eb-9043-b5bb049fa26d
call_identifier: H2020
grant_number: '948819'
name: Bridging Scales in Random Materials
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '10012'
relation: part_of_dissertation
status: public
- id: '10013'
relation: part_of_dissertation
status: public
- id: '7489'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Julian L
full_name: Fischer, Julian L
id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87
last_name: Fischer
orcid: 0000-0002-0479-558X
title: 'Curvature driven interface evolution: Uniqueness properties of weak solution
concepts'
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2021'
...
---
_id: '10191'
abstract:
- lang: eng
text: "In this work we solve the algorithmic problem of consistency verification
for the TSO and PSO memory models given a reads-from map, denoted VTSO-rf and
VPSO-rf, respectively. For an execution of n events over k threads and d variables,
we establish novel bounds that scale as nk+1 for TSO and as nk+1· min(nk2, 2k·
d) for PSO. Moreover, based on our solution to these problems, we develop an SMC
algorithm under TSO and PSO that uses the RF equivalence. The algorithm is exploration-optimal,
in the sense that it is guaranteed to explore each class of the RF partitioning
exactly once, and spends polynomial time per class when k is bounded. Finally,
we implement all our algorithms in the SMC tool Nidhugg, and perform a large number
of experiments over benchmarks from existing literature. Our experimental results
show that our algorithms for VTSO-rf and VPSO-rf provide significant scalability
improvements over standard alternatives. Moreover, when used for SMC, the RF partitioning
is often much coarser than the standard Shasha-Snir partitioning for TSO/PSO,
which yields a significant speedup in the model checking task.\r\n\r\n"
acknowledgement: "The research was partially funded by the ERC CoG 863818 (ForM-SMArt)
and the Vienna Science\r\nand Technology Fund (WWTF) through project ICT15-003."
article_number: '164'
article_processing_charge: No
article_type: original
author:
- first_name: Truc Lam
full_name: Bui, Truc Lam
last_name: Bui
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Tushar
full_name: Gautam, Tushar
last_name: Gautam
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Viktor
full_name: Toman, Viktor
id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87
last_name: Toman
orcid: 0000-0001-9036-063X
citation:
ama: Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. The reads-from equivalence
for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages.
2021;5(OOPSLA). doi:10.1145/3485541
apa: Bui, T. L., Chatterjee, K., Gautam, T., Pavlogiannis, A., & Toman, V. (2021).
The reads-from equivalence for the TSO and PSO memory models. Proceedings of
the ACM on Programming Languages. Association for Computing Machinery. https://doi.org/10.1145/3485541
chicago: Bui, Truc Lam, Krishnendu Chatterjee, Tushar Gautam, Andreas Pavlogiannis,
and Viktor Toman. “The Reads-from Equivalence for the TSO and PSO Memory Models.”
Proceedings of the ACM on Programming Languages. Association for Computing
Machinery, 2021. https://doi.org/10.1145/3485541.
ieee: T. L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, and V. Toman, “The reads-from
equivalence for the TSO and PSO memory models,” Proceedings of the ACM on Programming
Languages, vol. 5, no. OOPSLA. Association for Computing Machinery, 2021.
ista: Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. 2021. The reads-from
equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming
Languages. 5(OOPSLA), 164.
mla: Bui, Truc Lam, et al. “The Reads-from Equivalence for the TSO and PSO Memory
Models.” Proceedings of the ACM on Programming Languages, vol. 5, no. OOPSLA,
164, Association for Computing Machinery, 2021, doi:10.1145/3485541.
short: T.L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, V. Toman, Proceedings
of the ACM on Programming Languages 5 (2021).
date_created: 2021-10-27T15:05:34Z
date_published: 2021-10-15T00:00:00Z
date_updated: 2023-09-07T13:30:27Z
day: '15'
ddc:
- '000'
department:
- _id: GradSch
- _id: KrCh
doi: 10.1145/3485541
ec_funded: 1
external_id:
arxiv:
- '2011.11763'
file:
- access_level: open_access
checksum: 9d6dce7b611853c529bb7b1915ac579e
content_type: application/pdf
creator: cchlebak
date_created: 2021-11-04T07:24:48Z
date_updated: 2021-11-04T07:24:48Z
file_id: '10215'
file_name: 2021_ProcACMPL_Bui.pdf
file_size: 2903485
relation: main_file
success: 1
file_date_updated: 2021-11-04T07:24:48Z
has_accepted_license: '1'
intvolume: ' 5'
issue: OOPSLA
keyword:
- safety
- risk
- reliability and quality
- software
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication: Proceedings of the ACM on Programming Languages
publication_identifier:
eissn:
- 2475-1421
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '10199'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: The reads-from equivalence for the TSO and PSO memory models
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: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 5
year: '2021'
...
---
_id: '10013'
abstract:
- lang: eng
text: We derive a weak-strong uniqueness principle for BV solutions to multiphase
mean curvature flow of triple line clusters in three dimensions. Our proof is
based on the explicit construction of a gradient-flow calibration in the sense
of the recent work of Fischer et al. [arXiv:2003.05478] for any such cluster.
This extends the two-dimensional construction to the three-dimensional case of
surfaces meeting along triple junctions.
acknowledgement: This project has received funding from the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme
(grant agreement No 948819), and from the Deutsche Forschungsgemeinschaft (DFG,
German Research Foundation) under Germany’s Excellence Strategy – EXC-2047/1 – 390685813.
article_number: '2108.01733'
article_processing_charge: No
author:
- first_name: Sebastian
full_name: Hensel, Sebastian
id: 4D23B7DA-F248-11E8-B48F-1D18A9856A87
last_name: Hensel
orcid: 0000-0001-7252-8072
- first_name: Tim
full_name: Laux, Tim
last_name: Laux
citation:
ama: Hensel S, Laux T. Weak-strong uniqueness for the mean curvature flow of double
bubbles. arXiv. doi:10.48550/arXiv.2108.01733
apa: Hensel, S., & Laux, T. (n.d.). Weak-strong uniqueness for the mean curvature
flow of double bubbles. arXiv. https://doi.org/10.48550/arXiv.2108.01733
chicago: Hensel, Sebastian, and Tim Laux. “Weak-Strong Uniqueness for the Mean Curvature
Flow of Double Bubbles.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2108.01733.
ieee: S. Hensel and T. Laux, “Weak-strong uniqueness for the mean curvature flow
of double bubbles,” arXiv. .
ista: Hensel S, Laux T. Weak-strong uniqueness for the mean curvature flow of double
bubbles. arXiv, 2108.01733.
mla: Hensel, Sebastian, and Tim Laux. “Weak-Strong Uniqueness for the Mean Curvature
Flow of Double Bubbles.” ArXiv, 2108.01733, doi:10.48550/arXiv.2108.01733.
short: S. Hensel, T. Laux, ArXiv (n.d.).
date_created: 2021-09-13T12:17:11Z
date_published: 2021-08-03T00:00:00Z
date_updated: 2023-09-07T13:30:45Z
day: '03'
department:
- _id: JuFi
doi: 10.48550/arXiv.2108.01733
ec_funded: 1
external_id:
arxiv:
- '2108.01733'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2108.01733
month: '08'
oa: 1
oa_version: Preprint
project:
- _id: 0aa76401-070f-11eb-9043-b5bb049fa26d
call_identifier: H2020
grant_number: '948819'
name: Bridging Scales in Random Materials
publication: arXiv
publication_status: submitted
related_material:
record:
- id: '13043'
relation: later_version
status: public
- id: '10007'
relation: dissertation_contains
status: public
status: public
title: Weak-strong uniqueness for the mean curvature flow of double bubbles
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '9928'
abstract:
- lang: eng
text: There are two elementary superconducting qubit types that derive directly
from the quantum harmonic oscillator. In one, the inductor is replaced by a nonlinear
Josephson junction to realize the widely used charge qubits with a compact phase
variable and a discrete charge wave function. In the other, the junction is added
in parallel, which gives rise to an extended phase variable, continuous wave functions,
and a rich energy-level structure due to the loop topology. While the corresponding
rf superconducting quantum interference device Hamiltonian was introduced as a
quadratic quasi-one-dimensional potential approximation to describe the fluxonium
qubit implemented with long Josephson-junction arrays, in this work we implement
it directly using a linear superinductor formed by a single uninterrupted aluminum
wire. We present a large variety of qubits, all stemming from the same circuit
but with drastically different characteristic energy scales. This includes flux
and fluxonium qubits but also the recently introduced quasicharge qubit with strongly
enhanced zero-point phase fluctuations and a heavily suppressed flux dispersion.
The use of a geometric inductor results in high reproducibility of the inductive
energy as guaranteed by top-down lithography—a key ingredient for intrinsically
protected superconducting qubits.
acknowledged_ssus:
- _id: NanoFab
- _id: M-Shop
acknowledgement: We thank W. Hughes for analytic and numerical modeling during the
early stages of this work, J. Koch for discussions and support with the scqubits
package, R. Sett, P. Zielinski, and L. Drmic for software development, and G. Katsaros
for equipment support, as well as the MIBA workshop and the Institute of Science
and Technology Austria nanofabrication facility. We thank I. Pop, S. Deleglise,
and E. Flurin for discussions. This work was supported by a NOMIS Foundation research
grant, the Austrian Science Fund (FWF) through BeyondC (F7105), and IST Austria.
M.P. is the recipient of a Pöttinger scholarship at IST Austria. E.R. is the recipient
of a DOC fellowship of the Austrian Academy of Sciences at IST Austria.
article_processing_charge: No
article_type: original
author:
- first_name: Matilda
full_name: Peruzzo, Matilda
id: 3F920B30-F248-11E8-B48F-1D18A9856A87
last_name: Peruzzo
orcid: 0000-0002-3415-4628
- first_name: Farid
full_name: Hassani, Farid
id: 2AED110C-F248-11E8-B48F-1D18A9856A87
last_name: Hassani
orcid: 0000-0001-6937-5773
- first_name: Gregory
full_name: Szep, Gregory
last_name: Szep
- first_name: Andrea
full_name: Trioni, Andrea
id: 42F71B44-F248-11E8-B48F-1D18A9856A87
last_name: Trioni
- first_name: Elena
full_name: Redchenko, Elena
id: 2C21D6E8-F248-11E8-B48F-1D18A9856A87
last_name: Redchenko
- first_name: Martin
full_name: Zemlicka, Martin
id: 2DCF8DE6-F248-11E8-B48F-1D18A9856A87
last_name: Zemlicka
- first_name: Johannes M
full_name: Fink, Johannes M
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
citation:
ama: 'Peruzzo M, Hassani F, Szep G, et al. Geometric superinductance qubits: Controlling
phase delocalization across a single Josephson junction. PRX Quantum. 2021;2(4):040341.
doi:10.1103/PRXQuantum.2.040341'
apa: 'Peruzzo, M., Hassani, F., Szep, G., Trioni, A., Redchenko, E., Zemlicka, M.,
& Fink, J. M. (2021). Geometric superinductance qubits: Controlling phase
delocalization across a single Josephson junction. PRX Quantum. American
Physical Society. https://doi.org/10.1103/PRXQuantum.2.040341'
chicago: 'Peruzzo, Matilda, Farid Hassani, Gregory Szep, Andrea Trioni, Elena Redchenko,
Martin Zemlicka, and Johannes M Fink. “Geometric Superinductance Qubits: Controlling
Phase Delocalization across a Single Josephson Junction.” PRX Quantum.
American Physical Society, 2021. https://doi.org/10.1103/PRXQuantum.2.040341.'
ieee: 'M. Peruzzo et al., “Geometric superinductance qubits: Controlling
phase delocalization across a single Josephson junction,” PRX Quantum,
vol. 2, no. 4. American Physical Society, p. 040341, 2021.'
ista: 'Peruzzo M, Hassani F, Szep G, Trioni A, Redchenko E, Zemlicka M, Fink JM.
2021. Geometric superinductance qubits: Controlling phase delocalization across
a single Josephson junction. PRX Quantum. 2(4), 040341.'
mla: 'Peruzzo, Matilda, et al. “Geometric Superinductance Qubits: Controlling Phase
Delocalization across a Single Josephson Junction.” PRX Quantum, vol. 2,
no. 4, American Physical Society, 2021, p. 040341, doi:10.1103/PRXQuantum.2.040341.'
short: M. Peruzzo, F. Hassani, G. Szep, A. Trioni, E. Redchenko, M. Zemlicka, J.M.
Fink, PRX Quantum 2 (2021) 040341.
date_created: 2021-08-17T08:14:18Z
date_published: 2021-11-24T00:00:00Z
date_updated: 2023-09-07T13:31:22Z
day: '24'
ddc:
- '530'
department:
- _id: JoFi
- _id: NanoFab
- _id: M-Shop
doi: 10.1103/PRXQuantum.2.040341
ec_funded: 1
external_id:
arxiv:
- '2106.05882'
isi:
- '000723015100001'
file:
- access_level: open_access
checksum: 36eb41ea43d8ca22b0efab12419e4eb2
content_type: application/pdf
creator: cchlebak
date_created: 2022-01-18T11:29:33Z
date_updated: 2022-01-18T11:29:33Z
file_id: '10641'
file_name: 2021_PRXQuantum_Peruzzo.pdf
file_size: 4247422
relation: main_file
success: 1
file_date_updated: 2022-01-18T11:29:33Z
has_accepted_license: '1'
intvolume: ' 2'
isi: 1
issue: '4'
keyword:
- quantum physics
- mesoscale and nanoscale physics
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: '040341'
project:
- _id: 26927A52-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: F07105
name: Integrating superconducting quantum circuits
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 2622978C-B435-11E9-9278-68D0E5697425
name: Hybrid Semiconductor - Superconductor Quantum Devices
publication: PRX Quantum
publication_identifier:
eissn:
- 2691-3399
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
related_material:
record:
- id: '13057'
relation: research_data
status: public
- id: '9920'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'Geometric superinductance qubits: Controlling phase delocalization across
a single Josephson junction'
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: 2
year: '2021'
...
---
_id: '10030'
abstract:
- lang: eng
text: "This PhD thesis is primarily focused on the study of discrete transport problems,
introduced for the first time in the seminal works of Maas [Maa11] and Mielke
[Mie11] on finite state Markov chains and reaction-diffusion equations, respectively.
More in detail, my research focuses on the study of transport costs on graphs,
in particular the convergence and the stability of such problems in the discrete-to-continuum
limit. This thesis also includes some results concerning\r\nnon-commutative optimal
transport. The first chapter of this thesis consists of a general introduction
to the optimal transport problems, both in the discrete, the continuous, and the
non-commutative setting. Chapters 2 and 3 present the content of two works, obtained
in collaboration with Peter Gladbach, Eva Kopfer, and Jan Maas, where we have
been able to show the convergence of discrete transport costs on periodic graphs
to suitable continuous ones, which can be described by means of a homogenisation
result. We first focus on the particular case of quadratic costs on the real line
and then extending the result to more general costs in arbitrary dimension. Our
results are the first complete characterisation of limits of transport costs on
periodic graphs in arbitrary dimension which do not rely on any additional symmetry.
In Chapter 4 we turn our attention to one of the intriguing connection between
evolution equations and optimal transport, represented by the theory of gradient
flows. We show that discrete gradient flow structures associated to a finite volume
approximation of a certain class of diffusive equations (Fokker–Planck) is stable
in the limit of vanishing meshes, reproving the convergence of the scheme via
the method of evolutionary Γ-convergence and exploiting a more variational point
of view on the problem. This is based on a collaboration with Dominik Forkert
and Jan Maas. Chapter 5 represents a change of perspective, moving away from the
discrete world and reaching the non-commutative one. As in the discrete case,
we discuss how classical tools coming from the commutative optimal transport can
be translated into the setting of density matrices. In particular, in this final
chapter we present a non-commutative version of the Schrödinger problem (or entropic
regularised optimal transport problem) and discuss existence and characterisation
of minimisers, a duality result, and present a non-commutative version of the
well-known Sinkhorn algorithm to compute the above mentioned optimisers. This
is based on a joint work with Dario Feliciangeli and Augusto Gerolin. Finally,
Appendix A and B contain some additional material and discussions, with particular
attention to Harnack inequalities and the regularity of flows on discrete spaces."
acknowledged_ssus:
- _id: M-Shop
- _id: NanoFab
acknowledgement: The author gratefully acknowledges support by the Austrian Science
Fund (FWF), grants No W1245.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Lorenzo
full_name: Portinale, Lorenzo
id: 30AD2CBC-F248-11E8-B48F-1D18A9856A87
last_name: Portinale
citation:
ama: Portinale L. Discrete-to-continuum limits of transport problems and gradient
flows in the space of measures. 2021. doi:10.15479/at:ista:10030
apa: Portinale, L. (2021). Discrete-to-continuum limits of transport problems
and gradient flows in the space of measures. Institute of Science and Technology
Austria. https://doi.org/10.15479/at:ista:10030
chicago: Portinale, Lorenzo. “Discrete-to-Continuum Limits of Transport Problems
and Gradient Flows in the Space of Measures.” Institute of Science and Technology
Austria, 2021. https://doi.org/10.15479/at:ista:10030.
ieee: L. Portinale, “Discrete-to-continuum limits of transport problems and gradient
flows in the space of measures,” Institute of Science and Technology Austria,
2021.
ista: Portinale L. 2021. Discrete-to-continuum limits of transport problems and
gradient flows in the space of measures. Institute of Science and Technology Austria.
mla: Portinale, Lorenzo. Discrete-to-Continuum Limits of Transport Problems and
Gradient Flows in the Space of Measures. Institute of Science and Technology
Austria, 2021, doi:10.15479/at:ista:10030.
short: L. Portinale, Discrete-to-Continuum Limits of Transport Problems and Gradient
Flows in the Space of Measures, Institute of Science and Technology Austria, 2021.
date_created: 2021-09-21T09:14:15Z
date_published: 2021-09-22T00:00:00Z
date_updated: 2023-09-07T13:31:06Z
day: '22'
ddc:
- '515'
degree_awarded: PhD
department:
- _id: GradSch
- _id: JaMa
doi: 10.15479/at:ista:10030
file:
- access_level: closed
checksum: 8cd60dcb8762e8f21867e21e8001e183
content_type: application/x-zip-compressed
creator: cchlebak
date_created: 2021-09-21T09:17:34Z
date_updated: 2022-03-10T12:14:42Z
file_id: '10032'
file_name: tex_and_pictures.zip
file_size: 3876668
relation: source_file
- access_level: open_access
checksum: 9789e9d967c853c1503ec7f307170279
content_type: application/pdf
creator: cchlebak
date_created: 2021-09-27T11:14:31Z
date_updated: 2021-09-27T11:14:31Z
file_id: '10047'
file_name: thesis_portinale_Final (1).pdf
file_size: 2532673
relation: main_file
file_date_updated: 2022-03-10T12:14:42Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 260788DE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
name: Dissipation and Dispersion in Nonlinear Partial Differential Equations
- _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2
grant_number: F6504
name: Taming Complexity in Partial Differential Systems
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '10022'
relation: part_of_dissertation
status: public
- id: '9792'
relation: part_of_dissertation
status: public
- id: '7573'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Jan
full_name: Maas, Jan
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
title: Discrete-to-continuum limits of transport problems and gradient flows in the
space of measures
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: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2021'
...
---
_id: '9920'
abstract:
- lang: eng
text: 'This work is concerned with two fascinating circuit quantum electrodynamics
components, the Josephson junction and the geometric superinductor, and the interesting
experiments that can be done by combining the two. The Josephson junction has
revolutionized the field of superconducting circuits as a non-linear dissipation-less
circuit element and is used in almost all superconducting qubit implementations
since the 90s. On the other hand, the superinductor is a relatively new circuit
element introduced as a key component of the fluxonium qubit in 2009. This is
an inductor with characteristic impedance larger than the resistance quantum and
self-resonance frequency in the GHz regime. The combination of these two elements
can occur in two fundamental ways: in parallel and in series. When connected in
parallel the two create the fluxonium qubit, a loop with large inductance and
a rich energy spectrum reliant on quantum tunneling. On the other hand placing
the two elements in series aids with the measurement of the IV curve of a single
Josephson junction in a high impedance environment. In this limit theory predicts
that the junction will behave as its dual element: the phase-slip junction. While
the Josephson junction acts as a non-linear inductor the phase-slip junction has
the behavior of a non-linear capacitance and can be used to measure new Josephson
junction phenomena, namely Coulomb blockade of Cooper pairs and phase-locked Bloch
oscillations. The latter experiment allows for a direct link between frequency
and current which is an elusive connection in quantum metrology. This work introduces
the geometric superinductor, a superconducting circuit element where the high
inductance is due to the geometry rather than the material properties of the superconductor,
realized from a highly miniaturized superconducting planar coil. These structures
will be described and characterized as resonators and qubit inductors and progress
towards the measurement of phase-locked Bloch oscillations will be presented.'
acknowledged_ssus:
- _id: NanoFab
- _id: M-Shop
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Matilda
full_name: Peruzzo, Matilda
id: 3F920B30-F248-11E8-B48F-1D18A9856A87
last_name: Peruzzo
orcid: 0000-0002-3415-4628
citation:
ama: Peruzzo M. Geometric superinductors and their applications in circuit quantum
electrodynamics. 2021. doi:10.15479/at:ista:9920
apa: Peruzzo, M. (2021). Geometric superinductors and their applications in circuit
quantum electrodynamics. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:9920
chicago: Peruzzo, Matilda. “Geometric Superinductors and Their Applications in Circuit
Quantum Electrodynamics.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:9920.
ieee: M. Peruzzo, “Geometric superinductors and their applications in circuit quantum
electrodynamics,” Institute of Science and Technology Austria, 2021.
ista: Peruzzo M. 2021. Geometric superinductors and their applications in circuit
quantum electrodynamics. Institute of Science and Technology Austria.
mla: Peruzzo, Matilda. Geometric Superinductors and Their Applications in Circuit
Quantum Electrodynamics. Institute of Science and Technology Austria, 2021,
doi:10.15479/at:ista:9920.
short: M. Peruzzo, Geometric Superinductors and Their Applications in Circuit Quantum
Electrodynamics, Institute of Science and Technology Austria, 2021.
date_created: 2021-08-16T09:44:09Z
date_published: 2021-08-19T00:00:00Z
date_updated: 2023-09-07T13:31:22Z
day: '19'
ddc:
- '539'
degree_awarded: PhD
department:
- _id: GradSch
- _id: JoFi
doi: 10.15479/at:ista:9920
file:
- access_level: closed
checksum: 3cd1986efde5121d7581f6fcf9090da8
content_type: application/x-zip-compressed
creator: mperuzzo
date_created: 2021-08-16T09:33:21Z
date_updated: 2021-09-06T08:39:47Z
file_id: '9924'
file_name: GeometricSuperinductorsForCQED.zip
file_size: 151387283
relation: source_file
- access_level: open_access
checksum: 50928c621cdf0775d7a5906b9dc8602c
content_type: application/pdf
creator: mperuzzo
date_created: 2021-08-18T14:20:06Z
date_updated: 2021-09-06T08:39:47Z
file_id: '9939'
file_name: GeometricSuperinductorsAndTheirApplicationsIncQED-1b.pdf
file_size: 17596344
relation: main_file
- access_level: closed
checksum: 37f486aa1b622fe44af00d627ec13f6c
content_type: application/pdf
creator: mperuzzo
date_created: 2021-08-18T14:20:09Z
date_updated: 2021-09-06T08:39:47Z
description: Extra copy of the thesis as PDF/A-2b
file_id: '9940'
file_name: GeometricSuperinductorsAndTheirApplicationsIncQED-2b.pdf
file_size: 17592425
relation: other
file_date_updated: 2021-09-06T08:39:47Z
has_accepted_license: '1'
keyword:
- quantum computing
- superinductor
- quantum metrology
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: '149'
publication_identifier:
isbn:
- 978-3-99078-013-8
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '9928'
relation: part_of_dissertation
status: public
- id: '8755'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Johannes M
full_name: Fink, Johannes M
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
title: Geometric superinductors and their applications in circuit quantum electrodynamics
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2021'
...
---
_id: '10432'
abstract:
- lang: eng
text: One key element behind the recent progress of machine learning has been the
ability to train machine learning models in large-scale distributed shared-memory
and message-passing environments. Most of these models are trained employing variants
of stochastic gradient descent (SGD) based optimization, but most methods involve
some type of consistency relaxation relative to sequential SGD, to mitigate its
large communication or synchronization costs at scale. In this paper, we introduce
a general consistency condition covering communication-reduced and asynchronous
distributed SGD implementations. Our framework, called elastic consistency, decouples
the system-specific aspects of the implementation from the SGD convergence requirements,
giving a general way to obtain convergence bounds for a wide variety of distributed
SGD methods used in practice. Elastic consistency can be used to re-derive or
improve several previous convergence bounds in message-passing and shared-memory
settings, but also to analyze new models and distribution schemes. As a direct
application, we propose and analyze a new synchronization-avoiding scheduling
scheme for distributed SGD, and show that it can be used to efficiently train
deep convolutional models for image classification.
acknowledgement: "We would like to thank Christopher De Sa for his feedback on an
earlier draft of this paper, as well as the anonymous AAAI reviewers for their useful
comments. This project has received\r\nfunding from the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme
(grant agreement No 805223 ScaleML). Bapi\r\nChatterjee was supported by the European
Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie
grant agreement No. 754411 (ISTPlus)."
article_processing_charge: No
author:
- first_name: Giorgi
full_name: Nadiradze, Giorgi
id: 3279A00C-F248-11E8-B48F-1D18A9856A87
last_name: Nadiradze
orcid: 0000-0001-5634-0731
- first_name: Ilia
full_name: Markov, Ilia
id: D0CF4148-C985-11E9-8066-0BDEE5697425
last_name: Markov
- first_name: Bapi
full_name: Chatterjee, Bapi
id: 3C41A08A-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-2742-4028
- first_name: 'Vyacheslav '
full_name: 'Kungurtsev, Vyacheslav '
last_name: Kungurtsev
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Nadiradze G, Markov I, Chatterjee B, Kungurtsev V, Alistarh D-A. Elastic consistency:
A practical consistency model for distributed stochastic gradient descent. In:
Proceedings of the AAAI Conference on Artificial Intelligence. Vol 35.
; 2021:9037-9045.'
apa: 'Nadiradze, G., Markov, I., Chatterjee, B., Kungurtsev, V., & Alistarh,
D.-A. (2021). Elastic consistency: A practical consistency model for distributed
stochastic gradient descent. In Proceedings of the AAAI Conference on Artificial
Intelligence (Vol. 35, pp. 9037–9045). Virtual.'
chicago: 'Nadiradze, Giorgi, Ilia Markov, Bapi Chatterjee, Vyacheslav Kungurtsev,
and Dan-Adrian Alistarh. “Elastic Consistency: A Practical Consistency Model for
Distributed Stochastic Gradient Descent.” In Proceedings of the AAAI Conference
on Artificial Intelligence, 35:9037–45, 2021.'
ieee: 'G. Nadiradze, I. Markov, B. Chatterjee, V. Kungurtsev, and D.-A. Alistarh,
“Elastic consistency: A practical consistency model for distributed stochastic
gradient descent,” in Proceedings of the AAAI Conference on Artificial Intelligence,
Virtual, 2021, vol. 35, no. 10, pp. 9037–9045.'
ista: 'Nadiradze G, Markov I, Chatterjee B, Kungurtsev V, Alistarh D-A. 2021. Elastic
consistency: A practical consistency model for distributed stochastic gradient
descent. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI:
Association for the Advancement of Artificial Intelligence vol. 35, 9037–9045.'
mla: 'Nadiradze, Giorgi, et al. “Elastic Consistency: A Practical Consistency Model
for Distributed Stochastic Gradient Descent.” Proceedings of the AAAI Conference
on Artificial Intelligence, vol. 35, no. 10, 2021, pp. 9037–45.'
short: G. Nadiradze, I. Markov, B. Chatterjee, V. Kungurtsev, D.-A. Alistarh, in:,
Proceedings of the AAAI Conference on Artificial Intelligence, 2021, pp. 9037–9045.
conference:
end_date: 2021-02-09
location: Virtual
name: 'AAAI: Association for the Advancement of Artificial Intelligence'
start_date: 2021-02-02
date_created: 2021-12-09T09:21:35Z
date_published: 2021-05-18T00:00:00Z
date_updated: 2023-09-07T13:31:39Z
day: '18'
department:
- _id: DaAl
ec_funded: 1
external_id:
arxiv:
- '2001.05918'
intvolume: ' 35'
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://ojs.aaai.org/index.php/AAAI/article/view/17092
month: '05'
oa: 1
oa_version: Published Version
page: 9037-9045
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: Proceedings of the AAAI Conference on Artificial Intelligence
publication_status: published
quality_controlled: '1'
related_material:
record:
- id: '10429'
relation: dissertation_contains
status: public
status: public
title: 'Elastic consistency: A practical consistency model for distributed stochastic
gradient descent'
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 35
year: '2021'
...
---
_id: '10041'
abstract:
- lang: eng
text: Yao’s garbling scheme is one of the most fundamental cryptographic constructions.
Lindell and Pinkas (Journal of Cryptograhy 2009) gave a formal proof of security
in the selective setting where the adversary chooses the challenge inputs before
seeing the garbled circuit assuming secure symmetric-key encryption (and hence
one-way functions). This was followed by results, both positive and negative,
concerning its security in the, stronger, adaptive setting. Applebaum et al. (Crypto
2013) showed that it cannot satisfy adaptive security as is, due to a simple incompressibility
argument. Jafargholi and Wichs (TCC 2017) considered a natural adaptation of Yao’s
scheme (where the output mapping is sent in the online phase, together with the
garbled input) that circumvents this negative result, and proved that it is adaptively
secure, at least for shallow circuits. In particular, they showed that for the
class of circuits of depth δ , the loss in security is at most exponential in δ
. The above results all concern the simulation-based notion of security. In this
work, we show that the upper bound of Jafargholi and Wichs is basically optimal
in a strong sense. As our main result, we show that there exists a family of Boolean
circuits, one for each depth δ∈N , such that any black-box reduction proving
the adaptive indistinguishability of the natural adaptation of Yao’s scheme from
any symmetric-key encryption has to lose a factor that is exponential in δ√
. Since indistinguishability is a weaker notion than simulation, our bound also
applies to adaptive simulation. To establish our results, we build on the recent
approach of Kamath et al. (Eprint 2021), which uses pebbling lower bounds in conjunction
with oracle separations to prove fine-grained lower bounds on loss in cryptographic
security.
acknowledgement: We would like to thank the anonymous reviewers of Crypto’21 whose
detailed comments helped us considerably improve the presentation of the paper.
alternative_title:
- LCNS
article_processing_charge: No
author:
- 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: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Daniel
full_name: Wichs, Daniel
last_name: Wichs
citation:
ama: 'Kamath Hosdurg C, Klein K, Pietrzak KZ, Wichs D. Limits on the Adaptive Security
of Yao’s Garbling. In: 41st Annual International Cryptology Conference, Part
II . Vol 12826. Cham: Springer Nature; 2021:486-515. doi:10.1007/978-3-030-84245-1_17'
apa: 'Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., & Wichs, D. (2021). Limits
on the Adaptive Security of Yao’s Garbling. In 41st Annual International Cryptology
Conference, Part II (Vol. 12826, pp. 486–515). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-84245-1_17'
chicago: 'Kamath Hosdurg, Chethan, Karen Klein, Krzysztof Z Pietrzak, and Daniel
Wichs. “Limits on the Adaptive Security of Yao’s Garbling.” In 41st Annual
International Cryptology Conference, Part II , 12826:486–515. Cham: Springer
Nature, 2021. https://doi.org/10.1007/978-3-030-84245-1_17.'
ieee: C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and D. Wichs, “Limits on the
Adaptive Security of Yao’s Garbling,” in 41st Annual International Cryptology
Conference, Part II , Virtual, 2021, vol. 12826, pp. 486–515.
ista: 'Kamath Hosdurg C, Klein K, Pietrzak KZ, Wichs D. 2021. Limits on the Adaptive
Security of Yao’s Garbling. 41st Annual International Cryptology Conference, Part
II . CRYPTO: Annual International Cryptology Conference, LCNS, vol. 12826, 486–515.'
mla: Kamath Hosdurg, Chethan, et al. “Limits on the Adaptive Security of Yao’s Garbling.”
41st Annual International Cryptology Conference, Part II , vol. 12826,
Springer Nature, 2021, pp. 486–515, doi:10.1007/978-3-030-84245-1_17.
short: C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, D. Wichs, in:, 41st Annual International
Cryptology Conference, Part II , Springer Nature, Cham, 2021, pp. 486–515.
conference:
end_date: 2021-08-20
location: Virtual
name: 'CRYPTO: Annual International Cryptology Conference'
start_date: 2021-08-16
date_created: 2021-09-23T14:06:15Z
date_published: 2021-08-11T00:00:00Z
date_updated: 2023-09-07T13:32:11Z
day: '11'
department:
- _id: KrPi
doi: 10.1007/978-3-030-84245-1_17
ec_funded: 1
intvolume: ' 12826'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2021/945
month: '08'
oa: 1
oa_version: Preprint
page: 486-515
place: Cham
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: '41st Annual International Cryptology Conference, Part II '
publication_identifier:
eisbn:
- 978-3-030-84245-1
eissn:
- 1611-3349
isbn:
- 978-3-030-84244-4
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '10035'
relation: dissertation_contains
status: public
status: public
title: Limits on the Adaptive Security of Yao’s Garbling
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 12826
year: '2021'
...
---
_id: '10049'
abstract:
- lang: eng
text: While messaging systems with strong security guarantees are widely used in
practice, designing a protocol that scales efficiently to large groups and enjoys
similar security guarantees remains largely open. The two existing proposals to
date are ART (Cohn-Gordon et al., CCS18) and TreeKEM (IETF, The Messaging Layer
Security Protocol, draft). TreeKEM is the currently considered candidate by the
IETF MLS working group, but dynamic group operations (i.e. adding and removing
users) can cause efficiency issues. In this paper we formalize and analyze a variant
of TreeKEM which we term Tainted TreeKEM (TTKEM for short). The basic idea underlying
TTKEM was suggested by Millican (MLS mailing list, February 2018). This version
is more efficient than TreeKEM for some natural distributions of group operations,
we quantify this through simulations.Our second contribution is two security proofs
for TTKEM which establish post compromise and forward secrecy even against adaptive
attackers. The security loss (to the underlying PKE) in the Random Oracle Model
is a polynomial factor, and a quasipolynomial one in the Standard Model. Our proofs
can be adapted to TreeKEM as well. Before our work no security proof for any TreeKEM-like
protocol establishing tight security against an adversary who can adaptively choose
the sequence of operations was known. We also are the first to prove (or even
formalize) active security where the server can arbitrarily deviate from the protocol
specification. Proving fully active security – where also the users can arbitrarily
deviate – remains open.
acknowledgement: The first three authors contributed equally to this work. Funded
by the European Research Council (ERC) under the European Union’s Horizon2020 research
and innovation programme (682815-TOCNeT). Funded by the European Union’s Horizon
2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement
No.665385.
article_processing_charge: No
author:
- first_name: Karen
full_name: Klein, Karen
id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87
last_name: Klein
- first_name: Guillermo
full_name: Pascual Perez, Guillermo
id: 2D7ABD02-F248-11E8-B48F-1D18A9856A87
last_name: Pascual Perez
orcid: 0000-0001-8630-415X
- first_name: Michael
full_name: Walter, Michael
id: 488F98B0-F248-11E8-B48F-1D18A9856A87
last_name: Walter
orcid: 0000-0003-3186-2482
- first_name: Chethan
full_name: Kamath Hosdurg, Chethan
id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87
last_name: Kamath Hosdurg
- first_name: Margarita
full_name: Capretto, Margarita
last_name: Capretto
- first_name: Miguel
full_name: Cueto Noval, Miguel
id: ffc563a3-f6e0-11ea-865d-e3cce03d17cc
last_name: Cueto Noval
- first_name: Ilia
full_name: Markov, Ilia
id: D0CF4148-C985-11E9-8066-0BDEE5697425
last_name: Markov
- first_name: Michelle X
full_name: Yeo, Michelle X
id: 2D82B818-F248-11E8-B48F-1D18A9856A87
last_name: Yeo
- first_name: Joel F
full_name: Alwen, Joel F
id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87
last_name: Alwen
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Klein K, Pascual Perez G, Walter M, et al. Keep the dirt: tainted TreeKEM,
adaptively and actively secure continuous group key agreement. In: 2021 IEEE
Symposium on Security and Privacy . IEEE; 2021:268-284. doi:10.1109/sp40001.2021.00035'
apa: 'Klein, K., Pascual Perez, G., Walter, M., Kamath Hosdurg, C., Capretto, M.,
Cueto Noval, M., … Pietrzak, K. Z. (2021). Keep the dirt: tainted TreeKEM, adaptively
and actively secure continuous group key agreement. In 2021 IEEE Symposium
on Security and Privacy (pp. 268–284). San Francisco, CA, United States:
IEEE. https://doi.org/10.1109/sp40001.2021.00035'
chicago: 'Klein, Karen, Guillermo Pascual Perez, Michael Walter, Chethan Kamath
Hosdurg, Margarita Capretto, Miguel Cueto Noval, Ilia Markov, Michelle X Yeo,
Joel F Alwen, and Krzysztof Z Pietrzak. “Keep the Dirt: Tainted TreeKEM, Adaptively
and Actively Secure Continuous Group Key Agreement.” In 2021 IEEE Symposium
on Security and Privacy , 268–84. IEEE, 2021. https://doi.org/10.1109/sp40001.2021.00035.'
ieee: 'K. Klein et al., “Keep the dirt: tainted TreeKEM, adaptively and actively
secure continuous group key agreement,” in 2021 IEEE Symposium on Security
and Privacy , San Francisco, CA, United States, 2021, pp. 268–284.'
ista: 'Klein K, Pascual Perez G, Walter M, Kamath Hosdurg C, Capretto M, Cueto Noval
M, Markov I, Yeo MX, Alwen JF, Pietrzak KZ. 2021. Keep the dirt: tainted TreeKEM,
adaptively and actively secure continuous group key agreement. 2021 IEEE Symposium
on Security and Privacy . SP: Symposium on Security and Privacy, 268–284.'
mla: 'Klein, Karen, et al. “Keep the Dirt: Tainted TreeKEM, Adaptively and Actively
Secure Continuous Group Key Agreement.” 2021 IEEE Symposium on Security and
Privacy , IEEE, 2021, pp. 268–84, doi:10.1109/sp40001.2021.00035.'
short: K. Klein, G. Pascual Perez, M. Walter, C. Kamath Hosdurg, M. Capretto, M.
Cueto Noval, I. Markov, M.X. Yeo, J.F. Alwen, K.Z. Pietrzak, in:, 2021 IEEE Symposium
on Security and Privacy , IEEE, 2021, pp. 268–284.
conference:
end_date: 2021-05-27
location: San Francisco, CA, United States
name: 'SP: Symposium on Security and Privacy'
start_date: 2021-05-24
date_created: 2021-09-27T13:46:27Z
date_published: 2021-08-26T00:00:00Z
date_updated: 2023-09-07T13:32:11Z
day: '26'
department:
- _id: KrPi
- _id: DaAl
doi: 10.1109/sp40001.2021.00035
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2019/1489
month: '08'
oa: 1
oa_version: Preprint
page: 268-284
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: '2021 IEEE Symposium on Security and Privacy '
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '10035'
relation: dissertation_contains
status: public
status: public
title: 'Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous
group key agreement'
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2021'
...
---
_id: '10044'
abstract:
- lang: eng
text: We show that Yao’s garbling scheme is adaptively indistinguishable for the
class of Boolean circuits of size S and treewidth w with only a S^O(w) loss in
security. For instance, circuits with constant treewidth are as a result adaptively
indistinguishable with only a polynomial loss. This (partially) complements a
negative result of Applebaum et al. (Crypto 2013), which showed (assuming one-way
functions) that Yao’s garbling scheme cannot be adaptively simulatable. As main
technical contributions, we introduce a new pebble game that abstracts out our
security reduction and then present a pebbling strategy for this game where the
number of pebbles used is roughly O(d w log(S)), d being the fan-out of the circuit.
The design of the strategy relies on separators, a graph-theoretic notion with
connections to circuit complexity.
acknowledgement: 'We would like to thank Daniel Wichs for helpful discussions on the
landscape of adaptive security of Yao’s garbling. '
article_number: 2021/926
article_processing_charge: No
author:
- 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: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Kamath Hosdurg C, Klein K, Pietrzak KZ. On treewidth, separators and Yao’s
garbling. In: 19th Theory of Cryptography Conference 2021. International
Association for Cryptologic Research; 2021.'
apa: 'Kamath Hosdurg, C., Klein, K., & Pietrzak, K. Z. (2021). On treewidth,
separators and Yao’s garbling. In 19th Theory of Cryptography Conference 2021.
Raleigh, NC, United States: International Association for Cryptologic Research.'
chicago: Kamath Hosdurg, Chethan, Karen Klein, and Krzysztof Z Pietrzak. “On Treewidth,
Separators and Yao’s Garbling.” In 19th Theory of Cryptography Conference 2021.
International Association for Cryptologic Research, 2021.
ieee: C. Kamath Hosdurg, K. Klein, and K. Z. Pietrzak, “On treewidth, separators
and Yao’s garbling,” in 19th Theory of Cryptography Conference 2021, Raleigh,
NC, United States, 2021.
ista: 'Kamath Hosdurg C, Klein K, Pietrzak KZ. 2021. On treewidth, separators and
Yao’s garbling. 19th Theory of Cryptography Conference 2021. TCC: Theory of Cryptography
Conference, 2021/926.'
mla: Kamath Hosdurg, Chethan, et al. “On Treewidth, Separators and Yao’s Garbling.”
19th Theory of Cryptography Conference 2021, 2021/926, International Association
for Cryptologic Research, 2021.
short: C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, 19th Theory of Cryptography
Conference 2021, International Association for Cryptologic Research, 2021.
conference:
end_date: 2021-11-11
location: Raleigh, NC, United States
name: 'TCC: Theory of Cryptography Conference'
start_date: 2021-11-08
date_created: 2021-09-24T12:01:34Z
date_published: 2021-07-08T00:00:00Z
date_updated: 2023-09-07T13:32:11Z
day: '08'
department:
- _id: KrPi
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2021/926
month: '07'
oa: 1
oa_version: Preprint
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: 19th Theory of Cryptography Conference 2021
publication_status: published
publisher: International Association for Cryptologic Research
quality_controlled: '1'
related_material:
record:
- id: '10409'
relation: later_version
status: public
- id: '10035'
relation: dissertation_contains
status: public
status: public
title: On treewidth, separators and Yao's garbling
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2021'
...
---
_id: '10422'
abstract:
- lang: eng
text: Those who aim to devise new materials with desirable properties usually examine
present methods first. However, they will find out that some approaches can exist
only conceptually without high chances to become practically useful. It seems
that a numerical technique called automatic differentiation together with increasing
supply of computational accelerators will soon shift many methods of the material
design from the category ”unimaginable” to the category ”expensive but possible”.
Approach we suggest is not an exception. Our overall goal is to have an efficient
and generalizable approach allowing to solve inverse design problems. In this
thesis we scratch its surface. We consider jammed systems of identical particles.
And ask ourselves how the shape of those particles (or the parameters codifying
it) may affect mechanical properties of the system. An indispensable part of reaching
the answer is an appropriate particle parametrization. We come up with a simple,
yet generalizable and purposeful scheme for it. Using our generalizable shape
parameterization, we simulate the formation of a solid composed of pentagonal-like
particles and measure anisotropy in the resulting elastic response. Through automatic
differentiation techniques, we directly connect the shape parameters with the
elastic response. Interestingly, for our system we find that less isotropic particles
lead to a more isotropic elastic response. Together with other results known about
our method it seems that it can be successfully generalized for different inverse
design problems.
alternative_title:
- ISTA Master's Thesis
article_processing_charge: No
author:
- first_name: Anton
full_name: Piankov, Anton
id: 865E3C26-AA8C-11E9-A409-C4C4E5697425
last_name: Piankov
citation:
ama: Piankov A. Towards designer materials using customizable particle shape. 2021.
doi:10.15479/at:ista:10422
apa: Piankov, A. (2021). Towards designer materials using customizable particle
shape. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10422
chicago: Piankov, Anton. “Towards Designer Materials Using Customizable Particle
Shape.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10422.
ieee: A. Piankov, “Towards designer materials using customizable particle shape,”
Institute of Science and Technology Austria, 2021.
ista: Piankov A. 2021. Towards designer materials using customizable particle shape.
Institute of Science and Technology Austria.
mla: Piankov, Anton. Towards Designer Materials Using Customizable Particle Shape.
Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10422.
short: A. Piankov, Towards Designer Materials Using Customizable Particle Shape,
Institute of Science and Technology Austria, 2021.
date_created: 2021-12-07T10:48:06Z
date_published: 2021-12-07T00:00:00Z
date_updated: 2023-09-07T13:34:12Z
day: '07'
ddc:
- '530'
degree_awarded: MS
department:
- _id: GradSch
- _id: CaGo
doi: 10.15479/at:ista:10422
file:
- access_level: closed
checksum: 114e8f4b2c002c6c352416c12de2c695
content_type: application/x-zip-compressed
creator: cchlebak
date_created: 2021-12-07T11:13:52Z
date_updated: 2022-03-10T12:10:25Z
file_id: '10424'
file_name: Thesis.zip
file_size: 394018
relation: source_file
- access_level: closed
checksum: cd15ae991ced352a9959815f794e657c
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: cchlebak
date_created: 2021-12-07T11:14:01Z
date_updated: 2022-03-10T12:10:25Z
file_id: '10425'
file_name: Preliminary_pages_Piankov.docx
file_size: 47638
relation: source_file
- access_level: open_access
checksum: e6899c798b75ba42fab9822bce309050
content_type: application/pdf
creator: cchlebak
date_created: 2021-12-07T11:20:35Z
date_updated: 2021-12-07T11:20:35Z
file_id: '10426'
file_name: 2021_Piankov_combined.pdf
file_size: 484965
relation: main_file
success: 1
file_date_updated: 2022-03-10T12:10:25Z
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
publication_identifier:
issn:
- 2791-4585
publication_status: published
publisher: Institute of Science and Technology Austria
status: public
supervisor:
- first_name: Carl Peter
full_name: Goodrich, Carl Peter
id: EB352CD2-F68A-11E9-89C5-A432E6697425
last_name: Goodrich
orcid: 0000-0002-1307-5074
title: Towards designer materials using customizable particle shape
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2021'
...
---
_id: '10803'
abstract:
- lang: eng
text: Given the abundance of applications of ranking in recent years, addressing
fairness concerns around automated ranking systems becomes necessary for increasing
the trust among end-users. Previous work on fair ranking has mostly focused on
application-specific fairness notions, often tailored to online advertising, and
it rarely considers learning as part of the process. In this work, we show how
to transfer numerous fairness notions from binary classification to a learning
to rank setting. Our formalism allows us to design methods for incorporating fairness
objectives with provable generalization guarantees. An extensive experimental
evaluation shows that our method can improve ranking fairness substantially with
no or only little loss of model quality.
article_number: '2102.05996'
article_processing_charge: No
author:
- first_name: Nikola H
full_name: Konstantinov, Nikola H
id: 4B9D76E4-F248-11E8-B48F-1D18A9856A87
last_name: Konstantinov
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0002-4561-241X
citation:
ama: Konstantinov NH, Lampert C. Fairness through regularization for learning to
rank. arXiv. doi:10.48550/arXiv.2102.05996
apa: Konstantinov, N. H., & Lampert, C. (n.d.). Fairness through regularization
for learning to rank. arXiv. https://doi.org/10.48550/arXiv.2102.05996
chicago: Konstantinov, Nikola H, and Christoph Lampert. “Fairness through Regularization
for Learning to Rank.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2102.05996.
ieee: N. H. Konstantinov and C. Lampert, “Fairness through regularization for learning
to rank,” arXiv. .
ista: Konstantinov NH, Lampert C. Fairness through regularization for learning to
rank. arXiv, 2102.05996.
mla: Konstantinov, Nikola H., and Christoph Lampert. “Fairness through Regularization
for Learning to Rank.” ArXiv, 2102.05996, doi:10.48550/arXiv.2102.05996.
short: N.H. Konstantinov, C. Lampert, ArXiv (n.d.).
date_created: 2022-02-28T14:13:59Z
date_published: 2021-06-07T00:00:00Z
date_updated: 2023-09-07T13:42:08Z
day: '07'
department:
- _id: ChLa
doi: 10.48550/arXiv.2102.05996
external_id:
arxiv:
- '2102.05996'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2102.05996
month: '06'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
related_material:
record:
- id: '10799'
relation: dissertation_contains
status: public
status: public
title: Fairness through regularization for learning to rank
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10762'
abstract:
- lang: eng
text: Methods inspired from machine learning have recently attracted great interest
in the computational study of quantum many-particle systems. So far, however,
it has proven challenging to deal with microscopic models in which the total number
of particles is not conserved. To address this issue, we propose a new variant
of neural network states, which we term neural coherent states. Taking the Fröhlich
impurity model as a case study, we show that neural coherent states can learn
the ground state of non-additive systems very well. In particular, we observe
substantial improvement over the standard coherent state estimates in the most
challenging intermediate coupling regime. Our approach is generic and does not
assume specific details of the system, suggesting wide applications.
acknowledgement: "We acknowledge fruitful discussions with Giacomo Bighin, Giammarco
Fabiani, Areg Ghazaryan, Christoph\r\nLampert, and Artem Volosniev at various stages
of this work. W.R. is a recipient of a DOC Fellowship of the\r\nAustrian Academy
of Sciences and has received funding from the EU Horizon 2020 programme under the
Marie\r\nSkłodowska-Curie Grant Agreement No. 665385. M. L. acknowledges support
by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). This
work is part of the Shell-NWO/FOM-initiative “Computational sciences for energy
research” of Shell and Chemical Sciences, Earth and Life Sciences, Physical Sciences,
FOM and STW."
article_processing_charge: No
author:
- first_name: Wojciech
full_name: Rzadkowski, Wojciech
id: 48C55298-F248-11E8-B48F-1D18A9856A87
last_name: Rzadkowski
orcid: 0000-0002-1106-4419
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
- first_name: Johan H.
full_name: Mentink, Johan H.
last_name: Mentink
citation:
ama: Rzadkowski W, Lemeshko M, Mentink JH. Artificial neural network states for
non-additive systems. arXiv. doi:10.48550/arXiv.2105.15193
apa: Rzadkowski, W., Lemeshko, M., & Mentink, J. H. (n.d.). Artificial neural
network states for non-additive systems. arXiv. https://doi.org/10.48550/arXiv.2105.15193
chicago: Rzadkowski, Wojciech, Mikhail Lemeshko, and Johan H. Mentink. “Artificial
Neural Network States for Non-Additive Systems.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2105.15193.
ieee: W. Rzadkowski, M. Lemeshko, and J. H. Mentink, “Artificial neural network
states for non-additive systems,” arXiv. .
ista: Rzadkowski W, Lemeshko M, Mentink JH. Artificial neural network states for
non-additive systems. arXiv, 10.48550/arXiv.2105.15193.
mla: Rzadkowski, Wojciech, et al. “Artificial Neural Network States for Non-Additive
Systems.” ArXiv, doi:10.48550/arXiv.2105.15193.
short: W. Rzadkowski, M. Lemeshko, J.H. Mentink, ArXiv (n.d.).
date_created: 2022-02-17T11:18:57Z
date_published: 2021-05-31T00:00:00Z
date_updated: 2023-09-07T13:44:16Z
day: '31'
department:
- _id: MiLe
doi: 10.48550/arXiv.2105.15193
ec_funded: 1
external_id:
arxiv:
- '2105.15193'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2105.15193
month: '05'
oa: 1
oa_version: Preprint
page: '2105.15193'
project:
- _id: 2688CF98-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '801770'
name: 'Angulon: physics and applications of a new quasiparticle'
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: arXiv
publication_status: submitted
related_material:
record:
- id: '10759'
relation: dissertation_contains
status: public
status: public
title: Artificial neural network states for non-additive systems
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '9418'
abstract:
- lang: eng
text: "Deep learning is best known for its empirical success across a wide range
of applications\r\nspanning computer vision, natural language processing and speech.
Of equal significance,\r\nthough perhaps less known, are its ramifications for
learning theory: deep networks have\r\nbeen observed to perform surprisingly well
in the high-capacity regime, aka the overfitting\r\nor underspecified regime.
Classically, this regime on the far right of the bias-variance curve\r\nis associated
with poor generalisation; however, recent experiments with deep networks\r\nchallenge
this view.\r\n\r\nThis thesis is devoted to investigating various aspects of underspecification
in deep learning.\r\nFirst, we argue that deep learning models are underspecified
on two levels: a) any given\r\ntraining dataset can be fit by many different functions,
and b) any given function can be\r\nexpressed by many different parameter configurations.
We refer to the second kind of\r\nunderspecification as parameterisation redundancy
and we precisely characterise its extent.\r\nSecond, we characterise the implicit
criteria (the inductive bias) that guide learning in the\r\nunderspecified regime.
Specifically, we consider a nonlinear but tractable classification\r\nsetting,
and show that given the choice, neural networks learn classifiers with a large
margin.\r\nThird, we consider learning scenarios where the inductive bias is not
by itself sufficient to\r\ndeal with underspecification. We then study different
ways of ‘tightening the specification’: i)\r\nIn the setting of representation
learning with variational autoencoders, we propose a hand-\r\ncrafted regulariser
based on mutual information. ii) In the setting of binary classification, we\r\nconsider
soft-label (real-valued) supervision. We derive a generalisation bound for linear\r\nnetworks
supervised in this way and verify that soft labels facilitate fast learning. Finally,
we\r\nexplore an application of soft-label supervision to the training of multi-exit
models."
acknowledged_ssus:
- _id: ScienComp
- _id: CampIT
- _id: E-Lib
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Phuong
full_name: Bui Thi Mai, Phuong
id: 3EC6EE64-F248-11E8-B48F-1D18A9856A87
last_name: Bui Thi Mai
citation:
ama: Phuong M. Underspecification in deep learning. 2021. doi:10.15479/AT:ISTA:9418
apa: Phuong, M. (2021). Underspecification in deep learning. Institute of
Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:9418
chicago: Phuong, Mary. “Underspecification in Deep Learning.” Institute of Science
and Technology Austria, 2021. https://doi.org/10.15479/AT:ISTA:9418.
ieee: M. Phuong, “Underspecification in deep learning,” Institute of Science and
Technology Austria, 2021.
ista: Phuong M. 2021. Underspecification in deep learning. Institute of Science
and Technology Austria.
mla: Phuong, Mary. Underspecification in Deep Learning. Institute of Science
and Technology Austria, 2021, doi:10.15479/AT:ISTA:9418.
short: M. Phuong, Underspecification in Deep Learning, Institute of Science and
Technology Austria, 2021.
date_created: 2021-05-24T13:06:23Z
date_published: 2021-05-30T00:00:00Z
date_updated: 2023-09-08T11:11:12Z
day: '30'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: GradSch
- _id: ChLa
doi: 10.15479/AT:ISTA:9418
file:
- access_level: open_access
checksum: 4f0abe64114cfed264f9d36e8d1197e3
content_type: application/pdf
creator: bphuong
date_created: 2021-05-24T11:22:29Z
date_updated: 2021-05-24T11:22:29Z
file_id: '9419'
file_name: mph-thesis-v519-pdfimages.pdf
file_size: 2673905
relation: main_file
success: 1
- access_level: closed
checksum: f5699e876bc770a9b0df8345a77720a2
content_type: application/zip
creator: bphuong
date_created: 2021-05-24T11:56:02Z
date_updated: 2021-05-24T11:56:02Z
file_id: '9420'
file_name: thesis.zip
file_size: 92995100
relation: source_file
file_date_updated: 2021-05-24T11:56:02Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '125'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '7435'
relation: part_of_dissertation
status: deleted
- id: '7481'
relation: part_of_dissertation
status: public
- id: '9416'
relation: part_of_dissertation
status: public
- id: '7479'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
title: Underspecification in deep learning
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2021'
...
---
_id: '14177'
abstract:
- lang: eng
text: "The focus of disentanglement approaches has been on identifying independent
factors of variation in data. However, the causal variables underlying real-world
observations are often not statistically independent. In this work, we bridge
the gap to real-world scenarios by analyzing the behavior of the most prominent
disentanglement approaches on correlated data in a large-scale empirical study
(including 4260 models). We show and quantify that systematically induced correlations
in the dataset are being learned and reflected in the latent representations,
which has implications for downstream applications of disentanglement such as
fairness. We also demonstrate how to resolve these latent correlations, either
using weak supervision during\r\ntraining or by post-hoc correcting a pre-trained
model with a small number of labels."
alternative_title:
- PMLR
article_processing_charge: No
author:
- first_name: Frederik
full_name: Träuble, Frederik
last_name: Träuble
- first_name: Elliot
full_name: Creager, Elliot
last_name: Creager
- first_name: Niki
full_name: Kilbertus, Niki
last_name: Kilbertus
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Andrea
full_name: Dittadi, Andrea
last_name: Dittadi
- first_name: Anirudh
full_name: Goyal, Anirudh
last_name: Goyal
- first_name: Bernhard
full_name: Schölkopf, Bernhard
last_name: Schölkopf
- first_name: Stefan
full_name: Bauer, Stefan
last_name: Bauer
citation:
ama: 'Träuble F, Creager E, Kilbertus N, et al. On disentangled representations
learned from correlated data. In: Proceedings of the 38th International Conference
on Machine Learning. Vol 139. ML Research Press; 2021:10401-10412.'
apa: 'Träuble, F., Creager, E., Kilbertus, N., Locatello, F., Dittadi, A., Goyal,
A., … Bauer, S. (2021). On disentangled representations learned from correlated
data. In Proceedings of the 38th International Conference on Machine Learning
(Vol. 139, pp. 10401–10412). Virtual: ML Research Press.'
chicago: Träuble, Frederik, Elliot Creager, Niki Kilbertus, Francesco Locatello,
Andrea Dittadi, Anirudh Goyal, Bernhard Schölkopf, and Stefan Bauer. “On Disentangled
Representations Learned from Correlated Data.” In Proceedings of the 38th International
Conference on Machine Learning, 139:10401–12. ML Research Press, 2021.
ieee: F. Träuble et al., “On disentangled representations learned from correlated
data,” in Proceedings of the 38th International Conference on Machine Learning,
Virtual, 2021, vol. 139, pp. 10401–10412.
ista: 'Träuble F, Creager E, Kilbertus N, Locatello F, Dittadi A, Goyal A, Schölkopf
B, Bauer S. 2021. On disentangled representations learned from correlated data.
Proceedings of the 38th International Conference on Machine Learning. ICML: International
Conference on Machine Learning, PMLR, vol. 139, 10401–10412.'
mla: Träuble, Frederik, et al. “On Disentangled Representations Learned from Correlated
Data.” Proceedings of the 38th International Conference on Machine Learning,
vol. 139, ML Research Press, 2021, pp. 10401–12.
short: F. Träuble, E. Creager, N. Kilbertus, F. Locatello, A. Dittadi, A. Goyal,
B. Schölkopf, S. Bauer, in:, Proceedings of the 38th International Conference
on Machine Learning, ML Research Press, 2021, pp. 10401–10412.
conference:
end_date: 2021-07-24
location: Virtual
name: 'ICML: International Conference on Machine Learning'
start_date: 2021-07-18
date_created: 2023-08-22T14:03:47Z
date_published: 2021-08-01T00:00:00Z
date_updated: 2023-09-11T10:18:48Z
day: '01'
department:
- _id: FrLo
extern: '1'
external_id:
arxiv:
- '2006.07886'
intvolume: ' 139'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2006.07886
month: '08'
oa: 1
oa_version: Published Version
page: 10401-10412
publication: Proceedings of the 38th International Conference on Machine Learning
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: On disentangled representations learned from correlated data
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 139
year: '2021'
...
---
_id: '14176'
abstract:
- lang: eng
text: "Intensive care units (ICU) are increasingly looking towards machine learning
for methods to provide online monitoring of critically ill patients. In machine
learning, online monitoring is often formulated as a supervised learning problem.
Recently, contrastive learning approaches have demonstrated promising improvements
over competitive supervised benchmarks. These methods rely on well-understood
data augmentation techniques developed for image data which do not apply to online
monitoring. In this work, we overcome this limitation by\r\nsupplementing time-series
data augmentation techniques with a novel contrastive\r\nlearning objective which
we call neighborhood contrastive learning (NCL). Our objective explicitly groups
together contiguous time segments from each patient while maintaining state-specific
information. Our experiments demonstrate a marked improvement over existing work
applying contrastive methods to medical time-series."
alternative_title:
- PMLR
article_processing_charge: No
author:
- first_name: Hugo
full_name: Yèche, Hugo
last_name: Yèche
- first_name: Gideon
full_name: Dresdner, Gideon
last_name: Dresdner
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Matthias
full_name: Hüser, Matthias
last_name: Hüser
- first_name: Gunnar
full_name: Rätsch, Gunnar
last_name: Rätsch
citation:
ama: 'Yèche H, Dresdner G, Locatello F, Hüser M, Rätsch G. Neighborhood contrastive
learning applied to online patient monitoring. In: Proceedings of 38th International
Conference on Machine Learning. Vol 139. ML Research Press; 2021:11964-11974.'
apa: 'Yèche, H., Dresdner, G., Locatello, F., Hüser, M., & Rätsch, G. (2021).
Neighborhood contrastive learning applied to online patient monitoring. In Proceedings
of 38th International Conference on Machine Learning (Vol. 139, pp. 11964–11974).
Virtual: ML Research Press.'
chicago: Yèche, Hugo, Gideon Dresdner, Francesco Locatello, Matthias Hüser, and
Gunnar Rätsch. “Neighborhood Contrastive Learning Applied to Online Patient Monitoring.”
In Proceedings of 38th International Conference on Machine Learning, 139:11964–74.
ML Research Press, 2021.
ieee: H. Yèche, G. Dresdner, F. Locatello, M. Hüser, and G. Rätsch, “Neighborhood
contrastive learning applied to online patient monitoring,” in Proceedings
of 38th International Conference on Machine Learning, Virtual, 2021, vol.
139, pp. 11964–11974.
ista: Yèche H, Dresdner G, Locatello F, Hüser M, Rätsch G. 2021. Neighborhood contrastive
learning applied to online patient monitoring. Proceedings of 38th International
Conference on Machine Learning. International Conference on Machine Learning,
PMLR, vol. 139, 11964–11974.
mla: Yèche, Hugo, et al. “Neighborhood Contrastive Learning Applied to Online Patient
Monitoring.” Proceedings of 38th International Conference on Machine Learning,
vol. 139, ML Research Press, 2021, pp. 11964–74.
short: H. Yèche, G. Dresdner, F. Locatello, M. Hüser, G. Rätsch, in:, Proceedings
of 38th International Conference on Machine Learning, ML Research Press, 2021,
pp. 11964–11974.
conference:
end_date: 2021-07-24
location: Virtual
name: International Conference on Machine Learning
start_date: 2021-07-18
date_created: 2023-08-22T14:03:04Z
date_published: 2021-08-01T00:00:00Z
date_updated: 2023-09-11T10:16:55Z
day: '01'
department:
- _id: FrLo
extern: '1'
external_id:
arxiv:
- '2106.05142'
intvolume: ' 139'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2106.05142
month: '08'
oa: 1
oa_version: Preprint
page: 11964-11974
publication: Proceedings of 38th International Conference on Machine Learning
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Neighborhood contrastive learning applied to online patient monitoring
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 139
year: '2021'
...
---
_id: '14182'
abstract:
- lang: eng
text: "When machine learning systems meet real world applications, accuracy is only\r\none
of several requirements. In this paper, we assay a complementary\r\nperspective
originating from the increasing availability of pre-trained and\r\nregularly improving
state-of-the-art models. While new improved models develop\r\nat a fast pace,
downstream tasks vary more slowly or stay constant. Assume that\r\nwe have a large
unlabelled data set for which we want to maintain accurate\r\npredictions. Whenever
a new and presumably better ML models becomes available,\r\nwe encounter two problems:
(i) given a limited budget, which data points should\r\nbe re-evaluated using
the new model?; and (ii) if the new predictions differ\r\nfrom the current ones,
should we update? Problem (i) is about compute cost,\r\nwhich matters for very
large data sets and models. Problem (ii) is about\r\nmaintaining consistency of
the predictions, which can be highly relevant for\r\ndownstream applications;
our demand is to avoid negative flips, i.e., changing\r\ncorrect to incorrect
predictions. In this paper, we formalize the Prediction\r\nUpdate Problem and
present an efficient probabilistic approach as answer to the\r\nabove questions.
In extensive experiments on standard classification benchmark\r\ndata sets, we
show that our method outperforms alternative strategies along key\r\nmetrics for
backward-compatible prediction updates."
article_processing_charge: No
author:
- first_name: Frederik
full_name: Träuble, Frederik
last_name: Träuble
- first_name: Julius von
full_name: Kügelgen, Julius von
last_name: Kügelgen
- first_name: Matthäus
full_name: Kleindessner, Matthäus
last_name: Kleindessner
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Bernhard
full_name: Schölkopf, Bernhard
last_name: Schölkopf
- first_name: Peter
full_name: Gehler, Peter
last_name: Gehler
citation:
ama: 'Träuble F, Kügelgen J von, Kleindessner M, Locatello F, Schölkopf B, Gehler
P. Backward-compatible prediction updates: A probabilistic approach. In: 35th
Conference on Neural Information Processing Systems. Vol 34. ; 2021:116-128.'
apa: 'Träuble, F., Kügelgen, J. von, Kleindessner, M., Locatello, F., Schölkopf,
B., & Gehler, P. (2021). Backward-compatible prediction updates: A probabilistic
approach. In 35th Conference on Neural Information Processing Systems (Vol.
34, pp. 116–128). Virtual.'
chicago: 'Träuble, Frederik, Julius von Kügelgen, Matthäus Kleindessner, Francesco
Locatello, Bernhard Schölkopf, and Peter Gehler. “Backward-Compatible Prediction
Updates: A Probabilistic Approach.” In 35th Conference on Neural Information
Processing Systems, 34:116–28, 2021.'
ieee: 'F. Träuble, J. von Kügelgen, M. Kleindessner, F. Locatello, B. Schölkopf,
and P. Gehler, “Backward-compatible prediction updates: A probabilistic approach,”
in 35th Conference on Neural Information Processing Systems, Virtual, 2021,
vol. 34, pp. 116–128.'
ista: 'Träuble F, Kügelgen J von, Kleindessner M, Locatello F, Schölkopf B, Gehler
P. 2021. Backward-compatible prediction updates: A probabilistic approach. 35th
Conference on Neural Information Processing Systems. NeurIPS: Neural Information
Processing Systems vol. 34, 116–128.'
mla: 'Träuble, Frederik, et al. “Backward-Compatible Prediction Updates: A Probabilistic
Approach.” 35th Conference on Neural Information Processing Systems, vol.
34, 2021, pp. 116–28.'
short: F. Träuble, J. von Kügelgen, M. Kleindessner, F. Locatello, B. Schölkopf,
P. Gehler, in:, 35th Conference on Neural Information Processing Systems, 2021,
pp. 116–128.
conference:
end_date: 2021-12-10
location: Virtual
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2021-12-07
date_created: 2023-08-22T14:05:41Z
date_published: 2021-07-02T00:00:00Z
date_updated: 2023-09-11T11:31:59Z
day: '02'
department:
- _id: FrLo
extern: '1'
external_id:
arxiv:
- '2107.01057'
intvolume: ' 34'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2107.01057
month: '07'
oa: 1
oa_version: Preprint
page: 116-128
publication: 35th Conference on Neural Information Processing Systems
publication_identifier:
isbn:
- '9781713845393'
publication_status: published
quality_controlled: '1'
status: public
title: 'Backward-compatible prediction updates: A probabilistic approach'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2021'
...
---
_id: '14181'
abstract:
- lang: eng
text: Variational Inference makes a trade-off between the capacity of the variational
family and the tractability of finding an approximate posterior distribution.
Instead, Boosting Variational Inference allows practitioners to obtain increasingly
good posterior approximations by spending more compute. The main obstacle to widespread
adoption of Boosting Variational Inference is the amount of resources necessary
to improve over a strong Variational Inference baseline. In our work, we trace
this limitation back to the global curvature of the KL-divergence. We characterize
how the global curvature impacts time and memory consumption, address the problem
with the notion of local curvature, and provide a novel approximate backtracking
algorithm for estimating local curvature. We give new theoretical convergence
rates for our algorithms and provide experimental validation on synthetic and
real-world datasets.
article_processing_charge: No
author:
- first_name: Gideon
full_name: Dresdner, Gideon
last_name: Dresdner
- first_name: Saurav
full_name: Shekhar, Saurav
last_name: Shekhar
- first_name: Fabian
full_name: Pedregosa, Fabian
last_name: Pedregosa
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Gunnar
full_name: Rätsch, Gunnar
last_name: Rätsch
citation:
ama: 'Dresdner G, Shekhar S, Pedregosa F, Locatello F, Rätsch G. Boosting variational
inference with locally adaptive step-sizes. In: Proceedings of the Thirtieth
International Joint Conference on Artificial Intelligence. International Joint
Conferences on Artificial Intelligence; 2021:2337-2343. doi:10.24963/ijcai.2021/322'
apa: 'Dresdner, G., Shekhar, S., Pedregosa, F., Locatello, F., & Rätsch, G.
(2021). Boosting variational inference with locally adaptive step-sizes. In Proceedings
of the Thirtieth International Joint Conference on Artificial Intelligence
(pp. 2337–2343). Montreal, Canada: International Joint Conferences on Artificial
Intelligence. https://doi.org/10.24963/ijcai.2021/322'
chicago: Dresdner, Gideon, Saurav Shekhar, Fabian Pedregosa, Francesco Locatello,
and Gunnar Rätsch. “Boosting Variational Inference with Locally Adaptive Step-Sizes.”
In Proceedings of the Thirtieth International Joint Conference on Artificial
Intelligence, 2337–43. International Joint Conferences on Artificial Intelligence,
2021. https://doi.org/10.24963/ijcai.2021/322.
ieee: G. Dresdner, S. Shekhar, F. Pedregosa, F. Locatello, and G. Rätsch, “Boosting
variational inference with locally adaptive step-sizes,” in Proceedings of
the Thirtieth International Joint Conference on Artificial Intelligence, Montreal,
Canada, 2021, pp. 2337–2343.
ista: 'Dresdner G, Shekhar S, Pedregosa F, Locatello F, Rätsch G. 2021. Boosting
variational inference with locally adaptive step-sizes. Proceedings of the Thirtieth
International Joint Conference on Artificial Intelligence. IJCAI: International
Joint Conference on Artificial Intelligence, 2337–2343.'
mla: Dresdner, Gideon, et al. “Boosting Variational Inference with Locally Adaptive
Step-Sizes.” Proceedings of the Thirtieth International Joint Conference on
Artificial Intelligence, International Joint Conferences on Artificial Intelligence,
2021, pp. 2337–43, doi:10.24963/ijcai.2021/322.
short: G. Dresdner, S. Shekhar, F. Pedregosa, F. Locatello, G. Rätsch, in:, Proceedings
of the Thirtieth International Joint Conference on Artificial Intelligence, International
Joint Conferences on Artificial Intelligence, 2021, pp. 2337–2343.
conference:
end_date: 2021-08-27
location: Montreal, Canada
name: 'IJCAI: International Joint Conference on Artificial Intelligence'
start_date: 2021-08-19
date_created: 2023-08-22T14:05:14Z
date_published: 2021-05-19T00:00:00Z
date_updated: 2023-09-11T11:14:30Z
day: '19'
department:
- _id: FrLo
doi: 10.24963/ijcai.2021/322
extern: '1'
external_id:
arxiv:
- '2105.09240'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2105.09240
month: '05'
oa: 1
oa_version: Published Version
page: 2337-2343
publication: Proceedings of the Thirtieth International Joint Conference on Artificial
Intelligence
publication_identifier:
eisbn:
- '9780999241196'
publication_status: published
publisher: International Joint Conferences on Artificial Intelligence
quality_controlled: '1'
status: public
title: Boosting variational inference with locally adaptive step-sizes
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '14179'
abstract:
- lang: eng
text: Self-supervised representation learning has shown remarkable success in a
number of domains. A common practice is to perform data augmentation via hand-crafted
transformations intended to leave the semantics of the data invariant. We seek
to understand the empirical success of this approach from a theoretical perspective.
We formulate the augmentation process as a latent variable model by postulating
a partition of the latent representation into a content component, which is assumed
invariant to augmentation, and a style component, which is allowed to change.
Unlike prior work on disentanglement and independent component analysis, we allow
for both nontrivial statistical and causal dependencies in the latent space. We
study the identifiability of the latent representation based on pairs of views
of the observations and prove sufficient conditions that allow us to identify
the invariant content partition up to an invertible mapping in both generative
and discriminative settings. We find numerical simulations with dependent latent
variables are consistent with our theory. Lastly, we introduce Causal3DIdent,
a dataset of high-dimensional, visually complex images with rich causal dependencies,
which we use to study the effect of data augmentations performed in practice.
article_processing_charge: No
author:
- first_name: Julius von
full_name: Kügelgen, Julius von
last_name: Kügelgen
- first_name: Yash
full_name: Sharma, Yash
last_name: Sharma
- first_name: Luigi
full_name: Gresele, Luigi
last_name: Gresele
- first_name: Wieland
full_name: Brendel, Wieland
last_name: Brendel
- first_name: Bernhard
full_name: Schölkopf, Bernhard
last_name: Schölkopf
- first_name: Michel
full_name: Besserve, Michel
last_name: Besserve
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
citation:
ama: 'Kügelgen J von, Sharma Y, Gresele L, et al. Self-supervised learning with
data augmentations provably isolates content from style. In: Advances in Neural
Information Processing Systems. Vol 34. ; 2021:16451-16467.'
apa: Kügelgen, J. von, Sharma, Y., Gresele, L., Brendel, W., Schölkopf, B., Besserve,
M., & Locatello, F. (2021). Self-supervised learning with data augmentations
provably isolates content from style. In Advances in Neural Information Processing
Systems (Vol. 34, pp. 16451–16467). Virtual.
chicago: Kügelgen, Julius von, Yash Sharma, Luigi Gresele, Wieland Brendel, Bernhard
Schölkopf, Michel Besserve, and Francesco Locatello. “Self-Supervised Learning
with Data Augmentations Provably Isolates Content from Style.” In Advances
in Neural Information Processing Systems, 34:16451–67, 2021.
ieee: J. von Kügelgen et al., “Self-supervised learning with data augmentations
provably isolates content from style,” in Advances in Neural Information Processing
Systems, Virtual, 2021, vol. 34, pp. 16451–16467.
ista: 'Kügelgen J von, Sharma Y, Gresele L, Brendel W, Schölkopf B, Besserve M,
Locatello F. 2021. Self-supervised learning with data augmentations provably isolates
content from style. Advances in Neural Information Processing Systems. NeurIPS:
Neural Information Processing Systems vol. 34, 16451–16467.'
mla: Kügelgen, Julius von, et al. “Self-Supervised Learning with Data Augmentations
Provably Isolates Content from Style.” Advances in Neural Information Processing
Systems, vol. 34, 2021, pp. 16451–67.
short: J. von Kügelgen, Y. Sharma, L. Gresele, W. Brendel, B. Schölkopf, M. Besserve,
F. Locatello, in:, Advances in Neural Information Processing Systems, 2021, pp.
16451–16467.
conference:
end_date: 2021-12-10
location: Virtual
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2021-12-07
date_created: 2023-08-22T14:04:36Z
date_published: 2021-06-08T00:00:00Z
date_updated: 2023-09-11T10:33:19Z
day: '08'
department:
- _id: FrLo
extern: '1'
external_id:
arxiv:
- '2106.04619'
intvolume: ' 34'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2106.04619
month: '06'
oa: 1
oa_version: Preprint
page: 16451-16467
publication: Advances in Neural Information Processing Systems
publication_identifier:
isbn:
- '9781713845393'
publication_status: published
quality_controlled: '1'
status: public
title: Self-supervised learning with data augmentations provably isolates content
from style
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2021'
...
---
_id: '14180'
abstract:
- lang: eng
text: 'Modern neural network architectures can leverage large amounts of data to
generalize well within the training distribution. However, they are less capable
of systematic generalization to data drawn from unseen but related distributions,
a feat that is hypothesized to require compositional reasoning and reuse of knowledge.
In this work, we present Neural Interpreters, an architecture that factorizes
inference in a self-attention network as a system of modules, which we call \emph{functions}.
Inputs to the model are routed through a sequence of functions in a way that is
end-to-end learned. The proposed architecture can flexibly compose computation
along width and depth, and lends itself well to capacity extension after training.
To demonstrate the versatility of Neural Interpreters, we evaluate it in two distinct
settings: image classification and visual abstract reasoning on Raven Progressive
Matrices. In the former, we show that Neural Interpreters perform on par with
the vision transformer using fewer parameters, while being transferrable to a
new task in a sample efficient manner. In the latter, we find that Neural Interpreters
are competitive with respect to the state-of-the-art in terms of systematic generalization. '
article_processing_charge: No
author:
- first_name: Nasim
full_name: Rahaman, Nasim
last_name: Rahaman
- first_name: Muhammad Waleed
full_name: Gondal, Muhammad Waleed
last_name: Gondal
- first_name: Shruti
full_name: Joshi, Shruti
last_name: Joshi
- first_name: Peter
full_name: Gehler, Peter
last_name: Gehler
- first_name: Yoshua
full_name: Bengio, Yoshua
last_name: Bengio
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Bernhard
full_name: Schölkopf, Bernhard
last_name: Schölkopf
citation:
ama: 'Rahaman N, Gondal MW, Joshi S, et al. Dynamic inference with neural interpreters.
In: Advances in Neural Information Processing Systems. Vol 34. ; 2021:10985-10998.'
apa: Rahaman, N., Gondal, M. W., Joshi, S., Gehler, P., Bengio, Y., Locatello, F.,
& Schölkopf, B. (2021). Dynamic inference with neural interpreters. In Advances
in Neural Information Processing Systems (Vol. 34, pp. 10985–10998). Virtual.
chicago: Rahaman, Nasim, Muhammad Waleed Gondal, Shruti Joshi, Peter Gehler, Yoshua
Bengio, Francesco Locatello, and Bernhard Schölkopf. “Dynamic Inference with Neural
Interpreters.” In Advances in Neural Information Processing Systems, 34:10985–98,
2021.
ieee: N. Rahaman et al., “Dynamic inference with neural interpreters,” in
Advances in Neural Information Processing Systems, Virtual, 2021, vol.
34, pp. 10985–10998.
ista: 'Rahaman N, Gondal MW, Joshi S, Gehler P, Bengio Y, Locatello F, Schölkopf
B. 2021. Dynamic inference with neural interpreters. Advances in Neural Information
Processing Systems. NeurIPS: Neural Information Processing Systems vol. 34, 10985–10998.'
mla: Rahaman, Nasim, et al. “Dynamic Inference with Neural Interpreters.” Advances
in Neural Information Processing Systems, vol. 34, 2021, pp. 10985–98.
short: N. Rahaman, M.W. Gondal, S. Joshi, P. Gehler, Y. Bengio, F. Locatello, B.
Schölkopf, in:, Advances in Neural Information Processing Systems, 2021, pp. 10985–10998.
conference:
end_date: 2021-12-10
location: Virtual
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2021-12-07
date_created: 2023-08-22T14:04:55Z
date_published: 2021-10-12T00:00:00Z
date_updated: 2023-09-11T11:33:46Z
day: '12'
department:
- _id: FrLo
extern: '1'
external_id:
arxiv:
- '2110.06399'
intvolume: ' 34'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2110.06399
month: '10'
oa: 1
oa_version: Preprint
page: 10985-10998
publication: Advances in Neural Information Processing Systems
publication_identifier:
isbn:
- '9781713845393'
publication_status: published
quality_controlled: '1'
status: public
title: Dynamic inference with neural interpreters
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2021'
...
---
_id: '14117'
abstract:
- lang: eng
text: 'The two fields of machine learning and graphical causality arose and are
developed separately. However, there is, now, cross-pollination and increasing
interest in both fields to benefit from the advances of the other. In this article,
we review fundamental concepts of causal inference and relate them to crucial
open problems of machine learning, including transfer and generalization, thereby
assaying how causality can contribute to modern machine learning research. This
also applies in the opposite direction: we note that most work in causality starts
from the premise that the causal variables are given. A central problem for AI
and causality is, thus, causal representation learning, that is, the discovery
of high-level causal variables from low-level observations. Finally, we delineate
some implications of causality for machine learning and propose key research areas
at the intersection of both communities.'
article_processing_charge: No
article_type: original
author:
- first_name: Bernhard
full_name: Scholkopf, Bernhard
last_name: Scholkopf
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Stefan
full_name: Bauer, Stefan
last_name: Bauer
- first_name: Nan Rosemary
full_name: Ke, Nan Rosemary
last_name: Ke
- first_name: Nal
full_name: Kalchbrenner, Nal
last_name: Kalchbrenner
- first_name: Anirudh
full_name: Goyal, Anirudh
last_name: Goyal
- first_name: Yoshua
full_name: Bengio, Yoshua
last_name: Bengio
citation:
ama: Scholkopf B, Locatello F, Bauer S, et al. Toward causal representation learning.
Proceedings of the IEEE. 2021;109(5):612-634. doi:10.1109/jproc.2021.3058954
apa: Scholkopf, B., Locatello, F., Bauer, S., Ke, N. R., Kalchbrenner, N., Goyal,
A., & Bengio, Y. (2021). Toward causal representation learning. Proceedings
of the IEEE. Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/jproc.2021.3058954
chicago: Scholkopf, Bernhard, Francesco Locatello, Stefan Bauer, Nan Rosemary Ke,
Nal Kalchbrenner, Anirudh Goyal, and Yoshua Bengio. “Toward Causal Representation
Learning.” Proceedings of the IEEE. Institute of Electrical and Electronics
Engineers, 2021. https://doi.org/10.1109/jproc.2021.3058954.
ieee: B. Scholkopf et al., “Toward causal representation learning,” Proceedings
of the IEEE, vol. 109, no. 5. Institute of Electrical and Electronics Engineers,
pp. 612–634, 2021.
ista: Scholkopf B, Locatello F, Bauer S, Ke NR, Kalchbrenner N, Goyal A, Bengio
Y. 2021. Toward causal representation learning. Proceedings of the IEEE. 109(5),
612–634.
mla: Scholkopf, Bernhard, et al. “Toward Causal Representation Learning.” Proceedings
of the IEEE, vol. 109, no. 5, Institute of Electrical and Electronics Engineers,
2021, pp. 612–34, doi:10.1109/jproc.2021.3058954.
short: B. Scholkopf, F. Locatello, S. Bauer, N.R. Ke, N. Kalchbrenner, A. Goyal,
Y. Bengio, Proceedings of the IEEE 109 (2021) 612–634.
date_created: 2023-08-21T12:19:30Z
date_published: 2021-05-01T00:00:00Z
date_updated: 2023-09-11T11:43:35Z
day: '01'
department:
- _id: FrLo
doi: 10.1109/jproc.2021.3058954
extern: '1'
external_id:
arxiv:
- '2102.11107'
intvolume: ' 109'
issue: '5'
keyword:
- Electrical and Electronic Engineering
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1109/JPROC.2021.3058954
month: '05'
oa: 1
oa_version: Published Version
page: 612-634
publication: Proceedings of the IEEE
publication_identifier:
eissn:
- 1558-2256
issn:
- 0018-9219
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Toward causal representation learning
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 109
year: '2021'
...
---
_id: '14178'
abstract:
- lang: eng
text: Learning meaningful representations that disentangle the underlying structure
of the data generating process is considered to be of key importance in machine
learning. While disentangled representations were found to be useful for diverse
tasks such as abstract reasoning and fair classification, their scalability and
real-world impact remain questionable. We introduce a new high-resolution dataset
with 1M simulated images and over 1,800 annotated real-world images of the same
setup. In contrast to previous work, this new dataset exhibits correlations, a
complex underlying structure, and allows to evaluate transfer to unseen simulated
and real-world settings where the encoder i) remains in distribution or ii) is
out of distribution. We propose new architectures in order to scale disentangled
representation learning to realistic high-resolution settings and conduct a large-scale
empirical study of disentangled representations on this dataset. We observe that
disentanglement is a good predictor for out-of-distribution (OOD) task performance.
article_processing_charge: No
author:
- first_name: Andrea
full_name: Dittadi, Andrea
last_name: Dittadi
- first_name: Frederik
full_name: Träuble, Frederik
last_name: Träuble
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Manuel
full_name: Wüthrich, Manuel
last_name: Wüthrich
- first_name: Vaibhav
full_name: Agrawal, Vaibhav
last_name: Agrawal
- first_name: Ole
full_name: Winther, Ole
last_name: Winther
- first_name: Stefan
full_name: Bauer, Stefan
last_name: Bauer
- first_name: Bernhard
full_name: Schölkopf, Bernhard
last_name: Schölkopf
citation:
ama: 'Dittadi A, Träuble F, Locatello F, et al. On the transfer of disentangled
representations in realistic settings. In: The Ninth International Conference
on Learning Representations. ; 2021.'
apa: Dittadi, A., Träuble, F., Locatello, F., Wüthrich, M., Agrawal, V., Winther,
O., … Schölkopf, B. (2021). On the transfer of disentangled representations in
realistic settings. In The Ninth International Conference on Learning Representations.
Virtual.
chicago: Dittadi, Andrea, Frederik Träuble, Francesco Locatello, Manuel Wüthrich,
Vaibhav Agrawal, Ole Winther, Stefan Bauer, and Bernhard Schölkopf. “On the Transfer
of Disentangled Representations in Realistic Settings.” In The Ninth International
Conference on Learning Representations, 2021.
ieee: A. Dittadi et al., “On the transfer of disentangled representations
in realistic settings,” in The Ninth International Conference on Learning Representations,
Virtual, 2021.
ista: 'Dittadi A, Träuble F, Locatello F, Wüthrich M, Agrawal V, Winther O, Bauer
S, Schölkopf B. 2021. On the transfer of disentangled representations in realistic
settings. The Ninth International Conference on Learning Representations. ICLR:
International Conference on Learning Representations.'
mla: Dittadi, Andrea, et al. “On the Transfer of Disentangled Representations in
Realistic Settings.” The Ninth International Conference on Learning Representations,
2021.
short: A. Dittadi, F. Träuble, F. Locatello, M. Wüthrich, V. Agrawal, O. Winther,
S. Bauer, B. Schölkopf, in:, The Ninth International Conference on Learning Representations,
2021.
conference:
end_date: 2021-05-07
location: Virtual
name: 'ICLR: International Conference on Learning Representations'
start_date: 2021-05-03
date_created: 2023-08-22T14:04:16Z
date_published: 2021-05-04T00:00:00Z
date_updated: 2023-09-11T10:55:30Z
day: '04'
department:
- _id: FrLo
extern: '1'
external_id:
arxiv:
- '2010.14407'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2010.14407
month: '05'
oa: 1
oa_version: Preprint
publication: The Ninth International Conference on Learning Representations
publication_status: published
quality_controlled: '1'
status: public
title: On the transfer of disentangled representations in realistic settings
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '14221'
abstract:
- lang: eng
text: 'The world is structured in countless ways. It may be prudent to enforce corresponding
structural properties to a learning algorithm''s solution, such as incorporating
prior beliefs, natural constraints, or causal structures. Doing so may translate
to faster, more accurate, and more flexible models, which may directly relate
to real-world impact. In this dissertation, we consider two different research
areas that concern structuring a learning algorithm''s solution: when the structure
is known and when it has to be discovered.'
article_number: '2111.13693'
article_processing_charge: No
author:
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
citation:
ama: Locatello F. Enforcing and discovering structure in machine learning. arXiv.
doi:10.48550/arXiv.2111.13693
apa: Locatello, F. (n.d.). Enforcing and discovering structure in machine learning.
arXiv. https://doi.org/10.48550/arXiv.2111.13693
chicago: Locatello, Francesco. “Enforcing and Discovering Structure in Machine Learning.”
ArXiv, n.d. https://doi.org/10.48550/arXiv.2111.13693.
ieee: F. Locatello, “Enforcing and discovering structure in machine learning,” arXiv.
.
ista: Locatello F. Enforcing and discovering structure in machine learning. arXiv,
2111.13693.
mla: Locatello, Francesco. “Enforcing and Discovering Structure in Machine Learning.”
ArXiv, 2111.13693, doi:10.48550/arXiv.2111.13693.
short: F. Locatello, ArXiv (n.d.).
date_created: 2023-08-22T14:23:35Z
date_published: 2021-11-26T00:00:00Z
date_updated: 2023-09-12T07:04:44Z
day: '26'
department:
- _id: FrLo
doi: 10.48550/arXiv.2111.13693
extern: '1'
external_id:
arxiv:
- '2111.13693'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2111.13693
month: '11'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
status: public
title: Enforcing and discovering structure in machine learning
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '14332'
abstract:
- lang: eng
text: Learning data representations that are useful for various downstream tasks
is a cornerstone of artificial intelligence. While existing methods are typically
evaluated on downstream tasks such as classification or generative image quality,
we propose to assess representations through their usefulness in downstream control
tasks, such as reaching or pushing objects. By training over 10,000 reinforcement
learning policies, we extensively evaluate to what extent different representation
properties affect out-of-distribution (OOD) generalization. Finally, we demonstrate
zero-shot transfer of these policies from simulation to the real world, without
any domain randomization or fine-tuning. This paper aims to establish the first
systematic characterization of the usefulness of learned representations for real-world
OOD downstream tasks.
article_processing_charge: No
author:
- first_name: Frederik
full_name: Träuble, Frederik
last_name: Träuble
- first_name: Andrea
full_name: Dittadi, Andrea
last_name: Dittadi
- first_name: Manuel
full_name: Wuthrich, Manuel
last_name: Wuthrich
- first_name: Felix
full_name: Widmaier, Felix
last_name: Widmaier
- first_name: Peter Vincent
full_name: Gehler, Peter Vincent
last_name: Gehler
- first_name: Ole
full_name: Winther, Ole
last_name: Winther
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Olivier
full_name: Bachem, Olivier
last_name: Bachem
- first_name: Bernhard
full_name: Schölkopf, Bernhard
last_name: Schölkopf
- first_name: Stefan
full_name: Bauer, Stefan
last_name: Bauer
citation:
ama: 'Träuble F, Dittadi A, Wuthrich M, et al. Representation learning for out-of-distribution
generalization in reinforcement learning. In: ICML 2021 Workshop on Unsupervised
Reinforcement Learning. ; 2021.'
apa: Träuble, F., Dittadi, A., Wuthrich, M., Widmaier, F., Gehler, P. V., Winther,
O., … Bauer, S. (2021). Representation learning for out-of-distribution generalization
in reinforcement learning. In ICML 2021 Workshop on Unsupervised Reinforcement
Learning. Virtual.
chicago: Träuble, Frederik, Andrea Dittadi, Manuel Wuthrich, Felix Widmaier, Peter
Vincent Gehler, Ole Winther, Francesco Locatello, Olivier Bachem, Bernhard Schölkopf,
and Stefan Bauer. “Representation Learning for Out-of-Distribution Generalization
in Reinforcement Learning.” In ICML 2021 Workshop on Unsupervised Reinforcement
Learning, 2021.
ieee: F. Träuble et al., “Representation learning for out-of-distribution
generalization in reinforcement learning,” in ICML 2021 Workshop on Unsupervised
Reinforcement Learning, Virtual, 2021.
ista: 'Träuble F, Dittadi A, Wuthrich M, Widmaier F, Gehler PV, Winther O, Locatello
F, Bachem O, Schölkopf B, Bauer S. 2021. Representation learning for out-of-distribution
generalization in reinforcement learning. ICML 2021 Workshop on Unsupervised Reinforcement
Learning. ICML: International Conference on Machine Learning.'
mla: Träuble, Frederik, et al. “Representation Learning for Out-of-Distribution
Generalization in Reinforcement Learning.” ICML 2021 Workshop on Unsupervised
Reinforcement Learning, 2021.
short: F. Träuble, A. Dittadi, M. Wuthrich, F. Widmaier, P.V. Gehler, O. Winther,
F. Locatello, O. Bachem, B. Schölkopf, S. Bauer, in:, ICML 2021 Workshop on Unsupervised
Reinforcement Learning, 2021.
conference:
end_date: 2021-07-23
location: Virtual
name: 'ICML: International Conference on Machine Learning'
start_date: 2021-07-23
date_created: 2023-09-13T12:43:14Z
date_published: 2021-07-23T00:00:00Z
date_updated: 2023-09-13T12:44:00Z
day: '23'
department:
- _id: FrLo
extern: '1'
language:
- iso: eng
month: '07'
oa_version: None
publication: ICML 2021 Workshop on Unsupervised Reinforcement Learning
publication_status: published
quality_controlled: '1'
status: public
title: Representation learning for out-of-distribution generalization in reinforcement
learning
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '14278'
abstract:
- lang: eng
text: 'The Birkhoff conjecture says that the boundary of a strictly convex integrable
billiard table is necessarily an ellipse. In this article, we consider a stronger
notion of integrability, namely, integrability close to the boundary, and prove
a local version of this conjecture: a small perturbation of almost every ellipse
that preserves integrability near the boundary, is itself an ellipse. We apply
this result to study local spectral rigidity of ellipses using the connection
between the wave trace of the Laplacian and the dynamics near the boundary and
establish rigidity for almost all of them.'
article_number: '2111.12171'
article_processing_charge: No
author:
- first_name: Illya
full_name: Koval, Illya
id: 2eed1f3b-896a-11ed-bdf8-93c7c4bf159e
last_name: Koval
citation:
ama: Koval I. Local strong Birkhoff conjecture and local spectral rigidity of almost
every ellipse. arXiv. doi:10.48550/ARXIV.2111.12171
apa: Koval, I. (n.d.). Local strong Birkhoff conjecture and local spectral rigidity
of almost every ellipse. arXiv. https://doi.org/10.48550/ARXIV.2111.12171
chicago: Koval, Illya. “Local Strong Birkhoff Conjecture and Local Spectral Rigidity
of Almost Every Ellipse.” ArXiv, n.d. https://doi.org/10.48550/ARXIV.2111.12171.
ieee: I. Koval, “Local strong Birkhoff conjecture and local spectral rigidity of
almost every ellipse,” arXiv. .
ista: Koval I. Local strong Birkhoff conjecture and local spectral rigidity of almost
every ellipse. arXiv, 2111.12171.
mla: Koval, Illya. “Local Strong Birkhoff Conjecture and Local Spectral Rigidity
of Almost Every Ellipse.” ArXiv, 2111.12171, doi:10.48550/ARXIV.2111.12171.
short: I. Koval, ArXiv (n.d.).
date_created: 2023-09-06T08:35:43Z
date_published: 2021-11-23T00:00:00Z
date_updated: 2023-09-15T06:44:00Z
day: '23'
department:
- _id: GradSch
doi: 10.48550/ARXIV.2111.12171
external_id:
arxiv:
- '2111.12171'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2111.12171
month: '11'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
status: public
title: Local strong Birkhoff conjecture and local spectral rigidity of almost every
ellipse
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10199'
abstract:
- lang: eng
text: The design and verification of concurrent systems remains an open challenge
due to the non-determinism that arises from the inter-process communication. In
particular, concurrent programs are notoriously difficult both to be written correctly
and to be analyzed formally, as complex thread interaction has to be accounted
for. The difficulties are further exacerbated when concurrent programs get executed
on modern-day hardware, which contains various buffering and caching mechanisms
for efficiency reasons. This causes further subtle non-determinism, which can
often produce very unintuitive behavior of the concurrent programs. Model checking
is at the forefront of tackling the verification problem, where the task is to
decide, given as input a concurrent system and a desired property, whether the
system satisfies the property. The inherent state-space explosion problem in model
checking of concurrent systems causes naïve explicit methods not to scale, thus
more inventive methods are required. One such method is stateless model checking
(SMC), which explores in memory-efficient manner the program executions rather
than the states of the program. State-of-the-art SMC is typically coupled with
partial order reduction (POR) techniques, which argue that certain executions
provably produce identical system behavior, thus limiting the amount of executions
one needs to explore in order to cover all possible behaviors. Another method
to tackle the state-space explosion is symbolic model checking, where the considered
techniques operate on a succinct implicit representation of the input system rather
than explicitly accessing the system. In this thesis we present new techniques
for verification of concurrent systems. We present several novel POR methods for
SMC of concurrent programs under various models of semantics, some of which account
for write-buffering mechanisms. Additionally, we present novel algorithms for
symbolic model checking of finite-state concurrent systems, where the desired
property of the systems is to ensure a formally defined notion of fairness.
acknowledged_ssus:
- _id: SSU
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Viktor
full_name: Toman, Viktor
id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87
last_name: Toman
orcid: 0000-0001-9036-063X
citation:
ama: Toman V. Improved verification techniques for concurrent systems. 2021. doi:10.15479/at:ista:10199
apa: Toman, V. (2021). Improved verification techniques for concurrent systems.
Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10199
chicago: Toman, Viktor. “Improved Verification Techniques for Concurrent Systems.”
Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10199.
ieee: V. Toman, “Improved verification techniques for concurrent systems,” Institute
of Science and Technology Austria, 2021.
ista: Toman V. 2021. Improved verification techniques for concurrent systems. Institute
of Science and Technology Austria.
mla: Toman, Viktor. Improved Verification Techniques for Concurrent Systems.
Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10199.
short: V. Toman, Improved Verification Techniques for Concurrent Systems, Institute
of Science and Technology Austria, 2021.
date_created: 2021-10-29T20:09:01Z
date_published: 2021-10-31T00:00:00Z
date_updated: 2023-09-19T09:59:54Z
day: '31'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: GradSch
- _id: KrCh
doi: 10.15479/at:ista:10199
ec_funded: 1
file:
- access_level: open_access
checksum: 4f412a1ee60952221b499a4b1268df35
content_type: application/pdf
creator: vtoman
date_created: 2021-11-08T14:12:22Z
date_updated: 2021-11-08T14:12:22Z
file_id: '10225'
file_name: toman_th_final.pdf
file_size: 2915234
relation: main_file
- access_level: closed
checksum: 9584943f99127be2dd2963f6784c37d4
content_type: application/zip
creator: vtoman
date_created: 2021-11-08T14:12:46Z
date_updated: 2021-11-09T09:00:50Z
file_id: '10226'
file_name: toman_thesis.zip
file_size: 8616056
relation: source_file
file_date_updated: 2021-11-09T09:00:50Z
has_accepted_license: '1'
keyword:
- concurrency
- verification
- model checking
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: '166'
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '10190'
relation: part_of_dissertation
status: public
- id: '10191'
relation: part_of_dissertation
status: public
- id: '9987'
relation: part_of_dissertation
status: public
- id: '141'
relation: part_of_dissertation
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: Improved verification techniques for concurrent systems
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2021'
...
---
_id: '8429'
abstract:
- lang: eng
text: We develop a Bayesian model (BayesRR-RC) that provides robust SNP-heritability
estimation, an alternative to marker discovery, and accurate genomic prediction,
taking 22 seconds per iteration to estimate 8.4 million SNP-effects and 78 SNP-heritability
parameters in the UK Biobank. We find that only ≤10% of the genetic variation
captured for height, body mass index, cardiovascular disease, and type 2 diabetes
is attributable to proximal regulatory regions within 10kb upstream of genes,
while 12-25% is attributed to coding regions, 32–44% to introns, and 22-28% to
distal 10-500kb upstream regions. Up to 24% of all cis and coding regions of each
chromosome are associated with each trait, with over 3,100 independent exonic
and intronic regions and over 5,400 independent regulatory regions having ≥95%
probability of contributing ≥0.001% to the genetic variance of these four traits.
Our open-source software (GMRM) provides a scalable alternative to current approaches
for biobank data.
acknowledgement: This project was funded by an SNSF Eccellenza Grant to MRR (PCEGP3-181181),
and by core funding from the Institute of Science and Technology Austria. We would
like to thank the participants of the cohort studies, and the Ecole Polytechnique
Federal Lausanne (EPFL) SCITAS for their excellent compute resources, their generosity
with their time and the kindness of their support. P.M.V. acknowledges funding from
the Australian National Health and Medical Research Council (1113400) and the Australian
Research Council (FL180100072). L.R. acknowledges funding from the Kjell & Märta
Beijer Foundation (Stockholm, Sweden). We also would like to acknowledge Simone
Rubinacci, Oliver Delanau, Alexander Terenin, Eleonora Porcu, and Mike Goddard for
their useful comments and suggestions.
article_number: '6972'
article_processing_charge: No
article_type: original
author:
- first_name: Marion
full_name: Patxot, Marion
last_name: Patxot
- first_name: Daniel
full_name: Trejo Banos, Daniel
last_name: Trejo Banos
- first_name: Athanasios
full_name: Kousathanas, Athanasios
last_name: Kousathanas
- first_name: Etienne J
full_name: Orliac, Etienne J
last_name: Orliac
- first_name: Sven E
full_name: Ojavee, Sven E
last_name: Ojavee
- first_name: Gerhard
full_name: Moser, Gerhard
last_name: Moser
- first_name: Julia
full_name: Sidorenko, Julia
last_name: Sidorenko
- first_name: Zoltan
full_name: Kutalik, Zoltan
last_name: Kutalik
- first_name: Reedik
full_name: Magi, Reedik
last_name: Magi
- first_name: Peter M
full_name: Visscher, Peter M
last_name: Visscher
- first_name: Lars
full_name: Ronnegard, Lars
last_name: Ronnegard
- first_name: Matthew Richard
full_name: Robinson, Matthew Richard
id: E5D42276-F5DA-11E9-8E24-6303E6697425
last_name: Robinson
orcid: 0000-0001-8982-8813
citation:
ama: Patxot M, Trejo Banos D, Kousathanas A, et al. Probabilistic inference of the
genetic architecture underlying functional enrichment of complex traits. Nature
Communications. 2021;12(1). doi:10.1038/s41467-021-27258-9
apa: Patxot, M., Trejo Banos, D., Kousathanas, A., Orliac, E. J., Ojavee, S. E.,
Moser, G., … Robinson, M. R. (2021). Probabilistic inference of the genetic architecture
underlying functional enrichment of complex traits. Nature Communications.
Springer Nature. https://doi.org/10.1038/s41467-021-27258-9
chicago: Patxot, Marion, Daniel Trejo Banos, Athanasios Kousathanas, Etienne J Orliac,
Sven E Ojavee, Gerhard Moser, Julia Sidorenko, et al. “Probabilistic Inference
of the Genetic Architecture Underlying Functional Enrichment of Complex Traits.”
Nature Communications. Springer Nature, 2021. https://doi.org/10.1038/s41467-021-27258-9.
ieee: M. Patxot et al., “Probabilistic inference of the genetic architecture
underlying functional enrichment of complex traits,” Nature Communications,
vol. 12, no. 1. Springer Nature, 2021.
ista: Patxot M, Trejo Banos D, Kousathanas A, Orliac EJ, Ojavee SE, Moser G, Sidorenko
J, Kutalik Z, Magi R, Visscher PM, Ronnegard L, Robinson MR. 2021. Probabilistic
inference of the genetic architecture underlying functional enrichment of complex
traits. Nature Communications. 12(1), 6972.
mla: Patxot, Marion, et al. “Probabilistic Inference of the Genetic Architecture
Underlying Functional Enrichment of Complex Traits.” Nature Communications,
vol. 12, no. 1, 6972, Springer Nature, 2021, doi:10.1038/s41467-021-27258-9.
short: M. Patxot, D. Trejo Banos, A. Kousathanas, E.J. Orliac, S.E. Ojavee, G. Moser,
J. Sidorenko, Z. Kutalik, R. Magi, P.M. Visscher, L. Ronnegard, M.R. Robinson,
Nature Communications 12 (2021).
date_created: 2020-09-17T10:52:38Z
date_published: 2021-11-30T00:00:00Z
date_updated: 2023-09-26T10:36:14Z
day: '30'
ddc:
- '610'
department:
- _id: MaRo
doi: 10.1038/s41467-021-27258-9
external_id:
isi:
- '000724450600023'
file:
- access_level: open_access
checksum: 384681be17aff902c149a48f52d13d4f
content_type: application/pdf
creator: cchlebak
date_created: 2021-12-06T07:47:11Z
date_updated: 2021-12-06T07:47:11Z
file_id: '10419'
file_name: 2021_NatComm_Paxtot.pdf
file_size: 6519771
relation: main_file
success: 1
file_date_updated: 2021-12-06T07:47:11Z
has_accepted_license: '1'
intvolume: ' 12'
isi: 1
issue: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
publication: Nature Communications
publication_identifier:
eissn:
- 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '13063'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Probabilistic inference of the genetic architecture underlying functional enrichment
of complex traits
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: 12
year: '2021'
...
---
_id: '10854'
abstract:
- lang: eng
text: "Consider a distributed task where the communication network is fixed but
the local inputs given to the nodes of the distributed system may change over
time. In this work, we explore the following question: if some of the local inputs
change, can an existing solution be updated efficiently, in a dynamic and distributed
manner?\r\nTo address this question, we define the batch dynamic CONGEST model
in which we are given a bandwidth-limited communication network and a dynamic
edge labelling defines the problem input. The task is to maintain a solution to
a graph problem on the labelled graph under batch changes. We investigate, when
a batch of alpha edge label changes arrive, - how much time as a function of alpha
we need to update an existing solution, and - how much information the nodes have
to keep in local memory between batches in order to update the solution quickly.\r\nOur
work lays the foundations for the theory of input-dynamic distributed network
algorithms. We give a general picture of the complexity landscape in this model,
design both universal algorithms and algorithms for concrete problems, and present
a general framework for lower bounds. The diverse time complexity of our model
spans from constant time, through time polynomial in alpha, and to alpha time,
which we show to be enough for any task."
acknowledgement: We thank Jukka Suomela for discussions. We also thank our shepherd
Mohammad Hajiesmaili and the reviewers for their time and suggestions on how to
improve the paper. This project has received funding from the European Research
Council (ERC) under the European Union’s Horizon 2020 research and innovation programme
(grant agreement No 805223 ScaleML), from the European Union’s Horizon 2020 research
and innovation programme under the Marie Skłodowska–Curie grant agreement No. 840605,
from the Vienna Science and Technology Fund (WWTF) project WHATIF, ICT19-045, 2020-2024,
and from the Austrian Science Fund (FWF) and netIDEE SCIENCE project P 33775-N.
article_processing_charge: No
author:
- first_name: Klaus-Tycho
full_name: Foerster, Klaus-Tycho
last_name: Foerster
- first_name: Janne
full_name: Korhonen, Janne
id: C5402D42-15BC-11E9-A202-CA2BE6697425
last_name: Korhonen
- first_name: Ami
full_name: Paz, Ami
last_name: Paz
- first_name: Joel
full_name: Rybicki, Joel
id: 334EFD2E-F248-11E8-B48F-1D18A9856A87
last_name: Rybicki
orcid: 0000-0002-6432-6646
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed
algorithms for communication networks. In: Abstract Proceedings of the 2021
ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer
Systems. Association for Computing Machinery; 2021:71-72. doi:10.1145/3410220.3453923'
apa: 'Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., & Schmid, S. (2021).
Input-dynamic distributed algorithms for communication networks. In Abstract
Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement
and Modeling of Computer Systems (pp. 71–72). Virtual, Online: Association
for Computing Machinery. https://doi.org/10.1145/3410220.3453923'
chicago: Foerster, Klaus-Tycho, Janne Korhonen, Ami Paz, Joel Rybicki, and Stefan
Schmid. “Input-Dynamic Distributed Algorithms for Communication Networks.” In
Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference
on Measurement and Modeling of Computer Systems, 71–72. Association for Computing
Machinery, 2021. https://doi.org/10.1145/3410220.3453923.
ieee: K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic
distributed algorithms for communication networks,” in Abstract Proceedings
of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling
of Computer Systems, Virtual, Online, 2021, pp. 71–72.
ista: 'Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. 2021. Input-dynamic
distributed algorithms for communication networks. Abstract Proceedings of the
2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of
Computer Systems. SIGMETRICS: International Conference on Measurement and Modeling
of Computer Systems, 71–72.'
mla: Foerster, Klaus-Tycho, et al. “Input-Dynamic Distributed Algorithms for Communication
Networks.” Abstract Proceedings of the 2021 ACM SIGMETRICS / International
Conference on Measurement and Modeling of Computer Systems, Association for
Computing Machinery, 2021, pp. 71–72, doi:10.1145/3410220.3453923.
short: K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, in:, Abstract
Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement
and Modeling of Computer Systems, Association for Computing Machinery, 2021, pp.
71–72.
conference:
end_date: 2021-06-18
location: Virtual, Online
name: 'SIGMETRICS: International Conference on Measurement and Modeling of Computer
Systems'
start_date: 2021-06-14
date_created: 2022-03-18T08:48:41Z
date_published: 2021-05-01T00:00:00Z
date_updated: 2023-09-26T10:40:55Z
day: '01'
department:
- _id: DaAl
doi: 10.1145/3410220.3453923
ec_funded: 1
external_id:
arxiv:
- '2005.07637'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2005.07637
month: '05'
oa: 1
oa_version: Preprint
page: 71-72
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
- _id: 26A5D39A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '840605'
name: Coordination in constrained and natural distributed systems
publication: Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference
on Measurement and Modeling of Computer Systems
publication_identifier:
isbn:
- '9781450380720'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '10855'
relation: extended_version
status: public
scopus_import: '1'
status: public
title: Input-dynamic distributed algorithms for communication networks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10855'
abstract:
- lang: eng
text: 'Consider a distributed task where the communication network is fixed but
the local inputs given to the nodes of the distributed system may change over
time. In this work, we explore the following question: if some of the local inputs
change, can an existing solution be updated efficiently, in a dynamic and distributed
manner? To address this question, we define the batch dynamic \congest model in
which we are given a bandwidth-limited communication network and a dynamic edge
labelling defines the problem input. The task is to maintain a solution to a graph
problem on the labeled graph under batch changes. We investigate, when a batch
of α edge label changes arrive, \beginitemize \item how much time as a function
of α we need to update an existing solution, and \item how much information the
nodes have to keep in local memory between batches in order to update the solution
quickly. \enditemize Our work lays the foundations for the theory of input-dynamic
distributed network algorithms. We give a general picture of the complexity landscape
in this model, design both universal algorithms and algorithms for concrete problems,
and present a general framework for lower bounds. In particular, we derive non-trivial
upper bounds for two selected, contrasting problems: maintaining a minimum spanning
tree and detecting cliques.'
acknowledgement: "We thank Jukka Suomela for discussions. We also thank our shepherd
Mohammad Hajiesmaili\r\nand the reviewers for their time and suggestions on how
to improve the paper. This project\r\nhas received funding from the European Research
Council (ERC) under the European Union’s\r\nHorizon 2020 research and innovation
programme (grant agreement No 805223 ScaleML), from the European Union’s Horizon
2020 research and innovation programme under the Marie\r\nSk lodowska–Curie grant
agreement No. 840605, from the Vienna Science and Technology Fund (WWTF) project
WHATIF, ICT19-045, 2020-2024, and from the Austrian Science Fund (FWF) and netIDEE
SCIENCE project P 33775-N."
article_processing_charge: No
article_type: original
author:
- first_name: Klaus-Tycho
full_name: Foerster, Klaus-Tycho
last_name: Foerster
- first_name: Janne
full_name: Korhonen, Janne
id: C5402D42-15BC-11E9-A202-CA2BE6697425
last_name: Korhonen
- first_name: Ami
full_name: Paz, Ami
last_name: Paz
- first_name: Joel
full_name: Rybicki, Joel
id: 334EFD2E-F248-11E8-B48F-1D18A9856A87
last_name: Rybicki
orcid: 0000-0002-6432-6646
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. Input-dynamic distributed
algorithms for communication networks. Proceedings of the ACM on Measurement
and Analysis of Computing Systems. 2021;5(1):1-33. doi:10.1145/3447384
apa: Foerster, K.-T., Korhonen, J., Paz, A., Rybicki, J., & Schmid, S. (2021).
Input-dynamic distributed algorithms for communication networks. Proceedings
of the ACM on Measurement and Analysis of Computing Systems. Association for
Computing Machinery. https://doi.org/10.1145/3447384
chicago: Foerster, Klaus-Tycho, Janne Korhonen, Ami Paz, Joel Rybicki, and Stefan
Schmid. “Input-Dynamic Distributed Algorithms for Communication Networks.” Proceedings
of the ACM on Measurement and Analysis of Computing Systems. Association for
Computing Machinery, 2021. https://doi.org/10.1145/3447384.
ieee: K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, and S. Schmid, “Input-dynamic
distributed algorithms for communication networks,” Proceedings of the ACM
on Measurement and Analysis of Computing Systems, vol. 5, no. 1. Association
for Computing Machinery, pp. 1–33, 2021.
ista: Foerster K-T, Korhonen J, Paz A, Rybicki J, Schmid S. 2021. Input-dynamic
distributed algorithms for communication networks. Proceedings of the ACM on Measurement
and Analysis of Computing Systems. 5(1), 1–33.
mla: Foerster, Klaus-Tycho, et al. “Input-Dynamic Distributed Algorithms for Communication
Networks.” Proceedings of the ACM on Measurement and Analysis of Computing
Systems, vol. 5, no. 1, Association for Computing Machinery, 2021, pp. 1–33,
doi:10.1145/3447384.
short: K.-T. Foerster, J. Korhonen, A. Paz, J. Rybicki, S. Schmid, Proceedings of
the ACM on Measurement and Analysis of Computing Systems 5 (2021) 1–33.
date_created: 2022-03-18T09:10:27Z
date_published: 2021-03-01T00:00:00Z
date_updated: 2023-09-26T10:40:55Z
day: '01'
department:
- _id: DaAl
doi: 10.1145/3447384
ec_funded: 1
external_id:
arxiv:
- '2005.07637'
intvolume: ' 5'
issue: '1'
keyword:
- Computer Networks and Communications
- Hardware and Architecture
- Safety
- Risk
- Reliability and Quality
- Computer Science (miscellaneous)
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2005.07637
month: '03'
oa: 1
oa_version: Preprint
page: 1-33
project:
- _id: 26A5D39A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '840605'
name: Coordination in constrained and natural distributed systems
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: Proceedings of the ACM on Measurement and Analysis of Computing Systems
publication_identifier:
issn:
- 2476-1249
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '10854'
relation: shorter_version
status: public
scopus_import: '1'
status: public
title: Input-dynamic distributed algorithms for communication networks
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2021'
...
---
_id: '9293'
abstract:
- lang: eng
text: 'We consider planning problems for graphs, Markov Decision Processes (MDPs),
and games on graphs in an explicit state space. While graphs represent the most
basic planning model, MDPs represent interaction with nature and games on graphs
represent interaction with an adversarial environment. We consider two planning
problems with k different target sets: (a) the coverage problem asks whether there
is a plan for each individual target set; and (b) the sequential target reachability
problem asks whether the targets can be reached in a given sequence. For the coverage
problem, we present a linear-time algorithm for graphs, and quadratic conditional
lower bound for MDPs and games on graphs. For the sequential target problem, we
present a linear-time algorithm for graphs, a sub-quadratic algorithm for MDPs,
and a quadratic conditional lower bound for games on graphs. Our results with
conditional lower bounds, based on the boolean matrix multiplication (BMM) conjecture
and strong exponential time hypothesis (SETH), establish (i) model-separation
results showing that for the coverage problem MDPs and games on graphs are harder
than graphs, and for the sequential reachability problem games on graphs are harder
than MDPs and graphs; and (ii) problem-separation results showing that for MDPs
the coverage problem is harder than the sequential target problem.'
article_number: '103499'
article_processing_charge: No
article_type: original
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Wolfgang
full_name: Dvořák, Wolfgang
last_name: Dvořák
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Alexander
full_name: Svozil, Alexander
last_name: Svozil
citation:
ama: Chatterjee K, Dvořák W, Henzinger MH, Svozil A. Algorithms and conditional
lower bounds for planning problems. Artificial Intelligence. 2021;297(8).
doi:10.1016/j.artint.2021.103499
apa: Chatterjee, K., Dvořák, W., Henzinger, M. H., & Svozil, A. (2021). Algorithms
and conditional lower bounds for planning problems. Artificial Intelligence.
Elsevier. https://doi.org/10.1016/j.artint.2021.103499
chicago: Chatterjee, Krishnendu, Wolfgang Dvořák, Monika H Henzinger, and Alexander
Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.” Artificial
Intelligence. Elsevier, 2021. https://doi.org/10.1016/j.artint.2021.103499.
ieee: K. Chatterjee, W. Dvořák, M. H. Henzinger, and A. Svozil, “Algorithms and
conditional lower bounds for planning problems,” Artificial Intelligence,
vol. 297, no. 8. Elsevier, 2021.
ista: Chatterjee K, Dvořák W, Henzinger MH, Svozil A. 2021. Algorithms and conditional
lower bounds for planning problems. Artificial Intelligence. 297(8), 103499.
mla: Chatterjee, Krishnendu, et al. “Algorithms and Conditional Lower Bounds for
Planning Problems.” Artificial Intelligence, vol. 297, no. 8, 103499, Elsevier,
2021, doi:10.1016/j.artint.2021.103499.
short: K. Chatterjee, W. Dvořák, M.H. Henzinger, A. Svozil, Artificial Intelligence
297 (2021).
date_created: 2021-03-28T22:01:40Z
date_published: 2021-03-16T00:00:00Z
date_updated: 2023-09-26T10:41:42Z
day: '16'
department:
- _id: KrCh
doi: 10.1016/j.artint.2021.103499
external_id:
arxiv:
- '1804.07031'
isi:
- '000657537500003'
intvolume: ' 297'
isi: 1
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.07031
month: '03'
oa: 1
oa_version: Preprint
publication: Artificial Intelligence
publication_identifier:
issn:
- 0004-3702
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
record:
- id: '35'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Algorithms and conditional lower bounds for planning problems
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 297
year: '2021'
...
---
_id: '13063'
abstract:
- lang: eng
text: We develop a Bayesian model (BayesRR-RC) that provides robust SNP-heritability
estimation, an alternative to marker discovery, and accurate genomic prediction,
taking 22 seconds per iteration to estimate 8.4 million SNP-effects and 78 SNP-heritability
parameters in the UK Biobank. We find that only $\leq$ 10\% of the genetic variation
captured for height, body mass index, cardiovascular disease, and type 2 diabetes
is attributable to proximal regulatory regions within 10kb upstream of genes,
while 12-25% is attributed to coding regions, 32-44% to introns, and 22-28% to
distal 10-500kb upstream regions. Up to 24% of all cis and coding regions of each
chromosome are associated with each trait, with over 3,100 independent exonic
and intronic regions and over 5,400 independent regulatory regions having >95%
probability of contributing >0.001% to the genetic variance of these four traits.
Our open-source software (GMRM) provides a scalable alternative to current approaches
for biobank data.
article_processing_charge: No
author:
- first_name: Matthew Richard
full_name: Robinson, Matthew Richard
id: E5D42276-F5DA-11E9-8E24-6303E6697425
last_name: Robinson
orcid: 0000-0001-8982-8813
citation:
ama: Robinson MR. Probabilistic inference of the genetic architecture of functional
enrichment of complex traits. 2021. doi:10.5061/dryad.sqv9s4n51
apa: Robinson, M. R. (2021). Probabilistic inference of the genetic architecture
of functional enrichment of complex traits. Dryad. https://doi.org/10.5061/dryad.sqv9s4n51
chicago: Robinson, Matthew Richard. “Probabilistic Inference of the Genetic Architecture
of Functional Enrichment of Complex Traits.” Dryad, 2021. https://doi.org/10.5061/dryad.sqv9s4n51.
ieee: M. R. Robinson, “Probabilistic inference of the genetic architecture of functional
enrichment of complex traits.” Dryad, 2021.
ista: Robinson MR. 2021. Probabilistic inference of the genetic architecture of
functional enrichment of complex traits, Dryad, 10.5061/dryad.sqv9s4n51.
mla: Robinson, Matthew Richard. Probabilistic Inference of the Genetic Architecture
of Functional Enrichment of Complex Traits. Dryad, 2021, doi:10.5061/dryad.sqv9s4n51.
short: M.R. Robinson, (2021).
date_created: 2023-05-23T16:20:16Z
date_published: 2021-11-04T00:00:00Z
date_updated: 2023-09-26T10:36:15Z
day: '04'
ddc:
- '570'
department:
- _id: MaRo
doi: 10.5061/dryad.sqv9s4n51
license: https://creativecommons.org/publicdomain/zero/1.0/
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.sqv9s4n51
month: '11'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
link:
- relation: software
url: https://github.com/medical-genomics-group/gmrm
record:
- id: '8429'
relation: used_in_publication
status: public
status: public
title: Probabilistic inference of the genetic architecture of functional enrichment
of complex traits
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '9304'
abstract:
- lang: eng
text: The high processing cost, poor mechanical properties and moderate performance
of Bi2Te3–based alloys used in thermoelectric devices limit the cost-effectiveness
of this energy conversion technology. Towards solving these current challenges,
in the present work, we detail a low temperature solution-based approach to produce
Bi2Te3-Cu2-xTe nanocomposites with improved thermoelectric performance. Our approach
consists in combining proper ratios of colloidal nanoparticles and to consolidate
the resulting mixture into nanocomposites using a hot press. The transport properties
of the nanocomposites are characterized and compared with those of pure Bi2Te3
nanomaterials obtained following the same procedure. In contrast with most previous
works, the presence of Cu2-xTe nanodomains does not result in a significant reduction
of the lattice thermal conductivity of the reference Bi2Te3 nanomaterial, which
is already very low. However, the introduction of Cu2-xTe yields a nearly threefold
increase of the power factor associated to a simultaneous increase of the Seebeck
coefficient and electrical conductivity at temperatures above 400 K. Taking into
account the band alignment of the two materials, we rationalize this increase
by considering that Cu2-xTe nanostructures, with a relatively low electron affinity,
are able to inject electrons into Bi2Te3, enhancing in this way its electrical
conductivity. The simultaneous increase of the Seebeck coefficient is related
to the energy filtering of charge carriers at energy barriers within Bi2Te3 domains
associated with the accumulation of electrons in regions nearby a Cu2-xTe/Bi2Te3
heterojunction. Overall, with the incorporation of a proper amount of Cu2-xTe
nanoparticles, we demonstrate a 250% improvement of the thermoelectric figure
of merit of Bi2Te3.
acknowledgement: "This work was supported by the European Regional Development Funds
and by the Generalitat de Catalunya through the project 2017SGR1246. Y.Z, C.X, M.L,
K.X and X.H thank the China Scholarship Council for the scholarship support. MI
acknowledges financial support from IST Austria. YL acknowledges funding from the
European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie
grant agreement No. 754411. ICN2\r\nacknowledges funding from Generalitat de Catalunya
2017 SGR 327 and the Spanish MINECO project ENE2017-85087-C3. ICN2 is supported
by the Severo Ochoa program from the Spanish MINECO (grant no. SEV-2017-0706) and
is funded by the CERCA Program/Generalitat de Catalunya. Part of the present work
has been performed in the framework of Universitat Autònoma de Barcelona Materials
Science PhD program."
article_number: '129374'
article_processing_charge: No
article_type: original
author:
- first_name: Yu
full_name: Zhang, Yu
last_name: Zhang
- first_name: Congcong
full_name: Xing, Congcong
last_name: Xing
- first_name: Yu
full_name: Liu, Yu
id: 2A70014E-F248-11E8-B48F-1D18A9856A87
last_name: Liu
orcid: 0000-0001-7313-6740
- first_name: Mengyao
full_name: Li, Mengyao
last_name: Li
- first_name: Ke
full_name: Xiao, Ke
last_name: Xiao
- first_name: Pablo
full_name: Guardia, Pablo
last_name: Guardia
- first_name: Seungho
full_name: Lee, Seungho
id: BB243B88-D767-11E9-B658-BC13E6697425
last_name: Lee
orcid: 0000-0002-6962-8598
- first_name: Xu
full_name: Han, Xu
last_name: Han
- first_name: Ahmad
full_name: Moghaddam, Ahmad
last_name: Moghaddam
- first_name: Joan J
full_name: Roa, Joan J
last_name: Roa
- first_name: Jordi
full_name: Arbiol, Jordi
last_name: Arbiol
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
- first_name: Kai
full_name: Pan, Kai
last_name: Pan
- first_name: Mirko
full_name: Prato, Mirko
last_name: Prato
- first_name: Ying
full_name: Xie, Ying
last_name: Xie
- first_name: Andreu
full_name: Cabot, Andreu
last_name: Cabot
citation:
ama: Zhang Y, Xing C, Liu Y, et al. Influence of copper telluride nanodomains on
the transport properties of n-type bismuth telluride. Chemical Engineering
Journal. 2021;418(8). doi:10.1016/j.cej.2021.129374
apa: Zhang, Y., Xing, C., Liu, Y., Li, M., Xiao, K., Guardia, P., … Cabot, A. (2021).
Influence of copper telluride nanodomains on the transport properties of n-type
bismuth telluride. Chemical Engineering Journal. Elsevier. https://doi.org/10.1016/j.cej.2021.129374
chicago: Zhang, Yu, Congcong Xing, Yu Liu, Mengyao Li, Ke Xiao, Pablo Guardia, Seungho
Lee, et al. “Influence of Copper Telluride Nanodomains on the Transport Properties
of N-Type Bismuth Telluride.” Chemical Engineering Journal. Elsevier, 2021.
https://doi.org/10.1016/j.cej.2021.129374.
ieee: Y. Zhang et al., “Influence of copper telluride nanodomains on the
transport properties of n-type bismuth telluride,” Chemical Engineering Journal,
vol. 418, no. 8. Elsevier, 2021.
ista: Zhang Y, Xing C, Liu Y, Li M, Xiao K, Guardia P, Lee S, Han X, Moghaddam A,
Roa JJ, Arbiol J, Ibáñez M, Pan K, Prato M, Xie Y, Cabot A. 2021. Influence of
copper telluride nanodomains on the transport properties of n-type bismuth telluride.
Chemical Engineering Journal. 418(8), 129374.
mla: Zhang, Yu, et al. “Influence of Copper Telluride Nanodomains on the Transport
Properties of N-Type Bismuth Telluride.” Chemical Engineering Journal,
vol. 418, no. 8, 129374, Elsevier, 2021, doi:10.1016/j.cej.2021.129374.
short: Y. Zhang, C. Xing, Y. Liu, M. Li, K. Xiao, P. Guardia, S. Lee, X. Han, A.
Moghaddam, J.J. Roa, J. Arbiol, M. Ibáñez, K. Pan, M. Prato, Y. Xie, A. Cabot,
Chemical Engineering Journal 418 (2021).
date_created: 2021-04-04T22:01:20Z
date_published: 2021-08-15T00:00:00Z
date_updated: 2023-09-27T07:36:29Z
day: '15'
department:
- _id: MaIb
doi: 10.1016/j.cej.2021.129374
ec_funded: 1
external_id:
isi:
- '000655672000005'
intvolume: ' 418'
isi: 1
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://ddd.uab.cat/record/271949
month: '08'
oa: 1
oa_version: Submitted Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Chemical Engineering Journal
publication_identifier:
issn:
- 1385-8947
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Influence of copper telluride nanodomains on the transport properties of n-type
bismuth telluride
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 418
year: '2021'
...
---
_id: '9793'
abstract:
- lang: eng
text: Astrocytes extensively infiltrate the neuropil to regulate critical aspects
of synaptic development and function. This process is regulated by transcellular
interactions between astrocytes and neurons via cell adhesion molecules. How astrocytes
coordinate developmental processes among one another to parse out the synaptic
neuropil and form non-overlapping territories is unknown. Here we identify a molecular
mechanism regulating astrocyte-astrocyte interactions during development to coordinate
astrocyte morphogenesis and gap junction coupling. We show that hepaCAM, a disease-linked,
astrocyte-enriched cell adhesion molecule, regulates astrocyte competition for
territory and morphological complexity in the developing mouse cortex. Furthermore,
conditional deletion of Hepacam from developing astrocytes significantly impairs
gap junction coupling between astrocytes and disrupts the balance between synaptic
excitation and inhibition. Mutations in HEPACAM cause megalencephalic leukoencephalopathy
with subcortical cysts in humans. Therefore, our findings suggest that disruption
of astrocyte self-organization mechanisms could be an underlying cause of neural
pathology.
acknowledgement: This work was supported by the National Institutes of Health (R01
DA047258 and R01 NS102237 to C.E., F32 NS100392 to K.T.B.) and the Holland-Trice
Brain Research Award (to C.E.). K.T.B. was supported by postdoctoral fellowships
from the Foerster-Bernstein Family and The Hartwell Foundation. The Hippenmeyer
lab was supported by the European Research Council (ERC) under the European Union’s
Horizon 2020 research and innovations program (725780 LinPro) to S.H. R.E. was supported
by Ministerio de Ciencia y Tecnología (RTI2018-093493-B-I00). We thank the Duke
Light Microscopy Core Facility, the Duke Transgenic Mouse Facility, Dr. U. Schulte
for assistance with proteomic experiments, and Dr. D. Silver for critical review
of the manuscript. Cartoon elements of figure panels were created using BioRender.com.
article_processing_charge: No
article_type: original
author:
- first_name: Katherine T.
full_name: Baldwin, Katherine T.
last_name: Baldwin
- first_name: Christabel X.
full_name: Tan, Christabel X.
last_name: Tan
- first_name: Samuel T.
full_name: Strader, Samuel T.
last_name: Strader
- first_name: Changyu
full_name: Jiang, Changyu
last_name: Jiang
- first_name: Justin T.
full_name: Savage, Justin T.
last_name: Savage
- first_name: Xabier
full_name: Elorza-Vidal, Xabier
last_name: Elorza-Vidal
- first_name: Ximena
full_name: Contreras, Ximena
id: 475990FE-F248-11E8-B48F-1D18A9856A87
last_name: Contreras
- first_name: Thomas
full_name: Rülicke, Thomas
last_name: Rülicke
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
- first_name: Raúl
full_name: Estévez, Raúl
last_name: Estévez
- first_name: Ru-Rong
full_name: Ji, Ru-Rong
last_name: Ji
- first_name: Cagla
full_name: Eroglu, Cagla
last_name: Eroglu
citation:
ama: Baldwin KT, Tan CX, Strader ST, et al. HepaCAM controls astrocyte self-organization
and coupling. Neuron. 2021;109(15):2427-2442.e10. doi:10.1016/j.neuron.2021.05.025
apa: Baldwin, K. T., Tan, C. X., Strader, S. T., Jiang, C., Savage, J. T., Elorza-Vidal,
X., … Eroglu, C. (2021). HepaCAM controls astrocyte self-organization and coupling.
Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2021.05.025
chicago: Baldwin, Katherine T., Christabel X. Tan, Samuel T. Strader, Changyu Jiang,
Justin T. Savage, Xabier Elorza-Vidal, Ximena Contreras, et al. “HepaCAM Controls
Astrocyte Self-Organization and Coupling.” Neuron. Elsevier, 2021. https://doi.org/10.1016/j.neuron.2021.05.025.
ieee: K. T. Baldwin et al., “HepaCAM controls astrocyte self-organization
and coupling,” Neuron, vol. 109, no. 15. Elsevier, p. 2427–2442.e10, 2021.
ista: Baldwin KT, Tan CX, Strader ST, Jiang C, Savage JT, Elorza-Vidal X, Contreras
X, Rülicke T, Hippenmeyer S, Estévez R, Ji R-R, Eroglu C. 2021. HepaCAM controls
astrocyte self-organization and coupling. Neuron. 109(15), 2427–2442.e10.
mla: Baldwin, Katherine T., et al. “HepaCAM Controls Astrocyte Self-Organization
and Coupling.” Neuron, vol. 109, no. 15, Elsevier, 2021, p. 2427–2442.e10,
doi:10.1016/j.neuron.2021.05.025.
short: K.T. Baldwin, C.X. Tan, S.T. Strader, C. Jiang, J.T. Savage, X. Elorza-Vidal,
X. Contreras, T. Rülicke, S. Hippenmeyer, R. Estévez, R.-R. Ji, C. Eroglu, Neuron
109 (2021) 2427–2442.e10.
date_created: 2021-08-06T09:08:25Z
date_published: 2021-08-04T00:00:00Z
date_updated: 2023-09-27T07:46:09Z
day: '04'
department:
- _id: SiHi
doi: 10.1016/j.neuron.2021.05.025
ec_funded: 1
external_id:
isi:
- '000692851900010'
pmid:
- '34171291'
intvolume: ' 109'
isi: 1
issue: '15'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.neuron.2021.05.025
month: '08'
oa: 1
oa_version: Published Version
page: 2427-2442.e10
pmid: 1
project:
- _id: 260018B0-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '725780'
name: Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development
publication: Neuron
publication_identifier:
eissn:
- 1097-4199
issn:
- 0896-6273
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: HepaCAM controls astrocyte self-organization and coupling
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 109
year: '2021'
...
---
_id: '9305'
abstract:
- lang: eng
text: Copper chalcogenides are outstanding thermoelectric materials for applications
in the medium-high temperature range. Among different chalcogenides, while Cu2−xSe
is characterized by higher thermoelectric figures of merit, Cu2−xS provides advantages
in terms of low cost and element abundance. In the present work, we investigate
the effect of different dopants to enhance the Cu2−xS performance and also its
thermal stability. Among the tested options, Pb-doped Cu2−xS shows the highest
improvement in stability against sulfur volatilization. Additionally, Pb incorporation
allows tuning charge carrier concentration, which enables a significant improvement
of the power factor. We demonstrate here that the introduction of an optimal additive
amount of just 0.3% results in a threefold increase of the power factor in the
middle-temperature range (500–800 K) and a record dimensionless thermoelectric
figure of merit above 2 at 880 K.
acknowledgement: This work was supported by the European Regional Development Fund
and by the Spanish Ministerio de Economía y Competitividad through the project SEHTOP
(ENE2016-77798-C4-3-R). MI acknowledges financial support from IST Austria. YL acknowledges
funding from the European Union’s Horizon 2020 research and innovation program under
the Marie Sklodowska-Curie grant agreement No. 754411. YZ, CX, XW, KX and TZ thank
the China Scholarship Council for the scholarship support. ICN2 acknowledges funding
from Generalitat de Catalunya 2017 SGR 327 and the Spanish MINECO project ENE2017-85087-C3.
ICN2 is supported by the Severo Ochoa program from the Spanish MINECO (grant no.
SEV-2017-0706) and is funded by the CERCA program/Generalitat de Catalunya. Part
of the present work has been performed in the framework of Universitat Autònoma
de Barcelona Materials Science Ph.D. program. M.C.S. has received funding from the
European Union’s Horizon 2020 research and innovation programme under the Marie
Skłodowska-Curie grant agreement No. 754510 (PROBIST) and the Severo Ochoa programme.
P.G. acknowledges financial support from the Spanish government (MICIU) through
the RTI2018-102006-J-I00 project and the Catalan Agency of Competitiveness (ACCIO)
through the TecnioSpring+ Marie Sklodowska-Curie action TECSPR16-1-0082. YZ and
CX contributed equally to this work.
article_number: '105991'
article_processing_charge: No
article_type: original
author:
- first_name: Yu
full_name: Zhang, Yu
last_name: Zhang
- first_name: Congcong
full_name: Xing, Congcong
last_name: Xing
- first_name: Yu
full_name: Liu, Yu
id: 2A70014E-F248-11E8-B48F-1D18A9856A87
last_name: Liu
orcid: 0000-0001-7313-6740
- first_name: Maria Chiara
full_name: Spadaro, Maria Chiara
last_name: Spadaro
- first_name: Xiang
full_name: Wang, Xiang
last_name: Wang
- first_name: Mengyao
full_name: Li, Mengyao
last_name: Li
- first_name: Ke
full_name: Xiao, Ke
last_name: Xiao
- first_name: Ting
full_name: Zhang, Ting
last_name: Zhang
- first_name: Pablo
full_name: Guardia, Pablo
last_name: Guardia
- first_name: Khak Ho
full_name: Lim, Khak Ho
last_name: Lim
- first_name: Ahmad Ostovari
full_name: Moghaddam, Ahmad Ostovari
last_name: Moghaddam
- first_name: Jordi
full_name: Llorca, Jordi
last_name: Llorca
- first_name: Jordi
full_name: Arbiol, Jordi
last_name: Arbiol
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
- first_name: Andreu
full_name: Cabot, Andreu
last_name: Cabot
citation:
ama: Zhang Y, Xing C, Liu Y, et al. Doping-mediated stabilization of copper vacancies
to promote thermoelectric properties of Cu2-xS. Nano Energy. 2021;85(7).
doi:10.1016/j.nanoen.2021.105991
apa: Zhang, Y., Xing, C., Liu, Y., Spadaro, M. C., Wang, X., Li, M., … Cabot, A.
(2021). Doping-mediated stabilization of copper vacancies to promote thermoelectric
properties of Cu2-xS. Nano Energy. Elsevier. https://doi.org/10.1016/j.nanoen.2021.105991
chicago: Zhang, Yu, Congcong Xing, Yu Liu, Maria Chiara Spadaro, Xiang Wang, Mengyao
Li, Ke Xiao, et al. “Doping-Mediated Stabilization of Copper Vacancies to Promote
Thermoelectric Properties of Cu2-XS.” Nano Energy. Elsevier, 2021. https://doi.org/10.1016/j.nanoen.2021.105991.
ieee: Y. Zhang et al., “Doping-mediated stabilization of copper vacancies
to promote thermoelectric properties of Cu2-xS,” Nano Energy, vol. 85,
no. 7. Elsevier, 2021.
ista: Zhang Y, Xing C, Liu Y, Spadaro MC, Wang X, Li M, Xiao K, Zhang T, Guardia
P, Lim KH, Moghaddam AO, Llorca J, Arbiol J, Ibáñez M, Cabot A. 2021. Doping-mediated
stabilization of copper vacancies to promote thermoelectric properties of Cu2-xS.
Nano Energy. 85(7), 105991.
mla: Zhang, Yu, et al. “Doping-Mediated Stabilization of Copper Vacancies to Promote
Thermoelectric Properties of Cu2-XS.” Nano Energy, vol. 85, no. 7, 105991,
Elsevier, 2021, doi:10.1016/j.nanoen.2021.105991.
short: Y. Zhang, C. Xing, Y. Liu, M.C. Spadaro, X. Wang, M. Li, K. Xiao, T. Zhang,
P. Guardia, K.H. Lim, A.O. Moghaddam, J. Llorca, J. Arbiol, M. Ibáñez, A. Cabot,
Nano Energy 85 (2021).
date_created: 2021-04-04T22:01:21Z
date_published: 2021-07-01T00:00:00Z
date_updated: 2023-09-27T07:41:00Z
day: '01'
department:
- _id: MaIb
doi: 10.1016/j.nanoen.2021.105991
ec_funded: 1
external_id:
isi:
- '000663442200004'
intvolume: ' 85'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://ddd.uab.cat/record/271947
month: '07'
oa: 1
oa_version: Submitted Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Nano Energy
publication_identifier:
issn:
- 2211-2855
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Doping-mediated stabilization of copper vacancies to promote thermoelectric
properties of Cu2-xS
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 85
year: '2021'
...
---
_id: '9212'
abstract:
- lang: eng
text: Plant fitness is largely dependent on the root, the underground organ, which,
besides its anchoring function, supplies the plant body with water and all nutrients
necessary for growth and development. To exploit the soil effectively, roots must
constantly integrate environmental signals and react through adjustment of growth
and development. Important components of the root management strategy involve
a rapid modulation of the root growth kinetics and growth direction, as well as
an increase of the root system radius through formation of lateral roots (LRs).
At the molecular level, such a fascinating growth and developmental flexibility
of root organ requires regulatory networks that guarantee stability of the developmental
program but also allows integration of various environmental inputs. The plant
hormone auxin is one of the principal endogenous regulators of root system architecture
by controlling primary root growth and formation of LR. In this review, we discuss
recent progress in understanding molecular networks where auxin is one of the
main players shaping the root system and acting as mediator between endogenous
cues and environmental factors.
acknowledgement: We apologize to all the authors whose scientific work could not be
cited and discussed because of space restrictions. We thank Dr. Inge Verstraeten
(ISTAustria) and Dr. Juan Carlos Montesinos-Lopez (ETH Zürich) for helpful suggestions.
This work was supported by the DOC Fellowship Programme of the Austrian Academy
of Sciences (25008) to C.A.
article_number: a039941
article_processing_charge: No
article_type: original
author:
- first_name: Nicola
full_name: Cavallari, Nicola
id: 457160E6-F248-11E8-B48F-1D18A9856A87
last_name: Cavallari
- first_name: Christina
full_name: Artner, Christina
id: 45DF286A-F248-11E8-B48F-1D18A9856A87
last_name: Artner
- first_name: Eva
full_name: Benková, Eva
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
citation:
ama: Cavallari N, Artner C, Benková E. Auxin-regulated lateral root organogenesis.
Cold Spring Harbor Perspectives in Biology. 2021;13(7). doi:10.1101/cshperspect.a039941
apa: Cavallari, N., Artner, C., & Benková, E. (2021). Auxin-regulated lateral
root organogenesis. Cold Spring Harbor Perspectives in Biology. Cold Spring
Harbor Laboratory Press. https://doi.org/10.1101/cshperspect.a039941
chicago: Cavallari, Nicola, Christina Artner, and Eva Benková. “Auxin-Regulated
Lateral Root Organogenesis.” Cold Spring Harbor Perspectives in Biology.
Cold Spring Harbor Laboratory Press, 2021. https://doi.org/10.1101/cshperspect.a039941.
ieee: N. Cavallari, C. Artner, and E. Benková, “Auxin-regulated lateral root organogenesis,”
Cold Spring Harbor Perspectives in Biology, vol. 13, no. 7. Cold Spring
Harbor Laboratory Press, 2021.
ista: Cavallari N, Artner C, Benková E. 2021. Auxin-regulated lateral root organogenesis.
Cold Spring Harbor Perspectives in Biology. 13(7), a039941.
mla: Cavallari, Nicola, et al. “Auxin-Regulated Lateral Root Organogenesis.” Cold
Spring Harbor Perspectives in Biology, vol. 13, no. 7, a039941, Cold Spring
Harbor Laboratory Press, 2021, doi:10.1101/cshperspect.a039941.
short: N. Cavallari, C. Artner, E. Benková, Cold Spring Harbor Perspectives in Biology
13 (2021).
date_created: 2021-03-01T10:08:32Z
date_published: 2021-07-01T00:00:00Z
date_updated: 2023-09-27T06:44:06Z
day: '01'
department:
- _id: EvBe
doi: 10.1101/cshperspect.a039941
external_id:
isi:
- '000692069100001'
pmid:
- '33558367'
intvolume: ' 13'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1101/cshperspect.a039941
month: '07'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 2685A872-B435-11E9-9278-68D0E5697425
name: Hormonal regulation of plant adaptive responses to environmental signals
publication: Cold Spring Harbor Perspectives in Biology
publication_identifier:
issn:
- 1943-0264
publication_status: published
publisher: Cold Spring Harbor Laboratory Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Auxin-regulated lateral root organogenesis
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13
year: '2021'
...
---
_id: '9953'
abstract:
- lang: eng
text: Chronic psychological stress is one of the most important triggers and environmental
risk factors for neuropsychiatric disorders. Chronic stress can influence all
organs via the secretion of stress hormones, including glucocorticoids by the
adrenal glands, which coordinate the stress response across the body. In the brain,
glucocorticoid receptors (GR) are expressed by various cell types including microglia,
which are its resident immune cells regulating stress-induced inflammatory processes.
To study the roles of microglial GR under normal homeostatic conditions and following
chronic stress, we generated a mouse model in which the GR gene is depleted in
microglia specifically at adulthood to prevent developmental confounds. We first
confirmed that microglia were depleted in GR in our model in males and females
among the cingulate cortex and the hippocampus, both stress-sensitive brain regions.
Then, cohorts of microglial-GR depleted and wild-type (WT) adult female mice were
housed for 3 weeks in a standard or stressful condition, using a chronic unpredictable
mild stress (CUMS) paradigm. CUMS induced stress-related behavior in both microglial-GR
depleted and WT animals as demonstrated by a decrease of both saccharine preference
and progressive ratio breakpoint. Nevertheless, the hippocampal microglial and
neural mechanisms underlying the adaptation to stress occurred differently between
the two genotypes. Upon CUMS exposure, microglial morphology was altered in the
WT controls, without any apparent effect in microglial-GR depleted mice. Furthermore,
in the standard environment condition, GR depleted-microglia showed increased
expression of pro-inflammatory genes, and genes involved in microglial homeostatic
functions (such as Trem2, Cx3cr1 and Mertk). On the contrary, in CUMS condition,
GR depleted-microglia showed reduced expression levels of pro-inflammatory genes
and increased neuroprotective as well as anti-inflammatory genes compared to WT-microglia.
Moreover, in microglial-GR depleted mice, but not in WT mice, CUMS led to a significant
reduction of CA1 long-term potentiation and paired-pulse ratio. Lastly, differences
in adult hippocampal neurogenesis were observed between the genotypes during normal
homeostatic conditions, with microglial-GR deficiency increasing the formation
of newborn neurons in the dentate gyrus subgranular zone independently from stress
exposure. Together, these findings indicate that, although the deletion of microglial
GR did not prevent the animal’s ability to respond to stress, it contributed to
modulating hippocampal functions in both standard and stressful conditions, notably
by shaping the microglial response to chronic stress.
acknowledgement: We acknowledge that Université Laval stands on the traditional and
unceded land of the Huron-Wendat peoples; and that the University of Victoria exists
on the territory of the Lekwungen peoples and that the Songhees, Esquimalt and WSÁNEÆ
peoples have relationships to this land. We thank Emmanuel Planel for the access
to the epifluorescence microscope and Julie-Christine Lévesque at the Bioimaging
Platform of CRCHU de Québec-Université Laval for technical assistance. We also thank
the Centre for Advanced Materials and Related Technology for the access to the confocal
microscope with Airyscan. K.P. was supported by a doctoral scholarship from Fonds
de Recherche du Québec – Santé (FRQS), an excellence award from Fondation du CHU
de Québec, as well as from Centre Thématique de Recherche en Neurosciences and from
Fondation Famille-Choquette. K.B. was supported by excellence scholarships from
Université Laval and Fondation du CHU de Québec. S.G. is supported by FIRC-AIRC
fellowship for Italy 22329/2018 and by Pilot ARISLA NKINALS 2019. C.W.H. and J.C.S.
were supported by postdoctoral fellowships from FRQS. This study was funded by a
Natural Sciences and Engineering Research Council of Canada (NSERC) Discovery grant
(RGPIN-2014-05308) awarded to M.E.T., by ERANET neuron 2017 MicroSynDep to M.E.T.
and I.B., and by the Italian Ministry of Health, grant RF-2018-12367249 to I.B,
by PRIN 2017, AIRC 2019 and Ministero della Salute RF2018 to C.L. M.E.T. is a Tier
II Canada Research Chair in Neurobiology of Aging and Cognition.
article_processing_charge: No
article_type: original
author:
- first_name: Katherine
full_name: Picard, Katherine
last_name: Picard
- first_name: Kanchan
full_name: Bisht, Kanchan
last_name: Bisht
- first_name: Silvia
full_name: Poggini, Silvia
last_name: Poggini
- first_name: Stefano
full_name: Garofalo, Stefano
last_name: Garofalo
- first_name: Maria Teresa
full_name: Golia, Maria Teresa
last_name: Golia
- first_name: Bernadette
full_name: Basilico, Bernadette
id: 36035796-5ACA-11E9-A75E-7AF2E5697425
last_name: Basilico
orcid: 0000-0003-1843-3173
- first_name: Fatima
full_name: Abdallah, Fatima
last_name: Abdallah
- first_name: Naomi
full_name: Ciano Albanese, Naomi
last_name: Ciano Albanese
- first_name: Irmgard
full_name: Amrein, Irmgard
last_name: Amrein
- first_name: Nathalie
full_name: Vernoux, Nathalie
last_name: Vernoux
- first_name: Kaushik
full_name: Sharma, Kaushik
last_name: Sharma
- first_name: Chin Wai
full_name: Hui, Chin Wai
last_name: Hui
- first_name: Julie
full_name: C. Savage, Julie
last_name: C. Savage
- first_name: Cristina
full_name: Limatola, Cristina
last_name: Limatola
- first_name: Davide
full_name: Ragozzino, Davide
last_name: Ragozzino
- first_name: Laura
full_name: Maggi, Laura
last_name: Maggi
- first_name: Igor
full_name: Branchi, Igor
last_name: Branchi
- first_name: Marie Ève
full_name: Tremblay, Marie Ève
last_name: Tremblay
citation:
ama: Picard K, Bisht K, Poggini S, et al. Microglial-glucocorticoid receptor depletion
alters the response of hippocampal microglia and neurons in a chronic unpredictable
mild stress paradigm in female mice. Brain, Behavior, and Immunity. 2021;97:423-439.
doi:10.1016/j.bbi.2021.07.022
apa: Picard, K., Bisht, K., Poggini, S., Garofalo, S., Golia, M. T., Basilico, B.,
… Tremblay, M. È. (2021). Microglial-glucocorticoid receptor depletion alters
the response of hippocampal microglia and neurons in a chronic unpredictable mild
stress paradigm in female mice. Brain, Behavior, and Immunity. Elsevier.
https://doi.org/10.1016/j.bbi.2021.07.022
chicago: Picard, Katherine, Kanchan Bisht, Silvia Poggini, Stefano Garofalo, Maria
Teresa Golia, Bernadette Basilico, Fatima Abdallah, et al. “Microglial-Glucocorticoid
Receptor Depletion Alters the Response of Hippocampal Microglia and Neurons in
a Chronic Unpredictable Mild Stress Paradigm in Female Mice.” Brain, Behavior,
and Immunity. Elsevier, 2021. https://doi.org/10.1016/j.bbi.2021.07.022.
ieee: K. Picard et al., “Microglial-glucocorticoid receptor depletion alters
the response of hippocampal microglia and neurons in a chronic unpredictable mild
stress paradigm in female mice,” Brain, Behavior, and Immunity, vol. 97.
Elsevier, pp. 423–439, 2021.
ista: Picard K, Bisht K, Poggini S, Garofalo S, Golia MT, Basilico B, Abdallah F,
Ciano Albanese N, Amrein I, Vernoux N, Sharma K, Hui CW, C. Savage J, Limatola
C, Ragozzino D, Maggi L, Branchi I, Tremblay MÈ. 2021. Microglial-glucocorticoid
receptor depletion alters the response of hippocampal microglia and neurons in
a chronic unpredictable mild stress paradigm in female mice. Brain, Behavior,
and Immunity. 97, 423–439.
mla: Picard, Katherine, et al. “Microglial-Glucocorticoid Receptor Depletion Alters
the Response of Hippocampal Microglia and Neurons in a Chronic Unpredictable Mild
Stress Paradigm in Female Mice.” Brain, Behavior, and Immunity, vol. 97,
Elsevier, 2021, pp. 423–39, doi:10.1016/j.bbi.2021.07.022.
short: K. Picard, K. Bisht, S. Poggini, S. Garofalo, M.T. Golia, B. Basilico, F.
Abdallah, N. Ciano Albanese, I. Amrein, N. Vernoux, K. Sharma, C.W. Hui, J. C.
Savage, C. Limatola, D. Ragozzino, L. Maggi, I. Branchi, M.È. Tremblay, Brain,
Behavior, and Immunity 97 (2021) 423–439.
date_created: 2021-08-22T22:01:21Z
date_published: 2021-10-01T00:00:00Z
date_updated: 2023-10-03T09:49:18Z
day: '01'
department:
- _id: GaNo
doi: 10.1016/j.bbi.2021.07.022
external_id:
isi:
- '000702878400007'
pmid:
- '34343616'
intvolume: ' 97'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.zora.uzh.ch/id/eprint/208855/1/ZORA208855.pdf
month: '10'
oa: 1
oa_version: Submitted Version
page: 423-439
pmid: 1
publication: Brain, Behavior, and Immunity
publication_identifier:
issn:
- 0889-1591
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Microglial-glucocorticoid receptor depletion alters the response of hippocampal
microglia and neurons in a chronic unpredictable mild stress paradigm in female
mice
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 97
year: '2021'
...
---
_id: '10327'
abstract:
- lang: eng
text: Composite materials offer numerous advantages in a wide range of applications,
including thermoelectrics. Here, semiconductor–metal composites are produced by
just blending nanoparticles of a sulfide semiconductor obtained in aqueous solution
and at room temperature with a metallic Cu powder. The obtained blend is annealed
in a reducing atmosphere and afterward consolidated into dense polycrystalline
pellets through spark plasma sintering (SPS). We observe that, during the annealing
process, the presence of metallic copper activates a partial reduction of the
PbS, resulting in the formation of PbS–Pb–CuxS composites. The presence of metallic
lead during the SPS process habilitates the liquid-phase sintering of the composite.
Besides, by comparing the transport properties of PbS, the PbS–Pb–CuxS composites,
and PbS–CuxS composites obtained by blending PbS and CuxS nanoparticles, we demonstrate
that the presence of metallic lead decisively contributes to a strong increase
of the charge carrier concentration through spillover of charge carriers enabled
by the low work function of lead. The increase in charge carrier concentration
translates into much higher electrical conductivities and moderately lower Seebeck
coefficients. These properties translate into power factors up to 2.1 mW m–1 K–2
at ambient temperature, well above those of PbS and PbS + CuxS. Additionally,
the presence of multiple phases in the final composite results in a notable decrease
in the lattice thermal conductivity. Overall, the introduction of metallic copper
in the initial blend results in a significant improvement of the thermoelectric
performance of PbS, reaching a dimensionless thermoelectric figure of merit ZT
= 1.1 at 750 K, which represents about a 400% increase over bare PbS. Besides,
an average ZTave = 0.72 in the temperature range 320–773 K is demonstrated.
acknowledgement: This work was supported by the European Regional Development Funds.
M.L., Y.Z., X.H., and K.X. thank the China Scholarship Council for scholarship support.
M. I. has been financially supported by IST Austria and the Werner Siemens Foundation.
Y.L. acknowledges funding from the European Union’s Horizon 2020 research and innovation
program under the Marie Sklodowska-Curie grant agreement No. 754411. J.L. is a Serra
Húnter fellow and is grateful to ICREA Academia program and projects MICINN/FEDER
RTI2018-093996-B-C31 and GC 2017 SGR 128. ICN2 acknowledges funding from Generalitat
de Catalunya 2017 SGR 327 and the Spanish MINECO project NANOGEN (PID2020-116093RB-C43).
ICN2 was supported by the Severo Ochoa program from Spanish MINECO (grant no. SEV-2017-0706)
and was funded by the CERCA Programme/Generalitat de Catalunya. X.H. thanks China
Scholarship Council for scholarship support (201804910551). Part of the present
work was performed in the framework of Universitat Autònoma de Barcelona Materials
Science Ph.D. program.
article_processing_charge: No
article_type: original
author:
- first_name: Mengyao
full_name: Li, Mengyao
last_name: Li
- first_name: Yu
full_name: Liu, Yu
id: 2A70014E-F248-11E8-B48F-1D18A9856A87
last_name: Liu
orcid: 0000-0001-7313-6740
- first_name: Yu
full_name: Zhang, Yu
last_name: Zhang
- first_name: Xu
full_name: Han, Xu
last_name: Han
- first_name: Ke
full_name: Xiao, Ke
last_name: Xiao
- first_name: Mehran
full_name: Nabahat, Mehran
last_name: Nabahat
- first_name: Jordi
full_name: Arbiol, Jordi
last_name: Arbiol
- first_name: Jordi
full_name: Llorca, Jordi
last_name: Llorca
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
- first_name: Andreu
full_name: Cabot, Andreu
last_name: Cabot
citation:
ama: Li M, Liu Y, Zhang Y, et al. PbS–Pb–CuxS composites for thermoelectric application.
ACS Applied Materials and Interfaces. 2021;13(43):51373–51382. doi:10.1021/acsami.1c15609
apa: Li, M., Liu, Y., Zhang, Y., Han, X., Xiao, K., Nabahat, M., … Cabot, A. (2021).
PbS–Pb–CuxS composites for thermoelectric application. ACS Applied Materials
and Interfaces. American Chemical Society . https://doi.org/10.1021/acsami.1c15609
chicago: Li, Mengyao, Yu Liu, Yu Zhang, Xu Han, Ke Xiao, Mehran Nabahat, Jordi Arbiol,
Jordi Llorca, Maria Ibáñez, and Andreu Cabot. “PbS–Pb–CuxS Composites for Thermoelectric
Application.” ACS Applied Materials and Interfaces. American Chemical Society
, 2021. https://doi.org/10.1021/acsami.1c15609.
ieee: M. Li et al., “PbS–Pb–CuxS composites for thermoelectric application,”
ACS Applied Materials and Interfaces, vol. 13, no. 43. American Chemical
Society , pp. 51373–51382, 2021.
ista: Li M, Liu Y, Zhang Y, Han X, Xiao K, Nabahat M, Arbiol J, Llorca J, Ibáñez
M, Cabot A. 2021. PbS–Pb–CuxS composites for thermoelectric application. ACS Applied
Materials and Interfaces. 13(43), 51373–51382.
mla: Li, Mengyao, et al. “PbS–Pb–CuxS Composites for Thermoelectric Application.”
ACS Applied Materials and Interfaces, vol. 13, no. 43, American Chemical
Society , 2021, pp. 51373–51382, doi:10.1021/acsami.1c15609.
short: M. Li, Y. Liu, Y. Zhang, X. Han, K. Xiao, M. Nabahat, J. Arbiol, J. Llorca,
M. Ibáñez, A. Cabot, ACS Applied Materials and Interfaces 13 (2021) 51373–51382.
date_created: 2021-11-21T23:01:30Z
date_published: 2021-10-19T00:00:00Z
date_updated: 2023-10-03T09:55:33Z
day: '19'
department:
- _id: MaIb
doi: 10.1021/acsami.1c15609
ec_funded: 1
external_id:
isi:
- '000715852100070'
pmid:
- '34665616'
intvolume: ' 13'
isi: 1
issue: '43'
keyword:
- CuxS
- PbS
- energy conversion
- nanocomposite
- nanoparticle
- solution synthesis
- thermoelectric
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://upcommons.upc.edu/bitstream/2117/363528/1/Pb%20mengyao.pdf
month: '10'
oa: 1
oa_version: Submitted Version
page: 51373–51382
pmid: 1
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 9B8F7476-BA93-11EA-9121-9846C619BF3A
name: 'HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of
Semiconductors for Waste Heat Recovery'
publication: ACS Applied Materials and Interfaces
publication_identifier:
eissn:
- 1944-8252
issn:
- 1944-8244
publication_status: published
publisher: 'American Chemical Society '
quality_controlled: '1'
scopus_import: '1'
status: public
title: PbS–Pb–CuxS composites for thermoelectric application
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13
year: '2021'
...
---
_id: '9235'
abstract:
- lang: eng
text: Cu2–xS has become one of the most promising thermoelectric materials for application
in the middle-high temperature range. Its advantages include the abundance, low
cost, and safety of its elements and a high performance at relatively elevated
temperatures. However, stability issues limit its operation current and temperature,
thus calling for the optimization of the material performance in the middle temperature
range. Here, we present a synthetic protocol for large scale production of covellite
CuS nanoparticles at ambient temperature and atmosphere, and using water as a
solvent. The crystal phase and stoichiometry of the particles are afterward tuned
through an annealing process at a moderate temperature under inert or reducing
atmosphere. While annealing under argon results in Cu1.8S nanopowder with a rhombohedral
crystal phase, annealing in an atmosphere containing hydrogen leads to tetragonal
Cu1.96S. High temperature X-ray diffraction analysis shows the material annealed
in argon to transform to the cubic phase at ca. 400 K, while the material annealed
in the presence of hydrogen undergoes two phase transitions, first to hexagonal
and then to the cubic structure. The annealing atmosphere, temperature, and time
allow adjustment of the density of copper vacancies and thus tuning of the charge
carrier concentration and material transport properties. In this direction, the
material annealed under Ar is characterized by higher electrical conductivities
but lower Seebeck coefficients than the material annealed in the presence of hydrogen.
By optimizing the charge carrier concentration through the annealing time, Cu2–xS
with record figures of merit in the middle temperature range, up to 1.41 at 710
K, is obtained. We finally demonstrate that this strategy, based on a low-cost
and scalable solution synthesis process, is also suitable for the production of
high performance Cu2–xS layers using high throughput and cost-effective printing
technologies.
acknowledgement: This work was supported by the European Regional Development Funds.
M.Y.L., X.H., T.Z., and K.X. thank the China Scholarship Council for scholarship
support. M.I. acknowledges financial support from IST Austria. J.L. acknowledges
support from the National Natural Science Foundation of China (No. 22008091), the
funding for scientific research startup of Jiangsu University (No. 19JDG044), and
Jiangsu Provincial Program for High-Level Innovative and Entrepreneurial Talents
Introduction. J.L. is a Serra Húnter fellow and is grateful to the ICREA Academia
program and projects MICINN/FEDER RTI2018-093996-B-C31 and GC 2017 SGR 128. ICN2
acknowledges funding from Generalitat de Catalunya 2017 SGR 327 and the Spanish
MINECO ENE2017-85087-C3. ICN2 is supported by the Severo Ochoa program from Spanish
MINECO (Grant No. SEV-2017-0706) and is funded by the CERCA Programme/Generalitat
de Catalunya. Part of the present work has been performed in the framework of Universitat
Autònoma de Barcelona Materials Science PhD program. T.Z. has received funding from
the CSC-UAB PhD scholarship program.
article_processing_charge: No
article_type: original
author:
- first_name: Mengyao
full_name: Li, Mengyao
last_name: Li
- first_name: Yu
full_name: Liu, Yu
id: 2A70014E-F248-11E8-B48F-1D18A9856A87
last_name: Liu
orcid: 0000-0001-7313-6740
- first_name: Yu
full_name: Zhang, Yu
last_name: Zhang
- first_name: Xu
full_name: Han, Xu
last_name: Han
- first_name: Ting
full_name: Zhang, Ting
last_name: Zhang
- first_name: Yong
full_name: Zuo, Yong
last_name: Zuo
- first_name: Chenyang
full_name: Xie, Chenyang
last_name: Xie
- first_name: Ke
full_name: Xiao, Ke
last_name: Xiao
- first_name: Jordi
full_name: Arbiol, Jordi
last_name: Arbiol
- first_name: Jordi
full_name: Llorca, Jordi
last_name: Llorca
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
- first_name: Junfeng
full_name: Liu, Junfeng
last_name: Liu
- first_name: Andreu
full_name: Cabot, Andreu
last_name: Cabot
citation:
ama: Li M, Liu Y, Zhang Y, et al. Effect of the annealing atmosphere on crystal
phase and thermoelectric properties of copper sulfide. ACS Nano. 2021;15(3):4967–4978.
doi:10.1021/acsnano.0c09866
apa: Li, M., Liu, Y., Zhang, Y., Han, X., Zhang, T., Zuo, Y., … Cabot, A. (2021).
Effect of the annealing atmosphere on crystal phase and thermoelectric properties
of copper sulfide. ACS Nano. American Chemical Society . https://doi.org/10.1021/acsnano.0c09866
chicago: Li, Mengyao, Yu Liu, Yu Zhang, Xu Han, Ting Zhang, Yong Zuo, Chenyang Xie,
et al. “Effect of the Annealing Atmosphere on Crystal Phase and Thermoelectric
Properties of Copper Sulfide.” ACS Nano. American Chemical Society , 2021.
https://doi.org/10.1021/acsnano.0c09866.
ieee: M. Li et al., “Effect of the annealing atmosphere on crystal phase
and thermoelectric properties of copper sulfide,” ACS Nano, vol. 15, no.
3. American Chemical Society , pp. 4967–4978, 2021.
ista: Li M, Liu Y, Zhang Y, Han X, Zhang T, Zuo Y, Xie C, Xiao K, Arbiol J, Llorca
J, Ibáñez M, Liu J, Cabot A. 2021. Effect of the annealing atmosphere on crystal
phase and thermoelectric properties of copper sulfide. ACS Nano. 15(3), 4967–4978.
mla: Li, Mengyao, et al. “Effect of the Annealing Atmosphere on Crystal Phase and
Thermoelectric Properties of Copper Sulfide.” ACS Nano, vol. 15, no. 3,
American Chemical Society , 2021, pp. 4967–4978, doi:10.1021/acsnano.0c09866.
short: M. Li, Y. Liu, Y. Zhang, X. Han, T. Zhang, Y. Zuo, C. Xie, K. Xiao, J. Arbiol,
J. Llorca, M. Ibáñez, J. Liu, A. Cabot, ACS Nano 15 (2021) 4967–4978.
date_created: 2021-03-10T20:12:45Z
date_published: 2021-03-01T00:00:00Z
date_updated: 2023-10-03T09:59:55Z
day: '01'
department:
- _id: MaIb
doi: 10.1021/acsnano.0c09866
external_id:
isi:
- '000634569100106'
pmid:
- '33645986'
intvolume: ' 15'
isi: 1
issue: '3'
keyword:
- General Engineering
- General Physics and Astronomy
- General Materials Science
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://upcommons.upc.edu/bitstream/handle/2117/363528/Pb%20mengyao.pdf?sequence=1&isAllowed=y
month: '03'
oa: 1
oa_version: Submitted Version
page: 4967–4978
pmid: 1
publication: ACS Nano
publication_identifier:
eissn:
- 1936-086X
issn:
- 1936-0851
publication_status: published
publisher: 'American Chemical Society '
quality_controlled: '1'
scopus_import: '1'
status: public
title: Effect of the annealing atmosphere on crystal phase and thermoelectric properties
of copper sulfide
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2021'
...
---
_id: '10204'
abstract:
- lang: eng
text: Two common representations of close packings of identical spheres consisting
of hexagonal layers, called Barlow stackings, appear abundantly in minerals and
metals. These motifs, however, occupy an identical portion of space and bear identical
first-order topological signatures as measured by persistent homology. Here we
present a novel method based on k-fold covers that unambiguously distinguishes
between these patterns. Moreover, our approach provides topological evidence that
the FCC motif is the more stable of the two in the context of evolving experimental
sphere packings during the transition from disordered to an ordered state. We
conclude that our approach can be generalised to distinguish between various Barlow
stackings manifested in minerals and metals.
acknowledgement: MS acknowledges the support by Australian Research Council funding
through the ARC Training Centre for M3D Innovation (IC180100008). MS thanks M. Hanifpour
and N. Francois for their input and valuable discussions. This project has received
funding from the European Research Council (ERC) under the European Union's Horizon
2020 research and innovation programme, grant no. 788183 and from the Wittgenstein
Prize, Austrian Science Fund (FWF), grant no. Z 342-N31.
article_processing_charge: No
article_type: original
author:
- 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: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Mohammad
full_name: Saadatfar, Mohammad
last_name: Saadatfar
citation:
ama: Osang GF, Edelsbrunner H, Saadatfar M. Topological signatures and stability
of hexagonal close packing and Barlow stackings. Soft Matter. 2021;17(40):9107-9115.
doi:10.1039/d1sm00774b
apa: Osang, G. F., Edelsbrunner, H., & Saadatfar, M. (2021). Topological signatures
and stability of hexagonal close packing and Barlow stackings. Soft Matter.
Royal Society of Chemistry . https://doi.org/10.1039/d1sm00774b
chicago: Osang, Georg F, Herbert Edelsbrunner, and Mohammad Saadatfar. “Topological
Signatures and Stability of Hexagonal Close Packing and Barlow Stackings.” Soft
Matter. Royal Society of Chemistry , 2021. https://doi.org/10.1039/d1sm00774b.
ieee: G. F. Osang, H. Edelsbrunner, and M. Saadatfar, “Topological signatures and
stability of hexagonal close packing and Barlow stackings,” Soft Matter,
vol. 17, no. 40. Royal Society of Chemistry , pp. 9107–9115, 2021.
ista: Osang GF, Edelsbrunner H, Saadatfar M. 2021. Topological signatures and stability
of hexagonal close packing and Barlow stackings. Soft Matter. 17(40), 9107–9115.
mla: Osang, Georg F., et al. “Topological Signatures and Stability of Hexagonal
Close Packing and Barlow Stackings.” Soft Matter, vol. 17, no. 40, Royal
Society of Chemistry , 2021, pp. 9107–15, doi:10.1039/d1sm00774b.
short: G.F. Osang, H. Edelsbrunner, M. Saadatfar, Soft Matter 17 (2021) 9107–9115.
date_created: 2021-10-31T23:01:30Z
date_published: 2021-10-20T00:00:00Z
date_updated: 2023-10-03T09:24:27Z
day: '20'
ddc:
- '540'
department:
- _id: HeEd
doi: 10.1039/d1sm00774b
ec_funded: 1
external_id:
isi:
- '000700090000001'
pmid:
- '34569592'
file:
- access_level: open_access
checksum: b4da0c420530295e61b153960f6cb350
content_type: application/pdf
creator: dernst
date_created: 2023-10-03T09:21:42Z
date_updated: 2023-10-03T09:21:42Z
file_id: '14385'
file_name: 2021_SoftMatter_acceptedversion_Osang.pdf
file_size: 4678788
relation: main_file
success: 1
file_date_updated: 2023-10-03T09:21:42Z
has_accepted_license: '1'
intvolume: ' 17'
isi: 1
issue: '40'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 9107-9115
pmid: 1
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: The Wittgenstein Prize
publication: Soft Matter
publication_identifier:
eissn:
- 1744-6848
issn:
- 1744-683X
publication_status: published
publisher: 'Royal Society of Chemistry '
quality_controlled: '1'
scopus_import: '1'
status: public
title: Topological signatures and stability of hexagonal close packing and Barlow
stackings
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 17
year: '2021'
...
---
_id: '9464'
abstract:
- lang: eng
text: We firstly introduce the self-assembled growth of highly uniform Ge quantum
wires with controllable position, distance and length on patterned Si (001) substrates.
We then present the electrically tunable strong spin-orbit coupling, the first
Ge hole spin qubit and ultrafast operation of hole spin qubit in the Ge/Si quantum
wires.
acknowledgement: This work was supported by the National Key R&D Program of China
(Grant No. 2016YFA0301700) and the ERC Starting Grant no. 335497.
article_number: '9420817'
article_processing_charge: No
author:
- first_name: Fei
full_name: Gao, Fei
last_name: Gao
- first_name: Jie Yin
full_name: Zhang, Jie Yin
last_name: Zhang
- first_name: Jian Huan
full_name: Wang, Jian Huan
last_name: Wang
- first_name: Ming
full_name: Ming, Ming
last_name: Ming
- first_name: Tina
full_name: Wang, Tina
last_name: Wang
- first_name: Jian Jun
full_name: Zhang, Jian Jun
last_name: Zhang
- first_name: Hannes
full_name: Watzinger, Hannes
id: 35DF8E50-F248-11E8-B48F-1D18A9856A87
last_name: Watzinger
- first_name: Josip
full_name: Kukucka, Josip
id: 3F5D8856-F248-11E8-B48F-1D18A9856A87
last_name: Kukucka
- first_name: Lada
full_name: Vukušić, Lada
id: 31E9F056-F248-11E8-B48F-1D18A9856A87
last_name: Vukušić
orcid: 0000-0003-2424-8636
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
- first_name: Ke
full_name: Wang, Ke
last_name: Wang
- first_name: Gang
full_name: Xu, Gang
last_name: Xu
- first_name: Hai Ou
full_name: Li, Hai Ou
last_name: Li
- first_name: Guo Ping
full_name: Guo, Guo Ping
last_name: Guo
citation:
ama: 'Gao F, Zhang JY, Wang JH, et al. Ge/Si quantum wires for quantum computing.
In: 2021 5th IEEE Electron Devices Technology and Manufacturing Conference,
EDTM 2021. IEEE; 2021. doi:10.1109/EDTM50988.2021.9420817'
apa: 'Gao, F., Zhang, J. Y., Wang, J. H., Ming, M., Wang, T., Zhang, J. J., … Guo,
G. P. (2021). Ge/Si quantum wires for quantum computing. In 2021 5th IEEE Electron
Devices Technology and Manufacturing Conference, EDTM 2021. Virtual, Online:
IEEE. https://doi.org/10.1109/EDTM50988.2021.9420817'
chicago: Gao, Fei, Jie Yin Zhang, Jian Huan Wang, Ming Ming, Tina Wang, Jian Jun
Zhang, Hannes Watzinger, et al. “Ge/Si Quantum Wires for Quantum Computing.” In
2021 5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM
2021. IEEE, 2021. https://doi.org/10.1109/EDTM50988.2021.9420817.
ieee: F. Gao et al., “Ge/Si quantum wires for quantum computing,” in 2021
5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021,
Virtual, Online, 2021.
ista: 'Gao F, Zhang JY, Wang JH, Ming M, Wang T, Zhang JJ, Watzinger H, Kukucka
J, Vukušić L, Katsaros G, Wang K, Xu G, Li HO, Guo GP. 2021. Ge/Si quantum wires
for quantum computing. 2021 5th IEEE Electron Devices Technology and Manufacturing
Conference, EDTM 2021. EDTM: IEEE Electron Devices Technology and Manufacturing
Conference, 9420817.'
mla: Gao, Fei, et al. “Ge/Si Quantum Wires for Quantum Computing.” 2021 5th IEEE
Electron Devices Technology and Manufacturing Conference, EDTM 2021, 9420817,
IEEE, 2021, doi:10.1109/EDTM50988.2021.9420817.
short: F. Gao, J.Y. Zhang, J.H. Wang, M. Ming, T. Wang, J.J. Zhang, H. Watzinger,
J. Kukucka, L. Vukušić, G. Katsaros, K. Wang, G. Xu, H.O. Li, G.P. Guo, in:, 2021
5th IEEE Electron Devices Technology and Manufacturing Conference, EDTM 2021,
IEEE, 2021.
conference:
end_date: 2021-04-11
location: Virtual, Online
name: 'EDTM: IEEE Electron Devices Technology and Manufacturing Conference'
start_date: 2021-04-08
date_created: 2021-06-06T22:01:29Z
date_published: 2021-04-08T00:00:00Z
date_updated: 2023-10-03T12:51:59Z
day: '08'
department:
- _id: GeKa
doi: 10.1109/EDTM50988.2021.9420817
ec_funded: 1
external_id:
isi:
- '000675595800006'
isi: 1
language:
- iso: eng
month: '04'
oa_version: None
project:
- _id: 25517E86-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '335497'
name: Towards Spin qubits and Majorana fermions in Germanium selfassembled hut-wires
publication: 2021 5th IEEE Electron Devices Technology and Manufacturing Conference,
EDTM 2021
publication_identifier:
isbn:
- '9781728181769'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Ge/Si quantum wires for quantum computing
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '9605'
abstract:
- lang: eng
text: 'Given a finite set A ⊂ ℝ^d, let Cov_{r,k} denote the set of all points within
distance r to at least k points of A. Allowing r and k to vary, we obtain a 2-parameter
family of spaces that grow larger when r increases or k decreases, called the
multicover bifiltration. Motivated by the problem of computing the homology of
this bifiltration, we introduce two closely related combinatorial bifiltrations,
one polyhedral and the other simplicial, which are both topologically equivalent
to the multicover bifiltration and far smaller than a Čech-based model considered
in prior work of Sheehy. Our polyhedral construction is a bifiltration of the
rhomboid tiling of Edelsbrunner and Osang, and can be efficiently computed using
a variant of an algorithm given by these authors as well. Using an implementation
for dimension 2 and 3, we provide experimental results. Our simplicial construction
is useful for understanding the polyhedral construction and proving its correctness. '
acknowledgement: The authors want to thank the reviewers for many helpful comments
and suggestions.
alternative_title:
- LIPIcs
article_number: '27'
article_processing_charge: No
author:
- first_name: René
full_name: Corbet, René
last_name: Corbet
- first_name: Michael
full_name: Kerber, Michael
last_name: Kerber
- first_name: Michael
full_name: Lesnick, Michael
last_name: Lesnick
- 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: 'Corbet R, Kerber M, Lesnick M, Osang GF. Computing the multicover bifiltration.
In: Leibniz International Proceedings in Informatics. Vol 189. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.SoCG.2021.27'
apa: 'Corbet, R., Kerber, M., Lesnick, M., & Osang, G. F. (2021). Computing
the multicover bifiltration. In Leibniz International Proceedings in Informatics
(Vol. 189). Online: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2021.27'
chicago: Corbet, René, Michael Kerber, Michael Lesnick, and Georg F Osang. “Computing
the Multicover Bifiltration.” In Leibniz International Proceedings in Informatics,
Vol. 189. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.SoCG.2021.27.
ieee: R. Corbet, M. Kerber, M. Lesnick, and G. F. Osang, “Computing the multicover
bifiltration,” in Leibniz International Proceedings in Informatics, Online,
2021, vol. 189.
ista: 'Corbet R, Kerber M, Lesnick M, Osang GF. 2021. Computing the multicover bifiltration.
Leibniz International Proceedings in Informatics. SoCG: International Symposium
on Computational Geometry, LIPIcs, vol. 189, 27.'
mla: Corbet, René, et al. “Computing the Multicover Bifiltration.” Leibniz International
Proceedings in Informatics, vol. 189, 27, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2021, doi:10.4230/LIPIcs.SoCG.2021.27.
short: R. Corbet, M. Kerber, M. Lesnick, G.F. Osang, in:, Leibniz International
Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2021.
conference:
end_date: 2021-06-11
location: Online
name: 'SoCG: International Symposium on Computational Geometry'
start_date: 2021-06-07
date_created: 2021-06-27T22:01:49Z
date_published: 2021-06-02T00:00:00Z
date_updated: 2023-10-04T12:03:39Z
day: '02'
ddc:
- '516'
department:
- _id: HeEd
doi: 10.4230/LIPIcs.SoCG.2021.27
external_id:
arxiv:
- '2103.07823'
file:
- access_level: open_access
checksum: 0de217501e7ba8b267d58deed0d51761
content_type: application/pdf
creator: cziletti
date_created: 2021-06-28T12:40:47Z
date_updated: 2021-06-28T12:40:47Z
file_id: '9610'
file_name: 2021_LIPIcs_Corbet.pdf
file_size: '1367983'
relation: main_file
success: 1
file_date_updated: 2021-06-28T12:40:47Z
has_accepted_license: '1'
intvolume: ' 189'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: Leibniz International Proceedings in Informatics
publication_identifier:
isbn:
- '9783959771849'
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
link:
- relation: extended_version
url: https://arxiv.org/abs/2103.07823
record:
- id: '12709'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Computing the multicover bifiltration
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: D865714E-FA4E-11E9-B85B-F5C5E5697425
volume: 189
year: '2021'
...
---
_id: '9441'
abstract:
- lang: eng
text: "Isomanifolds are the generalization of isosurfaces to arbitrary dimension
and codimension, i.e. submanifolds of ℝ^d defined as the zero set of some multivariate
multivalued smooth function f: ℝ^d → ℝ^{d-n}, where n is the intrinsic dimension
of the manifold. A natural way to approximate a smooth isomanifold M is to consider
its Piecewise-Linear (PL) approximation M̂ based on a triangulation \U0001D4AF
of the ambient space ℝ^d. In this paper, we describe a simple algorithm to trace
isomanifolds from a given starting point. The algorithm works for arbitrary dimensions
n and d, and any precision D. Our main result is that, when f (or M) has bounded
complexity, the complexity of the algorithm is polynomial in d and δ = 1/D (and
unavoidably exponential in n). Since it is known that for δ = Ω (d^{2.5}), M̂
is O(D²)-close and isotopic to M, our algorithm produces a faithful PL-approximation
of isomanifolds of bounded complexity in time polynomial in d. Combining this
algorithm with dimensionality reduction techniques, the dependency on d in the
size of M̂ can be completely removed with high probability. We also show that
the algorithm can handle isomanifolds with boundary and, more generally, isostratifolds.
The algorithm for isomanifolds with boundary has been implemented and experimental
results are reported, showing that it is practical and can handle cases that are
far ahead of the state-of-the-art. "
acknowledgement: We thank Dominique Attali, Guilherme de Fonseca, Arijit Ghosh, Vincent
Pilaud and Aurélien Alvarez for their comments and suggestions. We also acknowledge
the reviewers.
alternative_title:
- LIPIcs
article_processing_charge: No
author:
- first_name: Jean-Daniel
full_name: Boissonnat, Jean-Daniel
last_name: Boissonnat
- first_name: Siargey
full_name: Kachanovich, Siargey
last_name: Kachanovich
- first_name: Mathijs
full_name: Wintraecken, Mathijs
id: 307CFBC8-F248-11E8-B48F-1D18A9856A87
last_name: Wintraecken
orcid: 0000-0002-7472-2220
citation:
ama: 'Boissonnat J-D, Kachanovich S, Wintraecken M. Tracing isomanifolds in Rd in
time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. In: 37th
International Symposium on Computational Geometry (SoCG 2021). Vol 189. Leibniz
International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2021:17:1-17:16. doi:10.4230/LIPIcs.SoCG.2021.17'
apa: 'Boissonnat, J.-D., Kachanovich, S., & Wintraecken, M. (2021). Tracing
isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations.
In 37th International Symposium on Computational Geometry (SoCG 2021) (Vol.
189, p. 17:1-17:16). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für
Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2021.17'
chicago: 'Boissonnat, Jean-Daniel, Siargey Kachanovich, and Mathijs Wintraecken.
“Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn
Triangulations.” In 37th International Symposium on Computational Geometry
(SoCG 2021), 189:17:1-17:16. Leibniz International Proceedings in Informatics
(LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2021. https://doi.org/10.4230/LIPIcs.SoCG.2021.17.'
ieee: J.-D. Boissonnat, S. Kachanovich, and M. Wintraecken, “Tracing isomanifolds
in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations,”
in 37th International Symposium on Computational Geometry (SoCG 2021),
Virtual, 2021, vol. 189, p. 17:1-17:16.
ista: 'Boissonnat J-D, Kachanovich S, Wintraecken M. 2021. Tracing isomanifolds
in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. 37th
International Symposium on Computational Geometry (SoCG 2021). SoCG: Symposium
on Computational GeometryLeibniz International Proceedings in Informatics (LIPIcs),
LIPIcs, vol. 189, 17:1-17:16.'
mla: Boissonnat, Jean-Daniel, et al. “Tracing Isomanifolds in Rd in Time Polynomial
in d Using Coxeter-Freudenthal-Kuhn Triangulations.” 37th International Symposium
on Computational Geometry (SoCG 2021), vol. 189, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2021, p. 17:1-17:16, doi:10.4230/LIPIcs.SoCG.2021.17.
short: J.-D. Boissonnat, S. Kachanovich, M. Wintraecken, in:, 37th International
Symposium on Computational Geometry (SoCG 2021), Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, Dagstuhl, Germany, 2021, p. 17:1-17:16.
conference:
end_date: 2021-06-11
location: Virtual
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2021-06-07
date_created: 2021-06-02T10:10:55Z
date_published: 2021-06-02T00:00:00Z
date_updated: 2023-10-10T07:34:34Z
day: '02'
ddc:
- '005'
- '516'
- '514'
department:
- _id: HeEd
doi: 10.4230/LIPIcs.SoCG.2021.17
ec_funded: 1
file:
- access_level: open_access
checksum: c322aa48d5d35a35877896cc565705b6
content_type: application/pdf
creator: mwintrae
date_created: 2021-06-02T10:22:33Z
date_updated: 2021-06-02T10:22:33Z
file_id: '9442'
file_name: LIPIcs-SoCG-2021-17.pdf
file_size: 1972902
relation: main_file
success: 1
file_date_updated: 2021-06-02T10:22:33Z
has_accepted_license: '1'
intvolume: ' 189'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 17:1-17:16
place: Dagstuhl, Germany
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: 37th International Symposium on Computational Geometry (SoCG 2021)
publication_identifier:
isbn:
- 978-3-95977-184-9
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '12960'
relation: later_version
status: public
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn
triangulations
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: D865714E-FA4E-11E9-B85B-F5C5E5697425
volume: 189
year: '2021'
...
---
_id: '9393'
abstract:
- lang: eng
text: "We consider the core algorithmic problems related to verification of systems
with respect to three classical quantitative properties, namely, the mean-payoff,
the ratio, and the minimum initial credit for energy property. The algorithmic
problem given a graph and a quantitative property asks to compute the optimal
value (the infimum value over all traces) from every node of the graph. We consider
graphs with bounded treewidth—a class that contains the control flow graphs of
most programs. Let n denote the number of nodes of a graph, m the number of edges
(for bounded treewidth \U0001D45A=\U0001D442(\U0001D45B)) and W the largest absolute
value of the weights. Our main theoretical results are as follows. First, for
the minimum initial credit problem we show that (1) for general graphs the problem
can be solved in \U0001D442(\U0001D45B2⋅\U0001D45A) time and the associated decision
problem in \U0001D442(\U0001D45B⋅\U0001D45A) time, improving the previous known
\U0001D442(\U0001D45B3⋅\U0001D45A⋅log(\U0001D45B⋅\U0001D44A)) and \U0001D442(\U0001D45B2⋅\U0001D45A)
bounds, respectively; and (2) for bounded treewidth graphs we present an algorithm
that requires \U0001D442(\U0001D45B⋅log\U0001D45B) time. Second, for bounded treewidth
graphs we present an algorithm that approximates the mean-payoff value within
a factor of 1+\U0001D716 in time \U0001D442(\U0001D45B⋅log(\U0001D45B/\U0001D716))
as compared to the classical exact algorithms on general graphs that require quadratic
time. Third, for the ratio property we present an algorithm that for bounded treewidth
graphs works in time \U0001D442(\U0001D45B⋅log(|\U0001D44E⋅\U0001D44F|))=\U0001D442(\U0001D45B⋅log(\U0001D45B⋅\U0001D44A)),
when the output is \U0001D44E\U0001D44F, as compared to the previously best known
algorithm on general graphs with running time \U0001D442(\U0001D45B2⋅log(\U0001D45B⋅\U0001D44A)).
We have implemented some of our algorithms and show that they present a significant
speedup on standard benchmarks."
acknowledgement: 'The research was partly supported by Austrian Science Fund (FWF)
Grant No P23499- N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start Grant
(279307: Graph Games), and Microsoft faculty fellows award.'
article_processing_charge: No
article_type: original
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Faster algorithms for quantitative
verification in bounded treewidth graphs. Formal Methods in System Design.
2021;57:401-428. doi:10.1007/s10703-021-00373-5
apa: Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2021). Faster algorithms
for quantitative verification in bounded treewidth graphs. Formal Methods in
System Design. Springer. https://doi.org/10.1007/s10703-021-00373-5
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis.
“Faster Algorithms for Quantitative Verification in Bounded Treewidth Graphs.”
Formal Methods in System Design. Springer, 2021. https://doi.org/10.1007/s10703-021-00373-5.
ieee: K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for
quantitative verification in bounded treewidth graphs,” Formal Methods in System
Design, vol. 57. Springer, pp. 401–428, 2021.
ista: Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2021. Faster algorithms for
quantitative verification in bounded treewidth graphs. Formal Methods in System
Design. 57, 401–428.
mla: Chatterjee, Krishnendu, et al. “Faster Algorithms for Quantitative Verification
in Bounded Treewidth Graphs.” Formal Methods in System Design, vol. 57,
Springer, 2021, pp. 401–28, doi:10.1007/s10703-021-00373-5.
short: K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Formal Methods in System
Design 57 (2021) 401–428.
date_created: 2021-05-16T22:01:47Z
date_published: 2021-09-01T00:00:00Z
date_updated: 2023-10-10T11:13:20Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/s10703-021-00373-5
ec_funded: 1
external_id:
arxiv:
- '1504.07384'
isi:
- '000645490300001'
intvolume: ' 57'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1504.07384
month: '09'
oa: 1
oa_version: Preprint
page: 401-428
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Formal Methods in System Design
publication_identifier:
eissn:
- 1572-8102
issn:
- 0925-9856
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
status: public
title: Faster algorithms for quantitative verification in bounded treewidth graphs
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 57
year: '2021'
...
---
_id: '9227'
abstract:
- lang: eng
text: In the multiway cut problem we are given a weighted undirected graph G=(V,E) and
a set T⊆V of k terminals. The goal is to find a minimum weight set of edges E′⊆E with
the property that by removing E′ from G all the terminals become disconnected.
In this paper we present a simple local search approximation algorithm for the
multiway cut problem with approximation ratio 2−2k . We present an experimental
evaluation of the performance of our local search algorithm and show that it greatly
outperforms the isolation heuristic of Dalhaus et al. and it has similar performance
as the much more complex algorithms of Calinescu et al., Sharma and Vondrak, and
Buchbinder et al. which have the currently best known approximation ratios for
this problem.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Andrew
full_name: Bloch-Hansen, Andrew
last_name: Bloch-Hansen
- first_name: Nasim
full_name: Samei, Nasim
id: C1531CAE-36E9-11EA-845F-33AA3DDC885E
last_name: Samei
- first_name: Roberto
full_name: Solis-Oba, Roberto
last_name: Solis-Oba
citation:
ama: 'Bloch-Hansen A, Samei N, Solis-Oba R. Experimental evaluation of a local search
approximation algorithm for the multiway cut problem. In: Conference on Algorithms
and Discrete Applied Mathematics. Vol 12601. Springer Nature; 2021:346-358.
doi:10.1007/978-3-030-67899-9_28'
apa: 'Bloch-Hansen, A., Samei, N., & Solis-Oba, R. (2021). Experimental evaluation
of a local search approximation algorithm for the multiway cut problem. In Conference
on Algorithms and Discrete Applied Mathematics (Vol. 12601, pp. 346–358).
Rupnagar, India: Springer Nature. https://doi.org/10.1007/978-3-030-67899-9_28'
chicago: Bloch-Hansen, Andrew, Nasim Samei, and Roberto Solis-Oba. “Experimental
Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem.”
In Conference on Algorithms and Discrete Applied Mathematics, 12601:346–58.
Springer Nature, 2021. https://doi.org/10.1007/978-3-030-67899-9_28.
ieee: A. Bloch-Hansen, N. Samei, and R. Solis-Oba, “Experimental evaluation of a
local search approximation algorithm for the multiway cut problem,” in Conference
on Algorithms and Discrete Applied Mathematics, Rupnagar, India, 2021, vol.
12601, pp. 346–358.
ista: 'Bloch-Hansen A, Samei N, Solis-Oba R. 2021. Experimental evaluation of a
local search approximation algorithm for the multiway cut problem. Conference
on Algorithms and Discrete Applied Mathematics. CALDAM: Conference on Algorithms
and Discrete Applied Mathematics, LNCS, vol. 12601, 346–358.'
mla: Bloch-Hansen, Andrew, et al. “Experimental Evaluation of a Local Search Approximation
Algorithm for the Multiway Cut Problem.” Conference on Algorithms and Discrete
Applied Mathematics, vol. 12601, Springer Nature, 2021, pp. 346–58, doi:10.1007/978-3-030-67899-9_28.
short: A. Bloch-Hansen, N. Samei, R. Solis-Oba, in:, Conference on Algorithms and
Discrete Applied Mathematics, Springer Nature, 2021, pp. 346–358.
conference:
end_date: 2021-02-13
location: Rupnagar, India
name: 'CALDAM: Conference on Algorithms and Discrete Applied Mathematics'
start_date: 2021-02-11
date_created: 2021-03-07T23:01:25Z
date_published: 2021-01-28T00:00:00Z
date_updated: 2023-10-10T09:29:08Z
day: '28'
department:
- _id: VlKo
doi: 10.1007/978-3-030-67899-9_28
intvolume: ' 12601'
language:
- iso: eng
month: '01'
oa_version: None
page: 346-358
publication: Conference on Algorithms and Discrete Applied Mathematics
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783030678982'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Experimental evaluation of a local search approximation algorithm for the multiway
cut problem
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 12601
year: '2021'
...
---
_id: '8817'
abstract:
- lang: eng
text: The paper introduces an inertial extragradient subgradient method with self-adaptive
step sizes for solving equilibrium problems in real Hilbert spaces. Weak convergence
of the proposed method is obtained under the condition that the bifunction is
pseudomonotone and Lipchitz continuous. Linear convergence is also given when
the bifunction is strongly pseudomonotone and Lipchitz continuous. Numerical implementations
and comparisons with other related inertial methods are given using test problems
including a real-world application to Nash–Cournot oligopolistic electricity market
equilibrium model.
acknowledgement: The authors are grateful to the two referees and the Associate Editor
for their comments and suggestions which have improved the earlier version of the
paper greatly. The project of Yekini Shehu has received funding from the European
Research Council (ERC) under the European Union’s Seventh Framework Program (FP7
- 2007-2013) (Grant agreement No. 616160).
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: Olaniyi S.
full_name: Iyiola, Olaniyi S.
last_name: Iyiola
- first_name: Duong Viet
full_name: Thong, Duong Viet
last_name: Thong
- first_name: Nguyen Thi Cam
full_name: Van, Nguyen Thi Cam
last_name: Van
citation:
ama: Shehu Y, Iyiola OS, Thong DV, Van NTC. An inertial subgradient extragradient
algorithm extended to pseudomonotone equilibrium problems. Mathematical Methods
of Operations Research. 2021;93(2):213-242. doi:10.1007/s00186-020-00730-w
apa: Shehu, Y., Iyiola, O. S., Thong, D. V., & Van, N. T. C. (2021). An inertial
subgradient extragradient algorithm extended to pseudomonotone equilibrium problems.
Mathematical Methods of Operations Research. Springer Nature. https://doi.org/10.1007/s00186-020-00730-w
chicago: Shehu, Yekini, Olaniyi S. Iyiola, Duong Viet Thong, and Nguyen Thi Cam
Van. “An Inertial Subgradient Extragradient Algorithm Extended to Pseudomonotone
Equilibrium Problems.” Mathematical Methods of Operations Research. Springer
Nature, 2021. https://doi.org/10.1007/s00186-020-00730-w.
ieee: Y. Shehu, O. S. Iyiola, D. V. Thong, and N. T. C. Van, “An inertial subgradient
extragradient algorithm extended to pseudomonotone equilibrium problems,” Mathematical
Methods of Operations Research, vol. 93, no. 2. Springer Nature, pp. 213–242,
2021.
ista: Shehu Y, Iyiola OS, Thong DV, Van NTC. 2021. An inertial subgradient extragradient
algorithm extended to pseudomonotone equilibrium problems. Mathematical Methods
of Operations Research. 93(2), 213–242.
mla: Shehu, Yekini, et al. “An Inertial Subgradient Extragradient Algorithm Extended
to Pseudomonotone Equilibrium Problems.” Mathematical Methods of Operations
Research, vol. 93, no. 2, Springer Nature, 2021, pp. 213–42, doi:10.1007/s00186-020-00730-w.
short: Y. Shehu, O.S. Iyiola, D.V. Thong, N.T.C. Van, Mathematical Methods of Operations
Research 93 (2021) 213–242.
date_created: 2020-11-29T23:01:18Z
date_published: 2021-04-01T00:00:00Z
date_updated: 2023-10-10T09:30:23Z
day: '01'
department:
- _id: VlKo
doi: 10.1007/s00186-020-00730-w
ec_funded: 1
external_id:
isi:
- '000590497300001'
intvolume: ' 93'
isi: 1
issue: '2'
language:
- iso: eng
month: '04'
oa_version: None
page: 213-242
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: Mathematical Methods of Operations Research
publication_identifier:
eissn:
- 1432-5217
issn:
- 1432-2994
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: An inertial subgradient extragradient algorithm extended to pseudomonotone
equilibrium problems
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 93
year: '2021'
...
---
_id: '9315'
abstract:
- lang: eng
text: We consider inertial iteration methods for Fermat–Weber location problem and
primal–dual three-operator splitting in real Hilbert spaces. To do these, we first
obtain weak convergence analysis and nonasymptotic O(1/n) convergence rate of
the inertial Krasnoselskii–Mann iteration for fixed point of nonexpansive operators
in infinite dimensional real Hilbert spaces under some seemingly easy to implement
conditions on the iterative parameters. One of our contributions is that the convergence
analysis and rate of convergence results are obtained using conditions which appear
not complicated and restrictive as assumed in other previous related results in
the literature. We then show that Fermat–Weber location problem and primal–dual
three-operator splitting are special cases of fixed point problem of nonexpansive
mapping and consequently obtain the convergence analysis of inertial iteration
methods for Fermat–Weber location problem and primal–dual three-operator splitting
in real Hilbert spaces. Some numerical implementations are drawn from primal–dual
three-operator splitting to support the theoretical analysis.
acknowledgement: The research of this author is supported by the Postdoctoral Fellowship
from Institute of Science and Technology (IST), Austria.
article_number: '75'
article_processing_charge: No
article_type: original
author:
- first_name: Olaniyi S.
full_name: Iyiola, Olaniyi S.
last_name: Iyiola
- first_name: Yekini
full_name: Shehu, Yekini
id: 3FC7CB58-F248-11E8-B48F-1D18A9856A87
last_name: Shehu
orcid: 0000-0001-9224-7139
citation:
ama: Iyiola OS, Shehu Y. New convergence results for inertial Krasnoselskii–Mann
iterations in Hilbert spaces with applications. Results in Mathematics.
2021;76(2). doi:10.1007/s00025-021-01381-x
apa: Iyiola, O. S., & Shehu, Y. (2021). New convergence results for inertial
Krasnoselskii–Mann iterations in Hilbert spaces with applications. Results
in Mathematics. Springer Nature. https://doi.org/10.1007/s00025-021-01381-x
chicago: Iyiola, Olaniyi S., and Yekini Shehu. “New Convergence Results for Inertial
Krasnoselskii–Mann Iterations in Hilbert Spaces with Applications.” Results
in Mathematics. Springer Nature, 2021. https://doi.org/10.1007/s00025-021-01381-x.
ieee: O. S. Iyiola and Y. Shehu, “New convergence results for inertial Krasnoselskii–Mann
iterations in Hilbert spaces with applications,” Results in Mathematics,
vol. 76, no. 2. Springer Nature, 2021.
ista: Iyiola OS, Shehu Y. 2021. New convergence results for inertial Krasnoselskii–Mann
iterations in Hilbert spaces with applications. Results in Mathematics. 76(2),
75.
mla: Iyiola, Olaniyi S., and Yekini Shehu. “New Convergence Results for Inertial
Krasnoselskii–Mann Iterations in Hilbert Spaces with Applications.” Results
in Mathematics, vol. 76, no. 2, 75, Springer Nature, 2021, doi:10.1007/s00025-021-01381-x.
short: O.S. Iyiola, Y. Shehu, Results in Mathematics 76 (2021).
date_created: 2021-04-11T22:01:14Z
date_published: 2021-03-25T00:00:00Z
date_updated: 2023-10-10T09:47:33Z
day: '25'
department:
- _id: VlKo
doi: 10.1007/s00025-021-01381-x
external_id:
isi:
- '000632917700001'
intvolume: ' 76'
isi: 1
issue: '2'
language:
- iso: eng
month: '03'
oa_version: None
publication: Results in Mathematics
publication_identifier:
eissn:
- 1420-9012
issn:
- 1422-6383
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: New convergence results for inertial Krasnoselskii–Mann iterations in Hilbert
spaces with applications
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 76
year: '2021'
...
---
_id: '9365'
abstract:
- lang: eng
text: In this paper, we propose a new iterative method with alternated inertial
step for solving split common null point problem in real Hilbert spaces. We obtain
weak convergence of the proposed iterative algorithm. Furthermore, we introduce
the notion of bounded linear regularity property for the split common null point
problem and obtain the linear convergence property for the new algorithm under
some mild assumptions. Finally, we provide some numerical examples to demonstrate
the performance and efficiency of the proposed method.
acknowledgement: The second author has received funding from the European Research
Council (ERC) under the European Union's Seventh Framework Program (FP7-2007-2013)
(Grant agreement No. 616160).
article_processing_charge: No
article_type: original
author:
- first_name: Ferdinard U.
full_name: Ogbuisi, Ferdinard U.
last_name: Ogbuisi
- first_name: Yekini
full_name: Shehu, Yekini
id: 3FC7CB58-F248-11E8-B48F-1D18A9856A87
last_name: Shehu
orcid: 0000-0001-9224-7139
- first_name: Jen Chih
full_name: Yao, Jen Chih
last_name: Yao
citation:
ama: Ogbuisi FU, Shehu Y, Yao JC. Convergence analysis of new inertial method for
the split common null point problem. Optimization. 2021. doi:10.1080/02331934.2021.1914035
apa: Ogbuisi, F. U., Shehu, Y., & Yao, J. C. (2021). Convergence analysis of
new inertial method for the split common null point problem. Optimization.
Taylor and Francis. https://doi.org/10.1080/02331934.2021.1914035
chicago: Ogbuisi, Ferdinard U., Yekini Shehu, and Jen Chih Yao. “Convergence Analysis
of New Inertial Method for the Split Common Null Point Problem.” Optimization.
Taylor and Francis, 2021. https://doi.org/10.1080/02331934.2021.1914035.
ieee: F. U. Ogbuisi, Y. Shehu, and J. C. Yao, “Convergence analysis of new inertial
method for the split common null point problem,” Optimization. Taylor and
Francis, 2021.
ista: Ogbuisi FU, Shehu Y, Yao JC. 2021. Convergence analysis of new inertial method
for the split common null point problem. Optimization.
mla: Ogbuisi, Ferdinard U., et al. “Convergence Analysis of New Inertial Method
for the Split Common Null Point Problem.” Optimization, Taylor and Francis,
2021, doi:10.1080/02331934.2021.1914035.
short: F.U. Ogbuisi, Y. Shehu, J.C. Yao, Optimization (2021).
date_created: 2021-05-02T22:01:29Z
date_published: 2021-04-14T00:00:00Z
date_updated: 2023-10-10T09:48:41Z
day: '14'
department:
- _id: VlKo
doi: 10.1080/02331934.2021.1914035
ec_funded: 1
external_id:
isi:
- '000640109300001'
isi: 1
language:
- iso: eng
month: '04'
oa_version: None
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: Optimization
publication_identifier:
eissn:
- 1029-4945
issn:
- 0233-1934
publication_status: published
publisher: Taylor and Francis
quality_controlled: '1'
scopus_import: '1'
status: public
title: Convergence analysis of new inertial method for the split common null point
problem
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10365'
abstract:
- lang: eng
text: The early development of many organisms involves the folding of cell monolayers,
but this behaviour is difficult to reproduce in vitro; therefore, both mechanistic
causes and effects of local curvature remain unclear. Here we study epithelial
cell monolayers on corrugated hydrogels engineered into wavy patterns, examining
how concave and convex curvatures affect cellular and nuclear shape. We find that
substrate curvature affects monolayer thickness, which is larger in valleys than
crests. We show that this feature generically arises in a vertex model, leading
to the hypothesis that cells may sense curvature by modifying the thickness of
the tissue. We find that local curvature also affects nuclear morphology and positioning,
which we explain by extending the vertex model to take into account membrane–nucleus
interactions, encoding thickness modulation in changes to nuclear deformation
and position. We propose that curvature governs the spatial distribution of yes-associated
proteins via nuclear shape and density changes. We show that curvature also induces
significant variations in lamins, chromatin condensation and cell proliferation
rate in folded epithelial tissues. Together, this work identifies active cell
mechanics and nuclear mechanoadaptation as the key players of the mechanistic
regulation of epithelia to substrate curvature.
acknowledgement: S.G. acknowledges funding from FEDER Prostem Research Project no.
1510614 (Wallonia DG06), F.R.S.-FNRS Epiforce Research Project no. T.0092.21 and
Interreg MAT(T)ISSE project, which is financially supported by Interreg France-Wallonie-Vlaanderen
(Fonds Européen de Développement Régional, FEDER-ERDF). This project was supported
by the European Research Council under the European Union’s Horizon 2020 Research
and Innovation Programme grant agreement 851288 (to E.H.), and by the Austrian Science
Fund (FWF) (P 31639; to E.H.). L.R.M. acknowledges funding from the Agence National
de la Recherche (ANR), as part of the ‘Investments d’Avenir’ Programme (I-SITE ULNE/ANR-16-IDEX-0004
ULNE). This work benefited from ANR-10-EQPX-04-01 and FEDER 12001407 grants to F.L.
W.D.V. is supported by the Research Foundation Flanders (FWO 1516619N, FWO GOO5819N,
FWO I003420N, FWO IRI I000321N) and is member of the Research Excellence Consortium
µNEURO at the University of Antwerp. M.L. is financially supported by FRIA (F.R.S.-FNRS).
M.S. is a Senior Research Associate of the Fund for Scientific Research (F.R.S.-FNRS)
and acknowledges EOS grant no. 30650939 (PRECISION). Sketches in Figs. 1a and 5e
and Extended Data Fig. 9 were drawn by C. Levicek.
article_processing_charge: No
article_type: original
author:
- first_name: Marine
full_name: Luciano, Marine
last_name: Luciano
- first_name: Shi-lei
full_name: Xue, Shi-lei
id: 31D2C804-F248-11E8-B48F-1D18A9856A87
last_name: Xue
- first_name: Winnok H.
full_name: De Vos, Winnok H.
last_name: De Vos
- first_name: Lorena
full_name: Redondo-Morata, Lorena
last_name: Redondo-Morata
- first_name: Mathieu
full_name: Surin, Mathieu
last_name: Surin
- first_name: Frank
full_name: Lafont, Frank
last_name: Lafont
- first_name: Edouard B
full_name: Hannezo, Edouard B
id: 3A9DB764-F248-11E8-B48F-1D18A9856A87
last_name: Hannezo
orcid: 0000-0001-6005-1561
- first_name: Sylvain
full_name: Gabriele, Sylvain
last_name: Gabriele
citation:
ama: Luciano M, Xue S, De Vos WH, et al. Cell monolayers sense curvature by exploiting
active mechanics and nuclear mechanoadaptation. Nature Physics. 2021;17(12):1382–1390.
doi:10.1038/s41567-021-01374-1
apa: Luciano, M., Xue, S., De Vos, W. H., Redondo-Morata, L., Surin, M., Lafont,
F., … Gabriele, S. (2021). Cell monolayers sense curvature by exploiting active
mechanics and nuclear mechanoadaptation. Nature Physics. Springer Nature.
https://doi.org/10.1038/s41567-021-01374-1
chicago: Luciano, Marine, Shi-lei Xue, Winnok H. De Vos, Lorena Redondo-Morata,
Mathieu Surin, Frank Lafont, Edouard B Hannezo, and Sylvain Gabriele. “Cell Monolayers
Sense Curvature by Exploiting Active Mechanics and Nuclear Mechanoadaptation.”
Nature Physics. Springer Nature, 2021. https://doi.org/10.1038/s41567-021-01374-1.
ieee: M. Luciano et al., “Cell monolayers sense curvature by exploiting active
mechanics and nuclear mechanoadaptation,” Nature Physics, vol. 17, no.
12. Springer Nature, pp. 1382–1390, 2021.
ista: Luciano M, Xue S, De Vos WH, Redondo-Morata L, Surin M, Lafont F, Hannezo
EB, Gabriele S. 2021. Cell monolayers sense curvature by exploiting active mechanics
and nuclear mechanoadaptation. Nature Physics. 17(12), 1382–1390.
mla: Luciano, Marine, et al. “Cell Monolayers Sense Curvature by Exploiting Active
Mechanics and Nuclear Mechanoadaptation.” Nature Physics, vol. 17, no.
12, Springer Nature, 2021, pp. 1382–1390, doi:10.1038/s41567-021-01374-1.
short: M. Luciano, S. Xue, W.H. De Vos, L. Redondo-Morata, M. Surin, F. Lafont,
E.B. Hannezo, S. Gabriele, Nature Physics 17 (2021) 1382–1390.
date_created: 2021-11-28T23:01:29Z
date_published: 2021-11-18T00:00:00Z
date_updated: 2023-10-16T06:31:54Z
day: '18'
ddc:
- '530'
department:
- _id: EdHa
doi: 10.1038/s41567-021-01374-1
ec_funded: 1
external_id:
isi:
- '000720204300004'
file:
- access_level: open_access
checksum: 5d6d76750a71d7cb632bb15417c38ef7
content_type: application/pdf
creator: channezo
date_created: 2023-10-11T09:31:43Z
date_updated: 2023-10-11T09:31:43Z
file_id: '14420'
file_name: 50145_4_merged_1630498627.pdf
file_size: 40285498
relation: main_file
success: 1
file_date_updated: 2023-10-11T09:31:43Z
has_accepted_license: '1'
intvolume: ' 17'
isi: 1
issue: '12'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
page: 1382–1390
project:
- _id: 05943252-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '851288'
name: Design Principles of Branching Morphogenesis
- _id: 268294B6-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P31639
name: Active mechano-chemical description of the cell cytoskeleton
publication: Nature Physics
publication_identifier:
eissn:
- 1745-2481
issn:
- 1745-2473
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- description: News on IST Webpage
relation: press_release
url: https://ist.ac.at/en/news/how-cells-feel-curvature/
scopus_import: '1'
status: public
title: Cell monolayers sense curvature by exploiting active mechanics and nuclear
mechanoadaptation
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 17
year: '2021'
...
---
_id: '9298'
abstract:
- lang: eng
text: 'In 2008, we published the first set of guidelines for standardizing research
in autophagy. Since then, this topic has received increasing attention, and many
scientists have entered the field. Our knowledge base and relevant new technologies
have also been expanding. Thus, it is important to formulate on a regular basis
updated guidelines for monitoring autophagy in different organisms. Despite numerous
reviews, there continues to be confusion regarding acceptable methods to evaluate
autophagy, especially in multicellular eukaryotes. Here, we present a set of guidelines
for investigators to select and interpret methods to examine autophagy and related
processes, and for reviewers to provide realistic and reasonable critiques of
reports that are focused on these processes. These guidelines are not meant to
be a dogmatic set of rules, because the appropriateness of any assay largely depends
on the question being asked and the system being used. Moreover, no individual
assay is perfect for every situation, calling for the use of multiple techniques
to properly monitor autophagy in each experimental setting. Finally, several core
components of the autophagy machinery have been implicated in distinct autophagic
processes (canonical and noncanonical autophagy), implying that genetic approaches
to block autophagy should rely on targeting two or more autophagy-related genes
that ideally participate in distinct steps of the pathway. Along similar lines,
because multiple proteins involved in autophagy also regulate other cellular pathways
including apoptosis, not all of them can be used as a specific marker for bona
fide autophagic responses. Here, we critically discuss current methods of assessing
autophagy and the information they can, or cannot, provide. Our ultimate goal
is to encourage intellectual and technical innovation in the field. '
acknowledgement: This work was supported by the National Institute of General Medical
Sciences [GM131919]. Due to space and other limitations, it is not possible to include
all other sources of financial support.
article_processing_charge: No
article_type: review
author:
- first_name: Daniel J.
full_name: Klionsky, Daniel J.
last_name: Klionsky
- first_name: Amal Kamal
full_name: Abdel-Aziz, Amal Kamal
last_name: Abdel-Aziz
- first_name: Sara
full_name: Abdelfatah, Sara
last_name: Abdelfatah
- first_name: Mahmoud
full_name: Abdellatif, Mahmoud
last_name: Abdellatif
- first_name: Asghar
full_name: Abdoli, Asghar
last_name: Abdoli
- first_name: Steffen
full_name: Abel, Steffen
last_name: Abel
- first_name: Hagai
full_name: Abeliovich, Hagai
last_name: Abeliovich
- first_name: Marie H.
full_name: Abildgaard, Marie H.
last_name: Abildgaard
- first_name: Yakubu Princely
full_name: Abudu, Yakubu Princely
last_name: Abudu
- first_name: Abraham
full_name: Acevedo-Arozena, Abraham
last_name: Acevedo-Arozena
- first_name: Iannis E.
full_name: Adamopoulos, Iannis E.
last_name: Adamopoulos
- first_name: Khosrow
full_name: Adeli, Khosrow
last_name: Adeli
- first_name: Timon E.
full_name: Adolph, Timon E.
last_name: Adolph
- first_name: Annagrazia
full_name: Adornetto, Annagrazia
last_name: Adornetto
- first_name: Elma
full_name: Aflaki, Elma
last_name: Aflaki
- first_name: Galila
full_name: Agam, Galila
last_name: Agam
- first_name: Anupam
full_name: Agarwal, Anupam
last_name: Agarwal
- first_name: Bharat B.
full_name: Aggarwal, Bharat B.
last_name: Aggarwal
- first_name: Maria
full_name: Agnello, Maria
last_name: Agnello
- first_name: Patrizia
full_name: Agostinis, Patrizia
last_name: Agostinis
- first_name: Javed N.
full_name: Agrewala, Javed N.
last_name: Agrewala
- first_name: Alexander
full_name: Agrotis, Alexander
last_name: Agrotis
- first_name: Patricia V.
full_name: Aguilar, Patricia V.
last_name: Aguilar
- first_name: S. Tariq
full_name: Ahmad, S. Tariq
last_name: Ahmad
- first_name: Zubair M.
full_name: Ahmed, Zubair M.
last_name: Ahmed
- first_name: Ulises
full_name: Ahumada-Castro, Ulises
last_name: Ahumada-Castro
- first_name: Sonja
full_name: Aits, Sonja
last_name: Aits
- first_name: Shu
full_name: Aizawa, Shu
last_name: Aizawa
- first_name: Yunus
full_name: Akkoc, Yunus
last_name: Akkoc
- first_name: Tonia
full_name: Akoumianaki, Tonia
last_name: Akoumianaki
- first_name: Hafize Aysin
full_name: Akpinar, Hafize Aysin
last_name: Akpinar
- first_name: Ahmed M.
full_name: Al-Abd, Ahmed M.
last_name: Al-Abd
- first_name: Lina
full_name: Al-Akra, Lina
last_name: Al-Akra
- first_name: Abeer
full_name: Al-Gharaibeh, Abeer
last_name: Al-Gharaibeh
- first_name: Moulay A.
full_name: Alaoui-Jamali, Moulay A.
last_name: Alaoui-Jamali
- first_name: Simon
full_name: Alberti, Simon
last_name: Alberti
- first_name: Elísabet
full_name: Alcocer-Gómez, Elísabet
last_name: Alcocer-Gómez
- first_name: Cristiano
full_name: Alessandri, Cristiano
last_name: Alessandri
- first_name: Muhammad
full_name: Ali, Muhammad
last_name: Ali
- first_name: M. Abdul
full_name: Alim Al-Bari, M. Abdul
last_name: Alim Al-Bari
- first_name: Saeb
full_name: Aliwaini, Saeb
last_name: Aliwaini
- first_name: Javad
full_name: Alizadeh, Javad
last_name: Alizadeh
- first_name: Eugènia
full_name: Almacellas, Eugènia
last_name: Almacellas
- first_name: Alexandru
full_name: Almasan, Alexandru
last_name: Almasan
- first_name: Alicia
full_name: Alonso, Alicia
last_name: Alonso
- first_name: Guillermo D.
full_name: Alonso, Guillermo D.
last_name: Alonso
- first_name: Nihal
full_name: Altan-Bonnet, Nihal
last_name: Altan-Bonnet
- first_name: Dario C.
full_name: Altieri, Dario C.
last_name: Altieri
- first_name: Élida M.C.
full_name: Álvarez, Élida M.C.
last_name: Álvarez
- first_name: Sara
full_name: Alves, Sara
last_name: Alves
- first_name: Cristine
full_name: Alves Da Costa, Cristine
last_name: Alves Da Costa
- first_name: Mazen M.
full_name: Alzaharna, Mazen M.
last_name: Alzaharna
- first_name: Marialaura
full_name: Amadio, Marialaura
last_name: Amadio
- first_name: Consuelo
full_name: Amantini, Consuelo
last_name: Amantini
- first_name: Cristina
full_name: Amaral, Cristina
last_name: Amaral
- first_name: Susanna
full_name: Ambrosio, Susanna
last_name: Ambrosio
- first_name: Amal O.
full_name: Amer, Amal O.
last_name: Amer
- first_name: Veena
full_name: Ammanathan, Veena
last_name: Ammanathan
- first_name: Zhenyi
full_name: An, Zhenyi
last_name: An
- first_name: Stig U.
full_name: Andersen, Stig U.
last_name: Andersen
- first_name: Shaida A.
full_name: Andrabi, Shaida A.
last_name: Andrabi
- first_name: Magaiver
full_name: Andrade-Silva, Magaiver
last_name: Andrade-Silva
- first_name: Allen M.
full_name: Andres, Allen M.
last_name: Andres
- first_name: Sabrina
full_name: Angelini, Sabrina
last_name: Angelini
- first_name: David
full_name: Ann, David
last_name: Ann
- first_name: Uche C.
full_name: Anozie, Uche C.
last_name: Anozie
- first_name: Mohammad Y.
full_name: Ansari, Mohammad Y.
last_name: Ansari
- first_name: Pedro
full_name: Antas, Pedro
last_name: Antas
- first_name: Adam
full_name: Antebi, Adam
last_name: Antebi
- first_name: Zuriñe
full_name: Antón, Zuriñe
last_name: Antón
- first_name: Tahira
full_name: Anwar, Tahira
last_name: Anwar
- first_name: Lionel
full_name: Apetoh, Lionel
last_name: Apetoh
- first_name: Nadezda
full_name: Apostolova, Nadezda
last_name: Apostolova
- first_name: Toshiyuki
full_name: Araki, Toshiyuki
last_name: Araki
- first_name: Yasuhiro
full_name: Araki, Yasuhiro
last_name: Araki
- first_name: Kohei
full_name: Arasaki, Kohei
last_name: Arasaki
- first_name: Wagner L.
full_name: Araújo, Wagner L.
last_name: Araújo
- first_name: Jun
full_name: Araya, Jun
last_name: Araya
- first_name: Catherine
full_name: Arden, Catherine
last_name: Arden
- first_name: Maria Angeles
full_name: Arévalo, Maria Angeles
last_name: Arévalo
- first_name: Sandro
full_name: Arguelles, Sandro
last_name: Arguelles
- first_name: Esperanza
full_name: Arias, Esperanza
last_name: Arias
- first_name: Jyothi
full_name: Arikkath, Jyothi
last_name: Arikkath
- first_name: Hirokazu
full_name: Arimoto, Hirokazu
last_name: Arimoto
- first_name: Aileen R.
full_name: Ariosa, Aileen R.
last_name: Ariosa
- first_name: Darius
full_name: Armstrong-James, Darius
last_name: Armstrong-James
- first_name: Laetitia
full_name: Arnauné-Pelloquin, Laetitia
last_name: Arnauné-Pelloquin
- first_name: Angeles
full_name: Aroca, Angeles
last_name: Aroca
- first_name: Daniela S.
full_name: Arroyo, Daniela S.
last_name: Arroyo
- first_name: Ivica
full_name: Arsov, Ivica
last_name: Arsov
- first_name: Rubén
full_name: Artero, Rubén
last_name: Artero
- first_name: Dalia Maria Lucia
full_name: Asaro, Dalia Maria Lucia
last_name: Asaro
- first_name: Michael
full_name: Aschner, Michael
last_name: Aschner
- first_name: Milad
full_name: Ashrafizadeh, Milad
last_name: Ashrafizadeh
- first_name: Osnat
full_name: Ashur-Fabian, Osnat
last_name: Ashur-Fabian
- first_name: Atanas G.
full_name: Atanasov, Atanas G.
last_name: Atanasov
- first_name: Alicia K.
full_name: Au, Alicia K.
last_name: Au
- first_name: Patrick
full_name: Auberger, Patrick
last_name: Auberger
- first_name: Holger W.
full_name: Auner, Holger W.
last_name: Auner
- first_name: Laure
full_name: Aurelian, Laure
last_name: Aurelian
- first_name: Riccardo
full_name: Autelli, Riccardo
last_name: Autelli
- first_name: Laura
full_name: Avagliano, Laura
last_name: Avagliano
- first_name: Yenniffer
full_name: Ávalos, Yenniffer
last_name: Ávalos
- first_name: Sanja
full_name: Aveic, Sanja
last_name: Aveic
- first_name: Célia Alexandra
full_name: Aveleira, Célia Alexandra
last_name: Aveleira
- first_name: Tamar
full_name: Avin-Wittenberg, Tamar
last_name: Avin-Wittenberg
- first_name: Yucel
full_name: Aydin, Yucel
last_name: Aydin
- first_name: Scott
full_name: Ayton, Scott
last_name: Ayton
- first_name: Srinivas
full_name: Ayyadevara, Srinivas
last_name: Ayyadevara
- first_name: Maria
full_name: Azzopardi, Maria
last_name: Azzopardi
- first_name: Misuzu
full_name: Baba, Misuzu
last_name: Baba
- first_name: Jonathan M.
full_name: Backer, Jonathan M.
last_name: Backer
- first_name: Steven K.
full_name: Backues, Steven K.
last_name: Backues
- first_name: Dong Hun
full_name: Bae, Dong Hun
last_name: Bae
- first_name: Ok Nam
full_name: Bae, Ok Nam
last_name: Bae
- first_name: Soo Han
full_name: Bae, Soo Han
last_name: Bae
- first_name: Eric H.
full_name: Baehrecke, Eric H.
last_name: Baehrecke
- first_name: Ahruem
full_name: Baek, Ahruem
last_name: Baek
- first_name: Seung Hoon
full_name: Baek, Seung Hoon
last_name: Baek
- first_name: Sung Hee
full_name: Baek, Sung Hee
last_name: Baek
- first_name: Giacinto
full_name: Bagetta, Giacinto
last_name: Bagetta
- first_name: Agnieszka
full_name: Bagniewska-Zadworna, Agnieszka
last_name: Bagniewska-Zadworna
- first_name: Hua
full_name: Bai, Hua
last_name: Bai
- first_name: Jie
full_name: Bai, Jie
last_name: Bai
- first_name: Xiyuan
full_name: Bai, Xiyuan
last_name: Bai
- first_name: Yidong
full_name: Bai, Yidong
last_name: Bai
- first_name: Nandadulal
full_name: Bairagi, Nandadulal
last_name: Bairagi
- first_name: Shounak
full_name: Baksi, Shounak
last_name: Baksi
- first_name: Teresa
full_name: Balbi, Teresa
last_name: Balbi
- first_name: Cosima T.
full_name: Baldari, Cosima T.
last_name: Baldari
- first_name: Walter
full_name: Balduini, Walter
last_name: Balduini
- first_name: Andrea
full_name: Ballabio, Andrea
last_name: Ballabio
- first_name: Maria
full_name: Ballester, Maria
last_name: Ballester
- first_name: Salma
full_name: Balazadeh, Salma
last_name: Balazadeh
- first_name: Rena
full_name: Balzan, Rena
last_name: Balzan
- first_name: Rina
full_name: Bandopadhyay, Rina
last_name: Bandopadhyay
- first_name: Sreeparna
full_name: Banerjee, Sreeparna
last_name: Banerjee
- first_name: Sulagna
full_name: Banerjee, Sulagna
last_name: Banerjee
- first_name: Ágnes
full_name: Bánréti, Ágnes
last_name: Bánréti
- first_name: Yan
full_name: Bao, Yan
last_name: Bao
- first_name: Mauricio S.
full_name: Baptista, Mauricio S.
last_name: Baptista
- first_name: Alessandra
full_name: Baracca, Alessandra
last_name: Baracca
- first_name: Cristiana
full_name: Barbati, Cristiana
last_name: Barbati
- first_name: Ariadna
full_name: Bargiela, Ariadna
last_name: Bargiela
- first_name: Daniela
full_name: Barilà, Daniela
last_name: Barilà
- first_name: Peter G.
full_name: Barlow, Peter G.
last_name: Barlow
- first_name: Sami J.
full_name: Barmada, Sami J.
last_name: Barmada
- first_name: Esther
full_name: Barreiro, Esther
last_name: Barreiro
- first_name: George E.
full_name: Barreto, George E.
last_name: Barreto
- first_name: Jiri
full_name: Bartek, Jiri
last_name: Bartek
- first_name: Bonnie
full_name: Bartel, Bonnie
last_name: Bartel
- first_name: Alberto
full_name: Bartolome, Alberto
last_name: Bartolome
- first_name: Gaurav R.
full_name: Barve, Gaurav R.
last_name: Barve
- first_name: Suresh H.
full_name: Basagoudanavar, Suresh H.
last_name: Basagoudanavar
- first_name: Diane C.
full_name: Bassham, Diane C.
last_name: Bassham
- first_name: Robert C.
full_name: Bast, Robert C.
last_name: Bast
- first_name: Alakananda
full_name: Basu, Alakananda
last_name: Basu
- first_name: Henri
full_name: Batoko, Henri
last_name: Batoko
- first_name: Isabella
full_name: Batten, Isabella
last_name: Batten
- first_name: Etienne E.
full_name: Baulieu, Etienne E.
last_name: Baulieu
- first_name: Bradley L.
full_name: Baumgarner, Bradley L.
last_name: Baumgarner
- first_name: Jagadeesh
full_name: Bayry, Jagadeesh
last_name: Bayry
- first_name: Rupert
full_name: Beale, Rupert
last_name: Beale
- first_name: Isabelle
full_name: Beau, Isabelle
last_name: Beau
- first_name: Florian
full_name: Beaumatin, Florian
last_name: Beaumatin
- first_name: Luiz R.G.
full_name: Bechara, Luiz R.G.
last_name: Bechara
- first_name: George R.
full_name: Beck, George R.
last_name: Beck
- first_name: Michael F.
full_name: Beers, Michael F.
last_name: Beers
- first_name: Jakob
full_name: Begun, Jakob
last_name: Begun
- first_name: Christian
full_name: Behrends, Christian
last_name: Behrends
- first_name: Georg M.N.
full_name: Behrens, Georg M.N.
last_name: Behrens
- first_name: Roberto
full_name: Bei, Roberto
last_name: Bei
- first_name: Eloy
full_name: Bejarano, Eloy
last_name: Bejarano
- first_name: Shai
full_name: Bel, Shai
last_name: Bel
- first_name: Christian
full_name: Behl, Christian
last_name: Behl
- first_name: Amine
full_name: Belaid, Amine
last_name: Belaid
- first_name: Naïma
full_name: Belgareh-Touzé, Naïma
last_name: Belgareh-Touzé
- first_name: Cristina
full_name: Bellarosa, Cristina
last_name: Bellarosa
- first_name: Francesca
full_name: Belleudi, Francesca
last_name: Belleudi
- first_name: Melissa
full_name: Belló Pérez, Melissa
last_name: Belló Pérez
- first_name: Raquel
full_name: Bello-Morales, Raquel
last_name: Bello-Morales
- first_name: Jackeline Soares De Oliveira
full_name: Beltran, Jackeline Soares De Oliveira
last_name: Beltran
- first_name: Sebastián
full_name: Beltran, Sebastián
last_name: Beltran
- first_name: Doris Mangiaracina
full_name: Benbrook, Doris Mangiaracina
last_name: Benbrook
- first_name: Mykolas
full_name: Bendorius, Mykolas
last_name: Bendorius
- first_name: Bruno A.
full_name: Benitez, Bruno A.
last_name: Benitez
- first_name: Irene
full_name: Benito-Cuesta, Irene
last_name: Benito-Cuesta
- first_name: Julien
full_name: Bensalem, Julien
last_name: Bensalem
- first_name: Martin W.
full_name: Berchtold, Martin W.
last_name: Berchtold
- first_name: Sabina
full_name: Berezowska, Sabina
last_name: Berezowska
- first_name: Daniele
full_name: Bergamaschi, Daniele
last_name: Bergamaschi
- first_name: Matteo
full_name: Bergami, Matteo
last_name: Bergami
- first_name: Andreas
full_name: Bergmann, Andreas
last_name: Bergmann
- first_name: Laura
full_name: Berliocchi, Laura
last_name: Berliocchi
- first_name: Clarisse
full_name: Berlioz-Torrent, Clarisse
last_name: Berlioz-Torrent
- first_name: Amélie
full_name: Bernard, Amélie
last_name: Bernard
- first_name: Lionel
full_name: Berthoux, Lionel
last_name: Berthoux
- first_name: Cagri G.
full_name: Besirli, Cagri G.
last_name: Besirli
- first_name: Sebastien
full_name: Besteiro, Sebastien
last_name: Besteiro
- first_name: Virginie M.
full_name: Betin, Virginie M.
last_name: Betin
- first_name: Rudi
full_name: Beyaert, Rudi
last_name: Beyaert
- first_name: Jelena S.
full_name: Bezbradica, Jelena S.
last_name: Bezbradica
- first_name: Kiran
full_name: Bhaskar, Kiran
last_name: Bhaskar
- first_name: Ingrid
full_name: Bhatia-Kissova, Ingrid
last_name: Bhatia-Kissova
- first_name: Resham
full_name: Bhattacharya, Resham
last_name: Bhattacharya
- first_name: Sujoy
full_name: Bhattacharya, Sujoy
last_name: Bhattacharya
- first_name: Shalmoli
full_name: Bhattacharyya, Shalmoli
last_name: Bhattacharyya
- first_name: Md Shenuarin
full_name: Bhuiyan, Md Shenuarin
last_name: Bhuiyan
- first_name: Sujit Kumar
full_name: Bhutia, Sujit Kumar
last_name: Bhutia
- first_name: Lanrong
full_name: Bi, Lanrong
last_name: Bi
- first_name: Xiaolin
full_name: Bi, Xiaolin
last_name: Bi
- first_name: Trevor J.
full_name: Biden, Trevor J.
last_name: Biden
- first_name: Krikor
full_name: Bijian, Krikor
last_name: Bijian
- first_name: Viktor A.
full_name: Billes, Viktor A.
last_name: Billes
- first_name: Nadine
full_name: Binart, Nadine
last_name: Binart
- first_name: Claudia
full_name: Bincoletto, Claudia
last_name: Bincoletto
- first_name: Asa B.
full_name: Birgisdottir, Asa B.
last_name: Birgisdottir
- first_name: Geir
full_name: Bjorkoy, Geir
last_name: Bjorkoy
- first_name: Gonzalo
full_name: Blanco, Gonzalo
last_name: Blanco
- first_name: Ana
full_name: Blas-Garcia, Ana
last_name: Blas-Garcia
- first_name: Janusz
full_name: Blasiak, Janusz
last_name: Blasiak
- first_name: Robert
full_name: Blomgran, Robert
last_name: Blomgran
- first_name: Klas
full_name: Blomgren, Klas
last_name: Blomgren
- first_name: Janice S.
full_name: Blum, Janice S.
last_name: Blum
- first_name: Emilio
full_name: Boada-Romero, Emilio
last_name: Boada-Romero
- first_name: Mirta
full_name: Boban, Mirta
last_name: Boban
- first_name: Kathleen
full_name: Boesze-Battaglia, Kathleen
last_name: Boesze-Battaglia
- first_name: Philippe
full_name: Boeuf, Philippe
last_name: Boeuf
- first_name: Barry
full_name: Boland, Barry
last_name: Boland
- first_name: Pascale
full_name: Bomont, Pascale
last_name: Bomont
- first_name: Paolo
full_name: Bonaldo, Paolo
last_name: Bonaldo
- first_name: Srinivasa Reddy
full_name: Bonam, Srinivasa Reddy
last_name: Bonam
- first_name: Laura
full_name: Bonfili, Laura
last_name: Bonfili
- first_name: Juan S.
full_name: Bonifacino, Juan S.
last_name: Bonifacino
- first_name: Brian A.
full_name: Boone, Brian A.
last_name: Boone
- first_name: Martin D.
full_name: Bootman, Martin D.
last_name: Bootman
- first_name: Matteo
full_name: Bordi, Matteo
last_name: Bordi
- first_name: Christoph
full_name: Borner, Christoph
last_name: Borner
- first_name: Beat C.
full_name: Bornhauser, Beat C.
last_name: Bornhauser
- first_name: Gautam
full_name: Borthakur, Gautam
last_name: Borthakur
- first_name: Jürgen
full_name: Bosch, Jürgen
last_name: Bosch
- first_name: Santanu
full_name: Bose, Santanu
last_name: Bose
- first_name: Luis M.
full_name: Botana, Luis M.
last_name: Botana
- first_name: Juan
full_name: Botas, Juan
last_name: Botas
- first_name: Chantal M.
full_name: Boulanger, Chantal M.
last_name: Boulanger
- first_name: Michael E.
full_name: Boulton, Michael E.
last_name: Boulton
- first_name: Mathieu
full_name: Bourdenx, Mathieu
last_name: Bourdenx
- first_name: Benjamin
full_name: Bourgeois, Benjamin
last_name: Bourgeois
- first_name: Nollaig M.
full_name: Bourke, Nollaig M.
last_name: Bourke
- first_name: Guilhem
full_name: Bousquet, Guilhem
last_name: Bousquet
- first_name: Patricia
full_name: Boya, Patricia
last_name: Boya
- first_name: Peter V.
full_name: Bozhkov, Peter V.
last_name: Bozhkov
- first_name: Luiz H.M.
full_name: Bozi, Luiz H.M.
last_name: Bozi
- first_name: Tolga O.
full_name: Bozkurt, Tolga O.
last_name: Bozkurt
- first_name: Doug E.
full_name: Brackney, Doug E.
last_name: Brackney
- first_name: Christian H.
full_name: Brandts, Christian H.
last_name: Brandts
- first_name: Ralf J.
full_name: Braun, Ralf J.
last_name: Braun
- first_name: Gerhard H.
full_name: Braus, Gerhard H.
last_name: Braus
- first_name: Roberto
full_name: Bravo-Sagua, Roberto
last_name: Bravo-Sagua
- first_name: José M.
full_name: Bravo-San Pedro, José M.
last_name: Bravo-San Pedro
- first_name: Patrick
full_name: Brest, Patrick
last_name: Brest
- first_name: Marie Agnès
full_name: Bringer, Marie Agnès
last_name: Bringer
- first_name: Alfredo
full_name: Briones-Herrera, Alfredo
last_name: Briones-Herrera
- first_name: V. Courtney
full_name: Broaddus, V. Courtney
last_name: Broaddus
- first_name: Peter
full_name: Brodersen, Peter
last_name: Brodersen
- first_name: Jeffrey L.
full_name: Brodsky, Jeffrey L.
last_name: Brodsky
- first_name: Steven L.
full_name: Brody, Steven L.
last_name: Brody
- first_name: Paola G.
full_name: Bronson, Paola G.
last_name: Bronson
- first_name: Jeff M.
full_name: Bronstein, Jeff M.
last_name: Bronstein
- first_name: Carolyn N.
full_name: Brown, Carolyn N.
last_name: Brown
- first_name: Rhoderick E.
full_name: Brown, Rhoderick E.
last_name: Brown
- first_name: Patricia C.
full_name: Brum, Patricia C.
last_name: Brum
- first_name: John H.
full_name: Brumell, John H.
last_name: Brumell
- first_name: Nicola
full_name: Brunetti-Pierri, Nicola
last_name: Brunetti-Pierri
- first_name: Daniele
full_name: Bruno, Daniele
last_name: Bruno
- first_name: Robert J.
full_name: Bryson-Richardson, Robert J.
last_name: Bryson-Richardson
- first_name: Cecilia
full_name: Bucci, Cecilia
last_name: Bucci
- first_name: Carmen
full_name: Buchrieser, Carmen
last_name: Buchrieser
- first_name: Marta
full_name: Bueno, Marta
last_name: Bueno
- first_name: Laura Elisa
full_name: Buitrago-Molina, Laura Elisa
last_name: Buitrago-Molina
- first_name: Simone
full_name: Buraschi, Simone
last_name: Buraschi
- first_name: Shilpa
full_name: Buch, Shilpa
last_name: Buch
- first_name: J. Ross
full_name: Buchan, J. Ross
last_name: Buchan
- first_name: Erin M.
full_name: Buckingham, Erin M.
last_name: Buckingham
- first_name: Hikmet
full_name: Budak, Hikmet
last_name: Budak
- first_name: Mauricio
full_name: Budini, Mauricio
last_name: Budini
- first_name: Geert
full_name: Bultynck, Geert
last_name: Bultynck
- first_name: Florin
full_name: Burada, Florin
last_name: Burada
- first_name: Joseph R.
full_name: Burgoyne, Joseph R.
last_name: Burgoyne
- first_name: M. Isabel
full_name: Burón, M. Isabel
last_name: Burón
- first_name: Victor
full_name: Bustos, Victor
last_name: Bustos
- first_name: Sabrina
full_name: Büttner, Sabrina
last_name: Büttner
- first_name: Elena
full_name: Butturini, Elena
last_name: Butturini
- first_name: Aaron
full_name: Byrd, Aaron
last_name: Byrd
- first_name: Isabel
full_name: Cabas, Isabel
last_name: Cabas
- first_name: Sandra
full_name: Cabrera-Benitez, Sandra
last_name: Cabrera-Benitez
- first_name: Ken
full_name: Cadwell, Ken
last_name: Cadwell
- first_name: Jingjing
full_name: Cai, Jingjing
last_name: Cai
- first_name: Lu
full_name: Cai, Lu
last_name: Cai
- first_name: Qian
full_name: Cai, Qian
last_name: Cai
- first_name: Montserrat
full_name: Cairó, Montserrat
last_name: Cairó
- first_name: Jose A.
full_name: Calbet, Jose A.
last_name: Calbet
- first_name: Guy A.
full_name: Caldwell, Guy A.
last_name: Caldwell
- first_name: Kim A.
full_name: Caldwell, Kim A.
last_name: Caldwell
- first_name: Jarrod A.
full_name: Call, Jarrod A.
last_name: Call
- first_name: Riccardo
full_name: Calvani, Riccardo
last_name: Calvani
- first_name: Ana C.
full_name: Calvo, Ana C.
last_name: Calvo
- first_name: Miguel
full_name: Calvo-Rubio Barrera, Miguel
last_name: Calvo-Rubio Barrera
- first_name: Niels O.S.
full_name: Camara, Niels O.S.
last_name: Camara
- first_name: Jacques H.
full_name: Camonis, Jacques H.
last_name: Camonis
- first_name: Nadine
full_name: Camougrand, Nadine
last_name: Camougrand
- first_name: Michelangelo
full_name: Campanella, Michelangelo
last_name: Campanella
- first_name: Edward M.
full_name: Campbell, Edward M.
last_name: Campbell
- first_name: François Xavier
full_name: Campbell-Valois, François Xavier
last_name: Campbell-Valois
- first_name: Silvia
full_name: Campello, Silvia
last_name: Campello
- first_name: Ilaria
full_name: Campesi, Ilaria
last_name: Campesi
- first_name: Juliane C.
full_name: Campos, Juliane C.
last_name: Campos
- first_name: Olivier
full_name: Camuzard, Olivier
last_name: Camuzard
- first_name: Jorge
full_name: Cancino, Jorge
last_name: Cancino
- first_name: Danilo
full_name: Candido De Almeida, Danilo
last_name: Candido De Almeida
- first_name: Laura
full_name: Canesi, Laura
last_name: Canesi
- first_name: Isabella
full_name: Caniggia, Isabella
last_name: Caniggia
- first_name: Barbara
full_name: Canonico, Barbara
last_name: Canonico
- first_name: Carles
full_name: Cantí, Carles
last_name: Cantí
- first_name: Bin
full_name: Cao, Bin
last_name: Cao
- first_name: Michele
full_name: Caraglia, Michele
last_name: Caraglia
- first_name: Beatriz
full_name: Caramés, Beatriz
last_name: Caramés
- first_name: Evie H.
full_name: Carchman, Evie H.
last_name: Carchman
- first_name: Elena
full_name: Cardenal-Muñoz, Elena
last_name: Cardenal-Muñoz
- first_name: Cesar
full_name: Cardenas, Cesar
last_name: Cardenas
- first_name: Luis
full_name: Cardenas, Luis
last_name: Cardenas
- first_name: Sandra M.
full_name: Cardoso, Sandra M.
last_name: Cardoso
- first_name: Jennifer S.
full_name: Carew, Jennifer S.
last_name: Carew
- first_name: Georges F.
full_name: Carle, Georges F.
last_name: Carle
- first_name: Gillian
full_name: Carleton, Gillian
last_name: Carleton
- first_name: Silvia
full_name: Carloni, Silvia
last_name: Carloni
- first_name: Didac
full_name: Carmona-Gutierrez, Didac
last_name: Carmona-Gutierrez
- first_name: Leticia A.
full_name: Carneiro, Leticia A.
last_name: Carneiro
- first_name: Oliana
full_name: Carnevali, Oliana
last_name: Carnevali
- first_name: Julian M.
full_name: Carosi, Julian M.
last_name: Carosi
- first_name: Serena
full_name: Carra, Serena
last_name: Carra
- first_name: Alice
full_name: Carrier, Alice
last_name: Carrier
- first_name: Lucie
full_name: Carrier, Lucie
last_name: Carrier
- first_name: Bernadette
full_name: Carroll, Bernadette
last_name: Carroll
- first_name: A. Brent
full_name: Carter, A. Brent
last_name: Carter
- first_name: Andreia Neves
full_name: Carvalho, Andreia Neves
last_name: Carvalho
- first_name: Magali
full_name: Casanova, Magali
last_name: Casanova
- first_name: Caty
full_name: Casas, Caty
last_name: Casas
- first_name: Josefina
full_name: Casas, Josefina
last_name: Casas
- first_name: Chiara
full_name: Cassioli, Chiara
last_name: Cassioli
- first_name: Eliseo F.
full_name: Castillo, Eliseo F.
last_name: Castillo
- first_name: Karen
full_name: Castillo, Karen
last_name: Castillo
- first_name: Sonia
full_name: Castillo-Lluva, Sonia
last_name: Castillo-Lluva
- first_name: Francesca
full_name: Castoldi, Francesca
last_name: Castoldi
- first_name: Marco
full_name: Castori, Marco
last_name: Castori
- first_name: Ariel F.
full_name: Castro, Ariel F.
last_name: Castro
- first_name: Margarida
full_name: Castro-Caldas, Margarida
last_name: Castro-Caldas
- first_name: Javier
full_name: Castro-Hernandez, Javier
last_name: Castro-Hernandez
- first_name: Susana
full_name: Castro-Obregon, Susana
last_name: Castro-Obregon
- first_name: Sergio D.
full_name: Catz, Sergio D.
last_name: Catz
- first_name: Claudia
full_name: Cavadas, Claudia
last_name: Cavadas
- first_name: Federica
full_name: Cavaliere, Federica
last_name: Cavaliere
- first_name: Gabriella
full_name: Cavallini, Gabriella
last_name: Cavallini
- first_name: Maria
full_name: Cavinato, Maria
last_name: Cavinato
- first_name: Maria L.
full_name: Cayuela, Maria L.
last_name: Cayuela
- first_name: Paula
full_name: Cebollada Rica, Paula
last_name: Cebollada Rica
- first_name: Valentina
full_name: Cecarini, Valentina
last_name: Cecarini
- first_name: Francesco
full_name: Cecconi, Francesco
last_name: Cecconi
- first_name: Marzanna
full_name: Cechowska-Pasko, Marzanna
last_name: Cechowska-Pasko
- first_name: Simone
full_name: Cenci, Simone
last_name: Cenci
- first_name: Victòria
full_name: Ceperuelo-Mallafré, Victòria
last_name: Ceperuelo-Mallafré
- first_name: João J.
full_name: Cerqueira, João J.
last_name: Cerqueira
- first_name: Janete M.
full_name: Cerutti, Janete M.
last_name: Cerutti
- first_name: Davide
full_name: Cervia, Davide
last_name: Cervia
- first_name: Vildan Bozok
full_name: Cetintas, Vildan Bozok
last_name: Cetintas
- first_name: Silvia
full_name: Cetrullo, Silvia
last_name: Cetrullo
- first_name: Han Jung
full_name: Chae, Han Jung
last_name: Chae
- first_name: Andrei S.
full_name: Chagin, Andrei S.
last_name: Chagin
- first_name: Chee Yin
full_name: Chai, Chee Yin
last_name: Chai
- first_name: Gopal
full_name: Chakrabarti, Gopal
last_name: Chakrabarti
- first_name: Oishee
full_name: Chakrabarti, Oishee
last_name: Chakrabarti
- first_name: Tapas
full_name: Chakraborty, Tapas
last_name: Chakraborty
- first_name: Trinad
full_name: Chakraborty, Trinad
last_name: Chakraborty
- first_name: Mounia
full_name: Chami, Mounia
last_name: Chami
- first_name: Georgios
full_name: Chamilos, Georgios
last_name: Chamilos
- first_name: David W.
full_name: Chan, David W.
last_name: Chan
- first_name: Edmond Y.W.
full_name: Chan, Edmond Y.W.
last_name: Chan
- first_name: Edward D.
full_name: Chan, Edward D.
last_name: Chan
- first_name: H. Y.Edwin
full_name: Chan, H. Y.Edwin
last_name: Chan
- first_name: Helen H.
full_name: Chan, Helen H.
last_name: Chan
- first_name: Hung
full_name: Chan, Hung
last_name: Chan
- first_name: Matthew T.V.
full_name: Chan, Matthew T.V.
last_name: Chan
- first_name: Yau Sang
full_name: Chan, Yau Sang
last_name: Chan
- first_name: Partha K.
full_name: Chandra, Partha K.
last_name: Chandra
- first_name: Chih Peng
full_name: Chang, Chih Peng
last_name: Chang
- first_name: Chunmei
full_name: Chang, Chunmei
last_name: Chang
- first_name: Hao Chun
full_name: Chang, Hao Chun
last_name: Chang
- first_name: Kai
full_name: Chang, Kai
last_name: Chang
- first_name: Jie
full_name: Chao, Jie
last_name: Chao
- first_name: Tracey
full_name: Chapman, Tracey
last_name: Chapman
- first_name: Nicolas
full_name: Charlet-Berguerand, Nicolas
last_name: Charlet-Berguerand
- first_name: Samrat
full_name: Chatterjee, Samrat
last_name: Chatterjee
- first_name: Shail K.
full_name: Chaube, Shail K.
last_name: Chaube
- first_name: Anu
full_name: Chaudhary, Anu
last_name: Chaudhary
- first_name: Santosh
full_name: Chauhan, Santosh
last_name: Chauhan
- first_name: Edward
full_name: Chaum, Edward
last_name: Chaum
- first_name: Frédéric
full_name: Checler, Frédéric
last_name: Checler
- first_name: Michael E.
full_name: Cheetham, Michael E.
last_name: Cheetham
- first_name: Chang Shi
full_name: Chen, Chang Shi
last_name: Chen
- first_name: Guang Chao
full_name: Chen, Guang Chao
last_name: Chen
- first_name: Jian Fu
full_name: Chen, Jian Fu
last_name: Chen
- first_name: Liam L.
full_name: Chen, Liam L.
last_name: Chen
- first_name: Leilei
full_name: Chen, Leilei
last_name: Chen
- first_name: Lin
full_name: Chen, Lin
last_name: Chen
- first_name: Mingliang
full_name: Chen, Mingliang
last_name: Chen
- first_name: Mu Kuan
full_name: Chen, Mu Kuan
last_name: Chen
- first_name: Ning
full_name: Chen, Ning
last_name: Chen
- first_name: Quan
full_name: Chen, Quan
last_name: Chen
- first_name: Ruey Hwa
full_name: Chen, Ruey Hwa
last_name: Chen
- first_name: Shi
full_name: Chen, Shi
last_name: Chen
- first_name: Wei
full_name: Chen, Wei
last_name: Chen
- first_name: Weiqiang
full_name: Chen, Weiqiang
last_name: Chen
- first_name: Xin Ming
full_name: Chen, Xin Ming
last_name: Chen
- first_name: Xiong Wen
full_name: Chen, Xiong Wen
last_name: Chen
- first_name: Xu
full_name: Chen, Xu
id: 4E5ADCAA-F248-11E8-B48F-1D18A9856A87
last_name: Chen
- first_name: Yan
full_name: Chen, Yan
last_name: Chen
- first_name: Ye Guang
full_name: Chen, Ye Guang
last_name: Chen
- first_name: Yingyu
full_name: Chen, Yingyu
last_name: Chen
- first_name: Yongqiang
full_name: Chen, Yongqiang
last_name: Chen
- first_name: Yu Jen
full_name: Chen, Yu Jen
last_name: Chen
- first_name: Yue Qin
full_name: Chen, Yue Qin
last_name: Chen
- first_name: Zhefan Stephen
full_name: Chen, Zhefan Stephen
last_name: Chen
- first_name: Zhi
full_name: Chen, Zhi
last_name: Chen
- first_name: Zhi Hua
full_name: Chen, Zhi Hua
last_name: Chen
- first_name: Zhijian J.
full_name: Chen, Zhijian J.
last_name: Chen
- first_name: Zhixiang
full_name: Chen, Zhixiang
last_name: Chen
- first_name: Hanhua
full_name: Cheng, Hanhua
last_name: Cheng
- first_name: Jun
full_name: Cheng, Jun
last_name: Cheng
- first_name: Shi Yuan
full_name: Cheng, Shi Yuan
last_name: Cheng
- first_name: Wei
full_name: Cheng, Wei
last_name: Cheng
- first_name: Xiaodong
full_name: Cheng, Xiaodong
last_name: Cheng
- first_name: Xiu Tang
full_name: Cheng, Xiu Tang
last_name: Cheng
- first_name: Yiyun
full_name: Cheng, Yiyun
last_name: Cheng
- first_name: Zhiyong
full_name: Cheng, Zhiyong
last_name: Cheng
- first_name: Zhong
full_name: Chen, Zhong
last_name: Chen
- first_name: Heesun
full_name: Cheong, Heesun
last_name: Cheong
- first_name: Jit Kong
full_name: Cheong, Jit Kong
last_name: Cheong
- first_name: Boris V.
full_name: Chernyak, Boris V.
last_name: Chernyak
- first_name: Sara
full_name: Cherry, Sara
last_name: Cherry
- first_name: Chi Fai Randy
full_name: Cheung, Chi Fai Randy
last_name: Cheung
- first_name: Chun Hei Antonio
full_name: Cheung, Chun Hei Antonio
last_name: Cheung
- first_name: King Ho
full_name: Cheung, King Ho
last_name: Cheung
- first_name: Eric
full_name: Chevet, Eric
last_name: Chevet
- first_name: Richard J.
full_name: Chi, Richard J.
last_name: Chi
- first_name: Alan Kwok Shing
full_name: Chiang, Alan Kwok Shing
last_name: Chiang
- first_name: Ferdinando
full_name: Chiaradonna, Ferdinando
last_name: Chiaradonna
- first_name: Roberto
full_name: Chiarelli, Roberto
last_name: Chiarelli
- first_name: Mario
full_name: Chiariello, Mario
last_name: Chiariello
- first_name: Nathalia
full_name: Chica, Nathalia
last_name: Chica
- first_name: Susanna
full_name: Chiocca, Susanna
last_name: Chiocca
- first_name: Mario
full_name: Chiong, Mario
last_name: Chiong
- first_name: Shih Hwa
full_name: Chiou, Shih Hwa
last_name: Chiou
- first_name: Abhilash I.
full_name: Chiramel, Abhilash I.
last_name: Chiramel
- first_name: Valerio
full_name: Chiurchiù, Valerio
last_name: Chiurchiù
- first_name: Dong Hyung
full_name: Cho, Dong Hyung
last_name: Cho
- first_name: Seong Kyu
full_name: Choe, Seong Kyu
last_name: Choe
- first_name: Augustine M.K.
full_name: Choi, Augustine M.K.
last_name: Choi
- first_name: Mary E.
full_name: Choi, Mary E.
last_name: Choi
- first_name: Kamalika Roy
full_name: Choudhury, Kamalika Roy
last_name: Choudhury
- first_name: Norman S.
full_name: Chow, Norman S.
last_name: Chow
- first_name: Charleen T.
full_name: Chu, Charleen T.
last_name: Chu
- first_name: Jason P.
full_name: Chua, Jason P.
last_name: Chua
- first_name: John Jia En
full_name: Chua, John Jia En
last_name: Chua
- first_name: Hyewon
full_name: Chung, Hyewon
last_name: Chung
- first_name: Kin Pan
full_name: Chung, Kin Pan
last_name: Chung
- first_name: Seockhoon
full_name: Chung, Seockhoon
last_name: Chung
- first_name: So Hyang
full_name: Chung, So Hyang
last_name: Chung
- first_name: Yuen Li
full_name: Chung, Yuen Li
last_name: Chung
- first_name: Valentina
full_name: Cianfanelli, Valentina
last_name: Cianfanelli
- first_name: Iwona A.
full_name: Ciechomska, Iwona A.
last_name: Ciechomska
- first_name: Mariana
full_name: Cifuentes, Mariana
last_name: Cifuentes
- first_name: Laura
full_name: Cinque, Laura
last_name: Cinque
- first_name: Sebahattin
full_name: Cirak, Sebahattin
last_name: Cirak
- first_name: Mara
full_name: Cirone, Mara
last_name: Cirone
- first_name: Michael J.
full_name: Clague, Michael J.
last_name: Clague
- first_name: Robert
full_name: Clarke, Robert
last_name: Clarke
- first_name: Emilio
full_name: Clementi, Emilio
last_name: Clementi
- first_name: Eliana M.
full_name: Coccia, Eliana M.
last_name: Coccia
- first_name: Patrice
full_name: Codogno, Patrice
last_name: Codogno
- first_name: Ehud
full_name: Cohen, Ehud
last_name: Cohen
- first_name: Mickael M.
full_name: Cohen, Mickael M.
last_name: Cohen
- first_name: Tania
full_name: Colasanti, Tania
last_name: Colasanti
- first_name: Fiorella
full_name: Colasuonno, Fiorella
last_name: Colasuonno
- first_name: Robert A.
full_name: Colbert, Robert A.
last_name: Colbert
- first_name: Anna
full_name: Colell, Anna
last_name: Colell
- first_name: Miodrag
full_name: Čolić, Miodrag
last_name: Čolić
- first_name: Nuria S.
full_name: Coll, Nuria S.
last_name: Coll
- first_name: Mark O.
full_name: Collins, Mark O.
last_name: Collins
- first_name: María I.
full_name: Colombo, María I.
last_name: Colombo
- first_name: Daniel A.
full_name: Colón-Ramos, Daniel A.
last_name: Colón-Ramos
- first_name: Lydie
full_name: Combaret, Lydie
last_name: Combaret
- first_name: Sergio
full_name: Comincini, Sergio
last_name: Comincini
- first_name: Márcia R.
full_name: Cominetti, Márcia R.
last_name: Cominetti
- first_name: Antonella
full_name: Consiglio, Antonella
last_name: Consiglio
- first_name: Andrea
full_name: Conte, Andrea
last_name: Conte
- first_name: Fabrizio
full_name: Conti, Fabrizio
last_name: Conti
- first_name: Viorica Raluca
full_name: Contu, Viorica Raluca
last_name: Contu
- first_name: Mark R.
full_name: Cookson, Mark R.
last_name: Cookson
- first_name: Kevin M.
full_name: Coombs, Kevin M.
last_name: Coombs
- first_name: Isabelle
full_name: Coppens, Isabelle
last_name: Coppens
- first_name: Maria Tiziana
full_name: Corasaniti, Maria Tiziana
last_name: Corasaniti
- first_name: Dale P.
full_name: Corkery, Dale P.
last_name: Corkery
- first_name: Nils
full_name: Cordes, Nils
last_name: Cordes
- first_name: Katia
full_name: Cortese, Katia
last_name: Cortese
- first_name: Maria Do Carmo
full_name: Costa, Maria Do Carmo
last_name: Costa
- first_name: Sarah
full_name: Costantino, Sarah
last_name: Costantino
- first_name: Paola
full_name: Costelli, Paola
last_name: Costelli
- first_name: Ana
full_name: Coto-Montes, Ana
last_name: Coto-Montes
- first_name: Peter J.
full_name: Crack, Peter J.
last_name: Crack
- first_name: Jose L.
full_name: Crespo, Jose L.
last_name: Crespo
- first_name: Alfredo
full_name: Criollo, Alfredo
last_name: Criollo
- first_name: Valeria
full_name: Crippa, Valeria
last_name: Crippa
- first_name: Riccardo
full_name: Cristofani, Riccardo
last_name: Cristofani
- first_name: Tamas
full_name: Csizmadia, Tamas
last_name: Csizmadia
- first_name: Antonio
full_name: Cuadrado, Antonio
last_name: Cuadrado
- first_name: Bing
full_name: Cui, Bing
last_name: Cui
- first_name: Jun
full_name: Cui, Jun
last_name: Cui
- first_name: Yixian
full_name: Cui, Yixian
last_name: Cui
- first_name: Yong
full_name: Cui, Yong
last_name: Cui
- first_name: Emmanuel
full_name: Culetto, Emmanuel
last_name: Culetto
- first_name: Andrea C.
full_name: Cumino, Andrea C.
last_name: Cumino
- first_name: Andrey V.
full_name: Cybulsky, Andrey V.
last_name: Cybulsky
- first_name: Mark J.
full_name: Czaja, Mark J.
last_name: Czaja
- first_name: Stanislaw J.
full_name: Czuczwar, Stanislaw J.
last_name: Czuczwar
- first_name: Stefania
full_name: D’Adamo, Stefania
last_name: D’Adamo
- first_name: Marcello
full_name: D’Amelio, Marcello
last_name: D’Amelio
- first_name: Daniela
full_name: D’Arcangelo, Daniela
last_name: D’Arcangelo
- first_name: Andrew C.
full_name: D’Lugos, Andrew C.
last_name: D’Lugos
- first_name: Gabriella
full_name: D’Orazi, Gabriella
last_name: D’Orazi
- first_name: James A.
full_name: Da Silva, James A.
last_name: Da Silva
- first_name: Hormos Salimi
full_name: Dafsari, Hormos Salimi
last_name: Dafsari
- first_name: Ruben K.
full_name: Dagda, Ruben K.
last_name: Dagda
- first_name: Yasin
full_name: Dagdas, Yasin
last_name: Dagdas
- first_name: Maria
full_name: Daglia, Maria
last_name: Daglia
- first_name: Xiaoxia
full_name: Dai, Xiaoxia
last_name: Dai
- first_name: Yun
full_name: Dai, Yun
last_name: Dai
- first_name: Yuyuan
full_name: Dai, Yuyuan
last_name: Dai
- first_name: Jessica
full_name: Dal Col, Jessica
last_name: Dal Col
- first_name: Paul
full_name: Dalhaimer, Paul
last_name: Dalhaimer
- first_name: Luisa
full_name: Dalla Valle, Luisa
last_name: Dalla Valle
- first_name: Tobias
full_name: Dallenga, Tobias
last_name: Dallenga
- first_name: Guillaume
full_name: Dalmasso, Guillaume
last_name: Dalmasso
- first_name: Markus
full_name: Damme, Markus
last_name: Damme
- first_name: Ilaria
full_name: Dando, Ilaria
last_name: Dando
- first_name: Nico P.
full_name: Dantuma, Nico P.
last_name: Dantuma
- first_name: April L.
full_name: Darling, April L.
last_name: Darling
- first_name: Hiranmoy
full_name: Das, Hiranmoy
last_name: Das
- first_name: Srinivasan
full_name: Dasarathy, Srinivasan
last_name: Dasarathy
- first_name: Santosh K.
full_name: Dasari, Santosh K.
last_name: Dasari
- first_name: Srikanta
full_name: Dash, Srikanta
last_name: Dash
- first_name: Oliver
full_name: Daumke, Oliver
last_name: Daumke
- first_name: Adrian N.
full_name: Dauphinee, Adrian N.
last_name: Dauphinee
- first_name: Jeffrey S.
full_name: Davies, Jeffrey S.
last_name: Davies
- first_name: Valeria A.
full_name: Dávila, Valeria A.
last_name: Dávila
- first_name: Roger J.
full_name: Davis, Roger J.
last_name: Davis
- first_name: Tanja
full_name: Davis, Tanja
last_name: Davis
- first_name: Sharadha
full_name: Dayalan Naidu, Sharadha
last_name: Dayalan Naidu
- first_name: Francesca
full_name: De Amicis, Francesca
last_name: De Amicis
- first_name: Karolien
full_name: De Bosscher, Karolien
last_name: De Bosscher
- first_name: Francesca
full_name: De Felice, Francesca
last_name: De Felice
- first_name: Lucia
full_name: De Franceschi, Lucia
last_name: De Franceschi
- first_name: Chiara
full_name: De Leonibus, Chiara
last_name: De Leonibus
- first_name: Mayara G.
full_name: De Mattos Barbosa, Mayara G.
last_name: De Mattos Barbosa
- first_name: Guido R.Y.
full_name: De Meyer, Guido R.Y.
last_name: De Meyer
- first_name: Angelo
full_name: De Milito, Angelo
last_name: De Milito
- first_name: Cosimo
full_name: De Nunzio, Cosimo
last_name: De Nunzio
- first_name: Clara
full_name: De Palma, Clara
last_name: De Palma
- first_name: Mauro
full_name: De Santi, Mauro
last_name: De Santi
- first_name: Claudio
full_name: De Virgilio, Claudio
last_name: De Virgilio
- first_name: Daniela
full_name: De Zio, Daniela
last_name: De Zio
- first_name: Jayanta
full_name: Debnath, Jayanta
last_name: Debnath
- first_name: Brian J.
full_name: Debosch, Brian J.
last_name: Debosch
- first_name: Jean Paul
full_name: Decuypere, Jean Paul
last_name: Decuypere
- first_name: Mark A.
full_name: Deehan, Mark A.
last_name: Deehan
- first_name: Gianluca
full_name: Deflorian, Gianluca
last_name: Deflorian
- first_name: James
full_name: Degregori, James
last_name: Degregori
- first_name: Benjamin
full_name: Dehay, Benjamin
last_name: Dehay
- first_name: Gabriel
full_name: Del Rio, Gabriel
last_name: Del Rio
- first_name: Joe R.
full_name: Delaney, Joe R.
last_name: Delaney
- first_name: Lea M.D.
full_name: Delbridge, Lea M.D.
last_name: Delbridge
- first_name: Elizabeth
full_name: Delorme-Axford, Elizabeth
last_name: Delorme-Axford
- first_name: M. Victoria
full_name: Delpino, M. Victoria
last_name: Delpino
- first_name: Francesca
full_name: Demarchi, Francesca
last_name: Demarchi
- first_name: Vilma
full_name: Dembitz, Vilma
last_name: Dembitz
- first_name: Nicholas D.
full_name: Demers, Nicholas D.
last_name: Demers
- first_name: Hongbin
full_name: Deng, Hongbin
last_name: Deng
- first_name: Zhiqiang
full_name: Deng, Zhiqiang
last_name: Deng
- first_name: Joern
full_name: Dengjel, Joern
last_name: Dengjel
- first_name: Paul
full_name: Dent, Paul
last_name: Dent
- first_name: Donna
full_name: Denton, Donna
last_name: Denton
- first_name: Melvin L.
full_name: Depamphilis, Melvin L.
last_name: Depamphilis
- first_name: Channing J.
full_name: Der, Channing J.
last_name: Der
- first_name: Vojo
full_name: Deretic, Vojo
last_name: Deretic
- first_name: Albert
full_name: Descoteaux, Albert
last_name: Descoteaux
- first_name: Laura
full_name: Devis, Laura
last_name: Devis
- first_name: Sushil
full_name: Devkota, Sushil
last_name: Devkota
- first_name: Olivier
full_name: Devuyst, Olivier
last_name: Devuyst
- first_name: Grant
full_name: Dewson, Grant
last_name: Dewson
- first_name: Mahendiran
full_name: Dharmasivam, Mahendiran
last_name: Dharmasivam
- first_name: Rohan
full_name: Dhiman, Rohan
last_name: Dhiman
- first_name: Diego
full_name: Di Bernardo, Diego
last_name: Di Bernardo
- first_name: Manlio
full_name: Di Cristina, Manlio
last_name: Di Cristina
- first_name: Fabio
full_name: Di Domenico, Fabio
last_name: Di Domenico
- first_name: Pietro
full_name: Di Fazio, Pietro
last_name: Di Fazio
- first_name: Alessio
full_name: Di Fonzo, Alessio
last_name: Di Fonzo
- first_name: Giovanni
full_name: Di Guardo, Giovanni
last_name: Di Guardo
- first_name: Gianni M.
full_name: Di Guglielmo, Gianni M.
last_name: Di Guglielmo
- first_name: Luca
full_name: Di Leo, Luca
last_name: Di Leo
- first_name: Chiara
full_name: Di Malta, Chiara
last_name: Di Malta
- first_name: Alessia
full_name: Di Nardo, Alessia
last_name: Di Nardo
- first_name: Martina
full_name: Di Rienzo, Martina
last_name: Di Rienzo
- first_name: Federica
full_name: Di Sano, Federica
last_name: Di Sano
- first_name: George
full_name: Diallinas, George
last_name: Diallinas
- first_name: Jiajie
full_name: Diao, Jiajie
last_name: Diao
- first_name: Guillermo
full_name: Diaz-Araya, Guillermo
last_name: Diaz-Araya
- first_name: Inés
full_name: Díaz-Laviada, Inés
last_name: Díaz-Laviada
- first_name: Jared M.
full_name: Dickinson, Jared M.
last_name: Dickinson
- first_name: Marc
full_name: Diederich, Marc
last_name: Diederich
- first_name: Mélanie
full_name: Dieudé, Mélanie
last_name: Dieudé
- first_name: Ivan
full_name: Dikic, Ivan
last_name: Dikic
- first_name: Shiping
full_name: Ding, Shiping
last_name: Ding
- first_name: Wen Xing
full_name: Ding, Wen Xing
last_name: Ding
- first_name: Luciana
full_name: Dini, Luciana
last_name: Dini
- first_name: Jelena
full_name: Dinić, Jelena
last_name: Dinić
- first_name: Miroslav
full_name: Dinic, Miroslav
last_name: Dinic
- first_name: Albena T.
full_name: Dinkova-Kostova, Albena T.
last_name: Dinkova-Kostova
- first_name: Marc S.
full_name: Dionne, Marc S.
last_name: Dionne
- first_name: Jörg H.W.
full_name: Distler, Jörg H.W.
last_name: Distler
- first_name: Abhinav
full_name: Diwan, Abhinav
last_name: Diwan
- first_name: Ian M.C.
full_name: Dixon, Ian M.C.
last_name: Dixon
- first_name: Mojgan
full_name: Djavaheri-Mergny, Mojgan
last_name: Djavaheri-Mergny
- first_name: Ina
full_name: Dobrinski, Ina
last_name: Dobrinski
- first_name: Oxana
full_name: Dobrovinskaya, Oxana
last_name: Dobrovinskaya
- first_name: Radek
full_name: Dobrowolski, Radek
last_name: Dobrowolski
- first_name: Renwick C.J.
full_name: Dobson, Renwick C.J.
last_name: Dobson
- first_name: Jelena
full_name: Đokić, Jelena
last_name: Đokić
- first_name: Serap
full_name: Dokmeci Emre, Serap
last_name: Dokmeci Emre
- first_name: Massimo
full_name: Donadelli, Massimo
last_name: Donadelli
- first_name: Bo
full_name: Dong, Bo
last_name: Dong
- first_name: Xiaonan
full_name: Dong, Xiaonan
last_name: Dong
- first_name: Zhiwu
full_name: Dong, Zhiwu
last_name: Dong
- first_name: Gerald W.
full_name: Dorn, Gerald W.
last_name: Dorn
- first_name: Volker
full_name: Dotsch, Volker
last_name: Dotsch
- first_name: Huan
full_name: Dou, Huan
last_name: Dou
- first_name: Juan
full_name: Dou, Juan
last_name: Dou
- first_name: Moataz
full_name: Dowaidar, Moataz
last_name: Dowaidar
- first_name: Sami
full_name: Dridi, Sami
last_name: Dridi
- first_name: Liat
full_name: Drucker, Liat
last_name: Drucker
- first_name: Ailian
full_name: Du, Ailian
last_name: Du
- first_name: Caigan
full_name: Du, Caigan
last_name: Du
- first_name: Guangwei
full_name: Du, Guangwei
last_name: Du
- first_name: Hai Ning
full_name: Du, Hai Ning
last_name: Du
- first_name: Li Lin
full_name: Du, Li Lin
last_name: Du
- first_name: André
full_name: Du Toit, André
last_name: Du Toit
- first_name: Shao Bin
full_name: Duan, Shao Bin
last_name: Duan
- first_name: Xiaoqiong
full_name: Duan, Xiaoqiong
last_name: Duan
- first_name: Sónia P.
full_name: Duarte, Sónia P.
last_name: Duarte
- first_name: Anna
full_name: Dubrovska, Anna
last_name: Dubrovska
- first_name: Elaine A.
full_name: Dunlop, Elaine A.
last_name: Dunlop
- first_name: Nicolas
full_name: Dupont, Nicolas
last_name: Dupont
- first_name: Raúl V.
full_name: Durán, Raúl V.
last_name: Durán
- first_name: Bilikere S.
full_name: Dwarakanath, Bilikere S.
last_name: Dwarakanath
- first_name: Sergey A.
full_name: Dyshlovoy, Sergey A.
last_name: Dyshlovoy
- first_name: Darius
full_name: Ebrahimi-Fakhari, Darius
last_name: Ebrahimi-Fakhari
- first_name: Leopold
full_name: Eckhart, Leopold
last_name: Eckhart
- first_name: Charles L.
full_name: Edelstein, Charles L.
last_name: Edelstein
- first_name: Thomas
full_name: Efferth, Thomas
last_name: Efferth
- first_name: Eftekhar
full_name: Eftekharpour, Eftekhar
last_name: Eftekharpour
- first_name: Ludwig
full_name: Eichinger, Ludwig
last_name: Eichinger
- first_name: Nabil
full_name: Eid, Nabil
last_name: Eid
- first_name: Tobias
full_name: Eisenberg, Tobias
last_name: Eisenberg
- first_name: N. Tony
full_name: Eissa, N. Tony
last_name: Eissa
- first_name: Sanaa
full_name: Eissa, Sanaa
last_name: Eissa
- first_name: Miriam
full_name: Ejarque, Miriam
last_name: Ejarque
- first_name: Abdeljabar
full_name: El Andaloussi, Abdeljabar
last_name: El Andaloussi
- first_name: Nazira
full_name: El-Hage, Nazira
last_name: El-Hage
- first_name: Shahenda
full_name: El-Naggar, Shahenda
last_name: El-Naggar
- first_name: Anna Maria
full_name: Eleuteri, Anna Maria
last_name: Eleuteri
- first_name: Eman S.
full_name: El-Shafey, Eman S.
last_name: El-Shafey
- first_name: Mohamed
full_name: Elgendy, Mohamed
last_name: Elgendy
- first_name: Aristides G.
full_name: Eliopoulos, Aristides G.
last_name: Eliopoulos
- first_name: María M.
full_name: Elizalde, María M.
last_name: Elizalde
- first_name: Philip M.
full_name: Elks, Philip M.
last_name: Elks
- first_name: Hans Peter
full_name: Elsasser, Hans Peter
last_name: Elsasser
- first_name: Eslam S.
full_name: Elsherbiny, Eslam S.
last_name: Elsherbiny
- first_name: Brooke M.
full_name: Emerling, Brooke M.
last_name: Emerling
- first_name: N. C.Tolga
full_name: Emre, N. C.Tolga
last_name: Emre
- first_name: Christina H.
full_name: Eng, Christina H.
last_name: Eng
- first_name: Nikolai
full_name: Engedal, Nikolai
last_name: Engedal
- first_name: Anna Mart
full_name: Engelbrecht, Anna Mart
last_name: Engelbrecht
- first_name: Agnete S.T.
full_name: Engelsen, Agnete S.T.
last_name: Engelsen
- first_name: Jorrit M.
full_name: Enserink, Jorrit M.
last_name: Enserink
- first_name: Ricardo
full_name: Escalante, Ricardo
last_name: Escalante
- first_name: Audrey
full_name: Esclatine, Audrey
last_name: Esclatine
- first_name: Mafalda
full_name: Escobar-Henriques, Mafalda
last_name: Escobar-Henriques
- first_name: Eeva Liisa
full_name: Eskelinen, Eeva Liisa
last_name: Eskelinen
- first_name: Lucile
full_name: Espert, Lucile
last_name: Espert
- first_name: Makandjou Ola
full_name: Eusebio, Makandjou Ola
last_name: Eusebio
- first_name: Gemma
full_name: Fabrias, Gemma
last_name: Fabrias
- first_name: Cinzia
full_name: Fabrizi, Cinzia
last_name: Fabrizi
- first_name: Antonio
full_name: Facchiano, Antonio
last_name: Facchiano
- first_name: Francesco
full_name: Facchiano, Francesco
last_name: Facchiano
- first_name: Bengt
full_name: Fadeel, Bengt
last_name: Fadeel
- first_name: Claudio
full_name: Fader, Claudio
last_name: Fader
- first_name: Alex C.
full_name: Faesen, Alex C.
last_name: Faesen
- first_name: W. Douglas
full_name: Fairlie, W. Douglas
last_name: Fairlie
- first_name: Alberto
full_name: Falcó, Alberto
last_name: Falcó
- first_name: Bjorn H.
full_name: Falkenburger, Bjorn H.
last_name: Falkenburger
- first_name: Daping
full_name: Fan, Daping
last_name: Fan
- first_name: Jie
full_name: Fan, Jie
last_name: Fan
- first_name: Yanbo
full_name: Fan, Yanbo
last_name: Fan
- first_name: Evandro F.
full_name: Fang, Evandro F.
last_name: Fang
- first_name: Yanshan
full_name: Fang, Yanshan
last_name: Fang
- first_name: Yognqi
full_name: Fang, Yognqi
last_name: Fang
- first_name: Manolis
full_name: Fanto, Manolis
last_name: Fanto
- first_name: Tamar
full_name: Farfel-Becker, Tamar
last_name: Farfel-Becker
- first_name: Mathias
full_name: Faure, Mathias
last_name: Faure
- first_name: Gholamreza
full_name: Fazeli, Gholamreza
last_name: Fazeli
- first_name: Anthony O.
full_name: Fedele, Anthony O.
last_name: Fedele
- first_name: Arthur M.
full_name: Feldman, Arthur M.
last_name: Feldman
- first_name: Du
full_name: Feng, Du
last_name: Feng
- first_name: Jiachun
full_name: Feng, Jiachun
last_name: Feng
- first_name: Lifeng
full_name: Feng, Lifeng
last_name: Feng
- first_name: Yibin
full_name: Feng, Yibin
last_name: Feng
- first_name: Yuchen
full_name: Feng, Yuchen
last_name: Feng
- first_name: Wei
full_name: Feng, Wei
last_name: Feng
- first_name: Thais
full_name: Fenz Araujo, Thais
last_name: Fenz Araujo
- first_name: Thomas A.
full_name: Ferguson, Thomas A.
last_name: Ferguson
- first_name: Álvaro F.
full_name: Fernández, Álvaro F.
last_name: Fernández
- first_name: Jose C.
full_name: Fernandez-Checa, Jose C.
last_name: Fernandez-Checa
- first_name: Sonia
full_name: Fernández-Veledo, Sonia
last_name: Fernández-Veledo
- first_name: Alisdair R.
full_name: Fernie, Alisdair R.
last_name: Fernie
- first_name: Anthony W.
full_name: Ferrante, Anthony W.
last_name: Ferrante
- first_name: Alessandra
full_name: Ferraresi, Alessandra
last_name: Ferraresi
- first_name: Merari F.
full_name: Ferrari, Merari F.
last_name: Ferrari
- first_name: Julio C.B.
full_name: Ferreira, Julio C.B.
last_name: Ferreira
- first_name: Susan
full_name: Ferro-Novick, Susan
last_name: Ferro-Novick
- first_name: Antonio
full_name: Figueras, Antonio
last_name: Figueras
- first_name: Riccardo
full_name: Filadi, Riccardo
last_name: Filadi
- first_name: Nicoletta
full_name: Filigheddu, Nicoletta
last_name: Filigheddu
- first_name: Eduardo
full_name: Filippi-Chiela, Eduardo
last_name: Filippi-Chiela
- first_name: Giuseppe
full_name: Filomeni, Giuseppe
last_name: Filomeni
- first_name: Gian Maria
full_name: Fimia, Gian Maria
last_name: Fimia
- first_name: Vittorio
full_name: Fineschi, Vittorio
last_name: Fineschi
- first_name: Francesca
full_name: Finetti, Francesca
last_name: Finetti
- first_name: Steven
full_name: Finkbeiner, Steven
last_name: Finkbeiner
- first_name: Edward A.
full_name: Fisher, Edward A.
last_name: Fisher
- first_name: Paul B.
full_name: Fisher, Paul B.
last_name: Fisher
- first_name: Flavio
full_name: Flamigni, Flavio
last_name: Flamigni
- first_name: Steven J.
full_name: Fliesler, Steven J.
last_name: Fliesler
- first_name: Trude H.
full_name: Flo, Trude H.
last_name: Flo
- first_name: Ida
full_name: Florance, Ida
last_name: Florance
- first_name: Oliver
full_name: Florey, Oliver
last_name: Florey
- first_name: Tullio
full_name: Florio, Tullio
last_name: Florio
- first_name: Erika
full_name: Fodor, Erika
last_name: Fodor
- first_name: Carlo
full_name: Follo, Carlo
last_name: Follo
- first_name: Edward A.
full_name: Fon, Edward A.
last_name: Fon
- first_name: Antonella
full_name: Forlino, Antonella
last_name: Forlino
- first_name: Francesco
full_name: Fornai, Francesco
last_name: Fornai
- first_name: Paola
full_name: Fortini, Paola
last_name: Fortini
- first_name: Anna
full_name: Fracassi, Anna
last_name: Fracassi
- first_name: Alessandro
full_name: Fraldi, Alessandro
last_name: Fraldi
- first_name: Brunella
full_name: Franco, Brunella
last_name: Franco
- first_name: Rodrigo
full_name: Franco, Rodrigo
last_name: Franco
- first_name: Flavia
full_name: Franconi, Flavia
last_name: Franconi
- first_name: Lisa B.
full_name: Frankel, Lisa B.
last_name: Frankel
- first_name: Scott L.
full_name: Friedman, Scott L.
last_name: Friedman
- first_name: Leopold F.
full_name: Fröhlich, Leopold F.
last_name: Fröhlich
- first_name: Gema
full_name: Frühbeck, Gema
last_name: Frühbeck
- first_name: Jose M.
full_name: Fuentes, Jose M.
last_name: Fuentes
- first_name: Yukio
full_name: Fujiki, Yukio
last_name: Fujiki
- first_name: Naonobu
full_name: Fujita, Naonobu
last_name: Fujita
- first_name: Yuuki
full_name: Fujiwara, Yuuki
last_name: Fujiwara
- first_name: Mitsunori
full_name: Fukuda, Mitsunori
last_name: Fukuda
- first_name: Simone
full_name: Fulda, Simone
last_name: Fulda
- first_name: Luc
full_name: Furic, Luc
last_name: Furic
- first_name: Norihiko
full_name: Furuya, Norihiko
last_name: Furuya
- first_name: Carmela
full_name: Fusco, Carmela
last_name: Fusco
- first_name: Michaela U.
full_name: Gack, Michaela U.
last_name: Gack
- first_name: Lidia
full_name: Gaffke, Lidia
last_name: Gaffke
- first_name: Sehamuddin
full_name: Galadari, Sehamuddin
last_name: Galadari
- first_name: Alessia
full_name: Galasso, Alessia
last_name: Galasso
- first_name: Maria F.
full_name: Galindo, Maria F.
last_name: Galindo
- first_name: Sachith
full_name: Gallolu Kankanamalage, Sachith
last_name: Gallolu Kankanamalage
- first_name: Lorenzo
full_name: Galluzzi, Lorenzo
last_name: Galluzzi
- first_name: Vincent
full_name: Galy, Vincent
last_name: Galy
- first_name: Noor
full_name: Gammoh, Noor
last_name: Gammoh
- first_name: Boyi
full_name: Gan, Boyi
last_name: Gan
- first_name: Ian G.
full_name: Ganley, Ian G.
last_name: Ganley
- first_name: Feng
full_name: Gao, Feng
last_name: Gao
- first_name: Hui
full_name: Gao, Hui
last_name: Gao
- first_name: Minghui
full_name: Gao, Minghui
last_name: Gao
- first_name: Ping
full_name: Gao, Ping
last_name: Gao
- first_name: Shou Jiang
full_name: Gao, Shou Jiang
last_name: Gao
- first_name: Wentao
full_name: Gao, Wentao
last_name: Gao
- first_name: Xiaobo
full_name: Gao, Xiaobo
last_name: Gao
- first_name: Ana
full_name: Garcera, Ana
last_name: Garcera
- first_name: Maria Noé
full_name: Garcia, Maria Noé
last_name: Garcia
- first_name: Verónica E.
full_name: Garcia, Verónica E.
last_name: Garcia
- first_name: Francisco
full_name: García-Del Portillo, Francisco
last_name: García-Del Portillo
- first_name: Vega
full_name: Garcia-Escudero, Vega
last_name: Garcia-Escudero
- first_name: Aracely
full_name: Garcia-Garcia, Aracely
last_name: Garcia-Garcia
- first_name: Marina
full_name: Garcia-Macia, Marina
last_name: Garcia-Macia
- first_name: Diana
full_name: García-Moreno, Diana
last_name: García-Moreno
- first_name: Carmen
full_name: Garcia-Ruiz, Carmen
last_name: Garcia-Ruiz
- first_name: Patricia
full_name: García-Sanz, Patricia
last_name: García-Sanz
- first_name: Abhishek D.
full_name: Garg, Abhishek D.
last_name: Garg
- first_name: Ricardo
full_name: Gargini, Ricardo
last_name: Gargini
- first_name: Tina
full_name: Garofalo, Tina
last_name: Garofalo
- first_name: Robert F.
full_name: Garry, Robert F.
last_name: Garry
- first_name: Nils C.
full_name: Gassen, Nils C.
last_name: Gassen
- first_name: Damian
full_name: Gatica, Damian
last_name: Gatica
- first_name: Liang
full_name: Ge, Liang
last_name: Ge
- first_name: Wanzhong
full_name: Ge, Wanzhong
last_name: Ge
- first_name: Ruth
full_name: Geiss-Friedlander, Ruth
last_name: Geiss-Friedlander
- first_name: Cecilia
full_name: Gelfi, Cecilia
last_name: Gelfi
- first_name: Pascal
full_name: Genschik, Pascal
last_name: Genschik
- first_name: Ian E.
full_name: Gentle, Ian E.
last_name: Gentle
- first_name: Valeria
full_name: Gerbino, Valeria
last_name: Gerbino
- first_name: Christoph
full_name: Gerhardt, Christoph
last_name: Gerhardt
- first_name: Kyla
full_name: Germain, Kyla
last_name: Germain
- first_name: Marc
full_name: Germain, Marc
last_name: Germain
- first_name: David A.
full_name: Gewirtz, David A.
last_name: Gewirtz
- first_name: Elham
full_name: Ghasemipour Afshar, Elham
last_name: Ghasemipour Afshar
- first_name: Saeid
full_name: Ghavami, Saeid
last_name: Ghavami
- first_name: Alessandra
full_name: Ghigo, Alessandra
last_name: Ghigo
- first_name: Manosij
full_name: Ghosh, Manosij
last_name: Ghosh
- first_name: Georgios
full_name: Giamas, Georgios
last_name: Giamas
- first_name: Claudia
full_name: Giampietri, Claudia
last_name: Giampietri
- first_name: Alexandra
full_name: Giatromanolaki, Alexandra
last_name: Giatromanolaki
- first_name: Gary E.
full_name: Gibson, Gary E.
last_name: Gibson
- first_name: Spencer B.
full_name: Gibson, Spencer B.
last_name: Gibson
- first_name: Vanessa
full_name: Ginet, Vanessa
last_name: Ginet
- first_name: Edward
full_name: Giniger, Edward
last_name: Giniger
- first_name: Carlotta
full_name: Giorgi, Carlotta
last_name: Giorgi
- first_name: Henrique
full_name: Girao, Henrique
last_name: Girao
- first_name: Stephen E.
full_name: Girardin, Stephen E.
last_name: Girardin
- first_name: Mridhula
full_name: Giridharan, Mridhula
last_name: Giridharan
- first_name: Sandy
full_name: Giuliano, Sandy
last_name: Giuliano
- first_name: Cecilia
full_name: Giulivi, Cecilia
last_name: Giulivi
- first_name: Sylvie
full_name: Giuriato, Sylvie
last_name: Giuriato
- first_name: Julien
full_name: Giustiniani, Julien
last_name: Giustiniani
- first_name: Alexander
full_name: Gluschko, Alexander
last_name: Gluschko
- first_name: Veit
full_name: Goder, Veit
last_name: Goder
- first_name: Alexander
full_name: Goginashvili, Alexander
last_name: Goginashvili
- first_name: Jakub
full_name: Golab, Jakub
last_name: Golab
- first_name: David C.
full_name: Goldstone, David C.
last_name: Goldstone
- first_name: Anna
full_name: Golebiewska, Anna
last_name: Golebiewska
- first_name: Luciana R.
full_name: Gomes, Luciana R.
last_name: Gomes
- first_name: Rodrigo
full_name: Gomez, Rodrigo
last_name: Gomez
- first_name: Rubén
full_name: Gómez-Sánchez, Rubén
last_name: Gómez-Sánchez
- first_name: Maria Catalina
full_name: Gomez-Puerto, Maria Catalina
last_name: Gomez-Puerto
- first_name: Raquel
full_name: Gomez-Sintes, Raquel
last_name: Gomez-Sintes
- first_name: Qingqiu
full_name: Gong, Qingqiu
last_name: Gong
- first_name: Felix M.
full_name: Goni, Felix M.
last_name: Goni
- first_name: Javier
full_name: González-Gallego, Javier
last_name: González-Gallego
- first_name: Tomas
full_name: Gonzalez-Hernandez, Tomas
last_name: Gonzalez-Hernandez
- first_name: Rosa A.
full_name: Gonzalez-Polo, Rosa A.
last_name: Gonzalez-Polo
- first_name: Jose A.
full_name: Gonzalez-Reyes, Jose A.
last_name: Gonzalez-Reyes
- first_name: Patricia
full_name: González-Rodríguez, Patricia
last_name: González-Rodríguez
- first_name: Ing Swie
full_name: Goping, Ing Swie
last_name: Goping
- first_name: Marina S.
full_name: Gorbatyuk, Marina S.
last_name: Gorbatyuk
- first_name: Nikolai V.
full_name: Gorbunov, Nikolai V.
last_name: Gorbunov
- first_name: Kıvanç
full_name: Görgülü, Kıvanç
last_name: Görgülü
- first_name: Roxana M.
full_name: Gorojod, Roxana M.
last_name: Gorojod
- first_name: Sharon M.
full_name: Gorski, Sharon M.
last_name: Gorski
- first_name: Sandro
full_name: Goruppi, Sandro
last_name: Goruppi
- first_name: Cecilia
full_name: Gotor, Cecilia
last_name: Gotor
- first_name: Roberta A.
full_name: Gottlieb, Roberta A.
last_name: Gottlieb
- first_name: Illana
full_name: Gozes, Illana
last_name: Gozes
- first_name: Devrim
full_name: Gozuacik, Devrim
last_name: Gozuacik
- first_name: Martin
full_name: Graef, Martin
last_name: Graef
- first_name: Markus H.
full_name: Gräler, Markus H.
last_name: Gräler
- first_name: Veronica
full_name: Granatiero, Veronica
last_name: Granatiero
- first_name: Daniel
full_name: Grasso, Daniel
last_name: Grasso
- first_name: Joshua P.
full_name: Gray, Joshua P.
last_name: Gray
- first_name: Douglas R.
full_name: Green, Douglas R.
last_name: Green
- first_name: Alexander
full_name: Greenhough, Alexander
last_name: Greenhough
- first_name: Stephen L.
full_name: Gregory, Stephen L.
last_name: Gregory
- first_name: Edward F.
full_name: Griffin, Edward F.
last_name: Griffin
- first_name: Mark W.
full_name: Grinstaff, Mark W.
last_name: Grinstaff
- first_name: Frederic
full_name: Gros, Frederic
last_name: Gros
- first_name: Charles
full_name: Grose, Charles
last_name: Grose
- first_name: Angelina S.
full_name: Gross, Angelina S.
last_name: Gross
- first_name: Florian
full_name: Gruber, Florian
last_name: Gruber
- first_name: Paolo
full_name: Grumati, Paolo
last_name: Grumati
- first_name: Tilman
full_name: Grune, Tilman
last_name: Grune
- first_name: Xueyan
full_name: Gu, Xueyan
last_name: Gu
- first_name: Jun Lin
full_name: Guan, Jun Lin
last_name: Guan
- first_name: Carlos M.
full_name: Guardia, Carlos M.
last_name: Guardia
- first_name: Kishore
full_name: Guda, Kishore
last_name: Guda
- first_name: Flora
full_name: Guerra, Flora
last_name: Guerra
- first_name: Consuelo
full_name: Guerri, Consuelo
last_name: Guerri
- first_name: Prasun
full_name: Guha, Prasun
last_name: Guha
- first_name: Carlos
full_name: Guillén, Carlos
last_name: Guillén
- first_name: Shashi
full_name: Gujar, Shashi
last_name: Gujar
- first_name: Anna
full_name: Gukovskaya, Anna
last_name: Gukovskaya
- first_name: Ilya
full_name: Gukovsky, Ilya
last_name: Gukovsky
- first_name: Jan
full_name: Gunst, Jan
last_name: Gunst
- first_name: Andreas
full_name: Günther, Andreas
last_name: Günther
- first_name: Anyonya R.
full_name: Guntur, Anyonya R.
last_name: Guntur
- first_name: Chuanyong
full_name: Guo, Chuanyong
last_name: Guo
- first_name: Chun
full_name: Guo, Chun
last_name: Guo
- first_name: Hongqing
full_name: Guo, Hongqing
last_name: Guo
- first_name: Lian Wang
full_name: Guo, Lian Wang
last_name: Guo
- first_name: Ming
full_name: Guo, Ming
last_name: Guo
- first_name: Pawan
full_name: Gupta, Pawan
last_name: Gupta
- first_name: Shashi Kumar
full_name: Gupta, Shashi Kumar
last_name: Gupta
- first_name: Swapnil
full_name: Gupta, Swapnil
last_name: Gupta
- first_name: Veer Bala
full_name: Gupta, Veer Bala
last_name: Gupta
- first_name: Vivek
full_name: Gupta, Vivek
last_name: Gupta
- first_name: Asa B.
full_name: Gustafsson, Asa B.
last_name: Gustafsson
- first_name: David D.
full_name: Gutterman, David D.
last_name: Gutterman
- first_name: Ranjitha
full_name: H.B, Ranjitha
last_name: H.B
- first_name: Annakaisa
full_name: Haapasalo, Annakaisa
last_name: Haapasalo
- first_name: James E.
full_name: Haber, James E.
last_name: Haber
- first_name: Aleksandra
full_name: Hać, Aleksandra
last_name: Hać
- first_name: Shinji
full_name: Hadano, Shinji
last_name: Hadano
- first_name: Anders J.
full_name: Hafrén, Anders J.
last_name: Hafrén
- first_name: Mansour
full_name: Haidar, Mansour
last_name: Haidar
- first_name: Belinda S.
full_name: Hall, Belinda S.
last_name: Hall
- first_name: Gunnel
full_name: Halldén, Gunnel
last_name: Halldén
- first_name: Anne
full_name: Hamacher-Brady, Anne
last_name: Hamacher-Brady
- first_name: Andrea
full_name: Hamann, Andrea
last_name: Hamann
- first_name: Maho
full_name: Hamasaki, Maho
last_name: Hamasaki
- first_name: Weidong
full_name: Han, Weidong
last_name: Han
- first_name: Malene
full_name: Hansen, Malene
last_name: Hansen
- first_name: Phyllis I. .
full_name: Hanson, Phyllis I. .
last_name: Hanson
- first_name: Zijian
full_name: Hao, Zijian
last_name: Hao
- first_name: Masaru
full_name: Harada, Masaru
last_name: Harada
- first_name: Ljubica
full_name: Harhaji-Trajkovic, Ljubica
last_name: Harhaji-Trajkovic
- first_name: Nirmala
full_name: Hariharan, Nirmala
last_name: Hariharan
- first_name: Nigil
full_name: Haroon, Nigil
last_name: Haroon
- first_name: James
full_name: Harris, James
last_name: Harris
- first_name: Takafumi
full_name: Hasegawa, Takafumi
last_name: Hasegawa
- first_name: Noor
full_name: Hasima Nagoor, Noor
last_name: Hasima Nagoor
- first_name: Jeffrey A.
full_name: Haspel, Jeffrey A.
last_name: Haspel
- first_name: Volker
full_name: Haucke, Volker
last_name: Haucke
- first_name: Wayne D.
full_name: Hawkins, Wayne D.
last_name: Hawkins
- first_name: Bruce A.
full_name: Hay, Bruce A.
last_name: Hay
- first_name: Cole M.
full_name: Haynes, Cole M.
last_name: Haynes
- first_name: Soren B.
full_name: Hayrabedyan, Soren B.
last_name: Hayrabedyan
- first_name: Thomas S.
full_name: Hays, Thomas S.
last_name: Hays
- first_name: Congcong
full_name: He, Congcong
last_name: He
- first_name: Qin
full_name: He, Qin
last_name: He
- first_name: Rong Rong
full_name: He, Rong Rong
last_name: He
- first_name: You Wen
full_name: He, You Wen
last_name: He
- first_name: Yu Ying
full_name: He, Yu Ying
last_name: He
- first_name: Yasser
full_name: Heakal, Yasser
last_name: Heakal
- first_name: Alexander M.
full_name: Heberle, Alexander M.
last_name: Heberle
- first_name: J. Fielding
full_name: Hejtmancik, J. Fielding
last_name: Hejtmancik
- first_name: Gudmundur Vignir
full_name: Helgason, Gudmundur Vignir
last_name: Helgason
- first_name: Vanessa
full_name: Henkel, Vanessa
last_name: Henkel
- first_name: Marc
full_name: Herb, Marc
last_name: Herb
- first_name: Alexander
full_name: Hergovich, Alexander
last_name: Hergovich
- first_name: Anna
full_name: Herman-Antosiewicz, Anna
last_name: Herman-Antosiewicz
- first_name: Agustín
full_name: Hernández, Agustín
last_name: Hernández
- first_name: Carlos
full_name: Hernandez, Carlos
last_name: Hernandez
- first_name: Sergio
full_name: Hernandez-Diaz, Sergio
last_name: Hernandez-Diaz
- first_name: Virginia
full_name: Hernandez-Gea, Virginia
last_name: Hernandez-Gea
- first_name: Amaury
full_name: Herpin, Amaury
last_name: Herpin
- first_name: Judit
full_name: Herreros, Judit
last_name: Herreros
- first_name: Javier H.
full_name: Hervás, Javier H.
last_name: Hervás
- first_name: Daniel
full_name: Hesselson, Daniel
last_name: Hesselson
- first_name: Claudio
full_name: Hetz, Claudio
last_name: Hetz
- first_name: Volker T.
full_name: Heussler, Volker T.
last_name: Heussler
- first_name: Yujiro
full_name: Higuchi, Yujiro
last_name: Higuchi
- first_name: Sabine
full_name: Hilfiker, Sabine
last_name: Hilfiker
- first_name: Joseph A.
full_name: Hill, Joseph A.
last_name: Hill
- first_name: William S.
full_name: Hlavacek, William S.
last_name: Hlavacek
- first_name: Emmanuel A.
full_name: Ho, Emmanuel A.
last_name: Ho
- first_name: Idy H.T.
full_name: Ho, Idy H.T.
last_name: Ho
- first_name: Philip Wing Lok
full_name: Ho, Philip Wing Lok
last_name: Ho
- first_name: Shu Leong
full_name: Ho, Shu Leong
last_name: Ho
- first_name: Wan Yun
full_name: Ho, Wan Yun
last_name: Ho
- first_name: G. Aaron
full_name: Hobbs, G. Aaron
last_name: Hobbs
- first_name: Mark
full_name: Hochstrasser, Mark
last_name: Hochstrasser
- first_name: Peter H.M.
full_name: Hoet, Peter H.M.
last_name: Hoet
- first_name: Daniel
full_name: Hofius, Daniel
last_name: Hofius
- first_name: Paul
full_name: Hofman, Paul
last_name: Hofman
- first_name: Annika
full_name: Höhn, Annika
last_name: Höhn
- first_name: Carina I.
full_name: Holmberg, Carina I.
last_name: Holmberg
- first_name: Jose R.
full_name: Hombrebueno, Jose R.
last_name: Hombrebueno
- first_name: Chang Won Hong
full_name: Yi-Ren Hong, Chang Won Hong
last_name: Yi-Ren Hong
- first_name: Lora V.
full_name: Hooper, Lora V.
last_name: Hooper
- first_name: Thorsten
full_name: Hoppe, Thorsten
last_name: Hoppe
- first_name: Rastislav
full_name: Horos, Rastislav
last_name: Horos
- first_name: Yujin
full_name: Hoshida, Yujin
last_name: Hoshida
- first_name: I. Lun
full_name: Hsin, I. Lun
last_name: Hsin
- first_name: Hsin Yun
full_name: Hsu, Hsin Yun
last_name: Hsu
- first_name: Bing
full_name: Hu, Bing
last_name: Hu
- first_name: Dong
full_name: Hu, Dong
last_name: Hu
- first_name: Li Fang
full_name: Hu, Li Fang
last_name: Hu
- first_name: Ming Chang
full_name: Hu, Ming Chang
last_name: Hu
- first_name: Ronggui
full_name: Hu, Ronggui
last_name: Hu
- first_name: Wei
full_name: Hu, Wei
last_name: Hu
- first_name: Yu Chen
full_name: Hu, Yu Chen
last_name: Hu
- first_name: Zhuo Wei
full_name: Hu, Zhuo Wei
last_name: Hu
- first_name: Fang
full_name: Hua, Fang
last_name: Hua
- first_name: Jinlian
full_name: Hua, Jinlian
last_name: Hua
- first_name: Yingqi
full_name: Hua, Yingqi
last_name: Hua
- first_name: Chongmin
full_name: Huan, Chongmin
last_name: Huan
- first_name: Canhua
full_name: Huang, Canhua
last_name: Huang
- first_name: Chuanshu
full_name: Huang, Chuanshu
last_name: Huang
- first_name: Chuanxin
full_name: Huang, Chuanxin
last_name: Huang
- first_name: Chunling
full_name: Huang, Chunling
last_name: Huang
- first_name: Haishan
full_name: Huang, Haishan
last_name: Huang
- first_name: Kun
full_name: Huang, Kun
last_name: Huang
- first_name: Michael L.H.
full_name: Huang, Michael L.H.
last_name: Huang
- first_name: Rui
full_name: Huang, Rui
last_name: Huang
- first_name: Shan
full_name: Huang, Shan
last_name: Huang
- first_name: Tianzhi
full_name: Huang, Tianzhi
last_name: Huang
- first_name: Xing
full_name: Huang, Xing
last_name: Huang
- first_name: Yuxiang Jack
full_name: Huang, Yuxiang Jack
last_name: Huang
- first_name: Tobias B.
full_name: Huber, Tobias B.
last_name: Huber
- first_name: Virginie
full_name: Hubert, Virginie
last_name: Hubert
- first_name: Christian A.
full_name: Hubner, Christian A.
last_name: Hubner
- first_name: Stephanie M.
full_name: Hughes, Stephanie M.
last_name: Hughes
- first_name: William E.
full_name: Hughes, William E.
last_name: Hughes
- first_name: Magali
full_name: Humbert, Magali
last_name: Humbert
- first_name: Gerhard
full_name: Hummer, Gerhard
last_name: Hummer
- first_name: James H.
full_name: Hurley, James H.
last_name: Hurley
- first_name: Sabah
full_name: Hussain, Sabah
last_name: Hussain
- first_name: Salik
full_name: Hussain, Salik
last_name: Hussain
- first_name: Patrick J.
full_name: Hussey, Patrick J.
last_name: Hussey
- first_name: Martina
full_name: Hutabarat, Martina
last_name: Hutabarat
- first_name: Hui Yun
full_name: Hwang, Hui Yun
last_name: Hwang
- first_name: Seungmin
full_name: Hwang, Seungmin
last_name: Hwang
- first_name: Antonio
full_name: Ieni, Antonio
last_name: Ieni
- first_name: Fumiyo
full_name: Ikeda, Fumiyo
last_name: Ikeda
- first_name: Yusuke
full_name: Imagawa, Yusuke
last_name: Imagawa
- first_name: Yuzuru
full_name: Imai, Yuzuru
last_name: Imai
- first_name: Carol
full_name: Imbriano, Carol
last_name: Imbriano
- first_name: Masaya
full_name: Imoto, Masaya
last_name: Imoto
- first_name: Denise M.
full_name: Inman, Denise M.
last_name: Inman
- first_name: Ken
full_name: Inoki, Ken
last_name: Inoki
- first_name: Juan
full_name: Iovanna, Juan
last_name: Iovanna
- first_name: Renato V.
full_name: Iozzo, Renato V.
last_name: Iozzo
- first_name: Giuseppe
full_name: Ippolito, Giuseppe
last_name: Ippolito
- first_name: Javier E.
full_name: Irazoqui, Javier E.
last_name: Irazoqui
- first_name: Pablo
full_name: Iribarren, Pablo
last_name: Iribarren
- first_name: Mohd
full_name: Ishaq, Mohd
last_name: Ishaq
- first_name: Makoto
full_name: Ishikawa, Makoto
last_name: Ishikawa
- first_name: Nestor
full_name: Ishimwe, Nestor
last_name: Ishimwe
- first_name: Ciro
full_name: Isidoro, Ciro
last_name: Isidoro
- first_name: Nahed
full_name: Ismail, Nahed
last_name: Ismail
- first_name: Shohreh
full_name: Issazadeh-Navikas, Shohreh
last_name: Issazadeh-Navikas
- first_name: Eisuke
full_name: Itakura, Eisuke
last_name: Itakura
- first_name: Daisuke
full_name: Ito, Daisuke
last_name: Ito
- first_name: Davor
full_name: Ivankovic, Davor
last_name: Ivankovic
- first_name: Saška
full_name: Ivanova, Saška
last_name: Ivanova
- first_name: Anand Krishnan V.
full_name: Iyer, Anand Krishnan V.
last_name: Iyer
- first_name: José M.
full_name: Izquierdo, José M.
last_name: Izquierdo
- first_name: Masanori
full_name: Izumi, Masanori
last_name: Izumi
- first_name: Marja
full_name: Jäättelä, Marja
last_name: Jäättelä
- first_name: Majid Sakhi
full_name: Jabir, Majid Sakhi
last_name: Jabir
- first_name: William T.
full_name: Jackson, William T.
last_name: Jackson
- first_name: Nadia
full_name: Jacobo-Herrera, Nadia
last_name: Jacobo-Herrera
- first_name: Anne Claire
full_name: Jacomin, Anne Claire
last_name: Jacomin
- first_name: Elise
full_name: Jacquin, Elise
last_name: Jacquin
- first_name: Pooja
full_name: Jadiya, Pooja
last_name: Jadiya
- first_name: Hartmut
full_name: Jaeschke, Hartmut
last_name: Jaeschke
- first_name: Chinnaswamy
full_name: Jagannath, Chinnaswamy
last_name: Jagannath
- first_name: Arjen J.
full_name: Jakobi, Arjen J.
last_name: Jakobi
- first_name: Johan
full_name: Jakobsson, Johan
last_name: Jakobsson
- first_name: Bassam
full_name: Janji, Bassam
last_name: Janji
- first_name: Pidder
full_name: Jansen-Dürr, Pidder
last_name: Jansen-Dürr
- first_name: Patric J.
full_name: Jansson, Patric J.
last_name: Jansson
- first_name: Jonathan
full_name: Jantsch, Jonathan
last_name: Jantsch
- first_name: Sławomir
full_name: Januszewski, Sławomir
last_name: Januszewski
- first_name: Alagie
full_name: Jassey, Alagie
last_name: Jassey
- first_name: Steve
full_name: Jean, Steve
last_name: Jean
- first_name: Hélène
full_name: Jeltsch-David, Hélène
last_name: Jeltsch-David
- first_name: Pavla
full_name: Jendelova, Pavla
last_name: Jendelova
- first_name: Andreas
full_name: Jenny, Andreas
last_name: Jenny
- first_name: Thomas E.
full_name: Jensen, Thomas E.
last_name: Jensen
- first_name: Niels
full_name: Jessen, Niels
last_name: Jessen
- first_name: Jenna L.
full_name: Jewell, Jenna L.
last_name: Jewell
- first_name: Jing
full_name: Ji, Jing
last_name: Ji
- first_name: Lijun
full_name: Jia, Lijun
last_name: Jia
- first_name: Rui
full_name: Jia, Rui
last_name: Jia
- first_name: Liwen
full_name: Jiang, Liwen
last_name: Jiang
- first_name: Qing
full_name: Jiang, Qing
last_name: Jiang
- first_name: Richeng
full_name: Jiang, Richeng
last_name: Jiang
- first_name: Teng
full_name: Jiang, Teng
last_name: Jiang
- first_name: Xuejun
full_name: Jiang, Xuejun
last_name: Jiang
- first_name: Yu
full_name: Jiang, Yu
last_name: Jiang
- first_name: Maria
full_name: Jimenez-Sanchez, Maria
last_name: Jimenez-Sanchez
- first_name: Eun Jung
full_name: Jin, Eun Jung
last_name: Jin
- first_name: Fengyan
full_name: Jin, Fengyan
last_name: Jin
- first_name: Hongchuan
full_name: Jin, Hongchuan
last_name: Jin
- first_name: Li
full_name: Jin, Li
last_name: Jin
- first_name: Luqi
full_name: Jin, Luqi
last_name: Jin
- first_name: Meiyan
full_name: Jin, Meiyan
last_name: Jin
- first_name: Si
full_name: Jin, Si
last_name: Jin
- first_name: Eun Kyeong
full_name: Jo, Eun Kyeong
last_name: Jo
- first_name: Carine
full_name: Joffre, Carine
last_name: Joffre
- first_name: Terje
full_name: Johansen, Terje
last_name: Johansen
- first_name: Gail V.W.
full_name: Johnson, Gail V.W.
last_name: Johnson
- first_name: Simon A.
full_name: Johnston, Simon A.
last_name: Johnston
- first_name: Eija
full_name: Jokitalo, Eija
last_name: Jokitalo
- first_name: Mohit Kumar
full_name: Jolly, Mohit Kumar
last_name: Jolly
- first_name: Leo A.B.
full_name: Joosten, Leo A.B.
last_name: Joosten
- first_name: Joaquin
full_name: Jordan, Joaquin
last_name: Jordan
- first_name: Bertrand
full_name: Joseph, Bertrand
last_name: Joseph
- first_name: Dianwen
full_name: Ju, Dianwen
last_name: Ju
- first_name: Jeong Sun
full_name: Ju, Jeong Sun
last_name: Ju
- first_name: Jingfang
full_name: Ju, Jingfang
last_name: Ju
- first_name: Esmeralda
full_name: Juárez, Esmeralda
last_name: Juárez
- first_name: Delphine
full_name: Judith, Delphine
last_name: Judith
- first_name: Gábor
full_name: Juhász, Gábor
last_name: Juhász
- first_name: Youngsoo
full_name: Jun, Youngsoo
last_name: Jun
- first_name: Chang Hwa
full_name: Jung, Chang Hwa
last_name: Jung
- first_name: Sung Chul
full_name: Jung, Sung Chul
last_name: Jung
- first_name: Yong Keun
full_name: Jung, Yong Keun
last_name: Jung
- first_name: Heinz
full_name: Jungbluth, Heinz
last_name: Jungbluth
- first_name: Johannes
full_name: Jungverdorben, Johannes
last_name: Jungverdorben
- first_name: Steffen
full_name: Just, Steffen
last_name: Just
- first_name: Kai
full_name: Kaarniranta, Kai
last_name: Kaarniranta
- first_name: Allen
full_name: Kaasik, Allen
last_name: Kaasik
- first_name: Tomohiro
full_name: Kabuta, Tomohiro
last_name: Kabuta
- first_name: Daniel
full_name: Kaganovich, Daniel
last_name: Kaganovich
- first_name: Alon
full_name: Kahana, Alon
last_name: Kahana
- first_name: Renate
full_name: Kain, Renate
last_name: Kain
- first_name: Shinjo
full_name: Kajimura, Shinjo
last_name: Kajimura
- first_name: Maria
full_name: Kalamvoki, Maria
last_name: Kalamvoki
- first_name: Manjula
full_name: Kalia, Manjula
last_name: Kalia
- first_name: Danuta S.
full_name: Kalinowski, Danuta S.
last_name: Kalinowski
- first_name: Nina
full_name: Kaludercic, Nina
last_name: Kaludercic
- first_name: Ioanna
full_name: Kalvari, Ioanna
last_name: Kalvari
- first_name: Joanna
full_name: Kaminska, Joanna
last_name: Kaminska
- first_name: Vitaliy O.
full_name: Kaminskyy, Vitaliy O.
last_name: Kaminskyy
- first_name: Hiromitsu
full_name: Kanamori, Hiromitsu
last_name: Kanamori
- first_name: Keizo
full_name: Kanasaki, Keizo
last_name: Kanasaki
- first_name: Chanhee
full_name: Kang, Chanhee
last_name: Kang
- first_name: Rui
full_name: Kang, Rui
last_name: Kang
- first_name: Sang Sun
full_name: Kang, Sang Sun
last_name: Kang
- first_name: Senthilvelrajan
full_name: Kaniyappan, Senthilvelrajan
last_name: Kaniyappan
- first_name: Tomotake
full_name: Kanki, Tomotake
last_name: Kanki
- first_name: Thirumala Devi
full_name: Kanneganti, Thirumala Devi
last_name: Kanneganti
- first_name: Anumantha G.
full_name: Kanthasamy, Anumantha G.
last_name: Kanthasamy
- first_name: Arthi
full_name: Kanthasamy, Arthi
last_name: Kanthasamy
- first_name: Marc
full_name: Kantorow, Marc
last_name: Kantorow
- first_name: Orsolya
full_name: Kapuy, Orsolya
last_name: Kapuy
- first_name: Michalis V.
full_name: Karamouzis, Michalis V.
last_name: Karamouzis
- first_name: Md Razaul
full_name: Karim, Md Razaul
last_name: Karim
- first_name: Parimal
full_name: Karmakar, Parimal
last_name: Karmakar
- first_name: Rajesh G.
full_name: Katare, Rajesh G.
last_name: Katare
- first_name: Masaru
full_name: Kato, Masaru
last_name: Kato
- first_name: Stefan H.E.
full_name: Kaufmann, Stefan H.E.
last_name: Kaufmann
- first_name: Anu
full_name: Kauppinen, Anu
last_name: Kauppinen
- first_name: Gur P.
full_name: Kaushal, Gur P.
last_name: Kaushal
- first_name: Susmita
full_name: Kaushik, Susmita
last_name: Kaushik
- first_name: Kiyoshi
full_name: Kawasaki, Kiyoshi
last_name: Kawasaki
- first_name: Kemal
full_name: Kazan, Kemal
last_name: Kazan
- first_name: Po Yuan
full_name: Ke, Po Yuan
last_name: Ke
- first_name: Damien J.
full_name: Keating, Damien J.
last_name: Keating
- first_name: Ursula
full_name: Keber, Ursula
last_name: Keber
- first_name: John H.
full_name: Kehrl, John H.
last_name: Kehrl
- first_name: Kate E.
full_name: Keller, Kate E.
last_name: Keller
- first_name: Christian W.
full_name: Keller, Christian W.
last_name: Keller
- first_name: Jongsook Kim
full_name: Kemper, Jongsook Kim
last_name: Kemper
- first_name: Candia M.
full_name: Kenific, Candia M.
last_name: Kenific
- first_name: Oliver
full_name: Kepp, Oliver
last_name: Kepp
- first_name: Stephanie
full_name: Kermorgant, Stephanie
last_name: Kermorgant
- first_name: Andreas
full_name: Kern, Andreas
last_name: Kern
- first_name: Robin
full_name: Ketteler, Robin
last_name: Ketteler
- first_name: Tom G.
full_name: Keulers, Tom G.
last_name: Keulers
- first_name: Boris
full_name: Khalfin, Boris
last_name: Khalfin
- first_name: Hany
full_name: Khalil, Hany
last_name: Khalil
- first_name: Bilon
full_name: Khambu, Bilon
last_name: Khambu
- first_name: Shahid Y.
full_name: Khan, Shahid Y.
last_name: Khan
- first_name: Vinoth Kumar Megraj
full_name: Khandelwal, Vinoth Kumar Megraj
last_name: Khandelwal
- first_name: Rekha
full_name: Khandia, Rekha
last_name: Khandia
- first_name: Widuri
full_name: Kho, Widuri
last_name: Kho
- first_name: Noopur V.
full_name: Khobrekar, Noopur V.
last_name: Khobrekar
- first_name: Sataree
full_name: Khuansuwan, Sataree
last_name: Khuansuwan
- first_name: Mukhran
full_name: Khundadze, Mukhran
last_name: Khundadze
- first_name: Samuel A.
full_name: Killackey, Samuel A.
last_name: Killackey
- first_name: Dasol
full_name: Kim, Dasol
last_name: Kim
- first_name: Deok Ryong
full_name: Kim, Deok Ryong
last_name: Kim
- first_name: Do Hyung
full_name: Kim, Do Hyung
last_name: Kim
- first_name: Dong Eun
full_name: Kim, Dong Eun
last_name: Kim
- first_name: Eun Young
full_name: Kim, Eun Young
last_name: Kim
- first_name: Eun Kyoung
full_name: Kim, Eun Kyoung
last_name: Kim
- first_name: Hak Rim
full_name: Kim, Hak Rim
last_name: Kim
- first_name: Hee Sik
full_name: Kim, Hee Sik
last_name: Kim
- first_name: Unknown
full_name: Hyung-Ryong Kim, Unknown
last_name: Hyung-Ryong Kim
- first_name: Jeong Hun
full_name: Kim, Jeong Hun
last_name: Kim
- first_name: Jin Kyung
full_name: Kim, Jin Kyung
last_name: Kim
- first_name: Jin Hoi
full_name: Kim, Jin Hoi
last_name: Kim
- first_name: Joungmok
full_name: Kim, Joungmok
last_name: Kim
- first_name: Ju Hwan
full_name: Kim, Ju Hwan
last_name: Kim
- first_name: Keun Il
full_name: Kim, Keun Il
last_name: Kim
- first_name: Peter K.
full_name: Kim, Peter K.
last_name: Kim
- first_name: Seong Jun
full_name: Kim, Seong Jun
last_name: Kim
- first_name: Scot R.
full_name: Kimball, Scot R.
last_name: Kimball
- first_name: Adi
full_name: Kimchi, Adi
last_name: Kimchi
- first_name: Alec C.
full_name: Kimmelman, Alec C.
last_name: Kimmelman
- first_name: Tomonori
full_name: Kimura, Tomonori
last_name: Kimura
- first_name: Matthew A.
full_name: King, Matthew A.
last_name: King
- first_name: Kerri J.
full_name: Kinghorn, Kerri J.
last_name: Kinghorn
- first_name: Conan G.
full_name: Kinsey, Conan G.
last_name: Kinsey
- first_name: Vladimir
full_name: Kirkin, Vladimir
last_name: Kirkin
- first_name: Lorrie A.
full_name: Kirshenbaum, Lorrie A.
last_name: Kirshenbaum
- first_name: Sergey L.
full_name: Kiselev, Sergey L.
last_name: Kiselev
- first_name: Shuji
full_name: Kishi, Shuji
last_name: Kishi
- first_name: Katsuhiko
full_name: Kitamoto, Katsuhiko
last_name: Kitamoto
- first_name: Yasushi
full_name: Kitaoka, Yasushi
last_name: Kitaoka
- first_name: Kaio
full_name: Kitazato, Kaio
last_name: Kitazato
- first_name: Richard N.
full_name: Kitsis, Richard N.
last_name: Kitsis
- first_name: Josef T.
full_name: Kittler, Josef T.
last_name: Kittler
- first_name: Ole
full_name: Kjaerulff, Ole
last_name: Kjaerulff
- first_name: Peter S.
full_name: Klein, Peter S.
last_name: Klein
- first_name: Thomas
full_name: Klopstock, Thomas
last_name: Klopstock
- first_name: Jochen
full_name: Klucken, Jochen
last_name: Klucken
- first_name: Helene
full_name: Knævelsrud, Helene
last_name: Knævelsrud
- first_name: Roland L.
full_name: Knorr, Roland L.
last_name: Knorr
- first_name: Ben C.B.
full_name: Ko, Ben C.B.
last_name: Ko
- first_name: Fred
full_name: Ko, Fred
last_name: Ko
- first_name: Jiunn Liang
full_name: Ko, Jiunn Liang
last_name: Ko
- first_name: Hotaka
full_name: Kobayashi, Hotaka
last_name: Kobayashi
- first_name: Satoru
full_name: Kobayashi, Satoru
last_name: Kobayashi
- first_name: Ina
full_name: Koch, Ina
last_name: Koch
- first_name: Jan C.
full_name: Koch, Jan C.
last_name: Koch
- first_name: Ulrich
full_name: Koenig, Ulrich
last_name: Koenig
- first_name: Donat
full_name: Kögel, Donat
last_name: Kögel
- first_name: Young Ho
full_name: Koh, Young Ho
last_name: Koh
- first_name: Masato
full_name: Koike, Masato
last_name: Koike
- first_name: Sepp D.
full_name: Kohlwein, Sepp D.
last_name: Kohlwein
- first_name: Nur M.
full_name: Kocaturk, Nur M.
last_name: Kocaturk
- first_name: Masaaki
full_name: Komatsu, Masaaki
last_name: Komatsu
- first_name: Jeannette
full_name: König, Jeannette
last_name: König
- first_name: Toru
full_name: Kono, Toru
last_name: Kono
- first_name: Benjamin T.
full_name: Kopp, Benjamin T.
last_name: Kopp
- first_name: Tamas
full_name: Korcsmaros, Tamas
last_name: Korcsmaros
- first_name: Gözde
full_name: Korkmaz, Gözde
last_name: Korkmaz
- first_name: Viktor I.
full_name: Korolchuk, Viktor I.
last_name: Korolchuk
- first_name: Mónica Suárez
full_name: Korsnes, Mónica Suárez
last_name: Korsnes
- first_name: Ali
full_name: Koskela, Ali
last_name: Koskela
- first_name: Janaiah
full_name: Kota, Janaiah
last_name: Kota
- first_name: Yaichiro
full_name: Kotake, Yaichiro
last_name: Kotake
- first_name: Monica L.
full_name: Kotler, Monica L.
last_name: Kotler
- first_name: Yanjun
full_name: Kou, Yanjun
last_name: Kou
- first_name: Michael I.
full_name: Koukourakis, Michael I.
last_name: Koukourakis
- first_name: Evangelos
full_name: Koustas, Evangelos
last_name: Koustas
- first_name: Attila L.
full_name: Kovacs, Attila L.
last_name: Kovacs
- first_name: Tibor
full_name: Kovács, Tibor
last_name: Kovács
- first_name: Daisuke
full_name: Koya, Daisuke
last_name: Koya
- first_name: Tomohiro
full_name: Kozako, Tomohiro
last_name: Kozako
- first_name: Claudine
full_name: Kraft, Claudine
last_name: Kraft
- first_name: Dimitri
full_name: Krainc, Dimitri
last_name: Krainc
- first_name: Helmut
full_name: Krämer, Helmut
last_name: Krämer
- first_name: Anna D.
full_name: Krasnodembskaya, Anna D.
last_name: Krasnodembskaya
- first_name: Carole
full_name: Kretz-Remy, Carole
last_name: Kretz-Remy
- first_name: Guido
full_name: Kroemer, Guido
last_name: Kroemer
- first_name: Nicholas T.
full_name: Ktistakis, Nicholas T.
last_name: Ktistakis
- first_name: Kazuyuki
full_name: Kuchitsu, Kazuyuki
last_name: Kuchitsu
- first_name: Sabine
full_name: Kuenen, Sabine
last_name: Kuenen
- first_name: Lars
full_name: Kuerschner, Lars
last_name: Kuerschner
- first_name: Thomas
full_name: Kukar, Thomas
last_name: Kukar
- first_name: Ajay
full_name: Kumar, Ajay
last_name: Kumar
- first_name: Ashok
full_name: Kumar, Ashok
last_name: Kumar
- first_name: Deepak
full_name: Kumar, Deepak
last_name: Kumar
- first_name: Dhiraj
full_name: Kumar, Dhiraj
last_name: Kumar
- first_name: Sharad
full_name: Kumar, Sharad
last_name: Kumar
- first_name: Shinji
full_name: Kume, Shinji
last_name: Kume
- first_name: Caroline
full_name: Kumsta, Caroline
last_name: Kumsta
- first_name: Chanakya N.
full_name: Kundu, Chanakya N.
last_name: Kundu
- first_name: Mondira
full_name: Kundu, Mondira
last_name: Kundu
- first_name: Ajaikumar B.
full_name: Kunnumakkara, Ajaikumar B.
last_name: Kunnumakkara
- first_name: Lukasz
full_name: Kurgan, Lukasz
last_name: Kurgan
- first_name: Tatiana G.
full_name: Kutateladze, Tatiana G.
last_name: Kutateladze
- first_name: Ozlem
full_name: Kutlu, Ozlem
last_name: Kutlu
- first_name: Seong Ae
full_name: Kwak, Seong Ae
last_name: Kwak
- first_name: Ho Jeong
full_name: Kwon, Ho Jeong
last_name: Kwon
- first_name: Taeg Kyu
full_name: Kwon, Taeg Kyu
last_name: Kwon
- first_name: Yong Tae
full_name: Kwon, Yong Tae
last_name: Kwon
- first_name: Irene
full_name: Kyrmizi, Irene
last_name: Kyrmizi
- first_name: Albert
full_name: La Spada, Albert
last_name: La Spada
- first_name: Patrick
full_name: Labonté, Patrick
last_name: Labonté
- first_name: Sylvain
full_name: Ladoire, Sylvain
last_name: Ladoire
- first_name: Ilaria
full_name: Laface, Ilaria
last_name: Laface
- first_name: Frank
full_name: Lafont, Frank
last_name: Lafont
- first_name: Diane C.
full_name: Lagace, Diane C.
last_name: Lagace
- first_name: Vikramjit
full_name: Lahiri, Vikramjit
last_name: Lahiri
- first_name: Zhibing
full_name: Lai, Zhibing
last_name: Lai
- first_name: Angela S.
full_name: Laird, Angela S.
last_name: Laird
- first_name: Aparna
full_name: Lakkaraju, Aparna
last_name: Lakkaraju
- first_name: Trond
full_name: Lamark, Trond
last_name: Lamark
- first_name: Sheng Hui
full_name: Lan, Sheng Hui
last_name: Lan
- first_name: Ane
full_name: Landajuela, Ane
last_name: Landajuela
- first_name: Darius J.R.
full_name: Lane, Darius J.R.
last_name: Lane
- first_name: Jon D.
full_name: Lane, Jon D.
last_name: Lane
- first_name: Charles H.
full_name: Lang, Charles H.
last_name: Lang
- first_name: Carsten
full_name: Lange, Carsten
last_name: Lange
- first_name: Ülo
full_name: Langel, Ülo
last_name: Langel
- first_name: Rupert
full_name: Langer, Rupert
last_name: Langer
- first_name: Pierre
full_name: Lapaquette, Pierre
last_name: Lapaquette
- first_name: Jocelyn
full_name: Laporte, Jocelyn
last_name: Laporte
- first_name: Nicholas F.
full_name: Larusso, Nicholas F.
last_name: Larusso
- first_name: Isabel
full_name: Lastres-Becker, Isabel
last_name: Lastres-Becker
- first_name: Wilson Chun Yu
full_name: Lau, Wilson Chun Yu
last_name: Lau
- first_name: Gordon W.
full_name: Laurie, Gordon W.
last_name: Laurie
- first_name: Sergio
full_name: Lavandero, Sergio
last_name: Lavandero
- first_name: Betty Yuen Kwan
full_name: Law, Betty Yuen Kwan
last_name: Law
- first_name: Helen Ka Wai
full_name: Law, Helen Ka Wai
last_name: Law
- first_name: Rob
full_name: Layfield, Rob
last_name: Layfield
- first_name: Weidong
full_name: Le, Weidong
last_name: Le
- first_name: Herve
full_name: Le Stunff, Herve
last_name: Le Stunff
- first_name: Alexandre Y.
full_name: Leary, Alexandre Y.
last_name: Leary
- first_name: Jean Jacques
full_name: Lebrun, Jean Jacques
last_name: Lebrun
- first_name: Lionel Y.W.
full_name: Leck, Lionel Y.W.
last_name: Leck
- first_name: Jean Philippe
full_name: Leduc-Gaudet, Jean Philippe
last_name: Leduc-Gaudet
- first_name: Changwook
full_name: Lee, Changwook
last_name: Lee
- first_name: Chung Pei
full_name: Lee, Chung Pei
last_name: Lee
- first_name: Da Hye
full_name: Lee, Da Hye
last_name: Lee
- first_name: Edward B.
full_name: Lee, Edward B.
last_name: Lee
- first_name: Erinna F.
full_name: Lee, Erinna F.
last_name: Lee
- first_name: Gyun Min
full_name: Lee, Gyun Min
last_name: Lee
- first_name: He Jin
full_name: Lee, He Jin
last_name: Lee
- first_name: Heung Kyu
full_name: Lee, Heung Kyu
last_name: Lee
- first_name: Jae Man
full_name: Lee, Jae Man
last_name: Lee
- first_name: Jason S.
full_name: Lee, Jason S.
last_name: Lee
- first_name: Jin A.
full_name: Lee, Jin A.
last_name: Lee
- first_name: Joo Yong
full_name: Lee, Joo Yong
last_name: Lee
- first_name: Jun Hee
full_name: Lee, Jun Hee
last_name: Lee
- first_name: Michael
full_name: Lee, Michael
last_name: Lee
- first_name: Min Goo
full_name: Lee, Min Goo
last_name: Lee
- first_name: Min Jae
full_name: Lee, Min Jae
last_name: Lee
- first_name: Myung Shik
full_name: Lee, Myung Shik
last_name: Lee
- first_name: Sang Yoon
full_name: Lee, Sang Yoon
last_name: Lee
- first_name: Seung Jae
full_name: Lee, Seung Jae
last_name: Lee
- first_name: Stella Y.
full_name: Lee, Stella Y.
last_name: Lee
- first_name: Sung Bae
full_name: Lee, Sung Bae
last_name: Lee
- first_name: Won Hee
full_name: Lee, Won Hee
last_name: Lee
- first_name: Ying Ray
full_name: Lee, Ying Ray
last_name: Lee
- first_name: Yong Ho
full_name: Lee, Yong Ho
last_name: Lee
- first_name: Youngil
full_name: Lee, Youngil
last_name: Lee
- first_name: Christophe
full_name: Lefebvre, Christophe
last_name: Lefebvre
- first_name: Renaud
full_name: Legouis, Renaud
last_name: Legouis
- first_name: Yu L.
full_name: Lei, Yu L.
last_name: Lei
- first_name: Yuchen
full_name: Lei, Yuchen
last_name: Lei
- first_name: Sergey
full_name: Leikin, Sergey
last_name: Leikin
- first_name: Gerd
full_name: Leitinger, Gerd
last_name: Leitinger
- first_name: Leticia
full_name: Lemus, Leticia
last_name: Lemus
- first_name: Shuilong
full_name: Leng, Shuilong
last_name: Leng
- first_name: Olivia
full_name: Lenoir, Olivia
last_name: Lenoir
- first_name: Guido
full_name: Lenz, Guido
last_name: Lenz
- first_name: Heinz Josef
full_name: Lenz, Heinz Josef
last_name: Lenz
- first_name: Paola
full_name: Lenzi, Paola
last_name: Lenzi
- first_name: Yolanda
full_name: León, Yolanda
last_name: León
- first_name: Andréia M.
full_name: Leopoldino, Andréia M.
last_name: Leopoldino
- first_name: Christoph
full_name: Leschczyk, Christoph
last_name: Leschczyk
- first_name: Stina
full_name: Leskelä, Stina
last_name: Leskelä
- first_name: Elisabeth
full_name: Letellier, Elisabeth
last_name: Letellier
- first_name: Chi Ting
full_name: Leung, Chi Ting
last_name: Leung
- first_name: Po Sing
full_name: Leung, Po Sing
last_name: Leung
- first_name: Jeremy S.
full_name: Leventhal, Jeremy S.
last_name: Leventhal
- first_name: Beth
full_name: Levine, Beth
last_name: Levine
- first_name: Patrick A.
full_name: Lewis, Patrick A.
last_name: Lewis
- first_name: Klaus
full_name: Ley, Klaus
last_name: Ley
- first_name: Bin
full_name: Li, Bin
last_name: Li
- first_name: Da Qiang
full_name: Li, Da Qiang
last_name: Li
- first_name: Jianming
full_name: Li, Jianming
last_name: Li
- first_name: Jing
full_name: Li, Jing
last_name: Li
- first_name: Jiong
full_name: Li, Jiong
last_name: Li
- first_name: Ke
full_name: Li, Ke
last_name: Li
- first_name: Liwu
full_name: Li, Liwu
last_name: Li
- first_name: Mei
full_name: Li, Mei
last_name: Li
- first_name: Min
full_name: Li, Min
last_name: Li
- first_name: Min
full_name: Li, Min
last_name: Li
- first_name: Ming
full_name: Li, Ming
last_name: Li
- first_name: Mingchuan
full_name: Li, Mingchuan
last_name: Li
- first_name: Pin Lan
full_name: Li, Pin Lan
last_name: Li
- first_name: Ming Qing
full_name: Li, Ming Qing
last_name: Li
- first_name: Qing
full_name: Li, Qing
last_name: Li
- first_name: Sheng
full_name: Li, Sheng
last_name: Li
- first_name: Tiangang
full_name: Li, Tiangang
last_name: Li
- first_name: Wei
full_name: Li, Wei
last_name: Li
- first_name: Wenming
full_name: Li, Wenming
last_name: Li
- first_name: Xue
full_name: Li, Xue
last_name: Li
- first_name: Yi Ping
full_name: Li, Yi Ping
last_name: Li
- first_name: Yuan
full_name: Li, Yuan
last_name: Li
- first_name: Zhiqiang
full_name: Li, Zhiqiang
last_name: Li
- first_name: Zhiyong
full_name: Li, Zhiyong
last_name: Li
- first_name: Zhiyuan
full_name: Li, Zhiyuan
last_name: Li
- first_name: Jiqin
full_name: Lian, Jiqin
last_name: Lian
- first_name: Chengyu
full_name: Liang, Chengyu
last_name: Liang
- first_name: Qiangrong
full_name: Liang, Qiangrong
last_name: Liang
- first_name: Weicheng
full_name: Liang, Weicheng
last_name: Liang
- first_name: Yongheng
full_name: Liang, Yongheng
last_name: Liang
- first_name: Yong Tian
full_name: Liang, Yong Tian
last_name: Liang
- first_name: Guanghong
full_name: Liao, Guanghong
last_name: Liao
- first_name: Lujian
full_name: Liao, Lujian
last_name: Liao
- first_name: Mingzhi
full_name: Liao, Mingzhi
last_name: Liao
- first_name: Yung Feng
full_name: Liao, Yung Feng
last_name: Liao
- first_name: Mariangela
full_name: Librizzi, Mariangela
last_name: Librizzi
- first_name: Pearl P.Y.
full_name: Lie, Pearl P.Y.
last_name: Lie
- first_name: Mary A.
full_name: Lilly, Mary A.
last_name: Lilly
- first_name: Hyunjung J.
full_name: Lim, Hyunjung J.
last_name: Lim
- first_name: Thania R.R.
full_name: Lima, Thania R.R.
last_name: Lima
- first_name: Federica
full_name: Limana, Federica
last_name: Limana
- first_name: Chao
full_name: Lin, Chao
last_name: Lin
- first_name: Chih Wen
full_name: Lin, Chih Wen
last_name: Lin
- first_name: Dar Shong
full_name: Lin, Dar Shong
last_name: Lin
- first_name: Fu Cheng
full_name: Lin, Fu Cheng
last_name: Lin
- first_name: Jiandie D.
full_name: Lin, Jiandie D.
last_name: Lin
- first_name: Kurt M.
full_name: Lin, Kurt M.
last_name: Lin
- first_name: Kwang Huei
full_name: Lin, Kwang Huei
last_name: Lin
- first_name: Liang Tzung
full_name: Lin, Liang Tzung
last_name: Lin
- first_name: Pei Hui
full_name: Lin, Pei Hui
last_name: Lin
- first_name: Qiong
full_name: Lin, Qiong
last_name: Lin
- first_name: Shaofeng
full_name: Lin, Shaofeng
last_name: Lin
- first_name: Su Ju
full_name: Lin, Su Ju
last_name: Lin
- first_name: Wenyu
full_name: Lin, Wenyu
last_name: Lin
- first_name: Xueying
full_name: Lin, Xueying
last_name: Lin
- first_name: Yao Xin
full_name: Lin, Yao Xin
last_name: Lin
- first_name: Yee Shin
full_name: Lin, Yee Shin
last_name: Lin
- first_name: Rafael
full_name: Linden, Rafael
last_name: Linden
- first_name: Paula
full_name: Lindner, Paula
last_name: Lindner
- first_name: Shuo Chien
full_name: Ling, Shuo Chien
last_name: Ling
- first_name: Paul
full_name: Lingor, Paul
last_name: Lingor
- first_name: Amelia K.
full_name: Linnemann, Amelia K.
last_name: Linnemann
- first_name: Yih Cherng
full_name: Liou, Yih Cherng
last_name: Liou
- first_name: Marta M.
full_name: Lipinski, Marta M.
last_name: Lipinski
- first_name: Saška
full_name: Lipovšek, Saška
last_name: Lipovšek
- first_name: Vitor A.
full_name: Lira, Vitor A.
last_name: Lira
- first_name: Natalia
full_name: Lisiak, Natalia
last_name: Lisiak
- first_name: Paloma B.
full_name: Liton, Paloma B.
last_name: Liton
- first_name: Chao
full_name: Liu, Chao
last_name: Liu
- first_name: Ching Hsuan
full_name: Liu, Ching Hsuan
last_name: Liu
- first_name: Chun Feng
full_name: Liu, Chun Feng
last_name: Liu
- first_name: Cui Hua
full_name: Liu, Cui Hua
last_name: Liu
- first_name: Fang
full_name: Liu, Fang
last_name: Liu
- first_name: Hao
full_name: Liu, Hao
last_name: Liu
- first_name: Hsiao Sheng
full_name: Liu, Hsiao Sheng
last_name: Liu
- first_name: Hua Feng
full_name: Liu, Hua Feng
last_name: Liu
- first_name: Huifang
full_name: Liu, Huifang
last_name: Liu
- first_name: Jia
full_name: Liu, Jia
last_name: Liu
- first_name: Jing
full_name: Liu, Jing
last_name: Liu
- first_name: Julia
full_name: Liu, Julia
last_name: Liu
- first_name: Leyuan
full_name: Liu, Leyuan
last_name: Liu
- first_name: Longhua
full_name: Liu, Longhua
last_name: Liu
- first_name: Meilian
full_name: Liu, Meilian
last_name: Liu
- first_name: Qin
full_name: Liu, Qin
last_name: Liu
- first_name: Wei
full_name: Liu, Wei
last_name: Liu
- first_name: Wende
full_name: Liu, Wende
last_name: Liu
- first_name: Xiao Hong
full_name: Liu, Xiao Hong
last_name: Liu
- first_name: Xiaodong
full_name: Liu, Xiaodong
last_name: Liu
- first_name: Xingguo
full_name: Liu, Xingguo
last_name: Liu
- first_name: Xu
full_name: Liu, Xu
last_name: Liu
- first_name: Xuedong
full_name: Liu, Xuedong
last_name: Liu
- first_name: Yanfen
full_name: Liu, Yanfen
last_name: Liu
- first_name: Yang
full_name: Liu, Yang
last_name: Liu
- first_name: Yang
full_name: Liu, Yang
last_name: Liu
- first_name: Yueyang
full_name: Liu, Yueyang
last_name: Liu
- first_name: Yule
full_name: Liu, Yule
last_name: Liu
- first_name: J. Andrew
full_name: Livingston, J. Andrew
last_name: Livingston
- first_name: Gerard
full_name: Lizard, Gerard
last_name: Lizard
- first_name: Jose M.
full_name: Lizcano, Jose M.
last_name: Lizcano
- first_name: Senka
full_name: Ljubojevic-Holzer, Senka
last_name: Ljubojevic-Holzer
- first_name: Matilde E.
full_name: Lleonart, Matilde E.
last_name: Lleonart
- first_name: David
full_name: Llobet-Navàs, David
last_name: Llobet-Navàs
- first_name: Alicia
full_name: Llorente, Alicia
last_name: Llorente
- first_name: Chih Hung
full_name: Lo, Chih Hung
last_name: Lo
- first_name: Damián
full_name: Lobato-Márquez, Damián
last_name: Lobato-Márquez
- first_name: Qi
full_name: Long, Qi
last_name: Long
- first_name: Yun Chau
full_name: Long, Yun Chau
last_name: Long
- first_name: Ben
full_name: Loos, Ben
last_name: Loos
- first_name: Julia A.
full_name: Loos, Julia A.
last_name: Loos
- first_name: Manuela G.
full_name: López, Manuela G.
last_name: López
- first_name: Guillermo
full_name: López-Doménech, Guillermo
last_name: López-Doménech
- first_name: José Antonio
full_name: López-Guerrero, José Antonio
last_name: López-Guerrero
- first_name: Ana T.
full_name: López-Jiménez, Ana T.
last_name: López-Jiménez
- first_name: Óscar
full_name: López-Pérez, Óscar
last_name: López-Pérez
- first_name: Israel
full_name: López-Valero, Israel
last_name: López-Valero
- first_name: Magdalena J.
full_name: Lorenowicz, Magdalena J.
last_name: Lorenowicz
- first_name: Mar
full_name: Lorente, Mar
last_name: Lorente
- first_name: Peter
full_name: Lorincz, Peter
last_name: Lorincz
- first_name: Laura
full_name: Lossi, Laura
last_name: Lossi
- first_name: Sophie
full_name: Lotersztajn, Sophie
last_name: Lotersztajn
- first_name: Penny E.
full_name: Lovat, Penny E.
last_name: Lovat
- first_name: Jonathan F.
full_name: Lovell, Jonathan F.
last_name: Lovell
- first_name: Alenka
full_name: Lovy, Alenka
last_name: Lovy
- first_name: Péter
full_name: Lőw, Péter
last_name: Lőw
- first_name: Guang
full_name: Lu, Guang
last_name: Lu
- first_name: Haocheng
full_name: Lu, Haocheng
last_name: Lu
- first_name: Jia Hong
full_name: Lu, Jia Hong
last_name: Lu
- first_name: Jin Jian
full_name: Lu, Jin Jian
last_name: Lu
- first_name: Mengji
full_name: Lu, Mengji
last_name: Lu
- first_name: Shuyan
full_name: Lu, Shuyan
last_name: Lu
- first_name: Alessandro
full_name: Luciani, Alessandro
last_name: Luciani
- first_name: John M.
full_name: Lucocq, John M.
last_name: Lucocq
- first_name: Paula
full_name: Ludovico, Paula
last_name: Ludovico
- first_name: Micah A.
full_name: Luftig, Micah A.
last_name: Luftig
- first_name: Morten
full_name: Luhr, Morten
last_name: Luhr
- first_name: Diego
full_name: Luis-Ravelo, Diego
last_name: Luis-Ravelo
- first_name: Julian J.
full_name: Lum, Julian J.
last_name: Lum
- first_name: Liany
full_name: Luna-Dulcey, Liany
last_name: Luna-Dulcey
- first_name: Anders H.
full_name: Lund, Anders H.
last_name: Lund
- first_name: Viktor K.
full_name: Lund, Viktor K.
last_name: Lund
- first_name: Jan D.
full_name: Lünemann, Jan D.
last_name: Lünemann
- first_name: Patrick
full_name: Lüningschrör, Patrick
last_name: Lüningschrör
- first_name: Honglin
full_name: Luo, Honglin
last_name: Luo
- first_name: Rongcan
full_name: Luo, Rongcan
last_name: Luo
- first_name: Shouqing
full_name: Luo, Shouqing
last_name: Luo
- first_name: Zhi
full_name: Luo, Zhi
last_name: Luo
- first_name: Claudio
full_name: Luparello, Claudio
last_name: Luparello
- first_name: Bernhard
full_name: Lüscher, Bernhard
last_name: Lüscher
- first_name: Luan
full_name: Luu, Luan
last_name: Luu
- first_name: Alex
full_name: Lyakhovich, Alex
last_name: Lyakhovich
- first_name: Konstantin G.
full_name: Lyamzaev, Konstantin G.
last_name: Lyamzaev
- first_name: Alf Håkon
full_name: Lystad, Alf Håkon
last_name: Lystad
- first_name: Lyubomyr
full_name: Lytvynchuk, Lyubomyr
last_name: Lytvynchuk
- first_name: Alvin C.
full_name: Ma, Alvin C.
last_name: Ma
- first_name: Changle
full_name: Ma, Changle
last_name: Ma
- first_name: Mengxiao
full_name: Ma, Mengxiao
last_name: Ma
- first_name: Ning Fang
full_name: Ma, Ning Fang
last_name: Ma
- first_name: Quan Hong
full_name: Ma, Quan Hong
last_name: Ma
- first_name: Xinliang
full_name: Ma, Xinliang
last_name: Ma
- first_name: Yueyun
full_name: Ma, Yueyun
last_name: Ma
- first_name: Zhenyi
full_name: Ma, Zhenyi
last_name: Ma
- first_name: Ormond A.
full_name: Macdougald, Ormond A.
last_name: Macdougald
- first_name: Fernando
full_name: Macian, Fernando
last_name: Macian
- first_name: Gustavo C.
full_name: Macintosh, Gustavo C.
last_name: Macintosh
- first_name: Jeffrey P.
full_name: Mackeigan, Jeffrey P.
last_name: Mackeigan
- first_name: Kay F.
full_name: Macleod, Kay F.
last_name: Macleod
- first_name: Sandra
full_name: Maday, Sandra
last_name: Maday
- first_name: Frank
full_name: Madeo, Frank
last_name: Madeo
- first_name: Muniswamy
full_name: Madesh, Muniswamy
last_name: Madesh
- first_name: Tobias
full_name: Madl, Tobias
last_name: Madl
- first_name: Julio
full_name: Madrigal-Matute, Julio
last_name: Madrigal-Matute
- first_name: Akiko
full_name: Maeda, Akiko
last_name: Maeda
- first_name: Yasuhiro
full_name: Maejima, Yasuhiro
last_name: Maejima
- first_name: Marta
full_name: Magarinos, Marta
last_name: Magarinos
- first_name: Poornima
full_name: Mahavadi, Poornima
last_name: Mahavadi
- first_name: Emiliano
full_name: Maiani, Emiliano
last_name: Maiani
- first_name: Kenneth
full_name: Maiese, Kenneth
last_name: Maiese
- first_name: Panchanan
full_name: Maiti, Panchanan
last_name: Maiti
- first_name: Maria Chiara
full_name: Maiuri, Maria Chiara
last_name: Maiuri
- first_name: Barbara
full_name: Majello, Barbara
last_name: Majello
- first_name: Michael B.
full_name: Major, Michael B.
last_name: Major
- first_name: Elena
full_name: Makareeva, Elena
last_name: Makareeva
- first_name: Fayaz
full_name: Malik, Fayaz
last_name: Malik
- first_name: Karthik
full_name: Mallilankaraman, Karthik
last_name: Mallilankaraman
- first_name: Walter
full_name: Malorni, Walter
last_name: Malorni
- first_name: Alina
full_name: Maloyan, Alina
last_name: Maloyan
- first_name: Najiba
full_name: Mammadova, Najiba
last_name: Mammadova
- first_name: Gene Chi Wai
full_name: Man, Gene Chi Wai
last_name: Man
- first_name: Federico
full_name: Manai, Federico
last_name: Manai
- first_name: Joseph D.
full_name: Mancias, Joseph D.
last_name: Mancias
- first_name: Eva Maria
full_name: Mandelkow, Eva Maria
last_name: Mandelkow
- first_name: Michael A.
full_name: Mandell, Michael A.
last_name: Mandell
- first_name: Angelo A.
full_name: Manfredi, Angelo A.
last_name: Manfredi
- first_name: Masoud H.
full_name: Manjili, Masoud H.
last_name: Manjili
- first_name: Ravi
full_name: Manjithaya, Ravi
last_name: Manjithaya
- first_name: Patricio
full_name: Manque, Patricio
last_name: Manque
- first_name: Bella B.
full_name: Manshian, Bella B.
last_name: Manshian
- first_name: Raquel
full_name: Manzano, Raquel
last_name: Manzano
- first_name: Claudia
full_name: Manzoni, Claudia
last_name: Manzoni
- first_name: Kai
full_name: Mao, Kai
last_name: Mao
- first_name: Cinzia
full_name: Marchese, Cinzia
last_name: Marchese
- first_name: Sandrine
full_name: Marchetti, Sandrine
last_name: Marchetti
- first_name: Anna Maria
full_name: Marconi, Anna Maria
last_name: Marconi
- first_name: Fabrizio
full_name: Marcucci, Fabrizio
last_name: Marcucci
- first_name: Stefania
full_name: Mardente, Stefania
last_name: Mardente
- first_name: Olga A.
full_name: Mareninova, Olga A.
last_name: Mareninova
- first_name: Marta
full_name: Margeta, Marta
last_name: Margeta
- first_name: Muriel
full_name: Mari, Muriel
last_name: Mari
- first_name: Sara
full_name: Marinelli, Sara
last_name: Marinelli
- first_name: Oliviero
full_name: Marinelli, Oliviero
last_name: Marinelli
- first_name: Guillermo
full_name: Mariño, Guillermo
last_name: Mariño
- first_name: Sofia
full_name: Mariotto, Sofia
last_name: Mariotto
- first_name: Richard S.
full_name: Marshall, Richard S.
last_name: Marshall
- first_name: Mark R.
full_name: Marten, Mark R.
last_name: Marten
- first_name: Sascha
full_name: Martens, Sascha
last_name: Martens
- first_name: Alexandre P.J.
full_name: Martin, Alexandre P.J.
last_name: Martin
- first_name: Katie R.
full_name: Martin, Katie R.
last_name: Martin
- first_name: Sara
full_name: Martin, Sara
last_name: Martin
- first_name: Shaun
full_name: Martin, Shaun
last_name: Martin
- first_name: Adrián
full_name: Martín-Segura, Adrián
last_name: Martín-Segura
- first_name: Miguel A.
full_name: Martín-Acebes, Miguel A.
last_name: Martín-Acebes
- first_name: Inmaculada
full_name: Martin-Burriel, Inmaculada
last_name: Martin-Burriel
- first_name: Marcos
full_name: Martin-Rincon, Marcos
last_name: Martin-Rincon
- first_name: Paloma
full_name: Martin-Sanz, Paloma
last_name: Martin-Sanz
- first_name: José A.
full_name: Martina, José A.
last_name: Martina
- first_name: Wim
full_name: Martinet, Wim
last_name: Martinet
- first_name: Aitor
full_name: Martinez, Aitor
last_name: Martinez
- first_name: Ana
full_name: Martinez, Ana
last_name: Martinez
- first_name: Jennifer
full_name: Martinez, Jennifer
last_name: Martinez
- first_name: Moises
full_name: Martinez Velazquez, Moises
last_name: Martinez Velazquez
- first_name: Nuria
full_name: Martinez-Lopez, Nuria
last_name: Martinez-Lopez
- first_name: Marta
full_name: Martinez-Vicente, Marta
last_name: Martinez-Vicente
- first_name: Daniel O.
full_name: Martins, Daniel O.
last_name: Martins
- first_name: Joilson O.
full_name: Martins, Joilson O.
last_name: Martins
- first_name: Waleska K.
full_name: Martins, Waleska K.
last_name: Martins
- first_name: Tania
full_name: Martins-Marques, Tania
last_name: Martins-Marques
- first_name: Emanuele
full_name: Marzetti, Emanuele
last_name: Marzetti
- first_name: Shashank
full_name: Masaldan, Shashank
last_name: Masaldan
- first_name: Celine
full_name: Masclaux-Daubresse, Celine
last_name: Masclaux-Daubresse
- first_name: Douglas G.
full_name: Mashek, Douglas G.
last_name: Mashek
- first_name: Valentina
full_name: Massa, Valentina
last_name: Massa
- first_name: Lourdes
full_name: Massieu, Lourdes
last_name: Massieu
- first_name: Glenn R.
full_name: Masson, Glenn R.
last_name: Masson
- first_name: Laura
full_name: Masuelli, Laura
last_name: Masuelli
- first_name: Anatoliy I.
full_name: Masyuk, Anatoliy I.
last_name: Masyuk
- first_name: Tetyana V.
full_name: Masyuk, Tetyana V.
last_name: Masyuk
- first_name: Paola
full_name: Matarrese, Paola
last_name: Matarrese
- first_name: Ander
full_name: Matheu, Ander
last_name: Matheu
- first_name: Satoaki
full_name: Matoba, Satoaki
last_name: Matoba
- first_name: Sachiko
full_name: Matsuzaki, Sachiko
last_name: Matsuzaki
- first_name: Pamela
full_name: Mattar, Pamela
last_name: Mattar
- first_name: Alessandro
full_name: Matte, Alessandro
last_name: Matte
- first_name: Domenico
full_name: Mattoscio, Domenico
last_name: Mattoscio
- first_name: José L.
full_name: Mauriz, José L.
last_name: Mauriz
- first_name: Mario
full_name: Mauthe, Mario
last_name: Mauthe
- first_name: Caroline
full_name: Mauvezin, Caroline
last_name: Mauvezin
- first_name: Emanual
full_name: Maverakis, Emanual
last_name: Maverakis
- first_name: Paola
full_name: Maycotte, Paola
last_name: Maycotte
- first_name: Johanna
full_name: Mayer, Johanna
last_name: Mayer
- first_name: Gianluigi
full_name: Mazzoccoli, Gianluigi
last_name: Mazzoccoli
- first_name: Cristina
full_name: Mazzoni, Cristina
last_name: Mazzoni
- first_name: Joseph R.
full_name: Mazzulli, Joseph R.
last_name: Mazzulli
- first_name: Nami
full_name: Mccarty, Nami
last_name: Mccarty
- first_name: Christine
full_name: Mcdonald, Christine
last_name: Mcdonald
- first_name: Mitchell R.
full_name: Mcgill, Mitchell R.
last_name: Mcgill
- first_name: Sharon L.
full_name: Mckenna, Sharon L.
last_name: Mckenna
- first_name: Beth Ann
full_name: Mclaughlin, Beth Ann
last_name: Mclaughlin
- first_name: Fionn
full_name: Mcloughlin, Fionn
last_name: Mcloughlin
- first_name: Mark A.
full_name: Mcniven, Mark A.
last_name: Mcniven
- first_name: Thomas G.
full_name: Mcwilliams, Thomas G.
last_name: Mcwilliams
- first_name: Fatima
full_name: Mechta-Grigoriou, Fatima
last_name: Mechta-Grigoriou
- first_name: Tania Catarina
full_name: Medeiros, Tania Catarina
last_name: Medeiros
- first_name: Diego L.
full_name: Medina, Diego L.
last_name: Medina
- first_name: Lynn A.
full_name: Megeney, Lynn A.
last_name: Megeney
- first_name: Klara
full_name: Megyeri, Klara
last_name: Megyeri
- first_name: Maryam
full_name: Mehrpour, Maryam
last_name: Mehrpour
- first_name: Jawahar L.
full_name: Mehta, Jawahar L.
last_name: Mehta
- first_name: Alfred J.
full_name: Meijer, Alfred J.
last_name: Meijer
- first_name: Annemarie H.
full_name: Meijer, Annemarie H.
last_name: Meijer
- first_name: Jakob
full_name: Mejlvang, Jakob
last_name: Mejlvang
- first_name: Alicia
full_name: Meléndez, Alicia
last_name: Meléndez
- first_name: Annette
full_name: Melk, Annette
last_name: Melk
- first_name: Gonen
full_name: Memisoglu, Gonen
last_name: Memisoglu
- first_name: Alexandrina F.
full_name: Mendes, Alexandrina F.
last_name: Mendes
- first_name: Delong
full_name: Meng, Delong
last_name: Meng
- first_name: Fei
full_name: Meng, Fei
last_name: Meng
- first_name: Tian
full_name: Meng, Tian
last_name: Meng
- first_name: Rubem
full_name: Menna-Barreto, Rubem
last_name: Menna-Barreto
- first_name: Manoj B.
full_name: Menon, Manoj B.
last_name: Menon
- first_name: Carol
full_name: Mercer, Carol
last_name: Mercer
- first_name: Anne E.
full_name: Mercier, Anne E.
last_name: Mercier
- first_name: Jean Louis
full_name: Mergny, Jean Louis
last_name: Mergny
- first_name: Adalberto
full_name: Merighi, Adalberto
last_name: Merighi
- first_name: Seth D.
full_name: Merkley, Seth D.
last_name: Merkley
- first_name: Giuseppe
full_name: Merla, Giuseppe
last_name: Merla
- first_name: Volker
full_name: Meske, Volker
last_name: Meske
- first_name: Ana Cecilia
full_name: Mestre, Ana Cecilia
last_name: Mestre
- first_name: Shree Padma
full_name: Metur, Shree Padma
last_name: Metur
- first_name: Christian
full_name: Meyer, Christian
last_name: Meyer
- first_name: Hemmo
full_name: Meyer, Hemmo
last_name: Meyer
- first_name: Wenyi
full_name: Mi, Wenyi
last_name: Mi
- first_name: Jeanne
full_name: Mialet-Perez, Jeanne
last_name: Mialet-Perez
- first_name: Junying
full_name: Miao, Junying
last_name: Miao
- first_name: Lucia
full_name: Micale, Lucia
last_name: Micale
- first_name: Yasuo
full_name: Miki, Yasuo
last_name: Miki
- first_name: Enrico
full_name: Milan, Enrico
last_name: Milan
- first_name: Małgorzata
full_name: Milczarek, Małgorzata
last_name: Milczarek
- first_name: Dana L.
full_name: Miller, Dana L.
last_name: Miller
- first_name: Samuel I.
full_name: Miller, Samuel I.
last_name: Miller
- first_name: Silke
full_name: Miller, Silke
last_name: Miller
- first_name: Steven W.
full_name: Millward, Steven W.
last_name: Millward
- first_name: Ira
full_name: Milosevic, Ira
last_name: Milosevic
- first_name: Elena A.
full_name: Minina, Elena A.
last_name: Minina
- first_name: Hamed
full_name: Mirzaei, Hamed
last_name: Mirzaei
- first_name: Hamid Reza
full_name: Mirzaei, Hamid Reza
last_name: Mirzaei
- first_name: Mehdi
full_name: Mirzaei, Mehdi
last_name: Mirzaei
- first_name: Amit
full_name: Mishra, Amit
last_name: Mishra
- first_name: Nandita
full_name: Mishra, Nandita
last_name: Mishra
- first_name: Paras Kumar
full_name: Mishra, Paras Kumar
last_name: Mishra
- first_name: Maja
full_name: Misirkic Marjanovic, Maja
last_name: Misirkic Marjanovic
- first_name: Roberta
full_name: Misasi, Roberta
last_name: Misasi
- first_name: Amit
full_name: Misra, Amit
last_name: Misra
- first_name: Gabriella
full_name: Misso, Gabriella
last_name: Misso
- first_name: Claire
full_name: Mitchell, Claire
last_name: Mitchell
- first_name: Geraldine
full_name: Mitou, Geraldine
last_name: Mitou
- first_name: Tetsuji
full_name: Miura, Tetsuji
last_name: Miura
- first_name: Shigeki
full_name: Miyamoto, Shigeki
last_name: Miyamoto
- first_name: Makoto
full_name: Miyazaki, Makoto
last_name: Miyazaki
- first_name: Mitsunori
full_name: Miyazaki, Mitsunori
last_name: Miyazaki
- first_name: Taiga
full_name: Miyazaki, Taiga
last_name: Miyazaki
- first_name: Keisuke
full_name: Miyazawa, Keisuke
last_name: Miyazawa
- first_name: Noboru
full_name: Mizushima, Noboru
last_name: Mizushima
- first_name: Trine H.
full_name: Mogensen, Trine H.
last_name: Mogensen
- first_name: Baharia
full_name: Mograbi, Baharia
last_name: Mograbi
- first_name: Reza
full_name: Mohammadinejad, Reza
last_name: Mohammadinejad
- first_name: Yasir
full_name: Mohamud, Yasir
last_name: Mohamud
- first_name: Abhishek
full_name: Mohanty, Abhishek
last_name: Mohanty
- first_name: Sipra
full_name: Mohapatra, Sipra
last_name: Mohapatra
- first_name: Torsten
full_name: Möhlmann, Torsten
last_name: Möhlmann
- first_name: Asif
full_name: Mohmmed, Asif
last_name: Mohmmed
- first_name: Anna
full_name: Moles, Anna
last_name: Moles
- first_name: Kelle H.
full_name: Moley, Kelle H.
last_name: Moley
- first_name: Maurizio
full_name: Molinari, Maurizio
last_name: Molinari
- first_name: Vincenzo
full_name: Mollace, Vincenzo
last_name: Mollace
- first_name: Andreas Buch
full_name: Møller, Andreas Buch
last_name: Møller
- first_name: Bertrand
full_name: Mollereau, Bertrand
last_name: Mollereau
- first_name: Faustino
full_name: Mollinedo, Faustino
last_name: Mollinedo
- first_name: Costanza
full_name: Montagna, Costanza
last_name: Montagna
- first_name: Mervyn J.
full_name: Monteiro, Mervyn J.
last_name: Monteiro
- first_name: Andrea
full_name: Montella, Andrea
last_name: Montella
- first_name: L. Ruth
full_name: Montes, L. Ruth
last_name: Montes
- first_name: Barbara
full_name: Montico, Barbara
last_name: Montico
- first_name: Vinod K.
full_name: Mony, Vinod K.
last_name: Mony
- first_name: Giacomo
full_name: Monzio Compagnoni, Giacomo
last_name: Monzio Compagnoni
- first_name: Michael N.
full_name: Moore, Michael N.
last_name: Moore
- first_name: Mohammad A.
full_name: Moosavi, Mohammad A.
last_name: Moosavi
- first_name: Ana L.
full_name: Mora, Ana L.
last_name: Mora
- first_name: Marina
full_name: Mora, Marina
last_name: Mora
- first_name: David
full_name: Morales-Alamo, David
last_name: Morales-Alamo
- first_name: Rosario
full_name: Moratalla, Rosario
last_name: Moratalla
- first_name: Paula I.
full_name: Moreira, Paula I.
last_name: Moreira
- first_name: Elena
full_name: Morelli, Elena
last_name: Morelli
- first_name: Sandra
full_name: Moreno, Sandra
last_name: Moreno
- first_name: Daniel
full_name: Moreno-Blas, Daniel
last_name: Moreno-Blas
- first_name: Viviana
full_name: Moresi, Viviana
last_name: Moresi
- first_name: Benjamin
full_name: Morga, Benjamin
last_name: Morga
- first_name: Alwena H.
full_name: Morgan, Alwena H.
last_name: Morgan
- first_name: Fabrice
full_name: Morin, Fabrice
last_name: Morin
- first_name: Hideaki
full_name: Morishita, Hideaki
last_name: Morishita
- first_name: Orson L.
full_name: Moritz, Orson L.
last_name: Moritz
- first_name: Mariko
full_name: Moriyama, Mariko
last_name: Moriyama
- first_name: Yuji
full_name: Moriyasu, Yuji
last_name: Moriyasu
- first_name: Manuela
full_name: Morleo, Manuela
last_name: Morleo
- first_name: Eugenia
full_name: Morselli, Eugenia
last_name: Morselli
- first_name: Jose F.
full_name: Moruno-Manchon, Jose F.
last_name: Moruno-Manchon
- first_name: Jorge
full_name: Moscat, Jorge
last_name: Moscat
- first_name: Serge
full_name: Mostowy, Serge
last_name: Mostowy
- first_name: Elisa
full_name: Motori, Elisa
last_name: Motori
- first_name: Andrea Felinto
full_name: Moura, Andrea Felinto
last_name: Moura
- first_name: Naima
full_name: Moustaid-Moussa, Naima
last_name: Moustaid-Moussa
- first_name: Maria
full_name: Mrakovcic, Maria
last_name: Mrakovcic
- first_name: Gabriel
full_name: Muciño-Hernández, Gabriel
last_name: Muciño-Hernández
- first_name: Anupam
full_name: Mukherjee, Anupam
last_name: Mukherjee
- first_name: Subhadip
full_name: Mukhopadhyay, Subhadip
last_name: Mukhopadhyay
- first_name: Jean M.
full_name: Mulcahy Levy, Jean M.
last_name: Mulcahy Levy
- first_name: Victoriano
full_name: Mulero, Victoriano
last_name: Mulero
- first_name: Sylviane
full_name: Muller, Sylviane
last_name: Muller
- first_name: Christian
full_name: Münch, Christian
last_name: Münch
- first_name: Ashok
full_name: Munjal, Ashok
last_name: Munjal
- first_name: Pura
full_name: Munoz-Canoves, Pura
last_name: Munoz-Canoves
- first_name: Teresa
full_name: Muñoz-Galdeano, Teresa
last_name: Muñoz-Galdeano
- first_name: Christian
full_name: Münz, Christian
last_name: Münz
- first_name: Tomokazu
full_name: Murakawa, Tomokazu
last_name: Murakawa
- first_name: Claudia
full_name: Muratori, Claudia
last_name: Muratori
- first_name: Brona M.
full_name: Murphy, Brona M.
last_name: Murphy
- first_name: J. Patrick
full_name: Murphy, J. Patrick
last_name: Murphy
- first_name: Aditya
full_name: Murthy, Aditya
last_name: Murthy
- first_name: Timo T.
full_name: Myöhänen, Timo T.
last_name: Myöhänen
- first_name: Indira U.
full_name: Mysorekar, Indira U.
last_name: Mysorekar
- first_name: Jennifer
full_name: Mytych, Jennifer
last_name: Mytych
- first_name: Seyed Mohammad
full_name: Nabavi, Seyed Mohammad
last_name: Nabavi
- first_name: Massimo
full_name: Nabissi, Massimo
last_name: Nabissi
- first_name: Péter
full_name: Nagy, Péter
last_name: Nagy
- first_name: Jihoon
full_name: Nah, Jihoon
last_name: Nah
- first_name: Aimable
full_name: Nahimana, Aimable
last_name: Nahimana
- first_name: Ichiro
full_name: Nakagawa, Ichiro
last_name: Nakagawa
- first_name: Ken
full_name: Nakamura, Ken
last_name: Nakamura
- first_name: Hitoshi
full_name: Nakatogawa, Hitoshi
last_name: Nakatogawa
- first_name: Shyam S.
full_name: Nandi, Shyam S.
last_name: Nandi
- first_name: Meera
full_name: Nanjundan, Meera
last_name: Nanjundan
- first_name: Monica
full_name: Nanni, Monica
last_name: Nanni
- first_name: Gennaro
full_name: Napolitano, Gennaro
last_name: Napolitano
- first_name: Roberta
full_name: Nardacci, Roberta
last_name: Nardacci
- first_name: Masashi
full_name: Narita, Masashi
last_name: Narita
- first_name: Melissa
full_name: Nassif, Melissa
last_name: Nassif
- first_name: Ilana
full_name: Nathan, Ilana
last_name: Nathan
- first_name: Manabu
full_name: Natsumeda, Manabu
last_name: Natsumeda
- first_name: Ryno J.
full_name: Naude, Ryno J.
last_name: Naude
- first_name: Christin
full_name: Naumann, Christin
last_name: Naumann
- first_name: Olaia
full_name: Naveiras, Olaia
last_name: Naveiras
- first_name: Fatemeh
full_name: Navid, Fatemeh
last_name: Navid
- first_name: Steffan T.
full_name: Nawrocki, Steffan T.
last_name: Nawrocki
- first_name: Taras Y.
full_name: Nazarko, Taras Y.
last_name: Nazarko
- first_name: Francesca
full_name: Nazio, Francesca
last_name: Nazio
- first_name: Florentina
full_name: Negoita, Florentina
last_name: Negoita
- first_name: Thomas
full_name: Neill, Thomas
last_name: Neill
- first_name: Amanda L.
full_name: Neisch, Amanda L.
last_name: Neisch
- first_name: Luca M.
full_name: Neri, Luca M.
last_name: Neri
- first_name: Mihai G.
full_name: Netea, Mihai G.
last_name: Netea
- first_name: Patrick
full_name: Neubert, Patrick
last_name: Neubert
- first_name: Thomas P.
full_name: Neufeld, Thomas P.
last_name: Neufeld
- first_name: Dietbert
full_name: Neumann, Dietbert
last_name: Neumann
- first_name: Albert
full_name: Neutzner, Albert
last_name: Neutzner
- first_name: Phillip T.
full_name: Newton, Phillip T.
last_name: Newton
- first_name: Paul A.
full_name: Ney, Paul A.
last_name: Ney
- first_name: Ioannis P.
full_name: Nezis, Ioannis P.
last_name: Nezis
- first_name: Charlene C.W.
full_name: Ng, Charlene C.W.
last_name: Ng
- first_name: Tzi Bun
full_name: Ng, Tzi Bun
last_name: Ng
- first_name: Hang T.T.
full_name: Nguyen, Hang T.T.
last_name: Nguyen
- first_name: Long T.
full_name: Nguyen, Long T.
last_name: Nguyen
- first_name: Hong Min
full_name: Ni, Hong Min
last_name: Ni
- first_name: Clíona
full_name: Ní Cheallaigh, Clíona
last_name: Ní Cheallaigh
- first_name: Zhenhong
full_name: Ni, Zhenhong
last_name: Ni
- first_name: M. Celeste
full_name: Nicolao, M. Celeste
last_name: Nicolao
- first_name: Francesco
full_name: Nicoli, Francesco
last_name: Nicoli
- first_name: Manuel
full_name: Nieto-Diaz, Manuel
last_name: Nieto-Diaz
- first_name: Per
full_name: Nilsson, Per
last_name: Nilsson
- first_name: Shunbin
full_name: Ning, Shunbin
last_name: Ning
- first_name: Rituraj
full_name: Niranjan, Rituraj
last_name: Niranjan
- first_name: Hiroshi
full_name: Nishimune, Hiroshi
last_name: Nishimune
- first_name: Mireia
full_name: Niso-Santano, Mireia
last_name: Niso-Santano
- first_name: Ralph A.
full_name: Nixon, Ralph A.
last_name: Nixon
- first_name: Annalisa
full_name: Nobili, Annalisa
last_name: Nobili
- first_name: Clevio
full_name: Nobrega, Clevio
last_name: Nobrega
- first_name: Takeshi
full_name: Noda, Takeshi
last_name: Noda
- first_name: Uxía
full_name: Nogueira-Recalde, Uxía
last_name: Nogueira-Recalde
- first_name: Trevor M.
full_name: Nolan, Trevor M.
last_name: Nolan
- first_name: Ivan
full_name: Nombela, Ivan
last_name: Nombela
- first_name: Ivana
full_name: Novak, Ivana
last_name: Novak
- first_name: Beatriz
full_name: Novoa, Beatriz
last_name: Novoa
- first_name: Takashi
full_name: Nozawa, Takashi
last_name: Nozawa
- first_name: Nobuyuki
full_name: Nukina, Nobuyuki
last_name: Nukina
- first_name: Carmen
full_name: Nussbaum-Krammer, Carmen
last_name: Nussbaum-Krammer
- first_name: Jesper
full_name: Nylandsted, Jesper
last_name: Nylandsted
- first_name: Tracey R.
full_name: O’Donovan, Tracey R.
last_name: O’Donovan
- first_name: Seónadh M.
full_name: O’Leary, Seónadh M.
last_name: O’Leary
- first_name: Eyleen J.
full_name: O’Rourke, Eyleen J.
last_name: O’Rourke
- first_name: Mary P.
full_name: O’Sullivan, Mary P.
last_name: O’Sullivan
- first_name: Timothy E.
full_name: O’Sullivan, Timothy E.
last_name: O’Sullivan
- first_name: Salvatore
full_name: Oddo, Salvatore
last_name: Oddo
- first_name: Ina
full_name: Oehme, Ina
last_name: Oehme
- first_name: Michinaga
full_name: Ogawa, Michinaga
last_name: Ogawa
- first_name: Eric
full_name: Ogier-Denis, Eric
last_name: Ogier-Denis
- first_name: Margret H.
full_name: Ogmundsdottir, Margret H.
last_name: Ogmundsdottir
- first_name: Besim
full_name: Ogretmen, Besim
last_name: Ogretmen
- first_name: Goo Taeg
full_name: Oh, Goo Taeg
last_name: Oh
- first_name: Seon Hee
full_name: Oh, Seon Hee
last_name: Oh
- first_name: Young J.
full_name: Oh, Young J.
last_name: Oh
- first_name: Takashi
full_name: Ohama, Takashi
last_name: Ohama
- first_name: Yohei
full_name: Ohashi, Yohei
last_name: Ohashi
- first_name: Masaki
full_name: Ohmuraya, Masaki
last_name: Ohmuraya
- first_name: Vasileios
full_name: Oikonomou, Vasileios
last_name: Oikonomou
- first_name: Rani
full_name: Ojha, Rani
last_name: Ojha
- first_name: Koji
full_name: Okamoto, Koji
last_name: Okamoto
- first_name: Hitoshi
full_name: Okazawa, Hitoshi
last_name: Okazawa
- first_name: Masahide
full_name: Oku, Masahide
last_name: Oku
- first_name: Sara
full_name: Oliván, Sara
last_name: Oliván
- first_name: Jorge M.A.
full_name: Oliveira, Jorge M.A.
last_name: Oliveira
- first_name: Michael
full_name: Ollmann, Michael
last_name: Ollmann
- first_name: James A.
full_name: Olzmann, James A.
last_name: Olzmann
- first_name: Shakib
full_name: Omari, Shakib
last_name: Omari
- first_name: M. Bishr
full_name: Omary, M. Bishr
last_name: Omary
- first_name: Gizem
full_name: Önal, Gizem
last_name: Önal
- first_name: Martin
full_name: Ondrej, Martin
last_name: Ondrej
- first_name: Sang Bing
full_name: Ong, Sang Bing
last_name: Ong
- first_name: Sang Ging
full_name: Ong, Sang Ging
last_name: Ong
- first_name: Anna
full_name: Onnis, Anna
last_name: Onnis
- first_name: Juan A.
full_name: Orellana, Juan A.
last_name: Orellana
- first_name: Sara
full_name: Orellana-Muñoz, Sara
last_name: Orellana-Muñoz
- first_name: Maria Del Mar
full_name: Ortega-Villaizan, Maria Del Mar
last_name: Ortega-Villaizan
- first_name: Xilma R.
full_name: Ortiz-Gonzalez, Xilma R.
last_name: Ortiz-Gonzalez
- first_name: Elena
full_name: Ortona, Elena
last_name: Ortona
- first_name: Heinz D.
full_name: Osiewacz, Heinz D.
last_name: Osiewacz
- first_name: Abdel Hamid K.
full_name: Osman, Abdel Hamid K.
last_name: Osman
- first_name: Rosario
full_name: Osta, Rosario
last_name: Osta
- first_name: Marisa S.
full_name: Otegui, Marisa S.
last_name: Otegui
- first_name: Kinya
full_name: Otsu, Kinya
last_name: Otsu
- first_name: Christiane
full_name: Ott, Christiane
last_name: Ott
- first_name: Luisa
full_name: Ottobrini, Luisa
last_name: Ottobrini
- first_name: Jing Hsiung James
full_name: Ou, Jing Hsiung James
last_name: Ou
- first_name: Tiago F.
full_name: Outeiro, Tiago F.
last_name: Outeiro
- first_name: Inger
full_name: Oynebraten, Inger
last_name: Oynebraten
- first_name: Melek
full_name: Ozturk, Melek
last_name: Ozturk
- first_name: Gilles
full_name: Pagès, Gilles
last_name: Pagès
- first_name: Susanta
full_name: Pahari, Susanta
last_name: Pahari
- first_name: Marta
full_name: Pajares, Marta
last_name: Pajares
- first_name: Utpal B.
full_name: Pajvani, Utpal B.
last_name: Pajvani
- first_name: Rituraj
full_name: Pal, Rituraj
last_name: Pal
- first_name: Simona
full_name: Paladino, Simona
last_name: Paladino
- first_name: Nicolas
full_name: Pallet, Nicolas
last_name: Pallet
- first_name: Michela
full_name: Palmieri, Michela
last_name: Palmieri
- first_name: Giuseppe
full_name: Palmisano, Giuseppe
last_name: Palmisano
- first_name: Camilla
full_name: Palumbo, Camilla
last_name: Palumbo
- first_name: Francesco
full_name: Pampaloni, Francesco
last_name: Pampaloni
- first_name: Lifeng
full_name: Pan, Lifeng
last_name: Pan
- first_name: Qingjun
full_name: Pan, Qingjun
last_name: Pan
- first_name: Wenliang
full_name: Pan, Wenliang
last_name: Pan
- first_name: Xin
full_name: Pan, Xin
last_name: Pan
- first_name: Ganna
full_name: Panasyuk, Ganna
last_name: Panasyuk
- first_name: Rahul
full_name: Pandey, Rahul
last_name: Pandey
- first_name: Udai B.
full_name: Pandey, Udai B.
last_name: Pandey
- first_name: Vrajesh
full_name: Pandya, Vrajesh
last_name: Pandya
- first_name: Francesco
full_name: Paneni, Francesco
last_name: Paneni
- first_name: Shirley Y.
full_name: Pang, Shirley Y.
last_name: Pang
- first_name: Elisa
full_name: Panzarini, Elisa
last_name: Panzarini
- first_name: Daniela L.
full_name: Papademetrio, Daniela L.
last_name: Papademetrio
- first_name: Elena
full_name: Papaleo, Elena
last_name: Papaleo
- first_name: Daniel
full_name: Papinski, Daniel
last_name: Papinski
- first_name: Diana
full_name: Papp, Diana
last_name: Papp
- first_name: Eun Chan
full_name: Park, Eun Chan
last_name: Park
- first_name: Hwan Tae
full_name: Park, Hwan Tae
last_name: Park
- first_name: Ji Man
full_name: Park, Ji Man
last_name: Park
- first_name: Jong In
full_name: Park, Jong In
last_name: Park
- first_name: Joon Tae
full_name: Park, Joon Tae
last_name: Park
- first_name: Junsoo
full_name: Park, Junsoo
last_name: Park
- first_name: Sang Chul
full_name: Park, Sang Chul
last_name: Park
- first_name: Sang Youel
full_name: Park, Sang Youel
last_name: Park
- first_name: Abraham H.
full_name: Parola, Abraham H.
last_name: Parola
- first_name: Jan B.
full_name: Parys, Jan B.
last_name: Parys
- first_name: Adrien
full_name: Pasquier, Adrien
last_name: Pasquier
- first_name: Benoit
full_name: Pasquier, Benoit
last_name: Pasquier
- first_name: João F.
full_name: Passos, João F.
last_name: Passos
- first_name: Nunzia
full_name: Pastore, Nunzia
last_name: Pastore
- first_name: Hemal H.
full_name: Patel, Hemal H.
last_name: Patel
- first_name: Daniel
full_name: Patschan, Daniel
last_name: Patschan
- first_name: Sophie
full_name: Pattingre, Sophie
last_name: Pattingre
- first_name: Gustavo
full_name: Pedraza-Alva, Gustavo
last_name: Pedraza-Alva
- first_name: Jose
full_name: Pedraza-Chaverri, Jose
last_name: Pedraza-Chaverri
- first_name: Zully
full_name: Pedrozo, Zully
last_name: Pedrozo
- first_name: Gang
full_name: Pei, Gang
last_name: Pei
- first_name: Jianming
full_name: Pei, Jianming
last_name: Pei
- first_name: Hadas
full_name: Peled-Zehavi, Hadas
last_name: Peled-Zehavi
- first_name: Joaquín M.
full_name: Pellegrini, Joaquín M.
last_name: Pellegrini
- first_name: Joffrey
full_name: Pelletier, Joffrey
last_name: Pelletier
- first_name: Miguel A.
full_name: Peñalva, Miguel A.
last_name: Peñalva
- first_name: Di
full_name: Peng, Di
last_name: Peng
- first_name: Ying
full_name: Peng, Ying
last_name: Peng
- first_name: Fabio
full_name: Penna, Fabio
last_name: Penna
- first_name: Maria
full_name: Pennuto, Maria
last_name: Pennuto
- first_name: Francesca
full_name: Pentimalli, Francesca
last_name: Pentimalli
- first_name: Cláudia M.F.
full_name: Pereira, Cláudia M.F.
last_name: Pereira
- first_name: Gustavo J.S.
full_name: Pereira, Gustavo J.S.
last_name: Pereira
- first_name: Lilian C.
full_name: Pereira, Lilian C.
last_name: Pereira
- first_name: Luis
full_name: Pereira De Almeida, Luis
last_name: Pereira De Almeida
- first_name: Nirma D.
full_name: Perera, Nirma D.
last_name: Perera
- first_name: Ángel
full_name: Pérez-Lara, Ángel
last_name: Pérez-Lara
- first_name: Ana B.
full_name: Perez-Oliva, Ana B.
last_name: Perez-Oliva
- first_name: María Esther
full_name: Pérez-Pérez, María Esther
last_name: Pérez-Pérez
- first_name: Palsamy
full_name: Periyasamy, Palsamy
last_name: Periyasamy
- first_name: Andras
full_name: Perl, Andras
last_name: Perl
- first_name: Cristiana
full_name: Perrotta, Cristiana
last_name: Perrotta
- first_name: Ida
full_name: Perrotta, Ida
last_name: Perrotta
- first_name: Richard G.
full_name: Pestell, Richard G.
last_name: Pestell
- first_name: Morten
full_name: Petersen, Morten
last_name: Petersen
- first_name: Irina
full_name: Petrache, Irina
last_name: Petrache
- first_name: Goran
full_name: Petrovski, Goran
last_name: Petrovski
- first_name: Thorsten
full_name: Pfirrmann, Thorsten
last_name: Pfirrmann
- first_name: Astrid S.
full_name: Pfister, Astrid S.
last_name: Pfister
- first_name: Jennifer A.
full_name: Philips, Jennifer A.
last_name: Philips
- first_name: Huifeng
full_name: Pi, Huifeng
last_name: Pi
- first_name: Anna
full_name: Picca, Anna
last_name: Picca
- first_name: Alicia M.
full_name: Pickrell, Alicia M.
last_name: Pickrell
- first_name: Sandy
full_name: Picot, Sandy
last_name: Picot
- first_name: Giovanna M.
full_name: Pierantoni, Giovanna M.
last_name: Pierantoni
- first_name: Marina
full_name: Pierdominici, Marina
last_name: Pierdominici
- first_name: Philippe
full_name: Pierre, Philippe
last_name: Pierre
- first_name: Valérie
full_name: Pierrefite-Carle, Valérie
last_name: Pierrefite-Carle
- first_name: Karolina
full_name: Pierzynowska, Karolina
last_name: Pierzynowska
- first_name: Federico
full_name: Pietrocola, Federico
last_name: Pietrocola
- first_name: Miroslawa
full_name: Pietruczuk, Miroslawa
last_name: Pietruczuk
- first_name: Claudio
full_name: Pignata, Claudio
last_name: Pignata
- first_name: Felipe X.
full_name: Pimentel-Muiños, Felipe X.
last_name: Pimentel-Muiños
- first_name: Mario
full_name: Pinar, Mario
last_name: Pinar
- first_name: Roberta O.
full_name: Pinheiro, Roberta O.
last_name: Pinheiro
- first_name: Ronit
full_name: Pinkas-Kramarski, Ronit
last_name: Pinkas-Kramarski
- first_name: Paolo
full_name: Pinton, Paolo
last_name: Pinton
- first_name: Karolina
full_name: Pircs, Karolina
last_name: Pircs
- first_name: Sujan
full_name: Piya, Sujan
last_name: Piya
- first_name: Paola
full_name: Pizzo, Paola
last_name: Pizzo
- first_name: Theo S.
full_name: Plantinga, Theo S.
last_name: Plantinga
- first_name: Harald W.
full_name: Platta, Harald W.
last_name: Platta
- first_name: Ainhoa
full_name: Plaza-Zabala, Ainhoa
last_name: Plaza-Zabala
- first_name: Markus
full_name: Plomann, Markus
last_name: Plomann
- first_name: Egor Y.
full_name: Plotnikov, Egor Y.
last_name: Plotnikov
- first_name: Helene
full_name: Plun-Favreau, Helene
last_name: Plun-Favreau
- first_name: Ryszard
full_name: Pluta, Ryszard
last_name: Pluta
- first_name: Roger
full_name: Pocock, Roger
last_name: Pocock
- first_name: Stefanie
full_name: Pöggeler, Stefanie
last_name: Pöggeler
- first_name: Christian
full_name: Pohl, Christian
last_name: Pohl
- first_name: Marc
full_name: Poirot, Marc
last_name: Poirot
- first_name: Angelo
full_name: Poletti, Angelo
last_name: Poletti
- first_name: Marisa
full_name: Ponpuak, Marisa
last_name: Ponpuak
- first_name: Hana
full_name: Popelka, Hana
last_name: Popelka
- first_name: Blagovesta
full_name: Popova, Blagovesta
last_name: Popova
- first_name: Helena
full_name: Porta, Helena
last_name: Porta
- first_name: Soledad
full_name: Porte Alcon, Soledad
last_name: Porte Alcon
- first_name: Eliana
full_name: Portilla-Fernandez, Eliana
last_name: Portilla-Fernandez
- first_name: Martin
full_name: Post, Martin
last_name: Post
- first_name: Malia B.
full_name: Potts, Malia B.
last_name: Potts
- first_name: Joanna
full_name: Poulton, Joanna
last_name: Poulton
- first_name: Ted
full_name: Powers, Ted
last_name: Powers
- first_name: Veena
full_name: Prahlad, Veena
last_name: Prahlad
- first_name: Tomasz K.
full_name: Prajsnar, Tomasz K.
last_name: Prajsnar
- first_name: Domenico
full_name: Praticò, Domenico
last_name: Praticò
- first_name: Rosaria
full_name: Prencipe, Rosaria
last_name: Prencipe
- first_name: Muriel
full_name: Priault, Muriel
last_name: Priault
- first_name: Tassula
full_name: Proikas-Cezanne, Tassula
last_name: Proikas-Cezanne
- first_name: Vasilis J.
full_name: Promponas, Vasilis J.
last_name: Promponas
- first_name: Christopher G.
full_name: Proud, Christopher G.
last_name: Proud
- first_name: Rosa
full_name: Puertollano, Rosa
last_name: Puertollano
- first_name: Luigi
full_name: Puglielli, Luigi
last_name: Puglielli
- first_name: Thomas
full_name: Pulinilkunnil, Thomas
last_name: Pulinilkunnil
- first_name: Deepika
full_name: Puri, Deepika
last_name: Puri
- first_name: Rajat
full_name: Puri, Rajat
last_name: Puri
- first_name: Julien
full_name: Puyal, Julien
last_name: Puyal
- first_name: Xiaopeng
full_name: Qi, Xiaopeng
last_name: Qi
- first_name: Yongmei
full_name: Qi, Yongmei
last_name: Qi
- first_name: Wenbin
full_name: Qian, Wenbin
last_name: Qian
- first_name: Lei
full_name: Qiang, Lei
last_name: Qiang
- first_name: Yu
full_name: Qiu, Yu
last_name: Qiu
- first_name: Joe
full_name: Quadrilatero, Joe
last_name: Quadrilatero
- first_name: Jorge
full_name: Quarleri, Jorge
last_name: Quarleri
- first_name: Nina
full_name: Raben, Nina
last_name: Raben
- first_name: Hannah
full_name: Rabinowich, Hannah
last_name: Rabinowich
- first_name: Debora
full_name: Ragona, Debora
last_name: Ragona
- first_name: Michael J.
full_name: Ragusa, Michael J.
last_name: Ragusa
- first_name: Nader
full_name: Rahimi, Nader
last_name: Rahimi
- first_name: Marveh
full_name: Rahmati, Marveh
last_name: Rahmati
- first_name: Valeria
full_name: Raia, Valeria
last_name: Raia
- first_name: Nuno
full_name: Raimundo, Nuno
last_name: Raimundo
- first_name: Namakkal Soorappan
full_name: Rajasekaran, Namakkal Soorappan
last_name: Rajasekaran
- first_name: Sriganesh
full_name: Ramachandra Rao, Sriganesh
last_name: Ramachandra Rao
- first_name: Abdelhaq
full_name: Rami, Abdelhaq
last_name: Rami
- first_name: Ignacio
full_name: Ramírez-Pardo, Ignacio
last_name: Ramírez-Pardo
- first_name: David B.
full_name: Ramsden, David B.
last_name: Ramsden
- first_name: Felix
full_name: Randow, Felix
last_name: Randow
- first_name: Pundi N.
full_name: Rangarajan, Pundi N.
last_name: Rangarajan
- first_name: Danilo
full_name: Ranieri, Danilo
last_name: Ranieri
- first_name: Hai
full_name: Rao, Hai
last_name: Rao
- first_name: Lang
full_name: Rao, Lang
last_name: Rao
- first_name: Rekha
full_name: Rao, Rekha
last_name: Rao
- first_name: Sumit
full_name: Rathore, Sumit
last_name: Rathore
- first_name: J. Arjuna
full_name: Ratnayaka, J. Arjuna
last_name: Ratnayaka
- first_name: Edward A.
full_name: Ratovitski, Edward A.
last_name: Ratovitski
- first_name: Palaniyandi
full_name: Ravanan, Palaniyandi
last_name: Ravanan
- first_name: Gloria
full_name: Ravegnini, Gloria
last_name: Ravegnini
- first_name: Swapan K.
full_name: Ray, Swapan K.
last_name: Ray
- first_name: Babak
full_name: Razani, Babak
last_name: Razani
- first_name: Vito
full_name: Rebecca, Vito
last_name: Rebecca
- first_name: Fulvio
full_name: Reggiori, Fulvio
last_name: Reggiori
- first_name: Anne
full_name: Régnier-Vigouroux, Anne
last_name: Régnier-Vigouroux
- first_name: Andreas S.
full_name: Reichert, Andreas S.
last_name: Reichert
- first_name: David
full_name: Reigada, David
last_name: Reigada
- first_name: Jan H.
full_name: Reiling, Jan H.
last_name: Reiling
- first_name: Theo
full_name: Rein, Theo
last_name: Rein
- first_name: Siegfried
full_name: Reipert, Siegfried
last_name: Reipert
- first_name: Rokeya Sultana
full_name: Rekha, Rokeya Sultana
last_name: Rekha
- first_name: Hongmei
full_name: Ren, Hongmei
last_name: Ren
- first_name: Jun
full_name: Ren, Jun
last_name: Ren
- first_name: Weichao
full_name: Ren, Weichao
last_name: Ren
- first_name: Tristan
full_name: Renault, Tristan
last_name: Renault
- first_name: Giorgia
full_name: Renga, Giorgia
last_name: Renga
- first_name: Karen
full_name: Reue, Karen
last_name: Reue
- first_name: Kim
full_name: Rewitz, Kim
last_name: Rewitz
- first_name: Bruna
full_name: Ribeiro De Andrade Ramos, Bruna
last_name: Ribeiro De Andrade Ramos
- first_name: S. Amer
full_name: Riazuddin, S. Amer
last_name: Riazuddin
- first_name: Teresa M.
full_name: Ribeiro-Rodrigues, Teresa M.
last_name: Ribeiro-Rodrigues
- first_name: Jean Ehrland
full_name: Ricci, Jean Ehrland
last_name: Ricci
- first_name: Romeo
full_name: Ricci, Romeo
last_name: Ricci
- first_name: Victoria
full_name: Riccio, Victoria
last_name: Riccio
- first_name: Des R.
full_name: Richardson, Des R.
last_name: Richardson
- first_name: Yasuko
full_name: Rikihisa, Yasuko
last_name: Rikihisa
- first_name: Makarand V.
full_name: Risbud, Makarand V.
last_name: Risbud
- first_name: Ruth M.
full_name: Risueño, Ruth M.
last_name: Risueño
- first_name: Konstantinos
full_name: Ritis, Konstantinos
last_name: Ritis
- first_name: Salvatore
full_name: Rizza, Salvatore
last_name: Rizza
- first_name: Rosario
full_name: Rizzuto, Rosario
last_name: Rizzuto
- first_name: Helen C.
full_name: Roberts, Helen C.
last_name: Roberts
- first_name: Luke D.
full_name: Roberts, Luke D.
last_name: Roberts
- first_name: Katherine J.
full_name: Robinson, Katherine J.
last_name: Robinson
- first_name: Maria Carmela
full_name: Roccheri, Maria Carmela
last_name: Roccheri
- first_name: Stephane
full_name: Rocchi, Stephane
last_name: Rocchi
- first_name: George G.
full_name: Rodney, George G.
last_name: Rodney
- first_name: Tiago
full_name: Rodrigues, Tiago
last_name: Rodrigues
- first_name: Vagner Ramon
full_name: Rodrigues Silva, Vagner Ramon
last_name: Rodrigues Silva
- first_name: Amaia
full_name: Rodriguez, Amaia
last_name: Rodriguez
- first_name: Ruth
full_name: Rodriguez-Barrueco, Ruth
last_name: Rodriguez-Barrueco
- first_name: Nieves
full_name: Rodriguez-Henche, Nieves
last_name: Rodriguez-Henche
- first_name: Humberto
full_name: Rodriguez-Rocha, Humberto
last_name: Rodriguez-Rocha
- first_name: Jeroen
full_name: Roelofs, Jeroen
last_name: Roelofs
- first_name: Robert S.
full_name: Rogers, Robert S.
last_name: Rogers
- first_name: Vladimir V.
full_name: Rogov, Vladimir V.
last_name: Rogov
- first_name: Ana I.
full_name: Rojo, Ana I.
last_name: Rojo
- first_name: Krzysztof
full_name: Rolka, Krzysztof
last_name: Rolka
- first_name: Vanina
full_name: Romanello, Vanina
last_name: Romanello
- first_name: Luigina
full_name: Romani, Luigina
last_name: Romani
- first_name: Alessandra
full_name: Romano, Alessandra
last_name: Romano
- first_name: Patricia S.
full_name: Romano, Patricia S.
last_name: Romano
- first_name: David
full_name: Romeo-Guitart, David
last_name: Romeo-Guitart
- first_name: Luis C.
full_name: Romero, Luis C.
last_name: Romero
- first_name: Montserrat
full_name: Romero, Montserrat
last_name: Romero
- first_name: Joseph C.
full_name: Roney, Joseph C.
last_name: Roney
- first_name: Christopher
full_name: Rongo, Christopher
last_name: Rongo
- first_name: Sante
full_name: Roperto, Sante
last_name: Roperto
- first_name: Mathias T.
full_name: Rosenfeldt, Mathias T.
last_name: Rosenfeldt
- first_name: Philip
full_name: Rosenstiel, Philip
last_name: Rosenstiel
- first_name: Anne G.
full_name: Rosenwald, Anne G.
last_name: Rosenwald
- first_name: Kevin A.
full_name: Roth, Kevin A.
last_name: Roth
- first_name: Lynn
full_name: Roth, Lynn
last_name: Roth
- first_name: Steven
full_name: Roth, Steven
last_name: Roth
- first_name: Kasper M.A.
full_name: Rouschop, Kasper M.A.
last_name: Rouschop
- first_name: Benoit D.
full_name: Roussel, Benoit D.
last_name: Roussel
- first_name: Sophie
full_name: Roux, Sophie
last_name: Roux
- first_name: Patrizia
full_name: Rovere-Querini, Patrizia
last_name: Rovere-Querini
- first_name: Ajit
full_name: Roy, Ajit
last_name: Roy
- first_name: Aurore
full_name: Rozieres, Aurore
last_name: Rozieres
- first_name: Diego
full_name: Ruano, Diego
last_name: Ruano
- first_name: David C.
full_name: Rubinsztein, David C.
last_name: Rubinsztein
- first_name: Maria P.
full_name: Rubtsova, Maria P.
last_name: Rubtsova
- first_name: Klaus
full_name: Ruckdeschel, Klaus
last_name: Ruckdeschel
- first_name: Christoph
full_name: Ruckenstuhl, Christoph
last_name: Ruckenstuhl
- first_name: Emil
full_name: Rudolf, Emil
last_name: Rudolf
- first_name: Rüdiger
full_name: Rudolf, Rüdiger
last_name: Rudolf
- first_name: Alessandra
full_name: Ruggieri, Alessandra
last_name: Ruggieri
- first_name: Avnika Ashok
full_name: Ruparelia, Avnika Ashok
last_name: Ruparelia
- first_name: Paola
full_name: Rusmini, Paola
last_name: Rusmini
- first_name: Ryan R.
full_name: Russell, Ryan R.
last_name: Russell
- first_name: Gian Luigi
full_name: Russo, Gian Luigi
last_name: Russo
- first_name: Maria
full_name: Russo, Maria
last_name: Russo
- first_name: Rossella
full_name: Russo, Rossella
last_name: Russo
- first_name: Oxana O.
full_name: Ryabaya, Oxana O.
last_name: Ryabaya
- first_name: Kevin M.
full_name: Ryan, Kevin M.
last_name: Ryan
- first_name: Kwon Yul
full_name: Ryu, Kwon Yul
last_name: Ryu
- first_name: Maria
full_name: Sabater-Arcis, Maria
last_name: Sabater-Arcis
- first_name: Ulka
full_name: Sachdev, Ulka
last_name: Sachdev
- first_name: Michael
full_name: Sacher, Michael
last_name: Sacher
- first_name: Carsten
full_name: Sachse, Carsten
last_name: Sachse
- first_name: Abhishek
full_name: Sadhu, Abhishek
last_name: Sadhu
- first_name: Junichi
full_name: Sadoshima, Junichi
last_name: Sadoshima
- first_name: Nathaniel
full_name: Safren, Nathaniel
last_name: Safren
- first_name: Paul
full_name: Saftig, Paul
last_name: Saftig
- first_name: Antonia P.
full_name: Sagona, Antonia P.
last_name: Sagona
- first_name: Gaurav
full_name: Sahay, Gaurav
last_name: Sahay
- first_name: Amirhossein
full_name: Sahebkar, Amirhossein
last_name: Sahebkar
- first_name: Mustafa
full_name: Sahin, Mustafa
last_name: Sahin
- first_name: Ozgur
full_name: Sahin, Ozgur
last_name: Sahin
- first_name: Sumit
full_name: Sahni, Sumit
last_name: Sahni
- first_name: Nayuta
full_name: Saito, Nayuta
last_name: Saito
- first_name: Shigeru
full_name: Saito, Shigeru
last_name: Saito
- first_name: Tsunenori
full_name: Saito, Tsunenori
last_name: Saito
- first_name: Ryohei
full_name: Sakai, Ryohei
last_name: Sakai
- first_name: Yasuyoshi
full_name: Sakai, Yasuyoshi
last_name: Sakai
- first_name: Jun Ichi
full_name: Sakamaki, Jun Ichi
last_name: Sakamaki
- first_name: Kalle
full_name: Saksela, Kalle
last_name: Saksela
- first_name: Gloria
full_name: Salazar, Gloria
last_name: Salazar
- first_name: Anna
full_name: Salazar-Degracia, Anna
last_name: Salazar-Degracia
- first_name: Ghasem H.
full_name: Salekdeh, Ghasem H.
last_name: Salekdeh
- first_name: Ashok K.
full_name: Saluja, Ashok K.
last_name: Saluja
- first_name: Belém
full_name: Sampaio-Marques, Belém
last_name: Sampaio-Marques
- first_name: Maria Cecilia
full_name: Sanchez, Maria Cecilia
last_name: Sanchez
- first_name: Jose A.
full_name: Sanchez-Alcazar, Jose A.
last_name: Sanchez-Alcazar
- first_name: Victoria
full_name: Sanchez-Vera, Victoria
last_name: Sanchez-Vera
- first_name: Vanessa
full_name: Sancho-Shimizu, Vanessa
last_name: Sancho-Shimizu
- first_name: J. Thomas
full_name: Sanderson, J. Thomas
last_name: Sanderson
- first_name: Marco
full_name: Sandri, Marco
last_name: Sandri
- first_name: Stefano
full_name: Santaguida, Stefano
last_name: Santaguida
- first_name: Laura
full_name: Santambrogio, Laura
last_name: Santambrogio
- first_name: Magda M.
full_name: Santana, Magda M.
last_name: Santana
- first_name: Giorgio
full_name: Santoni, Giorgio
last_name: Santoni
- first_name: Alberto
full_name: Sanz, Alberto
last_name: Sanz
- first_name: Pascual
full_name: Sanz, Pascual
last_name: Sanz
- first_name: Shweta
full_name: Saran, Shweta
last_name: Saran
- first_name: Marco
full_name: Sardiello, Marco
last_name: Sardiello
- first_name: Timothy J.
full_name: Sargeant, Timothy J.
last_name: Sargeant
- first_name: Apurva
full_name: Sarin, Apurva
last_name: Sarin
- first_name: Chinmoy
full_name: Sarkar, Chinmoy
last_name: Sarkar
- first_name: Sovan
full_name: Sarkar, Sovan
last_name: Sarkar
- first_name: Maria Rosa
full_name: Sarrias, Maria Rosa
last_name: Sarrias
- first_name: Surajit
full_name: Sarkar, Surajit
last_name: Sarkar
- first_name: Dipanka Tanu
full_name: Sarmah, Dipanka Tanu
last_name: Sarmah
- first_name: Jaakko
full_name: Sarparanta, Jaakko
last_name: Sarparanta
- first_name: Aishwarya
full_name: Sathyanarayan, Aishwarya
last_name: Sathyanarayan
- first_name: Ranganayaki
full_name: Sathyanarayanan, Ranganayaki
last_name: Sathyanarayanan
- first_name: K. Matthew
full_name: Scaglione, K. Matthew
last_name: Scaglione
- first_name: Francesca
full_name: Scatozza, Francesca
last_name: Scatozza
- first_name: Liliana
full_name: Schaefer, Liliana
last_name: Schaefer
- first_name: Zachary T.
full_name: Schafer, Zachary T.
last_name: Schafer
- first_name: Ulrich E.
full_name: Schaible, Ulrich E.
last_name: Schaible
- first_name: Anthony H.V.
full_name: Schapira, Anthony H.V.
last_name: Schapira
- first_name: Michael
full_name: Scharl, Michael
last_name: Scharl
- first_name: Hermann M.
full_name: Schatzl, Hermann M.
last_name: Schatzl
- first_name: Catherine H.
full_name: Schein, Catherine H.
last_name: Schein
- first_name: Wiep
full_name: Scheper, Wiep
last_name: Scheper
- first_name: David
full_name: Scheuring, David
last_name: Scheuring
- first_name: Maria Vittoria
full_name: Schiaffino, Maria Vittoria
last_name: Schiaffino
- first_name: Monica
full_name: Schiappacassi, Monica
last_name: Schiappacassi
- first_name: Rainer
full_name: Schindl, Rainer
last_name: Schindl
- first_name: Uwe
full_name: Schlattner, Uwe
last_name: Schlattner
- first_name: Oliver
full_name: Schmidt, Oliver
last_name: Schmidt
- first_name: Roland
full_name: Schmitt, Roland
last_name: Schmitt
- first_name: Stephen D.
full_name: Schmidt, Stephen D.
last_name: Schmidt
- first_name: Ingo
full_name: Schmitz, Ingo
last_name: Schmitz
- first_name: Eran
full_name: Schmukler, Eran
last_name: Schmukler
- first_name: Anja
full_name: Schneider, Anja
last_name: Schneider
- first_name: Bianca E.
full_name: Schneider, Bianca E.
last_name: Schneider
- first_name: Romana
full_name: Schober, Romana
last_name: Schober
- first_name: Alejandra C.
full_name: Schoijet, Alejandra C.
last_name: Schoijet
- first_name: Micah B.
full_name: Schott, Micah B.
last_name: Schott
- first_name: Michael
full_name: Schramm, Michael
last_name: Schramm
- first_name: Bernd
full_name: Schröder, Bernd
last_name: Schröder
- first_name: Kai
full_name: Schuh, Kai
last_name: Schuh
- first_name: Christoph
full_name: Schüller, Christoph
last_name: Schüller
- first_name: Ryan J.
full_name: Schulze, Ryan J.
last_name: Schulze
- first_name: Lea
full_name: Schürmanns, Lea
last_name: Schürmanns
- first_name: Jens C.
full_name: Schwamborn, Jens C.
last_name: Schwamborn
- first_name: Melanie
full_name: Schwarten, Melanie
last_name: Schwarten
- first_name: Filippo
full_name: Scialo, Filippo
last_name: Scialo
- first_name: Sebastiano
full_name: Sciarretta, Sebastiano
last_name: Sciarretta
- first_name: Melanie J.
full_name: Scott, Melanie J.
last_name: Scott
- first_name: Kathleen W.
full_name: Scotto, Kathleen W.
last_name: Scotto
- first_name: A. Ivana
full_name: Scovassi, A. Ivana
last_name: Scovassi
- first_name: Andrea
full_name: Scrima, Andrea
last_name: Scrima
- first_name: Aurora
full_name: Scrivo, Aurora
last_name: Scrivo
- first_name: David
full_name: Sebastian, David
last_name: Sebastian
- first_name: Salwa
full_name: Sebti, Salwa
last_name: Sebti
- first_name: Simon
full_name: Sedej, Simon
last_name: Sedej
- first_name: Laura
full_name: Segatori, Laura
last_name: Segatori
- first_name: Nava
full_name: Segev, Nava
last_name: Segev
- first_name: Per O.
full_name: Seglen, Per O.
last_name: Seglen
- first_name: Iban
full_name: Seiliez, Iban
last_name: Seiliez
- first_name: Ekihiro
full_name: Seki, Ekihiro
last_name: Seki
- first_name: Scott B.
full_name: Selleck, Scott B.
last_name: Selleck
- first_name: Frank W.
full_name: Sellke, Frank W.
last_name: Sellke
- first_name: Joshua T.
full_name: Selsby, Joshua T.
last_name: Selsby
- first_name: Michael
full_name: Sendtner, Michael
last_name: Sendtner
- first_name: Serif
full_name: Senturk, Serif
last_name: Senturk
- first_name: Elena
full_name: Seranova, Elena
last_name: Seranova
- first_name: Consolato
full_name: Sergi, Consolato
last_name: Sergi
- first_name: Ruth
full_name: Serra-Moreno, Ruth
last_name: Serra-Moreno
- first_name: Hiromi
full_name: Sesaki, Hiromi
last_name: Sesaki
- first_name: Carmine
full_name: Settembre, Carmine
last_name: Settembre
- first_name: Subba Rao Gangi
full_name: Setty, Subba Rao Gangi
last_name: Setty
- first_name: Gianluca
full_name: Sgarbi, Gianluca
last_name: Sgarbi
- first_name: Ou
full_name: Sha, Ou
last_name: Sha
- first_name: John J.
full_name: Shacka, John J.
last_name: Shacka
- first_name: Javeed A.
full_name: Shah, Javeed A.
last_name: Shah
- first_name: Dantong
full_name: Shang, Dantong
last_name: Shang
- first_name: Changshun
full_name: Shao, Changshun
last_name: Shao
- first_name: Feng
full_name: Shao, Feng
last_name: Shao
- first_name: Soroush
full_name: Sharbati, Soroush
last_name: Sharbati
- first_name: Lisa M.
full_name: Sharkey, Lisa M.
last_name: Sharkey
- first_name: Dipali
full_name: Sharma, Dipali
last_name: Sharma
- first_name: Gaurav
full_name: Sharma, Gaurav
last_name: Sharma
- first_name: Kulbhushan
full_name: Sharma, Kulbhushan
last_name: Sharma
- first_name: Pawan
full_name: Sharma, Pawan
last_name: Sharma
- first_name: Surendra
full_name: Sharma, Surendra
last_name: Sharma
- first_name: Han Ming
full_name: Shen, Han Ming
last_name: Shen
- first_name: Hongtao
full_name: Shen, Hongtao
last_name: Shen
- first_name: Jiangang
full_name: Shen, Jiangang
last_name: Shen
- first_name: Ming
full_name: Shen, Ming
last_name: Shen
- first_name: Weili
full_name: Shen, Weili
last_name: Shen
- first_name: Zheni
full_name: Shen, Zheni
last_name: Shen
- first_name: Rui
full_name: Sheng, Rui
last_name: Sheng
- first_name: Zhi
full_name: Sheng, Zhi
last_name: Sheng
- first_name: Zu Hang
full_name: Sheng, Zu Hang
last_name: Sheng
- first_name: Jianjian
full_name: Shi, Jianjian
last_name: Shi
- first_name: Xiaobing
full_name: Shi, Xiaobing
last_name: Shi
- first_name: Ying Hong
full_name: Shi, Ying Hong
last_name: Shi
- first_name: Kahori
full_name: Shiba-Fukushima, Kahori
last_name: Shiba-Fukushima
- first_name: Jeng Jer
full_name: Shieh, Jeng Jer
last_name: Shieh
- first_name: Yohta
full_name: Shimada, Yohta
last_name: Shimada
- first_name: Shigeomi
full_name: Shimizu, Shigeomi
last_name: Shimizu
- first_name: Makoto
full_name: Shimozawa, Makoto
last_name: Shimozawa
- first_name: Takahiro
full_name: Shintani, Takahiro
last_name: Shintani
- first_name: Christopher J.
full_name: Shoemaker, Christopher J.
last_name: Shoemaker
- first_name: Shahla
full_name: Shojaei, Shahla
last_name: Shojaei
- first_name: Ikuo
full_name: Shoji, Ikuo
last_name: Shoji
- first_name: Bhupendra V.
full_name: Shravage, Bhupendra V.
last_name: Shravage
- first_name: Viji
full_name: Shridhar, Viji
last_name: Shridhar
- first_name: Chih Wen
full_name: Shu, Chih Wen
last_name: Shu
- first_name: Hong Bing
full_name: Shu, Hong Bing
last_name: Shu
- first_name: Ke
full_name: Shui, Ke
last_name: Shui
- first_name: Arvind K.
full_name: Shukla, Arvind K.
last_name: Shukla
- first_name: Timothy E.
full_name: Shutt, Timothy E.
last_name: Shutt
- first_name: Valentina
full_name: Sica, Valentina
last_name: Sica
- first_name: Aleem
full_name: Siddiqui, Aleem
last_name: Siddiqui
- first_name: Amanda
full_name: Sierra, Amanda
last_name: Sierra
- first_name: Virginia
full_name: Sierra-Torre, Virginia
last_name: Sierra-Torre
- first_name: Santiago
full_name: Signorelli, Santiago
last_name: Signorelli
- first_name: Payel
full_name: Sil, Payel
last_name: Sil
- first_name: Bruno J.De Andrade
full_name: Silva, Bruno J.De Andrade
last_name: Silva
- first_name: Johnatas D.
full_name: Silva, Johnatas D.
last_name: Silva
- first_name: Eduardo
full_name: Silva-Pavez, Eduardo
last_name: Silva-Pavez
- first_name: Sandrine
full_name: Silvente-Poirot, Sandrine
last_name: Silvente-Poirot
- first_name: Rachel E.
full_name: Simmonds, Rachel E.
last_name: Simmonds
- first_name: Anna Katharina
full_name: Simon, Anna Katharina
last_name: Simon
- first_name: Hans Uwe
full_name: Simon, Hans Uwe
last_name: Simon
- first_name: Matias
full_name: Simons, Matias
last_name: Simons
- first_name: Anurag
full_name: Singh, Anurag
last_name: Singh
- first_name: Lalit P.
full_name: Singh, Lalit P.
last_name: Singh
- first_name: Rajat
full_name: Singh, Rajat
last_name: Singh
- first_name: Shivendra V.
full_name: Singh, Shivendra V.
last_name: Singh
- first_name: Shrawan K.
full_name: Singh, Shrawan K.
last_name: Singh
- first_name: Sudha B.
full_name: Singh, Sudha B.
last_name: Singh
- first_name: Sunaina
full_name: Singh, Sunaina
last_name: Singh
- first_name: Surinder Pal
full_name: Singh, Surinder Pal
last_name: Singh
- first_name: Debasish
full_name: Sinha, Debasish
last_name: Sinha
- first_name: Rohit Anthony
full_name: Sinha, Rohit Anthony
last_name: Sinha
- first_name: Sangita
full_name: Sinha, Sangita
last_name: Sinha
- first_name: Agnieszka
full_name: Sirko, Agnieszka
last_name: Sirko
- first_name: Kapil
full_name: Sirohi, Kapil
last_name: Sirohi
- first_name: Efthimios L.
full_name: Sivridis, Efthimios L.
last_name: Sivridis
- first_name: Panagiotis
full_name: Skendros, Panagiotis
last_name: Skendros
- first_name: Aleksandra
full_name: Skirycz, Aleksandra
last_name: Skirycz
- first_name: Iva
full_name: Slaninová, Iva
last_name: Slaninová
- first_name: Soraya S.
full_name: Smaili, Soraya S.
last_name: Smaili
- first_name: Andrei
full_name: Smertenko, Andrei
last_name: Smertenko
- first_name: Matthew D.
full_name: Smith, Matthew D.
last_name: Smith
- first_name: Stefaan J.
full_name: Soenen, Stefaan J.
last_name: Soenen
- first_name: Eun Jung
full_name: Sohn, Eun Jung
last_name: Sohn
- first_name: Sophia P.M.
full_name: Sok, Sophia P.M.
last_name: Sok
- first_name: Giancarlo
full_name: Solaini, Giancarlo
last_name: Solaini
- first_name: Thierry
full_name: Soldati, Thierry
last_name: Soldati
- first_name: Scott A.
full_name: Soleimanpour, Scott A.
last_name: Soleimanpour
- first_name: Rosa M.
full_name: Soler, Rosa M.
last_name: Soler
- first_name: Alexei
full_name: Solovchenko, Alexei
last_name: Solovchenko
- first_name: Jason A.
full_name: Somarelli, Jason A.
last_name: Somarelli
- first_name: Avinash
full_name: Sonawane, Avinash
last_name: Sonawane
- first_name: Fuyong
full_name: Song, Fuyong
last_name: Song
- first_name: Hyun Kyu
full_name: Song, Hyun Kyu
last_name: Song
- first_name: Ju Xian
full_name: Song, Ju Xian
last_name: Song
- first_name: Kunhua
full_name: Song, Kunhua
last_name: Song
- first_name: Zhiyin
full_name: Song, Zhiyin
last_name: Song
- first_name: Leandro R.
full_name: Soria, Leandro R.
last_name: Soria
- first_name: Maurizio
full_name: Sorice, Maurizio
last_name: Sorice
- first_name: Alexander A.
full_name: Soukas, Alexander A.
last_name: Soukas
- first_name: Sandra Fausia
full_name: Soukup, Sandra Fausia
last_name: Soukup
- first_name: Diana
full_name: Sousa, Diana
last_name: Sousa
- first_name: Nadia
full_name: Sousa, Nadia
last_name: Sousa
- first_name: Paul A.
full_name: Spagnuolo, Paul A.
last_name: Spagnuolo
- first_name: Stephen A.
full_name: Spector, Stephen A.
last_name: Spector
- first_name: M. M.
full_name: Srinivas Bharath, M. M.
last_name: Srinivas Bharath
- first_name: Daret
full_name: St. Clair, Daret
last_name: St. Clair
- first_name: Venturina
full_name: Stagni, Venturina
last_name: Stagni
- first_name: Leopoldo
full_name: Staiano, Leopoldo
last_name: Staiano
- first_name: Clint A.
full_name: Stalnecker, Clint A.
last_name: Stalnecker
- first_name: Metodi V.
full_name: Stankov, Metodi V.
last_name: Stankov
- first_name: Peter B.
full_name: Stathopulos, Peter B.
last_name: Stathopulos
- first_name: Katja
full_name: Stefan, Katja
last_name: Stefan
- first_name: Sven Marcel
full_name: Stefan, Sven Marcel
last_name: Stefan
- first_name: Leonidas
full_name: Stefanis, Leonidas
last_name: Stefanis
- first_name: Joan S.
full_name: Steffan, Joan S.
last_name: Steffan
- first_name: Alexander
full_name: Steinkasserer, Alexander
last_name: Steinkasserer
- first_name: Harald
full_name: Stenmark, Harald
last_name: Stenmark
- first_name: Jared
full_name: Sterneckert, Jared
last_name: Sterneckert
- first_name: Craig
full_name: Stevens, Craig
last_name: Stevens
- first_name: Veronika
full_name: Stoka, Veronika
last_name: Stoka
- first_name: Stephan
full_name: Storch, Stephan
last_name: Storch
- first_name: Björn
full_name: Stork, Björn
last_name: Stork
- first_name: Flavie
full_name: Strappazzon, Flavie
last_name: Strappazzon
- first_name: Anne Marie
full_name: Strohecker, Anne Marie
last_name: Strohecker
- first_name: Dwayne G.
full_name: Stupack, Dwayne G.
last_name: Stupack
- first_name: Huanxing
full_name: Su, Huanxing
last_name: Su
- first_name: Ling Yan
full_name: Su, Ling Yan
last_name: Su
- first_name: Longxiang
full_name: Su, Longxiang
last_name: Su
- first_name: Ana M.
full_name: Suarez-Fontes, Ana M.
last_name: Suarez-Fontes
- first_name: Carlos S.
full_name: Subauste, Carlos S.
last_name: Subauste
- first_name: Selvakumar
full_name: Subbian, Selvakumar
last_name: Subbian
- first_name: Paula V.
full_name: Subirada, Paula V.
last_name: Subirada
- first_name: Ganapasam
full_name: Sudhandiran, Ganapasam
last_name: Sudhandiran
- first_name: Carolyn M.
full_name: Sue, Carolyn M.
last_name: Sue
- first_name: Xinbing
full_name: Sui, Xinbing
last_name: Sui
- first_name: Corey
full_name: Summers, Corey
last_name: Summers
- first_name: Guangchao
full_name: Sun, Guangchao
last_name: Sun
- first_name: Jun
full_name: Sun, Jun
last_name: Sun
- first_name: Kang
full_name: Sun, Kang
last_name: Sun
- first_name: Meng Xiang
full_name: Sun, Meng Xiang
last_name: Sun
- first_name: Qiming
full_name: Sun, Qiming
last_name: Sun
- first_name: Yi
full_name: Sun, Yi
last_name: Sun
- first_name: Zhongjie
full_name: Sun, Zhongjie
last_name: Sun
- first_name: Karen K.S.
full_name: Sunahara, Karen K.S.
last_name: Sunahara
- first_name: Eva
full_name: Sundberg, Eva
last_name: Sundberg
- first_name: Katalin
full_name: Susztak, Katalin
last_name: Susztak
- first_name: Peter
full_name: Sutovsky, Peter
last_name: Sutovsky
- first_name: Hidekazu
full_name: Suzuki, Hidekazu
last_name: Suzuki
- first_name: Gary
full_name: Sweeney, Gary
last_name: Sweeney
- first_name: J. David
full_name: Symons, J. David
last_name: Symons
- first_name: Stephen Cho Wing
full_name: Sze, Stephen Cho Wing
last_name: Sze
- first_name: Nathaniel J.
full_name: Szewczyk, Nathaniel J.
last_name: Szewczyk
- first_name: Anna
full_name: Tabęcka-Łonczynska, Anna
last_name: Tabęcka-Łonczynska
- first_name: Claudio
full_name: Tabolacci, Claudio
last_name: Tabolacci
- first_name: Frank
full_name: Tacke, Frank
last_name: Tacke
- first_name: Heinrich
full_name: Taegtmeyer, Heinrich
last_name: Taegtmeyer
- first_name: Marco
full_name: Tafani, Marco
last_name: Tafani
- first_name: Mitsuo
full_name: Tagaya, Mitsuo
last_name: Tagaya
- first_name: Haoran
full_name: Tai, Haoran
last_name: Tai
- first_name: Stephen W.G.
full_name: Tait, Stephen W.G.
last_name: Tait
- first_name: Yoshinori
full_name: Takahashi, Yoshinori
last_name: Takahashi
- first_name: Szabolcs
full_name: Takats, Szabolcs
last_name: Takats
- first_name: Priti
full_name: Talwar, Priti
last_name: Talwar
- first_name: Chit
full_name: Tam, Chit
last_name: Tam
- first_name: Shing Yau
full_name: Tam, Shing Yau
last_name: Tam
- first_name: Davide
full_name: Tampellini, Davide
last_name: Tampellini
- first_name: Atsushi
full_name: Tamura, Atsushi
last_name: Tamura
- first_name: Chong Teik
full_name: Tan, Chong Teik
last_name: Tan
- first_name: Eng King
full_name: Tan, Eng King
last_name: Tan
- first_name: Ya Qin
full_name: Tan, Ya Qin
last_name: Tan
- first_name: Masaki
full_name: Tanaka, Masaki
last_name: Tanaka
- first_name: Motomasa
full_name: Tanaka, Motomasa
last_name: Tanaka
- first_name: Daolin
full_name: Tang, Daolin
last_name: Tang
- first_name: Jingfeng
full_name: Tang, Jingfeng
last_name: Tang
- first_name: Tie Shan
full_name: Tang, Tie Shan
last_name: Tang
- first_name: Isei
full_name: Tanida, Isei
last_name: Tanida
- first_name: Zhipeng
full_name: Tao, Zhipeng
last_name: Tao
- first_name: Mohammed
full_name: Taouis, Mohammed
last_name: Taouis
- first_name: Lars
full_name: Tatenhorst, Lars
last_name: Tatenhorst
- first_name: Nektarios
full_name: Tavernarakis, Nektarios
last_name: Tavernarakis
- first_name: Allen
full_name: Taylor, Allen
last_name: Taylor
- first_name: Gregory A.
full_name: Taylor, Gregory A.
last_name: Taylor
- first_name: Joan M.
full_name: Taylor, Joan M.
last_name: Taylor
- first_name: Elena
full_name: Tchetina, Elena
last_name: Tchetina
- first_name: Andrew R.
full_name: Tee, Andrew R.
last_name: Tee
- first_name: Irmgard
full_name: Tegeder, Irmgard
last_name: Tegeder
- first_name: David
full_name: Teis, David
last_name: Teis
- first_name: Natercia
full_name: Teixeira, Natercia
last_name: Teixeira
- first_name: Fatima
full_name: Teixeira-Clerc, Fatima
last_name: Teixeira-Clerc
- first_name: Kumsal A.
full_name: Tekirdag, Kumsal A.
last_name: Tekirdag
- first_name: Tewin
full_name: Tencomnao, Tewin
last_name: Tencomnao
- first_name: Sandra
full_name: Tenreiro, Sandra
last_name: Tenreiro
- first_name: Alexei V.
full_name: Tepikin, Alexei V.
last_name: Tepikin
- first_name: Pilar S.
full_name: Testillano, Pilar S.
last_name: Testillano
- first_name: Gianluca
full_name: Tettamanti, Gianluca
last_name: Tettamanti
- first_name: Pierre Louis
full_name: Tharaux, Pierre Louis
last_name: Tharaux
- first_name: Kathrin
full_name: Thedieck, Kathrin
last_name: Thedieck
- first_name: Arvind A.
full_name: Thekkinghat, Arvind A.
last_name: Thekkinghat
- first_name: Stefano
full_name: Thellung, Stefano
last_name: Thellung
- first_name: Josephine W.
full_name: Thinwa, Josephine W.
last_name: Thinwa
- first_name: V. P.
full_name: Thirumalaikumar, V. P.
last_name: Thirumalaikumar
- first_name: Sufi Mary
full_name: Thomas, Sufi Mary
last_name: Thomas
- first_name: Paul G.
full_name: Thomes, Paul G.
last_name: Thomes
- first_name: Andrew
full_name: Thorburn, Andrew
last_name: Thorburn
- first_name: Lipi
full_name: Thukral, Lipi
last_name: Thukral
- first_name: Thomas
full_name: Thum, Thomas
last_name: Thum
- first_name: Michael
full_name: Thumm, Michael
last_name: Thumm
- first_name: Ling
full_name: Tian, Ling
last_name: Tian
- first_name: Ales
full_name: Tichy, Ales
last_name: Tichy
- first_name: Andreas
full_name: Till, Andreas
last_name: Till
- first_name: Vincent
full_name: Timmerman, Vincent
last_name: Timmerman
- first_name: Vladimir I.
full_name: Titorenko, Vladimir I.
last_name: Titorenko
- first_name: Sokol V.
full_name: Todi, Sokol V.
last_name: Todi
- first_name: Krassimira
full_name: Todorova, Krassimira
last_name: Todorova
- first_name: Janne M.
full_name: Toivonen, Janne M.
last_name: Toivonen
- first_name: Luana
full_name: Tomaipitinca, Luana
last_name: Tomaipitinca
- first_name: Dhanendra
full_name: Tomar, Dhanendra
last_name: Tomar
- first_name: Cristina
full_name: Tomas-Zapico, Cristina
last_name: Tomas-Zapico
- first_name: Sergej
full_name: Tomić, Sergej
last_name: Tomić
- first_name: Benjamin Chun Kit
full_name: Tong, Benjamin Chun Kit
last_name: Tong
- first_name: Chao
full_name: Tong, Chao
last_name: Tong
- first_name: Xin
full_name: Tong, Xin
id: 50F65CDC-AA30-11E9-A72B-8A12E6697425
last_name: Tong
- first_name: Sharon A.
full_name: Tooze, Sharon A.
last_name: Tooze
- first_name: Maria L.
full_name: Torgersen, Maria L.
last_name: Torgersen
- first_name: Satoru
full_name: Torii, Satoru
last_name: Torii
- first_name: Liliana
full_name: Torres-López, Liliana
last_name: Torres-López
- first_name: Alicia
full_name: Torriglia, Alicia
last_name: Torriglia
- first_name: Christina G.
full_name: Towers, Christina G.
last_name: Towers
- first_name: Roberto
full_name: Towns, Roberto
last_name: Towns
- first_name: Shinya
full_name: Toyokuni, Shinya
last_name: Toyokuni
- first_name: Vladimir
full_name: Trajkovic, Vladimir
last_name: Trajkovic
- first_name: Donatella
full_name: Tramontano, Donatella
last_name: Tramontano
- first_name: Quynh Giao
full_name: Tran, Quynh Giao
last_name: Tran
- first_name: Leonardo H.
full_name: Travassos, Leonardo H.
last_name: Travassos
- first_name: Charles B.
full_name: Trelford, Charles B.
last_name: Trelford
- first_name: Shirley
full_name: Tremel, Shirley
last_name: Tremel
- first_name: Ioannis P.
full_name: Trougakos, Ioannis P.
last_name: Trougakos
- first_name: Betty P.
full_name: Tsao, Betty P.
last_name: Tsao
- first_name: Mario P.
full_name: Tschan, Mario P.
last_name: Tschan
- first_name: Hung Fat
full_name: Tse, Hung Fat
last_name: Tse
- first_name: Tak Fu
full_name: Tse, Tak Fu
last_name: Tse
- first_name: Hitoshi
full_name: Tsugawa, Hitoshi
last_name: Tsugawa
- first_name: Andrey S.
full_name: Tsvetkov, Andrey S.
last_name: Tsvetkov
- first_name: David A.
full_name: Tumbarello, David A.
last_name: Tumbarello
- first_name: Yasin
full_name: Tumtas, Yasin
last_name: Tumtas
- first_name: María J.
full_name: Tuñón, María J.
last_name: Tuñón
- first_name: Sandra
full_name: Turcotte, Sandra
last_name: Turcotte
- first_name: Boris
full_name: Turk, Boris
last_name: Turk
- first_name: Vito
full_name: Turk, Vito
last_name: Turk
- first_name: Bradley J.
full_name: Turner, Bradley J.
last_name: Turner
- first_name: Richard I.
full_name: Tuxworth, Richard I.
last_name: Tuxworth
- first_name: Jessica K.
full_name: Tyler, Jessica K.
last_name: Tyler
- first_name: Elena V.
full_name: Tyutereva, Elena V.
last_name: Tyutereva
- first_name: Yasuo
full_name: Uchiyama, Yasuo
last_name: Uchiyama
- first_name: Aslihan
full_name: Ugun-Klusek, Aslihan
last_name: Ugun-Klusek
- first_name: Holm H.
full_name: Uhlig, Holm H.
last_name: Uhlig
- first_name: Marzena
full_name: Ułamek-Kozioł, Marzena
last_name: Ułamek-Kozioł
- first_name: Ilya V.
full_name: Ulasov, Ilya V.
last_name: Ulasov
- first_name: Midori
full_name: Umekawa, Midori
last_name: Umekawa
- first_name: Christian
full_name: Ungermann, Christian
last_name: Ungermann
- first_name: Rei
full_name: Unno, Rei
last_name: Unno
- first_name: Sylvie
full_name: Urbe, Sylvie
last_name: Urbe
- first_name: Elisabet
full_name: Uribe-Carretero, Elisabet
last_name: Uribe-Carretero
- first_name: Suayib
full_name: Üstün, Suayib
last_name: Üstün
- first_name: Vladimir N.
full_name: Uversky, Vladimir N.
last_name: Uversky
- first_name: Thomas
full_name: Vaccari, Thomas
last_name: Vaccari
- first_name: Maria I.
full_name: Vaccaro, Maria I.
last_name: Vaccaro
- first_name: Björn F.
full_name: Vahsen, Björn F.
last_name: Vahsen
- first_name: Helin
full_name: Vakifahmetoglu-Norberg, Helin
last_name: Vakifahmetoglu-Norberg
- first_name: Rut
full_name: Valdor, Rut
last_name: Valdor
- first_name: Maria J.
full_name: Valente, Maria J.
last_name: Valente
- first_name: Ayelén
full_name: Valko, Ayelén
last_name: Valko
- first_name: Richard B.
full_name: Vallee, Richard B.
last_name: Vallee
- first_name: Angela M.
full_name: Valverde, Angela M.
last_name: Valverde
- first_name: Greet
full_name: Van Den Berghe, Greet
last_name: Van Den Berghe
- first_name: Stijn
full_name: Van Der Veen, Stijn
last_name: Van Der Veen
- first_name: Luc
full_name: Van Kaer, Luc
last_name: Van Kaer
- first_name: Jorg
full_name: Van Loosdregt, Jorg
last_name: Van Loosdregt
- first_name: Sjoerd J.L.
full_name: Van Wijk, Sjoerd J.L.
last_name: Van Wijk
- first_name: Wim
full_name: Vandenberghe, Wim
last_name: Vandenberghe
- first_name: Ilse
full_name: Vanhorebeek, Ilse
last_name: Vanhorebeek
- first_name: Marcos A.
full_name: Vannier-Santos, Marcos A.
last_name: Vannier-Santos
- first_name: Nicola
full_name: Vannini, Nicola
last_name: Vannini
- first_name: M. Cristina
full_name: Vanrell, M. Cristina
last_name: Vanrell
- first_name: Chiara
full_name: Vantaggiato, Chiara
last_name: Vantaggiato
- first_name: Gabriele
full_name: Varano, Gabriele
last_name: Varano
- first_name: Isabel
full_name: Varela-Nieto, Isabel
last_name: Varela-Nieto
- first_name: Máté
full_name: Varga, Máté
last_name: Varga
- first_name: M. Helena
full_name: Vasconcelos, M. Helena
last_name: Vasconcelos
- first_name: Somya
full_name: Vats, Somya
last_name: Vats
- first_name: Demetrios G.
full_name: Vavvas, Demetrios G.
last_name: Vavvas
- first_name: Ignacio
full_name: Vega-Naredo, Ignacio
last_name: Vega-Naredo
- first_name: Silvia
full_name: Vega-Rubin-De-Celis, Silvia
last_name: Vega-Rubin-De-Celis
- first_name: Guillermo
full_name: Velasco, Guillermo
last_name: Velasco
- first_name: Ariadna P.
full_name: Velázquez, Ariadna P.
last_name: Velázquez
- first_name: Tibor
full_name: Vellai, Tibor
last_name: Vellai
- first_name: Edo
full_name: Vellenga, Edo
last_name: Vellenga
- first_name: Francesca
full_name: Velotti, Francesca
last_name: Velotti
- first_name: Mireille
full_name: Verdier, Mireille
last_name: Verdier
- first_name: Panayotis
full_name: Verginis, Panayotis
last_name: Verginis
- first_name: Isabelle
full_name: Vergne, Isabelle
last_name: Vergne
- first_name: Paul
full_name: Verkade, Paul
last_name: Verkade
- first_name: Manish
full_name: Verma, Manish
last_name: Verma
- first_name: Patrik
full_name: Verstreken, Patrik
last_name: Verstreken
- first_name: Tim
full_name: Vervliet, Tim
last_name: Vervliet
- first_name: Jörg
full_name: Vervoorts, Jörg
last_name: Vervoorts
- first_name: Alexandre T.
full_name: Vessoni, Alexandre T.
last_name: Vessoni
- first_name: Victor M.
full_name: Victor, Victor M.
last_name: Victor
- first_name: Michel
full_name: Vidal, Michel
last_name: Vidal
- first_name: Chiara
full_name: Vidoni, Chiara
last_name: Vidoni
- first_name: Otilia V.
full_name: Vieira, Otilia V.
last_name: Vieira
- first_name: Richard D.
full_name: Vierstra, Richard D.
last_name: Vierstra
- first_name: Sonia
full_name: Viganó, Sonia
last_name: Viganó
- first_name: Helena
full_name: Vihinen, Helena
last_name: Vihinen
- first_name: Vinoy
full_name: Vijayan, Vinoy
last_name: Vijayan
- first_name: Miquel
full_name: Vila, Miquel
last_name: Vila
- first_name: Marçal
full_name: Vilar, Marçal
last_name: Vilar
- first_name: José M.
full_name: Villalba, José M.
last_name: Villalba
- first_name: Antonio
full_name: Villalobo, Antonio
last_name: Villalobo
- first_name: Beatriz
full_name: Villarejo-Zori, Beatriz
last_name: Villarejo-Zori
- first_name: Francesc
full_name: Villarroya, Francesc
last_name: Villarroya
- first_name: Joan
full_name: Villarroya, Joan
last_name: Villarroya
- first_name: Olivier
full_name: Vincent, Olivier
last_name: Vincent
- first_name: Cecile
full_name: Vindis, Cecile
last_name: Vindis
- first_name: Christophe
full_name: Viret, Christophe
last_name: Viret
- first_name: Maria Teresa
full_name: Viscomi, Maria Teresa
last_name: Viscomi
- first_name: Dora
full_name: Visnjic, Dora
last_name: Visnjic
- first_name: Ilio
full_name: Vitale, Ilio
last_name: Vitale
- first_name: David J.
full_name: Vocadlo, David J.
last_name: Vocadlo
- first_name: Olga V.
full_name: Voitsekhovskaja, Olga V.
last_name: Voitsekhovskaja
- first_name: Cinzia
full_name: Volonté, Cinzia
last_name: Volonté
- first_name: Mattia
full_name: Volta, Mattia
last_name: Volta
- first_name: Marta
full_name: Vomero, Marta
last_name: Vomero
- first_name: Clarissa
full_name: Von Haefen, Clarissa
last_name: Von Haefen
- first_name: Marc A.
full_name: Vooijs, Marc A.
last_name: Vooijs
- first_name: Wolfgang
full_name: Voos, Wolfgang
last_name: Voos
- first_name: Ljubica
full_name: Vucicevic, Ljubica
last_name: Vucicevic
- first_name: Richard
full_name: Wade-Martins, Richard
last_name: Wade-Martins
- first_name: Satoshi
full_name: Waguri, Satoshi
last_name: Waguri
- first_name: Kenrick A.
full_name: Waite, Kenrick A.
last_name: Waite
- first_name: Shuji
full_name: Wakatsuki, Shuji
last_name: Wakatsuki
- first_name: David W.
full_name: Walker, David W.
last_name: Walker
- first_name: Mark J.
full_name: Walker, Mark J.
last_name: Walker
- first_name: Simon A.
full_name: Walker, Simon A.
last_name: Walker
- first_name: Jochen
full_name: Walter, Jochen
last_name: Walter
- first_name: Francisco G.
full_name: Wandosell, Francisco G.
last_name: Wandosell
- first_name: Bo
full_name: Wang, Bo
last_name: Wang
- first_name: Chao Yung
full_name: Wang, Chao Yung
last_name: Wang
- first_name: Chen
full_name: Wang, Chen
last_name: Wang
- first_name: Chenran
full_name: Wang, Chenran
last_name: Wang
- first_name: Chenwei
full_name: Wang, Chenwei
last_name: Wang
- first_name: Cun Yu
full_name: Wang, Cun Yu
last_name: Wang
- first_name: Dong
full_name: Wang, Dong
last_name: Wang
- first_name: Fangyang
full_name: Wang, Fangyang
last_name: Wang
- first_name: Feng
full_name: Wang, Feng
last_name: Wang
- first_name: Fengming
full_name: Wang, Fengming
last_name: Wang
- first_name: Guansong
full_name: Wang, Guansong
last_name: Wang
- first_name: Han
full_name: Wang, Han
last_name: Wang
- first_name: Hao
full_name: Wang, Hao
last_name: Wang
- first_name: Hexiang
full_name: Wang, Hexiang
last_name: Wang
- first_name: Hong Gang
full_name: Wang, Hong Gang
last_name: Wang
- first_name: Jianrong
full_name: Wang, Jianrong
last_name: Wang
- first_name: Jigang
full_name: Wang, Jigang
last_name: Wang
- first_name: Jiou
full_name: Wang, Jiou
last_name: Wang
- first_name: Jundong
full_name: Wang, Jundong
last_name: Wang
- first_name: Kui
full_name: Wang, Kui
last_name: Wang
- first_name: Lianrong
full_name: Wang, Lianrong
last_name: Wang
- first_name: Liming
full_name: Wang, Liming
last_name: Wang
- first_name: Maggie Haitian
full_name: Wang, Maggie Haitian
last_name: Wang
- first_name: Meiqing
full_name: Wang, Meiqing
last_name: Wang
- first_name: Nanbu
full_name: Wang, Nanbu
last_name: Wang
- first_name: Pengwei
full_name: Wang, Pengwei
last_name: Wang
- first_name: Peipei
full_name: Wang, Peipei
last_name: Wang
- first_name: Ping
full_name: Wang, Ping
last_name: Wang
- first_name: Ping
full_name: Wang, Ping
last_name: Wang
- first_name: Qing Jun
full_name: Wang, Qing Jun
last_name: Wang
- first_name: Qing
full_name: Wang, Qing
last_name: Wang
- first_name: Qing Kenneth
full_name: Wang, Qing Kenneth
last_name: Wang
- first_name: Qiong A.
full_name: Wang, Qiong A.
last_name: Wang
- first_name: Wen Tao
full_name: Wang, Wen Tao
last_name: Wang
- first_name: Wuyang
full_name: Wang, Wuyang
last_name: Wang
- first_name: Xinnan
full_name: Wang, Xinnan
last_name: Wang
- first_name: Xuejun
full_name: Wang, Xuejun
last_name: Wang
- first_name: Yan
full_name: Wang, Yan
last_name: Wang
- first_name: Yanchang
full_name: Wang, Yanchang
last_name: Wang
- first_name: Yanzhuang
full_name: Wang, Yanzhuang
last_name: Wang
- first_name: Yen Yun
full_name: Wang, Yen Yun
last_name: Wang
- first_name: Yihua
full_name: Wang, Yihua
last_name: Wang
- first_name: Yipeng
full_name: Wang, Yipeng
last_name: Wang
- first_name: Yu
full_name: Wang, Yu
last_name: Wang
- first_name: Yuqi
full_name: Wang, Yuqi
last_name: Wang
- first_name: Zhe
full_name: Wang, Zhe
last_name: Wang
- first_name: Zhenyu
full_name: Wang, Zhenyu
last_name: Wang
- first_name: Zhouguang
full_name: Wang, Zhouguang
last_name: Wang
- first_name: Gary
full_name: Warnes, Gary
last_name: Warnes
- first_name: Verena
full_name: Warnsmann, Verena
last_name: Warnsmann
- first_name: Hirotaka
full_name: Watada, Hirotaka
last_name: Watada
- first_name: Eizo
full_name: Watanabe, Eizo
last_name: Watanabe
- first_name: Maxinne
full_name: Watchon, Maxinne
last_name: Watchon
- first_name: Anna
full_name: Wawrzyńska, Anna
last_name: Wawrzyńska
- first_name: Timothy E.
full_name: Weaver, Timothy E.
last_name: Weaver
- first_name: Grzegorz
full_name: Wegrzyn, Grzegorz
last_name: Wegrzyn
- first_name: Ann M.
full_name: Wehman, Ann M.
last_name: Wehman
- first_name: Huafeng
full_name: Wei, Huafeng
last_name: Wei
- first_name: Lei
full_name: Wei, Lei
last_name: Wei
- first_name: Taotao
full_name: Wei, Taotao
last_name: Wei
- first_name: Yongjie
full_name: Wei, Yongjie
last_name: Wei
- first_name: Oliver H.
full_name: Weiergräber, Oliver H.
last_name: Weiergräber
- first_name: Conrad C.
full_name: Weihl, Conrad C.
last_name: Weihl
- first_name: Günther
full_name: Weindl, Günther
last_name: Weindl
- first_name: Ralf
full_name: Weiskirchen, Ralf
last_name: Weiskirchen
- first_name: Alan
full_name: Wells, Alan
last_name: Wells
- first_name: Runxia H.
full_name: Wen, Runxia H.
last_name: Wen
- first_name: Xin
full_name: Wen, Xin
last_name: Wen
- first_name: Antonia
full_name: Werner, Antonia
last_name: Werner
- first_name: Beatrice
full_name: Weykopf, Beatrice
last_name: Weykopf
- first_name: Sally P.
full_name: Wheatley, Sally P.
last_name: Wheatley
- first_name: J. Lindsay
full_name: Whitton, J. Lindsay
last_name: Whitton
- first_name: Alexander J.
full_name: Whitworth, Alexander J.
last_name: Whitworth
- first_name: Katarzyna
full_name: Wiktorska, Katarzyna
last_name: Wiktorska
- first_name: Manon E.
full_name: Wildenberg, Manon E.
last_name: Wildenberg
- first_name: Tom
full_name: Wileman, Tom
last_name: Wileman
- first_name: Simon
full_name: Wilkinson, Simon
last_name: Wilkinson
- first_name: Dieter
full_name: Willbold, Dieter
last_name: Willbold
- first_name: Brett
full_name: Williams, Brett
last_name: Williams
- first_name: Robin S.B.
full_name: Williams, Robin S.B.
last_name: Williams
- first_name: Roger L.
full_name: Williams, Roger L.
last_name: Williams
- first_name: Peter R.
full_name: Williamson, Peter R.
last_name: Williamson
- first_name: Richard A.
full_name: Wilson, Richard A.
last_name: Wilson
- first_name: Beate
full_name: Winner, Beate
last_name: Winner
- first_name: Nathaniel J.
full_name: Winsor, Nathaniel J.
last_name: Winsor
- first_name: Steven S.
full_name: Witkin, Steven S.
last_name: Witkin
- first_name: Harald
full_name: Wodrich, Harald
last_name: Wodrich
- first_name: Ute
full_name: Woehlbier, Ute
last_name: Woehlbier
- first_name: Thomas
full_name: Wollert, Thomas
last_name: Wollert
- first_name: Esther
full_name: Wong, Esther
last_name: Wong
- first_name: Jack Ho
full_name: Wong, Jack Ho
last_name: Wong
- first_name: Richard W.
full_name: Wong, Richard W.
last_name: Wong
- first_name: Vincent Kam Wai
full_name: Wong, Vincent Kam Wai
last_name: Wong
- first_name: W. Wei Lynn
full_name: Wong, W. Wei Lynn
last_name: Wong
- first_name: An Guo
full_name: Wu, An Guo
last_name: Wu
- first_name: Chengbiao
full_name: Wu, Chengbiao
last_name: Wu
- first_name: Jian
full_name: Wu, Jian
last_name: Wu
- first_name: Junfang
full_name: Wu, Junfang
last_name: Wu
- first_name: Kenneth K.
full_name: Wu, Kenneth K.
last_name: Wu
- first_name: Min
full_name: Wu, Min
last_name: Wu
- first_name: Shan Ying
full_name: Wu, Shan Ying
last_name: Wu
- first_name: Shengzhou
full_name: Wu, Shengzhou
last_name: Wu
- first_name: Shu Yan
full_name: Wu, Shu Yan
last_name: Wu
- first_name: Shufang
full_name: Wu, Shufang
last_name: Wu
- first_name: William K.K.
full_name: Wu, William K.K.
last_name: Wu
- first_name: Xiaohong
full_name: Wu, Xiaohong
last_name: Wu
- first_name: Xiaoqing
full_name: Wu, Xiaoqing
last_name: Wu
- first_name: Yao Wen
full_name: Wu, Yao Wen
last_name: Wu
- first_name: Yihua
full_name: Wu, Yihua
last_name: Wu
- first_name: Ramnik J.
full_name: Xavier, Ramnik J.
last_name: Xavier
- first_name: Hongguang
full_name: Xia, Hongguang
last_name: Xia
- first_name: Lixin
full_name: Xia, Lixin
last_name: Xia
- first_name: Zhengyuan
full_name: Xia, Zhengyuan
last_name: Xia
- first_name: Ge
full_name: Xiang, Ge
last_name: Xiang
- first_name: Jin
full_name: Xiang, Jin
last_name: Xiang
- first_name: Mingliang
full_name: Xiang, Mingliang
last_name: Xiang
- first_name: Wei
full_name: Xiang, Wei
last_name: Xiang
- first_name: Bin
full_name: Xiao, Bin
last_name: Xiao
- first_name: Guozhi
full_name: Xiao, Guozhi
last_name: Xiao
- first_name: Hengyi
full_name: Xiao, Hengyi
last_name: Xiao
- first_name: Hong Tao
full_name: Xiao, Hong Tao
last_name: Xiao
- first_name: Jian
full_name: Xiao, Jian
last_name: Xiao
- first_name: Lan
full_name: Xiao, Lan
last_name: Xiao
- first_name: Shi
full_name: Xiao, Shi
last_name: Xiao
- first_name: Yin
full_name: Xiao, Yin
last_name: Xiao
- first_name: Baoming
full_name: Xie, Baoming
last_name: Xie
- first_name: Chuan Ming
full_name: Xie, Chuan Ming
last_name: Xie
- first_name: Min
full_name: Xie, Min
last_name: Xie
- first_name: Yuxiang
full_name: Xie, Yuxiang
last_name: Xie
- first_name: Zhiping
full_name: Xie, Zhiping
last_name: Xie
- first_name: Zhonglin
full_name: Xie, Zhonglin
last_name: Xie
- first_name: Maria
full_name: Xilouri, Maria
last_name: Xilouri
- first_name: Congfeng
full_name: Xu, Congfeng
last_name: Xu
- first_name: En
full_name: Xu, En
last_name: Xu
- first_name: Haoxing
full_name: Xu, Haoxing
last_name: Xu
- first_name: Jing
full_name: Xu, Jing
last_name: Xu
- first_name: Jin Rong
full_name: Xu, Jin Rong
last_name: Xu
- first_name: Liang
full_name: Xu, Liang
last_name: Xu
- first_name: Wen Wen
full_name: Xu, Wen Wen
last_name: Xu
- first_name: Xiulong
full_name: Xu, Xiulong
last_name: Xu
- first_name: Yu
full_name: Xue, Yu
last_name: Xue
- first_name: Sokhna M.S.
full_name: Yakhine-Diop, Sokhna M.S.
last_name: Yakhine-Diop
- first_name: Masamitsu
full_name: Yamaguchi, Masamitsu
last_name: Yamaguchi
- first_name: Osamu
full_name: Yamaguchi, Osamu
last_name: Yamaguchi
- first_name: Ai
full_name: Yamamoto, Ai
last_name: Yamamoto
- first_name: Shunhei
full_name: Yamashina, Shunhei
last_name: Yamashina
- first_name: Shengmin
full_name: Yan, Shengmin
last_name: Yan
- first_name: Shian Jang
full_name: Yan, Shian Jang
last_name: Yan
- first_name: Zhen
full_name: Yan, Zhen
last_name: Yan
- first_name: Yasuo
full_name: Yanagi, Yasuo
last_name: Yanagi
- first_name: Chuanbin
full_name: Yang, Chuanbin
last_name: Yang
- first_name: Dun Sheng
full_name: Yang, Dun Sheng
last_name: Yang
- first_name: Huan
full_name: Yang, Huan
last_name: Yang
- first_name: Huang Tian
full_name: Yang, Huang Tian
last_name: Yang
- first_name: Hui
full_name: Yang, Hui
last_name: Yang
- first_name: Jin Ming
full_name: Yang, Jin Ming
last_name: Yang
- first_name: Jing
full_name: Yang, Jing
last_name: Yang
- first_name: Jingyu
full_name: Yang, Jingyu
last_name: Yang
- first_name: Ling
full_name: Yang, Ling
last_name: Yang
- first_name: Liu
full_name: Yang, Liu
last_name: Yang
- first_name: Ming
full_name: Yang, Ming
last_name: Yang
- first_name: Pei Ming
full_name: Yang, Pei Ming
last_name: Yang
- first_name: Qian
full_name: Yang, Qian
last_name: Yang
- first_name: Seungwon
full_name: Yang, Seungwon
last_name: Yang
- first_name: Shu
full_name: Yang, Shu
last_name: Yang
- first_name: Shun Fa
full_name: Yang, Shun Fa
last_name: Yang
- first_name: Wannian
full_name: Yang, Wannian
last_name: Yang
- first_name: Wei Yuan
full_name: Yang, Wei Yuan
last_name: Yang
- first_name: Xiaoyong
full_name: Yang, Xiaoyong
last_name: Yang
- first_name: Xuesong
full_name: Yang, Xuesong
last_name: Yang
- first_name: Yi
full_name: Yang, Yi
last_name: Yang
- first_name: Ying
full_name: Yang, Ying
last_name: Yang
- first_name: Honghong
full_name: Yao, Honghong
last_name: Yao
- first_name: Shenggen
full_name: Yao, Shenggen
last_name: Yao
- first_name: Xiaoqiang
full_name: Yao, Xiaoqiang
last_name: Yao
- first_name: Yong Gang
full_name: Yao, Yong Gang
last_name: Yao
- first_name: Yong Ming
full_name: Yao, Yong Ming
last_name: Yao
- first_name: Takahiro
full_name: Yasui, Takahiro
last_name: Yasui
- first_name: Meysam
full_name: Yazdankhah, Meysam
last_name: Yazdankhah
- first_name: Paul M.
full_name: Yen, Paul M.
last_name: Yen
- first_name: Cong
full_name: Yi, Cong
last_name: Yi
- first_name: Xiao Ming
full_name: Yin, Xiao Ming
last_name: Yin
- first_name: Yanhai
full_name: Yin, Yanhai
last_name: Yin
- first_name: Zhangyuan
full_name: Yin, Zhangyuan
last_name: Yin
- first_name: Ziyi
full_name: Yin, Ziyi
last_name: Yin
- first_name: Meidan
full_name: Ying, Meidan
last_name: Ying
- first_name: Zheng
full_name: Ying, Zheng
last_name: Ying
- first_name: Calvin K.
full_name: Yip, Calvin K.
last_name: Yip
- first_name: Stephanie Pei Tung
full_name: Yiu, Stephanie Pei Tung
last_name: Yiu
- first_name: Young H.
full_name: Yoo, Young H.
last_name: Yoo
- first_name: Kiyotsugu
full_name: Yoshida, Kiyotsugu
last_name: Yoshida
- first_name: Saori R.
full_name: Yoshii, Saori R.
last_name: Yoshii
- first_name: Tamotsu
full_name: Yoshimori, Tamotsu
last_name: Yoshimori
- first_name: Bahman
full_name: Yousefi, Bahman
last_name: Yousefi
- first_name: Boxuan
full_name: Yu, Boxuan
last_name: Yu
- first_name: Haiyang
full_name: Yu, Haiyang
last_name: Yu
- first_name: Jun
full_name: Yu, Jun
last_name: Yu
- first_name: Jun
full_name: Yu, Jun
last_name: Yu
- first_name: Li
full_name: Yu, Li
last_name: Yu
- first_name: Ming Lung
full_name: Yu, Ming Lung
last_name: Yu
- first_name: Seong Woon
full_name: Yu, Seong Woon
last_name: Yu
- first_name: Victor C.
full_name: Yu, Victor C.
last_name: Yu
- first_name: W. Haung
full_name: Yu, W. Haung
last_name: Yu
- first_name: Zhengping
full_name: Yu, Zhengping
last_name: Yu
- first_name: Zhou
full_name: Yu, Zhou
last_name: Yu
- first_name: Junying
full_name: Yuan, Junying
last_name: Yuan
- first_name: Ling Qing
full_name: Yuan, Ling Qing
last_name: Yuan
- first_name: Shilin
full_name: Yuan, Shilin
last_name: Yuan
- first_name: Shyng Shiou F.
full_name: Yuan, Shyng Shiou F.
last_name: Yuan
- first_name: Yanggang
full_name: Yuan, Yanggang
last_name: Yuan
- first_name: Zengqiang
full_name: Yuan, Zengqiang
last_name: Yuan
- first_name: Jianbo
full_name: Yue, Jianbo
last_name: Yue
- first_name: Zhenyu
full_name: Yue, Zhenyu
last_name: Yue
- first_name: Jeanho
full_name: Yun, Jeanho
last_name: Yun
- first_name: Raymond L.
full_name: Yung, Raymond L.
last_name: Yung
- first_name: David N.
full_name: Zacks, David N.
last_name: Zacks
- first_name: Gabriele
full_name: Zaffagnini, Gabriele
last_name: Zaffagnini
- first_name: Vanessa O.
full_name: Zambelli, Vanessa O.
last_name: Zambelli
- first_name: Isabella
full_name: Zanella, Isabella
last_name: Zanella
- first_name: Qun S.
full_name: Zang, Qun S.
last_name: Zang
- first_name: Sara
full_name: Zanivan, Sara
last_name: Zanivan
- first_name: Silvia
full_name: Zappavigna, Silvia
last_name: Zappavigna
- first_name: Pilar
full_name: Zaragoza, Pilar
last_name: Zaragoza
- first_name: Konstantinos S.
full_name: Zarbalis, Konstantinos S.
last_name: Zarbalis
- first_name: Amir
full_name: Zarebkohan, Amir
last_name: Zarebkohan
- first_name: Amira
full_name: Zarrouk, Amira
last_name: Zarrouk
- first_name: Scott O.
full_name: Zeitlin, Scott O.
last_name: Zeitlin
- first_name: Jialiu
full_name: Zeng, Jialiu
last_name: Zeng
- first_name: Ju Deng
full_name: Zeng, Ju Deng
last_name: Zeng
- first_name: Eva
full_name: Žerovnik, Eva
last_name: Žerovnik
- first_name: Lixuan
full_name: Zhan, Lixuan
last_name: Zhan
- first_name: Bin
full_name: Zhang, Bin
last_name: Zhang
- first_name: Donna D.
full_name: Zhang, Donna D.
last_name: Zhang
- first_name: Hanlin
full_name: Zhang, Hanlin
last_name: Zhang
- first_name: Hong
full_name: Zhang, Hong
last_name: Zhang
- first_name: Hong
full_name: Zhang, Hong
last_name: Zhang
- first_name: Honghe
full_name: Zhang, Honghe
last_name: Zhang
- first_name: Huafeng
full_name: Zhang, Huafeng
last_name: Zhang
- first_name: Huaye
full_name: Zhang, Huaye
last_name: Zhang
- first_name: Hui
full_name: Zhang, Hui
last_name: Zhang
- first_name: Hui Ling
full_name: Zhang, Hui Ling
last_name: Zhang
- first_name: Jianbin
full_name: Zhang, Jianbin
last_name: Zhang
- first_name: Jianhua
full_name: Zhang, Jianhua
last_name: Zhang
- first_name: Jing Pu
full_name: Zhang, Jing Pu
last_name: Zhang
- first_name: Kalin Y.B.
full_name: Zhang, Kalin Y.B.
last_name: Zhang
- first_name: Leshuai W.
full_name: Zhang, Leshuai W.
last_name: Zhang
- first_name: Lin
full_name: Zhang, Lin
last_name: Zhang
- first_name: Lisheng
full_name: Zhang, Lisheng
last_name: Zhang
- first_name: Lu
full_name: Zhang, Lu
last_name: Zhang
- first_name: Luoying
full_name: Zhang, Luoying
last_name: Zhang
- first_name: Menghuan
full_name: Zhang, Menghuan
last_name: Zhang
- first_name: Peng
full_name: Zhang, Peng
last_name: Zhang
- first_name: Sheng
full_name: Zhang, Sheng
last_name: Zhang
- first_name: Wei
full_name: Zhang, Wei
last_name: Zhang
- first_name: Xiangnan
full_name: Zhang, Xiangnan
last_name: Zhang
- first_name: Xiao Wei
full_name: Zhang, Xiao Wei
last_name: Zhang
- first_name: Xiaolei
full_name: Zhang, Xiaolei
last_name: Zhang
- first_name: Xiaoyan
full_name: Zhang, Xiaoyan
last_name: Zhang
- first_name: Xin
full_name: Zhang, Xin
last_name: Zhang
- first_name: Xinxin
full_name: Zhang, Xinxin
last_name: Zhang
- first_name: Xu Dong
full_name: Zhang, Xu Dong
last_name: Zhang
- first_name: Yang
full_name: Zhang, Yang
last_name: Zhang
- first_name: Yanjin
full_name: Zhang, Yanjin
last_name: Zhang
- first_name: Yi
full_name: Zhang, Yi
last_name: Zhang
- first_name: Ying Dong
full_name: Zhang, Ying Dong
last_name: Zhang
- first_name: Yingmei
full_name: Zhang, Yingmei
last_name: Zhang
- first_name: Yuan Yuan
full_name: Zhang, Yuan Yuan
last_name: Zhang
- first_name: Yuchen
full_name: Zhang, Yuchen
last_name: Zhang
- first_name: Zhe
full_name: Zhang, Zhe
last_name: Zhang
- first_name: Zhengguang
full_name: Zhang, Zhengguang
last_name: Zhang
- first_name: Zhibing
full_name: Zhang, Zhibing
last_name: Zhang
- first_name: Zhihai
full_name: Zhang, Zhihai
last_name: Zhang
- first_name: Zhiyong
full_name: Zhang, Zhiyong
last_name: Zhang
- first_name: Zili
full_name: Zhang, Zili
last_name: Zhang
- first_name: Haobin
full_name: Zhao, Haobin
last_name: Zhao
- first_name: Lei
full_name: Zhao, Lei
last_name: Zhao
- first_name: Shuang
full_name: Zhao, Shuang
last_name: Zhao
- first_name: Tongbiao
full_name: Zhao, Tongbiao
last_name: Zhao
- first_name: Xiao Fan
full_name: Zhao, Xiao Fan
last_name: Zhao
- first_name: Ying
full_name: Zhao, Ying
last_name: Zhao
- first_name: Yongchao
full_name: Zhao, Yongchao
last_name: Zhao
- first_name: Yongliang
full_name: Zhao, Yongliang
last_name: Zhao
- first_name: Yuting
full_name: Zhao, Yuting
last_name: Zhao
- first_name: Guoping
full_name: Zheng, Guoping
last_name: Zheng
- first_name: Kai
full_name: Zheng, Kai
last_name: Zheng
- first_name: Ling
full_name: Zheng, Ling
last_name: Zheng
- first_name: Shizhong
full_name: Zheng, Shizhong
last_name: Zheng
- first_name: Xi Long
full_name: Zheng, Xi Long
last_name: Zheng
- first_name: Yi
full_name: Zheng, Yi
last_name: Zheng
- first_name: Zu Guo
full_name: Zheng, Zu Guo
last_name: Zheng
- first_name: Boris
full_name: Zhivotovsky, Boris
last_name: Zhivotovsky
- first_name: Qing
full_name: Zhong, Qing
last_name: Zhong
- first_name: Ao
full_name: Zhou, Ao
last_name: Zhou
- first_name: Ben
full_name: Zhou, Ben
last_name: Zhou
- first_name: Cefan
full_name: Zhou, Cefan
last_name: Zhou
- first_name: Gang
full_name: Zhou, Gang
last_name: Zhou
- first_name: Hao
full_name: Zhou, Hao
last_name: Zhou
- first_name: Hong
full_name: Zhou, Hong
last_name: Zhou
- first_name: Hongbo
full_name: Zhou, Hongbo
last_name: Zhou
- first_name: Jie
full_name: Zhou, Jie
last_name: Zhou
- first_name: Jing
full_name: Zhou, Jing
last_name: Zhou
- first_name: Jing
full_name: Zhou, Jing
last_name: Zhou
- first_name: Jiyong
full_name: Zhou, Jiyong
last_name: Zhou
- first_name: Kailiang
full_name: Zhou, Kailiang
last_name: Zhou
- first_name: Rongjia
full_name: Zhou, Rongjia
last_name: Zhou
- first_name: Xu Jie
full_name: Zhou, Xu Jie
last_name: Zhou
- first_name: Yanshuang
full_name: Zhou, Yanshuang
last_name: Zhou
- first_name: Yinghong
full_name: Zhou, Yinghong
last_name: Zhou
- first_name: Yubin
full_name: Zhou, Yubin
last_name: Zhou
- first_name: Zheng Yu
full_name: Zhou, Zheng Yu
last_name: Zhou
- first_name: Zhou
full_name: Zhou, Zhou
last_name: Zhou
- first_name: Binglin
full_name: Zhu, Binglin
last_name: Zhu
- first_name: Changlian
full_name: Zhu, Changlian
last_name: Zhu
- first_name: Guo Qing
full_name: Zhu, Guo Qing
last_name: Zhu
- first_name: Haining
full_name: Zhu, Haining
last_name: Zhu
- first_name: Hongxin
full_name: Zhu, Hongxin
last_name: Zhu
- first_name: Hua
full_name: Zhu, Hua
last_name: Zhu
- first_name: Wei Guo
full_name: Zhu, Wei Guo
last_name: Zhu
- first_name: Yanping
full_name: Zhu, Yanping
last_name: Zhu
- first_name: Yushan
full_name: Zhu, Yushan
last_name: Zhu
- first_name: Haixia
full_name: Zhuang, Haixia
last_name: Zhuang
- first_name: Xiaohong
full_name: Zhuang, Xiaohong
last_name: Zhuang
- first_name: Katarzyna
full_name: Zientara-Rytter, Katarzyna
last_name: Zientara-Rytter
- first_name: Christine M.
full_name: Zimmermann, Christine M.
last_name: Zimmermann
- first_name: Elena
full_name: Ziviani, Elena
last_name: Ziviani
- first_name: Teresa
full_name: Zoladek, Teresa
last_name: Zoladek
- first_name: Wei Xing
full_name: Zong, Wei Xing
last_name: Zong
- first_name: Dmitry B.
full_name: Zorov, Dmitry B.
last_name: Zorov
- first_name: Antonio
full_name: Zorzano, Antonio
last_name: Zorzano
- first_name: Weiping
full_name: Zou, Weiping
last_name: Zou
- first_name: Zhen
full_name: Zou, Zhen
last_name: Zou
- first_name: Zhengzhi
full_name: Zou, Zhengzhi
last_name: Zou
- first_name: Steven
full_name: Zuryn, Steven
last_name: Zuryn
- first_name: Werner
full_name: Zwerschke, Werner
last_name: Zwerschke
- first_name: Beate
full_name: Brand-Saberi, Beate
last_name: Brand-Saberi
- first_name: X. Charlie
full_name: Dong, X. Charlie
last_name: Dong
- first_name: Chandra Shekar
full_name: Kenchappa, Chandra Shekar
last_name: Kenchappa
- first_name: Zuguo
full_name: Li, Zuguo
last_name: Li
- first_name: Yong
full_name: Lin, Yong
last_name: Lin
- first_name: Shigeru
full_name: Oshima, Shigeru
last_name: Oshima
- first_name: Yueguang
full_name: Rong, Yueguang
last_name: Rong
- first_name: Judith C.
full_name: Sluimer, Judith C.
last_name: Sluimer
- first_name: Christina L.
full_name: Stallings, Christina L.
last_name: Stallings
- first_name: Chun Kit
full_name: Tong, Chun Kit
last_name: Tong
citation:
ama: Klionsky DJ, Abdel-Aziz AK, Abdelfatah S, et al. Guidelines for the use and
interpretation of assays for monitoring autophagy (4th edition). Autophagy.
2021;17(1):1-382. doi:10.1080/15548627.2020.1797280
apa: Klionsky, D. J., Abdel-Aziz, A. K., Abdelfatah, S., Abdellatif, M., Abdoli,
A., Abel, S., … Tong, C. K. (2021). Guidelines for the use and interpretation
of assays for monitoring autophagy (4th edition). Autophagy. Taylor &
Francis. https://doi.org/10.1080/15548627.2020.1797280
chicago: Klionsky, Daniel J., Amal Kamal Abdel-Aziz, Sara Abdelfatah, Mahmoud Abdellatif,
Asghar Abdoli, Steffen Abel, Hagai Abeliovich, et al. “Guidelines for the Use
and Interpretation of Assays for Monitoring Autophagy (4th Edition).” Autophagy.
Taylor & Francis, 2021. https://doi.org/10.1080/15548627.2020.1797280.
ieee: D. J. Klionsky et al., “Guidelines for the use and interpretation of
assays for monitoring autophagy (4th edition),” Autophagy, vol. 17, no.
1. Taylor & Francis, pp. 1–382, 2021.
ista: Klionsky DJ et al. 2021. Guidelines for the use and interpretation of assays
for monitoring autophagy (4th edition). Autophagy. 17(1), 1–382.
mla: Klionsky, Daniel J., et al. “Guidelines for the Use and Interpretation of Assays
for Monitoring Autophagy (4th Edition).” Autophagy, vol. 17, no. 1, Taylor
& Francis, 2021, pp. 1–382, doi:10.1080/15548627.2020.1797280.
short: D.J. Klionsky, A.K. Abdel-Aziz, S. Abdelfatah, M. Abdellatif, A. Abdoli,
S. Abel, H. Abeliovich, M.H. Abildgaard, Y.P. Abudu, A. Acevedo-Arozena, I.E.
Adamopoulos, K. Adeli, T.E. Adolph, A. Adornetto, E. Aflaki, G. Agam, A. Agarwal,
B.B. Aggarwal, M. Agnello, P. Agostinis, J.N. Agrewala, A. Agrotis, P.V. Aguilar,
S.T. Ahmad, Z.M. Ahmed, U. Ahumada-Castro, S. Aits, S. Aizawa, Y. Akkoc, T. Akoumianaki,
H.A. Akpinar, A.M. Al-Abd, L. Al-Akra, A. Al-Gharaibeh, M.A. Alaoui-Jamali, S.
Alberti, E. Alcocer-Gómez, C. Alessandri, M. Ali, M.A. Alim Al-Bari, S. Aliwaini,
J. Alizadeh, E. Almacellas, A. Almasan, A. Alonso, G.D. Alonso, N. Altan-Bonnet,
D.C. Altieri, É.M.C. Álvarez, S. Alves, C. Alves Da Costa, M.M. Alzaharna, M.
Amadio, C. Amantini, C. Amaral, S. Ambrosio, A.O. Amer, V. Ammanathan, Z. An,
S.U. Andersen, S.A. Andrabi, M. Andrade-Silva, A.M. Andres, S. Angelini, D. Ann,
U.C. Anozie, M.Y. Ansari, P. Antas, A. Antebi, Z. Antón, T. Anwar, L. Apetoh,
N. Apostolova, T. Araki, Y. Araki, K. Arasaki, W.L. Araújo, J. Araya, C. Arden,
M.A. Arévalo, S. Arguelles, E. Arias, J. Arikkath, H. Arimoto, A.R. Ariosa, D.
Armstrong-James, L. Arnauné-Pelloquin, A. Aroca, D.S. Arroyo, I. Arsov, R. Artero,
D.M.L. Asaro, M. Aschner, M. Ashrafizadeh, O. Ashur-Fabian, A.G. Atanasov, A.K.
Au, P. Auberger, H.W. Auner, L. Aurelian, R. Autelli, L. Avagliano, Y. Ávalos,
S. Aveic, C.A. Aveleira, T. Avin-Wittenberg, Y. Aydin, S. Ayton, S. Ayyadevara,
M. Azzopardi, M. Baba, J.M. Backer, S.K. Backues, D.H. Bae, O.N. Bae, S.H. Bae,
E.H. Baehrecke, A. Baek, S.H. Baek, S.H. Baek, G. Bagetta, A. Bagniewska-Zadworna,
H. Bai, J. Bai, X. Bai, Y. Bai, N. Bairagi, S. Baksi, T. Balbi, C.T. Baldari,
W. Balduini, A. Ballabio, M. Ballester, S. Balazadeh, R. Balzan, R. Bandopadhyay,
S. Banerjee, S. Banerjee, Á. Bánréti, Y. Bao, M.S. Baptista, A. Baracca, C. Barbati,
A. Bargiela, D. Barilà, P.G. Barlow, S.J. Barmada, E. Barreiro, G.E. Barreto,
J. Bartek, B. Bartel, A. Bartolome, G.R. Barve, S.H. Basagoudanavar, D.C. Bassham,
R.C. Bast, A. Basu, H. Batoko, I. Batten, E.E. Baulieu, B.L. Baumgarner, J. Bayry,
R. Beale, I. Beau, F. Beaumatin, L.R.G. Bechara, G.R. Beck, M.F. Beers, J. Begun,
C. Behrends, G.M.N. Behrens, R. Bei, E. Bejarano, S. Bel, C. Behl, A. Belaid,
N. Belgareh-Touzé, C. Bellarosa, F. Belleudi, M. Belló Pérez, R. Bello-Morales,
J.S.D.O. Beltran, S. Beltran, D.M. Benbrook, M. Bendorius, B.A. Benitez, I. Benito-Cuesta,
J. Bensalem, M.W. Berchtold, S. Berezowska, D. Bergamaschi, M. Bergami, A. Bergmann,
L. Berliocchi, C. Berlioz-Torrent, A. Bernard, L. Berthoux, C.G. Besirli, S. Besteiro,
V.M. Betin, R. Beyaert, J.S. Bezbradica, K. Bhaskar, I. Bhatia-Kissova, R. Bhattacharya,
S. Bhattacharya, S. Bhattacharyya, M.S. Bhuiyan, S.K. Bhutia, L. Bi, X. Bi, T.J.
Biden, K. Bijian, V.A. Billes, N. Binart, C. Bincoletto, A.B. Birgisdottir, G.
Bjorkoy, G. Blanco, A. Blas-Garcia, J. Blasiak, R. Blomgran, K. Blomgren, J.S.
Blum, E. Boada-Romero, M. Boban, K. Boesze-Battaglia, P. Boeuf, B. Boland, P.
Bomont, P. Bonaldo, S.R. Bonam, L. Bonfili, J.S. Bonifacino, B.A. Boone, M.D.
Bootman, M. Bordi, C. Borner, B.C. Bornhauser, G. Borthakur, J. Bosch, S. Bose,
L.M. Botana, J. Botas, C.M. Boulanger, M.E. Boulton, M. Bourdenx, B. Bourgeois,
N.M. Bourke, G. Bousquet, P. Boya, P.V. Bozhkov, L.H.M. Bozi, T.O. Bozkurt, D.E.
Brackney, C.H. Brandts, R.J. Braun, G.H. Braus, R. Bravo-Sagua, J.M. Bravo-San
Pedro, P. Brest, M.A. Bringer, A. Briones-Herrera, V.C. Broaddus, P. Brodersen,
J.L. Brodsky, S.L. Brody, P.G. Bronson, J.M. Bronstein, C.N. Brown, R.E. Brown,
P.C. Brum, J.H. Brumell, N. Brunetti-Pierri, D. Bruno, R.J. Bryson-Richardson,
C. Bucci, C. Buchrieser, M. Bueno, L.E. Buitrago-Molina, S. Buraschi, S. Buch,
J.R. Buchan, E.M. Buckingham, H. Budak, M. Budini, G. Bultynck, F. Burada, J.R.
Burgoyne, M.I. Burón, V. Bustos, S. Büttner, E. Butturini, A. Byrd, I. Cabas,
S. Cabrera-Benitez, K. Cadwell, J. Cai, L. Cai, Q. Cai, M. Cairó, J.A. Calbet,
G.A. Caldwell, K.A. Caldwell, J.A. Call, R. Calvani, A.C. Calvo, M. Calvo-Rubio
Barrera, N.O.S. Camara, J.H. Camonis, N. Camougrand, M. Campanella, E.M. Campbell,
F.X. Campbell-Valois, S. Campello, I. Campesi, J.C. Campos, O. Camuzard, J. Cancino,
D. Candido De Almeida, L. Canesi, I. Caniggia, B. Canonico, C. Cantí, B. Cao,
M. Caraglia, B. Caramés, E.H. Carchman, E. Cardenal-Muñoz, C. Cardenas, L. Cardenas,
S.M. Cardoso, J.S. Carew, G.F. Carle, G. Carleton, S. Carloni, D. Carmona-Gutierrez,
L.A. Carneiro, O. Carnevali, J.M. Carosi, S. Carra, A. Carrier, L. Carrier, B.
Carroll, A.B. Carter, A.N. Carvalho, M. Casanova, C. Casas, J. Casas, C. Cassioli,
E.F. Castillo, K. Castillo, S. Castillo-Lluva, F. Castoldi, M. Castori, A.F. Castro,
M. Castro-Caldas, J. Castro-Hernandez, S. Castro-Obregon, S.D. Catz, C. Cavadas,
F. Cavaliere, G. Cavallini, M. Cavinato, M.L. Cayuela, P. Cebollada Rica, V. Cecarini,
F. Cecconi, M. Cechowska-Pasko, S. Cenci, V. Ceperuelo-Mallafré, J.J. Cerqueira,
J.M. Cerutti, D. Cervia, V.B. Cetintas, S. Cetrullo, H.J. Chae, A.S. Chagin, C.Y.
Chai, G. Chakrabarti, O. Chakrabarti, T. Chakraborty, T. Chakraborty, M. Chami,
G. Chamilos, D.W. Chan, E.Y.W. Chan, E.D. Chan, H.Y.E. Chan, H.H. Chan, H. Chan,
M.T.V. Chan, Y.S. Chan, P.K. Chandra, C.P. Chang, C. Chang, H.C. Chang, K. Chang,
J. Chao, T. Chapman, N. Charlet-Berguerand, S. Chatterjee, S.K. Chaube, A. Chaudhary,
S. Chauhan, E. Chaum, F. Checler, M.E. Cheetham, C.S. Chen, G.C. Chen, J.F. Chen,
L.L. Chen, L. Chen, L. Chen, M. Chen, M.K. Chen, N. Chen, Q. Chen, R.H. Chen,
S. Chen, W. Chen, W. Chen, X.M. Chen, X.W. Chen, X. Chen, Y. Chen, Y.G. Chen,
Y. Chen, Y. Chen, Y.J. Chen, Y.Q. Chen, Z.S. Chen, Z. Chen, Z.H. Chen, Z.J. Chen,
Z. Chen, H. Cheng, J. Cheng, S.Y. Cheng, W. Cheng, X. Cheng, X.T. Cheng, Y. Cheng,
Z. Cheng, Z. Chen, H. Cheong, J.K. Cheong, B.V. Chernyak, S. Cherry, C.F.R. Cheung,
C.H.A. Cheung, K.H. Cheung, E. Chevet, R.J. Chi, A.K.S. Chiang, F. Chiaradonna,
R. Chiarelli, M. Chiariello, N. Chica, S. Chiocca, M. Chiong, S.H. Chiou, A.I.
Chiramel, V. Chiurchiù, D.H. Cho, S.K. Choe, A.M.K. Choi, M.E. Choi, K.R. Choudhury,
N.S. Chow, C.T. Chu, J.P. Chua, J.J.E. Chua, H. Chung, K.P. Chung, S. Chung, S.H.
Chung, Y.L. Chung, V. Cianfanelli, I.A. Ciechomska, M. Cifuentes, L. Cinque, S.
Cirak, M. Cirone, M.J. Clague, R. Clarke, E. Clementi, E.M. Coccia, P. Codogno,
E. Cohen, M.M. Cohen, T. Colasanti, F. Colasuonno, R.A. Colbert, A. Colell, M.
Čolić, N.S. Coll, M.O. Collins, M.I. Colombo, D.A. Colón-Ramos, L. Combaret, S.
Comincini, M.R. Cominetti, A. Consiglio, A. Conte, F. Conti, V.R. Contu, M.R.
Cookson, K.M. Coombs, I. Coppens, M.T. Corasaniti, D.P. Corkery, N. Cordes, K.
Cortese, M.D.C. Costa, S. Costantino, P. Costelli, A. Coto-Montes, P.J. Crack,
J.L. Crespo, A. Criollo, V. Crippa, R. Cristofani, T. Csizmadia, A. Cuadrado,
B. Cui, J. Cui, Y. Cui, Y. Cui, E. Culetto, A.C. Cumino, A.V. Cybulsky, M.J. Czaja,
S.J. Czuczwar, S. D’Adamo, M. D’Amelio, D. D’Arcangelo, A.C. D’Lugos, G. D’Orazi,
J.A. Da Silva, H.S. Dafsari, R.K. Dagda, Y. Dagdas, M. Daglia, X. Dai, Y. Dai,
Y. Dai, J. Dal Col, P. Dalhaimer, L. Dalla Valle, T. Dallenga, G. Dalmasso, M.
Damme, I. Dando, N.P. Dantuma, A.L. Darling, H. Das, S. Dasarathy, S.K. Dasari,
S. Dash, O. Daumke, A.N. Dauphinee, J.S. Davies, V.A. Dávila, R.J. Davis, T. Davis,
S. Dayalan Naidu, F. De Amicis, K. De Bosscher, F. De Felice, L. De Franceschi,
C. De Leonibus, M.G. De Mattos Barbosa, G.R.Y. De Meyer, A. De Milito, C. De Nunzio,
C. De Palma, M. De Santi, C. De Virgilio, D. De Zio, J. Debnath, B.J. Debosch,
J.P. Decuypere, M.A. Deehan, G. Deflorian, J. Degregori, B. Dehay, G. Del Rio,
J.R. Delaney, L.M.D. Delbridge, E. Delorme-Axford, M.V. Delpino, F. Demarchi,
V. Dembitz, N.D. Demers, H. Deng, Z. Deng, J. Dengjel, P. Dent, D. Denton, M.L.
Depamphilis, C.J. Der, V. Deretic, A. Descoteaux, L. Devis, S. Devkota, O. Devuyst,
G. Dewson, M. Dharmasivam, R. Dhiman, D. Di Bernardo, M. Di Cristina, F. Di Domenico,
P. Di Fazio, A. Di Fonzo, G. Di Guardo, G.M. Di Guglielmo, L. Di Leo, C. Di Malta,
A. Di Nardo, M. Di Rienzo, F. Di Sano, G. Diallinas, J. Diao, G. Diaz-Araya, I.
Díaz-Laviada, J.M. Dickinson, M. Diederich, M. Dieudé, I. Dikic, S. Ding, W.X.
Ding, L. Dini, J. Dinić, M. Dinic, A.T. Dinkova-Kostova, M.S. Dionne, J.H.W. Distler,
A. Diwan, I.M.C. Dixon, M. Djavaheri-Mergny, I. Dobrinski, O. Dobrovinskaya, R.
Dobrowolski, R.C.J. Dobson, J. Đokić, S. Dokmeci Emre, M. Donadelli, B. Dong,
X. Dong, Z. Dong, G.W. Dorn, V. Dotsch, H. Dou, J. Dou, M. Dowaidar, S. Dridi,
L. Drucker, A. Du, C. Du, G. Du, H.N. Du, L.L. Du, A. Du Toit, S.B. Duan, X. Duan,
S.P. Duarte, A. Dubrovska, E.A. Dunlop, N. Dupont, R.V. Durán, B.S. Dwarakanath,
S.A. Dyshlovoy, D. Ebrahimi-Fakhari, L. Eckhart, C.L. Edelstein, T. Efferth, E.
Eftekharpour, L. Eichinger, N. Eid, T. Eisenberg, N.T. Eissa, S. Eissa, M. Ejarque,
A. El Andaloussi, N. El-Hage, S. El-Naggar, A.M. Eleuteri, E.S. El-Shafey, M.
Elgendy, A.G. Eliopoulos, M.M. Elizalde, P.M. Elks, H.P. Elsasser, E.S. Elsherbiny,
B.M. Emerling, N.C.T. Emre, C.H. Eng, N. Engedal, A.M. Engelbrecht, A.S.T. Engelsen,
J.M. Enserink, R. Escalante, A. Esclatine, M. Escobar-Henriques, E.L. Eskelinen,
L. Espert, M.O. Eusebio, G. Fabrias, C. Fabrizi, A. Facchiano, F. Facchiano, B.
Fadeel, C. Fader, A.C. Faesen, W.D. Fairlie, A. Falcó, B.H. Falkenburger, D. Fan,
J. Fan, Y. Fan, E.F. Fang, Y. Fang, Y. Fang, M. Fanto, T. Farfel-Becker, M. Faure,
G. Fazeli, A.O. Fedele, A.M. Feldman, D. Feng, J. Feng, L. Feng, Y. Feng, Y. Feng,
W. Feng, T. Fenz Araujo, T.A. Ferguson, Á.F. Fernández, J.C. Fernandez-Checa,
S. Fernández-Veledo, A.R. Fernie, A.W. Ferrante, A. Ferraresi, M.F. Ferrari, J.C.B.
Ferreira, S. Ferro-Novick, A. Figueras, R. Filadi, N. Filigheddu, E. Filippi-Chiela,
G. Filomeni, G.M. Fimia, V. Fineschi, F. Finetti, S. Finkbeiner, E.A. Fisher,
P.B. Fisher, F. Flamigni, S.J. Fliesler, T.H. Flo, I. Florance, O. Florey, T.
Florio, E. Fodor, C. Follo, E.A. Fon, A. Forlino, F. Fornai, P. Fortini, A. Fracassi,
A. Fraldi, B. Franco, R. Franco, F. Franconi, L.B. Frankel, S.L. Friedman, L.F.
Fröhlich, G. Frühbeck, J.M. Fuentes, Y. Fujiki, N. Fujita, Y. Fujiwara, M. Fukuda,
S. Fulda, L. Furic, N. Furuya, C. Fusco, M.U. Gack, L. Gaffke, S. Galadari, A.
Galasso, M.F. Galindo, S. Gallolu Kankanamalage, L. Galluzzi, V. Galy, N. Gammoh,
B. Gan, I.G. Ganley, F. Gao, H. Gao, M. Gao, P. Gao, S.J. Gao, W. Gao, X. Gao,
A. Garcera, M.N. Garcia, V.E. Garcia, F. García-Del Portillo, V. Garcia-Escudero,
A. Garcia-Garcia, M. Garcia-Macia, D. García-Moreno, C. Garcia-Ruiz, P. García-Sanz,
A.D. Garg, R. Gargini, T. Garofalo, R.F. Garry, N.C. Gassen, D. Gatica, L. Ge,
W. Ge, R. Geiss-Friedlander, C. Gelfi, P. Genschik, I.E. Gentle, V. Gerbino, C.
Gerhardt, K. Germain, M. Germain, D.A. Gewirtz, E. Ghasemipour Afshar, S. Ghavami,
A. Ghigo, M. Ghosh, G. Giamas, C. Giampietri, A. Giatromanolaki, G.E. Gibson,
S.B. Gibson, V. Ginet, E. Giniger, C. Giorgi, H. Girao, S.E. Girardin, M. Giridharan,
S. Giuliano, C. Giulivi, S. Giuriato, J. Giustiniani, A. Gluschko, V. Goder, A.
Goginashvili, J. Golab, D.C. Goldstone, A. Golebiewska, L.R. Gomes, R. Gomez,
R. Gómez-Sánchez, M.C. Gomez-Puerto, R. Gomez-Sintes, Q. Gong, F.M. Goni, J. González-Gallego,
T. Gonzalez-Hernandez, R.A. Gonzalez-Polo, J.A. Gonzalez-Reyes, P. González-Rodríguez,
I.S. Goping, M.S. Gorbatyuk, N.V. Gorbunov, K. Görgülü, R.M. Gorojod, S.M. Gorski,
S. Goruppi, C. Gotor, R.A. Gottlieb, I. Gozes, D. Gozuacik, M. Graef, M.H. Gräler,
V. Granatiero, D. Grasso, J.P. Gray, D.R. Green, A. Greenhough, S.L. Gregory,
E.F. Griffin, M.W. Grinstaff, F. Gros, C. Grose, A.S. Gross, F. Gruber, P. Grumati,
T. Grune, X. Gu, J.L. Guan, C.M. Guardia, K. Guda, F. Guerra, C. Guerri, P. Guha,
C. Guillén, S. Gujar, A. Gukovskaya, I. Gukovsky, J. Gunst, A. Günther, A.R. Guntur,
C. Guo, C. Guo, H. Guo, L.W. Guo, M. Guo, P. Gupta, S.K. Gupta, S. Gupta, V.B.
Gupta, V. Gupta, A.B. Gustafsson, D.D. Gutterman, R. H.B, A. Haapasalo, J.E. Haber,
A. Hać, S. Hadano, A.J. Hafrén, M. Haidar, B.S. Hall, G. Halldén, A. Hamacher-Brady,
A. Hamann, M. Hamasaki, W. Han, M. Hansen, P.I.. Hanson, Z. Hao, M. Harada, L.
Harhaji-Trajkovic, N. Hariharan, N. Haroon, J. Harris, T. Hasegawa, N. Hasima
Nagoor, J.A. Haspel, V. Haucke, W.D. Hawkins, B.A. Hay, C.M. Haynes, S.B. Hayrabedyan,
T.S. Hays, C. He, Q. He, R.R. He, Y.W. He, Y.Y. He, Y. Heakal, A.M. Heberle, J.F.
Hejtmancik, G.V. Helgason, V. Henkel, M. Herb, A. Hergovich, A. Herman-Antosiewicz,
A. Hernández, C. Hernandez, S. Hernandez-Diaz, V. Hernandez-Gea, A. Herpin, J.
Herreros, J.H. Hervás, D. Hesselson, C. Hetz, V.T. Heussler, Y. Higuchi, S. Hilfiker,
J.A. Hill, W.S. Hlavacek, E.A. Ho, I.H.T. Ho, P.W.L. Ho, S.L. Ho, W.Y. Ho, G.A.
Hobbs, M. Hochstrasser, P.H.M. Hoet, D. Hofius, P. Hofman, A. Höhn, C.I. Holmberg,
J.R. Hombrebueno, C.W.H. Yi-Ren Hong, L.V. Hooper, T. Hoppe, R. Horos, Y. Hoshida,
I.L. Hsin, H.Y. Hsu, B. Hu, D. Hu, L.F. Hu, M.C. Hu, R. Hu, W. Hu, Y.C. Hu, Z.W.
Hu, F. Hua, J. Hua, Y. Hua, C. Huan, C. Huang, C. Huang, C. Huang, C. Huang, H.
Huang, K. Huang, M.L.H. Huang, R. Huang, S. Huang, T. Huang, X. Huang, Y.J. Huang,
T.B. Huber, V. Hubert, C.A. Hubner, S.M. Hughes, W.E. Hughes, M. Humbert, G. Hummer,
J.H. Hurley, S. Hussain, S. Hussain, P.J. Hussey, M. Hutabarat, H.Y. Hwang, S.
Hwang, A. Ieni, F. Ikeda, Y. Imagawa, Y. Imai, C. Imbriano, M. Imoto, D.M. Inman,
K. Inoki, J. Iovanna, R.V. Iozzo, G. Ippolito, J.E. Irazoqui, P. Iribarren, M.
Ishaq, M. Ishikawa, N. Ishimwe, C. Isidoro, N. Ismail, S. Issazadeh-Navikas, E.
Itakura, D. Ito, D. Ivankovic, S. Ivanova, A.K.V. Iyer, J.M. Izquierdo, M. Izumi,
M. Jäättelä, M.S. Jabir, W.T. Jackson, N. Jacobo-Herrera, A.C. Jacomin, E. Jacquin,
P. Jadiya, H. Jaeschke, C. Jagannath, A.J. Jakobi, J. Jakobsson, B. Janji, P.
Jansen-Dürr, P.J. Jansson, J. Jantsch, S. Januszewski, A. Jassey, S. Jean, H.
Jeltsch-David, P. Jendelova, A. Jenny, T.E. Jensen, N. Jessen, J.L. Jewell, J.
Ji, L. Jia, R. Jia, L. Jiang, Q. Jiang, R. Jiang, T. Jiang, X. Jiang, Y. Jiang,
M. Jimenez-Sanchez, E.J. Jin, F. Jin, H. Jin, L. Jin, L. Jin, M. Jin, S. Jin,
E.K. Jo, C. Joffre, T. Johansen, G.V.W. Johnson, S.A. Johnston, E. Jokitalo, M.K.
Jolly, L.A.B. Joosten, J. Jordan, B. Joseph, D. Ju, J.S. Ju, J. Ju, E. Juárez,
D. Judith, G. Juhász, Y. Jun, C.H. Jung, S.C. Jung, Y.K. Jung, H. Jungbluth, J.
Jungverdorben, S. Just, K. Kaarniranta, A. Kaasik, T. Kabuta, D. Kaganovich, A.
Kahana, R. Kain, S. Kajimura, M. Kalamvoki, M. Kalia, D.S. Kalinowski, N. Kaludercic,
I. Kalvari, J. Kaminska, V.O. Kaminskyy, H. Kanamori, K. Kanasaki, C. Kang, R.
Kang, S.S. Kang, S. Kaniyappan, T. Kanki, T.D. Kanneganti, A.G. Kanthasamy, A.
Kanthasamy, M. Kantorow, O. Kapuy, M.V. Karamouzis, M.R. Karim, P. Karmakar, R.G.
Katare, M. Kato, S.H.E. Kaufmann, A. Kauppinen, G.P. Kaushal, S. Kaushik, K. Kawasaki,
K. Kazan, P.Y. Ke, D.J. Keating, U. Keber, J.H. Kehrl, K.E. Keller, C.W. Keller,
J.K. Kemper, C.M. Kenific, O. Kepp, S. Kermorgant, A. Kern, R. Ketteler, T.G.
Keulers, B. Khalfin, H. Khalil, B. Khambu, S.Y. Khan, V.K.M. Khandelwal, R. Khandia,
W. Kho, N.V. Khobrekar, S. Khuansuwan, M. Khundadze, S.A. Killackey, D. Kim, D.R.
Kim, D.H. Kim, D.E. Kim, E.Y. Kim, E.K. Kim, H.R. Kim, H.S. Kim, U. Hyung-Ryong
Kim, J.H. Kim, J.K. Kim, J.H. Kim, J. Kim, J.H. Kim, K.I. Kim, P.K. Kim, S.J.
Kim, S.R. Kimball, A. Kimchi, A.C. Kimmelman, T. Kimura, M.A. King, K.J. Kinghorn,
C.G. Kinsey, V. Kirkin, L.A. Kirshenbaum, S.L. Kiselev, S. Kishi, K. Kitamoto,
Y. Kitaoka, K. Kitazato, R.N. Kitsis, J.T. Kittler, O. Kjaerulff, P.S. Klein,
T. Klopstock, J. Klucken, H. Knævelsrud, R.L. Knorr, B.C.B. Ko, F. Ko, J.L. Ko,
H. Kobayashi, S. Kobayashi, I. Koch, J.C. Koch, U. Koenig, D. Kögel, Y.H. Koh,
M. Koike, S.D. Kohlwein, N.M. Kocaturk, M. Komatsu, J. König, T. Kono, B.T. Kopp,
T. Korcsmaros, G. Korkmaz, V.I. Korolchuk, M.S. Korsnes, A. Koskela, J. Kota,
Y. Kotake, M.L. Kotler, Y. Kou, M.I. Koukourakis, E. Koustas, A.L. Kovacs, T.
Kovács, D. Koya, T. Kozako, C. Kraft, D. Krainc, H. Krämer, A.D. Krasnodembskaya,
C. Kretz-Remy, G. Kroemer, N.T. Ktistakis, K. Kuchitsu, S. Kuenen, L. Kuerschner,
T. Kukar, A. Kumar, A. Kumar, D. Kumar, D. Kumar, S. Kumar, S. Kume, C. Kumsta,
C.N. Kundu, M. Kundu, A.B. Kunnumakkara, L. Kurgan, T.G. Kutateladze, O. Kutlu,
S.A. Kwak, H.J. Kwon, T.K. Kwon, Y.T. Kwon, I. Kyrmizi, A. La Spada, P. Labonté,
S. Ladoire, I. Laface, F. Lafont, D.C. Lagace, V. Lahiri, Z. Lai, A.S. Laird,
A. Lakkaraju, T. Lamark, S.H. Lan, A. Landajuela, D.J.R. Lane, J.D. Lane, C.H.
Lang, C. Lange, Ü. Langel, R. Langer, P. Lapaquette, J. Laporte, N.F. Larusso,
I. Lastres-Becker, W.C.Y. Lau, G.W. Laurie, S. Lavandero, B.Y.K. Law, H.K.W. Law,
R. Layfield, W. Le, H. Le Stunff, A.Y. Leary, J.J. Lebrun, L.Y.W. Leck, J.P. Leduc-Gaudet,
C. Lee, C.P. Lee, D.H. Lee, E.B. Lee, E.F. Lee, G.M. Lee, H.J. Lee, H.K. Lee,
J.M. Lee, J.S. Lee, J.A. Lee, J.Y. Lee, J.H. Lee, M. Lee, M.G. Lee, M.J. Lee,
M.S. Lee, S.Y. Lee, S.J. Lee, S.Y. Lee, S.B. Lee, W.H. Lee, Y.R. Lee, Y.H. Lee,
Y. Lee, C. Lefebvre, R. Legouis, Y.L. Lei, Y. Lei, S. Leikin, G. Leitinger, L.
Lemus, S. Leng, O. Lenoir, G. Lenz, H.J. Lenz, P. Lenzi, Y. León, A.M. Leopoldino,
C. Leschczyk, S. Leskelä, E. Letellier, C.T. Leung, P.S. Leung, J.S. Leventhal,
B. Levine, P.A. Lewis, K. Ley, B. Li, D.Q. Li, J. Li, J. Li, J. Li, K. Li, L.
Li, M. Li, M. Li, M. Li, M. Li, M. Li, P.L. Li, M.Q. Li, Q. Li, S. Li, T. Li,
W. Li, W. Li, X. Li, Y.P. Li, Y. Li, Z. Li, Z. Li, Z. Li, J. Lian, C. Liang, Q.
Liang, W. Liang, Y. Liang, Y.T. Liang, G. Liao, L. Liao, M. Liao, Y.F. Liao, M.
Librizzi, P.P.Y. Lie, M.A. Lilly, H.J. Lim, T.R.R. Lima, F. Limana, C. Lin, C.W.
Lin, D.S. Lin, F.C. Lin, J.D. Lin, K.M. Lin, K.H. Lin, L.T. Lin, P.H. Lin, Q.
Lin, S. Lin, S.J. Lin, W. Lin, X. Lin, Y.X. Lin, Y.S. Lin, R. Linden, P. Lindner,
S.C. Ling, P. Lingor, A.K. Linnemann, Y.C. Liou, M.M. Lipinski, S. Lipovšek, V.A.
Lira, N. Lisiak, P.B. Liton, C. Liu, C.H. Liu, C.F. Liu, C.H. Liu, F. Liu, H.
Liu, H.S. Liu, H.F. Liu, H. Liu, J. Liu, J. Liu, J. Liu, L. Liu, L. Liu, M. Liu,
Q. Liu, W. Liu, W. Liu, X.H. Liu, X. Liu, X. Liu, X. Liu, X. Liu, Y. Liu, Y. Liu,
Y. Liu, Y. Liu, Y. Liu, J.A. Livingston, G. Lizard, J.M. Lizcano, S. Ljubojevic-Holzer,
M.E. Lleonart, D. Llobet-Navàs, A. Llorente, C.H. Lo, D. Lobato-Márquez, Q. Long,
Y.C. Long, B. Loos, J.A. Loos, M.G. López, G. López-Doménech, J.A. López-Guerrero,
A.T. López-Jiménez, Ó. López-Pérez, I. López-Valero, M.J. Lorenowicz, M. Lorente,
P. Lorincz, L. Lossi, S. Lotersztajn, P.E. Lovat, J.F. Lovell, A. Lovy, P. Lőw,
G. Lu, H. Lu, J.H. Lu, J.J. Lu, M. Lu, S. Lu, A. Luciani, J.M. Lucocq, P. Ludovico,
M.A. Luftig, M. Luhr, D. Luis-Ravelo, J.J. Lum, L. Luna-Dulcey, A.H. Lund, V.K.
Lund, J.D. Lünemann, P. Lüningschrör, H. Luo, R. Luo, S. Luo, Z. Luo, C. Luparello,
B. Lüscher, L. Luu, A. Lyakhovich, K.G. Lyamzaev, A.H. Lystad, L. Lytvynchuk,
A.C. Ma, C. Ma, M. Ma, N.F. Ma, Q.H. Ma, X. Ma, Y. Ma, Z. Ma, O.A. Macdougald,
F. Macian, G.C. Macintosh, J.P. Mackeigan, K.F. Macleod, S. Maday, F. Madeo, M.
Madesh, T. Madl, J. Madrigal-Matute, A. Maeda, Y. Maejima, M. Magarinos, P. Mahavadi,
E. Maiani, K. Maiese, P. Maiti, M.C. Maiuri, B. Majello, M.B. Major, E. Makareeva,
F. Malik, K. Mallilankaraman, W. Malorni, A. Maloyan, N. Mammadova, G.C.W. Man,
F. Manai, J.D. Mancias, E.M. Mandelkow, M.A. Mandell, A.A. Manfredi, M.H. Manjili,
R. Manjithaya, P. Manque, B.B. Manshian, R. Manzano, C. Manzoni, K. Mao, C. Marchese,
S. Marchetti, A.M. Marconi, F. Marcucci, S. Mardente, O.A. Mareninova, M. Margeta,
M. Mari, S. Marinelli, O. Marinelli, G. Mariño, S. Mariotto, R.S. Marshall, M.R.
Marten, S. Martens, A.P.J. Martin, K.R. Martin, S. Martin, S. Martin, A. Martín-Segura,
M.A. Martín-Acebes, I. Martin-Burriel, M. Martin-Rincon, P. Martin-Sanz, J.A.
Martina, W. Martinet, A. Martinez, A. Martinez, J. Martinez, M. Martinez Velazquez,
N. Martinez-Lopez, M. Martinez-Vicente, D.O. Martins, J.O. Martins, W.K. Martins,
T. Martins-Marques, E. Marzetti, S. Masaldan, C. Masclaux-Daubresse, D.G. Mashek,
V. Massa, L. Massieu, G.R. Masson, L. Masuelli, A.I. Masyuk, T.V. Masyuk, P. Matarrese,
A. Matheu, S. Matoba, S. Matsuzaki, P. Mattar, A. Matte, D. Mattoscio, J.L. Mauriz,
M. Mauthe, C. Mauvezin, E. Maverakis, P. Maycotte, J. Mayer, G. Mazzoccoli, C.
Mazzoni, J.R. Mazzulli, N. Mccarty, C. Mcdonald, M.R. Mcgill, S.L. Mckenna, B.A.
Mclaughlin, F. Mcloughlin, M.A. Mcniven, T.G. Mcwilliams, F. Mechta-Grigoriou,
T.C. Medeiros, D.L. Medina, L.A. Megeney, K. Megyeri, M. Mehrpour, J.L. Mehta,
A.J. Meijer, A.H. Meijer, J. Mejlvang, A. Meléndez, A. Melk, G. Memisoglu, A.F.
Mendes, D. Meng, F. Meng, T. Meng, R. Menna-Barreto, M.B. Menon, C. Mercer, A.E.
Mercier, J.L. Mergny, A. Merighi, S.D. Merkley, G. Merla, V. Meske, A.C. Mestre,
S.P. Metur, C. Meyer, H. Meyer, W. Mi, J. Mialet-Perez, J. Miao, L. Micale, Y.
Miki, E. Milan, M. Milczarek, D.L. Miller, S.I. Miller, S. Miller, S.W. Millward,
I. Milosevic, E.A. Minina, H. Mirzaei, H.R. Mirzaei, M. Mirzaei, A. Mishra, N.
Mishra, P.K. Mishra, M. Misirkic Marjanovic, R. Misasi, A. Misra, G. Misso, C.
Mitchell, G. Mitou, T. Miura, S. Miyamoto, M. Miyazaki, M. Miyazaki, T. Miyazaki,
K. Miyazawa, N. Mizushima, T.H. Mogensen, B. Mograbi, R. Mohammadinejad, Y. Mohamud,
A. Mohanty, S. Mohapatra, T. Möhlmann, A. Mohmmed, A. Moles, K.H. Moley, M. Molinari,
V. Mollace, A.B. Møller, B. Mollereau, F. Mollinedo, C. Montagna, M.J. Monteiro,
A. Montella, L.R. Montes, B. Montico, V.K. Mony, G. Monzio Compagnoni, M.N. Moore,
M.A. Moosavi, A.L. Mora, M. Mora, D. Morales-Alamo, R. Moratalla, P.I. Moreira,
E. Morelli, S. Moreno, D. Moreno-Blas, V. Moresi, B. Morga, A.H. Morgan, F. Morin,
H. Morishita, O.L. Moritz, M. Moriyama, Y. Moriyasu, M. Morleo, E. Morselli, J.F.
Moruno-Manchon, J. Moscat, S. Mostowy, E. Motori, A.F. Moura, N. Moustaid-Moussa,
M. Mrakovcic, G. Muciño-Hernández, A. Mukherjee, S. Mukhopadhyay, J.M. Mulcahy
Levy, V. Mulero, S. Muller, C. Münch, A. Munjal, P. Munoz-Canoves, T. Muñoz-Galdeano,
C. Münz, T. Murakawa, C. Muratori, B.M. Murphy, J.P. Murphy, A. Murthy, T.T. Myöhänen,
I.U. Mysorekar, J. Mytych, S.M. Nabavi, M. Nabissi, P. Nagy, J. Nah, A. Nahimana,
I. Nakagawa, K. Nakamura, H. Nakatogawa, S.S. Nandi, M. Nanjundan, M. Nanni, G.
Napolitano, R. Nardacci, M. Narita, M. Nassif, I. Nathan, M. Natsumeda, R.J. Naude,
C. Naumann, O. Naveiras, F. Navid, S.T. Nawrocki, T.Y. Nazarko, F. Nazio, F. Negoita,
T. Neill, A.L. Neisch, L.M. Neri, M.G. Netea, P. Neubert, T.P. Neufeld, D. Neumann,
A. Neutzner, P.T. Newton, P.A. Ney, I.P. Nezis, C.C.W. Ng, T.B. Ng, H.T.T. Nguyen,
L.T. Nguyen, H.M. Ni, C. Ní Cheallaigh, Z. Ni, M.C. Nicolao, F. Nicoli, M. Nieto-Diaz,
P. Nilsson, S. Ning, R. Niranjan, H. Nishimune, M. Niso-Santano, R.A. Nixon, A.
Nobili, C. Nobrega, T. Noda, U. Nogueira-Recalde, T.M. Nolan, I. Nombela, I. Novak,
B. Novoa, T. Nozawa, N. Nukina, C. Nussbaum-Krammer, J. Nylandsted, T.R. O’Donovan,
S.M. O’Leary, E.J. O’Rourke, M.P. O’Sullivan, T.E. O’Sullivan, S. Oddo, I. Oehme,
M. Ogawa, E. Ogier-Denis, M.H. Ogmundsdottir, B. Ogretmen, G.T. Oh, S.H. Oh, Y.J.
Oh, T. Ohama, Y. Ohashi, M. Ohmuraya, V. Oikonomou, R. Ojha, K. Okamoto, H. Okazawa,
M. Oku, S. Oliván, J.M.A. Oliveira, M. Ollmann, J.A. Olzmann, S. Omari, M.B. Omary,
G. Önal, M. Ondrej, S.B. Ong, S.G. Ong, A. Onnis, J.A. Orellana, S. Orellana-Muñoz,
M.D.M. Ortega-Villaizan, X.R. Ortiz-Gonzalez, E. Ortona, H.D. Osiewacz, A.H.K.
Osman, R. Osta, M.S. Otegui, K. Otsu, C. Ott, L. Ottobrini, J.H.J. Ou, T.F. Outeiro,
I. Oynebraten, M. Ozturk, G. Pagès, S. Pahari, M. Pajares, U.B. Pajvani, R. Pal,
S. Paladino, N. Pallet, M. Palmieri, G. Palmisano, C. Palumbo, F. Pampaloni, L.
Pan, Q. Pan, W. Pan, X. Pan, G. Panasyuk, R. Pandey, U.B. Pandey, V. Pandya, F.
Paneni, S.Y. Pang, E. Panzarini, D.L. Papademetrio, E. Papaleo, D. Papinski, D.
Papp, E.C. Park, H.T. Park, J.M. Park, J.I. Park, J.T. Park, J. Park, S.C. Park,
S.Y. Park, A.H. Parola, J.B. Parys, A. Pasquier, B. Pasquier, J.F. Passos, N.
Pastore, H.H. Patel, D. Patschan, S. Pattingre, G. Pedraza-Alva, J. Pedraza-Chaverri,
Z. Pedrozo, G. Pei, J. Pei, H. Peled-Zehavi, J.M. Pellegrini, J. Pelletier, M.A.
Peñalva, D. Peng, Y. Peng, F. Penna, M. Pennuto, F. Pentimalli, C.M.F. Pereira,
G.J.S. Pereira, L.C. Pereira, L. Pereira De Almeida, N.D. Perera, Á. Pérez-Lara,
A.B. Perez-Oliva, M.E. Pérez-Pérez, P. Periyasamy, A. Perl, C. Perrotta, I. Perrotta,
R.G. Pestell, M. Petersen, I. Petrache, G. Petrovski, T. Pfirrmann, A.S. Pfister,
J.A. Philips, H. Pi, A. Picca, A.M. Pickrell, S. Picot, G.M. Pierantoni, M. Pierdominici,
P. Pierre, V. Pierrefite-Carle, K. Pierzynowska, F. Pietrocola, M. Pietruczuk,
C. Pignata, F.X. Pimentel-Muiños, M. Pinar, R.O. Pinheiro, R. Pinkas-Kramarski,
P. Pinton, K. Pircs, S. Piya, P. Pizzo, T.S. Plantinga, H.W. Platta, A. Plaza-Zabala,
M. Plomann, E.Y. Plotnikov, H. Plun-Favreau, R. Pluta, R. Pocock, S. Pöggeler,
C. Pohl, M. Poirot, A. Poletti, M. Ponpuak, H. Popelka, B. Popova, H. Porta, S.
Porte Alcon, E. Portilla-Fernandez, M. Post, M.B. Potts, J. Poulton, T. Powers,
V. Prahlad, T.K. Prajsnar, D. Praticò, R. Prencipe, M. Priault, T. Proikas-Cezanne,
V.J. Promponas, C.G. Proud, R. Puertollano, L. Puglielli, T. Pulinilkunnil, D.
Puri, R. Puri, J. Puyal, X. Qi, Y. Qi, W. Qian, L. Qiang, Y. Qiu, J. Quadrilatero,
J. Quarleri, N. Raben, H. Rabinowich, D. Ragona, M.J. Ragusa, N. Rahimi, M. Rahmati,
V. Raia, N. Raimundo, N.S. Rajasekaran, S. Ramachandra Rao, A. Rami, I. Ramírez-Pardo,
D.B. Ramsden, F. Randow, P.N. Rangarajan, D. Ranieri, H. Rao, L. Rao, R. Rao,
S. Rathore, J.A. Ratnayaka, E.A. Ratovitski, P. Ravanan, G. Ravegnini, S.K. Ray,
B. Razani, V. Rebecca, F. Reggiori, A. Régnier-Vigouroux, A.S. Reichert, D. Reigada,
J.H. Reiling, T. Rein, S. Reipert, R.S. Rekha, H. Ren, J. Ren, W. Ren, T. Renault,
G. Renga, K. Reue, K. Rewitz, B. Ribeiro De Andrade Ramos, S.A. Riazuddin, T.M.
Ribeiro-Rodrigues, J.E. Ricci, R. Ricci, V. Riccio, D.R. Richardson, Y. Rikihisa,
M.V. Risbud, R.M. Risueño, K. Ritis, S. Rizza, R. Rizzuto, H.C. Roberts, L.D.
Roberts, K.J. Robinson, M.C. Roccheri, S. Rocchi, G.G. Rodney, T. Rodrigues, V.R.
Rodrigues Silva, A. Rodriguez, R. Rodriguez-Barrueco, N. Rodriguez-Henche, H.
Rodriguez-Rocha, J. Roelofs, R.S. Rogers, V.V. Rogov, A.I. Rojo, K. Rolka, V.
Romanello, L. Romani, A. Romano, P.S. Romano, D. Romeo-Guitart, L.C. Romero, M.
Romero, J.C. Roney, C. Rongo, S. Roperto, M.T. Rosenfeldt, P. Rosenstiel, A.G.
Rosenwald, K.A. Roth, L. Roth, S. Roth, K.M.A. Rouschop, B.D. Roussel, S. Roux,
P. Rovere-Querini, A. Roy, A. Rozieres, D. Ruano, D.C. Rubinsztein, M.P. Rubtsova,
K. Ruckdeschel, C. Ruckenstuhl, E. Rudolf, R. Rudolf, A. Ruggieri, A.A. Ruparelia,
P. Rusmini, R.R. Russell, G.L. Russo, M. Russo, R. Russo, O.O. Ryabaya, K.M. Ryan,
K.Y. Ryu, M. Sabater-Arcis, U. Sachdev, M. Sacher, C. Sachse, A. Sadhu, J. Sadoshima,
N. Safren, P. Saftig, A.P. Sagona, G. Sahay, A. Sahebkar, M. Sahin, O. Sahin,
S. Sahni, N. Saito, S. Saito, T. Saito, R. Sakai, Y. Sakai, J.I. Sakamaki, K.
Saksela, G. Salazar, A. Salazar-Degracia, G.H. Salekdeh, A.K. Saluja, B. Sampaio-Marques,
M.C. Sanchez, J.A. Sanchez-Alcazar, V. Sanchez-Vera, V. Sancho-Shimizu, J.T. Sanderson,
M. Sandri, S. Santaguida, L. Santambrogio, M.M. Santana, G. Santoni, A. Sanz,
P. Sanz, S. Saran, M. Sardiello, T.J. Sargeant, A. Sarin, C. Sarkar, S. Sarkar,
M.R. Sarrias, S. Sarkar, D.T. Sarmah, J. Sarparanta, A. Sathyanarayan, R. Sathyanarayanan,
K.M. Scaglione, F. Scatozza, L. Schaefer, Z.T. Schafer, U.E. Schaible, A.H.V.
Schapira, M. Scharl, H.M. Schatzl, C.H. Schein, W. Scheper, D. Scheuring, M.V.
Schiaffino, M. Schiappacassi, R. Schindl, U. Schlattner, O. Schmidt, R. Schmitt,
S.D. Schmidt, I. Schmitz, E. Schmukler, A. Schneider, B.E. Schneider, R. Schober,
A.C. Schoijet, M.B. Schott, M. Schramm, B. Schröder, K. Schuh, C. Schüller, R.J.
Schulze, L. Schürmanns, J.C. Schwamborn, M. Schwarten, F. Scialo, S. Sciarretta,
M.J. Scott, K.W. Scotto, A.I. Scovassi, A. Scrima, A. Scrivo, D. Sebastian, S.
Sebti, S. Sedej, L. Segatori, N. Segev, P.O. Seglen, I. Seiliez, E. Seki, S.B.
Selleck, F.W. Sellke, J.T. Selsby, M. Sendtner, S. Senturk, E. Seranova, C. Sergi,
R. Serra-Moreno, H. Sesaki, C. Settembre, S.R.G. Setty, G. Sgarbi, O. Sha, J.J.
Shacka, J.A. Shah, D. Shang, C. Shao, F. Shao, S. Sharbati, L.M. Sharkey, D. Sharma,
G. Sharma, K. Sharma, P. Sharma, S. Sharma, H.M. Shen, H. Shen, J. Shen, M. Shen,
W. Shen, Z. Shen, R. Sheng, Z. Sheng, Z.H. Sheng, J. Shi, X. Shi, Y.H. Shi, K.
Shiba-Fukushima, J.J. Shieh, Y. Shimada, S. Shimizu, M. Shimozawa, T. Shintani,
C.J. Shoemaker, S. Shojaei, I. Shoji, B.V. Shravage, V. Shridhar, C.W. Shu, H.B.
Shu, K. Shui, A.K. Shukla, T.E. Shutt, V. Sica, A. Siddiqui, A. Sierra, V. Sierra-Torre,
S. Signorelli, P. Sil, B.J.D.A. Silva, J.D. Silva, E. Silva-Pavez, S. Silvente-Poirot,
R.E. Simmonds, A.K. Simon, H.U. Simon, M. Simons, A. Singh, L.P. Singh, R. Singh,
S.V. Singh, S.K. Singh, S.B. Singh, S. Singh, S.P. Singh, D. Sinha, R.A. Sinha,
S. Sinha, A. Sirko, K. Sirohi, E.L. Sivridis, P. Skendros, A. Skirycz, I. Slaninová,
S.S. Smaili, A. Smertenko, M.D. Smith, S.J. Soenen, E.J. Sohn, S.P.M. Sok, G.
Solaini, T. Soldati, S.A. Soleimanpour, R.M. Soler, A. Solovchenko, J.A. Somarelli,
A. Sonawane, F. Song, H.K. Song, J.X. Song, K. Song, Z. Song, L.R. Soria, M. Sorice,
A.A. Soukas, S.F. Soukup, D. Sousa, N. Sousa, P.A. Spagnuolo, S.A. Spector, M.M.
Srinivas Bharath, D. St. Clair, V. Stagni, L. Staiano, C.A. Stalnecker, M.V. Stankov,
P.B. Stathopulos, K. Stefan, S.M. Stefan, L. Stefanis, J.S. Steffan, A. Steinkasserer,
H. Stenmark, J. Sterneckert, C. Stevens, V. Stoka, S. Storch, B. Stork, F. Strappazzon,
A.M. Strohecker, D.G. Stupack, H. Su, L.Y. Su, L. Su, A.M. Suarez-Fontes, C.S.
Subauste, S. Subbian, P.V. Subirada, G. Sudhandiran, C.M. Sue, X. Sui, C. Summers,
G. Sun, J. Sun, K. Sun, M.X. Sun, Q. Sun, Y. Sun, Z. Sun, K.K.S. Sunahara, E.
Sundberg, K. Susztak, P. Sutovsky, H. Suzuki, G. Sweeney, J.D. Symons, S.C.W.
Sze, N.J. Szewczyk, A. Tabęcka-Łonczynska, C. Tabolacci, F. Tacke, H. Taegtmeyer,
M. Tafani, M. Tagaya, H. Tai, S.W.G. Tait, Y. Takahashi, S. Takats, P. Talwar,
C. Tam, S.Y. Tam, D. Tampellini, A. Tamura, C.T. Tan, E.K. Tan, Y.Q. Tan, M. Tanaka,
M. Tanaka, D. Tang, J. Tang, T.S. Tang, I. Tanida, Z. Tao, M. Taouis, L. Tatenhorst,
N. Tavernarakis, A. Taylor, G.A. Taylor, J.M. Taylor, E. Tchetina, A.R. Tee, I.
Tegeder, D. Teis, N. Teixeira, F. Teixeira-Clerc, K.A. Tekirdag, T. Tencomnao,
S. Tenreiro, A.V. Tepikin, P.S. Testillano, G. Tettamanti, P.L. Tharaux, K. Thedieck,
A.A. Thekkinghat, S. Thellung, J.W. Thinwa, V.P. Thirumalaikumar, S.M. Thomas,
P.G. Thomes, A. Thorburn, L. Thukral, T. Thum, M. Thumm, L. Tian, A. Tichy, A.
Till, V. Timmerman, V.I. Titorenko, S.V. Todi, K. Todorova, J.M. Toivonen, L.
Tomaipitinca, D. Tomar, C. Tomas-Zapico, S. Tomić, B.C.K. Tong, C. Tong, X. Tong,
S.A. Tooze, M.L. Torgersen, S. Torii, L. Torres-López, A. Torriglia, C.G. Towers,
R. Towns, S. Toyokuni, V. Trajkovic, D. Tramontano, Q.G. Tran, L.H. Travassos,
C.B. Trelford, S. Tremel, I.P. Trougakos, B.P. Tsao, M.P. Tschan, H.F. Tse, T.F.
Tse, H. Tsugawa, A.S. Tsvetkov, D.A. Tumbarello, Y. Tumtas, M.J. Tuñón, S. Turcotte,
B. Turk, V. Turk, B.J. Turner, R.I. Tuxworth, J.K. Tyler, E.V. Tyutereva, Y. Uchiyama,
A. Ugun-Klusek, H.H. Uhlig, M. Ułamek-Kozioł, I.V. Ulasov, M. Umekawa, C. Ungermann,
R. Unno, S. Urbe, E. Uribe-Carretero, S. Üstün, V.N. Uversky, T. Vaccari, M.I.
Vaccaro, B.F. Vahsen, H. Vakifahmetoglu-Norberg, R. Valdor, M.J. Valente, A. Valko,
R.B. Vallee, A.M. Valverde, G. Van Den Berghe, S. Van Der Veen, L. Van Kaer, J.
Van Loosdregt, S.J.L. Van Wijk, W. Vandenberghe, I. Vanhorebeek, M.A. Vannier-Santos,
N. Vannini, M.C. Vanrell, C. Vantaggiato, G. Varano, I. Varela-Nieto, M. Varga,
M.H. Vasconcelos, S. Vats, D.G. Vavvas, I. Vega-Naredo, S. Vega-Rubin-De-Celis,
G. Velasco, A.P. Velázquez, T. Vellai, E. Vellenga, F. Velotti, M. Verdier, P.
Verginis, I. Vergne, P. Verkade, M. Verma, P. Verstreken, T. Vervliet, J. Vervoorts,
A.T. Vessoni, V.M. Victor, M. Vidal, C. Vidoni, O.V. Vieira, R.D. Vierstra, S.
Viganó, H. Vihinen, V. Vijayan, M. Vila, M. Vilar, J.M. Villalba, A. Villalobo,
B. Villarejo-Zori, F. Villarroya, J. Villarroya, O. Vincent, C. Vindis, C. Viret,
M.T. Viscomi, D. Visnjic, I. Vitale, D.J. Vocadlo, O.V. Voitsekhovskaja, C. Volonté,
M. Volta, M. Vomero, C. Von Haefen, M.A. Vooijs, W. Voos, L. Vucicevic, R. Wade-Martins,
S. Waguri, K.A. Waite, S. Wakatsuki, D.W. Walker, M.J. Walker, S.A. Walker, J.
Walter, F.G. Wandosell, B. Wang, C.Y. Wang, C. Wang, C. Wang, C. Wang, C.Y. Wang,
D. Wang, F. Wang, F. Wang, F. Wang, G. Wang, H. Wang, H. Wang, H. Wang, H.G. Wang,
J. Wang, J. Wang, J. Wang, J. Wang, K. Wang, L. Wang, L. Wang, M.H. Wang, M. Wang,
N. Wang, P. Wang, P. Wang, P. Wang, P. Wang, Q.J. Wang, Q. Wang, Q.K. Wang, Q.A.
Wang, W.T. Wang, W. Wang, X. Wang, X. Wang, Y. Wang, Y. Wang, Y. Wang, Y.Y. Wang,
Y. Wang, Y. Wang, Y. Wang, Y. Wang, Z. Wang, Z. Wang, Z. Wang, G. Warnes, V. Warnsmann,
H. Watada, E. Watanabe, M. Watchon, A. Wawrzyńska, T.E. Weaver, G. Wegrzyn, A.M.
Wehman, H. Wei, L. Wei, T. Wei, Y. Wei, O.H. Weiergräber, C.C. Weihl, G. Weindl,
R. Weiskirchen, A. Wells, R.H. Wen, X. Wen, A. Werner, B. Weykopf, S.P. Wheatley,
J.L. Whitton, A.J. Whitworth, K. Wiktorska, M.E. Wildenberg, T. Wileman, S. Wilkinson,
D. Willbold, B. Williams, R.S.B. Williams, R.L. Williams, P.R. Williamson, R.A.
Wilson, B. Winner, N.J. Winsor, S.S. Witkin, H. Wodrich, U. Woehlbier, T. Wollert,
E. Wong, J.H. Wong, R.W. Wong, V.K.W. Wong, W.W.L. Wong, A.G. Wu, C. Wu, J. Wu,
J. Wu, K.K. Wu, M. Wu, S.Y. Wu, S. Wu, S.Y. Wu, S. Wu, W.K.K. Wu, X. Wu, X. Wu,
Y.W. Wu, Y. Wu, R.J. Xavier, H. Xia, L. Xia, Z. Xia, G. Xiang, J. Xiang, M. Xiang,
W. Xiang, B. Xiao, G. Xiao, H. Xiao, H.T. Xiao, J. Xiao, L. Xiao, S. Xiao, Y.
Xiao, B. Xie, C.M. Xie, M. Xie, Y. Xie, Z. Xie, Z. Xie, M. Xilouri, C. Xu, E.
Xu, H. Xu, J. Xu, J.R. Xu, L. Xu, W.W. Xu, X. Xu, Y. Xue, S.M.S. Yakhine-Diop,
M. Yamaguchi, O. Yamaguchi, A. Yamamoto, S. Yamashina, S. Yan, S.J. Yan, Z. Yan,
Y. Yanagi, C. Yang, D.S. Yang, H. Yang, H.T. Yang, H. Yang, J.M. Yang, J. Yang,
J. Yang, L. Yang, L. Yang, M. Yang, P.M. Yang, Q. Yang, S. Yang, S. Yang, S.F.
Yang, W. Yang, W.Y. Yang, X. Yang, X. Yang, Y. Yang, Y. Yang, H. Yao, S. Yao,
X. Yao, Y.G. Yao, Y.M. Yao, T. Yasui, M. Yazdankhah, P.M. Yen, C. Yi, X.M. Yin,
Y. Yin, Z. Yin, Z. Yin, M. Ying, Z. Ying, C.K. Yip, S.P.T. Yiu, Y.H. Yoo, K. Yoshida,
S.R. Yoshii, T. Yoshimori, B. Yousefi, B. Yu, H. Yu, J. Yu, J. Yu, L. Yu, M.L.
Yu, S.W. Yu, V.C. Yu, W.H. Yu, Z. Yu, Z. Yu, J. Yuan, L.Q. Yuan, S. Yuan, S.S.F.
Yuan, Y. Yuan, Z. Yuan, J. Yue, Z. Yue, J. Yun, R.L. Yung, D.N. Zacks, G. Zaffagnini,
V.O. Zambelli, I. Zanella, Q.S. Zang, S. Zanivan, S. Zappavigna, P. Zaragoza,
K.S. Zarbalis, A. Zarebkohan, A. Zarrouk, S.O. Zeitlin, J. Zeng, J.D. Zeng, E.
Žerovnik, L. Zhan, B. Zhang, D.D. Zhang, H. Zhang, H. Zhang, H. Zhang, H. Zhang,
H. Zhang, H. Zhang, H. Zhang, H.L. Zhang, J. Zhang, J. Zhang, J.P. Zhang, K.Y.B.
Zhang, L.W. Zhang, L. Zhang, L. Zhang, L. Zhang, L. Zhang, M. Zhang, P. Zhang,
S. Zhang, W. Zhang, X. Zhang, X.W. Zhang, X. Zhang, X. Zhang, X. Zhang, X. Zhang,
X.D. Zhang, Y. Zhang, Y. Zhang, Y. Zhang, Y.D. Zhang, Y. Zhang, Y.Y. Zhang, Y.
Zhang, Z. Zhang, Z. Zhang, Z. Zhang, Z. Zhang, Z. Zhang, Z. Zhang, H. Zhao, L.
Zhao, S. Zhao, T. Zhao, X.F. Zhao, Y. Zhao, Y. Zhao, Y. Zhao, Y. Zhao, G. Zheng,
K. Zheng, L. Zheng, S. Zheng, X.L. Zheng, Y. Zheng, Z.G. Zheng, B. Zhivotovsky,
Q. Zhong, A. Zhou, B. Zhou, C. Zhou, G. Zhou, H. Zhou, H. Zhou, H. Zhou, J. Zhou,
J. Zhou, J. Zhou, J. Zhou, K. Zhou, R. Zhou, X.J. Zhou, Y. Zhou, Y. Zhou, Y. Zhou,
Z.Y. Zhou, Z. Zhou, B. Zhu, C. Zhu, G.Q. Zhu, H. Zhu, H. Zhu, H. Zhu, W.G. Zhu,
Y. Zhu, Y. Zhu, H. Zhuang, X. Zhuang, K. Zientara-Rytter, C.M. Zimmermann, E.
Ziviani, T. Zoladek, W.X. Zong, D.B. Zorov, A. Zorzano, W. Zou, Z. Zou, Z. Zou,
S. Zuryn, W. Zwerschke, B. Brand-Saberi, X.C. Dong, C.S. Kenchappa, Z. Li, Y.
Lin, S. Oshima, Y. Rong, J.C. Sluimer, C.L. Stallings, C.K. Tong, Autophagy 17
(2021) 1–382.
date_created: 2021-03-28T22:01:44Z
date_published: 2021-02-08T00:00:00Z
date_updated: 2023-10-16T09:43:56Z
day: '08'
department:
- _id: JiFr
- _id: CaHe
doi: 10.1080/15548627.2020.1797280
external_id:
isi:
- '000636121800001'
pmid:
- '33634751'
intvolume: ' 17'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1080/15548627.2020.1797280
month: '02'
oa: 1
oa_version: Published Version
page: 1-382
pmid: 1
publication: Autophagy
publication_identifier:
eissn:
- 1554-8635
issn:
- 1554-8627
publication_status: published
publisher: Taylor & Francis
quality_controlled: '1'
scopus_import: '1'
status: public
title: Guidelines for the use and interpretation of assays for monitoring autophagy
(4th edition)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 17
year: '2021'
...
---
_id: '8742'
abstract:
- lang: eng
text: We develop a version of Ekedahl’s geometric sieve for integral quadratic forms
of rank at least five. As one ranges over the zeros of such quadratic forms, we
use the sieve to compute the density of coprime values of polynomials, and furthermore,
to address a question about local solubility in families of varieties parameterised
by the zeros.
article_processing_charge: No
article_type: original
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. The geometric sieve for quadrics. Forum Mathematicum.
2021;33(1):147-165. doi:10.1515/forum-2020-0074
apa: Browning, T. D., & Heath-Brown, R. (2021). The geometric sieve for quadrics.
Forum Mathematicum. De Gruyter. https://doi.org/10.1515/forum-2020-0074
chicago: Browning, Timothy D, and Roger Heath-Brown. “The Geometric Sieve for Quadrics.”
Forum Mathematicum. De Gruyter, 2021. https://doi.org/10.1515/forum-2020-0074.
ieee: T. D. Browning and R. Heath-Brown, “The geometric sieve for quadrics,” Forum
Mathematicum, vol. 33, no. 1. De Gruyter, pp. 147–165, 2021.
ista: Browning TD, Heath-Brown R. 2021. The geometric sieve for quadrics. Forum
Mathematicum. 33(1), 147–165.
mla: Browning, Timothy D., and Roger Heath-Brown. “The Geometric Sieve for Quadrics.”
Forum Mathematicum, vol. 33, no. 1, De Gruyter, 2021, pp. 147–65, doi:10.1515/forum-2020-0074.
short: T.D. Browning, R. Heath-Brown, Forum Mathematicum 33 (2021) 147–165.
date_created: 2020-11-08T23:01:25Z
date_published: 2021-01-01T00:00:00Z
date_updated: 2023-10-17T07:39:01Z
day: '01'
department:
- _id: TiBr
doi: 10.1515/forum-2020-0074
external_id:
arxiv:
- '2003.09593'
isi:
- '000604750900008'
intvolume: ' 33'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2003.09593
month: '01'
oa: 1
oa_version: Preprint
page: 147-165
project:
- _id: 26AEDAB2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P32428
name: New frontiers of the Manin conjecture
publication: Forum Mathematicum
publication_identifier:
eissn:
- 1435-5337
issn:
- 0933-7741
publication_status: published
publisher: De Gruyter
quality_controlled: '1'
scopus_import: '1'
status: public
title: The geometric sieve for quadrics
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 33
year: '2021'
...
---
_id: '10035'
abstract:
- lang: eng
text: 'Many security definitions come in two flavors: a stronger “adaptive” flavor,
where the adversary can arbitrarily make various choices during the course of
the attack, and a weaker “selective” flavor where the adversary must commit to
some or all of their choices a-priori. For example, in the context of identity-based
encryption, selective security requires the adversary to decide on the identity
of the attacked party at the very beginning of the game whereas adaptive security
allows the attacker to first see the master public key and some secret keys before
making this choice. Often, it appears to be much easier to achieve selective security
than it is to achieve adaptive security. A series of several recent works shows
how to cleverly achieve adaptive security in several such scenarios including
generalized selective decryption [Pan07][FJP15], constrained PRFs [FKPR14], and
Yao’s garbled circuits [JW16]. Although the above works expressed vague intuition
that they share a common technique, the connection was never made precise. In
this work we present a new framework (published at Crypto ’17 [JKK+17a]) that
connects all of these works and allows us to present them in a unified and simplified
fashion. Having the framework in place, we show how to achieve adaptive security
for proxy re-encryption schemes (published at PKC ’19 [FKKP19]) and provide the
first adaptive security proofs for continuous group key agreement protocols (published
at S&P ’21 [KPW+21]). Questioning optimality of our framework, we then show that
currently used proof techniques cannot lead to significantly better security guarantees
for "graph-building" games (published at TCC ’21 [KKPW21a]). These games cover
generalized selective decryption, as well as the security of prominent constructions
for constrained PRFs, continuous group key agreement, and proxy re-encryption.
Finally, we revisit the adaptive security of Yao’s garbled circuits and extend
the analysis of Jafargholi and Wichs in two directions: While they prove adaptive
security only for a modified construction with increased online complexity, we
provide the first positive results for the original construction by Yao (published
at TCC ’21 [KKP21a]). On the negative side, we prove that the results of Jafargholi
and Wichs are essentially optimal by showing that no black-box reduction can provide
a significantly better security bound (published at Crypto ’21 [KKPW21c]).'
acknowledgement: "I want to acknowledge the funding by the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme
(682815 - TOCNeT).\r\n"
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Karen
full_name: Klein, Karen
id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87
last_name: Klein
citation:
ama: Klein K. On the adaptive security of graph-based games. 2021. doi:10.15479/at:ista:10035
apa: Klein, K. (2021). On the adaptive security of graph-based games. Institute
of Science and Technology Austria. https://doi.org/10.15479/at:ista:10035
chicago: Klein, Karen. “On the Adaptive Security of Graph-Based Games.” Institute
of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10035.
ieee: K. Klein, “On the adaptive security of graph-based games,” Institute of Science
and Technology Austria, 2021.
ista: Klein K. 2021. On the adaptive security of graph-based games. Institute of
Science and Technology Austria.
mla: Klein, Karen. On the Adaptive Security of Graph-Based Games. Institute
of Science and Technology Austria, 2021, doi:10.15479/at:ista:10035.
short: K. Klein, On the Adaptive Security of Graph-Based Games, Institute of Science
and Technology Austria, 2021.
date_created: 2021-09-23T07:31:44Z
date_published: 2021-09-23T00:00:00Z
date_updated: 2023-10-17T09:24:07Z
day: '23'
ddc:
- '519'
degree_awarded: PhD
department:
- _id: GradSch
- _id: KrPi
doi: 10.15479/at:ista:10035
ec_funded: 1
file:
- access_level: open_access
checksum: 73a44345c683e81f3e765efbf86fdcc5
content_type: application/pdf
creator: cchlebak
date_created: 2021-10-04T12:22:33Z
date_updated: 2021-10-04T12:22:33Z
file_id: '10082'
file_name: thesis_pdfa.pdf
file_size: 2104726
relation: main_file
success: 1
- access_level: closed
checksum: 7b80df30a0e686c3ef6a56d4e1c59e29
content_type: application/x-zip-compressed
creator: cchlebak
date_created: 2021-10-05T07:04:37Z
date_updated: 2022-03-10T12:15:18Z
file_id: '10085'
file_name: thesis_final (1).zip
file_size: 9538359
relation: source_file
file_date_updated: 2022-03-10T12:15:18Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '276'
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '10044'
relation: part_of_dissertation
status: public
- id: '10049'
relation: part_of_dissertation
status: public
- id: '637'
relation: part_of_dissertation
status: public
- id: '10041'
relation: part_of_dissertation
status: public
- id: '6430'
relation: part_of_dissertation
status: public
- id: '10048'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
title: On the adaptive security of graph-based games
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: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2021'
...
---
_id: '10410'
abstract:
- lang: eng
text: The security of cryptographic primitives and protocols against adversaries
that are allowed to make adaptive choices (e.g., which parties to corrupt or which
queries to make) is notoriously difficult to establish. A broad theoretical framework
was introduced by Jafargholi et al. [Crypto’17] for this purpose. In this paper
we initiate the study of lower bounds on loss in adaptive security for certain
cryptographic protocols considered in the framework. We prove lower bounds that
almost match the upper bounds (proven using the framework) for proxy re-encryption,
prefix-constrained PRFs and generalized selective decryption, a security game
that captures the security of certain group messaging and broadcast encryption
schemes. Those primitives have in common that their security game involves an
underlying graph that can be adaptively built by the adversary. Some of our lower
bounds only apply to a restricted class of black-box reductions which we term
“oblivious” (the existing upper bounds are of this restricted type), some apply
to the broader but still restricted class of non-rewinding reductions, while our
lower bound for proxy re-encryption applies to all black-box reductions. The fact
that some of our lower bounds seem to crucially rely on obliviousness or at least
a non-rewinding reduction hints to the exciting possibility that the existing
upper bounds can be improved by using more sophisticated reductions. Our main
conceptual contribution is a two-player multi-stage game called the Builder-Pebbler
Game. We can translate bounds on the winning probabilities for various instantiations
of this game into cryptographic lower bounds for the above-mentioned primitives
using oracle separation techniques.
acknowledgement: C. Kamath—Supported by Azrieli International Postdoctoral Fellowship.
Most of the work was done while the author was at Northeastern University and Charles
University, funded by the IARPA grant IARPA/2019-19-020700009 and project PRIMUS/17/SCI/9,
respectively. K. Klein—Supported in part by ERC CoG grant 724307. Most of the work
was done while the author was at IST Austria funded by the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme
(682815 - TOCNeT). K. Pietrzak—Funded by the European Research Council (ERC) under
the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT).
alternative_title:
- LNCS
article_processing_charge: No
author:
- 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: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Michael
full_name: Walter, Michael
id: 488F98B0-F248-11E8-B48F-1D18A9856A87
last_name: Walter
orcid: 0000-0003-3186-2482
citation:
ama: 'Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. The cost of adaptivity in
security games on graphs. In: 19th International Conference. Vol 13043.
Springer Nature; 2021:550-581. doi:10.1007/978-3-030-90453-1_19'
apa: 'Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., & Walter, M. (2021). The
cost of adaptivity in security games on graphs. In 19th International Conference
(Vol. 13043, pp. 550–581). Raleigh, NC, United States: Springer Nature. https://doi.org/10.1007/978-3-030-90453-1_19'
chicago: Kamath Hosdurg, Chethan, Karen Klein, Krzysztof Z Pietrzak, and Michael
Walter. “The Cost of Adaptivity in Security Games on Graphs.” In 19th International
Conference, 13043:550–81. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-90453-1_19.
ieee: C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and M. Walter, “The cost of adaptivity
in security games on graphs,” in 19th International Conference, Raleigh,
NC, United States, 2021, vol. 13043, pp. 550–581.
ista: 'Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. 2021. The cost of adaptivity
in security games on graphs. 19th International Conference. TCC: Theory of Cryptography,
LNCS, vol. 13043, 550–581.'
mla: Kamath Hosdurg, Chethan, et al. “The Cost of Adaptivity in Security Games on
Graphs.” 19th International Conference, vol. 13043, Springer Nature, 2021,
pp. 550–81, doi:10.1007/978-3-030-90453-1_19.
short: C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, M. Walter, in:, 19th International
Conference, Springer Nature, 2021, pp. 550–581.
conference:
end_date: 2021-11-11
location: Raleigh, NC, United States
name: 'TCC: Theory of Cryptography'
start_date: 2021-11-08
date_created: 2021-12-05T23:01:43Z
date_published: 2021-11-04T00:00:00Z
date_updated: 2023-10-17T09:24:07Z
day: '04'
department:
- _id: KrPi
doi: 10.1007/978-3-030-90453-1_19
ec_funded: 1
external_id:
isi:
- '000728364000019'
intvolume: ' 13043'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://ia.cr/2021/059
month: '11'
oa: 1
oa_version: Preprint
page: 550-581
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: 19th International Conference
publication_identifier:
eissn:
- 1611-3349
isbn:
- 9-783-0309-0452-4
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '10048'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: The cost of adaptivity in security games on graphs
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 13043
year: '2021'
...
---
_id: '10048'
abstract:
- lang: eng
text: "The security of cryptographic primitives and protocols against adversaries
that are allowed to make adaptive choices (e.g., which parties to corrupt or which
queries to make) is notoriously difficult to establish. A broad theoretical\r\nframework
was introduced by Jafargholi et al. [Crypto’17] for this purpose. In this paper
we initiate the study of lower bounds on loss in adaptive security for certain
cryptographic protocols considered in the framework. We prove lower\r\nbounds
that almost match the upper bounds (proven using the framework) for proxy re-encryption,
prefix-constrained PRFs and generalized selective decryption, a security game
that captures the security of certain group messaging and\r\nbroadcast encryption
schemes. Those primitives have in common that their security game involves an
underlying graph that can be adaptively built by the adversary. Some of our lower
bounds only apply to a restricted class of black-box reductions which we term
“oblivious” (the existing upper bounds are of this restricted type), some apply
to the broader but still restricted class of non-rewinding reductions, while our
lower bound for proxy re-encryption applies to all black-box reductions. The fact
that some of our lower bounds seem to crucially rely on obliviousness or at least
a non-rewinding reduction hints to the exciting possibility that the existing
upper bounds can be improved by using more sophisticated reductions. Our main
conceptual contribution is a two-player multi-stage game called the Builder-Pebbler
Game. We can translate bounds on the winning probabilities for various instantiations
of this game into cryptographic lower bounds for the above-mentioned primitives
using oracle separation techniques.\r\n"
article_processing_charge: No
author:
- 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: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Michael
full_name: Walter, Michael
id: 488F98B0-F248-11E8-B48F-1D18A9856A87
last_name: Walter
orcid: 0000-0003-3186-2482
citation:
ama: 'Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. The cost of adaptivity in
security games on graphs. In: 19th Theory of Cryptography Conference 2021.
International Association for Cryptologic Research; 2021.'
apa: 'Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., & Walter, M. (2021). The
cost of adaptivity in security games on graphs. In 19th Theory of Cryptography
Conference 2021. Raleigh, NC, United States: International Association for
Cryptologic Research.'
chicago: Kamath Hosdurg, Chethan, Karen Klein, Krzysztof Z Pietrzak, and Michael
Walter. “The Cost of Adaptivity in Security Games on Graphs.” In 19th Theory
of Cryptography Conference 2021. International Association for Cryptologic
Research, 2021.
ieee: C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and M. Walter, “The cost of adaptivity
in security games on graphs,” in 19th Theory of Cryptography Conference 2021,
Raleigh, NC, United States, 2021.
ista: 'Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. 2021. The cost of adaptivity
in security games on graphs. 19th Theory of Cryptography Conference 2021. TCC:
Theory of Cryptography Conference.'
mla: Kamath Hosdurg, Chethan, et al. “The Cost of Adaptivity in Security Games on
Graphs.” 19th Theory of Cryptography Conference 2021, International Association
for Cryptologic Research, 2021.
short: C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, M. Walter, in:, 19th Theory of
Cryptography Conference 2021, International Association for Cryptologic Research,
2021.
conference:
end_date: 2021-11-11
location: Raleigh, NC, United States
name: 'TCC: Theory of Cryptography Conference'
start_date: 2021-11-08
date_created: 2021-09-27T12:52:05Z
date_published: 2021-07-08T00:00:00Z
date_updated: 2023-10-17T09:24:08Z
day: '08'
department:
- _id: KrPi
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://ia.cr/2021/059
month: '07'
oa: 1
oa_version: Preprint
publication: 19th Theory of Cryptography Conference 2021
publication_status: published
publisher: International Association for Cryptologic Research
quality_controlled: '1'
related_material:
record:
- id: '10410'
relation: later_version
status: public
- id: '10035'
relation: dissertation_contains
status: public
status: public
title: The cost of adaptivity in security games on graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10738'
abstract:
- lang: eng
text: We prove an adiabatic theorem for the Landau–Pekar equations. This allows
us to derive new results on the accuracy of their use as effective equations for
the time evolution generated by the Fröhlich Hamiltonian with large coupling constant
α. In particular, we show that the time evolution of Pekar product states with
coherent phonon field and the electron being trapped by the phonons is well approximated
by the Landau–Pekar equations until times short compared to α2.
acknowledgement: "N. L. and R. S. gratefully acknowledge financial support by the
European Research Council\r\n(ERC) under the European Union’s Horizon 2020 research
and innovation programme (grant\r\nagreement No 694227). B. S. acknowledges support
from the Swiss National Science Foundation (grant 200020_172623) and from the NCCR
SwissMAP. N. L. would like to thank\r\nAndreas Deuchert and David Mitrouskas for
interesting discussions. B. S. and R. S. would\r\nlike to thank Rupert Frank for
stimulating discussions about the time-evolution of a polaron.\r\n"
article_processing_charge: No
article_type: original
author:
- first_name: Nikolai K
full_name: Leopold, Nikolai K
id: 4BC40BEC-F248-11E8-B48F-1D18A9856A87
last_name: Leopold
orcid: 0000-0002-0495-6822
- first_name: Simone Anna Elvira
full_name: Rademacher, Simone Anna Elvira
id: 856966FE-A408-11E9-977E-802DE6697425
last_name: Rademacher
orcid: 0000-0001-5059-4466
- 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: 'Leopold NK, Rademacher SAE, Schlein B, Seiringer R. The Landau–Pekar equations:
Adiabatic theorem and accuracy. Analysis and PDE. 2021;14(7):2079-2100.
doi:10.2140/APDE.2021.14.2079'
apa: 'Leopold, N. K., Rademacher, S. A. E., Schlein, B., & Seiringer, R. (2021). The
Landau–Pekar equations: Adiabatic theorem and accuracy. Analysis and PDE.
Mathematical Sciences Publishers. https://doi.org/10.2140/APDE.2021.14.2079'
chicago: 'Leopold, Nikolai K, Simone Anna Elvira Rademacher, Benjamin Schlein, and
Robert Seiringer. “ The Landau–Pekar Equations: Adiabatic Theorem and Accuracy.”
Analysis and PDE. Mathematical Sciences Publishers, 2021. https://doi.org/10.2140/APDE.2021.14.2079.'
ieee: 'N. K. Leopold, S. A. E. Rademacher, B. Schlein, and R. Seiringer, “ The Landau–Pekar
equations: Adiabatic theorem and accuracy,” Analysis and PDE, vol. 14,
no. 7. Mathematical Sciences Publishers, pp. 2079–2100, 2021.'
ista: 'Leopold NK, Rademacher SAE, Schlein B, Seiringer R. 2021. The Landau–Pekar
equations: Adiabatic theorem and accuracy. Analysis and PDE. 14(7), 2079–2100.'
mla: 'Leopold, Nikolai K., et al. “ The Landau–Pekar Equations: Adiabatic Theorem
and Accuracy.” Analysis and PDE, vol. 14, no. 7, Mathematical Sciences
Publishers, 2021, pp. 2079–100, doi:10.2140/APDE.2021.14.2079.'
short: N.K. Leopold, S.A.E. Rademacher, B. Schlein, R. Seiringer, Analysis and PDE
14 (2021) 2079–2100.
date_created: 2022-02-06T23:01:33Z
date_published: 2021-11-10T00:00:00Z
date_updated: 2023-10-17T11:26:45Z
day: '10'
department:
- _id: RoSe
doi: 10.2140/APDE.2021.14.2079
ec_funded: 1
external_id:
arxiv:
- '1904.12532'
isi:
- '000733976600004'
intvolume: ' 14'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1904.12532
month: '11'
oa: 1
oa_version: Preprint
page: 2079-2100
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: Analysis and PDE
publication_identifier:
eissn:
- 1948-206X
issn:
- 2157-5045
publication_status: published
publisher: Mathematical Sciences Publishers
quality_controlled: '1'
scopus_import: '1'
status: public
title: ' The Landau–Pekar equations: Adiabatic theorem and accuracy'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 14
year: '2021'
...
---
_id: '10429'
abstract:
- lang: eng
text: "The scalability of concurrent data structures and distributed algorithms
strongly depends on\r\nreducing the contention for shared resources and the costs
of synchronization and communication. We show how such cost reductions can be
attained by relaxing the strict consistency conditions required by sequential
implementations. In the first part of the thesis, we consider relaxation in the
context of concurrent data structures. Specifically, in data structures \r\nsuch
as priority queues, imposing strong semantics renders scalability impossible,
since a correct implementation of the remove operation should return only the
element with highest priority. Intuitively, attempting to invoke remove operations
concurrently creates a race condition. This bottleneck can be circumvented by
relaxing semantics of the affected data structure, thus allowing removal of the
elements which are no longer required to have the highest priority. We prove that
the randomized implementations of relaxed data structures provide provable guarantees
on the priority of the removed elements even under concurrency. Additionally,
we show that in some cases the relaxed data structures can be used to scale the
classical algorithms which are usually implemented with the exact ones. In the
second part, we study parallel variants of the stochastic gradient descent (SGD)
algorithm, which distribute computation among the multiple processors, thus reducing
the running time. Unfortunately, in order for standard parallel SGD to succeed,
each processor has to maintain a local copy of the necessary model parameter,
which is identical to the local copies of other processors; the overheads from
this perfect consistency in terms of communication and synchronization can negate
the speedup gained by distributing the computation. We show that the consistency
conditions required by SGD can be relaxed, allowing the algorithm to be more
flexible in terms of tolerating quantized communication, asynchrony, or even crash
faults, while its convergence remains asymptotically the same."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Giorgi
full_name: Nadiradze, Giorgi
id: 3279A00C-F248-11E8-B48F-1D18A9856A87
last_name: Nadiradze
orcid: 0000-0001-5634-0731
citation:
ama: Nadiradze G. On achieving scalability through relaxation. 2021. doi:10.15479/at:ista:10429
apa: Nadiradze, G. (2021). On achieving scalability through relaxation. Institute
of Science and Technology Austria. https://doi.org/10.15479/at:ista:10429
chicago: Nadiradze, Giorgi. “On Achieving Scalability through Relaxation.” Institute
of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10429.
ieee: G. Nadiradze, “On achieving scalability through relaxation,” Institute of
Science and Technology Austria, 2021.
ista: Nadiradze G. 2021. On achieving scalability through relaxation. Institute
of Science and Technology Austria.
mla: Nadiradze, Giorgi. On Achieving Scalability through Relaxation. Institute
of Science and Technology Austria, 2021, doi:10.15479/at:ista:10429.
short: G. Nadiradze, On Achieving Scalability through Relaxation, Institute of Science
and Technology Austria, 2021.
date_created: 2021-12-08T21:52:28Z
date_published: 2021-12-09T00:00:00Z
date_updated: 2023-10-17T11:48:55Z
day: '09'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: GradSch
- _id: DaAl
doi: 10.15479/at:ista:10429
ec_funded: 1
file:
- access_level: open_access
checksum: 6bf14e9a523387328f016c0689f5e10e
content_type: application/pdf
creator: gnadirad
date_created: 2021-12-09T17:47:49Z
date_updated: 2021-12-09T17:47:49Z
file_id: '10436'
file_name: Thesis_Final_09_12_2021.pdf
file_size: 2370859
relation: main_file
success: 1
- access_level: closed
checksum: 914d6c5ca86bd0add471971a8f4c4341
content_type: application/zip
creator: gnadirad
date_created: 2021-12-09T17:47:49Z
date_updated: 2022-03-28T12:55:12Z
file_id: '10437'
file_name: Thesis_Final_09_12_2021.zip
file_size: 2596924
relation: source_file
file_date_updated: 2022-03-28T12:55:12Z
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: '132'
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '10432'
relation: part_of_dissertation
status: public
- id: '6673'
relation: part_of_dissertation
status: public
- id: '5965'
relation: part_of_dissertation
status: public
- id: '10435'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
title: On achieving scalability through relaxation
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2021'
...
---
_id: '10435'
abstract:
- lang: eng
text: Decentralized optimization is emerging as a viable alternative for scalable
distributed machine learning, but also introduces new challenges in terms of synchronization
costs. To this end, several communication-reduction techniques, such as non-blocking
communication, quantization, and local steps, have been explored in the decentralized
setting. Due to the complexity of analyzing optimization in such a relaxed setting,
this line of work often assumes \emph{global} communication rounds, which require
additional synchronization. In this paper, we consider decentralized optimization
in the simpler, but harder to analyze, \emph{asynchronous gossip} model, in which
communication occurs in discrete, randomly chosen pairings among nodes. Perhaps
surprisingly, we show that a variant of SGD called \emph{SwarmSGD} still converges
in this setting, even if \emph{non-blocking communication}, \emph{quantization},
and \emph{local steps} are all applied \emph{in conjunction}, and even if the
node data distributions and underlying graph topology are both \emph{heterogenous}.
Our analysis is based on a new connection with multi-dimensional load-balancing
processes. We implement this algorithm and deploy it in a super-computing environment,
showing that it can outperform previous decentralized methods in terms of end-to-end
training time, and that it can even rival carefully-tuned large-batch SGD for
certain tasks.
acknowledgement: "We gratefully acknowledge funding from the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme
(grant agreement No 805223 ScaleML). PD partly conducted this work while at IST
Austria and was supported by the European Union’s Horizon 2020 programme under the
Marie Skłodowska-Curie grant agreement No. 754411. SL was funded in part by European
Research Council (ERC) under the European Union’s Horizon 2020 programme (grant
agreement DAPP, No. 678880, and EPiGRAM-HS, No. 801039).\r\n"
article_processing_charge: No
author:
- first_name: Giorgi
full_name: Nadiradze, Giorgi
id: 3279A00C-F248-11E8-B48F-1D18A9856A87
last_name: Nadiradze
orcid: 0000-0001-5634-0731
- first_name: Amirmojtaba
full_name: Sabour, Amirmojtaba
id: bcc145fd-e77f-11ea-ae8b-80d661dbff67
last_name: Sabour
- first_name: Peter
full_name: Davies, Peter
id: 11396234-BB50-11E9-B24C-90FCE5697425
last_name: Davies
orcid: 0000-0002-5646-9524
- first_name: Shigang
full_name: Li, Shigang
last_name: Li
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Nadiradze G, Sabour A, Davies P, Li S, Alistarh D-A. Asynchronous decentralized
SGD with quantized and local updates. In: 35th Conference on Neural Information
Processing Systems. Neural Information Processing Systems Foundation; 2021.'
apa: 'Nadiradze, G., Sabour, A., Davies, P., Li, S., & Alistarh, D.-A. (2021).
Asynchronous decentralized SGD with quantized and local updates. In 35th Conference
on Neural Information Processing Systems. Sydney, Australia: Neural Information
Processing Systems Foundation.'
chicago: Nadiradze, Giorgi, Amirmojtaba Sabour, Peter Davies, Shigang Li, and Dan-Adrian
Alistarh. “Asynchronous Decentralized SGD with Quantized and Local Updates.” In
35th Conference on Neural Information Processing Systems. Neural Information
Processing Systems Foundation, 2021.
ieee: G. Nadiradze, A. Sabour, P. Davies, S. Li, and D.-A. Alistarh, “Asynchronous
decentralized SGD with quantized and local updates,” in 35th Conference on
Neural Information Processing Systems, Sydney, Australia, 2021.
ista: 'Nadiradze G, Sabour A, Davies P, Li S, Alistarh D-A. 2021. Asynchronous decentralized
SGD with quantized and local updates. 35th Conference on Neural Information Processing
Systems. NeurIPS: Neural Information Processing Systems.'
mla: Nadiradze, Giorgi, et al. “Asynchronous Decentralized SGD with Quantized and
Local Updates.” 35th Conference on Neural Information Processing Systems,
Neural Information Processing Systems Foundation, 2021.
short: G. Nadiradze, A. Sabour, P. Davies, S. Li, D.-A. Alistarh, in:, 35th Conference
on Neural Information Processing Systems, Neural Information Processing Systems
Foundation, 2021.
conference:
end_date: 2021-12-14
location: Sydney, Australia
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2021-12-06
date_created: 2021-12-09T10:59:12Z
date_published: 2021-12-01T00:00:00Z
date_updated: 2023-10-17T11:48:56Z
day: '01'
department:
- _id: DaAl
ec_funded: 1
external_id:
arxiv:
- '1910.12308'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://papers.nips.cc/paper/2021/hash/362c99307cdc3f2d8b410652386a9dd1-Abstract.html
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: 35th Conference on Neural Information Processing Systems
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
related_material:
record:
- id: '10429'
relation: dissertation_contains
status: public
status: public
title: Asynchronous decentralized SGD with quantized and local updates
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10593'
abstract:
- lang: eng
text: 'We study the problem of estimating a rank-$1$ signal in the presence of rotationally
invariant noise-a class of perturbations more general than Gaussian noise. Principal
Component Analysis (PCA) provides a natural estimator, and sharp results on its
performance have been obtained in the high-dimensional regime. Recently, an Approximate
Message Passing (AMP) algorithm has been proposed as an alternative estimator
with the potential to improve the accuracy of PCA. However, the existing analysis
of AMP requires an initialization that is both correlated with the signal and
independent of the noise, which is often unrealistic in practice. In this work,
we combine the two methods, and propose to initialize AMP with PCA. Our main result
is a rigorous asymptotic characterization of the performance of this estimator.
Both the AMP algorithm and its analysis differ from those previously derived in
the Gaussian setting: at every iteration, our AMP algorithm requires a specific
term to account for PCA initialization, while in the Gaussian case, PCA initialization
affects only the first iteration of AMP. The proof is based on a two-phase artificial
AMP that first approximates the PCA estimator and then mimics the true AMP. Our
numerical simulations show an excellent agreement between AMP results and theoretical
predictions, and suggest an interesting open direction on achieving Bayes-optimal
performance.'
acknowledgement: "M. Mondelli would like to thank László Erdős for helpful discussions.
M. Mondelli was partially supported by the 2019 Lopez-Loreta Prize. R. Venkataramanan
was partially supported by the Alan Turing Institute under the EPSRC grant EP/N510129/1.\r\n"
article_processing_charge: No
author:
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Ramji
full_name: Venkataramanan, Ramji
last_name: Venkataramanan
citation:
ama: 'Mondelli M, Venkataramanan R. PCA initialization for approximate message passing
in rotationally invariant models. In: 35th Conference on Neural Information
Processing Systems. Vol 35. Neural Information Processing Systems Foundation;
2021:29616-29629.'
apa: 'Mondelli, M., & Venkataramanan, R. (2021). PCA initialization for approximate
message passing in rotationally invariant models. In 35th Conference on Neural
Information Processing Systems (Vol. 35, pp. 29616–29629). Virtual: Neural
Information Processing Systems Foundation.'
chicago: Mondelli, Marco, and Ramji Venkataramanan. “PCA Initialization for Approximate
Message Passing in Rotationally Invariant Models.” In 35th Conference on Neural
Information Processing Systems, 35:29616–29. Neural Information Processing
Systems Foundation, 2021.
ieee: M. Mondelli and R. Venkataramanan, “PCA initialization for approximate message
passing in rotationally invariant models,” in 35th Conference on Neural Information
Processing Systems, Virtual, 2021, vol. 35, pp. 29616–29629.
ista: 'Mondelli M, Venkataramanan R. 2021. PCA initialization for approximate message
passing in rotationally invariant models. 35th Conference on Neural Information
Processing Systems. NeurIPS: Neural Information Processing Systems vol. 35, 29616–29629.'
mla: Mondelli, Marco, and Ramji Venkataramanan. “PCA Initialization for Approximate
Message Passing in Rotationally Invariant Models.” 35th Conference on Neural
Information Processing Systems, vol. 35, Neural Information Processing Systems
Foundation, 2021, pp. 29616–29.
short: M. Mondelli, R. Venkataramanan, in:, 35th Conference on Neural Information
Processing Systems, Neural Information Processing Systems Foundation, 2021, pp.
29616–29629.
conference:
end_date: 2021-12-14
location: Virtual
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2021-12-06
date_created: 2022-01-03T10:50:02Z
date_published: 2021-12-01T00:00:00Z
date_updated: 2023-10-17T11:48:23Z
day: '01'
department:
- _id: MaMo
external_id:
arxiv:
- '2106.02356'
intvolume: ' 35'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2106.02356
month: '12'
oa: 1
oa_version: Preprint
page: 29616-29629
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: 35th Conference on Neural Information Processing Systems
publication_identifier:
isbn:
- '9781713845393'
issn:
- 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: PCA initialization for approximate message passing in rotationally invariant
models
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2021'
...
---
_id: '10594'
abstract:
- lang: eng
text: 'The question of how and why the phenomenon of mode connectivity occurs in
training deep neural networks has gained remarkable attention in the research
community. From a theoretical perspective, two possible explanations have been
proposed: (i) the loss function has connected sublevel sets, and (ii) the solutions
found by stochastic gradient descent are dropout stable. While these explanations
provide insights into the phenomenon, their assumptions are not always satisfied
in practice. In particular, the first approach requires the network to have one
layer with order of N neurons (N being the number of training samples), while
the second one requires the loss to be almost invariant after removing half of
the neurons at each layer (up to some rescaling of the remaining ones). In this
work, we improve both conditions by exploiting the quality of the features at
every intermediate layer together with a milder over-parameterization condition.
More specifically, we show that: (i) under generic assumptions on the features
of intermediate layers, it suffices that the last two hidden layers have order
of N−−√ neurons, and (ii) if subsets of features at each layer are linearly separable,
then no over-parameterization is needed to show the connectivity. Our experiments
confirm that the proposed condition ensures the connectivity of solutions found
by stochastic gradient descent, even in settings where the previous requirements
do not hold.'
acknowledgement: MM was partially supported by the 2019 Lopez-Loreta Prize. QN and
PB acknowledge support from the European Research Council (ERC) under the European
Union’s Horizon 2020 research and innovation programme (grant agreement no 757983).
article_processing_charge: No
author:
- first_name: Quynh
full_name: Nguyen, Quynh
last_name: Nguyen
- first_name: Pierre
full_name: Bréchet, Pierre
last_name: Bréchet
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
citation:
ama: 'Nguyen Q, Bréchet P, Mondelli M. When are solutions connected in deep networks?
In: 35th Conference on Neural Information Processing Systems. Vol 35. Neural
Information Processing Systems Foundation; 2021.'
apa: 'Nguyen, Q., Bréchet, P., & Mondelli, M. (2021). When are solutions connected
in deep networks? In 35th Conference on Neural Information Processing Systems
(Vol. 35). Virtual: Neural Information Processing Systems Foundation.'
chicago: Nguyen, Quynh, Pierre Bréchet, and Marco Mondelli. “When Are Solutions
Connected in Deep Networks?” In 35th Conference on Neural Information Processing
Systems, Vol. 35. Neural Information Processing Systems Foundation, 2021.
ieee: Q. Nguyen, P. Bréchet, and M. Mondelli, “When are solutions connected in deep
networks?,” in 35th Conference on Neural Information Processing Systems,
Virtual, 2021, vol. 35.
ista: Nguyen Q, Bréchet P, Mondelli M. 2021. When are solutions connected in deep
networks? 35th Conference on Neural Information Processing Systems. 35th Conference
on Neural Information Processing Systems vol. 35.
mla: Nguyen, Quynh, et al. “When Are Solutions Connected in Deep Networks?” 35th
Conference on Neural Information Processing Systems, vol. 35, Neural Information
Processing Systems Foundation, 2021.
short: Q. Nguyen, P. Bréchet, M. Mondelli, in:, 35th Conference on Neural Information
Processing Systems, Neural Information Processing Systems Foundation, 2021.
conference:
end_date: 2021-12-14
location: Virtual
name: 35th Conference on Neural Information Processing Systems
start_date: 2021-12-06
date_created: 2022-01-03T10:56:20Z
date_published: 2021-12-01T00:00:00Z
date_updated: 2023-10-17T11:48:40Z
day: '01'
department:
- _id: MaMo
external_id:
arxiv:
- '2102.09671'
intvolume: ' 35'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2102.09671
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: 35th Conference on Neural Information Processing Systems
publication_identifier:
isbn:
- '9781713845393'
issn:
- 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
status: public
title: When are solutions connected in deep networks?
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2021'
...
---
_id: '9815'
abstract:
- lang: eng
text: The quantum bits (qubits) on which superconducting quantum computers are based
have energy scales corresponding to photons with GHz frequencies. The energy of
photons in the gigahertz domain is too low to allow transmission through the noisy
room-temperature environment, where the signal would be lost in thermal noise.
Optical photons, on the other hand, have much higher energies, and signals can
be detected using highly efficient single-photon detectors. Transduction from
microwave to optical frequencies is therefore a potential enabling technology
for quantum devices. However, in such a device the optical pump can be a source
of thermal noise and thus degrade the fidelity; the similarity of input microwave
state to the output optical state. In order to investigate the magnitude of this
effect we model the sub-Kelvin thermal behavior of an electro-optic transducer
based on a lithium niobate whispering gallery mode resonator. We find that there
is an optimum power level for a continuous pump, whilst pulsed operation of the
pump increases the fidelity of the conversion.
acknowledgement: NJL is supported by the MBIE Endeavour Fund (UOOX1805) and GL is
by the Julius von Haast Fellowship of New Zealand. SM acknowledges stimulating discussions
with T M Jensen.
article_number: '045005'
article_processing_charge: Yes
article_type: original
author:
- first_name: Sonia
full_name: Mobassem, Sonia
last_name: Mobassem
- first_name: Nicholas J.
full_name: Lambert, Nicholas J.
last_name: Lambert
- first_name: Alfredo R
full_name: Rueda Sanchez, Alfredo R
id: 3B82B0F8-F248-11E8-B48F-1D18A9856A87
last_name: Rueda Sanchez
orcid: 0000-0001-6249-5860
- first_name: Johannes M
full_name: Fink, Johannes M
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
- first_name: Gerd
full_name: Leuchs, Gerd
last_name: Leuchs
- first_name: Harald G.L.
full_name: Schwefel, Harald G.L.
last_name: Schwefel
citation:
ama: Mobassem S, Lambert NJ, Rueda Sanchez AR, Fink JM, Leuchs G, Schwefel HGL.
Thermal noise in electro-optic devices at cryogenic temperatures. Quantum Science
and Technology. 2021;6(4). doi:10.1088/2058-9565/ac0f36
apa: Mobassem, S., Lambert, N. J., Rueda Sanchez, A. R., Fink, J. M., Leuchs, G.,
& Schwefel, H. G. L. (2021). Thermal noise in electro-optic devices at cryogenic
temperatures. Quantum Science and Technology. IOP Publishing. https://doi.org/10.1088/2058-9565/ac0f36
chicago: Mobassem, Sonia, Nicholas J. Lambert, Alfredo R Rueda Sanchez, Johannes
M Fink, Gerd Leuchs, and Harald G.L. Schwefel. “Thermal Noise in Electro-Optic
Devices at Cryogenic Temperatures.” Quantum Science and Technology. IOP
Publishing, 2021. https://doi.org/10.1088/2058-9565/ac0f36.
ieee: S. Mobassem, N. J. Lambert, A. R. Rueda Sanchez, J. M. Fink, G. Leuchs, and
H. G. L. Schwefel, “Thermal noise in electro-optic devices at cryogenic temperatures,”
Quantum Science and Technology, vol. 6, no. 4. IOP Publishing, 2021.
ista: Mobassem S, Lambert NJ, Rueda Sanchez AR, Fink JM, Leuchs G, Schwefel HGL.
2021. Thermal noise in electro-optic devices at cryogenic temperatures. Quantum
Science and Technology. 6(4), 045005.
mla: Mobassem, Sonia, et al. “Thermal Noise in Electro-Optic Devices at Cryogenic
Temperatures.” Quantum Science and Technology, vol. 6, no. 4, 045005, IOP
Publishing, 2021, doi:10.1088/2058-9565/ac0f36.
short: S. Mobassem, N.J. Lambert, A.R. Rueda Sanchez, J.M. Fink, G. Leuchs, H.G.L.
Schwefel, Quantum Science and Technology 6 (2021).
date_created: 2021-08-08T22:01:25Z
date_published: 2021-07-15T00:00:00Z
date_updated: 2023-10-17T12:54:54Z
day: '15'
ddc:
- '530'
department:
- _id: JoFi
doi: 10.1088/2058-9565/ac0f36
external_id:
arxiv:
- '2008.08764'
isi:
- '000673081500001'
file:
- access_level: open_access
checksum: b15c2c228487a75002c3b52d56f23d5c
content_type: application/pdf
creator: cchlebak
date_created: 2021-08-09T12:23:13Z
date_updated: 2021-08-09T12:23:13Z
file_id: '9836'
file_name: 2021_QuantumScienceTechnology_Mobassem.pdf
file_size: 2366118
relation: main_file
file_date_updated: 2021-08-09T12:23:13Z
has_accepted_license: '1'
intvolume: ' 6'
isi: 1
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication: Quantum Science and Technology
publication_identifier:
eissn:
- 2058-9565
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Thermal noise in electro-optic devices at cryogenic temperatures
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2021'
...
---
_id: '9978'
abstract:
- lang: eng
text: Redox mediators could catalyse otherwise slow and energy-inefficient cycling
of Li-S and Li-O 2 batteries by shuttling electrons/holes between the electrode
and the solid insulating storage materials. For mediators to work efficiently
they need to oxidize the solid with fast kinetics yet the lowest possible overpotential.
Here, we found that when the redox potentials of mediators are tuned via, e.g.,
Li + concentration in the electrolyte, they exhibit distinct threshold potentials,
where the kinetics accelerate several-fold within a range as small as 10 mV. This
phenomenon is independent of types of mediators and electrolyte. The acceleration
originates from the overpotentials required to activate fast Li + /e – extraction
and the following chemical step at specific abundant surface facets. Efficient
redox catalysis at insulating solids requires therefore carefully considering
the surface conditions of the storage materials and electrolyte-dependent redox
potentials, which may be tuned by salt concentrations or solvents.
acknowledgement: 'This work was financially supported by the National Natural Science
Foundation of China (51773092, 21975124, 11874254, 51802187, U2030206). S.A.F. is
indebted to IST Austria for support. '
article_processing_charge: No
author:
- first_name: Deqing
full_name: Cao, Deqing
last_name: Cao
- first_name: Xiaoxiao
full_name: Shen, Xiaoxiao
last_name: Shen
- first_name: Aiping
full_name: Wang, Aiping
last_name: Wang
- first_name: Fengjiao
full_name: Yu, Fengjiao
last_name: Yu
- first_name: Yuping
full_name: Wu, Yuping
last_name: Wu
- first_name: Siqi
full_name: Shi, Siqi
last_name: Shi
- first_name: Stefan Alexander
full_name: Freunberger, Stefan Alexander
id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
last_name: Freunberger
orcid: 0000-0003-2902-5319
- first_name: Yuhui
full_name: Chen, Yuhui
last_name: Chen
citation:
ama: Cao D, Shen X, Wang A, et al. Sharp kinetic acceleration potentials during
mediated redox catalysis of insulators. Research Square. doi:10.21203/rs.3.rs-750965/v1
apa: Cao, D., Shen, X., Wang, A., Yu, F., Wu, Y., Shi, S., … Chen, Y. (n.d.). Sharp
kinetic acceleration potentials during mediated redox catalysis of insulators.
Research Square. Research Square. https://doi.org/10.21203/rs.3.rs-750965/v1
chicago: Cao, Deqing, Xiaoxiao Shen, Aiping Wang, Fengjiao Yu, Yuping Wu, Siqi Shi,
Stefan Alexander Freunberger, and Yuhui Chen. “Sharp Kinetic Acceleration Potentials
during Mediated Redox Catalysis of Insulators.” Research Square. Research
Square, n.d. https://doi.org/10.21203/rs.3.rs-750965/v1.
ieee: D. Cao et al., “Sharp kinetic acceleration potentials during mediated
redox catalysis of insulators,” Research Square. Research Square.
ista: Cao D, Shen X, Wang A, Yu F, Wu Y, Shi S, Freunberger SA, Chen Y. Sharp kinetic
acceleration potentials during mediated redox catalysis of insulators. Research
Square, 10.21203/rs.3.rs-750965/v1.
mla: Cao, Deqing, et al. “Sharp Kinetic Acceleration Potentials during Mediated
Redox Catalysis of Insulators.” Research Square, Research Square, doi:10.21203/rs.3.rs-750965/v1.
short: D. Cao, X. Shen, A. Wang, F. Yu, Y. Wu, S. Shi, S.A. Freunberger, Y. Chen,
Research Square (n.d.).
date_created: 2021-08-31T12:54:16Z
date_published: 2021-08-18T00:00:00Z
date_updated: 2023-10-17T13:06:29Z
day: '18'
ddc:
- '541'
department:
- _id: StFr
doi: 10.21203/rs.3.rs-750965/v1
file:
- access_level: open_access
checksum: 1878e91c29d5769ed5a827b0b7addf00
content_type: application/pdf
creator: cchlebak
date_created: 2021-08-31T14:02:19Z
date_updated: 2021-08-31T14:02:19Z
file_id: '9979'
file_name: 2021_ResearchSquare_Cao.pdf
file_size: 1019662
relation: main_file
success: 1
file_date_updated: 2021-08-31T14:02:19Z
has_accepted_license: '1'
keyword:
- Catalysis
- Energy engineering
- Materials theory and modeling
language:
- iso: eng
month: '08'
oa: 1
oa_version: Preprint
page: '21'
publication: Research Square
publication_identifier:
eissn:
- 2693-5015
publication_status: submitted
publisher: Research Square
related_material:
record:
- id: '10813'
relation: later_version
status: public
status: public
title: Sharp kinetic acceleration potentials during mediated redox catalysis of insulators
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: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '8730'
abstract:
- lang: eng
text: P-glycoprotein (ABCB1) and breast cancer resistance protein (ABCG2) restrict
at the blood–brain barrier (BBB) the brain distribution of the majority of currently
known molecularly targeted anticancer drugs. To improve brain delivery of dual
ABCB1/ABCG2 substrates, both ABCB1 and ABCG2 need to be inhibited simultaneously
at the BBB. We examined the feasibility of simultaneous ABCB1/ABCG2 inhibition
with i.v. co-infusion of erlotinib and tariquidar by studying brain distribution
of the model ABCB1/ABCG2 substrate [11C]erlotinib in mice and rhesus macaques
with PET. Tolerability of the erlotinib/tariquidar combination was assessed in
human embryonic stem cell-derived cerebral organoids. In mice and macaques, baseline
brain distribution of [11C]erlotinib was low (brain distribution volume, VT,brain < 0.3 mL/cm3).
Co-infusion of erlotinib and tariquidar increased VT,brain in mice by 3.0-fold
and in macaques by 3.4- to 5.0-fold, while infusion of erlotinib alone or tariquidar
alone led to less pronounced VT,brain increases in both species. Treatment of
cerebral organoids with erlotinib/tariquidar led to an induction of Caspase-3-dependent
apoptosis. Co-infusion of erlotinib/tariquidar may potentially allow for complete
ABCB1/ABCG2 inhibition at the BBB, while simultaneously achieving brain-targeted
EGFR inhibition. Our protocol may be applicable to enhance brain delivery of molecularly
targeted anticancer drugs for a more effective treatment of brain tumors.
article_processing_charge: No
article_type: original
author:
- first_name: N
full_name: Tournier, N
last_name: Tournier
- first_name: S
full_name: Goutal, S
last_name: Goutal
- first_name: S
full_name: Mairinger, S
last_name: Mairinger
- first_name: IH
full_name: Lozano, IH
last_name: Lozano
- first_name: T
full_name: Filip, T
last_name: Filip
- first_name: M
full_name: Sauberer, M
last_name: Sauberer
- first_name: F
full_name: Caillé, F
last_name: Caillé
- first_name: L
full_name: Breuil, L
last_name: Breuil
- first_name: J
full_name: Stanek, J
last_name: Stanek
- first_name: AF
full_name: Freeman, AF
last_name: Freeman
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
- first_name: C
full_name: Truillet, C
last_name: Truillet
- first_name: T
full_name: Wanek, T
last_name: Wanek
- first_name: O
full_name: Langer, O
last_name: Langer
citation:
ama: Tournier N, Goutal S, Mairinger S, et al. Complete inhibition of ABCB1 and
ABCG2 at the blood-brain barrier by co-infusion of erlotinib and tariquidar to
improve brain delivery of the model ABCB1/ABCG2 substrate [11C]erlotinib. Journal
of Cerebral Blood Flow and Metabolism. 2021;41(7):1634-1646. doi:10.1177/0271678X20965500
apa: Tournier, N., Goutal, S., Mairinger, S., Lozano, I., Filip, T., Sauberer, M.,
… Langer, O. (2021). Complete inhibition of ABCB1 and ABCG2 at the blood-brain
barrier by co-infusion of erlotinib and tariquidar to improve brain delivery of
the model ABCB1/ABCG2 substrate [11C]erlotinib. Journal of Cerebral Blood Flow
and Metabolism. SAGE Publications. https://doi.org/10.1177/0271678X20965500
chicago: Tournier, N, S Goutal, S Mairinger, IH Lozano, T Filip, M Sauberer, F Caillé,
et al. “Complete Inhibition of ABCB1 and ABCG2 at the Blood-Brain Barrier by Co-Infusion
of Erlotinib and Tariquidar to Improve Brain Delivery of the Model ABCB1/ABCG2
Substrate [11C]Erlotinib.” Journal of Cerebral Blood Flow and Metabolism.
SAGE Publications, 2021. https://doi.org/10.1177/0271678X20965500.
ieee: N. Tournier et al., “Complete inhibition of ABCB1 and ABCG2 at the
blood-brain barrier by co-infusion of erlotinib and tariquidar to improve brain
delivery of the model ABCB1/ABCG2 substrate [11C]erlotinib,” Journal of Cerebral
Blood Flow and Metabolism, vol. 41, no. 7. SAGE Publications, pp. 1634–1646,
2021.
ista: Tournier N, Goutal S, Mairinger S, Lozano I, Filip T, Sauberer M, Caillé F,
Breuil L, Stanek J, Freeman A, Novarino G, Truillet C, Wanek T, Langer O. 2021.
Complete inhibition of ABCB1 and ABCG2 at the blood-brain barrier by co-infusion
of erlotinib and tariquidar to improve brain delivery of the model ABCB1/ABCG2
substrate [11C]erlotinib. Journal of Cerebral Blood Flow and Metabolism. 41(7),
1634–1646.
mla: Tournier, N., et al. “Complete Inhibition of ABCB1 and ABCG2 at the Blood-Brain
Barrier by Co-Infusion of Erlotinib and Tariquidar to Improve Brain Delivery of
the Model ABCB1/ABCG2 Substrate [11C]Erlotinib.” Journal of Cerebral Blood
Flow and Metabolism, vol. 41, no. 7, SAGE Publications, 2021, pp. 1634–46,
doi:10.1177/0271678X20965500.
short: N. Tournier, S. Goutal, S. Mairinger, I. Lozano, T. Filip, M. Sauberer, F.
Caillé, L. Breuil, J. Stanek, A. Freeman, G. Novarino, C. Truillet, T. Wanek,
O. Langer, Journal of Cerebral Blood Flow and Metabolism 41 (2021) 1634–1646.
date_created: 2020-11-06T08:39:01Z
date_published: 2021-07-01T00:00:00Z
date_updated: 2023-10-18T06:45:30Z
day: '01'
department:
- _id: GaNo
doi: 10.1177/0271678X20965500
external_id:
isi:
- '000664214100012'
pmid:
- '33081568'
intvolume: ' 41'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8221757/
month: '07'
oa: 1
oa_version: Published Version
page: 1634-1646
pmid: 1
publication: Journal of Cerebral Blood Flow and Metabolism
publication_identifier:
eissn:
- 1559-7016
issn:
- 0271-678x
publication_status: published
publisher: SAGE Publications
quality_controlled: '1'
scopus_import: '1'
status: public
title: Complete inhibition of ABCB1 and ABCG2 at the blood-brain barrier by co-infusion
of erlotinib and tariquidar to improve brain delivery of the model ABCB1/ABCG2 substrate
[11C]erlotinib
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 41
year: '2021'
...
---
_id: '9383'
abstract:
- lang: eng
text: A primary roadblock to our understanding of speciation is that it usually
occurs over a timeframe that is too long to study from start to finish. The idea
of a speciation continuum provides something of a solution to this problem; rather
than observing the entire process, we can simply reconstruct it from the multitude
of speciation events that surround us. But what do we really mean when we talk
about the speciation continuum, and can it really help us understand speciation?
We explored these questions using a literature review and online survey of speciation
researchers. Although most researchers were familiar with the concept and thought
it was useful, our survey revealed extensive disagreement about what the speciation
continuum actually tells us. This is due partly to the lack of a clear definition.
Here, we provide an explicit definition that is compatible with the Biological
Species Concept. That is, the speciation continuum is a continuum of reproductive
isolation. After outlining the logic of the definition in light of alternatives,
we explain why attempts to reconstruct the speciation process from present‐day
populations will ultimately fail. We then outline how we think the speciation
continuum concept can continue to act as a foundation for understanding the continuum
of reproductive isolation that surrounds us.
acknowledgement: We thank M. Garlovsky, S. Martin, C. Cooney, C. Roux, J. Larson,
and J. Mallet for critical feedback and for discussion. K. Lohse, M. de la Cámara,
J. Cerca, M. A. Chase, C. Baskett, A. M. Westram, and N. H. Barton gave feedback
on a draft of the manuscript. O. Seehausen, two anonymous reviewers, and the AE
(Michael Kopp) provided comments that greatly improved the manuscript. V. Holzmann
made many corrections to the proofs. G. Bisschop and K. Lohse kindly contributed
the simulations and analyses presented in Box 3. We would also like to extend our
thanks to everyone who took part in the speciation survey, which received ethical
approval through the University of Sheffield Ethics Review Procedure (Application
029768). We are especially grateful to R. K. Butlin for stimulating discussion throughout
the writing of the manuscript and for feedback on an earlier draft.
article_processing_charge: No
article_type: original
author:
- first_name: Sean
full_name: Stankowski, Sean
id: 43161670-5719-11EA-8025-FABC3DDC885E
last_name: Stankowski
- first_name: Mark
full_name: Ravinet, Mark
last_name: Ravinet
citation:
ama: Stankowski S, Ravinet M. Defining the speciation continuum. Evolution.
2021;75(6):1256-1273. doi:10.1111/evo.14215
apa: Stankowski, S., & Ravinet, M. (2021). Defining the speciation continuum.
Evolution. Oxford University Press. https://doi.org/10.1111/evo.14215
chicago: Stankowski, Sean, and Mark Ravinet. “Defining the Speciation Continuum.”
Evolution. Oxford University Press, 2021. https://doi.org/10.1111/evo.14215.
ieee: S. Stankowski and M. Ravinet, “Defining the speciation continuum,” Evolution,
vol. 75, no. 6. Oxford University Press, pp. 1256–1273, 2021.
ista: Stankowski S, Ravinet M. 2021. Defining the speciation continuum. Evolution.
75(6), 1256–1273.
mla: Stankowski, Sean, and Mark Ravinet. “Defining the Speciation Continuum.” Evolution,
vol. 75, no. 6, Oxford University Press, 2021, pp. 1256–73, doi:10.1111/evo.14215.
short: S. Stankowski, M. Ravinet, Evolution 75 (2021) 1256–1273.
date_created: 2021-05-09T22:01:39Z
date_published: 2021-03-22T00:00:00Z
date_updated: 2023-10-18T08:16:01Z
day: '22'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1111/evo.14215
external_id:
isi:
- '000647226400001'
file:
- access_level: open_access
checksum: 96f6ccf15d95a4e9f7c0b27eee570fa6
content_type: application/pdf
creator: kschuh
date_created: 2022-03-25T12:02:04Z
date_updated: 2022-03-25T12:02:04Z
file_id: '10921'
file_name: 2021_Evolution_Stankowski.pdf
file_size: 719991
relation: main_file
success: 1
file_date_updated: 2022-03-25T12:02:04Z
has_accepted_license: '1'
intvolume: ' 75'
isi: 1
issue: '6'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '03'
oa: 1
oa_version: Published Version
page: 1256-1273
publication: Evolution
publication_identifier:
eissn:
- 1558-5646
issn:
- 0014-3820
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Defining the speciation continuum
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 75
year: '2021'
...
---
_id: '10223'
abstract:
- lang: eng
text: Growth regulation tailors development in plants to their environment. A prominent
example of this is the response to gravity, in which shoots bend up and roots
bend down1. This paradox is based on opposite effects of the phytohormone auxin,
which promotes cell expansion in shoots while inhibiting it in roots via a yet
unknown cellular mechanism2. Here, by combining microfluidics, live imaging, genetic
engineering and phosphoproteomics in Arabidopsis thaliana, we advance understanding
of how auxin inhibits root growth. We show that auxin activates two distinct,
antagonistically acting signalling pathways that converge on rapid regulation
of apoplastic pH, a causative determinant of growth. Cell surface-based TRANSMEMBRANE
KINASE1 (TMK1) interacts with and mediates phosphorylation and activation of plasma
membrane H+-ATPases for apoplast acidification, while intracellular canonical
auxin signalling promotes net cellular H+ influx, causing apoplast alkalinization.
Simultaneous activation of these two counteracting mechanisms poises roots for
rapid, fine-tuned growth modulation in navigating complex soil environments.
acknowledged_ssus:
- _id: LifeSc
- _id: M-Shop
- _id: Bio
acknowledgement: We thank N. Gnyliukh and L. Hörmayer for technical assistance and
N. Paris for sharing PM-Cyto seeds. We gratefully acknowledge the Life Science,
Machine Shop and Bioimaging Facilities of IST Austria. This project has received
funding from the European Research Council Advanced Grant (ETAP-742985) and the
Austrian Science Fund (FWF) under I 3630-B25 to J.F., the National Institutes of
Health (GM067203) to W.M.G., the Netherlands Organization for Scientific Research
(NWO; VIDI-864.13.001), Research Foundation-Flanders (FWO; Odysseus II G0D0515N)
and a European Research Council Starting Grant (TORPEDO-714055) to W.S. and B.D.R.,
the VICI grant (865.14.001) from the Netherlands Organization for Scientific Research
to M.R. and D.W., the Australian Research Council and China National Distinguished
Expert Project (WQ20174400441) to S.S., the MEXT/JSPS KAKENHI to K.T. (20K06685)
and T.K. (20H05687 and 20H05910), the European Union’s Horizon 2020 research and
innovation programme under Marie Skłodowska-Curie grant agreement no. 665385 and
the DOC Fellowship of the Austrian Academy of Sciences to L.L., and the China Scholarship
Council to J.C.
article_processing_charge: No
article_type: original
author:
- first_name: Lanxin
full_name: Li, Lanxin
id: 367EF8FA-F248-11E8-B48F-1D18A9856A87
last_name: Li
orcid: 0000-0002-5607-272X
- first_name: Inge
full_name: Verstraeten, Inge
id: 362BF7FE-F248-11E8-B48F-1D18A9856A87
last_name: Verstraeten
orcid: 0000-0001-7241-2328
- first_name: Mark
full_name: Roosjen, Mark
last_name: Roosjen
- first_name: Koji
full_name: Takahashi, Koji
last_name: Takahashi
- first_name: Lesia
full_name: Rodriguez Solovey, Lesia
id: 3922B506-F248-11E8-B48F-1D18A9856A87
last_name: Rodriguez Solovey
orcid: 0000-0002-7244-7237
- first_name: Jack
full_name: Merrin, Jack
id: 4515C308-F248-11E8-B48F-1D18A9856A87
last_name: Merrin
orcid: 0000-0001-5145-4609
- first_name: Jian
full_name: Chen, Jian
last_name: Chen
- first_name: Lana
full_name: Shabala, Lana
last_name: Shabala
- first_name: Wouter
full_name: Smet, Wouter
last_name: Smet
- first_name: Hong
full_name: Ren, Hong
last_name: Ren
- first_name: Steffen
full_name: Vanneste, Steffen
last_name: Vanneste
- first_name: Sergey
full_name: Shabala, Sergey
last_name: Shabala
- first_name: Bert
full_name: De Rybel, Bert
last_name: De Rybel
- first_name: Dolf
full_name: Weijers, Dolf
last_name: Weijers
- first_name: Toshinori
full_name: Kinoshita, Toshinori
last_name: Kinoshita
- first_name: William M.
full_name: Gray, William M.
last_name: Gray
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Li L, Verstraeten I, Roosjen M, et al. Cell surface and intracellular auxin
signalling for H+ fluxes in root growth. Nature. 2021;599(7884):273-277.
doi:10.1038/s41586-021-04037-6
apa: Li, L., Verstraeten, I., Roosjen, M., Takahashi, K., Rodriguez Solovey, L.,
Merrin, J., … Friml, J. (2021). Cell surface and intracellular auxin signalling
for H+ fluxes in root growth. Nature. Springer Nature. https://doi.org/10.1038/s41586-021-04037-6
chicago: Li, Lanxin, Inge Verstraeten, Mark Roosjen, Koji Takahashi, Lesia Rodriguez
Solovey, Jack Merrin, Jian Chen, et al. “Cell Surface and Intracellular Auxin
Signalling for H+ Fluxes in Root Growth.” Nature. Springer Nature,
2021. https://doi.org/10.1038/s41586-021-04037-6.
ieee: L. Li et al., “Cell surface and intracellular auxin signalling for
H+ fluxes in root growth,” Nature, vol. 599, no. 7884. Springer
Nature, pp. 273–277, 2021.
ista: Li L, Verstraeten I, Roosjen M, Takahashi K, Rodriguez Solovey L, Merrin J,
Chen J, Shabala L, Smet W, Ren H, Vanneste S, Shabala S, De Rybel B, Weijers D,
Kinoshita T, Gray WM, Friml J. 2021. Cell surface and intracellular auxin signalling
for H+ fluxes in root growth. Nature. 599(7884), 273–277.
mla: Li, Lanxin, et al. “Cell Surface and Intracellular Auxin Signalling for H+
Fluxes in Root Growth.” Nature, vol. 599, no. 7884, Springer Nature, 2021,
pp. 273–77, doi:10.1038/s41586-021-04037-6.
short: L. Li, I. Verstraeten, M. Roosjen, K. Takahashi, L. Rodriguez Solovey, J.
Merrin, J. Chen, L. Shabala, W. Smet, H. Ren, S. Vanneste, S. Shabala, B. De Rybel,
D. Weijers, T. Kinoshita, W.M. Gray, J. Friml, Nature 599 (2021) 273–277.
date_created: 2021-11-07T23:01:25Z
date_published: 2021-11-11T00:00:00Z
date_updated: 2023-10-18T08:30:53Z
day: '11'
department:
- _id: JiFr
- _id: NanoFab
doi: 10.1038/s41586-021-04037-6
ec_funded: 1
external_id:
isi:
- '000713338100006'
pmid:
- '34707283'
intvolume: ' 599'
isi: 1
issue: '7884'
keyword:
- Multidisciplinary
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.doi.org/10.21203/rs.3.rs-266395/v3
month: '11'
oa: 1
oa_version: Preprint
page: 273-277
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: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 26B4D67E-B435-11E9-9278-68D0E5697425
grant_number: '25351'
name: 'A Case Study of Plant Growth Regulation: Molecular Mechanism of Auxin-mediated
Rapid Growth Inhibition in Arabidopsis Root'
publication: Nature
publication_identifier:
eissn:
- '14764687'
issn:
- '00280836'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- description: News on IST Webpage
relation: press_release
url: https://ist.ac.at/en/news/stop-and-grow/
record:
- id: '10095'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Cell surface and intracellular auxin signalling for H+ fluxes in
root growth
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 599
year: '2021'
...
---
_id: '9379'
abstract:
- lang: eng
text: When B cells encounter membrane-bound antigens, the formation and coalescence
of B cell antigen receptor (BCR) microclusters amplifies BCR signaling. The ability
of B cells to probe the surface of antigen-presenting cells (APCs) and respond
to APC-bound antigens requires remodeling of the actin cytoskeleton. Initial BCR
signaling stimulates actin-related protein (Arp) 2/3 complex-dependent actin polymerization,
which drives B cell spreading as well as the centripetal movement and coalescence
of BCR microclusters at the B cell-APC synapse. Sustained actin polymerization
depends on concomitant actin filament depolymerization, which enables the recycling
of actin monomers and Arp2/3 complexes. Cofilin-mediated severing of actin filaments
is a rate-limiting step in the morphological changes that occur during immune
synapse formation. Hence, regulators of cofilin activity such as WD repeat-containing
protein 1 (Wdr1), LIM domain kinase (LIMK), and coactosin-like 1 (Cotl1) may also
be essential for actin-dependent processes in B cells. Wdr1 enhances cofilin-mediated
actin disassembly. Conversely, Cotl1 competes with cofilin for binding to actin
and LIMK phosphorylates cofilin and prevents it from binding to actin filaments.
We now show that Wdr1 and LIMK have distinct roles in BCR-induced assembly of
the peripheral actin structures that drive B cell spreading, and that cofilin,
Wdr1, and LIMK all contribute to the actin-dependent amplification of BCR signaling
at the immune synapse. Depleting Cotl1 had no effect on these processes. Thus,
the Wdr1-LIMK-cofilin axis is critical for BCR-induced actin remodeling and for
B cell responses to APC-bound antigens.
acknowledgement: We thank the UBC Life Sciences Institute Imaging Facility andthe
UBC Flow Cytometry Facility.
article_number: '649433'
article_processing_charge: No
article_type: original
author:
- first_name: Madison
full_name: Bolger-Munro, Madison
id: 516F03FA-93A3-11EA-A7C5-D6BE3DDC885E
last_name: Bolger-Munro
orcid: 0000-0002-8176-4824
- first_name: Kate
full_name: Choi, Kate
last_name: Choi
- first_name: Faith
full_name: Cheung, Faith
last_name: Cheung
- first_name: Yi Tian
full_name: Liu, Yi Tian
last_name: Liu
- first_name: May
full_name: Dang-Lawson, May
last_name: Dang-Lawson
- first_name: Nikola
full_name: Deretic, Nikola
last_name: Deretic
- first_name: Connor
full_name: Keane, Connor
last_name: Keane
- first_name: Michael R.
full_name: Gold, Michael R.
last_name: Gold
citation:
ama: Bolger-Munro M, Choi K, Cheung F, et al. The Wdr1-LIMK-Cofilin axis controls
B cell antigen receptor-induced actin remodeling and signaling at the immune synapse.
Frontiers in Cell and Developmental Biology. 2021;9. doi:10.3389/fcell.2021.649433
apa: Bolger-Munro, M., Choi, K., Cheung, F., Liu, Y. T., Dang-Lawson, M., Deretic,
N., … Gold, M. R. (2021). The Wdr1-LIMK-Cofilin axis controls B cell antigen receptor-induced
actin remodeling and signaling at the immune synapse. Frontiers in Cell and
Developmental Biology. Frontiers Media. https://doi.org/10.3389/fcell.2021.649433
chicago: Bolger-Munro, Madison, Kate Choi, Faith Cheung, Yi Tian Liu, May Dang-Lawson,
Nikola Deretic, Connor Keane, and Michael R. Gold. “The Wdr1-LIMK-Cofilin Axis
Controls B Cell Antigen Receptor-Induced Actin Remodeling and Signaling at the
Immune Synapse.” Frontiers in Cell and Developmental Biology. Frontiers
Media, 2021. https://doi.org/10.3389/fcell.2021.649433.
ieee: M. Bolger-Munro et al., “The Wdr1-LIMK-Cofilin axis controls B cell
antigen receptor-induced actin remodeling and signaling at the immune synapse,”
Frontiers in Cell and Developmental Biology, vol. 9. Frontiers Media, 2021.
ista: Bolger-Munro M, Choi K, Cheung F, Liu YT, Dang-Lawson M, Deretic N, Keane
C, Gold MR. 2021. The Wdr1-LIMK-Cofilin axis controls B cell antigen receptor-induced
actin remodeling and signaling at the immune synapse. Frontiers in Cell and Developmental
Biology. 9, 649433.
mla: Bolger-Munro, Madison, et al. “The Wdr1-LIMK-Cofilin Axis Controls B Cell Antigen
Receptor-Induced Actin Remodeling and Signaling at the Immune Synapse.” Frontiers
in Cell and Developmental Biology, vol. 9, 649433, Frontiers Media, 2021,
doi:10.3389/fcell.2021.649433.
short: M. Bolger-Munro, K. Choi, F. Cheung, Y.T. Liu, M. Dang-Lawson, N. Deretic,
C. Keane, M.R. Gold, Frontiers in Cell and Developmental Biology 9 (2021).
date_created: 2021-05-09T22:01:37Z
date_published: 2021-04-13T00:00:00Z
date_updated: 2023-10-18T08:19:49Z
day: '13'
ddc:
- '570'
department:
- _id: CaHe
doi: 10.3389/fcell.2021.649433
external_id:
isi:
- '000644419500001'
pmid:
- '33928084'
file:
- access_level: open_access
checksum: 8c8a03575d2f7583f88dc3b658b0976b
content_type: application/pdf
creator: kschuh
date_created: 2021-05-11T15:09:23Z
date_updated: 2021-05-11T15:09:23Z
file_id: '9386'
file_name: 2021_Frontiers_Cell_Bolger-Munro.pdf
file_size: 4076024
relation: main_file
success: 1
file_date_updated: 2021-05-11T15:09:23Z
has_accepted_license: '1'
intvolume: ' 9'
isi: 1
keyword:
- B cell
- actin
- immune synapse
- cell spreading
- cofilin
- WDR1 (AIP1)
- LIM domain kinase
- B cell receptor (BCR)
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
pmid: 1
publication: Frontiers in Cell and Developmental Biology
publication_identifier:
eissn:
- 2296-634X
publication_status: published
publisher: Frontiers Media
quality_controlled: '1'
scopus_import: '1'
status: public
title: The Wdr1-LIMK-Cofilin axis controls B cell antigen receptor-induced actin remodeling
and signaling at the immune synapse
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2021'
...
---
_id: '9362'
abstract:
- lang: eng
text: A central goal in systems neuroscience is to understand the functions performed
by neural circuits. Previous top-down models addressed this question by comparing
the behaviour of an ideal model circuit, optimised to perform a given function,
with neural recordings. However, this requires guessing in advance what function
is being performed, which may not be possible for many neural systems. To address
this, we propose an inverse reinforcement learning (RL) framework for inferring
the function performed by a neural network from data. We assume that the responses
of each neuron in a network are optimised so as to drive the network towards ‘rewarded’
states, that are desirable for performing a given function. We then show how one
can use inverse RL to infer the reward function optimised by the network from
observing its responses. This inferred reward function can be used to predict
how the neural network should adapt its dynamics to perform the same function
when the external environment or network structure changes. This could lead to
theoretical predictions about how neural network dynamics adapt to deal with cell
death and/or varying sensory stimulus statistics.
acknowledgement: The authors would like to thank Ulisse Ferrari for useful discussions
and feedback.
article_number: e0248940
article_processing_charge: No
article_type: original
author:
- first_name: Matthew J
full_name: Chalk, Matthew J
id: 2BAAC544-F248-11E8-B48F-1D18A9856A87
last_name: Chalk
orcid: 0000-0001-7782-4436
- first_name: Gašper
full_name: Tkačik, Gašper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkačik
orcid: 0000-0002-6699-1455
- first_name: Olivier
full_name: Marre, Olivier
last_name: Marre
citation:
ama: Chalk MJ, Tkačik G, Marre O. Inferring the function performed by a recurrent
neural network. PLoS ONE. 2021;16(4). doi:10.1371/journal.pone.0248940
apa: Chalk, M. J., Tkačik, G., & Marre, O. (2021). Inferring the function performed
by a recurrent neural network. PLoS ONE. Public Library of Science. https://doi.org/10.1371/journal.pone.0248940
chicago: Chalk, Matthew J, Gašper Tkačik, and Olivier Marre. “Inferring the Function
Performed by a Recurrent Neural Network.” PLoS ONE. Public Library of Science,
2021. https://doi.org/10.1371/journal.pone.0248940.
ieee: M. J. Chalk, G. Tkačik, and O. Marre, “Inferring the function performed by
a recurrent neural network,” PLoS ONE, vol. 16, no. 4. Public Library of
Science, 2021.
ista: Chalk MJ, Tkačik G, Marre O. 2021. Inferring the function performed by a recurrent
neural network. PLoS ONE. 16(4), e0248940.
mla: Chalk, Matthew J., et al. “Inferring the Function Performed by a Recurrent
Neural Network.” PLoS ONE, vol. 16, no. 4, e0248940, Public Library of
Science, 2021, doi:10.1371/journal.pone.0248940.
short: M.J. Chalk, G. Tkačik, O. Marre, PLoS ONE 16 (2021).
date_created: 2021-05-02T22:01:28Z
date_published: 2021-04-15T00:00:00Z
date_updated: 2023-10-18T08:17:42Z
day: '15'
ddc:
- '570'
department:
- _id: GaTk
doi: 10.1371/journal.pone.0248940
external_id:
isi:
- '000641474900072'
pmid:
- '33857170'
file:
- access_level: open_access
checksum: c52da133850307d2031f552d998f00e8
content_type: application/pdf
creator: kschuh
date_created: 2021-05-04T13:22:19Z
date_updated: 2021-05-04T13:22:19Z
file_id: '9371'
file_name: 2021_pone_Chalk.pdf
file_size: 2768282
relation: main_file
success: 1
file_date_updated: 2021-05-04T13:22:19Z
has_accepted_license: '1'
intvolume: ' 16'
isi: 1
issue: '4'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
pmid: 1
publication: PLoS ONE
publication_identifier:
eissn:
- '19326203'
publication_status: published
publisher: Public Library of Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: Inferring the function performed by a recurrent neural network
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 16
year: '2021'
...
---
_id: '9986'
abstract:
- lang: eng
text: Size control is a fundamental question in biology, showing incremental complexity
in plants, whose cells possess a rigid cell wall. The phytohormone auxin is a
vital growth regulator with central importance for differential growth control.
Our results indicate that auxin-reliant growth programs affect the molecular complexity
of xyloglucans, the major type of cell wall hemicellulose in eudicots. Auxin-dependent
induction and repression of growth coincide with reduced and enhanced molecular
complexity of xyloglucans, respectively. In agreement with a proposed function
in growth control, genetic interference with xyloglucan side decorations distinctly
modulates auxin-dependent differential growth rates. Our work proposes that auxin-dependent
growth programs have a spatially defined effect on xyloglucan’s molecular structure,
which in turn affects cell wall mechanics and specifies differential, gravitropic
hypocotyl growth.
acknowledgement: "We are grateful to Paul Knox, Markus Pauly, Malcom O’Neill, and
Ignacio Zarra for providing published material; the BOKU-VIBT Imaging Center for
access and M. Debreczeny for expertise; J.I. Thaker and Georg Seifert for critical
reading.\r\n"
article_number: '9222'
article_processing_charge: Yes
article_type: original
author:
- first_name: Silvia Melina
full_name: Velasquez, Silvia Melina
last_name: Velasquez
- first_name: Xiaoyuan
full_name: Guo, Xiaoyuan
last_name: Guo
- first_name: Marçal
full_name: Gallemi, Marçal
id: 460C6802-F248-11E8-B48F-1D18A9856A87
last_name: Gallemi
orcid: 0000-0003-4675-6893
- first_name: Bibek
full_name: Aryal, Bibek
last_name: Aryal
- first_name: Peter
full_name: Venhuizen, Peter
last_name: Venhuizen
- first_name: Elke
full_name: Barbez, Elke
last_name: Barbez
- first_name: Kai Alexander
full_name: Dünser, Kai Alexander
last_name: Dünser
- first_name: Martin
full_name: Darino, Martin
last_name: Darino
- first_name: Aleš
full_name: Pӗnčík, Aleš
last_name: Pӗnčík
- first_name: Ondřej
full_name: Novák, Ondřej
last_name: Novák
- first_name: Maria
full_name: Kalyna, Maria
last_name: Kalyna
- first_name: Gregory
full_name: Mouille, Gregory
last_name: Mouille
- first_name: Eva
full_name: Benková, Eva
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
- first_name: Rishikesh P.
full_name: Bhalerao, Rishikesh P.
last_name: Bhalerao
- first_name: Jozef
full_name: Mravec, Jozef
last_name: Mravec
- first_name: Jürgen
full_name: Kleine-Vehn, Jürgen
last_name: Kleine-Vehn
citation:
ama: Velasquez SM, Guo X, Gallemi M, et al. Xyloglucan remodeling defines auxin-dependent
differential tissue expansion in plants. International Journal of Molecular
Sciences. 2021;22(17). doi:10.3390/ijms22179222
apa: Velasquez, S. M., Guo, X., Gallemi, M., Aryal, B., Venhuizen, P., Barbez, E.,
… Kleine-Vehn, J. (2021). Xyloglucan remodeling defines auxin-dependent differential
tissue expansion in plants. International Journal of Molecular Sciences.
MDPI. https://doi.org/10.3390/ijms22179222
chicago: Velasquez, Silvia Melina, Xiaoyuan Guo, Marçal Gallemi, Bibek Aryal, Peter
Venhuizen, Elke Barbez, Kai Alexander Dünser, et al. “Xyloglucan Remodeling Defines
Auxin-Dependent Differential Tissue Expansion in Plants.” International Journal
of Molecular Sciences. MDPI, 2021. https://doi.org/10.3390/ijms22179222.
ieee: S. M. Velasquez et al., “Xyloglucan remodeling defines auxin-dependent
differential tissue expansion in plants,” International Journal of Molecular
Sciences, vol. 22, no. 17. MDPI, 2021.
ista: Velasquez SM, Guo X, Gallemi M, Aryal B, Venhuizen P, Barbez E, Dünser KA,
Darino M, Pӗnčík A, Novák O, Kalyna M, Mouille G, Benková E, Bhalerao RP, Mravec
J, Kleine-Vehn J. 2021. Xyloglucan remodeling defines auxin-dependent differential
tissue expansion in plants. International Journal of Molecular Sciences. 22(17),
9222.
mla: Velasquez, Silvia Melina, et al. “Xyloglucan Remodeling Defines Auxin-Dependent
Differential Tissue Expansion in Plants.” International Journal of Molecular
Sciences, vol. 22, no. 17, 9222, MDPI, 2021, doi:10.3390/ijms22179222.
short: S.M. Velasquez, X. Guo, M. Gallemi, B. Aryal, P. Venhuizen, E. Barbez, K.A.
Dünser, M. Darino, A. Pӗnčík, O. Novák, M. Kalyna, G. Mouille, E. Benková, R.P.
Bhalerao, J. Mravec, J. Kleine-Vehn, International Journal of Molecular Sciences
22 (2021).
date_created: 2021-09-05T22:01:24Z
date_published: 2021-08-26T00:00:00Z
date_updated: 2023-10-31T19:29:38Z
day: '26'
ddc:
- '575'
department:
- _id: EvBe
doi: 10.3390/ijms22179222
external_id:
isi:
- '000694347100001'
pmid:
- '34502129'
file:
- access_level: open_access
checksum: 6b7055cf89f1b7ed8594c3fdf56f000b
content_type: application/pdf
creator: cchlebak
date_created: 2021-09-06T12:50:19Z
date_updated: 2021-09-07T09:04:53Z
file_id: '9988'
file_name: 2021_IntJMolecularSciences_Velasquez.pdf
file_size: 2162247
relation: main_file
file_date_updated: 2021-09-07T09:04:53Z
has_accepted_license: '1'
intvolume: ' 22'
isi: 1
issue: '17'
keyword:
- auxin
- growth
- cell wall
- xyloglucans
- hypocotyls
- gravitropism
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
pmid: 1
publication: International Journal of Molecular Sciences
publication_identifier:
eissn:
- 1422-0067
issn:
- 1661-6596
publication_status: published
publisher: MDPI
quality_controlled: '1'
scopus_import: '1'
status: public
title: Xyloglucan remodeling defines auxin-dependent differential tissue expansion
in plants
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 22
year: '2021'
...
---
_id: '9189'
abstract:
- lang: eng
text: Transposable elements exist widely throughout plant genomes and play important
roles in plant evolution. Auxin is an important regulator that is traditionally
associated with root development and drought stress adaptation. The DEEPER ROOTING
1 (DRO1) gene is a key component of rice drought avoidance. Here, we identified
a transposon that acts as an autonomous auxin‐responsive promoter and its presence
at specific genome positions conveys physiological adaptations related to drought
avoidance. Rice varieties with high and auxin‐mediated transcription of DRO1 in
the root tip show deeper and longer root phenotypes and are thus better adapted
to drought. The INDITTO2 transposon contains an auxin response element and displays
auxin‐responsive promoter activity; it is thus able to convey auxin regulation
of transcription to genes in its proximity. In the rice Acuce, which displays
DRO1‐mediated drought adaptation, the INDITTO2 transposon was found to be inserted
at the promoter region of the DRO1 locus. Transgenesis‐based insertion of the
INDITTO2 transposon into the DRO1 promoter of the non‐adapted rice variety Nipponbare
was sufficient to promote its drought avoidance. Our data identify an example
of how transposons can act as promoters and convey hormonal regulation to nearby
loci, improving plant fitness in response to different abiotic stresses.
article_processing_charge: No
article_type: original
author:
- first_name: Y
full_name: Zhao, Y
last_name: Zhao
- first_name: L
full_name: Wu, L
last_name: Wu
- first_name: Q
full_name: Fu, Q
last_name: Fu
- first_name: D
full_name: Wang, D
last_name: Wang
- first_name: J
full_name: Li, J
last_name: Li
- first_name: B
full_name: Yao, B
last_name: Yao
- first_name: S
full_name: Yu, S
last_name: Yu
- first_name: L
full_name: Jiang, L
last_name: Jiang
- first_name: J
full_name: Qian, J
last_name: Qian
- first_name: X
full_name: Zhou, X
last_name: Zhou
- first_name: L
full_name: Han, L
last_name: Han
- first_name: S
full_name: Zhao, S
last_name: Zhao
- first_name: C
full_name: Ma, C
last_name: Ma
- first_name: Y
full_name: Zhang, Y
last_name: Zhang
- first_name: C
full_name: Luo, C
last_name: Luo
- first_name: Q
full_name: Dong, Q
last_name: Dong
- first_name: S
full_name: Li, S
last_name: Li
- first_name: L
full_name: Zhang, L
last_name: Zhang
- first_name: X
full_name: Jiang, X
last_name: Jiang
- first_name: Y
full_name: Li, Y
last_name: Li
- first_name: H
full_name: Luo, H
last_name: Luo
- first_name: K
full_name: Li, K
last_name: Li
- first_name: J
full_name: Yang, J
last_name: Yang
- first_name: Q
full_name: Luo, Q
last_name: Luo
- first_name: L
full_name: Li, L
last_name: Li
- first_name: S
full_name: Peng, S
last_name: Peng
- first_name: H
full_name: Huang, H
last_name: Huang
- first_name: Z
full_name: Zuo, Z
last_name: Zuo
- first_name: C
full_name: Liu, C
last_name: Liu
- first_name: L
full_name: Wang, L
last_name: Wang
- first_name: C
full_name: Li, C
last_name: Li
- first_name: X
full_name: He, X
last_name: He
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Y
full_name: Du, Y
last_name: Du
citation:
ama: Zhao Y, Wu L, Fu Q, et al. INDITTO2 transposon conveys auxin-mediated DRO1
transcription for rice drought avoidance. Plant, Cell & Environment.
2021;44(6):1846-1857. doi:10.1111/pce.14029
apa: Zhao, Y., Wu, L., Fu, Q., Wang, D., Li, J., Yao, B., … Du, Y. (2021). INDITTO2
transposon conveys auxin-mediated DRO1 transcription for rice drought avoidance.
Plant, Cell & Environment. Wiley. https://doi.org/10.1111/pce.14029
chicago: Zhao, Y, L Wu, Q Fu, D Wang, J Li, B Yao, S Yu, et al. “INDITTO2 Transposon
Conveys Auxin-Mediated DRO1 Transcription for Rice Drought Avoidance.” Plant,
Cell & Environment. Wiley, 2021. https://doi.org/10.1111/pce.14029.
ieee: Y. Zhao et al., “INDITTO2 transposon conveys auxin-mediated DRO1 transcription
for rice drought avoidance,” Plant, Cell & Environment, vol. 44, no.
6. Wiley, pp. 1846–1857, 2021.
ista: Zhao Y, Wu L, Fu Q, Wang D, Li J, Yao B, Yu S, Jiang L, Qian J, Zhou X, Han
L, Zhao S, Ma C, Zhang Y, Luo C, Dong Q, Li S, Zhang L, Jiang X, Li Y, Luo H,
Li K, Yang J, Luo Q, Li L, Peng S, Huang H, Zuo Z, Liu C, Wang L, Li C, He X,
Friml J, Du Y. 2021. INDITTO2 transposon conveys auxin-mediated DRO1 transcription
for rice drought avoidance. Plant, Cell & Environment. 44(6), 1846–1857.
mla: Zhao, Y., et al. “INDITTO2 Transposon Conveys Auxin-Mediated DRO1 Transcription
for Rice Drought Avoidance.” Plant, Cell & Environment, vol. 44, no.
6, Wiley, 2021, pp. 1846–57, doi:10.1111/pce.14029.
short: Y. Zhao, L. Wu, Q. Fu, D. Wang, J. Li, B. Yao, S. Yu, L. Jiang, J. Qian,
X. Zhou, L. Han, S. Zhao, C. Ma, Y. Zhang, C. Luo, Q. Dong, S. Li, L. Zhang, X.
Jiang, Y. Li, H. Luo, K. Li, J. Yang, Q. Luo, L. Li, S. Peng, H. Huang, Z. Zuo,
C. Liu, L. Wang, C. Li, X. He, J. Friml, Y. Du, Plant, Cell & Environment
44 (2021) 1846–1857.
date_created: 2021-02-24T10:07:21Z
date_published: 2021-06-01T00:00:00Z
date_updated: 2023-11-07T08:18:36Z
day: '01'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.1111/pce.14029
external_id:
isi:
- '000625398600001'
pmid:
- '33576018'
file:
- access_level: open_access
checksum: a812418fede076741c9c4dc07f317068
content_type: application/pdf
creator: amally
date_created: 2023-11-02T17:02:11Z
date_updated: 2023-11-02T17:02:11Z
file_id: '14481'
file_name: Zhao PlantCellEnv 2021_accepted.pdf
file_size: 8437528
relation: main_file
success: 1
file_date_updated: 2023-11-02T17:02:11Z
has_accepted_license: '1'
intvolume: ' 44'
isi: 1
issue: '6'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 1846-1857
pmid: 1
publication: Plant, Cell & Environment
publication_identifier:
eissn:
- 1365-3040
issn:
- 0140-7791
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: INDITTO2 transposon conveys auxin-mediated DRO1 transcription for rice drought
avoidance
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 44
year: '2021'
...
---
_id: '9792'
abstract:
- lang: eng
text: 'This paper establishes new connections between many-body quantum systems,
One-body Reduced Density Matrices Functional Theory (1RDMFT) and Optimal Transport
(OT), by interpreting the problem of computing the ground-state energy of a finite
dimensional composite quantum system at positive temperature as a non-commutative
entropy regularized Optimal Transport problem. We develop a new approach to fully
characterize the dual-primal solutions in such non-commutative setting. The mathematical
formalism is particularly relevant in quantum chemistry: numerical realizations
of the many-electron ground state energy can be computed via a non-commutative
version of Sinkhorn algorithm. Our approach allows to prove convergence and robustness
of this algorithm, which, to our best knowledge, were unknown even in the two
marginal case. Our methods are based on careful a priori estimates in the dual
problem, which we believe to be of independent interest. Finally, the above results
are extended in 1RDMFT setting, where bosonic or fermionic symmetry conditions
are enforced on the problem.'
acknowledgement: 'This work started when A.G. was visiting the Erwin Schrödinger Institute
and then continued when D.F. and L.P visited the Theoretical Chemistry Department
of the Vrije Universiteit Amsterdam. The authors thanks the hospitality of both
places and, especially, P. Gori-Giorgi and K. Giesbertz for fruitful discussions
and literature suggestions in the early state of the project. Finally, the authors
also thanks J. Maas and R. Seiringer for their feedback and useful comments to a
first draft of the article. L.P. acknowledges support by the Austrian Science Fund
(FWF), grants No W1245 and NoF65. D.F acknowledges support by the European Research
Council (ERC) under the European Union’s Horizon 2020 research and innovation programme
(grant agreements No 716117 and No 694227). A.G. acknowledges funding by the European
Research Council under H2020/MSCA-IF “OTmeetsDFT” [grant ID: 795942].'
article_number: '2106.11217'
article_processing_charge: No
author:
- first_name: Dario
full_name: Feliciangeli, Dario
id: 41A639AA-F248-11E8-B48F-1D18A9856A87
last_name: Feliciangeli
orcid: 0000-0003-0754-8530
- first_name: Augusto
full_name: Gerolin, Augusto
last_name: Gerolin
- first_name: Lorenzo
full_name: Portinale, Lorenzo
id: 30AD2CBC-F248-11E8-B48F-1D18A9856A87
last_name: Portinale
citation:
ama: Feliciangeli D, Gerolin A, Portinale L. A non-commutative entropic optimal
transport approach to quantum composite systems at positive temperature. arXiv.
doi:10.48550/arXiv.2106.11217
apa: Feliciangeli, D., Gerolin, A., & Portinale, L. (n.d.). A non-commutative
entropic optimal transport approach to quantum composite systems at positive temperature.
arXiv. https://doi.org/10.48550/arXiv.2106.11217
chicago: Feliciangeli, Dario, Augusto Gerolin, and Lorenzo Portinale. “A Non-Commutative
Entropic Optimal Transport Approach to Quantum Composite Systems at Positive Temperature.”
ArXiv, n.d. https://doi.org/10.48550/arXiv.2106.11217.
ieee: D. Feliciangeli, A. Gerolin, and L. Portinale, “A non-commutative entropic
optimal transport approach to quantum composite systems at positive temperature,”
arXiv. .
ista: Feliciangeli D, Gerolin A, Portinale L. A non-commutative entropic optimal
transport approach to quantum composite systems at positive temperature. arXiv,
2106.11217.
mla: Feliciangeli, Dario, et al. “A Non-Commutative Entropic Optimal Transport Approach
to Quantum Composite Systems at Positive Temperature.” ArXiv, 2106.11217,
doi:10.48550/arXiv.2106.11217.
short: D. Feliciangeli, A. Gerolin, L. Portinale, ArXiv (n.d.).
date_created: 2021-08-06T09:07:12Z
date_published: 2021-07-21T00:00:00Z
date_updated: 2023-11-14T13:21:01Z
day: '21'
ddc:
- '510'
department:
- _id: RoSe
- _id: JaMa
doi: 10.48550/arXiv.2106.11217
ec_funded: 1
external_id:
arxiv:
- '2106.11217'
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2106.11217
month: '07'
oa: 1
oa_version: Preprint
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '716117'
name: Optimal Transport and Stochastic Dynamics
- _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2
grant_number: F6504
name: Taming Complexity in Partial Differential Systems
publication: arXiv
publication_status: submitted
related_material:
record:
- id: '9733'
relation: dissertation_contains
status: public
- id: '10030'
relation: dissertation_contains
status: public
- id: '12911'
relation: later_version
status: public
status: public
title: A non-commutative entropic optimal transport approach to quantum composite
systems at positive temperature
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: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10655'
abstract:
- lang: eng
text: "Adeno-associated viruses (AAVs) are widely used to deliver genetic material
in vivo to distinct cell types such as neurons or glial cells, allowing for targeted
manipulation. Transduction of microglia is mostly excluded from this strategy,
likely due to the cells’ heterogeneous state upon environmental changes, which
makes AAV design challenging. Here, we established the retina as a model system
for microglial AAV validation and optimization. First, we show that AAV2/6 transduced
microglia in both synaptic layers, where layer preference corresponds to the intravitreal
or subretinal delivery method. Surprisingly, we observed significantly enhanced
microglial transduction during photoreceptor degeneration. Thus, we modified the
AAV6 capsid to reduce heparin binding by introducing four point mutations (K531E,
R576Q, K493S, and K459S), resulting in increased microglial transduction in the
outer plexiform layer. Finally, to improve microglial-specific transduction, we
validated a Cre-dependent transgene delivery cassette for use in combination with
the Cx3cr1CreERT2 mouse line. Together, our results provide a foundation for future
studies optimizing AAV-mediated microglia transduction and highlight that environmental
conditions influence microglial transduction efficiency.\r\n"
acknowledged_ssus:
- _id: Bio
- _id: LifeSc
- _id: PreCl
acknowledgement: This project has received funding from the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme
(grant agreement no. 715571). The research was supported by the Scientific Service
Units (SSU) of IST Austria through resources provided by the Bioimaging Facility,
the Life Science Facility, and the Pre-Clinical Facility, namely Sonja Haslinger
and Michael Schunn for their animal colony management and support. We would also
like to thank Chakrabarty Lab for sharing the plasmids for AAV2/6 production. Finally,
we would like to thank the Siegert team members for discussion about the manuscript.
article_processing_charge: Yes
article_type: original
author:
- 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: Gabriele M.
full_name: Wögenstein, Gabriele M.
last_name: Wögenstein
- first_name: Gloria
full_name: Colombo, Gloria
id: 3483CF6C-F248-11E8-B48F-1D18A9856A87
last_name: Colombo
orcid: 0000-0001-9434-8902
- first_name: Raquel
full_name: Casado Polanco, Raquel
id: 15240fc1-dbcd-11ea-9d1d-ac5a786425fd
last_name: Casado Polanco
orcid: 0000-0001-8293-4568
- first_name: Sandra
full_name: Siegert, Sandra
id: 36ACD32E-F248-11E8-B48F-1D18A9856A87
last_name: Siegert
orcid: 0000-0001-8635-0877
citation:
ama: Maes ME, Wögenstein GM, Colombo G, Casado Polanco R, Siegert S. Optimizing
AAV2/6 microglial targeting identified enhanced efficiency in the photoreceptor
degenerative environment. Molecular Therapy - Methods and Clinical Development.
2021;23:210-224. doi:10.1016/j.omtm.2021.09.006
apa: Maes, M. E., Wögenstein, G. M., Colombo, G., Casado Polanco, R., & Siegert,
S. (2021). Optimizing AAV2/6 microglial targeting identified enhanced efficiency
in the photoreceptor degenerative environment. Molecular Therapy - Methods
and Clinical Development. Elsevier. https://doi.org/10.1016/j.omtm.2021.09.006
chicago: Maes, Margaret E, Gabriele M. Wögenstein, Gloria Colombo, Raquel Casado
Polanco, and Sandra Siegert. “Optimizing AAV2/6 Microglial Targeting Identified
Enhanced Efficiency in the Photoreceptor Degenerative Environment.” Molecular
Therapy - Methods and Clinical Development. Elsevier, 2021. https://doi.org/10.1016/j.omtm.2021.09.006.
ieee: M. E. Maes, G. M. Wögenstein, G. Colombo, R. Casado Polanco, and S. Siegert,
“Optimizing AAV2/6 microglial targeting identified enhanced efficiency in the
photoreceptor degenerative environment,” Molecular Therapy - Methods and Clinical
Development, vol. 23. Elsevier, pp. 210–224, 2021.
ista: Maes ME, Wögenstein GM, Colombo G, Casado Polanco R, Siegert S. 2021. Optimizing
AAV2/6 microglial targeting identified enhanced efficiency in the photoreceptor
degenerative environment. Molecular Therapy - Methods and Clinical Development.
23, 210–224.
mla: Maes, Margaret E., et al. “Optimizing AAV2/6 Microglial Targeting Identified
Enhanced Efficiency in the Photoreceptor Degenerative Environment.” Molecular
Therapy - Methods and Clinical Development, vol. 23, Elsevier, 2021, pp. 210–24,
doi:10.1016/j.omtm.2021.09.006.
short: M.E. Maes, G.M. Wögenstein, G. Colombo, R. Casado Polanco, S. Siegert, Molecular
Therapy - Methods and Clinical Development 23 (2021) 210–224.
date_created: 2022-01-23T23:01:28Z
date_published: 2021-12-10T00:00:00Z
date_updated: 2023-11-16T13:12:03Z
day: '10'
ddc:
- '570'
department:
- _id: SaSi
- _id: SiHi
doi: 10.1016/j.omtm.2021.09.006
ec_funded: 1
external_id:
isi:
- '000748748500019'
file:
- access_level: open_access
checksum: 77dc540e8011c5475031bdf6ccef20a6
content_type: application/pdf
creator: cchlebak
date_created: 2022-01-24T07:43:09Z
date_updated: 2022-01-24T07:43:09Z
file_id: '10657'
file_name: 2021_MolTherMethodsClinDev_Maes.pdf
file_size: 4794147
relation: main_file
success: 1
file_date_updated: 2022-01-24T07:43:09Z
has_accepted_license: '1'
intvolume: ' 23'
isi: 1
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 210-224
project:
- _id: 25D4A630-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715571'
name: Microglia action towards neuronal circuit formation and function in health
and disease
publication: Molecular Therapy - Methods and Clinical Development
publication_identifier:
eissn:
- 2329-0501
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optimizing AAV2/6 microglial targeting identified enhanced efficiency in the
photoreceptor degenerative environment
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: 23
year: '2021'
...
---
_id: '10565'
abstract:
- lang: eng
text: 'Enzymatic digestion of the extracellular matrix with chondroitinase-ABC reinstates
juvenile-like plasticity in the adult cortex as it also disassembles the perineuronal
nets (PNNs). The disadvantage of the enzyme is that it must be applied intracerebrally
and it degrades the ECM for several weeks. Here, we provide two minimally invasive
and transient protocols for microglia-enabled PNN disassembly in mouse cortex:
repeated treatment with ketamine-xylazine-acepromazine (KXA) anesthesia and 60-Hz
light entrainment. We also discuss how to analyze PNNs within microglial endosomes-lysosomes.
For complete details on the use and execution of this protocol, please refer to
Venturino et al. (2021).'
acknowledged_ssus:
- _id: Bio
acknowledgement: This research was supported by the European Research Council (grant
715571 to S.S.). We thank Rouven Schulz, Michael Schunn, Claudia Gold, Gabriel Krens,
Sarah Gorkiewicz, Margaret Maes, Jürgen Siegert, Marco Benevento, and Sara Oakeley
for comments on the manuscript and the IST Austria Bioimaging Facility for the technical
support.
article_number: '101012'
article_processing_charge: Yes
article_type: original
author:
- first_name: Alessandro
full_name: Venturino, Alessandro
id: 41CB84B2-F248-11E8-B48F-1D18A9856A87
last_name: Venturino
orcid: 0000-0003-2356-9403
- first_name: Sandra
full_name: Siegert, Sandra
id: 36ACD32E-F248-11E8-B48F-1D18A9856A87
last_name: Siegert
orcid: 0000-0001-8635-0877
citation:
ama: Venturino A, Siegert S. Minimally invasive protocols and quantification for
microglia-mediated perineuronal net disassembly in mouse brain. STAR Protocols.
2021;2(4). doi:10.1016/j.xpro.2021.101012
apa: Venturino, A., & Siegert, S. (2021). Minimally invasive protocols and quantification
for microglia-mediated perineuronal net disassembly in mouse brain. STAR Protocols.
Elsevier ; Cell Press. https://doi.org/10.1016/j.xpro.2021.101012
chicago: Venturino, Alessandro, and Sandra Siegert. “Minimally Invasive Protocols
and Quantification for Microglia-Mediated Perineuronal Net Disassembly in Mouse
Brain.” STAR Protocols. Elsevier ; Cell Press, 2021. https://doi.org/10.1016/j.xpro.2021.101012.
ieee: A. Venturino and S. Siegert, “Minimally invasive protocols and quantification
for microglia-mediated perineuronal net disassembly in mouse brain,” STAR Protocols,
vol. 2, no. 4. Elsevier ; Cell Press, 2021.
ista: Venturino A, Siegert S. 2021. Minimally invasive protocols and quantification
for microglia-mediated perineuronal net disassembly in mouse brain. STAR Protocols.
2(4), 101012.
mla: Venturino, Alessandro, and Sandra Siegert. “Minimally Invasive Protocols and
Quantification for Microglia-Mediated Perineuronal Net Disassembly in Mouse Brain.”
STAR Protocols, vol. 2, no. 4, 101012, Elsevier ; Cell Press, 2021, doi:10.1016/j.xpro.2021.101012.
short: A. Venturino, S. Siegert, STAR Protocols 2 (2021).
date_created: 2021-12-19T23:01:32Z
date_published: 2021-12-17T00:00:00Z
date_updated: 2023-11-16T13:11:04Z
day: '17'
ddc:
- '573'
department:
- _id: SaSi
doi: 10.1016/j.xpro.2021.101012
ec_funded: 1
file:
- access_level: open_access
checksum: 9ea2501056c5df99e84726b845e9b976
content_type: application/pdf
creator: cchlebak
date_created: 2021-12-20T08:58:40Z
date_updated: 2021-12-20T08:58:40Z
file_id: '10570'
file_name: 2021_STARProt_Venturino.pdf
file_size: 6207060
relation: main_file
success: 1
file_date_updated: 2021-12-20T08:58:40Z
has_accepted_license: '1'
intvolume: ' 2'
issue: '4'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 25D4A630-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715571'
name: Microglia action towards neuronal circuit formation and function in health
and disease
publication: STAR Protocols
publication_identifier:
eissn:
- 2666-1667
publication_status: published
publisher: Elsevier ; Cell Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Minimally invasive protocols and quantification for microglia-mediated perineuronal
net disassembly in mouse brain
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: 2
year: '2021'
...
---
_id: '10321'
abstract:
- lang: eng
text: Mosaic analysis with double markers (MADM) technology enables the generation
of genetic mosaic tissue in mice. MADM enables concomitant fluorescent cell labeling
and introduction of a mutation of a gene of interest with single-cell resolution.
This protocol highlights major steps for the generation of genetic mosaic tissue
and the isolation and processing of respective tissues for downstream histological
analysis. For complete details on the use and execution of this protocol, please
refer to Contreras et al. (2021).
acknowledged_ssus:
- _id: Bio
- _id: PreCl
acknowledgement: This research was supported by the Scientific Service Units (SSU)
at IST Austria through resources provided by the Bioimaging (BIF) and Preclinical
Facilities (PCF). We particularly thank Mohammad Goudarzi for assistance with photography
of mouse perfusion and dissection. N.A. received support from FWF Firnberg-Programm
(T 1031). This work was also supported by IST Austria institutional funds; FWF SFB
F78 to S.H.; and the European Research Council (ERC) under the European Union’s
Horizon 2020 research and innovation programme (grant agreement no. 725780 LinPro)
to S.H.
article_number: '100939'
article_processing_charge: Yes
article_type: original
author:
- first_name: Nicole
full_name: Amberg, Nicole
id: 4CD6AAC6-F248-11E8-B48F-1D18A9856A87
last_name: Amberg
orcid: 0000-0002-3183-8207
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
citation:
ama: Amberg N, Hippenmeyer S. Genetic mosaic dissection of candidate genes in mice
using mosaic analysis with double markers. STAR Protocols. 2021;2(4). doi:10.1016/j.xpro.2021.100939
apa: Amberg, N., & Hippenmeyer, S. (2021). Genetic mosaic dissection of candidate
genes in mice using mosaic analysis with double markers. STAR Protocols.
Cell Press. https://doi.org/10.1016/j.xpro.2021.100939
chicago: Amberg, Nicole, and Simon Hippenmeyer. “Genetic Mosaic Dissection of Candidate
Genes in Mice Using Mosaic Analysis with Double Markers.” STAR Protocols.
Cell Press, 2021. https://doi.org/10.1016/j.xpro.2021.100939.
ieee: N. Amberg and S. Hippenmeyer, “Genetic mosaic dissection of candidate genes
in mice using mosaic analysis with double markers,” STAR Protocols, vol.
2, no. 4. Cell Press, 2021.
ista: Amberg N, Hippenmeyer S. 2021. Genetic mosaic dissection of candidate genes
in mice using mosaic analysis with double markers. STAR Protocols. 2(4), 100939.
mla: Amberg, Nicole, and Simon Hippenmeyer. “Genetic Mosaic Dissection of Candidate
Genes in Mice Using Mosaic Analysis with Double Markers.” STAR Protocols,
vol. 2, no. 4, 100939, Cell Press, 2021, doi:10.1016/j.xpro.2021.100939.
short: N. Amberg, S. Hippenmeyer, STAR Protocols 2 (2021).
date_created: 2021-11-21T23:01:28Z
date_published: 2021-11-10T00:00:00Z
date_updated: 2023-11-16T13:08:03Z
day: '10'
ddc:
- '573'
department:
- _id: SiHi
doi: 10.1016/j.xpro.2021.100939
ec_funded: 1
file:
- access_level: open_access
checksum: 9e3f6d06bf583e7a8b6a9e9a60500a28
content_type: application/pdf
creator: cchlebak
date_created: 2021-11-22T08:23:58Z
date_updated: 2021-11-22T08:23:58Z
file_id: '10329'
file_name: 2021_STARProtocols_Amberg.pdf
file_size: 7309464
relation: main_file
success: 1
file_date_updated: 2021-11-22T08:23:58Z
has_accepted_license: '1'
intvolume: ' 2'
issue: '4'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 260018B0-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '725780'
name: Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development
- _id: 268F8446-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: T0101031
name: Role of Eed in neural stem cell lineage progression
- _id: 059F6AB4-7A3F-11EA-A408-12923DDC885E
grant_number: F07805
name: Molecular Mechanisms of Neural Stem Cell Lineage Progression
publication: STAR Protocols
publication_identifier:
eissn:
- 2666-1667
publication_status: published
publisher: Cell Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Genetic mosaic dissection of candidate genes in mice using mosaic analysis
with double markers
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: 2
year: '2021'
...
---
_id: '10290'
abstract:
- lang: eng
text: A precise quantitative description of the ultrastructural characteristics
underlying biological mechanisms is often key to their understanding. This is
particularly true for dynamic extra- and intracellular filamentous assemblies,
playing a role in cell motility, cell integrity, cytokinesis, tissue formation
and maintenance. For example, genetic manipulation or modulation of actin regulatory
proteins frequently manifests in changes of the morphology, dynamics, and ultrastructural
architecture of actin filament-rich cell peripheral structures, such as lamellipodia
or filopodia. However, the observed ultrastructural effects often remain subtle
and require sufficiently large datasets for appropriate quantitative analysis.
The acquisition of such large datasets has been enabled by recent advances in
high-throughput cryo-electron tomography (cryo-ET) methods. This also necessitates
the development of complementary approaches to maximize the extraction of relevant
biological information. We have developed a computational toolbox for the semi-automatic
quantification of segmented and vectorized filamentous networks from pre-processed
cryo-electron tomograms, facilitating the analysis and cross-comparison of multiple
experimental conditions. GUI-based components simplify the processing of data
and allow users to obtain a large number of ultrastructural parameters describing
filamentous assemblies. We demonstrate the feasibility of this workflow by analyzing
cryo-ET data of untreated and chemically perturbed branched actin filament networks
and that of parallel actin filament arrays. In principle, the computational toolbox
presented here is applicable for data analysis comprising any type of filaments
in regular (i.e. parallel) or random arrangement. We show that it can ease the
identification of key differences between experimental groups and facilitate the
in-depth analysis of ultrastructural data in a time-efficient manner.
acknowledged_ssus:
- _id: ScienComp
- _id: LifeSc
- _id: Bio
- _id: EM-Fac
acknowledgement: 'This research was supported by the Scientific Service Units (SSUs)
of IST Austria through resources provided by Scientific Computing (SciComp), the
Life Science Facility (LSF), the BioImaging Facility (BIF), and the Electron Microscopy
Facility (EMF). We also thank Victor-Valentin Hodirnau for help with cryo-ET data
acquisition. The authors acknowledge support from IST Austria and from the Austrian
Science Fund (FWF): M02495 to G.D. and Austrian Science Fund (FWF): P33367 to F.K.M.S.'
article_number: '107808'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Georgi A
full_name: Dimchev, Georgi A
id: 38C393BE-F248-11E8-B48F-1D18A9856A87
last_name: Dimchev
orcid: 0000-0001-8370-6161
- first_name: Behnam
full_name: Amiri, Behnam
last_name: Amiri
- first_name: Florian
full_name: Fäßler, Florian
id: 404F5528-F248-11E8-B48F-1D18A9856A87
last_name: Fäßler
orcid: 0000-0001-7149-769X
- first_name: Martin
full_name: Falcke, Martin
last_name: Falcke
- first_name: Florian KM
full_name: Schur, Florian KM
id: 48AD8942-F248-11E8-B48F-1D18A9856A87
last_name: Schur
orcid: 0000-0003-4790-8078
citation:
ama: Dimchev GA, Amiri B, Fäßler F, Falcke M, Schur FK. Computational toolbox for
ultrastructural quantitative analysis of filament networks in cryo-ET data. Journal
of Structural Biology. 2021;213(4). doi:10.1016/j.jsb.2021.107808
apa: Dimchev, G. A., Amiri, B., Fäßler, F., Falcke, M., & Schur, F. K. (2021).
Computational toolbox for ultrastructural quantitative analysis of filament networks
in cryo-ET data. Journal of Structural Biology. Elsevier . https://doi.org/10.1016/j.jsb.2021.107808
chicago: Dimchev, Georgi A, Behnam Amiri, Florian Fäßler, Martin Falcke, and Florian
KM Schur. “Computational Toolbox for Ultrastructural Quantitative Analysis of
Filament Networks in Cryo-ET Data.” Journal of Structural Biology. Elsevier
, 2021. https://doi.org/10.1016/j.jsb.2021.107808.
ieee: G. A. Dimchev, B. Amiri, F. Fäßler, M. Falcke, and F. K. Schur, “Computational
toolbox for ultrastructural quantitative analysis of filament networks in cryo-ET
data,” Journal of Structural Biology, vol. 213, no. 4. Elsevier , 2021.
ista: Dimchev GA, Amiri B, Fäßler F, Falcke M, Schur FK. 2021. Computational toolbox
for ultrastructural quantitative analysis of filament networks in cryo-ET data.
Journal of Structural Biology. 213(4), 107808.
mla: Dimchev, Georgi A., et al. “Computational Toolbox for Ultrastructural Quantitative
Analysis of Filament Networks in Cryo-ET Data.” Journal of Structural Biology,
vol. 213, no. 4, 107808, Elsevier , 2021, doi:10.1016/j.jsb.2021.107808.
short: G.A. Dimchev, B. Amiri, F. Fäßler, M. Falcke, F.K. Schur, Journal of Structural
Biology 213 (2021).
date_created: 2021-11-15T12:21:42Z
date_published: 2021-11-03T00:00:00Z
date_updated: 2023-11-21T08:36:02Z
day: '03'
ddc:
- '572'
department:
- _id: FlSc
doi: 10.1016/j.jsb.2021.107808
external_id:
isi:
- '000720259500002'
file:
- access_level: open_access
checksum: 6b209e4d44775d4e02b50f78982c15fa
content_type: application/pdf
creator: cchlebak
date_created: 2021-11-15T13:11:27Z
date_updated: 2021-11-15T13:11:27Z
file_id: '10291'
file_name: 2021_JournalStructBiol_Dimchev.pdf
file_size: 16818304
relation: main_file
success: 1
file_date_updated: 2021-11-15T13:11:27Z
has_accepted_license: '1'
intvolume: ' 213'
isi: 1
issue: '4'
keyword:
- Structural Biology
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 9B954C5C-BA93-11EA-9121-9846C619BF3A
grant_number: P33367
name: Structure and isoform diversity of the Arp2/3 complex
- _id: 2674F658-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02495
name: Protein structure and function in filopodia across scales
publication: Journal of Structural Biology
publication_identifier:
issn:
- 1047-8477
publication_status: published
publisher: 'Elsevier '
quality_controlled: '1'
related_material:
record:
- id: '14502'
relation: software
status: public
scopus_import: '1'
status: public
title: Computational toolbox for ultrastructural quantitative analysis of filament
networks in cryo-ET data
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 213
year: '2021'
...
---
_id: '9969'
abstract:
- lang: eng
text: 'Payment channel networks are a promising approach to improve the scalability
of cryptocurrencies: they allow to perform transactions in a peer-to-peer fashion,
along multihop routes in the network, without requiring consensus on the blockchain.
However, during the discovery of cost-efficient routes for the transaction, critical
information may be revealed about the transacting entities. This paper initiates
the study of privacy-preserving route discovery mechanisms for payment channel
networks. In particular, we present LightPIR, an approach which allows a client
to learn the shortest (or cheapest in terms of fees) path between two nodes without
revealing any information about the endpoints of the transaction to the servers.
The two main observations which allow for an efficient solution in LightPIR are
that: (1) surprisingly, hub labelling algorithms – which were developed to preprocess
“street network like” graphs so one can later efficiently compute shortest paths
– also perform well for the graphs underlying payment channel networks, and that
(2) hub labelling algorithms can be conveniently combined with private information
retrieval. LightPIR relies on a simple hub labeling heuristic on top of existing
hub labeling algorithms which leverages the specific topological features of cryptocurrency
networks to further minimize storage and bandwidth overheads. In a case study
considering the Lightning network, we show that our approach is an order of magnitude
more efficient compared to a privacy-preserving baseline based on using private
information retrieval on a database that stores all pairs shortest paths.'
article_processing_charge: No
author:
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Iosif
full_name: Salem, Iosif
last_name: Salem
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Michelle X
full_name: Yeo, Michelle X
id: 2D82B818-F248-11E8-B48F-1D18A9856A87
last_name: Yeo
citation:
ama: 'Pietrzak KZ, Salem I, Schmid S, Yeo MX. LightPIR: Privacy-preserving route
discovery for payment channel networks. In: IEEE; 2021. doi:10.23919/IFIPNetworking52078.2021.9472205'
apa: 'Pietrzak, K. Z., Salem, I., Schmid, S., & Yeo, M. X. (2021). LightPIR:
Privacy-preserving route discovery for payment channel networks. Presented at
the 2021 IFIP Networking Conference (IFIP Networking), Espoo and Helsinki, Finland:
IEEE. https://doi.org/10.23919/IFIPNetworking52078.2021.9472205'
chicago: 'Pietrzak, Krzysztof Z, Iosif Salem, Stefan Schmid, and Michelle X Yeo.
“LightPIR: Privacy-Preserving Route Discovery for Payment Channel Networks.” IEEE,
2021. https://doi.org/10.23919/IFIPNetworking52078.2021.9472205.'
ieee: 'K. Z. Pietrzak, I. Salem, S. Schmid, and M. X. Yeo, “LightPIR: Privacy-preserving
route discovery for payment channel networks,” presented at the 2021 IFIP Networking
Conference (IFIP Networking), Espoo and Helsinki, Finland, 2021.'
ista: 'Pietrzak KZ, Salem I, Schmid S, Yeo MX. 2021. LightPIR: Privacy-preserving
route discovery for payment channel networks. 2021 IFIP Networking Conference
(IFIP Networking).'
mla: 'Pietrzak, Krzysztof Z., et al. LightPIR: Privacy-Preserving Route Discovery
for Payment Channel Networks. IEEE, 2021, doi:10.23919/IFIPNetworking52078.2021.9472205.'
short: K.Z. Pietrzak, I. Salem, S. Schmid, M.X. Yeo, in:, IEEE, 2021.
conference:
end_date: 2021-06-24
location: Espoo and Helsinki, Finland
name: 2021 IFIP Networking Conference (IFIP Networking)
start_date: 2021-06-21
date_created: 2021-08-29T22:01:16Z
date_published: 2021-06-21T00:00:00Z
date_updated: 2023-11-30T10:54:50Z
day: '21'
department:
- _id: KrPi
doi: 10.23919/IFIPNetworking52078.2021.9472205
ec_funded: 1
external_id:
arxiv:
- '2104.04293'
isi:
- '000853016800008'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2104.04293
month: '06'
oa: 1
oa_version: Submitted Version
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_identifier:
eisbn:
- 978-3-9031-7639-3
eissn:
- 1861-2288
isbn:
- 978-1-6654-4501-6
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '14506'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'LightPIR: Privacy-preserving route discovery for payment channel networks'
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2021'
...
---
_id: '9644'
abstract:
- lang: eng
text: 'We present a new approach to proving non-termination of non-deterministic
integer programs. Our technique is rather simple but efficient. It relies on a
purely syntactic reversal of the program''s transition system followed by a constraint-based
invariant synthesis with constraints coming from both the original and the reversed
transition system. The latter task is performed by a simple call to an off-the-shelf
SMT-solver, which allows us to leverage the latest advances in SMT-solving. Moreover,
our method offers a combination of features not present (as a whole) in previous
approaches: it handles programs with non-determinism, provides relative completeness
guarantees and supports programs with polynomial arithmetic. The experiments performed
with our prototype tool RevTerm show that our approach, despite its simplicity
and stronger theoretical guarantees, is at least on par with the state-of-the-art
tools, often achieving a non-trivial improvement under a proper configuration
of its parameters.'
acknowledgement: We thank the anonymous reviewers for their helpful comments. This
research was partially supported by the ERCCoG 863818 (ForM-SMArt) and the Czech
Science Foundation grant No. GJ19-15134Y.
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Ehsan Kafshdar
full_name: Goharshady, Ehsan Kafshdar
last_name: Goharshady
- first_name: Petr
full_name: Novotný, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotný
- first_name: Dorde
full_name: Zikelic, Dorde
id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
last_name: Zikelic
orcid: 0000-0002-4681-1699
citation:
ama: 'Chatterjee K, Goharshady EK, Novotný P, Zikelic D. Proving non-termination
by program reversal. In: Proceedings of the 42nd ACM SIGPLAN International
Conference on Programming Language Design and Implementation. Association
for Computing Machinery; 2021:1033-1048. doi:10.1145/3453483.3454093'
apa: 'Chatterjee, K., Goharshady, E. K., Novotný, P., & Zikelic, D. (2021).
Proving non-termination by program reversal. In Proceedings of the 42nd ACM
SIGPLAN International Conference on Programming Language Design and Implementation
(pp. 1033–1048). Online: Association for Computing Machinery. https://doi.org/10.1145/3453483.3454093'
chicago: Chatterjee, Krishnendu, Ehsan Kafshdar Goharshady, Petr Novotný, and Dorde
Zikelic. “Proving Non-Termination by Program Reversal.” In Proceedings of the
42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation,
1033–48. Association for Computing Machinery, 2021. https://doi.org/10.1145/3453483.3454093.
ieee: K. Chatterjee, E. K. Goharshady, P. Novotný, and D. Zikelic, “Proving non-termination
by program reversal,” in Proceedings of the 42nd ACM SIGPLAN International
Conference on Programming Language Design and Implementation, Online, 2021,
pp. 1033–1048.
ista: 'Chatterjee K, Goharshady EK, Novotný P, Zikelic D. 2021. Proving non-termination
by program reversal. Proceedings of the 42nd ACM SIGPLAN International Conference
on Programming Language Design and Implementation. PLDI: Programming Language
Design and Implementation, 1033–1048.'
mla: Chatterjee, Krishnendu, et al. “Proving Non-Termination by Program Reversal.”
Proceedings of the 42nd ACM SIGPLAN International Conference on Programming
Language Design and Implementation, Association for Computing Machinery, 2021,
pp. 1033–48, doi:10.1145/3453483.3454093.
short: K. Chatterjee, E.K. Goharshady, P. Novotný, D. Zikelic, in:, Proceedings
of the 42nd ACM SIGPLAN International Conference on Programming Language Design
and Implementation, Association for Computing Machinery, 2021, pp. 1033–1048.
conference:
end_date: 2021-06-26
location: Online
name: 'PLDI: Programming Language Design and Implementation'
start_date: 2021-06-20
date_created: 2021-07-11T22:01:17Z
date_published: 2021-06-01T00:00:00Z
date_updated: 2023-11-30T10:55:37Z
day: '01'
department:
- _id: KrCh
doi: 10.1145/3453483.3454093
ec_funded: 1
external_id:
arxiv:
- '2104.01189'
isi:
- '000723661700067'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2104.01189
month: '06'
oa: 1
oa_version: Preprint
page: 1033-1048
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming
Language Design and Implementation
publication_identifier:
isbn:
- '9781450383912'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '14539'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Proving non-termination by program reversal
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2021'
...
---
_id: '9760'
abstract:
- lang: eng
text: "The quantum approximate optimization algorithm (QAOA) is a prospective near-term
quantum algorithm due to its modest circuit depth and promising benchmarks. However,
an external parameter optimization required in the QAOA could become a performance
bottleneck. This motivates studies of the optimization landscape and search for
heuristic ways of parameter initialization. In this work we visualize the optimization
landscape of the QAOA applied to the MaxCut problem on random graphs, demonstrating
that random initialization of the QAOA is prone to converging to local minima
with suboptimal performance. We introduce the initialization of QAOA parameters
based on the Trotterized quantum annealing (TQA) protocol, parameterized by the
Trotter time step. We find that the TQA initialization allows to circumvent\r\nthe
issue of false minima for a broad range of time steps, yielding the same performance
as the best result out of an exponentially scaling number of random initializations.
Moreover, we demonstrate that the optimal value of the time step coincides with
the point of proliferation of Trotter errors in quantum annealing. Our results
suggest practical ways of initializing QAOA protocols on near-term quantum devices
and reveal new connections between QAOA and quantum annealing."
acknowledgement: We would like to thank D. Abanin and R. Medina for fruitful discussions
and A. Smith and I. Kim for valuable feedback on the manuscript. We acknowledge
support by the European Research Council (ERC) under the European Union’s Horizon
2020 research and innovation program (Grant Agreement No. 850899).
article_number: '491'
article_processing_charge: Yes
article_type: original
author:
- first_name: Stefan
full_name: Sack, Stefan
id: dd622248-f6e0-11ea-865d-ce382a1c81a5
last_name: Sack
orcid: 0000-0001-5400-8508
- first_name: Maksym
full_name: Serbyn, Maksym
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
citation:
ama: Sack S, Serbyn M. Quantum annealing initialization of the quantum approximate
optimization algorithm. Quantum. 2021;5. doi:10.22331/Q-2021-07-01-491
apa: Sack, S., & Serbyn, M. (2021). Quantum annealing initialization of the
quantum approximate optimization algorithm. Quantum. Verein zur Förderung
des Open Access Publizierens in den Quantenwissenschaften. https://doi.org/10.22331/Q-2021-07-01-491
chicago: Sack, Stefan, and Maksym Serbyn. “Quantum Annealing Initialization of the
Quantum Approximate Optimization Algorithm.” Quantum. Verein zur Förderung
des Open Access Publizierens in den Quantenwissenschaften, 2021. https://doi.org/10.22331/Q-2021-07-01-491.
ieee: S. Sack and M. Serbyn, “Quantum annealing initialization of the quantum approximate
optimization algorithm,” Quantum, vol. 5. Verein zur Förderung des Open
Access Publizierens in den Quantenwissenschaften, 2021.
ista: Sack S, Serbyn M. 2021. Quantum annealing initialization of the quantum approximate
optimization algorithm. Quantum. 5, 491.
mla: Sack, Stefan, and Maksym Serbyn. “Quantum Annealing Initialization of the Quantum
Approximate Optimization Algorithm.” Quantum, vol. 5, 491, Verein zur Förderung
des Open Access Publizierens in den Quantenwissenschaften, 2021, doi:10.22331/Q-2021-07-01-491.
short: S. Sack, M. Serbyn, Quantum 5 (2021).
date_created: 2021-08-01T22:01:21Z
date_published: 2021-07-01T00:00:00Z
date_updated: 2023-12-13T14:47:25Z
day: '01'
ddc:
- '530'
department:
- _id: GradSch
- _id: MaSe
doi: 10.22331/Q-2021-07-01-491
ec_funded: 1
external_id:
arxiv:
- '2101.05742'
isi:
- '000669830600001'
file:
- access_level: open_access
checksum: 9706c2bb8e748e9b5b138381995a7f6f
content_type: application/pdf
creator: cchlebak
date_created: 2021-08-06T06:44:31Z
date_updated: 2021-08-06T06:44:31Z
file_id: '9774'
file_name: 2021_Quantum_Sack.pdf
file_size: 2312482
relation: main_file
file_date_updated: 2021-08-06T06:44:31Z
has_accepted_license: '1'
intvolume: ' 5'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 23841C26-32DE-11EA-91FC-C7463DDC885E
call_identifier: H2020
grant_number: '850899'
name: 'Non-Ergodic Quantum Matter: Universality, Dynamics and Control'
publication: Quantum
publication_identifier:
eissn:
- 2521-327X
publication_status: published
publisher: Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
quality_controlled: '1'
related_material:
record:
- id: '14622'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Quantum annealing initialization of the quantum approximate optimization algorithm
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2021'
...
---
_id: '10414'
abstract:
- lang: eng
text: 'We consider the almost-sure (a.s.) termination problem for probabilistic
programs, which are a stochastic extension of classical imperative programs. Lexicographic
ranking functions provide a sound and practical approach for termination of non-probabilistic
programs, and their extension to probabilistic programs is achieved via lexicographic
ranking supermartingales (LexRSMs). However, LexRSMs introduced in the previous
work have a limitation that impedes their automation: all of their components
have to be non-negative in all reachable states. This might result in LexRSM not
existing even for simple terminating programs. Our contributions are twofold:
First, we introduce a generalization of LexRSMs which allows for some components
to be negative. This standard feature of non-probabilistic termination proofs
was hitherto not known to be sound in the probabilistic setting, as the soundness
proof requires a careful analysis of the underlying stochastic process. Second,
we present polynomial-time algorithms using our generalized LexRSMs for proving
a.s. termination in broad classes of linear-arithmetic programs.'
acknowledgement: This research was partially supported by the ERC CoG 863818 (ForM-SMArt),
the Czech Science Foundation grant No. GJ19-15134Y, and the European Union’s Horizon
2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement
No. 665385.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Ehsan Kafshdar
full_name: Goharshady, Ehsan Kafshdar
last_name: Goharshady
- first_name: Petr
full_name: Novotný, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotný
- first_name: Jiří
full_name: Zárevúcky, Jiří
last_name: Zárevúcky
- first_name: Dorde
full_name: Zikelic, Dorde
id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
last_name: Zikelic
orcid: 0000-0002-4681-1699
citation:
ama: 'Chatterjee K, Goharshady EK, Novotný P, Zárevúcky J, Zikelic D. On lexicographic
proof rules for probabilistic termination. In: 24th International Symposium
on Formal Methods. Vol 13047. Springer Nature; 2021:619-639. doi:10.1007/978-3-030-90870-6_33'
apa: 'Chatterjee, K., Goharshady, E. K., Novotný, P., Zárevúcky, J., & Zikelic,
D. (2021). On lexicographic proof rules for probabilistic termination. In 24th
International Symposium on Formal Methods (Vol. 13047, pp. 619–639). Virtual:
Springer Nature. https://doi.org/10.1007/978-3-030-90870-6_33'
chicago: Chatterjee, Krishnendu, Ehsan Kafshdar Goharshady, Petr Novotný, Jiří Zárevúcky,
and Dorde Zikelic. “On Lexicographic Proof Rules for Probabilistic Termination.”
In 24th International Symposium on Formal Methods, 13047:619–39. Springer
Nature, 2021. https://doi.org/10.1007/978-3-030-90870-6_33.
ieee: K. Chatterjee, E. K. Goharshady, P. Novotný, J. Zárevúcky, and D. Zikelic,
“On lexicographic proof rules for probabilistic termination,” in 24th International
Symposium on Formal Methods, Virtual, 2021, vol. 13047, pp. 619–639.
ista: 'Chatterjee K, Goharshady EK, Novotný P, Zárevúcky J, Zikelic D. 2021. On
lexicographic proof rules for probabilistic termination. 24th International Symposium
on Formal Methods. FM: Formal Methods, LNCS, vol. 13047, 619–639.'
mla: Chatterjee, Krishnendu, et al. “On Lexicographic Proof Rules for Probabilistic
Termination.” 24th International Symposium on Formal Methods, vol. 13047,
Springer Nature, 2021, pp. 619–39, doi:10.1007/978-3-030-90870-6_33.
short: K. Chatterjee, E.K. Goharshady, P. Novotný, J. Zárevúcky, D. Zikelic, in:,
24th International Symposium on Formal Methods, Springer Nature, 2021, pp. 619–639.
conference:
end_date: 2021-11-26
location: Virtual
name: 'FM: Formal Methods'
start_date: 2021-11-20
date_created: 2021-12-05T23:01:45Z
date_published: 2021-11-10T00:00:00Z
date_updated: 2024-01-17T08:19:41Z
day: '10'
department:
- _id: KrCh
doi: 10.1007/978-3-030-90870-6_33
ec_funded: 1
external_id:
arxiv:
- '2108.02188'
isi:
- '000758218600033'
intvolume: ' 13047'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2108.02188
month: '11'
oa: 1
oa_version: Preprint
page: 619-639
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: 24th International Symposium on Formal Methods
publication_identifier:
eisbn:
- 978-3-030-90870-6
eissn:
- 1611-3349
isbn:
- 9-783-0309-0869-0
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '14539'
relation: dissertation_contains
status: public
- id: '14778'
relation: later_version
status: public
scopus_import: '1'
status: public
title: On lexicographic proof rules for probabilistic termination
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13047
year: '2021'
...
---
_id: '14800'
abstract:
- lang: eng
text: 'Research on two-dimensional (2D) materials has been explosively increasing
in last seventeen years in varying subjects including condensed matter physics,
electronic engineering, materials science, and chemistry since the mechanical
exfoliation of graphene in 2004. Starting from graphene, 2D materials now have
become a big family with numerous members and diverse categories. The unique structural
features and physicochemical properties of 2D materials make them one class of
the most appealing candidates for a wide range of potential applications. In particular,
we have seen some major breakthroughs made in the field of 2D materials in last
five years not only in developing novel synthetic methods and exploring new structures/properties
but also in identifying innovative applications and pushing forward commercialisation.
In this review, we provide a critical summary on the recent progress made in the
field of 2D materials with a particular focus on last five years. After a brief
background introduction, we first discuss the major synthetic methods for 2D materials,
including the mechanical exfoliation, liquid exfoliation, vapor phase deposition,
and wet-chemical synthesis as well as phase engineering of 2D materials belonging
to the field of phase engineering of nanomaterials (PEN). We then introduce the
superconducting/optical/magnetic properties and chirality of 2D materials along
with newly emerging magic angle 2D superlattices. Following that, the promising
applications of 2D materials in electronics, optoelectronics, catalysis, energy
storage, solar cells, biomedicine, sensors, environments, etc. are described sequentially.
Thereafter, we present the theoretic calculations and simulations of 2D materials.
Finally, after concluding the current progress, we provide some personal discussions
on the existing challenges and future outlooks in this rapidly developing field. '
article_number: '2108017'
article_processing_charge: No
article_type: review
author:
- first_name: Cheng
full_name: Chang, Cheng
id: 9E331C2E-9F27-11E9-AE48-5033E6697425
last_name: Chang
orcid: 0000-0002-9515-4277
- first_name: Wei
full_name: Chen, Wei
last_name: Chen
- first_name: Ye
full_name: Chen, Ye
last_name: Chen
- first_name: Yonghua
full_name: Chen, Yonghua
last_name: Chen
- first_name: Yu
full_name: Chen, Yu
last_name: Chen
- first_name: Feng
full_name: Ding, Feng
last_name: Ding
- first_name: Chunhai
full_name: Fan, Chunhai
last_name: Fan
- first_name: Hong Jin
full_name: Fan, Hong Jin
last_name: Fan
- first_name: Zhanxi
full_name: Fan, Zhanxi
last_name: Fan
- first_name: Cheng
full_name: Gong, Cheng
last_name: Gong
- first_name: Yongji
full_name: Gong, Yongji
last_name: Gong
- first_name: Qiyuan
full_name: He, Qiyuan
last_name: He
- first_name: Xun
full_name: Hong, Xun
last_name: Hong
- first_name: Sheng
full_name: Hu, Sheng
last_name: Hu
- first_name: Weida
full_name: Hu, Weida
last_name: Hu
- first_name: Wei
full_name: Huang, Wei
last_name: Huang
- first_name: Yuan
full_name: Huang, Yuan
last_name: Huang
- first_name: Wei
full_name: Ji, Wei
last_name: Ji
- first_name: Dehui
full_name: Li, Dehui
last_name: Li
- first_name: Lain Jong
full_name: Li, Lain Jong
last_name: Li
- first_name: Qiang
full_name: Li, Qiang
last_name: Li
- first_name: Li
full_name: Lin, Li
last_name: Lin
- first_name: Chongyi
full_name: Ling, Chongyi
last_name: Ling
- first_name: Minghua
full_name: Liu, Minghua
last_name: Liu
- first_name: 'Nan'
full_name: Liu, Nan
last_name: Liu
- first_name: Zhuang
full_name: Liu, Zhuang
last_name: Liu
- first_name: Kian Ping
full_name: Loh, Kian Ping
last_name: Loh
- first_name: Jianmin
full_name: Ma, Jianmin
last_name: Ma
- first_name: Feng
full_name: Miao, Feng
last_name: Miao
- first_name: Hailin
full_name: Peng, Hailin
last_name: Peng
- first_name: Mingfei
full_name: Shao, Mingfei
last_name: Shao
- first_name: Li
full_name: Song, Li
last_name: Song
- first_name: Shao
full_name: Su, Shao
last_name: Su
- first_name: Shuo
full_name: Sun, Shuo
last_name: Sun
- first_name: Chaoliang
full_name: Tan, Chaoliang
last_name: Tan
- first_name: Zhiyong
full_name: Tang, Zhiyong
last_name: Tang
- first_name: Dingsheng
full_name: Wang, Dingsheng
last_name: Wang
- first_name: Huan
full_name: Wang, Huan
last_name: Wang
- first_name: Jinlan
full_name: Wang, Jinlan
last_name: Wang
- first_name: Xin
full_name: Wang, Xin
last_name: Wang
- first_name: Xinran
full_name: Wang, Xinran
last_name: Wang
- first_name: Andrew T.S.
full_name: Wee, Andrew T.S.
last_name: Wee
- first_name: Zhongming
full_name: Wei, Zhongming
last_name: Wei
- first_name: Yuen
full_name: Wu, Yuen
last_name: Wu
- first_name: Zhong Shuai
full_name: Wu, Zhong Shuai
last_name: Wu
- first_name: Jie
full_name: Xiong, Jie
last_name: Xiong
- first_name: Qihua
full_name: Xiong, Qihua
last_name: Xiong
- first_name: Weigao
full_name: Xu, Weigao
last_name: Xu
- first_name: Peng
full_name: Yin, Peng
last_name: Yin
- first_name: Haibo
full_name: Zeng, Haibo
last_name: Zeng
- first_name: Zhiyuan
full_name: Zeng, Zhiyuan
last_name: Zeng
- first_name: Tianyou
full_name: Zhai, Tianyou
last_name: Zhai
- first_name: Han
full_name: Zhang, Han
last_name: Zhang
- first_name: Hui
full_name: Zhang, Hui
last_name: Zhang
- first_name: Qichun
full_name: Zhang, Qichun
last_name: Zhang
- first_name: Tierui
full_name: Zhang, Tierui
last_name: Zhang
- first_name: Xiang
full_name: Zhang, Xiang
last_name: Zhang
- first_name: Li Dong
full_name: Zhao, Li Dong
last_name: Zhao
- first_name: Meiting
full_name: Zhao, Meiting
last_name: Zhao
- first_name: Weijie
full_name: Zhao, Weijie
last_name: Zhao
- first_name: Yunxuan
full_name: Zhao, Yunxuan
last_name: Zhao
- first_name: Kai Ge
full_name: Zhou, Kai Ge
last_name: Zhou
- first_name: Xing
full_name: Zhou, Xing
last_name: Zhou
- first_name: Yu
full_name: Zhou, Yu
last_name: Zhou
- first_name: Hongwei
full_name: Zhu, Hongwei
last_name: Zhu
- first_name: Hua
full_name: Zhang, Hua
last_name: Zhang
- first_name: Zhongfan
full_name: Liu, Zhongfan
last_name: Liu
citation:
ama: Chang C, Chen W, Chen Y, et al. Recent progress on two-dimensional materials.
Acta Physico-Chimica Sinica. 2021;37(12). doi:10.3866/PKU.WHXB202108017
apa: Chang, C., Chen, W., Chen, Y., Chen, Y., Chen, Y., Ding, F., … Liu, Z. (2021).
Recent progress on two-dimensional materials. Acta Physico-Chimica Sinica.
Peking University. https://doi.org/10.3866/PKU.WHXB202108017
chicago: Chang, Cheng, Wei Chen, Ye Chen, Yonghua Chen, Yu Chen, Feng Ding, Chunhai
Fan, et al. “Recent Progress on Two-Dimensional Materials.” Acta Physico-Chimica
Sinica. Peking University, 2021. https://doi.org/10.3866/PKU.WHXB202108017.
ieee: C. Chang et al., “Recent progress on two-dimensional materials,” Acta
Physico-Chimica Sinica, vol. 37, no. 12. Peking University, 2021.
ista: Chang C, Chen W, Chen Y, Chen Y, Chen Y, Ding F, Fan C, Fan HJ, Fan Z, Gong
C, Gong Y, He Q, Hong X, Hu S, Hu W, Huang W, Huang Y, Ji W, Li D, Li LJ, Li Q,
Lin L, Ling C, Liu M, Liu N, Liu Z, Loh KP, Ma J, Miao F, Peng H, Shao M, Song
L, Su S, Sun S, Tan C, Tang Z, Wang D, Wang H, Wang J, Wang X, Wang X, Wee ATS,
Wei Z, Wu Y, Wu ZS, Xiong J, Xiong Q, Xu W, Yin P, Zeng H, Zeng Z, Zhai T, Zhang
H, Zhang H, Zhang Q, Zhang T, Zhang X, Zhao LD, Zhao M, Zhao W, Zhao Y, Zhou KG,
Zhou X, Zhou Y, Zhu H, Zhang H, Liu Z. 2021. Recent progress on two-dimensional
materials. Acta Physico-Chimica Sinica. 37(12), 2108017.
mla: Chang, Cheng, et al. “Recent Progress on Two-Dimensional Materials.” Acta
Physico-Chimica Sinica, vol. 37, no. 12, 2108017, Peking University, 2021,
doi:10.3866/PKU.WHXB202108017.
short: C. Chang, W. Chen, Y. Chen, Y. Chen, Y. Chen, F. Ding, C. Fan, H.J. Fan,
Z. Fan, C. Gong, Y. Gong, Q. He, X. Hong, S. Hu, W. Hu, W. Huang, Y. Huang, W.
Ji, D. Li, L.J. Li, Q. Li, L. Lin, C. Ling, M. Liu, N. Liu, Z. Liu, K.P. Loh,
J. Ma, F. Miao, H. Peng, M. Shao, L. Song, S. Su, S. Sun, C. Tan, Z. Tang, D.
Wang, H. Wang, J. Wang, X. Wang, X. Wang, A.T.S. Wee, Z. Wei, Y. Wu, Z.S. Wu,
J. Xiong, Q. Xiong, W. Xu, P. Yin, H. Zeng, Z. Zeng, T. Zhai, H. Zhang, H. Zhang,
Q. Zhang, T. Zhang, X. Zhang, L.D. Zhao, M. Zhao, W. Zhao, Y. Zhao, K.G. Zhou,
X. Zhou, Y. Zhou, H. Zhu, H. Zhang, Z. Liu, Acta Physico-Chimica Sinica 37 (2021).
date_created: 2024-01-14T23:00:58Z
date_published: 2021-10-13T00:00:00Z
date_updated: 2024-01-17T11:29:33Z
day: '13'
department:
- _id: MaIb
doi: 10.3866/PKU.WHXB202108017
intvolume: ' 37'
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.3866/PKU.WHXB202108017
month: '10'
oa: 1
oa_version: Submitted Version
publication: Acta Physico-Chimica Sinica
publication_identifier:
issn:
- 1001-4861
publication_status: published
publisher: Peking University
quality_controlled: '1'
scopus_import: '1'
status: public
title: Recent progress on two-dimensional materials
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2021'
...
---
_id: '10206'
abstract:
- lang: eng
text: Neural-network classifiers achieve high accuracy when predicting the class
of an input that they were trained to identify. Maintaining this accuracy in dynamic
environments, where inputs frequently fall outside the fixed set of initially
known classes, remains a challenge. The typical approach is to detect inputs from
novel classes and retrain the classifier on an augmented dataset. However, not
only the classifier but also the detection mechanism needs to adapt in order to
distinguish between newly learned and yet unknown input classes. To address this
challenge, we introduce an algorithmic framework for active monitoring of a neural
network. A monitor wrapped in our framework operates in parallel with the neural
network and interacts with a human user via a series of interpretable labeling
queries for incremental adaptation. In addition, we propose an adaptive quantitative
monitor to improve precision. An experimental evaluation on a diverse set of benchmarks
with varying numbers of classes confirms the benefits of our active monitoring
framework in dynamic scenarios.
acknowledgement: We thank Christoph Lampert and Alex Greengold for fruitful discussions.
This research was supported in part by the Simons Institute for the Theory of Computing,
the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), and the
European Union’s Horizon 2020 research and innovation programme under the Marie
Skłodowska-Curie grant agreement No. 754411.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Anna
full_name: Lukina, Anna
id: CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425
last_name: Lukina
- first_name: Christian
full_name: Schilling, Christian
id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87
last_name: Schilling
orcid: 0000-0003-3658-1065
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
citation:
ama: 'Lukina A, Schilling C, Henzinger TA. Into the unknown: active monitoring of neural
networks. In: 21st International Conference on Runtime Verification. Vol
12974. Cham: Springer Nature; 2021:42-61. doi:10.1007/978-3-030-88494-9_3'
apa: 'Lukina, A., Schilling, C., & Henzinger, T. A. (2021). Into the unknown:
active monitoring of neural networks. In 21st International Conference on Runtime
Verification (Vol. 12974, pp. 42–61). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-88494-9_3'
chicago: 'Lukina, Anna, Christian Schilling, and Thomas A Henzinger. “Into the Unknown:
Active Monitoring of Neural Networks.” In 21st International Conference on
Runtime Verification, 12974:42–61. Cham: Springer Nature, 2021. https://doi.org/10.1007/978-3-030-88494-9_3.'
ieee: 'A. Lukina, C. Schilling, and T. A. Henzinger, “Into the unknown: active monitoring
of neural networks,” in 21st International Conference on Runtime Verification,
Virtual, 2021, vol. 12974, pp. 42–61.'
ista: 'Lukina A, Schilling C, Henzinger TA. 2021. Into the unknown: active monitoring
of neural networks. 21st International Conference on Runtime Verification. RV:
Runtime Verification, LNCS, vol. 12974, 42–61.'
mla: 'Lukina, Anna, et al. “Into the Unknown: Active Monitoring of Neural Networks.”
21st International Conference on Runtime Verification, vol. 12974, Springer
Nature, 2021, pp. 42–61, doi:10.1007/978-3-030-88494-9_3.'
short: A. Lukina, C. Schilling, T.A. Henzinger, in:, 21st International Conference
on Runtime Verification, Springer Nature, Cham, 2021, pp. 42–61.
conference:
end_date: 2021-10-14
location: Virtual
name: 'RV: Runtime Verification'
start_date: 2021-10-11
date_created: 2021-10-31T23:01:31Z
date_published: 2021-10-06T00:00:00Z
date_updated: 2024-01-30T12:06:56Z
day: '06'
department:
- _id: ToHe
doi: 10.1007/978-3-030-88494-9_3
ec_funded: 1
external_id:
arxiv:
- '2009.06429'
isi:
- '000719383800003'
isi: 1
keyword:
- monitoring
- neural networks
- novelty detection
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2009.06429
month: '10'
oa: 1
oa_version: Preprint
page: 42-61
place: Cham
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: 21st International Conference on Runtime Verification
publication_identifier:
eisbn:
- 978-3-030-88494-9
eissn:
- 1611-3349
isbn:
- 9-783-0308-8493-2
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '13234'
relation: extended_version
status: public
scopus_import: '1'
status: public
title: 'Into the unknown: active monitoring of neural networks'
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: '12974 '
year: '2021'
...
---
_id: '14889'
abstract:
- lang: eng
text: We consider the Fröhlich Hamiltonian with large coupling constant α. For initial
data of Pekar product form with coherent phonon field and with the electron minimizing
the corresponding energy, we provide a norm approximation of the evolution, valid
up to times of order α2. The approximation is given in terms of a Pekar product
state, evolved through the Landau-Pekar equations, corrected by a Bogoliubov dynamics
taking quantum fluctuations into account. This allows us to show that the Landau-Pekar
equations approximately describe the evolution of the electron- and one-phonon
reduced density matrices under the Fröhlich dynamics up to times of order α2.
acknowledgement: "Financial support by the European Union’s Horizon 2020 research
and innovation programme\r\nunder the Marie Skłodowska-Curie grant agreement No.
754411 (S.R.) and the European\r\nResearch Council under grant agreement No. 694227
(N.L. and R.S.), as well as by the SNSF\r\nEccellenza project PCEFP2 181153 (N.L.),
the NCCR SwissMAP (N.L. and B.S.) and by the\r\nDeutsche Forschungsgemeinschaft
(DFG) through the Research Training Group 1838: Spectral\r\nTheory and Dynamics
of Quantum Systems (D.M.) is gratefully acknowledged. B.S. gratefully\r\nacknowledges
financial support from the Swiss National Science Foundation through the Grant\r\n“Dynamical
and energetic properties of Bose-Einstein condensates” and from the European\r\nResearch
Council through the ERC-AdG CLaQS (grant agreement No 834782). D.M. thanks\r\nMarcel
Griesemer for helpful discussions."
article_processing_charge: No
article_type: original
author:
- first_name: Nikolai K
full_name: Leopold, Nikolai K
id: 4BC40BEC-F248-11E8-B48F-1D18A9856A87
last_name: Leopold
orcid: 0000-0002-0495-6822
- first_name: David Johannes
full_name: Mitrouskas, David Johannes
id: cbddacee-2b11-11eb-a02e-a2e14d04e52d
last_name: Mitrouskas
- first_name: Simone Anna Elvira
full_name: Rademacher, Simone Anna Elvira
id: 856966FE-A408-11E9-977E-802DE6697425
last_name: Rademacher
orcid: 0000-0001-5059-4466
- 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: Leopold NK, Mitrouskas DJ, Rademacher SAE, Schlein B, Seiringer R. Landau–Pekar
equations and quantum fluctuations for the dynamics of a strongly coupled polaron.
Pure and Applied Analysis. 2021;3(4):653-676. doi:10.2140/paa.2021.3.653
apa: Leopold, N. K., Mitrouskas, D. J., Rademacher, S. A. E., Schlein, B., &
Seiringer, R. (2021). Landau–Pekar equations and quantum fluctuations for the
dynamics of a strongly coupled polaron. Pure and Applied Analysis. Mathematical
Sciences Publishers. https://doi.org/10.2140/paa.2021.3.653
chicago: Leopold, Nikolai K, David Johannes Mitrouskas, Simone Anna Elvira Rademacher,
Benjamin Schlein, and Robert Seiringer. “Landau–Pekar Equations and Quantum Fluctuations
for the Dynamics of a Strongly Coupled Polaron.” Pure and Applied Analysis.
Mathematical Sciences Publishers, 2021. https://doi.org/10.2140/paa.2021.3.653.
ieee: N. K. Leopold, D. J. Mitrouskas, S. A. E. Rademacher, B. Schlein, and R. Seiringer,
“Landau–Pekar equations and quantum fluctuations for the dynamics of a strongly
coupled polaron,” Pure and Applied Analysis, vol. 3, no. 4. Mathematical
Sciences Publishers, pp. 653–676, 2021.
ista: Leopold NK, Mitrouskas DJ, Rademacher SAE, Schlein B, Seiringer R. 2021. Landau–Pekar
equations and quantum fluctuations for the dynamics of a strongly coupled polaron.
Pure and Applied Analysis. 3(4), 653–676.
mla: Leopold, Nikolai K., et al. “Landau–Pekar Equations and Quantum Fluctuations
for the Dynamics of a Strongly Coupled Polaron.” Pure and Applied Analysis,
vol. 3, no. 4, Mathematical Sciences Publishers, 2021, pp. 653–76, doi:10.2140/paa.2021.3.653.
short: N.K. Leopold, D.J. Mitrouskas, S.A.E. Rademacher, B. Schlein, R. Seiringer,
Pure and Applied Analysis 3 (2021) 653–676.
date_created: 2024-01-28T23:01:43Z
date_published: 2021-10-01T00:00:00Z
date_updated: 2024-02-05T10:02:45Z
day: '01'
department:
- _id: RoSe
doi: 10.2140/paa.2021.3.653
ec_funded: 1
external_id:
arxiv:
- '2005.02098'
intvolume: ' 3'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2005.02098
month: '10'
oa: 1
oa_version: Preprint
page: 653-676
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: Pure and Applied Analysis
publication_identifier:
eissn:
- 2578-5885
issn:
- 2578-5893
publication_status: published
publisher: Mathematical Sciences Publishers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Landau–Pekar equations and quantum fluctuations for the dynamics of a strongly
coupled polaron
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3
year: '2021'
...
---
_id: '14890'
abstract:
- lang: eng
text: We consider a system of N interacting bosons in the mean-field scaling regime
and construct corrections to the Bogoliubov dynamics that approximate the true
N-body dynamics in norm to arbitrary precision. The N-independent corrections
are given in terms of the solutions of the Bogoliubov and Hartree equations and
satisfy a generalized form of Wick's theorem. We determine the n-point correlation
functions of the excitations around the condensate, as well as the reduced densities
of the N-body system, to arbitrary accuracy, given only the knowledge of the two-point
functions of a quasi-free state and the solution of the Hartree equation. In this
way, the complex problem of computing all n-point correlation functions for an
interacting N-body system is essentially reduced to the problem of solving the
Hartree equation and the PDEs for the Bogoliubov two-point functions.
acknowledgement: "We are grateful for the hospitality of Central China Normal University
(CCNU),\r\nwhere parts of this work were done, and thank Phan Th`anh Nam, Simone\r\nRademacher,
Robert Seiringer and Stefan Teufel for helpful discussions. L.B. gratefully acknowledges
the support by the German Research Foundation (DFG) within the Research\r\nTraining
Group 1838 “Spectral Theory and Dynamics of Quantum Systems”, and the funding\r\nfrom
the European Union’s Horizon 2020 research and innovation programme under the Marie\r\nSk
lodowska-Curie Grant Agreement No. 754411."
article_processing_charge: No
article_type: original
author:
- first_name: Lea
full_name: Bossmann, Lea
id: A2E3BCBE-5FCC-11E9-AA4B-76F3E5697425
last_name: Bossmann
orcid: 0000-0002-6854-1343
- first_name: Sören P
full_name: Petrat, Sören P
id: 40AC02DC-F248-11E8-B48F-1D18A9856A87
last_name: Petrat
orcid: 0000-0002-9166-5889
- first_name: Peter
full_name: Pickl, Peter
last_name: Pickl
- first_name: Avy
full_name: Soffer, Avy
last_name: Soffer
citation:
ama: Bossmann L, Petrat SP, Pickl P, Soffer A. Beyond Bogoliubov dynamics. Pure
and Applied Analysis. 2021;3(4):677-726. doi:10.2140/paa.2021.3.677
apa: Bossmann, L., Petrat, S. P., Pickl, P., & Soffer, A. (2021). Beyond Bogoliubov
dynamics. Pure and Applied Analysis. Mathematical Sciences Publishers.
https://doi.org/10.2140/paa.2021.3.677
chicago: Bossmann, Lea, Sören P Petrat, Peter Pickl, and Avy Soffer. “Beyond Bogoliubov
Dynamics.” Pure and Applied Analysis. Mathematical Sciences Publishers,
2021. https://doi.org/10.2140/paa.2021.3.677.
ieee: L. Bossmann, S. P. Petrat, P. Pickl, and A. Soffer, “Beyond Bogoliubov dynamics,”
Pure and Applied Analysis, vol. 3, no. 4. Mathematical Sciences Publishers,
pp. 677–726, 2021.
ista: Bossmann L, Petrat SP, Pickl P, Soffer A. 2021. Beyond Bogoliubov dynamics.
Pure and Applied Analysis. 3(4), 677–726.
mla: Bossmann, Lea, et al. “Beyond Bogoliubov Dynamics.” Pure and Applied Analysis,
vol. 3, no. 4, Mathematical Sciences Publishers, 2021, pp. 677–726, doi:10.2140/paa.2021.3.677.
short: L. Bossmann, S.P. Petrat, P. Pickl, A. Soffer, Pure and Applied Analysis
3 (2021) 677–726.
date_created: 2024-01-28T23:01:43Z
date_published: 2021-10-01T00:00:00Z
date_updated: 2024-02-05T09:26:31Z
day: '01'
department:
- _id: RoSe
doi: 10.2140/paa.2021.3.677
ec_funded: 1
external_id:
arxiv:
- '1912.11004'
intvolume: ' 3'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1912.11004
month: '10'
oa: 1
oa_version: Preprint
page: 677-726
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Pure and Applied Analysis
publication_identifier:
eissn:
- 2578-5885
issn:
- 2578-5893
publication_status: published
publisher: Mathematical Sciences Publishers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Beyond Bogoliubov dynamics
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3
year: '2021'
...
---
_id: '15013'
abstract:
- lang: eng
text: We consider random n×n matrices X with independent and centered entries and
a general variance profile. We show that the spectral radius of X converges with
very high probability to the square root of the spectral radius of the variance
matrix of X when n tends to infinity. We also establish the optimal rate of convergence,
that is a new result even for general i.i.d. matrices beyond the explicitly solvable
Gaussian cases. The main ingredient is the proof of the local inhomogeneous circular
law [arXiv:1612.07776] at the spectral edge.
acknowledgement: Partially supported by ERC Starting Grant RandMat No. 715539 and
the SwissMap grant of Swiss National Science Foundation. Partially supported by
ERC Advanced Grant RanMat No. 338804. Partially supported by the Hausdorff Center
for Mathematics in Bonn.
article_processing_charge: No
article_type: original
author:
- first_name: Johannes
full_name: Alt, Johannes
id: 36D3D8B6-F248-11E8-B48F-1D18A9856A87
last_name: Alt
- 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
citation:
ama: Alt J, Erdös L, Krüger TH. Spectral radius of random matrices with independent
entries. Probability and Mathematical Physics. 2021;2(2):221-280. doi:10.2140/pmp.2021.2.221
apa: Alt, J., Erdös, L., & Krüger, T. H. (2021). Spectral radius of random matrices
with independent entries. Probability and Mathematical Physics. Mathematical
Sciences Publishers. https://doi.org/10.2140/pmp.2021.2.221
chicago: Alt, Johannes, László Erdös, and Torben H Krüger. “Spectral Radius of Random
Matrices with Independent Entries.” Probability and Mathematical Physics.
Mathematical Sciences Publishers, 2021. https://doi.org/10.2140/pmp.2021.2.221.
ieee: J. Alt, L. Erdös, and T. H. Krüger, “Spectral radius of random matrices with
independent entries,” Probability and Mathematical Physics, vol. 2, no.
2. Mathematical Sciences Publishers, pp. 221–280, 2021.
ista: Alt J, Erdös L, Krüger TH. 2021. Spectral radius of random matrices with independent
entries. Probability and Mathematical Physics. 2(2), 221–280.
mla: Alt, Johannes, et al. “Spectral Radius of Random Matrices with Independent
Entries.” Probability and Mathematical Physics, vol. 2, no. 2, Mathematical
Sciences Publishers, 2021, pp. 221–80, doi:10.2140/pmp.2021.2.221.
short: J. Alt, L. Erdös, T.H. Krüger, Probability and Mathematical Physics 2 (2021)
221–280.
date_created: 2024-02-18T23:01:03Z
date_published: 2021-05-21T00:00:00Z
date_updated: 2024-02-19T08:30:00Z
day: '21'
department:
- _id: LaEr
doi: 10.2140/pmp.2021.2.221
ec_funded: 1
external_id:
arxiv:
- '1907.13631'
intvolume: ' 2'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1907.13631
month: '05'
oa: 1
oa_version: Preprint
page: 221-280
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Probability and Mathematical Physics
publication_identifier:
eissn:
- 2690-1005
issn:
- 2690-0998
publication_status: published
publisher: Mathematical Sciences Publishers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Spectral radius of random matrices with independent entries
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2021'
...
---
_id: '9887'
abstract:
- lang: eng
text: Clathrin-mediated endocytosis is the major route of entry of cargos into cells
and thus underpins many physiological processes. During endocytosis, an area of
flat membrane is remodeled by proteins to create a spherical vesicle against intracellular
forces. The protein machinery which mediates this membrane bending in plants is
unknown. However, it is known that plant endocytosis is actin independent, thus
indicating that plants utilize a unique mechanism to mediate membrane bending
against high-turgor pressure compared to other model systems. Here, we investigate
the TPLATE complex, a plant-specific endocytosis protein complex. It has been
thought to function as a classical adaptor functioning underneath the clathrin
coat. However, by using biochemical and advanced live microscopy approaches, we
found that TPLATE is peripherally associated with clathrin-coated vesicles and
localizes at the rim of endocytosis events. As this localization is more fitting
to the protein machinery involved in membrane bending during endocytosis, we examined
cells in which the TPLATE complex was disrupted and found that the clathrin structures
present as flat patches. This suggests a requirement of the TPLATE complex for
membrane bending during plant clathrin–mediated endocytosis. Next, we used in
vitro biophysical assays to confirm that the TPLATE complex possesses protein
domains with intrinsic membrane remodeling activity. These results redefine the
role of the TPLATE complex and implicate it as a key component of the evolutionarily
distinct plant endocytosis mechanism, which mediates endocytic membrane bending
against the high-turgor pressure in plant cells.
acknowledged_ssus:
- _id: EM-Fac
- _id: LifeSc
- _id: Bio
acknowledgement: 'We gratefully thank Julie Neveu and Dr. Amanda Barranco of the Grégory
Vert laboratory for help preparing plants in France, Dr. Zuzana Gelova for help
and advice with protoplast generation, Dr. Stéphane Vassilopoulos and Dr. Florian
Schur for advice regarding EM tomography, Alejandro Marquiegui Alvaro for help with
material generation, and Dr. Lukasz Kowalski for generously gifting us the mWasabi
protein. This research was supported by the Scientific Service Units of Institute
of Science and Technology Austria (IST Austria) through resources provided by the
Electron Microscopy Facility, Lab Support Facility (particularly Dorota Jaworska),
and the Bioimaging Facility. We acknowledge the Advanced Microscopy Facility of
the Vienna BioCenter Core Facilities for use of the 3D SIM. For the mass spectrometry
analysis of proteins, we acknowledge the University of Natural Resources and Life
Sciences (BOKU) Core Facility Mass Spectrometry. This work was supported by the
following funds: A.J. is supported by funding from the Austrian Science Fund I3630B25
to J.F. P.M. and E.B. are supported by Agence Nationale de la Recherche ANR-11-EQPX-0029
Morphoscope2 and ANR-10-INBS-04 France BioImaging. S.Y.B. is supported by the NSF
No. 1121998 and 1614915. J.W. and D.V.D. are supported by the European Research
Council Grant 682436 (to D.V.D.), a China Scholarship Council Grant 201508440249
(to J.W.), and by a Ghent University Special Research Co-funding Grant ST01511051
(to J.W.).'
article_number: e2113046118
article_processing_charge: No
article_type: original
author:
- first_name: Alexander J
full_name: Johnson, Alexander J
id: 46A62C3A-F248-11E8-B48F-1D18A9856A87
last_name: Johnson
orcid: 0000-0002-2739-8843
- first_name: Dana A
full_name: Dahhan, Dana A
last_name: Dahhan
- first_name: Nataliia
full_name: Gnyliukh, Nataliia
id: 390C1120-F248-11E8-B48F-1D18A9856A87
last_name: Gnyliukh
orcid: 0000-0002-2198-0509
- first_name: Walter
full_name: Kaufmann, Walter
id: 3F99E422-F248-11E8-B48F-1D18A9856A87
last_name: Kaufmann
orcid: 0000-0001-9735-5315
- first_name: Vanessa
full_name: Zheden, Vanessa
id: 39C5A68A-F248-11E8-B48F-1D18A9856A87
last_name: Zheden
orcid: 0000-0002-9438-4783
- first_name: Tommaso
full_name: Costanzo, Tommaso
id: D93824F4-D9BA-11E9-BB12-F207E6697425
last_name: Costanzo
orcid: 0000-0001-9732-3815
- first_name: Pierre
full_name: Mahou, Pierre
last_name: Mahou
- first_name: Mónika
full_name: Hrtyan, Mónika
id: 45A71A74-F248-11E8-B48F-1D18A9856A87
last_name: Hrtyan
- first_name: Jie
full_name: Wang, Jie
last_name: Wang
- first_name: Juan L
full_name: Aguilera Servin, Juan L
id: 2A67C376-F248-11E8-B48F-1D18A9856A87
last_name: Aguilera Servin
orcid: 0000-0002-2862-8372
- first_name: Daniël
full_name: van Damme, Daniël
last_name: van Damme
- first_name: Emmanuel
full_name: Beaurepaire, Emmanuel
last_name: Beaurepaire
- first_name: Martin
full_name: Loose, Martin
id: 462D4284-F248-11E8-B48F-1D18A9856A87
last_name: Loose
orcid: 0000-0001-7309-9724
- first_name: Sebastian Y
full_name: Bednarek, Sebastian Y
last_name: Bednarek
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Johnson AJ, Dahhan DA, Gnyliukh N, et al. The TPLATE complex mediates membrane
bending during plant clathrin-mediated endocytosis. Proceedings of the National
Academy of Sciences. 2021;118(51). doi:10.1073/pnas.2113046118
apa: Johnson, A. J., Dahhan, D. A., Gnyliukh, N., Kaufmann, W., Zheden, V., Costanzo,
T., … Friml, J. (2021). The TPLATE complex mediates membrane bending during plant
clathrin-mediated endocytosis. Proceedings of the National Academy of Sciences.
National Academy of Sciences. https://doi.org/10.1073/pnas.2113046118
chicago: Johnson, Alexander J, Dana A Dahhan, Nataliia Gnyliukh, Walter Kaufmann,
Vanessa Zheden, Tommaso Costanzo, Pierre Mahou, et al. “The TPLATE Complex Mediates
Membrane Bending during Plant Clathrin-Mediated Endocytosis.” Proceedings of
the National Academy of Sciences. National Academy of Sciences, 2021. https://doi.org/10.1073/pnas.2113046118.
ieee: A. J. Johnson et al., “The TPLATE complex mediates membrane bending
during plant clathrin-mediated endocytosis,” Proceedings of the National Academy
of Sciences, vol. 118, no. 51. National Academy of Sciences, 2021.
ista: Johnson AJ, Dahhan DA, Gnyliukh N, Kaufmann W, Zheden V, Costanzo T, Mahou
P, Hrtyan M, Wang J, Aguilera Servin JL, van Damme D, Beaurepaire E, Loose M,
Bednarek SY, Friml J. 2021. The TPLATE complex mediates membrane bending during
plant clathrin-mediated endocytosis. Proceedings of the National Academy of Sciences.
118(51), e2113046118.
mla: Johnson, Alexander J., et al. “The TPLATE Complex Mediates Membrane Bending
during Plant Clathrin-Mediated Endocytosis.” Proceedings of the National Academy
of Sciences, vol. 118, no. 51, e2113046118, National Academy of Sciences,
2021, doi:10.1073/pnas.2113046118.
short: A.J. Johnson, D.A. Dahhan, N. Gnyliukh, W. Kaufmann, V. Zheden, T. Costanzo,
P. Mahou, M. Hrtyan, J. Wang, J.L. Aguilera Servin, D. van Damme, E. Beaurepaire,
M. Loose, S.Y. Bednarek, J. Friml, Proceedings of the National Academy of Sciences
118 (2021).
date_created: 2021-08-11T14:11:43Z
date_published: 2021-12-14T00:00:00Z
date_updated: 2024-02-19T11:06:09Z
day: '14'
ddc:
- '580'
department:
- _id: JiFr
- _id: MaLo
- _id: EvBe
- _id: EM-Fac
- _id: NanoFab
doi: 10.1073/pnas.2113046118
external_id:
isi:
- '000736417600043'
pmid:
- '34907016'
file:
- access_level: open_access
checksum: 8d01e72e22c4fb1584e72d8601947069
content_type: application/pdf
creator: cchlebak
date_created: 2021-12-15T08:59:40Z
date_updated: 2021-12-15T08:59:40Z
file_id: '10546'
file_name: 2021_PNAS_Johnson.pdf
file_size: 2757340
relation: main_file
success: 1
file_date_updated: 2021-12-15T08:59:40Z
has_accepted_license: '1'
intvolume: ' 118'
isi: 1
issue: '51'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 26538374-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I03630
name: Molecular mechanisms of endocytic cargo recognition in plants
publication: Proceedings of the National Academy of Sciences
publication_identifier:
eissn:
- 1091-6490
publication_status: published
publisher: National Academy of Sciences
quality_controlled: '1'
related_material:
link:
- relation: earlier_version
url: https://doi.org/10.1101/2021.04.26.441441
record:
- id: '14510'
relation: dissertation_contains
status: public
- id: '14988'
relation: research_data
status: public
status: public
title: The TPLATE complex mediates membrane bending during plant clathrin-mediated
endocytosis
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: 118
year: '2021'
...
---
_id: '14984'
abstract:
- lang: eng
text: Hybrid zones are narrow geographic regions where different populations, races
or interbreeding species meet and mate, producing mixed ‘hybrid’ offspring. They
are relatively common and can be found in a diverse range of organisms and environments.
The study of hybrid zones has played an important role in our understanding of
the origin of species, with hybrid zones having been described as ‘natural laboratories’.
This is because they allow us to study,in situ, the conditions and evolutionary
forces that enable divergent taxa to remain distinct despite some ongoing gene
exchange between them.
article_processing_charge: No
author:
- first_name: Sean
full_name: Stankowski, Sean
id: 43161670-5719-11EA-8025-FABC3DDC885E
last_name: Stankowski
- first_name: Daria
full_name: Shipilina, Daria
id: 428A94B0-F248-11E8-B48F-1D18A9856A87
last_name: Shipilina
orcid: 0000-0002-1145-9226
- first_name: Anja M
full_name: Westram, Anja M
id: 3C147470-F248-11E8-B48F-1D18A9856A87
last_name: Westram
orcid: 0000-0003-1050-4969
citation:
ama: 'Stankowski S, Shipilina D, Westram AM. Hybrid Zones. In: Encyclopedia of
Life Sciences. Vol 2. eLS. Wiley; 2021. doi:10.1002/9780470015902.a0029355'
apa: Stankowski, S., Shipilina, D., & Westram, A. M. (2021). Hybrid Zones. In
Encyclopedia of Life Sciences (Vol. 2). Wiley. https://doi.org/10.1002/9780470015902.a0029355
chicago: Stankowski, Sean, Daria Shipilina, and Anja M Westram. “Hybrid Zones.”
In Encyclopedia of Life Sciences, Vol. 2. ELS. Wiley, 2021. https://doi.org/10.1002/9780470015902.a0029355.
ieee: S. Stankowski, D. Shipilina, and A. M. Westram, “Hybrid Zones,” in Encyclopedia
of Life Sciences, vol. 2, Wiley, 2021.
ista: 'Stankowski S, Shipilina D, Westram AM. 2021.Hybrid Zones. In: Encyclopedia
of Life Sciences. vol. 2.'
mla: Stankowski, Sean, et al. “Hybrid Zones.” Encyclopedia of Life Sciences,
vol. 2, Wiley, 2021, doi:10.1002/9780470015902.a0029355.
short: S. Stankowski, D. Shipilina, A.M. Westram, in:, Encyclopedia of Life Sciences,
Wiley, 2021.
date_created: 2024-02-14T12:05:50Z
date_published: 2021-05-28T00:00:00Z
date_updated: 2024-02-19T09:54:18Z
day: '28'
department:
- _id: NiBa
doi: 10.1002/9780470015902.a0029355
intvolume: ' 2'
language:
- iso: eng
month: '05'
oa_version: None
publication: Encyclopedia of Life Sciences
publication_identifier:
eisbn:
- '9780470015902'
isbn:
- '9780470016176'
publication_status: published
publisher: Wiley
quality_controlled: '1'
series_title: eLS
status: public
title: Hybrid Zones
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2021'
...
---
_id: '14987'
abstract:
- lang: eng
text: "The goal of zero-shot learning is to construct a classifier that can identify
object classes for which no training examples are available. When training data
for some of the object classes is available but not for others, the name generalized
zero-shot learning is commonly used.\r\nIn a wider sense, the phrase zero-shot
is also used to describe other machine learning-based approaches that require
no training data from the problem of interest, such as zero-shot action recognition
or zero-shot machine translation."
article_processing_charge: No
author:
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Lampert C. Zero-Shot Learning. In: Ikeuchi K, ed. Computer Vision.
2nd ed. Cham: Springer; 2021:1395-1397. doi:10.1007/978-3-030-63416-2_874'
apa: 'Lampert, C. (2021). Zero-Shot Learning. In K. Ikeuchi (Ed.), Computer Vision
(2nd ed., pp. 1395–1397). Cham: Springer. https://doi.org/10.1007/978-3-030-63416-2_874'
chicago: 'Lampert, Christoph. “Zero-Shot Learning.” In Computer Vision, edited
by Katsushi Ikeuchi, 2nd ed., 1395–97. Cham: Springer, 2021. https://doi.org/10.1007/978-3-030-63416-2_874.'
ieee: 'C. Lampert, “Zero-Shot Learning,” in Computer Vision, 2nd ed., K.
Ikeuchi, Ed. Cham: Springer, 2021, pp. 1395–1397.'
ista: 'Lampert C. 2021.Zero-Shot Learning. In: Computer Vision. , 1395–1397.'
mla: Lampert, Christoph. “Zero-Shot Learning.” Computer Vision, edited by
Katsushi Ikeuchi, 2nd ed., Springer, 2021, pp. 1395–97, doi:10.1007/978-3-030-63416-2_874.
short: C. Lampert, in:, K. Ikeuchi (Ed.), Computer Vision, 2nd ed., Springer, Cham,
2021, pp. 1395–1397.
date_created: 2024-02-14T14:05:32Z
date_published: 2021-10-13T00:00:00Z
date_updated: 2024-02-19T10:59:04Z
day: '13'
department:
- _id: ChLa
doi: 10.1007/978-3-030-63416-2_874
edition: '2'
editor:
- first_name: Katsushi
full_name: Ikeuchi, Katsushi
last_name: Ikeuchi
language:
- iso: eng
month: '10'
oa_version: None
page: 1395-1397
place: Cham
publication: Computer Vision
publication_identifier:
eisbn:
- '9783030634162'
isbn:
- '9783030634155'
publication_status: published
publisher: Springer
quality_controlled: '1'
status: public
title: Zero-Shot Learning
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '14988'
abstract:
- lang: eng
text: Raw data generated from the publication - The TPLATE complex mediates membrane
bending during plant clathrin-mediated endocytosis by Johnson et al., 2021 In
PNAS
article_processing_charge: No
author:
- first_name: Alexander J
full_name: Johnson, Alexander J
id: 46A62C3A-F248-11E8-B48F-1D18A9856A87
last_name: Johnson
orcid: 0000-0002-2739-8843
citation:
ama: Johnson AJ. Raw data from Johnson et al, PNAS, 2021. 2021. doi:10.5281/ZENODO.5747100
apa: Johnson, A. J. (2021). Raw data from Johnson et al, PNAS, 2021. Zenodo. https://doi.org/10.5281/ZENODO.5747100
chicago: Johnson, Alexander J. “Raw Data from Johnson et Al, PNAS, 2021.” Zenodo,
2021. https://doi.org/10.5281/ZENODO.5747100.
ieee: A. J. Johnson, “Raw data from Johnson et al, PNAS, 2021.” Zenodo, 2021.
ista: Johnson AJ. 2021. Raw data from Johnson et al, PNAS, 2021, Zenodo, 10.5281/ZENODO.5747100.
mla: Johnson, Alexander J. Raw Data from Johnson et Al, PNAS, 2021. Zenodo,
2021, doi:10.5281/ZENODO.5747100.
short: A.J. Johnson, (2021).
date_created: 2024-02-14T14:13:48Z
date_published: 2021-12-01T00:00:00Z
date_updated: 2024-02-19T11:06:09Z
day: '01'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.5281/ZENODO.5747100
has_accepted_license: '1'
main_file_link:
- open_access: '1'
url: https://doi.org/10.5281/zenodo.5747100
month: '12'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
record:
- id: '9887'
relation: used_in_publication
status: public
status: public
title: Raw data from Johnson et al, PNAS, 2021
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: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10029'
abstract:
- lang: eng
text: Superconductor-semiconductor hybrids are platforms for realizing effective
p-wave superconductivity. Spin-orbit coupling, combined with the proximity effect,
causes the two-dimensional semiconductor to inherit p±ip intraband pairing, and
application of magnetic field can then result in transitions to the normal state,
partial Bogoliubov Fermi surfaces, or topological phases with Majorana modes.
Experimentally probing the hybrid superconductor-semiconductor interface is challenging
due to the shunting effect of the conventional superconductor. Consequently, the
nature of induced pairing remains an open question. Here, we use the circuit quantum
electrodynamics architecture to probe induced superconductivity in a two dimensional
Al-InAs hybrid system. We observe a strong suppression of superfluid density and
enhanced dissipation driven by magnetic field, which cannot be accounted for by
the depairing theory of an s-wave superconductor. These observations are explained
by a picture of independent intraband p±ip superconductors giving way to partial
Bogoliubov Fermi surfaces, and allow for the first characterization of key properties
of the hybrid superconducting system.
acknowledged_ssus:
- _id: M-Shop
- _id: NanoFab
acknowledgement: This research was supported by the Scientific Service Units of IST
Austria through resources provided by the MIBA Machine Shop and the nanofabrication
facility. JS and AG were supported by funding from the European Union’s Horizon
2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement
No.754411.
article_number: '2107.03695'
article_processing_charge: No
author:
- first_name: Duc T
full_name: Phan, Duc T
id: 29C8C0B4-F248-11E8-B48F-1D18A9856A87
last_name: Phan
- first_name: Jorden L
full_name: Senior, Jorden L
id: 5479D234-2D30-11EA-89CC-40953DDC885E
last_name: Senior
orcid: 0000-0002-0672-9295
- first_name: Areg
full_name: Ghazaryan, Areg
id: 4AF46FD6-F248-11E8-B48F-1D18A9856A87
last_name: Ghazaryan
orcid: 0000-0001-9666-3543
- first_name: M.
full_name: Hatefipour, M.
last_name: Hatefipour
- first_name: W. M.
full_name: Strickland, W. M.
last_name: Strickland
- first_name: J.
full_name: Shabani, J.
last_name: Shabani
- first_name: Maksym
full_name: Serbyn, Maksym
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
- first_name: Andrew P
full_name: Higginbotham, Andrew P
id: 4AD6785A-F248-11E8-B48F-1D18A9856A87
last_name: Higginbotham
orcid: 0000-0003-2607-2363
citation:
ama: Phan DT, Senior JL, Ghazaryan A, et al. Breakdown of induced p±ip pairing in
a superconductor-semiconductor hybrid. arXiv.
apa: Phan, D. T., Senior, J. L., Ghazaryan, A., Hatefipour, M., Strickland, W. M.,
Shabani, J., … Higginbotham, A. P. (n.d.). Breakdown of induced p±ip pairing in
a superconductor-semiconductor hybrid. arXiv.
chicago: Phan, Duc T, Jorden L Senior, Areg Ghazaryan, M. Hatefipour, W. M. Strickland,
J. Shabani, Maksym Serbyn, and Andrew P Higginbotham. “Breakdown of Induced P±ip
Pairing in a Superconductor-Semiconductor Hybrid.” ArXiv, n.d.
ieee: D. T. Phan et al., “Breakdown of induced p±ip pairing in a superconductor-semiconductor
hybrid,” arXiv. .
ista: Phan DT, Senior JL, Ghazaryan A, Hatefipour M, Strickland WM, Shabani J, Serbyn
M, Higginbotham AP. Breakdown of induced p±ip pairing in a superconductor-semiconductor
hybrid. arXiv, 2107.03695.
mla: Phan, Duc T., et al. “Breakdown of Induced P±ip Pairing in a Superconductor-Semiconductor
Hybrid.” ArXiv, 2107.03695.
short: D.T. Phan, J.L. Senior, A. Ghazaryan, M. Hatefipour, W.M. Strickland, J.
Shabani, M. Serbyn, A.P. Higginbotham, ArXiv (n.d.).
date_created: 2021-09-21T08:41:02Z
date_published: 2021-07-08T00:00:00Z
date_updated: 2024-02-21T12:36:52Z
day: '08'
department:
- _id: MaSe
- _id: AnHi
- _id: MiLe
ec_funded: 1
external_id:
arxiv:
- '2107.03695'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2107.03695
month: '07'
oa: 1
oa_version: Preprint
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: arXiv
publication_status: submitted
related_material:
record:
- id: '10851'
relation: later_version
status: public
- id: '9636'
relation: research_data
status: public
status: public
title: Breakdown of induced p±ip pairing in a superconductor-semiconductor hybrid
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '9291'
abstract:
- lang: eng
text: "This .zip File contains the transport data for figures presented in the main
text and supplementary material of \"Enhancement of Proximity Induced Superconductivity
in Planar Germanium\" by K. Aggarwal, et. al. \r\nThe measurements were done using
Labber Software and the data is stored in the hdf5 file format. The files can
be opened using either the Labber Log Browser (https://labber.org/overview/) or
Labber Python API (http://labber.org/online-doc/api/LogFile.html)."
article_processing_charge: No
author:
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
citation:
ama: 'Katsaros G. Raw transport data for: Enhancement of proximity induced superconductivity
in planar germanium. 2021. doi:10.15479/AT:ISTA:9291'
apa: 'Katsaros, G. (2021). Raw transport data for: Enhancement of proximity induced
superconductivity in planar germanium. Institute of Science and Technology Austria.
https://doi.org/10.15479/AT:ISTA:9291'
chicago: 'Katsaros, Georgios. “Raw Transport Data for: Enhancement of Proximity
Induced Superconductivity in Planar Germanium.” Institute of Science and Technology
Austria, 2021. https://doi.org/10.15479/AT:ISTA:9291.'
ieee: 'G. Katsaros, “Raw transport data for: Enhancement of proximity induced superconductivity
in planar germanium.” Institute of Science and Technology Austria, 2021.'
ista: 'Katsaros G. 2021. Raw transport data for: Enhancement of proximity induced
superconductivity in planar germanium, Institute of Science and Technology Austria,
10.15479/AT:ISTA:9291.'
mla: 'Katsaros, Georgios. Raw Transport Data for: Enhancement of Proximity Induced
Superconductivity in Planar Germanium. Institute of Science and Technology
Austria, 2021, doi:10.15479/AT:ISTA:9291.'
short: G. Katsaros, (2021).
date_created: 2021-03-27T13:47:49Z
date_published: 2021-03-29T00:00:00Z
date_updated: 2024-02-21T12:37:14Z
day: '29'
ddc:
- '530'
department:
- _id: GeKa
doi: 10.15479/AT:ISTA:9291
file:
- access_level: open_access
checksum: 635df3c08fc13c3dac008cd421aefbe4
content_type: application/x-zip-compressed
creator: gkatsaro
date_created: 2021-03-27T13:46:17Z
date_updated: 2021-03-27T13:46:17Z
file_id: '9292'
file_name: Raw Data- Enhancement of Superconductivity in a Planar Ge hole gas.zip
file_size: 10616071
relation: main_file
success: 1
- access_level: open_access
checksum: 12b3ca69ae7509a346711baae0b02a75
content_type: text/plain
creator: dernst
date_created: 2021-04-01T07:52:56Z
date_updated: 2021-04-01T07:52:56Z
file_id: '9302'
file_name: README.txt
file_size: 470
relation: main_file
success: 1
file_date_updated: 2021-04-01T07:52:56Z
has_accepted_license: '1'
month: '03'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
status: public
title: 'Raw transport data for: Enhancement of proximity induced superconductivity
in planar germanium'
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '9636'
article_processing_charge: No
author:
- first_name: Andrew P
full_name: Higginbotham, Andrew P
id: 4AD6785A-F248-11E8-B48F-1D18A9856A87
last_name: Higginbotham
orcid: 0000-0003-2607-2363
citation:
ama: Higginbotham AP. Data for “Breakdown of induced p ± ip pairing in a superconductor-semiconductor
hybrid.” 2021.
apa: Higginbotham, A. P. (2021). Data for “Breakdown of induced p ± ip pairing in
a superconductor-semiconductor hybrid.” Institute of Science and Technology Austria.
chicago: Higginbotham, Andrew P. “Data for ‘Breakdown of Induced p ± Ip Pairing
in a Superconductor-Semiconductor Hybrid.’” Institute of Science and Technology
Austria, 2021.
ieee: A. P. Higginbotham, “Data for ‘Breakdown of induced p ± ip pairing in a superconductor-semiconductor
hybrid.’” Institute of Science and Technology Austria, 2021.
ista: Higginbotham AP. 2021. Data for ‘Breakdown of induced p ± ip pairing in a
superconductor-semiconductor hybrid’, Institute of Science and Technology Austria.
mla: Higginbotham, Andrew P. Data for “Breakdown of Induced p ± Ip Pairing in
a Superconductor-Semiconductor Hybrid.” Institute of Science and Technology
Austria, 2021.
short: A.P. Higginbotham, (2021).
date_created: 2021-07-07T20:43:10Z
date_published: 2021-01-01T00:00:00Z
date_updated: 2024-02-21T12:36:52Z
department:
- _id: AnHi
file:
- access_level: open_access
checksum: 18e90687ec7bbd75f8bfea4d8293fb30
content_type: application/zip
creator: ahigginb
date_created: 2021-07-07T20:37:28Z
date_updated: 2021-07-07T20:37:28Z
file_id: '9637'
file_name: figures_data.zip
file_size: 3345244
relation: main_file
success: 1
file_date_updated: 2021-07-07T20:37:28Z
has_accepted_license: '1'
oa: 1
oa_version: Submitted Version
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '10029'
relation: used_in_publication
status: public
status: public
title: Data for "Breakdown of induced p ± ip pairing in a superconductor-semiconductor
hybrid"
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '8910'
abstract:
- lang: eng
text: A semiconducting nanowire fully wrapped by a superconducting shell has been
proposed as a platform for obtaining Majorana modes at small magnetic fields.
In this study, we demonstrate that the appearance of subgap states in such structures
is actually governed by the junction region in tunneling spectroscopy measurements
and not the full-shell nanowire itself. Short tunneling regions never show subgap
states, whereas longer junctions always do. This can be understood in terms of
quantum dots forming in the junction and hosting Andreev levels in the Yu-Shiba-Rusinov
regime. The intricate magnetic field dependence of the Andreev levels, through
both the Zeeman and Little-Parks effects, may result in robust zero-bias peaks—features
that could be easily misinterpreted as originating from Majorana zero modes but
are unrelated to topological superconductivity.
acknowledged_ssus:
- _id: M-Shop
- _id: NanoFab
acknowledgement: The authors thank A. Higginbotham, E. J. H. Lee and F. R. Martins
for helpful discussions. This research was supported by the Scientific Service Units
of IST Austria through resources provided by the MIBA Machine Shop and the nanofabrication
facility; the NOMIS Foundation and Microsoft; the European Union’s Horizon 2020
research and innovation program under the Marie SklodowskaCurie grant agreement
No 844511; the FETOPEN Grant Agreement No. 828948; the European Research Commission
through the grant agreement HEMs-DAM No 716655; the Spanish Ministry of Science
and Innovation through Grants PGC2018-097018-B-I00, PCI2018-093026, FIS2016-80434-P
(AEI/FEDER, EU), RYC2011-09345 (Ram´on y Cajal Programme), and the Mar´ıa de Maeztu
Programme for Units of Excellence in R&D (CEX2018-000805-M); the CSIC Research Platform
on Quantum Technologies PTI-001.
article_number: 82-88
article_processing_charge: No
article_type: original
author:
- first_name: Marco
full_name: Valentini, Marco
id: C0BB2FAC-D767-11E9-B658-BC13E6697425
last_name: Valentini
- first_name: Fernando
full_name: Peñaranda, Fernando
last_name: Peñaranda
- first_name: Andrea C
full_name: Hofmann, Andrea C
id: 340F461A-F248-11E8-B48F-1D18A9856A87
last_name: Hofmann
- first_name: Matthias
full_name: Brauns, Matthias
id: 33F94E3C-F248-11E8-B48F-1D18A9856A87
last_name: Brauns
- first_name: Robert
full_name: Hauschild, Robert
id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
last_name: Hauschild
orcid: 0000-0001-9843-3522
- first_name: Peter
full_name: Krogstrup, Peter
last_name: Krogstrup
- first_name: Pablo
full_name: San-Jose, Pablo
last_name: San-Jose
- first_name: Elsa
full_name: Prada, Elsa
last_name: Prada
- first_name: Ramón
full_name: Aguado, Ramón
last_name: Aguado
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
citation:
ama: Valentini M, Peñaranda F, Hofmann AC, et al. Nontopological zero-bias peaks
in full-shell nanowires induced by flux-tunable Andreev states. Science.
2021;373(6550). doi:10.1126/science.abf1513
apa: Valentini, M., Peñaranda, F., Hofmann, A. C., Brauns, M., Hauschild, R., Krogstrup,
P., … Katsaros, G. (2021). Nontopological zero-bias peaks in full-shell nanowires
induced by flux-tunable Andreev states. Science. American Association for
the Advancement of Science. https://doi.org/10.1126/science.abf1513
chicago: Valentini, Marco, Fernando Peñaranda, Andrea C Hofmann, Matthias Brauns,
Robert Hauschild, Peter Krogstrup, Pablo San-Jose, Elsa Prada, Ramón Aguado, and
Georgios Katsaros. “Nontopological Zero-Bias Peaks in Full-Shell Nanowires Induced
by Flux-Tunable Andreev States.” Science. American Association for the
Advancement of Science, 2021. https://doi.org/10.1126/science.abf1513.
ieee: M. Valentini et al., “Nontopological zero-bias peaks in full-shell
nanowires induced by flux-tunable Andreev states,” Science, vol. 373, no.
6550. American Association for the Advancement of Science, 2021.
ista: Valentini M, Peñaranda F, Hofmann AC, Brauns M, Hauschild R, Krogstrup P,
San-Jose P, Prada E, Aguado R, Katsaros G. 2021. Nontopological zero-bias peaks
in full-shell nanowires induced by flux-tunable Andreev states. Science. 373(6550),
82–88.
mla: Valentini, Marco, et al. “Nontopological Zero-Bias Peaks in Full-Shell Nanowires
Induced by Flux-Tunable Andreev States.” Science, vol. 373, no. 6550, 82–88,
American Association for the Advancement of Science, 2021, doi:10.1126/science.abf1513.
short: M. Valentini, F. Peñaranda, A.C. Hofmann, M. Brauns, R. Hauschild, P. Krogstrup,
P. San-Jose, E. Prada, R. Aguado, G. Katsaros, Science 373 (2021).
date_created: 2020-12-02T10:51:52Z
date_published: 2021-07-02T00:00:00Z
date_updated: 2024-02-21T12:40:09Z
day: '02'
department:
- _id: GeKa
- _id: Bio
doi: 10.1126/science.abf1513
ec_funded: 1
external_id:
arxiv:
- '2008.02348'
isi:
- '000677843100034'
intvolume: ' 373'
isi: 1
issue: '6550'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2008.02348
month: '07'
oa: 1
oa_version: Submitted Version
project:
- _id: 262116AA-B435-11E9-9278-68D0E5697425
name: Hybrid Semiconductor - Superconductor Quantum Devices
- _id: 26A151DA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '844511'
name: Majorana bound states in Ge/SiGe heterostructures
publication: Science
publication_identifier:
eissn:
- '10959203'
issn:
- '00368075'
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/unfinding-a-split-electron/
record:
- id: '13286'
relation: dissertation_contains
status: public
- id: '9389'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Nontopological zero-bias peaks in full-shell nanowires induced by flux-tunable
Andreev states
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 373
year: '2021'
...
---
_id: '9323'
abstract:
- lang: eng
text: This .zip File contains the data for figures presented in the main text and
supplementary material of "A singlet triplet hole spin qubit in planar Ge" by
D. Jirovec, et. al. The measurements were done using Labber Software and the data
is stored in the hdf5 file format. The files can be opened using either the Labber
Log Browser (https://labber.org/overview/) or Labber Python API (http://labber.org/online-doc/api/LogFile.html).
A single file is acquired with QCodes and features the corresponding data type.
XRD data are in .dat format and a code to open the data is provided. The code
for simulations is as well provided in Python.
article_processing_charge: No
author:
- first_name: Daniel
full_name: Jirovec, Daniel
id: 4C473F58-F248-11E8-B48F-1D18A9856A87
last_name: Jirovec
orcid: 0000-0002-7197-4801
citation:
ama: Jirovec D. Research data for “A singlet-triplet hole spin qubit planar Ge.”
2021. doi:10.15479/AT:ISTA:9323
apa: Jirovec, D. (2021). Research data for “A singlet-triplet hole spin qubit planar
Ge.” Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:9323
chicago: Jirovec, Daniel. “Research Data for ‘A Singlet-Triplet Hole Spin Qubit
Planar Ge.’” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/AT:ISTA:9323.
ieee: D. Jirovec, “Research data for ‘A singlet-triplet hole spin qubit planar Ge.’”
Institute of Science and Technology Austria, 2021.
ista: Jirovec D. 2021. Research data for ‘A singlet-triplet hole spin qubit planar
Ge’, Institute of Science and Technology Austria, 10.15479/AT:ISTA:9323.
mla: Jirovec, Daniel. Research Data for “A Singlet-Triplet Hole Spin Qubit Planar
Ge.” Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:9323.
short: D. Jirovec, (2021).
contributor:
- contributor_type: project_member
first_name: Daniel
id: 4C473F58-F248-11E8-B48F-1D18A9856A87
last_name: Jirovec
date_created: 2021-04-14T09:50:22Z
date_published: 2021-04-14T00:00:00Z
date_updated: 2024-02-21T12:39:15Z
day: '14'
ddc:
- '530'
department:
- _id: GradSch
- _id: GeKa
doi: 10.15479/AT:ISTA:9323
file:
- access_level: open_access
checksum: c569d2a2ce1694445cdbca19cf8ae023
content_type: application/x-zip-compressed
creator: djirovec
date_created: 2021-04-14T09:48:47Z
date_updated: 2021-04-14T09:48:47Z
file_id: '9324'
file_name: DataRepositorySTqubit.zip
file_size: 221832287
relation: main_file
success: 1
- access_level: open_access
checksum: 845bdf87430718ad6aff47eda7b5fc92
content_type: application/octet-stream
creator: djirovec
date_created: 2021-04-14T09:49:30Z
date_updated: 2021-04-14T09:49:30Z
file_id: '9325'
file_name: ReadMe
file_size: 4323
relation: main_file
success: 1
file_date_updated: 2021-04-14T09:49:30Z
has_accepted_license: '1'
month: '04'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '8909'
relation: used_in_publication
status: public
status: public
title: Research data for "A singlet-triplet hole spin qubit planar Ge"
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '9389'
abstract:
- lang: eng
text: "This .zip File contains the transport data for \"Non-topological zero bias
peaks in full-shell nanowires induced by flux tunable Andreev states\" by M. Valentini,
et. al. \r\nThe measurements were done using Labber Software and the data is
stored in the hdf5 file format.\r\nInstructions of how to read the data are in
\"Notebook_Valentini.pdf\"."
acknowledged_ssus:
- _id: NanoFab
article_processing_charge: No
author:
- first_name: Marco
full_name: Valentini, Marco
id: C0BB2FAC-D767-11E9-B658-BC13E6697425
last_name: Valentini
citation:
ama: Valentini M. Research data for “Non-topological zero bias peaks in full-shell
nanowires induced by flux tunable Andreev states.” 2021. doi:10.15479/AT:ISTA:9389
apa: Valentini, M. (2021). Research data for “Non-topological zero bias peaks in
full-shell nanowires induced by flux tunable Andreev states.” Institute of Science
and Technology Austria. https://doi.org/10.15479/AT:ISTA:9389
chicago: Valentini, Marco. “Research Data for ‘Non-Topological Zero Bias Peaks in
Full-Shell Nanowires Induced by Flux Tunable Andreev States.’” Institute of Science
and Technology Austria, 2021. https://doi.org/10.15479/AT:ISTA:9389.
ieee: M. Valentini, “Research data for ‘Non-topological zero bias peaks in full-shell
nanowires induced by flux tunable Andreev states.’” Institute of Science and Technology
Austria, 2021.
ista: Valentini M. 2021. Research data for ‘Non-topological zero bias peaks in full-shell
nanowires induced by flux tunable Andreev states’, Institute of Science and Technology
Austria, 10.15479/AT:ISTA:9389.
mla: Valentini, Marco. Research Data for “Non-Topological Zero Bias Peaks in
Full-Shell Nanowires Induced by Flux Tunable Andreev States.” Institute of
Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:9389.
short: M. Valentini, (2021).
contributor:
- contributor_type: contact_person
first_name: Marco
id: C0BB2FAC-D767-11E9-B658-BC13E6697425
last_name: Valentini
date_created: 2021-05-14T12:07:53Z
date_published: 2021-01-01T00:00:00Z
date_updated: 2024-02-21T12:40:09Z
ddc:
- '530'
department:
- _id: GradSch
- _id: GeKa
doi: 10.15479/AT:ISTA:9389
file:
- access_level: open_access
checksum: 80a905c4eef24dab6fb247e81a3d67f5
content_type: application/pdf
creator: mvalenti
date_created: 2021-05-14T11:42:23Z
date_updated: 2021-05-14T11:42:23Z
file_id: '9390'
file_name: Notebook_Valentini.pdf
file_size: 10572981
relation: main_file
- access_level: open_access
checksum: 1e61a7e63949448a8db0091cdac23570
content_type: application/x-zip-compressed
creator: mvalenti
date_created: 2021-05-14T11:56:48Z
date_updated: 2021-05-14T11:56:48Z
file_id: '9391'
file_name: Experimental_data.zip
file_size: 99076111
relation: main_file
file_date_updated: 2021-05-14T11:56:48Z
has_accepted_license: '1'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '8910'
relation: used_in_publication
status: public
status: public
title: Research data for "Non-topological zero bias peaks in full-shell nanowires
induced by flux tunable Andreev states"
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10559'
abstract:
- lang: eng
text: Hole gases in planar germanium can have high mobilities in combination with
strong spin-orbit interaction and electrically tunable g factors, and are therefore
emerging as a promising platform for creating hybrid superconductor-semiconductor
devices. A key challenge towards hybrid Ge-based quantum technologies is the design
of high-quality interfaces and superconducting contacts that are robust against
magnetic fields. In this work, by combining the assets of aluminum, which provides
good contact to the Ge, and niobium, which has a significant superconducting gap,
we demonstrate highly transparent low-disordered JoFETs with relatively large
ICRN products that are capable of withstanding high magnetic fields. We furthermore
demonstrate the ability of phase-biasing individual JoFETs, opening up an avenue
to explore topological superconductivity in planar Ge. The persistence of superconductivity
in the reported hybrid devices beyond 1.8 T paves the way towards integrating
spin qubits and proximity-induced superconductivity on the same chip.
acknowledged_ssus:
- _id: NanoFab
- _id: M-Shop
acknowledgement: This research and related results were made possible with the support
of the NOMIS Foundation. This research was supported by the Scientific Service Units
of IST Austria through resources provided by the MIBA Machine Shop and the nanofabrication
facility, the European Union's Horizon 2020 research and innovation program under
the Marie Sklodowska-Curie Grant agreement No. 844511 Grant Agreement No. 862046.
ICN2 acknowledge funding from Generalitat de Catalunya 2017 SGR 327. ICN2 is supported
by the Severo Ochoa program from Spanish MINECO (Grant No. SEV-2017-0706) and is
funded by the CERCA Programme/Generalitat de Catalunya. Part of the present work
has been performed in the framework of Universitat Autnoma de Barcelona Materials
Science PhD program. The HAADF-STEM microscopy was conducted in the Laboratorio
de Microscopias Avanzadas at Instituto de Nanociencia de Aragon-Universidad de Zaragoza.
Authors acknowledge the LMA-INA for offering access to their instruments and expertise.
We acknowledge support from CSIC Research Platform on Quantum Technologies PTI-001.
This project has received funding from the European Union's Horizon 2020 research
and innovation programme under Grant Agreement No. 823717 ESTEEM3. M.B. acknowledges
support from SUR Generalitat de Catalunya and the EU Social Fund; project ref. 2020
FI 00103. G.S. and M.V. acknowledge support through a projectruimte grant associated
with the Netherlands Organization of Scientific Research (NWO). J.D. acknowledges
support through FRIPRO-project 274853, which is funded by the Research Council of
Norway.
article_number: L022005
article_processing_charge: No
article_type: original
author:
- first_name: Kushagra
full_name: Aggarwal, Kushagra
id: b22ab905-3539-11eb-84c3-fc159dcd79cb
last_name: Aggarwal
orcid: 0000-0001-9985-9293
- first_name: Andrea C
full_name: Hofmann, Andrea C
id: 340F461A-F248-11E8-B48F-1D18A9856A87
last_name: Hofmann
- first_name: Daniel
full_name: Jirovec, Daniel
id: 4C473F58-F248-11E8-B48F-1D18A9856A87
last_name: Jirovec
orcid: 0000-0002-7197-4801
- first_name: Ivan
full_name: Prieto Gonzalez, Ivan
id: 2A307FE2-F248-11E8-B48F-1D18A9856A87
last_name: Prieto Gonzalez
orcid: 0000-0002-7370-5357
- first_name: Amir
full_name: Sammak, Amir
last_name: Sammak
- first_name: Marc
full_name: Botifoll, Marc
last_name: Botifoll
- first_name: Sara
full_name: Martí-Sánchez, Sara
last_name: Martí-Sánchez
- first_name: Menno
full_name: Veldhorst, Menno
last_name: Veldhorst
- first_name: Jordi
full_name: Arbiol, Jordi
last_name: Arbiol
- first_name: Giordano
full_name: Scappucci, Giordano
last_name: Scappucci
- first_name: Jeroen
full_name: Danon, Jeroen
last_name: Danon
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
citation:
ama: Aggarwal K, Hofmann AC, Jirovec D, et al. Enhancement of proximity-induced
superconductivity in a planar Ge hole gas. Physical Review Research. 2021;3(2).
doi:10.1103/physrevresearch.3.l022005
apa: Aggarwal, K., Hofmann, A. C., Jirovec, D., Prieto Gonzalez, I., Sammak, A.,
Botifoll, M., … Katsaros, G. (2021). Enhancement of proximity-induced superconductivity
in a planar Ge hole gas. Physical Review Research. American Physical Society.
https://doi.org/10.1103/physrevresearch.3.l022005
chicago: Aggarwal, Kushagra, Andrea C Hofmann, Daniel Jirovec, Ivan Prieto Gonzalez,
Amir Sammak, Marc Botifoll, Sara Martí-Sánchez, et al. “Enhancement of Proximity-Induced
Superconductivity in a Planar Ge Hole Gas.” Physical Review Research. American
Physical Society, 2021. https://doi.org/10.1103/physrevresearch.3.l022005.
ieee: K. Aggarwal et al., “Enhancement of proximity-induced superconductivity
in a planar Ge hole gas,” Physical Review Research, vol. 3, no. 2. American
Physical Society, 2021.
ista: Aggarwal K, Hofmann AC, Jirovec D, Prieto Gonzalez I, Sammak A, Botifoll M,
Martí-Sánchez S, Veldhorst M, Arbiol J, Scappucci G, Danon J, Katsaros G. 2021.
Enhancement of proximity-induced superconductivity in a planar Ge hole gas. Physical
Review Research. 3(2), L022005.
mla: Aggarwal, Kushagra, et al. “Enhancement of Proximity-Induced Superconductivity
in a Planar Ge Hole Gas.” Physical Review Research, vol. 3, no. 2, L022005,
American Physical Society, 2021, doi:10.1103/physrevresearch.3.l022005.
short: K. Aggarwal, A.C. Hofmann, D. Jirovec, I. Prieto Gonzalez, A. Sammak, M.
Botifoll, S. Martí-Sánchez, M. Veldhorst, J. Arbiol, G. Scappucci, J. Danon, G.
Katsaros, Physical Review Research 3 (2021).
date_created: 2021-12-16T18:50:57Z
date_published: 2021-04-15T00:00:00Z
date_updated: 2024-02-21T12:41:26Z
day: '15'
ddc:
- '620'
department:
- _id: GeKa
doi: 10.1103/physrevresearch.3.l022005
ec_funded: 1
external_id:
arxiv:
- '2012.00322'
file:
- access_level: open_access
checksum: 60a1bc9c9b616b1b155044bb8cfc6484
content_type: application/pdf
creator: cchlebak
date_created: 2021-12-17T08:12:37Z
date_updated: 2021-12-17T08:12:37Z
file_id: '10561'
file_name: 2021_PhysRevResearch_Aggarwal.pdf
file_size: 1917512
relation: main_file
success: 1
file_date_updated: 2021-12-17T08:12:37Z
has_accepted_license: '1'
intvolume: ' 3'
issue: '2'
keyword:
- general engineering
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
project:
- _id: 26A151DA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '844511'
name: Majorana bound states in Ge/SiGe heterostructures
- _id: 237E5020-32DE-11EA-91FC-C7463DDC885E
call_identifier: H2020
grant_number: '862046'
name: TOPOLOGICALLY PROTECTED AND SCALABLE QUANTUM BITS
publication: Physical Review Research
publication_identifier:
issn:
- 2643-1564
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
related_material:
record:
- id: '8831'
relation: earlier_version
status: public
- id: '8834'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Enhancement of proximity-induced superconductivity in a planar Ge hole gas
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: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 3
year: '2021'
...
---
_id: '10166'
abstract:
- lang: eng
text: While sexual reproduction is widespread among many taxa, asexual lineages
have repeatedly evolved from sexual ancestors. Despite extensive research on the
evolution of sex, it is still unclear whether this switch represents a major transition
requiring major molecular reorganization, and how convergent the changes involved
are. In this study, we investigated the phylogenetic relationship and patterns
of gene expression of sexual and asexual lineages of Eurasian Artemia brine shrimp,
to assess how gene expression patterns are affected by the transition to asexuality.
We find only a few genes that are consistently associated with the evolution of
asexuality, suggesting that this shift may not require an extensive overhauling
of the meiotic machinery. While genes with sex-biased expression have high rates
of expression divergence within Eurasian Artemia, neither female- nor male-biased
genes appear to show unusual evolutionary patterns after sexuality is lost, contrary
to theoretical expectations.
acknowledged_ssus:
- _id: ScienComp
acknowledgement: We thank the Vicoso laboratory, Thomas Lenormand and Tanja Schwander
for helpful discussions, the group of Gonzalo Gajardo, especially Cristian Gallardo-Escárate
and Margarita Parraguez Donoso, for sequencing data and advice, and the IST Scientific
Computing Group for their support. This work was supported by the European Research
Council under the European Union's Horizon 2020 research and innovation program
(grant agreement no. 715257).
article_number: '20211720'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- 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: Ariana
full_name: Macon, Ariana
id: 2A0848E2-F248-11E8-B48F-1D18A9856A87
last_name: Macon
- first_name: Francisco
full_name: Hontoria, Francisco
last_name: Hontoria
- first_name: Beatriz
full_name: Vicoso, Beatriz
id: 49E1C5C6-F248-11E8-B48F-1D18A9856A87
last_name: Vicoso
orcid: 0000-0002-4579-8306
citation:
ama: 'Huylmans AK, Macon A, Hontoria F, Vicoso B. Transitions to asexuality and
evolution of gene expression in Artemia brine shrimp. Proceedings of the Royal
Society B: Biological Sciences. 2021;288(1959). doi:10.1098/rspb.2021.1720'
apa: 'Huylmans, A. K., Macon, A., Hontoria, F., & Vicoso, B. (2021). Transitions
to asexuality and evolution of gene expression in Artemia brine shrimp. Proceedings
of the Royal Society B: Biological Sciences. The Royal Society. https://doi.org/10.1098/rspb.2021.1720'
chicago: 'Huylmans, Ann K, Ariana Macon, Francisco Hontoria, and Beatriz Vicoso.
“Transitions to Asexuality and Evolution of Gene Expression in Artemia Brine Shrimp.”
Proceedings of the Royal Society B: Biological Sciences. The Royal Society,
2021. https://doi.org/10.1098/rspb.2021.1720.'
ieee: 'A. K. Huylmans, A. Macon, F. Hontoria, and B. Vicoso, “Transitions to asexuality
and evolution of gene expression in Artemia brine shrimp,” Proceedings of the
Royal Society B: Biological Sciences, vol. 288, no. 1959. The Royal Society,
2021.'
ista: 'Huylmans AK, Macon A, Hontoria F, Vicoso B. 2021. Transitions to asexuality
and evolution of gene expression in Artemia brine shrimp. Proceedings of the Royal
Society B: Biological Sciences. 288(1959), 20211720.'
mla: 'Huylmans, Ann K., et al. “Transitions to Asexuality and Evolution of Gene
Expression in Artemia Brine Shrimp.” Proceedings of the Royal Society B: Biological
Sciences, vol. 288, no. 1959, 20211720, The Royal Society, 2021, doi:10.1098/rspb.2021.1720.'
short: 'A.K. Huylmans, A. Macon, F. Hontoria, B. Vicoso, Proceedings of the Royal
Society B: Biological Sciences 288 (2021).'
date_created: 2021-10-21T07:46:06Z
date_published: 2021-09-22T00:00:00Z
date_updated: 2024-02-21T12:40:29Z
day: '22'
ddc:
- '595'
department:
- _id: BeVi
doi: 10.1098/rspb.2021.1720
ec_funded: 1
external_id:
isi:
- '000697643700001'
pmid:
- '34547909'
file:
- access_level: open_access
checksum: 76e7f253b7040bca2ad76f82bd7c45c0
content_type: application/pdf
creator: cchlebak
date_created: 2021-10-22T11:48:02Z
date_updated: 2021-10-22T11:48:02Z
file_id: '10172'
file_name: 2021_ProRoSocBBioSci_Huylmans.pdf
file_size: 995806
relation: main_file
success: 1
file_date_updated: 2021-10-22T11:48:02Z
has_accepted_license: '1'
intvolume: ' 288'
isi: 1
issue: '1959'
keyword:
- asexual reproduction
- parthenogenesis
- sex-biased genes
- sexual conflict
- automixis
- crustaceans
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 250BDE62-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715257'
name: Prevalence and Influence of Sexual Antagonism on Genome Evolution
publication: 'Proceedings of the Royal Society B: Biological Sciences'
publication_identifier:
eissn:
- 1471-2954
issn:
- 0962-8452
publication_status: published
publisher: The Royal Society
quality_controlled: '1'
related_material:
link:
- relation: supplementary_material
url: https://doi.org/10.6084/m9.figshare.c.5615488.v1
record:
- id: '9949'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Transitions to asexuality and evolution of gene expression in Artemia brine
shrimp
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: 288
year: '2021'
...
---
_id: '9192'
abstract:
- lang: eng
text: Here are the research data underlying the publication " Effects of fine-scale
population structure on inbreeding in a long-term study of snapdragons (Antirrhinum
majus)." Further information are summed up in the README document.
article_processing_charge: No
author:
- first_name: Parvathy
full_name: Surendranadh, Parvathy
id: 455235B8-F248-11E8-B48F-1D18A9856A87
last_name: Surendranadh
- first_name: Louise S
full_name: Arathoon, Louise S
id: 2CFCFF98-F248-11E8-B48F-1D18A9856A87
last_name: Arathoon
orcid: 0000-0003-1771-714X
- first_name: Carina
full_name: Baskett, Carina
id: 3B4A7CE2-F248-11E8-B48F-1D18A9856A87
last_name: Baskett
orcid: 0000-0002-7354-8574
- first_name: David
full_name: Field, David
id: 419049E2-F248-11E8-B48F-1D18A9856A87
last_name: Field
orcid: 0000-0002-4014-8478
- first_name: Melinda
full_name: Pickup, Melinda
id: 2C78037E-F248-11E8-B48F-1D18A9856A87
last_name: Pickup
orcid: 0000-0001-6118-0541
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: Surendranadh P, Arathoon LS, Baskett C, Field D, Pickup M, Barton NH. Effects
of fine-scale population structure on the distribution of heterozygosity in a
long-term study of Antirrhinum majus. 2021. doi:10.15479/AT:ISTA:9192
apa: Surendranadh, P., Arathoon, L. S., Baskett, C., Field, D., Pickup, M., &
Barton, N. H. (2021). Effects of fine-scale population structure on the distribution
of heterozygosity in a long-term study of Antirrhinum majus. Institute of Science
and Technology Austria. https://doi.org/10.15479/AT:ISTA:9192
chicago: Surendranadh, Parvathy, Louise S Arathoon, Carina Baskett, David Field,
Melinda Pickup, and Nicholas H Barton. “Effects of Fine-Scale Population Structure
on the Distribution of Heterozygosity in a Long-Term Study of Antirrhinum Majus.”
Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/AT:ISTA:9192.
ieee: P. Surendranadh, L. S. Arathoon, C. Baskett, D. Field, M. Pickup, and N. H.
Barton, “Effects of fine-scale population structure on the distribution of heterozygosity
in a long-term study of Antirrhinum majus.” Institute of Science and Technology
Austria, 2021.
ista: Surendranadh P, Arathoon LS, Baskett C, Field D, Pickup M, Barton NH. 2021.
Effects of fine-scale population structure on the distribution of heterozygosity
in a long-term study of Antirrhinum majus, Institute of Science and Technology
Austria, 10.15479/AT:ISTA:9192.
mla: Surendranadh, Parvathy, et al. Effects of Fine-Scale Population Structure
on the Distribution of Heterozygosity in a Long-Term Study of Antirrhinum Majus.
Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:9192.
short: P. Surendranadh, L.S. Arathoon, C. Baskett, D. Field, M. Pickup, N.H. Barton,
(2021).
contributor:
- contributor_type: project_member
first_name: Parvathy
id: 455235B8-F248-11E8-B48F-1D18A9856A87
last_name: Surendranadh
- contributor_type: project_member
first_name: Louise S
id: 2CFCFF98-F248-11E8-B48F-1D18A9856A87
last_name: Arathoon
- contributor_type: project_member
first_name: Carina
id: 3B4A7CE2-F248-11E8-B48F-1D18A9856A87
last_name: Baskett
- contributor_type: project_member
first_name: David
id: 419049E2-F248-11E8-B48F-1D18A9856A87
last_name: Field
orcid: 0000-0002-4014-8478
- contributor_type: project_member
first_name: Melinda
id: 2C78037E-F248-11E8-B48F-1D18A9856A87
last_name: Pickup
orcid: 0000-0001-6118-0541
- contributor_type: project_leader
first_name: Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
date_created: 2021-02-24T17:49:21Z
date_published: 2021-02-26T00:00:00Z
date_updated: 2024-02-21T12:41:09Z
day: '26'
ddc:
- '576'
department:
- _id: GradSch
- _id: NiBa
doi: 10.15479/AT:ISTA:9192
file:
- access_level: open_access
checksum: f85537815809a8a4b7da9d01163f88c0
content_type: application/x-zip-compressed
creator: larathoo
date_created: 2021-02-24T17:45:13Z
date_updated: 2021-02-24T17:45:13Z
file_id: '9193'
file_name: Data_Code.zip
file_size: 5934452
relation: main_file
success: 1
file_date_updated: 2021-02-24T17:45:13Z
has_accepted_license: '1'
month: '02'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '11411'
relation: used_in_publication
status: public
- id: '11321'
relation: later_version
status: public
- id: '8254'
relation: earlier_version
status: public
status: public
title: Effects of fine-scale population structure on the distribution of heterozygosity
in a long-term study of Antirrhinum majus
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: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '9949'
article_processing_charge: No
author:
- first_name: Beatriz
full_name: Vicoso, Beatriz
id: 49E1C5C6-F248-11E8-B48F-1D18A9856A87
last_name: Vicoso
orcid: 0000-0002-4579-8306
citation:
ama: Vicoso B. Data from Hyulmans et al 2021, “Transitions to asexuality and evolution
of gene expression in Artemia brine shrimp.” 2021. doi:10.15479/AT:ISTA:9949
apa: Vicoso, B. (2021). Data from Hyulmans et al 2021, “Transitions to asexuality
and evolution of gene expression in Artemia brine shrimp.” Institute of Science
and Technology Austria. https://doi.org/10.15479/AT:ISTA:9949
chicago: Vicoso, Beatriz. “Data from Hyulmans et Al 2021, ‘Transitions to Asexuality
and Evolution of Gene Expression in Artemia Brine Shrimp.’” Institute of Science
and Technology Austria, 2021. https://doi.org/10.15479/AT:ISTA:9949.
ieee: B. Vicoso, “Data from Hyulmans et al 2021, ‘Transitions to asexuality and
evolution of gene expression in Artemia brine shrimp.’” Institute of Science and
Technology Austria, 2021.
ista: Vicoso B. 2021. Data from Hyulmans et al 2021, ‘Transitions to asexuality
and evolution of gene expression in Artemia brine shrimp’, Institute of Science
and Technology Austria, 10.15479/AT:ISTA:9949.
mla: Vicoso, Beatriz. Data from Hyulmans et Al 2021, “Transitions to Asexuality
and Evolution of Gene Expression in Artemia Brine Shrimp.” Institute of Science
and Technology Austria, 2021, doi:10.15479/AT:ISTA:9949.
short: B. Vicoso, (2021).
date_created: 2021-08-21T13:44:22Z
date_published: 2021-08-24T00:00:00Z
date_updated: 2024-02-21T12:40:30Z
day: '24'
department:
- _id: BeVi
doi: 10.15479/AT:ISTA:9949
file:
- access_level: open_access
checksum: 90461837eed66beac6fa302993cf0ca9
content_type: application/zip
creator: bvicoso
date_created: 2021-08-21T13:43:59Z
date_updated: 2021-08-21T13:43:59Z
file_id: '9950'
file_name: Data.zip
file_size: 139188306
relation: main_file
success: 1
file_date_updated: 2021-08-21T13:43:59Z
has_accepted_license: '1'
month: '08'
oa: 1
oa_version: None
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '10166'
relation: used_in_publication
status: public
status: public
title: Data from Hyulmans et al 2021, "Transitions to asexuality and evolution of
gene expression in Artemia brine shrimp"
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: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...