---
_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: '32'
abstract:
- lang: eng
text: The functional role of AMPA receptor (AMPAR)-mediated synaptic signaling between
neurons and oligodendrocyte precursor cells (OPCs) remains enigmatic. We modified
the properties of AMPARs at axon-OPC synapses in the mouse corpus callosum in
vivo during the peak of myelination by targeting the GluA2 subunit. Expression
of the unedited (Ca2+ permeable) or the pore-dead GluA2 subunit of AMPARs triggered
proliferation of OPCs and reduced their differentiation into oligodendrocytes.
Expression of the cytoplasmic C-terminal (GluA2(813-862)) of the GluA2 subunit
(C-tail), a modification designed to affect the interaction between GluA2 and
AMPAR-binding proteins and to perturb trafficking of GluA2-containing AMPARs,
decreased the differentiation of OPCs without affecting their proliferation. These
findings suggest that ionotropic and non-ionotropic properties of AMPARs in OPCs,
as well as specific aspects of AMPAR-mediated signaling at axon-OPC synapses in
the mouse corpus callosum, are important for balancing the response of OPCs to
proliferation and differentiation cues. In the brain, oligodendrocyte precursor
cells (OPCs) receive glutamatergic AMPA-receptor-mediated synaptic input from
neurons. Chen et al. show that modifying AMPA-receptor properties at axon-OPC
synapses alters proliferation and differentiation of OPCs. This expands the traditional
view of synaptic transmission by suggesting neurons also use synapses to modulate
behavior of glia.
acknowledgement: This work was supported by Deutsche Forschungsgemeinschaft (DFG)
grant KU2569/1-1 (to M.K.); DFG project EXC307Centre for Integrative Neuroscience
(CIN), including grant Pool Project 2011-12 (jointly to M.K. and I.E.); and the
Charitable Hertie Foundation (to I.E.). CIN is an Excellence Cluster funded by the
DFG within the framework of the Excellence Initiative for 2008–2018. M.K. is supported
by the Tistou & Charlotte Kerstan Foundation.
article_processing_charge: No
author:
- first_name: Ting
full_name: Chen, Ting
last_name: Chen
- first_name: Bartosz
full_name: Kula, Bartosz
last_name: Kula
- first_name: Balint
full_name: Nagy, Balint
id: 30F830CE-02D1-11E9-9BAA-DAF4881429F2
last_name: Nagy
orcid: 0000-0002-4002-4686
- first_name: Ruxandra
full_name: Barzan, Ruxandra
last_name: Barzan
- first_name: Andrea
full_name: Gall, Andrea
last_name: Gall
- first_name: Ingrid
full_name: Ehrlich, Ingrid
last_name: Ehrlich
- first_name: Maria
full_name: Kukley, Maria
last_name: Kukley
citation:
ama: Chen T, Kula B, Nagy B, et al. In Vivo regulation of Oligodendrocyte processor
cell proliferation and differentiation by the AMPA-receptor Subunit GluA2. Cell
Reports. 2018;25(4):852-861.e7. doi:10.1016/j.celrep.2018.09.066
apa: Chen, T., Kula, B., Nagy, B., Barzan, R., Gall, A., Ehrlich, I., & Kukley,
M. (2018). In Vivo regulation of Oligodendrocyte processor cell proliferation
and differentiation by the AMPA-receptor Subunit GluA2. Cell Reports. Elsevier.
https://doi.org/10.1016/j.celrep.2018.09.066
chicago: Chen, Ting, Bartosz Kula, Balint Nagy, Ruxandra Barzan, Andrea Gall, Ingrid
Ehrlich, and Maria Kukley. “In Vivo Regulation of Oligodendrocyte Processor Cell
Proliferation and Differentiation by the AMPA-Receptor Subunit GluA2.” Cell
Reports. Elsevier, 2018. https://doi.org/10.1016/j.celrep.2018.09.066.
ieee: T. Chen et al., “In Vivo regulation of Oligodendrocyte processor cell
proliferation and differentiation by the AMPA-receptor Subunit GluA2,” Cell
Reports, vol. 25, no. 4. Elsevier, p. 852–861.e7, 2018.
ista: Chen T, Kula B, Nagy B, Barzan R, Gall A, Ehrlich I, Kukley M. 2018. In Vivo
regulation of Oligodendrocyte processor cell proliferation and differentiation
by the AMPA-receptor Subunit GluA2. Cell Reports. 25(4), 852–861.e7.
mla: Chen, Ting, et al. “In Vivo Regulation of Oligodendrocyte Processor Cell Proliferation
and Differentiation by the AMPA-Receptor Subunit GluA2.” Cell Reports,
vol. 25, no. 4, Elsevier, 2018, p. 852–861.e7, doi:10.1016/j.celrep.2018.09.066.
short: T. Chen, B. Kula, B. Nagy, R. Barzan, A. Gall, I. Ehrlich, M. Kukley, Cell
Reports 25 (2018) 852–861.e7.
date_created: 2018-12-11T11:44:16Z
date_published: 2018-10-23T00:00:00Z
date_updated: 2023-09-11T14:13:32Z
day: '23'
ddc:
- '570'
department:
- _id: SaSi
doi: 10.1016/j.celrep.2018.09.066
external_id:
isi:
- '000448219500005'
file:
- access_level: open_access
checksum: d9f74277fd57176e04732707d575cf08
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T12:42:57Z
date_updated: 2020-07-14T12:46:03Z
file_id: '5703'
file_name: 2018_CellReports_Chen.pdf
file_size: 4461997
relation: main_file
file_date_updated: 2020-07-14T12:46:03Z
has_accepted_license: '1'
intvolume: ' 25'
isi: 1
issue: '4'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 852 - 861.e7
publication: Cell Reports
publication_status: published
publisher: Elsevier
publist_id: '8023'
quality_controlled: '1'
scopus_import: '1'
status: public
title: In Vivo regulation of Oligodendrocyte processor cell proliferation and differentiation
by the AMPA-receptor Subunit GluA2
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 25
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: '321'
abstract:
- lang: eng
text: The twelve papers in this special section focus on learning systems with shared
information for computer vision and multimedia communication analysis. In the
real world, a realistic setting for computer vision or multimedia recognition
problems is that we have some classes containing lots of training data and many
classes containing a small amount of training data. Therefore, how to use frequent
classes to help learning rare classes for which it is harder to collect the training
data is an open question. Learning with shared information is an emerging topic
in machine learning, computer vision and multimedia analysis. There are different
levels of components that can be shared during concept modeling and machine learning
stages, such as sharing generic object parts, sharing attributes, sharing transformations,
sharing regularization parameters and sharing training examples, etc. Regarding
the specific methods, multi-task learning, transfer learning and deep learning
can be seen as using different strategies to share information. These learning
with shared information methods are very effective in solving real-world large-scale
problems.
article_processing_charge: No
article_type: original
author:
- first_name: Trevor
full_name: Darrell, Trevor
last_name: Darrell
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
- first_name: Nico
full_name: Sebe, Nico
last_name: Sebe
- first_name: Ying
full_name: Wu, Ying
last_name: Wu
- first_name: Yan
full_name: Yan, Yan
last_name: Yan
citation:
ama: Darrell T, Lampert C, Sebe N, Wu Y, Yan Y. Guest editors’ introduction to the
special section on learning with Shared information for computer vision and multimedia
analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence.
2018;40(5):1029-1031. doi:10.1109/TPAMI.2018.2804998
apa: Darrell, T., Lampert, C., Sebe, N., Wu, Y., & Yan, Y. (2018). Guest editors’
introduction to the special section on learning with Shared information for computer
vision and multimedia analysis. IEEE Transactions on Pattern Analysis and Machine
Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2018.2804998
chicago: Darrell, Trevor, Christoph Lampert, Nico Sebe, Ying Wu, and Yan Yan. “Guest
Editors’ Introduction to the Special Section on Learning with Shared Information
for Computer Vision and Multimedia Analysis.” IEEE Transactions on Pattern
Analysis and Machine Intelligence. IEEE, 2018. https://doi.org/10.1109/TPAMI.2018.2804998.
ieee: T. Darrell, C. Lampert, N. Sebe, Y. Wu, and Y. Yan, “Guest editors’ introduction
to the special section on learning with Shared information for computer vision
and multimedia analysis,” IEEE Transactions on Pattern Analysis and Machine
Intelligence, vol. 40, no. 5. IEEE, pp. 1029–1031, 2018.
ista: Darrell T, Lampert C, Sebe N, Wu Y, Yan Y. 2018. Guest editors’ introduction
to the special section on learning with Shared information for computer vision
and multimedia analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence.
40(5), 1029–1031.
mla: Darrell, Trevor, et al. “Guest Editors’ Introduction to the Special Section
on Learning with Shared Information for Computer Vision and Multimedia Analysis.”
IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40,
no. 5, IEEE, 2018, pp. 1029–31, doi:10.1109/TPAMI.2018.2804998.
short: T. Darrell, C. Lampert, N. Sebe, Y. Wu, Y. Yan, IEEE Transactions on Pattern
Analysis and Machine Intelligence 40 (2018) 1029–1031.
date_created: 2018-12-11T11:45:48Z
date_published: 2018-05-01T00:00:00Z
date_updated: 2023-09-11T14:07:54Z
day: '01'
ddc:
- '000'
department:
- _id: ChLa
doi: 10.1109/TPAMI.2018.2804998
external_id:
isi:
- '000428901200001'
file:
- access_level: open_access
checksum: b19c75da06faf3291a3ca47dfa50ef63
content_type: application/pdf
creator: dernst
date_created: 2020-05-14T12:50:48Z
date_updated: 2020-07-14T12:46:03Z
file_id: '7835'
file_name: 2018_IEEE_Darrell.pdf
file_size: 141724
relation: main_file
file_date_updated: 2020-07-14T12:46:03Z
has_accepted_license: '1'
intvolume: ' 40'
isi: 1
issue: '5'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 1029 - 1031
publication: IEEE Transactions on Pattern Analysis and Machine Intelligence
publication_status: published
publisher: IEEE
publist_id: '7544'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Guest editors' introduction to the special section on learning with Shared
information for computer vision and multimedia analysis
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 40
year: '2018'
...
---
_id: '322'
abstract:
- lang: eng
text: We construct quantizations of multiplicative hypertoric varieties using an
algebra of q-difference operators on affine space, where q is a root of unity
in C. The quantization defines a matrix bundle (i.e. Azumaya algebra) over the
multiplicative hypertoric variety and admits an explicit finite étale splitting.
The global sections of this Azumaya algebra is a hypertoric quantum group, and
we prove a localization theorem. We introduce a general framework of Frobenius
quantum moment maps and their Hamiltonian reductions; our results shed light on
an instance of this framework.
acknowledgement: "National Science Foundation: Graduate Research Fellowship and grant
No.0932078000; ERC Advanced Grant “Arithmetic and Physics of Higgs moduli spaces”
No. 320593 \r\nThe author is grateful to David Jordan for suggesting this project
and providing guidance throughout, particularly for the formulation of Frobenius
quantum moment maps and key ideas in the proofs of Theorems 3.12 and 4.8. Special
thanks to David Ben-Zvi (the author's PhD advisor) for numerous discussions and
constant encouragement, and for suggesting the term ‘hypertoric quantum group.’
Many results appearing in the current paper were proven independently by Nicholas
Cooney; the author is grateful to Nicholas for sharing his insight on various topics,
including Proposition 3.8. The author also thanks Nicholas Proudfoot for relating
the definition of multiplicative hypertoric varieties, as well as the content of
Remark 2.14. The author also benefited immensely from the close reading and detailed
comments of an anonymous referee, and from conversations with Justin Hilburn, Kobi
Kremnitzer, Michael McBreen, Tom Nevins, Travis Schedler, and Ben Webster. \r\n\r\n\r\n\r\n"
article_processing_charge: No
arxiv: 1
author:
- first_name: Iordan V
full_name: Ganev, Iordan V
id: 447491B8-F248-11E8-B48F-1D18A9856A87
last_name: Ganev
citation:
ama: Ganev IV. Quantizations of multiplicative hypertoric varieties at a root of
unity. Journal of Algebra. 2018;506:92-128. doi:10.1016/j.jalgebra.2018.03.015
apa: Ganev, I. V. (2018). Quantizations of multiplicative hypertoric varieties at
a root of unity. Journal of Algebra. World Scientific Publishing. https://doi.org/10.1016/j.jalgebra.2018.03.015
chicago: Ganev, Iordan V. “Quantizations of Multiplicative Hypertoric Varieties
at a Root of Unity.” Journal of Algebra. World Scientific Publishing, 2018.
https://doi.org/10.1016/j.jalgebra.2018.03.015.
ieee: I. V. Ganev, “Quantizations of multiplicative hypertoric varieties at a root
of unity,” Journal of Algebra, vol. 506. World Scientific Publishing, pp.
92–128, 2018.
ista: Ganev IV. 2018. Quantizations of multiplicative hypertoric varieties at a
root of unity. Journal of Algebra. 506, 92–128.
mla: Ganev, Iordan V. “Quantizations of Multiplicative Hypertoric Varieties at a
Root of Unity.” Journal of Algebra, vol. 506, World Scientific Publishing,
2018, pp. 92–128, doi:10.1016/j.jalgebra.2018.03.015.
short: I.V. Ganev, Journal of Algebra 506 (2018) 92–128.
date_created: 2018-12-11T11:45:49Z
date_published: 2018-07-15T00:00:00Z
date_updated: 2023-09-15T12:08:38Z
day: '15'
department:
- _id: TaHa
doi: 10.1016/j.jalgebra.2018.03.015
ec_funded: 1
external_id:
arxiv:
- '1412.7211'
isi:
- '000433270600005'
intvolume: ' 506'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1412.7211
month: '07'
oa: 1
oa_version: Preprint
page: 92 - 128
project:
- _id: 25E549F4-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '320593'
name: Arithmetic and physics of Higgs moduli spaces
publication: Journal of Algebra
publication_status: published
publisher: World Scientific Publishing
publist_id: '7543'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quantizations of multiplicative hypertoric varieties at a root of unity
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 506
year: '2018'
...
---
_id: '323'
abstract:
- lang: eng
text: 'In the here presented thesis, we explore the role of branched actin networks
in cell migration and antigen presentation, the two most relevant processes in
dendritic cell biology. Branched actin networks construct lamellipodial protrusions
at the leading edge of migrating cells. These are typically seen as adhesive structures,
which mediate force transduction to the extracellular matrix that leads to forward
locomotion. We ablated Arp2/3 nucleation promoting factor WAVE in DCs and found
that the resulting cells lack lamellipodial protrusions. Instead, depending on
the maturation state, one or multiple filopodia were formed. By challenging these
cells in a variety of migration assays we found that lamellipodial protrusions
are dispensable for the locomotion of leukocytes and actually dampen the speed
of migration. However, lamellipodia are critically required to negotiate complex
environments that DCs experience while they travel to the next draining lymph
node. Taken together our results suggest that leukocyte lamellipodia have rather
a sensory- than a force transducing function. Furthermore, we show for the first
time structure and dynamics of dendritic cell F-actin at the immunological synapse
with naïve T cells. Dendritic cell F-actin appears as dynamic foci that are nucleated
by the Arp2/3 complex. WAVE ablated dendritic cells show increased membrane tension,
leading to an altered ultrastructure of the immunological synapse and severe T
cell priming defects. These results point towards a previously unappreciated role
of the cellular mechanics of dendritic cells in T cell activation. Additionally,
we present a novel cell culture based system for the differentiation of dendritic
cells from conditionally immortalized hematopoietic precursors. These precursor
cells are genetically tractable via the CRISPR/Cas9 system while they retain their
ability to differentiate into highly migratory dendritic cells and other immune
cells. This will foster the study of all aspects of dendritic cell biology and
beyond. '
acknowledged_ssus:
- _id: NanoFab
- _id: Bio
- _id: PreCl
- _id: EM-Fac
acknowledgement: "First of all I would like to thank Michael Sixt for giving me the
opportunity to work in \r\nhis group and for his support throughout the years. He
is a truly inspiring person and \r\nthe best boss one can imagine. I would
\ also like to thank all current and past \r\nmembers of the Sixt group for
their help and the great working atmosphere in the lab. \r\nIt is a true privilege
to work with such a bright, funny and friendly group of people and \r\nI’m proud
\ that I could be part of it. Furthermore, I would like to say ‘thank
\ you’ to Daria Siekhaus for all the meetings and discussion we had throughout
the years \r\nand to Federica Benvenuti for being part of my committee.
\ I am also grateful to Jack \r\nMerrin in the nanofabrication facility
\ and all the people working in the bioimaging-\r\n, the electron microscopy-
and the preclinical facilities."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Alexander F
full_name: Leithner, Alexander F
id: 3B1B77E4-F248-11E8-B48F-1D18A9856A87
last_name: Leithner
orcid: 0000-0002-1073-744X
citation:
ama: Leithner AF. Branched actin networks in dendritic cell biology. 2018. doi:10.15479/AT:ISTA:th_998
apa: Leithner, A. F. (2018). Branched actin networks in dendritic cell biology.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_998
chicago: Leithner, Alexander F. “Branched Actin Networks in Dendritic Cell Biology.”
Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_998.
ieee: A. F. Leithner, “Branched actin networks in dendritic cell biology,” Institute
of Science and Technology Austria, 2018.
ista: Leithner AF. 2018. Branched actin networks in dendritic cell biology. Institute
of Science and Technology Austria.
mla: Leithner, Alexander F. Branched Actin Networks in Dendritic Cell Biology.
Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_998.
short: A.F. Leithner, Branched Actin Networks in Dendritic Cell Biology, Institute
of Science and Technology Austria, 2018.
date_created: 2018-12-11T11:45:49Z
date_published: 2018-04-12T00:00:00Z
date_updated: 2023-09-07T12:39:44Z
day: '12'
ddc:
- '571'
- '599'
- '610'
degree_awarded: PhD
department:
- _id: MiSi
doi: 10.15479/AT:ISTA:th_998
file:
- access_level: closed
checksum: d5e3edbac548c26c1fa43a4b37a54a4c
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: dernst
date_created: 2019-04-05T09:23:11Z
date_updated: 2021-02-11T23:30:17Z
embargo_to: open_access
file_id: '6219'
file_name: PhD_thesis_AlexLeithner_final_version.docx
file_size: 29027671
relation: source_file
- access_level: open_access
checksum: 071f7476db29e41146824ebd0697cb10
content_type: application/pdf
creator: dernst
date_created: 2019-04-05T09:23:11Z
date_updated: 2021-02-11T11:17:16Z
embargo: 2019-04-15
file_id: '6220'
file_name: PhD_thesis_AlexLeithner.pdf
file_size: 66045341
relation: main_file
file_date_updated: 2021-02-11T23:30:17Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '99'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7542'
pubrep_id: '998'
related_material:
record:
- id: '1321'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
title: Branched actin networks in dendritic cell biology
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: '324'
abstract:
- lang: eng
text: Neuronal networks in the brain consist of two main types of neuron, glutamatergic
principal neurons and GABAergic interneurons. Although these interneurons only
represent 10–20% of the whole population, they mediate feedback and feedforward
inhibition and are involved in the generation of high-frequency network oscillations.
A hallmark functional property of GABAergic interneurons, especially of the parvalbumin‑expressing
(PV+) subtypes, is the speed of signaling at their output synapse across species
and brain regions. Several molecular and subcellular factors may underlie the
submillisecond signaling at GABAergic synapses. Such as the selective use of P/Q
type Ca2+ channels and the tight coupling between Ca2+ channels and Ca2+ sensors
of exocytosis. However, whether the molecular identity of the release sensor contributes
to these signaling properties remains unclear. Besides, these interneurons are
mainly show depression in response to train of stimuli. How could they keep sufficient
release to control the activity of postsynaptic principal neurons during high
network activity, is largely elusive. For my Ph.D. work, we firstly examined the
Ca2+ sensor of exocytosis at the GABAergic basket cell (BC) to Purkinje cell (PC)
synapse in the cerebellum. Immunolabeling suggested that BC terminals selectively
expressed synaptotagmin 2 (Syt2), whereas synaptotagmin 1 (Syt1) was enriched
in excitatory terminals. Genetic elimination of Syt2 reduced action potential-evoked
release to ~10% compared to the wild-type control, identifying Syt2 as the major
Ca2+ sensor at BC‑PC synapses. Differential adenovirus-mediated rescue revealed
Syt2 triggered release with shorter latency and higher temporal precision, and
mediated faster vesicle pool replenishment than Syt1. Furthermore, deletion of
Syt2 severely reduced and delayed disynaptic inhibition following parallel fiber
stimulation. Thus, the selective use of Syt2 as the release sensor at BC–PC synapse
ensures fast feedforward inhibition in cerebellar microcircuits. Additionally,
we tested the function of another synaptotagmin member, Syt7, for inhibitory synaptic
transmission at the BC–PC synapse. Syt7 is thought to be a Ca2+ sensor that mediates
asynchronous transmitter release and facilitation at synapses. However, it is
strongly expressed in fast-spiking, PV+ GABAergic interneurons and the output
synapses of these neurons produce only minimal asynchronous release and show depression
rather than facilitation. How could Syt7, a facilitation sensor, contribute to
the depressed inhibitory synaptic transmission needs to be further investigated
and understood. Our results indicated that at the BC–PC synapse, Syt7 contributes
to asynchronous release, pool replenishment and facilitation. In combination,
these three effects ensure efficient transmitter release during high‑frequency
activity and guarantee frequency independence of inhibition. Taken together, our
results confirmed that Syt2, which has the fastest kinetic properties among all
synaptotagmin members, is mainly used by the inhibitory BC‑PC synapse for synaptic
transmission, contributing to the speed and temporal precision of transmitter
release. Furthermore, we showed that Syt7, another highly expressed synaptotagmin
member in the output synapses of cerebellar BCs, is used for ensuring efficient
inhibitor synaptic transmission during high activity.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Chong
full_name: Chen, Chong
id: 3DFD581A-F248-11E8-B48F-1D18A9856A87
last_name: Chen
citation:
ama: Chen C. Synaptotagmins ensure speed and efficiency of inhibitory neurotransmitter
release. 2018. doi:10.15479/AT:ISTA:th_997
apa: Chen, C. (2018). Synaptotagmins ensure speed and efficiency of inhibitory
neurotransmitter release. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_997
chicago: Chen, Chong. “Synaptotagmins Ensure Speed and Efficiency of Inhibitory
Neurotransmitter Release.” Institute of Science and Technology Austria, 2018.
https://doi.org/10.15479/AT:ISTA:th_997.
ieee: C. Chen, “Synaptotagmins ensure speed and efficiency of inhibitory neurotransmitter
release,” Institute of Science and Technology Austria, 2018.
ista: Chen C. 2018. Synaptotagmins ensure speed and efficiency of inhibitory neurotransmitter
release. Institute of Science and Technology Austria.
mla: Chen, Chong. Synaptotagmins Ensure Speed and Efficiency of Inhibitory Neurotransmitter
Release. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_997.
short: C. Chen, Synaptotagmins Ensure Speed and Efficiency of Inhibitory Neurotransmitter
Release, Institute of Science and Technology Austria, 2018.
date_created: 2018-12-11T11:45:49Z
date_published: 2018-03-01T00:00:00Z
date_updated: 2023-09-27T12:26:03Z
day: '01'
ddc:
- '571'
degree_awarded: PhD
department:
- _id: PeJo
doi: 10.15479/AT:ISTA:th_997
file:
- access_level: open_access
checksum: 8e163ae9e927401b9fa7c1b3e6a3631a
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:58Z
date_updated: 2020-07-14T12:46:04Z
file_id: '5046'
file_name: IST-2018-997-v1+1_Thesis_chong_a.pdf
file_size: 8719458
relation: main_file
- access_level: closed
checksum: f7d7260029a5fbb5c982db61328ade52
content_type: application/octet-stream
creator: dernst
date_created: 2019-04-05T09:25:26Z
date_updated: 2020-07-14T12:46:04Z
file_id: '6221'
file_name: 2018_Thesis_chong_source.pages
file_size: 47841940
relation: source_file
file_date_updated: 2020-07-14T12:46:04Z
has_accepted_license: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: '110'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7541'
pubrep_id: '997'
related_material:
record:
- id: '1117'
relation: part_of_dissertation
status: public
- id: '749'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
title: Synaptotagmins ensure speed and efficiency of inhibitory neurotransmitter release
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: '325'
abstract:
- lang: eng
text: Probabilistic programs extend classical imperative programs with real-valued
random variables and random branching. The most basic liveness property for such
programs is the termination property. The qualitative (aka almost-sure) termination
problem asks whether a given program program terminates with probability 1. While
ranking functions provide a sound and complete method for non-probabilistic programs,
the extension of them to probabilistic programs is achieved via ranking supermartingales
(RSMs). Although deep theoretical results have been established about RSMs, their
application to probabilistic programs with nondeterminism has been limited only
to programs of restricted control-flow structure. For non-probabilistic programs,
lexicographic ranking functions provide a compositional and practical approach
for termination analysis of real-world programs. In this work we introduce lexicographic
RSMs and show that they present a sound method for almost-sure termination of
probabilistic programs with nondeterminism. We show that lexicographic RSMs provide
a tool for compositional reasoning about almost-sure termination, and for probabilistic
programs with linear arithmetic they can be synthesized efficiently (in polynomial
time). We also show that with additional restrictions even asymptotic bounds on
expected termination time can be obtained through lexicographic RSMs. Finally,
we present experimental results on benchmarks adapted from previous work to demonstrate
the effectiveness of our approach.
article_number: '34'
arxiv: 1
author:
- first_name: Sheshansh
full_name: Agrawal, Sheshansh
last_name: Agrawal
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Petr
full_name: Novotny, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotny
citation:
ama: 'Agrawal S, Chatterjee K, Novotný P. Lexicographic ranking supermartingales:
an efficient approach to termination of probabilistic programs. In: Vol 2. ACM;
2018. doi:10.1145/3158122'
apa: 'Agrawal, S., Chatterjee, K., & Novotný, P. (2018). Lexicographic ranking
supermartingales: an efficient approach to termination of probabilistic programs
(Vol. 2). Presented at the POPL: Principles of Programming Languages, Los Angeles,
CA, USA: ACM. https://doi.org/10.1145/3158122'
chicago: 'Agrawal, Sheshansh, Krishnendu Chatterjee, and Petr Novotný. “Lexicographic
Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic
Programs,” Vol. 2. ACM, 2018. https://doi.org/10.1145/3158122.'
ieee: 'S. Agrawal, K. Chatterjee, and P. Novotný, “Lexicographic ranking supermartingales:
an efficient approach to termination of probabilistic programs,” presented at
the POPL: Principles of Programming Languages, Los Angeles, CA, USA, 2018, vol.
2, no. POPL.'
ista: 'Agrawal S, Chatterjee K, Novotný P. 2018. Lexicographic ranking supermartingales:
an efficient approach to termination of probabilistic programs. POPL: Principles
of Programming Languages vol. 2, 34.'
mla: 'Agrawal, Sheshansh, et al. Lexicographic Ranking Supermartingales: An Efficient
Approach to Termination of Probabilistic Programs. Vol. 2, no. POPL, 34, ACM,
2018, doi:10.1145/3158122.'
short: S. Agrawal, K. Chatterjee, P. Novotný, in:, ACM, 2018.
conference:
end_date: 2018-01-13
location: Los Angeles, CA, USA
name: 'POPL: Principles of Programming Languages'
start_date: 2018-01-07
date_created: 2018-12-11T11:45:50Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2021-01-12T07:42:07Z
day: '01'
department:
- _id: KrCh
doi: 10.1145/3158122
external_id:
arxiv:
- '1709.04037'
intvolume: ' 2'
issue: POPL
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1709.04037
month: '01'
oa: 1
oa_version: Preprint
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: ACM
publist_id: '7540'
quality_controlled: '1'
status: public
title: 'Lexicographic ranking supermartingales: an efficient approach to termination
of probabilistic programs'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2018'
...
---
_id: '326'
abstract:
- lang: eng
text: Three-dimensional (3D) super-resolution microscopy technique structured illumination
microscopy (SIM) imaging of dendritic spines along the dendrite has not been previously
performed in fixed tissues, mainly due to deterioration of the stripe pattern
of the excitation laser induced by light scattering and optical aberrations. To
address this issue and solve these optical problems, we applied a novel clearing
reagent, LUCID, to fixed brains. In SIM imaging, the penetration depth and the
spatial resolution were improved in LUCID-treated slices, and 160-nm spatial resolution
was obtained in a large portion of the imaging volume on a single apical dendrite.
Furthermore, in a morphological analysis of spine heads of layer V pyramidal neurons
(L5PNs) in the medial prefrontal cortex (mPFC) of chronic dexamethasone (Dex)-treated
mice, SIM imaging revealed an altered distribution of spine forms that could not
be detected by high-NA confocal imaging. Thus, super-resolution SIM imaging represents
a promising high-throughput method for revealing spine morphologies in single
dendrites.
acknowledged_ssus:
- _id: EM-Fac
article_processing_charge: No
author:
- first_name: Kazuaki
full_name: Sawada, Kazuaki
last_name: Sawada
- first_name: Ryosuke
full_name: Kawakami, Ryosuke
last_name: Kawakami
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Tomomi
full_name: Nemoto, Tomomi
last_name: Nemoto
citation:
ama: Sawada K, Kawakami R, Shigemoto R, Nemoto T. Super resolution structural analysis
of dendritic spines using three-dimensional structured illumination microscopy
in cleared mouse brain slices. European Journal of Neuroscience. 2018;47(9):1033-1042.
doi:10.1111/ejn.13901
apa: Sawada, K., Kawakami, R., Shigemoto, R., & Nemoto, T. (2018). Super resolution
structural analysis of dendritic spines using three-dimensional structured illumination
microscopy in cleared mouse brain slices. European Journal of Neuroscience.
Wiley. https://doi.org/10.1111/ejn.13901
chicago: Sawada, Kazuaki, Ryosuke Kawakami, Ryuichi Shigemoto, and Tomomi Nemoto.
“Super Resolution Structural Analysis of Dendritic Spines Using Three-Dimensional
Structured Illumination Microscopy in Cleared Mouse Brain Slices.” European
Journal of Neuroscience. Wiley, 2018. https://doi.org/10.1111/ejn.13901.
ieee: K. Sawada, R. Kawakami, R. Shigemoto, and T. Nemoto, “Super resolution structural
analysis of dendritic spines using three-dimensional structured illumination microscopy
in cleared mouse brain slices,” European Journal of Neuroscience, vol.
47, no. 9. Wiley, pp. 1033–1042, 2018.
ista: Sawada K, Kawakami R, Shigemoto R, Nemoto T. 2018. Super resolution structural
analysis of dendritic spines using three-dimensional structured illumination microscopy
in cleared mouse brain slices. European Journal of Neuroscience. 47(9), 1033–1042.
mla: Sawada, Kazuaki, et al. “Super Resolution Structural Analysis of Dendritic
Spines Using Three-Dimensional Structured Illumination Microscopy in Cleared Mouse
Brain Slices.” European Journal of Neuroscience, vol. 47, no. 9, Wiley,
2018, pp. 1033–42, doi:10.1111/ejn.13901.
short: K. Sawada, R. Kawakami, R. Shigemoto, T. Nemoto, European Journal of Neuroscience
47 (2018) 1033–1042.
date_created: 2018-12-11T11:45:50Z
date_published: 2018-03-07T00:00:00Z
date_updated: 2023-09-19T09:58:40Z
day: '07'
ddc:
- '570'
department:
- _id: RySh
doi: 10.1111/ejn.13901
external_id:
isi:
- '000431496400001'
file:
- access_level: open_access
checksum: 98e901d8229e44aa8f3b51d248dedd09
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T16:16:50Z
date_updated: 2020-07-14T12:46:06Z
file_id: '5721'
file_name: 2018_EJN_Sawada.pdf
file_size: 4850261
relation: main_file
file_date_updated: 2020-07-14T12:46:06Z
has_accepted_license: '1'
intvolume: ' 47'
isi: 1
issue: '9'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 1033 - 1042
publication: European Journal of Neuroscience
publication_status: published
publisher: Wiley
publist_id: '7539'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Super resolution structural analysis of dendritic spines using three-dimensional
structured illumination microscopy in cleared mouse brain slices
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: 47
year: '2018'
...
---
_id: '327'
abstract:
- lang: eng
text: Many-body quantum systems typically display fast dynamics and ballistic spreading
of information. Here we address the open problem of how slow the dynamics can
be after a generic breaking of integrability by local interactions. We develop
a method based on degenerate perturbation theory that reveals slow dynamical regimes
and delocalization processes in general translation invariant models, along with
accurate estimates of their delocalization time scales. Our results shed light
on the fundamental questions of the robustness of quantum integrable systems and
the possibility of many-body localization without disorder. As an example, we
construct a large class of one-dimensional lattice models where, despite the absence
of asymptotic localization, the transient dynamics is exceptionally slow, i.e.,
the dynamics is indistinguishable from that of many-body localized systems for
the system sizes and time scales accessible in experiments and numerical simulations.
acknowledgement: 'We thank F. Huveneers for useful discussions. Z.P. and A.M. acknowledge
support by EPSRC Grant No. EP/P009409/1 and and the Royal Society Research Grant
No. RG160635. Statement of compliance with EPSRC policy framework on research data:
This publication is theoretical work that does not require supporting research data.
D.A. acknowledges support by the Swiss National Science Foundation. M.Z., M.M. and
T.P. acknowledge Grants J1-7279 (M.Z.) and N1-0025 (M.M. and T.P.) of Slovenian
Research Agency, and Advanced Grant of European Research Council, Grant No. 694544
- OMNES (T.P.).'
article_number: '104307'
article_processing_charge: No
author:
- first_name: Alexios
full_name: Michailidis, Alexios
id: 36EBAD38-F248-11E8-B48F-1D18A9856A87
last_name: Michailidis
orcid: 0000-0002-8443-1064
- first_name: Marko
full_name: Žnidarič, Marko
last_name: Žnidarič
- first_name: Mariya
full_name: Medvedyeva, Mariya
last_name: Medvedyeva
- first_name: Dmitry
full_name: Abanin, Dmitry
last_name: Abanin
- first_name: Tomaž
full_name: Prosen, Tomaž
last_name: Prosen
- first_name: Zlatko
full_name: Papić, Zlatko
last_name: Papić
citation:
ama: Michailidis A, Žnidarič M, Medvedyeva M, Abanin D, Prosen T, Papić Z. Slow
dynamics in translation-invariant quantum lattice models. Physical Review B.
2018;97(10). doi:10.1103/PhysRevB.97.104307
apa: Michailidis, A., Žnidarič, M., Medvedyeva, M., Abanin, D., Prosen, T., &
Papić, Z. (2018). Slow dynamics in translation-invariant quantum lattice models.
Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.97.104307
chicago: Michailidis, Alexios, Marko Žnidarič, Mariya Medvedyeva, Dmitry Abanin,
Tomaž Prosen, and Zlatko Papić. “Slow Dynamics in Translation-Invariant Quantum
Lattice Models.” Physical Review B. American Physical Society, 2018. https://doi.org/10.1103/PhysRevB.97.104307.
ieee: A. Michailidis, M. Žnidarič, M. Medvedyeva, D. Abanin, T. Prosen, and Z. Papić,
“Slow dynamics in translation-invariant quantum lattice models,” Physical Review
B, vol. 97, no. 10. American Physical Society, 2018.
ista: Michailidis A, Žnidarič M, Medvedyeva M, Abanin D, Prosen T, Papić Z. 2018.
Slow dynamics in translation-invariant quantum lattice models. Physical Review
B. 97(10), 104307.
mla: Michailidis, Alexios, et al. “Slow Dynamics in Translation-Invariant Quantum
Lattice Models.” Physical Review B, vol. 97, no. 10, 104307, American Physical
Society, 2018, doi:10.1103/PhysRevB.97.104307.
short: A. Michailidis, M. Žnidarič, M. Medvedyeva, D. Abanin, T. Prosen, Z. Papić,
Physical Review B 97 (2018).
date_created: 2018-12-11T11:45:50Z
date_published: 2018-03-19T00:00:00Z
date_updated: 2023-09-18T09:31:46Z
day: '19'
department:
- _id: MaSe
doi: 10.1103/PhysRevB.97.104307
external_id:
isi:
- '000427798800005'
intvolume: ' 97'
isi: 1
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1706.05026
month: '03'
oa: 1
oa_version: Preprint
publication: Physical Review B
publication_status: published
publisher: American Physical Society
publist_id: '7538'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Slow dynamics in translation-invariant quantum lattice models
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 97
year: '2018'
...
---
_id: '328'
abstract:
- lang: eng
text: The drag of turbulent flows can be drastically decreased by adding small amounts
of high molecular weight polymers. While drag reduction initially increases with
polymer concentration, it eventually saturates to what is known as the maximum
drag reduction (MDR) asymptote; this asymptote is generally attributed to the
dynamics being reduced to a marginal yet persistent state of subdued turbulent
motion. Contrary to this accepted view, we show that, for an appropriate choice
of parameters, polymers can reduce the drag beyond the suggested asymptotic limit,
eliminating turbulence and giving way to laminar flow. At higher polymer concentrations,
however, the laminar state becomes unstable, resulting in a fluctuating flow with
the characteristic drag of the MDR asymptote. Our findings indicate that the asymptotic
state is hence dynamically disconnected from ordinary turbulence. © 2018 American
Physical Society.
acknowledged_ssus:
- _id: SSU
acknowledgement: The authors thank Philipp Maier and the IST Austria workshop for
their dedicated technical support.
article_number: '124501'
article_processing_charge: No
author:
- first_name: George H
full_name: Choueiri, George H
id: 448BD5BC-F248-11E8-B48F-1D18A9856A87
last_name: Choueiri
- first_name: Jose M
full_name: Lopez Alonso, Jose M
id: 40770848-F248-11E8-B48F-1D18A9856A87
last_name: Lopez Alonso
orcid: 0000-0002-0384-2022
- 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: Choueiri GH, Lopez Alonso JM, Hof B. Exceeding the asymptotic limit of polymer
drag reduction. Physical Review Letters. 2018;120(12). doi:10.1103/PhysRevLett.120.124501
apa: Choueiri, G. H., Lopez Alonso, J. M., & Hof, B. (2018). Exceeding the asymptotic
limit of polymer drag reduction. Physical Review Letters. American Physical
Society. https://doi.org/10.1103/PhysRevLett.120.124501
chicago: Choueiri, George H, Jose M Lopez Alonso, and Björn Hof. “Exceeding the
Asymptotic Limit of Polymer Drag Reduction.” Physical Review Letters. American
Physical Society, 2018. https://doi.org/10.1103/PhysRevLett.120.124501.
ieee: G. H. Choueiri, J. M. Lopez Alonso, and B. Hof, “Exceeding the asymptotic
limit of polymer drag reduction,” Physical Review Letters, vol. 120, no.
12. American Physical Society, 2018.
ista: Choueiri GH, Lopez Alonso JM, Hof B. 2018. Exceeding the asymptotic limit
of polymer drag reduction. Physical Review Letters. 120(12), 124501.
mla: Choueiri, George H., et al. “Exceeding the Asymptotic Limit of Polymer Drag
Reduction.” Physical Review Letters, vol. 120, no. 12, 124501, American
Physical Society, 2018, doi:10.1103/PhysRevLett.120.124501.
short: G.H. Choueiri, J.M. Lopez Alonso, B. Hof, Physical Review Letters 120 (2018).
date_created: 2018-12-11T11:45:51Z
date_published: 2018-03-19T00:00:00Z
date_updated: 2023-10-10T13:27:44Z
day: '19'
department:
- _id: BjHo
doi: 10.1103/PhysRevLett.120.124501
ec_funded: 1
external_id:
isi:
- '000427804000005'
intvolume: ' 120'
isi: 1
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1703.06271
month: '03'
oa: 1
oa_version: Preprint
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 25152F3A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '306589'
name: Decoding the complexity of turbulence at its origin
publication: Physical Review Letters
publication_status: published
publisher: American Physical Society
publist_id: '7537'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Exceeding the asymptotic limit of polymer drag reduction
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 120
year: '2018'
...
---
_id: '33'
abstract:
- lang: eng
text: Secondary contact is the reestablishment of gene flow between sister populations
that have diverged. For instance, at the end of the Quaternary glaciations in
Europe, secondary contact occurred during the northward expansion of the populations
which had found refugia in the southern peninsulas. With the advent of multi-locus
markers, secondary contact can be investigated using various molecular signatures
including gradients of allele frequency, admixture clines, and local increase
of genetic differentiation. We use coalescent simulations to investigate if molecular
data provide enough information to distinguish between secondary contact following
range expansion and an alternative evolutionary scenario consisting of a barrier
to gene flow in an isolation-by-distance model. We find that an excess of linkage
disequilibrium and of genetic diversity at the suture zone is a unique signature
of secondary contact. We also find that the directionality index ψ, which was
proposed to study range expansion, is informative to distinguish between the two
hypotheses. However, although evidence for secondary contact is usually conveyed
by statistics related to admixture coefficients, we find that they can be confounded
by isolation-by-distance. We recommend to account for the spatial repartition
of individuals when investigating secondary contact in order to better reflect
the complex spatio-temporal evolution of populations and species.
acknowledgement: 'Johanna Bertl was supported by the Vienna Graduate School of Population
Genetics (Austrian Science Fund (FWF): W1225-B20) and worked on this project while
employed at the Department of Statistics and Operations Research, University of
Vienna, Austria. This article was developed in the framework of the Grenoble Alpes
Data Institute, which is supported by the French National Research Agency under
the “Investissments d’avenir” program (ANR-15-IDEX-02).'
article_number: e5325
article_processing_charge: No
author:
- first_name: Johanna
full_name: Bertl, Johanna
last_name: Bertl
- first_name: Harald
full_name: Ringbauer, Harald
id: 417FCFF4-F248-11E8-B48F-1D18A9856A87
last_name: Ringbauer
orcid: 0000-0002-4884-9682
- first_name: Michaël
full_name: Blum, Michaël
last_name: Blum
citation:
ama: Bertl J, Ringbauer H, Blum M. Can secondary contact following range expansion
be distinguished from barriers to gene flow? PeerJ. 2018;2018(10). doi:10.7717/peerj.5325
apa: Bertl, J., Ringbauer, H., & Blum, M. (2018). Can secondary contact following
range expansion be distinguished from barriers to gene flow? PeerJ. PeerJ.
https://doi.org/10.7717/peerj.5325
chicago: Bertl, Johanna, Harald Ringbauer, and Michaël Blum. “Can Secondary Contact
Following Range Expansion Be Distinguished from Barriers to Gene Flow?” PeerJ.
PeerJ, 2018. https://doi.org/10.7717/peerj.5325.
ieee: J. Bertl, H. Ringbauer, and M. Blum, “Can secondary contact following range
expansion be distinguished from barriers to gene flow?,” PeerJ, vol. 2018,
no. 10. PeerJ, 2018.
ista: Bertl J, Ringbauer H, Blum M. 2018. Can secondary contact following range
expansion be distinguished from barriers to gene flow? PeerJ. 2018(10), e5325.
mla: Bertl, Johanna, et al. “Can Secondary Contact Following Range Expansion Be
Distinguished from Barriers to Gene Flow?” PeerJ, vol. 2018, no. 10, e5325,
PeerJ, 2018, doi:10.7717/peerj.5325.
short: J. Bertl, H. Ringbauer, M. Blum, PeerJ 2018 (2018).
date_created: 2018-12-11T11:44:16Z
date_published: 2018-10-01T00:00:00Z
date_updated: 2023-10-17T12:24:43Z
day: '01'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.7717/peerj.5325
external_id:
isi:
- '000447204400001'
pmid:
- '30294507'
file:
- access_level: open_access
checksum: 3334886c4b39678db4c4b74299ca14ba
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T10:46:06Z
date_updated: 2020-07-14T12:46:06Z
file_id: '5692'
file_name: 2018_PeerJ_Bertl.pdf
file_size: 1328344
relation: main_file
file_date_updated: 2020-07-14T12:46:06Z
has_accepted_license: '1'
intvolume: ' 2018'
isi: 1
issue: '10'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
pmid: 1
publication: PeerJ
publication_status: published
publisher: PeerJ
publist_id: '8022'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Can secondary contact following range expansion be distinguished from barriers
to gene 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2018
year: '2018'
...
---
_id: '3300'
abstract:
- lang: eng
text: "This book first explores the origins of this idea, grounded in theoretical
work on temporal logic and automata. The editors and authors are among the world's
leading researchers in this domain, and they contributed 32 chapters representing
a thorough view of the development and application of the technique. Topics covered
include binary decision diagrams, symbolic model checking, satisfiability modulo
theories, partial-order reduction, abstraction, interpolation, concurrency, security
protocols, games, probabilistic model checking, and process algebra, and chapters
on the transfer of theory to industrial practice, property specification languages
for hardware, and verification of real-time systems and hybrid systems.\r\n\r\nThe
book will be valuable for researchers and graduate students engaged with the development
of formal methods and verification tools."
article_processing_charge: No
author:
- first_name: Edmund M.
full_name: Clarke, Edmund M.
last_name: Clarke
- 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: Helmut
full_name: Veith, Helmut
last_name: Veith
- first_name: Roderick
full_name: Bloem, Roderick
last_name: Bloem
citation:
ama: 'Clarke EM, Henzinger TA, Veith H, Bloem R. Handbook of Model Checking.
1st ed. Cham: Springer Nature; 2018. doi:10.1007/978-3-319-10575-8'
apa: 'Clarke, E. M., Henzinger, T. A., Veith, H., & Bloem, R. (2018). Handbook
of Model Checking (1st ed.). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-10575-8'
chicago: 'Clarke, Edmund M., Thomas A Henzinger, Helmut Veith, and Roderick Bloem.
Handbook of Model Checking. 1st ed. Cham: Springer Nature, 2018. https://doi.org/10.1007/978-3-319-10575-8.'
ieee: 'E. M. Clarke, T. A. Henzinger, H. Veith, and R. Bloem, Handbook of Model
Checking, 1st ed. Cham: Springer Nature, 2018.'
ista: 'Clarke EM, Henzinger TA, Veith H, Bloem R. 2018. Handbook of Model Checking
1st ed., Cham: Springer Nature, XLVIII, 1212p.'
mla: Clarke, Edmund M., et al. Handbook of Model Checking. 1st ed., Springer
Nature, 2018, doi:10.1007/978-3-319-10575-8.
short: E.M. Clarke, T.A. Henzinger, H. Veith, R. Bloem, Handbook of Model Checking,
1st ed., Springer Nature, Cham, 2018.
date_created: 2018-12-11T12:02:32Z
date_published: 2018-06-08T00:00:00Z
date_updated: 2025-07-24T09:25:31Z
day: '08'
department:
- _id: ToHe
doi: 10.1007/978-3-319-10575-8
edition: '1'
language:
- iso: eng
month: '06'
oa_version: None
page: XLVIII, 1212
place: Cham
publication_identifier:
eisbn:
- 978-3-319-10575-8
isbn:
- 978-3-319-10574-1
publication_status: published
publisher: Springer Nature
publist_id: '3340'
quality_controlled: '1'
retracted: '1'
scopus_import: '1'
status: public
title: Handbook of Model Checking
type: book
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '107'
abstract:
- lang: eng
text: 'We introduce the notion of “non-malleable codes” which relaxes the notion
of error correction and error detection. Informally, a code is non-malleable if
the message contained in a modified codeword is either the original message, or
a completely unrelated value. In contrast to error correction and error detection,
non-malleability can be achieved for very rich classes of modifications. We construct
an efficient code that is non-malleable with respect to modifications that affect
each bit of the codeword arbitrarily (i.e., leave it untouched, flip it, or set
it to either 0 or 1), but independently of the value of the other bits of the
codeword. Using the probabilistic method, we also show a very strong and general
statement: there exists a non-malleable code for every “small enough” family F
of functions via which codewords can be modified. Although this probabilistic
method argument does not directly yield efficient constructions, it gives us efficient
non-malleable codes in the random-oracle model for very general classes of tampering
functions—e.g., functions where every bit in the tampered codeword can depend
arbitrarily on any 99% of the bits in the original codeword. As an application
of non-malleable codes, we show that they provide an elegant algorithmic solution
to the task of protecting functionalities implemented in hardware (e.g., signature
cards) against “tampering attacks.” In such attacks, the secret state of a physical
system is tampered, in the hopes that future interaction with the modified system
will reveal some secret information. This problem was previously studied in the
work of Gennaro et al. in 2004 under the name “algorithmic tamper proof security”
(ATP). We show that non-malleable codes can be used to achieve important improvements
over the prior work. In particular, we show that any functionality can be made
secure against a large class of tampering attacks, simply by encoding the secret
state with a non-malleable code while it is stored in memory.'
article_number: '20'
article_processing_charge: No
article_type: original
author:
- first_name: Stefan
full_name: Dziembowski, Stefan
last_name: Dziembowski
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Daniel
full_name: Wichs, Daniel
last_name: Wichs
citation:
ama: Dziembowski S, Pietrzak KZ, Wichs D. Non-malleable codes. Journal of the
ACM. 2018;65(4). doi:10.1145/3178432
apa: Dziembowski, S., Pietrzak, K. Z., & Wichs, D. (2018). Non-malleable codes.
Journal of the ACM. ACM. https://doi.org/10.1145/3178432
chicago: Dziembowski, Stefan, Krzysztof Z Pietrzak, and Daniel Wichs. “Non-Malleable
Codes.” Journal of the ACM. ACM, 2018. https://doi.org/10.1145/3178432.
ieee: S. Dziembowski, K. Z. Pietrzak, and D. Wichs, “Non-malleable codes,” Journal
of the ACM, vol. 65, no. 4. ACM, 2018.
ista: Dziembowski S, Pietrzak KZ, Wichs D. 2018. Non-malleable codes. Journal of
the ACM. 65(4), 20.
mla: Dziembowski, Stefan, et al. “Non-Malleable Codes.” Journal of the ACM,
vol. 65, no. 4, 20, ACM, 2018, doi:10.1145/3178432.
short: S. Dziembowski, K.Z. Pietrzak, D. Wichs, Journal of the ACM 65 (2018).
date_created: 2018-12-11T11:44:40Z
date_published: 2018-08-01T00:00:00Z
date_updated: 2023-09-13T09:05:17Z
day: '01'
department:
- _id: KrPi
doi: 10.1145/3178432
ec_funded: 1
external_id:
isi:
- '000442938200004'
intvolume: ' 65'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2009/608
month: '08'
oa: 1
oa_version: Preprint
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication: Journal of the ACM
publication_status: published
publisher: ACM
publist_id: '7947'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Non-malleable codes
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 65
year: '2018'
...
---
_id: '108'
abstract:
- lang: eng
text: Universal hashing found a lot of applications in computer science. In cryptography
the most important fact about universal families is the so called Leftover Hash
Lemma, proved by Impagliazzo, Levin and Luby. In the language of modern cryptography
it states that almost universal families are good extractors. In this work we
provide a somewhat surprising characterization in the opposite direction. Namely,
every extractor with sufficiently good parameters yields a universal family on
a noticeable fraction of its inputs. Our proof technique is based on tools from
extremal graph theory applied to the \'collision graph\' induced by the extractor,
and may be of independent interest. We discuss possible applications to the theory
of randomness extractors and non-malleable codes.
alternative_title:
- ISIT Proceedings
article_processing_charge: No
author:
- first_name: Marciej
full_name: Obremski, Marciej
last_name: Obremski
- first_name: Maciej
full_name: Skorski, Maciej
id: EC09FA6A-02D0-11E9-8223-86B7C91467DD
last_name: Skorski
citation:
ama: 'Obremski M, Skórski M. Inverted leftover hash lemma. In: Vol 2018. IEEE; 2018.
doi:10.1109/ISIT.2018.8437654'
apa: 'Obremski, M., & Skórski, M. (2018). Inverted leftover hash lemma (Vol.
2018). Presented at the ISIT: International Symposium on Information Theory, Vail,
CO, USA: IEEE. https://doi.org/10.1109/ISIT.2018.8437654'
chicago: Obremski, Marciej, and Maciej Skórski. “Inverted Leftover Hash Lemma,”
Vol. 2018. IEEE, 2018. https://doi.org/10.1109/ISIT.2018.8437654.
ieee: 'M. Obremski and M. Skórski, “Inverted leftover hash lemma,” presented at
the ISIT: International Symposium on Information Theory, Vail, CO, USA, 2018,
vol. 2018.'
ista: 'Obremski M, Skórski M. 2018. Inverted leftover hash lemma. ISIT: International
Symposium on Information Theory, ISIT Proceedings, vol. 2018.'
mla: Obremski, Marciej, and Maciej Skórski. Inverted Leftover Hash Lemma.
Vol. 2018, IEEE, 2018, doi:10.1109/ISIT.2018.8437654.
short: M. Obremski, M. Skórski, in:, IEEE, 2018.
conference:
end_date: 2018-06-22
location: Vail, CO, USA
name: 'ISIT: International Symposium on Information Theory'
start_date: '2018-06-17 '
date_created: 2018-12-11T11:44:40Z
date_published: 2018-08-16T00:00:00Z
date_updated: 2023-09-13T08:23:18Z
day: '16'
department:
- _id: KrPi
doi: 10.1109/ISIT.2018.8437654
external_id:
isi:
- '000448139300368'
intvolume: ' 2018'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2017/507
month: '08'
oa: 1
oa_version: Submitted Version
publication_status: published
publisher: IEEE
publist_id: '7946'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Inverted leftover hash lemma
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2018
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
arxiv: 1
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: '10880'
abstract:
- lang: eng
text: Acquisition of evolutionary novelties is a fundamental process for adapting
to the external environment and invading new niches and results in the diversification
of life, which we can see in the world today. How such novel phenotypic traits
are acquired in the course of evolution and are built up in developing embryos
has been a central question in biology. Whole-genome duplication (WGD) is a process
of genome doubling that supplies raw genetic materials and increases genome complexity.
Recently, it has been gradually revealed that WGD and subsequent fate changes
of duplicated genes can facilitate phenotypic evolution. Here, we review the current
understanding of the relationship between WGD and the acquisition of evolutionary
novelties. We show some examples of this link and discuss how WGD and subsequent
duplicated genes can facilitate phenotypic evolution as well as when such genomic
doubling can be advantageous for adaptation.
acknowledgement: This work was supported by JSPS overseas research fellowships (Y.M.)
and SENSHIN Medical Research Foundation (K.K.T.).
article_processing_charge: No
article_type: original
author:
- first_name: Moriyama
full_name: Yuuta, Moriyama
id: 4968E7C8-F248-11E8-B48F-1D18A9856A87
last_name: Yuuta
orcid: 0000-0002-2853-8051
- first_name: Kazuko
full_name: Koshiba-Takeuchi, Kazuko
last_name: Koshiba-Takeuchi
citation:
ama: Yuuta M, Koshiba-Takeuchi K. Significance of whole-genome duplications on the
emergence of evolutionary novelties. Briefings in Functional Genomics.
2018;17(5):329-338. doi:10.1093/bfgp/ely007
apa: Yuuta, M., & Koshiba-Takeuchi, K. (2018). Significance of whole-genome
duplications on the emergence of evolutionary novelties. Briefings in Functional
Genomics. Oxford University Press. https://doi.org/10.1093/bfgp/ely007
chicago: Yuuta, Moriyama, and Kazuko Koshiba-Takeuchi. “Significance of Whole-Genome
Duplications on the Emergence of Evolutionary Novelties.” Briefings in Functional
Genomics. Oxford University Press, 2018. https://doi.org/10.1093/bfgp/ely007.
ieee: M. Yuuta and K. Koshiba-Takeuchi, “Significance of whole-genome duplications
on the emergence of evolutionary novelties,” Briefings in Functional Genomics,
vol. 17, no. 5. Oxford University Press, pp. 329–338, 2018.
ista: Yuuta M, Koshiba-Takeuchi K. 2018. Significance of whole-genome duplications
on the emergence of evolutionary novelties. Briefings in Functional Genomics.
17(5), 329–338.
mla: Yuuta, Moriyama, and Kazuko Koshiba-Takeuchi. “Significance of Whole-Genome
Duplications on the Emergence of Evolutionary Novelties.” Briefings in Functional
Genomics, vol. 17, no. 5, Oxford University Press, 2018, pp. 329–38, doi:10.1093/bfgp/ely007.
short: M. Yuuta, K. Koshiba-Takeuchi, Briefings in Functional Genomics 17 (2018)
329–338.
date_created: 2022-03-18T12:40:35Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2023-09-19T15:11:22Z
day: '01'
department:
- _id: CaHe
doi: 10.1093/bfgp/ely007
external_id:
isi:
- '000456054400004'
pmid:
- '29579140'
intvolume: ' 17'
isi: 1
issue: '5'
keyword:
- Genetics
- Molecular Biology
- Biochemistry
- General Medicine
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1093/bfgp/ely007
month: '09'
oa: 1
oa_version: Published Version
page: 329-338
pmid: 1
publication: Briefings in Functional Genomics
publication_identifier:
eissn:
- 2041-2657
issn:
- 2041-2649
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Significance of whole-genome duplications on the emergence of evolutionary
novelties
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 17
year: '2018'
...
---
_id: '10881'
abstract:
- lang: eng
text: Strigolactones (SLs) are a relatively recent addition to the list of plant
hormones that control different aspects of plant development. SL signalling is
perceived by an α/β hydrolase, DWARF 14 (D14). A close homolog of D14, KARRIKIN
INSENSTIVE2 (KAI2), is involved in perception of an uncharacterized molecule called
karrikin (KAR). Recent studies in Arabidopsis identified the SUPPRESSOR OF MAX2
1 (SMAX1) and SMAX1-LIKE 7 (SMXL7) to be potential SCF–MAX2 complex-mediated proteasome
targets of KAI2 and D14, respectively. Genetic studies on SMXL7 and SMAX1 demonstrated
distinct developmental roles for each, but very little is known about these repressors
in terms of their sequence features. In this study, we performed an extensive
comparative analysis of SMXLs and determined their phylogenetic and evolutionary
history in the plant lineage. Our results show that SMXL family members can be
sub-divided into four distinct phylogenetic clades/classes, with an ancient SMAX1.
Further, we identified the clade-specific motifs that have evolved and that might
act as determinants of SL-KAR signalling specificity. These specificities resulted
from functional diversities among the clades. Our results suggest that a gradual
co-evolution of SMXL members with their upstream receptors D14/KAI2 provided an
increased specificity to both the SL perception and response in land plants.
acknowledgement: "This project received funding from the European Union’s Horizon
2020 research and innovation programme under the Marie Skłodowska-Curie Actions
and it is co-financed by the South Moravian Region under grant agreement No. 665860
(SS). Access to computing and storage facilities owned by parties and projects contributing
to the national grid infrastructure, MetaCentrum, provided under the program ‘Projects
of Large Infrastructure for Research, Development, and Innovations’ (LM2010005)
was greatly appreciated (RSV). The project was funded by The Ministry of Education,
Youth and Sports/MES of the Czech Republic under the project CEITEC 2020 (LQ1601)
(TN, TRM). JF was supported by the European Research Council (project ERC-2011-StG
20101109-PSDP) and the Czech Science Foundation GAČR (GA13-40637S). We thank Dr
Kamel Chibani for active discussions on the evolutionary analysis and Nandan Mysore
Vardarajan for his critical comments on the manuscript. This article reflects\r\nonly
the authors’ views, and the EU is not responsible for any use that may be made of
the information it contains. "
article_processing_charge: No
article_type: original
author:
- first_name: Taraka Ramji
full_name: Moturu, Taraka Ramji
last_name: Moturu
- first_name: Sravankumar
full_name: Thula, Sravankumar
last_name: Thula
- first_name: Ravi Kumar
full_name: Singh, Ravi Kumar
last_name: Singh
- first_name: Tomasz
full_name: Nodzyński, Tomasz
last_name: Nodzyński
- first_name: Radka Svobodová
full_name: Vařeková, Radka Svobodová
last_name: Vařeková
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Sibu
full_name: Simon, Sibu
last_name: Simon
citation:
ama: Moturu TR, Thula S, Singh RK, et al. Molecular evolution and diversification
of the SMXL gene family. Journal of Experimental Botany. 2018;69(9):2367-2378.
doi:10.1093/jxb/ery097
apa: Moturu, T. R., Thula, S., Singh, R. K., Nodzyński, T., Vařeková, R. S., Friml,
J., & Simon, S. (2018). Molecular evolution and diversification of the SMXL
gene family. Journal of Experimental Botany. Oxford University Press. https://doi.org/10.1093/jxb/ery097
chicago: Moturu, Taraka Ramji, Sravankumar Thula, Ravi Kumar Singh, Tomasz Nodzyński,
Radka Svobodová Vařeková, Jiří Friml, and Sibu Simon. “Molecular Evolution and
Diversification of the SMXL Gene Family.” Journal of Experimental Botany.
Oxford University Press, 2018. https://doi.org/10.1093/jxb/ery097.
ieee: T. R. Moturu et al., “Molecular evolution and diversification of the
SMXL gene family,” Journal of Experimental Botany, vol. 69, no. 9. Oxford
University Press, pp. 2367–2378, 2018.
ista: Moturu TR, Thula S, Singh RK, Nodzyński T, Vařeková RS, Friml J, Simon S.
2018. Molecular evolution and diversification of the SMXL gene family. Journal
of Experimental Botany. 69(9), 2367–2378.
mla: Moturu, Taraka Ramji, et al. “Molecular Evolution and Diversification of the
SMXL Gene Family.” Journal of Experimental Botany, vol. 69, no. 9, Oxford
University Press, 2018, pp. 2367–78, doi:10.1093/jxb/ery097.
short: T.R. Moturu, S. Thula, R.K. Singh, T. Nodzyński, R.S. Vařeková, J. Friml,
S. Simon, Journal of Experimental Botany 69 (2018) 2367–2378.
date_created: 2022-03-18T12:43:22Z
date_published: 2018-04-13T00:00:00Z
date_updated: 2025-05-07T11:12:33Z
day: '13'
department:
- _id: JiFr
doi: 10.1093/jxb/ery097
ec_funded: 1
external_id:
isi:
- '000430727000016'
pmid:
- '29538714'
intvolume: ' 69'
isi: 1
issue: '9'
keyword:
- Plant Science
- Physiology
language:
- iso: eng
month: '04'
oa_version: None
page: 2367-2378
pmid: 1
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '282300'
name: Polarity and subcellular dynamics in plants
publication: Journal of Experimental Botany
publication_identifier:
eissn:
- 1460-2431
issn:
- 0022-0957
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Molecular evolution and diversification of the SMXL gene family
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 69
year: '2018'
...
---
_id: '10882'
abstract:
- lang: eng
text: 'We introduce Intelligent Annotation Dialogs for bounding box annotation.
We train an agent to automatically choose a sequence of actions for a human annotator
to produce a bounding box in a minimal amount of time. Specifically, we consider
two actions: box verification [34], where the annotator verifies a box generated
by an object detector, and manual box drawing. We explore two kinds of agents,
one based on predicting the probability that a box will be positively verified,
and the other based on reinforcement learning. We demonstrate that (1) our agents
are able to learn efficient annotation strategies in several scenarios, automatically
adapting to the image difficulty, the desired quality of the boxes, and the detector
strength; (2) in all scenarios the resulting annotation dialogs speed up annotation
compared to manual box drawing alone and box verification alone, while also outperforming
any fixed combination of verification and drawing in most scenarios; (3) in a
realistic scenario where the detector is iteratively re-trained, our agents evolve
a series of strategies that reflect the shifting trade-off between verification
and drawing as the detector grows stronger.'
article_processing_charge: No
arxiv: 1
author:
- first_name: Jasper
full_name: Uijlings, Jasper
last_name: Uijlings
- first_name: Ksenia
full_name: Konyushkova, Ksenia
last_name: Konyushkova
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
- first_name: Vittorio
full_name: Ferrari, Vittorio
last_name: Ferrari
citation:
ama: 'Uijlings J, Konyushkova K, Lampert C, Ferrari V. Learning intelligent dialogs
for bounding box annotation. In: 2018 IEEE/CVF Conference on Computer Vision
and Pattern Recognition. IEEE; 2018:9175-9184. doi:10.1109/cvpr.2018.00956'
apa: 'Uijlings, J., Konyushkova, K., Lampert, C., & Ferrari, V. (2018). Learning
intelligent dialogs for bounding box annotation. In 2018 IEEE/CVF Conference
on Computer Vision and Pattern Recognition (pp. 9175–9184). Salt Lake City,
UT, United States: IEEE. https://doi.org/10.1109/cvpr.2018.00956'
chicago: Uijlings, Jasper, Ksenia Konyushkova, Christoph Lampert, and Vittorio Ferrari.
“Learning Intelligent Dialogs for Bounding Box Annotation.” In 2018 IEEE/CVF
Conference on Computer Vision and Pattern Recognition, 9175–84. IEEE, 2018.
https://doi.org/10.1109/cvpr.2018.00956.
ieee: J. Uijlings, K. Konyushkova, C. Lampert, and V. Ferrari, “Learning intelligent
dialogs for bounding box annotation,” in 2018 IEEE/CVF Conference on Computer
Vision and Pattern Recognition, Salt Lake City, UT, United States, 2018, pp.
9175–9184.
ista: 'Uijlings J, Konyushkova K, Lampert C, Ferrari V. 2018. Learning intelligent
dialogs for bounding box annotation. 2018 IEEE/CVF Conference on Computer Vision
and Pattern Recognition. CVF: Conference on Computer Vision and Pattern Recognition,
9175–9184.'
mla: Uijlings, Jasper, et al. “Learning Intelligent Dialogs for Bounding Box Annotation.”
2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE,
2018, pp. 9175–84, doi:10.1109/cvpr.2018.00956.
short: J. Uijlings, K. Konyushkova, C. Lampert, V. Ferrari, in:, 2018 IEEE/CVF Conference
on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 9175–9184.
conference:
end_date: 2018-06-23
location: Salt Lake City, UT, United States
name: 'CVF: Conference on Computer Vision and Pattern Recognition'
start_date: 2018-06-18
date_created: 2022-03-18T12:45:09Z
date_published: 2018-12-17T00:00:00Z
date_updated: 2023-09-19T15:11:49Z
day: '17'
department:
- _id: ChLa
doi: 10.1109/cvpr.2018.00956
external_id:
arxiv:
- '1712.08087'
isi:
- '000457843609036'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.1712.08087'
month: '12'
oa: 1
oa_version: Preprint
page: 9175-9184
publication: 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition
publication_identifier:
eissn:
- 2575-7075
isbn:
- '9781538664209'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Learning intelligent dialogs for bounding box annotation
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '10883'
abstract:
- lang: eng
text: 'Solving parity games, which are equivalent to modal μ-calculus model checking,
is a central algorithmic problem in formal methods, with applications in reactive
synthesis, program repair, verification of branching-time properties, etc. Besides
the standard compu- tation model with the explicit representation of games, another
important theoretical model of computation is that of set-based symbolic algorithms.
Set-based symbolic algorithms use basic set operations and one-step predecessor
operations on the implicit description of games, rather than the explicit representation.
The significance of symbolic algorithms is that they provide scalable algorithms
for large finite-state systems, as well as for infinite-state systems with finite
quotient. Consider parity games on graphs with n vertices and parity conditions
with d priorities. While there is a rich literature of explicit algorithms for
parity games, the main results for set-based symbolic algorithms are as follows:
(a) the basic algorithm that requires O(nd) symbolic operations and O(d) symbolic
space; and (b) an improved algorithm that requires O(nd/3+1) symbolic operations
and O(n) symbolic space. In this work, our contributions are as follows: (1) We
present a black-box set-based symbolic algorithm based on the explicit progress
measure algorithm. Two important consequences of our algorithm are as follows:
(a) a set-based symbolic algorithm for parity games that requires quasi-polynomially
many symbolic operations and O(n) symbolic space; and (b) any future improvement
in progress measure based explicit algorithms immediately imply an efficiency
improvement in our set-based symbolic algorithm for parity games. (2) We present
a set-based symbolic algorithm that requires quasi-polynomially many symbolic
operations and O(d · log n) symbolic space. Moreover, for the important special
case of d ≤ log n, our algorithm requires only polynomially many symbolic operations
and poly-logarithmic symbolic space.'
acknowledgement: 'A. S. is fully supported by the Vienna Science and Technology Fund
(WWTF) through project ICT15-003. K.C. is supported by the Austrian Science Fund
(FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and an ERC Starting grant (279307: Graph
Games). For M.H the research leading to these results has received funding from
the European Research Council under the European Union’s Seventh Framework Programme
(FP/2007-2013) /ERC Grant Agreement no. 340506.'
alternative_title:
- EPiC Series in Computing
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Wolfgang
full_name: Dvořák, Wolfgang
last_name: Dvořák
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Alexander
full_name: Svozil, Alexander
last_name: Svozil
citation:
ama: 'Chatterjee K, Dvořák W, Henzinger MH, Svozil A. Quasipolynomial set-based
symbolic algorithms for parity games. In: 22nd International Conference on
Logic for Programming, Artificial Intelligence and Reasoning. Vol 57. EasyChair;
2018:233-253. doi:10.29007/5z5k'
apa: 'Chatterjee, K., Dvořák, W., Henzinger, M. H., & Svozil, A. (2018). Quasipolynomial
set-based symbolic algorithms for parity games. In 22nd International Conference
on Logic for Programming, Artificial Intelligence and Reasoning (Vol. 57,
pp. 233–253). Awassa, Ethiopia: EasyChair. https://doi.org/10.29007/5z5k'
chicago: Chatterjee, Krishnendu, Wolfgang Dvořák, Monika H Henzinger, and Alexander
Svozil. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.” In 22nd
International Conference on Logic for Programming, Artificial Intelligence and
Reasoning, 57:233–53. EasyChair, 2018. https://doi.org/10.29007/5z5k.
ieee: K. Chatterjee, W. Dvořák, M. H. Henzinger, and A. Svozil, “Quasipolynomial
set-based symbolic algorithms for parity games,” in 22nd International Conference
on Logic for Programming, Artificial Intelligence and Reasoning, Awassa, Ethiopia,
2018, vol. 57, pp. 233–253.
ista: 'Chatterjee K, Dvořák W, Henzinger MH, Svozil A. 2018. Quasipolynomial set-based
symbolic algorithms for parity games. 22nd International Conference on Logic for
Programming, Artificial Intelligence and Reasoning. LPAR: Conference on Logic
for Programming, Artificial Intelligence and Reasoning, EPiC Series in Computing,
vol. 57, 233–253.'
mla: Chatterjee, Krishnendu, et al. “Quasipolynomial Set-Based Symbolic Algorithms
for Parity Games.” 22nd International Conference on Logic for Programming,
Artificial Intelligence and Reasoning, vol. 57, EasyChair, 2018, pp. 233–53,
doi:10.29007/5z5k.
short: K. Chatterjee, W. Dvořák, M.H. Henzinger, A. Svozil, in:, 22nd International
Conference on Logic for Programming, Artificial Intelligence and Reasoning, EasyChair,
2018, pp. 233–253.
conference:
end_date: 2018-11-21
location: Awassa, Ethiopia
name: 'LPAR: Conference on Logic for Programming, Artificial Intelligence and Reasoning'
start_date: 2018-11-17
date_created: 2022-03-18T12:46:32Z
date_published: 2018-10-23T00:00:00Z
date_updated: 2022-07-29T09:24:31Z
day: '23'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.29007/5z5k
ec_funded: 1
external_id:
arxiv:
- '1909.04983'
file:
- access_level: open_access
checksum: 1229aa8640bd6db610c85decf2265480
content_type: application/pdf
creator: dernst
date_created: 2022-05-17T07:51:08Z
date_updated: 2022-05-17T07:51:08Z
file_id: '11392'
file_name: 2018_EPiCs_Chatterjee.pdf
file_size: 720893
relation: main_file
success: 1
file_date_updated: 2022-05-17T07:51:08Z
has_accepted_license: '1'
intvolume: ' 57'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 233-253
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: 22nd International Conference on Logic for Programming, Artificial Intelligence
and Reasoning
publication_identifier:
issn:
- 2398-7340
publication_status: published
publisher: EasyChair
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quasipolynomial set-based symbolic algorithms for parity games
type: conference
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 57
year: '2018'
...