---
_id: '6369'
abstract:
- lang: eng
text: We construct a metamaterial from radio-frequency harmonic oscillators, and
find two topologically distinct phases resulting from dissipation engineered into
the system. These phases are distinguished by a quantized value of bulk energy
transport. The impulse response of our circuit is measured and used to reconstruct
the band structure and winding number of circuit eigenfunctions around a dark
mode. Our results demonstrate that dissipative topological transport can occur
in a wider class of physical systems than considered before.
article_number: '220301'
arxiv: 1
author:
- first_name: Eric I.
full_name: Rosenthal, Eric I.
last_name: Rosenthal
- first_name: Nicole K.
full_name: Ehrlich, Nicole K.
last_name: Ehrlich
- first_name: Mark S.
full_name: Rudner, Mark S.
last_name: Rudner
- first_name: Andrew P
full_name: Higginbotham, Andrew P
id: 4AD6785A-F248-11E8-B48F-1D18A9856A87
last_name: Higginbotham
orcid: 0000-0003-2607-2363
- first_name: K. W.
full_name: Lehnert, K. W.
last_name: Lehnert
citation:
ama: Rosenthal EI, Ehrlich NK, Rudner MS, Higginbotham AP, Lehnert KW. Topological
phase transition measured in a dissipative metamaterial. Physical Review B.
2018;97(22). doi:10.1103/physrevb.97.220301
apa: Rosenthal, E. I., Ehrlich, N. K., Rudner, M. S., Higginbotham, A. P., &
Lehnert, K. W. (2018). Topological phase transition measured in a dissipative
metamaterial. Physical Review B. American Physical Society (APS). https://doi.org/10.1103/physrevb.97.220301
chicago: Rosenthal, Eric I., Nicole K. Ehrlich, Mark S. Rudner, Andrew P Higginbotham,
and K. W. Lehnert. “Topological Phase Transition Measured in a Dissipative Metamaterial.”
Physical Review B. American Physical Society (APS), 2018. https://doi.org/10.1103/physrevb.97.220301.
ieee: E. I. Rosenthal, N. K. Ehrlich, M. S. Rudner, A. P. Higginbotham, and K. W.
Lehnert, “Topological phase transition measured in a dissipative metamaterial,”
Physical Review B, vol. 97, no. 22. American Physical Society (APS), 2018.
ista: Rosenthal EI, Ehrlich NK, Rudner MS, Higginbotham AP, Lehnert KW. 2018. Topological
phase transition measured in a dissipative metamaterial. Physical Review B. 97(22),
220301.
mla: Rosenthal, Eric I., et al. “Topological Phase Transition Measured in a Dissipative
Metamaterial.” Physical Review B, vol. 97, no. 22, 220301, American Physical
Society (APS), 2018, doi:10.1103/physrevb.97.220301.
short: E.I. Rosenthal, N.K. Ehrlich, M.S. Rudner, A.P. Higginbotham, K.W. Lehnert,
Physical Review B 97 (2018).
date_created: 2019-05-03T09:29:49Z
date_published: 2018-06-04T00:00:00Z
date_updated: 2021-01-12T08:07:16Z
day: '04'
doi: 10.1103/physrevb.97.220301
extern: '1'
external_id:
arxiv:
- '1802.02243'
intvolume: ' 97'
issue: '22'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1802.02243
month: '06'
oa: 1
oa_version: Preprint
publication: Physical Review B
publication_identifier:
issn:
- 2469-9950
- 2469-9969
publication_status: published
publisher: American Physical Society (APS)
quality_controlled: '1'
status: public
title: Topological phase transition measured in a dissipative metamaterial
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 97
year: '2018'
...
---
_id: '64'
abstract:
- lang: eng
text: Tropical geometry, an established field in pure mathematics, is a place where
string theory, mirror symmetry, computational algebra, auction theory, and so
forth meet and influence one another. In this paper, we report on our discovery
of a tropical model with self-organized criticality (SOC) behavior. Our model
is continuous, in contrast to all known models of SOC, and is a certain scaling
limit of the sandpile model, the first and archetypical model of SOC. We describe
how our model is related to pattern formation and proportional growth phenomena
and discuss the dichotomy between continuous and discrete models in several contexts.
Our aim in this context is to present an idealized tropical toy model (cf. Turing
reaction-diffusion model), requiring further investigation.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Nikita
full_name: Kalinin, Nikita
last_name: Kalinin
- first_name: Aldo
full_name: Guzmán Sáenz, Aldo
last_name: Guzmán Sáenz
- first_name: Y
full_name: Prieto, Y
last_name: Prieto
- first_name: Mikhail
full_name: Shkolnikov, Mikhail
id: 35084A62-F248-11E8-B48F-1D18A9856A87
last_name: Shkolnikov
orcid: 0000-0002-4310-178X
- first_name: V
full_name: Kalinina, V
last_name: Kalinina
- first_name: Ernesto
full_name: Lupercio, Ernesto
last_name: Lupercio
citation:
ama: 'Kalinin N, Guzmán Sáenz A, Prieto Y, Shkolnikov M, Kalinina V, Lupercio E.
Self-organized criticality and pattern emergence through the lens of tropical
geometry. PNAS: Proceedings of the National Academy of Sciences of the United
States of America. 2018;115(35):E8135-E8142. doi:10.1073/pnas.1805847115'
apa: 'Kalinin, N., Guzmán Sáenz, A., Prieto, Y., Shkolnikov, M., Kalinina, V., &
Lupercio, E. (2018). Self-organized criticality and pattern emergence through
the lens of tropical geometry. PNAS: Proceedings of the National Academy of
Sciences of the United States of America. National Academy of Sciences. https://doi.org/10.1073/pnas.1805847115'
chicago: 'Kalinin, Nikita, Aldo Guzmán Sáenz, Y Prieto, Mikhail Shkolnikov, V Kalinina,
and Ernesto Lupercio. “Self-Organized Criticality and Pattern Emergence through
the Lens of Tropical Geometry.” PNAS: Proceedings of the National Academy of
Sciences of the United States of America. National Academy of Sciences, 2018.
https://doi.org/10.1073/pnas.1805847115.'
ieee: 'N. Kalinin, A. Guzmán Sáenz, Y. Prieto, M. Shkolnikov, V. Kalinina, and E.
Lupercio, “Self-organized criticality and pattern emergence through the lens of
tropical geometry,” PNAS: Proceedings of the National Academy of Sciences of
the United States of America, vol. 115, no. 35. National Academy of Sciences,
pp. E8135–E8142, 2018.'
ista: 'Kalinin N, Guzmán Sáenz A, Prieto Y, Shkolnikov M, Kalinina V, Lupercio E.
2018. Self-organized criticality and pattern emergence through the lens of tropical
geometry. PNAS: Proceedings of the National Academy of Sciences of the United
States of America. 115(35), E8135–E8142.'
mla: 'Kalinin, Nikita, et al. “Self-Organized Criticality and Pattern Emergence
through the Lens of Tropical Geometry.” PNAS: Proceedings of the National Academy
of Sciences of the United States of America, vol. 115, no. 35, National Academy
of Sciences, 2018, pp. E8135–42, doi:10.1073/pnas.1805847115.'
short: 'N. Kalinin, A. Guzmán Sáenz, Y. Prieto, M. Shkolnikov, V. Kalinina, E. Lupercio,
PNAS: Proceedings of the National Academy of Sciences of the United States of
America 115 (2018) E8135–E8142.'
date_created: 2018-12-11T11:44:26Z
date_published: 2018-08-28T00:00:00Z
date_updated: 2023-09-18T08:41:16Z
day: '28'
department:
- _id: TaHa
doi: 10.1073/pnas.1805847115
ec_funded: 1
external_id:
arxiv:
- '1806.09153'
isi:
- '000442861600009'
intvolume: ' 115'
isi: 1
issue: '35'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1806.09153
month: '08'
oa: 1
oa_version: Preprint
page: E8135 - E8142
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: 'PNAS: Proceedings of the National Academy of Sciences of the United
States of America'
publication_identifier:
issn:
- '00278424'
publication_status: published
publisher: National Academy of Sciences
publist_id: '7990'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Self-organized criticality and pattern emergence through the lens of tropical
geometry
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 115
year: '2018'
...
---
_id: '6459'
author:
- first_name: Barbara
full_name: Petritsch, Barbara
id: 406048EC-F248-11E8-B48F-1D18A9856A87
last_name: Petritsch
orcid: 0000-0003-2724-4614
citation:
ama: Petritsch B. Open Access at IST Austria 2009-2017. IST Austria; 2018.
doi:10.5281/zenodo.1410279
apa: 'Petritsch, B. (2018). Open Access at IST Austria 2009-2017. Presented
at the Open-Access-Tage, Graz, Austria: IST Austria. https://doi.org/10.5281/zenodo.1410279'
chicago: Petritsch, Barbara. Open Access at IST Austria 2009-2017. IST Austria,
2018. https://doi.org/10.5281/zenodo.1410279.
ieee: B. Petritsch, Open Access at IST Austria 2009-2017. IST Austria, 2018.
ista: Petritsch B. 2018. Open Access at IST Austria 2009-2017, IST Austria,p.
mla: Petritsch, Barbara. Open Access at IST Austria 2009-2017. IST Austria,
2018, doi:10.5281/zenodo.1410279.
short: B. Petritsch, Open Access at IST Austria 2009-2017, IST Austria, 2018.
conference:
end_date: 2018-09-26
location: Graz, Austria
name: Open-Access-Tage
start_date: 2018-09-24
date_created: 2019-05-16T07:27:14Z
date_published: 2018-09-24T00:00:00Z
date_updated: 2020-07-14T23:06:21Z
day: '24'
ddc:
- '020'
department:
- _id: E-Lib
doi: 10.5281/zenodo.1410279
file:
- access_level: open_access
checksum: 9063ab4d10ea93353c3a03bbf53fbcf1
content_type: application/pdf
creator: dernst
date_created: 2019-05-16T07:26:25Z
date_updated: 2020-07-14T12:47:30Z
file_id: '6460'
file_name: Poster_Beitrag_125_Petritsch.pdf
file_size: 1967778
relation: main_file
file_date_updated: 2020-07-14T12:47:30Z
has_accepted_license: '1'
keyword:
- Open Access
- Publication Analysis
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
publication_status: published
publisher: IST Austria
status: public
title: Open Access at IST Austria 2009-2017
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference_poster
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '6497'
abstract:
- lang: eng
text: T cells are actively scanning pMHC-presenting cells in lymphoid organs and
nonlymphoid tissues (NLTs) with divergent topologies and confinement. How the
T cell actomyosin cytoskeleton facilitates this task in distinct environments
is incompletely understood. Here, we show that lack of Myosin IXb (Myo9b), a negative
regulator of the small GTPase Rho, led to increased Rho-GTP levels and cell surface
stiffness in primary T cells. Nonetheless, intravital imaging revealed robust
motility of Myo9b−/− CD8+ T cells in lymphoid tissue and similar expansion and
differentiation during immune responses. In contrast, accumulation of Myo9b−/−
CD8+ T cells in NLTs was strongly impaired. Specifically, Myo9b was required for
T cell crossing of basement membranes, such as those which are present between
dermis and epidermis. As consequence, Myo9b−/− CD8+ T cells showed impaired control
of skin infections. In sum, we show that Myo9b is critical for the CD8+ T cell
adaptation from lymphoid to NLT surveillance and the establishment of protective
tissue–resident T cell populations.
article_processing_charge: No
author:
- first_name: Federica
full_name: Moalli, Federica
last_name: Moalli
- first_name: Xenia
full_name: Ficht, Xenia
last_name: Ficht
- first_name: Philipp
full_name: Germann, Philipp
last_name: Germann
- first_name: Mykhailo
full_name: Vladymyrov, Mykhailo
last_name: Vladymyrov
- first_name: Bettina
full_name: Stolp, Bettina
last_name: Stolp
- first_name: Ingrid
full_name: de Vries, Ingrid
id: 4C7D837E-F248-11E8-B48F-1D18A9856A87
last_name: de Vries
- first_name: Ruth
full_name: Lyck, Ruth
last_name: Lyck
- first_name: Jasmin
full_name: Balmer, Jasmin
last_name: Balmer
- first_name: Amleto
full_name: Fiocchi, Amleto
last_name: Fiocchi
- first_name: Mario
full_name: Kreutzfeldt, Mario
last_name: Kreutzfeldt
- first_name: Doron
full_name: Merkler, Doron
last_name: Merkler
- first_name: Matteo
full_name: Iannacone, Matteo
last_name: Iannacone
- first_name: Akitaka
full_name: Ariga, Akitaka
last_name: Ariga
- first_name: Michael H.
full_name: Stoffel, Michael H.
last_name: Stoffel
- first_name: James
full_name: Sharpe, James
last_name: Sharpe
- first_name: Martin
full_name: Bähler, Martin
last_name: Bähler
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
- first_name: Alba
full_name: Diz-Muñoz, Alba
last_name: Diz-Muñoz
- first_name: Jens V.
full_name: Stein, Jens V.
last_name: Stein
citation:
ama: Moalli F, Ficht X, Germann P, et al. The Rho regulator Myosin IXb enables nonlymphoid
tissue seeding of protective CD8+T cells. The Journal of Experimental Medicine.
2018;2015(7):1869–1890. doi:10.1084/jem.20170896
apa: Moalli, F., Ficht, X., Germann, P., Vladymyrov, M., Stolp, B., de Vries, I.,
… Stein, J. V. (2018). The Rho regulator Myosin IXb enables nonlymphoid tissue
seeding of protective CD8+T cells. The Journal of Experimental Medicine.
Rockefeller University Press. https://doi.org/10.1084/jem.20170896
chicago: Moalli, Federica, Xenia Ficht, Philipp Germann, Mykhailo Vladymyrov, Bettina
Stolp, Ingrid de Vries, Ruth Lyck, et al. “The Rho Regulator Myosin IXb Enables
Nonlymphoid Tissue Seeding of Protective CD8+T Cells.” The Journal of Experimental
Medicine. Rockefeller University Press, 2018. https://doi.org/10.1084/jem.20170896.
ieee: F. Moalli et al., “The Rho regulator Myosin IXb enables nonlymphoid
tissue seeding of protective CD8+T cells,” The Journal of Experimental Medicine,
vol. 2015, no. 7. Rockefeller University Press, pp. 1869–1890, 2018.
ista: Moalli F, Ficht X, Germann P, Vladymyrov M, Stolp B, de Vries I, Lyck R, Balmer
J, Fiocchi A, Kreutzfeldt M, Merkler D, Iannacone M, Ariga A, Stoffel MH, Sharpe
J, Bähler M, Sixt MK, Diz-Muñoz A, Stein JV. 2018. The Rho regulator Myosin IXb
enables nonlymphoid tissue seeding of protective CD8+T cells. The Journal of Experimental
Medicine. 2015(7), 1869–1890.
mla: Moalli, Federica, et al. “The Rho Regulator Myosin IXb Enables Nonlymphoid
Tissue Seeding of Protective CD8+T Cells.” The Journal of Experimental Medicine,
vol. 2015, no. 7, Rockefeller University Press, 2018, pp. 1869–1890, doi:10.1084/jem.20170896.
short: F. Moalli, X. Ficht, P. Germann, M. Vladymyrov, B. Stolp, I. de Vries, R.
Lyck, J. Balmer, A. Fiocchi, M. Kreutzfeldt, D. Merkler, M. Iannacone, A. Ariga,
M.H. Stoffel, J. Sharpe, M. Bähler, M.K. Sixt, A. Diz-Muñoz, J.V. Stein, The Journal
of Experimental Medicine 2015 (2018) 1869–1890.
date_created: 2019-05-28T12:36:47Z
date_published: 2018-06-06T00:00:00Z
date_updated: 2023-09-19T14:52:08Z
day: '06'
ddc:
- '570'
department:
- _id: MiSi
doi: 10.1084/jem.20170896
external_id:
isi:
- '000440822900011'
file:
- access_level: open_access
checksum: 86ae5331f9bfced9a6358a790a04bef4
content_type: application/pdf
creator: kschuh
date_created: 2019-05-28T12:40:05Z
date_updated: 2020-07-14T12:47:32Z
file_id: '6498'
file_name: 2018_rupress_Moalli.pdf
file_size: 3841660
relation: main_file
file_date_updated: 2020-07-14T12:47:32Z
has_accepted_license: '1'
intvolume: ' 2015'
isi: 1
issue: '7'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-sa/4.0/
month: '06'
oa: 1
oa_version: Published Version
page: 1869–1890
publication: The Journal of Experimental Medicine
publication_identifier:
eissn:
- 1540-9538
issn:
- 0022-1007
publication_status: published
publisher: Rockefeller University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: The Rho regulator Myosin IXb enables nonlymphoid tissue seeding of protective
CD8+T cells
tmp:
image: /images/cc_by_nc_sa.png
legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
BY-NC-SA 4.0)
short: CC BY-NC-SA (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2015
year: '2018'
...
---
_id: '6499'
abstract:
- lang: eng
text: Expansion microscopy is a recently introduced imaging technique that achieves
super‐resolution through physically expanding the specimen by ~4×, after embedding
into a swellable gel. The resolution attained is, correspondingly, approximately
fourfold better than the diffraction limit, or ~70 nm. This is a major improvement
over conventional microscopy, but still lags behind modern STED or STORM setups,
whose resolution can reach 20–30 nm. We addressed this issue here by introducing
an improved gel recipe that enables an expansion factor of ~10× in each dimension,
which corresponds to an expansion of the sample volume by more than 1,000‐fold.
Our protocol, which we termed X10 microscopy, achieves a resolution of 25–30 nm
on conventional epifluorescence microscopes. X10 provides multi‐color images similar
or even superior to those produced with more challenging methods, such as STED,
STORM, and iterative expansion microscopy (iExM). X10 is therefore the cheapest
and easiest option for high‐quality super‐resolution imaging currently available.
X10 should be usable in any laboratory, irrespective of the machinery owned or
of the technical knowledge.
article_number: e45836
article_processing_charge: No
author:
- first_name: Sven M
full_name: Truckenbrodt, Sven M
id: 45812BD4-F248-11E8-B48F-1D18A9856A87
last_name: Truckenbrodt
- first_name: Manuel
full_name: Maidorn, Manuel
last_name: Maidorn
- first_name: Dagmar
full_name: Crzan, Dagmar
last_name: Crzan
- first_name: Hanna
full_name: Wildhagen, Hanna
last_name: Wildhagen
- first_name: Selda
full_name: Kabatas, Selda
last_name: Kabatas
- first_name: Silvio O
full_name: Rizzoli, Silvio O
last_name: Rizzoli
citation:
ama: Truckenbrodt SM, Maidorn M, Crzan D, Wildhagen H, Kabatas S, Rizzoli SO. X10
expansion microscopy enables 25‐nm resolution on conventional microscopes. EMBO
reports. 2018;19(9). doi:10.15252/embr.201845836
apa: Truckenbrodt, S. M., Maidorn, M., Crzan, D., Wildhagen, H., Kabatas, S., &
Rizzoli, S. O. (2018). X10 expansion microscopy enables 25‐nm resolution on conventional
microscopes. EMBO Reports. EMBO. https://doi.org/10.15252/embr.201845836
chicago: Truckenbrodt, Sven M, Manuel Maidorn, Dagmar Crzan, Hanna Wildhagen, Selda
Kabatas, and Silvio O Rizzoli. “X10 Expansion Microscopy Enables 25‐nm Resolution
on Conventional Microscopes.” EMBO Reports. EMBO, 2018. https://doi.org/10.15252/embr.201845836.
ieee: S. M. Truckenbrodt, M. Maidorn, D. Crzan, H. Wildhagen, S. Kabatas, and S.
O. Rizzoli, “X10 expansion microscopy enables 25‐nm resolution on conventional
microscopes,” EMBO reports, vol. 19, no. 9. EMBO, 2018.
ista: Truckenbrodt SM, Maidorn M, Crzan D, Wildhagen H, Kabatas S, Rizzoli SO. 2018.
X10 expansion microscopy enables 25‐nm resolution on conventional microscopes.
EMBO reports. 19(9), e45836.
mla: Truckenbrodt, Sven M., et al. “X10 Expansion Microscopy Enables 25‐nm Resolution
on Conventional Microscopes.” EMBO Reports, vol. 19, no. 9, e45836, EMBO,
2018, doi:10.15252/embr.201845836.
short: S.M. Truckenbrodt, M. Maidorn, D. Crzan, H. Wildhagen, S. Kabatas, S.O. Rizzoli,
EMBO Reports 19 (2018).
date_created: 2019-05-28T13:16:08Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2023-09-19T14:52:32Z
day: '01'
ddc:
- '580'
department:
- _id: JoDa
doi: 10.15252/embr.201845836
external_id:
isi:
- '000443682200009'
file:
- access_level: open_access
checksum: 6ec90abc637f09cca3a7b6424d7e7a26
content_type: application/pdf
creator: kschuh
date_created: 2019-05-28T13:17:19Z
date_updated: 2020-07-14T12:47:32Z
file_id: '6500'
file_name: 2018_embo_Truckenbrodt.pdf
file_size: 2005572
relation: main_file
file_date_updated: 2020-07-14T12:47:32Z
has_accepted_license: '1'
intvolume: ' 19'
isi: 1
issue: '9'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
publication: EMBO reports
publication_identifier:
eissn:
- 1469-3178
issn:
- 1469-221X
publication_status: published
publisher: EMBO
quality_controlled: '1'
scopus_import: '1'
status: public
title: X10 expansion microscopy enables 25‐nm resolution on conventional microscopes
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: 19
year: '2018'
...
---
_id: '6525'
abstract:
- lang: eng
text: This chapter finds an agreement of equivariant indices of semi-classical homomorphisms
between pairwise mirror branes in the GL2 Higgs moduli space on a Riemann surface.
On one side of the agreement, components of the Lagrangian brane of U(1,1) Higgs
bundles, whose mirror was proposed by Hitchin to be certain even exterior powers
of the hyperholomorphic Dirac bundle on the SL2 Higgs moduli space, are present.
The agreement arises from a mysterious functional equation. This gives strong
computational evidence for Hitchin’s proposal.
author:
- first_name: Tamás
full_name: Hausel, Tamás
id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
last_name: Hausel
- first_name: Anton
full_name: Mellit, Anton
id: 388D3134-F248-11E8-B48F-1D18A9856A87
last_name: Mellit
- first_name: Du
full_name: Pei, Du
last_name: Pei
citation:
ama: 'Hausel T, Mellit A, Pei D. Mirror symmetry with branes by equivariant verlinde
formulas. In: Geometry and Physics: Volume I. Oxford University Press;
2018:189-218. doi:10.1093/oso/9780198802013.003.0009'
apa: 'Hausel, T., Mellit, A., & Pei, D. (2018). Mirror symmetry with branes
by equivariant verlinde formulas. In Geometry and Physics: Volume I (pp.
189–218). Oxford University Press. https://doi.org/10.1093/oso/9780198802013.003.0009'
chicago: 'Hausel, Tamás, Anton Mellit, and Du Pei. “Mirror Symmetry with Branes
by Equivariant Verlinde Formulas.” In Geometry and Physics: Volume I, 189–218.
Oxford University Press, 2018. https://doi.org/10.1093/oso/9780198802013.003.0009.'
ieee: 'T. Hausel, A. Mellit, and D. Pei, “Mirror symmetry with branes by equivariant
verlinde formulas,” in Geometry and Physics: Volume I, Oxford University
Press, 2018, pp. 189–218.'
ista: 'Hausel T, Mellit A, Pei D. 2018.Mirror symmetry with branes by equivariant
verlinde formulas. In: Geometry and Physics: Volume I. , 189–218.'
mla: 'Hausel, Tamás, et al. “Mirror Symmetry with Branes by Equivariant Verlinde
Formulas.” Geometry and Physics: Volume I, Oxford University Press, 2018,
pp. 189–218, doi:10.1093/oso/9780198802013.003.0009.'
short: 'T. Hausel, A. Mellit, D. Pei, in:, Geometry and Physics: Volume I, Oxford
University Press, 2018, pp. 189–218.'
date_created: 2019-06-06T12:42:01Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2021-01-12T08:07:52Z
day: '01'
department:
- _id: TaHa
doi: 10.1093/oso/9780198802013.003.0009
language:
- iso: eng
month: '01'
oa_version: None
page: 189-218
publication: 'Geometry and Physics: Volume I'
publication_identifier:
isbn:
- '9780198802013'
- '9780191840500'
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: 1
status: public
title: Mirror symmetry with branes by equivariant verlinde formulas
type: book_chapter
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '6558'
abstract:
- lang: eng
text: This paper studies the problem of distributed stochastic optimization in an
adversarial setting where, out of m machines which allegedly compute stochastic
gradients every iteration, an α-fraction are Byzantine, and may behave adversarially.
Our main result is a variant of stochastic gradient descent (SGD) which finds
ε-approximate minimizers of convex functions in T=O~(1/ε²m+α²/ε²) iterations.
In contrast, traditional mini-batch SGD needs T=O(1/ε²m) iterations, but cannot
tolerate Byzantine failures. Further, we provide a lower bound showing that, up
to logarithmic factors, our algorithm is information-theoretically optimal both
in terms of sample complexity and time complexity.
article_processing_charge: No
arxiv: 1
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Zeyuan
full_name: Allen-Zhu, Zeyuan
last_name: Allen-Zhu
- first_name: Jerry
full_name: Li, Jerry
last_name: Li
citation:
ama: 'Alistarh D-A, Allen-Zhu Z, Li J. Byzantine stochastic gradient descent. In:
Advances in Neural Information Processing Systems. Vol 2018. Neural Information
Processing Systems Foundation; 2018:4613-4623.'
apa: 'Alistarh, D.-A., Allen-Zhu, Z., & Li, J. (2018). Byzantine stochastic
gradient descent. In Advances in Neural Information Processing Systems
(Vol. 2018, pp. 4613–4623). Montreal, Canada: Neural Information Processing Systems
Foundation.'
chicago: Alistarh, Dan-Adrian, Zeyuan Allen-Zhu, and Jerry Li. “Byzantine Stochastic
Gradient Descent.” In Advances in Neural Information Processing Systems,
2018:4613–23. Neural Information Processing Systems Foundation, 2018.
ieee: D.-A. Alistarh, Z. Allen-Zhu, and J. Li, “Byzantine stochastic gradient descent,”
in Advances in Neural Information Processing Systems, Montreal, Canada,
2018, vol. 2018, pp. 4613–4623.
ista: 'Alistarh D-A, Allen-Zhu Z, Li J. 2018. Byzantine stochastic gradient descent.
Advances in Neural Information Processing Systems. NeurIPS: Conference on Neural
Information Processing Systems vol. 2018, 4613–4623.'
mla: Alistarh, Dan-Adrian, et al. “Byzantine Stochastic Gradient Descent.” Advances
in Neural Information Processing Systems, vol. 2018, Neural Information Processing
Systems Foundation, 2018, pp. 4613–23.
short: D.-A. Alistarh, Z. Allen-Zhu, J. Li, in:, Advances in Neural Information
Processing Systems, Neural Information Processing Systems Foundation, 2018, pp.
4613–4623.
conference:
end_date: 2018-12-08
location: Montreal, Canada
name: 'NeurIPS: Conference on Neural Information Processing Systems'
start_date: 2018-12-02
date_created: 2019-06-13T08:22:37Z
date_published: 2018-12-01T00:00:00Z
date_updated: 2023-09-19T15:12:45Z
day: '01'
department:
- _id: DaAl
external_id:
arxiv:
- '1803.08917'
isi:
- '000461823304061'
intvolume: ' 2018'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1803.08917
month: '12'
oa: 1
oa_version: Published Version
page: 4613-4623
publication: Advances in Neural Information Processing Systems
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: Byzantine stochastic gradient descent
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2018
year: '2018'
...
---
_id: '6589'
abstract:
- lang: eng
text: Distributed training of massive machine learning models, in particular deep
neural networks, via Stochastic Gradient Descent (SGD) is becoming commonplace.
Several families of communication-reduction methods, such as quantization, large-batch
methods, and gradient sparsification, have been proposed. To date, gradient sparsification
methods--where each node sorts gradients by magnitude, and only communicates a
subset of the components, accumulating the rest locally--are known to yield some
of the largest practical gains. Such methods can reduce the amount of communication
per step by up to \emph{three orders of magnitude}, while preserving model accuracy.
Yet, this family of methods currently has no theoretical justification. This is
the question we address in this paper. We prove that, under analytic assumptions,
sparsifying gradients by magnitude with local error correction provides convergence
guarantees, for both convex and non-convex smooth objectives, for data-parallel
SGD. The main insight is that sparsification methods implicitly maintain bounds
on the maximum impact of stale updates, thanks to selection by magnitude. Our
analysis and empirical validation also reveal that these methods do require analytical
conditions to converge well, justifying existing heuristics.
article_processing_charge: No
arxiv: 1
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Torsten
full_name: Hoefler, Torsten
last_name: Hoefler
- first_name: Mikael
full_name: Johansson, Mikael
last_name: Johansson
- first_name: Nikola H
full_name: Konstantinov, Nikola H
id: 4B9D76E4-F248-11E8-B48F-1D18A9856A87
last_name: Konstantinov
- first_name: Sarit
full_name: Khirirat, Sarit
last_name: Khirirat
- first_name: Cedric
full_name: Renggli, Cedric
last_name: Renggli
citation:
ama: 'Alistarh D-A, Hoefler T, Johansson M, Konstantinov NH, Khirirat S, Renggli
C. The convergence of sparsified gradient methods. In: Advances in Neural Information
Processing Systems 31. Vol Volume 2018. Neural Information Processing Systems
Foundation; 2018:5973-5983.'
apa: 'Alistarh, D.-A., Hoefler, T., Johansson, M., Konstantinov, N. H., Khirirat,
S., & Renggli, C. (2018). The convergence of sparsified gradient methods.
In Advances in Neural Information Processing Systems 31 (Vol. Volume 2018,
pp. 5973–5983). Montreal, Canada: Neural Information Processing Systems Foundation.'
chicago: Alistarh, Dan-Adrian, Torsten Hoefler, Mikael Johansson, Nikola H Konstantinov,
Sarit Khirirat, and Cedric Renggli. “The Convergence of Sparsified Gradient Methods.”
In Advances in Neural Information Processing Systems 31, Volume 2018:5973–83.
Neural Information Processing Systems Foundation, 2018.
ieee: D.-A. Alistarh, T. Hoefler, M. Johansson, N. H. Konstantinov, S. Khirirat,
and C. Renggli, “The convergence of sparsified gradient methods,” in Advances
in Neural Information Processing Systems 31, Montreal, Canada, 2018, vol.
Volume 2018, pp. 5973–5983.
ista: 'Alistarh D-A, Hoefler T, Johansson M, Konstantinov NH, Khirirat S, Renggli
C. 2018. The convergence of sparsified gradient methods. Advances in Neural Information
Processing Systems 31. NeurIPS: Conference on Neural Information Processing Systems
vol. Volume 2018, 5973–5983.'
mla: Alistarh, Dan-Adrian, et al. “The Convergence of Sparsified Gradient Methods.”
Advances in Neural Information Processing Systems 31, vol. Volume 2018,
Neural Information Processing Systems Foundation, 2018, pp. 5973–83.
short: D.-A. Alistarh, T. Hoefler, M. Johansson, N.H. Konstantinov, S. Khirirat,
C. Renggli, in:, Advances in Neural Information Processing Systems 31, Neural
Information Processing Systems Foundation, 2018, pp. 5973–5983.
conference:
end_date: 2018-12-08
location: Montreal, Canada
name: 'NeurIPS: Conference on Neural Information Processing Systems'
start_date: 2018-12-02
date_created: 2019-06-27T09:32:55Z
date_published: 2018-12-01T00:00:00Z
date_updated: 2023-10-17T11:47:20Z
day: '01'
department:
- _id: DaAl
- _id: ChLa
ec_funded: 1
external_id:
arxiv:
- '1809.10505'
isi:
- '000461852000047'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1809.10505
month: '12'
oa: 1
oa_version: Preprint
page: 5973-5983
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: Advances in Neural Information Processing Systems 31
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: The convergence of sparsified gradient methods
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: Volume 2018
year: '2018'
...
---
_id: '66'
abstract:
- lang: eng
text: 'Crypto-currencies are digital assets designed to work as a medium of exchange,
e.g., Bitcoin, but they are susceptible to attacks (dishonest behavior of participants).
A framework for the analysis of attacks in crypto-currencies requires (a) modeling
of game-theoretic aspects to analyze incentives for deviation from honest behavior;
(b) concurrent interactions between participants; and (c) analysis of long-term
monetary gains. Traditional game-theoretic approaches for the analysis of security
protocols consider either qualitative temporal properties such as safety and termination,
or the very special class of one-shot (stateless) games. However, to analyze general
attacks on protocols for crypto-currencies, both stateful analysis and quantitative
objectives are necessary. In this work our main contributions are as follows:
(a) we show how a class of concurrent mean-payo games, namely ergodic games, can
model various attacks that arise naturally in crypto-currencies; (b) we present
the first practical implementation of algorithms for ergodic games that scales
to model realistic problems for crypto-currencies; and (c) we present experimental
results showing that our framework can handle games with thousands of states and
millions of transitions.'
alternative_title:
- LIPIcs
article_number: '11'
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: Amir
full_name: Goharshady, Amir
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Yaron
full_name: Velner, Yaron
last_name: Velner
citation:
ama: 'Chatterjee K, Goharshady AK, Ibsen-Jensen R, Velner Y. Ergodic mean-payoff
games for the analysis of attacks in crypto-currencies. In: Vol 118. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.CONCUR.2018.11'
apa: 'Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., & Velner, Y. (2018).
Ergodic mean-payoff games for the analysis of attacks in crypto-currencies (Vol.
118). Presented at the CONCUR: Conference on Concurrency Theory, Beijing, China:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2018.11'
chicago: Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen,
and Yaron Velner. “Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies,”
Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.CONCUR.2018.11.
ieee: 'K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and Y. Velner, “Ergodic
mean-payoff games for the analysis of attacks in crypto-currencies,” presented
at the CONCUR: Conference on Concurrency Theory, Beijing, China, 2018, vol. 118.'
ista: 'Chatterjee K, Goharshady AK, Ibsen-Jensen R, Velner Y. 2018. Ergodic mean-payoff
games for the analysis of attacks in crypto-currencies. CONCUR: Conference on
Concurrency Theory, LIPIcs, vol. 118, 11.'
mla: Chatterjee, Krishnendu, et al. Ergodic Mean-Payoff Games for the Analysis
of Attacks in Crypto-Currencies. Vol. 118, 11, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2018, doi:10.4230/LIPIcs.CONCUR.2018.11.
short: K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, Y. Velner, in:, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
conference:
end_date: 2018-09-07
location: Beijing, China
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2018-09-04
date_created: 2018-12-11T11:44:27Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2025-06-02T08:53:46Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.CONCUR.2018.11
ec_funded: 1
external_id:
arxiv:
- '1806.03108'
file:
- access_level: open_access
checksum: 68a055b1aaa241cc38375083cf832a7d
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T12:08:00Z
date_updated: 2020-07-14T12:47:34Z
file_id: '5696'
file_name: 2018_CONCUR_Chatterjee.pdf
file_size: 1078309
relation: main_file
file_date_updated: 2020-07-14T12:47:34Z
has_accepted_license: '1'
intvolume: ' 118'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 266EEEC0-B435-11E9-9278-68D0E5697425
name: Quantitative Game-theoretic Analysis of Blockchain Applications and Smart
Contracts
publication_identifier:
isbn:
- 978-3-95977-087-3
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7988'
quality_controlled: '1'
related_material:
record:
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Ergodic mean-payoff games for the analysis of attacks in crypto-currencies
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 118
year: '2018'
...
---
_id: '6664'
abstract:
- lang: eng
text: Reed-Muller (RM) and polar codes are a class of capacity-achieving channel
coding schemes with the same factor graph representation. Low-complexity decoding
algorithms fall short in providing a good error-correction performance for RM
and polar codes. Using the symmetric group of RM and polar codes, the specific
decoding algorithm can be carried out on multiple permutations of the factor graph
to boost the error-correction performance. However, this approach results in high
decoding complexity. In this paper, we first derive the total number of factor
graph permutations on which the decoding can be performed. We further propose
a successive permutation (SP) scheme which finds the permutations on the fly,
thus the decoding always progresses on a single factor graph permutation. We show
that SP can be used to improve the error-correction performance of RM and polar
codes under successive-cancellation (SC) and SC list (SCL) decoding, while keeping
the memory requirements of the decoders unaltered. Our results for RM and polar
codes of length 128 and rate 0.5 show that when SP is used and at a target frame
error rate of 10 -4 , up to 0.5 dB and 0.1 dB improvement can be achieved for
RM and polar codes respectively.
arxiv: 1
author:
- first_name: Seyyed Ali
full_name: Hashemi, Seyyed Ali
last_name: Hashemi
- first_name: Nghia
full_name: Doan, Nghia
last_name: Doan
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: 'Warren '
full_name: 'Gross, Warren '
last_name: Gross
citation:
ama: 'Hashemi SA, Doan N, Mondelli M, Gross W. Decoding Reed-Muller and polar codes
by successive factor graph permutations. In: 2018 IEEE 10th International Symposium
on Turbo Codes & Iterative Information Processing. IEEE; 2018:1-5. doi:10.1109/istc.2018.8625281'
apa: 'Hashemi, S. A., Doan, N., Mondelli, M., & Gross, W. (2018). Decoding Reed-Muller
and polar codes by successive factor graph permutations. In 2018 IEEE 10th
International Symposium on Turbo Codes & Iterative Information Processing
(pp. 1–5). Hong Kong, China: IEEE. https://doi.org/10.1109/istc.2018.8625281'
chicago: Hashemi, Seyyed Ali, Nghia Doan, Marco Mondelli, and Warren Gross. “Decoding
Reed-Muller and Polar Codes by Successive Factor Graph Permutations.” In 2018
IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing,
1–5. IEEE, 2018. https://doi.org/10.1109/istc.2018.8625281.
ieee: S. A. Hashemi, N. Doan, M. Mondelli, and W. Gross, “Decoding Reed-Muller and
polar codes by successive factor graph permutations,” in 2018 IEEE 10th International
Symposium on Turbo Codes & Iterative Information Processing, Hong Kong,
China, 2018, pp. 1–5.
ista: 'Hashemi SA, Doan N, Mondelli M, Gross W. 2018. Decoding Reed-Muller and polar
codes by successive factor graph permutations. 2018 IEEE 10th International Symposium
on Turbo Codes & Iterative Information Processing. ISTC: Symposium on Turbo
Codes & Iterative Information Processing, 1–5.'
mla: Hashemi, Seyyed Ali, et al. “Decoding Reed-Muller and Polar Codes by Successive
Factor Graph Permutations.” 2018 IEEE 10th International Symposium on Turbo
Codes & Iterative Information Processing, IEEE, 2018, pp. 1–5, doi:10.1109/istc.2018.8625281.
short: S.A. Hashemi, N. Doan, M. Mondelli, W. Gross, in:, 2018 IEEE 10th International
Symposium on Turbo Codes & Iterative Information Processing, IEEE, 2018, pp.
1–5.
conference:
end_date: 2018-12-07
location: Hong Kong, China
name: 'ISTC: Symposium on Turbo Codes & Iterative Information Processing'
start_date: 2018-12-03
date_created: 2019-07-23T09:12:43Z
date_published: 2018-12-01T00:00:00Z
date_updated: 2021-01-12T08:08:29Z
day: '01'
doi: 10.1109/istc.2018.8625281
extern: '1'
external_id:
arxiv:
- '1807.03912'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1807.03912
month: '12'
oa: 1
oa_version: Preprint
page: 1-5
publication: 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information
Processing
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: Decoding Reed-Muller and polar codes by successive factor graph permutations
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '6665'
abstract:
- lang: eng
text: We prove that, at least for the binary erasure channel, the polar-coding paradigm
gives rise to codes that not only approach the Shannon limit but, in fact, do
so under the best possible scaling of their block length as a function of the
gap to capacity. This result exhibits the first known family of binary codes that
attain both optimal scaling and quasi-linear complexity of encoding and decoding.
Specifically, for any fixed δ > 0, we exhibit binary linear codes that ensure
reliable communication at rates within ε > 0 of capacity with block length n =
O(1/ε 2+δ ), construction complexity Θ(n), and encoding/decoding complexity Θ(n
log n).
arxiv: 1
author:
- first_name: Arman
full_name: Fazeli, Arman
last_name: Fazeli
- first_name: Hamed
full_name: Hassani, Hamed
last_name: Hassani
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Alexander
full_name: Vardy, Alexander
last_name: Vardy
citation:
ama: 'Fazeli A, Hassani H, Mondelli M, Vardy A. Binary linear codes with optimal
scaling: Polar codes with large kernels. In: 2018 IEEE Information Theory Workshop.
IEEE; 2018:1-5. doi:10.1109/itw.2018.8613428'
apa: 'Fazeli, A., Hassani, H., Mondelli, M., & Vardy, A. (2018). Binary linear
codes with optimal scaling: Polar codes with large kernels. In 2018 IEEE Information
Theory Workshop (pp. 1–5). Guangzhou, China: IEEE. https://doi.org/10.1109/itw.2018.8613428'
chicago: 'Fazeli, Arman, Hamed Hassani, Marco Mondelli, and Alexander Vardy. “Binary
Linear Codes with Optimal Scaling: Polar Codes with Large Kernels.” In 2018
IEEE Information Theory Workshop, 1–5. IEEE, 2018. https://doi.org/10.1109/itw.2018.8613428.'
ieee: 'A. Fazeli, H. Hassani, M. Mondelli, and A. Vardy, “Binary linear codes with
optimal scaling: Polar codes with large kernels,” in 2018 IEEE Information
Theory Workshop, Guangzhou, China, 2018, pp. 1–5.'
ista: 'Fazeli A, Hassani H, Mondelli M, Vardy A. 2018. Binary linear codes with
optimal scaling: Polar codes with large kernels. 2018 IEEE Information Theory
Workshop. ITW: Information Theory Workshop, 1–5.'
mla: 'Fazeli, Arman, et al. “Binary Linear Codes with Optimal Scaling: Polar Codes
with Large Kernels.” 2018 IEEE Information Theory Workshop, IEEE, 2018,
pp. 1–5, doi:10.1109/itw.2018.8613428.'
short: A. Fazeli, H. Hassani, M. Mondelli, A. Vardy, in:, 2018 IEEE Information
Theory Workshop, IEEE, 2018, pp. 1–5.
conference:
end_date: 2018-11-29
location: Guangzhou, China
name: 'ITW: Information Theory Workshop'
start_date: 2018-11-25
date_created: 2019-07-23T11:01:42Z
date_published: 2018-11-01T00:00:00Z
date_updated: 2024-03-07T12:18:50Z
day: '01'
doi: 10.1109/itw.2018.8613428
extern: '1'
external_id:
arxiv:
- '1711.01339'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1711.01339
month: '11'
oa: 1
oa_version: Preprint
page: 1-5
publication: 2018 IEEE Information Theory Workshop
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '9002'
relation: later_version
status: public
status: public
title: 'Binary linear codes with optimal scaling: Polar codes with large kernels'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '6674'
abstract:
- lang: eng
text: Polar codes represent one of the major recent breakthroughs in coding theory
and, because of their attractive features, they have been selected for the incoming
5G standard. As such, a lot of attention has been devoted to the development of
decoding algorithms with good error performance and efficient hardware implementation.
One of the leading candidates in this regard is represented by successive-cancellation
list (SCL) decoding. However, its hardware implementation requires a large amount
of memory. Recently, a partitioned SCL (PSCL) decoder has been proposed to significantly
reduce the memory consumption. In this paper, we consider the paradigm of PSCL
decoding from a practical standpoint, and we provide several improvements. First,
by changing the target signal-to-noise ratio and consequently modifying the construction
of the code, we are able to improve the performance at no additional computational,
latency, or memory cost. Second, we bridge the performance gap between SCL and
PSCL decoding by introducing a generalized PSCL decoder and a layered PSCL decoder.
In this way, we obtain almost the same performance of the SCL decoder with a significantly
lower memory requirement, as testified by hardware implementation results. Third,
we present an optimal scheme to allocate cyclic redundancy checks. Finally, we
provide a lower bound on the list size that guarantees optimal maximum a posteriori
performance for the binary erasure channel.
author:
- first_name: Seyyed Ali
full_name: Hashemi, Seyyed Ali
last_name: Hashemi
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: S. Hamed
full_name: Hassani, S. Hamed
last_name: Hassani
- first_name: Carlo
full_name: Condo, Carlo
last_name: Condo
- first_name: Rudiger L.
full_name: Urbanke, Rudiger L.
last_name: Urbanke
- first_name: Warren J.
full_name: Gross, Warren J.
last_name: Gross
citation:
ama: 'Hashemi SA, Mondelli M, Hassani SH, Condo C, Urbanke RL, Gross WJ. Decoder
partitioning: Towards practical list decoding of polar codes. IEEE Transactions
on Communications. 2018;66(9):3749-3759. doi:10.1109/tcomm.2018.2832207'
apa: 'Hashemi, S. A., Mondelli, M., Hassani, S. H., Condo, C., Urbanke, R. L., &
Gross, W. J. (2018). Decoder partitioning: Towards practical list decoding of
polar codes. IEEE Transactions on Communications. IEEE. https://doi.org/10.1109/tcomm.2018.2832207'
chicago: 'Hashemi, Seyyed Ali, Marco Mondelli, S. Hamed Hassani, Carlo Condo, Rudiger
L. Urbanke, and Warren J. Gross. “Decoder Partitioning: Towards Practical List
Decoding of Polar Codes.” IEEE Transactions on Communications. IEEE, 2018.
https://doi.org/10.1109/tcomm.2018.2832207.'
ieee: 'S. A. Hashemi, M. Mondelli, S. H. Hassani, C. Condo, R. L. Urbanke, and W.
J. Gross, “Decoder partitioning: Towards practical list decoding of polar codes,”
IEEE Transactions on Communications, vol. 66, no. 9. IEEE, pp. 3749–3759,
2018.'
ista: 'Hashemi SA, Mondelli M, Hassani SH, Condo C, Urbanke RL, Gross WJ. 2018.
Decoder partitioning: Towards practical list decoding of polar codes. IEEE Transactions
on Communications. 66(9), 3749–3759.'
mla: 'Hashemi, Seyyed Ali, et al. “Decoder Partitioning: Towards Practical List
Decoding of Polar Codes.” IEEE Transactions on Communications, vol. 66,
no. 9, IEEE, 2018, pp. 3749–59, doi:10.1109/tcomm.2018.2832207.'
short: S.A. Hashemi, M. Mondelli, S.H. Hassani, C. Condo, R.L. Urbanke, W.J. Gross,
IEEE Transactions on Communications 66 (2018) 3749–3759.
date_created: 2019-07-24T08:59:41Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2021-01-12T08:08:31Z
day: '01'
doi: 10.1109/tcomm.2018.2832207
extern: '1'
intvolume: ' 66'
issue: '9'
language:
- iso: eng
month: '09'
oa_version: None
page: 3749-3759
publication: IEEE Transactions on Communications
publication_identifier:
eissn:
- 1558-0857
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: 'Decoder partitioning: Towards practical list decoding of polar codes'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 66
year: '2018'
...
---
_id: '6675'
abstract:
- lang: eng
text: 'We present a coding paradigm that provides a new achievable rate for the
primitive relay channel by combining compress-and-forward and decode-and-forward
with a chaining construction. In the primitive relay channel model, the source
broadcasts a message to the relay and to the destination; and the relay facilitates
this communication by sending an additional message to the destination through
a separate channel. Two well-known coding approaches for this setting are decode-and-forward
and compress-and-forward: in the former, the relay decodes the message and sends
some of the information to the destination; in the latter, the relay does not
attempt to decode, but it sends a compressed description of the received sequence
to the destination via Wyner-Ziv coding. In our scheme, we transmit over pairs
of blocks and we use compress-and-forward for the first block and decode-and-forward
for the second. In particular, in the first block, the relay does not attempt
to decode and it sends only a part of the compressed description of the received
sequence; in the second block, the relay decodes the message and sends this information
plus the remaining part of the compressed sequence relative to the first block.
As a result, we strictly outperform both compress-and- forward and decode-and-forward.
Furthermore, this paradigm can be implemented with a low-complexity polar coding
scheme that has the typical attractive features of polar codes, i.e., quasi-linear
encoding/decoding complexity and super-polynomial decay of the error probability.
Throughout the paper we consider as a running example the special case of the
erasure relay channel and we compare the rates achievable by our proposed scheme
with the existing upper and lower bounds.'
arxiv: 1
author:
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Hamed
full_name: Hassani, Hamed
last_name: Hassani
- first_name: Rudiger
full_name: Urbanke, Rudiger
last_name: Urbanke
citation:
ama: 'Mondelli M, Hassani H, Urbanke R. A new coding paradigm for the primitive
relay channel. In: 2018 IEEE International Symposium on Information Theory.
IEEE; 2018:351-355. doi:10.1109/isit.2018.8437479'
apa: 'Mondelli, M., Hassani, H., & Urbanke, R. (2018). A new coding paradigm
for the primitive relay channel. In 2018 IEEE International Symposium on Information
Theory (pp. 351–355). Vail, CO, United States: IEEE. https://doi.org/10.1109/isit.2018.8437479'
chicago: Mondelli, Marco, Hamed Hassani, and Rudiger Urbanke. “A New Coding Paradigm
for the Primitive Relay Channel.” In 2018 IEEE International Symposium on Information
Theory, 351–55. IEEE, 2018. https://doi.org/10.1109/isit.2018.8437479.
ieee: M. Mondelli, H. Hassani, and R. Urbanke, “A new coding paradigm for the primitive
relay channel,” in 2018 IEEE International Symposium on Information Theory,
Vail, CO, United States, 2018, pp. 351–355.
ista: 'Mondelli M, Hassani H, Urbanke R. 2018. A new coding paradigm for the primitive
relay channel. 2018 IEEE International Symposium on Information Theory. ISIT:
International Symposium on Information Theory , 351–355.'
mla: Mondelli, Marco, et al. “A New Coding Paradigm for the Primitive Relay Channel.”
2018 IEEE International Symposium on Information Theory, IEEE, 2018, pp.
351–55, doi:10.1109/isit.2018.8437479.
short: M. Mondelli, H. Hassani, R. Urbanke, in:, 2018 IEEE International Symposium
on Information Theory, IEEE, 2018, pp. 351–355.
conference:
end_date: 2018-06-22
location: Vail, CO, United States
name: 'ISIT: International Symposium on Information Theory '
start_date: 2018-06-17
date_created: 2019-07-24T09:10:38Z
date_published: 2018-06-16T00:00:00Z
date_updated: 2023-02-23T12:56:49Z
day: '16'
doi: 10.1109/isit.2018.8437479
extern: '1'
external_id:
arxiv:
- '1801.03153'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1801.03153
month: '06'
oa: 1
oa_version: Preprint
page: 351-355
publication: 2018 IEEE International Symposium on Information Theory
publication_identifier:
eissn:
- 2157-8117
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '7007'
relation: later_version
status: public
status: public
title: A new coding paradigm for the primitive relay channel
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '6678'
abstract:
- lang: eng
text: We survey coding techniques that enable reliable transmission at rates that
approach the capacity of an arbitrary discrete memoryless channel. In particular,
we take the point of view of modern coding theory and discuss how recent advances
in coding for symmetric channels help provide more efficient solutions for the
asymmetric case. We consider, in more detail, three basic coding paradigms. The
first one is Gallager's scheme that consists of concatenating a linear code with
a non-linear mapping so that the input distribution can be appropriately shaped.
We explicitly show that both polar codes and spatially coupled codes can be employed
in this scenario. Furthermore, we derive a scaling law between the gap to capacity,
the cardinality of the input and output alphabets, and the required size of the
mapper. The second one is an integrated scheme in which the code is used both
for source coding, in order to create codewords distributed according to the capacity-achieving
input distribution, and for channel coding, in order to provide error protection.
Such a technique has been recently introduced by Honda and Yamamoto in the context
of polar codes, and we show how to apply it also to the design of sparse graph
codes. The third paradigm is based on an idea of Böcherer and Mathar, and separates
the two tasks of source coding and channel coding by a chaining construction that
binds together several codewords. We present conditions for the source code and
the channel code, and we describe how to combine any source code with any channel
code that fulfill those conditions, in order to provide capacity-achieving schemes
for asymmetric channels. In particular, we show that polar codes, spatially coupled
codes, and homophonic codes are suitable as basic building blocks of the proposed
coding strategy. Rather than focusing on the exact details of the schemes, the
purpose of this tutorial is to present different coding techniques that can then
be implemented with many variants. There is no absolute winner and, in order to
understand the most suitable technique for a specific application scenario, we
provide a detailed comparison that takes into account several performance metrics.
article_type: original
arxiv: 1
author:
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Hamed
full_name: Hassani, Hamed
last_name: Hassani
- first_name: 'Rudiger '
full_name: 'Urbanke, Rudiger '
last_name: Urbanke
citation:
ama: Mondelli M, Hassani H, Urbanke R. How to achieve the capacity of asymmetric
channels. IEEE Transactions on Information Theory. 2018;64(5):3371-3393.
doi:10.1109/tit.2018.2789885
apa: Mondelli, M., Hassani, H., & Urbanke, R. (2018). How to achieve the capacity
of asymmetric channels. IEEE Transactions on Information Theory. IEEE.
https://doi.org/10.1109/tit.2018.2789885
chicago: Mondelli, Marco, Hamed Hassani, and Rudiger Urbanke. “How to Achieve the
Capacity of Asymmetric Channels.” IEEE Transactions on Information Theory.
IEEE, 2018. https://doi.org/10.1109/tit.2018.2789885.
ieee: M. Mondelli, H. Hassani, and R. Urbanke, “How to achieve the capacity of asymmetric
channels,” IEEE Transactions on Information Theory, vol. 64, no. 5. IEEE,
pp. 3371–3393, 2018.
ista: Mondelli M, Hassani H, Urbanke R. 2018. How to achieve the capacity of asymmetric
channels. IEEE Transactions on Information Theory. 64(5), 3371–3393.
mla: Mondelli, Marco, et al. “How to Achieve the Capacity of Asymmetric Channels.”
IEEE Transactions on Information Theory, vol. 64, no. 5, IEEE, 2018, pp.
3371–93, doi:10.1109/tit.2018.2789885.
short: M. Mondelli, H. Hassani, R. Urbanke, IEEE Transactions on Information Theory
64 (2018) 3371–3393.
date_created: 2019-07-24T12:38:49Z
date_published: 2018-05-01T00:00:00Z
date_updated: 2023-02-23T12:50:46Z
day: '01'
doi: 10.1109/tit.2018.2789885
extern: '1'
external_id:
arxiv:
- '1406.7373'
intvolume: ' 64'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1406.7373
month: '05'
oa: 1
oa_version: Preprint
page: 3371-3393
publication: IEEE Transactions on Information Theory
publication_identifier:
issn:
- 0018-9448
- 1557-9654
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '6740'
relation: earlier_version
status: public
status: public
title: How to achieve the capacity of asymmetric channels
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 64
year: '2018'
...
---
_id: '67'
abstract:
- lang: eng
text: 'Gene regulatory networks evolve through rewiring of individual components—that
is, through changes in regulatory connections. However, the mechanistic basis
of regulatory rewiring is poorly understood. Using a canonical gene regulatory
system, we quantify the properties of transcription factors that determine the
evolutionary potential for rewiring of regulatory connections: robustness, tunability
and evolvability. In vivo repression measurements of two repressors at mutated
operator sites reveal their contrasting evolutionary potential: while robustness
and evolvability were positively correlated, both were in trade-off with tunability.
Epistatic interactions between adjacent operators alleviated this trade-off. A
thermodynamic model explains how the differences in robustness, tunability and
evolvability arise from biophysical characteristics of repressor–DNA binding.
The model also uncovers that the energy matrix, which describes how mutations
affect repressor–DNA binding, encodes crucial information about the evolutionary
potential of a repressor. The biophysical determinants of evolutionary potential
for regulatory rewiring constitute a mechanistic framework for understanding network
evolution.'
article_processing_charge: No
article_type: original
author:
- first_name: Claudia
full_name: Igler, Claudia
id: 46613666-F248-11E8-B48F-1D18A9856A87
last_name: Igler
- first_name: Mato
full_name: Lagator, Mato
id: 345D25EC-F248-11E8-B48F-1D18A9856A87
last_name: Lagator
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
- first_name: Jonathan P
full_name: Bollback, Jonathan P
id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
last_name: Bollback
orcid: 0000-0002-4624-4612
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
citation:
ama: Igler C, Lagator M, Tkačik G, Bollback JP, Guet CC. Evolutionary potential
of transcription factors for gene regulatory rewiring. Nature Ecology and Evolution.
2018;2(10):1633-1643. doi:10.1038/s41559-018-0651-y
apa: Igler, C., Lagator, M., Tkačik, G., Bollback, J. P., & Guet, C. C. (2018).
Evolutionary potential of transcription factors for gene regulatory rewiring.
Nature Ecology and Evolution. Nature Publishing Group. https://doi.org/10.1038/s41559-018-0651-y
chicago: Igler, Claudia, Mato Lagator, Gašper Tkačik, Jonathan P Bollback, and Calin
C Guet. “Evolutionary Potential of Transcription Factors for Gene Regulatory Rewiring.”
Nature Ecology and Evolution. Nature Publishing Group, 2018. https://doi.org/10.1038/s41559-018-0651-y.
ieee: C. Igler, M. Lagator, G. Tkačik, J. P. Bollback, and C. C. Guet, “Evolutionary
potential of transcription factors for gene regulatory rewiring,” Nature Ecology
and Evolution, vol. 2, no. 10. Nature Publishing Group, pp. 1633–1643, 2018.
ista: Igler C, Lagator M, Tkačik G, Bollback JP, Guet CC. 2018. Evolutionary potential
of transcription factors for gene regulatory rewiring. Nature Ecology and Evolution.
2(10), 1633–1643.
mla: Igler, Claudia, et al. “Evolutionary Potential of Transcription Factors for
Gene Regulatory Rewiring.” Nature Ecology and Evolution, vol. 2, no. 10,
Nature Publishing Group, 2018, pp. 1633–43, doi:10.1038/s41559-018-0651-y.
short: C. Igler, M. Lagator, G. Tkačik, J.P. Bollback, C.C. Guet, Nature Ecology
and Evolution 2 (2018) 1633–1643.
date_created: 2018-12-11T11:44:27Z
date_published: 2018-09-10T00:00:00Z
date_updated: 2024-03-25T23:30:27Z
day: '10'
ddc:
- '570'
department:
- _id: CaGu
- _id: GaTk
- _id: JoBo
doi: 10.1038/s41559-018-0651-y
ec_funded: 1
external_id:
isi:
- '000447947600021'
file:
- access_level: open_access
checksum: 383a2e2c944a856e2e821ec8e7bf71b6
content_type: application/pdf
creator: dernst
date_created: 2020-05-14T11:28:52Z
date_updated: 2020-07-14T12:47:37Z
file_id: '7830'
file_name: 2018_NatureEcology_Igler.pdf
file_size: 1135973
relation: main_file
file_date_updated: 2020-07-14T12:47:37Z
has_accepted_license: '1'
intvolume: ' 2'
isi: 1
issue: '10'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: 1633 - 1643
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 2578D616-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '648440'
name: Selective Barriers to Horizontal Gene Transfer
- _id: 251EE76E-B435-11E9-9278-68D0E5697425
grant_number: '24573'
name: Design principles underlying genetic switch architecture (DOC Fellowship)
publication: Nature Ecology and Evolution
publication_status: published
publisher: Nature Publishing Group
publist_id: '7987'
quality_controlled: '1'
related_material:
record:
- id: '5585'
relation: popular_science
status: public
- id: '6371'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Evolutionary potential of transcription factors for gene regulatory rewiring
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2
year: '2018'
...
---
_id: '6728'
abstract:
- lang: eng
text: Polar codes are a channel coding scheme for the next generation of wireless
communications standard (5G). The belief propagation (BP) decoder allows for parallel
decoding of polar codes, making it suitable for high throughput applications.
However, the error-correction performance of polar codes under BP decoding is
far from the requirements of 5G. It has been shown that the error-correction performance
of BP can be improved if the decoding is performed on multiple permuted factor
graphs of polar codes. However, a different BP decoding scheduling is required
for each factor graph permutation which results in the design of a different decoder
for each permutation. Moreover, the selection of the different factor graph permutations
is at random, which prevents the decoder to achieve a desirable error correction
performance with a small number of permutations. In this paper, we first show
that the permutations on the factor graph can be mapped into suitable permutations
on the codeword positions. As a result, we can make use of a single decoder for
all the permutations. In addition, we introduce a method to construct a set of
predetermined permutations which can provide the correct codeword if the decoding
fails on the original permutation. We show that for the 5G polar code of length
1024, the error-correction performance of the proposed decoder is more than 0.25
dB better than that of the BP decoder with the same number of random permutations
at the frame error rate of 10 -4 .
arxiv: 1
author:
- first_name: Nghia
full_name: Doan, Nghia
last_name: Doan
- first_name: Seyyed Ali
full_name: Hashemi, Seyyed Ali
last_name: Hashemi
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Warren J.
full_name: Gross, Warren J.
last_name: Gross
citation:
ama: 'Doan N, Hashemi SA, Mondelli M, Gross WJ. On the decoding of polar codes on
permuted factor graphs. In: 2018 IEEE Global Communications Conference .
IEEE; 2018. doi:10.1109/glocom.2018.8647308'
apa: 'Doan, N., Hashemi, S. A., Mondelli, M., & Gross, W. J. (2018). On the
decoding of polar codes on permuted factor graphs. In 2018 IEEE Global Communications
Conference . Abu Dhabi, United Arab Emirates: IEEE. https://doi.org/10.1109/glocom.2018.8647308'
chicago: Doan, Nghia, Seyyed Ali Hashemi, Marco Mondelli, and Warren J. Gross. “On
the Decoding of Polar Codes on Permuted Factor Graphs.” In 2018 IEEE Global
Communications Conference . IEEE, 2018. https://doi.org/10.1109/glocom.2018.8647308.
ieee: N. Doan, S. A. Hashemi, M. Mondelli, and W. J. Gross, “On the decoding of
polar codes on permuted factor graphs,” in 2018 IEEE Global Communications
Conference , Abu Dhabi, United Arab Emirates, 2018.
ista: 'Doan N, Hashemi SA, Mondelli M, Gross WJ. 2018. On the decoding of polar
codes on permuted factor graphs. 2018 IEEE Global Communications Conference .
GLOBECOM: Global Communications Conference.'
mla: Doan, Nghia, et al. “On the Decoding of Polar Codes on Permuted Factor Graphs.”
2018 IEEE Global Communications Conference , IEEE, 2018, doi:10.1109/glocom.2018.8647308.
short: N. Doan, S.A. Hashemi, M. Mondelli, W.J. Gross, in:, 2018 IEEE Global Communications
Conference , IEEE, 2018.
conference:
end_date: 2018-12-13
location: Abu Dhabi, United Arab Emirates
name: 'GLOBECOM: Global Communications Conference'
start_date: 2018-12-09
date_created: 2019-07-30T06:43:15Z
date_published: 2018-12-01T00:00:00Z
date_updated: 2021-01-12T08:08:42Z
day: '01'
doi: 10.1109/glocom.2018.8647308
extern: '1'
external_id:
arxiv:
- '1806.11195'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1806.11195
month: '12'
oa: 1
oa_version: Preprint
publication: '2018 IEEE Global Communications Conference '
publication_identifier:
isbn:
- '9781538647271'
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: On the decoding of polar codes on permuted factor graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '6774'
abstract:
- lang: eng
text: "A central problem of algebraic topology is to understand the homotopy groups
\ \U0001D70B\U0001D451(\U0001D44B) of a topological space X. For the computational
version of the problem, it is well known that there is no algorithm to decide
whether the fundamental group \U0001D70B1(\U0001D44B) of a given finite simplicial
complex X is trivial. On the other hand, there are several algorithms that, given
a finite simplicial complex X that is simply connected (i.e., with \U0001D70B1(\U0001D44B)
\ trivial), compute the higher homotopy group \U0001D70B\U0001D451(\U0001D44B)
\ for any given \U0001D451≥2 . However, these algorithms come with a caveat:
They compute the isomorphism type of \U0001D70B\U0001D451(\U0001D44B) , \U0001D451≥2
\ as an abstract finitely generated abelian group given by generators and relations,
but they work with very implicit representations of the elements of \U0001D70B\U0001D451(\U0001D44B)
. Converting elements of this abstract group into explicit geometric maps from
the d-dimensional sphere \U0001D446\U0001D451 to X has been one of the main
unsolved problems in the emerging field of computational homotopy theory. Here
we present an algorithm that, given a simply connected space X, computes \U0001D70B\U0001D451(\U0001D44B)
\ and represents its elements as simplicial maps from a suitable triangulation
of the d-sphere \U0001D446\U0001D451 to X. For fixed d, the algorithm runs
in time exponential in size(\U0001D44B) , the number of simplices of X. Moreover,
we prove that this is optimal: For every fixed \U0001D451≥2 , we construct a
family of simply connected spaces X such that for any simplicial map representing
a generator of \U0001D70B\U0001D451(\U0001D44B) , the size of the triangulation
of \U0001D446\U0001D451 on which the map is defined, is exponential in size(\U0001D44B)
."
article_type: original
author:
- first_name: Marek
full_name: Filakovský, Marek
id: 3E8AF77E-F248-11E8-B48F-1D18A9856A87
last_name: Filakovský
- first_name: Peter
full_name: Franek, Peter
id: 473294AE-F248-11E8-B48F-1D18A9856A87
last_name: Franek
orcid: 0000-0001-8878-8397
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
- first_name: Stephan Y
full_name: Zhechev, Stephan Y
id: 3AA52972-F248-11E8-B48F-1D18A9856A87
last_name: Zhechev
citation:
ama: Filakovský M, Franek P, Wagner U, Zhechev SY. Computing simplicial representatives
of homotopy group elements. Journal of Applied and Computational Topology.
2018;2(3-4):177-231. doi:10.1007/s41468-018-0021-5
apa: Filakovský, M., Franek, P., Wagner, U., & Zhechev, S. Y. (2018). Computing
simplicial representatives of homotopy group elements. Journal of Applied and
Computational Topology. Springer. https://doi.org/10.1007/s41468-018-0021-5
chicago: Filakovský, Marek, Peter Franek, Uli Wagner, and Stephan Y Zhechev. “Computing
Simplicial Representatives of Homotopy Group Elements.” Journal of Applied
and Computational Topology. Springer, 2018. https://doi.org/10.1007/s41468-018-0021-5.
ieee: M. Filakovský, P. Franek, U. Wagner, and S. Y. Zhechev, “Computing simplicial
representatives of homotopy group elements,” Journal of Applied and Computational
Topology, vol. 2, no. 3–4. Springer, pp. 177–231, 2018.
ista: Filakovský M, Franek P, Wagner U, Zhechev SY. 2018. Computing simplicial representatives
of homotopy group elements. Journal of Applied and Computational Topology. 2(3–4),
177–231.
mla: Filakovský, Marek, et al. “Computing Simplicial Representatives of Homotopy
Group Elements.” Journal of Applied and Computational Topology, vol. 2,
no. 3–4, Springer, 2018, pp. 177–231, doi:10.1007/s41468-018-0021-5.
short: M. Filakovský, P. Franek, U. Wagner, S.Y. Zhechev, Journal of Applied and
Computational Topology 2 (2018) 177–231.
date_created: 2019-08-08T06:47:40Z
date_published: 2018-12-01T00:00:00Z
date_updated: 2023-09-07T13:10:36Z
day: '01'
ddc:
- '514'
department:
- _id: UlWa
doi: 10.1007/s41468-018-0021-5
file:
- access_level: open_access
checksum: cf9e7fcd2a113dd4828774fc75cdb7e8
content_type: application/pdf
creator: dernst
date_created: 2019-08-08T06:55:21Z
date_updated: 2020-07-14T12:47:40Z
file_id: '6775'
file_name: 2018_JourAppliedComputTopology_Filakovsky.pdf
file_size: 1056278
relation: main_file
file_date_updated: 2020-07-14T12:47:40Z
has_accepted_license: '1'
intvolume: ' 2'
issue: 3-4
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 177-231
project:
- _id: 25F8B9BC-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M01980
name: Robust invariants of Nonlinear Systems
- _id: 3AC91DDA-15DF-11EA-824D-93A3E7B544D1
call_identifier: FWF
name: FWF Open Access Fund
publication: Journal of Applied and Computational Topology
publication_identifier:
eissn:
- 2367-1734
issn:
- 2367-1726
publication_status: published
publisher: Springer
quality_controlled: '1'
related_material:
record:
- id: '6681'
relation: dissertation_contains
status: public
status: public
title: Computing simplicial representatives of homotopy group elements
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2018'
...
---
_id: '68'
abstract:
- lang: eng
text: The most common assumption made in statistical learning theory is the assumption
of the independent and identically distributed (i.i.d.) data. While being very
convenient mathematically, it is often very clearly violated in practice. This
disparity between the machine learning theory and applications underlies a growing
demand in the development of algorithms that learn from dependent data and theory
that can provide generalization guarantees similar to the independent situations.
This thesis is dedicated to two variants of dependencies that can arise in practice.
One is a dependence on the level of samples in a single learning task. Another
dependency type arises in the multi-task setting when the tasks are dependent
on each other even though the data for them can be i.i.d. In both cases we model
the data (samples or tasks) as stochastic processes and introduce new algorithms
for both settings that take into account and exploit the resulting dependencies.
We prove the theoretical guarantees on the performance of the introduced algorithms
under different evaluation criteria and, in addition, we compliment the theoretical
study by the empirical one, where we evaluate some of the algorithms on two real
world datasets to highlight their practical applicability.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Alexander
full_name: Zimin, Alexander
id: 37099E9C-F248-11E8-B48F-1D18A9856A87
last_name: Zimin
citation:
ama: Zimin A. Learning from dependent data. 2018. doi:10.15479/AT:ISTA:TH1048
apa: Zimin, A. (2018). Learning from dependent data. Institute of Science
and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH1048
chicago: Zimin, Alexander. “Learning from Dependent Data.” Institute of Science
and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH1048.
ieee: A. Zimin, “Learning from dependent data,” Institute of Science and Technology
Austria, 2018.
ista: Zimin A. 2018. Learning from dependent data. Institute of Science and Technology
Austria.
mla: Zimin, Alexander. Learning from Dependent Data. Institute of Science
and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH1048.
short: A. Zimin, Learning from Dependent Data, Institute of Science and Technology
Austria, 2018.
date_created: 2018-12-11T11:44:27Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2023-09-07T12:29:07Z
day: '01'
ddc:
- '004'
- '519'
degree_awarded: PhD
department:
- _id: ChLa
doi: 10.15479/AT:ISTA:TH1048
ec_funded: 1
file:
- access_level: open_access
checksum: e849dd40a915e4d6c5572b51b517f098
content_type: application/pdf
creator: dernst
date_created: 2019-04-09T07:32:47Z
date_updated: 2020-07-14T12:47:40Z
file_id: '6253'
file_name: 2018_Thesis_Zimin.pdf
file_size: 1036137
relation: main_file
- access_level: closed
checksum: da092153cec55c97461bd53c45c5d139
content_type: application/zip
creator: dernst
date_created: 2019-04-09T07:32:47Z
date_updated: 2020-07-14T12:47:40Z
file_id: '6254'
file_name: 2018_Thesis_Zimin_Source.zip
file_size: 637490
relation: source_file
file_date_updated: 2020-07-14T12:47:40Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '92'
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7986'
pubrep_id: '1048'
status: public
supervisor:
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
title: Learning from dependent data
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '69'
abstract:
- lang: eng
text: 'A qubit, a unit of quantum information, is essentially any quantum mechanical
two-level system which can be coherently controlled. Still, to be used for computation,
it has to fulfill criteria. Qubits, regardless of the system in which they are
realized, suffer from decoherence. This leads to loss of the information stored
in the qubit. The upper bound of the time scale on which decoherence happens is
set by the spin relaxation time. In this thesis I studied a two-level system consisting
of a Zeeman-split hole spin confined in a quantum dot formed in a Ge hut wire.
Such Ge hut wires have emerged as a promising material system for the realization
of spin qubits, due to the combination of two significant properties: long spin
coherence time as expected for group IV semiconductors due to the low hyperfine
interaction and a strong valence band spin-orbit coupling. Here, I present how
to fabricate quantum dot devices suitable for electrical transport measurements.
Coupled quantum dot devices allowed the realization of a charge sensor, which
is electrostatically and tunnel coupled to a quantum dot. By integrating the charge
sensor into a radio-frequency reflectometry setup, I performed for the first time
single-shot readout measurements of hole spins and extracted the hole spin relaxation
times in Ge hut wires.'
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Lada
full_name: Vukušić, Lada
id: 31E9F056-F248-11E8-B48F-1D18A9856A87
last_name: Vukušić
orcid: 0000-0003-2424-8636
citation:
ama: Vukušić L. Charge sensing and spin relaxation times of holes in Ge hut wires.
2018. doi:10.15479/AT:ISTA:TH_1047
apa: Vukušić, L. (2018). Charge sensing and spin relaxation times of holes in
Ge hut wires. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_1047
chicago: Vukušić, Lada. “Charge Sensing and Spin Relaxation Times of Holes in Ge
Hut Wires.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH_1047.
ieee: L. Vukušić, “Charge sensing and spin relaxation times of holes in Ge hut wires,”
Institute of Science and Technology Austria, 2018.
ista: Vukušić L. 2018. Charge sensing and spin relaxation times of holes in Ge hut
wires. Institute of Science and Technology Austria.
mla: Vukušić, Lada. Charge Sensing and Spin Relaxation Times of Holes in Ge Hut
Wires. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH_1047.
short: L. Vukušić, Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires,
Institute of Science and Technology Austria, 2018.
date_created: 2018-12-11T11:44:28Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2023-09-26T15:50:22Z
day: '01'
ddc:
- '530'
- '600'
degree_awarded: PhD
department:
- _id: GeKa
- _id: GradSch
doi: 10.15479/AT:ISTA:TH_1047
file:
- access_level: open_access
checksum: c570b656e30749cd65b1c7e13a9ce0a8
content_type: application/pdf
creator: dernst
date_created: 2019-04-09T07:00:40Z
date_updated: 2020-07-14T12:47:44Z
file_id: '6247'
file_name: 2018_Thesis_Vukusic.pdf
file_size: 28452385
relation: main_file
- access_level: closed
checksum: 7856771d9cd401fe0b311191076db6e1
content_type: application/zip
creator: dernst
date_created: 2019-04-09T07:00:40Z
date_updated: 2020-07-14T12:47:44Z
file_id: '6248'
file_name: 2018_Thesis_Vukusic_source.zip
file_size: 53058704
relation: source_file
file_date_updated: 2020-07-14T12:47:44Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '103'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7985'
pubrep_id: '1047'
related_material:
record:
- id: '23'
relation: part_of_dissertation
status: public
- id: '840'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
title: Charge sensing and spin relaxation times of holes in Ge hut wires
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: '690'
abstract:
- lang: eng
text: We consider spectral properties and the edge universality of sparse random
matrices, the class of random matrices that includes the adjacency matrices of
the Erdős–Rényi graph model G(N, p). We prove a local law for the eigenvalue density
up to the spectral edges. Under a suitable condition on the sparsity, we also
prove that the rescaled extremal eigenvalues exhibit GOE Tracy–Widom fluctuations
if a deterministic shift of the spectral edge due to the sparsity is included.
For the adjacency matrix of the Erdős–Rényi graph this establishes the Tracy–Widom
fluctuations of the second largest eigenvalue when p is much larger than N−2/3
with a deterministic shift of order (Np)−1.
article_number: 543-616
arxiv: 1
author:
- first_name: Jii
full_name: Lee, Jii
last_name: Lee
- first_name: Kevin
full_name: Schnelli, Kevin
id: 434AD0AE-F248-11E8-B48F-1D18A9856A87
last_name: Schnelli
orcid: 0000-0003-0954-3231
citation:
ama: Lee J, Schnelli K. Local law and Tracy–Widom limit for sparse random matrices.
Probability Theory and Related Fields. 2018;171(1-2). doi:10.1007/s00440-017-0787-8
apa: Lee, J., & Schnelli, K. (2018). Local law and Tracy–Widom limit for sparse
random matrices. Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-017-0787-8
chicago: Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse
Random Matrices.” Probability Theory and Related Fields. Springer, 2018.
https://doi.org/10.1007/s00440-017-0787-8.
ieee: J. Lee and K. Schnelli, “Local law and Tracy–Widom limit for sparse random
matrices,” Probability Theory and Related Fields, vol. 171, no. 1–2. Springer,
2018.
ista: Lee J, Schnelli K. 2018. Local law and Tracy–Widom limit for sparse random
matrices. Probability Theory and Related Fields. 171(1–2), 543–616.
mla: Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse Random
Matrices.” Probability Theory and Related Fields, vol. 171, no. 1–2, 543–616,
Springer, 2018, doi:10.1007/s00440-017-0787-8.
short: J. Lee, K. Schnelli, Probability Theory and Related Fields 171 (2018).
date_created: 2018-12-11T11:47:56Z
date_published: 2018-06-14T00:00:00Z
date_updated: 2021-01-12T08:09:33Z
day: '14'
department:
- _id: LaEr
doi: 10.1007/s00440-017-0787-8
ec_funded: 1
external_id:
arxiv:
- '1605.08767'
intvolume: ' 171'
issue: 1-2
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1605.08767
month: '06'
oa: 1
oa_version: Preprint
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Probability Theory and Related Fields
publication_status: published
publisher: Springer
publist_id: '7017'
quality_controlled: '1'
scopus_import: 1
status: public
title: Local law and Tracy–Widom limit for sparse random matrices
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 171
year: '2018'
...