---
_id: '7106'
abstract:
- lang: eng
text: PIN-FORMED (PIN) transporters mediate directional, intercellular movement
of the phytohormone auxin in land plants. To elucidate the evolutionary origins
of this developmentally crucial mechanism, we analysed the single PIN homologue
of a simple green alga Klebsormidium flaccidum. KfPIN functions as a plasma membrane-localized
auxin exporter in land plants and heterologous models. While its role in algae
remains unclear, PIN-driven auxin export is probably an ancient and conserved
trait within streptophytes.
article_processing_charge: No
article_type: original
author:
- first_name: Roman
full_name: Skokan, Roman
last_name: Skokan
- first_name: Eva
full_name: Medvecká, Eva
last_name: Medvecká
- first_name: Tom
full_name: Viaene, Tom
last_name: Viaene
- first_name: Stanislav
full_name: Vosolsobě, Stanislav
last_name: Vosolsobě
- first_name: Marta
full_name: Zwiewka, Marta
last_name: Zwiewka
- first_name: Karel
full_name: Müller, Karel
last_name: Müller
- first_name: Petr
full_name: Skůpa, Petr
last_name: Skůpa
- first_name: Michal
full_name: Karady, Michal
last_name: Karady
- first_name: Yuzhou
full_name: Zhang, Yuzhou
last_name: Zhang
- first_name: Dorina P.
full_name: Janacek, Dorina P.
last_name: Janacek
- first_name: Ulrich Z.
full_name: Hammes, Ulrich Z.
last_name: Hammes
- first_name: Karin
full_name: Ljung, Karin
last_name: Ljung
- first_name: Tomasz
full_name: Nodzyński, Tomasz
last_name: Nodzyński
- first_name: Jan
full_name: Petrášek, Jan
last_name: Petrášek
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Skokan R, Medvecká E, Viaene T, et al. PIN-driven auxin transport emerged early
in streptophyte evolution. Nature Plants. 2019;5(11):1114-1119. doi:10.1038/s41477-019-0542-5
apa: Skokan, R., Medvecká, E., Viaene, T., Vosolsobě, S., Zwiewka, M., Müller, K.,
… Friml, J. (2019). PIN-driven auxin transport emerged early in streptophyte evolution.
Nature Plants. Springer Nature. https://doi.org/10.1038/s41477-019-0542-5
chicago: Skokan, Roman, Eva Medvecká, Tom Viaene, Stanislav Vosolsobě, Marta Zwiewka,
Karel Müller, Petr Skůpa, et al. “PIN-Driven Auxin Transport Emerged Early in
Streptophyte Evolution.” Nature Plants. Springer Nature, 2019. https://doi.org/10.1038/s41477-019-0542-5.
ieee: R. Skokan et al., “PIN-driven auxin transport emerged early in streptophyte
evolution,” Nature Plants, vol. 5, no. 11. Springer Nature, pp. 1114–1119,
2019.
ista: Skokan R, Medvecká E, Viaene T, Vosolsobě S, Zwiewka M, Müller K, Skůpa P,
Karady M, Zhang Y, Janacek DP, Hammes UZ, Ljung K, Nodzyński T, Petrášek J, Friml
J. 2019. PIN-driven auxin transport emerged early in streptophyte evolution. Nature
Plants. 5(11), 1114–1119.
mla: Skokan, Roman, et al. “PIN-Driven Auxin Transport Emerged Early in Streptophyte
Evolution.” Nature Plants, vol. 5, no. 11, Springer Nature, 2019, pp. 1114–19,
doi:10.1038/s41477-019-0542-5.
short: R. Skokan, E. Medvecká, T. Viaene, S. Vosolsobě, M. Zwiewka, K. Müller, P.
Skůpa, M. Karady, Y. Zhang, D.P. Janacek, U.Z. Hammes, K. Ljung, T. Nodzyński,
J. Petrášek, J. Friml, Nature Plants 5 (2019) 1114–1119.
date_created: 2019-11-25T09:08:04Z
date_published: 2019-11-01T00:00:00Z
date_updated: 2023-09-06T11:09:49Z
day: '01'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.1038/s41477-019-0542-5
ec_funded: 1
external_id:
isi:
- '000496526100010'
pmid:
- '31712756'
file:
- access_level: open_access
checksum: 94e0426856aad9a9bd0135d5436efbf1
content_type: application/pdf
creator: dernst
date_created: 2020-10-14T08:54:49Z
date_updated: 2020-10-14T08:54:49Z
file_id: '8660'
file_name: 2019_NaturePlants_Skokan_accepted.pdf
file_size: 1980851
relation: main_file
success: 1
file_date_updated: 2020-10-14T08:54:49Z
has_accepted_license: '1'
intvolume: ' 5'
isi: 1
issue: '11'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
page: 1114-1119
pmid: 1
project:
- _id: 261099A6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '742985'
name: Tracing Evolution of Auxin Transport and Polarity in Plants
publication: Nature Plants
publication_identifier:
issn:
- 2055-0278
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: PIN-driven auxin transport emerged early in streptophyte evolution
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 5
year: '2019'
...
---
_id: '7108'
abstract:
- lang: eng
text: We prove that for every d ≥ 2, deciding if a pure, d-dimensional, simplicial
complex is shellable is NP-hard, hence NP-complete. This resolves a question raised,
e.g., by Danaraj and Klee in 1978. Our reduction also yields that for every d
≥ 2 and k ≥ 0, deciding if a pure, d-dimensional, simplicial complex is k-decomposable
is NP-hard. For d ≥ 3, both problems remain NP-hard when restricted to contractible
pure d-dimensional complexes. Another simple corollary of our result is that it
is NP-hard to decide whether a given poset is CL-shellable.
article_number: '21'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Xavier
full_name: Goaoc, Xavier
last_name: Goaoc
- first_name: Pavel
full_name: Patak, Pavel
id: B593B804-1035-11EA-B4F1-947645A5BB83
last_name: Patak
- first_name: Zuzana
full_name: Patakova, Zuzana
id: 48B57058-F248-11E8-B48F-1D18A9856A87
last_name: Patakova
orcid: 0000-0002-3975-1683
- first_name: Martin
full_name: Tancer, Martin
last_name: Tancer
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: Goaoc X, Patak P, Patakova Z, Tancer M, Wagner U. Shellability is NP-complete.
Journal of the ACM. 2019;66(3). doi:10.1145/3314024
apa: Goaoc, X., Patak, P., Patakova, Z., Tancer, M., & Wagner, U. (2019). Shellability
is NP-complete. Journal of the ACM. ACM. https://doi.org/10.1145/3314024
chicago: Goaoc, Xavier, Pavel Patak, Zuzana Patakova, Martin Tancer, and Uli Wagner.
“Shellability Is NP-Complete.” Journal of the ACM. ACM, 2019. https://doi.org/10.1145/3314024.
ieee: X. Goaoc, P. Patak, Z. Patakova, M. Tancer, and U. Wagner, “Shellability is
NP-complete,” Journal of the ACM, vol. 66, no. 3. ACM, 2019.
ista: Goaoc X, Patak P, Patakova Z, Tancer M, Wagner U. 2019. Shellability is NP-complete.
Journal of the ACM. 66(3), 21.
mla: Goaoc, Xavier, et al. “Shellability Is NP-Complete.” Journal of the ACM,
vol. 66, no. 3, 21, ACM, 2019, doi:10.1145/3314024.
short: X. Goaoc, P. Patak, Z. Patakova, M. Tancer, U. Wagner, Journal of the ACM
66 (2019).
date_created: 2019-11-26T10:13:59Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2023-09-06T11:10:58Z
day: '01'
department:
- _id: UlWa
doi: 10.1145/3314024
external_id:
arxiv:
- '1711.08436'
isi:
- '000495406300007'
intvolume: ' 66'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/pdf/1711.08436.pdf
month: '06'
oa: 1
oa_version: Preprint
publication: Journal of the ACM
publication_identifier:
issn:
- 0004-5411
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
record:
- id: '184'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Shellability is NP-complete
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 66
year: '2019'
...
---
_id: '7109'
abstract:
- lang: eng
text: We show how to construct temporal testers for the logic MITL, a prominent
linear-time logic for real-time systems. A temporal tester is a transducer that
inputs a signal holding the Boolean value of atomic propositions and outputs the
truth value of a formula along time. Here we consider testers over continuous-time
Boolean signals that use clock variables to enforce duration constraints, as in
timed automata. We first rewrite the MITL formula into a “simple” formula using
a limited set of temporal modalities. We then build testers for these specific
modalities and show how to compose testers for simple formulae into complex ones.
Temporal testers can be turned into acceptors, yielding a compositional translation
from MITL to timed automata. This construction is much simpler than previously
known and remains asymptotically optimal. It supports both past and future operators
and can easily be extended.
article_number: '19'
article_processing_charge: No
article_type: original
author:
- first_name: Thomas
full_name: Ferrere, Thomas
id: 40960E6E-F248-11E8-B48F-1D18A9856A87
last_name: Ferrere
orcid: 0000-0001-5199-3143
- first_name: Oded
full_name: Maler, Oded
last_name: Maler
- first_name: Dejan
full_name: Ničković, Dejan
last_name: Ničković
- first_name: Amir
full_name: Pnueli, Amir
last_name: Pnueli
citation:
ama: Ferrere T, Maler O, Ničković D, Pnueli A. From real-time logic to timed automata.
Journal of the ACM. 2019;66(3). doi:10.1145/3286976
apa: Ferrere, T., Maler, O., Ničković, D., & Pnueli, A. (2019). From real-time
logic to timed automata. Journal of the ACM. ACM. https://doi.org/10.1145/3286976
chicago: Ferrere, Thomas, Oded Maler, Dejan Ničković, and Amir Pnueli. “From Real-Time
Logic to Timed Automata.” Journal of the ACM. ACM, 2019. https://doi.org/10.1145/3286976.
ieee: T. Ferrere, O. Maler, D. Ničković, and A. Pnueli, “From real-time logic to
timed automata,” Journal of the ACM, vol. 66, no. 3. ACM, 2019.
ista: Ferrere T, Maler O, Ničković D, Pnueli A. 2019. From real-time logic to timed
automata. Journal of the ACM. 66(3), 19.
mla: Ferrere, Thomas, et al. “From Real-Time Logic to Timed Automata.” Journal
of the ACM, vol. 66, no. 3, 19, ACM, 2019, doi:10.1145/3286976.
short: T. Ferrere, O. Maler, D. Ničković, A. Pnueli, Journal of the ACM 66 (2019).
date_created: 2019-11-26T10:22:32Z
date_published: 2019-05-01T00:00:00Z
date_updated: 2023-09-06T11:11:56Z
day: '01'
department:
- _id: ToHe
doi: 10.1145/3286976
external_id:
isi:
- '000495406300005'
intvolume: ' 66'
isi: 1
issue: '3'
language:
- iso: eng
month: '05'
oa_version: None
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: Journal of the ACM
publication_identifier:
issn:
- 0004-5411
publication_status: published
publisher: ACM
quality_controlled: '1'
scopus_import: '1'
status: public
title: From real-time logic to timed automata
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 66
year: '2019'
...
---
_id: '7117'
abstract:
- lang: eng
text: We propose a novel generic shape optimization method for CAD models based
on the eXtended Finite Element Method (XFEM). Our method works directly on the
intersection between the model and a regular simulation grid, without the need
to mesh or remesh, thus removing a bottleneck of classical shape optimization
strategies. This is made possible by a novel hierarchical integration scheme that
accurately integrates finite element quantities with sub-element precision. For
optimization, we efficiently compute analytical shape derivatives of the entire
framework, from model intersection to integration rule generation and XFEM simulation.
Moreover, we describe a differentiable projection of shape parameters onto a constraint
manifold spanned by user-specified shape preservation, consistency, and manufacturability
constraints. We demonstrate the utility of our approach by optimizing mass distribution,
strength-to-weight ratio, and inverse elastic shape design objectives directly
on parameterized 3D CAD models.
article_number: '157'
article_processing_charge: No
article_type: original
author:
- first_name: Christian
full_name: Hafner, Christian
id: 400429CC-F248-11E8-B48F-1D18A9856A87
last_name: Hafner
- first_name: Christian
full_name: Schumacher, Christian
last_name: Schumacher
- first_name: Espen
full_name: Knoop, Espen
last_name: Knoop
- first_name: Thomas
full_name: Auzinger, Thomas
id: 4718F954-F248-11E8-B48F-1D18A9856A87
last_name: Auzinger
orcid: 0000-0002-1546-3265
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Moritz
full_name: Bächer, Moritz
last_name: Bächer
citation:
ama: 'Hafner C, Schumacher C, Knoop E, Auzinger T, Bickel B, Bächer M. X-CAD: Optimizing
CAD Models with Extended Finite Elements. ACM Transactions on Graphics.
2019;38(6). doi:10.1145/3355089.3356576'
apa: 'Hafner, C., Schumacher, C., Knoop, E., Auzinger, T., Bickel, B., & Bächer,
M. (2019). X-CAD: Optimizing CAD Models with Extended Finite Elements. ACM
Transactions on Graphics. ACM. https://doi.org/10.1145/3355089.3356576'
chicago: 'Hafner, Christian, Christian Schumacher, Espen Knoop, Thomas Auzinger,
Bernd Bickel, and Moritz Bächer. “X-CAD: Optimizing CAD Models with Extended Finite
Elements.” ACM Transactions on Graphics. ACM, 2019. https://doi.org/10.1145/3355089.3356576.'
ieee: 'C. Hafner, C. Schumacher, E. Knoop, T. Auzinger, B. Bickel, and M. Bächer,
“X-CAD: Optimizing CAD Models with Extended Finite Elements,” ACM Transactions
on Graphics, vol. 38, no. 6. ACM, 2019.'
ista: 'Hafner C, Schumacher C, Knoop E, Auzinger T, Bickel B, Bächer M. 2019. X-CAD:
Optimizing CAD Models with Extended Finite Elements. ACM Transactions on Graphics.
38(6), 157.'
mla: 'Hafner, Christian, et al. “X-CAD: Optimizing CAD Models with Extended Finite
Elements.” ACM Transactions on Graphics, vol. 38, no. 6, 157, ACM, 2019,
doi:10.1145/3355089.3356576.'
short: C. Hafner, C. Schumacher, E. Knoop, T. Auzinger, B. Bickel, M. Bächer, ACM
Transactions on Graphics 38 (2019).
date_created: 2019-11-26T14:22:09Z
date_published: 2019-11-06T00:00:00Z
date_updated: 2024-03-25T23:30:26Z
day: '06'
ddc:
- '000'
department:
- _id: BeBi
doi: 10.1145/3355089.3356576
ec_funded: 1
external_id:
isi:
- '000498397300007'
file:
- access_level: open_access
checksum: 56a2fb019adcb556d2b022f5e5acb68c
content_type: application/pdf
creator: bbickel
date_created: 2019-11-26T14:24:26Z
date_updated: 2020-07-14T12:47:49Z
file_id: '7119'
file_name: xcad_sup_mat_siga19.pdf
file_size: 1673176
relation: supplementary_material
title: X-CAD Supplemental Material
- access_level: open_access
checksum: 5f29d76aceb5102e766cbab9b17d776e
content_type: application/pdf
creator: bbickel
date_created: 2019-11-26T14:24:27Z
date_updated: 2020-07-14T12:47:49Z
description: This is the author's version of the work.
file_id: '7120'
file_name: XCAD_authors_version.pdf
file_size: 14563618
relation: main_file
title: 'X-CAD: Optimizing CAD Models with Extended Finite Elements'
- access_level: open_access
checksum: 0d31e123286cbec9e28b2001c2bb0d55
content_type: video/mp4
creator: bbickel
date_created: 2019-11-26T14:27:37Z
date_updated: 2020-07-14T12:47:49Z
file_id: '7121'
file_name: XCAD_video.mp4
file_size: 259979129
relation: main_file
file_date_updated: 2020-07-14T12:47:49Z
has_accepted_license: '1'
intvolume: ' 38'
isi: 1
issue: '6'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
project:
- _id: 24F9549A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715767'
name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and
Modeling'
publication: ACM Transactions on Graphics
publication_identifier:
issn:
- 0730-0301
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
record:
- id: '12897'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'X-CAD: Optimizing CAD Models with Extended Finite Elements'
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 38
year: '2019'
...
---
_id: '7122'
abstract:
- lang: eng
text: Data-rich applications in machine-learning and control have motivated an intense
research on large-scale optimization. Novel algorithms have been proposed and
shown to have optimal convergence rates in terms of iteration counts. However,
their practical performance is severely degraded by the cost of exchanging high-dimensional
gradient vectors between computing nodes. Several gradient compression heuristics
have recently been proposed to reduce communications, but few theoretical results
exist that quantify how they impact algorithm convergence. This paper establishes
and strengthens the convergence guarantees for gradient descent under a family
of gradient compression techniques. For convex optimization problems, we derive
admissible step sizes and quantify both the number of iterations and the number
of bits that need to be exchanged to reach a target accuracy. Finally, we validate
the performance of different gradient compression techniques in simulations. The
numerical results highlight the properties of different gradient compression algorithms
and confirm that fast convergence with limited information exchange is possible.
article_number: '8619625'
article_processing_charge: No
author:
- first_name: Sarit
full_name: Khirirat, Sarit
last_name: Khirirat
- first_name: Mikael
full_name: Johansson, Mikael
last_name: Johansson
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Khirirat S, Johansson M, Alistarh D-A. Gradient compression for communication-limited
convex optimization. In: 2018 IEEE Conference on Decision and Control.
IEEE; 2019. doi:10.1109/cdc.2018.8619625'
apa: 'Khirirat, S., Johansson, M., & Alistarh, D.-A. (2019). Gradient compression
for communication-limited convex optimization. In 2018 IEEE Conference on Decision
and Control. Miami Beach, FL, United States: IEEE. https://doi.org/10.1109/cdc.2018.8619625'
chicago: Khirirat, Sarit, Mikael Johansson, and Dan-Adrian Alistarh. “Gradient Compression
for Communication-Limited Convex Optimization.” In 2018 IEEE Conference on
Decision and Control. IEEE, 2019. https://doi.org/10.1109/cdc.2018.8619625.
ieee: S. Khirirat, M. Johansson, and D.-A. Alistarh, “Gradient compression for communication-limited
convex optimization,” in 2018 IEEE Conference on Decision and Control,
Miami Beach, FL, United States, 2019.
ista: 'Khirirat S, Johansson M, Alistarh D-A. 2019. Gradient compression for communication-limited
convex optimization. 2018 IEEE Conference on Decision and Control. CDC: Conference
on Decision and Control, 8619625.'
mla: Khirirat, Sarit, et al. “Gradient Compression for Communication-Limited Convex
Optimization.” 2018 IEEE Conference on Decision and Control, 8619625, IEEE,
2019, doi:10.1109/cdc.2018.8619625.
short: S. Khirirat, M. Johansson, D.-A. Alistarh, in:, 2018 IEEE Conference on Decision
and Control, IEEE, 2019.
conference:
end_date: 2018-12-19
location: Miami Beach, FL, United States
name: 'CDC: Conference on Decision and Control'
start_date: 2018-12-17
date_created: 2019-11-26T15:07:49Z
date_published: 2019-01-21T00:00:00Z
date_updated: 2023-09-06T11:14:55Z
day: '21'
department:
- _id: DaAl
doi: 10.1109/cdc.2018.8619625
external_id:
isi:
- '000458114800023'
isi: 1
language:
- iso: eng
month: '01'
oa_version: None
publication: 2018 IEEE Conference on Decision and Control
publication_identifier:
isbn:
- '9781538613955'
issn:
- 0743-1546
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Gradient compression for communication-limited convex optimization
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '7128'
abstract:
- lang: eng
text: Loss of functional cardiomyocytes is a major determinant of heart failure
after myocardial infarction. Previous high throughput screening studies have identified
a few microRNAs (miRNAs) that can induce cardiomyocyte proliferation and stimulate
cardiac regeneration in mice. Here, we show that all of the most effective of
these miRNAs activate nuclear localization of the master transcriptional cofactor
Yes-associated protein (YAP) and induce expression of YAP-responsive genes. In
particular, miR-199a-3p directly targets two mRNAs coding for proteins impinging
on the Hippo pathway, the upstream YAP inhibitory kinase TAOK1, and the E3 ubiquitin
ligase β-TrCP, which leads to YAP degradation. Several of the pro-proliferative
miRNAs (including miR-199a-3p) also inhibit filamentous actin depolymerization
by targeting Cofilin2, a process that by itself activates YAP nuclear translocation.
Thus, activation of YAP and modulation of the actin cytoskeleton are major components
of the pro-proliferative action of miR-199a-3p and other miRNAs that induce cardiomyocyte
proliferation.
article_processing_charge: Yes
article_type: original
author:
- first_name: Consuelo
full_name: Torrini, Consuelo
last_name: Torrini
- first_name: Ryan J
full_name: Cubero, Ryan J
id: 850B2E12-9CD4-11E9-837F-E719E6697425
last_name: Cubero
orcid: 0000-0003-0002-1867
- first_name: Ellen
full_name: Dirkx, Ellen
last_name: Dirkx
- first_name: Luca
full_name: Braga, Luca
last_name: Braga
- first_name: Hashim
full_name: Ali, Hashim
last_name: Ali
- first_name: Giulia
full_name: Prosdocimo, Giulia
last_name: Prosdocimo
- first_name: Maria Ines
full_name: Gutierrez, Maria Ines
last_name: Gutierrez
- first_name: Chiara
full_name: Collesi, Chiara
last_name: Collesi
- first_name: Danilo
full_name: Licastro, Danilo
last_name: Licastro
- first_name: Lorena
full_name: Zentilin, Lorena
last_name: Zentilin
- first_name: Miguel
full_name: Mano, Miguel
last_name: Mano
- first_name: Serena
full_name: Zacchigna, Serena
last_name: Zacchigna
- first_name: Michele
full_name: Vendruscolo, Michele
last_name: Vendruscolo
- first_name: Matteo
full_name: Marsili, Matteo
last_name: Marsili
- first_name: Areejit
full_name: Samal, Areejit
last_name: Samal
- first_name: Mauro
full_name: Giacca, Mauro
last_name: Giacca
citation:
ama: Torrini C, Cubero RJ, Dirkx E, et al. Common regulatory pathways mediate activity
of microRNAs inducing cardiomyocyte proliferation. Cell Reports. 2019;27(9):2759-2771.e5.
doi:10.1016/j.celrep.2019.05.005
apa: Torrini, C., Cubero, R. J., Dirkx, E., Braga, L., Ali, H., Prosdocimo, G.,
… Giacca, M. (2019). Common regulatory pathways mediate activity of microRNAs
inducing cardiomyocyte proliferation. Cell Reports. Elsevier. https://doi.org/10.1016/j.celrep.2019.05.005
chicago: Torrini, Consuelo, Ryan J Cubero, Ellen Dirkx, Luca Braga, Hashim Ali,
Giulia Prosdocimo, Maria Ines Gutierrez, et al. “Common Regulatory Pathways Mediate
Activity of MicroRNAs Inducing Cardiomyocyte Proliferation.” Cell Reports.
Elsevier, 2019. https://doi.org/10.1016/j.celrep.2019.05.005.
ieee: C. Torrini et al., “Common regulatory pathways mediate activity of
microRNAs inducing cardiomyocyte proliferation,” Cell Reports, vol. 27,
no. 9. Elsevier, p. 2759–2771.e5, 2019.
ista: Torrini C, Cubero RJ, Dirkx E, Braga L, Ali H, Prosdocimo G, Gutierrez MI,
Collesi C, Licastro D, Zentilin L, Mano M, Zacchigna S, Vendruscolo M, Marsili
M, Samal A, Giacca M. 2019. Common regulatory pathways mediate activity of microRNAs
inducing cardiomyocyte proliferation. Cell Reports. 27(9), 2759–2771.e5.
mla: Torrini, Consuelo, et al. “Common Regulatory Pathways Mediate Activity of MicroRNAs
Inducing Cardiomyocyte Proliferation.” Cell Reports, vol. 27, no. 9, Elsevier,
2019, p. 2759–2771.e5, doi:10.1016/j.celrep.2019.05.005.
short: C. Torrini, R.J. Cubero, E. Dirkx, L. Braga, H. Ali, G. Prosdocimo, M.I.
Gutierrez, C. Collesi, D. Licastro, L. Zentilin, M. Mano, S. Zacchigna, M. Vendruscolo,
M. Marsili, A. Samal, M. Giacca, Cell Reports 27 (2019) 2759–2771.e5.
date_created: 2019-11-26T22:30:07Z
date_published: 2019-05-28T00:00:00Z
date_updated: 2021-01-12T08:11:56Z
day: '28'
ddc:
- '576'
doi: 10.1016/j.celrep.2019.05.005
extern: '1'
external_id:
pmid:
- '31141697'
file:
- access_level: open_access
checksum: c5d855d07263bfec718673385d0ea2d7
content_type: application/pdf
creator: rcubero
date_created: 2019-11-26T22:30:43Z
date_updated: 2020-07-14T12:47:50Z
file_id: '7129'
file_name: torrini_cellreports_2019.pdf
file_size: 4650750
relation: main_file
file_date_updated: 2020-07-14T12:47:50Z
has_accepted_license: '1'
intvolume: ' 27'
issue: '9'
keyword:
- cardiomyocyte
- cell cycle
- Cofilin2
- cytoskeleton
- Hippo
- microRNA
- regeneration
- YAP
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 2759-2771.e5
pmid: 1
publication: Cell Reports
publication_identifier:
issn:
- 2211-1247
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: Common regulatory pathways mediate activity of microRNAs inducing cardiomyocyte
proliferation
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 27
year: '2019'
...
---
_id: '7130'
abstract:
- lang: eng
text: "We show that statistical criticality, i.e. the occurrence of power law frequency
distributions, arises in samples that are maximally informative about the underlying
generating process. In order to reach this conclusion, we first identify the frequency
with which different outcomes occur in a sample, as the variable carrying useful
information on the generative process. The entropy of the frequency, that we call
relevance, provides an upper bound to the number of informative bits. This differs
from the entropy of the data, that we take as a measure of resolution. Samples
that maximise relevance at a given resolution—that we call maximally informative
samples—exhibit statistical criticality. In particular, Zipf's law arises at the
optimal trade-off between resolution (i.e. compression) and relevance. As a byproduct,
we derive a bound of the maximal number of parameters that can be estimated from
a dataset, in the absence of prior knowledge on the generative model.\r\n\r\nFurthermore,
we relate criticality to the statistical properties of the representation of the
data generating process. We show that, as a consequence of the concentration property
of the asymptotic equipartition property, representations that are maximally informative
about the data generating process are characterised by an exponential distribution
of energy levels. This arises from a principle of minimal entropy, that is conjugate
of the maximum entropy principle in statistical mechanics. This explains why statistical
criticality requires no parameter fine tuning in maximally informative samples."
acknowledgement: We acknowledge interesting discussions with M Abbott, E Aurell, J
Barbier, R Monasson, T Mora, I Nemenman, N Tishby and R Zecchina. This research
was supported by the Kavli Foundation and the Centre of Excellence scheme of the
Research Council of Norway (Centre for Neural Computation) (RJC and YR), by the
Basic Science Research Program through the National Research Foundation of Korea
(NRF), funded by the Ministry of Education (2016R1D1A1B03932264) (JJ), and, in part,
by the ICTP through the OEA-AC-98 (JS).
article_number: '063402'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Ryan J
full_name: Cubero, Ryan J
id: 850B2E12-9CD4-11E9-837F-E719E6697425
last_name: Cubero
orcid: 0000-0003-0002-1867
- first_name: Junghyo
full_name: Jo, Junghyo
last_name: Jo
- first_name: Matteo
full_name: Marsili, Matteo
last_name: Marsili
- first_name: Yasser
full_name: Roudi, Yasser
last_name: Roudi
- first_name: Juyong
full_name: Song, Juyong
last_name: Song
citation:
ama: 'Cubero RJ, Jo J, Marsili M, Roudi Y, Song J. Statistical criticality arises
in most informative representations. Journal of Statistical Mechanics: Theory
and Experiment. 2019;2019(6). doi:10.1088/1742-5468/ab16c8'
apa: 'Cubero, R. J., Jo, J., Marsili, M., Roudi, Y., & Song, J. (2019). Statistical
criticality arises in most informative representations. Journal of Statistical
Mechanics: Theory and Experiment. IOP Publishing. https://doi.org/10.1088/1742-5468/ab16c8'
chicago: 'Cubero, Ryan J, Junghyo Jo, Matteo Marsili, Yasser Roudi, and Juyong Song.
“Statistical Criticality Arises in Most Informative Representations.” Journal
of Statistical Mechanics: Theory and Experiment. IOP Publishing, 2019. https://doi.org/10.1088/1742-5468/ab16c8.'
ieee: 'R. J. Cubero, J. Jo, M. Marsili, Y. Roudi, and J. Song, “Statistical criticality
arises in most informative representations,” Journal of Statistical Mechanics:
Theory and Experiment, vol. 2019, no. 6. IOP Publishing, 2019.'
ista: 'Cubero RJ, Jo J, Marsili M, Roudi Y, Song J. 2019. Statistical criticality
arises in most informative representations. Journal of Statistical Mechanics:
Theory and Experiment. 2019(6), 063402.'
mla: 'Cubero, Ryan J., et al. “Statistical Criticality Arises in Most Informative
Representations.” Journal of Statistical Mechanics: Theory and Experiment,
vol. 2019, no. 6, 063402, IOP Publishing, 2019, doi:10.1088/1742-5468/ab16c8.'
short: 'R.J. Cubero, J. Jo, M. Marsili, Y. Roudi, J. Song, Journal of Statistical
Mechanics: Theory and Experiment 2019 (2019).'
date_created: 2019-11-26T22:36:09Z
date_published: 2019-06-17T00:00:00Z
date_updated: 2021-01-12T08:11:57Z
day: '17'
doi: 10.1088/1742-5468/ab16c8
extern: '1'
external_id:
arxiv:
- '1808.00249'
intvolume: ' 2019'
issue: '6'
keyword:
- optimization under uncertainty
- source coding
- large deviation
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1808.00249
month: '06'
oa: 1
oa_version: Preprint
publication: 'Journal of Statistical Mechanics: Theory and Experiment'
publication_identifier:
issn:
- 1742-5468
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
status: public
title: Statistical criticality arises in most informative representations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2019
year: '2019'
...
---
_id: '7132'
abstract:
- lang: eng
text: "A major challenge in neuroscience research is to dissect the circuits that
orchestrate behavior in health and disease. Proteins from a wide range of non-mammalian
species, such as microbial opsins, have been successfully transplanted to specific
neuronal targets to override their natural communication patterns. The goal of
our work is to manipulate synaptic communication in a manner that closely incorporates
the functional intricacies of synapses by preserving temporal encoding (i.e. the
firing pattern of the presynaptic neuron) and connectivity (i.e. target specific
synapses rather than specific neurons). Our strategy to achieve this goal builds
on the use of non-mammalian transplants to create a synthetic synapse. The mode
of modulation comes from pre-synaptic uptake of a synthetic neurotransmitter (SN)
into synaptic vesicles by means of a genetically targeted transporter selective
for the SN. Upon natural vesicular release, exposure of the SN to the synaptic
cleft will modify the post-synaptic potential through an orthogonal ligand gated
ion channel. To achieve this goal we have functionally characterized a mixed cationic
methionine-gated ion channel from Arabidopsis thaliana, designed a method to functionally
characterize a synthetic transporter in isolated synaptic vesicles without the
need for transgenic animals, identified and extracted multiple prokaryotic uptake
systems that are substrate specific for methionine (Met), and established a primary/cell
line co-culture system that would allow future combinatorial testing of this orthogonal
transmitter-transporter-channel trifecta.\r\nSynthetic synapses will provide a
unique opportunity to manipulate synaptic communication while maintaining the
electrophysiological integrity of the pre-synaptic cell. In this way, information
may be preserved that was generated in upstream circuits and that could be essential
for concerted function and information processing."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Catherine
full_name: Mckenzie, Catherine
id: 3EEDE19A-F248-11E8-B48F-1D18A9856A87
last_name: Mckenzie
citation:
ama: Mckenzie C. Design and characterization of methods and biological components
to realize synthetic neurotransmission. 2019. doi:10.15479/at:ista:7132
apa: Mckenzie, C. (2019). Design and characterization of methods and biological
components to realize synthetic neurotransmission. Institute of Science and
Technology Austria. https://doi.org/10.15479/at:ista:7132
chicago: Mckenzie, Catherine. “Design and Characterization of Methods and Biological
Components to Realize Synthetic Neurotransmission.” Institute of Science and Technology
Austria, 2019. https://doi.org/10.15479/at:ista:7132.
ieee: C. Mckenzie, “Design and characterization of methods and biological components
to realize synthetic neurotransmission,” Institute of Science and Technology Austria,
2019.
ista: Mckenzie C. 2019. Design and characterization of methods and biological components
to realize synthetic neurotransmission. Institute of Science and Technology Austria.
mla: Mckenzie, Catherine. Design and Characterization of Methods and Biological
Components to Realize Synthetic Neurotransmission. Institute of Science and
Technology Austria, 2019, doi:10.15479/at:ista:7132.
short: C. Mckenzie, Design and Characterization of Methods and Biological Components
to Realize Synthetic Neurotransmission, Institute of Science and Technology Austria,
2019.
date_created: 2019-11-27T09:07:14Z
date_published: 2019-06-27T00:00:00Z
date_updated: 2024-03-25T23:30:11Z
day: '27'
ddc:
- '571'
- '573'
degree_awarded: PhD
department:
- _id: HaJa
doi: 10.15479/at:ista:7132
file:
- access_level: closed
checksum: 34d0fe0f6e0af97b5937205a3e350423
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: dernst
date_created: 2019-11-27T09:06:10Z
date_updated: 2020-07-14T12:47:50Z
file_id: '7133'
file_name: McKenzie PhD Thesis August 2018 - Corrected Final.docx
file_size: 5054633
relation: source_file
- access_level: open_access
checksum: 140dfb5e3df7edca34f4b6fcc55d876f
content_type: application/pdf
creator: dernst
date_created: 2019-11-27T09:06:10Z
date_updated: 2020-07-14T12:47:50Z
file_id: '7134'
file_name: McKenzie PhD Thesis August 2018 - Corrected Final.pdf
file_size: 3231837
relation: main_file
file_date_updated: 2020-07-14T12:47:50Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '95'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '6266'
relation: old_edition
status: public
status: public
supervisor:
- first_name: Harald L
full_name: Janovjak, Harald L
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
title: Design and characterization of methods and biological components to realize
synthetic neurotransmission
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '7136'
abstract:
- lang: eng
text: "It is well established that the notion of min-entropy fails to satisfy the
\\emph{chain rule} of the form H(X,Y)=H(X|Y)+H(Y), known for Shannon Entropy.
Such a property would help to analyze how min-entropy is split among smaller blocks.
Problems of this kind arise for example when constructing extractors and dispersers.\r\nWe
show that any sequence of variables exhibits a very strong strong block-source
structure (conditional distributions of blocks are nearly flat) when we \\emph{spoil
few correlated bits}. This implies, conditioned on the spoiled bits, that \\emph{splitting-recombination
properties} hold. In particular, we have many nice properties that min-entropy
doesn't obey in general, for example strong chain rules, \"information can't hurt\"
inequalities, equivalences of average and worst-case conditional entropy definitions
and others. Quantitatively, for any sequence X1,…,Xt of random variables over
an alphabet X we prove that, when conditioned on m=t⋅O(loglog|X|+loglog(1/ϵ)+logt)
bits of auxiliary information, all conditional distributions of the form Xi|X2019 IEEE International Symposium on Information Theory. IEEE; 2019. doi:10.1109/isit.2019.8849240'
apa: 'Skórski, M. (2019). Strong chain rules for min-entropy under few bits spoiled.
In 2019 IEEE International Symposium on Information Theory. Paris, France:
IEEE. https://doi.org/10.1109/isit.2019.8849240'
chicago: Skórski, Maciej. “Strong Chain Rules for Min-Entropy under Few Bits Spoiled.”
In 2019 IEEE International Symposium on Information Theory. IEEE, 2019.
https://doi.org/10.1109/isit.2019.8849240.
ieee: M. Skórski, “Strong chain rules for min-entropy under few bits spoiled,” in
2019 IEEE International Symposium on Information Theory, Paris, France,
2019.
ista: 'Skórski M. 2019. Strong chain rules for min-entropy under few bits spoiled.
2019 IEEE International Symposium on Information Theory. ISIT: International Symposium
on Information Theory, 8849240.'
mla: Skórski, Maciej. “Strong Chain Rules for Min-Entropy under Few Bits Spoiled.”
2019 IEEE International Symposium on Information Theory, 8849240, IEEE,
2019, doi:10.1109/isit.2019.8849240.
short: M. Skórski, in:, 2019 IEEE International Symposium on Information Theory,
IEEE, 2019.
conference:
end_date: 2019-07-12
location: Paris, France
name: 'ISIT: International Symposium on Information Theory'
start_date: 2019-07-07
date_created: 2019-11-28T10:19:21Z
date_published: 2019-07-01T00:00:00Z
date_updated: 2023-09-06T11:15:41Z
day: '01'
department:
- _id: KrPi
doi: 10.1109/isit.2019.8849240
external_id:
arxiv:
- '1702.08476'
isi:
- '000489100301043'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1702.08476
month: '07'
oa: 1
oa_version: Preprint
publication: 2019 IEEE International Symposium on Information Theory
publication_identifier:
isbn:
- '9781538692912'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Strong chain rules for min-entropy under few bits spoiled
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '7143'
abstract:
- lang: eng
text: Roots grow downwards parallel to the gravity vector, to anchor a plant in
soil and acquire water and nutrients, using a gravitropic mechanism dependent
on the asymmetric distribution of the phytohormone auxin. Recently, Chang et al.
demonstrate that asymmetric distribution of another phytohormone, cytokinin, directs
root growth towards higher water content.
article_processing_charge: No
article_type: original
author:
- first_name: Scott A
full_name: Sinclair, Scott A
id: 2D99FE6A-F248-11E8-B48F-1D18A9856A87
last_name: Sinclair
orcid: 0000-0002-4566-0593
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: 'Sinclair SA, Friml J. Defying gravity: a plant’s quest for moisture. Cell
Research. 2019;29:965-966. doi:10.1038/s41422-019-0254-4'
apa: 'Sinclair, S. A., & Friml, J. (2019). Defying gravity: a plant’s quest
for moisture. Cell Research. Springer Nature. https://doi.org/10.1038/s41422-019-0254-4'
chicago: 'Sinclair, Scott A, and Jiří Friml. “Defying Gravity: A Plant’s Quest for
Moisture.” Cell Research. Springer Nature, 2019. https://doi.org/10.1038/s41422-019-0254-4.'
ieee: 'S. A. Sinclair and J. Friml, “Defying gravity: a plant’s quest for moisture,”
Cell Research, vol. 29. Springer Nature, pp. 965–966, 2019.'
ista: 'Sinclair SA, Friml J. 2019. Defying gravity: a plant’s quest for moisture.
Cell Research. 29, 965–966.'
mla: 'Sinclair, Scott A., and Jiří Friml. “Defying Gravity: A Plant’s Quest for
Moisture.” Cell Research, vol. 29, Springer Nature, 2019, pp. 965–66, doi:10.1038/s41422-019-0254-4.'
short: S.A. Sinclair, J. Friml, Cell Research 29 (2019) 965–966.
date_created: 2019-12-02T12:30:48Z
date_published: 2019-12-01T00:00:00Z
date_updated: 2023-09-06T11:20:58Z
day: '01'
department:
- _id: JiFr
doi: 10.1038/s41422-019-0254-4
external_id:
isi:
- '000500749600001'
pmid:
- '31745287'
intvolume: ' 29'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1038/s41422-019-0254-4
month: '12'
oa: 1
oa_version: Published Version
page: 965-966
pmid: 1
publication: Cell Research
publication_identifier:
eissn:
- 1748-7838
issn:
- 1001-0602
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Defying gravity: a plant''s quest for moisture'
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 29
year: '2019'
...
---
_id: '7145'
abstract:
- lang: eng
text: End-to-end correlated bound states are investigated in superconductor-semiconductor
hybrid nanowires at zero magnetic field. Peaks in subgap conductance are independently
identified from each wire end, and a cross-correlation function is computed that
counts end-to-end coincidences, averaging over thousands of subgap features. Strong
correlations in a short, 300-nm device are reduced by a factor of 4 in a long,
900-nm device. In addition, subgap conductance distributions are investigated,
and correlations between the left and right distributions are identified based
on their mutual information.
article_number: '205412'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: G. L. R.
full_name: Anselmetti, G. L. R.
last_name: Anselmetti
- first_name: E. A.
full_name: Martinez, E. A.
last_name: Martinez
- first_name: G. C.
full_name: Ménard, G. C.
last_name: Ménard
- first_name: D.
full_name: Puglia, D.
last_name: Puglia
- first_name: F. K.
full_name: Malinowski, F. K.
last_name: Malinowski
- first_name: J. S.
full_name: Lee, J. S.
last_name: Lee
- first_name: S.
full_name: Choi, S.
last_name: Choi
- first_name: M.
full_name: Pendharkar, M.
last_name: Pendharkar
- first_name: C. J.
full_name: Palmstrøm, C. J.
last_name: Palmstrøm
- first_name: C. M.
full_name: Marcus, C. M.
last_name: Marcus
- first_name: L.
full_name: Casparis, L.
last_name: Casparis
- first_name: Andrew P
full_name: Higginbotham, Andrew P
id: 4AD6785A-F248-11E8-B48F-1D18A9856A87
last_name: Higginbotham
orcid: 0000-0003-2607-2363
citation:
ama: Anselmetti GLR, Martinez EA, Ménard GC, et al. End-to-end correlated subgap
states in hybrid nanowires. Physical Review B. 2019;100(20). doi:10.1103/physrevb.100.205412
apa: Anselmetti, G. L. R., Martinez, E. A., Ménard, G. C., Puglia, D., Malinowski,
F. K., Lee, J. S., … Higginbotham, A. P. (2019). End-to-end correlated subgap
states in hybrid nanowires. Physical Review B. American Physical Society.
https://doi.org/10.1103/physrevb.100.205412
chicago: Anselmetti, G. L. R., E. A. Martinez, G. C. Ménard, D. Puglia, F. K. Malinowski,
J. S. Lee, S. Choi, et al. “End-to-End Correlated Subgap States in Hybrid Nanowires.”
Physical Review B. American Physical Society, 2019. https://doi.org/10.1103/physrevb.100.205412.
ieee: G. L. R. Anselmetti et al., “End-to-end correlated subgap states in
hybrid nanowires,” Physical Review B, vol. 100, no. 20. American Physical
Society, 2019.
ista: Anselmetti GLR, Martinez EA, Ménard GC, Puglia D, Malinowski FK, Lee JS, Choi
S, Pendharkar M, Palmstrøm CJ, Marcus CM, Casparis L, Higginbotham AP. 2019. End-to-end
correlated subgap states in hybrid nanowires. Physical Review B. 100(20), 205412.
mla: Anselmetti, G. L. R., et al. “End-to-End Correlated Subgap States in Hybrid
Nanowires.” Physical Review B, vol. 100, no. 20, 205412, American Physical
Society, 2019, doi:10.1103/physrevb.100.205412.
short: G.L.R. Anselmetti, E.A. Martinez, G.C. Ménard, D. Puglia, F.K. Malinowski,
J.S. Lee, S. Choi, M. Pendharkar, C.J. Palmstrøm, C.M. Marcus, L. Casparis, A.P.
Higginbotham, Physical Review B 100 (2019).
date_created: 2019-12-04T16:02:25Z
date_published: 2019-11-15T00:00:00Z
date_updated: 2024-02-28T13:13:51Z
day: '15'
department:
- _id: AnHi
doi: 10.1103/physrevb.100.205412
external_id:
arxiv:
- '1908.05549'
isi:
- '000495967500006'
intvolume: ' 100'
isi: 1
issue: '20'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1908.05549
month: '11'
oa: 1
oa_version: Preprint
publication: Physical Review B
publication_identifier:
eissn:
- 2469-9969
issn:
- 2469-9950
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: End-to-end correlated subgap states in hybrid nanowires
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 100
year: '2019'
...
---
_id: '7146'
abstract:
- lang: eng
text: Prevailing models of sex-chromosome evolution were largely inspired by the
stable and highly differentiated XY pairs of model organisms, such as those of
mammals and flies. Recent work has uncovered an incredible diversity of sex-determining
systems, bringing some of the assumptions of these traditional models into question.
One particular question that has arisen is what drives some sex chromosomes to
be maintained over millions of years and differentiate fully, while others are
replaced by new sex-determining chromosomes before differentiation has occurred.
Here, I review recent data on the variability of sex-determining genes and sex
chromosomes in different non-model vertebrates and invertebrates, and discuss
some theoretical models that have been put forward to account for this diversity.
article_processing_charge: No
article_type: original
author:
- first_name: Beatriz
full_name: Vicoso, Beatriz
id: 49E1C5C6-F248-11E8-B48F-1D18A9856A87
last_name: Vicoso
orcid: 0000-0002-4579-8306
citation:
ama: Vicoso B. Molecular and evolutionary dynamics of animal sex-chromosome turnover.
Nature Ecology & Evolution. 2019;3(12):1632-1641. doi:10.1038/s41559-019-1050-8
apa: Vicoso, B. (2019). Molecular and evolutionary dynamics of animal sex-chromosome
turnover. Nature Ecology & Evolution. Springer Nature. https://doi.org/10.1038/s41559-019-1050-8
chicago: Vicoso, Beatriz. “Molecular and Evolutionary Dynamics of Animal Sex-Chromosome
Turnover.” Nature Ecology & Evolution. Springer Nature, 2019. https://doi.org/10.1038/s41559-019-1050-8.
ieee: B. Vicoso, “Molecular and evolutionary dynamics of animal sex-chromosome turnover,”
Nature Ecology & Evolution, vol. 3, no. 12. Springer Nature, pp. 1632–1641,
2019.
ista: Vicoso B. 2019. Molecular and evolutionary dynamics of animal sex-chromosome
turnover. Nature Ecology & Evolution. 3(12), 1632–1641.
mla: Vicoso, Beatriz. “Molecular and Evolutionary Dynamics of Animal Sex-Chromosome
Turnover.” Nature Ecology & Evolution, vol. 3, no. 12, Springer Nature,
2019, pp. 1632–41, doi:10.1038/s41559-019-1050-8.
short: B. Vicoso, Nature Ecology & Evolution 3 (2019) 1632–1641.
date_created: 2019-12-04T16:05:25Z
date_published: 2019-11-25T00:00:00Z
date_updated: 2023-09-06T11:18:59Z
day: '25'
department:
- _id: BeVi
doi: 10.1038/s41559-019-1050-8
ec_funded: 1
external_id:
isi:
- '000500728800009'
intvolume: ' 3'
isi: 1
issue: '12'
language:
- iso: eng
month: '11'
oa_version: None
page: 1632-1641
project:
- _id: 250BDE62-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715257'
name: Prevalence and Influence of Sexual Antagonism on Genome Evolution
publication: Nature Ecology & Evolution
publication_identifier:
issn:
- 2397-334X
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Molecular and evolutionary dynamics of animal sex-chromosome turnover
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 3
year: '2019'
...
---
_id: '7147'
abstract:
- lang: eng
text: "The expression of a gene is characterised by its transcription factors and
the function processing them. If the transcription factors are not affected by
gene products, the regulating function is often represented as a combinational
logic circuit, where the outputs (product) are determined by current input values
(transcription factors) only, and are hence independent on their relative arrival
times. However, the simultaneous arrival of transcription factors (TFs) in genetic
circuits is a strong assumption, given that the processes of transcription and
translation of a gene into a protein introduce intrinsic time delays and that
there is no global synchronisation among the arrival times of different molecular
species at molecular targets.\r\n\r\nIn this paper, we construct an experimentally
implementable genetic circuit with two inputs and a single output, such that,
in presence of small delays in input arrival, the circuit exhibits qualitatively
distinct observable phenotypes. In particular, these phenotypes are long lived
transients: they all converge to a single value, but so slowly, that they seem
stable for an extended time period, longer than typical experiment duration. We
used rule-based language to prototype our circuit, and we implemented a search
for finding the parameter combinations raising the phenotypes of interest.\r\n\r\nThe
behaviour of our prototype circuit has wide implications. First, it suggests that
GRNs can exploit event timing to create phenotypes. Second, it opens the possibility
that GRNs are using event timing to react to stimuli and memorise events, without
explicit feedback in regulation. From the modelling perspective, our prototype
circuit demonstrates the critical importance of analysing the transient dynamics
at the promoter binding sites of the DNA, before applying rapid equilibrium assumptions."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
- 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: Claudia
full_name: Igler, Claudia
id: 46613666-F248-11E8-B48F-1D18A9856A87
last_name: Igler
- first_name: Tatjana
full_name: Petrov, Tatjana
id: 3D5811FC-F248-11E8-B48F-1D18A9856A87
last_name: Petrov
orcid: 0000-0002-9041-0905
- first_name: Ali
full_name: Sezgin, Ali
id: 4C7638DA-F248-11E8-B48F-1D18A9856A87
last_name: Sezgin
citation:
ama: 'Guet CC, Henzinger TA, Igler C, Petrov T, Sezgin A. Transient memory in gene
regulation. In: 17th International Conference on Computational Methods in Systems
Biology. Vol 11773. Springer Nature; 2019:155-187. doi:10.1007/978-3-030-31304-3_9'
apa: 'Guet, C. C., Henzinger, T. A., Igler, C., Petrov, T., & Sezgin, A. (2019).
Transient memory in gene regulation. In 17th International Conference on Computational
Methods in Systems Biology (Vol. 11773, pp. 155–187). Trieste, Italy: Springer
Nature. https://doi.org/10.1007/978-3-030-31304-3_9'
chicago: Guet, Calin C, Thomas A Henzinger, Claudia Igler, Tatjana Petrov, and Ali
Sezgin. “Transient Memory in Gene Regulation.” In 17th International Conference
on Computational Methods in Systems Biology, 11773:155–87. Springer Nature,
2019. https://doi.org/10.1007/978-3-030-31304-3_9.
ieee: C. C. Guet, T. A. Henzinger, C. Igler, T. Petrov, and A. Sezgin, “Transient
memory in gene regulation,” in 17th International Conference on Computational
Methods in Systems Biology, Trieste, Italy, 2019, vol. 11773, pp. 155–187.
ista: 'Guet CC, Henzinger TA, Igler C, Petrov T, Sezgin A. 2019. Transient memory
in gene regulation. 17th International Conference on Computational Methods in
Systems Biology. CMSB: Computational Methods in Systems Biology, LNCS, vol. 11773,
155–187.'
mla: Guet, Calin C., et al. “Transient Memory in Gene Regulation.” 17th International
Conference on Computational Methods in Systems Biology, vol. 11773, Springer
Nature, 2019, pp. 155–87, doi:10.1007/978-3-030-31304-3_9.
short: C.C. Guet, T.A. Henzinger, C. Igler, T. Petrov, A. Sezgin, in:, 17th International
Conference on Computational Methods in Systems Biology, Springer Nature, 2019,
pp. 155–187.
conference:
end_date: 2019-09-20
location: Trieste, Italy
name: 'CMSB: Computational Methods in Systems Biology'
start_date: 2019-09-18
date_created: 2019-12-04T16:07:50Z
date_published: 2019-09-17T00:00:00Z
date_updated: 2023-09-06T11:18:08Z
day: '17'
department:
- _id: CaGu
- _id: ToHe
doi: 10.1007/978-3-030-31304-3_9
external_id:
isi:
- '000557875100009'
intvolume: ' 11773'
isi: 1
language:
- iso: eng
month: '09'
oa_version: None
page: 155-187
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 251EE76E-B435-11E9-9278-68D0E5697425
grant_number: '24573'
name: Design principles underlying genetic switch architecture
publication: 17th International Conference on Computational Methods in Systems Biology
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783030313036'
- '9783030313043'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Transient memory in gene regulation
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 11773
year: '2019'
...
---
_id: '7150'
abstract:
- lang: eng
text: "In this work, we use algebraic methods for studying distance computation
and subgraph detection tasks in the congested clique model. Specifically, we adapt
parallel matrix multiplication implementations to the congested clique, obtaining
an O(n1−2/ω) round matrix multiplication algorithm, where ω<2.3728639 is the exponent
of matrix multiplication. In conjunction with known techniques from centralised
algorithmics, this gives significant improvements over previous best upper bounds
in the congested clique model. The highlight results include:\r\n\r\n1. triangle
and 4-cycle counting in O(n0.158) rounds, improving upon the O(n1/3) algorithm
of Dolev et al. [DISC 2012],\r\n2. a (1+o(1))-approximation of all-pairs shortest
paths in O(n0.158) rounds, improving upon the O~(n1/2)-round (2+o(1))-approximation
algorithm given by Nanongkai [STOC 2014], and\r\n 3. computing the girth in O(n0.158)
rounds, which is the first non-trivial solution in this model.\r\n \r\nIn addition,
we present a novel constant-round combinatorial algorithm for detecting 4-cycles."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Keren
full_name: Censor-Hillel, Keren
last_name: Censor-Hillel
- first_name: Petteri
full_name: Kaski, Petteri
last_name: Kaski
- first_name: Janne
full_name: Korhonen, Janne
id: C5402D42-15BC-11E9-A202-CA2BE6697425
last_name: Korhonen
- first_name: Christoph
full_name: Lenzen, Christoph
last_name: Lenzen
- first_name: Ami
full_name: Paz, Ami
last_name: Paz
- first_name: Jukka
full_name: Suomela, Jukka
last_name: Suomela
citation:
ama: Censor-Hillel K, Kaski P, Korhonen J, Lenzen C, Paz A, Suomela J. Algebraic
methods in the congested clique. Distributed Computing. 2019;32(6):461-478.
doi:10.1007/s00446-016-0270-2
apa: Censor-Hillel, K., Kaski, P., Korhonen, J., Lenzen, C., Paz, A., & Suomela,
J. (2019). Algebraic methods in the congested clique. Distributed Computing.
Springer Nature. https://doi.org/10.1007/s00446-016-0270-2
chicago: Censor-Hillel, Keren, Petteri Kaski, Janne Korhonen, Christoph Lenzen,
Ami Paz, and Jukka Suomela. “Algebraic Methods in the Congested Clique.” Distributed
Computing. Springer Nature, 2019. https://doi.org/10.1007/s00446-016-0270-2.
ieee: K. Censor-Hillel, P. Kaski, J. Korhonen, C. Lenzen, A. Paz, and J. Suomela,
“Algebraic methods in the congested clique,” Distributed Computing, vol.
32, no. 6. Springer Nature, pp. 461–478, 2019.
ista: Censor-Hillel K, Kaski P, Korhonen J, Lenzen C, Paz A, Suomela J. 2019. Algebraic
methods in the congested clique. Distributed Computing. 32(6), 461–478.
mla: Censor-Hillel, Keren, et al. “Algebraic Methods in the Congested Clique.” Distributed
Computing, vol. 32, no. 6, Springer Nature, 2019, pp. 461–78, doi:10.1007/s00446-016-0270-2.
short: K. Censor-Hillel, P. Kaski, J. Korhonen, C. Lenzen, A. Paz, J. Suomela, Distributed
Computing 32 (2019) 461–478.
date_created: 2019-12-05T09:49:49Z
date_published: 2019-12-01T00:00:00Z
date_updated: 2021-01-12T08:12:05Z
day: '01'
doi: 10.1007/s00446-016-0270-2
extern: '1'
external_id:
arxiv:
- '1503.04963'
intvolume: ' 32'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1503.04963
month: '12'
oa: 1
oa_version: Preprint
page: 461-478
publication: Distributed Computing
publication_identifier:
issn:
- 0178-2770
- 1432-0452
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Algebraic methods in the congested clique
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 32
year: '2019'
...
---
_id: '7154'
article_processing_charge: No
author:
- first_name: Ruslan
full_name: Guseinov, Ruslan
id: 3AB45EE2-F248-11E8-B48F-1D18A9856A87
last_name: Guseinov
orcid: 0000-0001-9819-5077
citation:
ama: Guseinov R. Supplementary data for “Programming temporal morphing of self-actuated
shells.” 2019. doi:10.15479/AT:ISTA:7154
apa: Guseinov, R. (2019). Supplementary data for “Programming temporal morphing
of self-actuated shells.” Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:7154
chicago: Guseinov, Ruslan. “Supplementary Data for ‘Programming Temporal Morphing
of Self-Actuated Shells.’” Institute of Science and Technology Austria, 2019.
https://doi.org/10.15479/AT:ISTA:7154.
ieee: R. Guseinov, “Supplementary data for ‘Programming temporal morphing of self-actuated
shells.’” Institute of Science and Technology Austria, 2019.
ista: Guseinov R. 2019. Supplementary data for ‘Programming temporal morphing of
self-actuated shells’, Institute of Science and Technology Austria, 10.15479/AT:ISTA:7154.
mla: Guseinov, Ruslan. Supplementary Data for “Programming Temporal Morphing
of Self-Actuated Shells.” Institute of Science and Technology Austria, 2019,
doi:10.15479/AT:ISTA:7154.
short: R. Guseinov, (2019).
contributor:
- first_name: Ruslan
id: 3AB45EE2-F248-11E8-B48F-1D18A9856A87
last_name: Guseinov
orcid: 0000-0001-9819-5077
- first_name: Connor
last_name: McMahan
- first_name: Jesus
id: 2DC83906-F248-11E8-B48F-1D18A9856A87
last_name: Perez Rodriguez
- first_name: Chiara
last_name: Daraio
- first_name: Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
date_created: 2019-12-09T07:52:46Z
date_published: 2019-12-06T00:00:00Z
date_updated: 2024-02-21T12:45:03Z
day: '06'
ddc:
- '000'
department:
- _id: BeBi
doi: 10.15479/AT:ISTA:7154
ec_funded: 1
file:
- access_level: open_access
checksum: 155133e6e188e85b3c0676a5e70b9341
content_type: application/x-zip-compressed
creator: dernst
date_created: 2019-12-09T07:52:17Z
date_updated: 2020-07-14T12:47:50Z
file_id: '7155'
file_name: temporal_morphing_supp_data.zip
file_size: 65307107
relation: main_file
file_date_updated: 2020-07-14T12:47:50Z
has_accepted_license: '1'
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '8433'
relation: used_in_publication
status: deleted
- id: '7262'
relation: used_in_publication
status: public
status: public
title: Supplementary data for "Programming temporal morphing of self-actuated shells"
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '7156'
abstract:
- lang: eng
text: We propose an efficient microwave-photonic modulator as a resource for stationary
entangled microwave-optical fields and develop the theory for deterministic entanglement
generation and quantum state transfer in multi-resonant electro-optic systems.
The device is based on a single crystal whispering gallery mode resonator integrated
into a 3D-microwave cavity. The specific design relies on a new combination of
thin-film technology and conventional machining that is optimized for the lowest
dissipation rates in the microwave, optical, and mechanical domains. We extract
important device properties from finite-element simulations and predict continuous
variable entanglement generation rates on the order of a Mebit/s for optical pump
powers of only a few tens of microwatts. We compare the quantum state transfer
fidelities of coherent, squeezed, and non-Gaussian cat states for both teleportation
and direct conversion protocols under realistic conditions. Combining the unique
capabilities of circuit quantum electrodynamics with the resilience of fiber optic
communication could facilitate long-distance solid-state qubit networks, new methods
for quantum signal synthesis, quantum key distribution, and quantum enhanced detection,
as well as more power-efficient classical sensing and modulation.
article_number: '108'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Alfredo R
full_name: Rueda Sanchez, Alfredo R
id: 3B82B0F8-F248-11E8-B48F-1D18A9856A87
last_name: Rueda Sanchez
orcid: 0000-0001-6249-5860
- first_name: William J
full_name: Hease, William J
id: 29705398-F248-11E8-B48F-1D18A9856A87
last_name: Hease
orcid: 0000-0001-9868-2166
- first_name: Shabir
full_name: Barzanjeh, Shabir
id: 2D25E1F6-F248-11E8-B48F-1D18A9856A87
last_name: Barzanjeh
orcid: 0000-0003-0415-1423
- first_name: Johannes M
full_name: Fink, Johannes M
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
citation:
ama: Rueda Sanchez AR, Hease WJ, Barzanjeh S, Fink JM. Electro-optic entanglement
source for microwave to telecom quantum state transfer. npj Quantum Information.
2019;5. doi:10.1038/s41534-019-0220-5
apa: Rueda Sanchez, A. R., Hease, W. J., Barzanjeh, S., & Fink, J. M. (2019).
Electro-optic entanglement source for microwave to telecom quantum state transfer.
Npj Quantum Information. Springer Nature. https://doi.org/10.1038/s41534-019-0220-5
chicago: Rueda Sanchez, Alfredo R, William J Hease, Shabir Barzanjeh, and Johannes
M Fink. “Electro-Optic Entanglement Source for Microwave to Telecom Quantum State
Transfer.” Npj Quantum Information. Springer Nature, 2019. https://doi.org/10.1038/s41534-019-0220-5.
ieee: A. R. Rueda Sanchez, W. J. Hease, S. Barzanjeh, and J. M. Fink, “Electro-optic
entanglement source for microwave to telecom quantum state transfer,” npj Quantum
Information, vol. 5. Springer Nature, 2019.
ista: Rueda Sanchez AR, Hease WJ, Barzanjeh S, Fink JM. 2019. Electro-optic entanglement
source for microwave to telecom quantum state transfer. npj Quantum Information.
5, 108.
mla: Rueda Sanchez, Alfredo R., et al. “Electro-Optic Entanglement Source for Microwave
to Telecom Quantum State Transfer.” Npj Quantum Information, vol. 5, 108,
Springer Nature, 2019, doi:10.1038/s41534-019-0220-5.
short: A.R. Rueda Sanchez, W.J. Hease, S. Barzanjeh, J.M. Fink, Npj Quantum Information
5 (2019).
date_created: 2019-12-09T08:18:56Z
date_published: 2019-12-01T00:00:00Z
date_updated: 2024-08-07T07:11:55Z
day: '01'
ddc:
- '530'
department:
- _id: JoFi
doi: 10.1038/s41534-019-0220-5
ec_funded: 1
external_id:
arxiv:
- '1909.01470'
isi:
- '000502996200003'
file:
- access_level: open_access
checksum: 13e0ea1d4f9b5f5710780d9473364f58
content_type: application/pdf
creator: dernst
date_created: 2019-12-09T08:25:06Z
date_updated: 2020-07-14T12:47:50Z
file_id: '7157'
file_name: 2019_NPJ_Rueda.pdf
file_size: 1580132
relation: main_file
file_date_updated: 2020-07-14T12:47:50Z
has_accepted_license: '1'
intvolume: ' 5'
isi: 1
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 26336814-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '758053'
name: A Fiber Optic Transceiver for Superconducting Qubits
- _id: 258047B6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '707438'
name: 'Microwave-to-Optical Quantum Link: Quantum Teleportation and Quantum Illumination
with cavity Optomechanics SUPEREOM'
- _id: 257EB838-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '732894'
name: Hybrid Optomechanical Technologies
- _id: 26927A52-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: F07105
name: Integrating superconducting quantum circuits
publication: npj Quantum Information
publication_identifier:
issn:
- 2056-6387
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Electro-optic entanglement source for microwave to telecom quantum state transfer
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 5
year: '2019'
...
---
_id: '7158'
abstract:
- lang: eng
text: "Interprocedural analysis is at the heart of numerous applications in programming
languages, such as alias analysis, constant propagation, and so on. Recursive
state machines (RSMs) are standard models for interprocedural analysis. We consider
a general framework with RSMs where the transitions are labeled from a semiring
and path properties are algebraic with semiring operations. RSMs with algebraic
path properties can model interprocedural dataflow analysis problems, the shortest
path problem, the most probable path problem, and so on. The traditional algorithms
for interprocedural analysis focus on path properties where the starting point
is fixed as the entry point of a specific method. In this work, we consider possible
multiple queries as required in many applications such as in alias analysis. The
study of multiple queries allows us to bring in an important algorithmic distinction
between the resource usage of the one-time preprocessing vs for each individual
query. The second aspect we consider is that the control flow graphs for most
programs have constant treewidth.\r\n\r\nOur main contributions are simple and
implementable algorithms that support multiple queries for algebraic path properties
for RSMs that have constant treewidth. Our theoretical results show that our algorithms
have small additional one-time preprocessing but can answer subsequent queries
significantly faster as compared to the current algorithmic solutions for interprocedural
dataflow analysis. We have also implemented our algorithms and evaluated their
performance for performing on-demand interprocedural dataflow analysis on various
domains, such as for live variable analysis and reaching definitions, on a standard
benchmark set. Our experimental results align with our theoretical statements
and show that after a lightweight preprocessing, on-demand queries are answered
much faster than the standard existing algorithmic approaches.\r\n"
article_number: '23'
article_processing_charge: No
article_type: original
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Prateesh
full_name: Goyal, Prateesh
last_name: Goyal
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: Chatterjee K, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. Faster
algorithms for dynamic algebraic queries in basic RSMs with constant treewidth.
ACM Transactions on Programming Languages and Systems. 2019;41(4). doi:10.1145/3363525
apa: Chatterjee, K., Goharshady, A. K., Goyal, P., Ibsen-Jensen, R., & Pavlogiannis,
A. (2019). Faster algorithms for dynamic algebraic queries in basic RSMs with
constant treewidth. ACM Transactions on Programming Languages and Systems.
ACM. https://doi.org/10.1145/3363525
chicago: Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus
Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Dynamic Algebraic
Queries in Basic RSMs with Constant Treewidth.” ACM Transactions on Programming
Languages and Systems. ACM, 2019. https://doi.org/10.1145/3363525.
ieee: K. Chatterjee, A. K. Goharshady, P. Goyal, R. Ibsen-Jensen, and A. Pavlogiannis,
“Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth,”
ACM Transactions on Programming Languages and Systems, vol. 41, no. 4.
ACM, 2019.
ista: Chatterjee K, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. 2019.
Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth.
ACM Transactions on Programming Languages and Systems. 41(4), 23.
mla: Chatterjee, Krishnendu, et al. “Faster Algorithms for Dynamic Algebraic Queries
in Basic RSMs with Constant Treewidth.” ACM Transactions on Programming Languages
and Systems, vol. 41, no. 4, 23, ACM, 2019, doi:10.1145/3363525.
short: K. Chatterjee, A.K. Goharshady, P. Goyal, R. Ibsen-Jensen, A. Pavlogiannis,
ACM Transactions on Programming Languages and Systems 41 (2019).
date_created: 2019-12-09T08:33:33Z
date_published: 2019-11-01T00:00:00Z
date_updated: 2024-03-25T23:30:19Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1145/3363525
ec_funded: 1
external_id:
isi:
- '000564108400004'
file:
- access_level: open_access
checksum: 291cc86a07bd010d4815e177dac57b70
content_type: application/pdf
creator: dernst
date_created: 2020-10-08T12:58:10Z
date_updated: 2020-10-08T12:58:10Z
file_id: '8632'
file_name: 2019_ACMTransactions_Chatterjee.pdf
file_size: 667357
relation: main_file
success: 1
file_date_updated: 2020-10-08T12:58:10Z
has_accepted_license: '1'
intvolume: ' 41'
isi: 1
issue: '4'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: ACM Transactions on Programming Languages and Systems
publication_identifier:
issn:
- 0164-0925
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
record:
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Faster algorithms for dynamic algebraic queries in basic RSMs with constant
treewidth
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 41
year: '2019'
...
---
_id: '7159'
abstract:
- lang: eng
text: 'Cyber-physical systems (CPS) and the Internet-of-Things (IoT) result in a
tremendous amount of generated, measured and recorded time-series data. Extracting
temporal segments that encode patterns with useful information out of these huge
amounts of data is an extremely difficult problem. We propose shape expressions
as a declarative formalism for specifying, querying and extracting sophisticated
temporal patterns from possibly noisy data. Shape expressions are regular expressions
with arbitrary (linear, exponential, sinusoidal, etc.) shapes with parameters
as atomic predicates and additional constraints on these parameters. We equip
shape expressions with a novel noisy semantics that combines regular expression
matching semantics with statistical regression. We characterize essential properties
of the formalism and propose an efficient approximate shape expression matching
procedure. We demonstrate the wide applicability of this technique on two case
studies. '
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Dejan
full_name: Ničković, Dejan
last_name: Ničković
- first_name: Xin
full_name: Qin, Xin
last_name: Qin
- first_name: Thomas
full_name: Ferrere, Thomas
id: 40960E6E-F248-11E8-B48F-1D18A9856A87
last_name: Ferrere
orcid: 0000-0001-5199-3143
- first_name: Cristinel
full_name: Mateis, Cristinel
last_name: Mateis
- first_name: Jyotirmoy
full_name: Deshmukh, Jyotirmoy
last_name: Deshmukh
citation:
ama: 'Ničković D, Qin X, Ferrere T, Mateis C, Deshmukh J. Shape expressions for
specifying and extracting signal features. In: 19th International Conference
on Runtime Verification. Vol 11757. Springer Nature; 2019:292-309. doi:10.1007/978-3-030-32079-9_17'
apa: 'Ničković, D., Qin, X., Ferrere, T., Mateis, C., & Deshmukh, J. (2019).
Shape expressions for specifying and extracting signal features. In 19th International
Conference on Runtime Verification (Vol. 11757, pp. 292–309). Porto, Portugal:
Springer Nature. https://doi.org/10.1007/978-3-030-32079-9_17'
chicago: Ničković, Dejan, Xin Qin, Thomas Ferrere, Cristinel Mateis, and Jyotirmoy
Deshmukh. “Shape Expressions for Specifying and Extracting Signal Features.” In
19th International Conference on Runtime Verification, 11757:292–309. Springer
Nature, 2019. https://doi.org/10.1007/978-3-030-32079-9_17.
ieee: D. Ničković, X. Qin, T. Ferrere, C. Mateis, and J. Deshmukh, “Shape expressions
for specifying and extracting signal features,” in 19th International Conference
on Runtime Verification, Porto, Portugal, 2019, vol. 11757, pp. 292–309.
ista: 'Ničković D, Qin X, Ferrere T, Mateis C, Deshmukh J. 2019. Shape expressions
for specifying and extracting signal features. 19th International Conference on
Runtime Verification. RV: Runtime Verification, LNCS, vol. 11757, 292–309.'
mla: Ničković, Dejan, et al. “Shape Expressions for Specifying and Extracting Signal
Features.” 19th International Conference on Runtime Verification, vol.
11757, Springer Nature, 2019, pp. 292–309, doi:10.1007/978-3-030-32079-9_17.
short: D. Ničković, X. Qin, T. Ferrere, C. Mateis, J. Deshmukh, in:, 19th International
Conference on Runtime Verification, Springer Nature, 2019, pp. 292–309.
conference:
end_date: 2019-10-11
location: Porto, Portugal
name: 'RV: Runtime Verification'
start_date: 2019-10-08
date_created: 2019-12-09T08:47:55Z
date_published: 2019-10-01T00:00:00Z
date_updated: 2023-09-06T11:24:10Z
day: '01'
department:
- _id: ToHe
doi: 10.1007/978-3-030-32079-9_17
external_id:
isi:
- '000570006300017'
intvolume: ' 11757'
isi: 1
language:
- iso: eng
month: '10'
oa_version: None
page: 292-309
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
publication: 19th International Conference on Runtime Verification
publication_identifier:
isbn:
- '9783030320782'
- '9783030320799'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Shape expressions for specifying and extracting signal features
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 11757
year: '2019'
...
---
_id: '7165'
abstract:
- lang: eng
text: Cell division, movement and differentiation contribute to pattern formation
in developing tissues. This is the case in the vertebrate neural tube, in which
neurons differentiate in a characteristic pattern from a highly dynamic proliferating
pseudostratified epithelium. To investigate how progenitor proliferation and differentiation
affect cell arrangement and growth of the neural tube, we used experimental measurements
to develop a mechanical model of the apical surface of the neuroepithelium that
incorporates the effect of interkinetic nuclear movement and spatially varying
rates of neuronal differentiation. Simulations predict that tissue growth and
the shape of lineage-related clones of cells differ with the rate of differentiation.
Growth is isotropic in regions of high differentiation, but dorsoventrally biased
in regions of low differentiation. This is consistent with experimental observations.
The absence of directional signalling in the simulations indicates that global
mechanical constraints are sufficient to explain the observed differences in anisotropy.
This provides insight into how the tissue growth rate affects cell dynamics and
growth anisotropy and opens up possibilities to study the coupling between mechanics,
pattern formation and growth in the neural tube.
article_number: dev176297
article_processing_charge: No
article_type: original
author:
- first_name: Pilar
full_name: Guerrero, Pilar
last_name: Guerrero
- first_name: Ruben
full_name: Perez-Carrasco, Ruben
last_name: Perez-Carrasco
- first_name: Marcin P
full_name: Zagórski, Marcin P
id: 343DA0DC-F248-11E8-B48F-1D18A9856A87
last_name: Zagórski
orcid: 0000-0001-7896-7762
- first_name: David
full_name: Page, David
last_name: Page
- first_name: Anna
full_name: Kicheva, Anna
id: 3959A2A0-F248-11E8-B48F-1D18A9856A87
last_name: Kicheva
orcid: 0000-0003-4509-4998
- first_name: James
full_name: Briscoe, James
last_name: Briscoe
- first_name: Karen M.
full_name: Page, Karen M.
last_name: Page
citation:
ama: Guerrero P, Perez-Carrasco R, Zagórski MP, et al. Neuronal differentiation
influences progenitor arrangement in the vertebrate neuroepithelium. Development.
2019;146(23). doi:10.1242/dev.176297
apa: Guerrero, P., Perez-Carrasco, R., Zagórski, M. P., Page, D., Kicheva, A., Briscoe,
J., & Page, K. M. (2019). Neuronal differentiation influences progenitor arrangement
in the vertebrate neuroepithelium. Development. The Company of Biologists.
https://doi.org/10.1242/dev.176297
chicago: Guerrero, Pilar, Ruben Perez-Carrasco, Marcin P Zagórski, David Page, Anna
Kicheva, James Briscoe, and Karen M. Page. “Neuronal Differentiation Influences
Progenitor Arrangement in the Vertebrate Neuroepithelium.” Development.
The Company of Biologists, 2019. https://doi.org/10.1242/dev.176297.
ieee: P. Guerrero et al., “Neuronal differentiation influences progenitor
arrangement in the vertebrate neuroepithelium,” Development, vol. 146,
no. 23. The Company of Biologists, 2019.
ista: Guerrero P, Perez-Carrasco R, Zagórski MP, Page D, Kicheva A, Briscoe J, Page
KM. 2019. Neuronal differentiation influences progenitor arrangement in the vertebrate
neuroepithelium. Development. 146(23), dev176297.
mla: Guerrero, Pilar, et al. “Neuronal Differentiation Influences Progenitor Arrangement
in the Vertebrate Neuroepithelium.” Development, vol. 146, no. 23, dev176297,
The Company of Biologists, 2019, doi:10.1242/dev.176297.
short: P. Guerrero, R. Perez-Carrasco, M.P. Zagórski, D. Page, A. Kicheva, J. Briscoe,
K.M. Page, Development 146 (2019).
date_created: 2019-12-10T14:39:50Z
date_published: 2019-12-04T00:00:00Z
date_updated: 2023-09-06T11:26:36Z
day: '04'
ddc:
- '570'
department:
- _id: AnKi
doi: 10.1242/dev.176297
ec_funded: 1
external_id:
isi:
- '000507575700004'
pmid:
- '31784457'
file:
- access_level: open_access
checksum: b6533c37dc8fbd803ffeca216e0a8b8a
content_type: application/pdf
creator: dernst
date_created: 2019-12-13T07:34:06Z
date_updated: 2020-07-14T12:47:50Z
file_id: '7177'
file_name: 2019_Development_Guerrero.pdf
file_size: 7797881
relation: main_file
file_date_updated: 2020-07-14T12:47:50Z
has_accepted_license: '1'
intvolume: ' 146'
isi: 1
issue: '23'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: B6FC0238-B512-11E9-945C-1524E6697425
call_identifier: H2020
grant_number: '680037'
name: Coordination of Patterning And Growth In the Spinal Cord
publication: Development
publication_identifier:
eissn:
- 1477-9129
issn:
- 0950-1991
publication_status: published
publisher: The Company of Biologists
quality_controlled: '1'
scopus_import: '1'
status: public
title: Neuronal differentiation influences progenitor arrangement in the vertebrate
neuroepithelium
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 146
year: '2019'
...
---
_id: '7171'
abstract:
- lang: ger
text: "Wissen Sie, was sich hinter künstlicher Intelligenz und maschinellem Lernen
verbirgt? \r\nDieses Sachbuch erklärt Ihnen leicht verständlich und ohne komplizierte
Formeln die grundlegenden Methoden und Vorgehensweisen des maschinellen Lernens.
Mathematisches Vorwissen ist dafür nicht nötig. Kurzweilig und informativ illustriert
Lisa, die Protagonistin des Buches, diese anhand von Alltagssituationen. \r\nEin
Buch für alle, die in Diskussionen über Chancen und Risiken der aktuellen Entwicklung
der künstlichen Intelligenz und des maschinellen Lernens mit Faktenwissen punkten
möchten. Auch für Schülerinnen und Schüler geeignet!"
article_processing_charge: No
citation:
ama: 'Kersting K, Lampert C, Rothkopf C, eds. Wie Maschinen Lernen: Künstliche
Intelligenz Verständlich Erklärt. 1st ed. Wiesbaden: Springer Nature; 2019.
doi:10.1007/978-3-658-26763-6'
apa: 'Kersting, K., Lampert, C., & Rothkopf, C. (Eds.). (2019). Wie Maschinen
Lernen: Künstliche Intelligenz Verständlich Erklärt (1st ed.). Wiesbaden:
Springer Nature. https://doi.org/10.1007/978-3-658-26763-6'
chicago: 'Kersting, Kristian, Christoph Lampert, and Constantin Rothkopf, eds. Wie
Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt. 1st ed. Wiesbaden:
Springer Nature, 2019. https://doi.org/10.1007/978-3-658-26763-6.'
ieee: 'K. Kersting, C. Lampert, and C. Rothkopf, Eds., Wie Maschinen Lernen:
Künstliche Intelligenz Verständlich Erklärt, 1st ed. Wiesbaden: Springer Nature,
2019.'
ista: 'Kersting K, Lampert C, Rothkopf C eds. 2019. Wie Maschinen Lernen: Künstliche
Intelligenz Verständlich Erklärt 1st ed., Wiesbaden: Springer Nature, XIV, 245p.'
mla: 'Kersting, Kristian, et al., editors. Wie Maschinen Lernen: Künstliche Intelligenz
Verständlich Erklärt. 1st ed., Springer Nature, 2019, doi:10.1007/978-3-658-26763-6.'
short: 'K. Kersting, C. Lampert, C. Rothkopf, eds., Wie Maschinen Lernen: Künstliche
Intelligenz Verständlich Erklärt, 1st ed., Springer Nature, Wiesbaden, 2019.'
date_created: 2019-12-11T14:15:56Z
date_published: 2019-10-30T00:00:00Z
date_updated: 2021-12-22T14:40:58Z
day: '30'
department:
- _id: ChLa
doi: 10.1007/978-3-658-26763-6
edition: '1'
editor:
- first_name: Kristian
full_name: Kersting, Kristian
last_name: Kersting
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
- first_name: Constantin
full_name: Rothkopf, Constantin
last_name: Rothkopf
language:
- iso: ger
month: '10'
oa_version: None
page: XIV, 245
place: Wiesbaden
publication_identifier:
eisbn:
- 978-3-658-26763-6
isbn:
- 978-3-658-26762-9
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- description: News on IST Website
relation: press_release
url: https://ist.ac.at/en/news/book-release-how-machines-learn/
status: public
title: 'Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt'
type: book_editor
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2019'
...