---
_id: '5914'
abstract:
- lang: eng
text: With the advent of optogenetics, it became possible to change the activity
of a targeted population of neurons in a temporally controlled manner. To combine
the advantages of 60-channel in vivo tetrode recording and laser-based optogenetics,
we have developed a closed-loop recording system that allows for the actual electrophysiological
signal to be used as a trigger for the laser light mediating the optogenetic intervention.
We have optimized the weight, size, and shape of the corresponding implant to
make it compatible with the size, force, and movements of a behaving mouse, and
we have shown that the system can efficiently block sharp wave ripple (SWR) events
using those events themselves as a trigger. To demonstrate the full potential
of the optogenetic recording system we present a pilot study addressing the contribution
of SWR events to learning in a complex behavioral task.
article_number: e0087
article_processing_charge: No
author:
- first_name: Dámaris K
full_name: Rangel Guerrero, Dámaris K
id: 4871BCE6-F248-11E8-B48F-1D18A9856A87
last_name: Rangel Guerrero
orcid: 0000-0002-8602-4374
- first_name: James G.
full_name: Donnett, James G.
last_name: Donnett
- first_name: Jozsef L
full_name: Csicsvari, Jozsef L
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
- first_name: Krisztián
full_name: Kovács, Krisztián
id: 2AB5821E-F248-11E8-B48F-1D18A9856A87
last_name: Kovács
orcid: 0000-0001-6251-1007
citation:
ama: 'Rangel Guerrero DK, Donnett JG, Csicsvari JL, Kovács K. Tetrode recording
from the hippocampus of behaving mice coupled with four-point-irradiation closed-loop
optogenetics: A technique to study the contribution of Hippocampal SWR events
to learning. eNeuro. 2018;5(4). doi:10.1523/ENEURO.0087-18.2018'
apa: 'Rangel Guerrero, D. K., Donnett, J. G., Csicsvari, J. L., & Kovács, K.
(2018). Tetrode recording from the hippocampus of behaving mice coupled with four-point-irradiation
closed-loop optogenetics: A technique to study the contribution of Hippocampal
SWR events to learning. ENeuro. Society of Neuroscience. https://doi.org/10.1523/ENEURO.0087-18.2018'
chicago: 'Rangel Guerrero, Dámaris K, James G. Donnett, Jozsef L Csicsvari, and
Krisztián Kovács. “Tetrode Recording from the Hippocampus of Behaving Mice Coupled
with Four-Point-Irradiation Closed-Loop Optogenetics: A Technique to Study the
Contribution of Hippocampal SWR Events to Learning.” ENeuro. Society of
Neuroscience, 2018. https://doi.org/10.1523/ENEURO.0087-18.2018.'
ieee: 'D. K. Rangel Guerrero, J. G. Donnett, J. L. Csicsvari, and K. Kovács, “Tetrode
recording from the hippocampus of behaving mice coupled with four-point-irradiation
closed-loop optogenetics: A technique to study the contribution of Hippocampal
SWR events to learning,” eNeuro, vol. 5, no. 4. Society of Neuroscience,
2018.'
ista: 'Rangel Guerrero DK, Donnett JG, Csicsvari JL, Kovács K. 2018. Tetrode recording
from the hippocampus of behaving mice coupled with four-point-irradiation closed-loop
optogenetics: A technique to study the contribution of Hippocampal SWR events
to learning. eNeuro. 5(4), e0087.'
mla: 'Rangel Guerrero, Dámaris K., et al. “Tetrode Recording from the Hippocampus
of Behaving Mice Coupled with Four-Point-Irradiation Closed-Loop Optogenetics:
A Technique to Study the Contribution of Hippocampal SWR Events to Learning.”
ENeuro, vol. 5, no. 4, e0087, Society of Neuroscience, 2018, doi:10.1523/ENEURO.0087-18.2018.'
short: D.K. Rangel Guerrero, J.G. Donnett, J.L. Csicsvari, K. Kovács, ENeuro 5 (2018).
date_created: 2019-02-03T22:59:16Z
date_published: 2018-07-27T00:00:00Z
date_updated: 2024-03-25T23:30:06Z
day: '27'
ddc:
- '570'
department:
- _id: JoCs
doi: 10.1523/ENEURO.0087-18.2018
ec_funded: 1
external_id:
isi:
- '000443994700007'
file:
- access_level: open_access
checksum: f4915d45fc7ad4648b7b7a13fdecca01
content_type: application/pdf
creator: dernst
date_created: 2019-02-05T12:48:36Z
date_updated: 2020-07-14T12:47:13Z
file_id: '5921'
file_name: 2018_ENeuro_Guerrero.pdf
file_size: 3746884
relation: main_file
file_date_updated: 2020-07-14T12:47:13Z
has_accepted_license: '1'
intvolume: ' 5'
isi: 1
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 257D4372-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I2072-B27
name: Interneuron plasticity during spatial learning
publication: eNeuro
publication_status: published
publisher: Society of Neuroscience
quality_controlled: '1'
related_material:
record:
- id: '6849'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'Tetrode recording from the hippocampus of behaving mice coupled with four-point-irradiation
closed-loop optogenetics: A technique to study the contribution of Hippocampal SWR
events to learning'
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: 5
year: '2018'
...
---
_id: '5959'
abstract:
- lang: eng
text: Formalizing properties of systems with continuous dynamics is a challenging
task. In this paper, we propose a formal framework for specifying and monitoring
rich temporal properties of real-valued signals. We introduce signal first-order
logic (SFO) as a specification language that combines first-order logic with linear-real
arithmetic and unary function symbols interpreted as piecewise-linear signals.
We first show that while the satisfiability problem for SFO is undecidable, its
membership and monitoring problems are decidable. We develop an offline monitoring
procedure for SFO that has polynomial complexity in the size of the input trace
and the specification, for a fixed number of quantifiers and function symbols.
We show that the algorithm has computation time linear in the size of the input
trace for the important fragment of bounded-response specifications interpreted
over input traces with finite variability. We can use our results to extend signal
temporal logic with first-order quantifiers over time and value parameters, while
preserving its efficient monitoring. We finally demonstrate the practical appeal
of our logic through a case study in the micro-electronics domain.
article_processing_charge: No
author:
- first_name: Alexey
full_name: Bakhirkin, Alexey
last_name: Bakhirkin
- first_name: Thomas
full_name: Ferrere, Thomas
id: 40960E6E-F248-11E8-B48F-1D18A9856A87
last_name: Ferrere
orcid: 0000-0001-5199-3143
- 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: Deian
full_name: Nickovicl, Deian
last_name: Nickovicl
citation:
ama: 'Bakhirkin A, Ferrere T, Henzinger TA, Nickovicl D. Keynote: The first-order
logic of signals. In: 2018 International Conference on Embedded Software.
IEEE; 2018:1-10. doi:10.1109/emsoft.2018.8537203'
apa: 'Bakhirkin, A., Ferrere, T., Henzinger, T. A., & Nickovicl, D. (2018).
Keynote: The first-order logic of signals. In 2018 International Conference
on Embedded Software (pp. 1–10). Turin, Italy: IEEE. https://doi.org/10.1109/emsoft.2018.8537203'
chicago: 'Bakhirkin, Alexey, Thomas Ferrere, Thomas A Henzinger, and Deian Nickovicl.
“Keynote: The First-Order Logic of Signals.” In 2018 International Conference
on Embedded Software, 1–10. IEEE, 2018. https://doi.org/10.1109/emsoft.2018.8537203.'
ieee: 'A. Bakhirkin, T. Ferrere, T. A. Henzinger, and D. Nickovicl, “Keynote: The
first-order logic of signals,” in 2018 International Conference on Embedded
Software, Turin, Italy, 2018, pp. 1–10.'
ista: 'Bakhirkin A, Ferrere T, Henzinger TA, Nickovicl D. 2018. Keynote: The first-order
logic of signals. 2018 International Conference on Embedded Software. EMSOFT:
International Conference on Embedded Software, 1–10.'
mla: 'Bakhirkin, Alexey, et al. “Keynote: The First-Order Logic of Signals.” 2018
International Conference on Embedded Software, IEEE, 2018, pp. 1–10, doi:10.1109/emsoft.2018.8537203.'
short: A. Bakhirkin, T. Ferrere, T.A. Henzinger, D. Nickovicl, in:, 2018 International
Conference on Embedded Software, IEEE, 2018, pp. 1–10.
conference:
end_date: 2018-10-05
location: Turin, Italy
name: 'EMSOFT: International Conference on Embedded Software'
start_date: 2018-09-30
date_created: 2019-02-13T09:19:28Z
date_published: 2018-09-30T00:00:00Z
date_updated: 2023-09-19T10:41:29Z
day: '30'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1109/emsoft.2018.8537203
external_id:
isi:
- '000492828500005'
file:
- access_level: open_access
checksum: 234a33ad9055b3458fcdda6af251b33a
content_type: application/pdf
creator: dernst
date_created: 2020-05-14T16:01:29Z
date_updated: 2020-07-14T12:47:13Z
file_id: '7839'
file_name: 2018_EMSOFT_Bakhirkin.pdf
file_size: 338006
relation: main_file
file_date_updated: 2020-07-14T12:47:13Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 1-10
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
publication: 2018 International Conference on Embedded Software
publication_identifier:
isbn:
- '9781538655603'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Keynote: The first-order logic of signals'
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '5960'
abstract:
- lang: eng
text: In this paper we present a reliable method to verify the existence of loops
along the uncertain trajectory of a robot, based on proprioceptive measurements
only, within a bounded-error context. The loop closure detection is one of the
key points in simultaneous localization and mapping (SLAM) methods, especially
in homogeneous environments with difficult scenes recognitions. The proposed approach
is generic and could be coupled with conventional SLAM algorithms to reliably
reduce their computing burden, thus improving the localization and mapping processes
in the most challenging environments such as unexplored underwater extents. To
prove that a robot performed a loop whatever the uncertainties in its evolution,
we employ the notion of topological degree that originates in the field of differential
topology. We show that a verification tool based on the topological degree is
an optimal method for proving robot loops. This is demonstrated both on datasets
from real missions involving autonomous underwater vehicles and by a mathematical
discussion.
article_processing_charge: No
arxiv: 1
author:
- first_name: Simon
full_name: Rohou, Simon
last_name: Rohou
- first_name: Peter
full_name: Franek, Peter
id: 473294AE-F248-11E8-B48F-1D18A9856A87
last_name: Franek
orcid: 0000-0001-8878-8397
- first_name: Clément
full_name: Aubry, Clément
last_name: Aubry
- first_name: Luc
full_name: Jaulin, Luc
last_name: Jaulin
citation:
ama: Rohou S, Franek P, Aubry C, Jaulin L. Proving the existence of loops in robot
trajectories. The International Journal of Robotics Research. 2018;37(12):1500-1516.
doi:10.1177/0278364918808367
apa: Rohou, S., Franek, P., Aubry, C., & Jaulin, L. (2018). Proving the existence
of loops in robot trajectories. The International Journal of Robotics Research.
SAGE Publications. https://doi.org/10.1177/0278364918808367
chicago: Rohou, Simon, Peter Franek, Clément Aubry, and Luc Jaulin. “Proving the
Existence of Loops in Robot Trajectories.” The International Journal of Robotics
Research. SAGE Publications, 2018. https://doi.org/10.1177/0278364918808367.
ieee: S. Rohou, P. Franek, C. Aubry, and L. Jaulin, “Proving the existence of loops
in robot trajectories,” The International Journal of Robotics Research,
vol. 37, no. 12. SAGE Publications, pp. 1500–1516, 2018.
ista: Rohou S, Franek P, Aubry C, Jaulin L. 2018. Proving the existence of loops
in robot trajectories. The International Journal of Robotics Research. 37(12),
1500–1516.
mla: Rohou, Simon, et al. “Proving the Existence of Loops in Robot Trajectories.”
The International Journal of Robotics Research, vol. 37, no. 12, SAGE Publications,
2018, pp. 1500–16, doi:10.1177/0278364918808367.
short: S. Rohou, P. Franek, C. Aubry, L. Jaulin, The International Journal of Robotics
Research 37 (2018) 1500–1516.
date_created: 2019-02-13T09:36:20Z
date_published: 2018-10-24T00:00:00Z
date_updated: 2023-09-19T10:41:59Z
day: '24'
department:
- _id: UlWa
doi: 10.1177/0278364918808367
external_id:
arxiv:
- '1712.01341'
isi:
- '000456881100004'
intvolume: ' 37'
isi: 1
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1712.01341
month: '10'
oa: 1
oa_version: Preprint
page: 1500-1516
publication: The International Journal of Robotics Research
publication_identifier:
eissn:
- 1741-3176
issn:
- 0278-3649
publication_status: published
publisher: SAGE Publications
quality_controlled: '1'
scopus_import: '1'
status: public
title: Proving the existence of loops in robot trajectories
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 37
year: '2018'
...
---
_id: '5961'
abstract:
- lang: eng
text: "The area of machine learning has made considerable progress over the past
decade, enabled by the widespread availability of large datasets, as well as by
improved algorithms and models. Given the large computational demands of machine
learning workloads, parallelism, implemented either through single-node concurrency
or through multi-node distribution, has been a third key ingredient to advances
in machine learning.\r\nThe goal of this tutorial is to provide the audience with
an overview of standard distribution techniques in machine learning, with an eye
towards the intriguing trade-offs between synchronization and communication costs
of distributed machine learning algorithms, on the one hand, and their convergence,
on the other.The tutorial will focus on parallelization strategies for the fundamental
stochastic gradient descent (SGD) algorithm, which is a key tool when training
machine learning models, from classical instances such as linear regression, to
state-of-the-art neural network architectures.\r\nThe tutorial will describe the
guarantees provided by this algorithm in the sequential case, and then move on
to cover both shared-memory and message-passing parallelization strategies, together
with the guarantees they provide, and corresponding trade-offs. The presentation
will conclude with a broad overview of ongoing research in distributed and concurrent
machine learning. The tutorial will assume no prior knowledge beyond familiarity
with basic concepts in algebra and analysis.\r\n"
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
citation:
ama: 'Alistarh D-A. A brief tutorial on distributed and concurrent machine learning.
In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing
- PODC ’18. ACM Press; 2018:487-488. doi:10.1145/3212734.3212798'
apa: 'Alistarh, D.-A. (2018). A brief tutorial on distributed and concurrent machine
learning. In Proceedings of the 2018 ACM Symposium on Principles of Distributed
Computing - PODC ’18 (pp. 487–488). Egham, United Kingdom: ACM Press. https://doi.org/10.1145/3212734.3212798'
chicago: Alistarh, Dan-Adrian. “A Brief Tutorial on Distributed and Concurrent Machine
Learning.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed
Computing - PODC ’18, 487–88. ACM Press, 2018. https://doi.org/10.1145/3212734.3212798.
ieee: D.-A. Alistarh, “A brief tutorial on distributed and concurrent machine learning,”
in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing
- PODC ’18, Egham, United Kingdom, 2018, pp. 487–488.
ista: 'Alistarh D-A. 2018. A brief tutorial on distributed and concurrent machine
learning. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing
- PODC ’18. PODC: Principles of Distributed Computing, 487–488.'
mla: Alistarh, Dan-Adrian. “A Brief Tutorial on Distributed and Concurrent Machine
Learning.” Proceedings of the 2018 ACM Symposium on Principles of Distributed
Computing - PODC ’18, ACM Press, 2018, pp. 487–88, doi:10.1145/3212734.3212798.
short: D.-A. Alistarh, in:, Proceedings of the 2018 ACM Symposium on Principles
of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 487–488.
conference:
end_date: 2018-07-27
location: Egham, United Kingdom
name: 'PODC: Principles of Distributed Computing'
start_date: 2018-07-23
date_created: 2019-02-13T09:48:55Z
date_published: 2018-07-27T00:00:00Z
date_updated: 2023-09-19T10:42:28Z
day: '27'
department:
- _id: DaAl
doi: 10.1145/3212734.3212798
external_id:
isi:
- '000458186900063'
isi: 1
language:
- iso: eng
month: '07'
oa_version: None
page: 487-488
publication: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing -
PODC '18
publication_identifier:
isbn:
- '9781450357951'
publication_status: published
publisher: ACM Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: A brief tutorial on distributed and concurrent machine learning
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '5962'
abstract:
- lang: eng
text: Stochastic Gradient Descent (SGD) is a fundamental algorithm in machine learning,
representing the optimization backbone for training several classic models, from
regression to neural networks. Given the recent practical focus on distributed
machine learning, significant work has been dedicated to the convergence properties
of this algorithm under the inconsistent and noisy updates arising from execution
in a distributed environment. However, surprisingly, the convergence properties
of this classic algorithm in the standard shared-memory model are still not well-understood.
In this work, we address this gap, and provide new convergence bounds for lock-free
concurrent stochastic gradient descent, executing in the classic asynchronous
shared memory model, against a strong adaptive adversary. Our results give improved
upper and lower bounds on the "price of asynchrony'' when executing the fundamental
SGD algorithm in a concurrent setting. They show that this classic optimization
tool can converge faster and with a wider range of parameters than previously
known under asynchronous iterations. At the same time, we exhibit a fundamental
trade-off between the maximum delay in the system and the rate at which SGD can
converge, which governs the set of parameters under which this algorithm can still
work efficiently.
article_processing_charge: No
arxiv: 1
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Christopher
full_name: De Sa, Christopher
last_name: De Sa
- first_name: Nikola H
full_name: Konstantinov, Nikola H
id: 4B9D76E4-F248-11E8-B48F-1D18A9856A87
last_name: Konstantinov
citation:
ama: 'Alistarh D-A, De Sa C, Konstantinov NH. The convergence of stochastic gradient
descent in asynchronous shared memory. In: Proceedings of the 2018 ACM Symposium
on Principles of Distributed Computing - PODC ’18. ACM Press; 2018:169-178.
doi:10.1145/3212734.3212763'
apa: 'Alistarh, D.-A., De Sa, C., & Konstantinov, N. H. (2018). The convergence
of stochastic gradient descent in asynchronous shared memory. In Proceedings
of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18
(pp. 169–178). Egham, United Kingdom: ACM Press. https://doi.org/10.1145/3212734.3212763'
chicago: Alistarh, Dan-Adrian, Christopher De Sa, and Nikola H Konstantinov. “The
Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory.” In
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing
- PODC ’18, 169–78. ACM Press, 2018. https://doi.org/10.1145/3212734.3212763.
ieee: D.-A. Alistarh, C. De Sa, and N. H. Konstantinov, “The convergence of stochastic
gradient descent in asynchronous shared memory,” in Proceedings of the 2018
ACM Symposium on Principles of Distributed Computing - PODC ’18, Egham, United
Kingdom, 2018, pp. 169–178.
ista: 'Alistarh D-A, De Sa C, Konstantinov NH. 2018. The convergence of stochastic
gradient descent in asynchronous shared memory. Proceedings of the 2018 ACM Symposium
on Principles of Distributed Computing - PODC ’18. PODC: Principles of Distributed
Computing, 169–178.'
mla: Alistarh, Dan-Adrian, et al. “The Convergence of Stochastic Gradient Descent
in Asynchronous Shared Memory.” Proceedings of the 2018 ACM Symposium on Principles
of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 169–78, doi:10.1145/3212734.3212763.
short: D.-A. Alistarh, C. De Sa, N.H. Konstantinov, in:, Proceedings of the 2018
ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018,
pp. 169–178.
conference:
end_date: 2018-07-27
location: Egham, United Kingdom
name: 'PODC: Principles of Distributed Computing'
start_date: 2018-07-23
date_created: 2019-02-13T09:58:58Z
date_published: 2018-07-23T00:00:00Z
date_updated: 2023-09-19T10:42:53Z
day: '23'
department:
- _id: DaAl
doi: 10.1145/3212734.3212763
external_id:
arxiv:
- '1803.08841'
isi:
- '000458186900022'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1803.08841
month: '07'
oa: 1
oa_version: Preprint
page: 169-178
publication: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing -
PODC '18
publication_identifier:
isbn:
- '9781450357951'
publication_status: published
publisher: ACM Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: The convergence of stochastic gradient descent in asynchronous shared memory
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '5963'
abstract:
- lang: eng
text: 'There has been significant progress in understanding the parallelism inherent
to iterative sequential algorithms: for many classic algorithms, the depth of
the dependence structure is now well understood, and scheduling techniques have
been developed to exploit this shallow dependence structure for efficient parallel
implementations. A related, applied research strand has studied methods by which
certain iterative task-based algorithms can be efficiently parallelized via relaxed
concurrent priority schedulers. These allow for high concurrency when inserting
and removing tasks, at the cost of executing superfluous work due to the relaxed
semantics of the scheduler. In this work, we take a step towards unifying these
two research directions, by showing that there exists a family of relaxed priority
schedulers that can efficiently and deterministically execute classic iterative
algorithms such as greedy maximal independent set (MIS) and matching. Our primary
result shows that, given a randomized scheduler with an expected relaxation factor
of k in terms of the maximum allowed priority inversions on a task, and any graph
on n vertices, the scheduler is able to execute greedy MIS with only an additive
factor of \poly(k) expected additional iterations compared to an exact (but not
scalable) scheduler. This counter-intuitive result demonstrates that the overhead
of relaxation when computing MIS is not dependent on the input size or structure
of the input graph. Experimental results show that this overhead can be clearly
offset by the gain in performance due to the highly scalable scheduler. In sum,
we present an efficient method to deterministically parallelize iterative sequential
algorithms, with provable runtime guarantees in terms of the number of executed
tasks to completion.'
article_processing_charge: No
arxiv: 1
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Trevor A
full_name: Brown, Trevor A
id: 3569F0A0-F248-11E8-B48F-1D18A9856A87
last_name: Brown
- first_name: Justin
full_name: Kopinsky, Justin
last_name: Kopinsky
- first_name: Giorgi
full_name: Nadiradze, Giorgi
last_name: Nadiradze
citation:
ama: 'Alistarh D-A, Brown TA, Kopinsky J, Nadiradze G. Relaxed schedulers can efficiently
parallelize iterative algorithms. In: Proceedings of the 2018 ACM Symposium
on Principles of Distributed Computing - PODC ’18. ACM Press; 2018:377-386.
doi:10.1145/3212734.3212756'
apa: 'Alistarh, D.-A., Brown, T. A., Kopinsky, J., & Nadiradze, G. (2018). Relaxed
schedulers can efficiently parallelize iterative algorithms. In Proceedings
of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18
(pp. 377–386). Egham, United Kingdom: ACM Press. https://doi.org/10.1145/3212734.3212756'
chicago: Alistarh, Dan-Adrian, Trevor A Brown, Justin Kopinsky, and Giorgi Nadiradze.
“Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms.” In Proceedings
of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18,
377–86. ACM Press, 2018. https://doi.org/10.1145/3212734.3212756.
ieee: D.-A. Alistarh, T. A. Brown, J. Kopinsky, and G. Nadiradze, “Relaxed schedulers
can efficiently parallelize iterative algorithms,” in Proceedings of the 2018
ACM Symposium on Principles of Distributed Computing - PODC ’18, Egham, United
Kingdom, 2018, pp. 377–386.
ista: 'Alistarh D-A, Brown TA, Kopinsky J, Nadiradze G. 2018. Relaxed schedulers
can efficiently parallelize iterative algorithms. Proceedings of the 2018 ACM
Symposium on Principles of Distributed Computing - PODC ’18. PODC: Principles
of Distributed Computing, 377–386.'
mla: Alistarh, Dan-Adrian, et al. “Relaxed Schedulers Can Efficiently Parallelize
Iterative Algorithms.” Proceedings of the 2018 ACM Symposium on Principles
of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 377–86, doi:10.1145/3212734.3212756.
short: D.-A. Alistarh, T.A. Brown, J. Kopinsky, G. Nadiradze, in:, Proceedings of
the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM
Press, 2018, pp. 377–386.
conference:
end_date: 2018-07-27
location: Egham, United Kingdom
name: 'PODC: Principles of Distributed Computing'
start_date: 2018-07-23
date_created: 2019-02-13T10:03:25Z
date_published: 2018-07-23T00:00:00Z
date_updated: 2023-09-19T10:43:21Z
day: '23'
department:
- _id: DaAl
doi: 10.1145/3212734.3212756
external_id:
arxiv:
- '1808.04155'
isi:
- '000458186900048'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1808.04155
month: '07'
oa: 1
oa_version: Preprint
page: 377-386
publication: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing -
PODC '18
publication_identifier:
isbn:
- '9781450357951'
publication_status: published
publisher: ACM Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Relaxed schedulers can efficiently parallelize iterative algorithms
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '5964'
abstract:
- lang: eng
text: A standard design pattern found in many concurrent data structures, such as
hash tables or ordered containers, is an alternation of parallelizable sections
that incur no data conflicts and critical sections that must run sequentially
and are protected with locks. A lock can be viewed as a queue that arbitrates
the order in which the critical sections are executed, and a natural question
is whether we can use stochastic analysis to predict the resulting throughput.
As a preliminary evidence to the affirmative, we describe a simple model that
can be used to predict the throughput of coarse-grained lock-based algorithms.
We show that our model works well for CLH lock, and we expect it to work for other
popular lock designs such as TTAS, MCS, etc.
article_processing_charge: No
author:
- first_name: Vitaly
full_name: Aksenov, Vitaly
last_name: Aksenov
- 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: Petr
full_name: Kuznetsov, Petr
last_name: Kuznetsov
citation:
ama: 'Aksenov V, Alistarh D-A, Kuznetsov P. Brief Announcement: Performance prediction
for coarse-grained locking. In: Proceedings of the 2018 ACM Symposium on Principles
of Distributed Computing - PODC ’18. ACM Press; 2018:411-413. doi:10.1145/3212734.3212785'
apa: 'Aksenov, V., Alistarh, D.-A., & Kuznetsov, P. (2018). Brief Announcement:
Performance prediction for coarse-grained locking. In Proceedings of the 2018
ACM Symposium on Principles of Distributed Computing - PODC ’18 (pp. 411–413).
Egham, United Kingdom: ACM Press. https://doi.org/10.1145/3212734.3212785'
chicago: 'Aksenov, Vitaly, Dan-Adrian Alistarh, and Petr Kuznetsov. “Brief Announcement:
Performance Prediction for Coarse-Grained Locking.” In Proceedings of the 2018
ACM Symposium on Principles of Distributed Computing - PODC ’18, 411–13.
ACM Press, 2018. https://doi.org/10.1145/3212734.3212785.'
ieee: 'V. Aksenov, D.-A. Alistarh, and P. Kuznetsov, “Brief Announcement: Performance
prediction for coarse-grained locking,” in Proceedings of the 2018 ACM Symposium
on Principles of Distributed Computing - PODC ’18, Egham, United Kingdom,
2018, pp. 411–413.'
ista: 'Aksenov V, Alistarh D-A, Kuznetsov P. 2018. Brief Announcement: Performance
prediction for coarse-grained locking. Proceedings of the 2018 ACM Symposium on
Principles of Distributed Computing - PODC ’18. PODC: Principles of Distributed
Computing, 411–413.'
mla: 'Aksenov, Vitaly, et al. “Brief Announcement: Performance Prediction for Coarse-Grained
Locking.” Proceedings of the 2018 ACM Symposium on Principles of Distributed
Computing - PODC ’18, ACM Press, 2018, pp. 411–13, doi:10.1145/3212734.3212785.'
short: V. Aksenov, D.-A. Alistarh, P. Kuznetsov, in:, Proceedings of the 2018 ACM
Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018,
pp. 411–413.
conference:
end_date: 2018-07-27
location: Egham, United Kingdom
name: 'PODC: Principles of Distributed Computing'
start_date: 2018-07-23
date_created: 2019-02-13T10:08:19Z
date_published: 2018-07-23T00:00:00Z
date_updated: 2023-09-19T10:43:45Z
day: '23'
department:
- _id: DaAl
doi: 10.1145/3212734.3212785
external_id:
isi:
- '000458186900052'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://hal-univ-lyon3.archives-ouvertes.fr/INRIA/hal-01887733v1
month: '07'
oa: 1
oa_version: Submitted Version
page: 411-413
publication: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing -
PODC '18
publication_identifier:
isbn:
- '9781450357951'
publication_status: published
publisher: ACM Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Brief Announcement: Performance prediction for coarse-grained locking'
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '5965'
abstract:
- lang: eng
text: Relaxed concurrent data structures have become increasingly popular, due to
their scalability in graph processing and machine learning applications (\citeNguyen13,
gonzalez2012powergraph ). Despite considerable interest, there exist families
of natural, high performing randomized relaxed concurrent data structures, such
as the popular MultiQueue~\citeMQ pattern for implementing relaxed priority queue
data structures, for which no guarantees are known in the concurrent setting~\citeAKLN17.
Our main contribution is in showing for the first time that, under a set of analytic
assumptions, a family of relaxed concurrent data structures, including variants
of MultiQueues, but also a new approximate counting algorithm we call the MultiCounter,
provides strong probabilistic guarantees on the degree of relaxation with respect
to the sequential specification, in arbitrary concurrent executions. We formalize
these guarantees via a new correctness condition called distributional linearizability,
tailored to concurrent implementations with randomized relaxations. Our result
is based on a new analysis of an asynchronous variant of the classic power-of-two-choices
load balancing algorithm, in which placement choices can be based on inconsistent,
outdated information (this result may be of independent interest). We validate
our results empirically, showing that the MultiCounter algorithm can implement
scalable relaxed timestamps.
article_processing_charge: No
arxiv: 1
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Trevor A
full_name: Brown, Trevor A
id: 3569F0A0-F248-11E8-B48F-1D18A9856A87
last_name: Brown
- first_name: Justin
full_name: Kopinsky, Justin
last_name: Kopinsky
- first_name: Jerry Z.
full_name: Li, Jerry Z.
last_name: Li
- first_name: Giorgi
full_name: Nadiradze, Giorgi
last_name: Nadiradze
citation:
ama: 'Alistarh D-A, Brown TA, Kopinsky J, Li JZ, Nadiradze G. Distributionally linearizable
data structures. In: Proceedings of the 30th on Symposium on Parallelism in
Algorithms and Architectures - SPAA ’18. ACM Press; 2018:133-142. doi:10.1145/3210377.3210411'
apa: 'Alistarh, D.-A., Brown, T. A., Kopinsky, J., Li, J. Z., & Nadiradze, G.
(2018). Distributionally linearizable data structures. In Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18
(pp. 133–142). Vienna, Austria: ACM Press. https://doi.org/10.1145/3210377.3210411'
chicago: Alistarh, Dan-Adrian, Trevor A Brown, Justin Kopinsky, Jerry Z. Li, and
Giorgi Nadiradze. “Distributionally Linearizable Data Structures.” In Proceedings
of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA
’18, 133–42. ACM Press, 2018. https://doi.org/10.1145/3210377.3210411.
ieee: D.-A. Alistarh, T. A. Brown, J. Kopinsky, J. Z. Li, and G. Nadiradze, “Distributionally
linearizable data structures,” in Proceedings of the 30th on Symposium on Parallelism
in Algorithms and Architectures - SPAA ’18, Vienna, Austria, 2018, pp. 133–142.
ista: 'Alistarh D-A, Brown TA, Kopinsky J, Li JZ, Nadiradze G. 2018. Distributionally
linearizable data structures. Proceedings of the 30th on Symposium on Parallelism
in Algorithms and Architectures - SPAA ’18. SPAA: Symposium on Parallelism in
Algorithms and Architectures, 133–142.'
mla: Alistarh, Dan-Adrian, et al. “Distributionally Linearizable Data Structures.”
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures
- SPAA ’18, ACM Press, 2018, pp. 133–42, doi:10.1145/3210377.3210411.
short: D.-A. Alistarh, T.A. Brown, J. Kopinsky, J.Z. Li, G. Nadiradze, in:, Proceedings
of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA
’18, ACM Press, 2018, pp. 133–142.
conference:
end_date: 2018-07-18
location: Vienna, Austria
name: 'SPAA: Symposium on Parallelism in Algorithms and Architectures'
start_date: 2018-07-16
date_created: 2019-02-13T10:17:19Z
date_published: 2018-07-16T00:00:00Z
date_updated: 2023-09-19T10:44:13Z
day: '16'
department:
- _id: DaAl
doi: 10.1145/3210377.3210411
external_id:
arxiv:
- '1804.01018'
isi:
- '000545269600016'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.01018
month: '07'
oa: 1
oa_version: Preprint
page: 133-142
publication: Proceedings of the 30th on Symposium on Parallelism in Algorithms and
Architectures - SPAA '18
publication_identifier:
isbn:
- '9781450357999'
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: Distributionally linearizable data structures
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '5966'
abstract:
- lang: eng
text: 'The transactional conflict problem arises in transactional systems whenever
two or more concurrent transactions clash on a data item. While the standard solution
to such conflicts is to immediately abort one of the transactions, some practical
systems consider the alternative of delaying conflict resolution for a short interval,
which may allow one of the transactions to commit. The challenge in the transactional
conflict problem is to choose the optimal length of this delay interval so as
to minimize the overall running time penalty for the conflicting transactions.
In this paper, we propose a family of optimal online algorithms for the transactional
conflict problem. Specifically, we consider variants of this problem which arise
in different implementations of transactional systems, namely "requestor wins''''
and "requestor aborts'''' implementations: in the former, the recipient of a coherence
request is aborted, whereas in the latter, it is the requestor which has to abort.
Both strategies are implemented by real systems. We show that the requestor aborts
case can be reduced to a classic instance of the ski rental problem, while the
requestor wins case leads to a new version of this classical problem, for which
we derive optimal deterministic and randomized algorithms. Moreover, we prove
that, under a simplified adversarial model, our algorithms are constant-competitive
with the offline optimum in terms of throughput. We validate our algorithmic results
empirically through a hardware simulation of hardware transactional memory (HTM),
showing that our algorithms can lead to non-trivial performance improvements for
classic concurrent data structures.'
article_processing_charge: No
arxiv: 1
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Syed Kamran
full_name: Haider, Syed Kamran
last_name: Haider
- first_name: Raphael
full_name: Kübler, Raphael
last_name: Kübler
- first_name: Giorgi
full_name: Nadiradze, Giorgi
last_name: Nadiradze
citation:
ama: 'Alistarh D-A, Haider SK, Kübler R, Nadiradze G. The transactional conflict
problem. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms
and Architectures - SPAA ’18. ACM Press; 2018:383-392. doi:10.1145/3210377.3210406'
apa: 'Alistarh, D.-A., Haider, S. K., Kübler, R., & Nadiradze, G. (2018). The
transactional conflict problem. In Proceedings of the 30th on Symposium on
Parallelism in Algorithms and Architectures - SPAA ’18 (pp. 383–392). Vienna,
Austria: ACM Press. https://doi.org/10.1145/3210377.3210406'
chicago: Alistarh, Dan-Adrian, Syed Kamran Haider, Raphael Kübler, and Giorgi Nadiradze.
“The Transactional Conflict Problem.” In Proceedings of the 30th on Symposium
on Parallelism in Algorithms and Architectures - SPAA ’18, 383–92. ACM Press,
2018. https://doi.org/10.1145/3210377.3210406.
ieee: D.-A. Alistarh, S. K. Haider, R. Kübler, and G. Nadiradze, “The transactional
conflict problem,” in Proceedings of the 30th on Symposium on Parallelism in
Algorithms and Architectures - SPAA ’18, Vienna, Austria, 2018, pp. 383–392.
ista: 'Alistarh D-A, Haider SK, Kübler R, Nadiradze G. 2018. The transactional conflict
problem. Proceedings of the 30th on Symposium on Parallelism in Algorithms and
Architectures - SPAA ’18. SPAA: Symposium on Parallelism in Algorithms and Architectures,
383–392.'
mla: Alistarh, Dan-Adrian, et al. “The Transactional Conflict Problem.” Proceedings
of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA
’18, ACM Press, 2018, pp. 383–92, doi:10.1145/3210377.3210406.
short: D.-A. Alistarh, S.K. Haider, R. Kübler, G. Nadiradze, in:, Proceedings of
the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18,
ACM Press, 2018, pp. 383–392.
conference:
end_date: 2018-07-18
location: Vienna, Austria
name: 'SPAA: Symposium on Parallelism in Algorithms and Architectures'
start_date: 2018-07-16
date_created: 2019-02-13T10:26:07Z
date_published: 2018-07-16T00:00:00Z
date_updated: 2023-09-19T10:44:49Z
day: '16'
department:
- _id: DaAl
doi: 10.1145/3210377.3210406
external_id:
arxiv:
- '1804.00947'
isi:
- '000545269600046'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.00947
month: '07'
oa: 1
oa_version: Preprint
page: 383-392
publication: Proceedings of the 30th on Symposium on Parallelism in Algorithms and
Architectures - SPAA '18
publication_identifier:
isbn:
- '9781450357999'
publication_status: published
publisher: ACM Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: The transactional conflict problem
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '5967'
abstract:
- lang: eng
text: "The Big Match is a multi-stage two-player game. In each stage Player 1 hides
one or two pebbles in his hand, and his opponent has to guess that number; Player
1 loses a point if Player 2 is correct, and otherwise he wins a point. As soon
as Player 1 hides one pebble, the players cannot change their choices in any future
stage.\r\nBlackwell and Ferguson (1968) give an ε-optimal strategy for Player
1 that hides, in each stage, one pebble with a probability that depends on the
entire past history. Any strategy that depends just on the clock or on a finite
memory is worthless. The long-standing natural open problem has been whether every
strategy that depends just on the clock and a finite memory is worthless. We prove
that there is such a strategy that is ε-optimal. In fact, we show that just two
states of memory are sufficient.\r\n"
article_processing_charge: No
author:
- first_name: Kristoffer Arnsfelt
full_name: Hansen, Kristoffer Arnsfelt
last_name: Hansen
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Abraham
full_name: Neyman, Abraham
last_name: Neyman
citation:
ama: 'Hansen KA, Ibsen-Jensen R, Neyman A. The Big Match with a clock and a bit
of memory. In: Proceedings of the 2018 ACM Conference on Economics and Computation
- EC ’18. ACM Press; 2018:149-150. doi:10.1145/3219166.3219198'
apa: 'Hansen, K. A., Ibsen-Jensen, R., & Neyman, A. (2018). The Big Match with
a clock and a bit of memory. In Proceedings of the 2018 ACM Conference on Economics
and Computation - EC ’18 (pp. 149–150). Ithaca, NY, United States: ACM Press.
https://doi.org/10.1145/3219166.3219198'
chicago: Hansen, Kristoffer Arnsfelt, Rasmus Ibsen-Jensen, and Abraham Neyman. “The
Big Match with a Clock and a Bit of Memory.” In Proceedings of the 2018 ACM
Conference on Economics and Computation - EC ’18, 149–50. ACM Press, 2018.
https://doi.org/10.1145/3219166.3219198.
ieee: K. A. Hansen, R. Ibsen-Jensen, and A. Neyman, “The Big Match with a clock
and a bit of memory,” in Proceedings of the 2018 ACM Conference on Economics
and Computation - EC ’18, Ithaca, NY, United States, 2018, pp. 149–150.
ista: 'Hansen KA, Ibsen-Jensen R, Neyman A. 2018. The Big Match with a clock and
a bit of memory. Proceedings of the 2018 ACM Conference on Economics and Computation
- EC ’18. EC: Conference on Economics and Computation, 149–150.'
mla: Hansen, Kristoffer Arnsfelt, et al. “The Big Match with a Clock and a Bit of
Memory.” Proceedings of the 2018 ACM Conference on Economics and Computation
- EC ’18, ACM Press, 2018, pp. 149–50, doi:10.1145/3219166.3219198.
short: K.A. Hansen, R. Ibsen-Jensen, A. Neyman, in:, Proceedings of the 2018 ACM
Conference on Economics and Computation - EC ’18, ACM Press, 2018, pp. 149–150.
conference:
end_date: 2018-06-22
location: Ithaca, NY, United States
name: 'EC: Conference on Economics and Computation'
start_date: 2018-06-18
date_created: 2019-02-13T10:31:41Z
date_published: 2018-06-18T00:00:00Z
date_updated: 2023-09-19T10:45:15Z
day: '18'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1145/3219166.3219198
external_id:
isi:
- '000492755100020'
file:
- access_level: open_access
checksum: bb52683e349cfd864f4769a8f38f2798
content_type: application/pdf
creator: dernst
date_created: 2019-11-19T08:24:24Z
date_updated: 2020-07-14T12:47:14Z
file_id: '7054'
file_name: 2018_EC18_Hansen.pdf
file_size: 302539
relation: main_file
file_date_updated: 2020-07-14T12:47:14Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 149-150
publication: Proceedings of the 2018 ACM Conference on Economics and Computation -
EC '18
publication_identifier:
isbn:
- '9781450358293'
publication_status: published
publisher: ACM Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: The Big Match with a clock and a bit of memory
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '5971'
abstract:
- lang: eng
text: "We consider a Wigner-type ensemble, i.e. large hermitian N×N random matrices
H=H∗ with centered independent entries and with a general matrix of variances
Sxy=\U0001D53C∣∣Hxy∣∣2. The norm of H is asymptotically given by the maximum of
the support of the self-consistent density of states. We establish a bound on
this maximum in terms of norms of powers of S that substantially improves the
earlier bound 2∥S∥1/2∞ given in [O. Ajanki, L. Erdős and T. Krüger, Universality
for general Wigner-type matrices, Prob. Theor. Rel. Fields169 (2017) 667–727].
The key element of the proof is an effective Markov chain approximation for the
contributions of the weighted Dyck paths appearing in the iterative solution of
the corresponding Dyson equation."
article_number: '1950009'
article_processing_charge: No
arxiv: 1
author:
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Peter
full_name: Mühlbacher, Peter
last_name: Mühlbacher
citation:
ama: 'Erdös L, Mühlbacher P. Bounds on the norm of Wigner-type random matrices.
Random matrices: Theory and applications. 2018. doi:10.1142/s2010326319500096'
apa: 'Erdös, L., & Mühlbacher, P. (2018). Bounds on the norm of Wigner-type
random matrices. Random Matrices: Theory and Applications. World Scientific
Publishing. https://doi.org/10.1142/s2010326319500096'
chicago: 'Erdös, László, and Peter Mühlbacher. “Bounds on the Norm of Wigner-Type
Random Matrices.” Random Matrices: Theory and Applications. World Scientific
Publishing, 2018. https://doi.org/10.1142/s2010326319500096.'
ieee: 'L. Erdös and P. Mühlbacher, “Bounds on the norm of Wigner-type random matrices,”
Random matrices: Theory and applications. World Scientific Publishing,
2018.'
ista: 'Erdös L, Mühlbacher P. 2018. Bounds on the norm of Wigner-type random matrices.
Random matrices: Theory and applications., 1950009.'
mla: 'Erdös, László, and Peter Mühlbacher. “Bounds on the Norm of Wigner-Type Random
Matrices.” Random Matrices: Theory and Applications, 1950009, World Scientific
Publishing, 2018, doi:10.1142/s2010326319500096.'
short: 'L. Erdös, P. Mühlbacher, Random Matrices: Theory and Applications (2018).'
date_created: 2019-02-13T10:40:54Z
date_published: 2018-09-26T00:00:00Z
date_updated: 2023-09-19T14:24:05Z
day: '26'
department:
- _id: LaEr
doi: 10.1142/s2010326319500096
ec_funded: 1
external_id:
arxiv:
- '1802.05175'
isi:
- '000477677200002'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1802.05175
month: '09'
oa: 1
oa_version: Preprint
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: 'Random matrices: Theory and applications'
publication_identifier:
eissn:
- 2010-3271
issn:
- 2010-3263
publication_status: published
publisher: World Scientific Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Bounds on the norm of Wigner-type random matrices
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '5975'
abstract:
- lang: eng
text: We consider the recent formulation of the algorithmic Lov ́asz Local Lemma [N.
Har-vey and J. Vondr ́ak, inProceedings of FOCS, 2015, pp. 1327–1345; D. Achlioptas
and F. Iliopoulos,inProceedings of SODA, 2016, pp. 2024–2038; D. Achlioptas, F.
Iliopoulos, and V. Kolmogorov,ALocal Lemma for Focused Stochastic Algorithms,
arXiv preprint, 2018] for finding objects that avoid“bad features,” or “flaws.” It extends the Moser–Tardos resampling algorithm [R. A. Moser andG.
Tardos,J. ACM, 57 (2010), 11] to more general discrete spaces. At each step the
method picks aflaw present in the current state and goes to a new state according
to some prespecified probabilitydistribution (which depends on the current state
and the selected flaw). However, the recent formu-lation is less flexible than
the Moser–Tardos method since it requires a specific flaw selection rule,whereas
the algorithm of Moser and Tardos allows an arbitrary rule (and thus can potentially
beimplemented more efficiently). We formulate a new “commutativity” condition
and prove that it issufficient for an arbitrary rule to work. It also enables
an efficient parallelization under an additionalassumption. We then show that
existing resampling oracles for perfect matchings and permutationsdo satisfy this
condition.
article_processing_charge: No
arxiv: 1
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: Kolmogorov V. Commutativity in the algorithmic Lovász local lemma. SIAM
Journal on Computing. 2018;47(6):2029-2056. doi:10.1137/16m1093306
apa: Kolmogorov, V. (2018). Commutativity in the algorithmic Lovász local lemma.
SIAM Journal on Computing. Society for Industrial & Applied Mathematics
(SIAM). https://doi.org/10.1137/16m1093306
chicago: Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.”
SIAM Journal on Computing. Society for Industrial & Applied Mathematics
(SIAM), 2018. https://doi.org/10.1137/16m1093306.
ieee: V. Kolmogorov, “Commutativity in the algorithmic Lovász local lemma,” SIAM
Journal on Computing, vol. 47, no. 6. Society for Industrial & Applied
Mathematics (SIAM), pp. 2029–2056, 2018.
ista: Kolmogorov V. 2018. Commutativity in the algorithmic Lovász local lemma. SIAM
Journal on Computing. 47(6), 2029–2056.
mla: Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.”
SIAM Journal on Computing, vol. 47, no. 6, Society for Industrial &
Applied Mathematics (SIAM), 2018, pp. 2029–56, doi:10.1137/16m1093306.
short: V. Kolmogorov, SIAM Journal on Computing 47 (2018) 2029–2056.
date_created: 2019-02-13T12:59:33Z
date_published: 2018-11-08T00:00:00Z
date_updated: 2023-09-19T14:24:58Z
day: '08'
department:
- _id: VlKo
doi: 10.1137/16m1093306
ec_funded: 1
external_id:
arxiv:
- '1506.08547'
isi:
- '000453785100001'
intvolume: ' 47'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1506.08547
month: '11'
oa: 1
oa_version: Preprint
page: 2029-2056
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: SIAM Journal on Computing
publication_identifier:
eissn:
- 1095-7111
issn:
- 0097-5397
publication_status: published
publisher: Society for Industrial & Applied Mathematics (SIAM)
quality_controlled: '1'
related_material:
record:
- id: '1193'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Commutativity in the algorithmic Lovász local lemma
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 47
year: '2018'
...
---
_id: '5976'
abstract:
- lang: eng
text: We propose FlexMaps, a novel framework for fabricating smooth shapes out of
flat, flexible panels with tailored mechanical properties. We start by mapping
the 3D surface onto a 2D domain as in traditional UV mapping to design a set of
deformable flat panels called FlexMaps. For these panels, we design and obtain
specific mechanical properties such that, once they are assembled, the static
equilibrium configuration matches the desired 3D shape. FlexMaps can be fabricated
from an almost rigid material, such as wood or plastic, and are made flexible
in a controlled way by using computationally designed spiraling microstructures.
article_number: '241'
article_processing_charge: No
article_type: original
author:
- first_name: Luigi
full_name: Malomo, Luigi
last_name: Malomo
- first_name: Jesus
full_name: Perez Rodriguez, Jesus
id: 2DC83906-F248-11E8-B48F-1D18A9856A87
last_name: Perez Rodriguez
- first_name: Emmanuel
full_name: Iarussi, Emmanuel
id: 33F19F16-F248-11E8-B48F-1D18A9856A87
last_name: Iarussi
- first_name: Nico
full_name: Pietroni, Nico
last_name: Pietroni
- first_name: Eder
full_name: Miguel, Eder
last_name: Miguel
- first_name: Paolo
full_name: Cignoni, Paolo
last_name: Cignoni
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
citation:
ama: 'Malomo L, Perez Rodriguez J, Iarussi E, et al. FlexMaps: Computational design
of flat flexible shells for shaping 3D objects. ACM Transactions on Graphics.
2018;37(6). doi:10.1145/3272127.3275076'
apa: 'Malomo, L., Perez Rodriguez, J., Iarussi, E., Pietroni, N., Miguel, E., Cignoni,
P., & Bickel, B. (2018). FlexMaps: Computational design of flat flexible shells
for shaping 3D objects. ACM Transactions on Graphics. Association for Computing
Machinery (ACM). https://doi.org/10.1145/3272127.3275076'
chicago: 'Malomo, Luigi, Jesus Perez Rodriguez, Emmanuel Iarussi, Nico Pietroni,
Eder Miguel, Paolo Cignoni, and Bernd Bickel. “FlexMaps: Computational Design
of Flat Flexible Shells for Shaping 3D Objects.” ACM Transactions on Graphics.
Association for Computing Machinery (ACM), 2018. https://doi.org/10.1145/3272127.3275076.'
ieee: 'L. Malomo et al., “FlexMaps: Computational design of flat flexible
shells for shaping 3D objects,” ACM Transactions on Graphics, vol. 37,
no. 6. Association for Computing Machinery (ACM), 2018.'
ista: 'Malomo L, Perez Rodriguez J, Iarussi E, Pietroni N, Miguel E, Cignoni P,
Bickel B. 2018. FlexMaps: Computational design of flat flexible shells for shaping
3D objects. ACM Transactions on Graphics. 37(6), 241.'
mla: 'Malomo, Luigi, et al. “FlexMaps: Computational Design of Flat Flexible Shells
for Shaping 3D Objects.” ACM Transactions on Graphics, vol. 37, no. 6,
241, Association for Computing Machinery (ACM), 2018, doi:10.1145/3272127.3275076.'
short: L. Malomo, J. Perez Rodriguez, E. Iarussi, N. Pietroni, E. Miguel, P. Cignoni,
B. Bickel, ACM Transactions on Graphics 37 (2018).
date_created: 2019-02-13T13:12:53Z
date_published: 2018-11-01T00:00:00Z
date_updated: 2023-09-19T14:25:30Z
day: '01'
ddc:
- '000'
department:
- _id: BeBi
doi: 10.1145/3272127.3275076
ec_funded: 1
external_id:
isi:
- '000455953100064'
file:
- access_level: open_access
checksum: d0529a41c78b37ab8840685579fb33b4
content_type: application/pdf
creator: bbickel
date_created: 2019-09-23T12:48:52Z
date_updated: 2020-07-14T12:47:14Z
file_id: '6901'
file_name: flexmaps_author_version.pdf
file_size: 100109811
relation: main_file
file_date_updated: 2020-07-14T12:47:14Z
has_accepted_license: '1'
intvolume: ' 37'
isi: 1
issue: '6'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 24F9549A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715767'
name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and
Modeling'
- _id: 25082902-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '645599'
name: Soft-bodied intelligence for Manipulation
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: ACM Transactions on Graphics
publication_identifier:
issn:
- 0730-0301
publication_status: published
publisher: Association for Computing Machinery (ACM)
pubrep_id: '1068'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'FlexMaps: Computational design of flat flexible shells for shaping 3D objects'
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 37
year: '2018'
...
---
_id: '5977'
abstract:
- lang: eng
text: 'We consider the stochastic shortest path (SSP)problem for succinct Markov
decision processes(MDPs), where the MDP consists of a set of vari-ables, and a
set of nondeterministic rules that up-date the variables. First, we show that
several ex-amples from the AI literature can be modeled assuccinct MDPs. Then
we present computationalapproaches for upper and lower bounds for theSSP problem:
(a) for computing upper bounds, ourmethod is polynomial-time in the implicit descrip-tion
of the MDP; (b) for lower bounds, we present apolynomial-time (in the size of
the implicit descrip-tion) reduction to quadratic programming. Our ap-proach is
applicable even to infinite-state MDPs.Finally, we present experimental results
to demon-strate the effectiveness of our approach on severalclassical examples
from the AI literature.'
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Hongfei
full_name: Fu, Hongfei
id: 3AAD03D6-F248-11E8-B48F-1D18A9856A87
last_name: Fu
- first_name: Amir
full_name: Goharshady, Amir
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Nastaran
full_name: Okati, Nastaran
last_name: Okati
citation:
ama: 'Chatterjee K, Fu H, Goharshady AK, Okati N. Computational approaches for stochastic
shortest path on succinct MDPs. In: Proceedings of the Twenty-Seventh International
Joint Conference on Artificial Intelligence. Vol 2018. IJCAI; 2018:4700-4707.
doi:10.24963/ijcai.2018/653'
apa: 'Chatterjee, K., Fu, H., Goharshady, A. K., & Okati, N. (2018). Computational
approaches for stochastic shortest path on succinct MDPs. In Proceedings of
the Twenty-Seventh International Joint Conference on Artificial Intelligence
(Vol. 2018, pp. 4700–4707). Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/653'
chicago: Chatterjee, Krishnendu, Hongfei Fu, Amir Kafshdar Goharshady, and Nastaran
Okati. “Computational Approaches for Stochastic Shortest Path on Succinct MDPs.”
In Proceedings of the Twenty-Seventh International Joint Conference on Artificial
Intelligence, 2018:4700–4707. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/653.
ieee: K. Chatterjee, H. Fu, A. K. Goharshady, and N. Okati, “Computational approaches
for stochastic shortest path on succinct MDPs,” in Proceedings of the Twenty-Seventh
International Joint Conference on Artificial Intelligence, Stockholm, Sweden,
2018, vol. 2018, pp. 4700–4707.
ista: 'Chatterjee K, Fu H, Goharshady AK, Okati N. 2018. Computational approaches
for stochastic shortest path on succinct MDPs. Proceedings of the Twenty-Seventh
International Joint Conference on Artificial Intelligence. IJCAI: International
Joint Conference on Artificial Intelligence vol. 2018, 4700–4707.'
mla: Chatterjee, Krishnendu, et al. “Computational Approaches for Stochastic Shortest
Path on Succinct MDPs.” Proceedings of the Twenty-Seventh International Joint
Conference on Artificial Intelligence, vol. 2018, IJCAI, 2018, pp. 4700–07,
doi:10.24963/ijcai.2018/653.
short: K. Chatterjee, H. Fu, A.K. Goharshady, N. Okati, in:, Proceedings of the
Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI,
2018, pp. 4700–4707.
conference:
end_date: 2018-07-19
location: Stockholm, Sweden
name: 'IJCAI: International Joint Conference on Artificial Intelligence'
start_date: 2018-07-13
date_created: 2019-02-13T13:26:27Z
date_published: 2018-07-17T00:00:00Z
date_updated: 2025-06-02T08:53:44Z
day: '17'
department:
- _id: KrCh
doi: 10.24963/ijcai.2018/653
ec_funded: 1
external_id:
arxiv:
- '1804.08984'
isi:
- '000764175404118'
intvolume: ' 2018'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.08984
month: '07'
oa: 1
oa_version: Preprint
page: 4700-4707
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: Proceedings of the Twenty-Seventh International Joint Conference on Artificial
Intelligence
publication_identifier:
isbn:
- 978-099924112-7
issn:
- '10450823'
publication_status: published
publisher: IJCAI
quality_controlled: '1'
related_material:
record:
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Computational approaches for stochastic shortest path on succinct MDPs
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2018
year: '2018'
...
---
_id: '5978'
abstract:
- lang: eng
text: 'We consider the MAP-inference problem for graphical models,which is a valued
constraint satisfaction problem defined onreal numbers with a natural summation
operation. We proposea family of relaxations (different from the famous Sherali-Adams
hierarchy), which naturally define lower bounds for itsoptimum. This family always
contains a tight relaxation andwe give an algorithm able to find it and therefore,
solve theinitial non-relaxed NP-hard problem.The relaxations we consider decompose
the original probleminto two non-overlapping parts: an easy LP-tight part and
adifficult one. For the latter part a combinatorial solver must beused. As we
show in our experiments, in a number of applica-tions the second, difficult part
constitutes only a small fractionof the whole problem. This property allows to
significantlyreduce the computational time of the combinatorial solver andtherefore
solve problems which were out of reach before.'
article_processing_charge: No
arxiv: 1
author:
- first_name: Stefan
full_name: Haller, Stefan
last_name: Haller
- 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: 'Haller S, Swoboda P, Savchynskyy B. Exact MAP-inference by confining combinatorial
search with LP relaxation. In: Proceedings of the 32st AAAI Conference on Artificial
Intelligence. AAAI Press; 2018:6581-6588.'
apa: 'Haller, S., Swoboda, P., & Savchynskyy, B. (2018). Exact MAP-inference
by confining combinatorial search with LP relaxation. In Proceedings of the
32st AAAI Conference on Artificial Intelligence (pp. 6581–6588). New Orleans,
LU, United States: AAAI Press.'
chicago: Haller, Stefan, Paul Swoboda, and Bogdan Savchynskyy. “Exact MAP-Inference
by Confining Combinatorial Search with LP Relaxation.” In Proceedings of the
32st AAAI Conference on Artificial Intelligence, 6581–88. AAAI Press, 2018.
ieee: S. Haller, P. Swoboda, and B. Savchynskyy, “Exact MAP-inference by confining
combinatorial search with LP relaxation,” in Proceedings of the 32st AAAI Conference
on Artificial Intelligence, New Orleans, LU, United States, 2018, pp. 6581–6588.
ista: 'Haller S, Swoboda P, Savchynskyy B. 2018. Exact MAP-inference by confining
combinatorial search with LP relaxation. Proceedings of the 32st AAAI Conference
on Artificial Intelligence. AAAI: Conference on Artificial Intelligence, 6581–6588.'
mla: Haller, Stefan, et al. “Exact MAP-Inference by Confining Combinatorial Search
with LP Relaxation.” Proceedings of the 32st AAAI Conference on Artificial
Intelligence, AAAI Press, 2018, pp. 6581–88.
short: S. Haller, P. Swoboda, B. Savchynskyy, in:, Proceedings of the 32st AAAI
Conference on Artificial Intelligence, AAAI Press, 2018, pp. 6581–6588.
conference:
end_date: 2018-02-07
location: New Orleans, LU, United States
name: 'AAAI: Conference on Artificial Intelligence'
start_date: 2018-02-02
date_created: 2019-02-13T13:32:48Z
date_published: 2018-02-01T00:00:00Z
date_updated: 2023-09-19T14:26:52Z
day: '01'
department:
- _id: VlKo
external_id:
arxiv:
- '2004.06370'
isi:
- '000485488906082'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2004.06370
month: '02'
oa: 1
oa_version: Preprint
page: 6581-6588
publication: Proceedings of the 32st AAAI Conference on Artificial Intelligence
publication_status: published
publisher: AAAI Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Exact MAP-inference by confining combinatorial search with LP relaxation
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '5980'
abstract:
- lang: eng
text: The problem of private set-intersection (PSI) has been traditionally treated
as an instance of the more general problem of multi-party computation (MPC). Consequently,
in order to argue security, or compose these protocols one has to rely on the
general theory that was developed for the purpose of MPC. The pursuit of efficient
protocols, however, has resulted in designs that exploit properties pertaining
to PSI. In almost all practical applications where a PSI protocol is deployed,
it is expected to be executed multiple times, possibly on related inputs. In this
work we initiate a dedicated study of PSI in the multi-interaction (MI) setting.
In this model a server sets up the common system parameters and executes set-intersection
multiple times with potentially different clients. We discuss a few attacks that
arise when protocols are naïvely composed in this manner and, accordingly, craft
security definitions for the MI setting and study their inter-relation. Finally,
we suggest a set of protocols that are MI-secure, at the same time almost as efficient
as their parent, stand-alone, protocols.
article_processing_charge: No
author:
- first_name: Sanjit
full_name: Chatterjee, Sanjit
last_name: Chatterjee
- first_name: Chethan
full_name: Kamath Hosdurg, Chethan
id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87
last_name: Kamath Hosdurg
- first_name: Vikas
full_name: Kumar, Vikas
last_name: Kumar
citation:
ama: Chatterjee S, Kamath Hosdurg C, Kumar V. Private set-intersection with common
set-up. American Institute of Mathematical Sciences. 2018;12(1):17-47.
doi:10.3934/amc.2018002
apa: Chatterjee, S., Kamath Hosdurg, C., & Kumar, V. (2018). Private set-intersection
with common set-up. American Institute of Mathematical Sciences. AIMS.
https://doi.org/10.3934/amc.2018002
chicago: Chatterjee, Sanjit, Chethan Kamath Hosdurg, and Vikas Kumar. “Private Set-Intersection
with Common Set-Up.” American Institute of Mathematical Sciences. AIMS,
2018. https://doi.org/10.3934/amc.2018002.
ieee: S. Chatterjee, C. Kamath Hosdurg, and V. Kumar, “Private set-intersection
with common set-up,” American Institute of Mathematical Sciences, vol.
12, no. 1. AIMS, pp. 17–47, 2018.
ista: Chatterjee S, Kamath Hosdurg C, Kumar V. 2018. Private set-intersection with
common set-up. American Institute of Mathematical Sciences. 12(1), 17–47.
mla: Chatterjee, Sanjit, et al. “Private Set-Intersection with Common Set-Up.” American
Institute of Mathematical Sciences, vol. 12, no. 1, AIMS, 2018, pp. 17–47,
doi:10.3934/amc.2018002.
short: S. Chatterjee, C. Kamath Hosdurg, V. Kumar, American Institute of Mathematical
Sciences 12 (2018) 17–47.
date_created: 2019-02-13T13:49:41Z
date_published: 2018-02-01T00:00:00Z
date_updated: 2023-09-19T14:27:59Z
day: '01'
department:
- _id: KrPi
doi: 10.3934/amc.2018002
external_id:
isi:
- '000430950400002'
intvolume: ' 12'
isi: 1
issue: '1'
language:
- iso: eng
month: '02'
oa_version: None
page: 17-47
publication: American Institute of Mathematical Sciences
publication_status: published
publisher: AIMS
quality_controlled: '1'
scopus_import: '1'
status: public
title: Private set-intersection with common set-up
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 12
year: '2018'
...
---
_id: '5982'
abstract:
- lang: eng
text: In the present work, we detail a fast and simple solution-based method to
synthesize hexagonal SnSe2 nanoplates (NPLs) and their use to produce crystallographically
textured SnSe2 nanomaterials. We also demonstrate that the same strategy can be
used to produce orthorhombic SnSe nanostructures and nanomaterials. NPLs are grown
through a screw dislocation-driven mechanism. This mechanism typically results
in pyramidal structures, but we demonstrate here that the growth from multiple
dislocations results in flower-like structures. Crystallographically textured
SnSe2 bulk nanomaterials obtained from the hot pressing of these SnSe2 structures
display highly anisotropic charge and heat transport properties and thermoelectric
(TE) figures of merit limited by relatively low electrical conductivities. To
improve this parameter, SnSe2 NPLs are blended here with metal nanoparticles.
The electrical conductivities of the blends are significantly improved with respect
to bare SnSe2 NPLs, what translates into a three-fold increase of the TE Figure
of merit, reaching unprecedented ZT values up to 0.65.
article_processing_charge: No
article_type: original
author:
- first_name: Yu
full_name: Zhang, Yu
last_name: Zhang
- first_name: Yu
full_name: Liu, Yu
last_name: Liu
- first_name: Khak Ho
full_name: Lim, Khak Ho
last_name: Lim
- first_name: Congcong
full_name: Xing, Congcong
last_name: Xing
- first_name: Mengyao
full_name: Li, Mengyao
last_name: Li
- first_name: Ting
full_name: Zhang, Ting
last_name: Zhang
- first_name: Pengyi
full_name: Tang, Pengyi
last_name: Tang
- first_name: Jordi
full_name: Arbiol, Jordi
last_name: Arbiol
- first_name: Jordi
full_name: Llorca, Jordi
last_name: Llorca
- first_name: Ka Ming
full_name: Ng, Ka Ming
last_name: Ng
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
- first_name: Pablo
full_name: Guardia, Pablo
last_name: Guardia
- first_name: Mirko
full_name: Prato, Mirko
last_name: Prato
- first_name: Doris
full_name: Cadavid, Doris
last_name: Cadavid
- first_name: Andreu
full_name: Cabot, Andreu
last_name: Cabot
citation:
ama: Zhang Y, Liu Y, Lim KH, et al. Tin diselenide molecular precursor for solution-processable
thermoelectric materials. Angewandte Chemie International Edition. 2018;57(52):17063-17068.
doi:10.1002/anie.201809847
apa: Zhang, Y., Liu, Y., Lim, K. H., Xing, C., Li, M., Zhang, T., … Cabot, A. (2018).
Tin diselenide molecular precursor for solution-processable thermoelectric materials.
Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.201809847
chicago: Zhang, Yu, Yu Liu, Khak Ho Lim, Congcong Xing, Mengyao Li, Ting Zhang,
Pengyi Tang, et al. “Tin Diselenide Molecular Precursor for Solution-Processable
Thermoelectric Materials.” Angewandte Chemie International Edition. Wiley,
2018. https://doi.org/10.1002/anie.201809847.
ieee: Y. Zhang et al., “Tin diselenide molecular precursor for solution-processable
thermoelectric materials,” Angewandte Chemie International Edition, vol.
57, no. 52. Wiley, pp. 17063–17068, 2018.
ista: Zhang Y, Liu Y, Lim KH, Xing C, Li M, Zhang T, Tang P, Arbiol J, Llorca J,
Ng KM, Ibáñez M, Guardia P, Prato M, Cadavid D, Cabot A. 2018. Tin diselenide
molecular precursor for solution-processable thermoelectric materials. Angewandte
Chemie International Edition. 57(52), 17063–17068.
mla: Zhang, Yu, et al. “Tin Diselenide Molecular Precursor for Solution-Processable
Thermoelectric Materials.” Angewandte Chemie International Edition, vol.
57, no. 52, Wiley, 2018, pp. 17063–68, doi:10.1002/anie.201809847.
short: Y. Zhang, Y. Liu, K.H. Lim, C. Xing, M. Li, T. Zhang, P. Tang, J. Arbiol,
J. Llorca, K.M. Ng, M. Ibáñez, P. Guardia, M. Prato, D. Cadavid, A. Cabot, Angewandte
Chemie International Edition 57 (2018) 17063–17068.
date_created: 2019-02-14T10:23:27Z
date_published: 2018-12-21T00:00:00Z
date_updated: 2023-09-19T14:28:31Z
day: '21'
department:
- _id: MaIb
doi: 10.1002/anie.201809847
external_id:
isi:
- '000454575500020'
intvolume: ' 57'
isi: 1
issue: '52'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://upcommons.upc.edu/bitstream/2117/130444/1/Zhang%20preprint.pdf
month: '12'
oa: 1
oa_version: Submitted Version
page: 17063-17068
publication: Angewandte Chemie International Edition
publication_identifier:
issn:
- 1433-7851
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Tin diselenide molecular precursor for solution-processable thermoelectric
materials
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 57
year: '2018'
...
---
_id: '5983'
abstract:
- lang: eng
text: We study a quantum impurity possessing both translational and internal rotational
degrees of freedom interacting with a bosonic bath. Such a system corresponds
to a “rotating polaron,” which can be used to model, e.g., a rotating molecule
immersed in an ultracold Bose gas or superfluid helium. We derive the Hamiltonian
of the rotating polaron and study its spectrum in the weak- and strong-coupling
regimes using a combination of variational, diagrammatic, and mean-field approaches.
We reveal how the coupling between linear and angular momenta affects stable quasiparticle
states, and demonstrate that internal rotation leads to an enhanced self-localization
in the translational degrees of freedom.
article_number: '224506'
article_processing_charge: No
arxiv: 1
author:
- first_name: Enderalp
full_name: Yakaboylu, Enderalp
id: 38CB71F6-F248-11E8-B48F-1D18A9856A87
last_name: Yakaboylu
orcid: 0000-0001-5973-0874
- first_name: Bikashkali
full_name: Midya, Bikashkali
id: 456187FC-F248-11E8-B48F-1D18A9856A87
last_name: Midya
- first_name: Andreas
full_name: Deuchert, Andreas
id: 4DA65CD0-F248-11E8-B48F-1D18A9856A87
last_name: Deuchert
orcid: 0000-0003-3146-6746
- first_name: Nikolai K
full_name: Leopold, Nikolai K
id: 4BC40BEC-F248-11E8-B48F-1D18A9856A87
last_name: Leopold
orcid: 0000-0002-0495-6822
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
citation:
ama: 'Yakaboylu E, Midya B, Deuchert A, Leopold NK, Lemeshko M. Theory of the rotating
polaron: Spectrum and self-localization. Physical Review B. 2018;98(22).
doi:10.1103/physrevb.98.224506'
apa: 'Yakaboylu, E., Midya, B., Deuchert, A., Leopold, N. K., & Lemeshko, M.
(2018). Theory of the rotating polaron: Spectrum and self-localization. Physical
Review B. American Physical Society. https://doi.org/10.1103/physrevb.98.224506'
chicago: 'Yakaboylu, Enderalp, Bikashkali Midya, Andreas Deuchert, Nikolai K Leopold,
and Mikhail Lemeshko. “Theory of the Rotating Polaron: Spectrum and Self-Localization.”
Physical Review B. American Physical Society, 2018. https://doi.org/10.1103/physrevb.98.224506.'
ieee: 'E. Yakaboylu, B. Midya, A. Deuchert, N. K. Leopold, and M. Lemeshko, “Theory
of the rotating polaron: Spectrum and self-localization,” Physical Review B,
vol. 98, no. 22. American Physical Society, 2018.'
ista: 'Yakaboylu E, Midya B, Deuchert A, Leopold NK, Lemeshko M. 2018. Theory of
the rotating polaron: Spectrum and self-localization. Physical Review B. 98(22),
224506.'
mla: 'Yakaboylu, Enderalp, et al. “Theory of the Rotating Polaron: Spectrum and
Self-Localization.” Physical Review B, vol. 98, no. 22, 224506, American
Physical Society, 2018, doi:10.1103/physrevb.98.224506.'
short: E. Yakaboylu, B. Midya, A. Deuchert, N.K. Leopold, M. Lemeshko, Physical
Review B 98 (2018).
date_created: 2019-02-14T10:37:09Z
date_published: 2018-12-12T00:00:00Z
date_updated: 2023-09-19T14:29:03Z
day: '12'
department:
- _id: MiLe
- _id: RoSe
doi: 10.1103/physrevb.98.224506
ec_funded: 1
external_id:
arxiv:
- '1809.01204'
isi:
- '000452992700008'
intvolume: ' 98'
isi: 1
issue: '22'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1809.01204
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: Physical Review B
publication_identifier:
eissn:
- 2469-9969
issn:
- 2469-9950
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Theory of the rotating polaron: Spectrum and self-localization'
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 98
year: '2018'
...
---
_id: '5984'
abstract:
- lang: eng
text: G-protein-coupled receptors (GPCRs) form the largest receptor family, relay
environmental stimuli to changes in cell behavior and represent prime drug targets.
Many GPCRs are classified as orphan receptors because of the limited knowledge
on their ligands and coupling to cellular signaling machineries. Here, we engineer
a library of 63 chimeric receptors that contain the signaling domains of human
orphan and understudied GPCRs functionally linked to the light-sensing domain
of rhodopsin. Upon stimulation with visible light, we identify activation of canonical
cell signaling pathways, including cAMP-, Ca2+-, MAPK/ERK-, and Rho-dependent
pathways, downstream of the engineered receptors. For the human pseudogene GPR33,
we resurrect a signaling function that supports its hypothesized role as a pathogen
entry site. These results demonstrate that substituting unknown chemical activators
with a light switch can reveal information about protein function and provide
an optically controlled protein library for exploring the physiology and therapeutic
potential of understudied GPCRs.
article_number: '1950'
article_processing_charge: No
author:
- first_name: Maurizio
full_name: Morri, Maurizio
id: 4863116E-F248-11E8-B48F-1D18A9856A87
last_name: Morri
- first_name: Inmaculada
full_name: Sanchez-Romero, Inmaculada
id: 3D9C5D30-F248-11E8-B48F-1D18A9856A87
last_name: Sanchez-Romero
- first_name: Alexandra-Madelaine
full_name: Tichy, Alexandra-Madelaine
id: 29D8BB2C-F248-11E8-B48F-1D18A9856A87
last_name: Tichy
- first_name: Stephanie
full_name: Kainrath, Stephanie
id: 32CFBA64-F248-11E8-B48F-1D18A9856A87
last_name: Kainrath
- first_name: Elliot J.
full_name: Gerrard, Elliot J.
last_name: Gerrard
- first_name: Priscila
full_name: Hirschfeld, Priscila
id: 435ACB3A-F248-11E8-B48F-1D18A9856A87
last_name: Hirschfeld
- first_name: Jan
full_name: Schwarz, Jan
id: 346C1EC6-F248-11E8-B48F-1D18A9856A87
last_name: Schwarz
- first_name: Harald L
full_name: Janovjak, Harald L
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
citation:
ama: Morri M, Sanchez-Romero I, Tichy A-M, et al. Optical functionalization of human
class A orphan G-protein-coupled receptors. Nature Communications. 2018;9(1).
doi:10.1038/s41467-018-04342-1
apa: Morri, M., Sanchez-Romero, I., Tichy, A.-M., Kainrath, S., Gerrard, E. J.,
Hirschfeld, P., … Janovjak, H. L. (2018). Optical functionalization of human class
A orphan G-protein-coupled receptors. Nature Communications. Springer Nature.
https://doi.org/10.1038/s41467-018-04342-1
chicago: Morri, Maurizio, Inmaculada Sanchez-Romero, Alexandra-Madelaine Tichy,
Stephanie Kainrath, Elliot J. Gerrard, Priscila Hirschfeld, Jan Schwarz, and Harald
L Janovjak. “Optical Functionalization of Human Class A Orphan G-Protein-Coupled
Receptors.” Nature Communications. Springer Nature, 2018. https://doi.org/10.1038/s41467-018-04342-1.
ieee: M. Morri et al., “Optical functionalization of human class A orphan
G-protein-coupled receptors,” Nature Communications, vol. 9, no. 1. Springer
Nature, 2018.
ista: Morri M, Sanchez-Romero I, Tichy A-M, Kainrath S, Gerrard EJ, Hirschfeld P,
Schwarz J, Janovjak HL. 2018. Optical functionalization of human class A orphan
G-protein-coupled receptors. Nature Communications. 9(1), 1950.
mla: Morri, Maurizio, et al. “Optical Functionalization of Human Class A Orphan
G-Protein-Coupled Receptors.” Nature Communications, vol. 9, no. 1, 1950,
Springer Nature, 2018, doi:10.1038/s41467-018-04342-1.
short: M. Morri, I. Sanchez-Romero, A.-M. Tichy, S. Kainrath, E.J. Gerrard, P. Hirschfeld,
J. Schwarz, H.L. Janovjak, Nature Communications 9 (2018).
date_created: 2019-02-14T10:50:24Z
date_published: 2018-12-01T00:00:00Z
date_updated: 2023-09-19T14:29:32Z
day: '01'
ddc:
- '570'
department:
- _id: HaJa
- _id: CaGu
- _id: MiSi
doi: 10.1038/s41467-018-04342-1
ec_funded: 1
external_id:
isi:
- '000432280000006'
file:
- access_level: open_access
checksum: 8325fcc194264af4749e662a73bf66b5
content_type: application/pdf
creator: kschuh
date_created: 2019-02-14T10:58:29Z
date_updated: 2020-07-14T12:47:14Z
file_id: '5985'
file_name: 2018_Springer_Morri.pdf
file_size: 1349914
relation: main_file
file_date_updated: 2020-07-14T12:47:14Z
has_accepted_license: '1'
intvolume: ' 9'
isi: 1
issue: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 25548C20-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '303564'
name: Microbial Ion Channels for Synthetic Neurobiology
- _id: 255A6082-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: W1232-B24
name: Molecular Drug Targets
publication: Nature Communications
publication_identifier:
issn:
- 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optical functionalization of human class A orphan G-protein-coupled receptors
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: 9
year: '2018'
...
---
_id: '5989'
abstract:
- lang: eng
text: Schistosomes are the causative agents of schistosomiasis, a neglected tropical
disease affecting over 230 million people worldwide.Additionally to their major
impact on human health, they are also models of choice in evolutionary biology.
These parasitic flatwormsare unique among the common hermaphroditic trematodes
as they have separate sexes. This so-called “evolutionary scandal”displays a female
heterogametic genetic sex-determination system (ZZ males and ZW females), as well
as a pronounced adult sexualdimorphism. These phenotypic differences are determined
by a shared set of genes in both sexes, potentially leading to intralocussexual
conflicts. To resolve these conflicts in sexually selected traits, molecular mechanisms
such as sex-biased gene expression couldoccur, but parent-of-origin gene expression
also provides an alternative. In this work we investigated the latter mechanism,
that is,genes expressed preferentially from either the maternal or the paternal
allele, inSchistosoma mansonispecies. To this end, tran-scriptomes from male and
female hybrid adults obtained by strain crosses were sequenced. Strain-specific
single nucleotide poly-morphism (SNP) markers allowed us to discriminate the parental
origin, while reciprocal crosses helped to differentiate parentalexpression from
strain-specific expression. We identified genes containing SNPs expressed in a
parent-of-origin manner consistentwith paternal and maternal imprints. Although
the majority of the SNPs was identified in mitochondrial and Z-specific loci,
theremaining SNPs found in male and female transcriptomes were situated in genes
that have the potential to explain sexual differencesin schistosome parasites.
Furthermore, we identified and validated four new Z-specific scaffolds.
article_processing_charge: No
author:
- first_name: Julien
full_name: Kincaid-Smith, Julien
last_name: Kincaid-Smith
- first_name: Marion A L
full_name: Picard, Marion A L
id: 2C921A7A-F248-11E8-B48F-1D18A9856A87
last_name: Picard
orcid: 0000-0002-8101-2518
- first_name: Céline
full_name: Cosseau, Céline
last_name: Cosseau
- first_name: Jérôme
full_name: Boissier, Jérôme
last_name: Boissier
- first_name: Dany
full_name: Severac, Dany
last_name: Severac
- first_name: Christoph
full_name: Grunau, Christoph
last_name: Grunau
- first_name: Eve
full_name: Toulza, Eve
last_name: Toulza
citation:
ama: Kincaid-Smith J, Picard MAL, Cosseau C, et al. Parent-of-Origin-Dependent Gene
Expression in Male and Female Schistosome Parasites. Genome Biology and Evolution.
2018;10(3):840-856. doi:10.1093/gbe/evy037
apa: Kincaid-Smith, J., Picard, M. A. L., Cosseau, C., Boissier, J., Severac, D.,
Grunau, C., & Toulza, E. (2018). Parent-of-Origin-Dependent Gene Expression
in Male and Female Schistosome Parasites. Genome Biology and Evolution.
Oxford University Press. https://doi.org/10.1093/gbe/evy037
chicago: Kincaid-Smith, Julien, Marion A L Picard, Céline Cosseau, Jérôme Boissier,
Dany Severac, Christoph Grunau, and Eve Toulza. “Parent-of-Origin-Dependent Gene
Expression in Male and Female Schistosome Parasites.” Genome Biology and Evolution.
Oxford University Press, 2018. https://doi.org/10.1093/gbe/evy037.
ieee: J. Kincaid-Smith et al., “Parent-of-Origin-Dependent Gene Expression
in Male and Female Schistosome Parasites,” Genome Biology and Evolution,
vol. 10, no. 3. Oxford University Press, pp. 840–856, 2018.
ista: Kincaid-Smith J, Picard MAL, Cosseau C, Boissier J, Severac D, Grunau C, Toulza
E. 2018. Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome
Parasites. Genome Biology and Evolution. 10(3), 840–856.
mla: Kincaid-Smith, Julien, et al. “Parent-of-Origin-Dependent Gene Expression in
Male and Female Schistosome Parasites.” Genome Biology and Evolution, vol.
10, no. 3, Oxford University Press, 2018, pp. 840–56, doi:10.1093/gbe/evy037.
short: J. Kincaid-Smith, M.A.L. Picard, C. Cosseau, J. Boissier, D. Severac, C.
Grunau, E. Toulza, Genome Biology and Evolution 10 (2018) 840–856.
date_created: 2019-02-14T12:13:52Z
date_published: 2018-03-01T00:00:00Z
date_updated: 2023-09-19T14:39:08Z
day: '01'
ddc:
- '570'
department:
- _id: BeVi
doi: 10.1093/gbe/evy037
external_id:
isi:
- '000429483700013'
file:
- access_level: open_access
checksum: 736a459cb77de5824354466bb0331caf
content_type: application/pdf
creator: dernst
date_created: 2019-02-14T12:20:01Z
date_updated: 2020-07-14T12:47:15Z
file_id: '5991'
file_name: 2018_GBE_Kincaid_Smith.pdf
file_size: 529755
relation: main_file
file_date_updated: 2020-07-14T12:47:15Z
has_accepted_license: '1'
intvolume: ' 10'
isi: 1
issue: '3'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '03'
oa: 1
oa_version: Published Version
page: 840-856
publication: Genome Biology and Evolution
publication_identifier:
issn:
- 1759-6653
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10
year: '2018'
...