---
_id: '6419'
abstract:
- lang: eng
text: Characterizing the fitness landscape, a representation of fitness for a large
set of genotypes, is key to understanding how genetic information is interpreted
to create functional organisms. Here we determined the evolutionarily-relevant
segment of the fitness landscape of His3, a gene coding for an enzyme in the histidine
synthesis pathway, focusing on combinations of amino acid states found at orthologous
sites of extant species. Just 15% of amino acids found in yeast His3 orthologues
were always neutral while the impact on fitness of the remaining 85% depended
on the genetic background. Furthermore, at 67% of sites, amino acid replacements
were under sign epistasis, having both strongly positive and negative effect in
different genetic backgrounds. 46% of sites were under reciprocal sign epistasis.
The fitness impact of amino acid replacements was influenced by only a few genetic
backgrounds but involved interaction of multiple sites, shaping a rugged fitness
landscape in which many of the shortest paths between highly fit genotypes are
inaccessible.
article_number: e1008079
article_processing_charge: No
author:
- first_name: Victoria
full_name: Pokusaeva, Victoria
id: 3184041C-F248-11E8-B48F-1D18A9856A87
last_name: Pokusaeva
orcid: 0000-0001-7660-444X
- first_name: Dinara R.
full_name: Usmanova, Dinara R.
last_name: Usmanova
- first_name: Ekaterina V.
full_name: Putintseva, Ekaterina V.
last_name: Putintseva
- first_name: Lorena
full_name: Espinar, Lorena
last_name: Espinar
- first_name: Karen
full_name: Sarkisyan, Karen
id: 39A7BF80-F248-11E8-B48F-1D18A9856A87
last_name: Sarkisyan
orcid: 0000-0002-5375-6341
- first_name: Alexander S.
full_name: Mishin, Alexander S.
last_name: Mishin
- first_name: Natalya S.
full_name: Bogatyreva, Natalya S.
last_name: Bogatyreva
- first_name: Dmitry
full_name: Ivankov, Dmitry
id: 49FF1036-F248-11E8-B48F-1D18A9856A87
last_name: Ivankov
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Sergey
full_name: Avvakumov, Sergey
id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
last_name: Avvakumov
- first_name: Inna S.
full_name: Povolotskaya, Inna S.
last_name: Povolotskaya
- first_name: Guillaume J.
full_name: Filion, Guillaume J.
last_name: Filion
- first_name: Lucas B.
full_name: Carey, Lucas B.
last_name: Carey
- first_name: Fyodor
full_name: Kondrashov, Fyodor
id: 44FDEF62-F248-11E8-B48F-1D18A9856A87
last_name: Kondrashov
orcid: 0000-0001-8243-4694
citation:
ama: Pokusaeva V, Usmanova DR, Putintseva EV, et al. An experimental assay of the
interactions of amino acids from orthologous sequences shaping a complex fitness
landscape. PLoS Genetics. 2019;15(4). doi:10.1371/journal.pgen.1008079
apa: Pokusaeva, V., Usmanova, D. R., Putintseva, E. V., Espinar, L., Sarkisyan,
K., Mishin, A. S., … Kondrashov, F. (2019). An experimental assay of the interactions
of amino acids from orthologous sequences shaping a complex fitness landscape.
PLoS Genetics. Public Library of Science. https://doi.org/10.1371/journal.pgen.1008079
chicago: Pokusaeva, Victoria, Dinara R. Usmanova, Ekaterina V. Putintseva, Lorena
Espinar, Karen Sarkisyan, Alexander S. Mishin, Natalya S. Bogatyreva, et al. “An
Experimental Assay of the Interactions of Amino Acids from Orthologous Sequences
Shaping a Complex Fitness Landscape.” PLoS Genetics. Public Library of
Science, 2019. https://doi.org/10.1371/journal.pgen.1008079.
ieee: V. Pokusaeva et al., “An experimental assay of the interactions of
amino acids from orthologous sequences shaping a complex fitness landscape,” PLoS
Genetics, vol. 15, no. 4. Public Library of Science, 2019.
ista: Pokusaeva V, Usmanova DR, Putintseva EV, Espinar L, Sarkisyan K, Mishin AS,
Bogatyreva NS, Ivankov D, Akopyan A, Avvakumov S, Povolotskaya IS, Filion GJ,
Carey LB, Kondrashov F. 2019. An experimental assay of the interactions of amino
acids from orthologous sequences shaping a complex fitness landscape. PLoS Genetics.
15(4), e1008079.
mla: Pokusaeva, Victoria, et al. “An Experimental Assay of the Interactions of Amino
Acids from Orthologous Sequences Shaping a Complex Fitness Landscape.” PLoS
Genetics, vol. 15, no. 4, e1008079, Public Library of Science, 2019, doi:10.1371/journal.pgen.1008079.
short: V. Pokusaeva, D.R. Usmanova, E.V. Putintseva, L. Espinar, K. Sarkisyan, A.S.
Mishin, N.S. Bogatyreva, D. Ivankov, A. Akopyan, S. Avvakumov, I.S. Povolotskaya,
G.J. Filion, L.B. Carey, F. Kondrashov, PLoS Genetics 15 (2019).
date_created: 2019-05-13T07:58:38Z
date_published: 2019-04-10T00:00:00Z
date_updated: 2023-08-25T10:30:37Z
day: '10'
ddc:
- '570'
department:
- _id: FyKo
doi: 10.1371/journal.pgen.1008079
ec_funded: 1
external_id:
isi:
- '000466866000029'
file:
- access_level: open_access
checksum: cf3889c8a8a16053dacf9c3776cbe217
content_type: application/pdf
creator: dernst
date_created: 2019-05-14T08:26:08Z
date_updated: 2020-07-14T12:47:30Z
file_id: '6445'
file_name: 2019_PLOSGenetics_Pokusaeva.pdf
file_size: 3726017
relation: main_file
file_date_updated: 2020-07-14T12:47:30Z
has_accepted_license: '1'
intvolume: ' 15'
isi: 1
issue: '4'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '04'
oa: 1
oa_version: Published Version
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: PLoS Genetics
publication_identifier:
eissn:
- '15537404'
publication_status: published
publisher: Public Library of Science
quality_controlled: '1'
related_material:
record:
- id: '9789'
relation: research_data
status: public
- id: '9790'
relation: research_data
status: public
- id: '9797'
relation: research_data
status: public
scopus_import: '1'
status: public
title: An experimental assay of the interactions of amino acids from orthologous sequences
shaping a complex fitness landscape
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 15
year: '2019'
...
---
_id: '6428'
abstract:
- lang: eng
text: 'Safety and security are major concerns in the development of Cyber-Physical
Systems (CPS). Signal temporal logic (STL) was proposedas a language to specify
and monitor the correctness of CPS relativeto formalized requirements. Incorporating
STL into a developmentprocess enables designers to automatically monitor and diagnosetraces,
compute robustness estimates based on requirements, andperform requirement falsification,
leading to productivity gains inverification and validation activities; however,
in its current formSTL is agnostic to the input/output classification of signals,
andthis negatively impacts the relevance of the analysis results.In this paper
we propose to make the interface explicit in theSTL language by introducing input/output
signal declarations. Wethen define new measures of input vacuity and output robustnessthat
better reflect the nature of the system and the specification in-tent. The resulting
framework, which we call interface-aware signaltemporal logic (IA-STL), aids verification
and validation activities.We demonstrate the benefits of IA-STL on several CPS
analysisactivities: (1) robustness-driven sensitivity analysis, (2) falsificationand
(3) fault localization. We describe an implementation of our en-hancement to STL
and associated notions of robustness and vacuityin a prototype extension of Breach,
a MATLAB®/Simulink®toolboxfor CPS verification and validation. We explore these
methodologi-cal improvements and evaluate our results on two examples fromthe
automotive domain: a benchmark powertrain control systemand a hydrogen fuel cell
system.'
article_processing_charge: No
author:
- first_name: Thomas
full_name: Ferrere, Thomas
id: 40960E6E-F248-11E8-B48F-1D18A9856A87
last_name: Ferrere
orcid: 0000-0001-5199-3143
- first_name: Dejan
full_name: Nickovic, Dejan
id: 41BCEE5C-F248-11E8-B48F-1D18A9856A87
last_name: Nickovic
- first_name: Alexandre
full_name: Donzé, Alexandre
last_name: Donzé
- first_name: Hisahiro
full_name: Ito, Hisahiro
last_name: Ito
- first_name: James
full_name: Kapinski, James
last_name: Kapinski
citation:
ama: 'Ferrere T, Nickovic D, Donzé A, Ito H, Kapinski J. Interface-aware signal
temporal logic. In: Proceedings of the 2019 22nd ACM International Conference
on Hybrid Systems: Computation and Control. ACM; 2019:57-66. doi:10.1145/3302504.3311800'
apa: 'Ferrere, T., Nickovic, D., Donzé, A., Ito, H., & Kapinski, J. (2019).
Interface-aware signal temporal logic. In Proceedings of the 2019 22nd ACM
International Conference on Hybrid Systems: Computation and Control (pp. 57–66).
Montreal, Canada: ACM. https://doi.org/10.1145/3302504.3311800'
chicago: 'Ferrere, Thomas, Dejan Nickovic, Alexandre Donzé, Hisahiro Ito, and James
Kapinski. “Interface-Aware Signal Temporal Logic.” In Proceedings of the 2019
22nd ACM International Conference on Hybrid Systems: Computation and Control,
57–66. ACM, 2019. https://doi.org/10.1145/3302504.3311800.'
ieee: 'T. Ferrere, D. Nickovic, A. Donzé, H. Ito, and J. Kapinski, “Interface-aware
signal temporal logic,” in Proceedings of the 2019 22nd ACM International Conference
on Hybrid Systems: Computation and Control, Montreal, Canada, 2019, pp. 57–66.'
ista: 'Ferrere T, Nickovic D, Donzé A, Ito H, Kapinski J. 2019. Interface-aware
signal temporal logic. Proceedings of the 2019 22nd ACM International Conference
on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems Computation and
Control, 57–66.'
mla: 'Ferrere, Thomas, et al. “Interface-Aware Signal Temporal Logic.” Proceedings
of the 2019 22nd ACM International Conference on Hybrid Systems: Computation and
Control, ACM, 2019, pp. 57–66, doi:10.1145/3302504.3311800.'
short: 'T. Ferrere, D. Nickovic, A. Donzé, H. Ito, J. Kapinski, in:, Proceedings
of the 2019 22nd ACM International Conference on Hybrid Systems: Computation and
Control, ACM, 2019, pp. 57–66.'
conference:
end_date: 2019-04-18
location: Montreal, Canada
name: 'HSCC: Hybrid Systems Computation and Control'
start_date: 2019-04-16
date_created: 2019-05-13T08:13:46Z
date_published: 2019-04-16T00:00:00Z
date_updated: 2023-08-25T10:19:23Z
day: '16'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1145/3302504.3311800
external_id:
isi:
- '000516713900007'
file:
- access_level: open_access
checksum: b8e967081e051d1c55ca5d18fb187890
content_type: application/pdf
creator: dernst
date_created: 2020-10-08T17:25:45Z
date_updated: 2020-10-08T17:25:45Z
file_id: '8633'
file_name: 2019_ACM_Ferrere.pdf
file_size: 1055421
relation: main_file
success: 1
file_date_updated: 2020-10-08T17:25:45Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Submitted Version
page: 57-66
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: 'Proceedings of the 2019 22nd ACM International Conference on Hybrid
Systems: Computation and Control'
publication_identifier:
isbn:
- '9781450362825'
publication_status: published
publisher: ACM
quality_controlled: '1'
scopus_import: '1'
status: public
title: Interface-aware signal temporal logic
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2019'
...
---
_id: '6430'
abstract:
- lang: eng
text: "A proxy re-encryption (PRE) scheme is a public-key encryption scheme that
allows the holder of a key pk to derive a re-encryption key for any other key
\U0001D45D\U0001D458′. This re-encryption key lets anyone transform ciphertexts
under pk into ciphertexts under \U0001D45D\U0001D458′ without having to know the
underlying message, while transformations from \U0001D45D\U0001D458′ to pk should
not be possible (unidirectional). Security is defined in a multi-user setting
against an adversary that gets the users’ public keys and can ask for re-encryption
keys and can corrupt users by requesting their secret keys. Any ciphertext that
the adversary cannot trivially decrypt given the obtained secret and re-encryption
keys should be secure.\r\n\r\nAll existing security proofs for PRE only show selective
security, where the adversary must first declare the users it wants to corrupt.
This can be lifted to more meaningful adaptive security by guessing the set of
corrupted users among the n users, which loses a factor exponential in Open image
in new window , rendering the result meaningless already for moderate Open image
in new window .\r\n\r\nJafargholi et al. (CRYPTO’17) proposed a framework that
in some cases allows to give adaptive security proofs for schemes which were previously
only known to be selectively secure, while avoiding the exponential loss that
results from guessing the adaptive choices made by an adversary. We apply their
framework to PREs that satisfy some natural additional properties. Concretely,
we give a more fine-grained reduction for several unidirectional PREs, proving
adaptive security at a much smaller loss. The loss depends on the graph of users
whose edges represent the re-encryption keys queried by the adversary. For trees
and chains the loss is quasi-polynomial in the size and for general graphs it
is exponential in their depth and indegree (instead of their size as for previous
reductions). Fortunately, trees and low-depth graphs cover many, if not most,
interesting applications.\r\n\r\nOur results apply e.g. to the bilinear-map based
PRE schemes by Ateniese et al. (NDSS’05 and CT-RSA’09), Gentry’s FHE-based scheme
(STOC’09) and the LWE-based scheme by Chandran et al. (PKC’14)."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Georg
full_name: Fuchsbauer, Georg
id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
last_name: Fuchsbauer
- first_name: Chethan
full_name: Kamath Hosdurg, Chethan
id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87
last_name: Kamath Hosdurg
- first_name: Karen
full_name: Klein, Karen
id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87
last_name: Klein
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Fuchsbauer G, Kamath Hosdurg C, Klein K, Pietrzak KZ. Adaptively secure proxy
re-encryption. In: Vol 11443. Springer Nature; 2019:317-346. doi:10.1007/978-3-030-17259-6_11'
apa: 'Fuchsbauer, G., Kamath Hosdurg, C., Klein, K., & Pietrzak, K. Z. (2019).
Adaptively secure proxy re-encryption (Vol. 11443, pp. 317–346). Presented at
the PKC: Public-Key Cryptograhy, Beijing, China: Springer Nature. https://doi.org/10.1007/978-3-030-17259-6_11'
chicago: Fuchsbauer, Georg, Chethan Kamath Hosdurg, Karen Klein, and Krzysztof Z
Pietrzak. “Adaptively Secure Proxy Re-Encryption,” 11443:317–46. Springer Nature,
2019. https://doi.org/10.1007/978-3-030-17259-6_11.
ieee: 'G. Fuchsbauer, C. Kamath Hosdurg, K. Klein, and K. Z. Pietrzak, “Adaptively
secure proxy re-encryption,” presented at the PKC: Public-Key Cryptograhy, Beijing,
China, 2019, vol. 11443, pp. 317–346.'
ista: 'Fuchsbauer G, Kamath Hosdurg C, Klein K, Pietrzak KZ. 2019. Adaptively secure
proxy re-encryption. PKC: Public-Key Cryptograhy, LNCS, vol. 11443, 317–346.'
mla: Fuchsbauer, Georg, et al. Adaptively Secure Proxy Re-Encryption. Vol.
11443, Springer Nature, 2019, pp. 317–46, doi:10.1007/978-3-030-17259-6_11.
short: G. Fuchsbauer, C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, Springer
Nature, 2019, pp. 317–346.
conference:
end_date: 2019-04-17
location: Beijing, China
name: 'PKC: Public-Key Cryptograhy'
start_date: 2019-04-14
date_created: 2019-05-13T08:13:46Z
date_published: 2019-04-06T00:00:00Z
date_updated: 2023-09-08T11:33:20Z
day: '06'
department:
- _id: KrPi
doi: 10.1007/978-3-030-17259-6_11
ec_funded: 1
intvolume: ' 11443'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2018/426
month: '04'
oa: 1
oa_version: Preprint
page: 317-346
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_identifier:
eissn:
- '16113349'
isbn:
- '9783030172589'
issn:
- '03029743'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '10035'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Adaptively secure proxy re-encryption
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 11443
year: '2019'
...
---
_id: '6435'
abstract:
- lang: eng
text: "Social insect colonies tend to have numerous members which function together
like a single organism in such harmony that the term ``super-organism'' is often
used. In this analogy the reproductive caste is analogous to the primordial germ\r\ncells
of a metazoan, while the sterile worker caste corresponds to somatic cells. The
worker castes, like tissues, are\r\nin charge of all functions of a living being,
besides reproduction. The establishment of new super-organismal units\r\n(i.e.
new colonies) is accomplished by the co-dependent castes. The term oftentimes
goes beyond a metaphor. We invoke it when we speak about the metabolic rate, thermoregulation,
nutrient regulation and gas exchange of a social insect colony. Furthermore, we
assert that the super-organism has an immune system, and benefits from ``social
immunity''.\r\n\r\nSocial immunity was first summoned by evolutionary biologists
to resolve the apparent discrepancy between the expected high frequency of disease
outbreak amongst numerous, closely related tightly-interacting hosts, living in
stable and microbially-rich environments, against the exceptionally scarce epidemic
accounts in natural populations. Social\r\nimmunity comprises a multi-layer assembly
of behaviours which have evolved to effectively keep the pathogenic enemies of
a colony at bay. The field of social immunity has drawn interest, as it becomes
increasingly urgent to stop\r\nthe collapse of pollinator species and curb the
growth of invasive pests. In the past decade, several mechanisms of\r\nsocial
immune responses have been dissected, but many more questions remain open.\r\n\r\nI
present my work in two experimental chapters. In the first, I use invasive garden
ants (*Lasius neglectus*) to study how pathogen load and its distribution among
nestmates affect the grooming response of the group. Any given group of ants will
carry out the same total grooming work, but will direct their grooming effort
towards individuals\r\ncarrying a relatively higher spore load. Contrary to expectation,
the highest risk of transmission does not stem from grooming highly contaminated
ants, but instead, we suggest that the grooming response likely minimizes spore
loss to the environment, reducing contamination from inadvertent pickup from the
substrate.\r\n\r\nThe second is a comparative developmental approach. I follow
black garden ant queens (*Lasius niger*) and their colonies from mating flight,
through hibernation for a year. Colonies which grow fast from the start, have
a lower chance of survival through hibernation, and those which survive grow at
a lower pace later. This is true for colonies of naive\r\nand challenged queens.
Early pathogen exposure of the queens changes colony dynamics in an unexpected
way: colonies from exposed queens are more likely to grow slowly and recover in
numbers only after they survive hibernation.\r\n\r\nIn addition to the two experimental
chapters, this thesis includes a co-authored published review on organisational\r\nimmunity,
where we enlist the experimental evidence and theoretical framework on which this
hypothesis is built,\r\nidentify the caveats and underline how the field is ripe
to overcome them. In a final chapter, I describe my part in\r\ntwo collaborative
efforts, one to develop an image-based tracker, and the second to develop a classifier
for ant\r\nbehaviour."
acknowledged_ssus:
- _id: Bio
- _id: ScienComp
- _id: M-Shop
- _id: LifeSc
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Barbara E
full_name: Casillas Perez, Barbara E
id: 351ED2AA-F248-11E8-B48F-1D18A9856A87
last_name: Casillas Perez
citation:
ama: Casillas Perez BE. Collective defenses of garden ants against a fungal pathogen.
2019. doi:10.15479/AT:ISTA:6435
apa: Casillas Perez, B. E. (2019). Collective defenses of garden ants against
a fungal pathogen. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6435
chicago: Casillas Perez, Barbara E. “Collective Defenses of Garden Ants against
a Fungal Pathogen.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6435.
ieee: B. E. Casillas Perez, “Collective defenses of garden ants against a fungal
pathogen,” Institute of Science and Technology Austria, 2019.
ista: Casillas Perez BE. 2019. Collective defenses of garden ants against a fungal
pathogen. Institute of Science and Technology Austria.
mla: Casillas Perez, Barbara E. Collective Defenses of Garden Ants against a
Fungal Pathogen. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6435.
short: B.E. Casillas Perez, Collective Defenses of Garden Ants against a Fungal
Pathogen, Institute of Science and Technology Austria, 2019.
date_created: 2019-05-13T08:58:35Z
date_published: 2019-05-07T00:00:00Z
date_updated: 2023-09-07T12:57:04Z
day: '07'
ddc:
- '570'
- '006'
- '578'
- '592'
degree_awarded: PhD
department:
- _id: SyCr
doi: 10.15479/AT:ISTA:6435
ec_funded: 1
file:
- access_level: open_access
checksum: 6daf2d2086111aa8fd3fbc919a3e2833
content_type: application/pdf
creator: casillas
date_created: 2019-05-13T09:16:20Z
date_updated: 2021-02-11T11:17:15Z
embargo: 2020-05-08
file_id: '6438'
file_name: tesisDoctoradoBC.pdf
file_size: 3895187
relation: main_file
- access_level: closed
checksum: 3d221aaff7559a7060230a1ff610594f
content_type: application/zip
creator: casillas
date_created: 2019-05-13T09:16:20Z
date_updated: 2020-07-14T12:47:30Z
embargo_to: open_access
file_id: '6439'
file_name: tesisDoctoradoBC.zip
file_size: 7365118
relation: source_file
file_date_updated: 2021-02-11T11:17:15Z
has_accepted_license: '1'
keyword:
- Social Immunity
- Sanitary care
- Social Insects
- Organisational Immunity
- Colony development
- Multi-target tracking
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '183'
project:
- _id: 2649B4DE-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '771402'
name: Epidemics in ant societies on a chip
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '1999'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Sylvia M
full_name: Cremer, Sylvia M
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
title: Collective defenses of garden ants against a fungal pathogen
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '6442'
abstract:
- lang: eng
text: This paper investigates the use of fundamental solutions for animating detailed
linear water surface waves. We first propose an analytical solution for efficiently
animating circular ripples in closed form. We then show how to adapt the method
of fundamental solutions (MFS) to create ambient waves interacting with complex
obstacles. Subsequently, we present a novel wavelet-based discretization which
outperforms the state of the art MFS approach for simulating time-varying water
surface waves with moving obstacles. Our results feature high-resolution spatial
details, interactions with complex boundaries, and large open ocean domains. Our
method compares favorably with previous work as well as known analytical solutions.
We also present comparisons between our method and real world examples.
acknowledged_ssus:
- _id: ScienComp
article_number: '130'
article_processing_charge: No
author:
- first_name: Camille
full_name: Schreck, Camille
id: 2B14B676-F248-11E8-B48F-1D18A9856A87
last_name: Schreck
- first_name: Christian
full_name: Hafner, Christian
id: 400429CC-F248-11E8-B48F-1D18A9856A87
last_name: Hafner
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
citation:
ama: Schreck C, Hafner C, Wojtan C. Fundamental solutions for water wave animation.
ACM Transactions on Graphics. 2019;38(4). doi:10.1145/3306346.3323002
apa: Schreck, C., Hafner, C., & Wojtan, C. (2019). Fundamental solutions for
water wave animation. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3306346.3323002
chicago: Schreck, Camille, Christian Hafner, and Chris Wojtan. “Fundamental Solutions
for Water Wave Animation.” ACM Transactions on Graphics. ACM, 2019. https://doi.org/10.1145/3306346.3323002.
ieee: C. Schreck, C. Hafner, and C. Wojtan, “Fundamental solutions for water wave
animation,” ACM Transactions on Graphics, vol. 38, no. 4. ACM, 2019.
ista: Schreck C, Hafner C, Wojtan C. 2019. Fundamental solutions for water wave
animation. ACM Transactions on Graphics. 38(4), 130.
mla: Schreck, Camille, et al. “Fundamental Solutions for Water Wave Animation.”
ACM Transactions on Graphics, vol. 38, no. 4, 130, ACM, 2019, doi:10.1145/3306346.3323002.
short: C. Schreck, C. Hafner, C. Wojtan, ACM Transactions on Graphics 38 (2019).
date_created: 2019-05-14T07:04:06Z
date_published: 2019-07-01T00:00:00Z
date_updated: 2023-08-25T10:18:46Z
day: '01'
ddc:
- '000'
- '005'
department:
- _id: ChWo
doi: 10.1145/3306346.3323002
ec_funded: 1
external_id:
isi:
- '000475740600104'
file:
- access_level: open_access
checksum: 1b737dfe3e051aba8f3f4ab1dceda673
content_type: application/pdf
creator: dernst
date_created: 2019-05-14T07:03:55Z
date_updated: 2020-07-14T12:47:30Z
file_id: '6443'
file_name: 2019_ACM_Schreck.pdf
file_size: 44328918
relation: main_file
file_date_updated: 2020-07-14T12:47:30Z
has_accepted_license: '1'
intvolume: ' 38'
isi: 1
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '638176'
name: Efficient Simulation of Natural Phenomena at Extremely Large Scales
- _id: 24F9549A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715767'
name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and
Modeling'
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: ACM Transactions on Graphics
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/new-method-makes-realistic-water-wave-animations-more-efficient/
scopus_import: '1'
status: public
title: Fundamental solutions for water wave animation
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 38
year: '2019'
...
---
_id: '6451'
abstract:
- lang: eng
text: Epidermal growth factor receptor (EGFR) signaling controls skin development
and homeostasis inmice and humans, and its deficiency causes severe skin inflammation,
which might affect epidermalstem cell behavior. Here, we describe the inflammation-independent
effects of EGFR deficiency dur-ing skin morphogenesis and in adult hair follicle
stem cells. Expression and alternative splicing analysisof RNA sequencing data
from interfollicular epidermis and outer root sheath indicate that EGFR con-trols
genes involved in epidermal differentiation and also in centrosome function, DNA
damage, cellcycle, and apoptosis. Genetic experiments employingp53deletion in
EGFR-deficient epidermis revealthat EGFR signaling exhibitsp53-dependent functions
in proliferative epidermal compartments, aswell asp53-independent functions in
differentiated hair shaft keratinocytes. Loss of EGFR leads toabsence of LEF1
protein specifically in the innermost epithelial hair layers, resulting in disorganizationof
medulla cells. Thus, our results uncover important spatial and temporal features
of cell-autonomousEGFR functions in the epidermis.
article_processing_charge: No
author:
- first_name: Nicole
full_name: Amberg, Nicole
id: 4CD6AAC6-F248-11E8-B48F-1D18A9856A87
last_name: Amberg
orcid: 0000-0002-3183-8207
- first_name: Panagiota A.
full_name: Sotiropoulou, Panagiota A.
last_name: Sotiropoulou
- first_name: Gerwin
full_name: Heller, Gerwin
last_name: Heller
- first_name: Beate M.
full_name: Lichtenberger, Beate M.
last_name: Lichtenberger
- first_name: Martin
full_name: Holcmann, Martin
last_name: Holcmann
- first_name: Bahar
full_name: Camurdanoglu, Bahar
last_name: Camurdanoglu
- first_name: Temenuschka
full_name: Baykuscheva-Gentscheva, Temenuschka
last_name: Baykuscheva-Gentscheva
- first_name: Cedric
full_name: Blanpain, Cedric
last_name: Blanpain
- first_name: Maria
full_name: Sibilia, Maria
last_name: Sibilia
citation:
ama: Amberg N, Sotiropoulou PA, Heller G, et al. EGFR controls hair shaft differentiation
in a p53-independent manner. iScience. 2019;15:243-256. doi:10.1016/j.isci.2019.04.018
apa: Amberg, N., Sotiropoulou, P. A., Heller, G., Lichtenberger, B. M., Holcmann,
M., Camurdanoglu, B., … Sibilia, M. (2019). EGFR controls hair shaft differentiation
in a p53-independent manner. IScience. Elsevier. https://doi.org/10.1016/j.isci.2019.04.018
chicago: Amberg, Nicole, Panagiota A. Sotiropoulou, Gerwin Heller, Beate M. Lichtenberger,
Martin Holcmann, Bahar Camurdanoglu, Temenuschka Baykuscheva-Gentscheva, Cedric
Blanpain, and Maria Sibilia. “EGFR Controls Hair Shaft Differentiation in a P53-Independent
Manner.” IScience. Elsevier, 2019. https://doi.org/10.1016/j.isci.2019.04.018.
ieee: N. Amberg et al., “EGFR controls hair shaft differentiation in a p53-independent
manner,” iScience, vol. 15. Elsevier, pp. 243–256, 2019.
ista: Amberg N, Sotiropoulou PA, Heller G, Lichtenberger BM, Holcmann M, Camurdanoglu
B, Baykuscheva-Gentscheva T, Blanpain C, Sibilia M. 2019. EGFR controls hair shaft
differentiation in a p53-independent manner. iScience. 15, 243–256.
mla: Amberg, Nicole, et al. “EGFR Controls Hair Shaft Differentiation in a P53-Independent
Manner.” IScience, vol. 15, Elsevier, 2019, pp. 243–56, doi:10.1016/j.isci.2019.04.018.
short: N. Amberg, P.A. Sotiropoulou, G. Heller, B.M. Lichtenberger, M. Holcmann,
B. Camurdanoglu, T. Baykuscheva-Gentscheva, C. Blanpain, M. Sibilia, IScience
15 (2019) 243–256.
date_created: 2019-05-14T11:47:40Z
date_published: 2019-05-31T00:00:00Z
date_updated: 2023-09-08T11:38:04Z
day: '31'
ddc:
- '570'
department:
- _id: SiHi
doi: 10.1016/j.isci.2019.04.018
external_id:
isi:
- '000470104600022'
file:
- access_level: open_access
checksum: a9ad2296726c9474ad5860c9c2f53622
content_type: application/pdf
creator: dernst
date_created: 2019-05-14T11:51:51Z
date_updated: 2020-07-14T12:47:30Z
file_id: '6452'
file_name: 2019_iScience_Amberg.pdf
file_size: 8365970
relation: main_file
file_date_updated: 2020-07-14T12:47:30Z
has_accepted_license: '1'
intvolume: ' 15'
isi: 1
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '05'
oa: 1
oa_version: Published Version
page: 243-256
publication: iScience
publication_identifier:
issn:
- 2589-0042
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: EGFR controls hair shaft differentiation in a p53-independent manner
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: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 15
year: '2019'
...
---
_id: '6454'
abstract:
- lang: eng
text: 'Adult neural stem cells and multiciliated ependymalcells are glial cells
essential for neurological func-tions. Together, they make up the adult neurogenicniche.
Using both high-throughput clonal analysisand single-cell resolution of progenitor
division pat-terns and fate, we show that these two componentsof the neurogenic
niche are lineally related: adult neu-ral stem cells are sister cells to ependymal
cells,whereas most ependymal cells arise from the termi-nal symmetric divisions
of the lineage. Unexpectedly,we found that the antagonist regulators of DNA repli-cation,
GemC1 and Geminin, can tune the proportionof neural stem cells and ependymal cells.
Our find-ings reveal the controlled dynamic of the neurogenicniche ontogeny and
identify the Geminin familymembers as key regulators of the initial pool of adultneural
stem cells.'
article_processing_charge: No
author:
- first_name: G
full_name: Ortiz-Álvarez, G
last_name: Ortiz-Álvarez
- first_name: M
full_name: Daclin, M
last_name: Daclin
- first_name: A
full_name: Shihavuddin, A
last_name: Shihavuddin
- first_name: P
full_name: Lansade, P
last_name: Lansade
- first_name: A
full_name: Fortoul, A
last_name: Fortoul
- first_name: M
full_name: Faucourt, M
last_name: Faucourt
- first_name: S
full_name: Clavreul, S
last_name: Clavreul
- first_name: ME
full_name: Lalioti, ME
last_name: Lalioti
- first_name: S
full_name: Taraviras, S
last_name: Taraviras
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
- first_name: J
full_name: Livet, J
last_name: Livet
- first_name: A
full_name: Meunier, A
last_name: Meunier
- first_name: A
full_name: Genovesio, A
last_name: Genovesio
- first_name: N
full_name: Spassky, N
last_name: Spassky
citation:
ama: Ortiz-Álvarez G, Daclin M, Shihavuddin A, et al. Adult neural stem cells and
multiciliated ependymal cells share a common lineage regulated by the Geminin
family members. Neuron. 2019;102(1):159-172.e7. doi:10.1016/j.neuron.2019.01.051
apa: Ortiz-Álvarez, G., Daclin, M., Shihavuddin, A., Lansade, P., Fortoul, A., Faucourt,
M., … Spassky, N. (2019). Adult neural stem cells and multiciliated ependymal
cells share a common lineage regulated by the Geminin family members. Neuron.
Elsevier. https://doi.org/10.1016/j.neuron.2019.01.051
chicago: Ortiz-Álvarez, G, M Daclin, A Shihavuddin, P Lansade, A Fortoul, M Faucourt,
S Clavreul, et al. “Adult Neural Stem Cells and Multiciliated Ependymal Cells
Share a Common Lineage Regulated by the Geminin Family Members.” Neuron.
Elsevier, 2019. https://doi.org/10.1016/j.neuron.2019.01.051.
ieee: G. Ortiz-Álvarez et al., “Adult neural stem cells and multiciliated
ependymal cells share a common lineage regulated by the Geminin family members,”
Neuron, vol. 102, no. 1. Elsevier, p. 159–172.e7, 2019.
ista: Ortiz-Álvarez G, Daclin M, Shihavuddin A, Lansade P, Fortoul A, Faucourt M,
Clavreul S, Lalioti M, Taraviras S, Hippenmeyer S, Livet J, Meunier A, Genovesio
A, Spassky N. 2019. Adult neural stem cells and multiciliated ependymal cells
share a common lineage regulated by the Geminin family members. Neuron. 102(1),
159–172.e7.
mla: Ortiz-Álvarez, G., et al. “Adult Neural Stem Cells and Multiciliated Ependymal
Cells Share a Common Lineage Regulated by the Geminin Family Members.” Neuron,
vol. 102, no. 1, Elsevier, 2019, p. 159–172.e7, doi:10.1016/j.neuron.2019.01.051.
short: G. Ortiz-Álvarez, M. Daclin, A. Shihavuddin, P. Lansade, A. Fortoul, M. Faucourt,
S. Clavreul, M. Lalioti, S. Taraviras, S. Hippenmeyer, J. Livet, A. Meunier, A.
Genovesio, N. Spassky, Neuron 102 (2019) 159–172.e7.
date_created: 2019-05-14T13:06:30Z
date_published: 2019-04-03T00:00:00Z
date_updated: 2023-09-05T13:02:21Z
day: '03'
ddc:
- '570'
department:
- _id: SiHi
doi: 10.1016/j.neuron.2019.01.051
ec_funded: 1
external_id:
isi:
- '000463337900018'
pmid:
- '30824354'
file:
- access_level: open_access
checksum: 1fb6e195c583eb0c5cabf26f69ff6675
content_type: application/pdf
creator: dernst
date_created: 2019-05-15T09:28:41Z
date_updated: 2020-07-14T12:47:30Z
file_id: '6457'
file_name: 2019_Neuron_Ortiz.pdf
file_size: 7288572
relation: main_file
file_date_updated: 2020-07-14T12:47:30Z
has_accepted_license: '1'
intvolume: ' 102'
isi: 1
issue: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 159-172.e7
pmid: 1
project:
- _id: 260018B0-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '725780'
name: Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development
publication: Neuron
publication_identifier:
eissn:
- 1097-4199
issn:
- 0896-6273
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Adult neural stem cells and multiciliated ependymal cells share a common lineage
regulated by the Geminin family members
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: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 102
year: '2019'
...
---
_id: '6455'
abstract:
- lang: eng
text: During corticogenesis, distinct subtypes of neurons are sequentially born
from ventricular zone progenitors. How these cells are molecularly temporally
patterned is poorly understood. We used single-cell RNA sequencing at high temporal
resolution to trace the lineage of the molecular identities of successive generations
of apical progenitors (APs) and their daughter neurons in mouse embryos. We identified
a core set of evolutionarily conserved, temporally patterned genes that drive
APs from internally driven to more exteroceptive states. We found that the Polycomb
repressor complex 2 (PRC2) epigenetically regulates AP temporal progression. Embryonic
age–dependent AP molecular states are transmitted to their progeny as successive
ground states, onto which essentially conserved early postmitotic differentiation
programs are applied, and are complemented by later-occurring environment-dependent
signals. Thus, epigenetically regulated temporal molecular birthmarks present
in progenitors act in their postmitotic progeny to seed adult neuronal diversity.
article_number: eaav2522
article_processing_charge: No
article_type: original
author:
- first_name: L
full_name: Telley, L
last_name: Telley
- first_name: G
full_name: Agirman, G
last_name: Agirman
- first_name: J
full_name: Prados, J
last_name: Prados
- first_name: Nicole
full_name: Amberg, Nicole
id: 4CD6AAC6-F248-11E8-B48F-1D18A9856A87
last_name: Amberg
orcid: 0000-0002-3183-8207
- first_name: S
full_name: Fièvre, S
last_name: Fièvre
- first_name: P
full_name: Oberst, P
last_name: Oberst
- first_name: G
full_name: Bartolini, G
last_name: Bartolini
- first_name: I
full_name: Vitali, I
last_name: Vitali
- first_name: C
full_name: Cadilhac, C
last_name: Cadilhac
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
- first_name: L
full_name: Nguyen, L
last_name: Nguyen
- first_name: A
full_name: Dayer, A
last_name: Dayer
- first_name: D
full_name: Jabaudon, D
last_name: Jabaudon
citation:
ama: Telley L, Agirman G, Prados J, et al. Temporal patterning of apical progenitors
and their daughter neurons in the developing neocortex. Science. 2019;364(6440).
doi:10.1126/science.aav2522
apa: Telley, L., Agirman, G., Prados, J., Amberg, N., Fièvre, S., Oberst, P., …
Jabaudon, D. (2019). Temporal patterning of apical progenitors and their daughter
neurons in the developing neocortex. Science. AAAS. https://doi.org/10.1126/science.aav2522
chicago: Telley, L, G Agirman, J Prados, Nicole Amberg, S Fièvre, P Oberst, G Bartolini,
et al. “Temporal Patterning of Apical Progenitors and Their Daughter Neurons in
the Developing Neocortex.” Science. AAAS, 2019. https://doi.org/10.1126/science.aav2522.
ieee: L. Telley et al., “Temporal patterning of apical progenitors and their
daughter neurons in the developing neocortex,” Science, vol. 364, no. 6440.
AAAS, 2019.
ista: Telley L, Agirman G, Prados J, Amberg N, Fièvre S, Oberst P, Bartolini G,
Vitali I, Cadilhac C, Hippenmeyer S, Nguyen L, Dayer A, Jabaudon D. 2019. Temporal
patterning of apical progenitors and their daughter neurons in the developing
neocortex. Science. 364(6440), eaav2522.
mla: Telley, L., et al. “Temporal Patterning of Apical Progenitors and Their Daughter
Neurons in the Developing Neocortex.” Science, vol. 364, no. 6440, eaav2522,
AAAS, 2019, doi:10.1126/science.aav2522.
short: L. Telley, G. Agirman, J. Prados, N. Amberg, S. Fièvre, P. Oberst, G. Bartolini,
I. Vitali, C. Cadilhac, S. Hippenmeyer, L. Nguyen, A. Dayer, D. Jabaudon, Science
364 (2019).
date_created: 2019-05-14T13:07:47Z
date_published: 2019-05-10T00:00:00Z
date_updated: 2023-09-05T11:51:09Z
day: '10'
department:
- _id: SiHi
doi: 10.1126/science.aav2522
ec_funded: 1
external_id:
isi:
- '000467631800034'
pmid:
- '31073041'
intvolume: ' 364'
isi: 1
issue: '6440'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://orbi.uliege.be/bitstream/2268/239604/1/Telley_Agirman_Science2019.pdf
month: '05'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 260018B0-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '725780'
name: Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development
- _id: 268F8446-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: T0101031
name: Role of Eed in neural stem cell lineage progression
publication: Science
publication_identifier:
eissn:
- 1095-9203
issn:
- 0036-8075
publication_status: published
publisher: AAAS
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/how-to-generate-a-brain-of-correct-size-and-composition/
scopus_import: '1'
status: public
title: Temporal patterning of apical progenitors and their daughter neurons in the
developing neocortex
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 364
year: '2019'
...
---
_id: '6462'
abstract:
- lang: eng
text: A controller is a device that interacts with a plant. At each time point,it
reads the plant’s state and issues commands with the goal that the plant oper-ates
optimally. Constructing optimal controllers is a fundamental and challengingproblem.
Machine learning techniques have recently been successfully applied totrain controllers,
yet they have limitations. Learned controllers are monolithic andhard to reason
about. In particular, it is difficult to add features without retraining,to guarantee
any level of performance, and to achieve acceptable performancewhen encountering
untrained scenarios. These limitations can be addressed bydeploying quantitative
run-timeshieldsthat serve as a proxy for the controller.At each time point, the
shield reads the command issued by the controller andmay choose to alter it before
passing it on to the plant. We show how optimalshields that interfere as little
as possible while guaranteeing a desired level ofcontroller performance, can be
generated systematically and automatically usingreactive synthesis. First, we abstract the plant by building a stochastic model.Second,
we consider the learned controller to be a black box. Third, we mea-surecontroller
performanceandshield interferenceby two quantitative run-timemeasures that are
formally defined using weighted automata. Then, the problemof constructing a shield
that guarantees maximal performance with minimal inter-ference is the problem
of finding an optimal strategy in a stochastic2-player game“controller versus
shield” played on the abstract state space of the plant with aquantitative objective
obtained from combining the performance and interferencemeasures. We illustrate
the effectiveness of our approach by automatically con-structing lightweight shields
for learned traffic-light controllers in various roadnetworks. The shields we
generate avoid liveness bugs, improve controller per-formance in untrained and
changing traffic situations, and add features to learnedcontrollers, such as giving
priority to emergency vehicles.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Roderick
full_name: Bloem, Roderick
last_name: Bloem
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Bettina
full_name: Konighofer, Bettina
last_name: Konighofer
- first_name: Stefan
full_name: Pranger, Stefan
last_name: Pranger
citation:
ama: 'Avni G, Bloem R, Chatterjee K, Henzinger TA, Konighofer B, Pranger S. Run-time
optimization for learned controllers through quantitative games. In: 31st International
Conference on Computer-Aided Verification. Vol 11561. Springer; 2019:630-649.
doi:10.1007/978-3-030-25540-4_36'
apa: 'Avni, G., Bloem, R., Chatterjee, K., Henzinger, T. A., Konighofer, B., &
Pranger, S. (2019). Run-time optimization for learned controllers through quantitative
games. In 31st International Conference on Computer-Aided Verification
(Vol. 11561, pp. 630–649). New York, NY, United States: Springer. https://doi.org/10.1007/978-3-030-25540-4_36'
chicago: Avni, Guy, Roderick Bloem, Krishnendu Chatterjee, Thomas A Henzinger, Bettina
Konighofer, and Stefan Pranger. “Run-Time Optimization for Learned Controllers
through Quantitative Games.” In 31st International Conference on Computer-Aided
Verification, 11561:630–49. Springer, 2019. https://doi.org/10.1007/978-3-030-25540-4_36.
ieee: G. Avni, R. Bloem, K. Chatterjee, T. A. Henzinger, B. Konighofer, and S. Pranger,
“Run-time optimization for learned controllers through quantitative games,” in
31st International Conference on Computer-Aided Verification, New York,
NY, United States, 2019, vol. 11561, pp. 630–649.
ista: 'Avni G, Bloem R, Chatterjee K, Henzinger TA, Konighofer B, Pranger S. 2019.
Run-time optimization for learned controllers through quantitative games. 31st
International Conference on Computer-Aided Verification. CAV: Computer Aided Verification,
LNCS, vol. 11561, 630–649.'
mla: Avni, Guy, et al. “Run-Time Optimization for Learned Controllers through Quantitative
Games.” 31st International Conference on Computer-Aided Verification, vol.
11561, Springer, 2019, pp. 630–49, doi:10.1007/978-3-030-25540-4_36.
short: G. Avni, R. Bloem, K. Chatterjee, T.A. Henzinger, B. Konighofer, S. Pranger,
in:, 31st International Conference on Computer-Aided Verification, Springer, 2019,
pp. 630–649.
conference:
end_date: 2019-07-18
location: New York, NY, United States
name: 'CAV: Computer Aided Verification'
start_date: 2019-07-13
date_created: 2019-05-16T11:22:30Z
date_published: 2019-07-12T00:00:00Z
date_updated: 2023-08-25T10:33:27Z
day: '12'
ddc:
- '000'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1007/978-3-030-25540-4_36
external_id:
isi:
- '000491468000036'
file:
- access_level: open_access
checksum: c231579f2485c6fd4df17c9443a4d80b
content_type: application/pdf
creator: dernst
date_created: 2019-08-14T09:35:24Z
date_updated: 2020-07-14T12:47:31Z
file_id: '6816'
file_name: 2019_CAV_Avni.pdf
file_size: 659766
relation: main_file
file_date_updated: 2020-07-14T12:47:31Z
has_accepted_license: '1'
intvolume: ' 11561'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 630-649
project:
- _id: 264B3912-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02369
name: Formal Methods meets Algorithmic Game Theory
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: 31st International Conference on Computer-Aided Verification
publication_identifier:
isbn:
- '9783030255398'
issn:
- 0302-9743
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
status: public
title: Run-time optimization for learned controllers through quantitative 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: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 11561
year: '2019'
...
---
_id: '6465'
abstract:
- lang: eng
text: Tight control over protein degradation is a fundamental requirement for cells
to respond rapidly to various stimuli and adapt to a fluctuating environment.
Here we develop a versatile, easy-to-handle library of destabilizing tags (degrons)
for the precise regulation of protein expression profiles in mammalian cells by
modulating target protein half-lives in a predictable manner. Using the well-established
tetracycline gene-regulation system as a model, we show that the dynamics of protein
expression can be tuned by fusing appropriate degron tags to gene regulators.
Next, we apply this degron library to tune a synthetic pulse-generating circuit
in mammalian cells. With this toolbox we establish a set of pulse generators with
tailored pulse lengths and magnitudes of protein expression. This methodology
will prove useful in the functional roles of essential proteins, fine-tuning of
gene-expression systems, and enabling a higher complexity in the design of synthetic
biological systems in mammalian cells.
article_number: '2013'
article_processing_charge: No
author:
- first_name: Hélène
full_name: Chassin, Hélène
last_name: Chassin
- first_name: Marius
full_name: Müller, Marius
last_name: Müller
- first_name: Marcel
full_name: Tigges, Marcel
last_name: Tigges
- first_name: Leo
full_name: Scheller, Leo
last_name: Scheller
- first_name: Moritz
full_name: Lang, Moritz
id: 29E0800A-F248-11E8-B48F-1D18A9856A87
last_name: Lang
- first_name: Martin
full_name: Fussenegger, Martin
last_name: Fussenegger
citation:
ama: Chassin H, Müller M, Tigges M, Scheller L, Lang M, Fussenegger M. A modular
degron library for synthetic circuits in mammalian cells. Nature Communications.
2019;10(1). doi:10.1038/s41467-019-09974-5
apa: Chassin, H., Müller, M., Tigges, M., Scheller, L., Lang, M., & Fussenegger,
M. (2019). A modular degron library for synthetic circuits in mammalian cells.
Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-019-09974-5
chicago: Chassin, Hélène, Marius Müller, Marcel Tigges, Leo Scheller, Moritz Lang,
and Martin Fussenegger. “A Modular Degron Library for Synthetic Circuits in Mammalian
Cells.” Nature Communications. Springer Nature, 2019. https://doi.org/10.1038/s41467-019-09974-5.
ieee: H. Chassin, M. Müller, M. Tigges, L. Scheller, M. Lang, and M. Fussenegger,
“A modular degron library for synthetic circuits in mammalian cells,” Nature
Communications, vol. 10, no. 1. Springer Nature, 2019.
ista: Chassin H, Müller M, Tigges M, Scheller L, Lang M, Fussenegger M. 2019. A
modular degron library for synthetic circuits in mammalian cells. Nature Communications.
10(1), 2013.
mla: Chassin, Hélène, et al. “A Modular Degron Library for Synthetic Circuits in
Mammalian Cells.” Nature Communications, vol. 10, no. 1, 2013, Springer
Nature, 2019, doi:10.1038/s41467-019-09974-5.
short: H. Chassin, M. Müller, M. Tigges, L. Scheller, M. Lang, M. Fussenegger, Nature
Communications 10 (2019).
date_created: 2019-05-19T21:59:14Z
date_published: 2019-05-01T00:00:00Z
date_updated: 2023-08-25T10:33:51Z
day: '01'
ddc:
- '570'
department:
- _id: CaGu
doi: 10.1038/s41467-019-09974-5
external_id:
isi:
- '000466338600006'
file:
- access_level: open_access
checksum: e214d3e4f8c81e35981583c4569b51b8
content_type: application/pdf
creator: dernst
date_created: 2019-05-20T07:33:54Z
date_updated: 2020-07-14T12:47:31Z
file_id: '6471'
file_name: 2019_NatureComm_Chassin.pdf
file_size: 1191827
relation: main_file
file_date_updated: 2020-07-14T12:47:31Z
has_accepted_license: '1'
intvolume: ' 10'
isi: 1
issue: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
publication: Nature Communications
publication_identifier:
eissn:
- '20411723'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- relation: erratum
url: https://doi.org/10.1038/s41467-023-36111-0
scopus_import: '1'
status: public
title: A modular degron library for synthetic circuits in mammalian cells
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 10
year: '2019'
...
---
_id: '6466'
abstract:
- lang: eng
text: "One of the most striking and consistent results in speciation genomics is
the heterogeneous divergence observed across the genomes of closely related species.
This pattern was initially attributed to different levels of gene exchange—with
divergence preserved at loci generating a barrier to gene flow but homogenized
at unlinked neutral loci. Although there is evidence to support this model, it
is now recognized that interpreting patterns of divergence across genomes is not
so straightforward. One \r\nproblem is that heterogenous divergence between populations
can also be generated by other processes (e.g. recurrent selective sweeps or background
selection) without any involvement of differential gene flow. Thus, integrated
studies that identify which loci are likely subject to divergent selection are
required to shed light on the interplay between selection and gene flow during
the early phases of speciation. In this issue of Molecular Ecology, Rifkin et
al. (2019) confront this challenge using a pair of sister morning glory species.
They wisely design their sampling to take the geographic context of individuals
into account, including geographically isolated (allopatric) and co‐occurring
(sympatric) populations. This enabled them to show that individuals are phenotypically
less differentiated in sympatry. They also found that the loci that resist introgression
are enriched for those most differentiated in allopatry and loci that exhibit
signals of divergent selection. One great strength of the \r\nstudy is the combination
of methods from population genetics and molecular evolution, including the development
of a model to simultaneously infer admixture proportions and selfing rates."
article_processing_charge: No
author:
- first_name: David
full_name: Field, David
id: 419049E2-F248-11E8-B48F-1D18A9856A87
last_name: Field
orcid: 0000-0002-4014-8478
- first_name: Christelle
full_name: Fraisse, Christelle
id: 32DF5794-F248-11E8-B48F-1D18A9856A87
last_name: Fraisse
orcid: 0000-0001-8441-5075
citation:
ama: Field D, Fraisse C. Breaking down barriers in morning glories. Molecular
ecology. 2019;28(7):1579-1581. doi:10.1111/mec.15048
apa: Field, D., & Fraisse, C. (2019). Breaking down barriers in morning glories.
Molecular Ecology. Wiley. https://doi.org/10.1111/mec.15048
chicago: Field, David, and Christelle Fraisse. “Breaking down Barriers in Morning
Glories.” Molecular Ecology. Wiley, 2019. https://doi.org/10.1111/mec.15048.
ieee: D. Field and C. Fraisse, “Breaking down barriers in morning glories,” Molecular
ecology, vol. 28, no. 7. Wiley, pp. 1579–1581, 2019.
ista: Field D, Fraisse C. 2019. Breaking down barriers in morning glories. Molecular
ecology. 28(7), 1579–1581.
mla: Field, David, and Christelle Fraisse. “Breaking down Barriers in Morning Glories.”
Molecular Ecology, vol. 28, no. 7, Wiley, 2019, pp. 1579–81, doi:10.1111/mec.15048.
short: D. Field, C. Fraisse, Molecular Ecology 28 (2019) 1579–1581.
date_created: 2019-05-19T21:59:15Z
date_published: 2019-04-01T00:00:00Z
date_updated: 2023-08-25T10:37:30Z
day: '01'
ddc:
- '580'
- '576'
department:
- _id: NiBa
doi: 10.1111/mec.15048
external_id:
isi:
- '000474808300001'
file:
- access_level: open_access
checksum: 521e3aff3e9263ddf2ffbfe0b6157715
content_type: application/pdf
creator: dernst
date_created: 2019-05-20T11:49:06Z
date_updated: 2020-07-14T12:47:31Z
file_id: '6472'
file_name: 2019_MolecularEcology_Field.pdf
file_size: 367711
relation: main_file
file_date_updated: 2020-07-14T12:47:31Z
has_accepted_license: '1'
intvolume: ' 28'
isi: 1
issue: '7'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 1579-1581
publication: Molecular ecology
publication_identifier:
eissn:
- 1365294X
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Breaking down barriers in morning glories
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 28
year: '2019'
...
---
_id: '6467'
abstract:
- lang: eng
text: Fitness interactions between mutations can influence a population’s evolution
in many different ways. While epistatic effects are difficult to measure precisely,
important information is captured by the mean and variance of log fitnesses for
individuals carrying different numbers of mutations. We derive predictions for
these quantities from a class of simple fitness landscapes, based on models of
optimizing selection on quantitative traits. We also explore extensions to the
models, including modular pleiotropy, variable effect sizes, mutational bias and
maladaptation of the wild type. We illustrate our approach by reanalysing a large
dataset of mutant effects in a yeast snoRNA (small nucleolar RNA). Though characterized
by some large epistatic effects, these data give a good overall fit to the non-epistatic
null model, suggesting that epistasis might have limited influence on the evolutionary
dynamics in this system. We also show how the amount of epistasis depends on both
the underlying fitness landscape and the distribution of mutations, and so is
expected to vary in consistent ways between new mutations, standing variation
and fixed mutations.
article_number: '0881'
article_processing_charge: No
article_type: original
author:
- first_name: Christelle
full_name: Fraisse, Christelle
id: 32DF5794-F248-11E8-B48F-1D18A9856A87
last_name: Fraisse
orcid: 0000-0001-8441-5075
- first_name: John J.
full_name: Welch, John J.
last_name: Welch
citation:
ama: Fraisse C, Welch JJ. The distribution of epistasis on simple fitness landscapes.
Biology Letters. 2019;15(4). doi:10.1098/rsbl.2018.0881
apa: Fraisse, C., & Welch, J. J. (2019). The distribution of epistasis on simple
fitness landscapes. Biology Letters. Royal Society of London. https://doi.org/10.1098/rsbl.2018.0881
chicago: Fraisse, Christelle, and John J. Welch. “The Distribution of Epistasis
on Simple Fitness Landscapes.” Biology Letters. Royal Society of London,
2019. https://doi.org/10.1098/rsbl.2018.0881.
ieee: C. Fraisse and J. J. Welch, “The distribution of epistasis on simple fitness
landscapes,” Biology Letters, vol. 15, no. 4. Royal Society of London,
2019.
ista: Fraisse C, Welch JJ. 2019. The distribution of epistasis on simple fitness
landscapes. Biology Letters. 15(4), 0881.
mla: Fraisse, Christelle, and John J. Welch. “The Distribution of Epistasis on Simple
Fitness Landscapes.” Biology Letters, vol. 15, no. 4, 0881, Royal Society
of London, 2019, doi:10.1098/rsbl.2018.0881.
short: C. Fraisse, J.J. Welch, Biology Letters 15 (2019).
date_created: 2019-05-19T21:59:15Z
date_published: 2019-04-03T00:00:00Z
date_updated: 2023-08-25T10:34:41Z
day: '03'
department:
- _id: BeVi
- _id: NiBa
doi: 10.1098/rsbl.2018.0881
ec_funded: 1
external_id:
isi:
- '000465405300010'
pmid:
- '31014191'
intvolume: ' 15'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1098/rsbl.2018.0881
month: '04'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Biology Letters
publication_identifier:
eissn:
- 1744957X
issn:
- '17449561'
publication_status: published
publisher: Royal Society of London
quality_controlled: '1'
related_material:
link:
- relation: supplementary_material
url: https://dx.doi.org/10.6084/m9.figshare.c.4461008
record:
- id: '9798'
relation: research_data
status: public
- id: '9799'
relation: research_data
status: public
scopus_import: '1'
status: public
title: The distribution of epistasis on simple fitness landscapes
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 15
year: '2019'
...
---
_id: '6470'
abstract:
- lang: eng
text: 'Investigating neuronal activity using genetically encoded Ca2+ indicators
in behaving animals is hampered by inaccuracies in spike inference from fluorescent
tracers. Here we combine two‐photon [Ca2+] imaging with cell‐attached recordings,
followed by post hoc determination of the expression level of GCaMP6f, to explore
how it affects the amplitude, kinetics and temporal summation of somatic [Ca2+]
transients in mouse hippocampal pyramidal cells (PCs). The amplitude of unitary
[Ca2+] transients (evoked by a single action potential) negatively correlates
with GCaMP6f expression, but displays large variability even among PCs with similarly
low expression levels. The summation of fluorescence signals is frequency‐dependent,
supralinear and also shows remarkable cell‐to‐cell variability. We performed experimental
data‐based simulations and found that spike inference error rates using MLspike
depend strongly on unitary peak amplitudes and GCaMP6f expression levels. We provide
simple methods for estimating the unitary [Ca2+] transients in individual weakly
GCaMP6f‐expressing PCs, with which we achieve spike inference error rates of ∼5%. '
article_processing_charge: No
article_type: original
author:
- first_name: Tímea
full_name: Éltes, Tímea
last_name: Éltes
- first_name: Miklos
full_name: Szoboszlay, Miklos
last_name: Szoboszlay
- first_name: Margit Katalin
full_name: Szigeti, Margit Katalin
id: 44F4BDC0-F248-11E8-B48F-1D18A9856A87
last_name: Szigeti
orcid: 0000-0001-9500-8758
- first_name: Zoltan
full_name: Nusser, Zoltan
last_name: Nusser
citation:
ama: Éltes T, Szoboszlay M, Szigeti MK, Nusser Z. Improved spike inference accuracy
by estimating the peak amplitude of unitary [Ca2+] transients in weakly GCaMP6f-expressing
hippocampal pyramidal cells. Journal of Physiology. 2019;597(11):2925–2947.
doi:10.1113/JP277681
apa: Éltes, T., Szoboszlay, M., Szigeti, M. K., & Nusser, Z. (2019). Improved
spike inference accuracy by estimating the peak amplitude of unitary [Ca2+] transients
in weakly GCaMP6f-expressing hippocampal pyramidal cells. Journal of Physiology.
Wiley. https://doi.org/10.1113/JP277681
chicago: Éltes, Tímea, Miklos Szoboszlay, Margit Katalin Szigeti, and Zoltan Nusser.
“Improved Spike Inference Accuracy by Estimating the Peak Amplitude of Unitary
[Ca2+] Transients in Weakly GCaMP6f-Expressing Hippocampal Pyramidal Cells.” Journal
of Physiology. Wiley, 2019. https://doi.org/10.1113/JP277681.
ieee: T. Éltes, M. Szoboszlay, M. K. Szigeti, and Z. Nusser, “Improved spike inference
accuracy by estimating the peak amplitude of unitary [Ca2+] transients in weakly
GCaMP6f-expressing hippocampal pyramidal cells,” Journal of Physiology,
vol. 597, no. 11. Wiley, pp. 2925–2947, 2019.
ista: Éltes T, Szoboszlay M, Szigeti MK, Nusser Z. 2019. Improved spike inference
accuracy by estimating the peak amplitude of unitary [Ca2+] transients in weakly
GCaMP6f-expressing hippocampal pyramidal cells. Journal of Physiology. 597(11),
2925–2947.
mla: Éltes, Tímea, et al. “Improved Spike Inference Accuracy by Estimating the Peak
Amplitude of Unitary [Ca2+] Transients in Weakly GCaMP6f-Expressing Hippocampal
Pyramidal Cells.” Journal of Physiology, vol. 597, no. 11, Wiley, 2019,
pp. 2925–2947, doi:10.1113/JP277681.
short: T. Éltes, M. Szoboszlay, M.K. Szigeti, Z. Nusser, Journal of Physiology 597
(2019) 2925–2947.
date_created: 2019-05-19T21:59:17Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2023-08-25T10:34:15Z
day: '01'
department:
- _id: GaNo
doi: 10.1113/JP277681
external_id:
isi:
- '000470780400013'
pmid:
- '31006863'
intvolume: ' 597'
isi: 1
issue: '11'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1113/JP277681
month: '06'
oa: 1
oa_version: Published Version
page: 2925–2947
pmid: 1
publication: Journal of Physiology
publication_identifier:
eissn:
- '14697793'
issn:
- '00223751'
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Improved spike inference accuracy by estimating the peak amplitude of unitary
[Ca2+] transients in weakly GCaMP6f-expressing hippocampal pyramidal cells
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 597
year: '2019'
...
---
_id: '6473'
abstract:
- lang: eng
text: "Single cells are constantly interacting with their environment and each other,
more importantly, the accurate perception of environmental cues is crucial for
growth, survival, and reproduction. This communication between cells and their
environment can be formalized in mathematical terms and be quantified as the information
flow between them, as prescribed by information theory. \r\nThe recent availability
of real–time dynamical patterns of signaling molecules in single cells has allowed
us to identify encoding about the identity of the environment in the time–series.
However, efficient estimation of the information transmitted by these signals
has been a data–analysis challenge due to the high dimensionality of the trajectories
and the limited number of samples. In the first part of this thesis, we develop
and evaluate decoding–based estimation methods to lower bound the mutual information
and derive model–based precise information estimates for biological reaction networks
governed by the chemical master equation. This is followed by applying the decoding-based
methods to study the intracellular representation of extracellular changes in
budding yeast, by observing the transient dynamics of nuclear translocation of
10 transcription factors in response to 3 stress conditions. Additionally, we
apply these estimators to previously published data on ERK and Ca2+ signaling
and yeast stress response. We argue that this single cell decoding-based measure
of information provides an unbiased, quantitative and interpretable measure for
the fidelity of biological signaling processes. \r\nFinally, in the last section,
we deal with gene regulation which is primarily controlled by transcription factors
(TFs) that bind to the DNA to activate gene expression. The possibility that non-cognate
TFs activate transcription diminishes the accuracy of regulation with potentially
disastrous effects for the cell. This ’crosstalk’ acts as a previously unexplored
source of noise in biochemical networks and puts a strong constraint on their
performance. To mitigate erroneous initiation we propose an out of equilibrium
scheme that implements kinetic proofreading. We show that such architectures are
favored over their equilibrium counterparts for complex organisms despite introducing
noise in gene expression. "
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Sarah A
full_name: Cepeda Humerez, Sarah A
id: 3DEE19A4-F248-11E8-B48F-1D18A9856A87
last_name: Cepeda Humerez
citation:
ama: Cepeda Humerez SA. Estimating information flow in single cells. 2019. doi:10.15479/AT:ISTA:6473
apa: Cepeda Humerez, S. A. (2019). Estimating information flow in single cells.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6473
chicago: Cepeda Humerez, Sarah A. “Estimating Information Flow in Single Cells.”
Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6473.
ieee: S. A. Cepeda Humerez, “Estimating information flow in single cells,” Institute
of Science and Technology Austria, 2019.
ista: Cepeda Humerez SA. 2019. Estimating information flow in single cells. Institute
of Science and Technology Austria.
mla: Cepeda Humerez, Sarah A. Estimating Information Flow in Single Cells.
Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6473.
short: S.A. Cepeda Humerez, Estimating Information Flow in Single Cells, Institute
of Science and Technology Austria, 2019.
date_created: 2019-05-21T00:11:23Z
date_published: 2019-05-23T00:00:00Z
date_updated: 2025-05-28T11:57:00Z
day: '23'
ddc:
- '004'
degree_awarded: PhD
department:
- _id: GaTk
doi: 10.15479/AT:ISTA:6473
file:
- access_level: closed
checksum: 75f9184c1346e10a5de5f9cc7338309a
content_type: application/zip
creator: scepeda
date_created: 2019-05-23T11:18:16Z
date_updated: 2020-07-14T12:47:31Z
file_id: '6480'
file_name: Thesis_Cepeda.zip
file_size: 23937464
relation: source_file
- access_level: open_access
checksum: afdc0633ddbd71d5b13550d7fb4f4454
content_type: application/pdf
creator: scepeda
date_created: 2019-05-23T11:18:13Z
date_updated: 2020-07-14T12:47:31Z
file_id: '6481'
file_name: CepedaThesis.pdf
file_size: 16646985
relation: main_file
file_date_updated: 2020-07-14T12:47:31Z
has_accepted_license: '1'
keyword:
- Information estimation
- Time-series
- data analysis
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '135'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '6900'
relation: dissertation_contains
status: public
- id: '281'
relation: dissertation_contains
status: public
- id: '2016'
relation: dissertation_contains
status: public
- id: '1576'
relation: dissertation_contains
status: public
status: public
supervisor:
- 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
title: Estimating information flow in single cells
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: '2019'
...
---
_id: '6477'
abstract:
- lang: eng
text: 'Thermalizing quantum systems are conventionallydescribed by statistical mechanics
at equilib-rium. However, not all systems fall into this category, with many-body
localization providinga generic mechanism for thermalization to fail in strongly
disordered systems. Many-bodylocalized (MBL) systems remain perfect insulators
at nonzero temperature, which do notthermalize and therefore cannot be describedusing
statistical mechanics. This Colloquiumreviews recent theoretical and experimental
advances in studies of MBL systems, focusing onthe new perspective provided by
entanglement and nonequilibrium experimental probes suchas quantum quenches. Theoretically,
MBL systems exhibit a new kind of robust integrability: anextensive set of quasilocal
integrals of motion emerges, which provides an intuitive explanationof the breakdown
of thermalization. A description based on quasilocal integrals of motion isused
to predict dynamical properties of MBL systems, such as the spreading of quantumentanglement,
the behavior of local observables, and the response to external dissipativeprocesses.
Furthermore, MBL systems can exhibit eigenstate transitions and quantum ordersforbidden
in thermodynamic equilibrium. An outline isgiven of the current theoretical under-standing
of the quantum-to-classical transitionbetween many-body localized and ergodic
phasesand anomalous transport in the vicinity of that transition. Experimentally,
synthetic quantumsystems, which are well isolated from an external thermal reservoir,
provide natural platforms forrealizing the MBL phase. Recent experiments with
ultracold atoms, trapped ions, superconductingqubits, and quantum materials, in
which different signatures of many-body localization have beenobserved, are reviewed.
This Colloquium concludes by listing outstanding challenges andpromising future
research directions.'
article_number: '021001'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Dmitry A.
full_name: Abanin, Dmitry A.
last_name: Abanin
- first_name: Ehud
full_name: Altman, Ehud
last_name: Altman
- first_name: Immanuel
full_name: Bloch, Immanuel
last_name: Bloch
- first_name: Maksym
full_name: Serbyn, Maksym
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
citation:
ama: 'Abanin DA, Altman E, Bloch I, Serbyn M. Colloquium: Many-body localization,
thermalization, and entanglement. Reviews of Modern Physics. 2019;91(2).
doi:10.1103/revmodphys.91.021001'
apa: 'Abanin, D. A., Altman, E., Bloch, I., & Serbyn, M. (2019). Colloquium:
Many-body localization, thermalization, and entanglement. Reviews of Modern
Physics. American Physical Society. https://doi.org/10.1103/revmodphys.91.021001'
chicago: 'Abanin, Dmitry A., Ehud Altman, Immanuel Bloch, and Maksym Serbyn. “Colloquium:
Many-Body Localization, Thermalization, and Entanglement.” Reviews of Modern
Physics. American Physical Society, 2019. https://doi.org/10.1103/revmodphys.91.021001.'
ieee: 'D. A. Abanin, E. Altman, I. Bloch, and M. Serbyn, “Colloquium: Many-body
localization, thermalization, and entanglement,” Reviews of Modern Physics,
vol. 91, no. 2. American Physical Society, 2019.'
ista: 'Abanin DA, Altman E, Bloch I, Serbyn M. 2019. Colloquium: Many-body localization,
thermalization, and entanglement. Reviews of Modern Physics. 91(2), 021001.'
mla: 'Abanin, Dmitry A., et al. “Colloquium: Many-Body Localization, Thermalization,
and Entanglement.” Reviews of Modern Physics, vol. 91, no. 2, 021001, American
Physical Society, 2019, doi:10.1103/revmodphys.91.021001.'
short: D.A. Abanin, E. Altman, I. Bloch, M. Serbyn, Reviews of Modern Physics 91
(2019).
date_created: 2019-05-23T07:38:43Z
date_published: 2019-05-22T00:00:00Z
date_updated: 2023-08-25T10:37:56Z
day: '22'
ddc:
- '530'
department:
- _id: MaSe
doi: 10.1103/revmodphys.91.021001
external_id:
arxiv:
- '1804.11065'
isi:
- '000469046900001'
file:
- access_level: open_access
checksum: 4aec0e6662b09f6e0f828cd30ff2c3a6
content_type: application/pdf
creator: mserbyn
date_created: 2019-05-23T07:39:05Z
date_updated: 2020-07-14T12:47:31Z
file_id: '6478'
file_name: RevModPhys.91.021001.pdf
file_size: 1695677
relation: main_file
file_date_updated: 2020-07-14T12:47:31Z
has_accepted_license: '1'
intvolume: ' 91'
isi: 1
issue: '2'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
publication: Reviews of Modern Physics
publication_identifier:
eissn:
- 0034-6861
issn:
- 1539-0756
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Colloquium: Many-body localization, thermalization, and entanglement'
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 91
year: '2019'
...
---
_id: '6482'
abstract:
- lang: eng
text: 'Computer vision systems for automatic image categorization have become accurate
and reliable enough that they can run continuously for days or even years as components
of real-world commercial applications. A major open problem in this context, however,
is quality control. Good classification performance can only be expected if systems
run under the specific conditions, in particular data distributions, that they
were trained for. Surprisingly, none of the currently used deep network architectures
have a built-in functionality that could detect if a network operates on data
from a distribution it was not trained for, such that potentially a warning to
the human users could be triggered. In this work, we describe KS(conf), a procedure
for detecting such outside of specifications (out-of-specs) operation, based on
statistical testing of the network outputs. We show by extensive experiments using
the ImageNet, AwA2 and DAVIS datasets on a variety of ConvNets architectures that
KS(conf) reliably detects out-of-specs situations. It furthermore has a number
of properties that make it a promising candidate for practical deployment: it
is easy to implement, adds almost no overhead to the system, works with all networks,
including pretrained ones, and requires no a priori knowledge of how the data
distribution could change. '
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Rémy
full_name: Sun, Rémy
last_name: Sun
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Sun R, Lampert C. KS(conf): A light-weight test if a ConvNet operates outside
of Its specifications. In: Vol 11269. Springer Nature; 2019:244-259. doi:10.1007/978-3-030-12939-2_18'
apa: 'Sun, R., & Lampert, C. (2019). KS(conf): A light-weight test if a ConvNet
operates outside of Its specifications (Vol. 11269, pp. 244–259). Presented at
the GCPR: Conference on Pattern Recognition, Stuttgart, Germany: Springer Nature.
https://doi.org/10.1007/978-3-030-12939-2_18'
chicago: 'Sun, Rémy, and Christoph Lampert. “KS(Conf): A Light-Weight Test If a
ConvNet Operates Outside of Its Specifications,” 11269:244–59. Springer Nature,
2019. https://doi.org/10.1007/978-3-030-12939-2_18.'
ieee: 'R. Sun and C. Lampert, “KS(conf): A light-weight test if a ConvNet operates
outside of Its specifications,” presented at the GCPR: Conference on Pattern Recognition,
Stuttgart, Germany, 2019, vol. 11269, pp. 244–259.'
ista: 'Sun R, Lampert C. 2019. KS(conf): A light-weight test if a ConvNet operates
outside of Its specifications. GCPR: Conference on Pattern Recognition, LNCS,
vol. 11269, 244–259.'
mla: 'Sun, Rémy, and Christoph Lampert. KS(Conf): A Light-Weight Test If a ConvNet
Operates Outside of Its Specifications. Vol. 11269, Springer Nature, 2019,
pp. 244–59, doi:10.1007/978-3-030-12939-2_18.'
short: R. Sun, C. Lampert, in:, Springer Nature, 2019, pp. 244–259.
conference:
end_date: 2018-10-12
location: Stuttgart, Germany
name: 'GCPR: Conference on Pattern Recognition'
start_date: 2018-10-09
date_created: 2019-05-24T09:48:36Z
date_published: 2019-02-14T00:00:00Z
date_updated: 2024-02-22T14:57:29Z
day: '14'
department:
- _id: ChLa
doi: 10.1007/978-3-030-12939-2_18
ec_funded: 1
external_id:
arxiv:
- '1804.04171'
intvolume: ' 11269'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.04171
month: '02'
oa: 1
oa_version: Preprint
page: 244-259
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783030129385'
- '9783030129392'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '6944'
relation: later_version
status: public
scopus_import: '1'
status: public
title: 'KS(conf): A light-weight test if a ConvNet operates outside of Its specifications'
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 11269
year: '2019'
...
---
_id: '6485'
abstract:
- lang: eng
text: Traditional concurrent programming involves manipulating shared mutable state.
Alternatives to this programming style are communicating sequential processes
(CSP) [1] and actor [2] models, which share data via explicit communication. Rendezvous
channelis the common abstraction for communication between several processes,
where senders and receivers perform a rendezvous handshake as a part of their
protocol (senders wait for receivers and vice versa). Additionally to this, channels
support the select expression. In this work, we present the first efficient lock-free
channel algorithm, and compare it against Go [3] and Kotlin [4] baseline implementations.
article_processing_charge: No
author:
- first_name: Nikita
full_name: Koval, Nikita
id: 2F4DB10C-F248-11E8-B48F-1D18A9856A87
last_name: Koval
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Roman
full_name: Elizarov, Roman
last_name: Elizarov
citation:
ama: Koval N, Alistarh D-A, Elizarov R. Lock-Free Channels for Programming via
Communicating Sequential Processes. ACM Press; 2019:417-418. doi:10.1145/3293883.3297000
apa: 'Koval, N., Alistarh, D.-A., & Elizarov, R. (2019). Lock-free channels
for programming via communicating sequential processes. Proceedings of
the 24th Symposium on Principles and Practice of Parallel Programming (pp.
417–418). Washington, NY, United States: ACM Press. https://doi.org/10.1145/3293883.3297000'
chicago: Koval, Nikita, Dan-Adrian Alistarh, and Roman Elizarov. Lock-Free Channels
for Programming via Communicating Sequential Processes. Proceedings of
the 24th Symposium on Principles and Practice of Parallel Programming. ACM
Press, 2019. https://doi.org/10.1145/3293883.3297000.
ieee: N. Koval, D.-A. Alistarh, and R. Elizarov, Lock-free channels for programming
via communicating sequential processes. ACM Press, 2019, pp. 417–418.
ista: Koval N, Alistarh D-A, Elizarov R. 2019. Lock-free channels for programming
via communicating sequential processes, ACM Press,p.
mla: Koval, Nikita, et al. “Lock-Free Channels for Programming via Communicating
Sequential Processes.” Proceedings of the 24th Symposium on Principles and
Practice of Parallel Programming, ACM Press, 2019, pp. 417–18, doi:10.1145/3293883.3297000.
short: N. Koval, D.-A. Alistarh, R. Elizarov, Lock-Free Channels for Programming
via Communicating Sequential Processes, ACM Press, 2019.
conference:
end_date: 2019-02-20
location: Washington, NY, United States
name: 'PPoPP: Principles and Practice of Parallel Programming'
start_date: 2019-02-16
date_created: 2019-05-24T10:09:12Z
date_published: 2019-02-01T00:00:00Z
date_updated: 2023-08-25T10:41:20Z
day: '01'
department:
- _id: DaAl
doi: 10.1145/3293883.3297000
external_id:
isi:
- '000587604600044'
isi: 1
language:
- iso: eng
month: '02'
oa_version: None
page: 417-418
publication: Proceedings of the 24th Symposium on Principles and Practice of Parallel
Programming
publication_identifier:
isbn:
- '9781450362252'
publication_status: published
publisher: ACM Press
quality_controlled: '1'
status: public
title: Lock-free channels for programming via communicating sequential processes
type: conference_poster
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2019'
...
---
_id: '6486'
abstract:
- lang: eng
text: Based on a novel control scheme, where a steady modification of the streamwise
velocity profile leads to complete relaminarization of initially fully turbulent
pipe flow, we investigate the applicability and usefulness of custom-shaped honeycombs
for such control. The custom-shaped honeycombs are used as stationary flow management
devices which generate specific modifications of the streamwise velocity profile.
Stereoscopic particle image velocimetry and pressure drop measurements are used
to investigate and capture the development of the relaminarizing flow downstream
these devices. We compare the performance of straight (constant length across
the radius of the pipe) honeycombs with custom-shaped ones (variable length across
the radius) and try to determine the optimal shape for maximal relaminarization
at minimal pressure loss. The optimally modified streamwise velocity profile is
found to be M-shaped, and the maximum attainable Reynolds number for total relaminarization
is found to be of the order of 10,000. Consequently, the respective reduction
in skin friction downstream of the device is almost by a factor of 5. The break-even
point, where the additional pressure drop caused by the device is balanced by
the savings due to relaminarization and a net gain is obtained, corresponds to
a downstream stretch of distances as low as approximately 100 pipe diameters of
laminar flow.
acknowledged_ssus:
- _id: M-Shop
article_number: '111105'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Jakob
full_name: Kühnen, Jakob
id: 3A47AE32-F248-11E8-B48F-1D18A9856A87
last_name: Kühnen
orcid: 0000-0003-4312-0179
- first_name: Davide
full_name: Scarselli, Davide
id: 40315C30-F248-11E8-B48F-1D18A9856A87
last_name: Scarselli
orcid: 0000-0001-5227-4271
- first_name: Björn
full_name: Hof, Björn
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
citation:
ama: Kühnen J, Scarselli D, Hof B. Relaminarization of pipe flow by means of 3D-printed
shaped honeycombs. Journal of Fluids Engineering. 2019;141(11). doi:10.1115/1.4043494
apa: Kühnen, J., Scarselli, D., & Hof, B. (2019). Relaminarization of pipe flow
by means of 3D-printed shaped honeycombs. Journal of Fluids Engineering.
ASME. https://doi.org/10.1115/1.4043494
chicago: Kühnen, Jakob, Davide Scarselli, and Björn Hof. “Relaminarization of Pipe
Flow by Means of 3D-Printed Shaped Honeycombs.” Journal of Fluids Engineering.
ASME, 2019. https://doi.org/10.1115/1.4043494.
ieee: J. Kühnen, D. Scarselli, and B. Hof, “Relaminarization of pipe flow by means
of 3D-printed shaped honeycombs,” Journal of Fluids Engineering, vol. 141,
no. 11. ASME, 2019.
ista: Kühnen J, Scarselli D, Hof B. 2019. Relaminarization of pipe flow by means
of 3D-printed shaped honeycombs. Journal of Fluids Engineering. 141(11), 111105.
mla: Kühnen, Jakob, et al. “Relaminarization of Pipe Flow by Means of 3D-Printed
Shaped Honeycombs.” Journal of Fluids Engineering, vol. 141, no. 11, 111105,
ASME, 2019, doi:10.1115/1.4043494.
short: J. Kühnen, D. Scarselli, B. Hof, Journal of Fluids Engineering 141 (2019).
date_created: 2019-05-26T21:59:13Z
date_published: 2019-11-01T00:00:00Z
date_updated: 2024-03-25T23:30:20Z
day: '01'
department:
- _id: BjHo
doi: 10.1115/1.4043494
ec_funded: 1
external_id:
arxiv:
- '1809.07625'
isi:
- '000487748600005'
intvolume: ' 141'
isi: 1
issue: '11'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1809.07625
month: '11'
oa: 1
oa_version: Preprint
project:
- _id: 25152F3A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '306589'
name: Decoding the complexity of turbulence at its origin
publication: Journal of Fluids Engineering
publication_identifier:
eissn:
- 1528901X
issn:
- '00982202'
publication_status: published
publisher: ASME
quality_controlled: '1'
related_material:
record:
- id: '7258'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Relaminarization of pipe flow by means of 3D-printed shaped honeycombs
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 141
year: '2019'
...
---
_id: '6490'
abstract:
- lang: eng
text: "Smart contracts are programs that are stored and executed on the Blockchain
and can receive, manage and transfer money (cryptocurrency units). Two important
problems regarding smart contracts are formal analysis and compiler optimization.
Formal analysis is extremely important, because smart contracts hold funds worth
billions of dollars and their code is immutable after deployment. Hence, an undetected
bug can cause significant financial losses. Compiler optimization is also crucial,
because every action of a smart contract has to be executed by every node in the
Blockchain network. Therefore, optimizations in compiling smart contracts can
lead to significant savings in computation, time and energy.\r\n\r\nTwo classical
approaches in program analysis and compiler optimization are intraprocedural and
interprocedural analysis. In intraprocedural analysis, each function is analyzed
separately, while interprocedural analysis considers the entire program. In both
cases, the analyses are usually reduced to graph problems over the control flow
graph (CFG) of the program. These graph problems are often computationally expensive.
Hence, there has been ample research on exploiting structural properties of CFGs
for efficient algorithms. One such well-studied property is the treewidth, which
is a measure of tree-likeness of graphs. It is known that intraprocedural CFGs
of structured programs have treewidth at most 6, whereas the interprocedural treewidth
cannot be bounded. This result has been used as a basis for many efficient intraprocedural
analyses.\r\n\r\nIn this paper, we explore the idea of exploiting the treewidth
of smart contracts for formal analysis and compiler optimization. First, similar
to classical programs, we show that the intraprocedural treewidth of structured
Solidity and Vyper smart contracts is at most 9. Second, for global analysis,
we prove that the interprocedural treewidth of structured smart contracts is bounded
by 10 and, in sharp contrast with classical programs, treewidth-based algorithms
can be easily applied for interprocedural analysis. Finally, we supplement our
theoretical results with experiments using a tool we implemented for computing
treewidth of smart contracts and show that the treewidth is much lower in practice.
We use 36,764 real-world Ethereum smart contracts as benchmarks and find that
they have an average treewidth of at most 3.35 for the intraprocedural case and
3.65 for the interprocedural case.\r\n"
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Ehsan Kafshdar
full_name: Goharshady, Ehsan Kafshdar
last_name: Goharshady
citation:
ama: 'Chatterjee K, Goharshady AK, Goharshady EK. The treewidth of smart contracts.
In: Proceedings of the 34th ACM Symposium on Applied Computing. Vol Part
F147772. ACM; :400-408. doi:10.1145/3297280.3297322'
apa: 'Chatterjee, K., Goharshady, A. K., & Goharshady, E. K. (n.d.). The treewidth
of smart contracts. In Proceedings of the 34th ACM Symposium on Applied Computing
(Vol. Part F147772, pp. 400–408). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297322'
chicago: Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Ehsan Kafshdar Goharshady.
“The Treewidth of Smart Contracts.” In Proceedings of the 34th ACM Symposium
on Applied Computing, Part F147772:400–408. ACM, n.d. https://doi.org/10.1145/3297280.3297322.
ieee: K. Chatterjee, A. K. Goharshady, and E. K. Goharshady, “The treewidth of smart
contracts,” in Proceedings of the 34th ACM Symposium on Applied Computing,
Limassol, Cyprus, vol. Part F147772, pp. 400–408.
ista: 'Chatterjee K, Goharshady AK, Goharshady EK. The treewidth of smart contracts.
Proceedings of the 34th ACM Symposium on Applied Computing. SAC: Symposium on
Applied Computing vol. Part F147772, 400–408.'
mla: Chatterjee, Krishnendu, et al. “The Treewidth of Smart Contracts.” Proceedings
of the 34th ACM Symposium on Applied Computing, vol. Part F147772, ACM, pp.
400–08, doi:10.1145/3297280.3297322.
short: K. Chatterjee, A.K. Goharshady, E.K. Goharshady, in:, Proceedings of the
34th ACM Symposium on Applied Computing, ACM, n.d., pp. 400–408.
conference:
end_date: 2019-04-12
location: Limassol, Cyprus
name: 'SAC: Symposium on Applied Computing'
start_date: 2019-04-08
date_created: 2019-05-26T21:59:15Z
date_published: 2019-04-01T00:00:00Z
date_updated: 2024-03-25T23:30:18Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1145/3297280.3297322
external_id:
isi:
- '000474685800052'
file:
- access_level: open_access
checksum: dddc20f6d9881f23b8755eb720ec9d6f
content_type: application/pdf
creator: dernst
date_created: 2020-05-14T09:50:11Z
date_updated: 2020-07-14T12:47:32Z
file_id: '7827'
file_name: 2019_ACM_Chatterjee.pdf
file_size: 6937138
relation: main_file
file_date_updated: 2020-07-14T12:47:32Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Submitted Version
page: 400-408
publication: Proceedings of the 34th ACM Symposium on Applied Computing
publication_identifier:
isbn:
- '9781450359337'
publication_status: submitted
publisher: ACM
pubrep_id: '1070'
quality_controlled: '1'
related_material:
record:
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: The treewidth of smart contracts
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: Part F147772
year: '2019'
...
---
_id: '6493'
abstract:
- lang: eng
text: We present two algorithmic approaches for synthesizing linear hybrid automata
from experimental data. Unlike previous approaches, our algorithms work without
a template and generate an automaton with nondeterministic guards and invariants,
and with an arbitrary number and topology of modes. They thus construct a succinct
model from the data and provide formal guarantees. In particular, (1) the generated
automaton can reproduce the data up to a specified tolerance and (2) the automaton
is tight, given the first guarantee. Our first approach encodes the synthesis
problem as a logical formula in the theory of linear arithmetic, which can then
be solved by an SMT solver. This approach minimizes the number of modes in the
resulting model but is only feasible for limited data sets. To address scalability,
we propose a second approach that does not enforce to find a minimal model. The
algorithm constructs an initial automaton and then iteratively extends the automaton
based on processing new data. Therefore the algorithm is well-suited for online
and synthesis-in-the-loop applications. The core of the algorithm is a membership
query that checks whether, within the specified tolerance, a given data set can
result from the execution of a given automaton. We solve this membership problem
for linear hybrid automata by repeated reachability computations. We demonstrate
the effectiveness of the algorithm on synthetic data sets and on cardiac-cell
measurements.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Miriam
full_name: Garcia Soto, Miriam
id: 4B3207F6-F248-11E8-B48F-1D18A9856A87
last_name: Garcia Soto
orcid: 0000−0003−2936−5719
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Christian
full_name: Schilling, Christian
id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87
last_name: Schilling
orcid: 0000-0003-3658-1065
- first_name: Luka
full_name: Zeleznik, Luka
id: 3ADCA2E4-F248-11E8-B48F-1D18A9856A87
last_name: Zeleznik
citation:
ama: 'Garcia Soto M, Henzinger TA, Schilling C, Zeleznik L. Membership-based synthesis
of linear hybrid automata. In: 31st International Conference on Computer-Aided
Verification. Vol 11561. Springer; 2019:297-314. doi:10.1007/978-3-030-25540-4_16'
apa: 'Garcia Soto, M., Henzinger, T. A., Schilling, C., & Zeleznik, L. (2019).
Membership-based synthesis of linear hybrid automata. In 31st International
Conference on Computer-Aided Verification (Vol. 11561, pp. 297–314). New York
City, NY, USA: Springer. https://doi.org/10.1007/978-3-030-25540-4_16'
chicago: Garcia Soto, Miriam, Thomas A Henzinger, Christian Schilling, and Luka
Zeleznik. “Membership-Based Synthesis of Linear Hybrid Automata.” In 31st International
Conference on Computer-Aided Verification, 11561:297–314. Springer, 2019.
https://doi.org/10.1007/978-3-030-25540-4_16.
ieee: M. Garcia Soto, T. A. Henzinger, C. Schilling, and L. Zeleznik, “Membership-based
synthesis of linear hybrid automata,” in 31st International Conference on Computer-Aided
Verification, New York City, NY, USA, 2019, vol. 11561, pp. 297–314.
ista: 'Garcia Soto M, Henzinger TA, Schilling C, Zeleznik L. 2019. Membership-based
synthesis of linear hybrid automata. 31st International Conference on Computer-Aided
Verification. CAV: Computer-Aided Verification, LNCS, vol. 11561, 297–314.'
mla: Garcia Soto, Miriam, et al. “Membership-Based Synthesis of Linear Hybrid Automata.”
31st International Conference on Computer-Aided Verification, vol. 11561,
Springer, 2019, pp. 297–314, doi:10.1007/978-3-030-25540-4_16.
short: M. Garcia Soto, T.A. Henzinger, C. Schilling, L. Zeleznik, in:, 31st International
Conference on Computer-Aided Verification, Springer, 2019, pp. 297–314.
conference:
end_date: 2019-07-18
location: New York City, NY, USA
name: 'CAV: Computer-Aided Verification'
start_date: 2019-07-15
date_created: 2019-05-27T07:09:53Z
date_published: 2019-07-12T00:00:00Z
date_updated: 2023-08-25T10:40:41Z
day: '12'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-030-25540-4_16
ec_funded: 1
external_id:
isi:
- '000491468000016'
file:
- access_level: open_access
checksum: 1f1d61b83a151031745ef70a501da3d6
content_type: application/pdf
creator: dernst
date_created: 2019-08-14T11:05:30Z
date_updated: 2020-07-14T12:47:32Z
file_id: '6817'
file_name: 2019_CAV_GarciaSoto.pdf
file_size: 674795
relation: main_file
file_date_updated: 2020-07-14T12:47:32Z
has_accepted_license: '1'
intvolume: ' 11561'
isi: 1
keyword:
- Synthesis
- Linear hybrid automaton
- Membership
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 297-314
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: 31st International Conference on Computer-Aided Verification
publication_identifier:
isbn:
- '9783030255398'
issn:
- 0302-9743
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
status: public
title: Membership-based synthesis of linear hybrid automata
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 11561
year: '2019'
...