---
_id: '10190'
abstract:
- lang: eng
text: 'The verification of concurrent programs remains an open challenge, as thread
interaction has to be accounted for, which leads to state-space explosion. Stateless
model checking battles this problem by exploring traces rather than states of
the program. As there are exponentially many traces, dynamic partial-order reduction
(DPOR) techniques are used to partition the trace space into equivalence classes,
and explore a few representatives from each class. The standard equivalence that
underlies most DPOR techniques is the happens-before equivalence, however recent
works have spawned a vivid interest towards coarser equivalences. The efficiency
of such approaches is a product of two parameters: (i) the size of the partitioning
induced by the equivalence, and (ii) the time spent by the exploration algorithm
in each class of the partitioning. In this work, we present a new equivalence,
called value-happens-before and show that it has two appealing features. First,
value-happens-before is always at least as coarse as the happens-before equivalence,
and can be even exponentially coarser. Second, the value-happens-before partitioning
is efficiently explorable when the number of threads is bounded. We present an
algorithm called value-centric DPOR (VCDPOR), which explores the underlying partitioning
using polynomial time per class. Finally, we perform an experimental evaluation
of VCDPOR on various benchmarks, and compare it against other state-of-the-art
approaches. Our results show that value-happens-before typically induces a significant
reduction in the size of the underlying partitioning, which leads to a considerable
reduction in the running time for exploring the whole partitioning.'
acknowledgement: "The authors would also like to thank anonymous referees for their
valuable comments and helpful suggestions. This work is supported by the Austrian
Science Fund (FWF) NFN grants S11407-N23 (RiSE/SHiNE) and S11402-N23 (RiSE/SHiNE),
by the Vienna Science and Technology Fund (WWTF) Project ICT15-003, and by the Austrian
Science Fund (FWF) Schrodinger grant J-4220.\r\n"
article_number: '124'
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Viktor
full_name: Toman, Viktor
id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87
last_name: Toman
orcid: 0000-0001-9036-063X
citation:
ama: 'Chatterjee K, Pavlogiannis A, Toman V. Value-centric dynamic partial order
reduction. In: Proceedings of the 34th ACM International Conference on Object-Oriented
Programming, Systems, Languages, and Applications. Vol 3. ACM; 2019. doi:10.1145/3360550'
apa: 'Chatterjee, K., Pavlogiannis, A., & Toman, V. (2019). Value-centric dynamic
partial order reduction. In Proceedings of the 34th ACM International Conference
on Object-Oriented Programming, Systems, Languages, and Applications (Vol.
3). Athens, Greece: ACM. https://doi.org/10.1145/3360550'
chicago: Chatterjee, Krishnendu, Andreas Pavlogiannis, and Viktor Toman. “Value-Centric
Dynamic Partial Order Reduction.” In Proceedings of the 34th ACM International
Conference on Object-Oriented Programming, Systems, Languages, and Applications,
Vol. 3. ACM, 2019. https://doi.org/10.1145/3360550.
ieee: K. Chatterjee, A. Pavlogiannis, and V. Toman, “Value-centric dynamic partial
order reduction,” in Proceedings of the 34th ACM International Conference on
Object-Oriented Programming, Systems, Languages, and Applications, Athens,
Greece, 2019, vol. 3.
ista: 'Chatterjee K, Pavlogiannis A, Toman V. 2019. Value-centric dynamic partial
order reduction. Proceedings of the 34th ACM International Conference on Object-Oriented
Programming, Systems, Languages, and Applications. OOPSLA: Object-oriented Programming,
Systems, Languages and Applications vol. 3, 124.'
mla: Chatterjee, Krishnendu, et al. “Value-Centric Dynamic Partial Order Reduction.”
Proceedings of the 34th ACM International Conference on Object-Oriented Programming,
Systems, Languages, and Applications, vol. 3, 124, ACM, 2019, doi:10.1145/3360550.
short: K. Chatterjee, A. Pavlogiannis, V. Toman, in:, Proceedings of the 34th ACM
International Conference on Object-Oriented Programming, Systems, Languages, and
Applications, ACM, 2019.
conference:
end_date: 2019-10-25
location: Athens, Greece
name: 'OOPSLA: Object-oriented Programming, Systems, Languages and Applications'
start_date: 2019-10-23
date_created: 2021-10-27T14:57:06Z
date_published: 2019-10-10T00:00:00Z
date_updated: 2023-09-07T13:30:27Z
day: '10'
ddc:
- '000'
department:
- _id: GradSch
- _id: KrCh
doi: 10.1145/3360550
external_id:
arxiv:
- '1909.00989'
file:
- access_level: open_access
checksum: 2149979c46964c4d117af06ccb6c0834
content_type: application/pdf
creator: cchlebak
date_created: 2021-11-12T11:41:56Z
date_updated: 2021-11-12T11:41:56Z
file_id: '10278'
file_name: 2019_ACM_Chatterjee.pdf
file_size: 570829
relation: main_file
success: 1
file_date_updated: 2021-11-12T11:41:56Z
has_accepted_license: '1'
intvolume: ' 3'
keyword:
- safety
- risk
- reliability and quality
- software
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
main_file_link:
- open_access: '1'
url: https://dl.acm.org/doi/10.1145/3360550
month: '10'
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: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication: Proceedings of the 34th ACM International Conference on Object-Oriented
Programming, Systems, Languages, and Applications
publication_identifier:
eissn:
- 2475-1421
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
record:
- id: '10199'
relation: dissertation_contains
status: public
status: public
title: Value-centric dynamic partial order reduction
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: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 3
year: '2019'
...
---
_id: '6673'
abstract:
- lang: eng
text: Several classic problems in graph processing and computational geometry are
solved via incremental algorithms, which split computation into a series of small
tasks acting on shared state, which gets updated progressively. While the sequential
variant of such algorithms usually specifies a fixed (but sometimes random) order
in which the tasks should be performed, a standard approach to parallelizing such
algorithms is to relax this constraint to allow for out-of-order parallel execution.
This is the case for parallel implementations of Dijkstra's single-source shortest-paths
(SSSP) algorithm, and for parallel Delaunay mesh triangulation. While many software
frameworks parallelize incremental computation in this way, it is still not well
understood whether this relaxed ordering approach can still provide any complexity
guarantees. In this paper, we address this problem, and analyze the efficiency
guarantees provided by a range of incremental algorithms when parallelized via
relaxed schedulers. We show that, for algorithms such as Delaunay mesh triangulation
and sorting by insertion, schedulers with a maximum relaxation factor of k in
terms of the maximum priority inversion allowed will introduce a maximum amount
of wasted work of O(łog n poly(k)), where n is the number of tasks to be executed.
For SSSP, we show that the additional work is O(poly(k), dmax / wmin), where dmax
is the maximum distance between two nodes, and wmin is the minimum such distance.
In practical settings where n >> k, this suggests that the overheads of relaxation
will be outweighed by the improved scalability of the relaxed scheduler. On the
negative side, we provide lower bounds showing that certain algorithms will inherently
incur a non-trivial amount of wasted work due to scheduler relaxation, even for
relatively benign relaxed schedulers.
article_processing_charge: No
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: Giorgi
full_name: Nadiradze, Giorgi
id: 3279A00C-F248-11E8-B48F-1D18A9856A87
last_name: Nadiradze
orcid: 0000-0001-5634-0731
- first_name: Nikita
full_name: Koval, Nikita
id: 2F4DB10C-F248-11E8-B48F-1D18A9856A87
last_name: Koval
citation:
ama: 'Alistarh D-A, Nadiradze G, Koval N. Efficiency guarantees for parallel incremental
algorithms under relaxed schedulers. In: 31st ACM Symposium on Parallelism
in Algorithms and Architectures. ACM Press; 2019:145-154. doi:10.1145/3323165.3323201'
apa: 'Alistarh, D.-A., Nadiradze, G., & Koval, N. (2019). Efficiency guarantees
for parallel incremental algorithms under relaxed schedulers. In 31st ACM Symposium
on Parallelism in Algorithms and Architectures (pp. 145–154). Phoenix, AZ,
United States: ACM Press. https://doi.org/10.1145/3323165.3323201'
chicago: Alistarh, Dan-Adrian, Giorgi Nadiradze, and Nikita Koval. “Efficiency Guarantees
for Parallel Incremental Algorithms under Relaxed Schedulers.” In 31st ACM
Symposium on Parallelism in Algorithms and Architectures, 145–54. ACM Press,
2019. https://doi.org/10.1145/3323165.3323201.
ieee: D.-A. Alistarh, G. Nadiradze, and N. Koval, “Efficiency guarantees for parallel
incremental algorithms under relaxed schedulers,” in 31st ACM Symposium on
Parallelism in Algorithms and Architectures, Phoenix, AZ, United States, 2019,
pp. 145–154.
ista: 'Alistarh D-A, Nadiradze G, Koval N. 2019. Efficiency guarantees for parallel
incremental algorithms under relaxed schedulers. 31st ACM Symposium on Parallelism
in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms
and Architectures, 145–154.'
mla: Alistarh, Dan-Adrian, et al. “Efficiency Guarantees for Parallel Incremental
Algorithms under Relaxed Schedulers.” 31st ACM Symposium on Parallelism in
Algorithms and Architectures, ACM Press, 2019, pp. 145–54, doi:10.1145/3323165.3323201.
short: D.-A. Alistarh, G. Nadiradze, N. Koval, in:, 31st ACM Symposium on Parallelism
in Algorithms and Architectures, ACM Press, 2019, pp. 145–154.
conference:
end_date: 2019-06-24
location: Phoenix, AZ, United States
name: 'SPAA: Symposium on Parallelism in Algorithms and Architectures'
start_date: 2019-06-22
date_created: 2019-07-24T08:59:36Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2023-09-07T13:31:39Z
day: '01'
department:
- _id: DaAl
doi: 10.1145/3323165.3323201
ec_funded: 1
external_id:
arxiv:
- '2003.09363'
isi:
- '000507618500018'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2003.09363
month: '06'
oa: 1
oa_version: Preprint
page: 145-154
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: 31st ACM Symposium on Parallelism in Algorithms and Architectures
publication_identifier:
isbn:
- '9781450361842'
publication_status: published
publisher: ACM Press
quality_controlled: '1'
related_material:
record:
- id: '10429'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Efficiency guarantees for parallel incremental algorithms under relaxed schedulers
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2019'
...
---
_id: '7398'
abstract:
- lang: eng
text: 'Transporters of the solute carrier 6 (SLC6) family translocate their cognate
substrate together with Na+ and Cl−. Detailed kinetic models exist for the transporters
of GABA (GAT1/SLC6A1) and the monoamines dopamine (DAT/SLC6A3) and serotonin (SERT/SLC6A4).
Here, we posited that the transport cycle of individual SLC6 transporters reflects
the physiological requirements they operate under. We tested this hypothesis by
analyzing the transport cycle of glycine transporter 1 (GlyT1/SLC6A9) and glycine
transporter 2 (GlyT2/SLC6A5). GlyT2 is the only SLC6 family member known to translocate
glycine, Na+, and Cl− in a 1:3:1 stoichiometry. We analyzed partial reactions
in real time by electrophysiological recordings. Contrary to monoamine transporters,
both GlyTs were found to have a high transport capacity driven by rapid return
of the empty transporter after release of Cl− on the intracellular side. Rapid
cycling of both GlyTs was further supported by highly cooperative binding of cosubstrate
ions and substrate such that their forward transport mode was maintained even
under conditions of elevated intracellular Na+ or Cl−. The most important differences
in the transport cycle of GlyT1 and GlyT2 arose from the kinetics of charge movement
and the resulting voltage-dependent rate-limiting reactions: the kinetics of GlyT1
were governed by transition of the substrate-bound transporter from outward- to
inward-facing conformations, whereas the kinetics of GlyT2 were governed by Na+
binding (or a related conformational change). Kinetic modeling showed that the
kinetics of GlyT1 are ideally suited for supplying the extracellular glycine levels
required for NMDA receptor activation.'
article_processing_charge: No
article_type: original
author:
- first_name: Fatma Asli
full_name: Erdem, Fatma Asli
last_name: Erdem
- first_name: Marija
full_name: Ilic, Marija
last_name: Ilic
- first_name: Peter
full_name: Koppensteiner, Peter
id: 3B8B25A8-F248-11E8-B48F-1D18A9856A87
last_name: Koppensteiner
orcid: 0000-0002-3509-1948
- first_name: Jakub
full_name: Gołacki, Jakub
last_name: Gołacki
- first_name: Gert
full_name: Lubec, Gert
last_name: Lubec
- first_name: Michael
full_name: Freissmuth, Michael
last_name: Freissmuth
- first_name: Walter
full_name: Sandtner, Walter
last_name: Sandtner
citation:
ama: Erdem FA, Ilic M, Koppensteiner P, et al. A comparison of the transport kinetics
of glycine transporter 1 and glycine transporter 2. The Journal of General
Physiology. 2019;151(8):1035-1050. doi:10.1085/jgp.201912318
apa: Erdem, F. A., Ilic, M., Koppensteiner, P., Gołacki, J., Lubec, G., Freissmuth,
M., & Sandtner, W. (2019). A comparison of the transport kinetics of glycine
transporter 1 and glycine transporter 2. The Journal of General Physiology.
Rockefeller University Press. https://doi.org/10.1085/jgp.201912318
chicago: Erdem, Fatma Asli, Marija Ilic, Peter Koppensteiner, Jakub Gołacki, Gert
Lubec, Michael Freissmuth, and Walter Sandtner. “A Comparison of the Transport
Kinetics of Glycine Transporter 1 and Glycine Transporter 2.” The Journal of
General Physiology. Rockefeller University Press, 2019. https://doi.org/10.1085/jgp.201912318.
ieee: F. A. Erdem et al., “A comparison of the transport kinetics of glycine
transporter 1 and glycine transporter 2,” The Journal of General Physiology,
vol. 151, no. 8. Rockefeller University Press, pp. 1035–1050, 2019.
ista: Erdem FA, Ilic M, Koppensteiner P, Gołacki J, Lubec G, Freissmuth M, Sandtner
W. 2019. A comparison of the transport kinetics of glycine transporter 1 and glycine
transporter 2. The Journal of General Physiology. 151(8), 1035–1050.
mla: Erdem, Fatma Asli, et al. “A Comparison of the Transport Kinetics of Glycine
Transporter 1 and Glycine Transporter 2.” The Journal of General Physiology,
vol. 151, no. 8, Rockefeller University Press, 2019, pp. 1035–50, doi:10.1085/jgp.201912318.
short: F.A. Erdem, M. Ilic, P. Koppensteiner, J. Gołacki, G. Lubec, M. Freissmuth,
W. Sandtner, The Journal of General Physiology 151 (2019) 1035–1050.
date_created: 2020-01-29T16:06:29Z
date_published: 2019-07-03T00:00:00Z
date_updated: 2023-09-07T14:52:23Z
day: '03'
ddc:
- '570'
department:
- _id: RySh
doi: 10.1085/jgp.201912318
external_id:
isi:
- '000478792500008'
pmid:
- '31270129'
file:
- access_level: open_access
checksum: 5706b4ccd74ee3e50bf7ecb2a203df71
content_type: application/pdf
creator: dernst
date_created: 2020-02-05T07:20:32Z
date_updated: 2020-07-14T12:47:57Z
file_id: '7450'
file_name: 2019_JGP_Erdem.pdf
file_size: 2641297
relation: main_file
file_date_updated: 2020-07-14T12:47:57Z
has_accepted_license: '1'
intvolume: ' 151'
isi: 1
issue: '8'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-sa/4.0/
month: '07'
oa: 1
oa_version: Published Version
page: 1035-1050
pmid: 1
publication: The Journal of General Physiology
publication_identifier:
eissn:
- 1540-7748
issn:
- 0022-1295
publication_status: published
publisher: Rockefeller University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: A comparison of the transport kinetics of glycine transporter 1 and glycine
transporter 2
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: 151
year: '2019'
...
---
_id: '7395'
abstract:
- lang: eng
text: The mitochondrial electron transport chain complexes are organized into supercomplexes
(SCs) of defined stoichiometry, which have been proposed to regulate electron
flux via substrate channeling. We demonstrate that CoQ trapping in the isolated
SC I+III2 limits complex (C)I turnover, arguing against channeling. The SC structure,
resolved at up to 3.8 Å in four distinct states, suggests that CoQ oxidation may
be rate limiting because of unequal access of CoQ to the active sites of CIII2.
CI shows a transition between “closed” and “open” conformations, accompanied by
the striking rotation of a key transmembrane helix. Furthermore, the state of
CI affects the conformational flexibility within CIII2, demonstrating crosstalk
between the enzymes. CoQ was identified at only three of the four binding sites
in CIII2, suggesting that interaction with CI disrupts CIII2 symmetry in a functionally
relevant manner. Together, these observations indicate a more nuanced functional
role for the SCs.
article_processing_charge: No
article_type: original
author:
- first_name: James A
full_name: Letts, James A
id: 322DA418-F248-11E8-B48F-1D18A9856A87
last_name: Letts
orcid: 0000-0002-9864-3586
- first_name: Karol
full_name: Fiedorczuk, Karol
id: 5BFF67CE-02D1-11E9-B11A-A5A4D7DFFFD0
last_name: Fiedorczuk
- first_name: Gianluca
full_name: Degliesposti, Gianluca
last_name: Degliesposti
- first_name: Mark
full_name: Skehel, Mark
last_name: Skehel
- first_name: Leonid A
full_name: Sazanov, Leonid A
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
citation:
ama: Letts JA, Fiedorczuk K, Degliesposti G, Skehel M, Sazanov LA. Structures of
respiratory supercomplex I+III2 reveal functional and conformational crosstalk.
Molecular Cell. 2019;75(6):1131-1146.e6. doi:10.1016/j.molcel.2019.07.022
apa: Letts, J. A., Fiedorczuk, K., Degliesposti, G., Skehel, M., & Sazanov,
L. A. (2019). Structures of respiratory supercomplex I+III2 reveal functional
and conformational crosstalk. Molecular Cell. Cell Press. https://doi.org/10.1016/j.molcel.2019.07.022
chicago: Letts, James A, Karol Fiedorczuk, Gianluca Degliesposti, Mark Skehel, and
Leonid A Sazanov. “Structures of Respiratory Supercomplex I+III2 Reveal Functional
and Conformational Crosstalk.” Molecular Cell. Cell Press, 2019. https://doi.org/10.1016/j.molcel.2019.07.022.
ieee: J. A. Letts, K. Fiedorczuk, G. Degliesposti, M. Skehel, and L. A. Sazanov,
“Structures of respiratory supercomplex I+III2 reveal functional and conformational
crosstalk,” Molecular Cell, vol. 75, no. 6. Cell Press, p. 1131–1146.e6,
2019.
ista: Letts JA, Fiedorczuk K, Degliesposti G, Skehel M, Sazanov LA. 2019. Structures
of respiratory supercomplex I+III2 reveal functional and conformational crosstalk.
Molecular Cell. 75(6), 1131–1146.e6.
mla: Letts, James A., et al. “Structures of Respiratory Supercomplex I+III2 Reveal
Functional and Conformational Crosstalk.” Molecular Cell, vol. 75, no.
6, Cell Press, 2019, p. 1131–1146.e6, doi:10.1016/j.molcel.2019.07.022.
short: J.A. Letts, K. Fiedorczuk, G. Degliesposti, M. Skehel, L.A. Sazanov, Molecular
Cell 75 (2019) 1131–1146.e6.
date_created: 2020-01-29T16:02:33Z
date_published: 2019-09-19T00:00:00Z
date_updated: 2023-09-07T14:53:06Z
day: '19'
ddc:
- '570'
department:
- _id: LeSa
doi: 10.1016/j.molcel.2019.07.022
ec_funded: 1
external_id:
isi:
- '000486614200006'
pmid:
- '31492636'
file:
- access_level: open_access
checksum: 5202f53a237d6650ece038fbf13bdcea
content_type: application/pdf
creator: dernst
date_created: 2020-02-04T10:37:28Z
date_updated: 2020-07-14T12:47:57Z
file_id: '7447'
file_name: 2019_MolecularCell_Letts.pdf
file_size: 9654895
relation: main_file
file_date_updated: 2020-07-14T12:47:57Z
has_accepted_license: '1'
intvolume: ' 75'
isi: 1
issue: '6'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 1131-1146.e6
pmid: 1
project:
- _id: 2590DB08-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '701309'
name: Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes
publication: Molecular Cell
publication_identifier:
issn:
- 1097-2765
publication_status: published
publisher: Cell Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Structures of respiratory supercomplex I+III2 reveal functional and conformational
crosstalk
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: 75
year: '2019'
...
---
_id: '7405'
abstract:
- lang: eng
text: Biophysical modeling of neuronal networks helps to integrate and interpret
rapidly growing and disparate experimental datasets at multiple scales. The NetPyNE
tool (www.netpyne.org) provides both programmatic and graphical interfaces to
develop data-driven multiscale network models in NEURON. NetPyNE clearly separates
model parameters from implementation code. Users provide specifications at a high
level via a standardized declarative language, for example connectivity rules,
to create millions of cell-to-cell connections. NetPyNE then enables users to
generate the NEURON network, run efficiently parallelized simulations, optimize
and explore network parameters through automated batch runs, and use built-in
functions for visualization and analysis – connectivity matrices, voltage traces,
spike raster plots, local field potentials, and information theoretic measures.
NetPyNE also facilitates model sharing by exporting and importing standardized
formats (NeuroML and SONATA). NetPyNE is already being used to teach computational
neuroscience students and by modelers to investigate brain regions and phenomena.
article_number: e44494
article_processing_charge: No
article_type: original
author:
- first_name: Salvador
full_name: Dura-Bernal, Salvador
last_name: Dura-Bernal
- first_name: Benjamin
full_name: Suter, Benjamin
id: 4952F31E-F248-11E8-B48F-1D18A9856A87
last_name: Suter
orcid: 0000-0002-9885-6936
- first_name: Padraig
full_name: Gleeson, Padraig
last_name: Gleeson
- first_name: Matteo
full_name: Cantarelli, Matteo
last_name: Cantarelli
- first_name: Adrian
full_name: Quintana, Adrian
last_name: Quintana
- first_name: Facundo
full_name: Rodriguez, Facundo
last_name: Rodriguez
- first_name: David J
full_name: Kedziora, David J
last_name: Kedziora
- first_name: George L
full_name: Chadderdon, George L
last_name: Chadderdon
- first_name: Cliff C
full_name: Kerr, Cliff C
last_name: Kerr
- first_name: Samuel A
full_name: Neymotin, Samuel A
last_name: Neymotin
- first_name: Robert A
full_name: McDougal, Robert A
last_name: McDougal
- first_name: Michael
full_name: Hines, Michael
last_name: Hines
- first_name: Gordon MG
full_name: Shepherd, Gordon MG
last_name: Shepherd
- first_name: William W
full_name: Lytton, William W
last_name: Lytton
citation:
ama: Dura-Bernal S, Suter B, Gleeson P, et al. NetPyNE, a tool for data-driven multiscale
modeling of brain circuits. eLife. 2019;8. doi:10.7554/elife.44494
apa: Dura-Bernal, S., Suter, B., Gleeson, P., Cantarelli, M., Quintana, A., Rodriguez,
F., … Lytton, W. W. (2019). NetPyNE, a tool for data-driven multiscale modeling
of brain circuits. ELife. eLife Sciences Publications. https://doi.org/10.7554/elife.44494
chicago: Dura-Bernal, Salvador, Benjamin Suter, Padraig Gleeson, Matteo Cantarelli,
Adrian Quintana, Facundo Rodriguez, David J Kedziora, et al. “NetPyNE, a Tool
for Data-Driven Multiscale Modeling of Brain Circuits.” ELife. eLife Sciences
Publications, 2019. https://doi.org/10.7554/elife.44494.
ieee: S. Dura-Bernal et al., “NetPyNE, a tool for data-driven multiscale
modeling of brain circuits,” eLife, vol. 8. eLife Sciences Publications,
2019.
ista: Dura-Bernal S, Suter B, Gleeson P, Cantarelli M, Quintana A, Rodriguez F,
Kedziora DJ, Chadderdon GL, Kerr CC, Neymotin SA, McDougal RA, Hines M, Shepherd
GM, Lytton WW. 2019. NetPyNE, a tool for data-driven multiscale modeling of brain
circuits. eLife. 8, e44494.
mla: Dura-Bernal, Salvador, et al. “NetPyNE, a Tool for Data-Driven Multiscale Modeling
of Brain Circuits.” ELife, vol. 8, e44494, eLife Sciences Publications,
2019, doi:10.7554/elife.44494.
short: S. Dura-Bernal, B. Suter, P. Gleeson, M. Cantarelli, A. Quintana, F. Rodriguez,
D.J. Kedziora, G.L. Chadderdon, C.C. Kerr, S.A. Neymotin, R.A. McDougal, M. Hines,
G.M. Shepherd, W.W. Lytton, ELife 8 (2019).
date_created: 2020-01-30T09:08:01Z
date_published: 2019-05-31T00:00:00Z
date_updated: 2023-09-07T14:27:52Z
day: '31'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.7554/elife.44494
external_id:
isi:
- '000468968400001'
pmid:
- '31025934'
file:
- access_level: open_access
checksum: 7014189c11c10a12feeeae37f054871d
content_type: application/pdf
creator: dernst
date_created: 2020-02-04T08:41:47Z
date_updated: 2020-07-14T12:47:57Z
file_id: '7444'
file_name: 2019_eLife_DuraBernal.pdf
file_size: 6182359
relation: main_file
file_date_updated: 2020-07-14T12:47:57Z
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
pmid: 1
publication: eLife
publication_identifier:
issn:
- 2050-084X
publication_status: published
publisher: eLife Sciences Publications
quality_controlled: '1'
scopus_import: '1'
status: public
title: NetPyNE, a tool for data-driven multiscale modeling of brain circuits
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: '2019'
...
---
_id: '7400'
abstract:
- lang: eng
text: 'Suppressed recombination allows divergence between homologous sex chromosomes
and the functionality of their genes. Here, we reveal patterns of the earliest
stages of sex-chromosome evolution in the diploid dioecious herb Mercurialis annua
on the basis of cytological analysis, de novo genome assembly and annotation,
genetic mapping, exome resequencing of natural populations, and transcriptome
analysis. The genome assembly contained 34,105 expressed genes, of which 10,076
were assigned to linkage groups. Genetic mapping and exome resequencing of individuals
across the species range both identified the largest linkage group, LG1, as the
sex chromosome. Although the sex chromosomes of M. annua are karyotypically homomorphic,
we estimate that about one-third of the Y chromosome, containing 568 transcripts
and spanning 22.3 cM in the corresponding female map, has ceased recombining.
Nevertheless, we found limited evidence for Y-chromosome degeneration in terms
of gene loss and pseudogenization, and most X- and Y-linked genes appear to have
diverged in the period subsequent to speciation between M. annua and its sister
species M. huetii, which shares the same sex-determining region. Taken together,
our results suggest that the M. annua Y chromosome has at least two evolutionary
strata: a small old stratum shared with M. huetii, and a more recent larger stratum
that is probably unique to M. annua and that stopped recombining ∼1 MYA. Patterns
of gene expression within the nonrecombining region are consistent with the idea
that sexually antagonistic selection may have played a role in favoring suppressed
recombination.'
article_processing_charge: No
article_type: original
author:
- first_name: Paris
full_name: Veltsos, Paris
last_name: Veltsos
- first_name: Kate E.
full_name: Ridout, Kate E.
last_name: Ridout
- first_name: Melissa A
full_name: Toups, Melissa A
id: 4E099E4E-F248-11E8-B48F-1D18A9856A87
last_name: Toups
orcid: 0000-0002-9752-7380
- first_name: Santiago C.
full_name: González-Martínez, Santiago C.
last_name: González-Martínez
- first_name: Aline
full_name: Muyle, Aline
last_name: Muyle
- first_name: Olivier
full_name: Emery, Olivier
last_name: Emery
- first_name: Pasi
full_name: Rastas, Pasi
last_name: Rastas
- first_name: Vojtech
full_name: Hudzieczek, Vojtech
last_name: Hudzieczek
- first_name: Roman
full_name: Hobza, Roman
last_name: Hobza
- first_name: Boris
full_name: Vyskot, Boris
last_name: Vyskot
- first_name: Gabriel A. B.
full_name: Marais, Gabriel A. B.
last_name: Marais
- first_name: Dmitry A.
full_name: Filatov, Dmitry A.
last_name: Filatov
- first_name: John R.
full_name: Pannell, John R.
last_name: Pannell
citation:
ama: Veltsos P, Ridout KE, Toups MA, et al. Early sex-chromosome evolution in the
diploid dioecious plant Mercurialis annua. Genetics. 2019;212(3):815-835.
doi:10.1534/genetics.119.302045
apa: Veltsos, P., Ridout, K. E., Toups, M. A., González-Martínez, S. C., Muyle,
A., Emery, O., … Pannell, J. R. (2019). Early sex-chromosome evolution in the
diploid dioecious plant Mercurialis annua. Genetics. Genetics Society of
America. https://doi.org/10.1534/genetics.119.302045
chicago: Veltsos, Paris, Kate E. Ridout, Melissa A Toups, Santiago C. González-Martínez,
Aline Muyle, Olivier Emery, Pasi Rastas, et al. “Early Sex-Chromosome Evolution
in the Diploid Dioecious Plant Mercurialis Annua.” Genetics. Genetics Society
of America, 2019. https://doi.org/10.1534/genetics.119.302045.
ieee: P. Veltsos et al., “Early sex-chromosome evolution in the diploid dioecious
plant Mercurialis annua,” Genetics, vol. 212, no. 3. Genetics Society of
America, pp. 815–835, 2019.
ista: Veltsos P, Ridout KE, Toups MA, González-Martínez SC, Muyle A, Emery O, Rastas
P, Hudzieczek V, Hobza R, Vyskot B, Marais GAB, Filatov DA, Pannell JR. 2019.
Early sex-chromosome evolution in the diploid dioecious plant Mercurialis annua.
Genetics. 212(3), 815–835.
mla: Veltsos, Paris, et al. “Early Sex-Chromosome Evolution in the Diploid Dioecious
Plant Mercurialis Annua.” Genetics, vol. 212, no. 3, Genetics Society of
America, 2019, pp. 815–35, doi:10.1534/genetics.119.302045.
short: P. Veltsos, K.E. Ridout, M.A. Toups, S.C. González-Martínez, A. Muyle, O.
Emery, P. Rastas, V. Hudzieczek, R. Hobza, B. Vyskot, G.A.B. Marais, D.A. Filatov,
J.R. Pannell, Genetics 212 (2019) 815–835.
date_created: 2020-01-29T16:15:44Z
date_published: 2019-07-01T00:00:00Z
date_updated: 2023-09-07T14:49:29Z
day: '01'
department:
- _id: BeVi
doi: 10.1534/genetics.119.302045
ec_funded: 1
external_id:
isi:
- '000474809300015'
pmid:
- '31113811'
intvolume: ' 212'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1534/genetics.119.302045
month: '07'
oa: 1
oa_version: Published Version
page: 815-835
pmid: 1
project:
- _id: 250BDE62-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715257'
name: Prevalence and Influence of Sexual Antagonism on Genome Evolution
publication: Genetics
publication_identifier:
eissn:
- 1943-2631
issn:
- 0016-6731
publication_status: published
publisher: Genetics Society of America
quality_controlled: '1'
scopus_import: '1'
status: public
title: Early sex-chromosome evolution in the diploid dioecious plant Mercurialis annua
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 212
year: '2019'
...
---
_id: '7404'
abstract:
- lang: eng
text: The formation of neuronal dendrite branches is fundamental for the wiring
and function of the nervous system. Indeed, dendrite branching enhances the coverage
of the neuron's receptive field and modulates the initial processing of incoming
stimuli. Complex dendrite patterns are achieved in vivo through a dynamic process
of de novo branch formation, branch extension and retraction. The first step towards
branch formation is the generation of a dynamic filopodium-like branchlet. The
mechanisms underlying the initiation of dendrite branchlets are therefore crucial
to the shaping of dendrites. Through in vivo time-lapse imaging of the subcellular
localization of actin during the process of branching of Drosophila larva sensory
neurons, combined with genetic analysis and electron tomography, we have identified
the Actin-related protein (Arp) 2/3 complex as the major actin nucleator involved
in the initiation of dendrite branchlet formation, under the control of the activator
WAVE and of the small GTPase Rac1. Transient recruitment of an Arp2/3 component
marks the site of branchlet initiation in vivo. These data position the activation
of Arp2/3 as an early hub for the initiation of branchlet formation.
article_number: dev171397
article_processing_charge: No
article_type: original
author:
- first_name: Tomke
full_name: Stürner, Tomke
last_name: Stürner
- first_name: Anastasia
full_name: Tatarnikova, Anastasia
last_name: Tatarnikova
- first_name: Jan
full_name: Müller, Jan
id: AD07FDB4-0F61-11EA-8158-C4CC64CEAA8D
last_name: Müller
- first_name: Barbara
full_name: Schaffran, Barbara
last_name: Schaffran
- first_name: Hermann
full_name: Cuntz, Hermann
last_name: Cuntz
- first_name: Yun
full_name: Zhang, Yun
last_name: Zhang
- first_name: Maria
full_name: Nemethova, Maria
id: 34E27F1C-F248-11E8-B48F-1D18A9856A87
last_name: Nemethova
- first_name: Sven
full_name: Bogdan, Sven
last_name: Bogdan
- first_name: Vic
full_name: Small, Vic
last_name: Small
- first_name: Gaia
full_name: Tavosanis, Gaia
last_name: Tavosanis
citation:
ama: Stürner T, Tatarnikova A, Müller J, et al. Transient localization of the Arp2/3
complex initiates neuronal dendrite branching in vivo. Development. 2019;146(7).
doi:10.1242/dev.171397
apa: Stürner, T., Tatarnikova, A., Müller, J., Schaffran, B., Cuntz, H., Zhang,
Y., … Tavosanis, G. (2019). Transient localization of the Arp2/3 complex initiates
neuronal dendrite branching in vivo. Development. The Company of Biologists.
https://doi.org/10.1242/dev.171397
chicago: Stürner, Tomke, Anastasia Tatarnikova, Jan Müller, Barbara Schaffran, Hermann
Cuntz, Yun Zhang, Maria Nemethova, Sven Bogdan, Vic Small, and Gaia Tavosanis.
“Transient Localization of the Arp2/3 Complex Initiates Neuronal Dendrite Branching
in Vivo.” Development. The Company of Biologists, 2019. https://doi.org/10.1242/dev.171397.
ieee: T. Stürner et al., “Transient localization of the Arp2/3 complex initiates
neuronal dendrite branching in vivo,” Development, vol. 146, no. 7. The
Company of Biologists, 2019.
ista: Stürner T, Tatarnikova A, Müller J, Schaffran B, Cuntz H, Zhang Y, Nemethova
M, Bogdan S, Small V, Tavosanis G. 2019. Transient localization of the Arp2/3
complex initiates neuronal dendrite branching in vivo. Development. 146(7), dev171397.
mla: Stürner, Tomke, et al. “Transient Localization of the Arp2/3 Complex Initiates
Neuronal Dendrite Branching in Vivo.” Development, vol. 146, no. 7, dev171397,
The Company of Biologists, 2019, doi:10.1242/dev.171397.
short: T. Stürner, A. Tatarnikova, J. Müller, B. Schaffran, H. Cuntz, Y. Zhang,
M. Nemethova, S. Bogdan, V. Small, G. Tavosanis, Development 146 (2019).
date_created: 2020-01-29T16:27:10Z
date_published: 2019-04-04T00:00:00Z
date_updated: 2023-09-07T14:47:00Z
day: '04'
department:
- _id: MiSi
doi: 10.1242/dev.171397
external_id:
isi:
- '000464583200006'
pmid:
- '30910826'
intvolume: ' 146'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1242/dev.171397
month: '04'
oa: 1
oa_version: Published Version
pmid: 1
publication: Development
publication_identifier:
eissn:
- 1477-9129
issn:
- 0950-1991
publication_status: published
publisher: The Company of Biologists
quality_controlled: '1'
scopus_import: '1'
status: public
title: Transient localization of the Arp2/3 complex initiates neuronal dendrite branching
in vivo
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 146
year: '2019'
...
---
_id: '7402'
abstract:
- lang: eng
text: Graph planning gives rise to fundamental algorithmic questions such as shortest
path, traveling salesman problem, etc. A classical problem in discrete planning
is to consider a weighted graph and construct a path that maximizes the sum of
weights for a given time horizon T. However, in many scenarios, the time horizon
is not fixed, but the stopping time is chosen according to some distribution such
that the expected stopping time is T. If the stopping time distribution is not
known, then to ensure robustness, the distribution is chosen by an adversary,
to represent the worst-case scenario. A stationary plan for every vertex always
chooses the same outgoing edge. For fixed horizon or fixed stopping-time distribution,
stationary plans are not sufficient for optimality. Quite surprisingly we show
that when an adversary chooses the stopping-time distribution with expected stopping
time T, then stationary plans are sufficient. While computing optimal stationary
plans for fixed horizon is NP-complete, we show that computing optimal stationary
plans under adversarial stopping-time distribution can be achieved in polynomial
time. Consequently, our polynomial-time algorithm for adversarial stopping time
also computes an optimal plan among all possible plans.
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: 'Chatterjee K, Doyen L. Graph planning with expected finite horizon. In: 34th
Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE; 2019:1-13. doi:10.1109/lics.2019.8785706'
apa: 'Chatterjee, K., & Doyen, L. (2019). Graph planning with expected finite
horizon. In 34th Annual ACM/IEEE Symposium on Logic in Computer Science
(pp. 1–13). Vancouver, BC, Canada: IEEE. https://doi.org/10.1109/lics.2019.8785706'
chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected
Finite Horizon.” In 34th Annual ACM/IEEE Symposium on Logic in Computer Science,
1–13. IEEE, 2019. https://doi.org/10.1109/lics.2019.8785706.
ieee: K. Chatterjee and L. Doyen, “Graph planning with expected finite horizon,”
in 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Vancouver,
BC, Canada, 2019, pp. 1–13.
ista: 'Chatterjee K, Doyen L. 2019. Graph planning with expected finite horizon.
34th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Symposium on
Logic in Computer Science, 1–13.'
mla: Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite
Horizon.” 34th Annual ACM/IEEE Symposium on Logic in Computer Science,
IEEE, 2019, pp. 1–13, doi:10.1109/lics.2019.8785706.
short: K. Chatterjee, L. Doyen, in:, 34th Annual ACM/IEEE Symposium on Logic in
Computer Science, IEEE, 2019, pp. 1–13.
conference:
end_date: 2019-06-27
location: Vancouver, BC, Canada
name: 'LICS: Symposium on Logic in Computer Science'
start_date: 2019-06-24
date_created: 2020-01-29T16:18:33Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2023-09-07T14:48:11Z
day: '01'
department:
- _id: KrCh
doi: 10.1109/lics.2019.8785706
external_id:
arxiv:
- '1802.03642'
isi:
- '000805002800001'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1802.03642
month: '06'
oa: 1
oa_version: Preprint
page: 1-13
publication: 34th Annual ACM/IEEE Symposium on Logic in Computer Science
publication_identifier:
isbn:
- '9781728136080'
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '11402'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Graph planning with expected finite horizon
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '7451'
abstract:
- lang: eng
text: We prove that the observable telegraph signal accompanying the bistability
in the photon-blockade-breakdown regime of the driven and lossy Jaynes–Cummings
model is the finite-size precursor of what in the thermodynamic limit is a genuine
first-order phase transition. We construct a finite-size scaling of the system
parameters to a well-defined thermodynamic limit, in which the system remains
the same microscopic system, but the telegraph signal becomes macroscopic both
in its timescale and intensity. The existence of such a finite-size scaling completes
and justifies the classification of the photon-blockade-breakdown effect as a
first-order dissipative quantum phase transition.
article_number: '150'
article_processing_charge: No
article_type: original
author:
- first_name: A.
full_name: Vukics, A.
last_name: Vukics
- first_name: A.
full_name: Dombi, A.
last_name: Dombi
- first_name: Johannes M
full_name: Fink, Johannes M
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
- first_name: P.
full_name: Domokos, P.
last_name: Domokos
citation:
ama: Vukics A, Dombi A, Fink JM, Domokos P. Finite-size scaling of the photon-blockade
breakdown dissipative quantum phase transition. Quantum. 2019;3. doi:10.22331/q-2019-06-03-150
apa: Vukics, A., Dombi, A., Fink, J. M., & Domokos, P. (2019). Finite-size scaling
of the photon-blockade breakdown dissipative quantum phase transition. Quantum.
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften.
https://doi.org/10.22331/q-2019-06-03-150
chicago: Vukics, A., A. Dombi, Johannes M Fink, and P. Domokos. “Finite-Size Scaling
of the Photon-Blockade Breakdown Dissipative Quantum Phase Transition.” Quantum.
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften,
2019. https://doi.org/10.22331/q-2019-06-03-150.
ieee: A. Vukics, A. Dombi, J. M. Fink, and P. Domokos, “Finite-size scaling of the
photon-blockade breakdown dissipative quantum phase transition,” Quantum,
vol. 3. Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften,
2019.
ista: Vukics A, Dombi A, Fink JM, Domokos P. 2019. Finite-size scaling of the photon-blockade
breakdown dissipative quantum phase transition. Quantum. 3, 150.
mla: Vukics, A., et al. “Finite-Size Scaling of the Photon-Blockade Breakdown Dissipative
Quantum Phase Transition.” Quantum, vol. 3, 150, Verein zur Förderung des
Open Access Publizierens in den Quantenwissenschaften, 2019, doi:10.22331/q-2019-06-03-150.
short: A. Vukics, A. Dombi, J.M. Fink, P. Domokos, Quantum 3 (2019).
date_created: 2020-02-05T09:57:57Z
date_published: 2019-06-03T00:00:00Z
date_updated: 2023-09-07T14:57:39Z
day: '03'
ddc:
- '530'
department:
- _id: JoFi
doi: 10.22331/q-2019-06-03-150
external_id:
arxiv:
- '1809.09737'
isi:
- '000469987500004'
file:
- access_level: open_access
checksum: 26b9ba8f0155d183f1ee55295934a17f
content_type: application/pdf
creator: dernst
date_created: 2020-02-11T09:25:23Z
date_updated: 2020-07-14T12:47:58Z
file_id: '7483'
file_name: 2019_Quantum_Vukics.pdf
file_size: 5805248
relation: main_file
file_date_updated: 2020-07-14T12:47:58Z
has_accepted_license: '1'
intvolume: ' 3'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: Quantum
publication_identifier:
issn:
- 2521-327X
publication_status: published
publisher: Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
quality_controlled: '1'
status: public
title: Finite-size scaling of the photon-blockade breakdown dissipative quantum phase
transition
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: 3
year: '2019'
...
---
_id: '7468'
abstract:
- lang: eng
text: We present a new proximal bundle method for Maximum-A-Posteriori (MAP) inference
in structured energy minimization problems. The method optimizes a Lagrangean
relaxation of the original energy minimization problem using a multi plane block-coordinate
Frank-Wolfe method that takes advantage of the specific structure of the Lagrangean
decomposition. We show empirically that our method outperforms state-of-the-art
Lagrangean decomposition based algorithms on some challenging Markov Random Field,
multi-label discrete tomography and graph matching problems.
article_number: 11138-11147
article_processing_charge: No
author:
- first_name: Paul
full_name: Swoboda, Paul
id: 446560C6-F248-11E8-B48F-1D18A9856A87
last_name: Swoboda
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: 'Swoboda P, Kolmogorov V. Map inference via block-coordinate Frank-Wolfe algorithm.
In: Proceedings of the IEEE Computer Society Conference on Computer Vision
and Pattern Recognition. Vol 2019-June. IEEE; 2019. doi:10.1109/CVPR.2019.01140'
apa: 'Swoboda, P., & Kolmogorov, V. (2019). Map inference via block-coordinate
Frank-Wolfe algorithm. In Proceedings of the IEEE Computer Society Conference
on Computer Vision and Pattern Recognition (Vol. 2019–June). Long Beach, CA,
United States: IEEE. https://doi.org/10.1109/CVPR.2019.01140'
chicago: Swoboda, Paul, and Vladimir Kolmogorov. “Map Inference via Block-Coordinate
Frank-Wolfe Algorithm.” In Proceedings of the IEEE Computer Society Conference
on Computer Vision and Pattern Recognition, Vol. 2019–June. IEEE, 2019. https://doi.org/10.1109/CVPR.2019.01140.
ieee: P. Swoboda and V. Kolmogorov, “Map inference via block-coordinate Frank-Wolfe
algorithm,” in Proceedings of the IEEE Computer Society Conference on Computer
Vision and Pattern Recognition, Long Beach, CA, United States, 2019, vol.
2019–June.
ista: 'Swoboda P, Kolmogorov V. 2019. Map inference via block-coordinate Frank-Wolfe
algorithm. Proceedings of the IEEE Computer Society Conference on Computer Vision
and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition
vol. 2019–June, 11138–11147.'
mla: Swoboda, Paul, and Vladimir Kolmogorov. “Map Inference via Block-Coordinate
Frank-Wolfe Algorithm.” Proceedings of the IEEE Computer Society Conference
on Computer Vision and Pattern Recognition, vol. 2019–June, 11138–11147, IEEE,
2019, doi:10.1109/CVPR.2019.01140.
short: P. Swoboda, V. Kolmogorov, in:, Proceedings of the IEEE Computer Society
Conference on Computer Vision and Pattern Recognition, IEEE, 2019.
conference:
end_date: 2019-06-20
location: Long Beach, CA, United States
name: 'CVPR: Conference on Computer Vision and Pattern Recognition'
start_date: 2019-06-15
date_created: 2020-02-09T23:00:52Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2023-09-07T14:54:24Z
day: '01'
department:
- _id: VlKo
doi: 10.1109/CVPR.2019.01140
ec_funded: 1
external_id:
arxiv:
- '1806.05049'
isi:
- '000542649304076'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1806.05049
month: '06'
oa: 1
oa_version: Preprint
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: Proceedings of the IEEE Computer Society Conference on Computer Vision
and Pattern Recognition
publication_identifier:
isbn:
- '9781728132938'
issn:
- '10636919'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Map inference via block-coordinate Frank-Wolfe algorithm
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2019-June
year: '2019'
...