---
_id: '703'
abstract:
- lang: eng
text: We consider the NP-hard problem of MAP-inference for undirected discrete graphical
models. We propose a polynomial time and practically efficient algorithm for finding
a part of its optimal solution. Specifically, our algorithm marks some labels
of the considered graphical model either as (i) optimal, meaning that they belong
to all optimal solutions of the inference problem; (ii) non-optimal if they provably
do not belong to any solution. With access to an exact solver of a linear programming
relaxation to the MAP-inference problem, our algorithm marks the maximal possible
(in a specified sense) number of labels. We also present a version of the algorithm,
which has access to a suboptimal dual solver only and still can ensure the (non-)optimality
for the marked labels, although the overall number of the marked labels may decrease.
We propose an efficient implementation, which runs in time comparable to a single
run of a suboptimal dual solver. Our method is well-scalable and shows state-of-the-art
results on computational benchmarks from machine learning and computer vision.
author:
- first_name: Alexander
full_name: Shekhovtsov, Alexander
last_name: Shekhovtsov
- first_name: Paul
full_name: Swoboda, Paul
id: 446560C6-F248-11E8-B48F-1D18A9856A87
last_name: Swoboda
- first_name: Bogdan
full_name: Savchynskyy, Bogdan
last_name: Savchynskyy
citation:
ama: Shekhovtsov A, Swoboda P, Savchynskyy B. Maximum persistency via iterative
relaxed inference with graphical models. IEEE Transactions on Pattern Analysis
and Machine Intelligence. 2018;40(7):1668-1682. doi:10.1109/TPAMI.2017.2730884
apa: Shekhovtsov, A., Swoboda, P., & Savchynskyy, B. (2018). Maximum persistency
via iterative relaxed inference with graphical models. IEEE Transactions on
Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2017.2730884
chicago: Shekhovtsov, Alexander, Paul Swoboda, and Bogdan Savchynskyy. “Maximum
Persistency via Iterative Relaxed Inference with Graphical Models.” IEEE Transactions
on Pattern Analysis and Machine Intelligence. IEEE, 2018. https://doi.org/10.1109/TPAMI.2017.2730884.
ieee: A. Shekhovtsov, P. Swoboda, and B. Savchynskyy, “Maximum persistency via iterative
relaxed inference with graphical models,” IEEE Transactions on Pattern Analysis
and Machine Intelligence, vol. 40, no. 7. IEEE, pp. 1668–1682, 2018.
ista: Shekhovtsov A, Swoboda P, Savchynskyy B. 2018. Maximum persistency via iterative
relaxed inference with graphical models. IEEE Transactions on Pattern Analysis
and Machine Intelligence. 40(7), 1668–1682.
mla: Shekhovtsov, Alexander, et al. “Maximum Persistency via Iterative Relaxed Inference
with Graphical Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence,
vol. 40, no. 7, IEEE, 2018, pp. 1668–82, doi:10.1109/TPAMI.2017.2730884.
short: A. Shekhovtsov, P. Swoboda, B. Savchynskyy, IEEE Transactions on Pattern
Analysis and Machine Intelligence 40 (2018) 1668–1682.
date_created: 2018-12-11T11:48:01Z
date_published: 2018-07-01T00:00:00Z
date_updated: 2021-01-12T08:11:32Z
day: '01'
department:
- _id: VlKo
doi: 10.1109/TPAMI.2017.2730884
external_id:
arxiv:
- '1508.07902'
intvolume: ' 40'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1508.07902
month: '07'
oa: 1
oa_version: Preprint
page: 1668-1682
publication: IEEE Transactions on Pattern Analysis and Machine Intelligence
publication_identifier:
issn:
- '01628828'
publication_status: published
publisher: IEEE
publist_id: '6992'
quality_controlled: '1'
scopus_import: 1
status: public
title: Maximum persistency via iterative relaxed inference with graphical models
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 40
year: '2018'
...
---
_id: '7116'
abstract:
- lang: eng
text: 'Training deep learning models has received tremendous research interest recently.
In particular, there has been intensive research on reducing the communication
cost of training when using multiple computational devices, through reducing the
precision of the underlying data representation. Naturally, such methods induce
system trade-offs—lowering communication precision could de-crease communication
overheads and improve scalability; but, on the other hand, it can also reduce
the accuracy of training. In this paper, we study this trade-off space, and ask:Can
low-precision communication consistently improve the end-to-end performance of
training modern neural networks, with no accuracy loss?From the performance point
of view, the answer to this question may appear deceptively easy: compressing
communication through low precision should help when the ratio between communication
and computation is high. However, this answer is less straightforward when we
try to generalize this principle across various neural network architectures (e.g.,
AlexNet vs. ResNet),number of GPUs (e.g., 2 vs. 8 GPUs), machine configurations(e.g.,
EC2 instances vs. NVIDIA DGX-1), communication primitives (e.g., MPI vs. NCCL),
and even different GPU architectures(e.g., Kepler vs. Pascal). Currently, it is
not clear how a realistic realization of all these factors maps to the speed up
provided by low-precision communication. In this paper, we conduct an empirical
study to answer this question and report the insights.'
article_processing_charge: No
author:
- first_name: Demjan
full_name: Grubic, Demjan
last_name: Grubic
- first_name: Leo
full_name: Tam, Leo
last_name: Tam
- 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: Ce
full_name: Zhang, Ce
last_name: Zhang
citation:
ama: 'Grubic D, Tam L, Alistarh D-A, Zhang C. Synchronous multi-GPU training for
deep learning with low-precision communications: An empirical study. In: Proceedings
of the 21st International Conference on Extending Database Technology. OpenProceedings;
2018:145-156. doi:10.5441/002/EDBT.2018.14'
apa: 'Grubic, D., Tam, L., Alistarh, D.-A., & Zhang, C. (2018). Synchronous
multi-GPU training for deep learning with low-precision communications: An empirical
study. In Proceedings of the 21st International Conference on Extending Database
Technology (pp. 145–156). Vienna, Austria: OpenProceedings. https://doi.org/10.5441/002/EDBT.2018.14'
chicago: 'Grubic, Demjan, Leo Tam, Dan-Adrian Alistarh, and Ce Zhang. “Synchronous
Multi-GPU Training for Deep Learning with Low-Precision Communications: An Empirical
Study.” In Proceedings of the 21st International Conference on Extending Database
Technology, 145–56. OpenProceedings, 2018. https://doi.org/10.5441/002/EDBT.2018.14.'
ieee: 'D. Grubic, L. Tam, D.-A. Alistarh, and C. Zhang, “Synchronous multi-GPU training
for deep learning with low-precision communications: An empirical study,” in Proceedings
of the 21st International Conference on Extending Database Technology, Vienna,
Austria, 2018, pp. 145–156.'
ista: 'Grubic D, Tam L, Alistarh D-A, Zhang C. 2018. Synchronous multi-GPU training
for deep learning with low-precision communications: An empirical study. Proceedings
of the 21st International Conference on Extending Database Technology. EDBT: Conference
on Extending Database Technology, 145–156.'
mla: 'Grubic, Demjan, et al. “Synchronous Multi-GPU Training for Deep Learning with
Low-Precision Communications: An Empirical Study.” Proceedings of the 21st
International Conference on Extending Database Technology, OpenProceedings,
2018, pp. 145–56, doi:10.5441/002/EDBT.2018.14.'
short: D. Grubic, L. Tam, D.-A. Alistarh, C. Zhang, in:, Proceedings of the 21st
International Conference on Extending Database Technology, OpenProceedings, 2018,
pp. 145–156.
conference:
end_date: 2018-03-29
location: Vienna, Austria
name: 'EDBT: Conference on Extending Database Technology'
start_date: 2018-03-26
date_created: 2019-11-26T14:19:11Z
date_published: 2018-03-26T00:00:00Z
date_updated: 2023-02-23T12:59:17Z
day: '26'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.5441/002/EDBT.2018.14
file:
- access_level: open_access
checksum: ec979b56abc71016d6e6adfdadbb4afe
content_type: application/pdf
creator: dernst
date_created: 2019-11-26T14:23:04Z
date_updated: 2020-07-14T12:47:49Z
file_id: '7118'
file_name: 2018_OpenProceedings_Grubic.pdf
file_size: 1603204
relation: main_file
file_date_updated: 2020-07-14T12:47:49Z
has_accepted_license: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 145-156
publication: Proceedings of the 21st International Conference on Extending Database
Technology
publication_identifier:
isbn:
- '9783893180783'
issn:
- 2367-2005
publication_status: published
publisher: OpenProceedings
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Synchronous multi-GPU training for deep learning with low-precision communications:
An empirical study'
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '7407'
abstract:
- lang: eng
text: 'Proofs of space (PoS) [Dziembowski et al., CRYPTO''15] are proof systems
where a prover can convince a verifier that he "wastes" disk space. PoS were introduced
as a more ecological and economical replacement for proofs of work which are currently
used to secure blockchains like Bitcoin. In this work we investigate extensions
of PoS which allow the prover to embed useful data into the dedicated space, which
later can be recovered. Our first contribution is a security proof for the original
PoS from CRYPTO''15 in the random oracle model (the original proof only applied
to a restricted class of adversaries which can store a subset of the data an honest
prover would store). When this PoS is instantiated with recent constructions of
maximally depth robust graphs, our proof implies basically optimal security. As
a second contribution we show three different extensions of this PoS where useful
data can be embedded into the space required by the prover. Our security proof
for the PoS extends (non-trivially) to these constructions. We discuss how some
of these variants can be used as proofs of catalytic space (PoCS), a notion we
put forward in this work, and which basically is a PoS where most of the space
required by the prover can be used to backup useful data. Finally we discuss how
one of the extensions is a candidate construction for a proof of replication (PoR),
a proof system recently suggested in the Filecoin whitepaper. '
alternative_title:
- LIPIcs
article_processing_charge: No
author:
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Pietrzak KZ. Proofs of catalytic space. In: 10th Innovations in Theoretical
Computer Science Conference (ITCS 2019). Vol 124. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2018:59:1-59:25. doi:10.4230/LIPICS.ITCS.2019.59'
apa: 'Pietrzak, K. Z. (2018). Proofs of catalytic space. In 10th Innovations
in Theoretical Computer Science Conference (ITCS 2019) (Vol. 124, p. 59:1-59:25).
San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPICS.ITCS.2019.59'
chicago: Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” In 10th Innovations
in Theoretical Computer Science Conference (ITCS 2019), 124:59:1-59:25. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.ITCS.2019.59.
ieee: K. Z. Pietrzak, “Proofs of catalytic space,” in 10th Innovations in Theoretical
Computer Science Conference (ITCS 2019), San Diego, CA, United States, 2018,
vol. 124, p. 59:1-59:25.
ista: 'Pietrzak KZ. 2018. Proofs of catalytic space. 10th Innovations in Theoretical
Computer Science Conference (ITCS 2019). ITCS: Innovations in theoretical Computer
Science Conference, LIPIcs, vol. 124, 59:1-59:25.'
mla: Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” 10th Innovations in
Theoretical Computer Science Conference (ITCS 2019), vol. 124, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25, doi:10.4230/LIPICS.ITCS.2019.59.
short: K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference
(ITCS 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25.
conference:
end_date: 2019-01-12
location: San Diego, CA, United States
name: 'ITCS: Innovations in theoretical Computer Science Conference'
start_date: 2019-01-10
date_created: 2020-01-30T09:16:05Z
date_published: 2018-12-31T00:00:00Z
date_updated: 2021-01-12T08:13:26Z
day: '31'
ddc:
- '000'
department:
- _id: KrPi
doi: 10.4230/LIPICS.ITCS.2019.59
ec_funded: 1
file:
- access_level: open_access
checksum: 5cebb7f7849a3beda898f697d755dd96
content_type: application/pdf
creator: dernst
date_created: 2020-02-04T08:17:52Z
date_updated: 2020-07-14T12:47:57Z
file_id: '7443'
file_name: 2018_LIPIcs_Pietrzak.pdf
file_size: 822884
relation: main_file
file_date_updated: 2020-07-14T12:47:57Z
has_accepted_license: '1'
intvolume: ' 124'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2018/194
month: '12'
oa: 1
oa_version: Published Version
page: 59:1-59:25
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: 10th Innovations in Theoretical Computer Science Conference (ITCS 2019)
publication_identifier:
isbn:
- 978-3-95977-095-8
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: 1
status: public
title: Proofs of catalytic space
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: 124
year: '2018'
...
---
_id: '6001'
abstract:
- lang: eng
text: "The concurrent memory reclamation problem is that of devising a way for a
deallocating thread to verify that no other concurrent threads hold references
to a memory block being deallocated. To date, in the absence of automatic garbage
collection, there is no satisfactory solution to this problem; existing tracking
methods like hazard pointers, reference counters, or epoch-based techniques like
RCU are either prohibitively expensive or require significant programming expertise
to the extent that implementing them efficiently can be worthy of a publication.
None of the existing techniques are automatic or even semi-automated.\r\nIn this
article, we take a new approach to concurrent memory reclamation. Instead of manually
tracking access to memory locations as done in techniques like hazard pointers,
or restricting shared accesses to specific epoch boundaries as in RCU, our algorithm,
called ThreadScan, leverages operating system signaling to automatically detect
which memory locations are being accessed by concurrent threads.\r\nInitial empirical
evidence shows that ThreadScan scales surprisingly well and requires negligible
programming effort beyond the standard use of Malloc and Free."
article_number: '18'
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: William
full_name: Leiserson, William
last_name: Leiserson
- first_name: Alexander
full_name: Matveev, Alexander
last_name: Matveev
- first_name: Nir
full_name: Shavit, Nir
last_name: Shavit
citation:
ama: 'Alistarh D-A, Leiserson W, Matveev A, Shavit N. ThreadScan: Automatic and
scalable memory reclamation. ACM Transactions on Parallel Computing. 2018;4(4).
doi:10.1145/3201897'
apa: 'Alistarh, D.-A., Leiserson, W., Matveev, A., & Shavit, N. (2018). ThreadScan:
Automatic and scalable memory reclamation. ACM Transactions on Parallel Computing.
Association for Computing Machinery. https://doi.org/10.1145/3201897'
chicago: 'Alistarh, Dan-Adrian, William Leiserson, Alexander Matveev, and Nir Shavit.
“ThreadScan: Automatic and Scalable Memory Reclamation.” ACM Transactions on
Parallel Computing. Association for Computing Machinery, 2018. https://doi.org/10.1145/3201897.'
ieee: 'D.-A. Alistarh, W. Leiserson, A. Matveev, and N. Shavit, “ThreadScan: Automatic
and scalable memory reclamation,” ACM Transactions on Parallel Computing,
vol. 4, no. 4. Association for Computing Machinery, 2018.'
ista: 'Alistarh D-A, Leiserson W, Matveev A, Shavit N. 2018. ThreadScan: Automatic
and scalable memory reclamation. ACM Transactions on Parallel Computing. 4(4),
18.'
mla: 'Alistarh, Dan-Adrian, et al. “ThreadScan: Automatic and Scalable Memory Reclamation.”
ACM Transactions on Parallel Computing, vol. 4, no. 4, 18, Association
for Computing Machinery, 2018, doi:10.1145/3201897.'
short: D.-A. Alistarh, W. Leiserson, A. Matveev, N. Shavit, ACM Transactions on
Parallel Computing 4 (2018).
date_created: 2019-02-14T13:24:11Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2023-02-23T13:17:54Z
day: '01'
department:
- _id: DaAl
doi: 10.1145/3201897
intvolume: ' 4'
issue: '4'
language:
- iso: eng
month: '09'
oa_version: None
publication: ACM Transactions on Parallel Computing
publication_identifier:
issn:
- 2329-4949
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '779'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: 'ThreadScan: Automatic and scalable memory reclamation'
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2018'
...
---
_id: '7812'
abstract:
- lang: eng
text: Deep neural networks (DNNs) continue to make significant advances, solving
tasks from image classification to translation or reinforcement learning. One
aspect of the field receiving considerable attention is efficiently executing
deep models in resource-constrained environments, such as mobile or embedded devices.
This paper focuses on this problem, and proposes two new compression methods,
which jointly leverage weight quantization and distillation of larger teacher
networks into smaller student networks. The first method we propose is called
quantized distillation and leverages distillation during the training process,
by incorporating distillation loss, expressed with respect to the teacher, into
the training of a student network whose weights are quantized to a limited set
of levels. The second method, differentiable quantization, optimizes the location
of quantization points through stochastic gradient descent, to better fit the
behavior of the teacher model. We validate both methods through experiments on
convolutional and recurrent architectures. We show that quantized shallow students
can reach similar accuracy levels to full-precision teacher models, while providing
order of magnitude compression, and inference speedup that is linear in the depth
reduction. In sum, our results enable DNNs for resource-constrained environments
to leverage architecture and accuracy advances developed on more powerful devices.
article_processing_charge: No
author:
- first_name: Antonio
full_name: Polino, Antonio
last_name: Polino
- first_name: Razvan
full_name: Pascanu, Razvan
last_name: Pascanu
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Polino A, Pascanu R, Alistarh D-A. Model compression via distillation and
quantization. In: 6th International Conference on Learning Representations.
; 2018.'
apa: Polino, A., Pascanu, R., & Alistarh, D.-A. (2018). Model compression via
distillation and quantization. In 6th International Conference on Learning
Representations. Vancouver, Canada.
chicago: Polino, Antonio, Razvan Pascanu, and Dan-Adrian Alistarh. “Model Compression
via Distillation and Quantization.” In 6th International Conference on Learning
Representations, 2018.
ieee: A. Polino, R. Pascanu, and D.-A. Alistarh, “Model compression via distillation
and quantization,” in 6th International Conference on Learning Representations,
Vancouver, Canada, 2018.
ista: 'Polino A, Pascanu R, Alistarh D-A. 2018. Model compression via distillation
and quantization. 6th International Conference on Learning Representations. ICLR:
International Conference on Learning Representations.'
mla: Polino, Antonio, et al. “Model Compression via Distillation and Quantization.”
6th International Conference on Learning Representations, 2018.
short: A. Polino, R. Pascanu, D.-A. Alistarh, in:, 6th International Conference
on Learning Representations, 2018.
conference:
end_date: 2018-05-03
location: Vancouver, Canada
name: 'ICLR: International Conference on Learning Representations'
start_date: 2018-04-30
date_created: 2020-05-10T22:00:51Z
date_published: 2018-05-01T00:00:00Z
date_updated: 2023-02-23T13:18:41Z
day: '01'
ddc:
- '000'
department:
- _id: DaAl
external_id:
arxiv:
- '1802.05668'
file:
- access_level: open_access
checksum: a4336c167978e81891970e4e4517a8c3
content_type: application/pdf
creator: dernst
date_created: 2020-05-26T13:02:00Z
date_updated: 2020-07-14T12:48:03Z
file_id: '7894'
file_name: 2018_ICLR_Polino.pdf
file_size: 308339
relation: main_file
file_date_updated: 2020-07-14T12:48:03Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
publication: 6th International Conference on Learning Representations
publication_status: published
quality_controlled: '1'
scopus_import: 1
status: public
title: Model compression via distillation and quantization
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '8547'
abstract:
- lang: eng
text: The cerebral cortex contains multiple hierarchically organized areas with
distinctive cytoarchitectonical patterns, but the cellular mechanisms underlying
the emergence of this diversity remain unclear. Here, we have quantitatively investigated
the neuronal output of individual progenitor cells in the ventricular zone of
the developing mouse neocortex using a combination of methods that together circumvent
the biases and limitations of individual approaches. We found that individual
cortical progenitor cells show a high degree of stochasticity and generate pyramidal
cell lineages that adopt a wide range of laminar configurations. Mathematical
modelling these lineage data suggests that a small number of progenitor cell populations,
each generating pyramidal cells following different stochastic developmental programs,
suffice to generate the heterogenous complement of pyramidal cell lineages that
collectively build the complex cytoarchitecture of the neocortex.
acknowledgement: We thank I. Andrew and S.E. Bae for excellent technical assistance,
F. Gage for plasmids, and K. Nave (Nex-Cre) for mouse colonies. We thank members
of the Marín and Rico laboratories for stimulating discussions and ideas. Our research
on this topic is supported by grants from the European Research Council (ERC-2017-AdG
787355 to O.M and ERC2016-CoG 725780 to S.H.) and Wellcome Trust (103714MA) to O.M.
L.L. was the recipient of an EMBO long-term postdoctoral fellowship, R.B. received
support from FWF Lise-Meitner program (M 2416) and F.K.W. was supported by an EMBO
postdoctoral fellowship and is currently a Marie Skłodowska-Curie Fellow from the
European Commission under the H2020 Programme.
article_processing_charge: No
author:
- first_name: Alfredo
full_name: Llorca, Alfredo
last_name: Llorca
- first_name: Gabriele
full_name: Ciceri, Gabriele
last_name: Ciceri
- first_name: Robert J
full_name: Beattie, Robert J
id: 2E26DF60-F248-11E8-B48F-1D18A9856A87
last_name: Beattie
orcid: 0000-0002-8483-8753
- first_name: Fong K.
full_name: Wong, Fong K.
last_name: Wong
- first_name: Giovanni
full_name: Diana, Giovanni
last_name: Diana
- first_name: Eleni
full_name: Serafeimidou, Eleni
last_name: Serafeimidou
- first_name: Marian
full_name: Fernández-Otero, Marian
last_name: Fernández-Otero
- first_name: Carmen
full_name: Streicher, Carmen
id: 36BCB99C-F248-11E8-B48F-1D18A9856A87
last_name: Streicher
- first_name: Sebastian J.
full_name: Arnold, Sebastian J.
last_name: Arnold
- first_name: Martin
full_name: Meyer, Martin
last_name: Meyer
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
- first_name: Miguel
full_name: Maravall, Miguel
last_name: Maravall
- first_name: Oscar
full_name: Marín, Oscar
last_name: Marín
citation:
ama: Llorca A, Ciceri G, Beattie RJ, et al. Heterogeneous progenitor cell behaviors
underlie the assembly of neocortical cytoarchitecture. bioRxiv. doi:10.1101/494088
apa: Llorca, A., Ciceri, G., Beattie, R. J., Wong, F. K., Diana, G., Serafeimidou,
E., … Marín, O. (n.d.). Heterogeneous progenitor cell behaviors underlie the assembly
of neocortical cytoarchitecture. bioRxiv. Cold Spring Harbor Laboratory.
https://doi.org/10.1101/494088
chicago: Llorca, Alfredo, Gabriele Ciceri, Robert J Beattie, Fong K. Wong, Giovanni
Diana, Eleni Serafeimidou, Marian Fernández-Otero, et al. “Heterogeneous Progenitor
Cell Behaviors Underlie the Assembly of Neocortical Cytoarchitecture.” BioRxiv.
Cold Spring Harbor Laboratory, n.d. https://doi.org/10.1101/494088.
ieee: A. Llorca et al., “Heterogeneous progenitor cell behaviors underlie
the assembly of neocortical cytoarchitecture,” bioRxiv. Cold Spring Harbor
Laboratory.
ista: Llorca A, Ciceri G, Beattie RJ, Wong FK, Diana G, Serafeimidou E, Fernández-Otero
M, Streicher C, Arnold SJ, Meyer M, Hippenmeyer S, Maravall M, Marín O. Heterogeneous
progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture.
bioRxiv, 10.1101/494088.
mla: Llorca, Alfredo, et al. “Heterogeneous Progenitor Cell Behaviors Underlie the
Assembly of Neocortical Cytoarchitecture.” BioRxiv, Cold Spring Harbor
Laboratory, doi:10.1101/494088.
short: A. Llorca, G. Ciceri, R.J. Beattie, F.K. Wong, G. Diana, E. Serafeimidou,
M. Fernández-Otero, C. Streicher, S.J. Arnold, M. Meyer, S. Hippenmeyer, M. Maravall,
O. Marín, BioRxiv (n.d.).
date_created: 2020-09-21T12:01:50Z
date_published: 2018-12-13T00:00:00Z
date_updated: 2021-01-12T08:20:00Z
day: '13'
department:
- _id: SiHi
doi: 10.1101/494088
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1101/494088
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 260018B0-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '725780'
name: Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development
- _id: 264E56E2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02416
name: Molecular Mechanisms Regulating Gliogenesis in the Cerebral Cortex
publication: bioRxiv
publication_status: submitted
publisher: Cold Spring Harbor Laboratory
status: public
title: Heterogeneous progenitor cell behaviors underlie the assembly of neocortical
cytoarchitecture
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '86'
abstract:
- lang: eng
text: Responsiveness—the requirement that every request to a system be eventually
handled—is one of the fundamental liveness properties of a reactive system. Average
response time is a quantitative measure for the responsiveness requirement used
commonly in performance evaluation. We show how average response time can be computed
on state-transition graphs, on Markov chains, and on game graphs. In all three
cases, we give polynomial-time algorithms.
acknowledgement: 'This research was supported in part by the Austrian Science Fund
(FWF) under grants S11402-N23, S11407-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein
Award), ERC Start grant (279307: Graph Games), Vienna Science and Technology Fund
(WWTF) through project ICT15-003 and by the National Science Centre (NCN), Poland
under grant 2014/15/D/ST6/04543.'
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: 'Chatterjee K, Henzinger TA, Otop J. Computing average response time. In: Lohstroh
M, Derler P, Sirjani M, eds. Principles of Modeling. Vol 10760. Springer;
2018:143-161. doi:10.1007/978-3-319-95246-8_9'
apa: Chatterjee, K., Henzinger, T. A., & Otop, J. (2018). Computing average
response time. In M. Lohstroh, P. Derler, & M. Sirjani (Eds.), Principles
of Modeling (Vol. 10760, pp. 143–161). Springer. https://doi.org/10.1007/978-3-319-95246-8_9
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Computing Average
Response Time.” In Principles of Modeling, edited by Marten Lohstroh, Patricia
Derler, and Marjan Sirjani, 10760:143–61. Springer, 2018. https://doi.org/10.1007/978-3-319-95246-8_9.
ieee: K. Chatterjee, T. A. Henzinger, and J. Otop, “Computing average response time,”
in Principles of Modeling, vol. 10760, M. Lohstroh, P. Derler, and M. Sirjani,
Eds. Springer, 2018, pp. 143–161.
ista: 'Chatterjee K, Henzinger TA, Otop J. 2018.Computing average response time.
In: Principles of Modeling. LNCS, vol. 10760, 143–161.'
mla: Chatterjee, Krishnendu, et al. “Computing Average Response Time.” Principles
of Modeling, edited by Marten Lohstroh et al., vol. 10760, Springer, 2018,
pp. 143–61, doi:10.1007/978-3-319-95246-8_9.
short: K. Chatterjee, T.A. Henzinger, J. Otop, in:, M. Lohstroh, P. Derler, M. Sirjani
(Eds.), Principles of Modeling, Springer, 2018, pp. 143–161.
date_created: 2018-12-11T11:44:33Z
date_published: 2018-07-20T00:00:00Z
date_updated: 2021-01-12T08:20:14Z
day: '20'
ddc:
- '000'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-319-95246-8_9
ec_funded: 1
editor:
- first_name: Marten
full_name: Lohstroh, Marten
last_name: Lohstroh
- first_name: Patricia
full_name: Derler, Patricia
last_name: Derler
- first_name: Marjan
full_name: Sirjani, Marjan
last_name: Sirjani
file:
- access_level: open_access
checksum: 9995c6ce6957333baf616fc4f20be597
content_type: application/pdf
creator: dernst
date_created: 2019-11-19T08:22:18Z
date_updated: 2020-07-14T12:48:14Z
file_id: '7053'
file_name: 2018_PrinciplesModeling_Chatterjee.pdf
file_size: 516307
relation: main_file
file_date_updated: 2020-07-14T12:48:14Z
has_accepted_license: '1'
intvolume: ' 10760'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 143 - 161
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication: Principles of Modeling
publication_status: published
publisher: Springer
publist_id: '7968'
quality_controlled: '1'
scopus_import: 1
status: public
title: Computing average response time
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10760
year: '2018'
...
---
_id: '9229'
alternative_title:
- Molecular and cellular neuroscience
article_processing_charge: No
article_type: letter_note
author:
- first_name: Johann G
full_name: Danzl, Johann G
id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87
last_name: Danzl
orcid: 0000-0001-8559-3973
citation:
ama: Danzl JG. Diffraction-unlimited optical imaging for synaptic physiology. Opera
Medica et Physiologica. 2018;4(S1):11. doi:10.20388/omp2018.00s1.001
apa: Danzl, J. G. (2018). Diffraction-unlimited optical imaging for synaptic physiology.
Opera Medica et Physiologica. Lobachevsky State University of Nizhny Novgorod.
https://doi.org/10.20388/omp2018.00s1.001
chicago: Danzl, Johann G. “Diffraction-Unlimited Optical Imaging for Synaptic Physiology.”
Opera Medica et Physiologica. Lobachevsky State University of Nizhny Novgorod,
2018. https://doi.org/10.20388/omp2018.00s1.001.
ieee: J. G. Danzl, “Diffraction-unlimited optical imaging for synaptic physiology,”
Opera Medica et Physiologica, vol. 4, no. S1. Lobachevsky State University
of Nizhny Novgorod, p. 11, 2018.
ista: Danzl JG. 2018. Diffraction-unlimited optical imaging for synaptic physiology.
Opera Medica et Physiologica. 4(S1), 11.
mla: Danzl, Johann G. “Diffraction-Unlimited Optical Imaging for Synaptic Physiology.”
Opera Medica et Physiologica, vol. 4, no. S1, Lobachevsky State University
of Nizhny Novgorod, 2018, p. 11, doi:10.20388/omp2018.00s1.001.
short: J.G. Danzl, Opera Medica et Physiologica 4 (2018) 11.
date_created: 2021-03-07T23:01:25Z
date_published: 2018-06-30T00:00:00Z
date_updated: 2021-12-03T07:31:05Z
day: '30'
department:
- _id: JoDa
doi: 10.20388/omp2018.00s1.001
intvolume: ' 4'
issue: S1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://operamedphys.org/content/molecular-and-cellular-neuroscience
month: '06'
oa: 1
oa_version: Published Version
page: '11'
publication: Opera Medica et Physiologica
publication_identifier:
eissn:
- 2500-2295
issn:
- 2500-2287
publication_status: published
publisher: Lobachevsky State University of Nizhny Novgorod
quality_controlled: '1'
scopus_import: '1'
status: public
title: Diffraction-unlimited optical imaging for synaptic physiology
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 4
year: '2018'
...
---
_id: '6005'
abstract:
- lang: eng
text: Network games are widely used as a model for selfish resource-allocation problems.
In the classicalmodel, each player selects a path connecting her source and target
vertices. The cost of traversingan edge depends on theload; namely, number of
players that traverse it. Thus, it abstracts the factthat different users may
use a resource at different times and for different durations, which playsan important
role in determining the costs of the users in reality. For example, when transmittingpackets
in a communication network, routing traffic in a road network, or processing a
task in aproduction system, actual sharing and congestion of resources crucially
depends on time.In [13], we introducedtimed network games, which add a time component
to network games.Each vertexvin the network is associated with a cost function,
mapping the load onvto theprice that a player pays for staying invfor one time
unit with this load. Each edge in thenetwork is guarded by the time intervals
in which it can be traversed, which forces the players tospend time in the vertices.
In this work we significantly extend the way time can be referred toin timed network
games. In the model we study, the network is equipped withclocks, and, as intimed
automata, edges are guarded by constraints on the values of the clocks, and their
traversalmay involve a reset of some clocks. We argue that the stronger model
captures many realisticnetworks. The addition of clocks breaks the techniques
we developed in [13] and we developnew techniques in order to show that positive
results on classic network games carry over to thestronger timed setting.
alternative_title:
- LIPIcs
article_number: '23'
article_processing_charge: No
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Shibashis
full_name: Guha, Shibashis
last_name: Guha
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: 'Avni G, Guha S, Kupferman O. Timed network games with clocks. In: Vol 117.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPICS.MFCS.2018.23'
apa: 'Avni, G., Guha, S., & Kupferman, O. (2018). Timed network games with clocks
(Vol. 117). Presented at the MFCS: Mathematical Foundations of Computer Science,
Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPICS.MFCS.2018.23'
chicago: Avni, Guy, Shibashis Guha, and Orna Kupferman. “Timed Network Games with
Clocks,” Vol. 117. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.MFCS.2018.23.
ieee: 'G. Avni, S. Guha, and O. Kupferman, “Timed network games with clocks,” presented
at the MFCS: Mathematical Foundations of Computer Science, Liverpool, United Kingdom,
2018, vol. 117.'
ista: 'Avni G, Guha S, Kupferman O. 2018. Timed network games with clocks. MFCS:
Mathematical Foundations of Computer Science, LIPIcs, vol. 117, 23.'
mla: Avni, Guy, et al. Timed Network Games with Clocks. Vol. 117, 23, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.MFCS.2018.23.
short: G. Avni, S. Guha, O. Kupferman, in:, Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2018.
conference:
end_date: 2018-08-31
location: Liverpool, United Kingdom
name: 'MFCS: Mathematical Foundations of Computer Science'
start_date: 2018-08-27
date_created: 2019-02-14T14:12:09Z
date_published: 2018-08-01T00:00:00Z
date_updated: 2023-02-23T14:02:58Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.4230/LIPICS.MFCS.2018.23
file:
- access_level: open_access
checksum: 41ab2ae9b63f5eb49fa995250c0ba128
content_type: application/pdf
creator: dernst
date_created: 2019-02-14T14:22:04Z
date_updated: 2020-07-14T12:47:15Z
file_id: '6007'
file_name: 2018_LIPIcs_Avni.pdf
file_size: 542889
relation: main_file
file_date_updated: 2020-07-14T12:47:15Z
has_accepted_license: '1'
intvolume: ' 117'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 264B3912-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02369
name: Formal Methods meets Algorithmic Game Theory
publication_identifier:
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '963'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Timed network games with clocks
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: 117
year: '2018'
...
---
_id: '315'
abstract:
- lang: eng
text: 'More than 100 years after Grigg’s influential analysis of species’ borders,
the causes of limits to species’ ranges still represent a puzzle that has never
been understood with clarity. The topic has become especially important recently
as many scientists have become interested in the potential for species’ ranges
to shift in response to climate change—and yet nearly all of those studies fail
to recognise or incorporate evolutionary genetics in a way that relates to theoretical
developments. I show that range margins can be understood based on just two measurable
parameters: (i) the fitness cost of dispersal—a measure of environmental heterogeneity—and
(ii) the strength of genetic drift, which reduces genetic diversity. Together,
these two parameters define an ‘expansion threshold’: adaptation fails when genetic
drift reduces genetic diversity below that required for adaptation to a heterogeneous
environment. When the key parameters drop below this expansion threshold locally,
a sharp range margin forms. When they drop below this threshold throughout the
species’ range, adaptation collapses everywhere, resulting in either extinction
or formation of a fragmented metapopulation. Because the effects of dispersal
differ fundamentally with dimension, the second parameter—the strength of genetic
drift—is qualitatively different compared to a linear habitat. In two-dimensional
habitats, genetic drift becomes effectively independent of selection. It decreases
with ‘neighbourhood size’—the number of individuals accessible by dispersal within
one generation. Moreover, in contrast to earlier predictions, which neglected
evolution of genetic variance and/or stochasticity in two dimensions, dispersal
into small marginal populations aids adaptation. This is because the reduction
of both genetic and demographic stochasticity has a stronger effect than the cost
of dispersal through increased maladaptation. The expansion threshold thus provides
a novel, theoretically justified, and testable prediction for formation of the
range margin and collapse of the species’ range.'
article_number: e2005372
author:
- first_name: Jitka
full_name: Polechova, Jitka
id: 3BBFB084-F248-11E8-B48F-1D18A9856A87
last_name: Polechova
orcid: 0000-0003-0951-3112
citation:
ama: Polechova J. Is the sky the limit? On the expansion threshold of a species’
range. PLoS Biology. 2018;16(6). doi:10.1371/journal.pbio.2005372
apa: Polechova, J. (2018). Is the sky the limit? On the expansion threshold of a
species’ range. PLoS Biology. Public Library of Science. https://doi.org/10.1371/journal.pbio.2005372
chicago: Polechova, Jitka. “Is the Sky the Limit? On the Expansion Threshold of
a Species’ Range.” PLoS Biology. Public Library of Science, 2018. https://doi.org/10.1371/journal.pbio.2005372.
ieee: J. Polechova, “Is the sky the limit? On the expansion threshold of a species’
range,” PLoS Biology, vol. 16, no. 6. Public Library of Science, 2018.
ista: Polechova J. 2018. Is the sky the limit? On the expansion threshold of a species’
range. PLoS Biology. 16(6), e2005372.
mla: Polechova, Jitka. “Is the Sky the Limit? On the Expansion Threshold of a Species’
Range.” PLoS Biology, vol. 16, no. 6, e2005372, Public Library of Science,
2018, doi:10.1371/journal.pbio.2005372.
short: J. Polechova, PLoS Biology 16 (2018).
date_created: 2018-12-11T11:45:46Z
date_published: 2018-06-15T00:00:00Z
date_updated: 2023-02-23T14:10:16Z
day: '15'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.1371/journal.pbio.2005372
file:
- access_level: open_access
checksum: 908c52751bba30c55ed36789e5e4c84d
content_type: application/pdf
creator: dernst
date_created: 2019-01-22T08:30:03Z
date_updated: 2020-07-14T12:46:01Z
file_id: '5870'
file_name: 2017_PLOS_Polechova.pdf
file_size: 6968201
relation: main_file
file_date_updated: 2020-07-14T12:46:01Z
has_accepted_license: '1'
intvolume: ' 16'
issue: '6'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: PLoS Biology
publication_identifier:
issn:
- '15449173'
publication_status: published
publisher: Public Library of Science
publist_id: '7550'
quality_controlled: '1'
related_material:
record:
- id: '9839'
relation: research_data
status: public
scopus_import: 1
status: public
title: Is the sky the limit? On the expansion threshold of a species’ range
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: 16
year: '2018'
...