---
_id: '705'
abstract:
- lang: eng
text: Although dopamine receptors D1 and D2 play key roles in hippocampal function,
their synaptic localization within the hippocampus has not been fully elucidated.
In order to understand precise functions of pre- or postsynaptic dopamine receptors
(DRs), the development of protocols to differentiate pre- and postsynaptic DRs
is essential. So far, most studies on determination and quantification of DRs
did not discriminate between subsynaptic localization. Therefore, the aim of the
study was to generate a robust workflow for the localization of DRs. This work
provides the basis for future work on hippocampal DRs, in light that DRs may have
different functions at pre- or postsynaptic sites. Synaptosomes from rat hippocampi
isolated by a sucrose gradient protocol were prepared for super-resolution direct
stochastic optical reconstruction microscopy (dSTORM) using Bassoon as a presynaptic
zone and Homer1 as postsynaptic density marker. Direct labeling of primary validated
antibodies against dopamine receptors D1 (D1R) and D2 (D2R) with Alexa Fluor 594
enabled unequivocal assignment of D1R and D2R to both, pre- and postsynaptic sites.
D1R immunoreactivity clusters were observed within the presynaptic active zone
as well as at perisynaptic sites at the edge of the presynaptic active zone. The
results may be useful for the interpretation of previous studies and the design
of future work on DRs in the hippocampus. Moreover, the reduction of the complexity
of brain tissue by the use of synaptosomal preparations and dSTORM technology
may represent a useful tool for synaptic localization of brain proteins.
article_processing_charge: No
author:
- first_name: Andras
full_name: Miklosi, Andras
last_name: Miklosi
- first_name: Giorgia
full_name: Del Favero, Giorgia
last_name: Del Favero
- first_name: Tanja
full_name: Bulat, Tanja
last_name: Bulat
- first_name: Harald
full_name: Höger, Harald
last_name: Höger
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Doris
full_name: Marko, Doris
last_name: Marko
- first_name: Gert
full_name: Lubec, Gert
last_name: Lubec
citation:
ama: Miklosi A, Del Favero G, Bulat T, et al. Super resolution microscopical localization
of dopamine receptors 1 and 2 in rat hippocampal synaptosomes. Molecular Neurobiology.
2018;55(6):4857 – 4869. doi:10.1007/s12035-017-0688-y
apa: Miklosi, A., Del Favero, G., Bulat, T., Höger, H., Shigemoto, R., Marko, D.,
& Lubec, G. (2018). Super resolution microscopical localization of dopamine
receptors 1 and 2 in rat hippocampal synaptosomes. Molecular Neurobiology.
Springer. https://doi.org/10.1007/s12035-017-0688-y
chicago: Miklosi, Andras, Giorgia Del Favero, Tanja Bulat, Harald Höger, Ryuichi
Shigemoto, Doris Marko, and Gert Lubec. “Super Resolution Microscopical Localization
of Dopamine Receptors 1 and 2 in Rat Hippocampal Synaptosomes.” Molecular Neurobiology.
Springer, 2018. https://doi.org/10.1007/s12035-017-0688-y.
ieee: A. Miklosi et al., “Super resolution microscopical localization of
dopamine receptors 1 and 2 in rat hippocampal synaptosomes,” Molecular Neurobiology,
vol. 55, no. 6. Springer, pp. 4857 – 4869, 2018.
ista: Miklosi A, Del Favero G, Bulat T, Höger H, Shigemoto R, Marko D, Lubec G.
2018. Super resolution microscopical localization of dopamine receptors 1 and
2 in rat hippocampal synaptosomes. Molecular Neurobiology. 55(6), 4857 – 4869.
mla: Miklosi, Andras, et al. “Super Resolution Microscopical Localization of Dopamine
Receptors 1 and 2 in Rat Hippocampal Synaptosomes.” Molecular Neurobiology,
vol. 55, no. 6, Springer, 2018, pp. 4857 – 4869, doi:10.1007/s12035-017-0688-y.
short: A. Miklosi, G. Del Favero, T. Bulat, H. Höger, R. Shigemoto, D. Marko, G.
Lubec, Molecular Neurobiology 55 (2018) 4857 – 4869.
date_created: 2018-12-11T11:48:02Z
date_published: 2018-06-01T00:00:00Z
date_updated: 2023-09-19T09:58:11Z
day: '01'
department:
- _id: RySh
doi: 10.1007/s12035-017-0688-y
external_id:
isi:
- '000431991500025'
intvolume: ' 55'
isi: 1
issue: '6'
language:
- iso: eng
month: '06'
oa_version: None
page: 4857 – 4869
publication: Molecular Neurobiology
publication_status: published
publisher: Springer
publist_id: '6991'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Super resolution microscopical localization of dopamine receptors 1 and 2 in
rat hippocampal synaptosomes
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 55
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
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
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: '7123'
abstract:
- lang: eng
text: "Population protocols are a popular model of distributed computing, in which
n agents with limited local state interact randomly, and cooperate to collectively
compute global predicates. Inspired by recent developments in DNA programming,
an extensive series of papers, across different communities, has examined the
computability and complexity characteristics of this model. Majority, or consensus,
is a central task in this model, in which agents need to collectively reach a
decision as to which one of two states A or B had a higher initial count. Two
metrics are important: the time that a protocol requires to stabilize to an output
decision, and the state space size that each agent requires to do so. It is known
that majority requires Ω(log log n) states per agent to allow for fast (poly-logarithmic
time) stabilization, and that O(log2 n) states are sufficient. Thus, there is
an exponential gap between the space upper and lower bounds for this problem.
This paper addresses this question.\r\n\r\nOn the negative side, we provide a
new lower bound of Ω(log n) states for any protocol which stabilizes in O(n1–c)
expected time, for any constant c > 0. This result is conditional on monotonicity
and output assumptions, satisfied by all known protocols. Technically, it represents
a departure from previous lower bounds, in that it does not rely on the existence
of dense configurations. Instead, we introduce a new generalized surgery technique
to prove the existence of incorrect executions for any algorithm which would contradict
the lower bound. Subsequently, our lower bound also applies to general initial
configurations, including ones with a leader. On the positive side, we give a
new algorithm for majority which uses O(log n) states, and stabilizes in O(log2
n) expected time. Central to the algorithm is a new leaderless phase clock technique,
which allows agents to synchronize in phases of Θ(n log n) consecutive interactions
using O(log n) states per agent, exploiting a new connection between population
protocols and power-of-two-choices load balancing mechanisms. We also employ our
phase clock to build a leader election algorithm with a state space of size O(log
n), which stabilizes in O(log2 n) expected time."
article_processing_charge: No
arxiv: 1
author:
- 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: James
full_name: Aspnes, James
last_name: Aspnes
- first_name: Rati
full_name: Gelashvili, Rati
last_name: Gelashvili
citation:
ama: 'Alistarh D-A, Aspnes J, Gelashvili R. Space-optimal majority in population
protocols. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete
Algorithms. ACM; 2018:2221-2239. doi:10.1137/1.9781611975031.144'
apa: 'Alistarh, D.-A., Aspnes, J., & Gelashvili, R. (2018). Space-optimal majority
in population protocols. In Proceedings of the 29th Annual ACM-SIAM Symposium
on Discrete Algorithms (pp. 2221–2239). New Orleans, LA, United States: ACM.
https://doi.org/10.1137/1.9781611975031.144'
chicago: Alistarh, Dan-Adrian, James Aspnes, and Rati Gelashvili. “Space-Optimal
Majority in Population Protocols.” In Proceedings of the 29th Annual ACM-SIAM
Symposium on Discrete Algorithms, 2221–39. ACM, 2018. https://doi.org/10.1137/1.9781611975031.144.
ieee: D.-A. Alistarh, J. Aspnes, and R. Gelashvili, “Space-optimal majority in population
protocols,” in Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete
Algorithms, New Orleans, LA, United States, 2018, pp. 2221–2239.
ista: 'Alistarh D-A, Aspnes J, Gelashvili R. 2018. Space-optimal majority in population
protocols. Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms.
SODA: Symposium on Discrete Algorithms, 2221–2239.'
mla: Alistarh, Dan-Adrian, et al. “Space-Optimal Majority in Population Protocols.”
Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms,
ACM, 2018, pp. 2221–39, doi:10.1137/1.9781611975031.144.
short: D.-A. Alistarh, J. Aspnes, R. Gelashvili, in:, Proceedings of the 29th Annual
ACM-SIAM Symposium on Discrete Algorithms, ACM, 2018, pp. 2221–2239.
conference:
end_date: 2018-01-10
location: New Orleans, LA, United States
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2018-01-07
date_created: 2019-11-26T15:10:55Z
date_published: 2018-01-30T00:00:00Z
date_updated: 2023-09-19T15:03:16Z
day: '30'
department:
- _id: DaAl
doi: 10.1137/1.9781611975031.144
external_id:
arxiv:
- '1704.04947'
isi:
- '000483921200145'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1704.04947
month: '01'
oa: 1
oa_version: Preprint
page: 2221-2239
publication: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
isbn:
- '9781611975031'
publication_status: published
publisher: ACM
quality_controlled: '1'
status: public
title: Space-optimal majority in population protocols
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '723'
abstract:
- lang: eng
text: Escaping local optima is one of the major obstacles to function optimisation.
Using the metaphor of a fitness landscape, local optima correspond to hills separated
by fitness valleys that have to be overcome. We define a class of fitness valleys
of tunable difficulty by considering their length, representing the Hamming path
between the two optima and their depth, the drop in fitness. For this function
class we present a runtime comparison between stochastic search algorithms using
different search strategies. The (1+1) EA is a simple and well-studied evolutionary
algorithm that has to jump across the valley to a point of higher fitness because
it does not accept worsening moves (elitism). In contrast, the Metropolis algorithm
and the Strong Selection Weak Mutation (SSWM) algorithm, a famous process in population
genetics, are both able to cross the fitness valley by accepting worsening moves.
We show that the runtime of the (1+1) EA depends critically on the length of the
valley while the runtimes of the non-elitist algorithms depend crucially on the
depth of the valley. Moreover, we show that both SSWM and Metropolis can also
efficiently optimise a rugged function consisting of consecutive valleys.
article_processing_charge: No
author:
- first_name: Pietro
full_name: Oliveto, Pietro
last_name: Oliveto
- first_name: Tiago
full_name: Paixao, Tiago
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
- first_name: Jorge
full_name: Pérez Heredia, Jorge
last_name: Pérez Heredia
- first_name: Dirk
full_name: Sudholt, Dirk
last_name: Sudholt
- first_name: Barbora
full_name: Trubenova, Barbora
id: 42302D54-F248-11E8-B48F-1D18A9856A87
last_name: Trubenova
orcid: 0000-0002-6873-2967
citation:
ama: Oliveto P, Paixao T, Pérez Heredia J, Sudholt D, Trubenova B. How to escape
local optima in black box optimisation when non elitism outperforms elitism. Algorithmica.
2018;80(5):1604-1633. doi:10.1007/s00453-017-0369-2
apa: Oliveto, P., Paixao, T., Pérez Heredia, J., Sudholt, D., & Trubenova, B.
(2018). How to escape local optima in black box optimisation when non elitism
outperforms elitism. Algorithmica. Springer. https://doi.org/10.1007/s00453-017-0369-2
chicago: Oliveto, Pietro, Tiago Paixao, Jorge Pérez Heredia, Dirk Sudholt, and Barbora
Trubenova. “How to Escape Local Optima in Black Box Optimisation When Non Elitism
Outperforms Elitism.” Algorithmica. Springer, 2018. https://doi.org/10.1007/s00453-017-0369-2.
ieee: P. Oliveto, T. Paixao, J. Pérez Heredia, D. Sudholt, and B. Trubenova, “How
to escape local optima in black box optimisation when non elitism outperforms
elitism,” Algorithmica, vol. 80, no. 5. Springer, pp. 1604–1633, 2018.
ista: Oliveto P, Paixao T, Pérez Heredia J, Sudholt D, Trubenova B. 2018. How to
escape local optima in black box optimisation when non elitism outperforms elitism.
Algorithmica. 80(5), 1604–1633.
mla: Oliveto, Pietro, et al. “How to Escape Local Optima in Black Box Optimisation
When Non Elitism Outperforms Elitism.” Algorithmica, vol. 80, no. 5, Springer,
2018, pp. 1604–33, doi:10.1007/s00453-017-0369-2.
short: P. Oliveto, T. Paixao, J. Pérez Heredia, D. Sudholt, B. Trubenova, Algorithmica
80 (2018) 1604–1633.
date_created: 2018-12-11T11:48:09Z
date_published: 2018-05-01T00:00:00Z
date_updated: 2023-09-11T14:11:35Z
day: '01'
ddc:
- '576'
department:
- _id: NiBa
- _id: CaGu
doi: 10.1007/s00453-017-0369-2
ec_funded: 1
external_id:
isi:
- '000428239300010'
file:
- access_level: open_access
checksum: 7d92f5d7be81e387edeec4f06442791c
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:14Z
date_updated: 2020-07-14T12:47:54Z
file_id: '4674'
file_name: IST-2018-1014-v1+1_2018_Paixao_Escape.pdf
file_size: 691245
relation: main_file
file_date_updated: 2020-07-14T12:47:54Z
has_accepted_license: '1'
intvolume: ' 80'
isi: 1
issue: '5'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 1604 - 1633
project:
- _id: 25B1EC9E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '618091'
name: Speed of Adaptation in Population Genetics and Evolutionary Computation
publication: Algorithmica
publication_status: published
publisher: Springer
publist_id: '6957'
pubrep_id: '1014'
quality_controlled: '1'
scopus_import: '1'
status: public
title: How to escape local optima in black box optimisation when non elitism outperforms
elitism
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: 80
year: '2018'
...
---
_id: '738'
abstract:
- lang: eng
text: 'This paper is devoted to automatic competitive analysis of real-time scheduling
algorithms for firm-deadline tasksets, where only completed tasks con- tribute
some utility to the system. Given such a taskset T , the competitive ratio of
an on-line scheduling algorithm A for T is the worst-case utility ratio of A over
the utility achieved by a clairvoyant algorithm. We leverage the theory of quantitative
graph games to address the competitive analysis and competitive synthesis problems.
For the competitive analysis case, given any taskset T and any finite-memory on-
line scheduling algorithm A , we show that the competitive ratio of A in T can
be computed in polynomial time in the size of the state space of A . Our approach
is flexible as it also provides ways to model meaningful constraints on the released
task sequences that determine the competitive ratio. We provide an experimental
study of many well-known on-line scheduling algorithms, which demonstrates the
feasibility of our competitive analysis approach that effectively replaces human
ingenuity (required Preliminary versions of this paper have appeared in Chatterjee
et al. ( 2013 , 2014 ). B Andreas Pavlogiannis pavlogiannis@ist.ac.at Krishnendu
Chatterjee krish.chat@ist.ac.at Alexander Kößler koe@ecs.tuwien.ac.at Ulrich Schmid
s@ecs.tuwien.ac.at 1 IST Austria (Institute of Science and Technology Austria),
Am Campus 1, 3400 Klosterneuburg, Austria 2 Embedded Computing Systems Group,
Vienna University of Technology, Treitlstrasse 3, 1040 Vienna, Austria 123 Real-Time
Syst for finding worst-case scenarios) by computing power. For the competitive
synthesis case, we are just given a taskset T , and the goal is to automatically
synthesize an opti- mal on-line scheduling algorithm A , i.e., one that guarantees
the largest competitive ratio possible for T . We show how the competitive synthesis
problem can be reduced to a two-player graph game with partial information, and
establish that the compu- tational complexity of solving this game is Np -complete.
The competitive synthesis problem is hence in Np in the size of the state space
of the non-deterministic labeled transition system encoding the taskset. Overall,
the proposed framework assists in the selection of suitable scheduling algorithms
for a given taskset, which is in fact the most common situation in real-time systems
design. '
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Alexander
full_name: Kößler, Alexander
last_name: Kößler
- first_name: Ulrich
full_name: Schmid, Ulrich
last_name: Schmid
citation:
ama: Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. Automated competitive analysis
of real time scheduling with graph games. Real-Time Systems. 2018;54(1):166-207.
doi:10.1007/s11241-017-9293-4
apa: Chatterjee, K., Pavlogiannis, A., Kößler, A., & Schmid, U. (2018). Automated
competitive analysis of real time scheduling with graph games. Real-Time Systems.
Springer. https://doi.org/10.1007/s11241-017-9293-4
chicago: Chatterjee, Krishnendu, Andreas Pavlogiannis, Alexander Kößler, and Ulrich
Schmid. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.”
Real-Time Systems. Springer, 2018. https://doi.org/10.1007/s11241-017-9293-4.
ieee: K. Chatterjee, A. Pavlogiannis, A. Kößler, and U. Schmid, “Automated competitive
analysis of real time scheduling with graph games,” Real-Time Systems,
vol. 54, no. 1. Springer, pp. 166–207, 2018.
ista: Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. 2018. Automated competitive
analysis of real time scheduling with graph games. Real-Time Systems. 54(1), 166–207.
mla: Chatterjee, Krishnendu, et al. “Automated Competitive Analysis of Real Time
Scheduling with Graph Games.” Real-Time Systems, vol. 54, no. 1, Springer,
2018, pp. 166–207, doi:10.1007/s11241-017-9293-4.
short: K. Chatterjee, A. Pavlogiannis, A. Kößler, U. Schmid, Real-Time Systems 54
(2018) 166–207.
date_created: 2018-12-11T11:48:14Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2023-09-27T12:52:38Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/s11241-017-9293-4
ec_funded: 1
external_id:
isi:
- '000419955500006'
file:
- access_level: open_access
checksum: c2590ef160709d8054cf29ee173f1454
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:14Z
date_updated: 2020-07-14T12:47:56Z
file_id: '5267'
file_name: IST-2018-960-v1+1_2017_Chatterjee_Automated_competetive.pdf
file_size: 1163507
relation: main_file
file_date_updated: 2020-07-14T12:47:56Z
has_accepted_license: '1'
intvolume: ' 54'
isi: 1
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 166 - 207
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: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Real-Time Systems
publication_status: published
publisher: Springer
publist_id: '6929'
pubrep_id: '960'
quality_controlled: '1'
related_material:
record:
- id: '2820'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Automated competitive analysis of real time scheduling with graph games
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 54
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: '742'
abstract:
- lang: eng
text: 'We give a detailed and easily accessible proof of Gromov’s Topological Overlap
Theorem. Let X be a finite simplicial complex or, more generally, a finite polyhedral
cell complex of dimension d. Informally, the theorem states that if X has sufficiently
strong higher-dimensional expansion properties (which generalize edge expansion
of graphs and are defined in terms of cellular cochains of X) then X has the following
topological overlap property: for every continuous map (Formula presented.) there
exists a point (Formula presented.) that is contained in the images of a positive
fraction (Formula presented.) of the d-cells of X. More generally, the conclusion
holds if (Formula presented.) is replaced by any d-dimensional piecewise-linear
manifold M, with a constant (Formula presented.) that depends only on d and on
the expansion properties of X, but not on M.'
article_processing_charge: Yes (via OA deal)
author:
- first_name: Dominic
full_name: Dotterrer, Dominic
last_name: Dotterrer
- first_name: Tali
full_name: Kaufman, Tali
last_name: Kaufman
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: Dotterrer D, Kaufman T, Wagner U. On expansion and topological overlap. Geometriae
Dedicata. 2018;195(1):307–317. doi:10.1007/s10711-017-0291-4
apa: Dotterrer, D., Kaufman, T., & Wagner, U. (2018). On expansion and topological
overlap. Geometriae Dedicata. Springer. https://doi.org/10.1007/s10711-017-0291-4
chicago: Dotterrer, Dominic, Tali Kaufman, and Uli Wagner. “On Expansion and Topological
Overlap.” Geometriae Dedicata. Springer, 2018. https://doi.org/10.1007/s10711-017-0291-4.
ieee: D. Dotterrer, T. Kaufman, and U. Wagner, “On expansion and topological overlap,”
Geometriae Dedicata, vol. 195, no. 1. Springer, pp. 307–317, 2018.
ista: Dotterrer D, Kaufman T, Wagner U. 2018. On expansion and topological overlap.
Geometriae Dedicata. 195(1), 307–317.
mla: Dotterrer, Dominic, et al. “On Expansion and Topological Overlap.” Geometriae
Dedicata, vol. 195, no. 1, Springer, 2018, pp. 307–317, doi:10.1007/s10711-017-0291-4.
short: D. Dotterrer, T. Kaufman, U. Wagner, Geometriae Dedicata 195 (2018) 307–317.
date_created: 2018-12-11T11:48:16Z
date_published: 2018-08-01T00:00:00Z
date_updated: 2023-09-27T12:29:57Z
day: '01'
ddc:
- '514'
- '516'
department:
- _id: UlWa
doi: 10.1007/s10711-017-0291-4
external_id:
isi:
- '000437122700017'
file:
- access_level: open_access
checksum: d2f70fc132156504aa4c626aa378a7ab
content_type: application/pdf
creator: kschuh
date_created: 2019-01-15T13:44:05Z
date_updated: 2020-07-14T12:47:58Z
file_id: '5835'
file_name: s10711-017-0291-4.pdf
file_size: 412486
relation: main_file
file_date_updated: 2020-07-14T12:47:58Z
has_accepted_license: '1'
intvolume: ' 195'
isi: 1
issue: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 307–317
project:
- _id: 25FA3206-B435-11E9-9278-68D0E5697425
grant_number: PP00P2_138948
name: 'Embeddings in Higher Dimensions: Algorithms and Combinatorics'
publication: Geometriae Dedicata
publication_status: published
publisher: Springer
publist_id: '6925'
pubrep_id: '912'
quality_controlled: '1'
related_material:
record:
- id: '1378'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: On expansion and topological overlap
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: 195
year: '2018'
...
---
_id: '75'
abstract:
- lang: eng
text: We prove that any convex body in the plane can be partitioned into m convex
parts of equal areas and perimeters for any integer m≥2; this result was previously
known for prime powers m=pk. We also give a higher-dimensional generalization.
article_number: '1804.03057'
article_processing_charge: No
arxiv: 1
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Sergey
full_name: Avvakumov, Sergey
id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
last_name: Avvakumov
- first_name: Roman
full_name: Karasev, Roman
last_name: Karasev
citation:
ama: Akopyan A, Avvakumov S, Karasev R. Convex fair partitions into arbitrary number
of pieces. 2018. doi:10.48550/arXiv.1804.03057
apa: Akopyan, A., Avvakumov, S., & Karasev, R. (2018). Convex fair partitions
into arbitrary number of pieces. arXiv. https://doi.org/10.48550/arXiv.1804.03057
chicago: Akopyan, Arseniy, Sergey Avvakumov, and Roman Karasev. “Convex Fair Partitions
into Arbitrary Number of Pieces.” arXiv, 2018. https://doi.org/10.48550/arXiv.1804.03057.
ieee: A. Akopyan, S. Avvakumov, and R. Karasev, “Convex fair partitions into arbitrary
number of pieces.” arXiv, 2018.
ista: Akopyan A, Avvakumov S, Karasev R. 2018. Convex fair partitions into arbitrary
number of pieces. 1804.03057.
mla: Akopyan, Arseniy, et al. Convex Fair Partitions into Arbitrary Number of
Pieces. 1804.03057, arXiv, 2018, doi:10.48550/arXiv.1804.03057.
short: A. Akopyan, S. Avvakumov, R. Karasev, (2018).
date_created: 2018-12-11T11:44:30Z
date_published: 2018-09-13T00:00:00Z
date_updated: 2023-12-18T10:51:02Z
day: '13'
department:
- _id: HeEd
- _id: JaMa
doi: 10.48550/arXiv.1804.03057
ec_funded: 1
external_id:
arxiv:
- '1804.03057'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.03057
month: '09'
oa: 1
oa_version: Preprint
project:
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '716117'
name: Optimal Transport and Stochastic Dynamics
publication_status: published
publisher: arXiv
related_material:
record:
- id: '8156'
relation: dissertation_contains
status: public
status: public
title: Convex fair partitions into arbitrary number of pieces
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '76'
abstract:
- lang: eng
text: 'Consider a fully-connected synchronous distributed system consisting of n
nodes, where up to f nodes may be faulty and every node starts in an arbitrary
initial state. In the synchronous C-counting problem, all nodes need to eventually
agree on a counter that is increased by one modulo C in each round for given C>1.
In the self-stabilising firing squad problem, the task is to eventually guarantee
that all non-faulty nodes have simultaneous responses to external inputs: if a
subset of the correct nodes receive an external “go” signal as input, then all
correct nodes should agree on a round (in the not-too-distant future) in which
to jointly output a “fire” signal. Moreover, no node should generate a “fire”
signal without some correct node having previously received a “go” signal as input.
We present a framework reducing both tasks to binary consensus at very small cost.
For example, we obtain a deterministic algorithm for self-stabilising Byzantine
firing squads with optimal resilience f<n/3, asymptotically optimal stabilisation
and response time O(f), and message size O(log f). As our framework does not restrict
the type of consensus routines used, we also obtain efficient randomised solutions.'
article_processing_charge: Yes (via OA deal)
author:
- first_name: Christoph
full_name: Lenzen, Christoph
last_name: Lenzen
- first_name: Joel
full_name: Rybicki, Joel
id: 334EFD2E-F248-11E8-B48F-1D18A9856A87
last_name: Rybicki
orcid: 0000-0002-6432-6646
citation:
ama: Lenzen C, Rybicki J. Near-optimal self-stabilising counting and firing squads.
Distributed Computing. 2018. doi:10.1007/s00446-018-0342-6
apa: Lenzen, C., & Rybicki, J. (2018). Near-optimal self-stabilising counting
and firing squads. Distributed Computing. Springer. https://doi.org/10.1007/s00446-018-0342-6
chicago: Lenzen, Christoph, and Joel Rybicki. “Near-Optimal Self-Stabilising Counting
and Firing Squads.” Distributed Computing. Springer, 2018. https://doi.org/10.1007/s00446-018-0342-6.
ieee: C. Lenzen and J. Rybicki, “Near-optimal self-stabilising counting and firing
squads,” Distributed Computing. Springer, 2018.
ista: Lenzen C, Rybicki J. 2018. Near-optimal self-stabilising counting and firing
squads. Distributed Computing.
mla: Lenzen, Christoph, and Joel Rybicki. “Near-Optimal Self-Stabilising Counting
and Firing Squads.” Distributed Computing, Springer, 2018, doi:10.1007/s00446-018-0342-6.
short: C. Lenzen, J. Rybicki, Distributed Computing (2018).
date_created: 2018-12-11T11:44:30Z
date_published: 2018-09-12T00:00:00Z
date_updated: 2023-09-13T09:01:06Z
day: '12'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.1007/s00446-018-0342-6
external_id:
isi:
- '000475627800005'
file:
- access_level: open_access
checksum: 872db70bba9b401500abe3c6ae2f1a61
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T14:21:22Z
date_updated: 2020-07-14T12:48:01Z
file_id: '5711'
file_name: 2018_DistributedComputing_Lenzen.pdf
file_size: 799337
relation: main_file
file_date_updated: 2020-07-14T12:48:01Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Distributed Computing
publication_status: published
publisher: Springer
publist_id: '7978'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Near-optimal self-stabilising counting and firing squads
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
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: '456'
abstract:
- lang: eng
text: 'Inhibition of the endoplasmic reticulum stress pathway may hold the key to
Zika virus-associated microcephaly treatment. '
article_number: eaar7514
author:
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
citation:
ama: 'Novarino G. Zika-associated microcephaly: Reduce the stress and race for the
treatment. Science Translational Medicine. 2018;10(423). doi:10.1126/scitranslmed.aar7514'
apa: 'Novarino, G. (2018). Zika-associated microcephaly: Reduce the stress and race
for the treatment. Science Translational Medicine. American Association
for the Advancement of Science. https://doi.org/10.1126/scitranslmed.aar7514'
chicago: 'Novarino, Gaia. “Zika-Associated Microcephaly: Reduce the Stress and Race
for the Treatment.” Science Translational Medicine. American Association
for the Advancement of Science, 2018. https://doi.org/10.1126/scitranslmed.aar7514.'
ieee: 'G. Novarino, “Zika-associated microcephaly: Reduce the stress and race for
the treatment,” Science Translational Medicine, vol. 10, no. 423. American
Association for the Advancement of Science, 2018.'
ista: 'Novarino G. 2018. Zika-associated microcephaly: Reduce the stress and race
for the treatment. Science Translational Medicine. 10(423), eaar7514.'
mla: 'Novarino, Gaia. “Zika-Associated Microcephaly: Reduce the Stress and Race
for the Treatment.” Science Translational Medicine, vol. 10, no. 423, eaar7514,
American Association for the Advancement of Science, 2018, doi:10.1126/scitranslmed.aar7514.'
short: G. Novarino, Science Translational Medicine 10 (2018).
date_created: 2018-12-11T11:46:34Z
date_published: 2018-01-10T00:00:00Z
date_updated: 2021-01-12T07:59:42Z
day: '10'
department:
- _id: GaNo
doi: 10.1126/scitranslmed.aar7514
intvolume: ' 10'
issue: '423'
language:
- iso: eng
month: '01'
oa_version: None
publication: Science Translational Medicine
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '7365'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Zika-associated microcephaly: Reduce the stress and race for the treatment'
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 10
year: '2018'
...
---
_id: '457'
abstract:
- lang: eng
text: Temperate bacteriophages integrate in bacterial genomes as prophages and represent
an important source of genetic variation for bacterial evolution, frequently transmitting
fitness-augmenting genes such as toxins responsible for virulence of major pathogens.
However, only a fraction of bacteriophage infections are lysogenic and lead to
prophage acquisition, whereas the majority are lytic and kill the infected bacteria.
Unless able to discriminate lytic from lysogenic infections, mechanisms of immunity
to bacteriophages are expected to act as a double-edged sword and increase the
odds of survival at the cost of depriving bacteria of potentially beneficial prophages.
We show that although restriction-modification systems as mechanisms of innate
immunity prevent both lytic and lysogenic infections indiscriminately in individual
bacteria, they increase the number of prophage-acquiring individuals at the population
level. We find that this counterintuitive result is a consequence of phage-host
population dynamics, in which restriction-modification systems delay infection
onset until bacteria reach densities at which the probability of lysogeny increases.
These results underscore the importance of population-level dynamics as a key
factor modulating costs and benefits of immunity to temperate bacteriophages
article_processing_charge: No
author:
- first_name: Maros
full_name: Pleska, Maros
id: 4569785E-F248-11E8-B48F-1D18A9856A87
last_name: Pleska
orcid: 0000-0001-7460-7479
- first_name: Moritz
full_name: Lang, Moritz
id: 29E0800A-F248-11E8-B48F-1D18A9856A87
last_name: Lang
- first_name: Dominik
full_name: Refardt, Dominik
last_name: Refardt
- first_name: Bruce
full_name: Levin, Bruce
last_name: Levin
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
citation:
ama: Pleska M, Lang M, Refardt D, Levin B, Guet CC. Phage-host population dynamics
promotes prophage acquisition in bacteria with innate immunity. Nature Ecology
and Evolution. 2018;2(2):359-366. doi:10.1038/s41559-017-0424-z
apa: Pleska, M., Lang, M., Refardt, D., Levin, B., & Guet, C. C. (2018). Phage-host
population dynamics promotes prophage acquisition in bacteria with innate immunity.
Nature Ecology and Evolution. Springer Nature. https://doi.org/10.1038/s41559-017-0424-z
chicago: Pleska, Maros, Moritz Lang, Dominik Refardt, Bruce Levin, and Calin C Guet.
“Phage-Host Population Dynamics Promotes Prophage Acquisition in Bacteria with
Innate Immunity.” Nature Ecology and Evolution. Springer Nature, 2018.
https://doi.org/10.1038/s41559-017-0424-z.
ieee: M. Pleska, M. Lang, D. Refardt, B. Levin, and C. C. Guet, “Phage-host population
dynamics promotes prophage acquisition in bacteria with innate immunity,” Nature
Ecology and Evolution, vol. 2, no. 2. Springer Nature, pp. 359–366, 2018.
ista: Pleska M, Lang M, Refardt D, Levin B, Guet CC. 2018. Phage-host population
dynamics promotes prophage acquisition in bacteria with innate immunity. Nature
Ecology and Evolution. 2(2), 359–366.
mla: Pleska, Maros, et al. “Phage-Host Population Dynamics Promotes Prophage Acquisition
in Bacteria with Innate Immunity.” Nature Ecology and Evolution, vol. 2,
no. 2, Springer Nature, 2018, pp. 359–66, doi:10.1038/s41559-017-0424-z.
short: M. Pleska, M. Lang, D. Refardt, B. Levin, C.C. Guet, Nature Ecology and Evolution
2 (2018) 359–366.
date_created: 2018-12-11T11:46:35Z
date_published: 2018-02-01T00:00:00Z
date_updated: 2023-09-15T12:04:57Z
day: '01'
department:
- _id: CaGu
- _id: GaTk
doi: 10.1038/s41559-017-0424-z
ec_funded: 1
external_id:
isi:
- '000426516400027'
intvolume: ' 2'
isi: 1
issue: '2'
language:
- iso: eng
month: '02'
oa_version: None
page: 359 - 366
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 251BCBEC-B435-11E9-9278-68D0E5697425
grant_number: RGY0079/2011
name: Multi-Level Conflicts in Evolutionary Dynamics of Restriction-Modification
Systems (HFSP Young investigators' grant)
- _id: 251D65D8-B435-11E9-9278-68D0E5697425
grant_number: '24210'
name: Effects of Stochasticity on the Function of Restriction-Modi cation Systems
at the Single-Cell Level (DOC Fellowship)
publication: Nature Ecology and Evolution
publication_status: published
publisher: Springer Nature
publist_id: '7364'
quality_controlled: '1'
related_material:
record:
- id: '202'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Phage-host population dynamics promotes prophage acquisition in bacteria with
innate immunity
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2
year: '2018'
...
---
_id: '458'
abstract:
- lang: eng
text: We consider congruences of straight lines in a plane with the combinatorics
of the square grid, with all elementary quadrilaterals possessing an incircle.
It is shown that all the vertices of such nets (we call them incircular or IC-nets)
lie on confocal conics. Our main new results are on checkerboard IC-nets in the
plane. These are congruences of straight lines in the plane with the combinatorics
of the square grid, combinatorially colored as a checkerboard, such that all black
coordinate quadrilaterals possess inscribed circles. We show how this larger class
of IC-nets appears quite naturally in Laguerre geometry of oriented planes and
spheres and leads to new remarkable incidence theorems. Most of our results are
valid in hyperbolic and spherical geometries as well. We present also generalizations
in spaces of higher dimension, called checkerboard IS-nets. The construction of
these nets is based on a new 9 inspheres incidence theorem.
acknowledgement: DFG Collaborative Research Center TRR 109 “Discretization in Geometry
and Dynamics”; People Programme (Marie Curie Actions) of the European Union’s Seventh
Framework Programme (FP7/2007-2013) REA grant agreement n◦[291734]
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: Alexander
full_name: Bobenko, Alexander
last_name: Bobenko
citation:
ama: Akopyan A, Bobenko A. Incircular nets and confocal conics. Transactions
of the American Mathematical Society. 2018;370(4):2825-2854. doi:10.1090/tran/7292
apa: Akopyan, A., & Bobenko, A. (2018). Incircular nets and confocal conics.
Transactions of the American Mathematical Society. American Mathematical
Society. https://doi.org/10.1090/tran/7292
chicago: Akopyan, Arseniy, and Alexander Bobenko. “Incircular Nets and Confocal
Conics.” Transactions of the American Mathematical Society. American Mathematical
Society, 2018. https://doi.org/10.1090/tran/7292.
ieee: A. Akopyan and A. Bobenko, “Incircular nets and confocal conics,” Transactions
of the American Mathematical Society, vol. 370, no. 4. American Mathematical
Society, pp. 2825–2854, 2018.
ista: Akopyan A, Bobenko A. 2018. Incircular nets and confocal conics. Transactions
of the American Mathematical Society. 370(4), 2825–2854.
mla: Akopyan, Arseniy, and Alexander Bobenko. “Incircular Nets and Confocal Conics.”
Transactions of the American Mathematical Society, vol. 370, no. 4, American
Mathematical Society, 2018, pp. 2825–54, doi:10.1090/tran/7292.
short: A. Akopyan, A. Bobenko, Transactions of the American Mathematical Society
370 (2018) 2825–2854.
date_created: 2018-12-11T11:46:35Z
date_published: 2018-04-01T00:00:00Z
date_updated: 2023-09-11T14:19:12Z
day: '01'
department:
- _id: HeEd
doi: 10.1090/tran/7292
ec_funded: 1
external_id:
isi:
- '000423197800019'
intvolume: ' 370'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1602.04637
month: '04'
oa: 1
oa_version: Preprint
page: 2825 - 2854
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Transactions of the American Mathematical Society
publication_status: published
publisher: American Mathematical Society
publist_id: '7363'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Incircular nets and confocal conics
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 370
year: '2018'
...
---
_id: '46'
abstract:
- lang: eng
text: We analyze a disordered central spin model, where a central spin interacts
equally with each spin in a periodic one-dimensional (1D) random-field Heisenberg
chain. If the Heisenberg chain is initially in the many-body localized (MBL) phase,
we find that the coupling to the central spin suffices to delocalize the chain
for a substantial range of coupling strengths. We calculate the phase diagram
of the model and identify the phase boundary between the MBL and ergodic phase.
Within the localized phase, the central spin significantly enhances the rate of
the logarithmic entanglement growth and its saturation value. We attribute the
increase in entanglement entropy to a nonextensive enhancement of magnetization
fluctuations induced by the central spin. Finally, we demonstrate that correlation
functions of the central spin can be utilized to distinguish between MBL and ergodic
phases of the 1D chain. Hence, we propose the use of a central spin as a possible
experimental probe to identify the MBL phase.
acknowledgement: F.P. acknowledges the sup- port of the DFG Research Unit FOR 1807
through Grants No. PO 1370/2-1 and No. TRR80, the Nanosystems Initiative Munich
(NIM) by the German Excellence Initiative, and the European Research Council (ERC)
under the European Union’s Horizon 2020 research and innovation programme (Grant
Agreement No. 771537). N.Y.Y. acknowledges support from the NSF (PHY-1654740), the
ARO STIR program, and a Google research award.
article_number: '161122'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Daniel
full_name: Hetterich, Daniel
last_name: Hetterich
- first_name: Norman
full_name: Yao, Norman
last_name: Yao
- first_name: Maksym
full_name: Serbyn, Maksym
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
- first_name: Frank
full_name: Pollmann, Frank
last_name: Pollmann
- first_name: Björn
full_name: Trauzettel, Björn
last_name: Trauzettel
citation:
ama: Hetterich D, Yao N, Serbyn M, Pollmann F, Trauzettel B. Detection and characterization
of many-body localization in central spin models. Physical Review B. 2018;98(16).
doi:10.1103/PhysRevB.98.161122
apa: Hetterich, D., Yao, N., Serbyn, M., Pollmann, F., & Trauzettel, B. (2018).
Detection and characterization of many-body localization in central spin models.
Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.98.161122
chicago: Hetterich, Daniel, Norman Yao, Maksym Serbyn, Frank Pollmann, and Björn
Trauzettel. “Detection and Characterization of Many-Body Localization in Central
Spin Models.” Physical Review B. American Physical Society, 2018. https://doi.org/10.1103/PhysRevB.98.161122.
ieee: D. Hetterich, N. Yao, M. Serbyn, F. Pollmann, and B. Trauzettel, “Detection
and characterization of many-body localization in central spin models,” Physical
Review B, vol. 98, no. 16. American Physical Society, 2018.
ista: Hetterich D, Yao N, Serbyn M, Pollmann F, Trauzettel B. 2018. Detection and
characterization of many-body localization in central spin models. Physical Review
B. 98(16), 161122.
mla: Hetterich, Daniel, et al. “Detection and Characterization of Many-Body Localization
in Central Spin Models.” Physical Review B, vol. 98, no. 16, 161122, American
Physical Society, 2018, doi:10.1103/PhysRevB.98.161122.
short: D. Hetterich, N. Yao, M. Serbyn, F. Pollmann, B. Trauzettel, Physical Review
B 98 (2018).
date_created: 2018-12-11T11:44:20Z
date_published: 2018-10-15T00:00:00Z
date_updated: 2023-09-11T12:55:03Z
day: '15'
department:
- _id: MaSe
doi: 10.1103/PhysRevB.98.161122
external_id:
arxiv:
- '1806.08316'
isi:
- '000448596500002'
intvolume: ' 98'
isi: 1
issue: '16'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1806.08316
month: '10'
oa: 1
oa_version: Preprint
publication: Physical Review B
publication_status: published
publisher: American Physical Society
publist_id: '8008'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Detection and characterization of many-body localization in central spin models
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 98
year: '2018'
...
---
_id: '461'
abstract:
- lang: eng
text: Turbulence is the major cause of friction losses in transport processes and
it is responsible for a drastic drag increase in flows over bounding surfaces.
While much effort is invested into developing ways to control and reduce turbulence
intensities, so far no methods exist to altogether eliminate turbulence if velocities
are sufficiently large. We demonstrate for pipe flow that appropriate distortions
to the velocity profile lead to a complete collapse of turbulence and subsequently
friction losses are reduced by as much as 90%. Counterintuitively, the return
to laminar motion is accomplished by initially increasing turbulence intensities
or by transiently amplifying wall shear. Since neither the Reynolds number nor
the shear stresses decrease (the latter often increase), these measures are not
indicative of turbulence collapse. Instead, an amplification mechanism measuring
the interaction between eddies and the mean shear is found to set a threshold
below which turbulence is suppressed beyond recovery.
acknowledgement: We acknowledge the European Research Council under the European Union’s
Seventh Framework Programme (FP/2007-2013)/ERC Grant Agreement 306589, the European
Research Council (ERC) under the European Union’s Horizon 2020 research and innovation
programme (grant agreement no. 737549) and the Deutsche Forschungsgemeinschaft (Project
No. FOR 1182) for financial support. We thank our technician P. Maier for providing
highly valuable ideas and greatly supporting us in all technical aspects. We thank
M. Schaner for technical drawings, construction and design. We thank M. Schwegel
for a Matlab code to post-process experimental data.
article_processing_charge: No
author:
- first_name: Jakob
full_name: Kühnen, Jakob
id: 3A47AE32-F248-11E8-B48F-1D18A9856A87
last_name: Kühnen
orcid: 0000-0003-4312-0179
- first_name: Baofang
full_name: Song, Baofang
last_name: Song
- first_name: Davide
full_name: Scarselli, Davide
id: 40315C30-F248-11E8-B48F-1D18A9856A87
last_name: Scarselli
orcid: 0000-0001-5227-4271
- 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: Michael
full_name: Riedl, Michael
id: 3BE60946-F248-11E8-B48F-1D18A9856A87
last_name: Riedl
orcid: 0000-0003-4844-6311
- first_name: Ashley
full_name: Willis, Ashley
last_name: Willis
- first_name: Marc
full_name: Avila, Marc
last_name: Avila
- first_name: Björn
full_name: Hof, Björn
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
citation:
ama: Kühnen J, Song B, Scarselli D, et al. Destabilizing turbulence in pipe flow.
Nature Physics. 2018;14:386-390. doi:10.1038/s41567-017-0018-3
apa: Kühnen, J., Song, B., Scarselli, D., Budanur, N. B., Riedl, M., Willis, A.,
… Hof, B. (2018). Destabilizing turbulence in pipe flow. Nature Physics.
Nature Publishing Group. https://doi.org/10.1038/s41567-017-0018-3
chicago: Kühnen, Jakob, Baofang Song, Davide Scarselli, Nazmi B Budanur, Michael
Riedl, Ashley Willis, Marc Avila, and Björn Hof. “Destabilizing Turbulence in
Pipe Flow.” Nature Physics. Nature Publishing Group, 2018. https://doi.org/10.1038/s41567-017-0018-3.
ieee: J. Kühnen et al., “Destabilizing turbulence in pipe flow,” Nature
Physics, vol. 14. Nature Publishing Group, pp. 386–390, 2018.
ista: Kühnen J, Song B, Scarselli D, Budanur NB, Riedl M, Willis A, Avila M, Hof
B. 2018. Destabilizing turbulence in pipe flow. Nature Physics. 14, 386–390.
mla: Kühnen, Jakob, et al. “Destabilizing Turbulence in Pipe Flow.” Nature Physics,
vol. 14, Nature Publishing Group, 2018, pp. 386–90, doi:10.1038/s41567-017-0018-3.
short: J. Kühnen, B. Song, D. Scarselli, N.B. Budanur, M. Riedl, A. Willis, M. Avila,
B. Hof, Nature Physics 14 (2018) 386–390.
date_created: 2018-12-11T11:46:36Z
date_published: 2018-01-08T00:00:00Z
date_updated: 2024-03-25T23:30:20Z
day: '08'
department:
- _id: BjHo
doi: 10.1038/s41567-017-0018-3
ec_funded: 1
external_id:
isi:
- '000429434100020'
intvolume: ' 14'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1711.06543
month: '01'
oa: 1
oa_version: Preprint
page: 386-390
project:
- _id: 25152F3A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '306589'
name: Decoding the complexity of turbulence at its origin
- _id: 25104D44-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '737549'
name: Eliminating turbulence in oil pipelines
publication: Nature Physics
publication_status: published
publisher: Nature Publishing Group
publist_id: '7360'
quality_controlled: '1'
related_material:
record:
- id: '12726'
relation: dissertation_contains
status: public
- id: '14530'
relation: dissertation_contains
status: public
- id: '7258'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Destabilizing turbulence in pipe flow
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 14
year: '2018'
...
---
_id: '462'
abstract:
- lang: eng
text: 'AtNHX5 and AtNHX6 are endosomal Na+,K+/H+ antiporters that are critical for
growth and development in Arabidopsis, but the mechanism behind their action remains
unknown. Here, we report that AtNHX5 and AtNHX6, functioning as H+ leak, control
auxin homeostasis and auxin-mediated development. We found that nhx5 nhx6 exhibited
growth variations of auxin-related defects. We further showed that nhx5 nhx6 was
affected in auxin homeostasis. Genetic analysis showed that AtNHX5 and AtNHX6
were required for the function of the ER-localized auxin transporter PIN5. Although
AtNHX5 and AtNHX6 were co-localized with PIN5 at ER, they did not interact directly.
Instead, the conserved acidic residues in AtNHX5 and AtNHX6, which are essential
for exchange activity, were required for PIN5 function. AtNHX5 and AtNHX6 regulated
the pH in ER. Overall, AtNHX5 and AtNHX6 may regulate auxin transport across the
ER via the pH gradient created by their transport activity. H+-leak pathway provides
a fine-tuning mechanism that controls cellular auxin fluxes. '
acknowledgement: 'This work was supported by the National Natural Science Foundation
of China (31571464, 31371438 and 31070222 to Q.S.Q.), the National Basic Research
Program of China (973 project, 2013CB429904 to Q.S.Q.), the Research Fund for the
Doctoral Program of Higher Education of China (20130211110001 to Q.S.Q.), the Ministry
of Education, Youth and Sports of the Czech Republic (the National Program for Sustainability
I, LO1204), and The Czech Science Foundation GAČR (GA13–40637S) to JF. We thank
Dr. Tom J. Guilfoyle for DR5::GUS line and Dr. Jia Li for pBIB‐RFP vector and DR5::GFP
line. We thank Liping Guan and Yang Zhao for their help with the confocal microscope
assay. '
article_processing_charge: No
article_type: original
author:
- first_name: Ligang
full_name: Fan, Ligang
last_name: Fan
- first_name: Lei
full_name: Zhao, Lei
last_name: Zhao
- first_name: Wei
full_name: Hu, Wei
last_name: Hu
- first_name: Weina
full_name: Li, Weina
last_name: Li
- first_name: Ondřej
full_name: Novák, Ondřej
last_name: Novák
- first_name: Miroslav
full_name: Strnad, Miroslav
last_name: Strnad
- first_name: Sibu
full_name: Simon, Sibu
id: 4542EF9A-F248-11E8-B48F-1D18A9856A87
last_name: Simon
orcid: 0000-0002-1998-6741
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Jinbo
full_name: Shen, Jinbo
last_name: Shen
- first_name: Liwen
full_name: Jiang, Liwen
last_name: Jiang
- first_name: Quan
full_name: Qiu, Quan
last_name: Qiu
citation:
ama: Fan L, Zhao L, Hu W, et al. NHX antiporters regulate the pH of endoplasmic
reticulum and auxin-mediated development. Plant, Cell and Environment.
2018;41:850-864. doi:10.1111/pce.13153
apa: Fan, L., Zhao, L., Hu, W., Li, W., Novák, O., Strnad, M., … Qiu, Q. (2018).
NHX antiporters regulate the pH of endoplasmic reticulum and auxin-mediated development.
Plant, Cell and Environment. Wiley-Blackwell. https://doi.org/10.1111/pce.13153
chicago: Fan, Ligang, Lei Zhao, Wei Hu, Weina Li, Ondřej Novák, Miroslav Strnad,
Sibu Simon, et al. “NHX Antiporters Regulate the PH of Endoplasmic Reticulum and
Auxin-Mediated Development.” Plant, Cell and Environment. Wiley-Blackwell,
2018. https://doi.org/10.1111/pce.13153.
ieee: L. Fan et al., “NHX antiporters regulate the pH of endoplasmic reticulum
and auxin-mediated development,” Plant, Cell and Environment, vol. 41.
Wiley-Blackwell, pp. 850–864, 2018.
ista: Fan L, Zhao L, Hu W, Li W, Novák O, Strnad M, Simon S, Friml J, Shen J, Jiang
L, Qiu Q. 2018. NHX antiporters regulate the pH of endoplasmic reticulum and auxin-mediated
development. Plant, Cell and Environment. 41, 850–864.
mla: Fan, Ligang, et al. “NHX Antiporters Regulate the PH of Endoplasmic Reticulum
and Auxin-Mediated Development.” Plant, Cell and Environment, vol. 41,
Wiley-Blackwell, 2018, pp. 850–64, doi:10.1111/pce.13153.
short: L. Fan, L. Zhao, W. Hu, W. Li, O. Novák, M. Strnad, S. Simon, J. Friml, J.
Shen, L. Jiang, Q. Qiu, Plant, Cell and Environment 41 (2018) 850–864.
date_created: 2018-12-11T11:46:36Z
date_published: 2018-05-01T00:00:00Z
date_updated: 2023-09-13T09:03:18Z
day: '01'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.1111/pce.13153
external_id:
isi:
- '000426870500012'
pmid:
- '29360148'
file:
- access_level: open_access
checksum: 6a20f843565f962cb20281cdf5e40914
content_type: application/pdf
creator: dernst
date_created: 2019-11-18T16:22:22Z
date_updated: 2020-07-14T12:46:32Z
file_id: '7042'
file_name: 2018_PlantCellEnv_Fan.pdf
file_size: 1937976
relation: main_file
file_date_updated: 2020-07-14T12:46:32Z
has_accepted_license: '1'
intvolume: ' 41'
isi: 1
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '05'
oa: 1
oa_version: Submitted Version
page: 850 - 864
pmid: 1
publication: Plant, Cell and Environment
publication_status: published
publisher: Wiley-Blackwell
publist_id: '7359'
quality_controlled: '1'
scopus_import: '1'
status: public
title: NHX antiporters regulate the pH of endoplasmic reticulum and auxin-mediated
development
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 41
year: '2018'
...
---
_id: '47'
abstract:
- lang: eng
text: Plant hormones as signalling molecules play an essential role in the control
of plant growth and development. Typically, sites of hormonal action are usually
distant from the site of biosynthesis thus relying on efficient transport mechanisms.
Over the last decades, molecular identification of proteins and protein complexes
involved in hormonal transport has started. Advanced screens for genes involved
in hormonal transport in combination with transport assays using heterologous
systems such as yeast, insect, or tobacco BY2 cells or Xenopus oocytes provided
important insights into mechanisms underlying distribution of hormones in plant
body and led to identification of principal transporters for each hormone. This
review gives a short overview of the mechanisms of hormonal transport and transporters
identified in Arabidopsis thaliana.
article_processing_charge: No
author:
- first_name: Rashed
full_name: Abualia, Rashed
id: 4827E134-F248-11E8-B48F-1D18A9856A87
last_name: Abualia
orcid: 0000-0002-9357-9415
- first_name: Eva
full_name: Benková, Eva
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
- first_name: Benoît
full_name: Lacombe, Benoît
last_name: Lacombe
citation:
ama: Abualia R, Benková E, Lacombe B. Transporters and mechanisms of hormone transport
in arabidopsis. Advances in Botanical Research. 2018;87:115-138. doi:10.1016/bs.abr.2018.09.007
apa: Abualia, R., Benková, E., & Lacombe, B. (2018). Transporters and mechanisms
of hormone transport in arabidopsis. Advances in Botanical Research. Elsevier.
https://doi.org/10.1016/bs.abr.2018.09.007
chicago: Abualia, Rashed, Eva Benková, and Benoît Lacombe. “Transporters and Mechanisms
of Hormone Transport in Arabidopsis.” Advances in Botanical Research. Elsevier,
2018. https://doi.org/10.1016/bs.abr.2018.09.007.
ieee: R. Abualia, E. Benková, and B. Lacombe, “Transporters and mechanisms of hormone
transport in arabidopsis,” Advances in Botanical Research, vol. 87. Elsevier,
pp. 115–138, 2018.
ista: Abualia R, Benková E, Lacombe B. 2018. Transporters and mechanisms of hormone
transport in arabidopsis. Advances in Botanical Research. 87, 115–138.
mla: Abualia, Rashed, et al. “Transporters and Mechanisms of Hormone Transport in
Arabidopsis.” Advances in Botanical Research, vol. 87, Elsevier, 2018,
pp. 115–38, doi:10.1016/bs.abr.2018.09.007.
short: R. Abualia, E. Benková, B. Lacombe, Advances in Botanical Research 87 (2018)
115–138.
date_created: 2018-12-11T11:44:20Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2024-03-25T23:30:22Z
day: '01'
department:
- _id: EvBe
doi: 10.1016/bs.abr.2018.09.007
external_id:
isi:
- '000453657800006'
intvolume: ' 87'
isi: 1
language:
- iso: eng
month: '01'
oa_version: None
page: 115 - 138
publication: Advances in Botanical Research
publication_status: published
publisher: Elsevier
publist_id: '8007'
quality_controlled: '1'
related_material:
record:
- id: '10303'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Transporters and mechanisms of hormone transport in arabidopsis
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 87
year: '2018'
...
---
_id: '48'
abstract:
- lang: eng
text: 'The hippocampus is a key brain region for spatial memory and navigation and
is needed at all stages of memory, including encoding, consolidation, and recall.
Hippocampal place cells selectively discharge at specific locations of the environment
to form a cognitive map of the space. During the rest period and sleep following
spatial navigation and/or learning, the waking activity of the place cells is
reactivated within high synchrony events. This reactivation is thought to be important
for memory consolidation and stabilization of the spatial representations. The
aim of my thesis was to directly test whether the reactivation content encoded
in firing patterns of place cells is important for consolidation of spatial memories.
In particular, I aimed to test whether, in cases when multiple spatial memory
traces are acquired during learning, the specific disruption of the reactivation
of a subset of these memories leads to the selective disruption of the corresponding
memory traces or through memory interference the other learned memories are disrupted
as well. In this thesis, using a modified cheeseboard paradigm and a closed-loop
recording setup with feedback optogenetic stimulation, I examined how the disruption
of the reactivation of specific spiking patterns affects consolidation of the
corresponding memory traces. To obtain multiple distinctive memories, animals
had to perform a spatial task in two distinct cheeseboard environments and the
reactivation of spiking patterns associated with one of the environments (target)
was disrupted after learning during four hours rest period using a real-time decoding
method. This real-time decoding method was capable of selectively affecting the
firing rates and cofiring correlations of the target environment-encoding cells.
The selective disruption led to behavioural impairment in the memory tests after
the rest periods in the target environment but not in the other undisrupted control
environment. In addition, the map of the target environment was less stable in
the impaired memory tests compared to the learning session before than the map
of the control environment. However, when the animal relearned the task, the same
map recurred in the target environment that was present during learning before
the disruption. Altogether my work demonstrated that the reactivation content
is important: assembly-related disruption of reactivation can lead to a selective
memory impairment and deficiency in map stability. These findings indeed suggest
that reactivated assembly patterns reflect processes associated with the consolidation
of memory traces. '
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Igor
full_name: Gridchyn, Igor
id: 4B60654C-F248-11E8-B48F-1D18A9856A87
last_name: Gridchyn
orcid: 0000-0002-1807-1929
citation:
ama: Gridchyn I. Reactivation content is important for consolidation of spatial
memory. 2018. doi:10.15479/AT:ISTA:th_1042
apa: Gridchyn, I. (2018). Reactivation content is important for consolidation
of spatial memory. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_1042
chicago: Gridchyn, Igor. “Reactivation Content Is Important for Consolidation of
Spatial Memory.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_1042.
ieee: I. Gridchyn, “Reactivation content is important for consolidation of spatial
memory,” Institute of Science and Technology Austria, 2018.
ista: Gridchyn I. 2018. Reactivation content is important for consolidation of spatial
memory. Institute of Science and Technology Austria.
mla: Gridchyn, Igor. Reactivation Content Is Important for Consolidation of Spatial
Memory. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_1042.
short: I. Gridchyn, Reactivation Content Is Important for Consolidation of Spatial
Memory, Institute of Science and Technology Austria, 2018.
date_created: 2018-12-11T11:44:21Z
date_published: 2018-08-27T00:00:00Z
date_updated: 2023-09-07T12:42:44Z
day: '27'
ddc:
- '573'
degree_awarded: PhD
department:
- _id: JoCs
doi: 10.15479/AT:ISTA:th_1042
file:
- access_level: closed
checksum: 7db4415e435590fa33542c7b0a0321d7
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: dernst
date_created: 2019-04-08T13:36:01Z
date_updated: 2021-02-11T23:30:22Z
embargo_to: open_access
file_id: '6236'
file_name: 2018_Thesis_Gridchyn_source.docx
file_size: 7666687
relation: source_file
- access_level: open_access
checksum: f96f3fe8979f7b1e6db6acaca962b10c
content_type: application/pdf
creator: dernst
date_created: 2019-04-08T13:36:01Z
date_updated: 2021-02-11T11:17:18Z
embargo: 2019-08-29
file_id: '6237'
file_name: 2018_Thesis_Gridchyn.pdf
file_size: 6034153
relation: main_file
file_date_updated: 2021-02-11T23:30:22Z
has_accepted_license: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: '104'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '8006'
pubrep_id: '1042'
status: public
supervisor:
- first_name: Jozsef L
full_name: Csicsvari, Jozsef L
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
title: Reactivation content is important for consolidation of spatial memory
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: '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: '50'
abstract:
- lang: eng
text: The Wnt/planar cell polarity (Wnt/PCP) pathway determines planar polarity
of epithelial cells in both vertebrates and invertebrates. The role that Wnt/PCP
signaling plays in mesenchymal contexts, however, is only poorly understood. While
previous studies have demonstrated the capacity of Wnt/PCP signaling to polarize
and guide directed migration of mesenchymal cells, it remains unclear whether
endogenous Wnt/PCP signaling performs these functions instructively, as it does
in epithelial cells. Here we developed a light-switchable version of the Wnt/PCP
receptor Frizzled 7 (Fz7) to unambiguously distinguish between an instructive
and a permissive role of Wnt/PCP signaling for the directional collective migration
of mesendoderm progenitor cells during zebrafish gastrulation. We show that prechordal
plate (ppl) cell migration is defective in maternal-zygotic fz7a and fz7b (MZ
fz7a,b) double mutant embryos, and that Fz7 functions cell-autonomously in this
process by promoting ppl cell protrusion formation and directed migration. We
further show that local activation of Fz7 can direct ppl cell migration both in
vitro and in vivo. Surprisingly, however, uniform Fz7 activation is sufficient
to fully rescue the ppl cell migration defect in MZ fz7a,b mutant embryos, indicating
that Wnt/PCP signaling functions permissively rather than instructively in directed
mesendoderm cell migration during zebrafish gastrulation.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Daniel
full_name: Capek, Daniel
id: 31C42484-F248-11E8-B48F-1D18A9856A87
last_name: Capek
orcid: 0000-0001-5199-9940
citation:
ama: Capek D. Optogenetic Frizzled 7 reveals a permissive function of Wnt/PCP signaling
in directed mesenchymal cell migration. 2018. doi:10.15479/AT:ISTA:TH_1031
apa: Capek, D. (2018). Optogenetic Frizzled 7 reveals a permissive function of
Wnt/PCP signaling in directed mesenchymal cell migration. Institute of Science
and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_1031
chicago: Capek, Daniel. “Optogenetic Frizzled 7 Reveals a Permissive Function of
Wnt/PCP Signaling in Directed Mesenchymal Cell Migration.” Institute of Science
and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH_1031.
ieee: D. Capek, “Optogenetic Frizzled 7 reveals a permissive function of Wnt/PCP
signaling in directed mesenchymal cell migration,” Institute of Science and Technology
Austria, 2018.
ista: Capek D. 2018. Optogenetic Frizzled 7 reveals a permissive function of Wnt/PCP
signaling in directed mesenchymal cell migration. Institute of Science and Technology
Austria.
mla: Capek, Daniel. Optogenetic Frizzled 7 Reveals a Permissive Function of Wnt/PCP
Signaling in Directed Mesenchymal Cell Migration. Institute of Science and
Technology Austria, 2018, doi:10.15479/AT:ISTA:TH_1031.
short: D. Capek, Optogenetic Frizzled 7 Reveals a Permissive Function of Wnt/PCP
Signaling in Directed Mesenchymal Cell Migration, Institute of Science and Technology
Austria, 2018.
date_created: 2018-12-11T11:44:21Z
date_published: 2018-06-22T00:00:00Z
date_updated: 2023-09-07T12:48:16Z
day: '22'
ddc:
- '570'
- '591'
- '596'
degree_awarded: PhD
department:
- _id: CaHe
doi: 10.15479/AT:ISTA:TH_1031
file:
- access_level: open_access
checksum: d3eca3dcacb67bffdde6e6609c31cdd0
content_type: application/pdf
creator: dernst
date_created: 2019-04-08T13:42:26Z
date_updated: 2021-02-11T11:17:17Z
embargo: 2019-06-25
file_id: '6238'
file_name: 2018_Thesis_Capek.pdf
file_size: 31576521
relation: main_file
- access_level: closed
checksum: 876deb14067e638aba65d209668bd821
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: dernst
date_created: 2019-04-08T13:42:27Z
date_updated: 2021-02-11T23:30:21Z
embargo_to: open_access
file_id: '6239'
file_name: 2018_Thesis_Capek_source.docx
file_size: 38992956
relation: source_file
file_date_updated: 2021-02-11T23:30:21Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '95'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '8004'
pubrep_id: '1031'
related_material:
record:
- id: '1100'
relation: part_of_dissertation
status: public
- id: '661'
relation: part_of_dissertation
status: public
- id: '676'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
title: Optogenetic Frizzled 7 reveals a permissive function of Wnt/PCP signaling in
directed mesenchymal cell migration
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...