---
_id: '10655'
abstract:
- lang: eng
text: "Adeno-associated viruses (AAVs) are widely used to deliver genetic material
in vivo to distinct cell types such as neurons or glial cells, allowing for targeted
manipulation. Transduction of microglia is mostly excluded from this strategy,
likely due to the cells’ heterogeneous state upon environmental changes, which
makes AAV design challenging. Here, we established the retina as a model system
for microglial AAV validation and optimization. First, we show that AAV2/6 transduced
microglia in both synaptic layers, where layer preference corresponds to the intravitreal
or subretinal delivery method. Surprisingly, we observed significantly enhanced
microglial transduction during photoreceptor degeneration. Thus, we modified the
AAV6 capsid to reduce heparin binding by introducing four point mutations (K531E,
R576Q, K493S, and K459S), resulting in increased microglial transduction in the
outer plexiform layer. Finally, to improve microglial-specific transduction, we
validated a Cre-dependent transgene delivery cassette for use in combination with
the Cx3cr1CreERT2 mouse line. Together, our results provide a foundation for future
studies optimizing AAV-mediated microglia transduction and highlight that environmental
conditions influence microglial transduction efficiency.\r\n"
acknowledged_ssus:
- _id: Bio
- _id: LifeSc
- _id: PreCl
acknowledgement: This project has received funding from the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme
(grant agreement no. 715571). The research was supported by the Scientific Service
Units (SSU) of IST Austria through resources provided by the Bioimaging Facility,
the Life Science Facility, and the Pre-Clinical Facility, namely Sonja Haslinger
and Michael Schunn for their animal colony management and support. We would also
like to thank Chakrabarty Lab for sharing the plasmids for AAV2/6 production. Finally,
we would like to thank the Siegert team members for discussion about the manuscript.
article_processing_charge: Yes
article_type: original
author:
- first_name: Margaret E
full_name: Maes, Margaret E
id: 3838F452-F248-11E8-B48F-1D18A9856A87
last_name: Maes
orcid: 0000-0001-9642-1085
- first_name: Gabriele M.
full_name: Wögenstein, Gabriele M.
last_name: Wögenstein
- first_name: Gloria
full_name: Colombo, Gloria
id: 3483CF6C-F248-11E8-B48F-1D18A9856A87
last_name: Colombo
orcid: 0000-0001-9434-8902
- first_name: Raquel
full_name: Casado Polanco, Raquel
id: 15240fc1-dbcd-11ea-9d1d-ac5a786425fd
last_name: Casado Polanco
orcid: 0000-0001-8293-4568
- first_name: Sandra
full_name: Siegert, Sandra
id: 36ACD32E-F248-11E8-B48F-1D18A9856A87
last_name: Siegert
orcid: 0000-0001-8635-0877
citation:
ama: Maes ME, Wögenstein GM, Colombo G, Casado Polanco R, Siegert S. Optimizing
AAV2/6 microglial targeting identified enhanced efficiency in the photoreceptor
degenerative environment. Molecular Therapy - Methods and Clinical Development.
2021;23:210-224. doi:10.1016/j.omtm.2021.09.006
apa: Maes, M. E., Wögenstein, G. M., Colombo, G., Casado Polanco, R., & Siegert,
S. (2021). Optimizing AAV2/6 microglial targeting identified enhanced efficiency
in the photoreceptor degenerative environment. Molecular Therapy - Methods
and Clinical Development. Elsevier. https://doi.org/10.1016/j.omtm.2021.09.006
chicago: Maes, Margaret E, Gabriele M. Wögenstein, Gloria Colombo, Raquel Casado
Polanco, and Sandra Siegert. “Optimizing AAV2/6 Microglial Targeting Identified
Enhanced Efficiency in the Photoreceptor Degenerative Environment.” Molecular
Therapy - Methods and Clinical Development. Elsevier, 2021. https://doi.org/10.1016/j.omtm.2021.09.006.
ieee: M. E. Maes, G. M. Wögenstein, G. Colombo, R. Casado Polanco, and S. Siegert,
“Optimizing AAV2/6 microglial targeting identified enhanced efficiency in the
photoreceptor degenerative environment,” Molecular Therapy - Methods and Clinical
Development, vol. 23. Elsevier, pp. 210–224, 2021.
ista: Maes ME, Wögenstein GM, Colombo G, Casado Polanco R, Siegert S. 2021. Optimizing
AAV2/6 microglial targeting identified enhanced efficiency in the photoreceptor
degenerative environment. Molecular Therapy - Methods and Clinical Development.
23, 210–224.
mla: Maes, Margaret E., et al. “Optimizing AAV2/6 Microglial Targeting Identified
Enhanced Efficiency in the Photoreceptor Degenerative Environment.” Molecular
Therapy - Methods and Clinical Development, vol. 23, Elsevier, 2021, pp. 210–24,
doi:10.1016/j.omtm.2021.09.006.
short: M.E. Maes, G.M. Wögenstein, G. Colombo, R. Casado Polanco, S. Siegert, Molecular
Therapy - Methods and Clinical Development 23 (2021) 210–224.
date_created: 2022-01-23T23:01:28Z
date_published: 2021-12-10T00:00:00Z
date_updated: 2023-11-16T13:12:03Z
day: '10'
ddc:
- '570'
department:
- _id: SaSi
- _id: SiHi
doi: 10.1016/j.omtm.2021.09.006
ec_funded: 1
external_id:
isi:
- '000748748500019'
file:
- access_level: open_access
checksum: 77dc540e8011c5475031bdf6ccef20a6
content_type: application/pdf
creator: cchlebak
date_created: 2022-01-24T07:43:09Z
date_updated: 2022-01-24T07:43:09Z
file_id: '10657'
file_name: 2021_MolTherMethodsClinDev_Maes.pdf
file_size: 4794147
relation: main_file
success: 1
file_date_updated: 2022-01-24T07:43:09Z
has_accepted_license: '1'
intvolume: ' 23'
isi: 1
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 210-224
project:
- _id: 25D4A630-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715571'
name: Microglia action towards neuronal circuit formation and function in health
and disease
publication: Molecular Therapy - Methods and Clinical Development
publication_identifier:
eissn:
- 2329-0501
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optimizing AAV2/6 microglial targeting identified enhanced efficiency in the
photoreceptor degenerative environment
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2021'
...
---
_id: '10565'
abstract:
- lang: eng
text: 'Enzymatic digestion of the extracellular matrix with chondroitinase-ABC reinstates
juvenile-like plasticity in the adult cortex as it also disassembles the perineuronal
nets (PNNs). The disadvantage of the enzyme is that it must be applied intracerebrally
and it degrades the ECM for several weeks. Here, we provide two minimally invasive
and transient protocols for microglia-enabled PNN disassembly in mouse cortex:
repeated treatment with ketamine-xylazine-acepromazine (KXA) anesthesia and 60-Hz
light entrainment. We also discuss how to analyze PNNs within microglial endosomes-lysosomes.
For complete details on the use and execution of this protocol, please refer to
Venturino et al. (2021).'
acknowledged_ssus:
- _id: Bio
acknowledgement: This research was supported by the European Research Council (grant
715571 to S.S.). We thank Rouven Schulz, Michael Schunn, Claudia Gold, Gabriel Krens,
Sarah Gorkiewicz, Margaret Maes, Jürgen Siegert, Marco Benevento, and Sara Oakeley
for comments on the manuscript and the IST Austria Bioimaging Facility for the technical
support.
article_number: '101012'
article_processing_charge: Yes
article_type: original
author:
- first_name: Alessandro
full_name: Venturino, Alessandro
id: 41CB84B2-F248-11E8-B48F-1D18A9856A87
last_name: Venturino
orcid: 0000-0003-2356-9403
- first_name: Sandra
full_name: Siegert, Sandra
id: 36ACD32E-F248-11E8-B48F-1D18A9856A87
last_name: Siegert
orcid: 0000-0001-8635-0877
citation:
ama: Venturino A, Siegert S. Minimally invasive protocols and quantification for
microglia-mediated perineuronal net disassembly in mouse brain. STAR Protocols.
2021;2(4). doi:10.1016/j.xpro.2021.101012
apa: Venturino, A., & Siegert, S. (2021). Minimally invasive protocols and quantification
for microglia-mediated perineuronal net disassembly in mouse brain. STAR Protocols.
Elsevier ; Cell Press. https://doi.org/10.1016/j.xpro.2021.101012
chicago: Venturino, Alessandro, and Sandra Siegert. “Minimally Invasive Protocols
and Quantification for Microglia-Mediated Perineuronal Net Disassembly in Mouse
Brain.” STAR Protocols. Elsevier ; Cell Press, 2021. https://doi.org/10.1016/j.xpro.2021.101012.
ieee: A. Venturino and S. Siegert, “Minimally invasive protocols and quantification
for microglia-mediated perineuronal net disassembly in mouse brain,” STAR Protocols,
vol. 2, no. 4. Elsevier ; Cell Press, 2021.
ista: Venturino A, Siegert S. 2021. Minimally invasive protocols and quantification
for microglia-mediated perineuronal net disassembly in mouse brain. STAR Protocols.
2(4), 101012.
mla: Venturino, Alessandro, and Sandra Siegert. “Minimally Invasive Protocols and
Quantification for Microglia-Mediated Perineuronal Net Disassembly in Mouse Brain.”
STAR Protocols, vol. 2, no. 4, 101012, Elsevier ; Cell Press, 2021, doi:10.1016/j.xpro.2021.101012.
short: A. Venturino, S. Siegert, STAR Protocols 2 (2021).
date_created: 2021-12-19T23:01:32Z
date_published: 2021-12-17T00:00:00Z
date_updated: 2023-11-16T13:11:04Z
day: '17'
ddc:
- '573'
department:
- _id: SaSi
doi: 10.1016/j.xpro.2021.101012
ec_funded: 1
file:
- access_level: open_access
checksum: 9ea2501056c5df99e84726b845e9b976
content_type: application/pdf
creator: cchlebak
date_created: 2021-12-20T08:58:40Z
date_updated: 2021-12-20T08:58:40Z
file_id: '10570'
file_name: 2021_STARProt_Venturino.pdf
file_size: 6207060
relation: main_file
success: 1
file_date_updated: 2021-12-20T08:58:40Z
has_accepted_license: '1'
intvolume: ' 2'
issue: '4'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 25D4A630-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715571'
name: Microglia action towards neuronal circuit formation and function in health
and disease
publication: STAR Protocols
publication_identifier:
eissn:
- 2666-1667
publication_status: published
publisher: Elsevier ; Cell Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Minimally invasive protocols and quantification for microglia-mediated perineuronal
net disassembly in mouse brain
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2021'
...
---
_id: '10321'
abstract:
- lang: eng
text: Mosaic analysis with double markers (MADM) technology enables the generation
of genetic mosaic tissue in mice. MADM enables concomitant fluorescent cell labeling
and introduction of a mutation of a gene of interest with single-cell resolution.
This protocol highlights major steps for the generation of genetic mosaic tissue
and the isolation and processing of respective tissues for downstream histological
analysis. For complete details on the use and execution of this protocol, please
refer to Contreras et al. (2021).
acknowledged_ssus:
- _id: Bio
- _id: PreCl
acknowledgement: This research was supported by the Scientific Service Units (SSU)
at IST Austria through resources provided by the Bioimaging (BIF) and Preclinical
Facilities (PCF). We particularly thank Mohammad Goudarzi for assistance with photography
of mouse perfusion and dissection. N.A. received support from FWF Firnberg-Programm
(T 1031). This work was also supported by IST Austria institutional funds; FWF SFB
F78 to S.H.; and the European Research Council (ERC) under the European Union’s
Horizon 2020 research and innovation programme (grant agreement no. 725780 LinPro)
to S.H.
article_number: '100939'
article_processing_charge: Yes
article_type: original
author:
- first_name: Nicole
full_name: Amberg, Nicole
id: 4CD6AAC6-F248-11E8-B48F-1D18A9856A87
last_name: Amberg
orcid: 0000-0002-3183-8207
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
citation:
ama: Amberg N, Hippenmeyer S. Genetic mosaic dissection of candidate genes in mice
using mosaic analysis with double markers. STAR Protocols. 2021;2(4). doi:10.1016/j.xpro.2021.100939
apa: Amberg, N., & Hippenmeyer, S. (2021). Genetic mosaic dissection of candidate
genes in mice using mosaic analysis with double markers. STAR Protocols.
Cell Press. https://doi.org/10.1016/j.xpro.2021.100939
chicago: Amberg, Nicole, and Simon Hippenmeyer. “Genetic Mosaic Dissection of Candidate
Genes in Mice Using Mosaic Analysis with Double Markers.” STAR Protocols.
Cell Press, 2021. https://doi.org/10.1016/j.xpro.2021.100939.
ieee: N. Amberg and S. Hippenmeyer, “Genetic mosaic dissection of candidate genes
in mice using mosaic analysis with double markers,” STAR Protocols, vol.
2, no. 4. Cell Press, 2021.
ista: Amberg N, Hippenmeyer S. 2021. Genetic mosaic dissection of candidate genes
in mice using mosaic analysis with double markers. STAR Protocols. 2(4), 100939.
mla: Amberg, Nicole, and Simon Hippenmeyer. “Genetic Mosaic Dissection of Candidate
Genes in Mice Using Mosaic Analysis with Double Markers.” STAR Protocols,
vol. 2, no. 4, 100939, Cell Press, 2021, doi:10.1016/j.xpro.2021.100939.
short: N. Amberg, S. Hippenmeyer, STAR Protocols 2 (2021).
date_created: 2021-11-21T23:01:28Z
date_published: 2021-11-10T00:00:00Z
date_updated: 2023-11-16T13:08:03Z
day: '10'
ddc:
- '573'
department:
- _id: SiHi
doi: 10.1016/j.xpro.2021.100939
ec_funded: 1
file:
- access_level: open_access
checksum: 9e3f6d06bf583e7a8b6a9e9a60500a28
content_type: application/pdf
creator: cchlebak
date_created: 2021-11-22T08:23:58Z
date_updated: 2021-11-22T08:23:58Z
file_id: '10329'
file_name: 2021_STARProtocols_Amberg.pdf
file_size: 7309464
relation: main_file
success: 1
file_date_updated: 2021-11-22T08:23:58Z
has_accepted_license: '1'
intvolume: ' 2'
issue: '4'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 260018B0-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '725780'
name: Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development
- _id: 268F8446-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: T0101031
name: Role of Eed in neural stem cell lineage progression
- _id: 059F6AB4-7A3F-11EA-A408-12923DDC885E
grant_number: F07805
name: Molecular Mechanisms of Neural Stem Cell Lineage Progression
publication: STAR Protocols
publication_identifier:
eissn:
- 2666-1667
publication_status: published
publisher: Cell Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Genetic mosaic dissection of candidate genes in mice using mosaic analysis
with double markers
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2021'
...
---
_id: '10290'
abstract:
- lang: eng
text: A precise quantitative description of the ultrastructural characteristics
underlying biological mechanisms is often key to their understanding. This is
particularly true for dynamic extra- and intracellular filamentous assemblies,
playing a role in cell motility, cell integrity, cytokinesis, tissue formation
and maintenance. For example, genetic manipulation or modulation of actin regulatory
proteins frequently manifests in changes of the morphology, dynamics, and ultrastructural
architecture of actin filament-rich cell peripheral structures, such as lamellipodia
or filopodia. However, the observed ultrastructural effects often remain subtle
and require sufficiently large datasets for appropriate quantitative analysis.
The acquisition of such large datasets has been enabled by recent advances in
high-throughput cryo-electron tomography (cryo-ET) methods. This also necessitates
the development of complementary approaches to maximize the extraction of relevant
biological information. We have developed a computational toolbox for the semi-automatic
quantification of segmented and vectorized filamentous networks from pre-processed
cryo-electron tomograms, facilitating the analysis and cross-comparison of multiple
experimental conditions. GUI-based components simplify the processing of data
and allow users to obtain a large number of ultrastructural parameters describing
filamentous assemblies. We demonstrate the feasibility of this workflow by analyzing
cryo-ET data of untreated and chemically perturbed branched actin filament networks
and that of parallel actin filament arrays. In principle, the computational toolbox
presented here is applicable for data analysis comprising any type of filaments
in regular (i.e. parallel) or random arrangement. We show that it can ease the
identification of key differences between experimental groups and facilitate the
in-depth analysis of ultrastructural data in a time-efficient manner.
acknowledged_ssus:
- _id: ScienComp
- _id: LifeSc
- _id: Bio
- _id: EM-Fac
acknowledgement: 'This research was supported by the Scientific Service Units (SSUs)
of IST Austria through resources provided by Scientific Computing (SciComp), the
Life Science Facility (LSF), the BioImaging Facility (BIF), and the Electron Microscopy
Facility (EMF). We also thank Victor-Valentin Hodirnau for help with cryo-ET data
acquisition. The authors acknowledge support from IST Austria and from the Austrian
Science Fund (FWF): M02495 to G.D. and Austrian Science Fund (FWF): P33367 to F.K.M.S.'
article_number: '107808'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Georgi A
full_name: Dimchev, Georgi A
id: 38C393BE-F248-11E8-B48F-1D18A9856A87
last_name: Dimchev
orcid: 0000-0001-8370-6161
- first_name: Behnam
full_name: Amiri, Behnam
last_name: Amiri
- first_name: Florian
full_name: Fäßler, Florian
id: 404F5528-F248-11E8-B48F-1D18A9856A87
last_name: Fäßler
orcid: 0000-0001-7149-769X
- first_name: Martin
full_name: Falcke, Martin
last_name: Falcke
- first_name: Florian KM
full_name: Schur, Florian KM
id: 48AD8942-F248-11E8-B48F-1D18A9856A87
last_name: Schur
orcid: 0000-0003-4790-8078
citation:
ama: Dimchev GA, Amiri B, Fäßler F, Falcke M, Schur FK. Computational toolbox for
ultrastructural quantitative analysis of filament networks in cryo-ET data. Journal
of Structural Biology. 2021;213(4). doi:10.1016/j.jsb.2021.107808
apa: Dimchev, G. A., Amiri, B., Fäßler, F., Falcke, M., & Schur, F. K. (2021).
Computational toolbox for ultrastructural quantitative analysis of filament networks
in cryo-ET data. Journal of Structural Biology. Elsevier . https://doi.org/10.1016/j.jsb.2021.107808
chicago: Dimchev, Georgi A, Behnam Amiri, Florian Fäßler, Martin Falcke, and Florian
KM Schur. “Computational Toolbox for Ultrastructural Quantitative Analysis of
Filament Networks in Cryo-ET Data.” Journal of Structural Biology. Elsevier
, 2021. https://doi.org/10.1016/j.jsb.2021.107808.
ieee: G. A. Dimchev, B. Amiri, F. Fäßler, M. Falcke, and F. K. Schur, “Computational
toolbox for ultrastructural quantitative analysis of filament networks in cryo-ET
data,” Journal of Structural Biology, vol. 213, no. 4. Elsevier , 2021.
ista: Dimchev GA, Amiri B, Fäßler F, Falcke M, Schur FK. 2021. Computational toolbox
for ultrastructural quantitative analysis of filament networks in cryo-ET data.
Journal of Structural Biology. 213(4), 107808.
mla: Dimchev, Georgi A., et al. “Computational Toolbox for Ultrastructural Quantitative
Analysis of Filament Networks in Cryo-ET Data.” Journal of Structural Biology,
vol. 213, no. 4, 107808, Elsevier , 2021, doi:10.1016/j.jsb.2021.107808.
short: G.A. Dimchev, B. Amiri, F. Fäßler, M. Falcke, F.K. Schur, Journal of Structural
Biology 213 (2021).
date_created: 2021-11-15T12:21:42Z
date_published: 2021-11-03T00:00:00Z
date_updated: 2023-11-21T08:36:02Z
day: '03'
ddc:
- '572'
department:
- _id: FlSc
doi: 10.1016/j.jsb.2021.107808
external_id:
isi:
- '000720259500002'
file:
- access_level: open_access
checksum: 6b209e4d44775d4e02b50f78982c15fa
content_type: application/pdf
creator: cchlebak
date_created: 2021-11-15T13:11:27Z
date_updated: 2021-11-15T13:11:27Z
file_id: '10291'
file_name: 2021_JournalStructBiol_Dimchev.pdf
file_size: 16818304
relation: main_file
success: 1
file_date_updated: 2021-11-15T13:11:27Z
has_accepted_license: '1'
intvolume: ' 213'
isi: 1
issue: '4'
keyword:
- Structural Biology
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 9B954C5C-BA93-11EA-9121-9846C619BF3A
grant_number: P33367
name: Structure and isoform diversity of the Arp2/3 complex
- _id: 2674F658-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02495
name: Protein structure and function in filopodia across scales
publication: Journal of Structural Biology
publication_identifier:
issn:
- 1047-8477
publication_status: published
publisher: 'Elsevier '
quality_controlled: '1'
related_material:
record:
- id: '14502'
relation: software
status: public
scopus_import: '1'
status: public
title: Computational toolbox for ultrastructural quantitative analysis of filament
networks in cryo-ET data
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: 213
year: '2021'
...
---
_id: '9969'
abstract:
- lang: eng
text: 'Payment channel networks are a promising approach to improve the scalability
of cryptocurrencies: they allow to perform transactions in a peer-to-peer fashion,
along multihop routes in the network, without requiring consensus on the blockchain.
However, during the discovery of cost-efficient routes for the transaction, critical
information may be revealed about the transacting entities. This paper initiates
the study of privacy-preserving route discovery mechanisms for payment channel
networks. In particular, we present LightPIR, an approach which allows a client
to learn the shortest (or cheapest in terms of fees) path between two nodes without
revealing any information about the endpoints of the transaction to the servers.
The two main observations which allow for an efficient solution in LightPIR are
that: (1) surprisingly, hub labelling algorithms – which were developed to preprocess
“street network like” graphs so one can later efficiently compute shortest paths
– also perform well for the graphs underlying payment channel networks, and that
(2) hub labelling algorithms can be conveniently combined with private information
retrieval. LightPIR relies on a simple hub labeling heuristic on top of existing
hub labeling algorithms which leverages the specific topological features of cryptocurrency
networks to further minimize storage and bandwidth overheads. In a case study
considering the Lightning network, we show that our approach is an order of magnitude
more efficient compared to a privacy-preserving baseline based on using private
information retrieval on a database that stores all pairs shortest paths.'
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
- first_name: Iosif
full_name: Salem, Iosif
last_name: Salem
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Michelle X
full_name: Yeo, Michelle X
id: 2D82B818-F248-11E8-B48F-1D18A9856A87
last_name: Yeo
citation:
ama: 'Pietrzak KZ, Salem I, Schmid S, Yeo MX. LightPIR: Privacy-preserving route
discovery for payment channel networks. In: IEEE; 2021. doi:10.23919/IFIPNetworking52078.2021.9472205'
apa: 'Pietrzak, K. Z., Salem, I., Schmid, S., & Yeo, M. X. (2021). LightPIR:
Privacy-preserving route discovery for payment channel networks. Presented at
the 2021 IFIP Networking Conference (IFIP Networking), Espoo and Helsinki, Finland:
IEEE. https://doi.org/10.23919/IFIPNetworking52078.2021.9472205'
chicago: 'Pietrzak, Krzysztof Z, Iosif Salem, Stefan Schmid, and Michelle X Yeo.
“LightPIR: Privacy-Preserving Route Discovery for Payment Channel Networks.” IEEE,
2021. https://doi.org/10.23919/IFIPNetworking52078.2021.9472205.'
ieee: 'K. Z. Pietrzak, I. Salem, S. Schmid, and M. X. Yeo, “LightPIR: Privacy-preserving
route discovery for payment channel networks,” presented at the 2021 IFIP Networking
Conference (IFIP Networking), Espoo and Helsinki, Finland, 2021.'
ista: 'Pietrzak KZ, Salem I, Schmid S, Yeo MX. 2021. LightPIR: Privacy-preserving
route discovery for payment channel networks. 2021 IFIP Networking Conference
(IFIP Networking).'
mla: 'Pietrzak, Krzysztof Z., et al. LightPIR: Privacy-Preserving Route Discovery
for Payment Channel Networks. IEEE, 2021, doi:10.23919/IFIPNetworking52078.2021.9472205.'
short: K.Z. Pietrzak, I. Salem, S. Schmid, M.X. Yeo, in:, IEEE, 2021.
conference:
end_date: 2021-06-24
location: Espoo and Helsinki, Finland
name: 2021 IFIP Networking Conference (IFIP Networking)
start_date: 2021-06-21
date_created: 2021-08-29T22:01:16Z
date_published: 2021-06-21T00:00:00Z
date_updated: 2023-11-30T10:54:50Z
day: '21'
department:
- _id: KrPi
doi: 10.23919/IFIPNetworking52078.2021.9472205
ec_funded: 1
external_id:
arxiv:
- '2104.04293'
isi:
- '000853016800008'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2104.04293
month: '06'
oa: 1
oa_version: Submitted Version
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_identifier:
eisbn:
- 978-3-9031-7639-3
eissn:
- 1861-2288
isbn:
- 978-1-6654-4501-6
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '14506'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'LightPIR: Privacy-preserving route discovery for payment channel networks'
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2021'
...
---
_id: '9644'
abstract:
- lang: eng
text: 'We present a new approach to proving non-termination of non-deterministic
integer programs. Our technique is rather simple but efficient. It relies on a
purely syntactic reversal of the program''s transition system followed by a constraint-based
invariant synthesis with constraints coming from both the original and the reversed
transition system. The latter task is performed by a simple call to an off-the-shelf
SMT-solver, which allows us to leverage the latest advances in SMT-solving. Moreover,
our method offers a combination of features not present (as a whole) in previous
approaches: it handles programs with non-determinism, provides relative completeness
guarantees and supports programs with polynomial arithmetic. The experiments performed
with our prototype tool RevTerm show that our approach, despite its simplicity
and stronger theoretical guarantees, is at least on par with the state-of-the-art
tools, often achieving a non-trivial improvement under a proper configuration
of its parameters.'
acknowledgement: We thank the anonymous reviewers for their helpful comments. This
research was partially supported by the ERCCoG 863818 (ForM-SMArt) and the Czech
Science Foundation grant No. GJ19-15134Y.
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: Ehsan Kafshdar
full_name: Goharshady, Ehsan Kafshdar
last_name: Goharshady
- first_name: Petr
full_name: Novotný, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotný
- first_name: Dorde
full_name: Zikelic, Dorde
id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
last_name: Zikelic
orcid: 0000-0002-4681-1699
citation:
ama: 'Chatterjee K, Goharshady EK, Novotný P, Zikelic D. Proving non-termination
by program reversal. In: Proceedings of the 42nd ACM SIGPLAN International
Conference on Programming Language Design and Implementation. Association
for Computing Machinery; 2021:1033-1048. doi:10.1145/3453483.3454093'
apa: 'Chatterjee, K., Goharshady, E. K., Novotný, P., & Zikelic, D. (2021).
Proving non-termination by program reversal. In Proceedings of the 42nd ACM
SIGPLAN International Conference on Programming Language Design and Implementation
(pp. 1033–1048). Online: Association for Computing Machinery. https://doi.org/10.1145/3453483.3454093'
chicago: Chatterjee, Krishnendu, Ehsan Kafshdar Goharshady, Petr Novotný, and Dorde
Zikelic. “Proving Non-Termination by Program Reversal.” In Proceedings of the
42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation,
1033–48. Association for Computing Machinery, 2021. https://doi.org/10.1145/3453483.3454093.
ieee: K. Chatterjee, E. K. Goharshady, P. Novotný, and D. Zikelic, “Proving non-termination
by program reversal,” in Proceedings of the 42nd ACM SIGPLAN International
Conference on Programming Language Design and Implementation, Online, 2021,
pp. 1033–1048.
ista: 'Chatterjee K, Goharshady EK, Novotný P, Zikelic D. 2021. Proving non-termination
by program reversal. Proceedings of the 42nd ACM SIGPLAN International Conference
on Programming Language Design and Implementation. PLDI: Programming Language
Design and Implementation, 1033–1048.'
mla: Chatterjee, Krishnendu, et al. “Proving Non-Termination by Program Reversal.”
Proceedings of the 42nd ACM SIGPLAN International Conference on Programming
Language Design and Implementation, Association for Computing Machinery, 2021,
pp. 1033–48, doi:10.1145/3453483.3454093.
short: K. Chatterjee, E.K. Goharshady, P. Novotný, D. Zikelic, in:, Proceedings
of the 42nd ACM SIGPLAN International Conference on Programming Language Design
and Implementation, Association for Computing Machinery, 2021, pp. 1033–1048.
conference:
end_date: 2021-06-26
location: Online
name: 'PLDI: Programming Language Design and Implementation'
start_date: 2021-06-20
date_created: 2021-07-11T22:01:17Z
date_published: 2021-06-01T00:00:00Z
date_updated: 2023-11-30T10:55:37Z
day: '01'
department:
- _id: KrCh
doi: 10.1145/3453483.3454093
ec_funded: 1
external_id:
arxiv:
- '2104.01189'
isi:
- '000723661700067'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2104.01189
month: '06'
oa: 1
oa_version: Preprint
page: 1033-1048
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming
Language Design and Implementation
publication_identifier:
isbn:
- '9781450383912'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '14539'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Proving non-termination by program reversal
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2021'
...
---
_id: '9760'
abstract:
- lang: eng
text: "The quantum approximate optimization algorithm (QAOA) is a prospective near-term
quantum algorithm due to its modest circuit depth and promising benchmarks. However,
an external parameter optimization required in the QAOA could become a performance
bottleneck. This motivates studies of the optimization landscape and search for
heuristic ways of parameter initialization. In this work we visualize the optimization
landscape of the QAOA applied to the MaxCut problem on random graphs, demonstrating
that random initialization of the QAOA is prone to converging to local minima
with suboptimal performance. We introduce the initialization of QAOA parameters
based on the Trotterized quantum annealing (TQA) protocol, parameterized by the
Trotter time step. We find that the TQA initialization allows to circumvent\r\nthe
issue of false minima for a broad range of time steps, yielding the same performance
as the best result out of an exponentially scaling number of random initializations.
Moreover, we demonstrate that the optimal value of the time step coincides with
the point of proliferation of Trotter errors in quantum annealing. Our results
suggest practical ways of initializing QAOA protocols on near-term quantum devices
and reveal new connections between QAOA and quantum annealing."
acknowledgement: We would like to thank D. Abanin and R. Medina for fruitful discussions
and A. Smith and I. Kim for valuable feedback on the manuscript. We acknowledge
support by the European Research Council (ERC) under the European Union’s Horizon
2020 research and innovation program (Grant Agreement No. 850899).
article_number: '491'
article_processing_charge: Yes
article_type: original
author:
- first_name: Stefan
full_name: Sack, Stefan
id: dd622248-f6e0-11ea-865d-ce382a1c81a5
last_name: Sack
orcid: 0000-0001-5400-8508
- first_name: Maksym
full_name: Serbyn, Maksym
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
citation:
ama: Sack S, Serbyn M. Quantum annealing initialization of the quantum approximate
optimization algorithm. Quantum. 2021;5. doi:10.22331/Q-2021-07-01-491
apa: Sack, S., & Serbyn, M. (2021). Quantum annealing initialization of the
quantum approximate optimization algorithm. Quantum. Verein zur Förderung
des Open Access Publizierens in den Quantenwissenschaften. https://doi.org/10.22331/Q-2021-07-01-491
chicago: Sack, Stefan, and Maksym Serbyn. “Quantum Annealing Initialization of the
Quantum Approximate Optimization Algorithm.” Quantum. Verein zur Förderung
des Open Access Publizierens in den Quantenwissenschaften, 2021. https://doi.org/10.22331/Q-2021-07-01-491.
ieee: S. Sack and M. Serbyn, “Quantum annealing initialization of the quantum approximate
optimization algorithm,” Quantum, vol. 5. Verein zur Förderung des Open
Access Publizierens in den Quantenwissenschaften, 2021.
ista: Sack S, Serbyn M. 2021. Quantum annealing initialization of the quantum approximate
optimization algorithm. Quantum. 5, 491.
mla: Sack, Stefan, and Maksym Serbyn. “Quantum Annealing Initialization of the Quantum
Approximate Optimization Algorithm.” Quantum, vol. 5, 491, Verein zur Förderung
des Open Access Publizierens in den Quantenwissenschaften, 2021, doi:10.22331/Q-2021-07-01-491.
short: S. Sack, M. Serbyn, Quantum 5 (2021).
date_created: 2021-08-01T22:01:21Z
date_published: 2021-07-01T00:00:00Z
date_updated: 2023-12-13T14:47:25Z
day: '01'
ddc:
- '530'
department:
- _id: GradSch
- _id: MaSe
doi: 10.22331/Q-2021-07-01-491
ec_funded: 1
external_id:
arxiv:
- '2101.05742'
isi:
- '000669830600001'
file:
- access_level: open_access
checksum: 9706c2bb8e748e9b5b138381995a7f6f
content_type: application/pdf
creator: cchlebak
date_created: 2021-08-06T06:44:31Z
date_updated: 2021-08-06T06:44:31Z
file_id: '9774'
file_name: 2021_Quantum_Sack.pdf
file_size: 2312482
relation: main_file
file_date_updated: 2021-08-06T06:44:31Z
has_accepted_license: '1'
intvolume: ' 5'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 23841C26-32DE-11EA-91FC-C7463DDC885E
call_identifier: H2020
grant_number: '850899'
name: 'Non-Ergodic Quantum Matter: Universality, Dynamics and Control'
publication: Quantum
publication_identifier:
eissn:
- 2521-327X
publication_status: published
publisher: Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
quality_controlled: '1'
related_material:
record:
- id: '14622'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Quantum annealing initialization of the quantum approximate optimization algorithm
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: 5
year: '2021'
...
---
_id: '10414'
abstract:
- lang: eng
text: 'We consider the almost-sure (a.s.) termination problem for probabilistic
programs, which are a stochastic extension of classical imperative programs. Lexicographic
ranking functions provide a sound and practical approach for termination of non-probabilistic
programs, and their extension to probabilistic programs is achieved via lexicographic
ranking supermartingales (LexRSMs). However, LexRSMs introduced in the previous
work have a limitation that impedes their automation: all of their components
have to be non-negative in all reachable states. This might result in LexRSM not
existing even for simple terminating programs. Our contributions are twofold:
First, we introduce a generalization of LexRSMs which allows for some components
to be negative. This standard feature of non-probabilistic termination proofs
was hitherto not known to be sound in the probabilistic setting, as the soundness
proof requires a careful analysis of the underlying stochastic process. Second,
we present polynomial-time algorithms using our generalized LexRSMs for proving
a.s. termination in broad classes of linear-arithmetic programs.'
acknowledgement: This research was partially supported by the ERC CoG 863818 (ForM-SMArt),
the Czech Science Foundation grant No. GJ19-15134Y, and the European Union’s Horizon
2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement
No. 665385.
alternative_title:
- LNCS
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: Ehsan Kafshdar
full_name: Goharshady, Ehsan Kafshdar
last_name: Goharshady
- first_name: Petr
full_name: Novotný, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotný
- first_name: Jiří
full_name: Zárevúcky, Jiří
last_name: Zárevúcky
- first_name: Dorde
full_name: Zikelic, Dorde
id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
last_name: Zikelic
orcid: 0000-0002-4681-1699
citation:
ama: 'Chatterjee K, Goharshady EK, Novotný P, Zárevúcky J, Zikelic D. On lexicographic
proof rules for probabilistic termination. In: 24th International Symposium
on Formal Methods. Vol 13047. Springer Nature; 2021:619-639. doi:10.1007/978-3-030-90870-6_33'
apa: 'Chatterjee, K., Goharshady, E. K., Novotný, P., Zárevúcky, J., & Zikelic,
D. (2021). On lexicographic proof rules for probabilistic termination. In 24th
International Symposium on Formal Methods (Vol. 13047, pp. 619–639). Virtual:
Springer Nature. https://doi.org/10.1007/978-3-030-90870-6_33'
chicago: Chatterjee, Krishnendu, Ehsan Kafshdar Goharshady, Petr Novotný, Jiří Zárevúcky,
and Dorde Zikelic. “On Lexicographic Proof Rules for Probabilistic Termination.”
In 24th International Symposium on Formal Methods, 13047:619–39. Springer
Nature, 2021. https://doi.org/10.1007/978-3-030-90870-6_33.
ieee: K. Chatterjee, E. K. Goharshady, P. Novotný, J. Zárevúcky, and D. Zikelic,
“On lexicographic proof rules for probabilistic termination,” in 24th International
Symposium on Formal Methods, Virtual, 2021, vol. 13047, pp. 619–639.
ista: 'Chatterjee K, Goharshady EK, Novotný P, Zárevúcky J, Zikelic D. 2021. On
lexicographic proof rules for probabilistic termination. 24th International Symposium
on Formal Methods. FM: Formal Methods, LNCS, vol. 13047, 619–639.'
mla: Chatterjee, Krishnendu, et al. “On Lexicographic Proof Rules for Probabilistic
Termination.” 24th International Symposium on Formal Methods, vol. 13047,
Springer Nature, 2021, pp. 619–39, doi:10.1007/978-3-030-90870-6_33.
short: K. Chatterjee, E.K. Goharshady, P. Novotný, J. Zárevúcky, D. Zikelic, in:,
24th International Symposium on Formal Methods, Springer Nature, 2021, pp. 619–639.
conference:
end_date: 2021-11-26
location: Virtual
name: 'FM: Formal Methods'
start_date: 2021-11-20
date_created: 2021-12-05T23:01:45Z
date_published: 2021-11-10T00:00:00Z
date_updated: 2024-01-17T08:19:41Z
day: '10'
department:
- _id: KrCh
doi: 10.1007/978-3-030-90870-6_33
ec_funded: 1
external_id:
arxiv:
- '2108.02188'
isi:
- '000758218600033'
intvolume: ' 13047'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2108.02188
month: '11'
oa: 1
oa_version: Preprint
page: 619-639
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: 24th International Symposium on Formal Methods
publication_identifier:
eisbn:
- 978-3-030-90870-6
eissn:
- 1611-3349
isbn:
- 9-783-0309-0869-0
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '14539'
relation: dissertation_contains
status: public
- id: '14778'
relation: later_version
status: public
scopus_import: '1'
status: public
title: On lexicographic proof rules for probabilistic termination
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13047
year: '2021'
...
---
_id: '14800'
abstract:
- lang: eng
text: 'Research on two-dimensional (2D) materials has been explosively increasing
in last seventeen years in varying subjects including condensed matter physics,
electronic engineering, materials science, and chemistry since the mechanical
exfoliation of graphene in 2004. Starting from graphene, 2D materials now have
become a big family with numerous members and diverse categories. The unique structural
features and physicochemical properties of 2D materials make them one class of
the most appealing candidates for a wide range of potential applications. In particular,
we have seen some major breakthroughs made in the field of 2D materials in last
five years not only in developing novel synthetic methods and exploring new structures/properties
but also in identifying innovative applications and pushing forward commercialisation.
In this review, we provide a critical summary on the recent progress made in the
field of 2D materials with a particular focus on last five years. After a brief
background introduction, we first discuss the major synthetic methods for 2D materials,
including the mechanical exfoliation, liquid exfoliation, vapor phase deposition,
and wet-chemical synthesis as well as phase engineering of 2D materials belonging
to the field of phase engineering of nanomaterials (PEN). We then introduce the
superconducting/optical/magnetic properties and chirality of 2D materials along
with newly emerging magic angle 2D superlattices. Following that, the promising
applications of 2D materials in electronics, optoelectronics, catalysis, energy
storage, solar cells, biomedicine, sensors, environments, etc. are described sequentially.
Thereafter, we present the theoretic calculations and simulations of 2D materials.
Finally, after concluding the current progress, we provide some personal discussions
on the existing challenges and future outlooks in this rapidly developing field. '
article_number: '2108017'
article_processing_charge: No
article_type: review
author:
- first_name: Cheng
full_name: Chang, Cheng
id: 9E331C2E-9F27-11E9-AE48-5033E6697425
last_name: Chang
orcid: 0000-0002-9515-4277
- first_name: Wei
full_name: Chen, Wei
last_name: Chen
- first_name: Ye
full_name: Chen, Ye
last_name: Chen
- first_name: Yonghua
full_name: Chen, Yonghua
last_name: Chen
- first_name: Yu
full_name: Chen, Yu
last_name: Chen
- first_name: Feng
full_name: Ding, Feng
last_name: Ding
- first_name: Chunhai
full_name: Fan, Chunhai
last_name: Fan
- first_name: Hong Jin
full_name: Fan, Hong Jin
last_name: Fan
- first_name: Zhanxi
full_name: Fan, Zhanxi
last_name: Fan
- first_name: Cheng
full_name: Gong, Cheng
last_name: Gong
- first_name: Yongji
full_name: Gong, Yongji
last_name: Gong
- first_name: Qiyuan
full_name: He, Qiyuan
last_name: He
- first_name: Xun
full_name: Hong, Xun
last_name: Hong
- first_name: Sheng
full_name: Hu, Sheng
last_name: Hu
- first_name: Weida
full_name: Hu, Weida
last_name: Hu
- first_name: Wei
full_name: Huang, Wei
last_name: Huang
- first_name: Yuan
full_name: Huang, Yuan
last_name: Huang
- first_name: Wei
full_name: Ji, Wei
last_name: Ji
- first_name: Dehui
full_name: Li, Dehui
last_name: Li
- first_name: Lain Jong
full_name: Li, Lain Jong
last_name: Li
- first_name: Qiang
full_name: Li, Qiang
last_name: Li
- first_name: Li
full_name: Lin, Li
last_name: Lin
- first_name: Chongyi
full_name: Ling, Chongyi
last_name: Ling
- first_name: Minghua
full_name: Liu, Minghua
last_name: Liu
- first_name: 'Nan'
full_name: Liu, Nan
last_name: Liu
- first_name: Zhuang
full_name: Liu, Zhuang
last_name: Liu
- first_name: Kian Ping
full_name: Loh, Kian Ping
last_name: Loh
- first_name: Jianmin
full_name: Ma, Jianmin
last_name: Ma
- first_name: Feng
full_name: Miao, Feng
last_name: Miao
- first_name: Hailin
full_name: Peng, Hailin
last_name: Peng
- first_name: Mingfei
full_name: Shao, Mingfei
last_name: Shao
- first_name: Li
full_name: Song, Li
last_name: Song
- first_name: Shao
full_name: Su, Shao
last_name: Su
- first_name: Shuo
full_name: Sun, Shuo
last_name: Sun
- first_name: Chaoliang
full_name: Tan, Chaoliang
last_name: Tan
- first_name: Zhiyong
full_name: Tang, Zhiyong
last_name: Tang
- first_name: Dingsheng
full_name: Wang, Dingsheng
last_name: Wang
- first_name: Huan
full_name: Wang, Huan
last_name: Wang
- first_name: Jinlan
full_name: Wang, Jinlan
last_name: Wang
- first_name: Xin
full_name: Wang, Xin
last_name: Wang
- first_name: Xinran
full_name: Wang, Xinran
last_name: Wang
- first_name: Andrew T.S.
full_name: Wee, Andrew T.S.
last_name: Wee
- first_name: Zhongming
full_name: Wei, Zhongming
last_name: Wei
- first_name: Yuen
full_name: Wu, Yuen
last_name: Wu
- first_name: Zhong Shuai
full_name: Wu, Zhong Shuai
last_name: Wu
- first_name: Jie
full_name: Xiong, Jie
last_name: Xiong
- first_name: Qihua
full_name: Xiong, Qihua
last_name: Xiong
- first_name: Weigao
full_name: Xu, Weigao
last_name: Xu
- first_name: Peng
full_name: Yin, Peng
last_name: Yin
- first_name: Haibo
full_name: Zeng, Haibo
last_name: Zeng
- first_name: Zhiyuan
full_name: Zeng, Zhiyuan
last_name: Zeng
- first_name: Tianyou
full_name: Zhai, Tianyou
last_name: Zhai
- first_name: Han
full_name: Zhang, Han
last_name: Zhang
- first_name: Hui
full_name: Zhang, Hui
last_name: Zhang
- first_name: Qichun
full_name: Zhang, Qichun
last_name: Zhang
- first_name: Tierui
full_name: Zhang, Tierui
last_name: Zhang
- first_name: Xiang
full_name: Zhang, Xiang
last_name: Zhang
- first_name: Li Dong
full_name: Zhao, Li Dong
last_name: Zhao
- first_name: Meiting
full_name: Zhao, Meiting
last_name: Zhao
- first_name: Weijie
full_name: Zhao, Weijie
last_name: Zhao
- first_name: Yunxuan
full_name: Zhao, Yunxuan
last_name: Zhao
- first_name: Kai Ge
full_name: Zhou, Kai Ge
last_name: Zhou
- first_name: Xing
full_name: Zhou, Xing
last_name: Zhou
- first_name: Yu
full_name: Zhou, Yu
last_name: Zhou
- first_name: Hongwei
full_name: Zhu, Hongwei
last_name: Zhu
- first_name: Hua
full_name: Zhang, Hua
last_name: Zhang
- first_name: Zhongfan
full_name: Liu, Zhongfan
last_name: Liu
citation:
ama: Chang C, Chen W, Chen Y, et al. Recent progress on two-dimensional materials.
Acta Physico-Chimica Sinica. 2021;37(12). doi:10.3866/PKU.WHXB202108017
apa: Chang, C., Chen, W., Chen, Y., Chen, Y., Chen, Y., Ding, F., … Liu, Z. (2021).
Recent progress on two-dimensional materials. Acta Physico-Chimica Sinica.
Peking University. https://doi.org/10.3866/PKU.WHXB202108017
chicago: Chang, Cheng, Wei Chen, Ye Chen, Yonghua Chen, Yu Chen, Feng Ding, Chunhai
Fan, et al. “Recent Progress on Two-Dimensional Materials.” Acta Physico-Chimica
Sinica. Peking University, 2021. https://doi.org/10.3866/PKU.WHXB202108017.
ieee: C. Chang et al., “Recent progress on two-dimensional materials,” Acta
Physico-Chimica Sinica, vol. 37, no. 12. Peking University, 2021.
ista: Chang C, Chen W, Chen Y, Chen Y, Chen Y, Ding F, Fan C, Fan HJ, Fan Z, Gong
C, Gong Y, He Q, Hong X, Hu S, Hu W, Huang W, Huang Y, Ji W, Li D, Li LJ, Li Q,
Lin L, Ling C, Liu M, Liu N, Liu Z, Loh KP, Ma J, Miao F, Peng H, Shao M, Song
L, Su S, Sun S, Tan C, Tang Z, Wang D, Wang H, Wang J, Wang X, Wang X, Wee ATS,
Wei Z, Wu Y, Wu ZS, Xiong J, Xiong Q, Xu W, Yin P, Zeng H, Zeng Z, Zhai T, Zhang
H, Zhang H, Zhang Q, Zhang T, Zhang X, Zhao LD, Zhao M, Zhao W, Zhao Y, Zhou KG,
Zhou X, Zhou Y, Zhu H, Zhang H, Liu Z. 2021. Recent progress on two-dimensional
materials. Acta Physico-Chimica Sinica. 37(12), 2108017.
mla: Chang, Cheng, et al. “Recent Progress on Two-Dimensional Materials.” Acta
Physico-Chimica Sinica, vol. 37, no. 12, 2108017, Peking University, 2021,
doi:10.3866/PKU.WHXB202108017.
short: C. Chang, W. Chen, Y. Chen, Y. Chen, Y. Chen, F. Ding, C. Fan, H.J. Fan,
Z. Fan, C. Gong, Y. Gong, Q. He, X. Hong, S. Hu, W. Hu, W. Huang, Y. Huang, W.
Ji, D. Li, L.J. Li, Q. Li, L. Lin, C. Ling, M. Liu, N. Liu, Z. Liu, K.P. Loh,
J. Ma, F. Miao, H. Peng, M. Shao, L. Song, S. Su, S. Sun, C. Tan, Z. Tang, D.
Wang, H. Wang, J. Wang, X. Wang, X. Wang, A.T.S. Wee, Z. Wei, Y. Wu, Z.S. Wu,
J. Xiong, Q. Xiong, W. Xu, P. Yin, H. Zeng, Z. Zeng, T. Zhai, H. Zhang, H. Zhang,
Q. Zhang, T. Zhang, X. Zhang, L.D. Zhao, M. Zhao, W. Zhao, Y. Zhao, K.G. Zhou,
X. Zhou, Y. Zhou, H. Zhu, H. Zhang, Z. Liu, Acta Physico-Chimica Sinica 37 (2021).
date_created: 2024-01-14T23:00:58Z
date_published: 2021-10-13T00:00:00Z
date_updated: 2024-01-17T11:29:33Z
day: '13'
department:
- _id: MaIb
doi: 10.3866/PKU.WHXB202108017
intvolume: ' 37'
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.3866/PKU.WHXB202108017
month: '10'
oa: 1
oa_version: Submitted Version
publication: Acta Physico-Chimica Sinica
publication_identifier:
issn:
- 1001-4861
publication_status: published
publisher: Peking University
quality_controlled: '1'
scopus_import: '1'
status: public
title: Recent progress on two-dimensional materials
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2021'
...
---
_id: '10206'
abstract:
- lang: eng
text: Neural-network classifiers achieve high accuracy when predicting the class
of an input that they were trained to identify. Maintaining this accuracy in dynamic
environments, where inputs frequently fall outside the fixed set of initially
known classes, remains a challenge. The typical approach is to detect inputs from
novel classes and retrain the classifier on an augmented dataset. However, not
only the classifier but also the detection mechanism needs to adapt in order to
distinguish between newly learned and yet unknown input classes. To address this
challenge, we introduce an algorithmic framework for active monitoring of a neural
network. A monitor wrapped in our framework operates in parallel with the neural
network and interacts with a human user via a series of interpretable labeling
queries for incremental adaptation. In addition, we propose an adaptive quantitative
monitor to improve precision. An experimental evaluation on a diverse set of benchmarks
with varying numbers of classes confirms the benefits of our active monitoring
framework in dynamic scenarios.
acknowledgement: We thank Christoph Lampert and Alex Greengold for fruitful discussions.
This research was supported in part by the Simons Institute for the Theory of Computing,
the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), and the
European Union’s Horizon 2020 research and innovation programme under the Marie
Skłodowska-Curie grant agreement No. 754411.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Anna
full_name: Lukina, Anna
id: CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425
last_name: Lukina
- first_name: Christian
full_name: Schilling, Christian
id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87
last_name: Schilling
orcid: 0000-0003-3658-1065
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
citation:
ama: 'Lukina A, Schilling C, Henzinger TA. Into the unknown: active monitoring of neural
networks. In: 21st International Conference on Runtime Verification. Vol
12974. Cham: Springer Nature; 2021:42-61. doi:10.1007/978-3-030-88494-9_3'
apa: 'Lukina, A., Schilling, C., & Henzinger, T. A. (2021). Into the unknown:
active monitoring of neural networks. In 21st International Conference on Runtime
Verification (Vol. 12974, pp. 42–61). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-88494-9_3'
chicago: 'Lukina, Anna, Christian Schilling, and Thomas A Henzinger. “Into the Unknown:
Active Monitoring of Neural Networks.” In 21st International Conference on
Runtime Verification, 12974:42–61. Cham: Springer Nature, 2021. https://doi.org/10.1007/978-3-030-88494-9_3.'
ieee: 'A. Lukina, C. Schilling, and T. A. Henzinger, “Into the unknown: active monitoring
of neural networks,” in 21st International Conference on Runtime Verification,
Virtual, 2021, vol. 12974, pp. 42–61.'
ista: 'Lukina A, Schilling C, Henzinger TA. 2021. Into the unknown: active monitoring
of neural networks. 21st International Conference on Runtime Verification. RV:
Runtime Verification, LNCS, vol. 12974, 42–61.'
mla: 'Lukina, Anna, et al. “Into the Unknown: Active Monitoring of Neural Networks.”
21st International Conference on Runtime Verification, vol. 12974, Springer
Nature, 2021, pp. 42–61, doi:10.1007/978-3-030-88494-9_3.'
short: A. Lukina, C. Schilling, T.A. Henzinger, in:, 21st International Conference
on Runtime Verification, Springer Nature, Cham, 2021, pp. 42–61.
conference:
end_date: 2021-10-14
location: Virtual
name: 'RV: Runtime Verification'
start_date: 2021-10-11
date_created: 2021-10-31T23:01:31Z
date_published: 2021-10-06T00:00:00Z
date_updated: 2024-01-30T12:06:56Z
day: '06'
department:
- _id: ToHe
doi: 10.1007/978-3-030-88494-9_3
ec_funded: 1
external_id:
arxiv:
- '2009.06429'
isi:
- '000719383800003'
isi: 1
keyword:
- monitoring
- neural networks
- novelty detection
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2009.06429
month: '10'
oa: 1
oa_version: Preprint
page: 42-61
place: Cham
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: 21st International Conference on Runtime Verification
publication_identifier:
eisbn:
- 978-3-030-88494-9
eissn:
- 1611-3349
isbn:
- 9-783-0308-8493-2
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '13234'
relation: extended_version
status: public
scopus_import: '1'
status: public
title: 'Into the unknown: active monitoring of neural networks'
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: '12974 '
year: '2021'
...