---
_id: '9402'
abstract:
- lang: eng
text: Direct and indirect reciprocity are key mechanisms for the evolution of cooperation.
Direct reciprocity means that individuals use their own experience to decide whether
to cooperate with another person. Indirect reciprocity means that they also consider
the experiences of others. Although these two mechanisms are intertwined, they
are typically studied in isolation. Here, we introduce a mathematical framework
that allows us to explore both kinds of reciprocity simultaneously. We show that
the well-known ‘generous tit-for-tat’ strategy of direct reciprocity has a natural
analogue in indirect reciprocity, which we call ‘generous scoring’. Using an equilibrium
analysis, we characterize under which conditions either of the two strategies
can maintain cooperation. With simulations, we additionally explore which kind
of reciprocity evolves when members of a population engage in social learning
to adapt to their environment. Our results draw unexpected connections between
direct and indirect reciprocity while highlighting important differences regarding
their evolvability.
acknowledgement: 'This work was supported by the European Research Council CoG 863818
(ForM-SMArt) (to K.C.), the European Research Council Start Grant 279307: Graph
Games (to K.C.), and the European Research Council Starting Grant 850529: E-DIRECT
(to C.H.). The funders had no role in study design, data collection and analysis,
decision to publish or preparation of the manuscript.'
article_processing_charge: No
article_type: original
author:
- first_name: Laura
full_name: Schmid, Laura
id: 38B437DE-F248-11E8-B48F-1D18A9856A87
last_name: Schmid
orcid: 0000-0002-6978-7329
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Christian
full_name: Hilbe, Christian
id: 2FDF8F3C-F248-11E8-B48F-1D18A9856A87
last_name: Hilbe
orcid: 0000-0001-5116-955X
- first_name: Martin A.
full_name: Nowak, Martin A.
last_name: Nowak
citation:
ama: Schmid L, Chatterjee K, Hilbe C, Nowak MA. A unified framework of direct and
indirect reciprocity. Nature Human Behaviour. 2021;5(10):1292–1302. doi:10.1038/s41562-021-01114-8
apa: Schmid, L., Chatterjee, K., Hilbe, C., & Nowak, M. A. (2021). A unified
framework of direct and indirect reciprocity. Nature Human Behaviour. Springer
Nature. https://doi.org/10.1038/s41562-021-01114-8
chicago: Schmid, Laura, Krishnendu Chatterjee, Christian Hilbe, and Martin A. Nowak.
“A Unified Framework of Direct and Indirect Reciprocity.” Nature Human Behaviour.
Springer Nature, 2021. https://doi.org/10.1038/s41562-021-01114-8.
ieee: L. Schmid, K. Chatterjee, C. Hilbe, and M. A. Nowak, “A unified framework
of direct and indirect reciprocity,” Nature Human Behaviour, vol. 5, no.
10. Springer Nature, pp. 1292–1302, 2021.
ista: Schmid L, Chatterjee K, Hilbe C, Nowak MA. 2021. A unified framework of direct
and indirect reciprocity. Nature Human Behaviour. 5(10), 1292–1302.
mla: Schmid, Laura, et al. “A Unified Framework of Direct and Indirect Reciprocity.”
Nature Human Behaviour, vol. 5, no. 10, Springer Nature, 2021, pp. 1292–1302,
doi:10.1038/s41562-021-01114-8.
short: L. Schmid, K. Chatterjee, C. Hilbe, M.A. Nowak, Nature Human Behaviour 5
(2021) 1292–1302.
date_created: 2021-05-18T16:56:57Z
date_published: 2021-05-13T00:00:00Z
date_updated: 2025-07-14T09:10:09Z
day: '13'
ddc:
- '000'
department:
- _id: KrCh
- _id: GradSch
doi: 10.1038/s41562-021-01114-8
ec_funded: 1
external_id:
isi:
- '000650304000002'
pmid:
- '33986519'
file:
- access_level: open_access
checksum: 34f55e173f90dc1dab731063458ac780
content_type: application/pdf
creator: dernst
date_created: 2023-11-07T08:27:23Z
date_updated: 2023-11-07T08:27:23Z
file_id: '14496'
file_name: 2021_NatureHumanBehaviour_Schmid_accepted.pdf
file_size: 5232761
relation: main_file
success: 1
file_date_updated: 2023-11-07T08:27:23Z
has_accepted_license: '1'
intvolume: ' 5'
isi: 1
issue: '10'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 1292–1302
pmid: 1
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: Nature Human Behaviour
publication_identifier:
eissn:
- 2397-3374
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/the-emergence-of-cooperation/
record:
- id: '10293'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: A unified framework of direct and indirect reciprocity
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2021'
...
---
_id: '9403'
abstract:
- lang: eng
text: Optimal decision making requires individuals to know their available options
and to anticipate correctly what consequences these options have. In many social
interactions, however, we refrain from gathering all relevant information, even
if this information would help us make better decisions and is costless to obtain.
This chapter examines several examples of “deliberate ignorance.” Two simple models
are proposed to illustrate how ignorance can evolve among self-interested and
payoff - maximizing individuals, and open problems are highlighted that lie ahead
for future research to explore.
article_processing_charge: No
author:
- first_name: Laura
full_name: Schmid, Laura
id: 38B437DE-F248-11E8-B48F-1D18A9856A87
last_name: Schmid
orcid: 0000-0002-6978-7329
- first_name: Christian
full_name: Hilbe, Christian
last_name: Hilbe
citation:
ama: 'Schmid L, Hilbe C. The evolution of strategic ignorance in strategic interaction.
In: Hertwig R, Engel C, eds. Deliberate Ignorance: Choosing Not To Know.
Vol 29. Strüngmann Forum Reports. MIT Press; 2021:139-152.'
apa: 'Schmid, L., & Hilbe, C. (2021). The evolution of strategic ignorance in
strategic interaction. In R. Hertwig & C. Engel (Eds.), Deliberate Ignorance:
Choosing Not To Know (Vol. 29, pp. 139–152). MIT Press.'
chicago: 'Schmid, Laura, and Christian Hilbe. “The Evolution of Strategic Ignorance
in Strategic Interaction.” In Deliberate Ignorance: Choosing Not To Know,
edited by Ralph Hertwig and Christoph Engel, 29:139–52. Strüngmann Forum Reports.
MIT Press, 2021.'
ieee: 'L. Schmid and C. Hilbe, “The evolution of strategic ignorance in strategic
interaction,” in Deliberate Ignorance: Choosing Not To Know, vol. 29, R.
Hertwig and C. Engel, Eds. MIT Press, 2021, pp. 139–152.'
ista: 'Schmid L, Hilbe C. 2021.The evolution of strategic ignorance in strategic
interaction. In: Deliberate Ignorance: Choosing Not To Know. vol. 29, 139–152.'
mla: 'Schmid, Laura, and Christian Hilbe. “The Evolution of Strategic Ignorance
in Strategic Interaction.” Deliberate Ignorance: Choosing Not To Know,
edited by Ralph Hertwig and Christoph Engel, vol. 29, MIT Press, 2021, pp. 139–52.'
short: 'L. Schmid, C. Hilbe, in:, R. Hertwig, C. Engel (Eds.), Deliberate Ignorance:
Choosing Not To Know, MIT Press, 2021, pp. 139–152.'
date_created: 2021-05-19T12:25:42Z
date_published: 2021-03-01T00:00:00Z
date_updated: 2023-02-23T13:57:04Z
day: '01'
department:
- _id: GradSch
- _id: KrCh
editor:
- first_name: Ralph
full_name: Hertwig, Ralph
last_name: Hertwig
- first_name: Christoph
full_name: Engel, Christoph
last_name: Engel
intvolume: ' 29'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://esforum.de/publications/PDFs/sfr29/SFR29_09_Hilbe%20and%20Schmid.pdf
month: '03'
oa: 1
oa_version: Published Version
page: 139-152
publication: 'Deliberate Ignorance: Choosing Not To Know'
publication_identifier:
isbn:
- 978-0-262-04559-9
publisher: MIT Press
quality_controlled: '1'
series_title: Strüngmann Forum Reports
status: public
title: The evolution of strategic ignorance in strategic interaction
type: book_chapter
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 29
year: '2021'
...
---
_id: '9416'
abstract:
- lang: eng
text: 'We study the inductive bias of two-layer ReLU networks trained by gradient
flow. We identify a class of easy-to-learn (`orthogonally separable'') datasets,
and characterise the solution that ReLU networks trained on such datasets converge
to. Irrespective of network width, the solution turns out to be a combination
of two max-margin classifiers: one corresponding to the positive data subset and
one corresponding to the negative data subset. The proof is based on the recently
introduced concept of extremal sectors, for which we prove a number of properties
in the context of orthogonal separability. In particular, we prove stationarity
of activation patterns from some time onwards, which enables a reduction of the
ReLU network to an ensemble of linear subnetworks.'
article_processing_charge: No
author:
- first_name: Phuong
full_name: Bui Thi Mai, Phuong
id: 3EC6EE64-F248-11E8-B48F-1D18A9856A87
last_name: Bui Thi Mai
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Phuong M, Lampert C. The inductive bias of ReLU networks on orthogonally separable
data. In: 9th International Conference on Learning Representations. ; 2021.'
apa: Phuong, M., & Lampert, C. (2021). The inductive bias of ReLU networks on
orthogonally separable data. In 9th International Conference on Learning Representations.
Virtual.
chicago: Phuong, Mary, and Christoph Lampert. “The Inductive Bias of ReLU Networks
on Orthogonally Separable Data.” In 9th International Conference on Learning
Representations, 2021.
ieee: M. Phuong and C. Lampert, “The inductive bias of ReLU networks on orthogonally
separable data,” in 9th International Conference on Learning Representations,
Virtual, 2021.
ista: 'Phuong M, Lampert C. 2021. The inductive bias of ReLU networks on orthogonally
separable data. 9th International Conference on Learning Representations. ICLR:
International Conference on Learning Representations.'
mla: Phuong, Mary, and Christoph Lampert. “The Inductive Bias of ReLU Networks on
Orthogonally Separable Data.” 9th International Conference on Learning Representations,
2021.
short: M. Phuong, C. Lampert, in:, 9th International Conference on Learning Representations,
2021.
conference:
end_date: 2021-05-07
location: Virtual
name: ' ICLR: International Conference on Learning Representations'
start_date: 2021-05-03
date_created: 2021-05-24T11:16:46Z
date_published: 2021-05-01T00:00:00Z
date_updated: 2023-09-07T13:29:50Z
day: '01'
ddc:
- '000'
department:
- _id: GradSch
- _id: ChLa
file:
- access_level: open_access
checksum: f34ff17017527db5ba6927f817bdd125
content_type: application/pdf
creator: bphuong
date_created: 2021-05-24T11:15:57Z
date_updated: 2021-05-24T11:15:57Z
file_id: '9417'
file_name: iclr2021_conference.pdf
file_size: 502356
relation: main_file
file_date_updated: 2021-05-24T11:15:57Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://openreview.net/pdf?id=krz7T0xU9Z_
month: '05'
oa: 1
oa_version: Published Version
publication: 9th International Conference on Learning Representations
publication_status: published
quality_controlled: '1'
related_material:
record:
- id: '9418'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: The inductive bias of ReLU networks on orthogonally separable data
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '9418'
abstract:
- lang: eng
text: "Deep learning is best known for its empirical success across a wide range
of applications\r\nspanning computer vision, natural language processing and speech.
Of equal significance,\r\nthough perhaps less known, are its ramifications for
learning theory: deep networks have\r\nbeen observed to perform surprisingly well
in the high-capacity regime, aka the overfitting\r\nor underspecified regime.
Classically, this regime on the far right of the bias-variance curve\r\nis associated
with poor generalisation; however, recent experiments with deep networks\r\nchallenge
this view.\r\n\r\nThis thesis is devoted to investigating various aspects of underspecification
in deep learning.\r\nFirst, we argue that deep learning models are underspecified
on two levels: a) any given\r\ntraining dataset can be fit by many different functions,
and b) any given function can be\r\nexpressed by many different parameter configurations.
We refer to the second kind of\r\nunderspecification as parameterisation redundancy
and we precisely characterise its extent.\r\nSecond, we characterise the implicit
criteria (the inductive bias) that guide learning in the\r\nunderspecified regime.
Specifically, we consider a nonlinear but tractable classification\r\nsetting,
and show that given the choice, neural networks learn classifiers with a large
margin.\r\nThird, we consider learning scenarios where the inductive bias is not
by itself sufficient to\r\ndeal with underspecification. We then study different
ways of ‘tightening the specification’: i)\r\nIn the setting of representation
learning with variational autoencoders, we propose a hand-\r\ncrafted regulariser
based on mutual information. ii) In the setting of binary classification, we\r\nconsider
soft-label (real-valued) supervision. We derive a generalisation bound for linear\r\nnetworks
supervised in this way and verify that soft labels facilitate fast learning. Finally,
we\r\nexplore an application of soft-label supervision to the training of multi-exit
models."
acknowledged_ssus:
- _id: ScienComp
- _id: CampIT
- _id: E-Lib
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Phuong
full_name: Bui Thi Mai, Phuong
id: 3EC6EE64-F248-11E8-B48F-1D18A9856A87
last_name: Bui Thi Mai
citation:
ama: Phuong M. Underspecification in deep learning. 2021. doi:10.15479/AT:ISTA:9418
apa: Phuong, M. (2021). Underspecification in deep learning. Institute of
Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:9418
chicago: Phuong, Mary. “Underspecification in Deep Learning.” Institute of Science
and Technology Austria, 2021. https://doi.org/10.15479/AT:ISTA:9418.
ieee: M. Phuong, “Underspecification in deep learning,” Institute of Science and
Technology Austria, 2021.
ista: Phuong M. 2021. Underspecification in deep learning. Institute of Science
and Technology Austria.
mla: Phuong, Mary. Underspecification in Deep Learning. Institute of Science
and Technology Austria, 2021, doi:10.15479/AT:ISTA:9418.
short: M. Phuong, Underspecification in Deep Learning, Institute of Science and
Technology Austria, 2021.
date_created: 2021-05-24T13:06:23Z
date_published: 2021-05-30T00:00:00Z
date_updated: 2023-09-08T11:11:12Z
day: '30'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: GradSch
- _id: ChLa
doi: 10.15479/AT:ISTA:9418
file:
- access_level: open_access
checksum: 4f0abe64114cfed264f9d36e8d1197e3
content_type: application/pdf
creator: bphuong
date_created: 2021-05-24T11:22:29Z
date_updated: 2021-05-24T11:22:29Z
file_id: '9419'
file_name: mph-thesis-v519-pdfimages.pdf
file_size: 2673905
relation: main_file
success: 1
- access_level: closed
checksum: f5699e876bc770a9b0df8345a77720a2
content_type: application/zip
creator: bphuong
date_created: 2021-05-24T11:56:02Z
date_updated: 2021-05-24T11:56:02Z
file_id: '9420'
file_name: thesis.zip
file_size: 92995100
relation: source_file
file_date_updated: 2021-05-24T11:56:02Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '125'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '7435'
relation: part_of_dissertation
status: deleted
- id: '7481'
relation: part_of_dissertation
status: public
- id: '9416'
relation: part_of_dissertation
status: public
- id: '7479'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
title: Underspecification in deep learning
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2021'
...
---
_id: '9558'
abstract:
- lang: eng
text: "We show that turbulent dynamics that arise in simulations of the three-dimensional
Navier--Stokes equations in a triply-periodic domain under sinusoidal forcing
can be described as transient visits to the neighborhoods of unstable time-periodic
solutions. Based on this description, we reduce the original system with more
than 10^5 degrees of freedom to a 17-node Markov chain where each node corresponds
to the neighborhood of a periodic orbit. The model accurately reproduces long-term
averages of the system's observables as weighted sums over the periodic orbits.\r\n"
acknowledged_ssus:
- _id: ScienComp
acknowledgement: "We thank the referees for improving this Letter with their comments.
We acknowledge stimulating discussions with\r\nH. Edelsbrunner. This work was supported
by Grant No. 662960 from the Simons Foundation (B. H.). The numerical calculations
were performed at TUBITAK ULAKBIM High Performance and Grid Computing Center (TRUBA
resources) and IST Austria High Performance Computing cluster."
article_number: '244502'
article_processing_charge: No
article_type: letter_note
arxiv: 1
author:
- first_name: Gökhan
full_name: Yalniz, Gökhan
id: 66E74FA2-D8BF-11E9-8249-8DE2E5697425
last_name: Yalniz
orcid: 0000-0002-8490-9312
- first_name: Björn
full_name: Hof, Björn
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
- first_name: Nazmi B
full_name: Budanur, Nazmi B
id: 3EA1010E-F248-11E8-B48F-1D18A9856A87
last_name: Budanur
orcid: 0000-0003-0423-5010
citation:
ama: Yalniz G, Hof B, Budanur NB. Coarse graining the state space of a turbulent
flow using periodic orbits. Physical Review Letters. 2021;126(24). doi:10.1103/PhysRevLett.126.244502
apa: Yalniz, G., Hof, B., & Budanur, N. B. (2021). Coarse graining the state
space of a turbulent flow using periodic orbits. Physical Review Letters.
American Physical Society. https://doi.org/10.1103/PhysRevLett.126.244502
chicago: Yalniz, Gökhan, Björn Hof, and Nazmi B Budanur. “Coarse Graining the State
Space of a Turbulent Flow Using Periodic Orbits.” Physical Review Letters.
American Physical Society, 2021. https://doi.org/10.1103/PhysRevLett.126.244502.
ieee: G. Yalniz, B. Hof, and N. B. Budanur, “Coarse graining the state space of
a turbulent flow using periodic orbits,” Physical Review Letters, vol.
126, no. 24. American Physical Society, 2021.
ista: Yalniz G, Hof B, Budanur NB. 2021. Coarse graining the state space of a turbulent
flow using periodic orbits. Physical Review Letters. 126(24), 244502.
mla: Yalniz, Gökhan, et al. “Coarse Graining the State Space of a Turbulent Flow
Using Periodic Orbits.” Physical Review Letters, vol. 126, no. 24, 244502,
American Physical Society, 2021, doi:10.1103/PhysRevLett.126.244502.
short: G. Yalniz, B. Hof, N.B. Budanur, Physical Review Letters 126 (2021).
date_created: 2021-06-16T15:45:36Z
date_published: 2021-06-18T00:00:00Z
date_updated: 2023-08-08T14:08:36Z
day: '18'
department:
- _id: GradSch
- _id: BjHo
doi: 10.1103/PhysRevLett.126.244502
external_id:
arxiv:
- '2007.02584'
isi:
- '000663310100008'
intvolume: ' 126'
isi: 1
issue: '24'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2007.02584
month: '06'
oa: 1
oa_version: Preprint
project:
- _id: 238598C6-32DE-11EA-91FC-C7463DDC885E
grant_number: '662960'
name: 'Revisiting the Turbulence Problem Using Statistical Mechanics: Experimental
Studies on Transitional and Turbulent Flows'
publication: Physical Review Letters
publication_identifier:
eissn:
- 1079-7114
issn:
- 0031-9007
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/turbulent-flow-simplified/
status: public
title: Coarse graining the state space of a turbulent flow using periodic orbits
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 126
year: '2021'
...
---
_id: '9562'
abstract:
- lang: eng
text: Left-right asymmetries can be considered a fundamental organizational principle
of the vertebrate central nervous system. The hippocampal CA3-CA1 pyramidal cell
synaptic connection shows an input-side dependent asymmetry where the hemispheric
location of the presynaptic CA3 neuron determines the synaptic properties. Left-input
synapses terminating on apical dendrites in stratum radiatum have a higher density
of NMDA receptor subunit GluN2B, a lower density of AMPA receptor subunit GluA1
and smaller areas with less often perforated PSDs. On the other hand, left-input
synapses terminating on basal dendrites in stratum oriens have lower GluN2B densities
than right-input ones. Apical and basal synapses further employ different signaling
pathways involved in LTP. SDS-digested freeze-fracture replica labeling can visualize
synaptic membrane proteins with high sensitivity and resolution, and has been
used to reveal the asymmetry at the electron microscopic level. However, it requires
time-consuming manual demarcation of the synaptic surface for quantitative measurements.
To facilitate the analysis of replica labeling, I first developed a software named
Darea, which utilizes deep-learning to automatize this demarcation. With Darea
I characterized the synaptic distribution of NMDA and AMPA receptors as well as
the voltage-gated Ca2+ channels in CA1 stratum radiatum and oriens. Second, I
explored the role of GluN2B and its carboxy-terminus in the establishment of input-side
dependent hippocampal asymmetry. In conditional knock-out mice lacking GluN2B
expression in CA1 and GluN2B-2A swap mice, where GluN2B carboxy-terminus was exchanged
to that of GluN2A, no significant asymmetries of GluN2B, GluA1 and PSD area were
detected. We further discovered a previously unknown functional asymmetry of GluN2A,
which was also lost in the swap mouse. These results demonstrate that GluN2B carboxy-terminus
plays a critical role in normal formation of input-side dependent asymmetry.
acknowledged_ssus:
- _id: EM-Fac
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: David
full_name: Kleindienst, David
id: 42E121A4-F248-11E8-B48F-1D18A9856A87
last_name: Kleindienst
citation:
ama: 'Kleindienst D. 2B or not 2B: Hippocampal asymmetries mediated by NMDA receptor
subunit GluN2B C-terminus and high-throughput image analysis by Deep-Learning.
2021. doi:10.15479/at:ista:9562'
apa: 'Kleindienst, D. (2021). 2B or not 2B: Hippocampal asymmetries mediated
by NMDA receptor subunit GluN2B C-terminus and high-throughput image analysis
by Deep-Learning. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:9562'
chicago: 'Kleindienst, David. “2B or Not 2B: Hippocampal Asymmetries Mediated by
NMDA Receptor Subunit GluN2B C-Terminus and High-Throughput Image Analysis by
Deep-Learning.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:9562.'
ieee: 'D. Kleindienst, “2B or not 2B: Hippocampal asymmetries mediated by NMDA receptor
subunit GluN2B C-terminus and high-throughput image analysis by Deep-Learning,”
Institute of Science and Technology Austria, 2021.'
ista: 'Kleindienst D. 2021. 2B or not 2B: Hippocampal asymmetries mediated by NMDA
receptor subunit GluN2B C-terminus and high-throughput image analysis by Deep-Learning.
Institute of Science and Technology Austria.'
mla: 'Kleindienst, David. 2B or Not 2B: Hippocampal Asymmetries Mediated by NMDA
Receptor Subunit GluN2B C-Terminus and High-Throughput Image Analysis by Deep-Learning.
Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:9562.'
short: 'D. Kleindienst, 2B or Not 2B: Hippocampal Asymmetries Mediated by NMDA Receptor
Subunit GluN2B C-Terminus and High-Throughput Image Analysis by Deep-Learning,
Institute of Science and Technology Austria, 2021.'
date_created: 2021-06-17T14:10:47Z
date_published: 2021-06-01T00:00:00Z
date_updated: 2023-09-11T12:55:53Z
day: '01'
ddc:
- '570'
degree_awarded: PhD
department:
- _id: GradSch
- _id: RySh
doi: 10.15479/at:ista:9562
file:
- access_level: open_access
checksum: 659df5518db495f679cb1df9e9bd1d94
content_type: application/pdf
creator: dkleindienst
date_created: 2021-06-17T14:03:14Z
date_updated: 2022-07-02T22:30:04Z
embargo: 2022-07-01
file_id: '9563'
file_name: Thesis.pdf
file_size: 77299142
relation: main_file
- access_level: closed
checksum: 3bcf63a2b19e5b6663be051bea332748
content_type: application/zip
creator: dkleindienst
date_created: 2021-06-17T14:04:30Z
date_updated: 2022-07-02T22:30:04Z
embargo_to: open_access
file_id: '9564'
file_name: Thesis_source.zip
file_size: 369804895
relation: source_file
file_date_updated: 2022-07-02T22:30:04Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '124'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '9756'
relation: part_of_dissertation
status: public
- id: '9437'
relation: part_of_dissertation
status: public
- id: '8532'
relation: part_of_dissertation
status: public
- id: '612'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
title: '2B or not 2B: Hippocampal asymmetries mediated by NMDA receptor subunit GluN2B
C-terminus and high-throughput image analysis by Deep-Learning'
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2021'
...
---
_id: '9592'
abstract:
- lang: eng
text: The convex grabbing game is a game where two players, Alice and Bob, alternate
taking extremal points from the convex hull of a point set on the plane. Rational
weights are given to the points. The goal of each player is to maximize the total
weight over all points that they obtain. We restrict the setting to the case of
binary weights. We show a construction of an arbitrarily large odd-sized point
set that allows Bob to obtain almost 3/4 of the total weight. This construction
answers a question asked by Matsumoto, Nakamigawa, and Sakuma in [Graphs and Combinatorics,
36/1 (2020)]. We also present an arbitrarily large even-sized point set where
Bob can obtain the entirety of the total weight. Finally, we discuss conjectures
about optimum moves in the convex grabbing game for both players in general.
article_processing_charge: No
arxiv: 1
author:
- first_name: Martin
full_name: Dvorak, Martin
id: 40ED02A8-C8B4-11E9-A9C0-453BE6697425
last_name: Dvorak
orcid: 0000-0001-5293-214X
- first_name: Sara
full_name: Nicholson, Sara
last_name: Nicholson
citation:
ama: 'Dvorak M, Nicholson S. Massively winning configurations in the convex grabbing
game on the plane. In: Proceedings of the 33rd Canadian Conference on Computational
Geometry.'
apa: Dvorak, M., & Nicholson, S. (n.d.). Massively winning configurations in
the convex grabbing game on the plane. In Proceedings of the 33rd Canadian
Conference on Computational Geometry. Halifax, NS, Canada.
chicago: Dvorak, Martin, and Sara Nicholson. “Massively Winning Configurations in
the Convex Grabbing Game on the Plane.” In Proceedings of the 33rd Canadian
Conference on Computational Geometry, n.d.
ieee: M. Dvorak and S. Nicholson, “Massively winning configurations in the convex
grabbing game on the plane,” in Proceedings of the 33rd Canadian Conference
on Computational Geometry, Halifax, NS, Canada.
ista: 'Dvorak M, Nicholson S. Massively winning configurations in the convex grabbing
game on the plane. Proceedings of the 33rd Canadian Conference on Computational
Geometry. CCCG: Canadian Conference on Computational Geometry.'
mla: Dvorak, Martin, and Sara Nicholson. “Massively Winning Configurations in the
Convex Grabbing Game on the Plane.” Proceedings of the 33rd Canadian Conference
on Computational Geometry.
short: M. Dvorak, S. Nicholson, in:, Proceedings of the 33rd Canadian Conference
on Computational Geometry, n.d.
conference:
end_date: 2021-08-12
location: Halifax, NS, Canada
name: 'CCCG: Canadian Conference on Computational Geometry'
start_date: 2021-08-10
date_created: 2021-06-22T15:57:11Z
date_published: 2021-06-29T00:00:00Z
date_updated: 2021-08-12T10:57:39Z
day: '29'
ddc:
- '516'
department:
- _id: GradSch
- _id: VlKo
external_id:
arxiv:
- '2106.11247'
file:
- access_level: open_access
checksum: 45accb1de9b7e0e4bb2fbfe5fd3e6239
content_type: application/pdf
creator: mdvorak
date_created: 2021-06-28T20:23:13Z
date_updated: 2021-06-28T20:23:13Z
file_id: '9616'
file_name: Convex-Grabbing-Game_CCCG_proc_version.pdf
file_size: 381306
relation: main_file
success: 1
- access_level: open_access
checksum: 9199cf18c65658553487458cc24d0ab2
content_type: application/pdf
creator: kschuh
date_created: 2021-08-12T10:57:21Z
date_updated: 2021-08-12T10:57:21Z
file_id: '9902'
file_name: Convex-Grabbing-Game_FULL-VERSION.pdf
file_size: 403645
relation: main_file
success: 1
file_date_updated: 2021-08-12T10:57:21Z
has_accepted_license: '1'
keyword:
- convex grabbing game
- graph grabbing game
- combinatorial game
- convex geometry
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
publication: Proceedings of the 33rd Canadian Conference on Computational Geometry
publication_status: accepted
quality_controlled: '1'
status: public
title: Massively winning configurations in the convex grabbing game on the plane
tmp:
image: /image/cc_by_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
short: CC BY-ND (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '9623'
abstract:
- lang: eng
text: "Cytoplasmic reorganizations are essential for morphogenesis. In large cells
like oocytes, these reorganizations become crucial in patterning the oocyte for
later stages of embryonic development. Ascidians oocytes reorganize their cytoplasm
(ooplasm) in a spectacular manner. Ooplasmic reorganization is initiated at fertilization
with the contraction of the actomyosin cortex along the animal-vegetal axis of
the oocyte, driving the accumulation of cortical endoplasmic reticulum (cER),
maternal mRNAs associated to it and a mitochondria-rich subcortical layer – the
myoplasm – in a region of the vegetal pole termed contraction pole (CP). Here
we have used the species Phallusia mammillata to investigate the changes in cell
shape that accompany these reorganizations and the mechanochemical mechanisms
underlining CP formation.\r\nWe report that the length of the animal-vegetal (AV)
axis oscillates upon fertilization: it first undergoes a cycle of fast elongation-lengthening
followed by a slow expansion of mainly the vegetal pole (VP) of the cell. We show
that the fast oscillation corresponds to a dynamic polarization of the actin cortex
as a result of a fertilization-induced increase in cortical tension in the oocyte
that triggers a rupture of the cortex at the animal pole and the establishment
of vegetal-directed cortical flows. These flows are responsible for the vegetal
accumulation of actin causing the VP to flatten. \r\nWe find that the slow expansion
of the VP, leading to CP formation, correlates with a relaxation of the vegetal
cortex and that the myoplasm plays a role in the expansion. We show that the myoplasm
is a solid-like layer that buckles under compression forces arising from the contracting
actin cortex at the VP. Straightening of the myoplasm when actin flows stops,
facilitates the expansion of the VP and the CP. Altogether, our results present
a previously unrecognized role for the myoplasm in ascidian ooplasmic segregation.
\r\n"
acknowledged_ssus:
- _id: Bio
- _id: EM-Fac
- _id: NanoFab
- _id: M-Shop
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Silvia
full_name: Caballero Mancebo, Silvia
id: 2F1E1758-F248-11E8-B48F-1D18A9856A87
last_name: Caballero Mancebo
orcid: 0000-0002-5223-3346
citation:
ama: Caballero Mancebo S. Fertilization-induced deformations are controlled by the
actin cortex and a mitochondria-rich subcortical layer in ascidian oocytes. 2021.
doi:10.15479/at:ista:9623
apa: Caballero Mancebo, S. (2021). Fertilization-induced deformations are controlled
by the actin cortex and a mitochondria-rich subcortical layer in ascidian oocytes.
Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:9623
chicago: Caballero Mancebo, Silvia. “Fertilization-Induced Deformations Are Controlled
by the Actin Cortex and a Mitochondria-Rich Subcortical Layer in Ascidian Oocytes.”
Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:9623.
ieee: S. Caballero Mancebo, “Fertilization-induced deformations are controlled by
the actin cortex and a mitochondria-rich subcortical layer in ascidian oocytes,”
Institute of Science and Technology Austria, 2021.
ista: Caballero Mancebo S. 2021. Fertilization-induced deformations are controlled
by the actin cortex and a mitochondria-rich subcortical layer in ascidian oocytes.
Institute of Science and Technology Austria.
mla: Caballero Mancebo, Silvia. Fertilization-Induced Deformations Are Controlled
by the Actin Cortex and a Mitochondria-Rich Subcortical Layer in Ascidian Oocytes.
Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:9623.
short: S. Caballero Mancebo, Fertilization-Induced Deformations Are Controlled by
the Actin Cortex and a Mitochondria-Rich Subcortical Layer in Ascidian Oocytes,
Institute of Science and Technology Austria, 2021.
date_created: 2021-07-01T14:50:17Z
date_published: 2021-07-01T00:00:00Z
date_updated: 2023-09-07T13:33:27Z
ddc:
- '570'
degree_awarded: PhD
department:
- _id: GradSch
- _id: CaHe
doi: 10.15479/at:ista:9623
file:
- access_level: closed
checksum: e039225a47ef32666d59bf35ddd30ecf
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: scaballe
date_created: 2021-07-01T14:48:54Z
date_updated: 2022-07-02T22:30:06Z
embargo_to: open_access
file_id: '9624'
file_name: PhDThesis_SCM.docx
file_size: 131946790
relation: source_file
- access_level: open_access
checksum: dd4d78962ea94ad95e97ca7d9af08f4b
content_type: application/pdf
creator: scaballe
date_created: 2021-07-01T14:46:25Z
date_updated: 2022-07-02T22:30:06Z
embargo: 2022-07-01
file_id: '9625'
file_name: PhDThesis_SCM.pdf
file_size: 17094958
relation: main_file
file_date_updated: 2022-07-02T22:30:06Z
has_accepted_license: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '07'
oa: 1
oa_version: Published Version
page: '111'
publication_identifier:
isbn:
- 978-3-99078-012-1
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '9750'
relation: part_of_dissertation
status: public
- id: '9006'
relation: part_of_dissertation
status: public
status: public
supervisor:
- 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
title: Fertilization-induced deformations are controlled by the actin cortex and a
mitochondria-rich subcortical layer in ascidian oocytes
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2021'
...
---
_id: '10007'
abstract:
- lang: eng
text: The present thesis is concerned with the derivation of weak-strong uniqueness
principles for curvature driven interface evolution problems not satisfying a
comparison principle. The specific examples being treated are two-phase Navier-Stokes
flow with surface tension, modeling the evolution of two incompressible, viscous
and immiscible fluids separated by a sharp interface, and multiphase mean curvature
flow, which serves as an idealized model for the motion of grain boundaries in
an annealing polycrystalline material. Our main results - obtained in joint works
with Julian Fischer, Tim Laux and Theresa M. Simon - state that prior to the formation
of geometric singularities due to topology changes, the weak solution concept
of Abels (Interfaces Free Bound. 9, 2007) to two-phase Navier-Stokes flow with
surface tension and the weak solution concept of Laux and Otto (Calc. Var. Partial
Differential Equations 55, 2016) to multiphase mean curvature flow (for networks
in R^2 or double bubbles in R^3) represents the unique solution to these interface
evolution problems within the class of classical solutions, respectively. To the
best of the author's knowledge, for interface evolution problems not admitting
a geometric comparison principle the derivation of a weak-strong uniqueness principle
represented an open problem, so that the works contained in the present thesis
constitute the first positive results in this direction. The key ingredient of
our approach consists of the introduction of a novel concept of relative entropies
for a class of curvature driven interface evolution problems, for which the associated
energy contains an interfacial contribution being proportional to the surface
area of the evolving (network of) interface(s). The interfacial part of the relative
entropy gives sufficient control on the interface error between a weak and a classical
solution, and its time evolution can be computed, at least in principle, for any
energy dissipating weak solution concept. A resulting stability estimate for the
relative entropy essentially entails the above mentioned weak-strong uniqueness
principles. The present thesis contains a detailed introduction to our relative
entropy approach, which in particular highlights potential applications to other
problems in curvature driven interface evolution not treated in this thesis.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Sebastian
full_name: Hensel, Sebastian
id: 4D23B7DA-F248-11E8-B48F-1D18A9856A87
last_name: Hensel
orcid: 0000-0001-7252-8072
citation:
ama: 'Hensel S. Curvature driven interface evolution: Uniqueness properties of weak
solution concepts. 2021. doi:10.15479/at:ista:10007'
apa: 'Hensel, S. (2021). Curvature driven interface evolution: Uniqueness properties
of weak solution concepts. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10007'
chicago: 'Hensel, Sebastian. “Curvature Driven Interface Evolution: Uniqueness Properties
of Weak Solution Concepts.” Institute of Science and Technology Austria, 2021.
https://doi.org/10.15479/at:ista:10007.'
ieee: 'S. Hensel, “Curvature driven interface evolution: Uniqueness properties of
weak solution concepts,” Institute of Science and Technology Austria, 2021.'
ista: 'Hensel S. 2021. Curvature driven interface evolution: Uniqueness properties
of weak solution concepts. Institute of Science and Technology Austria.'
mla: 'Hensel, Sebastian. Curvature Driven Interface Evolution: Uniqueness Properties
of Weak Solution Concepts. Institute of Science and Technology Austria, 2021,
doi:10.15479/at:ista:10007.'
short: 'S. Hensel, Curvature Driven Interface Evolution: Uniqueness Properties of
Weak Solution Concepts, Institute of Science and Technology Austria, 2021.'
date_created: 2021-09-13T11:12:34Z
date_published: 2021-09-14T00:00:00Z
date_updated: 2023-09-07T13:30:45Z
day: '14'
ddc:
- '515'
degree_awarded: PhD
department:
- _id: GradSch
- _id: JuFi
doi: 10.15479/at:ista:10007
ec_funded: 1
file:
- access_level: closed
checksum: c8475faaf0b680b4971f638f1db16347
content_type: application/x-zip-compressed
creator: shensel
date_created: 2021-09-13T11:03:24Z
date_updated: 2021-09-15T14:37:30Z
file_id: '10008'
file_name: thesis_final_Hensel.zip
file_size: 15022154
relation: source_file
- access_level: open_access
checksum: 1a609937aa5275452822f45f2da17f07
content_type: application/pdf
creator: shensel
date_created: 2021-09-13T14:18:56Z
date_updated: 2021-09-14T09:52:47Z
file_id: '10014'
file_name: thesis_final_Hensel.pdf
file_size: 6583638
relation: main_file
file_date_updated: 2021-09-15T14:37:30Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '300'
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 0aa76401-070f-11eb-9043-b5bb049fa26d
call_identifier: H2020
grant_number: '948819'
name: Bridging Scales in Random Materials
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '10012'
relation: part_of_dissertation
status: public
- id: '10013'
relation: part_of_dissertation
status: public
- id: '7489'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Julian L
full_name: Fischer, Julian L
id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87
last_name: Fischer
orcid: 0000-0002-0479-558X
title: 'Curvature driven interface evolution: Uniqueness properties of weak solution
concepts'
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2021'
...
---
_id: '10030'
abstract:
- lang: eng
text: "This PhD thesis is primarily focused on the study of discrete transport problems,
introduced for the first time in the seminal works of Maas [Maa11] and Mielke
[Mie11] on finite state Markov chains and reaction-diffusion equations, respectively.
More in detail, my research focuses on the study of transport costs on graphs,
in particular the convergence and the stability of such problems in the discrete-to-continuum
limit. This thesis also includes some results concerning\r\nnon-commutative optimal
transport. The first chapter of this thesis consists of a general introduction
to the optimal transport problems, both in the discrete, the continuous, and the
non-commutative setting. Chapters 2 and 3 present the content of two works, obtained
in collaboration with Peter Gladbach, Eva Kopfer, and Jan Maas, where we have
been able to show the convergence of discrete transport costs on periodic graphs
to suitable continuous ones, which can be described by means of a homogenisation
result. We first focus on the particular case of quadratic costs on the real line
and then extending the result to more general costs in arbitrary dimension. Our
results are the first complete characterisation of limits of transport costs on
periodic graphs in arbitrary dimension which do not rely on any additional symmetry.
In Chapter 4 we turn our attention to one of the intriguing connection between
evolution equations and optimal transport, represented by the theory of gradient
flows. We show that discrete gradient flow structures associated to a finite volume
approximation of a certain class of diffusive equations (Fokker–Planck) is stable
in the limit of vanishing meshes, reproving the convergence of the scheme via
the method of evolutionary Γ-convergence and exploiting a more variational point
of view on the problem. This is based on a collaboration with Dominik Forkert
and Jan Maas. Chapter 5 represents a change of perspective, moving away from the
discrete world and reaching the non-commutative one. As in the discrete case,
we discuss how classical tools coming from the commutative optimal transport can
be translated into the setting of density matrices. In particular, in this final
chapter we present a non-commutative version of the Schrödinger problem (or entropic
regularised optimal transport problem) and discuss existence and characterisation
of minimisers, a duality result, and present a non-commutative version of the
well-known Sinkhorn algorithm to compute the above mentioned optimisers. This
is based on a joint work with Dario Feliciangeli and Augusto Gerolin. Finally,
Appendix A and B contain some additional material and discussions, with particular
attention to Harnack inequalities and the regularity of flows on discrete spaces."
acknowledged_ssus:
- _id: M-Shop
- _id: NanoFab
acknowledgement: The author gratefully acknowledges support by the Austrian Science
Fund (FWF), grants No W1245.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Lorenzo
full_name: Portinale, Lorenzo
id: 30AD2CBC-F248-11E8-B48F-1D18A9856A87
last_name: Portinale
citation:
ama: Portinale L. Discrete-to-continuum limits of transport problems and gradient
flows in the space of measures. 2021. doi:10.15479/at:ista:10030
apa: Portinale, L. (2021). Discrete-to-continuum limits of transport problems
and gradient flows in the space of measures. Institute of Science and Technology
Austria. https://doi.org/10.15479/at:ista:10030
chicago: Portinale, Lorenzo. “Discrete-to-Continuum Limits of Transport Problems
and Gradient Flows in the Space of Measures.” Institute of Science and Technology
Austria, 2021. https://doi.org/10.15479/at:ista:10030.
ieee: L. Portinale, “Discrete-to-continuum limits of transport problems and gradient
flows in the space of measures,” Institute of Science and Technology Austria,
2021.
ista: Portinale L. 2021. Discrete-to-continuum limits of transport problems and
gradient flows in the space of measures. Institute of Science and Technology Austria.
mla: Portinale, Lorenzo. Discrete-to-Continuum Limits of Transport Problems and
Gradient Flows in the Space of Measures. Institute of Science and Technology
Austria, 2021, doi:10.15479/at:ista:10030.
short: L. Portinale, Discrete-to-Continuum Limits of Transport Problems and Gradient
Flows in the Space of Measures, Institute of Science and Technology Austria, 2021.
date_created: 2021-09-21T09:14:15Z
date_published: 2021-09-22T00:00:00Z
date_updated: 2023-09-07T13:31:06Z
day: '22'
ddc:
- '515'
degree_awarded: PhD
department:
- _id: GradSch
- _id: JaMa
doi: 10.15479/at:ista:10030
file:
- access_level: closed
checksum: 8cd60dcb8762e8f21867e21e8001e183
content_type: application/x-zip-compressed
creator: cchlebak
date_created: 2021-09-21T09:17:34Z
date_updated: 2022-03-10T12:14:42Z
file_id: '10032'
file_name: tex_and_pictures.zip
file_size: 3876668
relation: source_file
- access_level: open_access
checksum: 9789e9d967c853c1503ec7f307170279
content_type: application/pdf
creator: cchlebak
date_created: 2021-09-27T11:14:31Z
date_updated: 2021-09-27T11:14:31Z
file_id: '10047'
file_name: thesis_portinale_Final (1).pdf
file_size: 2532673
relation: main_file
file_date_updated: 2022-03-10T12:14:42Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 260788DE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
name: Dissipation and Dispersion in Nonlinear Partial Differential Equations
- _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2
grant_number: F6504
name: Taming Complexity in Partial Differential Systems
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '10022'
relation: part_of_dissertation
status: public
- id: '9792'
relation: part_of_dissertation
status: public
- id: '7573'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Jan
full_name: Maas, Jan
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
title: Discrete-to-continuum limits of transport problems and gradient flows in the
space of measures
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2021'
...
---
_id: '10035'
abstract:
- lang: eng
text: 'Many security definitions come in two flavors: a stronger “adaptive” flavor,
where the adversary can arbitrarily make various choices during the course of
the attack, and a weaker “selective” flavor where the adversary must commit to
some or all of their choices a-priori. For example, in the context of identity-based
encryption, selective security requires the adversary to decide on the identity
of the attacked party at the very beginning of the game whereas adaptive security
allows the attacker to first see the master public key and some secret keys before
making this choice. Often, it appears to be much easier to achieve selective security
than it is to achieve adaptive security. A series of several recent works shows
how to cleverly achieve adaptive security in several such scenarios including
generalized selective decryption [Pan07][FJP15], constrained PRFs [FKPR14], and
Yao’s garbled circuits [JW16]. Although the above works expressed vague intuition
that they share a common technique, the connection was never made precise. In
this work we present a new framework (published at Crypto ’17 [JKK+17a]) that
connects all of these works and allows us to present them in a unified and simplified
fashion. Having the framework in place, we show how to achieve adaptive security
for proxy re-encryption schemes (published at PKC ’19 [FKKP19]) and provide the
first adaptive security proofs for continuous group key agreement protocols (published
at S&P ’21 [KPW+21]). Questioning optimality of our framework, we then show that
currently used proof techniques cannot lead to significantly better security guarantees
for "graph-building" games (published at TCC ’21 [KKPW21a]). These games cover
generalized selective decryption, as well as the security of prominent constructions
for constrained PRFs, continuous group key agreement, and proxy re-encryption.
Finally, we revisit the adaptive security of Yao’s garbled circuits and extend
the analysis of Jafargholi and Wichs in two directions: While they prove adaptive
security only for a modified construction with increased online complexity, we
provide the first positive results for the original construction by Yao (published
at TCC ’21 [KKP21a]). On the negative side, we prove that the results of Jafargholi
and Wichs are essentially optimal by showing that no black-box reduction can provide
a significantly better security bound (published at Crypto ’21 [KKPW21c]).'
acknowledgement: "I want to acknowledge the funding by the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme
(682815 - TOCNeT).\r\n"
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Karen
full_name: Klein, Karen
id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87
last_name: Klein
citation:
ama: Klein K. On the adaptive security of graph-based games. 2021. doi:10.15479/at:ista:10035
apa: Klein, K. (2021). On the adaptive security of graph-based games. Institute
of Science and Technology Austria. https://doi.org/10.15479/at:ista:10035
chicago: Klein, Karen. “On the Adaptive Security of Graph-Based Games.” Institute
of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10035.
ieee: K. Klein, “On the adaptive security of graph-based games,” Institute of Science
and Technology Austria, 2021.
ista: Klein K. 2021. On the adaptive security of graph-based games. Institute of
Science and Technology Austria.
mla: Klein, Karen. On the Adaptive Security of Graph-Based Games. Institute
of Science and Technology Austria, 2021, doi:10.15479/at:ista:10035.
short: K. Klein, On the Adaptive Security of Graph-Based Games, Institute of Science
and Technology Austria, 2021.
date_created: 2021-09-23T07:31:44Z
date_published: 2021-09-23T00:00:00Z
date_updated: 2023-10-17T09:24:07Z
day: '23'
ddc:
- '519'
degree_awarded: PhD
department:
- _id: GradSch
- _id: KrPi
doi: 10.15479/at:ista:10035
ec_funded: 1
file:
- access_level: open_access
checksum: 73a44345c683e81f3e765efbf86fdcc5
content_type: application/pdf
creator: cchlebak
date_created: 2021-10-04T12:22:33Z
date_updated: 2021-10-04T12:22:33Z
file_id: '10082'
file_name: thesis_pdfa.pdf
file_size: 2104726
relation: main_file
success: 1
- access_level: closed
checksum: 7b80df30a0e686c3ef6a56d4e1c59e29
content_type: application/x-zip-compressed
creator: cchlebak
date_created: 2021-10-05T07:04:37Z
date_updated: 2022-03-10T12:15:18Z
file_id: '10085'
file_name: thesis_final (1).zip
file_size: 9538359
relation: source_file
file_date_updated: 2022-03-10T12:15:18Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '276'
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '10044'
relation: part_of_dissertation
status: public
- id: '10049'
relation: part_of_dissertation
status: public
- id: '637'
relation: part_of_dissertation
status: public
- id: '10041'
relation: part_of_dissertation
status: public
- id: '6430'
relation: part_of_dissertation
status: public
- id: '10048'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
title: On the adaptive security of graph-based games
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2021'
...
---
_id: '10045'
abstract:
- lang: eng
text: "Given a fixed finite metric space (V,μ), the {\\em minimum 0-extension problem},
denoted as 0-Ext[μ], is equivalent to the following optimization problem: minimize
function of the form minx∈Vn∑ifi(xi)+∑ijcijμ(xi,xj) where cij,cvi are given nonnegative
costs and fi:V→R are functions given by fi(xi)=∑v∈Vcviμ(xi,v). The computational
complexity of 0-Ext[μ] has been recently established by Karzanov and by Hirai:
if metric μ is {\\em orientable modular} then 0-Ext[μ] can be solved in polynomial
time, otherwise 0-Ext[μ] is NP-hard. To prove the tractability part, Hirai developed
a theory of discrete convex functions on orientable modular graphs generalizing
several known classes of functions in discrete convex analysis, such as L♮-convex
functions. We consider a more general version of the problem in which unary functions
fi(xi) can additionally have terms of the form cuv;iμ(xi,{u,v}) for {u,v}∈F, where
set F⊆(V2) is fixed. We extend the complexity classification above by providing
an explicit condition on (μ,F) for the problem to be tractable. In order to prove
the tractability part, we generalize Hirai's theory and define a larger class
of discrete convex functions. It covers, in particular, another well-known class
of functions, namely submodular functions on an integer lattice. Finally, we improve
the complexity of Hirai's algorithm for solving 0-Ext on orientable modular graphs.\r\n"
article_number: '2109.10203'
article_processing_charge: No
arxiv: 1
author:
- first_name: Martin
full_name: Dvorak, Martin
id: 40ED02A8-C8B4-11E9-A9C0-453BE6697425
last_name: Dvorak
orcid: 0000-0001-5293-214X
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: Dvorak M, Kolmogorov V. Generalized minimum 0-extension problem and discrete
convexity. arXiv. doi:10.48550/arXiv.2109.10203
apa: Dvorak, M., & Kolmogorov, V. (n.d.). Generalized minimum 0-extension problem
and discrete convexity. arXiv. https://doi.org/10.48550/arXiv.2109.10203
chicago: Dvorak, Martin, and Vladimir Kolmogorov. “Generalized Minimum 0-Extension
Problem and Discrete Convexity.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2109.10203.
ieee: M. Dvorak and V. Kolmogorov, “Generalized minimum 0-extension problem and
discrete convexity,” arXiv. .
ista: Dvorak M, Kolmogorov V. Generalized minimum 0-extension problem and discrete
convexity. arXiv, 2109.10203.
mla: Dvorak, Martin, and Vladimir Kolmogorov. “Generalized Minimum 0-Extension Problem
and Discrete Convexity.” ArXiv, 2109.10203, doi:10.48550/arXiv.2109.10203.
short: M. Dvorak, V. Kolmogorov, ArXiv (n.d.).
date_created: 2021-09-27T10:48:23Z
date_published: 2021-09-21T00:00:00Z
date_updated: 2023-05-03T10:40:16Z
day: '21'
ddc:
- '004'
department:
- _id: GradSch
- _id: VlKo
doi: 10.48550/arXiv.2109.10203
external_id:
arxiv:
- '2109.10203'
file:
- access_level: open_access
checksum: e7e83065f7bc18b9c188bf93b5ca5db6
content_type: application/pdf
creator: mdvorak
date_created: 2021-09-27T10:54:51Z
date_updated: 2021-09-27T10:54:51Z
file_id: '10046'
file_name: Generalized-0-Ext.pdf
file_size: 603672
relation: main_file
success: 1
file_date_updated: 2021-09-27T10:54:51Z
has_accepted_license: '1'
keyword:
- minimum 0-extension problem
- metric labeling problem
- discrete metric spaces
- metric extensions
- computational complexity
- valued constraint satisfaction problems
- discrete convex analysis
- L-convex functions
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.2109.10203'
month: '09'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
status: public
title: Generalized minimum 0-extension problem and discrete convexity
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10058'
abstract:
- lang: eng
text: 'Quantum information and computation has become a vast field paved with opportunities
for researchers and investors. As large multinational companies and international
funds are heavily investing in quantum technologies it is still a question which
platform is best suited for the task of realizing a scalable quantum processor.
In this work we investigate hole spins in Ge quantum wells. These hold great promise
as they possess several favorable properties: a small effective mass, a strong
spin-orbit coupling, long relaxation time and an inherent immunity to hyperfine
noise. All these characteristics helped Ge hole spin qubits to evolve from a single
qubit to a fully entangled four qubit processor in only 3 years. Here, we investigated
a qubit approach leveraging the large out-of-plane g-factors of heavy hole states
in Ge quantum dots. We found this qubit to be reproducibly operable at extremely
low magnetic field and at large speeds while maintaining coherence. This was possible
because large differences of g-factors in adjacent dots can be achieved in the
out-of-plane direction. In the in-plane direction the small g-factors, on the
other hand, can be altered very effectively by the confinement potentials. Here,
we found that this can even lead to a sign change of the g-factors. The resulting
g-factor difference alters the dynamics of the system drastically and produces
effects typically attributed to a spin-orbit induced spin-flip term. The investigations
carried out in this thesis give further insights into the possibilities of holes
in Ge and reveal new physical properties that need to be considered when designing
future spin qubit experiments.'
acknowledged_ssus:
- _id: M-Shop
- _id: NanoFab
acknowledgement: The author gratefully acknowledges support by the Austrian Science
Fund (FWF), grants No P30207, and the Nomis foundation.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Daniel
full_name: Jirovec, Daniel
id: 4C473F58-F248-11E8-B48F-1D18A9856A87
last_name: Jirovec
orcid: 0000-0002-7197-4801
citation:
ama: Jirovec D. Singlet-Triplet qubits and spin-orbit interaction in 2-dimensional
Ge hole gases. 2021. doi:10.15479/at:ista:10058
apa: Jirovec, D. (2021). Singlet-Triplet qubits and spin-orbit interaction in
2-dimensional Ge hole gases. Institute of Science and Technology Austria.
https://doi.org/10.15479/at:ista:10058
chicago: Jirovec, Daniel. “Singlet-Triplet Qubits and Spin-Orbit Interaction in
2-Dimensional Ge Hole Gases.” Institute of Science and Technology Austria, 2021.
https://doi.org/10.15479/at:ista:10058.
ieee: D. Jirovec, “Singlet-Triplet qubits and spin-orbit interaction in 2-dimensional
Ge hole gases,” Institute of Science and Technology Austria, 2021.
ista: Jirovec D. 2021. Singlet-Triplet qubits and spin-orbit interaction in 2-dimensional
Ge hole gases. Institute of Science and Technology Austria.
mla: Jirovec, Daniel. Singlet-Triplet Qubits and Spin-Orbit Interaction in 2-Dimensional
Ge Hole Gases. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10058.
short: D. Jirovec, Singlet-Triplet Qubits and Spin-Orbit Interaction in 2-Dimensional
Ge Hole Gases, Institute of Science and Technology Austria, 2021.
date_created: 2021-09-30T07:53:49Z
date_published: 2021-10-05T00:00:00Z
date_updated: 2023-09-08T11:41:08Z
day: '05'
ddc:
- '621'
- '539'
degree_awarded: PhD
department:
- _id: GradSch
- _id: GeKa
doi: 10.15479/at:ista:10058
file:
- access_level: closed
checksum: ad6bcb24083ed7c02baaf1885c9ea3d5
content_type: application/x-zip-compressed
creator: djirovec
date_created: 2021-09-30T14:29:14Z
date_updated: 2022-12-20T23:30:07Z
embargo_to: open_access
file_id: '10061'
file_name: PHD_Thesis_Jirovec_Source.zip
file_size: 32397600
relation: source_file
- access_level: open_access
checksum: 5fbe08d4f66d1153e04c47971538fae8
content_type: application/pdf
creator: djirovec
date_created: 2021-10-05T07:56:49Z
date_updated: 2022-12-20T23:30:07Z
embargo: 2022-10-06
file_id: '10087'
file_name: PHD_Thesis_pdfa2b_1.pdf
file_size: 26910829
relation: main_file
file_date_updated: 2022-12-20T23:30:07Z
has_accepted_license: '1'
keyword:
- qubits
- quantum computing
- holes
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: '151'
project:
- _id: 2641CE5E-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P30207
name: Hole spin orbit qubits in Ge quantum wells
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '8831'
relation: part_of_dissertation
status: public
- id: '10065'
relation: part_of_dissertation
status: public
- id: '10066'
relation: part_of_dissertation
status: public
- id: '8909'
relation: part_of_dissertation
status: public
- id: '5816'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
title: Singlet-Triplet qubits and spin-orbit interaction in 2-dimensional Ge hole
gases
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2021'
...
---
_id: '10077'
abstract:
- lang: eng
text: Although much is known about how single neurons in the hippocampus represent
an animal’s position, how cell-cell interactions contribute to spatial coding
remains poorly understood. Using a novel statistical estimator and theoretical
modeling, both developed in the framework of maximum entropy models, we reveal
highly structured cell-to-cell interactions whose statistics depend on familiar
vs. novel environment. In both conditions the circuit interactions optimize the
encoding of spatial information, but for regimes that differ in the signal-to-noise
ratio of their spatial inputs. Moreover, the topology of the interactions facilitates
linear decodability, making the information easy to read out by downstream circuits.
These findings suggest that the efficient coding hypothesis is not applicable
only to individual neuron properties in the sensory periphery, but also to neural
interactions in the central brain.
acknowledgement: We thank Peter Baracskay, Karola Kaefer and Hugo Malagon-Vina for
the acquisition of the data. We thank Federico Stella for comments on an earlier
version of the manuscript. MN was supported by European Union Horizon 2020 grant
665385, JC was supported by European Research Council consolidator grant 281511,
GT was supported by the Austrian Science Fund (FWF) grant P34015, CS was supported
by an IST fellow grant, National Institute of Mental Health Award 1R01MH125571-01,
by the National Science Foundation under NSF Award No. 1922658 and a Google faculty
award.
article_processing_charge: No
author:
- first_name: Michele
full_name: Nardin, Michele
id: 30BD0376-F248-11E8-B48F-1D18A9856A87
last_name: Nardin
orcid: 0000-0001-8849-6570
- first_name: Jozsef L
full_name: Csicsvari, Jozsef L
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
- first_name: Gašper
full_name: Tkačik, Gašper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkačik
orcid: 0000-0002-6699-1455
- first_name: Cristina
full_name: Savin, Cristina
id: 3933349E-F248-11E8-B48F-1D18A9856A87
last_name: Savin
citation:
ama: Nardin M, Csicsvari JL, Tkačik G, Savin C. The structure of hippocampal CA1
interactions optimizes spatial coding across experience. bioRxiv. doi:10.1101/2021.09.28.460602
apa: Nardin, M., Csicsvari, J. L., Tkačik, G., & Savin, C. (n.d.). The structure
of hippocampal CA1 interactions optimizes spatial coding across experience. bioRxiv.
Cold Spring Harbor Laboratory. https://doi.org/10.1101/2021.09.28.460602
chicago: Nardin, Michele, Jozsef L Csicsvari, Gašper Tkačik, and Cristina Savin.
“The Structure of Hippocampal CA1 Interactions Optimizes Spatial Coding across
Experience.” BioRxiv. Cold Spring Harbor Laboratory, n.d. https://doi.org/10.1101/2021.09.28.460602.
ieee: M. Nardin, J. L. Csicsvari, G. Tkačik, and C. Savin, “The structure of hippocampal
CA1 interactions optimizes spatial coding across experience,” bioRxiv.
Cold Spring Harbor Laboratory.
ista: Nardin M, Csicsvari JL, Tkačik G, Savin C. The structure of hippocampal CA1
interactions optimizes spatial coding across experience. bioRxiv, 10.1101/2021.09.28.460602.
mla: Nardin, Michele, et al. “The Structure of Hippocampal CA1 Interactions Optimizes
Spatial Coding across Experience.” BioRxiv, Cold Spring Harbor Laboratory,
doi:10.1101/2021.09.28.460602.
short: M. Nardin, J.L. Csicsvari, G. Tkačik, C. Savin, BioRxiv (n.d.).
date_created: 2021-10-04T06:23:34Z
date_published: 2021-09-29T00:00:00Z
date_updated: 2024-03-25T23:30:09Z
day: '29'
department:
- _id: GradSch
- _id: JoCs
- _id: GaTk
doi: 10.1101/2021.09.28.460602
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.biorxiv.org/content/10.1101/2021.09.28.460602
month: '09'
oa: 1
oa_version: Preprint
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 257A4776-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '281511'
name: Memory-related information processing in neuronal circuits of the hippocampus
and entorhinal cortex
- _id: 626c45b5-2b32-11ec-9570-e509828c1ba6
grant_number: P34015
name: Efficient coding with biophysical realism
publication: bioRxiv
publication_status: submitted
publisher: Cold Spring Harbor Laboratory
related_material:
record:
- id: '11932'
relation: dissertation_contains
status: public
status: public
title: The structure of hippocampal CA1 interactions optimizes spatial coding across
experience
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: preprint
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2021'
...
---
_id: '10080'
abstract:
- lang: eng
text: Hippocampal and neocortical neural activity is modulated by the position of
the individual in space. While hippocampal neurons provide the basis for a spatial
map, prefrontal cortical neurons generalize over environmental features. Whether
these generalized representations result from a bidirectional interaction with,
or are mainly derived from hippocampal spatial representations is not known. By
examining simultaneously recorded hippocampal and medial prefrontal neurons, we
observed that prefrontal spatial representations show a delayed coherence with
hippocampal ones. We also identified subpopulations of cells in the hippocampus
and medial prefrontal cortex that formed functional cross-area couplings; these
resembled the optimal connections predicted by a probabilistic model of spatial
information transfer and generalization. Moreover, cross-area couplings were strongest
and had the shortest delay preceding spatial decision-making. Our results suggest
that generalized spatial coding in the medial prefrontal cortex is inherited from
spatial representations in the hippocampus, and that the routing of information
can change dynamically with behavioral demands.
acknowledgement: We thank Federico Stella for invaluable suggestions and discussions.
We thank Yosman BapatDhar and Andrea Cumpelik for comments, help and suggestions
on the exposure of the text. We thank Predrag Živadinović and Juliana Couras for
comments on the text and the figures. This work was supported by the EU-FP7 MC-ITN
IN-SENS (grant 607616).
article_processing_charge: No
author:
- first_name: Michele
full_name: Nardin, Michele
id: 30BD0376-F248-11E8-B48F-1D18A9856A87
last_name: Nardin
orcid: 0000-0001-8849-6570
- first_name: Karola
full_name: Käfer, Karola
id: 2DAA49AA-F248-11E8-B48F-1D18A9856A87
last_name: Käfer
- first_name: Jozsef L
full_name: Csicsvari, Jozsef L
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
citation:
ama: Nardin M, Käfer K, Csicsvari JL. The generalized spatial representation in
the prefrontal cortex is inherited from the hippocampus. bioRxiv. doi:10.1101/2021.09.30.462269
apa: Nardin, M., Käfer, K., & Csicsvari, J. L. (n.d.). The generalized spatial
representation in the prefrontal cortex is inherited from the hippocampus. bioRxiv.
Cold Spring Harbor Laboratory. https://doi.org/10.1101/2021.09.30.462269
chicago: Nardin, Michele, Karola Käfer, and Jozsef L Csicsvari. “The Generalized
Spatial Representation in the Prefrontal Cortex Is Inherited from the Hippocampus.”
BioRxiv. Cold Spring Harbor Laboratory, n.d. https://doi.org/10.1101/2021.09.30.462269.
ieee: M. Nardin, K. Käfer, and J. L. Csicsvari, “The generalized spatial representation
in the prefrontal cortex is inherited from the hippocampus,” bioRxiv. Cold
Spring Harbor Laboratory.
ista: Nardin M, Käfer K, Csicsvari JL. The generalized spatial representation in
the prefrontal cortex is inherited from the hippocampus. bioRxiv, 10.1101/2021.09.30.462269.
mla: Nardin, Michele, et al. “The Generalized Spatial Representation in the Prefrontal
Cortex Is Inherited from the Hippocampus.” BioRxiv, Cold Spring Harbor
Laboratory, doi:10.1101/2021.09.30.462269.
short: M. Nardin, K. Käfer, J.L. Csicsvari, BioRxiv (n.d.).
date_created: 2021-10-04T06:28:32Z
date_published: 2021-10-02T00:00:00Z
date_updated: 2021-10-05T12:34:26Z
day: '02'
department:
- _id: GradSch
- _id: JoCs
doi: 10.1101/2021.09.30.462269
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.biorxiv.org/content/10.1101/2021.09.30.462269
month: '10'
oa: 1
oa_version: Preprint
project:
- _id: 257BBB4C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '607616'
name: Inter-and intracellular signalling in schizophrenia
publication: bioRxiv
publication_status: submitted
publisher: Cold Spring Harbor Laboratory
status: public
title: The generalized spatial representation in the prefrontal cortex is inherited
from the hippocampus
type: preprint
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2021'
...
---
_id: '10083'
abstract:
- lang: eng
text: "Plant motions occur across a wide spectrum of timescales, ranging from seed
dispersal through bursting (milliseconds) and stomatal opening (minutes) to long-term
adaptation of gross architecture. Relatively fast motions include water-driven
growth as exemplified by root cell expansion under abiotic/biotic stresses or
during gravitropism. A showcase is a root growth inhibition in 30 seconds triggered
by the phytohormone auxin. However, the cellular and molecular mechanisms are
still largely unknown. This thesis covers the studies about this topic as follows.
By taking advantage of microfluidics combined with live imaging, pharmaceutical
tools, and transgenic lines, we examined the kinetics of and causal relationship
among various auxininduced rapid cellular changes in root growth, apoplastic pH,
cytosolic Ca2+, cortical microtubule (CMT) orientation, and vacuolar morphology.
We revealed that CMT reorientation and vacuolar constriction are the consequence
of growth itself instead of responding directly to auxin. In contrast, auxin induces
apoplast alkalinization to rapidly inhibit root growth in 30 seconds. This auxin-triggered
apoplast alkalinization results from rapid H+- influx that is contributed by Ca2+
inward channel CYCLIC NUCLEOTIDE-GATED CHANNEL 14 (CNGC14)-dependent Ca2+ signaling.
To dissect which auxin signaling mediates the rapid apoplast alkalinization, we\r\ncombined
microfluidics and genetic engineering to verify that TIR1/AFB receptors conduct
a non-transcriptional regulation on Ca2+ and H+ -influx. This non-canonical pathway
is mostly mediated by the cytosolic portion of TIR1/AFB. On the other hand, we
uncovered, using biochemical and phospho-proteomic analysis, that auxin cell surface
signaling component TRANSMEMBRANE KINASE 1 (TMK1) plays a negative role during
auxin-trigger apoplast\r\nalkalinization and root growth inhibition through directly
activating PM H+ -ATPases. Therefore, we discovered that PM H+ -ATPases counteract
instead of mediate the auxintriggered rapid H+ -influx, and that TIR1/AFB and
TMK1 regulate root growth antagonistically. This opposite effect of TIR1/AFB and
TMK1 is consistent during auxin-induced hypocotyl elongation, leading us to explore
the relation of two signaling pathways. Assisted with biochemistry and fluorescent
imaging, we verified for the first time that TIR1/AFB and TMK1 can interact with
each other. The ability of TIR1/AFB binding to membrane lipid provides a basis
for the interaction of plasma membrane- and cytosol-localized proteins.\r\nBesides,
transgenic analysis combined with genetic engineering and biochemistry showed
that vi\r\nthey do function in the same pathway. Particularly, auxin-induced
TMK1 increase is TIR1/AFB dependent, suggesting TIR1/AFB regulation on TMK1. Conversely,
TMK1 also regulates TIR1/AFB protein levels and thus auxin canonical signaling.
To follow the study of rapid growth regulation, we analyzed another rapid growth
regulator, signaling peptide RALF1. We showed that RALF1 also triggers a rapid
and reversible growth inhibition caused by H + influx, highly resembling but not
dependent on auxin. Besides, RALF1 promotes auxin biosynthesis by increasing expression
of auxin biosynthesis enzyme YUCCAs and thus induces auxin signaling in ca. 1
hour, contributing to the sustained RALF1-triggered growth inhibition. These studies
collectively contribute to understanding rapid regulation on plant cell\r\ngrowth,
novel auxin signaling pathway as well as auxin-peptide crosstalk. "
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Lanxin
full_name: Li, Lanxin
last_name: Li
citation:
ama: Li L. Rapid cell growth regulation in Arabidopsis. 2021. doi:10.15479/at:ista:10083
apa: Li, L. (2021). Rapid cell growth regulation in Arabidopsis. Institute
of Science and Technology Austria. https://doi.org/10.15479/at:ista:10083
chicago: Li, Lanxin. “Rapid Cell Growth Regulation in Arabidopsis.” Institute of
Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10083.
ieee: L. Li, “Rapid cell growth regulation in Arabidopsis,” Institute of Science
and Technology Austria, 2021.
ista: Li L. 2021. Rapid cell growth regulation in Arabidopsis. Institute of Science
and Technology Austria.
mla: Li, Lanxin. Rapid Cell Growth Regulation in Arabidopsis. Institute of
Science and Technology Austria, 2021, doi:10.15479/at:ista:10083.
short: L. Li, Rapid Cell Growth Regulation in Arabidopsis, Institute of Science
and Technology Austria, 2021.
date_created: 2021-10-04T13:33:10Z
date_published: 2021-10-06T00:00:00Z
date_updated: 2025-05-07T11:12:33Z
day: '06'
ddc:
- '575'
degree_awarded: PhD
department:
- _id: GradSch
- _id: JiFr
doi: 10.15479/at:ista:10083
ec_funded: 1
file:
- access_level: open_access
checksum: 3b2f55b3b8ae05337a0dcc1cd8595b10
content_type: application/pdf
creator: cchlebak
date_created: 2021-10-14T08:00:07Z
date_updated: 2022-12-20T23:30:03Z
embargo: 2022-10-14
file_id: '10138'
file_name: 0._IST_Austria_Thesis_Lanxin_Li_1014_pdftron.pdf
file_size: 8616142
relation: main_file
- access_level: closed
checksum: f23ed258ca894f6aabf58b0c128bf242
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: cchlebak
date_created: 2021-10-14T08:00:13Z
date_updated: 2022-12-20T23:30:03Z
embargo_to: open_access
file_id: '10139'
file_name: 0._IST_Austria_Thesis_Lanxin_Li_1014.docx
file_size: 15058499
relation: source_file
file_date_updated: 2022-12-20T23:30:03Z
has_accepted_license: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 26B4D67E-B435-11E9-9278-68D0E5697425
grant_number: '25351'
name: 'A Case Study of Plant Growth Regulation: Molecular Mechanism of Auxin-mediated
Rapid Growth Inhibition in Arabidopsis Root'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '442'
relation: part_of_dissertation
status: public
- id: '8931'
relation: part_of_dissertation
status: public
- id: '9287'
relation: part_of_dissertation
status: public
- id: '8283'
relation: part_of_dissertation
status: public
- id: '8986'
relation: part_of_dissertation
status: public
- id: '10015'
relation: part_of_dissertation
status: public
- id: '10095'
relation: part_of_dissertation
status: public
- id: '6627'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
title: Rapid cell growth regulation in Arabidopsis
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2021'
...
---
_id: '10135'
abstract:
- lang: eng
text: "Plants maintain the capacity to develop new organs e.g. lateral roots post-embryonically
throughout their whole life and thereby flexibly adapt to ever-changing environmental
conditions. Plant hormones auxin and cytokinin are the main regulators of the
lateral root organogenesis. Additionally to their solo activities, the interaction
between auxin and\r\ncytokinin plays crucial role in fine-tuning of lateral root
development and growth. In particular, cytokinin modulates auxin distribution
within the developing lateral root by affecting the endomembrane trafficking of
auxin transporter PIN1 and promoting its vacuolar degradation (Marhavý et al.,
2011, 2014). This effect is independent of transcription and\r\ntranslation. Therefore,
it suggests novel, non-canonical cytokinin activity occuring possibly on the posttranslational
level. Impact of cytokinin and other plant hormones on auxin transporters (including
PIN1) on the posttranslational level is described in detail in the introduction
part of this thesis in a form of a review (Semeradova et al., 2020). To gain insights
into the molecular machinery underlying cytokinin effect on the endomembrane trafficking
in the plant cell, in particular on the PIN1 degradation, we conducted two large
proteomic screens: 1) Identification of cytokinin binding proteins using\r\nchemical
proteomics. 2) Monitoring of proteomic and phosphoproteomic changes upon cytokinin
treatment. In the first screen, we identified DYNAMIN RELATED PROTEIN 2A (DRP2A).
We found that DRP2A plays a role in cytokinin regulated processes during the plant
growth and that cytokinin treatment promotes destabilization of DRP2A protein.
However, the role of DRP2A in the PIN1 degradation remains to be elucidated. In
the second screen, we found VACUOLAR PROTEIN SORTING 9A (VPS9A). VPS9a plays crucial
role in plant’s response to cytokin and in cytokinin mediated PIN1 degradation.
Altogether, we identified proteins, which bind to cytokinin and proteins that
in response to\r\ncytokinin exhibit significantly changed abundance or phosphorylation
pattern. By combining information from these two screens, we can pave our way
towards understanding of noncanonical cytokinin effects."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Hana
full_name: Semerádová, Hana
id: 42FE702E-F248-11E8-B48F-1D18A9856A87
last_name: Semerádová
citation:
ama: Semerádová H. Molecular mechanisms of the cytokinin-regulated endomembrane
trafficking to coordinate plant organogenesis. 2021. doi:10.15479/at:ista:10135
apa: Semerádová, H. (2021). Molecular mechanisms of the cytokinin-regulated endomembrane
trafficking to coordinate plant organogenesis. Institute of Science and Technology
Austria. https://doi.org/10.15479/at:ista:10135
chicago: Semerádová, Hana. “Molecular Mechanisms of the Cytokinin-Regulated Endomembrane
Trafficking to Coordinate Plant Organogenesis.” Institute of Science and Technology
Austria, 2021. https://doi.org/10.15479/at:ista:10135.
ieee: H. Semerádová, “Molecular mechanisms of the cytokinin-regulated endomembrane
trafficking to coordinate plant organogenesis,” Institute of Science and Technology
Austria, 2021.
ista: Semerádová H. 2021. Molecular mechanisms of the cytokinin-regulated endomembrane
trafficking to coordinate plant organogenesis. Institute of Science and Technology
Austria.
mla: Semerádová, Hana. Molecular Mechanisms of the Cytokinin-Regulated Endomembrane
Trafficking to Coordinate Plant Organogenesis. Institute of Science and Technology
Austria, 2021, doi:10.15479/at:ista:10135.
short: H. Semerádová, Molecular Mechanisms of the Cytokinin-Regulated Endomembrane
Trafficking to Coordinate Plant Organogenesis, Institute of Science and Technology
Austria, 2021.
date_created: 2021-10-13T13:42:48Z
date_published: 2021-10-13T00:00:00Z
date_updated: 2024-01-25T10:53:29Z
day: '13'
ddc:
- '570'
degree_awarded: PhD
department:
- _id: GradSch
- _id: EvBe
doi: 10.15479/at:ista:10135
file:
- access_level: closed
checksum: ce7108853e6cec6224f17cd6429b51fe
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: cziletti
date_created: 2021-10-27T07:45:37Z
date_updated: 2022-12-20T23:30:05Z
embargo_to: open_access
file_id: '10186'
file_name: Hana_Semeradova_Disertation_Thesis_II_Revised_3.docx
file_size: 28508629
relation: source_file
- access_level: open_access
checksum: 0d7afb846e8e31ec794de47bf44e12ef
content_type: application/pdf
creator: cziletti
date_created: 2021-10-27T07:45:57Z
date_updated: 2022-12-20T23:30:05Z
embargo: 2022-10-28
file_id: '10187'
file_name: Hana_Semeradova_Disertation_Thesis_II_Revised_3PDFA.pdf
file_size: 10623525
relation: main_file
file_date_updated: 2022-12-20T23:30:05Z
has_accepted_license: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 261821BC-B435-11E9-9278-68D0E5697425
grant_number: '24746'
name: Molecular mechanisms of the cytokinin regulated endomembrane trafficking to
coordinate plant organogenesis.
publication_identifier:
isbn:
- 978-3-99078-014-5
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '9160'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Eva
full_name: Benková, Eva
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
title: Molecular mechanisms of the cytokinin-regulated endomembrane trafficking to
coordinate plant organogenesis
type: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2021'
...
---
_id: '10191'
abstract:
- lang: eng
text: "In this work we solve the algorithmic problem of consistency verification
for the TSO and PSO memory models given a reads-from map, denoted VTSO-rf and
VPSO-rf, respectively. For an execution of n events over k threads and d variables,
we establish novel bounds that scale as nk+1 for TSO and as nk+1· min(nk2, 2k·
d) for PSO. Moreover, based on our solution to these problems, we develop an SMC
algorithm under TSO and PSO that uses the RF equivalence. The algorithm is exploration-optimal,
in the sense that it is guaranteed to explore each class of the RF partitioning
exactly once, and spends polynomial time per class when k is bounded. Finally,
we implement all our algorithms in the SMC tool Nidhugg, and perform a large number
of experiments over benchmarks from existing literature. Our experimental results
show that our algorithms for VTSO-rf and VPSO-rf provide significant scalability
improvements over standard alternatives. Moreover, when used for SMC, the RF partitioning
is often much coarser than the standard Shasha-Snir partitioning for TSO/PSO,
which yields a significant speedup in the model checking task.\r\n\r\n"
acknowledgement: "The research was partially funded by the ERC CoG 863818 (ForM-SMArt)
and the Vienna Science\r\nand Technology Fund (WWTF) through project ICT15-003."
article_number: '164'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Truc Lam
full_name: Bui, Truc Lam
last_name: Bui
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Tushar
full_name: Gautam, Tushar
last_name: Gautam
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Viktor
full_name: Toman, Viktor
id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87
last_name: Toman
orcid: 0000-0001-9036-063X
citation:
ama: Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. The reads-from equivalence
for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages.
2021;5(OOPSLA). doi:10.1145/3485541
apa: Bui, T. L., Chatterjee, K., Gautam, T., Pavlogiannis, A., & Toman, V. (2021).
The reads-from equivalence for the TSO and PSO memory models. Proceedings of
the ACM on Programming Languages. Association for Computing Machinery. https://doi.org/10.1145/3485541
chicago: Bui, Truc Lam, Krishnendu Chatterjee, Tushar Gautam, Andreas Pavlogiannis,
and Viktor Toman. “The Reads-from Equivalence for the TSO and PSO Memory Models.”
Proceedings of the ACM on Programming Languages. Association for Computing
Machinery, 2021. https://doi.org/10.1145/3485541.
ieee: T. L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, and V. Toman, “The reads-from
equivalence for the TSO and PSO memory models,” Proceedings of the ACM on Programming
Languages, vol. 5, no. OOPSLA. Association for Computing Machinery, 2021.
ista: Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. 2021. The reads-from
equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming
Languages. 5(OOPSLA), 164.
mla: Bui, Truc Lam, et al. “The Reads-from Equivalence for the TSO and PSO Memory
Models.” Proceedings of the ACM on Programming Languages, vol. 5, no. OOPSLA,
164, Association for Computing Machinery, 2021, doi:10.1145/3485541.
short: T.L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, V. Toman, Proceedings
of the ACM on Programming Languages 5 (2021).
date_created: 2021-10-27T15:05:34Z
date_published: 2021-10-15T00:00:00Z
date_updated: 2025-07-14T09:10:16Z
day: '15'
ddc:
- '000'
department:
- _id: GradSch
- _id: KrCh
doi: 10.1145/3485541
ec_funded: 1
external_id:
arxiv:
- '2011.11763'
file:
- access_level: open_access
checksum: 9d6dce7b611853c529bb7b1915ac579e
content_type: application/pdf
creator: cchlebak
date_created: 2021-11-04T07:24:48Z
date_updated: 2021-11-04T07:24:48Z
file_id: '10215'
file_name: 2021_ProcACMPL_Bui.pdf
file_size: 2903485
relation: main_file
success: 1
file_date_updated: 2021-11-04T07:24:48Z
has_accepted_license: '1'
intvolume: ' 5'
issue: OOPSLA
keyword:
- safety
- risk
- reliability and quality
- software
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication: Proceedings of the ACM on Programming Languages
publication_identifier:
eissn:
- 2475-1421
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '10199'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: The reads-from equivalence for the TSO and PSO memory models
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 5
year: '2021'
...
---
_id: '10199'
abstract:
- lang: eng
text: The design and verification of concurrent systems remains an open challenge
due to the non-determinism that arises from the inter-process communication. In
particular, concurrent programs are notoriously difficult both to be written correctly
and to be analyzed formally, as complex thread interaction has to be accounted
for. The difficulties are further exacerbated when concurrent programs get executed
on modern-day hardware, which contains various buffering and caching mechanisms
for efficiency reasons. This causes further subtle non-determinism, which can
often produce very unintuitive behavior of the concurrent programs. Model checking
is at the forefront of tackling the verification problem, where the task is to
decide, given as input a concurrent system and a desired property, whether the
system satisfies the property. The inherent state-space explosion problem in model
checking of concurrent systems causes naïve explicit methods not to scale, thus
more inventive methods are required. One such method is stateless model checking
(SMC), which explores in memory-efficient manner the program executions rather
than the states of the program. State-of-the-art SMC is typically coupled with
partial order reduction (POR) techniques, which argue that certain executions
provably produce identical system behavior, thus limiting the amount of executions
one needs to explore in order to cover all possible behaviors. Another method
to tackle the state-space explosion is symbolic model checking, where the considered
techniques operate on a succinct implicit representation of the input system rather
than explicitly accessing the system. In this thesis we present new techniques
for verification of concurrent systems. We present several novel POR methods for
SMC of concurrent programs under various models of semantics, some of which account
for write-buffering mechanisms. Additionally, we present novel algorithms for
symbolic model checking of finite-state concurrent systems, where the desired
property of the systems is to ensure a formally defined notion of fairness.
acknowledged_ssus:
- _id: SSU
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Viktor
full_name: Toman, Viktor
id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87
last_name: Toman
orcid: 0000-0001-9036-063X
citation:
ama: Toman V. Improved verification techniques for concurrent systems. 2021. doi:10.15479/at:ista:10199
apa: Toman, V. (2021). Improved verification techniques for concurrent systems.
Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10199
chicago: Toman, Viktor. “Improved Verification Techniques for Concurrent Systems.”
Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10199.
ieee: V. Toman, “Improved verification techniques for concurrent systems,” Institute
of Science and Technology Austria, 2021.
ista: Toman V. 2021. Improved verification techniques for concurrent systems. Institute
of Science and Technology Austria.
mla: Toman, Viktor. Improved Verification Techniques for Concurrent Systems.
Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10199.
short: V. Toman, Improved Verification Techniques for Concurrent Systems, Institute
of Science and Technology Austria, 2021.
date_created: 2021-10-29T20:09:01Z
date_published: 2021-10-31T00:00:00Z
date_updated: 2025-07-14T09:10:16Z
day: '31'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: GradSch
- _id: KrCh
doi: 10.15479/at:ista:10199
ec_funded: 1
file:
- access_level: open_access
checksum: 4f412a1ee60952221b499a4b1268df35
content_type: application/pdf
creator: vtoman
date_created: 2021-11-08T14:12:22Z
date_updated: 2021-11-08T14:12:22Z
file_id: '10225'
file_name: toman_th_final.pdf
file_size: 2915234
relation: main_file
- access_level: closed
checksum: 9584943f99127be2dd2963f6784c37d4
content_type: application/zip
creator: vtoman
date_created: 2021-11-08T14:12:46Z
date_updated: 2021-11-09T09:00:50Z
file_id: '10226'
file_name: toman_thesis.zip
file_size: 8616056
relation: source_file
file_date_updated: 2021-11-09T09:00:50Z
has_accepted_license: '1'
keyword:
- concurrency
- verification
- model checking
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: '166'
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '10190'
relation: part_of_dissertation
status: public
- id: '9987'
relation: part_of_dissertation
status: public
- id: '141'
relation: part_of_dissertation
status: public
- id: '10191'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
title: Improved verification techniques for concurrent systems
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2021'
...
---
_id: '10293'
abstract:
- lang: eng
text: "Indirect reciprocity in evolutionary game theory is a prominent mechanism
for explaining the evolution of cooperation among unrelated individuals. In contrast
to direct reciprocity, which is based on individuals meeting repeatedly, and conditionally
cooperating by using their own experiences, indirect reciprocity is based on individuals’
reputations. If a player helps another, this increases the helper’s public standing,
benefitting them in the future. This lets cooperation in the population emerge
without individuals having to meet more than once. While the two modes of reciprocity
are intertwined, they are difficult to compare. Thus, they are usually studied
in isolation. Direct reciprocity can maintain cooperation with simple strategies,
and is robust against noise even when players do not remember more\r\nthan their
partner’s last action. Meanwhile, indirect reciprocity requires its successful
strategies, or social norms, to be more complex. Exhaustive search previously
identified eight such norms, called the “leading eight”, which excel at maintaining
cooperation. However, as the first result of this thesis, we show that the leading
eight break down once we remove the fundamental assumption that information is
synchronized and public, such that everyone agrees on reputations. Once we consider
a more realistic scenario of imperfect information, where reputations are private,
and individuals occasionally misinterpret or miss observations, the leading eight
do not promote cooperation anymore. Instead, minor initial disagreements can proliferate,
fragmenting populations into subgroups. In a next step, we consider ways to mitigate
this issue. We first explore whether introducing “generosity” can stabilize cooperation
when players use the leading eight strategies in noisy environments. This approach
of modifying strategies to include probabilistic elements for coping with errors
is known to work well in direct reciprocity. However, as we show here, it fails
for the more complex norms of indirect reciprocity. Imperfect information still
prevents cooperation from evolving. On the other hand, we succeeded to show in
this thesis that modifying the leading eight to use “quantitative assessment”,
i.e. tracking reputation scores on a scale beyond good and bad, and making overall
judgments of others based on a threshold, is highly successful, even when noise
increases in the environment. Cooperation can flourish when reputations\r\nare
more nuanced, and players have a broader understanding what it means to be “good.”
Finally, we present a single theoretical framework that unites the two modes of
reciprocity despite their differences. Within this framework, we identify a novel
simple and successful strategy for indirect reciprocity, which can cope with noisy
environments and has an analogue in direct reciprocity. We can also analyze decision
making when different sources of information are available. Our results help highlight
that for sustaining cooperation, already the most simple rules of reciprocity
can be sufficient."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Laura
full_name: Schmid, Laura
id: 38B437DE-F248-11E8-B48F-1D18A9856A87
last_name: Schmid
orcid: 0000-0002-6978-7329
citation:
ama: Schmid L. Evolution of cooperation via (in)direct reciprocity under imperfect
information. 2021. doi:10.15479/at:ista:10293
apa: Schmid, L. (2021). Evolution of cooperation via (in)direct reciprocity under
imperfect information. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10293
chicago: Schmid, Laura. “Evolution of Cooperation via (in)Direct Reciprocity under
Imperfect Information.” Institute of Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10293.
ieee: L. Schmid, “Evolution of cooperation via (in)direct reciprocity under imperfect
information,” Institute of Science and Technology Austria, 2021.
ista: Schmid L. 2021. Evolution of cooperation via (in)direct reciprocity under
imperfect information. Institute of Science and Technology Austria.
mla: Schmid, Laura. Evolution of Cooperation via (in)Direct Reciprocity under
Imperfect Information. Institute of Science and Technology Austria, 2021,
doi:10.15479/at:ista:10293.
short: L. Schmid, Evolution of Cooperation via (in)Direct Reciprocity under Imperfect
Information, Institute of Science and Technology Austria, 2021.
date_created: 2021-11-15T17:12:57Z
date_published: 2021-11-17T00:00:00Z
date_updated: 2025-07-14T09:10:09Z
day: '17'
ddc:
- '519'
- '576'
degree_awarded: PhD
department:
- _id: GradSch
- _id: KrCh
doi: 10.15479/at:ista:10293
ec_funded: 1
file:
- access_level: closed
checksum: 86a05b430756ca12ae8107b6e6f3c1e5
content_type: application/zip
creator: lschmid
date_created: 2021-11-18T12:41:46Z
date_updated: 2022-12-20T23:30:08Z
embargo_to: open_access
file_id: '10305'
file_name: submission_new.zip
file_size: 29703124
relation: source_file
- access_level: open_access
checksum: d940af042e94660c6b6a7b4f0b184d47
content_type: application/pdf
creator: lschmid
date_created: 2021-11-18T12:59:15Z
date_updated: 2022-12-20T23:30:08Z
embargo: 2022-10-18
file_id: '10306'
file_name: thesis_new_upload.pdf
file_size: 8320985
relation: main_file
file_date_updated: 2022-12-20T23:30:08Z
has_accepted_license: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: '171'
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '9997'
relation: part_of_dissertation
status: public
- id: '2'
relation: part_of_dissertation
status: public
- id: '9402'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
title: Evolution of cooperation via (in)direct reciprocity under imperfect information
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2021'
...