---
_id: '10325'
abstract:
- lang: eng
text: Since the inception of Bitcoin, a plethora of distributed ledgers differing
in design and purpose has been created. While by design, blockchains provide no
means to securely communicate with external systems, numerous attempts towards
trustless cross-chain communication have been proposed over the years. Today,
cross-chain communication (CCC) plays a fundamental role in cryptocurrency exchanges,
scalability efforts via sharding, extension of existing systems through sidechains,
and bootstrapping of new blockchains. Unfortunately, existing proposals are designed
ad-hoc for specific use-cases, making it hard to gain confidence in their correctness
and composability. We provide the first systematic exposition of cross-chain communication
protocols. We formalize the underlying research problem and show that CCC is impossible
without a trusted third party, contrary to common beliefs in the blockchain community.
With this result in mind, we develop a framework to design new and evaluate existing
CCC protocols, focusing on the inherent trust assumptions thereof, and derive
a classification covering the field of cross-chain communication to date. We conclude
by discussing open challenges for CCC research and the implications of interoperability
on the security and privacy of blockchains.
acknowledgement: 'We would like express our gratitude to Georgia Avarikioti, Daniel
Perez and Dominik Harz for helpful comments and feedback on earlier versions of
this manuscript. We also thank Nicholas Stifter, Aljosha Judmayer, Philipp Schindler,
Edgar Weippl, and Alistair Stewart for insightful discussions during the early stages
of this research. We also wish to thank the anonymous reviewers for their valuable
comments that helped improve the presentation of our results. This research was
funded by Bridge 1 858561 SESC; Bridge 1 864738 PR4DLT (all FFG); the Christian
Doppler Laboratory for Security and Quality Improvement in the Production System
Lifecycle (CDL-SQI); the competence center SBA-K1 funded by COMET; Chaincode Labs
through the project SLN: Scalability for the Lightning Network; and by the Austrian
Science Fund (FWF) through the Meitner program (project M-2608). Mustafa Al-Bassam
is funded by a scholarship from the Alan Turing Institute. Alexei Zamyatin conducted
the early stages of this work during his time at SBA Research, and was supported
by a Binance Research Fellowship.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Alexei
full_name: Zamyatin, Alexei
last_name: Zamyatin
- first_name: Mustafa
full_name: Al-Bassam, Mustafa
last_name: Al-Bassam
- first_name: Dionysis
full_name: Zindros, Dionysis
last_name: Zindros
- first_name: Eleftherios
full_name: Kokoris Kogias, Eleftherios
id: f5983044-d7ef-11ea-ac6d-fd1430a26d30
last_name: Kokoris Kogias
- first_name: Pedro
full_name: Moreno-Sanchez, Pedro
last_name: Moreno-Sanchez
- first_name: Aggelos
full_name: Kiayias, Aggelos
last_name: Kiayias
- first_name: William J.
full_name: Knottenbelt, William J.
last_name: Knottenbelt
citation:
ama: 'Zamyatin A, Al-Bassam M, Zindros D, et al. SoK: Communication across distributed
ledgers. In: 25th International Conference on Financial Cryptography and Data
Security. Vol 12675. Springer Nature; 2021:3-36. doi:10.1007/978-3-662-64331-0_1'
apa: 'Zamyatin, A., Al-Bassam, M., Zindros, D., Kokoris Kogias, E., Moreno-Sanchez,
P., Kiayias, A., & Knottenbelt, W. J. (2021). SoK: Communication across distributed
ledgers. In 25th International Conference on Financial Cryptography and Data
Security (Vol. 12675, pp. 3–36). Virtual: Springer Nature. https://doi.org/10.1007/978-3-662-64331-0_1'
chicago: 'Zamyatin, Alexei, Mustafa Al-Bassam, Dionysis Zindros, Eleftherios Kokoris
Kogias, Pedro Moreno-Sanchez, Aggelos Kiayias, and William J. Knottenbelt. “SoK:
Communication across Distributed Ledgers.” In 25th International Conference
on Financial Cryptography and Data Security, 12675:3–36. Springer Nature,
2021. https://doi.org/10.1007/978-3-662-64331-0_1.'
ieee: 'A. Zamyatin et al., “SoK: Communication across distributed ledgers,”
in 25th International Conference on Financial Cryptography and Data Security,
Virtual, 2021, vol. 12675, pp. 3–36.'
ista: 'Zamyatin A, Al-Bassam M, Zindros D, Kokoris Kogias E, Moreno-Sanchez P, Kiayias
A, Knottenbelt WJ. 2021. SoK: Communication across distributed ledgers. 25th International
Conference on Financial Cryptography and Data Security. FC: Financial Cryptography,
LNCS, vol. 12675, 3–36.'
mla: 'Zamyatin, Alexei, et al. “SoK: Communication across Distributed Ledgers.”
25th International Conference on Financial Cryptography and Data Security,
vol. 12675, Springer Nature, 2021, pp. 3–36, doi:10.1007/978-3-662-64331-0_1.'
short: A. Zamyatin, M. Al-Bassam, D. Zindros, E. Kokoris Kogias, P. Moreno-Sanchez,
A. Kiayias, W.J. Knottenbelt, in:, 25th International Conference on Financial
Cryptography and Data Security, Springer Nature, 2021, pp. 3–36.
conference:
end_date: 2021-03-05
location: Virtual
name: 'FC: Financial Cryptography'
start_date: 2021-03-01
date_created: 2021-11-21T23:01:29Z
date_published: 2021-10-23T00:00:00Z
date_updated: 2023-08-14T12:59:26Z
day: '23'
department:
- _id: ElKo
doi: 10.1007/978-3-662-64331-0_1
external_id:
isi:
- '000712016200001'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2019/1128
month: '10'
oa: 1
oa_version: Preprint
page: 3-36
publication: 25th International Conference on Financial Cryptography and Data Security
publication_identifier:
eisbn:
- 978-3-662-64331-0
eissn:
- 1611-3349
isbn:
- 9-783-6626-4330-3
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'SoK: Communication across distributed ledgers'
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: '12675 '
year: '2021'
...
---
_id: '10326'
abstract:
- lang: eng
text: Strigolactones (SLs) are carotenoid-derived plant hormones that control shoot
branching and communications between host plants and symbiotic fungi or root parasitic
plants. Extensive studies have identified the key components participating in
SL biosynthesis and signalling, whereas the catabolism or deactivation of endogenous
SLs in planta remains largely unknown. Here, we report that the Arabidopsis carboxylesterase
15 (AtCXE15) and its orthologues function as efficient hydrolases of SLs. We show
that overexpression of AtCXE15 promotes shoot branching by dampening SL-inhibited
axillary bud outgrowth. We further demonstrate that AtCXE15 could bind and efficiently
hydrolyse SLs both in vitro and in planta. We also provide evidence that AtCXE15
is capable of catalysing hydrolysis of diverse SL analogues and that such CXE15-dependent
catabolism of SLs is evolutionarily conserved in seed plants. These results disclose
a catalytic mechanism underlying homoeostatic regulation of SLs in plants, which
also provides a rational approach to spatial-temporally manipulate the endogenous
SLs and thus architecture of crops and ornamental plants.
acknowledgement: We thank J. Li (Institute of Genetics and Developmental Biology,
China) for providing the at14-1, atmax2-1, atmax3-9, atmax4-1, atmax1-1, kai2-2
(Col-0 background) mutants and B. Xu for providing the complementary DNA of P. patens.
We are grateful to L. Wang for assistance with MST, B. Han for assistance with UPLC–MS,
J. Li for assistance with confocal microscopy and B. Mikael and J. Zhang for their
comments on the manuscript. This work was supported by grants from Strategic Priority
Research Program of Chinese Academy of Sciences (Y.H., XDB27030102) and the National
Natural Science Foundation of China (E.X., 31700253; Y.H., 31830055).
article_processing_charge: No
article_type: original
author:
- first_name: Enjun
full_name: Xu, Enjun
last_name: Xu
- first_name: Liang
full_name: Chai, Liang
last_name: Chai
- first_name: Shiqi
full_name: Zhang, Shiqi
last_name: Zhang
- first_name: Ruixue
full_name: Yu, Ruixue
last_name: Yu
- first_name: Xixi
full_name: Zhang, Xixi
id: 61A66458-47E9-11EA-85BA-8AEAAF14E49A
last_name: Zhang
orcid: 0000-0001-7048-4627
- first_name: Chongyi
full_name: Xu, Chongyi
last_name: Xu
- first_name: Yuxin
full_name: Hu, Yuxin
last_name: Hu
citation:
ama: Xu E, Chai L, Zhang S, et al. Catabolism of strigolactones by a carboxylesterase.
Nature Plants. 2021;7:1495–1504. doi:10.1038/s41477-021-01011-y
apa: Xu, E., Chai, L., Zhang, S., Yu, R., Zhang, X., Xu, C., & Hu, Y. (2021).
Catabolism of strigolactones by a carboxylesterase. Nature Plants. Springer
Nature. https://doi.org/10.1038/s41477-021-01011-y
chicago: Xu, Enjun, Liang Chai, Shiqi Zhang, Ruixue Yu, Xixi Zhang, Chongyi Xu,
and Yuxin Hu. “Catabolism of Strigolactones by a Carboxylesterase.” Nature
Plants. Springer Nature, 2021. https://doi.org/10.1038/s41477-021-01011-y.
ieee: E. Xu et al., “Catabolism of strigolactones by a carboxylesterase,”
Nature Plants, vol. 7. Springer Nature, pp. 1495–1504, 2021.
ista: Xu E, Chai L, Zhang S, Yu R, Zhang X, Xu C, Hu Y. 2021. Catabolism of strigolactones
by a carboxylesterase. Nature Plants. 7, 1495–1504.
mla: Xu, Enjun, et al. “Catabolism of Strigolactones by a Carboxylesterase.” Nature
Plants, vol. 7, Springer Nature, 2021, pp. 1495–1504, doi:10.1038/s41477-021-01011-y.
short: E. Xu, L. Chai, S. Zhang, R. Yu, X. Zhang, C. Xu, Y. Hu, Nature Plants 7
(2021) 1495–1504.
date_created: 2021-11-21T23:01:30Z
date_published: 2021-11-11T00:00:00Z
date_updated: 2023-08-14T11:54:02Z
day: '11'
department:
- _id: JiFr
doi: 10.1038/s41477-021-01011-y
external_id:
isi:
- '000717408000002'
pmid:
- '34764442'
intvolume: ' 7'
isi: 1
language:
- iso: eng
month: '11'
oa_version: None
page: '1495–1504 '
pmid: 1
publication: Nature Plants
publication_identifier:
eissn:
- 2055-0278
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Catabolism of strigolactones by a carboxylesterase
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 7
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: '10363'
abstract:
- lang: eng
text: Erythropoietin enhances oxygen delivery and reduces hypoxia-induced cell death,
but its pro-thrombotic activity is problematic for use of erythropoietin in treating
hypoxia. We constructed a fusion protein that stimulates red blood cell production
and neuroprotection without triggering platelet production, a marker for thrombosis.
The protein consists of an anti-glycophorin A nanobody and an erythropoietin mutant
(L108A). The mutation reduces activation of erythropoietin receptor homodimers
that induce erythropoiesis and thrombosis, but maintains the tissue-protective
signaling. The binding of the nanobody element to glycophorin A rescues homodimeric
erythropoietin receptor activation on red blood cell precursors. In a cell proliferation
assay, the fusion protein is active at 10−14 M, allowing an estimate of the number
of receptor–ligand complexes needed for signaling. This fusion protein stimulates
erythroid cell proliferation in vitro and in mice, and shows neuroprotective activity
in vitro. Our erythropoietin fusion protein presents a novel molecule for treating
hypoxia.
acknowledgement: This work was supported by funds from the Wyss Institute for Biologically
Inspired Engineering and the Boston Biomedical Innovation Center (Pilot Award 112475;
Drive Award U54HL119145). J.L., K.M.K., D.R.B., J.C.W. and P.A.S. were supported
by the Harvard Medical School Department of Systems Biology. J.C.W. was further
supported by the Harvard Medical School Laboratory of Systems Pharmacology. A.V.,
D.R.B. and P.A.S. were further supported by the Wyss Institute for Biologically
Inspired Engineering. N.G.G. was sponsored by the Army Research Office under Grant
Number W911NF-17-2-0092. The views and conclusions contained in this document are
those of the authors and should not be interpreted as representing the official
policies, either expressed or implied, of the Army Research Office or the U.S. Government.
The U.S. Government is authorized to reproduce and distribute reprints for Government
purposes notwithstanding any copyright notation herein. We sincerely thank Amanda
Graveline and the Wyss Institute at Harvard for their scientific support.
article_number: gzab025
article_processing_charge: No
article_type: original
author:
- first_name: Jungmin
full_name: Lee, Jungmin
last_name: Lee
- first_name: Andyna
full_name: Vernet, Andyna
last_name: Vernet
- first_name: Nathalie
full_name: Gruber, Nathalie
id: 2C9C8316-AA17-11E9-B5C2-8BC2E5697425
last_name: Gruber
- first_name: Kasia M.
full_name: Kready, Kasia M.
last_name: Kready
- first_name: Devin R.
full_name: Burrill, Devin R.
last_name: Burrill
- first_name: Jeffrey C.
full_name: Way, Jeffrey C.
last_name: Way
- first_name: Pamela A.
full_name: Silver, Pamela A.
last_name: Silver
citation:
ama: Lee J, Vernet A, Gruber N, et al. Rational engineering of an erythropoietin
fusion protein to treat hypoxia. Protein Engineering, Design and Selection.
2021;34. doi:10.1093/protein/gzab025
apa: Lee, J., Vernet, A., Gruber, N., Kready, K. M., Burrill, D. R., Way, J. C.,
& Silver, P. A. (2021). Rational engineering of an erythropoietin fusion protein
to treat hypoxia. Protein Engineering, Design and Selection. Oxford University
Press. https://doi.org/10.1093/protein/gzab025
chicago: Lee, Jungmin, Andyna Vernet, Nathalie Gruber, Kasia M. Kready, Devin R.
Burrill, Jeffrey C. Way, and Pamela A. Silver. “Rational Engineering of an Erythropoietin
Fusion Protein to Treat Hypoxia.” Protein Engineering, Design and Selection.
Oxford University Press, 2021. https://doi.org/10.1093/protein/gzab025.
ieee: J. Lee et al., “Rational engineering of an erythropoietin fusion protein
to treat hypoxia,” Protein Engineering, Design and Selection, vol. 34.
Oxford University Press, 2021.
ista: Lee J, Vernet A, Gruber N, Kready KM, Burrill DR, Way JC, Silver PA. 2021.
Rational engineering of an erythropoietin fusion protein to treat hypoxia. Protein
Engineering, Design and Selection. 34, gzab025.
mla: Lee, Jungmin, et al. “Rational Engineering of an Erythropoietin Fusion Protein
to Treat Hypoxia.” Protein Engineering, Design and Selection, vol. 34,
gzab025, Oxford University Press, 2021, doi:10.1093/protein/gzab025.
short: J. Lee, A. Vernet, N. Gruber, K.M. Kready, D.R. Burrill, J.C. Way, P.A. Silver,
Protein Engineering, Design and Selection 34 (2021).
date_created: 2021-11-28T23:01:28Z
date_published: 2021-11-01T00:00:00Z
date_updated: 2023-08-14T13:01:38Z
day: '01'
department:
- _id: CaGu
doi: 10.1093/protein/gzab025
external_id:
isi:
- '000746596900001'
pmid:
- '34725710'
intvolume: ' 34'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1093/protein/gzab025
month: '11'
oa: 1
oa_version: Published Version
pmid: 1
publication: Protein Engineering, Design and Selection
publication_identifier:
eissn:
- 1741-0134
issn:
- 1741-0126
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Rational engineering of an erythropoietin fusion protein to treat hypoxia
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 34
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: '10366'
article_number: '203758'
article_processing_charge: No
article_type: letter_note
author:
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
- first_name: Ana Maria
full_name: Lennon, Ana Maria
last_name: Lennon
- first_name: Roberto
full_name: Mayor, Roberto
last_name: Mayor
- first_name: Guillaume
full_name: Salbreux, Guillaume
last_name: Salbreux
citation:
ama: 'Heisenberg C-PJ, Lennon AM, Mayor R, Salbreux G. Special rebranding issue:
“Quantitative cell and developmental biology.” Cells and Development. 2021;168(12).
doi:10.1016/j.cdev.2021.203758'
apa: 'Heisenberg, C.-P. J., Lennon, A. M., Mayor, R., & Salbreux, G. (2021).
Special rebranding issue: “Quantitative cell and developmental biology.” Cells
and Development. Elsevier. https://doi.org/10.1016/j.cdev.2021.203758'
chicago: 'Heisenberg, Carl-Philipp J, Ana Maria Lennon, Roberto Mayor, and Guillaume
Salbreux. “Special Rebranding Issue: ‘Quantitative Cell and Developmental Biology.’”
Cells and Development. Elsevier, 2021. https://doi.org/10.1016/j.cdev.2021.203758.'
ieee: 'C.-P. J. Heisenberg, A. M. Lennon, R. Mayor, and G. Salbreux, “Special rebranding
issue: ‘Quantitative cell and developmental biology,’” Cells and Development,
vol. 168, no. 12. Elsevier, 2021.'
ista: 'Heisenberg C-PJ, Lennon AM, Mayor R, Salbreux G. 2021. Special rebranding
issue: “Quantitative cell and developmental biology”. Cells and Development. 168(12),
203758.'
mla: 'Heisenberg, Carl-Philipp J., et al. “Special Rebranding Issue: ‘Quantitative
Cell and Developmental Biology.’” Cells and Development, vol. 168, no.
12, 203758, Elsevier, 2021, doi:10.1016/j.cdev.2021.203758.'
short: C.-P.J. Heisenberg, A.M. Lennon, R. Mayor, G. Salbreux, Cells and Development
168 (2021).
date_created: 2021-11-28T23:01:30Z
date_published: 2021-11-17T00:00:00Z
date_updated: 2023-08-14T13:02:40Z
day: '17'
department:
- _id: CaHe
doi: 10.1016/j.cdev.2021.203758
external_id:
isi:
- '000974771600028'
pmid:
- '34800748'
intvolume: ' 168'
isi: 1
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.cdev.2021.203758
month: '11'
oa: 1
oa_version: Published Version
pmid: 1
publication: Cells and Development
publication_identifier:
issn:
- 2667-2901
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Special rebranding issue: “Quantitative cell and developmental biology”'
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 168
year: '2021'
...
---
_id: '10367'
abstract:
- lang: eng
text: How information is created, shared and consumed has changed rapidly in recent
decades, in part thanks to new social platforms and technologies on the web. With
ever-larger amounts of unstructured and limited labels, organizing and reconciling
information from different sources and modalities is a central challenge in machine
learning. This cutting-edge tutorial aims to introduce the multimodal entailment
task, which can be useful for detecting semantic alignments when a single modality
alone does not suffice for a whole content understanding. Starting with a brief
overview of natural language processing, computer vision, structured data and
neural graph learning, we lay the foundations for the multimodal sections to follow.
We then discuss recent multimodal learning literature covering visual, audio and
language streams, and explore case studies focusing on tasks which require fine-grained
understanding of visual and linguistic semantics question answering, veracity
and hatred classification. Finally, we introduce a new dataset for recognizing
multimodal entailment, exploring it in a hands-on collaborative section. Overall,
this tutorial gives an overview of multimodal learning, introduces a multimodal
entailment dataset, and encourages future research in the topic.
acknowledgement: "We would like to thank Abby Schantz, Abe Ittycheriah, Aliaksei Severyn,
Allan Heydon, Aly\r\nGrealish, Andrey Vlasov, Arkaitz Zubiaga, Ashwin Kakarla, Chen
Sun, Clayton Williams, Cong\r\nYu, Cordelia Schmid, Da-Cheng Juan, Dan Finnie, Dani
Valevski, Daniel Rocha, David Price, David Sklar, Devi Krishna, Elena Kochkina,
Enrique Alfonseca, Franc¸oise Beaufays, Isabelle Augenstein, Jialu Liu, John Cantwell,
John Palowitch, Jordan Boyd-Graber, Lei Shi, Luis Valente, Maria Voitovich, Mehmet
Aktuna, Mogan Brown, Mor Naaman, Natalia P, Nidhi Hebbar, Pete Aykroyd, Rahul Sukthankar,
Richa Dixit, Steve Pucci, Tania Bedrax-Weiss, Tobias Kaufmann, Tom Boulos, Tu Tsao,
Vladimir Chtchetkine, Yair Kurzion, Yifan Xu and Zach Hynes."
article_processing_charge: No
author:
- first_name: Cesar
full_name: Ilharco, Cesar
last_name: Ilharco
- first_name: Afsaneh
full_name: Shirazi, Afsaneh
last_name: Shirazi
- first_name: Arjun
full_name: Gopalan, Arjun
last_name: Gopalan
- first_name: Arsha
full_name: Nagrani, Arsha
last_name: Nagrani
- first_name: Blaž
full_name: Bratanič, Blaž
last_name: Bratanič
- first_name: Chris
full_name: Bregler, Chris
last_name: Bregler
- first_name: Christina
full_name: Liu, Christina
last_name: Liu
- first_name: Felipe
full_name: Ferreira, Felipe
last_name: Ferreira
- first_name: Gabriek
full_name: Barcik, Gabriek
last_name: Barcik
- first_name: Gabriel
full_name: Ilharco, Gabriel
last_name: Ilharco
- first_name: Georg F
full_name: Osang, Georg F
id: 464B40D6-F248-11E8-B48F-1D18A9856A87
last_name: Osang
- first_name: Jannis
full_name: Bulian, Jannis
last_name: Bulian
- first_name: Jared
full_name: Frank, Jared
last_name: Frank
- first_name: Lucas
full_name: Smaira, Lucas
last_name: Smaira
- first_name: Qin
full_name: Cao, Qin
last_name: Cao
- first_name: Ricardo
full_name: Marino, Ricardo
last_name: Marino
- first_name: Roma
full_name: Patel, Roma
last_name: Patel
- first_name: Thomas
full_name: Leung, Thomas
last_name: Leung
- first_name: Vaiva
full_name: Imbrasaite, Vaiva
last_name: Imbrasaite
citation:
ama: 'Ilharco C, Shirazi A, Gopalan A, et al. Recognizing multimodal entailment.
In: 59th Annual Meeting of the Association for Computational Linguistics and
the 11th International Joint Conference on Natural Language Processing, Tutorial
Abstracts. Association for Computational Linguistics; 2021:29-30. doi:10.18653/v1/2021.acl-tutorials.6'
apa: 'Ilharco, C., Shirazi, A., Gopalan, A., Nagrani, A., Bratanič, B., Bregler,
C., … Imbrasaite, V. (2021). Recognizing multimodal entailment. In 59th Annual
Meeting of the Association for Computational Linguistics and the 11th International
Joint Conference on Natural Language Processing, Tutorial Abstracts (pp. 29–30).
Bangkok, Thailand: Association for Computational Linguistics. https://doi.org/10.18653/v1/2021.acl-tutorials.6'
chicago: Ilharco, Cesar, Afsaneh Shirazi, Arjun Gopalan, Arsha Nagrani, Blaž Bratanič,
Chris Bregler, Christina Liu, et al. “Recognizing Multimodal Entailment.” In 59th
Annual Meeting of the Association for Computational Linguistics and the 11th International
Joint Conference on Natural Language Processing, Tutorial Abstracts, 29–30.
Association for Computational Linguistics, 2021. https://doi.org/10.18653/v1/2021.acl-tutorials.6.
ieee: C. Ilharco et al., “Recognizing multimodal entailment,” in 59th
Annual Meeting of the Association for Computational Linguistics and the 11th International
Joint Conference on Natural Language Processing, Tutorial Abstracts, Bangkok,
Thailand, 2021, pp. 29–30.
ista: 'Ilharco C, Shirazi A, Gopalan A, Nagrani A, Bratanič B, Bregler C, Liu C,
Ferreira F, Barcik G, Ilharco G, Osang GF, Bulian J, Frank J, Smaira L, Cao Q,
Marino R, Patel R, Leung T, Imbrasaite V. 2021. Recognizing multimodal entailment.
59th Annual Meeting of the Association for Computational Linguistics and the 11th
International Joint Conference on Natural Language Processing, Tutorial Abstracts.
ACL: Association for Computational Linguistics ; IJCNLP: International Joint Conference
on Natural Language Processing, 29–30.'
mla: Ilharco, Cesar, et al. “Recognizing Multimodal Entailment.” 59th Annual
Meeting of the Association for Computational Linguistics and the 11th International
Joint Conference on Natural Language Processing, Tutorial Abstracts, Association
for Computational Linguistics, 2021, pp. 29–30, doi:10.18653/v1/2021.acl-tutorials.6.
short: C. Ilharco, A. Shirazi, A. Gopalan, A. Nagrani, B. Bratanič, C. Bregler,
C. Liu, F. Ferreira, G. Barcik, G. Ilharco, G.F. Osang, J. Bulian, J. Frank, L.
Smaira, Q. Cao, R. Marino, R. Patel, T. Leung, V. Imbrasaite, in:, 59th Annual
Meeting of the Association for Computational Linguistics and the 11th International
Joint Conference on Natural Language Processing, Tutorial Abstracts, Association
for Computational Linguistics, 2021, pp. 29–30.
conference:
end_date: 2021-08-06
location: Bangkok, Thailand
name: 'ACL: Association for Computational Linguistics ; IJCNLP: International Joint
Conference on Natural Language Processing'
start_date: 2021-08-01
date_created: 2021-11-28T23:01:30Z
date_published: 2021-08-01T00:00:00Z
date_updated: 2022-01-26T14:26:36Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.18653/v1/2021.acl-tutorials.6
file:
- access_level: open_access
checksum: b14052a025a6ecf675bdfe51db98c0d7
content_type: application/pdf
creator: cchlebak
date_created: 2021-11-29T08:41:00Z
date_updated: 2021-11-29T08:41:00Z
file_id: '10368'
file_name: 2021_ACL_Ilharco.pdf
file_size: 1227703
relation: main_file
success: 1
file_date_updated: 2021-11-29T08:41:00Z
has_accepted_license: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
main_file_link:
- open_access: '1'
url: https://aclanthology.org/2021.acl-tutorials.6/
month: '08'
oa: 1
oa_version: Published Version
page: 29-30
publication: 59th Annual Meeting of the Association for Computational Linguistics
and the 11th International Joint Conference on Natural Language Processing, Tutorial
Abstracts
publication_identifier:
isbn:
- 9-781-9540-8557-2
publication_status: published
publisher: Association for Computational Linguistics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Recognizing multimodal entailment
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: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2021'
...
---
_id: '10401'
abstract:
- lang: eng
text: Theoretical and experimental studies of the interaction between spins and
temperature are vital for the development of spin caloritronics, as they dictate
the design of future devices. In this work, we propose a two-terminal cold-atom
simulator to study that interaction. The proposed quantum simulator consists of
strongly interacting atoms that occupy two temperature reservoirs connected by
a one-dimensional link. First, we argue that the dynamics in the link can be described
using an inhomogeneous Heisenberg spin chain whose couplings are defined by the
local temperature. Second, we show the existence of a spin current in a system
with a temperature difference by studying the dynamics that follows the spin-flip
of an atom in the link. A temperature gradient accelerates the impurity in one
direction more than in the other, leading to an overall spin current similar to
the spin Seebeck effect.
acknowledgement: The authors acknowledge support from the European QuantERA ERA-NET
Cofund in Quantum Technologies (Project QTFLAG Grant Agreement No. 731473) (R.E.B),
CNPq (Conselho Nacional de Desenvolvimento Científico e Tecnológico) Brazil (A.F.),
the European Union’s Horizon 2020 research and innovation programme under the Marie
Skłodowska-Curie Grant Agreement No. 754411 (A.G.V.), the Independent Research Fund
Denmark, the Carlsberg Foundation, and Aarhus University Research Foundation under
the Jens Christian Skou fellowship program (N.T.Z).
article_number: '252'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Rafael E.
full_name: Barfknecht, Rafael E.
last_name: Barfknecht
- first_name: Angela
full_name: Foerster, Angela
last_name: Foerster
- first_name: Nikolaj T.
full_name: Zinner, Nikolaj T.
last_name: Zinner
- first_name: Artem
full_name: Volosniev, Artem
id: 37D278BC-F248-11E8-B48F-1D18A9856A87
last_name: Volosniev
orcid: 0000-0003-0393-5525
citation:
ama: Barfknecht RE, Foerster A, Zinner NT, Volosniev A. Generation of spin currents
by a temperature gradient in a two-terminal device. Communications Physics.
2021;4(1). doi:10.1038/s42005-021-00753-7
apa: Barfknecht, R. E., Foerster, A., Zinner, N. T., & Volosniev, A. (2021).
Generation of spin currents by a temperature gradient in a two-terminal device.
Communications Physics. Springer Nature. https://doi.org/10.1038/s42005-021-00753-7
chicago: Barfknecht, Rafael E., Angela Foerster, Nikolaj T. Zinner, and Artem Volosniev.
“Generation of Spin Currents by a Temperature Gradient in a Two-Terminal Device.”
Communications Physics. Springer Nature, 2021. https://doi.org/10.1038/s42005-021-00753-7.
ieee: R. E. Barfknecht, A. Foerster, N. T. Zinner, and A. Volosniev, “Generation
of spin currents by a temperature gradient in a two-terminal device,” Communications
Physics, vol. 4, no. 1. Springer Nature, 2021.
ista: Barfknecht RE, Foerster A, Zinner NT, Volosniev A. 2021. Generation of spin
currents by a temperature gradient in a two-terminal device. Communications Physics.
4(1), 252.
mla: Barfknecht, Rafael E., et al. “Generation of Spin Currents by a Temperature
Gradient in a Two-Terminal Device.” Communications Physics, vol. 4, no.
1, 252, Springer Nature, 2021, doi:10.1038/s42005-021-00753-7.
short: R.E. Barfknecht, A. Foerster, N.T. Zinner, A. Volosniev, Communications Physics
4 (2021).
date_created: 2021-12-05T23:01:39Z
date_published: 2021-11-26T00:00:00Z
date_updated: 2023-08-14T13:04:34Z
day: '26'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.1038/s42005-021-00753-7
ec_funded: 1
external_id:
arxiv:
- '2101.02020'
isi:
- 10.1038/s42005-021-00753-7
file:
- access_level: open_access
checksum: 9097319952cb9a3d96e7fd3aa9813a03
content_type: application/pdf
creator: alisjak
date_created: 2021-12-06T14:53:41Z
date_updated: 2021-12-06T14:53:41Z
file_id: '10420'
file_name: 2021_NatComm_Barfknecht.pdf
file_size: 1068984
relation: main_file
success: 1
file_date_updated: 2021-12-06T14:53:41Z
has_accepted_license: '1'
intvolume: ' 4'
issue: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Communications Physics
publication_identifier:
eissn:
- '23993650'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Generation of spin currents by a temperature gradient in a two-terminal device
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: 4
year: '2021'
...
---
_id: '10402'
abstract:
- lang: eng
text: Branching morphogenesis governs the formation of many organs such as lung,
kidney, and the neurovascular system. Many studies have explored system-specific
molecular and cellular regulatory mechanisms, as well as self-organizing rules
underlying branching morphogenesis. However, in addition to local cues, branched
tissue growth can also be influenced by global guidance. Here, we develop a theoretical
framework for a stochastic self-organized branching process in the presence of
external cues. Combining analytical theory with numerical simulations, we predict
differential signatures of global vs. local regulatory mechanisms on the branching
pattern, such as angle distributions, domain size, and space-filling efficiency.
We find that branch alignment follows a generic scaling law determined by the
strength of global guidance, while local interactions influence the tissue density
but not its overall territory. Finally, using zebrafish innervation as a model
system, we test these key features of the model experimentally. Our work thus
provides quantitative predictions to disentangle the role of different types of
cues in shaping branched structures across scales.
acknowledgement: We thank all members of our respective groups for helpful discussion
on the paper. The authors are also grateful to Prof. Abdel El. Manira for support
and sharing Tg(HUC:Gal4;UAS:Synaptohysin-GFP), to Haohao Wu for discussion, and
thank Elena Zabalueva for the zebrafish schematic. The authors also acknowledge
Zebrafish core facility, Genome Engineering Zebrafish and Biomedicum Imaging Core
from the Karolinska Institutet for technical support. This work received funding
from the ERC under the European Union’s Horizon 2020 research and innovation programme
(grant agreement No. 851288 to E.H.) and under the Marie Skłodowska-Curie grant
agreement No. 754411 (to M.C.U.); Swedish Research Council (to F.L., I.A. and S.H.);
Knut and Alice Wallenberg Foundation (F.L. and I.A.); Swedish Brain Foundation (F.L.
and S.H.); Ming Wai Lau Foundation (to F.L.); StratRegen (to F.L.); ERC Consolidator
grant STEMMING-FROM-NERVE and ERC Synergy Grant KILL-OR-DIFFERENTIATE (to I.A.);
Bertil Hallsten Research Foundation (to I.A.); Cancerfonden (to I.A.); the Paradifference
Foundation (to I.A.); Austrian Science Fund (to I.A.); and StratNeuro (to S.H.).
article_number: '6830'
article_processing_charge: No
article_type: original
author:
- first_name: Mehmet C
full_name: Ucar, Mehmet C
id: 50B2A802-6007-11E9-A42B-EB23E6697425
last_name: Ucar
orcid: 0000-0003-0506-4217
- first_name: Dmitrii
full_name: Kamenev, Dmitrii
last_name: Kamenev
- first_name: Kazunori
full_name: Sunadome, Kazunori
last_name: Sunadome
- first_name: Dominik C
full_name: Fachet, Dominik C
id: 14FDD550-AA41-11E9-A0E5-1ACCE5697425
last_name: Fachet
- first_name: Francois
full_name: Lallemend, Francois
last_name: Lallemend
- first_name: Igor
full_name: Adameyko, Igor
last_name: Adameyko
- first_name: Saida
full_name: Hadjab, Saida
last_name: Hadjab
- first_name: Edouard B
full_name: Hannezo, Edouard B
id: 3A9DB764-F248-11E8-B48F-1D18A9856A87
last_name: Hannezo
orcid: 0000-0001-6005-1561
citation:
ama: Ucar MC, Kamenev D, Sunadome K, et al. Theory of branching morphogenesis by
local interactions and global guidance. Nature Communications. 2021;12.
doi:10.1038/s41467-021-27135-5
apa: Ucar, M. C., Kamenev, D., Sunadome, K., Fachet, D. C., Lallemend, F., Adameyko,
I., … Hannezo, E. B. (2021). Theory of branching morphogenesis by local interactions
and global guidance. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-021-27135-5
chicago: Ucar, Mehmet C, Dmitrii Kamenev, Kazunori Sunadome, Dominik C Fachet, Francois
Lallemend, Igor Adameyko, Saida Hadjab, and Edouard B Hannezo. “Theory of Branching
Morphogenesis by Local Interactions and Global Guidance.” Nature Communications.
Springer Nature, 2021. https://doi.org/10.1038/s41467-021-27135-5.
ieee: M. C. Ucar et al., “Theory of branching morphogenesis by local interactions
and global guidance,” Nature Communications, vol. 12. Springer Nature,
2021.
ista: Ucar MC, Kamenev D, Sunadome K, Fachet DC, Lallemend F, Adameyko I, Hadjab
S, Hannezo EB. 2021. Theory of branching morphogenesis by local interactions and
global guidance. Nature Communications. 12, 6830.
mla: Ucar, Mehmet C., et al. “Theory of Branching Morphogenesis by Local Interactions
and Global Guidance.” Nature Communications, vol. 12, 6830, Springer Nature,
2021, doi:10.1038/s41467-021-27135-5.
short: M.C. Ucar, D. Kamenev, K. Sunadome, D.C. Fachet, F. Lallemend, I. Adameyko,
S. Hadjab, E.B. Hannezo, Nature Communications 12 (2021).
date_created: 2021-12-05T23:01:40Z
date_published: 2021-11-24T00:00:00Z
date_updated: 2023-08-14T13:18:46Z
day: '24'
ddc:
- '573'
department:
- _id: EdHa
doi: 10.1038/s41467-021-27135-5
ec_funded: 1
external_id:
isi:
- '000722322900020'
pmid:
- '34819507'
file:
- access_level: open_access
checksum: 63c56ec75314a71e63e7dd2920b3c5b5
content_type: application/pdf
creator: cchlebak
date_created: 2021-12-10T08:54:09Z
date_updated: 2021-12-10T08:54:09Z
file_id: '10529'
file_name: 2021_NatComm_Ucar.pdf
file_size: 2303405
relation: main_file
success: 1
file_date_updated: 2021-12-10T08:54:09Z
has_accepted_license: '1'
intvolume: ' 12'
isi: 1
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 05943252-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '851288'
name: Design Principles of Branching Morphogenesis
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Nature Communications
publication_identifier:
eissn:
- 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '13058'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Theory of branching morphogenesis by local interactions and global guidance
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: '10403'
abstract:
- lang: eng
text: Synaptic transmission, connectivity, and dendritic morphology mature in parallel
during brain development and are often disrupted in neurodevelopmental disorders.
Yet how these changes influence the neuronal computations necessary for normal
brain function are not well understood. To identify cellular mechanisms underlying
the maturation of synaptic integration in interneurons, we combined patch-clamp
recordings of excitatory inputs in mouse cerebellar stellate cells (SCs), three-dimensional
reconstruction of SC morphology with excitatory synapse location, and biophysical
modeling. We found that postnatal maturation of postsynaptic strength was homogeneously
reduced along the somatodendritic axis, but dendritic integration was always sublinear.
However, dendritic branching increased without changes in synapse density, leading
to a substantial gain in distal inputs. Thus, changes in synapse distribution,
rather than dendrite cable properties, are the dominant mechanism underlying the
maturation of neuronal computation. These mechanisms favor the emergence of a
spatially compartmentalized two-stage integration model promoting location-dependent
integration within dendritic subunits.
acknowledgement: This study was supported by the Centre National de la Recherche Scientifique
and the Agence Nationale de la Recherche (ANR-13-BSV4-00166, to LC and DAD). TA
was supported by fellowships from the Fondation pour la Recherche Medicale and the
Swedish Research Council. We thank Dmitry Ershov from the Image Analysis Hub of
the Institut Pasteur, Elodie Le Monnier, Elena Hollergschwandtner, Vanessa Zheden,
and Corinne Nantet for technical support and Haining Zhong for providing the Venus-tagged
PSD95 mouse line. We would like to thank Alberto Bacci, Ann Lohof, and Nelson Rebola
for comments on the manuscript.
article_number: e65954
article_processing_charge: No
article_type: original
author:
- first_name: Celia
full_name: Biane, Celia
last_name: Biane
- first_name: Florian
full_name: Rückerl, Florian
last_name: Rückerl
- first_name: Therese
full_name: Abrahamsson, Therese
last_name: Abrahamsson
- first_name: Cécile
full_name: Saint-Cloment, Cécile
last_name: Saint-Cloment
- first_name: Jean
full_name: Mariani, Jean
last_name: Mariani
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: David A.
full_name: Digregorio, David A.
last_name: Digregorio
- first_name: Rachel M.
full_name: Sherrard, Rachel M.
last_name: Sherrard
- first_name: Laurence
full_name: Cathala, Laurence
last_name: Cathala
citation:
ama: Biane C, Rückerl F, Abrahamsson T, et al. Developmental emergence of two-stage
nonlinear synaptic integration in cerebellar interneurons. eLife. 2021;10.
doi:10.7554/eLife.65954
apa: Biane, C., Rückerl, F., Abrahamsson, T., Saint-Cloment, C., Mariani, J., Shigemoto,
R., … Cathala, L. (2021). Developmental emergence of two-stage nonlinear synaptic
integration in cerebellar interneurons. ELife. eLife Sciences Publications.
https://doi.org/10.7554/eLife.65954
chicago: Biane, Celia, Florian Rückerl, Therese Abrahamsson, Cécile Saint-Cloment,
Jean Mariani, Ryuichi Shigemoto, David A. Digregorio, Rachel M. Sherrard, and
Laurence Cathala. “Developmental Emergence of Two-Stage Nonlinear Synaptic Integration
in Cerebellar Interneurons.” ELife. eLife Sciences Publications, 2021.
https://doi.org/10.7554/eLife.65954.
ieee: C. Biane et al., “Developmental emergence of two-stage nonlinear synaptic
integration in cerebellar interneurons,” eLife, vol. 10. eLife Sciences
Publications, 2021.
ista: Biane C, Rückerl F, Abrahamsson T, Saint-Cloment C, Mariani J, Shigemoto R,
Digregorio DA, Sherrard RM, Cathala L. 2021. Developmental emergence of two-stage
nonlinear synaptic integration in cerebellar interneurons. eLife. 10, e65954.
mla: Biane, Celia, et al. “Developmental Emergence of Two-Stage Nonlinear Synaptic
Integration in Cerebellar Interneurons.” ELife, vol. 10, e65954, eLife
Sciences Publications, 2021, doi:10.7554/eLife.65954.
short: C. Biane, F. Rückerl, T. Abrahamsson, C. Saint-Cloment, J. Mariani, R. Shigemoto,
D.A. Digregorio, R.M. Sherrard, L. Cathala, ELife 10 (2021).
date_created: 2021-12-05T23:01:40Z
date_published: 2021-11-03T00:00:00Z
date_updated: 2023-08-14T13:12:07Z
day: '03'
ddc:
- '570'
department:
- _id: RySh
doi: 10.7554/eLife.65954
external_id:
isi:
- '000715789500001'
file:
- access_level: open_access
checksum: c7c33c3319428d56e332e22349c50ed3
content_type: application/pdf
creator: cchlebak
date_created: 2021-12-10T08:31:41Z
date_updated: 2021-12-10T08:31:41Z
file_id: '10528'
file_name: 2021_eLife_Biane.pdf
file_size: 13131322
relation: main_file
success: 1
file_date_updated: 2021-12-10T08:31:41Z
has_accepted_license: '1'
intvolume: ' 10'
isi: 1
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
publication: eLife
publication_identifier:
eissn:
- 2050-084X
publication_status: published
publisher: eLife Sciences Publications
quality_controlled: '1'
scopus_import: '1'
status: public
title: Developmental emergence of two-stage nonlinear synaptic integration in cerebellar
interneurons
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: 10
year: '2021'
...
---
_id: '10404'
abstract:
- lang: eng
text: While convolutional neural networks (CNNs) have found wide adoption as state-of-the-art
models for image-related tasks, their predictions are often highly sensitive to
small input perturbations, which the human vision is robust against. This paper
presents Perturber, a web-based application that allows users to instantaneously
explore how CNN activations and predictions evolve when a 3D input scene is interactively
perturbed. Perturber offers a large variety of scene modifications, such as camera
controls, lighting and shading effects, background modifications, object morphing,
as well as adversarial attacks, to facilitate the discovery of potential vulnerabilities.
Fine-tuned model versions can be directly compared for qualitative evaluation
of their robustness. Case studies with machine learning experts have shown that
Perturber helps users to quickly generate hypotheses about model vulnerabilities
and to qualitatively compare model behavior. Using quantitative analyses, we could
replicate users’ insights with other CNN architectures and input images, yielding
new insights about the vulnerability of adversarially trained models.
acknowledgement: "We thank Robert Geirhos and Roland Zimmermann for their participation
in the case study and valuable feedback, Chris Olah and Nick Cammarata for valuable
discussions in the early phase of the project, as well as the Distill Slack workspace
as a platform for discussions. M.L. is supported in part by the Austrian Science
Fund (FWF) under grant Z211-N23 (Wittgenstein Award). J.B. is supported by the German
Federal Ministry of Education and Research\r\n(BMBF) through the Competence Center
for Machine Learning (TUE.AI, FKZ 01IS18039A) and the International Max Planck Research
School for Intelligent Systems (IMPRS-IS). R.H. is partially supported by Boeing
and Horizon-2020 ECSEL (grant 783163, iDev40).\r\n"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Stefan
full_name: Sietzen, Stefan
last_name: Sietzen
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Judy
full_name: Borowski, Judy
last_name: Borowski
- first_name: Ramin
full_name: Hasani, Ramin
last_name: Hasani
- first_name: Manuela
full_name: Waldner, Manuela
last_name: Waldner
citation:
ama: Sietzen S, Lechner M, Borowski J, Hasani R, Waldner M. Interactive analysis
of CNN robustness. Computer Graphics Forum. 2021;40(7):253-264. doi:10.1111/cgf.14418
apa: Sietzen, S., Lechner, M., Borowski, J., Hasani, R., & Waldner, M. (2021).
Interactive analysis of CNN robustness. Computer Graphics Forum. Wiley.
https://doi.org/10.1111/cgf.14418
chicago: Sietzen, Stefan, Mathias Lechner, Judy Borowski, Ramin Hasani, and Manuela
Waldner. “Interactive Analysis of CNN Robustness.” Computer Graphics Forum.
Wiley, 2021. https://doi.org/10.1111/cgf.14418.
ieee: S. Sietzen, M. Lechner, J. Borowski, R. Hasani, and M. Waldner, “Interactive
analysis of CNN robustness,” Computer Graphics Forum, vol. 40, no. 7. Wiley,
pp. 253–264, 2021.
ista: Sietzen S, Lechner M, Borowski J, Hasani R, Waldner M. 2021. Interactive analysis
of CNN robustness. Computer Graphics Forum. 40(7), 253–264.
mla: Sietzen, Stefan, et al. “Interactive Analysis of CNN Robustness.” Computer
Graphics Forum, vol. 40, no. 7, Wiley, 2021, pp. 253–64, doi:10.1111/cgf.14418.
short: S. Sietzen, M. Lechner, J. Borowski, R. Hasani, M. Waldner, Computer Graphics
Forum 40 (2021) 253–264.
date_created: 2021-12-05T23:01:40Z
date_published: 2021-11-27T00:00:00Z
date_updated: 2023-08-14T13:11:42Z
day: '27'
department:
- _id: ToHe
doi: 10.1111/cgf.14418
external_id:
arxiv:
- '2110.07667'
isi:
- '000722952000024'
intvolume: ' 40'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2110.07667
month: '11'
oa: 1
oa_version: Preprint
page: 253-264
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: Computer Graphics Forum
publication_identifier:
eissn:
- 1467-8659
issn:
- 0167-7055
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Interactive analysis of CNN robustness
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 40
year: '2021'
...
---
_id: '10406'
abstract:
- lang: eng
text: Multicellular organisms develop complex shapes from much simpler, single-celled
zygotes through a process commonly called morphogenesis. Morphogenesis involves
an interplay between several factors, ranging from the gene regulatory networks
determining cell fate and differentiation to the mechanical processes underlying
cell and tissue shape changes. Thus, the study of morphogenesis has historically
been based on multidisciplinary approaches at the interface of biology with physics
and mathematics. Recent technological advances have further improved our ability
to study morphogenesis by bridging the gap between the genetic and biophysical
factors through the development of new tools for visualizing, analyzing, and perturbing
these factors and their biochemical intermediaries. Here, we review how a combination
of genetic, microscopic, biophysical, and biochemical approaches has aided our
attempts to understand morphogenesis and discuss potential approaches that may
be beneficial to such an inquiry in the future.
acknowledgement: The authors would like to thank Feyza Nur Arslan, Suyash Naik, Diana
Pinheiro, Alexandra Schauer, and Shayan Shamipour for their comments on the draft.
N.M. is supported by an ISTplus postdoctoral fellowship (H2020 Marie-Sklodowska-Curie
COFUND Action).
article_processing_charge: No
article_type: original
author:
- first_name: Nikhil
full_name: Mishra, Nikhil
id: C4D70E82-1081-11EA-B3ED-9A4C3DDC885E
last_name: Mishra
orcid: 0000-0002-6425-5788
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
citation:
ama: Mishra N, Heisenberg C-PJ. Dissecting organismal morphogenesis by bridging
genetics and biophysics. Annual Review of Genetics. 2021;55:209-233. doi:10.1146/annurev-genet-071819-103748
apa: Mishra, N., & Heisenberg, C.-P. J. (2021). Dissecting organismal morphogenesis
by bridging genetics and biophysics. Annual Review of Genetics. Annual
Reviews. https://doi.org/10.1146/annurev-genet-071819-103748
chicago: Mishra, Nikhil, and Carl-Philipp J Heisenberg. “Dissecting Organismal Morphogenesis
by Bridging Genetics and Biophysics.” Annual Review of Genetics. Annual
Reviews, 2021. https://doi.org/10.1146/annurev-genet-071819-103748.
ieee: N. Mishra and C.-P. J. Heisenberg, “Dissecting organismal morphogenesis by
bridging genetics and biophysics,” Annual Review of Genetics, vol. 55.
Annual Reviews, pp. 209–233, 2021.
ista: Mishra N, Heisenberg C-PJ. 2021. Dissecting organismal morphogenesis by bridging
genetics and biophysics. Annual Review of Genetics. 55, 209–233.
mla: Mishra, Nikhil, and Carl-Philipp J. Heisenberg. “Dissecting Organismal Morphogenesis
by Bridging Genetics and Biophysics.” Annual Review of Genetics, vol. 55,
Annual Reviews, 2021, pp. 209–33, doi:10.1146/annurev-genet-071819-103748.
short: N. Mishra, C.-P.J. Heisenberg, Annual Review of Genetics 55 (2021) 209–233.
date_created: 2021-12-05T23:01:41Z
date_published: 2021-08-30T00:00:00Z
date_updated: 2023-08-14T13:05:13Z
day: '30'
department:
- _id: CaHe
doi: 10.1146/annurev-genet-071819-103748
ec_funded: 1
external_id:
isi:
- '000747220900010'
pmid:
- '34460295'
intvolume: ' 55'
isi: 1
keyword:
- morphogenesis
- forward genetics
- high-resolution microscopy
- biophysics
- biochemistry
- patterning
language:
- iso: eng
month: '08'
oa_version: None
page: 209-233
pmid: 1
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Annual Review of Genetics
publication_identifier:
eissn:
- 1545-2948
issn:
- 0066-4197
publication_status: published
publisher: Annual Reviews
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dissecting organismal morphogenesis by bridging genetics and biophysics
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 55
year: '2021'
...
---
_id: '10407'
abstract:
- lang: eng
text: Digital hardware Trojans are integrated circuits whose implementation differ
from the specification in an arbitrary and malicious way. For example, the circuit
can differ from its specified input/output behavior after some fixed number of
queries (known as “time bombs”) or on some particular input (known as “cheat codes”).
To detect such Trojans, countermeasures using multiparty computation (MPC) or
verifiable computation (VC) have been proposed. On a high level, to realize a
circuit with specification F one has more sophisticated circuits F⋄ manufactured
(where F⋄ specifies a MPC or VC of F ), and then embeds these F⋄ ’s into
a master circuit which must be trusted but is relatively simple compared to F
. Those solutions impose a significant overhead as F⋄ is much more complex
than F , also the master circuits are not exactly trivial. In this work, we
show that in restricted settings, where F has no evolving state and is queried
on independent inputs, we can achieve a relaxed security notion using very simple
constructions. In particular, we do not change the specification of the circuit
at all (i.e., F=F⋄ ). Moreover the master circuit basically just queries a subset
of its manufactured circuits and checks if they’re all the same. The security
we achieve guarantees that, if the manufactured circuits are initially tested
on up to T inputs, the master circuit will catch Trojans that try to deviate on
significantly more than a 1/T fraction of the inputs. This bound is optimal for
the type of construction considered, and we provably achieve it using a construction
where 12 instantiations of F need to be embedded into the master. We also discuss
an extremely simple construction with just 2 instantiations for which we conjecture
that it already achieves the optimal bound.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Suvradip
full_name: Chakraborty, Suvradip
id: B9CD0494-D033-11E9-B219-A439E6697425
last_name: Chakraborty
- first_name: Stefan
full_name: Dziembowski, Stefan
last_name: Dziembowski
- first_name: Małgorzata
full_name: Gałązka, Małgorzata
last_name: Gałązka
- first_name: Tomasz
full_name: Lizurej, Tomasz
last_name: Lizurej
- 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: Michelle X
full_name: Yeo, Michelle X
id: 2D82B818-F248-11E8-B48F-1D18A9856A87
last_name: Yeo
citation:
ama: 'Chakraborty S, Dziembowski S, Gałązka M, Lizurej T, Pietrzak KZ, Yeo MX. Trojan-resilience
without cryptography. In: Vol 13043. Springer Nature; 2021:397-428. doi:10.1007/978-3-030-90453-1_14'
apa: 'Chakraborty, S., Dziembowski, S., Gałązka, M., Lizurej, T., Pietrzak, K. Z.,
& Yeo, M. X. (2021). Trojan-resilience without cryptography (Vol. 13043, pp.
397–428). Presented at the TCC: Theory of Cryptography Conference, Raleigh, NC,
United States: Springer Nature. https://doi.org/10.1007/978-3-030-90453-1_14'
chicago: Chakraborty, Suvradip, Stefan Dziembowski, Małgorzata Gałązka, Tomasz Lizurej,
Krzysztof Z Pietrzak, and Michelle X Yeo. “Trojan-Resilience without Cryptography,”
13043:397–428. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-90453-1_14.
ieee: 'S. Chakraborty, S. Dziembowski, M. Gałązka, T. Lizurej, K. Z. Pietrzak, and
M. X. Yeo, “Trojan-resilience without cryptography,” presented at the TCC: Theory
of Cryptography Conference, Raleigh, NC, United States, 2021, vol. 13043, pp.
397–428.'
ista: 'Chakraborty S, Dziembowski S, Gałązka M, Lizurej T, Pietrzak KZ, Yeo MX.
2021. Trojan-resilience without cryptography. TCC: Theory of Cryptography Conference,
LNCS, vol. 13043, 397–428.'
mla: Chakraborty, Suvradip, et al. Trojan-Resilience without Cryptography.
Vol. 13043, Springer Nature, 2021, pp. 397–428, doi:10.1007/978-3-030-90453-1_14.
short: S. Chakraborty, S. Dziembowski, M. Gałązka, T. Lizurej, K.Z. Pietrzak, M.X.
Yeo, in:, Springer Nature, 2021, pp. 397–428.
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-12-05T23:01:42Z
date_published: 2021-11-04T00:00:00Z
date_updated: 2023-08-14T13:07:46Z
day: '04'
department:
- _id: KrPi
doi: 10.1007/978-3-030-90453-1_14
ec_funded: 1
external_id:
isi:
- '000728364000014'
intvolume: ' 13043'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2021/1224
month: '11'
oa: 1
oa_version: Preprint
page: 397-428
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_identifier:
eissn:
- 1611-3349
isbn:
- 9-783-0309-0452-4
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Trojan-resilience without cryptography
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 13043
year: '2021'
...
---
_id: '10408'
abstract:
- lang: eng
text: 'Key trees are often the best solution in terms of transmission cost and storage
requirements for managing keys in a setting where a group needs to share a secret
key, while being able to efficiently rotate the key material of users (in order
to recover from a potential compromise, or to add or remove users). Applications
include multicast encryption protocols like LKH (Logical Key Hierarchies) or group
messaging like the current IETF proposal TreeKEM. A key tree is a (typically balanced)
binary tree, where each node is identified with a key: leaf nodes hold users’
secret keys while the root is the shared group key. For a group of size N, each
user just holds log(N) keys (the keys on the path from its leaf to the root)
and its entire key material can be rotated by broadcasting 2log(N) ciphertexts
(encrypting each fresh key on the path under the keys of its parents). In this
work we consider the natural setting where we have many groups with partially
overlapping sets of users, and ask if we can find solutions where the cost of
rotating a key is better than in the trivial one where we have a separate key
tree for each group. We show that in an asymptotic setting (where the number m
of groups is fixed while the number N of users grows) there exist more general
key graphs whose cost converges to the cost of a single group, thus saving a factor
linear in the number of groups over the trivial solution. As our asymptotic “solution”
converges very slowly and performs poorly on concrete examples, we propose an
algorithm that uses a natural heuristic to compute a key graph for any given group
structure. Our algorithm combines two greedy algorithms, and is thus very efficient:
it first converts the group structure into a “lattice graph”, which is then turned
into a key graph by repeatedly applying the algorithm for constructing a Huffman
code. To better understand how far our proposal is from an optimal solution, we
prove lower bounds on the update cost of continuous group-key agreement and multicast
encryption in a symbolic model admitting (asymmetric) encryption, pseudorandom
generators, and secret sharing as building blocks.'
acknowledgement: B. Auerbach, M.A. Baig and K. Pietrzak—received funding from the
European Research Council (ERC) under the European Union’s Horizon 2020 research
and innovation programme (682815 - TOCNeT); Karen Klein was supported in part by
ERC CoG grant 724307 and conducted part of this work at IST Austria, funded by the
ERC under the European Union’s Horizon 2020 research and innovation programme (682815
- TOCNeT); Guillermo Pascual-Perez was funded by the European Union’s Horizon 2020
research and innovation programme under the Marie Skłodowska-Curie Grant Agreement
No. 665385; Michael Walter conducted part of this work at IST Austria, funded by
the ERC under the European Union’s Horizon 2020 research and innovation programme
(682815 - TOCNeT).
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Joel F
full_name: Alwen, Joel F
id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87
last_name: Alwen
- first_name: Benedikt
full_name: Auerbach, Benedikt
id: D33D2B18-E445-11E9-ABB7-15F4E5697425
last_name: Auerbach
orcid: 0000-0002-7553-6606
- first_name: Mirza Ahad
full_name: Baig, Mirza Ahad
id: 3EDE6DE4-AA5A-11E9-986D-341CE6697425
last_name: Baig
- first_name: Miguel
full_name: Cueto Noval, Miguel
id: ffc563a3-f6e0-11ea-865d-e3cce03d17cc
last_name: Cueto Noval
- 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: 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: 'Alwen JF, Auerbach B, Baig MA, et al. Grafting key trees: Efficient key management
for overlapping groups. In: 19th International Conference. Vol 13044. Springer
Nature; 2021:222-253. doi:10.1007/978-3-030-90456-2_8'
apa: 'Alwen, J. F., Auerbach, B., Baig, M. A., Cueto Noval, M., Klein, K., Pascual
Perez, G., … Walter, M. (2021). Grafting key trees: Efficient key management for
overlapping groups. In 19th International Conference (Vol. 13044, pp. 222–253).
Raleigh, NC, United States: Springer Nature. https://doi.org/10.1007/978-3-030-90456-2_8'
chicago: 'Alwen, Joel F, Benedikt Auerbach, Mirza Ahad Baig, Miguel Cueto Noval,
Karen Klein, Guillermo Pascual Perez, Krzysztof Z Pietrzak, and Michael Walter.
“Grafting Key Trees: Efficient Key Management for Overlapping Groups.” In 19th
International Conference, 13044:222–53. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-90456-2_8.'
ieee: 'J. F. Alwen et al., “Grafting key trees: Efficient key management
for overlapping groups,” in 19th International Conference, Raleigh, NC,
United States, 2021, vol. 13044, pp. 222–253.'
ista: 'Alwen JF, Auerbach B, Baig MA, Cueto Noval M, Klein K, Pascual Perez G, Pietrzak
KZ, Walter M. 2021. Grafting key trees: Efficient key management for overlapping
groups. 19th International Conference. TCC: Theory of Cryptography, LNCS, vol.
13044, 222–253.'
mla: 'Alwen, Joel F., et al. “Grafting Key Trees: Efficient Key Management for Overlapping
Groups.” 19th International Conference, vol. 13044, Springer Nature, 2021,
pp. 222–53, doi:10.1007/978-3-030-90456-2_8.'
short: J.F. Alwen, B. Auerbach, M.A. Baig, M. Cueto Noval, K. Klein, G. Pascual
Perez, K.Z. Pietrzak, M. Walter, in:, 19th International Conference, Springer
Nature, 2021, pp. 222–253.
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:42Z
date_published: 2021-11-04T00:00:00Z
date_updated: 2023-08-14T13:19:39Z
day: '04'
department:
- _id: KrPi
doi: 10.1007/978-3-030-90456-2_8
ec_funded: 1
external_id:
isi:
- '000728363700008'
intvolume: ' 13044'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2021/1158
month: '11'
oa: 1
oa_version: Preprint
page: 222-253
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: 19th International Conference
publication_identifier:
eisbn:
- 978-3-030-90456-2
eissn:
- 1611-3349
isbn:
- 9-783-0309-0455-5
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Grafting key trees: Efficient key management for overlapping groups'
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 13044
year: '2021'
...
---
_id: '10409'
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 SO(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(δwlog(S)) , δ being the fan-out of the
circuit. The design of the strategy relies on separators, a graph-theoretic notion
with connections to circuit complexity. with only a SO(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(δwlog(S)) , δ 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 are grateful to Daniel Wichs for helpful discussions on the landscape
of adaptive security of Yao’s garbling. We would also like to thank Crypto 2021
and TCC 2021 reviewers for their detailed review and suggestions, which helped improve
presentation considerably.
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
citation:
ama: 'Kamath Hosdurg C, Klein K, Pietrzak KZ. On treewidth, separators and Yao’s
garbling. In: 19th International Conference. Vol 13043. Springer Nature;
2021:486-517. doi:10.1007/978-3-030-90453-1_17'
apa: 'Kamath Hosdurg, C., Klein, K., & Pietrzak, K. Z. (2021). On treewidth,
separators and Yao’s garbling. In 19th International Conference (Vol. 13043,
pp. 486–517). Raleigh, NC, United States: Springer Nature. https://doi.org/10.1007/978-3-030-90453-1_17'
chicago: Kamath Hosdurg, Chethan, Karen Klein, and Krzysztof Z Pietrzak. “On Treewidth,
Separators and Yao’s Garbling.” In 19th International Conference, 13043:486–517.
Springer Nature, 2021. https://doi.org/10.1007/978-3-030-90453-1_17.
ieee: C. Kamath Hosdurg, K. Klein, and K. Z. Pietrzak, “On treewidth, separators
and Yao’s garbling,” in 19th International Conference, Raleigh, NC, United
States, 2021, vol. 13043, pp. 486–517.
ista: 'Kamath Hosdurg C, Klein K, Pietrzak KZ. 2021. On treewidth, separators and
Yao’s garbling. 19th International Conference. TCC: Theory of Cryptography, LNCS,
vol. 13043, 486–517.'
mla: Kamath Hosdurg, Chethan, et al. “On Treewidth, Separators and Yao’s Garbling.”
19th International Conference, vol. 13043, Springer Nature, 2021, pp. 486–517,
doi:10.1007/978-3-030-90453-1_17.
short: C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, 19th International Conference,
Springer Nature, 2021, pp. 486–517.
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-08-17T06:21:38Z
day: '04'
department:
- _id: KrPi
doi: 10.1007/978-3-030-90453-1_17
ec_funded: 1
external_id:
isi:
- '000728364000017'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2021/926
month: '11'
oa: 1
oa_version: Preprint
page: 486-517
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: '10044'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: On treewidth, separators and Yao’s garbling
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: '13043 '
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: '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
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: 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: 2025-07-14T09:10:11Z
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: '10415'
abstract:
- lang: eng
text: The Hardy–Littlewood circle method was invented over a century ago to study
integer solutions to special Diophantine equations, but it has since proven to
be one of the most successful all-purpose tools available to number theorists.
Not only is it capable of handling remarkably general systems of polynomial equations
defined over arbitrary global fields, but it can also shed light on the space
of rational curves that lie on algebraic varieties. This book, in which the arithmetic
of cubic polynomials takes centre stage, is aimed at bringing beginning graduate
students into contact with some of the many facets of the circle method, both
classical and modern. This monograph is the winner of the 2021 Ferran Sunyer i
Balaguer Prize, a prestigious award for books of expository nature presenting
the latest developments in an active area of research in mathematics.
alternative_title:
- Progress in Mathematics
article_processing_charge: No
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
citation:
ama: 'Browning TD. Cubic Forms and the Circle Method. Vol 343. Cham: Springer
Nature; 2021. doi:10.1007/978-3-030-86872-7'
apa: 'Browning, T. D. (2021). Cubic Forms and the Circle Method (Vol. 343).
Cham: Springer Nature. https://doi.org/10.1007/978-3-030-86872-7'
chicago: 'Browning, Timothy D. Cubic Forms and the Circle Method. Vol. 343.
Cham: Springer Nature, 2021. https://doi.org/10.1007/978-3-030-86872-7.'
ieee: 'T. D. Browning, Cubic Forms and the Circle Method, vol. 343. Cham:
Springer Nature, 2021.'
ista: 'Browning TD. 2021. Cubic Forms and the Circle Method, Cham: Springer Nature,
XIV, 166p.'
mla: Browning, Timothy D. Cubic Forms and the Circle Method. Vol. 343, Springer
Nature, 2021, doi:10.1007/978-3-030-86872-7.
short: T.D. Browning, Cubic Forms and the Circle Method, Springer Nature, Cham,
2021.
date_created: 2021-12-05T23:01:46Z
date_published: 2021-12-01T00:00:00Z
date_updated: 2022-06-03T07:38:33Z
day: '01'
department:
- _id: TiBr
doi: 10.1007/978-3-030-86872-7
intvolume: ' 343'
language:
- iso: eng
month: '12'
oa_version: None
page: XIV, 166
place: Cham
publication_identifier:
eisbn:
- 978-3-030-86872-7
eissn:
- 2296-505X
isbn:
- 978-3-030-86871-0
issn:
- 0743-1643
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Cubic Forms and the Circle Method
type: book
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 343
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: '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'
...