---
_id: '737'
abstract:
- lang: eng
text: We generalize Brazas’ topology on the fundamental group to the whole universal
path space X˜ i.e., to the set of homotopy classes of all based paths. We develop
basic properties of the new notion and provide a complete comparison of the obtained
topology with the established topologies, in particular with the Lasso topology
and the CO topology, i.e., the topology that is induced by the compact-open topology.
It turns out that the new topology is the finest topology contained in the CO
topology, for which the action of the fundamental group on the universal path
space is a continuous group action.
article_processing_charge: No
author:
- first_name: Ziga
full_name: Virk, Ziga
id: 2E36B656-F248-11E8-B48F-1D18A9856A87
last_name: Virk
- first_name: Andreas
full_name: Zastrow, Andreas
last_name: Zastrow
citation:
ama: Virk Z, Zastrow A. A new topology on the universal path space. Topology
and its Applications. 2017;231:186-196. doi:10.1016/j.topol.2017.09.015
apa: Virk, Z., & Zastrow, A. (2017). A new topology on the universal path space.
Topology and Its Applications. Elsevier. https://doi.org/10.1016/j.topol.2017.09.015
chicago: Virk, Ziga, and Andreas Zastrow. “A New Topology on the Universal Path
Space.” Topology and Its Applications. Elsevier, 2017. https://doi.org/10.1016/j.topol.2017.09.015.
ieee: Z. Virk and A. Zastrow, “A new topology on the universal path space,” Topology
and its Applications, vol. 231. Elsevier, pp. 186–196, 2017.
ista: Virk Z, Zastrow A. 2017. A new topology on the universal path space. Topology
and its Applications. 231, 186–196.
mla: Virk, Ziga, and Andreas Zastrow. “A New Topology on the Universal Path Space.”
Topology and Its Applications, vol. 231, Elsevier, 2017, pp. 186–96, doi:10.1016/j.topol.2017.09.015.
short: Z. Virk, A. Zastrow, Topology and Its Applications 231 (2017) 186–196.
date_created: 2018-12-11T11:48:14Z
date_published: 2017-11-01T00:00:00Z
date_updated: 2023-09-27T12:53:01Z
day: '01'
department:
- _id: HeEd
doi: 10.1016/j.topol.2017.09.015
external_id:
isi:
- '000413889100012'
intvolume: ' 231'
isi: 1
language:
- iso: eng
month: '11'
oa_version: None
page: 186 - 196
publication: Topology and its Applications
publication_identifier:
issn:
- '01668641'
publication_status: published
publisher: Elsevier
publist_id: '6930'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A new topology on the universal path space
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 231
year: '2017'
...
---
_id: '733'
abstract:
- lang: eng
text: Let A and B be two N by N deterministic Hermitian matrices and let U be an
N by N Haar distributed unitary matrix. It is well known that the spectral distribution
of the sum H = A + UBU∗ converges weakly to the free additive convolution of the
spectral distributions of A and B, as N tends to infinity. We establish the optimal
convergence rate in the bulk of the spectrum.
acknowledgement: Partially supported by ERC Advanced Grant RANMAT No. 338804, Hong
Kong RGC grant ECS 26301517, and the Göran Gustafsson Foundation
article_processing_charge: No
author:
- first_name: Zhigang
full_name: Bao, Zhigang
id: 442E6A6C-F248-11E8-B48F-1D18A9856A87
last_name: Bao
orcid: 0000-0003-3036-1475
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Kevin
full_name: Schnelli, Kevin
id: 434AD0AE-F248-11E8-B48F-1D18A9856A87
last_name: Schnelli
orcid: 0000-0003-0954-3231
citation:
ama: Bao Z, Erdös L, Schnelli K. Convergence rate for spectral distribution of addition
of random matrices. Advances in Mathematics. 2017;319:251-291. doi:10.1016/j.aim.2017.08.028
apa: Bao, Z., Erdös, L., & Schnelli, K. (2017). Convergence rate for spectral
distribution of addition of random matrices. Advances in Mathematics. Academic
Press. https://doi.org/10.1016/j.aim.2017.08.028
chicago: Bao, Zhigang, László Erdös, and Kevin Schnelli. “Convergence Rate for Spectral
Distribution of Addition of Random Matrices.” Advances in Mathematics.
Academic Press, 2017. https://doi.org/10.1016/j.aim.2017.08.028.
ieee: Z. Bao, L. Erdös, and K. Schnelli, “Convergence rate for spectral distribution
of addition of random matrices,” Advances in Mathematics, vol. 319. Academic
Press, pp. 251–291, 2017.
ista: Bao Z, Erdös L, Schnelli K. 2017. Convergence rate for spectral distribution
of addition of random matrices. Advances in Mathematics. 319, 251–291.
mla: Bao, Zhigang, et al. “Convergence Rate for Spectral Distribution of Addition
of Random Matrices.” Advances in Mathematics, vol. 319, Academic Press,
2017, pp. 251–91, doi:10.1016/j.aim.2017.08.028.
short: Z. Bao, L. Erdös, K. Schnelli, Advances in Mathematics 319 (2017) 251–291.
date_created: 2018-12-11T11:48:13Z
date_published: 2017-10-15T00:00:00Z
date_updated: 2023-09-28T11:30:42Z
day: '15'
department:
- _id: LaEr
doi: 10.1016/j.aim.2017.08.028
ec_funded: 1
external_id:
isi:
- '000412150400010'
intvolume: ' 319'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1606.03076
month: '10'
oa: 1
oa_version: Submitted Version
page: 251 - 291
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Advances in Mathematics
publication_status: published
publisher: Academic Press
publist_id: '6935'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Convergence rate for spectral distribution of addition of random matrices
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 319
year: '2017'
...
---
_id: '840'
abstract:
- lang: eng
text: Heavy holes confined in quantum dots are predicted to be promising candidates
for the realization of spin qubits with long coherence times. Here we focus on
such heavy-hole states confined in germanium hut wires. By tuning the growth density
of the latter we can realize a T-like structure between two neighboring wires.
Such a structure allows the realization of a charge sensor, which is electrostatically
and tunnel coupled to a quantum dot, with charge-transfer signals as high as 0.3
e. By integrating the T-like structure into a radiofrequency reflectometry setup,
single-shot measurements allowing the extraction of hole tunneling times are performed.
The extracted tunneling times of less than 10 μs are attributed to the small effective
mass of Ge heavy-hole states and pave the way toward projective spin readout measurements.
acknowledged_ssus:
- _id: M-Shop
article_processing_charge: No
author:
- first_name: Lada
full_name: Vukusic, Lada
id: 31E9F056-F248-11E8-B48F-1D18A9856A87
last_name: Vukusic
orcid: 0000-0003-2424-8636
- first_name: Josip
full_name: Kukucka, Josip
id: 3F5D8856-F248-11E8-B48F-1D18A9856A87
last_name: Kukucka
- first_name: Hannes
full_name: Watzinger, Hannes
id: 35DF8E50-F248-11E8-B48F-1D18A9856A87
last_name: Watzinger
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
citation:
ama: Vukušić L, Kukucka J, Watzinger H, Katsaros G. Fast hole tunneling times in
germanium hut wires probed by single-shot reflectometry. Nano Letters.
2017;17(9):5706-5710. doi:10.1021/acs.nanolett.7b02627
apa: Vukušić, L., Kukucka, J., Watzinger, H., & Katsaros, G. (2017). Fast hole
tunneling times in germanium hut wires probed by single-shot reflectometry. Nano
Letters. American Chemical Society. https://doi.org/10.1021/acs.nanolett.7b02627
chicago: Vukušić, Lada, Josip Kukucka, Hannes Watzinger, and Georgios Katsaros.
“Fast Hole Tunneling Times in Germanium Hut Wires Probed by Single-Shot Reflectometry.”
Nano Letters. American Chemical Society, 2017. https://doi.org/10.1021/acs.nanolett.7b02627.
ieee: L. Vukušić, J. Kukucka, H. Watzinger, and G. Katsaros, “Fast hole tunneling
times in germanium hut wires probed by single-shot reflectometry,” Nano Letters,
vol. 17, no. 9. American Chemical Society, pp. 5706–5710, 2017.
ista: Vukušić L, Kukucka J, Watzinger H, Katsaros G. 2017. Fast hole tunneling times
in germanium hut wires probed by single-shot reflectometry. Nano Letters. 17(9),
5706–5710.
mla: Vukušić, Lada, et al. “Fast Hole Tunneling Times in Germanium Hut Wires Probed
by Single-Shot Reflectometry.” Nano Letters, vol. 17, no. 9, American Chemical
Society, 2017, pp. 5706–10, doi:10.1021/acs.nanolett.7b02627.
short: L. Vukušić, J. Kukucka, H. Watzinger, G. Katsaros, Nano Letters 17 (2017)
5706–5710.
date_created: 2018-12-11T11:48:47Z
date_published: 2017-08-10T00:00:00Z
date_updated: 2023-09-26T15:50:22Z
day: '10'
ddc:
- '539'
department:
- _id: GeKa
doi: 10.1021/acs.nanolett.7b02627
ec_funded: 1
external_id:
isi:
- '000411043500078'
file:
- access_level: open_access
checksum: 761371a0129b2aa442424b9561450ece
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:33Z
date_updated: 2020-07-14T12:48:13Z
file_id: '4951'
file_name: IST-2017-865-v1+1_acs.nanolett.7b02627.pdf
file_size: 2449546
relation: main_file
file_date_updated: 2020-07-14T12:48:13Z
has_accepted_license: '1'
intvolume: ' 17'
isi: 1
issue: '9'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 5706 - 5710
project:
- _id: 25517E86-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '335497'
name: Towards Spin qubits and Majorana fermions in Germanium selfassembled hut-wires
publication: Nano Letters
publication_identifier:
issn:
- '15306984'
publication_status: published
publisher: American Chemical Society
publist_id: '6808'
pubrep_id: '865'
quality_controlled: '1'
related_material:
record:
- id: '7977'
relation: popular_science
- id: '69'
relation: dissertation_contains
status: public
- id: '7996'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Fast hole tunneling times in germanium hut wires probed by single-shot reflectometry
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: 17
year: '2017'
...
---
_id: '914'
abstract:
- lang: eng
text: Infections with potentially lethal pathogens may negatively affect an individual’s
lifespan and decrease its reproductive value. The terminal investment hypothesis
predicts that individuals faced with a reduced survival should invest more into
reproduction instead of maintenance and growth. Several studies suggest that individuals
are indeed able to estimate their body condition and to increase their reproductive
effort with approaching death, while other studies gave ambiguous results. We
investigate whether queens of a perennial social insect (ant) are able to boost
their reproduction following infection with an obligate killing pathogen. Social
insect queens are special with regard to reproduction and aging, as they outlive
conspecific non-reproductive workers. Moreover, in the ant Cardiocondyla obscurior,
fecundity increases with queen age. However, it remained unclear whether this
reflects negative reproductive senescence or terminal investment in response to
approaching death. Here, we test whether queens of C. obscurior react to infection
with the entomopathogenic fungus Metarhizium brunneum by an increased egg-laying
rate. We show that a fungal infection triggers a reinforced investment in reproduction
in queens. This adjustment of the reproductive rate by ant queens is consistent
with predictions of the terminal investment hypothesis and is reported for the
first time in a social insect.
acknowledgement: We thank two anonymous reviewers for helpful suggestions on the manuscript.
article_number: '170547'
article_processing_charge: No
author:
- first_name: Julia
full_name: Giehr, Julia
last_name: Giehr
- first_name: Anna V
full_name: Grasse, Anna V
id: 406F989C-F248-11E8-B48F-1D18A9856A87
last_name: Grasse
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
- first_name: Jürgen
full_name: Heinze, Jürgen
last_name: Heinze
- first_name: Alexandra
full_name: Schrempf, Alexandra
last_name: Schrempf
citation:
ama: Giehr J, Grasse AV, Cremer S, Heinze J, Schrempf A. Ant queens increase their
reproductive efforts after pathogen infection. Royal Society Open Science.
2017;4(7). doi:10.1098/rsos.170547
apa: Giehr, J., Grasse, A. V., Cremer, S., Heinze, J., & Schrempf, A. (2017).
Ant queens increase their reproductive efforts after pathogen infection. Royal
Society Open Science. Royal Society, The. https://doi.org/10.1098/rsos.170547
chicago: Giehr, Julia, Anna V Grasse, Sylvia Cremer, Jürgen Heinze, and Alexandra
Schrempf. “Ant Queens Increase Their Reproductive Efforts after Pathogen Infection.”
Royal Society Open Science. Royal Society, The, 2017. https://doi.org/10.1098/rsos.170547.
ieee: J. Giehr, A. V. Grasse, S. Cremer, J. Heinze, and A. Schrempf, “Ant queens
increase their reproductive efforts after pathogen infection,” Royal Society
Open Science, vol. 4, no. 7. Royal Society, The, 2017.
ista: Giehr J, Grasse AV, Cremer S, Heinze J, Schrempf A. 2017. Ant queens increase
their reproductive efforts after pathogen infection. Royal Society Open Science.
4(7), 170547.
mla: Giehr, Julia, et al. “Ant Queens Increase Their Reproductive Efforts after
Pathogen Infection.” Royal Society Open Science, vol. 4, no. 7, 170547,
Royal Society, The, 2017, doi:10.1098/rsos.170547.
short: J. Giehr, A.V. Grasse, S. Cremer, J. Heinze, A. Schrempf, Royal Society Open
Science 4 (2017).
date_created: 2018-12-11T11:49:10Z
date_published: 2017-07-05T00:00:00Z
date_updated: 2023-09-26T15:45:47Z
day: '05'
ddc:
- '576'
- '592'
department:
- _id: SyCr
doi: 10.1098/rsos.170547
external_id:
isi:
- '000406670000025'
file:
- access_level: open_access
checksum: 351ae5e7a37e6e7d9295cd41146c4190
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:24Z
date_updated: 2020-07-14T12:48:15Z
file_id: '4684'
file_name: IST-2017-849-v1+1_2017_Grasse_Cremer_AntQueens.pdf
file_size: 530412
relation: main_file
file_date_updated: 2020-07-14T12:48:15Z
has_accepted_license: '1'
intvolume: ' 4'
isi: 1
issue: '7'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication: Royal Society Open Science
publication_identifier:
issn:
- '20545703'
publication_status: published
publisher: Royal Society, The
publist_id: '6527'
pubrep_id: '849'
quality_controlled: '1'
related_material:
record:
- id: '9853'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Ant queens increase their reproductive efforts after pathogen infection
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: 4
year: '2017'
...
---
_id: '910'
abstract:
- lang: eng
text: "Frequency-independent selection is generally considered as a force that acts
to reduce the genetic variation in evolving populations, yet rigorous arguments
for this idea are scarce. When selection fluctuates in time, it is unclear whether
frequency-independent selection may maintain genetic polymorphism without invoking
additional mechanisms. We show that constant frequency-independent selection with
arbitrary epistasis on a well-mixed haploid population eliminates genetic variation
if we assume linkage equilibrium between alleles. To this end, we introduce the
notion of frequency-independent selection at the level of alleles, which is sufficient
to prove our claim and contains the notion of frequency-independent selection
on haploids. When selection and recombination are weak but of the same order,
there may be strong linkage disequilibrium; numerical calculations show that stable
equilibria are highly unlikely. Using the example of a diallelic two-locus model,
we then demonstrate that frequency-independent selection that fluctuates in time
can maintain stable polymorphism if linkage disequilibrium changes its sign periodically.
We put our findings in the context of results from the existing literature and
point out those scenarios in which the possible role of frequency-independent
selection in maintaining genetic variation remains unclear.\r\n"
article_processing_charge: No
author:
- first_name: Sebastian
full_name: Novak, Sebastian
id: 461468AE-F248-11E8-B48F-1D18A9856A87
last_name: Novak
orcid: 0000-0002-2519-824X
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: Novak S, Barton NH. When does frequency-independent selection maintain genetic
variation? Genetics. 2017;207(2):653-668. doi:10.1534/genetics.117.300129
apa: Novak, S., & Barton, N. H. (2017). When does frequency-independent selection
maintain genetic variation? Genetics. Genetics Society of America. https://doi.org/10.1534/genetics.117.300129
chicago: Novak, Sebastian, and Nicholas H Barton. “When Does Frequency-Independent
Selection Maintain Genetic Variation?” Genetics. Genetics Society of America,
2017. https://doi.org/10.1534/genetics.117.300129.
ieee: S. Novak and N. H. Barton, “When does frequency-independent selection maintain
genetic variation?,” Genetics, vol. 207, no. 2. Genetics Society of America,
pp. 653–668, 2017.
ista: Novak S, Barton NH. 2017. When does frequency-independent selection maintain
genetic variation? Genetics. 207(2), 653–668.
mla: Novak, Sebastian, and Nicholas H. Barton. “When Does Frequency-Independent
Selection Maintain Genetic Variation?” Genetics, vol. 207, no. 2, Genetics
Society of America, 2017, pp. 653–68, doi:10.1534/genetics.117.300129.
short: S. Novak, N.H. Barton, Genetics 207 (2017) 653–668.
date_created: 2018-12-11T11:49:09Z
date_published: 2017-10-01T00:00:00Z
date_updated: 2023-09-26T15:49:15Z
day: '01'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.1534/genetics.117.300129
ec_funded: 1
external_id:
isi:
- '000412232600019'
file:
- access_level: open_access
checksum: f7c32dabf52e6d9e709d9203761e39fd
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:12Z
date_updated: 2020-07-14T12:48:15Z
file_id: '5264'
file_name: IST-2018-974-v1+1_manuscript.pdf
file_size: 494268
relation: main_file
file_date_updated: 2020-07-14T12:48:15Z
has_accepted_license: '1'
intvolume: ' 207'
isi: 1
issue: '2'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 653 - 668
project:
- _id: 25B1EC9E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '618091'
name: Speed of Adaptation in Population Genetics and Evolutionary Computation
publication: Genetics
publication_status: published
publisher: Genetics Society of America
publist_id: '6533'
pubrep_id: '974'
quality_controlled: '1'
scopus_import: '1'
status: public
title: When does frequency-independent selection maintain genetic variation?
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 207
year: '2017'
...
---
_id: '835'
abstract:
- lang: eng
text: An outstanding question in animal development, tissue homeostasis and disease
is how cell populations adapt to sensory inputs. During Drosophila larval development,
hematopoietic sites are in direct contact with sensory neuron clusters of the
peripheral nervous system (PNS), and blood cells (hemocytes) require the PNS for
their survival and recruitment to these microenvironments, known as Hematopoietic
Pockets. Here we report that Activin-β, a TGF-β family ligand, is expressed by
sensory neurons of the PNS and regulates the proliferation and adhesion of hemocytes.
These hemocyte responses depend on PNS activity, as shown by agonist treatment
and transient silencing of sensory neurons. Activin-β has a key role in this regulation,
which is apparent from reporter expression and mutant analyses. This mechanism
of local sensory neurons controlling blood cell adaptation invites evolutionary
parallels with vertebrate hematopoietic progenitors and the independent myeloid
system of tissue macrophages, whose regulation by local microenvironments remain
undefined.
article_number: '15990'
article_processing_charge: No
author:
- first_name: Kalpana
full_name: Makhijani, Kalpana
last_name: Makhijani
- first_name: Brandy
full_name: Alexander, Brandy
last_name: Alexander
- first_name: Deepti
full_name: Rao, Deepti
last_name: Rao
- first_name: Sophia
full_name: Petraki, Sophia
last_name: Petraki
- first_name: Leire
full_name: Herboso, Leire
last_name: Herboso
- first_name: Katelyn
full_name: Kukar, Katelyn
last_name: Kukar
- first_name: Itrat
full_name: Batool, Itrat
last_name: Batool
- first_name: Stephanie
full_name: Wachner, Stephanie
id: 2A95E7B0-F248-11E8-B48F-1D18A9856A87
last_name: Wachner
- first_name: Katrina
full_name: Gold, Katrina
last_name: Gold
- first_name: Corinna
full_name: Wong, Corinna
last_name: Wong
- first_name: Michael
full_name: O'Connor, Michael
last_name: O'Connor
- first_name: Katja
full_name: Brückner, Katja
last_name: Brückner
citation:
ama: Makhijani K, Alexander B, Rao D, et al. Regulation of Drosophila hematopoietic
sites by Activin-β from active sensory neurons. Nature Communications.
2017;8. doi:10.1038/ncomms15990
apa: Makhijani, K., Alexander, B., Rao, D., Petraki, S., Herboso, L., Kukar, K.,
… Brückner, K. (2017). Regulation of Drosophila hematopoietic sites by Activin-β
from active sensory neurons. Nature Communications. Nature Publishing Group.
https://doi.org/10.1038/ncomms15990
chicago: Makhijani, Kalpana, Brandy Alexander, Deepti Rao, Sophia Petraki, Leire
Herboso, Katelyn Kukar, Itrat Batool, et al. “Regulation of Drosophila Hematopoietic
Sites by Activin-β from Active Sensory Neurons.” Nature Communications.
Nature Publishing Group, 2017. https://doi.org/10.1038/ncomms15990.
ieee: K. Makhijani et al., “Regulation of Drosophila hematopoietic sites
by Activin-β from active sensory neurons,” Nature Communications, vol.
8. Nature Publishing Group, 2017.
ista: Makhijani K, Alexander B, Rao D, Petraki S, Herboso L, Kukar K, Batool I,
Wachner S, Gold K, Wong C, O’Connor M, Brückner K. 2017. Regulation of Drosophila
hematopoietic sites by Activin-β from active sensory neurons. Nature Communications.
8, 15990.
mla: Makhijani, Kalpana, et al. “Regulation of Drosophila Hematopoietic Sites by
Activin-β from Active Sensory Neurons.” Nature Communications, vol. 8,
15990, Nature Publishing Group, 2017, doi:10.1038/ncomms15990.
short: K. Makhijani, B. Alexander, D. Rao, S. Petraki, L. Herboso, K. Kukar, I.
Batool, S. Wachner, K. Gold, C. Wong, M. O’Connor, K. Brückner, Nature Communications
8 (2017).
date_created: 2018-12-11T11:48:45Z
date_published: 2017-07-27T00:00:00Z
date_updated: 2023-09-26T15:51:28Z
day: '27'
ddc:
- '570'
- '576'
- '616'
doi: 10.1038/ncomms15990
extern: '1'
external_id:
isi:
- '000406360100001'
file:
- access_level: open_access
checksum: 99a3d63308d4250eda0a35341171f80e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:32Z
date_updated: 2020-07-14T12:48:12Z
file_id: '5153'
file_name: IST-2017-859-v1+1_ncomms15990.pdf
file_size: 3027104
relation: main_file
file_date_updated: 2020-07-14T12:48:12Z
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication: Nature Communications
publication_identifier:
issn:
- '20411723'
publication_status: published
publisher: Nature Publishing Group
publist_id: '6813'
pubrep_id: '859'
quality_controlled: '1'
status: public
title: Regulation of Drosophila hematopoietic sites by Activin-β from active sensory
neurons
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 8
year: '2017'
...
---
_id: '836'
abstract:
- lang: eng
text: Recent research has examined how to study the topological features of a continuous
self-map by means of the persistence of the eigenspaces, for given eigenvalues,
of the endomorphism induced in homology over a field. This raised the question
of how to select dynamically significant eigenvalues. The present paper aims to
answer this question, giving an algorithm that computes the persistence of eigenspaces
for every eigenvalue simultaneously, also expressing said eigenspaces as direct
sums of “finite” and “singular” subspaces.
alternative_title:
- PROMS
article_processing_charge: No
author:
- first_name: Marc
full_name: Ethier, Marc
last_name: Ethier
- first_name: Grzegorz
full_name: Jablonski, Grzegorz
id: 4483EF78-F248-11E8-B48F-1D18A9856A87
last_name: Jablonski
orcid: 0000-0002-3536-9866
- first_name: Marian
full_name: Mrozek, Marian
last_name: Mrozek
citation:
ama: 'Ethier M, Jablonski G, Mrozek M. Finding eigenvalues of self-maps with the
Kronecker canonical form. In: Special Sessions in Applications of Computer
Algebra. Vol 198. Springer; 2017:119-136. doi:10.1007/978-3-319-56932-1_8'
apa: 'Ethier, M., Jablonski, G., & Mrozek, M. (2017). Finding eigenvalues of
self-maps with the Kronecker canonical form. In Special Sessions in Applications
of Computer Algebra (Vol. 198, pp. 119–136). Kalamata, Greece: Springer. https://doi.org/10.1007/978-3-319-56932-1_8'
chicago: Ethier, Marc, Grzegorz Jablonski, and Marian Mrozek. “Finding Eigenvalues
of Self-Maps with the Kronecker Canonical Form.” In Special Sessions in Applications
of Computer Algebra, 198:119–36. Springer, 2017. https://doi.org/10.1007/978-3-319-56932-1_8.
ieee: M. Ethier, G. Jablonski, and M. Mrozek, “Finding eigenvalues of self-maps
with the Kronecker canonical form,” in Special Sessions in Applications of
Computer Algebra, Kalamata, Greece, 2017, vol. 198, pp. 119–136.
ista: 'Ethier M, Jablonski G, Mrozek M. 2017. Finding eigenvalues of self-maps with
the Kronecker canonical form. Special Sessions in Applications of Computer Algebra.
ACA: Applications of Computer Algebra, PROMS, vol. 198, 119–136.'
mla: Ethier, Marc, et al. “Finding Eigenvalues of Self-Maps with the Kronecker Canonical
Form.” Special Sessions in Applications of Computer Algebra, vol. 198,
Springer, 2017, pp. 119–36, doi:10.1007/978-3-319-56932-1_8.
short: M. Ethier, G. Jablonski, M. Mrozek, in:, Special Sessions in Applications
of Computer Algebra, Springer, 2017, pp. 119–136.
conference:
end_date: 2015-07-23
location: Kalamata, Greece
name: 'ACA: Applications of Computer Algebra'
start_date: 2015-07-20
date_created: 2018-12-11T11:48:46Z
date_published: 2017-07-27T00:00:00Z
date_updated: 2023-09-26T15:50:52Z
day: '27'
department:
- _id: HeEd
doi: 10.1007/978-3-319-56932-1_8
ec_funded: 1
external_id:
isi:
- '000434088200008'
intvolume: ' 198'
isi: 1
language:
- iso: eng
month: '07'
oa_version: None
page: 119 - 136
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
publication: Special Sessions in Applications of Computer Algebra
publication_identifier:
isbn:
- 978-331956930-7
publication_status: published
publisher: Springer
publist_id: '6812'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Finding eigenvalues of self-maps with the Kronecker canonical form
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 198
year: '2017'
...
---
_id: '916'
abstract:
- lang: eng
text: We study the quadratic assignment problem, in computer vision also known as
graph matching. Two leading solvers for this problem optimize the Lagrange decomposition
duals with sub-gradient and dual ascent (also known as message passing) updates.
We explore this direction further and propose several additional Lagrangean relaxations
of the graph matching problem along with corresponding algorithms, which are all
based on a common dual ascent framework. Our extensive empirical evaluation gives
several theoretical insights and suggests a new state-of-the-art anytime solver
for the considered problem. Our improvement over state-of-the-art is particularly
visible on a new dataset with large-scale sparse problem instances containing
more than 500 graph nodes each.
article_processing_charge: No
author:
- first_name: Paul
full_name: Swoboda, Paul
id: 446560C6-F248-11E8-B48F-1D18A9856A87
last_name: Swoboda
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
- first_name: Carsten
full_name: Abu Alhaija, Carsten
last_name: Abu Alhaija
- first_name: Dagmar
full_name: Kainmueller, Dagmar
last_name: Kainmueller
- first_name: Bogdan
full_name: Savchynskyy, Bogdan
last_name: Savchynskyy
citation:
ama: 'Swoboda P, Rother C, Abu Alhaija C, Kainmueller D, Savchynskyy B. A study
of lagrangean decompositions and dual ascent solvers for graph matching. In: Vol
2017. IEEE; 2017:7062-7071. doi:10.1109/CVPR.2017.747'
apa: 'Swoboda, P., Rother, C., Abu Alhaija, C., Kainmueller, D., & Savchynskyy,
B. (2017). A study of lagrangean decompositions and dual ascent solvers for graph
matching (Vol. 2017, pp. 7062–7071). Presented at the CVPR: Computer Vision and
Pattern Recognition, Honolulu, HA, United States: IEEE. https://doi.org/10.1109/CVPR.2017.747'
chicago: Swoboda, Paul, Carsten Rother, Carsten Abu Alhaija, Dagmar Kainmueller,
and Bogdan Savchynskyy. “A Study of Lagrangean Decompositions and Dual Ascent
Solvers for Graph Matching,” 2017:7062–71. IEEE, 2017. https://doi.org/10.1109/CVPR.2017.747.
ieee: 'P. Swoboda, C. Rother, C. Abu Alhaija, D. Kainmueller, and B. Savchynskyy,
“A study of lagrangean decompositions and dual ascent solvers for graph matching,”
presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA,
United States, 2017, vol. 2017, pp. 7062–7071.'
ista: 'Swoboda P, Rother C, Abu Alhaija C, Kainmueller D, Savchynskyy B. 2017. A
study of lagrangean decompositions and dual ascent solvers for graph matching.
CVPR: Computer Vision and Pattern Recognition vol. 2017, 7062–7071.'
mla: Swoboda, Paul, et al. A Study of Lagrangean Decompositions and Dual Ascent
Solvers for Graph Matching. Vol. 2017, IEEE, 2017, pp. 7062–71, doi:10.1109/CVPR.2017.747.
short: P. Swoboda, C. Rother, C. Abu Alhaija, D. Kainmueller, B. Savchynskyy, in:,
IEEE, 2017, pp. 7062–7071.
conference:
end_date: 2017-07-26
location: Honolulu, HA, United States
name: 'CVPR: Computer Vision and Pattern Recognition'
start_date: 2017-07-21
date_created: 2018-12-11T11:49:11Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2023-09-26T15:41:40Z
day: '01'
ddc:
- '000'
department:
- _id: VlKo
doi: 10.1109/CVPR.2017.747
ec_funded: 1
external_id:
isi:
- '000418371407018'
file:
- access_level: open_access
checksum: e38a2740daad1ea178465843b5072906
content_type: application/pdf
creator: dernst
date_created: 2019-01-18T12:49:38Z
date_updated: 2020-07-14T12:48:15Z
file_id: '5848'
file_name: 2017_CVPR_Swoboda2.pdf
file_size: 944332
relation: main_file
file_date_updated: 2020-07-14T12:48:15Z
has_accepted_license: '1'
intvolume: ' 2017'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 7062-7071
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication_identifier:
isbn:
- 978-153860457-1
publication_status: published
publisher: IEEE
publist_id: '6525'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A study of lagrangean decompositions and dual ascent solvers for graph matching
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2017
year: '2017'
...
---
_id: '915'
abstract:
- lang: eng
text: We propose a dual decomposition and linear program relaxation of the NP-hard
minimum cost multicut problem. Unlike other polyhedral relaxations of the multicut
polytope, it is amenable to efficient optimization by message passing. Like other
polyhedral relaxations, it can be tightened efficiently by cutting planes. We
define an algorithm that alternates between message passing and efficient separation
of cycle- and odd-wheel inequalities. This algorithm is more efficient than state-of-the-art
algorithms based on linear programming, including algorithms written in the framework
of leading commercial software, as we show in experiments with large instances
of the problem from applications in computer vision, biomedical image analysis
and data mining.
article_processing_charge: No
author:
- first_name: Paul
full_name: Swoboda, Paul
id: 446560C6-F248-11E8-B48F-1D18A9856A87
last_name: Swoboda
- first_name: Bjoern
full_name: Andres, Bjoern
last_name: Andres
citation:
ama: 'Swoboda P, Andres B. A message passing algorithm for the minimum cost multicut
problem. In: Vol 2017. IEEE; 2017:4990-4999. doi:10.1109/CVPR.2017.530'
apa: 'Swoboda, P., & Andres, B. (2017). A message passing algorithm for the
minimum cost multicut problem (Vol. 2017, pp. 4990–4999). Presented at the CVPR:
Computer Vision and Pattern Recognition, Honolulu, HA, United States: IEEE. https://doi.org/10.1109/CVPR.2017.530'
chicago: Swoboda, Paul, and Bjoern Andres. “A Message Passing Algorithm for the
Minimum Cost Multicut Problem,” 2017:4990–99. IEEE, 2017. https://doi.org/10.1109/CVPR.2017.530.
ieee: 'P. Swoboda and B. Andres, “A message passing algorithm for the minimum cost
multicut problem,” presented at the CVPR: Computer Vision and Pattern Recognition,
Honolulu, HA, United States, 2017, vol. 2017, pp. 4990–4999.'
ista: 'Swoboda P, Andres B. 2017. A message passing algorithm for the minimum cost
multicut problem. CVPR: Computer Vision and Pattern Recognition vol. 2017, 4990–4999.'
mla: Swoboda, Paul, and Bjoern Andres. A Message Passing Algorithm for the Minimum
Cost Multicut Problem. Vol. 2017, IEEE, 2017, pp. 4990–99, doi:10.1109/CVPR.2017.530.
short: P. Swoboda, B. Andres, in:, IEEE, 2017, pp. 4990–4999.
conference:
end_date: 2017-07-26
location: Honolulu, HA, United States
name: 'CVPR: Computer Vision and Pattern Recognition'
start_date: 2017-07-21
date_created: 2018-12-11T11:49:11Z
date_published: 2017-07-01T00:00:00Z
date_updated: 2023-09-26T15:43:27Z
day: '01'
ddc:
- '000'
department:
- _id: VlKo
doi: 10.1109/CVPR.2017.530
ec_funded: 1
external_id:
isi:
- '000418371405009'
file:
- access_level: open_access
checksum: 7e51dacefa693574581a32da3eff63dc
content_type: application/pdf
creator: dernst
date_created: 2019-01-18T12:52:46Z
date_updated: 2020-07-14T12:48:15Z
file_id: '5849'
file_name: Swoboda_A_Message_Passing_CVPR_2017_paper.pdf
file_size: 883264
relation: main_file
file_date_updated: 2020-07-14T12:48:15Z
has_accepted_license: '1'
intvolume: ' 2017'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 4990-4999
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication_identifier:
isbn:
- 978-153860457-1
publication_status: published
publisher: IEEE
publist_id: '6526'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A message passing algorithm for the minimum cost multicut problem
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2017
year: '2017'
...
---
_id: '917'
abstract:
- lang: eng
text: We propose a general dual ascent framework for Lagrangean decomposition
of combinatorial problems. Although methods of this type have shown their efficiency
for a number of problems, so far there was no general algorithm applicable to
multiple problem types. In this work, we propose such a general algorithm. It
depends on several parameters, which can be used to optimize its performance in
each particular setting. We demonstrate efficacy of our method on graph matching
and multicut problems, where it outperforms state-of-the-art solvers including
those based on subgradient optimization and off-the-shelf linear programming solvers.
article_processing_charge: No
author:
- first_name: Paul
full_name: Swoboda, Paul
id: 446560C6-F248-11E8-B48F-1D18A9856A87
last_name: Swoboda
- first_name: Jan
full_name: Kuske, Jan
last_name: Kuske
- first_name: Bogdan
full_name: Savchynskyy, Bogdan
last_name: Savchynskyy
citation:
ama: 'Swoboda P, Kuske J, Savchynskyy B. A dual ascent framework for Lagrangean
decomposition of combinatorial problems. In: Vol 2017. IEEE; 2017:4950-4960. doi:10.1109/CVPR.2017.526'
apa: 'Swoboda, P., Kuske, J., & Savchynskyy, B. (2017). A dual ascent framework
for Lagrangean decomposition of combinatorial problems (Vol. 2017, pp. 4950–4960).
Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA,
United States: IEEE. https://doi.org/10.1109/CVPR.2017.526'
chicago: Swoboda, Paul, Jan Kuske, and Bogdan Savchynskyy. “A Dual Ascent Framework
for Lagrangean Decomposition of Combinatorial Problems,” 2017:4950–60. IEEE, 2017.
https://doi.org/10.1109/CVPR.2017.526.
ieee: 'P. Swoboda, J. Kuske, and B. Savchynskyy, “A dual ascent framework for Lagrangean
decomposition of combinatorial problems,” presented at the CVPR: Computer Vision
and Pattern Recognition, Honolulu, HA, United States, 2017, vol. 2017, pp. 4950–4960.'
ista: 'Swoboda P, Kuske J, Savchynskyy B. 2017. A dual ascent framework for Lagrangean
decomposition of combinatorial problems. CVPR: Computer Vision and Pattern Recognition
vol. 2017, 4950–4960.'
mla: Swoboda, Paul, et al. A Dual Ascent Framework for Lagrangean Decomposition
of Combinatorial Problems. Vol. 2017, IEEE, 2017, pp. 4950–60, doi:10.1109/CVPR.2017.526.
short: P. Swoboda, J. Kuske, B. Savchynskyy, in:, IEEE, 2017, pp. 4950–4960.
conference:
end_date: 2017-07-26
location: Honolulu, HA, United States
name: 'CVPR: Computer Vision and Pattern Recognition'
start_date: 2017-07-21
date_created: 2018-12-11T11:49:11Z
date_published: 2017-07-01T00:00:00Z
date_updated: 2023-09-26T15:41:11Z
day: '01'
ddc:
- '000'
department:
- _id: VlKo
doi: 10.1109/CVPR.2017.526
ec_funded: 1
external_id:
isi:
- '000418371405005'
file:
- access_level: open_access
checksum: 72fd291046bd8e5717961bd68f6b6f03
content_type: application/pdf
creator: dernst
date_created: 2019-01-18T12:45:55Z
date_updated: 2020-07-14T12:48:15Z
file_id: '5847'
file_name: 2017_CVPR_Swoboda.pdf
file_size: 898652
relation: main_file
file_date_updated: 2020-07-14T12:48:15Z
has_accepted_license: '1'
intvolume: ' 2017'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 4950-4960
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication_identifier:
isbn:
- 978-153860457-1
publication_status: published
publisher: IEEE
publist_id: '6524'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A dual ascent framework for Lagrangean decomposition of combinatorial problems
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2017
year: '2017'
...