---
_id: '6354'
abstract:
- lang: eng
text: Blood platelets are critical for hemostasis and thrombosis, but also play
diverse roles during immune responses. We have recently reported that platelets
migrate at sites of infection in vitro and in vivo. Importantly, platelets use
their ability to migrate to collect and bundle fibrin (ogen)-bound bacteria accomplishing
efficient intravascular bacterial trapping. Here, we describe a method that allows
analyzing platelet migration in vitro, focusing on their ability to collect bacteria
and trap bacteria under flow.
acknowledgement: ' FöFoLe project 947 (F.G.), the Friedrich-Baur-Stiftung project
41/16 (F.G.)'
article_number: e3018
author:
- first_name: Shuxia
full_name: Fan, Shuxia
last_name: Fan
- first_name: Michael
full_name: Lorenz, Michael
last_name: Lorenz
- first_name: Steffen
full_name: Massberg, Steffen
last_name: Massberg
- first_name: Florian R
full_name: Gärtner, Florian R
id: 397A88EE-F248-11E8-B48F-1D18A9856A87
last_name: Gärtner
orcid: 0000-0001-6120-3723
citation:
ama: Fan S, Lorenz M, Massberg S, Gärtner FR. Platelet migration and bacterial trapping
assay under flow. Bio-Protocol. 2018;8(18). doi:10.21769/bioprotoc.3018
apa: Fan, S., Lorenz, M., Massberg, S., & Gärtner, F. R. (2018). Platelet migration
and bacterial trapping assay under flow. Bio-Protocol. Bio-Protocol. https://doi.org/10.21769/bioprotoc.3018
chicago: Fan, Shuxia, Michael Lorenz, Steffen Massberg, and Florian R Gärtner. “Platelet
Migration and Bacterial Trapping Assay under Flow.” Bio-Protocol. Bio-Protocol,
2018. https://doi.org/10.21769/bioprotoc.3018.
ieee: S. Fan, M. Lorenz, S. Massberg, and F. R. Gärtner, “Platelet migration and
bacterial trapping assay under flow,” Bio-Protocol, vol. 8, no. 18. Bio-Protocol,
2018.
ista: Fan S, Lorenz M, Massberg S, Gärtner FR. 2018. Platelet migration and bacterial
trapping assay under flow. Bio-Protocol. 8(18), e3018.
mla: Fan, Shuxia, et al. “Platelet Migration and Bacterial Trapping Assay under
Flow.” Bio-Protocol, vol. 8, no. 18, e3018, Bio-Protocol, 2018, doi:10.21769/bioprotoc.3018.
short: S. Fan, M. Lorenz, S. Massberg, F.R. Gärtner, Bio-Protocol 8 (2018).
date_created: 2019-04-29T09:40:33Z
date_published: 2018-09-20T00:00:00Z
date_updated: 2021-01-12T08:07:12Z
day: '20'
ddc:
- '570'
department:
- _id: MiSi
doi: 10.21769/bioprotoc.3018
ec_funded: 1
file:
- access_level: open_access
checksum: d4588377e789da7f360b553ae02c5119
content_type: application/pdf
creator: dernst
date_created: 2019-04-30T08:04:33Z
date_updated: 2020-07-14T12:47:28Z
file_id: '6360'
file_name: 2018_BioProtocol_Fan.pdf
file_size: 2928337
relation: main_file
file_date_updated: 2020-07-14T12:47:28Z
has_accepted_license: '1'
intvolume: ' 8'
issue: '18'
keyword:
- Platelets
- Cell migration
- Bacteria
- Shear flow
- Fibrinogen
- E. coli
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 260AA4E2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '747687'
name: Mechanical Adaptation of Lamellipodial Actin Networks in Migrating Cells
publication: Bio-Protocol
publication_identifier:
issn:
- 2331-8325
publication_status: published
publisher: Bio-Protocol
quality_controlled: '1'
status: public
title: Platelet migration and bacterial trapping assay under flow
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2018'
...
---
_id: '6459'
author:
- first_name: Barbara
full_name: Petritsch, Barbara
id: 406048EC-F248-11E8-B48F-1D18A9856A87
last_name: Petritsch
orcid: 0000-0003-2724-4614
citation:
ama: Petritsch B. Open Access at IST Austria 2009-2017. IST Austria; 2018.
doi:10.5281/zenodo.1410279
apa: 'Petritsch, B. (2018). Open Access at IST Austria 2009-2017. Presented
at the Open-Access-Tage, Graz, Austria: IST Austria. https://doi.org/10.5281/zenodo.1410279'
chicago: Petritsch, Barbara. Open Access at IST Austria 2009-2017. IST Austria,
2018. https://doi.org/10.5281/zenodo.1410279.
ieee: B. Petritsch, Open Access at IST Austria 2009-2017. IST Austria, 2018.
ista: Petritsch B. 2018. Open Access at IST Austria 2009-2017, IST Austria,p.
mla: Petritsch, Barbara. Open Access at IST Austria 2009-2017. IST Austria,
2018, doi:10.5281/zenodo.1410279.
short: B. Petritsch, Open Access at IST Austria 2009-2017, IST Austria, 2018.
conference:
end_date: 2018-09-26
location: Graz, Austria
name: Open-Access-Tage
start_date: 2018-09-24
date_created: 2019-05-16T07:27:14Z
date_published: 2018-09-24T00:00:00Z
date_updated: 2020-07-14T23:06:21Z
day: '24'
ddc:
- '020'
department:
- _id: E-Lib
doi: 10.5281/zenodo.1410279
file:
- access_level: open_access
checksum: 9063ab4d10ea93353c3a03bbf53fbcf1
content_type: application/pdf
creator: dernst
date_created: 2019-05-16T07:26:25Z
date_updated: 2020-07-14T12:47:30Z
file_id: '6460'
file_name: Poster_Beitrag_125_Petritsch.pdf
file_size: 1967778
relation: main_file
file_date_updated: 2020-07-14T12:47:30Z
has_accepted_license: '1'
keyword:
- Open Access
- Publication Analysis
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
publication_status: published
publisher: IST Austria
status: public
title: Open Access at IST Austria 2009-2017
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_poster
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '690'
abstract:
- lang: eng
text: We consider spectral properties and the edge universality of sparse random
matrices, the class of random matrices that includes the adjacency matrices of
the Erdős–Rényi graph model G(N, p). We prove a local law for the eigenvalue density
up to the spectral edges. Under a suitable condition on the sparsity, we also
prove that the rescaled extremal eigenvalues exhibit GOE Tracy–Widom fluctuations
if a deterministic shift of the spectral edge due to the sparsity is included.
For the adjacency matrix of the Erdős–Rényi graph this establishes the Tracy–Widom
fluctuations of the second largest eigenvalue when p is much larger than N−2/3
with a deterministic shift of order (Np)−1.
article_number: 543-616
author:
- first_name: Jii
full_name: Lee, Jii
last_name: Lee
- first_name: Kevin
full_name: Schnelli, Kevin
id: 434AD0AE-F248-11E8-B48F-1D18A9856A87
last_name: Schnelli
orcid: 0000-0003-0954-3231
citation:
ama: Lee J, Schnelli K. Local law and Tracy–Widom limit for sparse random matrices.
Probability Theory and Related Fields. 2018;171(1-2). doi:10.1007/s00440-017-0787-8
apa: Lee, J., & Schnelli, K. (2018). Local law and Tracy–Widom limit for sparse
random matrices. Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-017-0787-8
chicago: Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse
Random Matrices.” Probability Theory and Related Fields. Springer, 2018.
https://doi.org/10.1007/s00440-017-0787-8.
ieee: J. Lee and K. Schnelli, “Local law and Tracy–Widom limit for sparse random
matrices,” Probability Theory and Related Fields, vol. 171, no. 1–2. Springer,
2018.
ista: Lee J, Schnelli K. 2018. Local law and Tracy–Widom limit for sparse random
matrices. Probability Theory and Related Fields. 171(1–2), 543–616.
mla: Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse Random
Matrices.” Probability Theory and Related Fields, vol. 171, no. 1–2, 543–616,
Springer, 2018, doi:10.1007/s00440-017-0787-8.
short: J. Lee, K. Schnelli, Probability Theory and Related Fields 171 (2018).
date_created: 2018-12-11T11:47:56Z
date_published: 2018-06-14T00:00:00Z
date_updated: 2021-01-12T08:09:33Z
day: '14'
department:
- _id: LaEr
doi: 10.1007/s00440-017-0787-8
ec_funded: 1
external_id:
arxiv:
- '1605.08767'
intvolume: ' 171'
issue: 1-2
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1605.08767
month: '06'
oa: 1
oa_version: Preprint
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Probability Theory and Related Fields
publication_status: published
publisher: Springer
publist_id: '7017'
quality_controlled: '1'
scopus_import: 1
status: public
title: Local law and Tracy–Widom limit for sparse random matrices
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 171
year: '2018'
...
---
_id: '703'
abstract:
- lang: eng
text: We consider the NP-hard problem of MAP-inference for undirected discrete graphical
models. We propose a polynomial time and practically efficient algorithm for finding
a part of its optimal solution. Specifically, our algorithm marks some labels
of the considered graphical model either as (i) optimal, meaning that they belong
to all optimal solutions of the inference problem; (ii) non-optimal if they provably
do not belong to any solution. With access to an exact solver of a linear programming
relaxation to the MAP-inference problem, our algorithm marks the maximal possible
(in a specified sense) number of labels. We also present a version of the algorithm,
which has access to a suboptimal dual solver only and still can ensure the (non-)optimality
for the marked labels, although the overall number of the marked labels may decrease.
We propose an efficient implementation, which runs in time comparable to a single
run of a suboptimal dual solver. Our method is well-scalable and shows state-of-the-art
results on computational benchmarks from machine learning and computer vision.
author:
- first_name: Alexander
full_name: Shekhovtsov, Alexander
last_name: Shekhovtsov
- first_name: Paul
full_name: Swoboda, Paul
id: 446560C6-F248-11E8-B48F-1D18A9856A87
last_name: Swoboda
- first_name: Bogdan
full_name: Savchynskyy, Bogdan
last_name: Savchynskyy
citation:
ama: Shekhovtsov A, Swoboda P, Savchynskyy B. Maximum persistency via iterative
relaxed inference with graphical models. IEEE Transactions on Pattern Analysis
and Machine Intelligence. 2018;40(7):1668-1682. doi:10.1109/TPAMI.2017.2730884
apa: Shekhovtsov, A., Swoboda, P., & Savchynskyy, B. (2018). Maximum persistency
via iterative relaxed inference with graphical models. IEEE Transactions on
Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2017.2730884
chicago: Shekhovtsov, Alexander, Paul Swoboda, and Bogdan Savchynskyy. “Maximum
Persistency via Iterative Relaxed Inference with Graphical Models.” IEEE Transactions
on Pattern Analysis and Machine Intelligence. IEEE, 2018. https://doi.org/10.1109/TPAMI.2017.2730884.
ieee: A. Shekhovtsov, P. Swoboda, and B. Savchynskyy, “Maximum persistency via iterative
relaxed inference with graphical models,” IEEE Transactions on Pattern Analysis
and Machine Intelligence, vol. 40, no. 7. IEEE, pp. 1668–1682, 2018.
ista: Shekhovtsov A, Swoboda P, Savchynskyy B. 2018. Maximum persistency via iterative
relaxed inference with graphical models. IEEE Transactions on Pattern Analysis
and Machine Intelligence. 40(7), 1668–1682.
mla: Shekhovtsov, Alexander, et al. “Maximum Persistency via Iterative Relaxed Inference
with Graphical Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence,
vol. 40, no. 7, IEEE, 2018, pp. 1668–82, doi:10.1109/TPAMI.2017.2730884.
short: A. Shekhovtsov, P. Swoboda, B. Savchynskyy, IEEE Transactions on Pattern
Analysis and Machine Intelligence 40 (2018) 1668–1682.
date_created: 2018-12-11T11:48:01Z
date_published: 2018-07-01T00:00:00Z
date_updated: 2021-01-12T08:11:32Z
day: '01'
department:
- _id: VlKo
doi: 10.1109/TPAMI.2017.2730884
external_id:
arxiv:
- '1508.07902'
intvolume: ' 40'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1508.07902
month: '07'
oa: 1
oa_version: Preprint
page: 1668-1682
publication: IEEE Transactions on Pattern Analysis and Machine Intelligence
publication_identifier:
issn:
- '01628828'
publication_status: published
publisher: IEEE
publist_id: '6992'
quality_controlled: '1'
scopus_import: 1
status: public
title: Maximum persistency via iterative relaxed inference with graphical models
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 40
year: '2018'
...
---
_id: '7116'
abstract:
- lang: eng
text: 'Training deep learning models has received tremendous research interest recently.
In particular, there has been intensive research on reducing the communication
cost of training when using multiple computational devices, through reducing the
precision of the underlying data representation. Naturally, such methods induce
system trade-offs—lowering communication precision could de-crease communication
overheads and improve scalability; but, on the other hand, it can also reduce
the accuracy of training. In this paper, we study this trade-off space, and ask:Can
low-precision communication consistently improve the end-to-end performance of
training modern neural networks, with no accuracy loss?From the performance point
of view, the answer to this question may appear deceptively easy: compressing
communication through low precision should help when the ratio between communication
and computation is high. However, this answer is less straightforward when we
try to generalize this principle across various neural network architectures (e.g.,
AlexNet vs. ResNet),number of GPUs (e.g., 2 vs. 8 GPUs), machine configurations(e.g.,
EC2 instances vs. NVIDIA DGX-1), communication primitives (e.g., MPI vs. NCCL),
and even different GPU architectures(e.g., Kepler vs. Pascal). Currently, it is
not clear how a realistic realization of all these factors maps to the speed up
provided by low-precision communication. In this paper, we conduct an empirical
study to answer this question and report the insights.'
article_processing_charge: No
author:
- first_name: Demjan
full_name: Grubic, Demjan
last_name: Grubic
- first_name: Leo
full_name: Tam, Leo
last_name: Tam
- 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: Ce
full_name: Zhang, Ce
last_name: Zhang
citation:
ama: 'Grubic D, Tam L, Alistarh D-A, Zhang C. Synchronous multi-GPU training for
deep learning with low-precision communications: An empirical study. In: Proceedings
of the 21st International Conference on Extending Database Technology. OpenProceedings;
2018:145-156. doi:10.5441/002/EDBT.2018.14'
apa: 'Grubic, D., Tam, L., Alistarh, D.-A., & Zhang, C. (2018). Synchronous
multi-GPU training for deep learning with low-precision communications: An empirical
study. In Proceedings of the 21st International Conference on Extending Database
Technology (pp. 145–156). Vienna, Austria: OpenProceedings. https://doi.org/10.5441/002/EDBT.2018.14'
chicago: 'Grubic, Demjan, Leo Tam, Dan-Adrian Alistarh, and Ce Zhang. “Synchronous
Multi-GPU Training for Deep Learning with Low-Precision Communications: An Empirical
Study.” In Proceedings of the 21st International Conference on Extending Database
Technology, 145–56. OpenProceedings, 2018. https://doi.org/10.5441/002/EDBT.2018.14.'
ieee: 'D. Grubic, L. Tam, D.-A. Alistarh, and C. Zhang, “Synchronous multi-GPU training
for deep learning with low-precision communications: An empirical study,” in Proceedings
of the 21st International Conference on Extending Database Technology, Vienna,
Austria, 2018, pp. 145–156.'
ista: 'Grubic D, Tam L, Alistarh D-A, Zhang C. 2018. Synchronous multi-GPU training
for deep learning with low-precision communications: An empirical study. Proceedings
of the 21st International Conference on Extending Database Technology. EDBT: Conference
on Extending Database Technology, 145–156.'
mla: 'Grubic, Demjan, et al. “Synchronous Multi-GPU Training for Deep Learning with
Low-Precision Communications: An Empirical Study.” Proceedings of the 21st
International Conference on Extending Database Technology, OpenProceedings,
2018, pp. 145–56, doi:10.5441/002/EDBT.2018.14.'
short: D. Grubic, L. Tam, D.-A. Alistarh, C. Zhang, in:, Proceedings of the 21st
International Conference on Extending Database Technology, OpenProceedings, 2018,
pp. 145–156.
conference:
end_date: 2018-03-29
location: Vienna, Austria
name: 'EDBT: Conference on Extending Database Technology'
start_date: 2018-03-26
date_created: 2019-11-26T14:19:11Z
date_published: 2018-03-26T00:00:00Z
date_updated: 2023-02-23T12:59:17Z
day: '26'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.5441/002/EDBT.2018.14
file:
- access_level: open_access
checksum: ec979b56abc71016d6e6adfdadbb4afe
content_type: application/pdf
creator: dernst
date_created: 2019-11-26T14:23:04Z
date_updated: 2020-07-14T12:47:49Z
file_id: '7118'
file_name: 2018_OpenProceedings_Grubic.pdf
file_size: 1603204
relation: main_file
file_date_updated: 2020-07-14T12:47:49Z
has_accepted_license: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 145-156
publication: Proceedings of the 21st International Conference on Extending Database
Technology
publication_identifier:
isbn:
- '9783893180783'
issn:
- 2367-2005
publication_status: published
publisher: OpenProceedings
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Synchronous multi-GPU training for deep learning with low-precision communications:
An empirical study'
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: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '7407'
abstract:
- lang: eng
text: 'Proofs of space (PoS) [Dziembowski et al., CRYPTO''15] are proof systems
where a prover can convince a verifier that he "wastes" disk space. PoS were introduced
as a more ecological and economical replacement for proofs of work which are currently
used to secure blockchains like Bitcoin. In this work we investigate extensions
of PoS which allow the prover to embed useful data into the dedicated space, which
later can be recovered. Our first contribution is a security proof for the original
PoS from CRYPTO''15 in the random oracle model (the original proof only applied
to a restricted class of adversaries which can store a subset of the data an honest
prover would store). When this PoS is instantiated with recent constructions of
maximally depth robust graphs, our proof implies basically optimal security. As
a second contribution we show three different extensions of this PoS where useful
data can be embedded into the space required by the prover. Our security proof
for the PoS extends (non-trivially) to these constructions. We discuss how some
of these variants can be used as proofs of catalytic space (PoCS), a notion we
put forward in this work, and which basically is a PoS where most of the space
required by the prover can be used to backup useful data. Finally we discuss how
one of the extensions is a candidate construction for a proof of replication (PoR),
a proof system recently suggested in the Filecoin whitepaper. '
alternative_title:
- LIPIcs
article_processing_charge: No
author:
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Pietrzak KZ. Proofs of catalytic space. In: 10th Innovations in Theoretical
Computer Science Conference (ITCS 2019). Vol 124. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2018:59:1-59:25. doi:10.4230/LIPICS.ITCS.2019.59'
apa: 'Pietrzak, K. Z. (2018). Proofs of catalytic space. In 10th Innovations
in Theoretical Computer Science Conference (ITCS 2019) (Vol. 124, p. 59:1-59:25).
San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPICS.ITCS.2019.59'
chicago: Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” In 10th Innovations
in Theoretical Computer Science Conference (ITCS 2019), 124:59:1-59:25. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.ITCS.2019.59.
ieee: K. Z. Pietrzak, “Proofs of catalytic space,” in 10th Innovations in Theoretical
Computer Science Conference (ITCS 2019), San Diego, CA, United States, 2018,
vol. 124, p. 59:1-59:25.
ista: 'Pietrzak KZ. 2018. Proofs of catalytic space. 10th Innovations in Theoretical
Computer Science Conference (ITCS 2019). ITCS: Innovations in theoretical Computer
Science Conference, LIPIcs, vol. 124, 59:1-59:25.'
mla: Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” 10th Innovations in
Theoretical Computer Science Conference (ITCS 2019), vol. 124, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25, doi:10.4230/LIPICS.ITCS.2019.59.
short: K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference
(ITCS 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25.
conference:
end_date: 2019-01-12
location: San Diego, CA, United States
name: 'ITCS: Innovations in theoretical Computer Science Conference'
start_date: 2019-01-10
date_created: 2020-01-30T09:16:05Z
date_published: 2018-12-31T00:00:00Z
date_updated: 2021-01-12T08:13:26Z
day: '31'
ddc:
- '000'
department:
- _id: KrPi
doi: 10.4230/LIPICS.ITCS.2019.59
ec_funded: 1
file:
- access_level: open_access
checksum: 5cebb7f7849a3beda898f697d755dd96
content_type: application/pdf
creator: dernst
date_created: 2020-02-04T08:17:52Z
date_updated: 2020-07-14T12:47:57Z
file_id: '7443'
file_name: 2018_LIPIcs_Pietrzak.pdf
file_size: 822884
relation: main_file
file_date_updated: 2020-07-14T12:47:57Z
has_accepted_license: '1'
intvolume: ' 124'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2018/194
month: '12'
oa: 1
oa_version: Published Version
page: 59:1-59:25
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: 10th Innovations in Theoretical Computer Science Conference (ITCS 2019)
publication_identifier:
isbn:
- 978-3-95977-095-8
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: 1
status: public
title: Proofs of catalytic space
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 124
year: '2018'
...
---
_id: '7812'
abstract:
- lang: eng
text: Deep neural networks (DNNs) continue to make significant advances, solving
tasks from image classification to translation or reinforcement learning. One
aspect of the field receiving considerable attention is efficiently executing
deep models in resource-constrained environments, such as mobile or embedded devices.
This paper focuses on this problem, and proposes two new compression methods,
which jointly leverage weight quantization and distillation of larger teacher
networks into smaller student networks. The first method we propose is called
quantized distillation and leverages distillation during the training process,
by incorporating distillation loss, expressed with respect to the teacher, into
the training of a student network whose weights are quantized to a limited set
of levels. The second method, differentiable quantization, optimizes the location
of quantization points through stochastic gradient descent, to better fit the
behavior of the teacher model. We validate both methods through experiments on
convolutional and recurrent architectures. We show that quantized shallow students
can reach similar accuracy levels to full-precision teacher models, while providing
order of magnitude compression, and inference speedup that is linear in the depth
reduction. In sum, our results enable DNNs for resource-constrained environments
to leverage architecture and accuracy advances developed on more powerful devices.
article_processing_charge: No
author:
- first_name: Antonio
full_name: Polino, Antonio
last_name: Polino
- first_name: Razvan
full_name: Pascanu, Razvan
last_name: Pascanu
- 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: 'Polino A, Pascanu R, Alistarh D-A. Model compression via distillation and
quantization. In: 6th International Conference on Learning Representations.
; 2018.'
apa: Polino, A., Pascanu, R., & Alistarh, D.-A. (2018). Model compression via
distillation and quantization. In 6th International Conference on Learning
Representations. Vancouver, Canada.
chicago: Polino, Antonio, Razvan Pascanu, and Dan-Adrian Alistarh. “Model Compression
via Distillation and Quantization.” In 6th International Conference on Learning
Representations, 2018.
ieee: A. Polino, R. Pascanu, and D.-A. Alistarh, “Model compression via distillation
and quantization,” in 6th International Conference on Learning Representations,
Vancouver, Canada, 2018.
ista: 'Polino A, Pascanu R, Alistarh D-A. 2018. Model compression via distillation
and quantization. 6th International Conference on Learning Representations. ICLR:
International Conference on Learning Representations.'
mla: Polino, Antonio, et al. “Model Compression via Distillation and Quantization.”
6th International Conference on Learning Representations, 2018.
short: A. Polino, R. Pascanu, D.-A. Alistarh, in:, 6th International Conference
on Learning Representations, 2018.
conference:
end_date: 2018-05-03
location: Vancouver, Canada
name: 'ICLR: International Conference on Learning Representations'
start_date: 2018-04-30
date_created: 2020-05-10T22:00:51Z
date_published: 2018-05-01T00:00:00Z
date_updated: 2023-02-23T13:18:41Z
day: '01'
ddc:
- '000'
department:
- _id: DaAl
external_id:
arxiv:
- '1802.05668'
file:
- access_level: open_access
checksum: a4336c167978e81891970e4e4517a8c3
content_type: application/pdf
creator: dernst
date_created: 2020-05-26T13:02:00Z
date_updated: 2020-07-14T12:48:03Z
file_id: '7894'
file_name: 2018_ICLR_Polino.pdf
file_size: 308339
relation: main_file
file_date_updated: 2020-07-14T12:48:03Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
publication: 6th International Conference on Learning Representations
publication_status: published
quality_controlled: '1'
scopus_import: 1
status: public
title: Model compression via distillation and quantization
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '8547'
abstract:
- lang: eng
text: The cerebral cortex contains multiple hierarchically organized areas with
distinctive cytoarchitectonical patterns, but the cellular mechanisms underlying
the emergence of this diversity remain unclear. Here, we have quantitatively investigated
the neuronal output of individual progenitor cells in the ventricular zone of
the developing mouse neocortex using a combination of methods that together circumvent
the biases and limitations of individual approaches. We found that individual
cortical progenitor cells show a high degree of stochasticity and generate pyramidal
cell lineages that adopt a wide range of laminar configurations. Mathematical
modelling these lineage data suggests that a small number of progenitor cell populations,
each generating pyramidal cells following different stochastic developmental programs,
suffice to generate the heterogenous complement of pyramidal cell lineages that
collectively build the complex cytoarchitecture of the neocortex.
acknowledgement: We thank I. Andrew and S.E. Bae for excellent technical assistance,
F. Gage for plasmids, and K. Nave (Nex-Cre) for mouse colonies. We thank members
of the Marín and Rico laboratories for stimulating discussions and ideas. Our research
on this topic is supported by grants from the European Research Council (ERC-2017-AdG
787355 to O.M and ERC2016-CoG 725780 to S.H.) and Wellcome Trust (103714MA) to O.M.
L.L. was the recipient of an EMBO long-term postdoctoral fellowship, R.B. received
support from FWF Lise-Meitner program (M 2416) and F.K.W. was supported by an EMBO
postdoctoral fellowship and is currently a Marie Skłodowska-Curie Fellow from the
European Commission under the H2020 Programme.
article_processing_charge: No
author:
- first_name: Alfredo
full_name: Llorca, Alfredo
last_name: Llorca
- first_name: Gabriele
full_name: Ciceri, Gabriele
last_name: Ciceri
- first_name: Robert J
full_name: Beattie, Robert J
id: 2E26DF60-F248-11E8-B48F-1D18A9856A87
last_name: Beattie
orcid: 0000-0002-8483-8753
- first_name: Fong K.
full_name: Wong, Fong K.
last_name: Wong
- first_name: Giovanni
full_name: Diana, Giovanni
last_name: Diana
- first_name: Eleni
full_name: Serafeimidou, Eleni
last_name: Serafeimidou
- first_name: Marian
full_name: Fernández-Otero, Marian
last_name: Fernández-Otero
- first_name: Carmen
full_name: Streicher, Carmen
id: 36BCB99C-F248-11E8-B48F-1D18A9856A87
last_name: Streicher
- first_name: Sebastian J.
full_name: Arnold, Sebastian J.
last_name: Arnold
- first_name: Martin
full_name: Meyer, Martin
last_name: Meyer
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
- first_name: Miguel
full_name: Maravall, Miguel
last_name: Maravall
- first_name: Oscar
full_name: Marín, Oscar
last_name: Marín
citation:
ama: Llorca A, Ciceri G, Beattie RJ, et al. Heterogeneous progenitor cell behaviors
underlie the assembly of neocortical cytoarchitecture. bioRxiv. doi:10.1101/494088
apa: Llorca, A., Ciceri, G., Beattie, R. J., Wong, F. K., Diana, G., Serafeimidou,
E., … Marín, O. (n.d.). Heterogeneous progenitor cell behaviors underlie the assembly
of neocortical cytoarchitecture. bioRxiv. Cold Spring Harbor Laboratory.
https://doi.org/10.1101/494088
chicago: Llorca, Alfredo, Gabriele Ciceri, Robert J Beattie, Fong K. Wong, Giovanni
Diana, Eleni Serafeimidou, Marian Fernández-Otero, et al. “Heterogeneous Progenitor
Cell Behaviors Underlie the Assembly of Neocortical Cytoarchitecture.” BioRxiv.
Cold Spring Harbor Laboratory, n.d. https://doi.org/10.1101/494088.
ieee: A. Llorca et al., “Heterogeneous progenitor cell behaviors underlie
the assembly of neocortical cytoarchitecture,” bioRxiv. Cold Spring Harbor
Laboratory.
ista: Llorca A, Ciceri G, Beattie RJ, Wong FK, Diana G, Serafeimidou E, Fernández-Otero
M, Streicher C, Arnold SJ, Meyer M, Hippenmeyer S, Maravall M, Marín O. Heterogeneous
progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture.
bioRxiv, 10.1101/494088.
mla: Llorca, Alfredo, et al. “Heterogeneous Progenitor Cell Behaviors Underlie the
Assembly of Neocortical Cytoarchitecture.” BioRxiv, Cold Spring Harbor
Laboratory, doi:10.1101/494088.
short: A. Llorca, G. Ciceri, R.J. Beattie, F.K. Wong, G. Diana, E. Serafeimidou,
M. Fernández-Otero, C. Streicher, S.J. Arnold, M. Meyer, S. Hippenmeyer, M. Maravall,
O. Marín, BioRxiv (n.d.).
date_created: 2020-09-21T12:01:50Z
date_published: 2018-12-13T00:00:00Z
date_updated: 2021-01-12T08:20:00Z
day: '13'
department:
- _id: SiHi
doi: 10.1101/494088
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1101/494088
month: '12'
oa: 1
oa_version: Preprint
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: 264E56E2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02416
name: Molecular Mechanisms Regulating Gliogenesis in the Cerebral Cortex
publication: bioRxiv
publication_status: submitted
publisher: Cold Spring Harbor Laboratory
status: public
title: Heterogeneous progenitor cell behaviors underlie the assembly of neocortical
cytoarchitecture
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '86'
abstract:
- lang: eng
text: Responsiveness—the requirement that every request to a system be eventually
handled—is one of the fundamental liveness properties of a reactive system. Average
response time is a quantitative measure for the responsiveness requirement used
commonly in performance evaluation. We show how average response time can be computed
on state-transition graphs, on Markov chains, and on game graphs. In all three
cases, we give polynomial-time algorithms.
acknowledgement: 'This research was supported in part by the Austrian Science Fund
(FWF) under grants S11402-N23, S11407-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein
Award), ERC Start grant (279307: Graph Games), Vienna Science and Technology Fund
(WWTF) through project ICT15-003 and by the National Science Centre (NCN), Poland
under grant 2014/15/D/ST6/04543.'
alternative_title:
- LNCS
author:
- 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: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: 'Chatterjee K, Henzinger TA, Otop J. Computing average response time. In: Lohstroh
M, Derler P, Sirjani M, eds. Principles of Modeling. Vol 10760. Springer;
2018:143-161. doi:10.1007/978-3-319-95246-8_9'
apa: Chatterjee, K., Henzinger, T. A., & Otop, J. (2018). Computing average
response time. In M. Lohstroh, P. Derler, & M. Sirjani (Eds.), Principles
of Modeling (Vol. 10760, pp. 143–161). Springer. https://doi.org/10.1007/978-3-319-95246-8_9
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Computing Average
Response Time.” In Principles of Modeling, edited by Marten Lohstroh, Patricia
Derler, and Marjan Sirjani, 10760:143–61. Springer, 2018. https://doi.org/10.1007/978-3-319-95246-8_9.
ieee: K. Chatterjee, T. A. Henzinger, and J. Otop, “Computing average response time,”
in Principles of Modeling, vol. 10760, M. Lohstroh, P. Derler, and M. Sirjani,
Eds. Springer, 2018, pp. 143–161.
ista: 'Chatterjee K, Henzinger TA, Otop J. 2018.Computing average response time.
In: Principles of Modeling. LNCS, vol. 10760, 143–161.'
mla: Chatterjee, Krishnendu, et al. “Computing Average Response Time.” Principles
of Modeling, edited by Marten Lohstroh et al., vol. 10760, Springer, 2018,
pp. 143–61, doi:10.1007/978-3-319-95246-8_9.
short: K. Chatterjee, T.A. Henzinger, J. Otop, in:, M. Lohstroh, P. Derler, M. Sirjani
(Eds.), Principles of Modeling, Springer, 2018, pp. 143–161.
date_created: 2018-12-11T11:44:33Z
date_published: 2018-07-20T00:00:00Z
date_updated: 2021-01-12T08:20:14Z
day: '20'
ddc:
- '000'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-319-95246-8_9
ec_funded: 1
editor:
- first_name: Marten
full_name: Lohstroh, Marten
last_name: Lohstroh
- first_name: Patricia
full_name: Derler, Patricia
last_name: Derler
- first_name: Marjan
full_name: Sirjani, Marjan
last_name: Sirjani
file:
- access_level: open_access
checksum: 9995c6ce6957333baf616fc4f20be597
content_type: application/pdf
creator: dernst
date_created: 2019-11-19T08:22:18Z
date_updated: 2020-07-14T12:48:14Z
file_id: '7053'
file_name: 2018_PrinciplesModeling_Chatterjee.pdf
file_size: 516307
relation: main_file
file_date_updated: 2020-07-14T12:48:14Z
has_accepted_license: '1'
intvolume: ' 10760'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 143 - 161
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication: Principles of Modeling
publication_status: published
publisher: Springer
publist_id: '7968'
quality_controlled: '1'
scopus_import: 1
status: public
title: Computing average response time
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10760
year: '2018'
...
---
_id: '9229'
alternative_title:
- Molecular and cellular neuroscience
article_processing_charge: No
article_type: letter_note
author:
- first_name: Johann G
full_name: Danzl, Johann G
id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87
last_name: Danzl
orcid: 0000-0001-8559-3973
citation:
ama: Danzl JG. Diffraction-unlimited optical imaging for synaptic physiology. Opera
Medica et Physiologica. 2018;4(S1):11. doi:10.20388/omp2018.00s1.001
apa: Danzl, J. G. (2018). Diffraction-unlimited optical imaging for synaptic physiology.
Opera Medica et Physiologica. Lobachevsky State University of Nizhny Novgorod.
https://doi.org/10.20388/omp2018.00s1.001
chicago: Danzl, Johann G. “Diffraction-Unlimited Optical Imaging for Synaptic Physiology.”
Opera Medica et Physiologica. Lobachevsky State University of Nizhny Novgorod,
2018. https://doi.org/10.20388/omp2018.00s1.001.
ieee: J. G. Danzl, “Diffraction-unlimited optical imaging for synaptic physiology,”
Opera Medica et Physiologica, vol. 4, no. S1. Lobachevsky State University
of Nizhny Novgorod, p. 11, 2018.
ista: Danzl JG. 2018. Diffraction-unlimited optical imaging for synaptic physiology.
Opera Medica et Physiologica. 4(S1), 11.
mla: Danzl, Johann G. “Diffraction-Unlimited Optical Imaging for Synaptic Physiology.”
Opera Medica et Physiologica, vol. 4, no. S1, Lobachevsky State University
of Nizhny Novgorod, 2018, p. 11, doi:10.20388/omp2018.00s1.001.
short: J.G. Danzl, Opera Medica et Physiologica 4 (2018) 11.
date_created: 2021-03-07T23:01:25Z
date_published: 2018-06-30T00:00:00Z
date_updated: 2021-12-03T07:31:05Z
day: '30'
department:
- _id: JoDa
doi: 10.20388/omp2018.00s1.001
intvolume: ' 4'
issue: S1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://operamedphys.org/content/molecular-and-cellular-neuroscience
month: '06'
oa: 1
oa_version: Published Version
page: '11'
publication: Opera Medica et Physiologica
publication_identifier:
eissn:
- 2500-2295
issn:
- 2500-2287
publication_status: published
publisher: Lobachevsky State University of Nizhny Novgorod
quality_controlled: '1'
scopus_import: '1'
status: public
title: Diffraction-unlimited optical imaging for synaptic physiology
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 4
year: '2018'
...
---
_id: '6005'
abstract:
- lang: eng
text: Network games are widely used as a model for selfish resource-allocation problems.
In the classicalmodel, each player selects a path connecting her source and target
vertices. The cost of traversingan edge depends on theload; namely, number of
players that traverse it. Thus, it abstracts the factthat different users may
use a resource at different times and for different durations, which playsan important
role in determining the costs of the users in reality. For example, when transmittingpackets
in a communication network, routing traffic in a road network, or processing a
task in aproduction system, actual sharing and congestion of resources crucially
depends on time.In [13], we introducedtimed network games, which add a time component
to network games.Each vertexvin the network is associated with a cost function,
mapping the load onvto theprice that a player pays for staying invfor one time
unit with this load. Each edge in thenetwork is guarded by the time intervals
in which it can be traversed, which forces the players tospend time in the vertices.
In this work we significantly extend the way time can be referred toin timed network
games. In the model we study, the network is equipped withclocks, and, as intimed
automata, edges are guarded by constraints on the values of the clocks, and their
traversalmay involve a reset of some clocks. We argue that the stronger model
captures many realisticnetworks. The addition of clocks breaks the techniques
we developed in [13] and we developnew techniques in order to show that positive
results on classic network games carry over to thestronger timed setting.
alternative_title:
- LIPIcs
article_number: '23'
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: Shibashis
full_name: Guha, Shibashis
last_name: Guha
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: 'Avni G, Guha S, Kupferman O. Timed network games with clocks. In: Vol 117.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPICS.MFCS.2018.23'
apa: 'Avni, G., Guha, S., & Kupferman, O. (2018). Timed network games with clocks
(Vol. 117). Presented at the MFCS: Mathematical Foundations of Computer Science,
Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPICS.MFCS.2018.23'
chicago: Avni, Guy, Shibashis Guha, and Orna Kupferman. “Timed Network Games with
Clocks,” Vol. 117. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.MFCS.2018.23.
ieee: 'G. Avni, S. Guha, and O. Kupferman, “Timed network games with clocks,” presented
at the MFCS: Mathematical Foundations of Computer Science, Liverpool, United Kingdom,
2018, vol. 117.'
ista: 'Avni G, Guha S, Kupferman O. 2018. Timed network games with clocks. MFCS:
Mathematical Foundations of Computer Science, LIPIcs, vol. 117, 23.'
mla: Avni, Guy, et al. Timed Network Games with Clocks. Vol. 117, 23, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.MFCS.2018.23.
short: G. Avni, S. Guha, O. Kupferman, in:, Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2018.
conference:
end_date: 2018-08-31
location: Liverpool, United Kingdom
name: 'MFCS: Mathematical Foundations of Computer Science'
start_date: 2018-08-27
date_created: 2019-02-14T14:12:09Z
date_published: 2018-08-01T00:00:00Z
date_updated: 2023-02-23T14:02:58Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.4230/LIPICS.MFCS.2018.23
file:
- access_level: open_access
checksum: 41ab2ae9b63f5eb49fa995250c0ba128
content_type: application/pdf
creator: dernst
date_created: 2019-02-14T14:22:04Z
date_updated: 2020-07-14T12:47:15Z
file_id: '6007'
file_name: 2018_LIPIcs_Avni.pdf
file_size: 542889
relation: main_file
file_date_updated: 2020-07-14T12:47:15Z
has_accepted_license: '1'
intvolume: ' 117'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
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
- _id: 264B3912-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02369
name: Formal Methods meets Algorithmic Game Theory
publication_identifier:
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '963'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Timed network games with clocks
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 117
year: '2018'
...
---
_id: '315'
abstract:
- lang: eng
text: 'More than 100 years after Grigg’s influential analysis of species’ borders,
the causes of limits to species’ ranges still represent a puzzle that has never
been understood with clarity. The topic has become especially important recently
as many scientists have become interested in the potential for species’ ranges
to shift in response to climate change—and yet nearly all of those studies fail
to recognise or incorporate evolutionary genetics in a way that relates to theoretical
developments. I show that range margins can be understood based on just two measurable
parameters: (i) the fitness cost of dispersal—a measure of environmental heterogeneity—and
(ii) the strength of genetic drift, which reduces genetic diversity. Together,
these two parameters define an ‘expansion threshold’: adaptation fails when genetic
drift reduces genetic diversity below that required for adaptation to a heterogeneous
environment. When the key parameters drop below this expansion threshold locally,
a sharp range margin forms. When they drop below this threshold throughout the
species’ range, adaptation collapses everywhere, resulting in either extinction
or formation of a fragmented metapopulation. Because the effects of dispersal
differ fundamentally with dimension, the second parameter—the strength of genetic
drift—is qualitatively different compared to a linear habitat. In two-dimensional
habitats, genetic drift becomes effectively independent of selection. It decreases
with ‘neighbourhood size’—the number of individuals accessible by dispersal within
one generation. Moreover, in contrast to earlier predictions, which neglected
evolution of genetic variance and/or stochasticity in two dimensions, dispersal
into small marginal populations aids adaptation. This is because the reduction
of both genetic and demographic stochasticity has a stronger effect than the cost
of dispersal through increased maladaptation. The expansion threshold thus provides
a novel, theoretically justified, and testable prediction for formation of the
range margin and collapse of the species’ range.'
article_number: e2005372
author:
- first_name: Jitka
full_name: Polechova, Jitka
id: 3BBFB084-F248-11E8-B48F-1D18A9856A87
last_name: Polechova
orcid: 0000-0003-0951-3112
citation:
ama: Polechova J. Is the sky the limit? On the expansion threshold of a species’
range. PLoS Biology. 2018;16(6). doi:10.1371/journal.pbio.2005372
apa: Polechova, J. (2018). Is the sky the limit? On the expansion threshold of a
species’ range. PLoS Biology. Public Library of Science. https://doi.org/10.1371/journal.pbio.2005372
chicago: Polechova, Jitka. “Is the Sky the Limit? On the Expansion Threshold of
a Species’ Range.” PLoS Biology. Public Library of Science, 2018. https://doi.org/10.1371/journal.pbio.2005372.
ieee: J. Polechova, “Is the sky the limit? On the expansion threshold of a species’
range,” PLoS Biology, vol. 16, no. 6. Public Library of Science, 2018.
ista: Polechova J. 2018. Is the sky the limit? On the expansion threshold of a species’
range. PLoS Biology. 16(6), e2005372.
mla: Polechova, Jitka. “Is the Sky the Limit? On the Expansion Threshold of a Species’
Range.” PLoS Biology, vol. 16, no. 6, e2005372, Public Library of Science,
2018, doi:10.1371/journal.pbio.2005372.
short: J. Polechova, PLoS Biology 16 (2018).
date_created: 2018-12-11T11:45:46Z
date_published: 2018-06-15T00:00:00Z
date_updated: 2023-02-23T14:10:16Z
day: '15'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.1371/journal.pbio.2005372
file:
- access_level: open_access
checksum: 908c52751bba30c55ed36789e5e4c84d
content_type: application/pdf
creator: dernst
date_created: 2019-01-22T08:30:03Z
date_updated: 2020-07-14T12:46:01Z
file_id: '5870'
file_name: 2017_PLOS_Polechova.pdf
file_size: 6968201
relation: main_file
file_date_updated: 2020-07-14T12:46:01Z
has_accepted_license: '1'
intvolume: ' 16'
issue: '6'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: PLoS Biology
publication_identifier:
issn:
- '15449173'
publication_status: published
publisher: Public Library of Science
publist_id: '7550'
quality_controlled: '1'
related_material:
record:
- id: '9839'
relation: research_data
status: public
scopus_import: 1
status: public
title: Is the sky the limit? On the expansion threshold of a species’ range
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 16
year: '2018'
...
---
_id: '186'
abstract:
- lang: eng
text: 'A drawing of a graph on a surface is independently even if every pair of
nonadjacent edges in the drawing crosses an even number of times. The ℤ2-genus
of a graph G is the minimum g such that G has an independently even drawing on
the orientable surface of genus g. An unpublished result by Robertson and Seymour
implies that for every t, every graph of sufficiently large genus contains as
a minor a projective t × t grid or one of the following so-called t-Kuratowski
graphs: K3, t, or t copies of K5 or K3,3 sharing at most 2 common vertices. We
show that the ℤ2-genus of graphs in these families is unbounded in t; in fact,
equal to their genus. Together, this implies that the genus of a graph is bounded
from above by a function of its ℤ2-genus, solving a problem posed by Schaefer
and Štefankovič, and giving an approximate version of the Hanani-Tutte theorem
on orientable surfaces.'
alternative_title:
- LIPIcs
article_processing_charge: No
author:
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: Jan
full_name: Kynčl, Jan
last_name: Kynčl
citation:
ama: 'Fulek R, Kynčl J. The ℤ2-Genus of Kuratowski minors. In: Vol 99. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2018:40.1-40.14. doi:10.4230/LIPIcs.SoCG.2018.40'
apa: 'Fulek, R., & Kynčl, J. (2018). The ℤ2-Genus of Kuratowski minors (Vol.
99, p. 40.1-40.14). Presented at the SoCG: Symposium on Computational Geometry,
Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.40'
chicago: Fulek, Radoslav, and Jan Kynčl. “The ℤ2-Genus of Kuratowski Minors,” 99:40.1-40.14.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.40.
ieee: 'R. Fulek and J. Kynčl, “The ℤ2-Genus of Kuratowski minors,” presented at
the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99,
p. 40.1-40.14.'
ista: 'Fulek R, Kynčl J. 2018. The ℤ2-Genus of Kuratowski minors. SoCG: Symposium
on Computational Geometry, LIPIcs, vol. 99, 40.1-40.14.'
mla: Fulek, Radoslav, and Jan Kynčl. The ℤ2-Genus of Kuratowski Minors. Vol.
99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 40.1-40.14, doi:10.4230/LIPIcs.SoCG.2018.40.
short: R. Fulek, J. Kynčl, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2018, p. 40.1-40.14.
conference:
end_date: 2018-06-14
location: Budapest, Hungary
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2018-06-11
date_created: 2018-12-11T11:45:05Z
date_published: 2018-06-11T00:00:00Z
date_updated: 2023-08-14T12:43:51Z
day: '11'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2018.40
external_id:
arxiv:
- '1803.05085'
intvolume: ' 99'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1803.05085
month: '06'
oa: 1
oa_version: Submitted Version
page: 40.1 - 40.14
project:
- _id: 261FA626-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02281
name: Eliminating intersections in drawings of graphs
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7734'
quality_controlled: '1'
related_material:
record:
- id: '11593'
relation: later_version
status: public
scopus_import: '1'
status: public
title: The ℤ2-Genus of Kuratowski minors
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 99
year: '2018'
...
---
_id: '433'
abstract:
- lang: eng
text: 'A thrackle is a graph drawn in the plane so that every pair of its edges
meet exactly once: either at a common end vertex or in a proper crossing. We prove
that any thrackle of n vertices has at most 1.3984n edges. Quasi-thrackles are
defined similarly, except that every pair of edges that do not share a vertex
are allowed to cross an odd number of times. It is also shown that the maximum
number of edges of a quasi-thrackle on n vertices is 3/2(n-1), and that this bound
is best possible for infinitely many values of n.'
alternative_title:
- LNCS
author:
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: János
full_name: Pach, János
last_name: Pach
citation:
ama: 'Fulek R, Pach J. Thrackles: An improved upper bound. In: Vol 10692. Springer;
2018:160-166. doi:10.1007/978-3-319-73915-1_14'
apa: 'Fulek, R., & Pach, J. (2018). Thrackles: An improved upper bound (Vol.
10692, pp. 160–166). Presented at the GD 2017: Graph Drawing and Network Visualization,
Boston, MA, United States: Springer. https://doi.org/10.1007/978-3-319-73915-1_14'
chicago: 'Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound,”
10692:160–66. Springer, 2018. https://doi.org/10.1007/978-3-319-73915-1_14.'
ieee: 'R. Fulek and J. Pach, “Thrackles: An improved upper bound,” presented at
the GD 2017: Graph Drawing and Network Visualization, Boston, MA, United States,
2018, vol. 10692, pp. 160–166.'
ista: 'Fulek R, Pach J. 2018. Thrackles: An improved upper bound. GD 2017: Graph
Drawing and Network Visualization, LNCS, vol. 10692, 160–166.'
mla: 'Fulek, Radoslav, and János Pach. Thrackles: An Improved Upper Bound.
Vol. 10692, Springer, 2018, pp. 160–66, doi:10.1007/978-3-319-73915-1_14.'
short: R. Fulek, J. Pach, in:, Springer, 2018, pp. 160–166.
conference:
end_date: 2017-09-27
location: Boston, MA, United States
name: 'GD 2017: Graph Drawing and Network Visualization'
start_date: 201-09-25
date_created: 2018-12-11T11:46:27Z
date_published: 2018-01-21T00:00:00Z
date_updated: 2023-08-24T14:39:32Z
day: '21'
department:
- _id: UlWa
doi: 10.1007/978-3-319-73915-1_14
external_id:
arxiv:
- '1708.08037'
intvolume: ' 10692'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1708.08037
month: '01'
oa: 1
oa_version: Submitted Version
page: 160 - 166
publication_status: published
publisher: Springer
publist_id: '7390'
quality_controlled: '1'
related_material:
record:
- id: '5857'
relation: later_version
status: public
scopus_import: 1
status: public
title: 'Thrackles: An improved upper bound'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10692
year: '2018'
...
---
_id: '9837'
abstract:
- lang: eng
text: Both classical and recent studies suggest that chromosomal inversion polymorphisms
are important in adaptation and speciation. However, biases in discovery and reporting
of inversions make it difficult to assess their prevalence and biological importance.
Here, we use an approach based on linkage disequilibrium among markers genotyped
for samples collected across a transect between contrasting habitats to detect
chromosomal rearrangements de novo. We report 17 polymorphic rearrangements in
a single locality for the coastal marine snail, Littorina saxatilis. Patterns
of diversity in the field and of recombination in controlled crosses provide strong
evidence that at least the majority of these rearrangements are inversions. Most
show clinal changes in frequency between habitats, suggestive of divergent selection,
but only one appears to be fixed for different arrangements in the two habitats.
Consistent with widespread evidence for balancing selection on inversion polymorphisms,
we argue that a combination of heterosis and divergent selection can explain the
observed patterns and should be considered in other systems spanning environmental
gradients.
article_processing_charge: No
author:
- first_name: Rui
full_name: Faria, Rui
last_name: Faria
- first_name: Pragya
full_name: Chaube, Pragya
last_name: Chaube
- first_name: Hernán E.
full_name: Morales, Hernán E.
last_name: Morales
- first_name: Tomas
full_name: Larsson, Tomas
last_name: Larsson
- first_name: Alan R.
full_name: Lemmon, Alan R.
last_name: Lemmon
- first_name: Emily M.
full_name: Lemmon, Emily M.
last_name: Lemmon
- first_name: Marina
full_name: Rafajlović, Marina
last_name: Rafajlović
- first_name: Marina
full_name: Panova, Marina
last_name: Panova
- first_name: Mark
full_name: Ravinet, Mark
last_name: Ravinet
- first_name: Kerstin
full_name: Johannesson, Kerstin
last_name: Johannesson
- first_name: Anja M
full_name: Westram, Anja M
id: 3C147470-F248-11E8-B48F-1D18A9856A87
last_name: Westram
orcid: 0000-0003-1050-4969
- first_name: Roger K.
full_name: Butlin, Roger K.
last_name: Butlin
citation:
ama: 'Faria R, Chaube P, Morales HE, et al. Data from: Multiple chromosomal rearrangements
in a hybrid zone between Littorina saxatilis ecotypes. 2018. doi:10.5061/dryad.72cg113'
apa: 'Faria, R., Chaube, P., Morales, H. E., Larsson, T., Lemmon, A. R., Lemmon,
E. M., … Butlin, R. K. (2018). Data from: Multiple chromosomal rearrangements
in a hybrid zone between Littorina saxatilis ecotypes. Dryad. https://doi.org/10.5061/dryad.72cg113'
chicago: 'Faria, Rui, Pragya Chaube, Hernán E. Morales, Tomas Larsson, Alan R. Lemmon,
Emily M. Lemmon, Marina Rafajlović, et al. “Data from: Multiple Chromosomal Rearrangements
in a Hybrid Zone between Littorina Saxatilis Ecotypes.” Dryad, 2018. https://doi.org/10.5061/dryad.72cg113.'
ieee: 'R. Faria et al., “Data from: Multiple chromosomal rearrangements in
a hybrid zone between Littorina saxatilis ecotypes.” Dryad, 2018.'
ista: 'Faria R, Chaube P, Morales HE, Larsson T, Lemmon AR, Lemmon EM, Rafajlović
M, Panova M, Ravinet M, Johannesson K, Westram AM, Butlin RK. 2018. Data from:
Multiple chromosomal rearrangements in a hybrid zone between Littorina saxatilis
ecotypes, Dryad, 10.5061/dryad.72cg113.'
mla: 'Faria, Rui, et al. Data from: Multiple Chromosomal Rearrangements in a
Hybrid Zone between Littorina Saxatilis Ecotypes. Dryad, 2018, doi:10.5061/dryad.72cg113.'
short: R. Faria, P. Chaube, H.E. Morales, T. Larsson, A.R. Lemmon, E.M. Lemmon,
M. Rafajlović, M. Panova, M. Ravinet, K. Johannesson, A.M. Westram, R.K. Butlin,
(2018).
date_created: 2021-08-09T12:46:39Z
date_published: 2018-10-09T00:00:00Z
date_updated: 2023-08-24T14:50:26Z
day: '09'
department:
- _id: NiBa
doi: 10.5061/dryad.72cg113
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.72cg113
month: '10'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '6095'
relation: used_in_publication
status: public
status: public
title: 'Data from: Multiple chromosomal rearrangements in a hybrid zone between Littorina
saxatilis ecotypes'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2018'
...
---
_id: '5457'
abstract:
- lang: eng
text: "We consider the problem of expected cost analysis over nondeterministic probabilistic
programs, which aims at automated methods for analyzing the resource-usage of
such programs. Previous approaches for this problem could only handle nonnegative
bounded costs. However, in many scenarios, such as queuing networks or analysis
of cryptocurrency protocols, both positive and negative costs are necessary and
the costs are unbounded as well.\r\n\r\nIn this work, we present a sound and efficient
approach to obtain polynomial bounds on the expected accumulated cost of nondeterministic
probabilistic programs. Our approach can handle (a) general positive and negative
costs with bounded updates in variables; and (b) nonnegative costs with general
updates to variables. We show that several natural examples which could not be
handled by previous approaches are captured in our framework.\r\n\r\nMoreover,
our approach leads to an efficient polynomial-time algorithm, while no previous
approach for cost analysis of probabilistic programs could guarantee polynomial
runtime. Finally, we show the effectiveness of our approach by presenting experimental
results on a variety of programs, motivated by real-world applications, for which
we efficiently synthesize tight resource-usage bounds."
alternative_title:
- IST Austria Technical Report
author:
- first_name: '1'
full_name: Anonymous, 1
last_name: Anonymous
- first_name: '2'
full_name: Anonymous, 2
last_name: Anonymous
- first_name: '3'
full_name: Anonymous, 3
last_name: Anonymous
- first_name: '4'
full_name: Anonymous, 4
last_name: Anonymous
- first_name: '5'
full_name: Anonymous, 5
last_name: Anonymous
- first_name: '6'
full_name: Anonymous, 6
last_name: Anonymous
citation:
ama: Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4, Anonymous 5, Anonymous
6. Cost Analysis of Nondeterministic Probabilistic Programs. IST Austria;
2018.
apa: Anonymous, 1, Anonymous, 2, Anonymous, 3, Anonymous, 4, Anonymous, 5, &
Anonymous, 6. (2018). Cost analysis of nondeterministic probabilistic programs.
IST Austria.
chicago: Anonymous, 1, 2 Anonymous, 3 Anonymous, 4 Anonymous, 5 Anonymous, and 6
Anonymous. Cost Analysis of Nondeterministic Probabilistic Programs. IST
Austria, 2018.
ieee: 1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, 5 Anonymous, and 6 Anonymous,
Cost analysis of nondeterministic probabilistic programs. IST Austria,
2018.
ista: Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4, Anonymous 5, Anonymous
6. 2018. Cost analysis of nondeterministic probabilistic programs, IST Austria,
27p.
mla: Anonymous, 1, et al. Cost Analysis of Nondeterministic Probabilistic Programs.
IST Austria, 2018.
short: 1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, 5 Anonymous, 6 Anonymous,
Cost Analysis of Nondeterministic Probabilistic Programs, IST Austria, 2018.
date_created: 2018-12-12T11:39:26Z
date_published: 2018-11-11T00:00:00Z
date_updated: 2023-08-25T08:07:48Z
day: '11'
ddc:
- '000'
file:
- access_level: open_access
checksum: ba3adafd36fe200385ccda583063b9eb
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:32Z
date_updated: 2020-07-14T12:47:00Z
file_id: '5493'
file_name: IST-2018-1066-v1+1_techreport.pdf
file_size: 4202966
relation: main_file
- access_level: closed
checksum: 6cf3a19164bb8e5048a9c8c84dfd9fa3
content_type: text/plain
creator: dernst
date_created: 2019-05-10T13:22:12Z
date_updated: 2020-07-14T12:47:00Z
file_id: '6402'
file_name: authors-names.txt
file_size: 322
relation: main_file
file_date_updated: 2020-07-14T12:47:00Z
has_accepted_license: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: '27'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '1066'
related_material:
record:
- id: '6175'
relation: later_version
status: public
scopus_import: 1
status: public
title: Cost analysis of nondeterministic probabilistic programs
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '10864'
abstract:
- lang: eng
text: We prove that every congruence distributive variety has directed Jónsson terms,
and every congruence modular variety has directed Gumm terms. The directed terms
we construct witness every case of absorption witnessed by the original Jónsson
or Gumm terms. This result is equivalent to a pair of claims about absorption
for admissible preorders in congruence distributive and congruence modular varieties,
respectively. For finite algebras, these absorption theorems have already seen
significant applications, but until now, it was not clear if the theorems hold
for general algebras as well. Our method also yields a novel proof of a result
by P. Lipparini about the existence of a chain of terms (which we call Pixley
terms) in varieties that are at the same time congruence distributive and k-permutable
for some k.
acknowledgement: The second author was supported by National Science Center grant
DEC-2011-/01/B/ST6/01006.
article_processing_charge: No
author:
- first_name: Alexandr
full_name: Kazda, Alexandr
id: 3B32BAA8-F248-11E8-B48F-1D18A9856A87
last_name: Kazda
- first_name: Marcin
full_name: Kozik, Marcin
last_name: Kozik
- first_name: Ralph
full_name: McKenzie, Ralph
last_name: McKenzie
- first_name: Matthew
full_name: Moore, Matthew
last_name: Moore
citation:
ama: 'Kazda A, Kozik M, McKenzie R, Moore M. Absorption and directed Jónsson terms.
In: Czelakowski J, ed. Don Pigozzi on Abstract Algebraic Logic, Universal Algebra,
and Computer Science. Vol 16. OCTR. Cham: Springer Nature; 2018:203-220. doi:10.1007/978-3-319-74772-9_7'
apa: 'Kazda, A., Kozik, M., McKenzie, R., & Moore, M. (2018). Absorption and
directed Jónsson terms. In J. Czelakowski (Ed.), Don Pigozzi on Abstract Algebraic
Logic, Universal Algebra, and Computer Science (Vol. 16, pp. 203–220). Cham:
Springer Nature. https://doi.org/10.1007/978-3-319-74772-9_7'
chicago: 'Kazda, Alexandr, Marcin Kozik, Ralph McKenzie, and Matthew Moore. “Absorption
and Directed Jónsson Terms.” In Don Pigozzi on Abstract Algebraic Logic, Universal
Algebra, and Computer Science, edited by J Czelakowski, 16:203–20. OCTR. Cham:
Springer Nature, 2018. https://doi.org/10.1007/978-3-319-74772-9_7.'
ieee: 'A. Kazda, M. Kozik, R. McKenzie, and M. Moore, “Absorption and directed Jónsson
terms,” in Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and
Computer Science, vol. 16, J. Czelakowski, Ed. Cham: Springer Nature, 2018,
pp. 203–220.'
ista: 'Kazda A, Kozik M, McKenzie R, Moore M. 2018.Absorption and directed Jónsson
terms. In: Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer
Science. vol. 16, 203–220.'
mla: Kazda, Alexandr, et al. “Absorption and Directed Jónsson Terms.” Don Pigozzi
on Abstract Algebraic Logic, Universal Algebra, and Computer Science, edited
by J Czelakowski, vol. 16, Springer Nature, 2018, pp. 203–20, doi:10.1007/978-3-319-74772-9_7.
short: A. Kazda, M. Kozik, R. McKenzie, M. Moore, in:, J. Czelakowski (Ed.), Don
Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science,
Springer Nature, Cham, 2018, pp. 203–220.
date_created: 2022-03-18T10:30:32Z
date_published: 2018-03-21T00:00:00Z
date_updated: 2023-09-05T15:37:18Z
day: '21'
department:
- _id: VlKo
doi: 10.1007/978-3-319-74772-9_7
editor:
- first_name: J
full_name: Czelakowski, J
last_name: Czelakowski
external_id:
arxiv:
- '1502.01072'
intvolume: ' 16'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1502.01072
month: '03'
oa: 1
oa_version: Preprint
page: 203-220
place: Cham
publication: Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer
Science
publication_identifier:
eisbn:
- '9783319747729'
eissn:
- 2211-2766
isbn:
- '9783319747712'
issn:
- 2211-2758
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: OCTR
status: public
title: Absorption and directed Jónsson terms
type: book_chapter
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 16
year: '2018'
...
---
_id: '184'
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.
acknowledgement: 'Partially supported by the project EMBEDS II (CZ: 7AMB17FR029, FR:
38087RM) of Czech-French collaboration.'
alternative_title:
- Leibniz International Proceedings in Information, LIPIcs
author:
- first_name: Xavier
full_name: Goaoc, Xavier
last_name: Goaoc
- first_name: Pavel
full_name: Paták, Pavel
last_name: Paták
- 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
id: 38AC689C-F248-11E8-B48F-1D18A9856A87
last_name: Tancer
orcid: 0000-0002-1191-6714
- 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, Paták P, Patakova Z, Tancer M, Wagner U. Shellability is NP-complete.
In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:41:1-41:16.
doi:10.4230/LIPIcs.SoCG.2018.41'
apa: 'Goaoc, X., Paták, P., Patakova, Z., Tancer, M., & Wagner, U. (2018). Shellability
is NP-complete (Vol. 99, p. 41:1-41:16). Presented at the SoCG: Symposium on Computational
Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.SoCG.2018.41'
chicago: Goaoc, Xavier, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner.
“Shellability Is NP-Complete,” 99:41:1-41:16. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.41.
ieee: 'X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Shellability
is NP-complete,” presented at the SoCG: Symposium on Computational Geometry, Budapest,
Hungary, 2018, vol. 99, p. 41:1-41:16.'
ista: 'Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2018. Shellability is NP-complete.
SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in
Information, LIPIcs, vol. 99, 41:1-41:16.'
mla: Goaoc, Xavier, et al. Shellability Is NP-Complete. Vol. 99, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 41:1-41:16, doi:10.4230/LIPIcs.SoCG.2018.41.
short: X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2018, p. 41:1-41:16.
conference:
end_date: 2018-06-14
location: Budapest, Hungary
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2018-06-11
date_created: 2018-12-11T11:45:04Z
date_published: 2018-06-11T00:00:00Z
date_updated: 2023-09-06T11:10:57Z
day: '11'
ddc:
- '516'
- '000'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2018.41
file:
- access_level: open_access
checksum: d12bdd60f04a57307867704b5f930afd
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T16:35:02Z
date_updated: 2020-07-14T12:45:18Z
file_id: '5725'
file_name: 2018_LIPIcs_Goaoc.pdf
file_size: 718414
relation: main_file
file_date_updated: 2020-07-14T12:45:18Z
has_accepted_license: '1'
intvolume: ' 99'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 41:1 - 41:16
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7736'
quality_controlled: '1'
related_material:
record:
- id: '7108'
relation: later_version
status: public
scopus_import: 1
status: public
title: Shellability is NP-complete
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 99
year: '2018'
...
---
_id: '285'
abstract:
- lang: eng
text: In graph theory, as well as in 3-manifold topology, there exist several width-type
parameters to describe how "simple" or "thin" a given graph
or 3-manifold is. These parameters, such as pathwidth or treewidth for graphs,
or the concept of thin position for 3-manifolds, play an important role when studying
algorithmic problems; in particular, there is a variety of problems in computational
3-manifold topology - some of them known to be computationally hard in general
- that become solvable in polynomial time as soon as the dual graph of the input
triangulation has bounded treewidth. In view of these algorithmic results, it
is natural to ask whether every 3-manifold admits a triangulation of bounded treewidth.
We show that this is not the case, i.e., that there exists an infinite family
of closed 3-manifolds not admitting triangulations of bounded pathwidth or treewidth
(the latter implies the former, but we present two separate proofs). We derive
these results from work of Agol and of Scharlemann and Thompson, by exhibiting
explicit connections between the topology of a 3-manifold M on the one hand and
width-type parameters of the dual graphs of triangulations of M on the other hand,
answering a question that had been raised repeatedly by researchers in computational
3-manifold topology. In particular, we show that if a closed, orientable, irreducible,
non-Haken 3-manifold M has a triangulation of treewidth (resp. pathwidth) k then
the Heegaard genus of M is at most 48(k+1) (resp. 4(3k+1)).
acknowledgement: Research of the second author was supported by the Einstein Foundation
(project “Einstein Visiting Fellow Santos”) and by the Simons Foundation (“Simons
Visiting Professors” program).
alternative_title:
- LIPIcs
article_number: '46'
article_processing_charge: No
author:
- first_name: Kristóf
full_name: Huszár, Kristóf
id: 33C26278-F248-11E8-B48F-1D18A9856A87
last_name: Huszár
orcid: 0000-0002-5445-5057
- first_name: Jonathan
full_name: Spreer, Jonathan
last_name: Spreer
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: 'Huszár K, Spreer J, Wagner U. On the treewidth of triangulated 3-manifolds.
In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.SoCG.2018.46'
apa: 'Huszár, K., Spreer, J., & Wagner, U. (2018). On the treewidth of triangulated
3-manifolds (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry,
Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.46'
chicago: Huszár, Kristóf, Jonathan Spreer, and Uli Wagner. “On the Treewidth of
Triangulated 3-Manifolds,” Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.46.
ieee: 'K. Huszár, J. Spreer, and U. Wagner, “On the treewidth of triangulated 3-manifolds,”
presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary,
2018, vol. 99.'
ista: 'Huszár K, Spreer J, Wagner U. 2018. On the treewidth of triangulated 3-manifolds.
SoCG: Symposium on Computational Geometry, LIPIcs, vol. 99, 46.'
mla: Huszár, Kristóf, et al. On the Treewidth of Triangulated 3-Manifolds.
Vol. 99, 46, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.SoCG.2018.46.
short: K. Huszár, J. Spreer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2018.
conference:
end_date: 2018-06-14
location: Budapest, Hungary
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2018-06-11
date_created: 2018-12-11T11:45:37Z
date_published: 2018-06-01T00:00:00Z
date_updated: 2023-09-06T11:13:41Z
day: '01'
ddc:
- '516'
- '000'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2018.46
external_id:
arxiv:
- '1712.00434'
file:
- access_level: open_access
checksum: 530d084116778135d5bffaa317479cac
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T15:32:38Z
date_updated: 2020-07-14T12:45:51Z
file_id: '5713'
file_name: 2018_LIPIcs_Huszar.pdf
file_size: 642522
relation: main_file
file_date_updated: 2020-07-14T12:45:51Z
has_accepted_license: '1'
intvolume: ' 99'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
publication_identifier:
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7614'
quality_controlled: '1'
related_material:
record:
- id: '7093'
relation: later_version
status: public
scopus_import: 1
status: public
title: On the treewidth of triangulated 3-manifolds
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 99
year: '2018'
...
---
_id: '13059'
abstract:
- lang: eng
text: "This dataset contains a GitHub repository containing all the data, analysis,
Nextflow workflows and Jupyter notebooks to replicate the manuscript titled \"Fast
and accurate large multiple sequence alignments with a root-to-leaf regressive
method\".\r\nIt also contains the Multiple Sequence Alignments (MSAs) generated
and well as the main figures and tables from the manuscript.\r\nThe repository
is also available at GitHub (https://github.com/cbcrg/dpa-analysis) release `v1.2`.\r\nFor
details on how to use the regressive alignment algorithm, see the T-Coffee software
suite (https://github.com/cbcrg/tcoffee)."
article_processing_charge: No
author:
- first_name: Edgar
full_name: Garriga, Edgar
last_name: Garriga
- first_name: Paolo
full_name: di Tommaso, Paolo
last_name: di Tommaso
- first_name: Cedrik
full_name: Magis, Cedrik
last_name: Magis
- first_name: Ionas
full_name: Erb, Ionas
last_name: Erb
- first_name: Leila
full_name: Mansouri, Leila
last_name: Mansouri
- first_name: Athanasios
full_name: Baltzis, Athanasios
last_name: Baltzis
- first_name: Hafid
full_name: Laayouni, Hafid
last_name: Laayouni
- first_name: Fyodor
full_name: Kondrashov, Fyodor
id: 44FDEF62-F248-11E8-B48F-1D18A9856A87
last_name: Kondrashov
orcid: 0000-0001-8243-4694
- first_name: Evan
full_name: Floden, Evan
last_name: Floden
- first_name: Cedric
full_name: Notredame, Cedric
last_name: Notredame
citation:
ama: Garriga E, di Tommaso P, Magis C, et al. Fast and accurate large multiple sequence
alignments with a root-to-leaf regressive method. 2018. doi:10.5281/ZENODO.2025846
apa: Garriga, E., di Tommaso, P., Magis, C., Erb, I., Mansouri, L., Baltzis, A.,
… Notredame, C. (2018). Fast and accurate large multiple sequence alignments with
a root-to-leaf regressive method. Zenodo. https://doi.org/10.5281/ZENODO.2025846
chicago: Garriga, Edgar, Paolo di Tommaso, Cedrik Magis, Ionas Erb, Leila Mansouri,
Athanasios Baltzis, Hafid Laayouni, Fyodor Kondrashov, Evan Floden, and Cedric
Notredame. “Fast and Accurate Large Multiple Sequence Alignments with a Root-to-Leaf
Regressive Method.” Zenodo, 2018. https://doi.org/10.5281/ZENODO.2025846.
ieee: E. Garriga et al., “Fast and accurate large multiple sequence alignments
with a root-to-leaf regressive method.” Zenodo, 2018.
ista: Garriga E, di Tommaso P, Magis C, Erb I, Mansouri L, Baltzis A, Laayouni H,
Kondrashov F, Floden E, Notredame C. 2018. Fast and accurate large multiple sequence
alignments with a root-to-leaf regressive method, Zenodo, 10.5281/ZENODO.2025846.
mla: Garriga, Edgar, et al. Fast and Accurate Large Multiple Sequence Alignments
with a Root-to-Leaf Regressive Method. Zenodo, 2018, doi:10.5281/ZENODO.2025846.
short: E. Garriga, P. di Tommaso, C. Magis, I. Erb, L. Mansouri, A. Baltzis, H.
Laayouni, F. Kondrashov, E. Floden, C. Notredame, (2018).
date_created: 2023-05-23T16:08:20Z
date_published: 2018-12-07T00:00:00Z
date_updated: 2023-09-06T14:32:51Z
day: '07'
ddc:
- '570'
department:
- _id: FyKo
doi: 10.5281/ZENODO.2025846
main_file_link:
- open_access: '1'
url: https://doi.org/10.5281/zenodo.3271452
month: '12'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
record:
- id: '7181'
relation: used_in_publication
status: public
status: public
title: Fast and accurate large multiple sequence alignments with a root-to-leaf regressive
method
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '49'
abstract:
- lang: eng
text: Nowadays, quantum computation is receiving more and more attention as an alternative
to the classical way of computing. For realizing a quantum computer, different
devices are investigated as potential quantum bits. In this thesis, the focus
is on Ge hut wires, which turned out to be promising candidates for implementing
hole spin quantum bits. The advantages of Ge as a material system are the low
hyperfine interaction for holes and the strong spin orbit coupling, as well as
the compatibility with the highly developed CMOS processes in industry. In addition,
Ge can also be isotopically purified which is expected to boost the spin coherence
times. The strong spin orbit interaction for holes in Ge on the one hand enables
the full electrical control of the quantum bit and on the other hand should allow
short spin manipulation times. Starting with a bare Si wafer, this work covers
the entire process reaching from growth over the fabrication and characterization
of hut wire devices up to the demonstration of hole spin resonance. From experiments
with single quantum dots, a large g-factor anisotropy between the in-plane and
the out-of-plane direction was found. A comparison to a theoretical model unveiled
the heavy-hole character of the lowest energy states. The second part of the thesis
addresses double quantum dot devices, which were realized by adding two gate electrodes
to a hut wire. In such devices, Pauli spin blockade was observed, which can serve
as a read-out mechanism for spin quantum bits. Applying oscillating electric fields
in spin blockade allowed the demonstration of continuous spin rotations and the
extraction of a lower bound for the spin dephasing time. Despite the strong spin
orbit coupling in Ge, the obtained value for the dephasing time is comparable
to what has been recently reported for holes in Si. All in all, the presented
results point out the high potential of Ge hut wires as a platform for long-lived,
fast and fully electrically tunable hole spin quantum bits.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Hannes
full_name: Watzinger, Hannes
id: 35DF8E50-F248-11E8-B48F-1D18A9856A87
last_name: Watzinger
citation:
ama: Watzinger H. Ge hut wires - from growth to hole spin resonance. 2018. doi:10.15479/AT:ISTA:th_1033
apa: Watzinger, H. (2018). Ge hut wires - from growth to hole spin resonance.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_1033
chicago: Watzinger, Hannes. “Ge Hut Wires - from Growth to Hole Spin Resonance.”
Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_1033.
ieee: H. Watzinger, “Ge hut wires - from growth to hole spin resonance,” Institute
of Science and Technology Austria, 2018.
ista: Watzinger H. 2018. Ge hut wires - from growth to hole spin resonance. Institute
of Science and Technology Austria.
mla: Watzinger, Hannes. Ge Hut Wires - from Growth to Hole Spin Resonance.
Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_1033.
short: H. Watzinger, Ge Hut Wires - from Growth to Hole Spin Resonance, Institute
of Science and Technology Austria, 2018.
date_created: 2018-12-11T11:44:21Z
date_published: 2018-07-30T00:00:00Z
date_updated: 2023-09-07T12:27:43Z
day: '30'
ddc:
- '530'
degree_awarded: PhD
department:
- _id: GeKa
doi: 10.15479/AT:ISTA:th_1033
file:
- access_level: open_access
checksum: b653b5216251f938ddbeafd1de88667c
content_type: application/pdf
creator: dernst
date_created: 2019-04-09T07:13:28Z
date_updated: 2020-07-14T12:46:35Z
file_id: '6249'
file_name: 2018_Thesis_Watzinger.pdf
file_size: 85539748
relation: main_file
- access_level: closed
checksum: 39bcf8de7ac5b1bb516b11ce2f966785
content_type: application/zip
creator: dernst
date_created: 2019-04-09T07:13:27Z
date_updated: 2020-07-14T12:46:35Z
file_id: '6250'
file_name: 2018_Thesis_Watzinger_source.zip
file_size: 21830697
relation: source_file
file_date_updated: 2020-07-14T12:46:35Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '77'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '8005'
pubrep_id: '1033'
status: public
supervisor:
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
title: Ge hut wires - from growth to hole spin resonance
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: '2018'
...
---
_id: '201'
abstract:
- lang: eng
text: 'We describe arrangements of three-dimensional spheres from a geometrical
and topological point of view. Real data (fitting this setup) often consist of
soft spheres which show certain degree of deformation while strongly packing against
each other. In this context, we answer the following questions: If we model a
soft packing of spheres by hard spheres that are allowed to overlap, can we measure
the volume in the overlapped areas? Can we be more specific about the overlap
volume, i.e. quantify how much volume is there covered exactly twice, three times,
or k times? What would be a good optimization criteria that rule the arrangement
of soft spheres while making a good use of the available space? Fixing a particular
criterion, what would be the optimal sphere configuration? The first result of
this thesis are short formulas for the computation of volumes covered by at least
k of the balls. The formulas exploit information contained in the order-k Voronoi
diagrams and its closely related Level-k complex. The used complexes lead to a
natural generalization into poset diagrams, a theoretical formalism that contains
the order-k and degree-k diagrams as special cases. In parallel, we define different
criteria to determine what could be considered an optimal arrangement from a geometrical
point of view. Fixing a criterion, we find optimal soft packing configurations
in 2D and 3D where the ball centers lie on a lattice. As a last step, we use tools
from computational topology on real physical data, to show the potentials of higher-order
diagrams in the description of melting crystals. The results of the experiments
leaves us with an open window to apply the theories developed in this thesis in
real applications.'
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Mabel
full_name: Iglesias Ham, Mabel
id: 41B58C0C-F248-11E8-B48F-1D18A9856A87
last_name: Iglesias Ham
citation:
ama: Iglesias Ham M. Multiple covers with balls. 2018. doi:10.15479/AT:ISTA:th_1026
apa: Iglesias Ham, M. (2018). Multiple covers with balls. Institute of Science
and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_1026
chicago: Iglesias Ham, Mabel. “Multiple Covers with Balls.” Institute of Science
and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_1026.
ieee: M. Iglesias Ham, “Multiple covers with balls,” Institute of Science and Technology
Austria, 2018.
ista: Iglesias Ham M. 2018. Multiple covers with balls. Institute of Science and
Technology Austria.
mla: Iglesias Ham, Mabel. Multiple Covers with Balls. Institute of Science
and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_1026.
short: M. Iglesias Ham, Multiple Covers with Balls, Institute of Science and Technology
Austria, 2018.
date_created: 2018-12-11T11:45:10Z
date_published: 2018-06-11T00:00:00Z
date_updated: 2023-09-07T12:25:32Z
day: '11'
ddc:
- '514'
- '516'
degree_awarded: PhD
department:
- _id: HeEd
doi: 10.15479/AT:ISTA:th_1026
file:
- access_level: closed
checksum: dd699303623e96d1478a6ae07210dd05
content_type: application/zip
creator: kschuh
date_created: 2019-02-05T07:43:31Z
date_updated: 2020-07-14T12:45:24Z
file_id: '5918'
file_name: IST-2018-1025-v2+5_ist-thesis-iglesias-11June2018(1).zip
file_size: 11827713
relation: source_file
- access_level: open_access
checksum: ba163849a190d2b41d66fef0e4983294
content_type: application/pdf
creator: kschuh
date_created: 2019-02-05T07:43:45Z
date_updated: 2020-07-14T12:45:24Z
file_id: '5919'
file_name: IST-2018-1025-v2+4_ThesisIglesiasFinal11June2018.pdf
file_size: 4783846
relation: main_file
file_date_updated: 2020-07-14T12:45:24Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '171'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7712'
pubrep_id: '1026'
status: public
supervisor:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
title: Multiple covers with balls
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '68'
abstract:
- lang: eng
text: The most common assumption made in statistical learning theory is the assumption
of the independent and identically distributed (i.i.d.) data. While being very
convenient mathematically, it is often very clearly violated in practice. This
disparity between the machine learning theory and applications underlies a growing
demand in the development of algorithms that learn from dependent data and theory
that can provide generalization guarantees similar to the independent situations.
This thesis is dedicated to two variants of dependencies that can arise in practice.
One is a dependence on the level of samples in a single learning task. Another
dependency type arises in the multi-task setting when the tasks are dependent
on each other even though the data for them can be i.i.d. In both cases we model
the data (samples or tasks) as stochastic processes and introduce new algorithms
for both settings that take into account and exploit the resulting dependencies.
We prove the theoretical guarantees on the performance of the introduced algorithms
under different evaluation criteria and, in addition, we compliment the theoretical
study by the empirical one, where we evaluate some of the algorithms on two real
world datasets to highlight their practical applicability.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Alexander
full_name: Zimin, Alexander
id: 37099E9C-F248-11E8-B48F-1D18A9856A87
last_name: Zimin
citation:
ama: Zimin A. Learning from dependent data. 2018. doi:10.15479/AT:ISTA:TH1048
apa: Zimin, A. (2018). Learning from dependent data. Institute of Science
and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH1048
chicago: Zimin, Alexander. “Learning from Dependent Data.” Institute of Science
and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH1048.
ieee: A. Zimin, “Learning from dependent data,” Institute of Science and Technology
Austria, 2018.
ista: Zimin A. 2018. Learning from dependent data. Institute of Science and Technology
Austria.
mla: Zimin, Alexander. Learning from Dependent Data. Institute of Science
and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH1048.
short: A. Zimin, Learning from Dependent Data, Institute of Science and Technology
Austria, 2018.
date_created: 2018-12-11T11:44:27Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2023-09-07T12:29:07Z
day: '01'
ddc:
- '004'
- '519'
degree_awarded: PhD
department:
- _id: ChLa
doi: 10.15479/AT:ISTA:TH1048
ec_funded: 1
file:
- access_level: open_access
checksum: e849dd40a915e4d6c5572b51b517f098
content_type: application/pdf
creator: dernst
date_created: 2019-04-09T07:32:47Z
date_updated: 2020-07-14T12:47:40Z
file_id: '6253'
file_name: 2018_Thesis_Zimin.pdf
file_size: 1036137
relation: main_file
- access_level: closed
checksum: da092153cec55c97461bd53c45c5d139
content_type: application/zip
creator: dernst
date_created: 2019-04-09T07:32:47Z
date_updated: 2020-07-14T12:47:40Z
file_id: '6254'
file_name: 2018_Thesis_Zimin_Source.zip
file_size: 637490
relation: source_file
file_date_updated: 2020-07-14T12:47:40Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '92'
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7986'
pubrep_id: '1048'
status: public
supervisor:
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
title: Learning from dependent data
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '83'
abstract:
- lang: eng
text: "A proof system is a protocol between a prover and a verifier over a common
input in which an honest prover convinces the verifier of the validity of true
statements. Motivated by the success of decentralized cryptocurrencies, exemplified
by Bitcoin, the focus of this thesis will be on proof systems which found applications
in some sustainable alternatives to Bitcoin, such as the Spacemint and Chia cryptocurrencies.
In particular, we focus on proofs of space and proofs of sequential work.\r\nProofs
of space (PoSpace) were suggested as more ecological, economical, and egalitarian
alternative to the energy-wasteful proof-of-work mining of Bitcoin. However, the
state-of-the-art constructions of PoSpace are based on sophisticated graph pebbling
lower bounds, and are therefore complex. Moreover, when these PoSpace are used
in cryptocurrencies like Spacemint, miners can only start mining after ensuring
that a commitment to their space is already added in a special transaction to
the blockchain. Proofs of sequential work (PoSW) are proof systems in which a
prover, upon receiving a statement x and a time parameter T, computes a proof
which convinces the verifier that T time units had passed since x was received.
Whereas Spacemint assumes synchrony to retain some interesting Bitcoin dynamics,
Chia requires PoSW with unique proofs, i.e., PoSW in which it is hard to come
up with more than one accepting proof for any true statement. In this thesis we
construct simple and practically-efficient PoSpace and PoSW. When using our PoSpace
in cryptocurrencies, miners can start mining on the fly, like in Bitcoin, and
unlike current constructions of PoSW, which either achieve efficient verification
of sequential work, or faster-than-recomputing verification of correctness of
proofs, but not both at the same time, ours achieve the best of these two worlds."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Hamza M
full_name: Abusalah, Hamza M
id: 40297222-F248-11E8-B48F-1D18A9856A87
last_name: Abusalah
citation:
ama: Abusalah HM. Proof systems for sustainable decentralized cryptocurrencies.
2018. doi:10.15479/AT:ISTA:TH_1046
apa: Abusalah, H. M. (2018). Proof systems for sustainable decentralized cryptocurrencies.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_1046
chicago: Abusalah, Hamza M. “Proof Systems for Sustainable Decentralized Cryptocurrencies.”
Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH_1046.
ieee: H. M. Abusalah, “Proof systems for sustainable decentralized cryptocurrencies,”
Institute of Science and Technology Austria, 2018.
ista: Abusalah HM. 2018. Proof systems for sustainable decentralized cryptocurrencies.
Institute of Science and Technology Austria.
mla: Abusalah, Hamza M. Proof Systems for Sustainable Decentralized Cryptocurrencies.
Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH_1046.
short: H.M. Abusalah, Proof Systems for Sustainable Decentralized Cryptocurrencies,
Institute of Science and Technology Austria, 2018.
date_created: 2018-12-11T11:44:32Z
date_published: 2018-09-05T00:00:00Z
date_updated: 2023-09-07T12:30:23Z
day: '05'
ddc:
- '004'
degree_awarded: PhD
department:
- _id: KrPi
doi: 10.15479/AT:ISTA:TH_1046
ec_funded: 1
file:
- access_level: open_access
checksum: c4b5f7d111755d1396787f41886fc674
content_type: application/pdf
creator: dernst
date_created: 2019-04-09T06:43:41Z
date_updated: 2020-07-14T12:48:11Z
file_id: '6245'
file_name: 2018_Thesis_Abusalah.pdf
file_size: 876241
relation: main_file
- access_level: closed
checksum: 0f382ac56b471c48fd907d63eb87dafe
content_type: application/x-gzip
creator: dernst
date_created: 2019-04-09T06:43:41Z
date_updated: 2020-07-14T12:48:11Z
file_id: '6246'
file_name: 2018_Thesis_Abusalah_source.tar.gz
file_size: 2029190
relation: source_file
file_date_updated: 2020-07-14T12:48:11Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '59'
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7971'
pubrep_id: '1046'
related_material:
record:
- id: '1229'
relation: part_of_dissertation
status: public
- id: '1235'
relation: part_of_dissertation
status: public
- id: '1236'
relation: part_of_dissertation
status: public
- id: '559'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
title: Proof systems for sustainable decentralized cryptocurrencies
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '197'
abstract:
- lang: eng
text: Modern computer vision systems heavily rely on statistical machine learning
models, which typically require large amounts of labeled data to be learned reliably.
Moreover, very recently computer vision research widely adopted techniques for
representation learning, which further increase the demand for labeled data. However,
for many important practical problems there is relatively small amount of labeled
data available, so it is problematic to leverage full potential of the representation
learning methods. One way to overcome this obstacle is to invest substantial resources
into producing large labelled datasets. Unfortunately, this can be prohibitively
expensive in practice. In this thesis we focus on the alternative way of tackling
the aforementioned issue. We concentrate on methods, which make use of weakly-labeled
or even unlabeled data. Specifically, the first half of the thesis is dedicated
to the semantic image segmentation task. We develop a technique, which achieves
competitive segmentation performance and only requires annotations in a form of
global image-level labels instead of dense segmentation masks. Subsequently, we
present a new methodology, which further improves segmentation performance by
leveraging tiny additional feedback from a human annotator. By using our methods
practitioners can greatly reduce the amount of data annotation effort, which is
required to learn modern image segmentation models. In the second half of the
thesis we focus on methods for learning from unlabeled visual data. We study a
family of autoregressive models for modeling structure of natural images and discuss
potential applications of these models. Moreover, we conduct in-depth study of
one of these applications, where we develop the state-of-the-art model for the
probabilistic image colorization task.
acknowledgement: I also gratefully acknowledge the support of NVIDIA Corporation with
the donation of the GPUs used for this research.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Alexander
full_name: Kolesnikov, Alexander
id: 2D157DB6-F248-11E8-B48F-1D18A9856A87
last_name: Kolesnikov
citation:
ama: Kolesnikov A. Weakly-Supervised Segmentation and Unsupervised Modeling of Natural
Images. 2018. doi:10.15479/AT:ISTA:th_1021
apa: Kolesnikov, A. (2018). Weakly-Supervised Segmentation and Unsupervised Modeling
of Natural Images. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_1021
chicago: Kolesnikov, Alexander. “Weakly-Supervised Segmentation and Unsupervised
Modeling of Natural Images.” Institute of Science and Technology Austria, 2018.
https://doi.org/10.15479/AT:ISTA:th_1021.
ieee: A. Kolesnikov, “Weakly-Supervised Segmentation and Unsupervised Modeling of
Natural Images,” Institute of Science and Technology Austria, 2018.
ista: Kolesnikov A. 2018. Weakly-Supervised Segmentation and Unsupervised Modeling
of Natural Images. Institute of Science and Technology Austria.
mla: Kolesnikov, Alexander. Weakly-Supervised Segmentation and Unsupervised Modeling
of Natural Images. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_1021.
short: A. Kolesnikov, Weakly-Supervised Segmentation and Unsupervised Modeling of
Natural Images, Institute of Science and Technology Austria, 2018.
date_created: 2018-12-11T11:45:09Z
date_published: 2018-05-25T00:00:00Z
date_updated: 2023-09-07T12:51:46Z
day: '25'
ddc:
- '004'
degree_awarded: PhD
department:
- _id: ChLa
doi: 10.15479/AT:ISTA:th_1021
ec_funded: 1
file:
- access_level: open_access
checksum: bc678e02468d8ebc39dc7267dfb0a1c4
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:57Z
date_updated: 2020-07-14T12:45:22Z
file_id: '5113'
file_name: IST-2018-1021-v1+1_thesis-unsigned-pdfa.pdf
file_size: 12918758
relation: main_file
- access_level: closed
checksum: bc66973b086da5a043f1162dcfb1fde4
content_type: application/zip
creator: dernst
date_created: 2019-04-05T09:34:49Z
date_updated: 2020-07-14T12:45:22Z
file_id: '6225'
file_name: 2018_Thesis_Kolesnikov_source.zip
file_size: 55973760
relation: source_file
file_date_updated: 2020-07-14T12:45:22Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '113'
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7718'
pubrep_id: '1021'
status: public
supervisor:
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
title: Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '6774'
abstract:
- lang: eng
text: "A central problem of algebraic topology is to understand the homotopy groups
\ \U0001D70B\U0001D451(\U0001D44B) of a topological space X. For the computational
version of the problem, it is well known that there is no algorithm to decide
whether the fundamental group \U0001D70B1(\U0001D44B) of a given finite simplicial
complex X is trivial. On the other hand, there are several algorithms that, given
a finite simplicial complex X that is simply connected (i.e., with \U0001D70B1(\U0001D44B)
\ trivial), compute the higher homotopy group \U0001D70B\U0001D451(\U0001D44B)
\ for any given \U0001D451≥2 . However, these algorithms come with a caveat:
They compute the isomorphism type of \U0001D70B\U0001D451(\U0001D44B) , \U0001D451≥2
\ as an abstract finitely generated abelian group given by generators and relations,
but they work with very implicit representations of the elements of \U0001D70B\U0001D451(\U0001D44B)
. Converting elements of this abstract group into explicit geometric maps from
the d-dimensional sphere \U0001D446\U0001D451 to X has been one of the main
unsolved problems in the emerging field of computational homotopy theory. Here
we present an algorithm that, given a simply connected space X, computes \U0001D70B\U0001D451(\U0001D44B)
\ and represents its elements as simplicial maps from a suitable triangulation
of the d-sphere \U0001D446\U0001D451 to X. For fixed d, the algorithm runs
in time exponential in size(\U0001D44B) , the number of simplices of X. Moreover,
we prove that this is optimal: For every fixed \U0001D451≥2 , we construct a
family of simply connected spaces X such that for any simplicial map representing
a generator of \U0001D70B\U0001D451(\U0001D44B) , the size of the triangulation
of \U0001D446\U0001D451 on which the map is defined, is exponential in size(\U0001D44B)
."
article_type: original
author:
- first_name: Marek
full_name: Filakovský, Marek
id: 3E8AF77E-F248-11E8-B48F-1D18A9856A87
last_name: Filakovský
- first_name: Peter
full_name: Franek, Peter
id: 473294AE-F248-11E8-B48F-1D18A9856A87
last_name: Franek
orcid: 0000-0001-8878-8397
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
- first_name: Stephan Y
full_name: Zhechev, Stephan Y
id: 3AA52972-F248-11E8-B48F-1D18A9856A87
last_name: Zhechev
citation:
ama: Filakovský M, Franek P, Wagner U, Zhechev SY. Computing simplicial representatives
of homotopy group elements. Journal of Applied and Computational Topology.
2018;2(3-4):177-231. doi:10.1007/s41468-018-0021-5
apa: Filakovský, M., Franek, P., Wagner, U., & Zhechev, S. Y. (2018). Computing
simplicial representatives of homotopy group elements. Journal of Applied and
Computational Topology. Springer. https://doi.org/10.1007/s41468-018-0021-5
chicago: Filakovský, Marek, Peter Franek, Uli Wagner, and Stephan Y Zhechev. “Computing
Simplicial Representatives of Homotopy Group Elements.” Journal of Applied
and Computational Topology. Springer, 2018. https://doi.org/10.1007/s41468-018-0021-5.
ieee: M. Filakovský, P. Franek, U. Wagner, and S. Y. Zhechev, “Computing simplicial
representatives of homotopy group elements,” Journal of Applied and Computational
Topology, vol. 2, no. 3–4. Springer, pp. 177–231, 2018.
ista: Filakovský M, Franek P, Wagner U, Zhechev SY. 2018. Computing simplicial representatives
of homotopy group elements. Journal of Applied and Computational Topology. 2(3–4),
177–231.
mla: Filakovský, Marek, et al. “Computing Simplicial Representatives of Homotopy
Group Elements.” Journal of Applied and Computational Topology, vol. 2,
no. 3–4, Springer, 2018, pp. 177–231, doi:10.1007/s41468-018-0021-5.
short: M. Filakovský, P. Franek, U. Wagner, S.Y. Zhechev, Journal of Applied and
Computational Topology 2 (2018) 177–231.
date_created: 2019-08-08T06:47:40Z
date_published: 2018-12-01T00:00:00Z
date_updated: 2023-09-07T13:10:36Z
day: '01'
ddc:
- '514'
department:
- _id: UlWa
doi: 10.1007/s41468-018-0021-5
file:
- access_level: open_access
checksum: cf9e7fcd2a113dd4828774fc75cdb7e8
content_type: application/pdf
creator: dernst
date_created: 2019-08-08T06:55:21Z
date_updated: 2020-07-14T12:47:40Z
file_id: '6775'
file_name: 2018_JourAppliedComputTopology_Filakovsky.pdf
file_size: 1056278
relation: main_file
file_date_updated: 2020-07-14T12:47:40Z
has_accepted_license: '1'
intvolume: ' 2'
issue: 3-4
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 177-231
project:
- _id: 25F8B9BC-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M01980
name: Robust invariants of Nonlinear Systems
- _id: 3AC91DDA-15DF-11EA-824D-93A3E7B544D1
call_identifier: FWF
name: FWF Open Access Fund
publication: Journal of Applied and Computational Topology
publication_identifier:
eissn:
- 2367-1734
issn:
- 2367-1726
publication_status: published
publisher: Springer
quality_controlled: '1'
related_material:
record:
- id: '6681'
relation: dissertation_contains
status: public
status: public
title: Computing simplicial representatives of homotopy group elements
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2018'
...
---
_id: '133'
abstract:
- lang: eng
text: Synchronous programs are easy to specify because the side effects of an operation
are finished by the time the invocation of the operation returns to the caller.
Asynchronous programs, on the other hand, are difficult to specify because there
are side effects due to pending computation scheduled as a result of the invocation
of an operation. They are also difficult to verify because of the large number
of possible interleavings of concurrent computation threads. We present synchronization,
a new proof rule that simplifies the verification of asynchronous programs by
introducing the fiction, for proof purposes, that asynchronous operations complete
synchronously. Synchronization summarizes an asynchronous computation as immediate
atomic effect. Modular verification is enabled via pending asynchronous calls
in atomic summaries, and a complementary proof rule that eliminates pending asynchronous
calls when components and their specifications are composed. We evaluate synchronization
in the context of a multi-layer refinement verification methodology on a collection
of benchmark programs.
alternative_title:
- LIPIcs
article_number: '21'
author:
- first_name: Bernhard
full_name: Kragl, Bernhard
id: 320FC952-F248-11E8-B48F-1D18A9856A87
last_name: Kragl
orcid: 0000-0001-7745-9117
- first_name: Shaz
full_name: Qadeer, Shaz
last_name: Qadeer
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Kragl B, Qadeer S, Henzinger TA. Synchronizing the asynchronous. In: Vol 118.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.CONCUR.2018.21'
apa: 'Kragl, B., Qadeer, S., & Henzinger, T. A. (2018). Synchronizing the asynchronous
(Vol. 118). Presented at the CONCUR: International Conference on Concurrency Theory,
Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2018.21'
chicago: Kragl, Bernhard, Shaz Qadeer, and Thomas A Henzinger. “Synchronizing the
Asynchronous,” Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
https://doi.org/10.4230/LIPIcs.CONCUR.2018.21.
ieee: 'B. Kragl, S. Qadeer, and T. A. Henzinger, “Synchronizing the asynchronous,”
presented at the CONCUR: International Conference on Concurrency Theory, Beijing,
China, 2018, vol. 118.'
ista: 'Kragl B, Qadeer S, Henzinger TA. 2018. Synchronizing the asynchronous. CONCUR:
International Conference on Concurrency Theory, LIPIcs, vol. 118, 21.'
mla: Kragl, Bernhard, et al. Synchronizing the Asynchronous. Vol. 118, 21,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.CONCUR.2018.21.
short: B. Kragl, S. Qadeer, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2018.
conference:
end_date: 2018-09-07
location: Beijing, China
name: 'CONCUR: International Conference on Concurrency Theory'
start_date: 2018-09-04
date_created: 2018-12-11T11:44:48Z
date_published: 2018-08-13T00:00:00Z
date_updated: 2023-09-07T13:18:00Z
day: '13'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.CONCUR.2018.21
file:
- access_level: open_access
checksum: c90895f4c5fafc18ddc54d1c8848077e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:46Z
date_updated: 2020-07-14T12:44:44Z
file_id: '5368'
file_name: IST-2018-853-v2+2_concur2018.pdf
file_size: 745438
relation: main_file
file_date_updated: 2020-07-14T12:44:44Z
has_accepted_license: '1'
intvolume: ' 118'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication_identifier:
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7790'
pubrep_id: '1039'
quality_controlled: '1'
related_material:
record:
- id: '6426'
relation: earlier_version
status: public
- id: '8332'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Synchronizing the asynchronous
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 118
year: '2018'
...
---
_id: '187'
abstract:
- lang: eng
text: 'Given a locally finite X ⊆ ℝd and a radius r ≥ 0, the k-fold cover of X and
r consists of all points in ℝd that have k or more points of X within distance
r. We consider two filtrations - one in scale obtained by fixing k and increasing
r, and the other in depth obtained by fixing r and decreasing k - and we compute
the persistence diagrams of both. While standard methods suffice for the filtration
in scale, we need novel geometric and topological concepts for the filtration
in depth. In particular, we introduce a rhomboid tiling in ℝd+1 whose horizontal
integer slices are the order-k Delaunay mosaics of X, and construct a zigzag module
from Delaunay mosaics that is isomorphic to the persistence module of the multi-covers. '
acknowledgement: This work is partially supported by the DFG Collaborative Research
Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35
of the Austrian Science Fund (FWF).
alternative_title:
- LIPIcs
article_number: '34'
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Georg F
full_name: Osang, Georg F
id: 464B40D6-F248-11E8-B48F-1D18A9856A87
last_name: Osang
orcid: 0000-0002-8882-5116
citation:
ama: 'Edelsbrunner H, Osang GF. The multi-cover persistence of Euclidean balls.
In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.SoCG.2018.34'
apa: 'Edelsbrunner, H., & Osang, G. F. (2018). The multi-cover persistence of
Euclidean balls (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry,
Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.34'
chicago: Edelsbrunner, Herbert, and Georg F Osang. “The Multi-Cover Persistence
of Euclidean Balls,” Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.34.
ieee: 'H. Edelsbrunner and G. F. Osang, “The multi-cover persistence of Euclidean
balls,” presented at the SoCG: Symposium on Computational Geometry, Budapest,
Hungary, 2018, vol. 99.'
ista: 'Edelsbrunner H, Osang GF. 2018. The multi-cover persistence of Euclidean
balls. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 99, 34.'
mla: Edelsbrunner, Herbert, and Georg F. Osang. The Multi-Cover Persistence of
Euclidean Balls. Vol. 99, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2018, doi:10.4230/LIPIcs.SoCG.2018.34.
short: H. Edelsbrunner, G.F. Osang, in:, Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2018.
conference:
end_date: 2018-06-14
location: Budapest, Hungary
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2018-06-11
date_created: 2018-12-11T11:45:05Z
date_published: 2018-06-11T00:00:00Z
date_updated: 2023-09-07T13:29:00Z
day: '11'
ddc:
- '516'
department:
- _id: HeEd
doi: 10.4230/LIPIcs.SoCG.2018.34
file:
- access_level: open_access
checksum: d8c0533ad0018eb4ed1077475eb8fc18
content_type: application/pdf
creator: dernst
date_created: 2018-12-18T09:27:22Z
date_updated: 2020-07-14T12:45:19Z
file_id: '5738'
file_name: 2018_LIPIcs_Edelsbrunner_Osang.pdf
file_size: 528018
relation: main_file
file_date_updated: 2020-07-14T12:45:19Z
has_accepted_license: '1'
intvolume: ' 99'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I02979-N35
name: Persistence and stability of geometric complexes
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7732'
quality_controlled: '1'
related_material:
record:
- id: '9317'
relation: later_version
status: public
- id: '9056'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: The multi-cover persistence of Euclidean balls
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 99
year: '2018'
...
---
_id: '692'
abstract:
- lang: eng
text: We consider families of confocal conics and two pencils of Apollonian circles
having the same foci. We will show that these families of curves generate trivial
3-webs and find the exact formulas describing them.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
citation:
ama: Akopyan A. 3-Webs generated by confocal conics and circles. Geometriae Dedicata.
2018;194(1):55-64. doi:10.1007/s10711-017-0265-6
apa: Akopyan, A. (2018). 3-Webs generated by confocal conics and circles. Geometriae
Dedicata. Springer. https://doi.org/10.1007/s10711-017-0265-6
chicago: Akopyan, Arseniy. “3-Webs Generated by Confocal Conics and Circles.” Geometriae
Dedicata. Springer, 2018. https://doi.org/10.1007/s10711-017-0265-6.
ieee: A. Akopyan, “3-Webs generated by confocal conics and circles,” Geometriae
Dedicata, vol. 194, no. 1. Springer, pp. 55–64, 2018.
ista: Akopyan A. 2018. 3-Webs generated by confocal conics and circles. Geometriae
Dedicata. 194(1), 55–64.
mla: Akopyan, Arseniy. “3-Webs Generated by Confocal Conics and Circles.” Geometriae
Dedicata, vol. 194, no. 1, Springer, 2018, pp. 55–64, doi:10.1007/s10711-017-0265-6.
short: A. Akopyan, Geometriae Dedicata 194 (2018) 55–64.
date_created: 2018-12-11T11:47:57Z
date_published: 2018-06-01T00:00:00Z
date_updated: 2023-09-08T11:40:29Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1007/s10711-017-0265-6
ec_funded: 1
external_id:
isi:
- '000431418800004'
file:
- access_level: open_access
checksum: 1febcfc1266486053a069e3425ea3713
content_type: application/pdf
creator: kschuh
date_created: 2020-01-03T11:35:08Z
date_updated: 2020-07-14T12:47:44Z
file_id: '7222'
file_name: 2018_Springer_Akopyan.pdf
file_size: 1140860
relation: main_file
file_date_updated: 2020-07-14T12:47:44Z
has_accepted_license: '1'
intvolume: ' 194'
isi: 1
issue: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 55 - 64
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Geometriae Dedicata
publication_status: published
publisher: Springer
publist_id: '7014'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 3-Webs generated by confocal conics and circles
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: 194
year: '2018'
...
---
_id: '77'
abstract:
- lang: eng
text: Holes confined in quantum dots have gained considerable interest in the past
few years due to their potential as spin qubits. Here we demonstrate two-axis
control of a spin 3/2 qubit in natural Ge. The qubit is formed in a hut wire double
quantum dot device. The Pauli spin blockade principle allowed us to demonstrate
electric dipole spin resonance by applying a radio frequency electric field to
one of the electrodes defining the double quantum dot. Coherent hole spin oscillations
with Rabi frequencies reaching 140 MHz are demonstrated and dephasing times of
130 ns are measured. The reported results emphasize the potential of Ge as a platform
for fast and electrically tunable hole spin qubit devices.
acknowledged_ssus:
- _id: M-Shop
- _id: NanoFab
article_processing_charge: Yes
article_type: original
author:
- first_name: Hannes
full_name: Watzinger, Hannes
id: 35DF8E50-F248-11E8-B48F-1D18A9856A87
last_name: Watzinger
- first_name: Josip
full_name: Kukucka, Josip
id: 3F5D8856-F248-11E8-B48F-1D18A9856A87
last_name: Kukucka
- first_name: Lada
full_name: Vukusic, Lada
id: 31E9F056-F248-11E8-B48F-1D18A9856A87
last_name: Vukusic
orcid: 0000-0003-2424-8636
- first_name: Fei
full_name: Gao, Fei
last_name: Gao
- first_name: Ting
full_name: Wang, Ting
last_name: Wang
- first_name: Friedrich
full_name: Schäffler, Friedrich
last_name: Schäffler
- first_name: Jian
full_name: Zhang, Jian
last_name: Zhang
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
citation:
ama: Watzinger H, Kukucka J, Vukušić L, et al. A germanium hole spin qubit. Nature
Communications. 2018;9(3902). doi:10.1038/s41467-018-06418-4
apa: Watzinger, H., Kukucka, J., Vukušić, L., Gao, F., Wang, T., Schäffler, F.,
… Katsaros, G. (2018). A germanium hole spin qubit. Nature Communications.
Nature Publishing Group. https://doi.org/10.1038/s41467-018-06418-4
chicago: Watzinger, Hannes, Josip Kukucka, Lada Vukušić, Fei Gao, Ting Wang, Friedrich
Schäffler, Jian Zhang, and Georgios Katsaros. “A Germanium Hole Spin Qubit.” Nature
Communications. Nature Publishing Group, 2018. https://doi.org/10.1038/s41467-018-06418-4.
ieee: H. Watzinger et al., “A germanium hole spin qubit,” Nature Communications,
vol. 9, no. 3902. Nature Publishing Group, 2018.
ista: Watzinger H, Kukucka J, Vukušić L, Gao F, Wang T, Schäffler F, Zhang J, Katsaros
G. 2018. A germanium hole spin qubit. Nature Communications. 9(3902).
mla: Watzinger, Hannes, et al. “A Germanium Hole Spin Qubit.” Nature Communications,
vol. 9, no. 3902, Nature Publishing Group, 2018, doi:10.1038/s41467-018-06418-4.
short: H. Watzinger, J. Kukucka, L. Vukušić, F. Gao, T. Wang, F. Schäffler, J. Zhang,
G. Katsaros, Nature Communications 9 (2018).
date_created: 2018-12-11T11:44:30Z
date_published: 2018-09-25T00:00:00Z
date_updated: 2023-09-08T11:44:02Z
day: '25'
ddc:
- '530'
department:
- _id: GeKa
doi: 10.1038/s41467-018-06418-4
ec_funded: 1
external_id:
isi:
- '000445560800010'
file:
- access_level: open_access
checksum: e7148c10a64497e279c4de570b6cc544
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T10:28:30Z
date_updated: 2020-07-14T12:48:02Z
file_id: '5687'
file_name: 2018_NatureComm_Watzinger.pdf
file_size: 1063469
relation: main_file
file_date_updated: 2020-07-14T12:48:02Z
has_accepted_license: '1'
intvolume: ' 9'
isi: 1
issue: '3902 '
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 25517E86-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '335497'
name: Towards Spin qubits and Majorana fermions in Germanium selfassembled hut-wires
- _id: 2552F888-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Y00715
name: Loch Spin-Qubits und Majorana-Fermionen in Germanium
publication: Nature Communications
publication_status: published
publisher: Nature Publishing Group
quality_controlled: '1'
related_material:
record:
- id: '7977'
relation: popular_science
- id: '7996'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: A germanium hole spin qubit
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: 9
year: '2018'
...
---
_id: '401'
abstract:
- lang: eng
text: The actomyosin cytoskeleton, a key stress-producing unit in epithelial cells,
oscillates spontaneously in a wide variety of systems. Although much of the signal
cascade regulating myosin activity has been characterized, the origin of such
oscillatory behavior is still unclear. Here, we show that basal myosin II oscillation
in Drosophila ovarian epithelium is not controlled by actomyosin cortical tension,
but instead relies on a biochemical oscillator involving ROCK and myosin phosphatase.
Key to this oscillation is a diffusive ROCK flow, linking junctional Rho1 to medial
actomyosin cortex, and dynamically maintained by a self-activation loop reliant
on ROCK kinase activity. In response to the resulting myosin II recruitment, myosin
phosphatase is locally enriched and shuts off ROCK and myosin II signals. Coupling
Drosophila genetics, live imaging, modeling, and optogenetics, we uncover an intrinsic
biochemical oscillator at the core of myosin II regulatory network, shedding light
on the spatio-temporal dynamics of force generation.
article_number: '1210'
article_processing_charge: No
author:
- first_name: Xiang
full_name: Qin, Xiang
last_name: Qin
- first_name: Edouard B
full_name: Hannezo, Edouard B
id: 3A9DB764-F248-11E8-B48F-1D18A9856A87
last_name: Hannezo
orcid: 0000-0001-6005-1561
- first_name: Thomas
full_name: Mangeat, Thomas
last_name: Mangeat
- first_name: Chang
full_name: Liu, Chang
last_name: Liu
- first_name: Pralay
full_name: Majumder, Pralay
last_name: Majumder
- first_name: Jjiaying
full_name: Liu, Jjiaying
last_name: Liu
- first_name: Valerie
full_name: Choesmel Cadamuro, Valerie
last_name: Choesmel Cadamuro
- first_name: Jocelyn
full_name: Mcdonald, Jocelyn
last_name: Mcdonald
- first_name: Yinyao
full_name: Liu, Yinyao
last_name: Liu
- first_name: Bin
full_name: Yi, Bin
last_name: Yi
- first_name: Xiaobo
full_name: Wang, Xiaobo
last_name: Wang
citation:
ama: Qin X, Hannezo EB, Mangeat T, et al. A biochemical network controlling basal
myosin oscillation. Nature Communications. 2018;9(1). doi:10.1038/s41467-018-03574-5
apa: Qin, X., Hannezo, E. B., Mangeat, T., Liu, C., Majumder, P., Liu, J., … Wang,
X. (2018). A biochemical network controlling basal myosin oscillation. Nature
Communications. Nature Publishing Group. https://doi.org/10.1038/s41467-018-03574-5
chicago: Qin, Xiang, Edouard B Hannezo, Thomas Mangeat, Chang Liu, Pralay Majumder,
Jjiaying Liu, Valerie Choesmel Cadamuro, et al. “A Biochemical Network Controlling
Basal Myosin Oscillation.” Nature Communications. Nature Publishing Group,
2018. https://doi.org/10.1038/s41467-018-03574-5.
ieee: X. Qin et al., “A biochemical network controlling basal myosin oscillation,”
Nature Communications, vol. 9, no. 1. Nature Publishing Group, 2018.
ista: Qin X, Hannezo EB, Mangeat T, Liu C, Majumder P, Liu J, Choesmel Cadamuro
V, Mcdonald J, Liu Y, Yi B, Wang X. 2018. A biochemical network controlling basal
myosin oscillation. Nature Communications. 9(1), 1210.
mla: Qin, Xiang, et al. “A Biochemical Network Controlling Basal Myosin Oscillation.”
Nature Communications, vol. 9, no. 1, 1210, Nature Publishing Group, 2018,
doi:10.1038/s41467-018-03574-5.
short: X. Qin, E.B. Hannezo, T. Mangeat, C. Liu, P. Majumder, J. Liu, V. Choesmel
Cadamuro, J. Mcdonald, Y. Liu, B. Yi, X. Wang, Nature Communications 9 (2018).
date_created: 2018-12-11T11:46:16Z
date_published: 2018-03-23T00:00:00Z
date_updated: 2023-09-08T11:41:45Z
day: '23'
ddc:
- '539'
- '570'
department:
- _id: EdHa
doi: 10.1038/s41467-018-03574-5
external_id:
isi:
- '000428165400009'
file:
- access_level: open_access
checksum: 87a427bc2e8724be3dd22a4efdd21a33
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:45Z
date_updated: 2020-07-14T12:46:22Z
file_id: '4902'
file_name: IST-2018-996-v1+1_2018_Hannezo_A-biochemical.pdf
file_size: 3780491
relation: main_file
file_date_updated: 2020-07-14T12:46:22Z
has_accepted_license: '1'
intvolume: ' 9'
isi: 1
issue: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
publication: Nature Communications
publication_status: published
publisher: Nature Publishing Group
publist_id: '7427'
pubrep_id: '996'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A biochemical network controlling basal myosin oscillation
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: 9
year: '2018'
...
---
_id: '318'
abstract:
- lang: eng
text: The insect’s fat body combines metabolic and immunological functions. In this
issue of Developmental Cell, Franz et al. (2018) show that in Drosophila, cells
of the fat body are not static, but can actively “swim” toward sites of epithelial
injury, where they physically clog the wound and locally secrete antimicrobial
peptides.
acknowledgement: Short Survey
article_processing_charge: No
author:
- first_name: Alessandra M
full_name: Casano, Alessandra M
id: 3DBA3F4E-F248-11E8-B48F-1D18A9856A87
last_name: Casano
orcid: 0000-0002-6009-6804
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
citation:
ama: Casano AM, Sixt MK. A fat lot of good for wound healing. Developmental Cell.
2018;44(4):405-406. doi:10.1016/j.devcel.2018.02.009
apa: Casano, A. M., & Sixt, M. K. (2018). A fat lot of good for wound healing.
Developmental Cell. Cell Press. https://doi.org/10.1016/j.devcel.2018.02.009
chicago: Casano, Alessandra M, and Michael K Sixt. “A Fat Lot of Good for Wound
Healing.” Developmental Cell. Cell Press, 2018. https://doi.org/10.1016/j.devcel.2018.02.009.
ieee: A. M. Casano and M. K. Sixt, “A fat lot of good for wound healing,” Developmental
Cell, vol. 44, no. 4. Cell Press, pp. 405–406, 2018.
ista: Casano AM, Sixt MK. 2018. A fat lot of good for wound healing. Developmental
Cell. 44(4), 405–406.
mla: Casano, Alessandra M., and Michael K. Sixt. “A Fat Lot of Good for Wound Healing.”
Developmental Cell, vol. 44, no. 4, Cell Press, 2018, pp. 405–06, doi:10.1016/j.devcel.2018.02.009.
short: A.M. Casano, M.K. Sixt, Developmental Cell 44 (2018) 405–406.
date_created: 2018-12-11T11:45:47Z
date_published: 2018-02-26T00:00:00Z
date_updated: 2023-09-08T11:42:28Z
day: '26'
department:
- _id: MiSi
doi: 10.1016/j.devcel.2018.02.009
external_id:
isi:
- '000426150700002'
pmid:
- '29486189'
intvolume: ' 44'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pubmed/29486189
month: '02'
oa: 1
oa_version: Published Version
page: 405 - 406
pmid: 1
publication: Developmental Cell
publication_status: published
publisher: Cell Press
publist_id: '7547'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A fat lot of good for wound healing
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 44
year: '2018'
...
---
_id: '410'
abstract:
- lang: eng
text: Lesion verification and quantification is traditionally done via histological
examination of sectioned brains, a time-consuming process that relies heavily
on manual estimation. Such methods are particularly problematic in posterior cortical
regions (e.g. visual cortex), where sectioning leads to significant damage and
distortion of tissue. Even more challenging is the post hoc localization of micro-electrodes,
which relies on the same techniques, suffers from similar drawbacks and requires
even higher precision. Here, we propose a new, simple method for quantitative
lesion characterization and electrode localization that is less labor-intensive
and yields more detailed results than conventional methods. We leverage staining
techniques standard in electron microscopy with the use of commodity micro-CT
imaging. We stain whole rat and zebra finch brains in osmium tetroxide, embed
these in resin and scan entire brains in a micro-CT machine. The scans result
in 3D reconstructions of the brains with section thickness dependent on sample
size (12–15 and 5–6 microns for rat and zebra finch respectively) that can be
segmented manually or automatically. Because the method captures the entire intact
brain volume, comparisons within and across studies are more tractable, and the
extent of lesions and electrodes may be studied with higher accuracy than with
current methods.
article_number: '5184'
article_processing_charge: No
author:
- first_name: Javier
full_name: Masís, Javier
last_name: Masís
- first_name: David
full_name: Mankus, David
last_name: Mankus
- first_name: Steffen
full_name: Wolff, Steffen
last_name: Wolff
- first_name: Grigori
full_name: Guitchounts, Grigori
last_name: Guitchounts
- first_name: Maximilian A
full_name: Jösch, Maximilian A
id: 2BD278E6-F248-11E8-B48F-1D18A9856A87
last_name: Jösch
orcid: 0000-0002-3937-1330
- first_name: David
full_name: Cox, David
last_name: Cox
citation:
ama: Masís J, Mankus D, Wolff S, Guitchounts G, Jösch MA, Cox D. A micro-CT-based
method for quantitative brain lesion characterization and electrode localization.
Scientific Reports. 2018;8(1). doi:10.1038/s41598-018-23247-z
apa: Masís, J., Mankus, D., Wolff, S., Guitchounts, G., Jösch, M. A., & Cox,
D. (2018). A micro-CT-based method for quantitative brain lesion characterization
and electrode localization. Scientific Reports. Nature Publishing Group.
https://doi.org/10.1038/s41598-018-23247-z
chicago: Masís, Javier, David Mankus, Steffen Wolff, Grigori Guitchounts, Maximilian
A Jösch, and David Cox. “A Micro-CT-Based Method for Quantitative Brain Lesion
Characterization and Electrode Localization.” Scientific Reports. Nature
Publishing Group, 2018. https://doi.org/10.1038/s41598-018-23247-z.
ieee: J. Masís, D. Mankus, S. Wolff, G. Guitchounts, M. A. Jösch, and D. Cox, “A
micro-CT-based method for quantitative brain lesion characterization and electrode
localization,” Scientific Reports, vol. 8, no. 1. Nature Publishing Group,
2018.
ista: Masís J, Mankus D, Wolff S, Guitchounts G, Jösch MA, Cox D. 2018. A micro-CT-based
method for quantitative brain lesion characterization and electrode localization.
Scientific Reports. 8(1), 5184.
mla: Masís, Javier, et al. “A Micro-CT-Based Method for Quantitative Brain Lesion
Characterization and Electrode Localization.” Scientific Reports, vol.
8, no. 1, 5184, Nature Publishing Group, 2018, doi:10.1038/s41598-018-23247-z.
short: J. Masís, D. Mankus, S. Wolff, G. Guitchounts, M.A. Jösch, D. Cox, Scientific
Reports 8 (2018).
date_created: 2018-12-11T11:46:19Z
date_published: 2018-03-26T00:00:00Z
date_updated: 2023-09-08T11:48:39Z
day: '26'
ddc:
- '571'
- '572'
department:
- _id: MaJö
doi: 10.1038/s41598-018-23247-z
external_id:
isi:
- '000428234100005'
file:
- access_level: open_access
checksum: 653fcb852f899c75b00ceee2a670d738
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:42Z
date_updated: 2020-07-14T12:46:23Z
file_id: '4831'
file_name: IST-2018-994-v1+1_2018_Joesch_A-micro-CT-based.pdf
file_size: 2359430
relation: main_file
file_date_updated: 2020-07-14T12:46:23Z
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
issue: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
publication: Scientific Reports
publication_status: published
publisher: Nature Publishing Group
publist_id: '7419'
pubrep_id: '994'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A micro-CT-based method for quantitative brain lesion characterization and
electrode localization
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: 8
year: '2018'
...
---
_id: '277'
abstract:
- lang: eng
text: 'Arabidopsis and human ARM protein interact with telomerase. Deregulated mRNA
levels of DNA repair and ribosomal protein genes in an Arabidopsis arm mutant
suggest non-telomeric ARM function. The human homolog ARMC6 interacts with hTRF2.
Abstract: Telomerase maintains telomeres and has proposed non-telomeric functions.
We previously identified interaction of the C-terminal domain of Arabidopsis telomerase
reverse transcriptase (AtTERT) with an armadillo/β-catenin-like repeat (ARM) containing
protein. Here we explore protein–protein interactions of the ARM protein, AtTERT
domains, POT1a, TRF-like family and SMH family proteins, and the chromatin remodeling
protein CHR19 using bimolecular fluorescence complementation (BiFC), yeast two-hybrid
(Y2H) analysis, and co-immunoprecipitation. The ARM protein interacts with both
the N- and C-terminal domains of AtTERT in different cellular compartments. ARM
interacts with CHR19 and TRF-like I family proteins that also bind AtTERT directly
or through interaction with POT1a. The putative human ARM homolog co-precipitates
telomerase activity and interacts with hTRF2 protein in vitro. Analysis of Arabidopsis
arm mutants shows no obvious changes in telomere length or telomerase activity,
suggesting that ARM is not essential for telomere maintenance. The observed interactions
with telomerase and Myb-like domain proteins (TRF-like family I) may therefore
reflect possible non-telomeric functions. Transcript levels of several DNA repair
and ribosomal genes are affected in arm mutants, and ARM, likely in association
with other proteins, suppressed expression of XRCC3 and RPSAA promoter constructs
in luciferase reporter assays. In conclusion, ARM can participate in non-telomeric
functions of telomerase, and can also perform its own telomerase-independent functions.'
article_processing_charge: No
article_type: original
author:
- first_name: Ladislav
full_name: Dokládal, Ladislav
last_name: Dokládal
- first_name: Eva
full_name: Benková, Eva
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
- first_name: David
full_name: Honys, David
last_name: Honys
- first_name: Nikoleta
full_name: Dupláková, Nikoleta
last_name: Dupláková
- first_name: Lan
full_name: Lee, Lan
last_name: Lee
- first_name: Stanton
full_name: Gelvin, Stanton
last_name: Gelvin
- first_name: Eva
full_name: Sýkorová, Eva
last_name: Sýkorová
citation:
ama: Dokládal L, Benková E, Honys D, et al. An armadillo-domain protein participates
in a telomerase interaction network. Plant Molecular Biology. 2018;97(5):407-420.
doi:10.1007/s11103-018-0747-4
apa: Dokládal, L., Benková, E., Honys, D., Dupláková, N., Lee, L., Gelvin, S., &
Sýkorová, E. (2018). An armadillo-domain protein participates in a telomerase
interaction network. Plant Molecular Biology. Springer. https://doi.org/10.1007/s11103-018-0747-4
chicago: Dokládal, Ladislav, Eva Benková, David Honys, Nikoleta Dupláková, Lan Lee,
Stanton Gelvin, and Eva Sýkorová. “An Armadillo-Domain Protein Participates in
a Telomerase Interaction Network.” Plant Molecular Biology. Springer, 2018.
https://doi.org/10.1007/s11103-018-0747-4.
ieee: L. Dokládal et al., “An armadillo-domain protein participates in a
telomerase interaction network,” Plant Molecular Biology, vol. 97, no.
5. Springer, pp. 407–420, 2018.
ista: Dokládal L, Benková E, Honys D, Dupláková N, Lee L, Gelvin S, Sýkorová E.
2018. An armadillo-domain protein participates in a telomerase interaction network.
Plant Molecular Biology. 97(5), 407–420.
mla: Dokládal, Ladislav, et al. “An Armadillo-Domain Protein Participates in a Telomerase
Interaction Network.” Plant Molecular Biology, vol. 97, no. 5, Springer,
2018, pp. 407–20, doi:10.1007/s11103-018-0747-4.
short: L. Dokládal, E. Benková, D. Honys, N. Dupláková, L. Lee, S. Gelvin, E. Sýkorová,
Plant Molecular Biology 97 (2018) 407–420.
date_created: 2018-12-11T11:45:34Z
date_published: 2018-06-12T00:00:00Z
date_updated: 2023-09-08T13:21:05Z
day: '12'
ddc:
- '580'
department:
- _id: EvBe
doi: 10.1007/s11103-018-0747-4
external_id:
isi:
- '000438981700009'
file:
- access_level: open_access
checksum: 451ae47616e6af2533099f596b2a47fb
content_type: application/pdf
creator: dernst
date_created: 2020-05-14T12:23:08Z
date_updated: 2020-07-14T12:45:45Z
file_id: '7834'
file_name: 2018_PlantMolecBio_Dokladal.pdf
file_size: 1150679
relation: main_file
file_date_updated: 2020-07-14T12:45:45Z
has_accepted_license: '1'
intvolume: ' 97'
isi: 1
issue: '5'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 407 - 420
publication: Plant Molecular Biology
publication_status: published
publisher: Springer
publist_id: '7625'
quality_controlled: '1'
scopus_import: '1'
status: public
title: An armadillo-domain protein participates in a telomerase interaction network
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 97
year: '2018'
...
---
_id: '299'
abstract:
- lang: eng
text: We introduce in this paper AMT 2.0 , a tool for qualitative and quantitative
analysis of hybrid continuous and Boolean signals that combine numerical values
and discrete events. The evaluation of the signals is based on rich temporal specifications
expressed in extended Signal Temporal Logic (xSTL), which integrates Timed Regular
Expressions (TRE) within Signal Temporal Logic (STL). The tool features qualitative
monitoring (property satisfaction checking), trace diagnostics for explaining
and justifying property violations and specification-driven measurement of quantitative
features of the signal.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Dejan
full_name: Nickovic, Dejan
id: 41BCEE5C-F248-11E8-B48F-1D18A9856A87
last_name: Nickovic
- first_name: Olivier
full_name: Lebeltel, Olivier
last_name: Lebeltel
- first_name: Oded
full_name: Maler, Oded
last_name: Maler
- first_name: Thomas
full_name: Ferrere, Thomas
id: 40960E6E-F248-11E8-B48F-1D18A9856A87
last_name: Ferrere
orcid: 0000-0001-5199-3143
- first_name: Dogan
full_name: Ulus, Dogan
last_name: Ulus
citation:
ama: 'Nickovic D, Lebeltel O, Maler O, Ferrere T, Ulus D. AMT 2.0: Qualitative and
quantitative trace analysis with extended signal temporal logic. In: Beyer D,
Huisman M, eds. Vol 10806. Springer; 2018:303-319. doi:10.1007/978-3-319-89963-3_18'
apa: 'Nickovic, D., Lebeltel, O., Maler, O., Ferrere, T., & Ulus, D. (2018).
AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal
logic. In D. Beyer & M. Huisman (Eds.) (Vol. 10806, pp. 303–319). Presented
at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems,
Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-319-89963-3_18'
chicago: 'Nickovic, Dejan, Olivier Lebeltel, Oded Maler, Thomas Ferrere, and Dogan
Ulus. “AMT 2.0: Qualitative and Quantitative Trace Analysis with Extended Signal
Temporal Logic.” edited by Dirk Beyer and Marieke Huisman, 10806:303–19. Springer,
2018. https://doi.org/10.1007/978-3-319-89963-3_18.'
ieee: 'D. Nickovic, O. Lebeltel, O. Maler, T. Ferrere, and D. Ulus, “AMT 2.0: Qualitative
and quantitative trace analysis with extended signal temporal logic,” presented
at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems,
Thessaloniki, Greece, 2018, vol. 10806, pp. 303–319.'
ista: 'Nickovic D, Lebeltel O, Maler O, Ferrere T, Ulus D. 2018. AMT 2.0: Qualitative
and quantitative trace analysis with extended signal temporal logic. TACAS: Tools
and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10806,
303–319.'
mla: 'Nickovic, Dejan, et al. AMT 2.0: Qualitative and Quantitative Trace Analysis
with Extended Signal Temporal Logic. Edited by Dirk Beyer and Marieke Huisman,
vol. 10806, Springer, 2018, pp. 303–19, doi:10.1007/978-3-319-89963-3_18.'
short: D. Nickovic, O. Lebeltel, O. Maler, T. Ferrere, D. Ulus, in:, D. Beyer, M.
Huisman (Eds.), Springer, 2018, pp. 303–319.
conference:
end_date: 2018-04-20
location: Thessaloniki, Greece
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2018-04-14
date_created: 2018-12-11T11:45:41Z
date_published: 2018-04-14T00:00:00Z
date_updated: 2023-09-08T11:52:02Z
day: '14'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-319-89963-3_18
editor:
- first_name: Dirk
full_name: Beyer, Dirk
last_name: Beyer
- first_name: Marieke
full_name: Huisman, Marieke
last_name: Huisman
external_id:
isi:
- '00445822600018'
file:
- access_level: open_access
checksum: e11db3b9c8e27a1c7d1c738cc5e4d25a
content_type: application/pdf
creator: dernst
date_created: 2019-02-06T07:33:05Z
date_updated: 2020-07-14T12:45:58Z
file_id: '5928'
file_name: 2018_LNCS_Nickovic.pdf
file_size: 3267209
relation: main_file
file_date_updated: 2020-07-14T12:45:58Z
has_accepted_license: '1'
intvolume: ' 10806'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 303 - 319
publication_status: published
publisher: Springer
publist_id: '7582'
quality_controlled: '1'
related_material:
record:
- id: '10861'
relation: later_version
status: public
scopus_import: '1'
status: public
title: 'AMT 2.0: Qualitative and quantitative trace analysis with extended signal
temporal logic'
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10806
year: '2018'
...
---
_id: '413'
abstract:
- lang: eng
text: Being cared for when sick is a benefit of sociality that can reduce disease
and improve survival of group members. However, individuals providing care risk
contracting infectious diseases themselves. If they contract a low pathogen dose,
they may develop low-level infections that do not cause disease but still affect
host immunity by either decreasing or increasing the host’s vulnerability to subsequent
infections. Caring for contagious individuals can thus significantly alter the
future disease susceptibility of caregivers. Using ants and their fungal pathogens
as a model system, we tested if the altered disease susceptibility of experienced
caregivers, in turn, affects their expression of sanitary care behavior. We found
that low-level infections contracted during sanitary care had protective or neutral
effects on secondary exposure to the same (homologous) pathogen but consistently
caused high mortality on superinfection with a different (heterologous) pathogen.
In response to this risk, the ants selectively adjusted the expression of their
sanitary care. Specifically, the ants performed less grooming and more antimicrobial
disinfection when caring for nestmates contaminated with heterologous pathogens
compared with homologous ones. By modulating the components of sanitary care in
this way the ants acquired less infectious particles of the heterologous pathogens,
resulting in reduced superinfection. The performance of risk-adjusted sanitary
care reveals the remarkable capacity of ants to react to changes in their disease
susceptibility, according to their own infection history and to flexibly adjust
collective care to individual risk.
article_processing_charge: No
author:
- first_name: Matthias
full_name: Konrad, Matthias
id: 46528076-F248-11E8-B48F-1D18A9856A87
last_name: Konrad
- first_name: Christopher
full_name: Pull, Christopher
id: 3C7F4840-F248-11E8-B48F-1D18A9856A87
last_name: Pull
orcid: 0000-0003-1122-3982
- first_name: Sina
full_name: Metzler, Sina
id: 48204546-F248-11E8-B48F-1D18A9856A87
last_name: Metzler
orcid: 0000-0002-9547-2494
- first_name: Katharina
full_name: Seif, Katharina
id: 90F7894A-02CF-11E9-976E-E38CFE5CBC1D
last_name: Seif
- first_name: Elisabeth
full_name: Naderlinger, Elisabeth
id: 31757262-F248-11E8-B48F-1D18A9856A87
last_name: Naderlinger
- first_name: Anna V
full_name: Grasse, Anna V
id: 406F989C-F248-11E8-B48F-1D18A9856A87
last_name: Grasse
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
citation:
ama: Konrad M, Pull C, Metzler S, et al. Ants avoid superinfections by performing
risk-adjusted sanitary care. PNAS. 2018;115(11):2782-2787. doi:10.1073/pnas.1713501115
apa: Konrad, M., Pull, C., Metzler, S., Seif, K., Naderlinger, E., Grasse, A. V.,
& Cremer, S. (2018). Ants avoid superinfections by performing risk-adjusted
sanitary care. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1713501115
chicago: Konrad, Matthias, Christopher Pull, Sina Metzler, Katharina Seif, Elisabeth
Naderlinger, Anna V Grasse, and Sylvia Cremer. “Ants Avoid Superinfections by
Performing Risk-Adjusted Sanitary Care.” PNAS. National Academy of Sciences,
2018. https://doi.org/10.1073/pnas.1713501115.
ieee: M. Konrad et al., “Ants avoid superinfections by performing risk-adjusted
sanitary care,” PNAS, vol. 115, no. 11. National Academy of Sciences, pp.
2782–2787, 2018.
ista: Konrad M, Pull C, Metzler S, Seif K, Naderlinger E, Grasse AV, Cremer S. 2018.
Ants avoid superinfections by performing risk-adjusted sanitary care. PNAS. 115(11),
2782–2787.
mla: Konrad, Matthias, et al. “Ants Avoid Superinfections by Performing Risk-Adjusted
Sanitary Care.” PNAS, vol. 115, no. 11, National Academy of Sciences, 2018,
pp. 2782–87, doi:10.1073/pnas.1713501115.
short: M. Konrad, C. Pull, S. Metzler, K. Seif, E. Naderlinger, A.V. Grasse, S.
Cremer, PNAS 115 (2018) 2782–2787.
date_created: 2018-12-11T11:46:20Z
date_published: 2018-03-13T00:00:00Z
date_updated: 2023-09-08T13:22:21Z
day: '13'
department:
- _id: SyCr
doi: 10.1073/pnas.1713501115
ec_funded: 1
external_id:
isi:
- '000427245400069'
pmid:
- '29463746'
intvolume: ' 115'
isi: 1
issue: '11'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pubmed/29463746
month: '03'
oa: 1
oa_version: Published Version
page: 2782 - 2787
pmid: 1
project:
- _id: 25DC711C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '243071'
name: 'Social Vaccination in Ant Colonies: from Individual Mechanisms to Society
Effects'
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '7416'
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/helping-in-spite-of-risk-ants-perform-risk-averse-sanitary-care-of-infectious-nest-mates/
scopus_import: '1'
status: public
title: Ants avoid superinfections by performing risk-adjusted sanitary care
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 115
year: '2018'
...
---
_id: '195'
abstract:
- lang: eng
text: We demonstrate that identical impurities immersed in a two-dimensional many-particle
bath can be viewed as flux-tube-charged-particle composites described by fractional
statistics. In particular, we find that the bath manifests itself as an external
magnetic flux tube with respect to the impurities, and hence the time-reversal
symmetry is broken for the effective Hamiltonian describing the impurities. The
emerging flux tube acts as a statistical gauge field after a certain critical
coupling. This critical coupling corresponds to the intersection point between
the quasiparticle state and the phonon wing, where the angular momentum is transferred
from the impurity to the bath. This amounts to a novel configuration with emerging
anyons. The proposed setup paves the way to realizing anyons using electrons interacting
with superfluid helium or lattice phonons, as well as using atomic impurities
in ultracold gases.
article_number: '045402'
article_processing_charge: No
author:
- first_name: Enderalp
full_name: Yakaboylu, Enderalp
id: 38CB71F6-F248-11E8-B48F-1D18A9856A87
last_name: Yakaboylu
orcid: 0000-0001-5973-0874
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
citation:
ama: Yakaboylu E, Lemeshko M. Anyonic statistics of quantum impurities in two dimensions.
Physical Review B - Condensed Matter and Materials Physics. 2018;98(4).
doi:10.1103/PhysRevB.98.045402
apa: Yakaboylu, E., & Lemeshko, M. (2018). Anyonic statistics of quantum impurities
in two dimensions. Physical Review B - Condensed Matter and Materials Physics.
American Physical Society. https://doi.org/10.1103/PhysRevB.98.045402
chicago: Yakaboylu, Enderalp, and Mikhail Lemeshko. “Anyonic Statistics of Quantum
Impurities in Two Dimensions.” Physical Review B - Condensed Matter and Materials
Physics. American Physical Society, 2018. https://doi.org/10.1103/PhysRevB.98.045402.
ieee: E. Yakaboylu and M. Lemeshko, “Anyonic statistics of quantum impurities in
two dimensions,” Physical Review B - Condensed Matter and Materials Physics,
vol. 98, no. 4. American Physical Society, 2018.
ista: Yakaboylu E, Lemeshko M. 2018. Anyonic statistics of quantum impurities in
two dimensions. Physical Review B - Condensed Matter and Materials Physics. 98(4),
045402.
mla: Yakaboylu, Enderalp, and Mikhail Lemeshko. “Anyonic Statistics of Quantum Impurities
in Two Dimensions.” Physical Review B - Condensed Matter and Materials Physics,
vol. 98, no. 4, 045402, American Physical Society, 2018, doi:10.1103/PhysRevB.98.045402.
short: E. Yakaboylu, M. Lemeshko, Physical Review B - Condensed Matter and Materials
Physics 98 (2018).
date_created: 2018-12-11T11:45:08Z
date_published: 2018-07-15T00:00:00Z
date_updated: 2023-09-08T13:22:57Z
day: '15'
department:
- _id: MiLe
doi: 10.1103/PhysRevB.98.045402
ec_funded: 1
external_id:
arxiv:
- '1712.00308'
isi:
- '000436939100007'
intvolume: ' 98'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1712.00308
month: '07'
oa: 1
oa_version: Submitted Version
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 26031614-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P29902
name: Quantum rotations in the presence of a many-body environment
publication: Physical Review B - Condensed Matter and Materials Physics
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Anyonic statistics of quantum impurities in two dimensions
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 98
year: '2018'
...
---
_id: '203'
abstract:
- lang: eng
text: Asymmetric auxin distribution is instrumental for the differential growth
that causes organ bending on tropic stimuli and curvatures during plant development.
Local differences in auxin concentrations are achieved mainly by polarized cellular
distribution of PIN auxin transporters, but whether other mechanisms involving
auxin homeostasis are also relevant for the formation of auxin gradients is not
clear. Here we show that auxin methylation is required for asymmetric auxin distribution
across the hypocotyl, particularly during its response to gravity. We found that
loss-of-function mutants in Arabidopsis IAA CARBOXYL METHYLTRANSFERASE1 (IAMT1)
prematurely unfold the apical hook, and that their hypocotyls are impaired in
gravitropic reorientation. This defect is linked to an auxin-dependent increase
in PIN gene expression, leading to an increased polar auxin transport and lack
of asymmetric distribution of PIN3 in the iamt1 mutant. Gravitropic reorientation
in the iamt1 mutant could be restored with either endodermis-specific expression
of IAMT1 or partial inhibition of polar auxin transport, which also results in
normal PIN gene expression levels. We propose that IAA methylation is necessary
in gravity-sensing cells to restrict polar auxin transport within the range of
auxin levels that allow for differential responses.
article_processing_charge: No
author:
- first_name: Mohamad
full_name: Abbas, Mohamad
id: 47E8FC1C-F248-11E8-B48F-1D18A9856A87
last_name: Abbas
- first_name: García J
full_name: Hernández, García J
last_name: Hernández
- first_name: Stephan
full_name: Pollmann, Stephan
last_name: Pollmann
- first_name: Sophia L
full_name: Samodelov, Sophia L
last_name: Samodelov
- first_name: Martina
full_name: Kolb, Martina
last_name: Kolb
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Ulrich Z
full_name: Hammes, Ulrich Z
last_name: Hammes
- first_name: Matias D
full_name: Zurbriggen, Matias D
last_name: Zurbriggen
- first_name: Miguel
full_name: Blázquez, Miguel
last_name: Blázquez
- first_name: David
full_name: Alabadí, David
last_name: Alabadí
citation:
ama: Abbas M, Hernández GJ, Pollmann S, et al. Auxin methylation is required for
differential growth in Arabidopsis. PNAS. 2018;115(26):6864-6869. doi:10.1073/pnas.1806565115
apa: Abbas, M., Hernández, G. J., Pollmann, S., Samodelov, S. L., Kolb, M., Friml,
J., … Alabadí, D. (2018). Auxin methylation is required for differential growth
in Arabidopsis. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1806565115
chicago: Abbas, Mohamad, García J Hernández, Stephan Pollmann, Sophia L Samodelov,
Martina Kolb, Jiří Friml, Ulrich Z Hammes, Matias D Zurbriggen, Miguel Blázquez,
and David Alabadí. “Auxin Methylation Is Required for Differential Growth in Arabidopsis.”
PNAS. National Academy of Sciences, 2018. https://doi.org/10.1073/pnas.1806565115.
ieee: M. Abbas et al., “Auxin methylation is required for differential growth
in Arabidopsis,” PNAS, vol. 115, no. 26. National Academy of Sciences,
pp. 6864–6869, 2018.
ista: Abbas M, Hernández GJ, Pollmann S, Samodelov SL, Kolb M, Friml J, Hammes UZ,
Zurbriggen MD, Blázquez M, Alabadí D. 2018. Auxin methylation is required for
differential growth in Arabidopsis. PNAS. 115(26), 6864–6869.
mla: Abbas, Mohamad, et al. “Auxin Methylation Is Required for Differential Growth
in Arabidopsis.” PNAS, vol. 115, no. 26, National Academy of Sciences,
2018, pp. 6864–69, doi:10.1073/pnas.1806565115.
short: M. Abbas, G.J. Hernández, S. Pollmann, S.L. Samodelov, M. Kolb, J. Friml,
U.Z. Hammes, M.D. Zurbriggen, M. Blázquez, D. Alabadí, PNAS 115 (2018) 6864–6869.
date_created: 2018-12-11T11:45:11Z
date_published: 2018-06-26T00:00:00Z
date_updated: 2023-09-08T13:24:40Z
day: '26'
department:
- _id: JiFr
doi: 10.1073/pnas.1806565115
ec_funded: 1
external_id:
isi:
- '000436245000096'
intvolume: ' 115'
isi: 1
issue: '26'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://eprints.nottingham.ac.uk/52388/
month: '06'
oa: 1
oa_version: None
page: 6864-6869
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '282300'
name: Polarity and subcellular dynamics in plants
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '7710'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Auxin methylation is required for differential growth in Arabidopsis
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 115
year: '2018'
...
---
_id: '399'
abstract:
- lang: eng
text: Following an earlier calculation in 3D, we calculate the 2D critical temperature
of a dilute, translation-invariant Bose gas using a variational formulation of
the Bogoliubov approximation introduced by Critchley and Solomon in 1976. This
provides the first analytical calculation of the Kosterlitz-Thouless transition
temperature that includes the constant in the logarithm.
acknowledgement: We thank Robert Seiringer and Daniel Ueltschi for bringing the issue
of the change in critical temperature to our attention. We also thank the Erwin
Schrödinger Institute (all authors) and the Department of Mathematics, University
of Copenhagen (MN) for the hospitality during the period this work was carried out.
We gratefully acknowledge the financial support by the European Unions Seventh Framework
Programme under the ERC Grant Agreement Nos. 321029 (JPS and RR) and 337603 (RR)
as well as support by the VIL-LUM FONDEN via the QMATH Centre of Excellence (Grant
No. 10059) (JPS and RR), by the National Science Center (NCN) under grant No. 2016/21/D/ST1/02430
and the Austrian Science Fund (FWF) through project No. P 27533-N27 (MN).
article_number: '10007'
article_processing_charge: No
article_type: original
author:
- first_name: Marcin M
full_name: Napiórkowski, Marcin M
id: 4197AD04-F248-11E8-B48F-1D18A9856A87
last_name: Napiórkowski
- first_name: Robin
full_name: Reuvers, Robin
last_name: Reuvers
- first_name: Jan
full_name: Solovej, Jan
last_name: Solovej
citation:
ama: Napiórkowski MM, Reuvers R, Solovej J. Calculation of the critical temperature
of a dilute Bose gas in the Bogoliubov approximation. EPL. 2018;121(1).
doi:10.1209/0295-5075/121/10007
apa: Napiórkowski, M. M., Reuvers, R., & Solovej, J. (2018). Calculation of
the critical temperature of a dilute Bose gas in the Bogoliubov approximation.
EPL. IOP Publishing Ltd. https://doi.org/10.1209/0295-5075/121/10007
chicago: Napiórkowski, Marcin M, Robin Reuvers, and Jan Solovej. “Calculation of
the Critical Temperature of a Dilute Bose Gas in the Bogoliubov Approximation.”
EPL. IOP Publishing Ltd., 2018. https://doi.org/10.1209/0295-5075/121/10007.
ieee: M. M. Napiórkowski, R. Reuvers, and J. Solovej, “Calculation of the critical
temperature of a dilute Bose gas in the Bogoliubov approximation,” EPL,
vol. 121, no. 1. IOP Publishing Ltd., 2018.
ista: Napiórkowski MM, Reuvers R, Solovej J. 2018. Calculation of the critical temperature
of a dilute Bose gas in the Bogoliubov approximation. EPL. 121(1), 10007.
mla: Napiórkowski, Marcin M., et al. “Calculation of the Critical Temperature of
a Dilute Bose Gas in the Bogoliubov Approximation.” EPL, vol. 121, no.
1, 10007, IOP Publishing Ltd., 2018, doi:10.1209/0295-5075/121/10007.
short: M.M. Napiórkowski, R. Reuvers, J. Solovej, EPL 121 (2018).
date_created: 2018-12-11T11:46:15Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2023-09-08T13:30:51Z
day: '01'
department:
- _id: RoSe
doi: 10.1209/0295-5075/121/10007
external_id:
arxiv:
- '1706.01822'
isi:
- '000460003000003'
intvolume: ' 121'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1706.01822
month: '01'
oa: 1
oa_version: Preprint
project:
- _id: 25C878CE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P27533_N27
name: Structure of the Excitation Spectrum for Many-Body Quantum Systems
publication: EPL
publication_status: published
publisher: IOP Publishing Ltd.
publist_id: '7432'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Calculation of the critical temperature of a dilute Bose gas in the Bogoliubov
approximation
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 121
year: '2018'
...
---
_id: '5830'
abstract:
- lang: eng
text: CLE peptides have been implicated in various developmental processes of plants
and mediate their responses to environmental stimuli. However, the biological
relevance of most CLE genes remains to be functionally characterized. Here, we
report that CLE9, which is expressed in stomata, acts as an essential regulator
in the induction of stomatal closure. Exogenous application of CLE9 peptides or
overexpression of CLE9 effectively led to stomatal closure and enhanced drought
tolerance, whereas CLE9 loss-of-function mutants were sensitivity to drought stress.
CLE9-induced stomatal closure was impaired in abscisic acid (ABA)-deficient mutants,
indicating that ABA is required for CLE9-medaited guard cell signalling. We further
deciphered that two guard cell ABA-signalling components, OST1 and SLAC1, were
responsible for CLE9-induced stomatal closure. MPK3 and MPK6 were activated by
the CLE9 peptide, and CLE9 peptides failed to close stomata in mpk3 and mpk6 mutants.
In addition, CLE9 peptides stimulated the induction of hydrogen peroxide (H2O2)
and nitric oxide (NO) synthesis associated with stomatal closure, which was abolished
in the NADPH oxidase-deficient mutants or nitric reductase mutants, respectively.
Collectively, our results reveal a novel ABA-dependent function of CLE9 in the
regulation of stomatal apertures, thereby suggesting a potential role of CLE9
in the stress acclimatization of plants.
article_processing_charge: No
author:
- first_name: Luosha
full_name: Zhang, Luosha
last_name: Zhang
- first_name: Xiong
full_name: Shi, Xiong
last_name: Shi
- first_name: Yutao
full_name: Zhang, Yutao
last_name: Zhang
- first_name: Jiajing
full_name: Wang, Jiajing
last_name: Wang
- first_name: Jingwei
full_name: Yang, Jingwei
last_name: Yang
- first_name: Takashi
full_name: Ishida, Takashi
last_name: Ishida
- first_name: Wenqian
full_name: Jiang, Wenqian
last_name: Jiang
- first_name: Xiangyu
full_name: Han, Xiangyu
last_name: Han
- first_name: Jingke
full_name: Kang, Jingke
last_name: Kang
- first_name: Xuening
full_name: Wang, Xuening
last_name: Wang
- first_name: Lixia
full_name: Pan, Lixia
last_name: Pan
- first_name: Shuo
full_name: Lv, Shuo
last_name: Lv
- first_name: Bing
full_name: Cao, Bing
last_name: Cao
- first_name: Yonghong
full_name: Zhang, Yonghong
last_name: Zhang
- first_name: Jinbin
full_name: Wu, Jinbin
last_name: Wu
- first_name: Huibin
full_name: Han, Huibin
id: 31435098-F248-11E8-B48F-1D18A9856A87
last_name: Han
- first_name: Zhubing
full_name: Hu, Zhubing
last_name: Hu
- first_name: Langjun
full_name: Cui, Langjun
last_name: Cui
- first_name: Shinichiro
full_name: Sawa, Shinichiro
last_name: Sawa
- first_name: Junmin
full_name: He, Junmin
last_name: He
- first_name: Guodong
full_name: Wang, Guodong
last_name: Wang
citation:
ama: Zhang L, Shi X, Zhang Y, et al. CLE9 peptide-induced stomatal closure is mediated
by abscisic acid, hydrogen peroxide, and nitric oxide in arabidopsis thaliana.
Plant Cell and Environment. 2018. doi:10.1111/pce.13475
apa: Zhang, L., Shi, X., Zhang, Y., Wang, J., Yang, J., Ishida, T., … Wang, G. (2018).
CLE9 peptide-induced stomatal closure is mediated by abscisic acid, hydrogen peroxide,
and nitric oxide in arabidopsis thaliana. Plant Cell and Environment. Wiley.
https://doi.org/10.1111/pce.13475
chicago: Zhang, Luosha, Xiong Shi, Yutao Zhang, Jiajing Wang, Jingwei Yang, Takashi
Ishida, Wenqian Jiang, et al. “CLE9 Peptide-Induced Stomatal Closure Is Mediated
by Abscisic Acid, Hydrogen Peroxide, and Nitric Oxide in Arabidopsis Thaliana.”
Plant Cell and Environment. Wiley, 2018. https://doi.org/10.1111/pce.13475.
ieee: L. Zhang et al., “CLE9 peptide-induced stomatal closure is mediated
by abscisic acid, hydrogen peroxide, and nitric oxide in arabidopsis thaliana,”
Plant Cell and Environment. Wiley, 2018.
ista: Zhang L, Shi X, Zhang Y, Wang J, Yang J, Ishida T, Jiang W, Han X, Kang J,
Wang X, Pan L, Lv S, Cao B, Zhang Y, Wu J, Han H, Hu Z, Cui L, Sawa S, He J, Wang
G. 2018. CLE9 peptide-induced stomatal closure is mediated by abscisic acid, hydrogen
peroxide, and nitric oxide in arabidopsis thaliana. Plant Cell and Environment.
mla: Zhang, Luosha, et al. “CLE9 Peptide-Induced Stomatal Closure Is Mediated by
Abscisic Acid, Hydrogen Peroxide, and Nitric Oxide in Arabidopsis Thaliana.” Plant
Cell and Environment, Wiley, 2018, doi:10.1111/pce.13475.
short: L. Zhang, X. Shi, Y. Zhang, J. Wang, J. Yang, T. Ishida, W. Jiang, X. Han,
J. Kang, X. Wang, L. Pan, S. Lv, B. Cao, Y. Zhang, J. Wu, H. Han, Z. Hu, L. Cui,
S. Sawa, J. He, G. Wang, Plant Cell and Environment (2018).
date_created: 2019-01-13T22:59:11Z
date_published: 2018-10-31T00:00:00Z
date_updated: 2023-09-11T12:43:31Z
day: '31'
department:
- _id: JiFr
doi: 10.1111/pce.13475
external_id:
isi:
- '000459014800021'
pmid:
- '30378140'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pubmed/30378140
month: '10'
oa: 1
oa_version: Published Version
pmid: 1
publication: Plant Cell and Environment
publication_identifier:
issn:
- '01407791'
publication_status: epub_ahead
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: CLE9 peptide-induced stomatal closure is mediated by abscisic acid, hydrogen
peroxide, and nitric oxide in arabidopsis thaliana
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '288'
abstract:
- lang: eng
text: Recent lineage tracing studies have revealed that mammary gland homeostasis
relies on unipotent stem cells. However, whether and when lineage restriction
occurs during embryonic mammary development, and which signals orchestrate cell
fate specification, remain unknown. Using a combination of in vivo clonal analysis
with whole mount immunofluorescence and mathematical modelling of clonal dynamics,
we found that embryonic multipotent mammary cells become lineage-restricted surprisingly
early in development, with evidence for unipotency as early as E12.5 and no statistically
discernable bipotency after E15.5. To gain insights into the mechanisms governing
the switch from multipotency to unipotency, we used gain-of-function Notch1 mice
and demonstrated that Notch activation cell autonomously dictates luminal cell
fate specification to both embryonic and basally committed mammary cells. These
functional studies have important implications for understanding the signals underlying
cell plasticity and serve to clarify how reactivation of embryonic programs in
adult cells can lead to cancer.
article_processing_charge: No
article_type: original
author:
- first_name: Anna
full_name: Lilja, Anna
last_name: Lilja
- first_name: Veronica
full_name: Rodilla, Veronica
last_name: Rodilla
- first_name: Mathilde
full_name: Huyghe, Mathilde
last_name: Huyghe
- first_name: Edouard B
full_name: Hannezo, Edouard B
id: 3A9DB764-F248-11E8-B48F-1D18A9856A87
last_name: Hannezo
orcid: 0000-0001-6005-1561
- first_name: Camille
full_name: Landragin, Camille
last_name: Landragin
- first_name: Olivier
full_name: Renaud, Olivier
last_name: Renaud
- first_name: Olivier
full_name: Leroy, Olivier
last_name: Leroy
- first_name: Steffen
full_name: Rulands, Steffen
last_name: Rulands
- first_name: Benjamin
full_name: Simons, Benjamin
last_name: Simons
- first_name: Silvia
full_name: Fré, Silvia
last_name: Fré
citation:
ama: Lilja A, Rodilla V, Huyghe M, et al. Clonal analysis of Notch1-expressing cells
reveals the existence of unipotent stem cells that retain long-term plasticity
in the embryonic mammary gland. Nature Cell Biology. 2018;20(6):677-687.
doi:10.1038/s41556-018-0108-1
apa: Lilja, A., Rodilla, V., Huyghe, M., Hannezo, E. B., Landragin, C., Renaud,
O., … Fré, S. (2018). Clonal analysis of Notch1-expressing cells reveals the existence
of unipotent stem cells that retain long-term plasticity in the embryonic mammary
gland. Nature Cell Biology. Nature Publishing Group. https://doi.org/10.1038/s41556-018-0108-1
chicago: Lilja, Anna, Veronica Rodilla, Mathilde Huyghe, Edouard B Hannezo, Camille
Landragin, Olivier Renaud, Olivier Leroy, Steffen Rulands, Benjamin Simons, and
Silvia Fré. “Clonal Analysis of Notch1-Expressing Cells Reveals the Existence
of Unipotent Stem Cells That Retain Long-Term Plasticity in the Embryonic Mammary
Gland.” Nature Cell Biology. Nature Publishing Group, 2018. https://doi.org/10.1038/s41556-018-0108-1.
ieee: A. Lilja et al., “Clonal analysis of Notch1-expressing cells reveals
the existence of unipotent stem cells that retain long-term plasticity in the
embryonic mammary gland,” Nature Cell Biology, vol. 20, no. 6. Nature Publishing
Group, pp. 677–687, 2018.
ista: Lilja A, Rodilla V, Huyghe M, Hannezo EB, Landragin C, Renaud O, Leroy O,
Rulands S, Simons B, Fré S. 2018. Clonal analysis of Notch1-expressing cells reveals
the existence of unipotent stem cells that retain long-term plasticity in the
embryonic mammary gland. Nature Cell Biology. 20(6), 677–687.
mla: Lilja, Anna, et al. “Clonal Analysis of Notch1-Expressing Cells Reveals the
Existence of Unipotent Stem Cells That Retain Long-Term Plasticity in the Embryonic
Mammary Gland.” Nature Cell Biology, vol. 20, no. 6, Nature Publishing
Group, 2018, pp. 677–87, doi:10.1038/s41556-018-0108-1.
short: A. Lilja, V. Rodilla, M. Huyghe, E.B. Hannezo, C. Landragin, O. Renaud, O.
Leroy, S. Rulands, B. Simons, S. Fré, Nature Cell Biology 20 (2018) 677–687.
date_created: 2018-12-11T11:45:38Z
date_published: 2018-05-21T00:00:00Z
date_updated: 2023-09-11T12:44:08Z
day: '21'
department:
- _id: EdHa
doi: 10.1038/s41556-018-0108-1
external_id:
isi:
- '000433237300003'
pmid:
- '29784917'
intvolume: ' 20'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6984964
month: '05'
oa: 1
oa_version: Submitted Version
page: 677 - 687
pmid: 1
publication: Nature Cell Biology
publication_status: published
publisher: Nature Publishing Group
publist_id: '7594'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Clonal analysis of Notch1-expressing cells reveals the existence of unipotent
stem cells that retain long-term plasticity in the embryonic mammary gland
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 20
year: '2018'
...
---
_id: '304'
abstract:
- lang: eng
text: "Additive manufacturing has recently seen drastic improvements in resolution,
making it now possible to fabricate features at scales of hundreds or even dozens
of nanometers, which previously required very expensive lithographic methods.\r\nAs
a result, additive manufacturing now seems poised for optical applications, including
those relevant to computer graphics, such as material design, as well as display
and imaging applications.\r\n \r\nIn this work, we explore the use of additive
manufacturing for generating structural colors, where the structures are designed
using a fabrication-aware optimization process.\r\nThis requires a combination
of full-wave simulation, a feasible parameterization of the design space, and
a tailored optimization procedure.\r\nMany of these components should be re-usable
for the design of other optical structures at this scale.\r\n \r\nWe show initial
results of material samples fabricated based on our designs.\r\nWhile these suffer
from the prototype character of state-of-the-art fabrication hardware, we believe
they clearly demonstrate the potential of additive nanofabrication for structural
colors and other graphics applications."
acknowledgement: This work was in part supported by King Abdullah University of Science
and Technology Baseline Funding.
alternative_title:
- ACM Transactions on Graphics
article_number: '159'
article_processing_charge: No
author:
- first_name: Thomas
full_name: Auzinger, Thomas
id: 4718F954-F248-11E8-B48F-1D18A9856A87
last_name: Auzinger
orcid: 0000-0002-1546-3265
- first_name: Wolfgang
full_name: Heidrich, Wolfgang
last_name: Heidrich
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
citation:
ama: Auzinger T, Heidrich W, Bickel B. Computational design of nanostructural color
for additive manufacturing. ACM Transactions on Graphics. 2018;37(4). doi:10.1145/3197517.3201376
apa: Auzinger, T., Heidrich, W., & Bickel, B. (2018). Computational design of
nanostructural color for additive manufacturing. ACM Transactions on Graphics.
ACM. https://doi.org/10.1145/3197517.3201376
chicago: Auzinger, Thomas, Wolfgang Heidrich, and Bernd Bickel. “Computational Design
of Nanostructural Color for Additive Manufacturing.” ACM Transactions on Graphics.
ACM, 2018. https://doi.org/10.1145/3197517.3201376.
ieee: T. Auzinger, W. Heidrich, and B. Bickel, “Computational design of nanostructural
color for additive manufacturing,” ACM Transactions on Graphics, vol. 37,
no. 4. ACM, 2018.
ista: Auzinger T, Heidrich W, Bickel B. 2018. Computational design of nanostructural
color for additive manufacturing. ACM Transactions on Graphics. 37(4), 159.
mla: Auzinger, Thomas, et al. “Computational Design of Nanostructural Color for
Additive Manufacturing.” ACM Transactions on Graphics, vol. 37, no. 4,
159, ACM, 2018, doi:10.1145/3197517.3201376.
short: T. Auzinger, W. Heidrich, B. Bickel, ACM Transactions on Graphics 37 (2018).
date_created: 2018-12-11T11:45:43Z
date_published: 2018-08-01T00:00:00Z
date_updated: 2023-09-11T12:46:13Z
day: '01'
ddc:
- '000'
- '535'
- '680'
department:
- _id: BeBi
doi: 10.1145/3197517.3201376
ec_funded: 1
external_id:
isi:
- '000448185000120'
file:
- access_level: open_access
checksum: dcdcc955a4c1c6d2599aeebb97d2e7b9
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:14Z
date_updated: 2020-07-14T12:45:59Z
file_id: '5334'
file_name: IST-2018-1024-v1+1_NanoStructColor-Auzinger-paper.pdf
file_size: 10751684
relation: main_file
- access_level: open_access
checksum: cae52b3a8d5e97be84771cd61ea2f75e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:15Z
date_updated: 2020-07-14T12:45:59Z
file_id: '5335'
file_name: IST-2018-1024-v1+2_NanoStructColor-Auzinger-supplemental.pdf
file_size: 20755095
relation: main_file
- access_level: open_access
checksum: 76dd90648f75779d3f64e324b6daaffe
content_type: image/jpeg
creator: system
date_created: 2018-12-12T10:18:16Z
date_updated: 2020-07-14T12:45:59Z
file_id: '5336'
file_name: IST-2018-1024-v1+3_NanoStructColor-Auzinger-image.jpg
file_size: 2186944
relation: main_file
- access_level: open_access
checksum: c3a5b775a0ecdb20ccefb8d9646ec140
content_type: application/x-7z-compressed
creator: system
date_created: 2018-12-12T10:18:17Z
date_updated: 2020-07-14T12:45:59Z
file_id: '5337'
file_name: IST-2018-1024-v1+4_NanoStructColor-Auzinger-blueprint.7z
file_size: 2734352
relation: main_file
- access_level: open_access
checksum: dcdcc955a4c1c6d2599aeebb97d2e7b9
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:18Z
date_updated: 2020-07-14T12:45:59Z
file_id: '5338'
file_name: IST-2018-1024-v2+1_NanoStructColor-Auzinger-paper.pdf
file_size: 10751684
relation: main_file
- access_level: open_access
checksum: 76dd90648f75779d3f64e324b6daaffe
content_type: image/jpeg
creator: system
date_created: 2018-12-12T10:18:19Z
date_updated: 2020-07-14T12:45:59Z
file_id: '5339'
file_name: IST-2018-1024-v2+3_NanoStructColor-Auzinger-image.jpg
file_size: 2186944
relation: main_file
- access_level: open_access
checksum: c3a5b775a0ecdb20ccefb8d9646ec140
content_type: application/x-7z-compressed
creator: system
date_created: 2018-12-12T10:18:20Z
date_updated: 2020-07-14T12:45:59Z
file_id: '5340'
file_name: IST-2018-1024-v2+4_NanoStructColor-Auzinger-blueprint.7z
file_size: 2734352
relation: main_file
- access_level: open_access
checksum: 667e91b686db41e44d855a4fb2137402
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:21Z
date_updated: 2020-07-14T12:45:59Z
file_id: '5341'
file_name: IST-2018-1024-v2+5_NanoStructColor-Auzinger-supplemental.pdf
file_size: 20755762
relation: main_file
- access_level: open_access
checksum: dcdcc955a4c1c6d2599aeebb97d2e7b9
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:22Z
date_updated: 2020-07-14T12:45:59Z
file_id: '5342'
file_name: IST-2018-1024-v3+1_NanoStructColor-Auzinger-paper.pdf
file_size: 10751684
relation: main_file
- access_level: open_access
checksum: 76dd90648f75779d3f64e324b6daaffe
content_type: image/jpeg
creator: system
date_created: 2018-12-12T10:18:22Z
date_updated: 2020-07-14T12:45:59Z
file_id: '5343'
file_name: IST-2018-1024-v3+3_NanoStructColor-Auzinger-image.jpg
file_size: 2186944
relation: main_file
- access_level: open_access
checksum: c3a5b775a0ecdb20ccefb8d9646ec140
content_type: application/x-7z-compressed
creator: system
date_created: 2018-12-12T10:18:23Z
date_updated: 2020-07-14T12:45:59Z
file_id: '5344'
file_name: IST-2018-1024-v3+4_NanoStructColor-Auzinger-blueprint.7z
file_size: 2734352
relation: main_file
- access_level: open_access
checksum: 667e91b686db41e44d855a4fb2137402
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:24Z
date_updated: 2020-07-14T12:45:59Z
file_id: '5345'
file_name: IST-2018-1024-v3+5_NanoStructColor-Auzinger-supplemental.pdf
file_size: 20755762
relation: main_file
- access_level: open_access
checksum: 72dce35388fb1aa7953df4d9ae3d02f1
content_type: application/vnd.openxmlformats-officedocument.presentationml.presentation
creator: system
date_created: 2018-12-12T10:18:25Z
date_updated: 2020-07-14T12:45:59Z
file_id: '5346'
file_name: IST-2018-1024-v3+6_NanoStructColor-Auzinger-presentation.pptx
file_size: 69698068
relation: main_file
file_date_updated: 2020-07-14T12:45:59Z
has_accepted_license: '1'
intvolume: ' 37'
isi: 1
issue: '4'
language:
- iso: eng
month: '08'
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_status: published
publisher: ACM
pubrep_id: '1028'
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/color-effects-from-transparent-3d-printed-nanostructures/
scopus_import: '1'
status: public
title: Computational design of nanostructural color for additive manufacturing
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 37
year: '2018'
...
---
_id: '12'
abstract:
- lang: eng
text: Molding is a popular mass production method, in which the initial expenses
for the mold are offset by the low per-unit production cost. However, the physical
fabrication constraints of the molding technique commonly restrict the shape of
moldable objects. For a complex shape, a decomposition of the object into moldable
parts is a common strategy to address these constraints, with plastic model kits
being a popular and illustrative example. However, conducting such a decomposition
requires considerable expertise, and it depends on the technical aspects of the
fabrication technique, as well as aesthetic considerations. We present an interactive
technique to create such decompositions for two-piece molding, in which each part
of the object is cast between two rigid mold pieces. Given the surface description
of an object, we decompose its thin-shell equivalent into moldable parts by first
performing a coarse decomposition and then utilizing an active contour model for
the boundaries between individual parts. Formulated as an optimization problem,
the movement of the contours is guided by an energy reflecting fabrication constraints
to ensure the moldability of each part. Simultaneously, the user is provided with
editing capabilities to enforce aesthetic guidelines. Our interactive interface
provides control of the contour positions by allowing, for example, the alignment
of part boundaries with object features. Our technique enables a novel workflow,
as it empowers novice users to explore the design space, and it generates fabrication-ready
two-piece molds that can be used either for casting or industrial injection molding
of free-form objects.
article_number: '135'
article_processing_charge: No
author:
- first_name: Kazutaka
full_name: Nakashima, Kazutaka
last_name: Nakashima
- first_name: Thomas
full_name: Auzinger, Thomas
id: 4718F954-F248-11E8-B48F-1D18A9856A87
last_name: Auzinger
orcid: 0000-0002-1546-3265
- first_name: Emmanuel
full_name: Iarussi, Emmanuel
id: 33F19F16-F248-11E8-B48F-1D18A9856A87
last_name: Iarussi
- first_name: Ran
full_name: Zhang, Ran
id: 4DDBCEB0-F248-11E8-B48F-1D18A9856A87
last_name: Zhang
orcid: 0000-0002-3808-281X
- first_name: Takeo
full_name: Igarashi, Takeo
last_name: Igarashi
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
citation:
ama: 'Nakashima K, Auzinger T, Iarussi E, Zhang R, Igarashi T, Bickel B. CoreCavity:
Interactive shell decomposition for fabrication with two-piece rigid molds. ACM
Transaction on Graphics. 2018;37(4). doi:10.1145/3197517.3201341'
apa: 'Nakashima, K., Auzinger, T., Iarussi, E., Zhang, R., Igarashi, T., & Bickel,
B. (2018). CoreCavity: Interactive shell decomposition for fabrication with two-piece
rigid molds. ACM Transaction on Graphics. ACM. https://doi.org/10.1145/3197517.3201341'
chicago: 'Nakashima, Kazutaka, Thomas Auzinger, Emmanuel Iarussi, Ran Zhang, Takeo
Igarashi, and Bernd Bickel. “CoreCavity: Interactive Shell Decomposition for Fabrication
with Two-Piece Rigid Molds.” ACM Transaction on Graphics. ACM, 2018. https://doi.org/10.1145/3197517.3201341.'
ieee: 'K. Nakashima, T. Auzinger, E. Iarussi, R. Zhang, T. Igarashi, and B. Bickel,
“CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid
molds,” ACM Transaction on Graphics, vol. 37, no. 4. ACM, 2018.'
ista: 'Nakashima K, Auzinger T, Iarussi E, Zhang R, Igarashi T, Bickel B. 2018.
CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid
molds. ACM Transaction on Graphics. 37(4), 135.'
mla: 'Nakashima, Kazutaka, et al. “CoreCavity: Interactive Shell Decomposition for
Fabrication with Two-Piece Rigid Molds.” ACM Transaction on Graphics, vol.
37, no. 4, 135, ACM, 2018, doi:10.1145/3197517.3201341.'
short: K. Nakashima, T. Auzinger, E. Iarussi, R. Zhang, T. Igarashi, B. Bickel,
ACM Transaction on Graphics 37 (2018).
date_created: 2018-12-11T11:44:09Z
date_published: 2018-08-04T00:00:00Z
date_updated: 2023-09-11T12:48:09Z
day: '04'
ddc:
- '004'
- '516'
- '670'
department:
- _id: BeBi
doi: 10.1145/3197517.3201341
ec_funded: 1
external_id:
isi:
- '000448185000096'
file:
- access_level: open_access
checksum: 6a5368bc86c4e1a9fcfe588fd1f14ee8
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:38Z
date_updated: 2020-07-14T12:44:38Z
file_id: '5360'
file_name: IST-2018-1037-v1+1_CoreCavity-AuthorVersion.pdf
file_size: 104225664
relation: main_file
- access_level: open_access
checksum: 3861e693ba47c51f3ec7b7867d573a61
content_type: application/zip
creator: system
date_created: 2018-12-12T10:18:39Z
date_updated: 2020-07-14T12:44:38Z
file_id: '5361'
file_name: IST-2018-1037-v1+2_CoreCavity-Supplemental.zip
file_size: 377743553
relation: main_file
- access_level: open_access
checksum: 490040c685ed869536e2a18f5a906b94
content_type: video/vnd.objectvideo
creator: system
date_created: 2018-12-12T10:18:41Z
date_updated: 2020-07-14T12:44:38Z
file_id: '5362'
file_name: IST-2018-1037-v1+3_CoreCavity-Video.mp4
file_size: 162634396
relation: main_file
- access_level: open_access
checksum: be7fc8b229adda727419b6504b3b9352
content_type: image/jpeg
creator: system
date_created: 2018-12-12T10:18:42Z
date_updated: 2020-07-14T12:44:38Z
file_id: '5363'
file_name: IST-2018-1037-v1+4_CoreCavity-RepresentativeImage.jpg
file_size: 527972
relation: main_file
file_date_updated: 2020-07-14T12:44:38Z
has_accepted_license: '1'
intvolume: ' 37'
isi: 1
issue: '4'
language:
- iso: eng
month: '08'
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'
- _id: 2508E324-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '642841'
name: Distributed 3D Object Design
publication: ACM Transaction on Graphics
publication_status: published
publisher: ACM
publist_id: '8044'
pubrep_id: '1037'
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/interactive-software-tool-makes-complex-mold-design-simple/
scopus_import: '1'
status: public
title: 'CoreCavity: Interactive shell decomposition for fabrication with two-piece
rigid molds'
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 37
year: '2018'
...
---
_id: '454'
abstract:
- lang: eng
text: Direct reciprocity is a mechanism for cooperation among humans. Many of our
daily interactions are repeated. We interact repeatedly with our family, friends,
colleagues, members of the local and even global community. In the theory of repeated
games, it is a tacit assumption that the various games that a person plays simultaneously
have no effect on each other. Here we introduce a general framework that allows
us to analyze “crosstalk” between a player’s concurrent games. In the presence
of crosstalk, the action a person experiences in one game can alter the person’s
decision in another. We find that crosstalk impedes the maintenance of cooperation
and requires stronger levels of forgiveness. The magnitude of the effect depends
on the population structure. In more densely connected social groups, crosstalk
has a stronger effect. A harsh retaliator, such as Tit-for-Tat, is unable to counteract
crosstalk. The crosstalk framework provides a unified interpretation of direct
and upstream reciprocity in the context of repeated games.
acknowledgement: "This work was supported by the European Research Council (ERC) start
grant 279307: Graph Games (C.K.), Austrian Science Fund (FWF) grant no P23499-N23
(C.K.), FWF\r\nNFN grant no S11407-N23 RiSE/SHiNE (C.K.), Office of Naval Research
grant N00014-16-1-2914 (M.A.N.), National Cancer Institute grant CA179991 (M.A.N.)
and by the John Templeton Foundation. J.G.R. is supported by an Erwin Schrödinger
fellowship\r\n(Austrian Science Fund FWF J-3996). C.H. acknowledges generous support
from the\r\nISTFELLOW program. The Program for Evolutionary Dynamics is supported
in part by\r\na gift from B Wu and Eric Larson."
article_number: '555'
article_processing_charge: No
author:
- first_name: Johannes
full_name: Reiter, Johannes
id: 4A918E98-F248-11E8-B48F-1D18A9856A87
last_name: Reiter
orcid: 0000-0002-0170-7353
- first_name: Christian
full_name: Hilbe, Christian
id: 2FDF8F3C-F248-11E8-B48F-1D18A9856A87
last_name: Hilbe
orcid: 0000-0001-5116-955X
- first_name: David
full_name: Rand, David
last_name: Rand
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Reiter J, Hilbe C, Rand D, Chatterjee K, Nowak M. Crosstalk in concurrent repeated
games impedes direct reciprocity and requires stronger levels of forgiveness.
Nature Communications. 2018;9(1). doi:10.1038/s41467-017-02721-8
apa: Reiter, J., Hilbe, C., Rand, D., Chatterjee, K., & Nowak, M. (2018). Crosstalk
in concurrent repeated games impedes direct reciprocity and requires stronger
levels of forgiveness. Nature Communications. Nature Publishing Group.
https://doi.org/10.1038/s41467-017-02721-8
chicago: Reiter, Johannes, Christian Hilbe, David Rand, Krishnendu Chatterjee, and
Martin Nowak. “Crosstalk in Concurrent Repeated Games Impedes Direct Reciprocity
and Requires Stronger Levels of Forgiveness.” Nature Communications. Nature
Publishing Group, 2018. https://doi.org/10.1038/s41467-017-02721-8.
ieee: J. Reiter, C. Hilbe, D. Rand, K. Chatterjee, and M. Nowak, “Crosstalk in concurrent
repeated games impedes direct reciprocity and requires stronger levels of forgiveness,”
Nature Communications, vol. 9, no. 1. Nature Publishing Group, 2018.
ista: Reiter J, Hilbe C, Rand D, Chatterjee K, Nowak M. 2018. Crosstalk in concurrent
repeated games impedes direct reciprocity and requires stronger levels of forgiveness.
Nature Communications. 9(1), 555.
mla: Reiter, Johannes, et al. “Crosstalk in Concurrent Repeated Games Impedes Direct
Reciprocity and Requires Stronger Levels of Forgiveness.” Nature Communications,
vol. 9, no. 1, 555, Nature Publishing Group, 2018, doi:10.1038/s41467-017-02721-8.
short: J. Reiter, C. Hilbe, D. Rand, K. Chatterjee, M. Nowak, Nature Communications
9 (2018).
date_created: 2018-12-11T11:46:34Z
date_published: 2018-02-07T00:00:00Z
date_updated: 2023-09-11T12:51:03Z
day: '07'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.1038/s41467-017-02721-8
ec_funded: 1
external_id:
isi:
- '000424318200001'
file:
- access_level: open_access
checksum: b6b90367545b4c615891c960ab0567f1
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:18Z
date_updated: 2020-07-14T12:46:31Z
file_id: '4741'
file_name: IST-2018-964-v1+1_2018_Hilbe_Crosstalk_in.pdf
file_size: 843646
relation: main_file
file_date_updated: 2020-07-14T12:46:31Z
has_accepted_license: '1'
intvolume: ' 9'
isi: 1
issue: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _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: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Nature Communications
publication_status: published
publisher: Nature Publishing Group
publist_id: '7368'
pubrep_id: '964'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Crosstalk in concurrent repeated games impedes direct reciprocity and requires
stronger levels of forgiveness
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: 9
year: '2018'
...
---
_id: '320'
abstract:
- lang: eng
text: 'Fast-spiking, parvalbumin-expressing GABAergic interneurons (PV+-BCs) express
a complex machinery of rapid signaling mechanisms, including specialized voltage-gated
ion channels to generate brief action potentials (APs). However, short APs are
associated with overlapping Na+ and K+ fluxes and are therefore energetically
expensive. How the potentially vicious combination of high AP frequency and inefficient
spike generation can be reconciled with limited energy supply is presently unclear.
To address this question, we performed direct recordings from the PV+-BC axon,
the subcellular structure where active conductances for AP initiation and propagation
are located. Surprisingly, the energy required for the AP was, on average, only
∼1.6 times the theoretical minimum. High energy efficiency emerged from the combination
of fast inactivation of Na+ channels and delayed activation of Kv3-type K+ channels,
which minimized ion flux overlap during APs. Thus, the complementary tuning of
axonal Na+ and K+ channel gating optimizes both fast signaling properties and
metabolic efficiency. Hu et al. demonstrate that action potentials in parvalbumin-expressing
GABAergic interneuron axons are energetically efficient, which is highly unexpected
given their brief duration. High energy efficiency emerges from the combination
of fast inactivation of voltage-gated Na+ channels and delayed activation of Kv3
channels in the axon. '
article_processing_charge: Yes (in subscription journal)
author:
- first_name: Hua
full_name: Hu, Hua
id: 4AC0145C-F248-11E8-B48F-1D18A9856A87
last_name: Hu
- first_name: Fabian
full_name: Roth, Fabian
last_name: Roth
- first_name: David H
full_name: Vandael, David H
id: 3AE48E0A-F248-11E8-B48F-1D18A9856A87
last_name: Vandael
orcid: 0000-0001-7577-1676
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Hu H, Roth F, Vandael DH, Jonas PM. Complementary tuning of Na+ and K+ channel
gating underlies fast and energy-efficient action potentials in GABAergic interneuron
axons. Neuron. 2018;98(1):156-165. doi:10.1016/j.neuron.2018.02.024
apa: Hu, H., Roth, F., Vandael, D. H., & Jonas, P. M. (2018). Complementary
tuning of Na+ and K+ channel gating underlies fast and energy-efficient action
potentials in GABAergic interneuron axons. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2018.02.024
chicago: Hu, Hua, Fabian Roth, David H Vandael, and Peter M Jonas. “Complementary
Tuning of Na+ and K+ Channel Gating Underlies Fast and Energy-Efficient Action
Potentials in GABAergic Interneuron Axons.” Neuron. Elsevier, 2018. https://doi.org/10.1016/j.neuron.2018.02.024.
ieee: H. Hu, F. Roth, D. H. Vandael, and P. M. Jonas, “Complementary tuning of Na+
and K+ channel gating underlies fast and energy-efficient action potentials in
GABAergic interneuron axons,” Neuron, vol. 98, no. 1. Elsevier, pp. 156–165,
2018.
ista: Hu H, Roth F, Vandael DH, Jonas PM. 2018. Complementary tuning of Na+ and
K+ channel gating underlies fast and energy-efficient action potentials in GABAergic
interneuron axons. Neuron. 98(1), 156–165.
mla: Hu, Hua, et al. “Complementary Tuning of Na+ and K+ Channel Gating Underlies
Fast and Energy-Efficient Action Potentials in GABAergic Interneuron Axons.” Neuron,
vol. 98, no. 1, Elsevier, 2018, pp. 156–65, doi:10.1016/j.neuron.2018.02.024.
short: H. Hu, F. Roth, D.H. Vandael, P.M. Jonas, Neuron 98 (2018) 156–165.
date_created: 2018-12-11T11:45:48Z
date_published: 2018-04-04T00:00:00Z
date_updated: 2023-09-11T12:45:10Z
day: '04'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.1016/j.neuron.2018.02.024
ec_funded: 1
external_id:
isi:
- '000429192100016'
file:
- access_level: open_access
checksum: 76070f3729f9c603e1080d0151aa2b11
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T10:37:50Z
date_updated: 2020-07-14T12:46:03Z
file_id: '5690'
file_name: 2018_Neuron_Hu.pdf
file_size: 3180444
relation: main_file
file_date_updated: 2020-07-14T12:46:03Z
has_accepted_license: '1'
intvolume: ' 98'
isi: 1
issue: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 156 - 165
project:
- _id: 25C0F108-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '268548'
name: Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons
- _id: 25B7EB9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '692692'
name: Biophysics and circuit function of a giant cortical glumatergic synapse
- _id: 25C26B1E-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P24909-B24
name: Mechanisms of transmitter release at GABAergic synapses
- _id: 25C5A090-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00312
name: The Wittgenstein Prize
publication: Neuron
publication_status: published
publisher: Elsevier
publist_id: '7545'
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/a-certain-type-of-neurons-is-more-energy-efficient-than-previously-assumed/
scopus_import: '1'
status: public
title: Complementary tuning of Na+ and K+ channel gating underlies fast and energy-efficient
action potentials in GABAergic interneuron axons
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: 98
year: '2018'
...
---
_id: '423'
abstract:
- lang: eng
text: Herd immunity, a process in which resistant individuals limit the spread of
a pathogen among susceptible hosts has been extensively studied in eukaryotes.
Even though bacteria have evolved multiple immune systems against their phage
pathogens, herd immunity in bacteria remains unexplored. Here we experimentally
demonstrate that herd immunity arises during phage epidemics in structured and
unstructured Escherichia coli populations consisting of differing frequencies
of susceptible and resistant cells harboring CRISPR immunity. In addition, we
develop a mathematical model that quantifies how herd immunity is affected by
spatial population structure, bacterial growth rate, and phage replication rate.
Using our model we infer a general epidemiological rule describing the relative
speed of an epidemic in partially resistant spatially structured populations.
Our experimental and theoretical findings indicate that herd immunity may be important
in bacterial communities, allowing for stable coexistence of bacteria and their
phages and the maintenance of polymorphism in bacterial immunity.
acknowledgement: "We are grateful to Remy Chait for his help and assistance with establishing
our experimental setups and to Tobias Bergmiller for valuable insights into some
specific experimental details. We thank Luciano Marraffini for donating us the pCas9
plasmid used in this study. We also want to express our gratitude to Seth Barribeau,
Andrea Betancourt, Călin Guet, Mato Lagator, Tiago Paixão and Maroš Pleška for valuable
discussions on the manuscript. Finally, we would like to thank the \r\neditors and
reviewers for their helpful comments and suggestions."
article_number: e32035
article_processing_charge: No
author:
- first_name: Pavel
full_name: Payne, Pavel
id: 35F78294-F248-11E8-B48F-1D18A9856A87
last_name: Payne
orcid: 0000-0002-2711-9453
- first_name: Lukas
full_name: Geyrhofer, Lukas
last_name: Geyrhofer
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Jonathan P
full_name: Bollback, Jonathan P
id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
last_name: Bollback
orcid: 0000-0002-4624-4612
citation:
ama: Payne P, Geyrhofer L, Barton NH, Bollback JP. CRISPR-based herd immunity can
limit phage epidemics in bacterial populations. eLife. 2018;7. doi:10.7554/eLife.32035
apa: Payne, P., Geyrhofer, L., Barton, N. H., & Bollback, J. P. (2018). CRISPR-based
herd immunity can limit phage epidemics in bacterial populations. ELife.
eLife Sciences Publications. https://doi.org/10.7554/eLife.32035
chicago: Payne, Pavel, Lukas Geyrhofer, Nicholas H Barton, and Jonathan P Bollback.
“CRISPR-Based Herd Immunity Can Limit Phage Epidemics in Bacterial Populations.”
ELife. eLife Sciences Publications, 2018. https://doi.org/10.7554/eLife.32035.
ieee: P. Payne, L. Geyrhofer, N. H. Barton, and J. P. Bollback, “CRISPR-based herd
immunity can limit phage epidemics in bacterial populations,” eLife, vol.
7. eLife Sciences Publications, 2018.
ista: Payne P, Geyrhofer L, Barton NH, Bollback JP. 2018. CRISPR-based herd immunity
can limit phage epidemics in bacterial populations. eLife. 7, e32035.
mla: Payne, Pavel, et al. “CRISPR-Based Herd Immunity Can Limit Phage Epidemics
in Bacterial Populations.” ELife, vol. 7, e32035, eLife Sciences Publications,
2018, doi:10.7554/eLife.32035.
short: P. Payne, L. Geyrhofer, N.H. Barton, J.P. Bollback, ELife 7 (2018).
date_created: 2018-12-11T11:46:23Z
date_published: 2018-03-09T00:00:00Z
date_updated: 2023-09-11T12:49:17Z
day: '09'
ddc:
- '576'
department:
- _id: NiBa
- _id: JoBo
doi: 10.7554/eLife.32035
ec_funded: 1
external_id:
isi:
- '000431035800001'
file:
- access_level: open_access
checksum: 447cf6e680bdc3c01062a8737d876569
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T10:36:07Z
date_updated: 2020-07-14T12:46:25Z
file_id: '5689'
file_name: 2018_eLife_Payne.pdf
file_size: 3533881
relation: main_file
file_date_updated: 2020-07-14T12:46:25Z
has_accepted_license: '1'
intvolume: ' 7'
isi: 1
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
project:
- _id: 2578D616-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '648440'
name: Selective Barriers to Horizontal Gene Transfer
publication: eLife
publication_status: published
publisher: eLife Sciences Publications
publist_id: '7400'
quality_controlled: '1'
related_material:
record:
- id: '9840'
relation: research_data
status: public
scopus_import: '1'
status: public
title: CRISPR-based herd immunity can limit phage epidemics in bacterial populations
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: 7
year: '2018'
...
---
_id: '5791'
abstract:
- lang: eng
text: Due to data compression or low resolution, nearby vertices and edges of a
graph drawing may be bundled to a common node or arc. We model such a “compromised”
drawing by a piecewise linear map φ:G → ℝ. We wish to perturb φ by an arbitrarily
small ε>0 into a proper drawing (in which the vertices are distinct points, any
two edges intersect in finitely many points, and no three edges have a common
interior point) that minimizes the number of crossings. An ε-perturbation, for
every ε>0, is given by a piecewise linear map (Formula Presented), where with
||·|| is the uniform norm (i.e., sup norm). We present a polynomial-time solution
for this optimization problem when G is a cycle and the map φ has no spurs (i.e.,
no two adjacent edges are mapped to overlapping arcs). We also show that the problem
becomes NP-complete (i) when G is an arbitrary graph and φ has no spurs, and (ii)
when φ may have spurs and G is a cycle or a union of disjoint paths.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: Csaba D.
full_name: Tóth, Csaba D.
last_name: Tóth
citation:
ama: 'Fulek R, Tóth CD. Crossing minimization in perturbed drawings. In: Vol 11282.
Springer; 2018:229-241. doi:10.1007/978-3-030-04414-5_16'
apa: 'Fulek, R., & Tóth, C. D. (2018). Crossing minimization in perturbed drawings
(Vol. 11282, pp. 229–241). Presented at the Graph Drawing and Network Visualization,
Barcelona, Spain: Springer. https://doi.org/10.1007/978-3-030-04414-5_16'
chicago: Fulek, Radoslav, and Csaba D. Tóth. “Crossing Minimization in Perturbed
Drawings,” 11282:229–41. Springer, 2018. https://doi.org/10.1007/978-3-030-04414-5_16.
ieee: R. Fulek and C. D. Tóth, “Crossing minimization in perturbed drawings,” presented
at the Graph Drawing and Network Visualization, Barcelona, Spain, 2018, vol. 11282,
pp. 229–241.
ista: Fulek R, Tóth CD. 2018. Crossing minimization in perturbed drawings. Graph
Drawing and Network Visualization, LNCS, vol. 11282, 229–241.
mla: Fulek, Radoslav, and Csaba D. Tóth. Crossing Minimization in Perturbed Drawings.
Vol. 11282, Springer, 2018, pp. 229–41, doi:10.1007/978-3-030-04414-5_16.
short: R. Fulek, C.D. Tóth, in:, Springer, 2018, pp. 229–241.
conference:
end_date: 2018-09-28
location: Barcelona, Spain
name: Graph Drawing and Network Visualization
start_date: 2018-09-26
date_created: 2018-12-30T22:59:15Z
date_published: 2018-12-18T00:00:00Z
date_updated: 2023-09-11T12:49:55Z
day: '18'
department:
- _id: UlWa
doi: 10.1007/978-3-030-04414-5_16
external_id:
arxiv:
- '1808.07608'
isi:
- '000672802500016'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1808.07608
month: '12'
oa: 1
oa_version: Preprint
page: 229-241
publication_identifier:
isbn:
- '9783030044138'
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
status: public
title: Crossing minimization in perturbed drawings
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: '11282 '
year: '2018'
...
---
_id: '291'
abstract:
- lang: eng
text: Over the past decade, the edge of chaos has proven to be a fruitful starting
point for investigations of shear flows when the laminar base flow is linearly
stable. Numerous computational studies of shear flows demonstrated the existence
of states that separate laminar and turbulent regions of the state space. In addition,
some studies determined invariant solutions that reside on this edge. In this
paper, we study the unstable manifold of one such solution with the aid of continuous
symmetry reduction, which we formulate here for the simultaneous quotiening of
axial and azimuthal symmetries. Upon our investigation of the unstable manifold,
we discover a previously unknown traveling-wave solution on the laminar-turbulent
boundary with a relatively complex structure. By means of low-dimensional projections,
we visualize different dynamical paths that connect these solutions to the turbulence.
Our numerical experiments demonstrate that the laminar-turbulent boundary exhibits
qualitatively different regions whose properties are influenced by the nearby
invariant solutions.
article_number: '054401'
article_processing_charge: No
author:
- first_name: Nazmi B
full_name: Budanur, Nazmi B
id: 3EA1010E-F248-11E8-B48F-1D18A9856A87
last_name: Budanur
orcid: 0000-0003-0423-5010
- 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: Budanur NB, Hof B. Complexity of the laminar-turbulent boundary in pipe flow.
Physical Review Fluids. 2018;3(5). doi:10.1103/PhysRevFluids.3.054401
apa: Budanur, N. B., & Hof, B. (2018). Complexity of the laminar-turbulent boundary
in pipe flow. Physical Review Fluids. American Physical Society. https://doi.org/10.1103/PhysRevFluids.3.054401
chicago: Budanur, Nazmi B, and Björn Hof. “Complexity of the Laminar-Turbulent Boundary
in Pipe Flow.” Physical Review Fluids. American Physical Society, 2018.
https://doi.org/10.1103/PhysRevFluids.3.054401.
ieee: N. B. Budanur and B. Hof, “Complexity of the laminar-turbulent boundary in
pipe flow,” Physical Review Fluids, vol. 3, no. 5. American Physical Society,
2018.
ista: Budanur NB, Hof B. 2018. Complexity of the laminar-turbulent boundary in pipe
flow. Physical Review Fluids. 3(5), 054401.
mla: Budanur, Nazmi B., and Björn Hof. “Complexity of the Laminar-Turbulent Boundary
in Pipe Flow.” Physical Review Fluids, vol. 3, no. 5, 054401, American
Physical Society, 2018, doi:10.1103/PhysRevFluids.3.054401.
short: N.B. Budanur, B. Hof, Physical Review Fluids 3 (2018).
date_created: 2018-12-11T11:45:39Z
date_published: 2018-05-30T00:00:00Z
date_updated: 2023-09-11T12:45:44Z
day: '30'
department:
- _id: BjHo
doi: 10.1103/PhysRevFluids.3.054401
external_id:
arxiv:
- '1802.01918'
isi:
- '000433426200001'
intvolume: ' 3'
isi: 1
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1802.01918
month: '05'
oa: 1
oa_version: Preprint
publication: Physical Review Fluids
publication_status: published
publisher: American Physical Society
publist_id: '7590'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Complexity of the laminar-turbulent boundary in pipe flow
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 3
year: '2018'
...
---
_id: '58'
abstract:
- lang: eng
text: 'Inside a two-dimensional region (``cake""), there are m nonoverlapping
tiles of a certain kind (``toppings""). We want to expand the toppings
while keeping them nonoverlapping, and possibly add some blank pieces of the same
``certain kind,"" such that the entire cake is covered. How many blanks
must we add? We study this question in several cases: (1) The cake and toppings
are general polygons. (2) The cake and toppings are convex figures. (3) The cake
and toppings are axis-parallel rectangles. (4) The cake is an axis-parallel rectilinear
polygon and the toppings are axis-parallel rectangles. In all four cases, we provide
tight bounds on the number of blanks.'
article_processing_charge: No
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Erel
full_name: Segal Halevi, Erel
last_name: Segal Halevi
citation:
ama: Akopyan A, Segal Halevi E. Counting blanks in polygonal arrangements. SIAM
Journal on Discrete Mathematics. 2018;32(3):2242-2257. doi:10.1137/16M110407X
apa: Akopyan, A., & Segal Halevi, E. (2018). Counting blanks in polygonal arrangements.
SIAM Journal on Discrete Mathematics. Society for Industrial and Applied
Mathematics . https://doi.org/10.1137/16M110407X
chicago: Akopyan, Arseniy, and Erel Segal Halevi. “Counting Blanks in Polygonal
Arrangements.” SIAM Journal on Discrete Mathematics. Society for Industrial
and Applied Mathematics , 2018. https://doi.org/10.1137/16M110407X.
ieee: A. Akopyan and E. Segal Halevi, “Counting blanks in polygonal arrangements,”
SIAM Journal on Discrete Mathematics, vol. 32, no. 3. Society for Industrial
and Applied Mathematics , pp. 2242–2257, 2018.
ista: Akopyan A, Segal Halevi E. 2018. Counting blanks in polygonal arrangements.
SIAM Journal on Discrete Mathematics. 32(3), 2242–2257.
mla: Akopyan, Arseniy, and Erel Segal Halevi. “Counting Blanks in Polygonal Arrangements.”
SIAM Journal on Discrete Mathematics, vol. 32, no. 3, Society for Industrial
and Applied Mathematics , 2018, pp. 2242–57, doi:10.1137/16M110407X.
short: A. Akopyan, E. Segal Halevi, SIAM Journal on Discrete Mathematics 32 (2018)
2242–2257.
date_created: 2018-12-11T11:44:24Z
date_published: 2018-09-06T00:00:00Z
date_updated: 2023-09-11T12:48:39Z
day: '06'
department:
- _id: HeEd
doi: 10.1137/16M110407X
ec_funded: 1
external_id:
arxiv:
- '1604.00960'
isi:
- '000450810500036'
intvolume: ' 32'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1604.00960
month: '09'
oa: 1
oa_version: Preprint
page: 2242 - 2257
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: SIAM Journal on Discrete Mathematics
publication_status: published
publisher: 'Society for Industrial and Applied Mathematics '
publist_id: '7996'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Counting blanks in polygonal arrangements
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 32
year: '2018'
...
---
_id: '9840'
abstract:
- lang: eng
text: Herd immunity, a process in which resistant individuals limit the spread of
a pathogen among susceptible hosts has been extensively studied in eukaryotes.
Even though bacteria have evolved multiple immune systems against their phage
pathogens, herd immunity in bacteria remains unexplored. Here we experimentally
demonstrate that herd immunity arises during phage epidemics in structured and
unstructured Escherichia coli populations consisting of differing frequencies
of susceptible and resistant cells harboring CRISPR immunity. In addition, we
develop a mathematical model that quantifies how herd immunity is affected by
spatial population structure, bacterial growth rate, and phage replication rate.
Using our model we infer a general epidemiological rule describing the relative
speed of an epidemic in partially resistant spatially structured populations.
Our experimental and theoretical findings indicate that herd immunity may be important
in bacterial communities, allowing for stable coexistence of bacteria and their
phages and the maintenance of polymorphism in bacterial immunity.
article_processing_charge: No
author:
- first_name: Pavel
full_name: Payne, Pavel
id: 35F78294-F248-11E8-B48F-1D18A9856A87
last_name: Payne
orcid: 0000-0002-2711-9453
- first_name: Lukas
full_name: Geyrhofer, Lukas
last_name: Geyrhofer
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Jonathan P
full_name: Bollback, Jonathan P
id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
last_name: Bollback
orcid: 0000-0002-4624-4612
citation:
ama: 'Payne P, Geyrhofer L, Barton NH, Bollback JP. Data from: CRISPR-based herd
immunity limits phage epidemics in bacterial populations. 2018. doi:10.5061/dryad.42n44'
apa: 'Payne, P., Geyrhofer, L., Barton, N. H., & Bollback, J. P. (2018). Data
from: CRISPR-based herd immunity limits phage epidemics in bacterial populations.
Dryad. https://doi.org/10.5061/dryad.42n44'
chicago: 'Payne, Pavel, Lukas Geyrhofer, Nicholas H Barton, and Jonathan P Bollback.
“Data from: CRISPR-Based Herd Immunity Limits Phage Epidemics in Bacterial Populations.”
Dryad, 2018. https://doi.org/10.5061/dryad.42n44.'
ieee: 'P. Payne, L. Geyrhofer, N. H. Barton, and J. P. Bollback, “Data from: CRISPR-based
herd immunity limits phage epidemics in bacterial populations.” Dryad, 2018.'
ista: 'Payne P, Geyrhofer L, Barton NH, Bollback JP. 2018. Data from: CRISPR-based
herd immunity limits phage epidemics in bacterial populations, Dryad, 10.5061/dryad.42n44.'
mla: 'Payne, Pavel, et al. Data from: CRISPR-Based Herd Immunity Limits Phage
Epidemics in Bacterial Populations. Dryad, 2018, doi:10.5061/dryad.42n44.'
short: P. Payne, L. Geyrhofer, N.H. Barton, J.P. Bollback, (2018).
date_created: 2021-08-09T13:10:02Z
date_published: 2018-03-12T00:00:00Z
date_updated: 2023-09-11T12:49:17Z
day: '12'
department:
- _id: NiBa
- _id: JoBo
doi: 10.5061/dryad.42n44
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.42n44
month: '03'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '423'
relation: used_in_publication
status: public
status: public
title: 'Data from: CRISPR-based herd immunity limits phage epidemics in bacterial
populations'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2018'
...