---
_id: '640'
abstract:
- lang: eng
text: 'Data-independent Memory Hard Functions (iMHFS) are finding a growing number
of applications in security; especially in the domain of password hashing. An
important property of a concrete iMHF is specified by fixing a directed acyclic
graph (DAG) Gn on n nodes. The quality of that iMHF is then captured by the following
two pebbling complexities of Gn: – The parallel cumulative pebbling complexity
Π∥cc(Gn) must be as high as possible (to ensure that the amortized cost of computing
the function on dedicated hardware is dominated by the cost of memory). – The
sequential space-time pebbling complexity Πst(Gn) should be as close as possible
to Π∥cc(Gn) (to ensure that using many cores in parallel and amortizing over many
instances does not give much of an advantage). In this paper we construct a family
of DAGs with best possible parameters in an asymptotic sense, i.e., where Π∥cc(Gn)
= Ω(n2/ log(n)) (which matches a known upper bound) and Πst(Gn) is within a constant
factor of Π∥cc(Gn). Our analysis relies on a new connection between the pebbling
complexity of a DAG and its depth-robustness (DR) – a well studied combinatorial
property. We show that high DR is sufficient for high Π∥cc. Alwen and Blocki (CRYPTO’16)
showed that high DR is necessary and so, together, these results fully characterize
DAGs with high Π∥cc in terms of DR. Complementing these results, we provide new
upper and lower bounds on the Π∥cc of several important candidate iMHFs from the
literature. We give the first lower bounds on the memory hardness of the Catena
and Balloon Hashing functions in a parallel model of computation and we give the
first lower bounds of any kind for (a version) of Argon2i. Finally we describe
a new class of pebbling attacks improving on those of Alwen and Blocki (CRYPTO’16).
By instantiating these attacks we upperbound the Π∥cc of the Password Hashing
Competition winner Argon2i and one of the Balloon Hashing functions by O (n1.71).
We also show an upper bound of O(n1.625) for the Catena functions and the two
remaining Balloon Hashing functions.'
alternative_title:
- LNCS
author:
- first_name: Joel F
full_name: Alwen, Joel F
id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87
last_name: Alwen
- first_name: Jeremiah
full_name: Blocki, Jeremiah
last_name: Blocki
- 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: 'Alwen JF, Blocki J, Pietrzak KZ. Depth-robust graphs and their cumulative
memory complexity. In: Coron J-S, Buus Nielsen J, eds. Vol 10212. Springer; 2017:3-32.
doi:10.1007/978-3-319-56617-7_1'
apa: 'Alwen, J. F., Blocki, J., & Pietrzak, K. Z. (2017). Depth-robust graphs
and their cumulative memory complexity. In J.-S. Coron & J. Buus Nielsen (Eds.)
(Vol. 10212, pp. 3–32). Presented at the EUROCRYPT: Theory and Applications of
Cryptographic Techniques, Paris, France: Springer. https://doi.org/10.1007/978-3-319-56617-7_1'
chicago: Alwen, Joel F, Jeremiah Blocki, and Krzysztof Z Pietrzak. “Depth-Robust
Graphs and Their Cumulative Memory Complexity.” edited by Jean-Sébastien Coron
and Jesper Buus Nielsen, 10212:3–32. Springer, 2017. https://doi.org/10.1007/978-3-319-56617-7_1.
ieee: 'J. F. Alwen, J. Blocki, and K. Z. Pietrzak, “Depth-robust graphs and their
cumulative memory complexity,” presented at the EUROCRYPT: Theory and Applications
of Cryptographic Techniques, Paris, France, 2017, vol. 10212, pp. 3–32.'
ista: 'Alwen JF, Blocki J, Pietrzak KZ. 2017. Depth-robust graphs and their cumulative
memory complexity. EUROCRYPT: Theory and Applications of Cryptographic Techniques,
LNCS, vol. 10212, 3–32.'
mla: Alwen, Joel F., et al. Depth-Robust Graphs and Their Cumulative Memory Complexity.
Edited by Jean-Sébastien Coron and Jesper Buus Nielsen, vol. 10212, Springer,
2017, pp. 3–32, doi:10.1007/978-3-319-56617-7_1.
short: J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, J.-S. Coron, J. Buus Nielsen (Eds.),
Springer, 2017, pp. 3–32.
conference:
end_date: 2017-05-04
location: Paris, France
name: 'EUROCRYPT: Theory and Applications of Cryptographic Techniques'
start_date: 2017-04-30
date_created: 2018-12-11T11:47:39Z
date_published: 2017-04-01T00:00:00Z
date_updated: 2021-01-12T08:07:22Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-319-56617-7_1
ec_funded: 1
editor:
- first_name: Jean-Sébastien
full_name: Coron, Jean-Sébastien
last_name: Coron
- first_name: Jesper
full_name: Buus Nielsen, Jesper
last_name: Buus Nielsen
intvolume: ' 10212'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2016/875
month: '04'
oa: 1
oa_version: Submitted Version
page: 3 - 32
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_identifier:
isbn:
- 978-331956616-0
publication_status: published
publisher: Springer
publist_id: '7148'
quality_controlled: '1'
scopus_import: 1
status: public
title: Depth-robust graphs and their cumulative memory complexity
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 10212
year: '2017'
...
---
_id: '6426'
abstract:
- lang: eng
text: Synchronous programs are easy to specify because the side effects of an operation
are finished by the time the invocation of the operation returns to the caller.
Asynchronous programs, on the other hand, are difficult to specify because there
are side effects due to pending computation scheduled as a result of the invocation
of an operation. They are also difficult to verify because of the large number
of possible interleavings of concurrent asynchronous computation threads. We show
that specifications and correctness proofs for asynchronous programs can be structured
by introducing the fiction, for proof purposes, that intermediate, non-quiescent
states of asynchronous operations can be ignored. Then, the task of specification
becomes relatively simple and the task of verification can be naturally decomposed
into smaller sub-tasks. The sub-tasks iteratively summarize, guided by the structure
of an asynchronous program, the atomic effect of non-atomic operations and the
synchronous effect of asynchronous operations. This structuring of specifications
and proofs corresponds to the introduction of multiple layers of stepwise refinement
for asynchronous programs. We present the first proof rule, called synchronization,
to reduce asynchronous invocations on a lower layer to synchronous invocations
on a higher layer. We implemented our proof method in CIVL and evaluated it on
a collection of benchmark programs.
alternative_title:
- IST Austria Technical Report
author:
- 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: Bernhard
full_name: Kragl, Bernhard
id: 320FC952-F248-11E8-B48F-1D18A9856A87
last_name: Kragl
orcid: 0000-0001-7745-9117
- first_name: Shaz
full_name: Qadeer, Shaz
last_name: Qadeer
citation:
ama: Henzinger TA, Kragl B, Qadeer S. Synchronizing the Asynchronous. IST
Austria; 2017. doi:10.15479/AT:IST-2018-853-v2-2
apa: Henzinger, T. A., Kragl, B., & Qadeer, S. (2017). Synchronizing the
asynchronous. IST Austria. https://doi.org/10.15479/AT:IST-2018-853-v2-2
chicago: Henzinger, Thomas A, Bernhard Kragl, and Shaz Qadeer. Synchronizing
the Asynchronous. IST Austria, 2017. https://doi.org/10.15479/AT:IST-2018-853-v2-2.
ieee: T. A. Henzinger, B. Kragl, and S. Qadeer, Synchronizing the asynchronous.
IST Austria, 2017.
ista: Henzinger TA, Kragl B, Qadeer S. 2017. Synchronizing the asynchronous, IST
Austria, 28p.
mla: Henzinger, Thomas A., et al. Synchronizing the Asynchronous. IST Austria,
2017, doi:10.15479/AT:IST-2018-853-v2-2.
short: T.A. Henzinger, B. Kragl, S. Qadeer, Synchronizing the Asynchronous, IST
Austria, 2017.
date_created: 2019-05-13T08:15:55Z
date_published: 2017-08-04T00:00:00Z
date_updated: 2023-02-21T16:59:21Z
day: '04'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.15479/AT:IST-2018-853-v2-2
file:
- access_level: open_access
checksum: b48d42725182d7ca10107a118815f4cf
content_type: application/pdf
creator: dernst
date_created: 2019-05-13T08:14:44Z
date_updated: 2020-07-14T12:47:30Z
file_id: '6431'
file_name: main(1).pdf
file_size: 971347
relation: main_file
file_date_updated: 2020-07-14T12:47:30Z
has_accepted_license: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: '28'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
related_material:
record:
- id: '133'
relation: later_version
status: public
status: public
title: Synchronizing the asynchronous
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '642'
abstract:
- lang: eng
text: Cauchy problems with SPDEs on the whole space are localized to Cauchy problems
on a ball of radius R. This localization reduces various kinds of spatial approximation
schemes to finite dimensional problems. The error is shown to be exponentially
small. As an application, a numerical scheme is presented which combines the localization
and the space and time discretization, and thus is fully implementable.
author:
- first_name: Mate
full_name: Gerencser, Mate
id: 44ECEDF2-F248-11E8-B48F-1D18A9856A87
last_name: Gerencser
- first_name: István
full_name: Gyöngy, István
last_name: Gyöngy
citation:
ama: Gerencser M, Gyöngy I. Localization errors in solving stochastic partial differential
equations in the whole space. Mathematics of Computation. 2017;86(307):2373-2397.
doi:10.1090/mcom/3201
apa: Gerencser, M., & Gyöngy, I. (2017). Localization errors in solving stochastic
partial differential equations in the whole space. Mathematics of Computation.
American Mathematical Society. https://doi.org/10.1090/mcom/3201
chicago: Gerencser, Mate, and István Gyöngy. “Localization Errors in Solving Stochastic
Partial Differential Equations in the Whole Space.” Mathematics of Computation.
American Mathematical Society, 2017. https://doi.org/10.1090/mcom/3201.
ieee: M. Gerencser and I. Gyöngy, “Localization errors in solving stochastic partial
differential equations in the whole space,” Mathematics of Computation,
vol. 86, no. 307. American Mathematical Society, pp. 2373–2397, 2017.
ista: Gerencser M, Gyöngy I. 2017. Localization errors in solving stochastic partial
differential equations in the whole space. Mathematics of Computation. 86(307),
2373–2397.
mla: Gerencser, Mate, and István Gyöngy. “Localization Errors in Solving Stochastic
Partial Differential Equations in the Whole Space.” Mathematics of Computation,
vol. 86, no. 307, American Mathematical Society, 2017, pp. 2373–97, doi:10.1090/mcom/3201.
short: M. Gerencser, I. Gyöngy, Mathematics of Computation 86 (2017) 2373–2397.
date_created: 2018-12-11T11:47:40Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2021-01-12T08:07:26Z
day: '01'
department:
- _id: JaMa
doi: 10.1090/mcom/3201
intvolume: ' 86'
issue: '307'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1508.05535
month: '01'
oa: 1
oa_version: Submitted Version
page: 2373 - 2397
publication: Mathematics of Computation
publication_identifier:
issn:
- '00255718'
publication_status: published
publisher: American Mathematical Society
publist_id: '7144'
quality_controlled: '1'
scopus_import: 1
status: public
title: Localization errors in solving stochastic partial differential equations in
the whole space
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 86
year: '2017'
...
---
_id: '645'
abstract:
- lang: eng
text: Markov decision processes (MDPs) are standard models for probabilistic systems
with non-deterministic behaviours. Long-run average rewards provide a mathematically
elegant formalism for expressing long term performance. Value iteration (VI) is
one of the simplest and most efficient algorithmic approaches to MDPs with other
properties, such as reachability objectives. Unfortunately, a naive extension
of VI does not work for MDPs with long-run average rewards, as there is no known
stopping criterion. In this work our contributions are threefold. (1) We refute
a conjecture related to stopping criteria for MDPs with long-run average rewards.
(2) We present two practical algorithms for MDPs with long-run average rewards
based on VI. First, we show that a combination of applying VI locally for each
maximal end-component (MEC) and VI for reachability objectives can provide approximation
guarantees. Second, extending the above approach with a simulation-guided on-demand
variant of VI, we present an anytime algorithm that is able to deal with very
large models. (3) Finally, we present experimental results showing that our methods
significantly outperform the standard approaches on several benchmarks.
alternative_title:
- LNCS
author:
- first_name: Pranav
full_name: Ashok, Pranav
last_name: Ashok
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Przemyslaw
full_name: Daca, Przemyslaw
id: 49351290-F248-11E8-B48F-1D18A9856A87
last_name: Daca
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
- first_name: Tobias
full_name: Meggendorfer, Tobias
last_name: Meggendorfer
citation:
ama: 'Ashok P, Chatterjee K, Daca P, Kretinsky J, Meggendorfer T. Value iteration
for long run average reward in markov decision processes. In: Majumdar R, Kunčak
V, eds. Vol 10426. Springer; 2017:201-221. doi:10.1007/978-3-319-63387-9_10'
apa: 'Ashok, P., Chatterjee, K., Daca, P., Kretinsky, J., & Meggendorfer, T.
(2017). Value iteration for long run average reward in markov decision processes.
In R. Majumdar & V. Kunčak (Eds.) (Vol. 10426, pp. 201–221). Presented at
the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63387-9_10'
chicago: Ashok, Pranav, Krishnendu Chatterjee, Przemyslaw Daca, Jan Kretinsky, and
Tobias Meggendorfer. “Value Iteration for Long Run Average Reward in Markov Decision
Processes.” edited by Rupak Majumdar and Viktor Kunčak, 10426:201–21. Springer,
2017. https://doi.org/10.1007/978-3-319-63387-9_10.
ieee: 'P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, and T. Meggendorfer, “Value
iteration for long run average reward in markov decision processes,” presented
at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10426,
pp. 201–221.'
ista: 'Ashok P, Chatterjee K, Daca P, Kretinsky J, Meggendorfer T. 2017. Value iteration
for long run average reward in markov decision processes. CAV: Computer Aided
Verification, LNCS, vol. 10426, 201–221.'
mla: Ashok, Pranav, et al. Value Iteration for Long Run Average Reward in Markov
Decision Processes. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10426,
Springer, 2017, pp. 201–21, doi:10.1007/978-3-319-63387-9_10.
short: P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, T. Meggendorfer, in:, R.
Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 201–221.
conference:
end_date: 2017-07-28
location: Heidelberg, Germany
name: 'CAV: Computer Aided Verification'
start_date: 2017-07-24
date_created: 2018-12-11T11:47:41Z
date_published: 2017-07-13T00:00:00Z
date_updated: 2021-01-12T08:07:32Z
day: '13'
department:
- _id: KrCh
doi: 10.1007/978-3-319-63387-9_10
ec_funded: 1
editor:
- first_name: Rupak
full_name: Majumdar, Rupak
last_name: Majumdar
- first_name: Viktor
full_name: Kunčak, Viktor
last_name: Kunčak
intvolume: ' 10426'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1705.02326
month: '07'
oa: 1
oa_version: Submitted Version
page: 201 - 221
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_identifier:
isbn:
- 978-331963386-2
publication_status: published
publisher: Springer
publist_id: '7135'
quality_controlled: '1'
scopus_import: 1
status: public
title: Value iteration for long run average reward in markov decision processes
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 10426
year: '2017'
...
---
_id: '644'
abstract:
- lang: eng
text: An instance of the valued constraint satisfaction problem (VCSP) is given
by a finite set of variables, a finite domain of labels, and a sum of functions,
each function depending on a subset of the variables. Each function can take finite
values specifying costs of assignments of labels to its variables or the infinite
value, which indicates an infeasible assignment. The goal is to find an assignment
of labels to the variables that minimizes the sum. We study, assuming that P 6=
NP, how the complexity of this very general problem depends on the set of functions
allowed in the instances, the so-called constraint language. The case when all
allowed functions take values in f0;1g corresponds to ordinary CSPs, where one
deals only with the feasibility issue, and there is no optimization. This case
is the subject of the algebraic CSP dichotomy conjecture predicting for which
constraint languages CSPs are tractable (i.e., solvable in polynomial time) and
for which they are NP-hard. The case when all allowed functions take only finite
values corresponds to a finitevalued CSP, where the feasibility aspect is trivial
and one deals only with the optimization issue. The complexity of finite-valued
CSPs was fully classified by Thapper and Živný. An algebraic necessary condition
for tractability of a general-valued CSP with a fixed constraint language was
recently given by Kozik and Ochremiak. As our main result, we prove that if a
constraint language satisfies this algebraic necessary condition, and the feasibility
CSP (i.e., the problem of deciding whether a given instance has a feasible solution)
corresponding to the VCSP with this language is tractable, then the VCSP is tractable.
The algorithm is a simple combination of the assumed algorithm for the feasibility
CSP and the standard LP relaxation. As a corollary, we obtain that a dichotomy
for ordinary CSPs would imply a dichotomy for general-valued CSPs.
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Andrei
full_name: Krokhin, Andrei
last_name: Krokhin
- first_name: Michal
full_name: Rolinek, Michal
id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87
last_name: Rolinek
citation:
ama: Kolmogorov V, Krokhin A, Rolinek M. The complexity of general-valued CSPs.
SIAM Journal on Computing. 2017;46(3):1087-1110. doi:10.1137/16M1091836
apa: Kolmogorov, V., Krokhin, A., & Rolinek, M. (2017). The complexity of general-valued
CSPs. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/16M1091836
chicago: Kolmogorov, Vladimir, Andrei Krokhin, and Michal Rolinek. “The Complexity
of General-Valued CSPs.” SIAM Journal on Computing. SIAM, 2017. https://doi.org/10.1137/16M1091836.
ieee: V. Kolmogorov, A. Krokhin, and M. Rolinek, “The complexity of general-valued
CSPs,” SIAM Journal on Computing, vol. 46, no. 3. SIAM, pp. 1087–1110,
2017.
ista: Kolmogorov V, Krokhin A, Rolinek M. 2017. The complexity of general-valued
CSPs. SIAM Journal on Computing. 46(3), 1087–1110.
mla: Kolmogorov, Vladimir, et al. “The Complexity of General-Valued CSPs.” SIAM
Journal on Computing, vol. 46, no. 3, SIAM, 2017, pp. 1087–110, doi:10.1137/16M1091836.
short: V. Kolmogorov, A. Krokhin, M. Rolinek, SIAM Journal on Computing 46 (2017)
1087–1110.
date_created: 2018-12-11T11:47:40Z
date_published: 2017-06-29T00:00:00Z
date_updated: 2023-02-23T10:07:49Z
day: '29'
department:
- _id: VlKo
doi: 10.1137/16M1091836
ec_funded: 1
intvolume: ' 46'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1502.07327
month: '06'
oa: 1
oa_version: Preprint
page: 1087 - 1110
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_status: published
publisher: SIAM
publist_id: '7138'
quality_controlled: '1'
related_material:
record:
- id: '1637'
relation: other
status: public
scopus_import: 1
status: public
title: The complexity of general-valued CSPs
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 46
year: '2017'
...
---
_id: '646'
abstract:
- lang: eng
text: We present a novel convex relaxation and a corresponding inference algorithm
for the non-binary discrete tomography problem, that is, reconstructing discrete-valued
images from few linear measurements. In contrast to state of the art approaches
that split the problem into a continuous reconstruction problem for the linear
measurement constraints and a discrete labeling problem to enforce discrete-valued
reconstructions, we propose a joint formulation that addresses both problems simultaneously,
resulting in a tighter convex relaxation. For this purpose a constrained graphical
model is set up and evaluated using a novel relaxation optimized by dual decomposition.
We evaluate our approach experimentally and show superior solutions both mathematically
(tighter relaxation) and experimentally in comparison to previously proposed relaxations.
alternative_title:
- LNCS
author:
- first_name: Jan
full_name: Kuske, Jan
last_name: Kuske
- first_name: Paul
full_name: Swoboda, Paul
id: 446560C6-F248-11E8-B48F-1D18A9856A87
last_name: Swoboda
- first_name: Stefanie
full_name: Petra, Stefanie
last_name: Petra
citation:
ama: 'Kuske J, Swoboda P, Petra S. A novel convex relaxation for non binary discrete
tomography. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:235-246.
doi:10.1007/978-3-319-58771-4_19'
apa: 'Kuske, J., Swoboda, P., & Petra, S. (2017). A novel convex relaxation
for non binary discrete tomography. In F. Lauze, Y. Dong, & A. Bjorholm Dahl
(Eds.) (Vol. 10302, pp. 235–246). Presented at the SSVM: Scale Space and Variational
Methods in Computer Vision, Kolding, Denmark: Springer. https://doi.org/10.1007/978-3-319-58771-4_19'
chicago: Kuske, Jan, Paul Swoboda, and Stefanie Petra. “A Novel Convex Relaxation
for Non Binary Discrete Tomography.” edited by François Lauze, Yiqiu Dong, and
Anders Bjorholm Dahl, 10302:235–46. Springer, 2017. https://doi.org/10.1007/978-3-319-58771-4_19.
ieee: 'J. Kuske, P. Swoboda, and S. Petra, “A novel convex relaxation for non binary
discrete tomography,” presented at the SSVM: Scale Space and Variational Methods
in Computer Vision, Kolding, Denmark, 2017, vol. 10302, pp. 235–246.'
ista: 'Kuske J, Swoboda P, Petra S. 2017. A novel convex relaxation for non binary
discrete tomography. SSVM: Scale Space and Variational Methods in Computer Vision,
LNCS, vol. 10302, 235–246.'
mla: Kuske, Jan, et al. A Novel Convex Relaxation for Non Binary Discrete Tomography.
Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 235–46, doi:10.1007/978-3-319-58771-4_19.
short: J. Kuske, P. Swoboda, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl
(Eds.), Springer, 2017, pp. 235–246.
conference:
end_date: 2017-06-08
location: Kolding, Denmark
name: 'SSVM: Scale Space and Variational Methods in Computer Vision'
start_date: 2017-06-04
date_created: 2018-12-11T11:47:41Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2021-01-12T08:07:34Z
day: '01'
department:
- _id: VlKo
doi: 10.1007/978-3-319-58771-4_19
ec_funded: 1
editor:
- first_name: François
full_name: Lauze, François
last_name: Lauze
- first_name: Yiqiu
full_name: Dong, Yiqiu
last_name: Dong
- first_name: Anders
full_name: Bjorholm Dahl, Anders
last_name: Bjorholm Dahl
intvolume: ' 10302'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1703.03769
month: '06'
oa: 1
oa_version: Submitted Version
page: 235 - 246
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication_identifier:
isbn:
- 978-331958770-7
publication_status: published
publisher: Springer
publist_id: '7132'
quality_controlled: '1'
scopus_import: 1
status: public
title: A novel convex relaxation for non binary discrete tomography
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 10302
year: '2017'
...
---
_id: '648'
abstract:
- lang: eng
text: 'Pseudoentropy has found a lot of important applications to cryptography and
complexity theory. In this paper we focus on the foundational problem that has
not been investigated so far, namely by how much pseudoentropy (the amount seen
by computationally bounded attackers) differs from its information-theoretic counterpart
(seen by unbounded observers), given certain limits on attacker’s computational
power? We provide the following answer for HILL pseudoentropy, which exhibits
a threshold behavior around the size exponential in the entropy amount:– If the
attacker size (s) and advantage () satisfy s (formula presented) where k is the
claimed amount of pseudoentropy, then the pseudoentropy boils down to the information-theoretic
smooth entropy. – If s (formula presented) then pseudoentropy could be arbitrarily
bigger than the information-theoretic smooth entropy. Besides answering the posted
question, we show an elegant application of our result to the complexity theory,
namely that it implies the clas-sical result on the existence of functions hard
to approximate (due to Pippenger). In our approach we utilize non-constructive
techniques: the duality of linear programming and the probabilistic method.'
alternative_title:
- LNCS
author:
- first_name: Maciej
full_name: Skórski, Maciej
id: EC09FA6A-02D0-11E9-8223-86B7C91467DD
last_name: Skórski
citation:
ama: 'Skórski M. On the complexity of breaking pseudoentropy. In: Jäger G, Steila
S, eds. Vol 10185. Springer; 2017:600-613. doi:10.1007/978-3-319-55911-7_43'
apa: 'Skórski, M. (2017). On the complexity of breaking pseudoentropy. In G. Jäger
& S. Steila (Eds.) (Vol. 10185, pp. 600–613). Presented at the TAMC: Theory
and Applications of Models of Computation, Bern, Switzerland: Springer. https://doi.org/10.1007/978-3-319-55911-7_43'
chicago: Skórski, Maciej. “On the Complexity of Breaking Pseudoentropy.” edited
by Gerhard Jäger and Silvia Steila, 10185:600–613. Springer, 2017. https://doi.org/10.1007/978-3-319-55911-7_43.
ieee: 'M. Skórski, “On the complexity of breaking pseudoentropy,” presented at the
TAMC: Theory and Applications of Models of Computation, Bern, Switzerland, 2017,
vol. 10185, pp. 600–613.'
ista: 'Skórski M. 2017. On the complexity of breaking pseudoentropy. TAMC: Theory
and Applications of Models of Computation, LNCS, vol. 10185, 600–613.'
mla: Skórski, Maciej. On the Complexity of Breaking Pseudoentropy. Edited
by Gerhard Jäger and Silvia Steila, vol. 10185, Springer, 2017, pp. 600–13, doi:10.1007/978-3-319-55911-7_43.
short: M. Skórski, in:, G. Jäger, S. Steila (Eds.), Springer, 2017, pp. 600–613.
conference:
end_date: 2017-04-22
location: Bern, Switzerland
name: 'TAMC: Theory and Applications of Models of Computation'
start_date: 2017-04-20
date_created: 2018-12-11T11:47:42Z
date_published: 2017-04-01T00:00:00Z
date_updated: 2021-01-12T08:07:39Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-319-55911-7_43
editor:
- first_name: Gerhard
full_name: Jäger, Gerhard
last_name: Jäger
- first_name: Silvia
full_name: Steila, Silvia
last_name: Steila
intvolume: ' 10185'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2016/1186.pdf
month: '04'
oa: 1
oa_version: Submitted Version
page: 600 - 613
publication_identifier:
isbn:
- 978-331955910-0
publication_status: published
publisher: Springer
publist_id: '7125'
quality_controlled: '1'
scopus_import: 1
status: public
title: On the complexity of breaking pseudoentropy
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 10185
year: '2017'
...
---
_id: '650'
abstract:
- lang: eng
text: 'In this work we present a short and unified proof for the Strong and Weak
Regularity Lemma, based on the cryptographic tech-nique called low-complexity
approximations. In short, both problems reduce to a task of finding constructively
an approximation for a certain target function under a class of distinguishers
(test functions), where dis-tinguishers are combinations of simple rectangle-indicators.
In our case these approximations can be learned by a simple iterative procedure,
which yields a unified and simple proof, achieving for any graph with density
d and any approximation parameter the partition size. The novelty in our proof
is: (a) a simple approach which yields both strong and weaker variant, and (b)
improvements when d = o(1). At an abstract level, our proof can be seen a refinement
and simplification of the “analytic” proof given by Lovasz and Szegedy.'
alternative_title:
- LNCS
author:
- first_name: Maciej
full_name: Skórski, Maciej
id: EC09FA6A-02D0-11E9-8223-86B7C91467DD
last_name: Skórski
citation:
ama: 'Skórski M. A cryptographic view of regularity lemmas: Simpler unified proofs
and refined bounds. In: Jäger G, Steila S, eds. Vol 10185. Springer; 2017:586-599.
doi:10.1007/978-3-319-55911-7_42'
apa: 'Skórski, M. (2017). A cryptographic view of regularity lemmas: Simpler unified
proofs and refined bounds. In G. Jäger & S. Steila (Eds.) (Vol. 10185, pp.
586–599). Presented at the TAMC: Theory and Applications of Models of Computation,
Bern, Switzerland: Springer. https://doi.org/10.1007/978-3-319-55911-7_42'
chicago: 'Skórski, Maciej. “A Cryptographic View of Regularity Lemmas: Simpler Unified
Proofs and Refined Bounds.” edited by Gerhard Jäger and Silvia Steila, 10185:586–99.
Springer, 2017. https://doi.org/10.1007/978-3-319-55911-7_42.'
ieee: 'M. Skórski, “A cryptographic view of regularity lemmas: Simpler unified proofs
and refined bounds,” presented at the TAMC: Theory and Applications of Models
of Computation, Bern, Switzerland, 2017, vol. 10185, pp. 586–599.'
ista: 'Skórski M. 2017. A cryptographic view of regularity lemmas: Simpler unified
proofs and refined bounds. TAMC: Theory and Applications of Models of Computation,
LNCS, vol. 10185, 586–599.'
mla: 'Skórski, Maciej. A Cryptographic View of Regularity Lemmas: Simpler Unified
Proofs and Refined Bounds. Edited by Gerhard Jäger and Silvia Steila, vol.
10185, Springer, 2017, pp. 586–99, doi:10.1007/978-3-319-55911-7_42.'
short: M. Skórski, in:, G. Jäger, S. Steila (Eds.), Springer, 2017, pp. 586–599.
conference:
end_date: 2017-04-22
location: Bern, Switzerland
name: 'TAMC: Theory and Applications of Models of Computation'
start_date: 2017-04-20
date_created: 2018-12-11T11:47:42Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2021-01-12T08:07:46Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-319-55911-7_42
editor:
- first_name: Gerhard
full_name: Jäger, Gerhard
last_name: Jäger
- first_name: Silvia
full_name: Steila, Silvia
last_name: Steila
intvolume: ' 10185'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2016/965.pdf
month: '01'
oa: 1
oa_version: Submitted Version
page: 586 - 599
publication_identifier:
issn:
- '03029743'
publication_status: published
publisher: Springer
publist_id: '7119'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'A cryptographic view of regularity lemmas: Simpler unified proofs and refined
bounds'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 10185
year: '2017'
...
---
_id: '6519'
abstract:
- lang: eng
text: 'Graph games with omega-regular winning conditions provide a mathematical
framework to analyze a wide range of problems in the analysis of reactive systems
and programs (such as the synthesis of reactive systems, program repair, and the
verification of branching time properties). Parity conditions are canonical forms
to specify omega-regular winning conditions. Graph games with parity conditions
are equivalent to mu-calculus model checking, and thus a very important algorithmic
problem. Symbolic algorithms are of great significance because they provide scalable
algorithms for the analysis of large finite-state systems, as well as algorithms
for the analysis of infinite-state systems with finite quotient. A set-based symbolic
algorithm uses the basic set operations and the one-step predecessor operators.
We consider graph games with n vertices and parity conditions with c priorities
(equivalently, a mu-calculus formula with c alternations of least and greatest
fixed points). While many explicit algorithms exist for graph games with parity
conditions, for set-based symbolic algorithms there are only two algorithms (notice
that we use space to refer to the number of sets stored by a symbolic algorithm):
(a) the basic algorithm that requires O(n^c) symbolic operations and linear space;
and (b) an improved algorithm that requires O(n^{c/2+1}) symbolic operations but
also O(n^{c/2+1}) space (i.e., exponential space). In this work we present two
set-based symbolic algorithms for parity games: (a) our first algorithm requires
O(n^{c/2+1}) symbolic operations and only requires linear space; and (b) developing
on our first algorithm, we present an algorithm that requires O(n^{c/3+1}) symbolic
operations and only linear space. We also present the first linear space set-based
symbolic algorithm for parity games that requires at most a sub-exponential number
of symbolic operations. '
article_number: '18'
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Wolfgang
full_name: Dvorák, Wolfgang
last_name: Dvorák
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Veronika
full_name: Loitzenbauer, Veronika
last_name: Loitzenbauer
citation:
ama: 'Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. Improved set-based symbolic
algorithms for parity games. In: Vol 82. Schloss Dagstuhl -Leibniz-Zentrum fuer
Informatik; 2017. doi:10.4230/LIPICS.CSL.2017.18'
apa: 'Chatterjee, K., Dvorák, W., Henzinger, M. H., & Loitzenbauer, V. (2017).
Improved set-based symbolic algorithms for parity games (Vol. 82). Presented at
the CSL: Conference on Computer Science Logic, Stockholm, Sweden: Schloss Dagstuhl
-Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPICS.CSL.2017.18'
chicago: Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika
Loitzenbauer. “Improved Set-Based Symbolic Algorithms for Parity Games,” Vol.
82. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017. https://doi.org/10.4230/LIPICS.CSL.2017.18.
ieee: 'K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Improved
set-based symbolic algorithms for parity games,” presented at the CSL: Conference
on Computer Science Logic, Stockholm, Sweden, 2017, vol. 82.'
ista: 'Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2017. Improved set-based
symbolic algorithms for parity games. CSL: Conference on Computer Science Logic
vol. 82, 18.'
mla: Chatterjee, Krishnendu, et al. Improved Set-Based Symbolic Algorithms for
Parity Games. Vol. 82, 18, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik,
2017, doi:10.4230/LIPICS.CSL.2017.18.
short: K. Chatterjee, W. Dvorák, M.H. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl
-Leibniz-Zentrum fuer Informatik, 2017.
conference:
end_date: 2017-08-24
location: Stockholm, Sweden
name: 'CSL: Conference on Computer Science Logic'
start_date: 2017-08-20
date_created: 2019-06-04T12:42:43Z
date_published: 2017-08-01T00:00:00Z
date_updated: 2023-02-14T10:08:25Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.4230/LIPICS.CSL.2017.18
ec_funded: 1
file:
- access_level: open_access
checksum: 7c2c9d09970af79026d7e37d9b632ef8
content_type: application/pdf
creator: kschuh
date_created: 2019-06-04T12:56:52Z
date_updated: 2020-07-14T12:47:33Z
file_id: '6520'
file_name: 2017_LIPIcs-Chatterjee.pdf
file_size: 710185
relation: main_file
file_date_updated: 2020-07-14T12:47:33Z
has_accepted_license: '1'
intvolume: ' 82'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/3.0/
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: 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_status: published
publisher: Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Improved set-based symbolic algorithms for parity games
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 82
year: '2017'
...
---
_id: '6517'
abstract:
- lang: eng
text: A (possibly degenerate) drawing of a graph G in the plane is approximable
by an embedding if it can be turned into an embedding by an arbitrarily small
perturbation. We show that testing, whether a drawing of a planar graph G in the
plane is approximable by an embedding, can be carried out in polynomial time,
if a desired embedding of G belongs to a fixed isotopy class, i.e., the rotation
system (or equivalently the faces) of the embedding of G and the choice of outer
face are fixed. In other words, we show that c-planarity with embedded pipes is
tractable for graphs with fixed embeddings. To the best of our knowledge an analogous
result was previously known essentially only when G is a cycle.
article_number: '34'
author:
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
citation:
ama: 'Fulek R. Embedding graphs into embedded graphs. In: Vol 92. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPICS.ISAAC.2017.34'
apa: 'Fulek, R. (2017). Embedding graphs into embedded graphs (Vol. 92). Presented
at the ISAAC: International Symposium on Algorithms and Computation, Phuket, Thailand:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ISAAC.2017.34'
chicago: Fulek, Radoslav. “Embedding Graphs into Embedded Graphs,” Vol. 92. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPICS.ISAAC.2017.34.
ieee: 'R. Fulek, “Embedding graphs into embedded graphs,” presented at the ISAAC:
International Symposium on Algorithms and Computation, Phuket, Thailand, 2017,
vol. 92.'
ista: 'Fulek R. 2017. Embedding graphs into embedded graphs. ISAAC: International
Symposium on Algorithms and Computation vol. 92, 34.'
mla: Fulek, Radoslav. Embedding Graphs into Embedded Graphs. Vol. 92, 34,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPICS.ISAAC.2017.34.
short: R. Fulek, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
conference:
end_date: 2017-12-22
location: Phuket, Thailand
name: 'ISAAC: International Symposium on Algorithms and Computation'
start_date: 2017-12-09
date_created: 2019-06-04T12:11:52Z
date_published: 2017-12-01T00:00:00Z
date_updated: 2021-01-12T08:07:51Z
day: '01'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.4230/LIPICS.ISAAC.2017.34
ec_funded: 1
file:
- access_level: open_access
checksum: fc7a643e29621c8bbe49d36b39081f31
content_type: application/pdf
creator: kschuh
date_created: 2019-06-04T12:20:35Z
date_updated: 2020-07-14T12:47:33Z
file_id: '6518'
file_name: 2017_LIPIcs-Fulek.pdf
file_size: 588982
relation: main_file
file_date_updated: 2020-07-14T12:47:33Z
has_accepted_license: '1'
intvolume: ' 92'
language:
- iso: eng
month: '12'
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: 261FA626-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02281
name: Eliminating intersections in drawings of graphs
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: 1
status: public
title: Embedding graphs into embedded graphs
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 92
year: '2017'
...
---
_id: '653'
abstract:
- lang: eng
text: The extent of heterogeneity among driver gene mutations present in naturally
occurring metastases - that is, treatment-naive metastatic disease - is largely
unknown. To address this issue, we carried out 60× whole-genome sequencing of
26 metastases from four patients with pancreatic cancer. We found that identical
mutations in known driver genes were present in every metastatic lesion for each
patient studied. Passenger gene mutations, which do not have known or predicted
functional consequences, accounted for all intratumoral heterogeneity. Even with
respect to these passenger mutations, our analysis suggests that the genetic similarity
among the founding cells of metastases was higher than that expected for any two
cells randomly taken from a normal tissue. The uniformity of known driver gene
mutations among metastases in the same patient has critical and encouraging implications
for the success of future targeted therapies in advanced-stage disease.
acknowledgement: 'We thank the Memorial Sloan Kettering Cancer Center Molecular Cytology
core facility for immunohistochemistry staining. This work was supported by Office
of Naval Research grant N00014-16-1-2914, the Bill and Melinda Gates Foundation
(OPP1148627), and a gift from B. Wu and E. Larson (M.A.N.), National Institutes
of Health grants CA179991 (C.A.I.-D. and I.B.), F31 CA180682 (A.P.M.-M.), CA43460
(B.V.), and P50 CA62924, the Monastra Foundation, the Virginia and D.K. Ludwig Fund
for Cancer Research, the Lustgarten Foundation for Pancreatic Cancer Research, the
Sol Goldman Center for Pancreatic Cancer Research, the Sol Goldman Sequencing Center,
ERC Start grant 279307: Graph Games (J.G.R., D.K., and C.K.), Austrian Science Fund
(FWF) grant P23499-N23 (J.G.R., D.K., and C.K.), and FWF NFN grant S11407-N23 RiSE/SHiNE
(J.G.R., D.K., and C.K.).'
article_processing_charge: No
article_type: original
author:
- first_name: Alvin
full_name: Makohon Moore, Alvin
last_name: Makohon Moore
- first_name: Ming
full_name: Zhang, Ming
last_name: Zhang
- first_name: Johannes
full_name: Reiter, Johannes
id: 4A918E98-F248-11E8-B48F-1D18A9856A87
last_name: Reiter
orcid: 0000-0002-0170-7353
- first_name: Ivana
full_name: Božić, Ivana
last_name: Božić
- first_name: Benjamin
full_name: Allen, Benjamin
last_name: Allen
- first_name: Deepanjan
full_name: Kundu, Deepanjan
id: 1d4c0f4f-e8a3-11ec-a351-e36772758c45
last_name: Kundu
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Fay
full_name: Wong, Fay
last_name: Wong
- first_name: Yuchen
full_name: Jiao, Yuchen
last_name: Jiao
- first_name: Zachary
full_name: Kohutek, Zachary
last_name: Kohutek
- first_name: Jungeui
full_name: Hong, Jungeui
last_name: Hong
- first_name: Marc
full_name: Attiyeh, Marc
last_name: Attiyeh
- first_name: Breanna
full_name: Javier, Breanna
last_name: Javier
- first_name: Laura
full_name: Wood, Laura
last_name: Wood
- first_name: Ralph
full_name: Hruban, Ralph
last_name: Hruban
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
- first_name: Nickolas
full_name: Papadopoulos, Nickolas
last_name: Papadopoulos
- first_name: Kenneth
full_name: Kinzler, Kenneth
last_name: Kinzler
- first_name: Bert
full_name: Vogelstein, Bert
last_name: Vogelstein
- first_name: Christine
full_name: Iacobuzio Donahue, Christine
last_name: Iacobuzio Donahue
citation:
ama: Makohon Moore A, Zhang M, Reiter J, et al. Limited heterogeneity of known driver
gene mutations among the metastases of individual patients with pancreatic cancer.
Nature Genetics. 2017;49(3):358-366. doi:10.1038/ng.3764
apa: Makohon Moore, A., Zhang, M., Reiter, J., Božić, I., Allen, B., Kundu, D.,
… Iacobuzio Donahue, C. (2017). Limited heterogeneity of known driver gene mutations
among the metastases of individual patients with pancreatic cancer. Nature
Genetics. Nature Publishing Group. https://doi.org/10.1038/ng.3764
chicago: Makohon Moore, Alvin, Ming Zhang, Johannes Reiter, Ivana Božić, Benjamin
Allen, Deepanjan Kundu, Krishnendu Chatterjee, et al. “Limited Heterogeneity of
Known Driver Gene Mutations among the Metastases of Individual Patients with Pancreatic
Cancer.” Nature Genetics. Nature Publishing Group, 2017. https://doi.org/10.1038/ng.3764.
ieee: A. Makohon Moore et al., “Limited heterogeneity of known driver gene
mutations among the metastases of individual patients with pancreatic cancer,”
Nature Genetics, vol. 49, no. 3. Nature Publishing Group, pp. 358–366,
2017.
ista: Makohon Moore A, Zhang M, Reiter J, Božić I, Allen B, Kundu D, Chatterjee
K, Wong F, Jiao Y, Kohutek Z, Hong J, Attiyeh M, Javier B, Wood L, Hruban R, Nowak
M, Papadopoulos N, Kinzler K, Vogelstein B, Iacobuzio Donahue C. 2017. Limited
heterogeneity of known driver gene mutations among the metastases of individual
patients with pancreatic cancer. Nature Genetics. 49(3), 358–366.
mla: Makohon Moore, Alvin, et al. “Limited Heterogeneity of Known Driver Gene Mutations
among the Metastases of Individual Patients with Pancreatic Cancer.” Nature
Genetics, vol. 49, no. 3, Nature Publishing Group, 2017, pp. 358–66, doi:10.1038/ng.3764.
short: A. Makohon Moore, M. Zhang, J. Reiter, I. Božić, B. Allen, D. Kundu, K. Chatterjee,
F. Wong, Y. Jiao, Z. Kohutek, J. Hong, M. Attiyeh, B. Javier, L. Wood, R. Hruban,
M. Nowak, N. Papadopoulos, K. Kinzler, B. Vogelstein, C. Iacobuzio Donahue, Nature
Genetics 49 (2017) 358–366.
date_created: 2018-12-11T11:47:43Z
date_published: 2017-03-01T00:00:00Z
date_updated: 2022-06-10T09:55:08Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1038/ng.3764
ec_funded: 1
external_id:
pmid:
- '28092682'
file:
- access_level: open_access
checksum: e442dc3b7420a36ec805e9bb45cc1a2e
content_type: application/pdf
creator: dernst
date_created: 2019-11-19T08:13:50Z
date_updated: 2020-07-14T12:47:33Z
file_id: '7050'
file_name: 2017_NatureGenetics_Makohon.pdf
file_size: 908099
relation: main_file
file_date_updated: 2020-07-14T12:47:33Z
has_accepted_license: '1'
intvolume: ' 49'
issue: '3'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Submitted Version
page: 358 - 366
pmid: 1
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: Nature Genetics
publication_identifier:
issn:
- '10614036'
publication_status: published
publisher: Nature Publishing Group
publist_id: '7092'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Limited heterogeneity of known driver gene mutations among the metastases of
individual patients with pancreatic cancer
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 49
year: '2017'
...
---
_id: '6527'
abstract:
- lang: eng
text: "A memory-hard function (MHF) ƒn with parameter n can be computed in sequential
time and space n. Simultaneously, a high amortized parallel area-time complexity
(aAT) is incurred per evaluation. In practice, MHFs are used to limit the rate
at which an adversary (using a custom computational device) can evaluate a security
sensitive function that still occasionally needs to be evaluated by honest users
(using an off-the-shelf general purpose device). The most prevalent examples of
such sensitive functions are Key Derivation Functions (KDFs) and password hashing
algorithms where rate limits help mitigate off-line dictionary attacks. As the
honest users' inputs to these functions are often (low-entropy) passwords special
attention is given to a class of side-channel resistant MHFs called iMHFs.\r\n\r\nEssentially
all iMHFs can be viewed as some mode of operation (making n calls to some round
function) given by a directed acyclic graph (DAG) with very low indegree. Recently,
a combinatorial property of a DAG has been identified (called \"depth-robustness\")
which results in good provable security for an iMHF based on that DAG. Depth-robust
DAGs have also proven useful in other cryptographic applications. Unfortunately,
up till now, all known very depth-robust DAGs are impractically complicated and
little is known about their exact (i.e. non-asymptotic) depth-robustness both
in theory and in practice.\r\n\r\nIn this work we build and analyze (both formally
and empirically) several exceedingly simple and efficient to navigate practical
DAGs for use in iMHFs and other applications. For each DAG we:\r\n*Prove that
their depth-robustness is asymptotically maximal.\r\n*Prove bounds of at least
3 orders of magnitude better on their exact depth-robustness compared to known
bounds for other practical iMHF.\r\n*Implement and empirically evaluate their
depth-robustness and aAT against a variety of state-of-the art (and several new)
depth-reduction and low aAT attacks. \r\nWe find that, against all attacks, the
new DAGs perform significantly better in practice than Argon2i, the most widely
deployed iMHF in practice.\r\n\r\nAlong the way we also improve the best known
empirical attacks on the aAT of Argon2i by implementing and testing several heuristic
versions of a (hitherto purely theoretical) depth-reduction attack. Finally, we
demonstrate practicality of our constructions by modifying the Argon2i code base
to use one of the new high aAT DAGs. Experimental benchmarks on a standard off-the-shelf
CPU show that the new modifications do not adversely affect the impressive throughput
of Argon2i (despite seemingly enjoying significantly higher aAT).\r\n"
author:
- first_name: Joel F
full_name: Alwen, Joel F
id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87
last_name: Alwen
- first_name: Jeremiah
full_name: Blocki, Jeremiah
last_name: Blocki
- first_name: Ben
full_name: Harsha, Ben
last_name: Harsha
citation:
ama: 'Alwen JF, Blocki J, Harsha B. Practical graphs for optimal side-channel resistant
memory-hard functions. In: Proceedings of the 2017 ACM SIGSAC Conference on
Computer and Communications Security. ACM Press; 2017:1001-1017. doi:10.1145/3133956.3134031'
apa: 'Alwen, J. F., Blocki, J., & Harsha, B. (2017). Practical graphs for optimal
side-channel resistant memory-hard functions. In Proceedings of the 2017 ACM
SIGSAC Conference on Computer and Communications Security (pp. 1001–1017).
Dallas, TX, USA: ACM Press. https://doi.org/10.1145/3133956.3134031'
chicago: Alwen, Joel F, Jeremiah Blocki, and Ben Harsha. “Practical Graphs for Optimal
Side-Channel Resistant Memory-Hard Functions.” In Proceedings of the 2017 ACM
SIGSAC Conference on Computer and Communications Security, 1001–17. ACM Press,
2017. https://doi.org/10.1145/3133956.3134031.
ieee: J. F. Alwen, J. Blocki, and B. Harsha, “Practical graphs for optimal side-channel
resistant memory-hard functions,” in Proceedings of the 2017 ACM SIGSAC Conference
on Computer and Communications Security, Dallas, TX, USA, 2017, pp. 1001–1017.
ista: 'Alwen JF, Blocki J, Harsha B. 2017. Practical graphs for optimal side-channel
resistant memory-hard functions. Proceedings of the 2017 ACM SIGSAC Conference
on Computer and Communications Security. CCS: Conference on Computer and Communications
Security, 1001–1017.'
mla: Alwen, Joel F., et al. “Practical Graphs for Optimal Side-Channel Resistant
Memory-Hard Functions.” Proceedings of the 2017 ACM SIGSAC Conference on Computer
and Communications Security, ACM Press, 2017, pp. 1001–17, doi:10.1145/3133956.3134031.
short: J.F. Alwen, J. Blocki, B. Harsha, in:, Proceedings of the 2017 ACM SIGSAC
Conference on Computer and Communications Security, ACM Press, 2017, pp. 1001–1017.
conference:
end_date: 2017-11-03
location: Dallas, TX, USA
name: 'CCS: Conference on Computer and Communications Security'
start_date: 2017-10-30
date_created: 2019-06-06T13:21:29Z
date_published: 2017-10-30T00:00:00Z
date_updated: 2021-01-12T08:07:53Z
day: '30'
department:
- _id: KrPi
doi: 10.1145/3133956.3134031
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2017/443
month: '10'
oa: 1
oa_version: Submitted Version
page: 1001-1017
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications
Security
publication_identifier:
isbn:
- '9781450349468'
publication_status: published
publisher: ACM Press
quality_controlled: '1'
scopus_import: 1
status: public
title: Practical graphs for optimal side-channel resistant memory-hard functions
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '654'
abstract:
- lang: eng
text: In November 2016, developmental biologists, synthetic biologists and engineers
gathered in Paris for a meeting called ‘Engineering the embryo’. The participants
shared an interest in exploring how synthetic systems can reveal new principles
of embryonic development, and how the in vitro manipulation and modeling of development
using stem cells can be used to integrate ideas and expertise from physics, developmental
biology and tissue engineering. As we review here, the conference pinpointed some
of the challenges arising at the intersection of these fields, along with great
enthusiasm for finding new approaches and collaborations.
author:
- first_name: Anna
full_name: Kicheva, Anna
id: 3959A2A0-F248-11E8-B48F-1D18A9856A87
last_name: Kicheva
orcid: 0000-0003-4509-4998
- first_name: Nicolas
full_name: Rivron, Nicolas
last_name: Rivron
citation:
ama: Kicheva A, Rivron N. Creating to understand – developmental biology meets engineering
in Paris. Development. 2017;144(5):733-736. doi:10.1242/dev.144915
apa: Kicheva, A., & Rivron, N. (2017). Creating to understand – developmental
biology meets engineering in Paris. Development. Company of Biologists.
https://doi.org/10.1242/dev.144915
chicago: Kicheva, Anna, and Nicolas Rivron. “Creating to Understand – Developmental
Biology Meets Engineering in Paris.” Development. Company of Biologists,
2017. https://doi.org/10.1242/dev.144915.
ieee: A. Kicheva and N. Rivron, “Creating to understand – developmental biology
meets engineering in Paris,” Development, vol. 144, no. 5. Company of Biologists,
pp. 733–736, 2017.
ista: Kicheva A, Rivron N. 2017. Creating to understand – developmental biology
meets engineering in Paris. Development. 144(5), 733–736.
mla: Kicheva, Anna, and Nicolas Rivron. “Creating to Understand – Developmental
Biology Meets Engineering in Paris.” Development, vol. 144, no. 5, Company
of Biologists, 2017, pp. 733–36, doi:10.1242/dev.144915.
short: A. Kicheva, N. Rivron, Development 144 (2017) 733–736.
date_created: 2018-12-11T11:47:44Z
date_published: 2017-03-01T00:00:00Z
date_updated: 2021-01-12T08:07:54Z
day: '01'
ddc:
- '571'
department:
- _id: AnKi
doi: 10.1242/dev.144915
ec_funded: 1
file:
- access_level: open_access
checksum: eef22a0f42a55b232cb2d1188a2322cb
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:20Z
date_updated: 2020-07-14T12:47:33Z
file_id: '5139'
file_name: IST-2018-987-v1+1_2017_KichevaRivron__Creating_to.pdf
file_size: 228206
relation: main_file
file_date_updated: 2020-07-14T12:47:33Z
has_accepted_license: '1'
intvolume: ' 144'
issue: '5'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Submitted Version
page: 733 - 736
project:
- _id: B6FC0238-B512-11E9-945C-1524E6697425
call_identifier: H2020
grant_number: '680037'
name: Coordination of Patterning And Growth In the Spinal Cord
publication: Development
publication_identifier:
issn:
- '09501991'
publication_status: published
publisher: Company of Biologists
publist_id: '7089'
pubrep_id: '987'
quality_controlled: '1'
scopus_import: 1
status: public
title: Creating to understand – developmental biology meets engineering in Paris
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 144
year: '2017'
...
---
_id: '6526'
abstract:
- lang: eng
text: 'This paper studies the complexity of estimating Rényi divergences of discrete
distributions: p observed from samples and the baseline distribution q known a
priori. Extending the results of Acharya et al. (SODA''15) on estimating Rényi
entropy, we present improved estimation techniques together with upper and lower
bounds on the sample complexity. We show that, contrarily to estimating Rényi
entropy where a sublinear (in the alphabet size) number of samples suffices, the
sample complexity is heavily dependent on events occurring unlikely in q, and
is unbounded in general (no matter what an estimation technique is used). For
any divergence of integer order bigger than 1, we provide upper and lower bounds
on the number of samples dependent on probabilities of p and q (the lower bounds
hold for non-integer orders as well). We conclude that the worst-case sample complexity
is polynomial in the alphabet size if and only if the probabilities of q are non-negligible.
This gives theoretical insights into heuristics used in the applied literature
to handle numerical instability, which occurs for small probabilities of q. Our
result shows that they should be handled with care not only because of numerical
issues, but also because of a blow up in the sample complexity.'
article_number: '8006529'
author:
- first_name: Maciej
full_name: Skórski, Maciej
id: EC09FA6A-02D0-11E9-8223-86B7C91467DD
last_name: Skórski
citation:
ama: 'Skórski M. On the complexity of estimating Rènyi divergences. In: 2017
IEEE International Symposium on Information Theory (ISIT). IEEE; 2017. doi:10.1109/isit.2017.8006529'
apa: 'Skórski, M. (2017). On the complexity of estimating Rènyi divergences. In
2017 IEEE International Symposium on Information Theory (ISIT). Aachen,
Germany: IEEE. https://doi.org/10.1109/isit.2017.8006529'
chicago: Skórski, Maciej. “On the Complexity of Estimating Rènyi Divergences.” In
2017 IEEE International Symposium on Information Theory (ISIT). IEEE, 2017.
https://doi.org/10.1109/isit.2017.8006529.
ieee: M. Skórski, “On the complexity of estimating Rènyi divergences,” in 2017
IEEE International Symposium on Information Theory (ISIT), Aachen, Germany,
2017.
ista: 'Skórski M. 2017. On the complexity of estimating Rènyi divergences. 2017
IEEE International Symposium on Information Theory (ISIT). ISIT: International
Symposium on Information Theory, 8006529.'
mla: Skórski, Maciej. “On the Complexity of Estimating Rènyi Divergences.” 2017
IEEE International Symposium on Information Theory (ISIT), 8006529, IEEE,
2017, doi:10.1109/isit.2017.8006529.
short: M. Skórski, in:, 2017 IEEE International Symposium on Information Theory
(ISIT), IEEE, 2017.
conference:
end_date: 2017-06-30
location: Aachen, Germany
name: 'ISIT: International Symposium on Information Theory'
start_date: 2017-06-25
date_created: 2019-06-06T12:53:09Z
date_published: 2017-08-09T00:00:00Z
date_updated: 2021-01-12T08:07:53Z
day: '09'
department:
- _id: KrPi
doi: 10.1109/isit.2017.8006529
ec_funded: 1
external_id:
arxiv:
- '1702.01666'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1702.01666
month: '08'
oa: 1
oa_version: Preprint
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: 2017 IEEE International Symposium on Information Theory (ISIT)
publication_identifier:
isbn:
- '9781509040964'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: 1
status: public
title: On the complexity of estimating Rènyi divergences
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '655'
abstract:
- lang: eng
text: 'The bacterial flagellum is a self-assembling nanomachine. The external flagellar
filament, several times longer than a bacterial cell body, is made of a few tens
of thousands subunits of a single protein: flagellin. A fundamental problem concerns
the molecular mechanism of how the flagellum grows outside the cell, where no
discernible energy source is available. Here, we monitored the dynamic assembly
of individual flagella using in situ labelling and real-time immunostaining of
elongating flagellar filaments. We report that the rate of flagellum growth, initially
~1,700 amino acids per second, decreases with length and that the previously proposed
chain mechanism does not contribute to the filament elongation dynamics. Inhibition
of the proton motive force-dependent export apparatus revealed a major contribution
of substrate injection in driving filament elongation. The combination of experimental
and mathematical evidence demonstrates that a simple, injection-diffusion mechanism
controls bacterial flagella growth outside the cell.'
article_number: e23136
author:
- first_name: Thibaud
full_name: Renault, Thibaud
last_name: Renault
- first_name: Anthony
full_name: Abraham, Anthony
last_name: Abraham
- first_name: Tobias
full_name: Bergmiller, Tobias
id: 2C471CFA-F248-11E8-B48F-1D18A9856A87
last_name: Bergmiller
orcid: 0000-0001-5396-4346
- first_name: Guillaume
full_name: Paradis, Guillaume
last_name: Paradis
- first_name: Simon
full_name: Rainville, Simon
last_name: Rainville
- first_name: Emmanuelle
full_name: Charpentier, Emmanuelle
last_name: Charpentier
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
- first_name: Yuhai
full_name: Tu, Yuhai
last_name: Tu
- first_name: Keiichi
full_name: Namba, Keiichi
last_name: Namba
- first_name: James
full_name: Keener, James
last_name: Keener
- first_name: Tohru
full_name: Minamino, Tohru
last_name: Minamino
- first_name: Marc
full_name: Erhardt, Marc
last_name: Erhardt
citation:
ama: Renault T, Abraham A, Bergmiller T, et al. Bacterial flagella grow through
an injection diffusion mechanism. eLife. 2017;6. doi:10.7554/eLife.23136
apa: Renault, T., Abraham, A., Bergmiller, T., Paradis, G., Rainville, S., Charpentier,
E., … Erhardt, M. (2017). Bacterial flagella grow through an injection diffusion
mechanism. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.23136
chicago: Renault, Thibaud, Anthony Abraham, Tobias Bergmiller, Guillaume Paradis,
Simon Rainville, Emmanuelle Charpentier, Calin C Guet, et al. “Bacterial Flagella
Grow through an Injection Diffusion Mechanism.” ELife. eLife Sciences Publications,
2017. https://doi.org/10.7554/eLife.23136.
ieee: T. Renault et al., “Bacterial flagella grow through an injection diffusion
mechanism,” eLife, vol. 6. eLife Sciences Publications, 2017.
ista: Renault T, Abraham A, Bergmiller T, Paradis G, Rainville S, Charpentier E,
Guet CC, Tu Y, Namba K, Keener J, Minamino T, Erhardt M. 2017. Bacterial flagella
grow through an injection diffusion mechanism. eLife. 6, e23136.
mla: Renault, Thibaud, et al. “Bacterial Flagella Grow through an Injection Diffusion
Mechanism.” ELife, vol. 6, e23136, eLife Sciences Publications, 2017, doi:10.7554/eLife.23136.
short: T. Renault, A. Abraham, T. Bergmiller, G. Paradis, S. Rainville, E. Charpentier,
C.C. Guet, Y. Tu, K. Namba, J. Keener, T. Minamino, M. Erhardt, ELife 6 (2017).
date_created: 2018-12-11T11:47:44Z
date_published: 2017-03-06T00:00:00Z
date_updated: 2021-01-12T08:07:55Z
day: '06'
ddc:
- '579'
department:
- _id: CaGu
doi: 10.7554/eLife.23136
file:
- access_level: open_access
checksum: 39e1c3e82ddac83a30422fa72fa1a383
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:53Z
date_updated: 2020-07-14T12:47:33Z
file_id: '4716'
file_name: IST-2017-904-v1+1_elife-23136-v2.pdf
file_size: 5520359
relation: main_file
- access_level: open_access
checksum: a6d542253028f52e00aa29739ddffe8f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:54Z
date_updated: 2020-07-14T12:47:33Z
file_id: '4717'
file_name: IST-2017-904-v1+2_elife-23136-figures-v2.pdf
file_size: 11242920
relation: main_file
file_date_updated: 2020-07-14T12:47:33Z
has_accepted_license: '1'
intvolume: ' 6'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
publication: eLife
publication_identifier:
issn:
- 2050084X
publication_status: published
publisher: eLife Sciences Publications
publist_id: '7082'
pubrep_id: '904'
quality_controlled: '1'
scopus_import: 1
status: public
title: Bacterial flagella grow through an injection diffusion mechanism
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: 6
year: '2017'
...
---
_id: '657'
abstract:
- lang: eng
text: Plant organs are typically organized into three main tissue layers. The middle
ground tissue layer comprises the majority of the plant body and serves a wide
range of functions, including photosynthesis, selective nutrient uptake and storage,
and gravity sensing. Ground tissue patterning and maintenance in Arabidopsis are
controlled by a well-established gene network revolving around the key regulator
SHORT-ROOT (SHR). In contrast, it is completely unknown how ground tissue identity
is first specified from totipotent precursor cells in the embryo. The plant signaling
molecule auxin, acting through AUXIN RESPONSE FACTOR (ARF) transcription factors,
is critical for embryo patterning. The auxin effector ARF5/MONOPTEROS (MP) acts
both cell-autonomously and noncell-autonomously to control embryonic vascular
tissue formation and root initiation, respectively. Here we show that auxin response
and ARF activity cell-autonomously control the asymmetric division of the first
ground tissue cells. By identifying embryonic target genes, we show that MP transcriptionally
initiates the ground tissue lineage and acts upstream of the regulatory network
that controls ground tissue patterning and maintenance. Strikingly, whereas the
SHR network depends on MP, this MP function is, at least in part, SHR independent.
Our study therefore identifies auxin response as a regulator of ground tissue
specification in the embryonic root, and reveals that ground tissue initiation
and maintenance use different regulators and mechanisms. Moreover, our data provide
a framework for the simultaneous formation of multiple cell types by the same
transcriptional regulator.
author:
- first_name: Barbara
full_name: Möller, Barbara
last_name: Möller
- first_name: Colette
full_name: Ten Hove, Colette
last_name: Ten Hove
- first_name: Daoquan
full_name: Xiang, Daoquan
last_name: Xiang
- first_name: Nerys
full_name: Williams, Nerys
last_name: Williams
- first_name: Lorena
full_name: López, Lorena
last_name: López
- first_name: Saiko
full_name: Yoshida, Saiko
id: 2E46069C-F248-11E8-B48F-1D18A9856A87
last_name: Yoshida
- first_name: Margot
full_name: Smit, Margot
last_name: Smit
- first_name: Raju
full_name: Datla, Raju
last_name: Datla
- first_name: Dolf
full_name: Weijers, Dolf
last_name: Weijers
citation:
ama: Möller B, Ten Hove C, Xiang D, et al. Auxin response cell autonomously controls
ground tissue initiation in the early arabidopsis embryo. PNAS. 2017;114(12):E2533-E2539.
doi:10.1073/pnas.1616493114
apa: Möller, B., Ten Hove, C., Xiang, D., Williams, N., López, L., Yoshida, S.,
… Weijers, D. (2017). Auxin response cell autonomously controls ground tissue
initiation in the early arabidopsis embryo. PNAS. National Academy of Sciences.
https://doi.org/10.1073/pnas.1616493114
chicago: Möller, Barbara, Colette Ten Hove, Daoquan Xiang, Nerys Williams, Lorena
López, Saiko Yoshida, Margot Smit, Raju Datla, and Dolf Weijers. “Auxin Response
Cell Autonomously Controls Ground Tissue Initiation in the Early Arabidopsis Embryo.”
PNAS. National Academy of Sciences, 2017. https://doi.org/10.1073/pnas.1616493114.
ieee: B. Möller et al., “Auxin response cell autonomously controls ground
tissue initiation in the early arabidopsis embryo,” PNAS, vol. 114, no.
12. National Academy of Sciences, pp. E2533–E2539, 2017.
ista: Möller B, Ten Hove C, Xiang D, Williams N, López L, Yoshida S, Smit M, Datla
R, Weijers D. 2017. Auxin response cell autonomously controls ground tissue initiation
in the early arabidopsis embryo. PNAS. 114(12), E2533–E2539.
mla: Möller, Barbara, et al. “Auxin Response Cell Autonomously Controls Ground Tissue
Initiation in the Early Arabidopsis Embryo.” PNAS, vol. 114, no. 12, National
Academy of Sciences, 2017, pp. E2533–39, doi:10.1073/pnas.1616493114.
short: B. Möller, C. Ten Hove, D. Xiang, N. Williams, L. López, S. Yoshida, M. Smit,
R. Datla, D. Weijers, PNAS 114 (2017) E2533–E2539.
date_created: 2018-12-11T11:47:45Z
date_published: 2017-03-21T00:00:00Z
date_updated: 2021-01-12T08:08:02Z
day: '21'
department:
- _id: JiFr
doi: 10.1073/pnas.1616493114
external_id:
pmid:
- '28265057'
intvolume: ' 114'
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5373392/
month: '03'
oa: 1
oa_version: Submitted Version
page: E2533 - E2539
pmid: 1
publication: PNAS
publication_identifier:
issn:
- '00278424'
publication_status: published
publisher: National Academy of Sciences
publist_id: '7076'
quality_controlled: '1'
scopus_import: 1
status: public
title: Auxin response cell autonomously controls ground tissue initiation in the early
arabidopsis embryo
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 114
year: '2017'
...
---
_id: '658'
abstract:
- lang: eng
text: 'With the accelerated development of robot technologies, control becomes one
of the central themes of research. In traditional approaches, the controller,
by its internal functionality, finds appropriate actions on the basis of specific
objectives for the task at hand. While very successful in many applications, self-organized
control schemes seem to be favored in large complex systems with unknown dynamics
or which are difficult to model. Reasons are the expected scalability, robustness,
and resilience of self-organizing systems. The paper presents a self-learning
neurocontroller based on extrinsic differential plasticity introduced recently,
applying it to an anthropomorphic musculoskeletal robot arm with attached objects
of unknown physical dynamics. The central finding of the paper is the following
effect: by the mere feedback through the internal dynamics of the object, the
robot is learning to relate each of the objects with a very specific sensorimotor
pattern. Specifically, an attached pendulum pilots the arm into a circular motion,
a half-filled bottle produces axis oriented shaking behavior, a wheel is getting
rotated, and wiping patterns emerge automatically in a table-plus-brush setting.
By these object-specific dynamical patterns, the robot may be said to recognize
the object''s identity, or in other words, it discovers dynamical affordances
of objects. Furthermore, when including hand coordinates obtained from a camera,
a dedicated hand-eye coordination self-organizes spontaneously. These phenomena
are discussed from a specific dynamical system perspective. Central is the dedicated
working regime at the border to instability with its potentially infinite reservoir
of (limit cycle) attractors "waiting" to be excited. Besides converging
toward one of these attractors, variate behavior is also arising from a self-induced
attractor morphing driven by the learning rule. We claim that experimental investigations
with this anthropomorphic, self-learning robot not only generate interesting and
potentially useful behaviors, but may also help to better understand what subjective
human muscle feelings are, how they can be rooted in sensorimotor patterns, and
how these concepts may feed back on robotics.'
article_number: '00008'
article_processing_charge: Yes
author:
- first_name: Ralf
full_name: Der, Ralf
last_name: Der
- first_name: Georg S
full_name: Martius, Georg S
id: 3A276B68-F248-11E8-B48F-1D18A9856A87
last_name: Martius
citation:
ama: Der R, Martius GS. Self organized behavior generation for musculoskeletal robots.
Frontiers in Neurorobotics. 2017;11(MAR). doi:10.3389/fnbot.2017.00008
apa: Der, R., & Martius, G. S. (2017). Self organized behavior generation for
musculoskeletal robots. Frontiers in Neurorobotics. Frontiers Research
Foundation. https://doi.org/10.3389/fnbot.2017.00008
chicago: Der, Ralf, and Georg S Martius. “Self Organized Behavior Generation for
Musculoskeletal Robots.” Frontiers in Neurorobotics. Frontiers Research
Foundation, 2017. https://doi.org/10.3389/fnbot.2017.00008.
ieee: R. Der and G. S. Martius, “Self organized behavior generation for musculoskeletal
robots,” Frontiers in Neurorobotics, vol. 11, no. MAR. Frontiers Research
Foundation, 2017.
ista: Der R, Martius GS. 2017. Self organized behavior generation for musculoskeletal
robots. Frontiers in Neurorobotics. 11(MAR), 00008.
mla: Der, Ralf, and Georg S. Martius. “Self Organized Behavior Generation for Musculoskeletal
Robots.” Frontiers in Neurorobotics, vol. 11, no. MAR, 00008, Frontiers
Research Foundation, 2017, doi:10.3389/fnbot.2017.00008.
short: R. Der, G.S. Martius, Frontiers in Neurorobotics 11 (2017).
date_created: 2018-12-11T11:47:45Z
date_published: 2017-03-16T00:00:00Z
date_updated: 2021-01-12T08:08:04Z
day: '16'
ddc:
- '006'
department:
- _id: ChLa
- _id: GaTk
doi: 10.3389/fnbot.2017.00008
ec_funded: 1
file:
- access_level: open_access
checksum: b1bc43f96d1df3313c03032c2a46388d
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:49Z
date_updated: 2020-07-14T12:47:33Z
file_id: '5371'
file_name: IST-2017-903-v1+1_fnbot-11-00008.pdf
file_size: 8439566
relation: main_file
file_date_updated: 2020-07-14T12:47:33Z
has_accepted_license: '1'
intvolume: ' 11'
issue: MAR
language:
- iso: eng
month: '03'
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
publication: Frontiers in Neurorobotics
publication_identifier:
issn:
- '16625218'
publication_status: published
publisher: Frontiers Research Foundation
publist_id: '7078'
pubrep_id: '903'
quality_controlled: '1'
scopus_import: 1
status: public
title: Self organized behavior generation for musculoskeletal robots
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: 2EBD1598-F248-11E8-B48F-1D18A9856A87
volume: 11
year: '2017'
...
---
_id: '659'
abstract:
- lang: eng
text: Migration frequently involves Rac-mediated protrusion of lamellipodia, formed
by Arp2/3 complex-dependent branching thought to be crucial for force generation
and stability of these networks. The formins FMNL2 and FMNL3 are Cdc42 effectors
targeting to the lamellipodium tip and shown here to nucleate and elongate actin
filaments with complementary activities in vitro. In migrating B16-F1 melanoma
cells, both formins contribute to the velocity of lamellipodium protrusion. Loss
of FMNL2/3 function in melanoma cells and fibroblasts reduces lamellipodial width,
actin filament density and -bundling, without changing patterns of Arp2/3 complex
incorporation. Strikingly, in melanoma cells, FMNL2/3 gene inactivation almost
completely abolishes protrusion forces exerted by lamellipodia and modifies their
ultrastructural organization. Consistently, CRISPR/Cas-mediated depletion of FMNL2/3
in fibroblasts reduces both migration and capability of cells to move against
viscous media. Together, we conclude that force generation in lamellipodia strongly
depends on FMNL formin activity, operating in addition to Arp2/3 complex-dependent
filament branching.
article_number: '14832'
article_processing_charge: No
author:
- first_name: Frieda
full_name: Kage, Frieda
last_name: Kage
- first_name: Moritz
full_name: Winterhoff, Moritz
last_name: Winterhoff
- first_name: Vanessa
full_name: Dimchev, Vanessa
last_name: Dimchev
- first_name: Jan
full_name: Müller, Jan
id: AD07FDB4-0F61-11EA-8158-C4CC64CEAA8D
last_name: Müller
- first_name: Tobias
full_name: Thalheim, Tobias
last_name: Thalheim
- first_name: Anika
full_name: Freise, Anika
last_name: Freise
- first_name: Stefan
full_name: Brühmann, Stefan
last_name: Brühmann
- first_name: Jana
full_name: Kollasser, Jana
last_name: Kollasser
- first_name: Jennifer
full_name: Block, Jennifer
last_name: Block
- first_name: Georgi A
full_name: Dimchev, Georgi A
last_name: Dimchev
- first_name: Matthias
full_name: Geyer, Matthias
last_name: Geyer
- first_name: Hams
full_name: Schnittler, Hams
last_name: Schnittler
- first_name: Cord
full_name: Brakebusch, Cord
last_name: Brakebusch
- first_name: Theresia
full_name: Stradal, Theresia
last_name: Stradal
- first_name: Marie
full_name: Carlier, Marie
last_name: Carlier
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
- first_name: Josef
full_name: Käs, Josef
last_name: Käs
- first_name: Jan
full_name: Faix, Jan
last_name: Faix
- first_name: Klemens
full_name: Rottner, Klemens
last_name: Rottner
citation:
ama: Kage F, Winterhoff M, Dimchev V, et al. FMNL formins boost lamellipodial force
generation. Nature Communications. 2017;8. doi:10.1038/ncomms14832
apa: Kage, F., Winterhoff, M., Dimchev, V., Müller, J., Thalheim, T., Freise, A.,
… Rottner, K. (2017). FMNL formins boost lamellipodial force generation. Nature
Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms14832
chicago: Kage, Frieda, Moritz Winterhoff, Vanessa Dimchev, Jan Müller, Tobias Thalheim,
Anika Freise, Stefan Brühmann, et al. “FMNL Formins Boost Lamellipodial Force
Generation.” Nature Communications. Nature Publishing Group, 2017. https://doi.org/10.1038/ncomms14832.
ieee: F. Kage et al., “FMNL formins boost lamellipodial force generation,”
Nature Communications, vol. 8. Nature Publishing Group, 2017.
ista: Kage F, Winterhoff M, Dimchev V, Müller J, Thalheim T, Freise A, Brühmann
S, Kollasser J, Block J, Dimchev GA, Geyer M, Schnittler H, Brakebusch C, Stradal
T, Carlier M, Sixt MK, Käs J, Faix J, Rottner K. 2017. FMNL formins boost lamellipodial
force generation. Nature Communications. 8, 14832.
mla: Kage, Frieda, et al. “FMNL Formins Boost Lamellipodial Force Generation.” Nature
Communications, vol. 8, 14832, Nature Publishing Group, 2017, doi:10.1038/ncomms14832.
short: F. Kage, M. Winterhoff, V. Dimchev, J. Müller, T. Thalheim, A. Freise, S.
Brühmann, J. Kollasser, J. Block, G.A. Dimchev, M. Geyer, H. Schnittler, C. Brakebusch,
T. Stradal, M. Carlier, M.K. Sixt, J. Käs, J. Faix, K. Rottner, Nature Communications
8 (2017).
date_created: 2018-12-11T11:47:46Z
date_published: 2017-03-22T00:00:00Z
date_updated: 2021-01-12T08:08:06Z
day: '22'
ddc:
- '570'
department:
- _id: MiSi
doi: 10.1038/ncomms14832
file:
- access_level: open_access
checksum: dae30190291c3630e8102d8714a8d23e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:21Z
date_updated: 2020-07-14T12:47:34Z
file_id: '5072'
file_name: IST-2017-902-v1+1_Kage_et_al-2017-Nature_Communications.pdf
file_size: 9523746
relation: main_file
file_date_updated: 2020-07-14T12:47:34Z
has_accepted_license: '1'
intvolume: ' 8'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
publication: Nature Communications
publication_identifier:
issn:
- '20411723'
publication_status: published
publisher: Nature Publishing Group
publist_id: '7075'
pubrep_id: '902'
quality_controlled: '1'
scopus_import: 1
status: public
title: FMNL formins boost lamellipodial force generation
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2017'
...
---
_id: '660'
abstract:
- lang: eng
text: Growing microtubules are protected from depolymerization by the presence of
a GTP or GDP/Pi cap. End-binding proteins of the EB1 family bind to the stabilizing
cap, allowing monitoring of its size in real time. The cap size has been shown
to correlate with instantaneous microtubule stability. Here we have quantitatively
characterized the properties of cap size fluctuations during steadystate growth
and have developed a theory predicting their timescale and amplitude from the
kinetics of microtubule growth and cap maturation. In contrast to growth speed
fluctuations, cap size fluctuations show a characteristic timescale, which is
defined by the lifetime of the cap sites. Growth fluctuations affect the amplitude
of cap size fluctuations; however, cap size does not affect growth speed, indicating
that microtubules are far from instability during most of their time of growth.
Our theory provides the basis for a quantitative understanding of microtubule
stability fluctuations during steady-state growth.
acknowledgement: We thank Philippe Cluzel for helpful discussions and Gunnar Pruessner
for data analysis advice. This work was supported by the Francis Crick Institute,
which receives its core funding from Cancer Research UK Grant FC001163, Medical
Research Council Grant FC001163, and Wellcome Trust Grant FC001163. This work was
also supported by European Research Council Advanced Grant Project 323042 (to C.D.
and T.S.).
author:
- first_name: Jamie
full_name: Rickman, Jamie
last_name: Rickman
- first_name: Christian F
full_name: Düllberg, Christian F
id: 459064DC-F248-11E8-B48F-1D18A9856A87
last_name: Düllberg
orcid: 0000-0001-6335-9748
- first_name: Nicholas
full_name: Cade, Nicholas
last_name: Cade
- first_name: Lewis
full_name: Griffin, Lewis
last_name: Griffin
- first_name: Thomas
full_name: Surrey, Thomas
last_name: Surrey
citation:
ama: Rickman J, Düllberg CF, Cade N, Griffin L, Surrey T. Steady state EB cap size
fluctuations are determined by stochastic microtubule growth and maturation. PNAS.
2017;114(13):3427-3432. doi:10.1073/pnas.1620274114
apa: Rickman, J., Düllberg, C. F., Cade, N., Griffin, L., & Surrey, T. (2017).
Steady state EB cap size fluctuations are determined by stochastic microtubule
growth and maturation. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1620274114
chicago: Rickman, Jamie, Christian F Düllberg, Nicholas Cade, Lewis Griffin, and
Thomas Surrey. “Steady State EB Cap Size Fluctuations Are Determined by Stochastic
Microtubule Growth and Maturation.” PNAS. National Academy of Sciences,
2017. https://doi.org/10.1073/pnas.1620274114.
ieee: J. Rickman, C. F. Düllberg, N. Cade, L. Griffin, and T. Surrey, “Steady state
EB cap size fluctuations are determined by stochastic microtubule growth and maturation,”
PNAS, vol. 114, no. 13. National Academy of Sciences, pp. 3427–3432, 2017.
ista: Rickman J, Düllberg CF, Cade N, Griffin L, Surrey T. 2017. Steady state EB
cap size fluctuations are determined by stochastic microtubule growth and maturation.
PNAS. 114(13), 3427–3432.
mla: Rickman, Jamie, et al. “Steady State EB Cap Size Fluctuations Are Determined
by Stochastic Microtubule Growth and Maturation.” PNAS, vol. 114, no. 13,
National Academy of Sciences, 2017, pp. 3427–32, doi:10.1073/pnas.1620274114.
short: J. Rickman, C.F. Düllberg, N. Cade, L. Griffin, T. Surrey, PNAS 114 (2017)
3427–3432.
date_created: 2018-12-11T11:47:46Z
date_published: 2017-03-28T00:00:00Z
date_updated: 2021-01-12T08:08:09Z
day: '28'
department:
- _id: MaLo
doi: 10.1073/pnas.1620274114
external_id:
pmid:
- '28280102'
intvolume: ' 114'
issue: '13'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5380103/
month: '03'
oa: 1
oa_version: Submitted Version
page: 3427 - 3432
pmid: 1
publication: PNAS
publication_identifier:
issn:
- '00278424'
publication_status: published
publisher: National Academy of Sciences
publist_id: '7073'
quality_controlled: '1'
scopus_import: 1
status: public
title: Steady state EB cap size fluctuations are determined by stochastic microtubule
growth and maturation
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 114
year: '2017'
...
---
_id: '662'
abstract:
- lang: eng
text: 'We report a direct-numerical-simulation study of the Taylor-Couette flow
in the quasi-Keplerian regime at shear Reynolds numbers up to (105). Quasi-Keplerian
rotating flow has been investigated for decades as a simplified model system to
study the origin of turbulence in accretion disks that is not fully understood.
The flow in this study is axially periodic and thus the experimental end-wall
effects on the stability of the flow are avoided. Using optimal linear perturbations
as initial conditions, our simulations find no sustained turbulence: the strong
initial perturbations distort the velocity profile and trigger turbulence that
eventually decays.'
article_number: '044107'
author:
- first_name: Liang
full_name: Shi, Liang
last_name: Shi
- first_name: Björn
full_name: Hof, Björn
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
- first_name: Markus
full_name: Rampp, Markus
last_name: Rampp
- first_name: Marc
full_name: Avila, Marc
last_name: Avila
citation:
ama: Shi L, Hof B, Rampp M, Avila M. Hydrodynamic turbulence in quasi Keplerian
rotating flows. Physics of Fluids. 2017;29(4). doi:10.1063/1.4981525
apa: Shi, L., Hof, B., Rampp, M., & Avila, M. (2017). Hydrodynamic turbulence
in quasi Keplerian rotating flows. Physics of Fluids. American Institute
of Physics. https://doi.org/10.1063/1.4981525
chicago: Shi, Liang, Björn Hof, Markus Rampp, and Marc Avila. “Hydrodynamic Turbulence
in Quasi Keplerian Rotating Flows.” Physics of Fluids. American Institute
of Physics, 2017. https://doi.org/10.1063/1.4981525.
ieee: L. Shi, B. Hof, M. Rampp, and M. Avila, “Hydrodynamic turbulence in quasi
Keplerian rotating flows,” Physics of Fluids, vol. 29, no. 4. American
Institute of Physics, 2017.
ista: Shi L, Hof B, Rampp M, Avila M. 2017. Hydrodynamic turbulence in quasi Keplerian
rotating flows. Physics of Fluids. 29(4), 044107.
mla: Shi, Liang, et al. “Hydrodynamic Turbulence in Quasi Keplerian Rotating Flows.”
Physics of Fluids, vol. 29, no. 4, 044107, American Institute of Physics,
2017, doi:10.1063/1.4981525.
short: L. Shi, B. Hof, M. Rampp, M. Avila, Physics of Fluids 29 (2017).
date_created: 2018-12-11T11:47:47Z
date_published: 2017-04-01T00:00:00Z
date_updated: 2021-01-12T08:08:15Z
day: '01'
department:
- _id: BjHo
doi: 10.1063/1.4981525
intvolume: ' 29'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1703.01714
month: '04'
oa: 1
oa_version: Submitted Version
project:
- _id: 2511D90C-B435-11E9-9278-68D0E5697425
grant_number: SFB 963 TP A8
name: Astrophysical instability of currents and turbulences
publication: Physics of Fluids
publication_identifier:
issn:
- '10706631'
publication_status: published
publisher: American Institute of Physics
publist_id: '7072'
quality_controlled: '1'
scopus_import: 1
status: public
title: Hydrodynamic turbulence in quasi Keplerian rotating flows
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 29
year: '2017'
...
---
_id: '663'
abstract:
- lang: eng
text: 'In this paper, we propose an approach to automatically compute invariant
clusters for nonlinear semialgebraic hybrid systems. An invariant cluster for
an ordinary differential equation (ODE) is a multivariate polynomial invariant
g(u→, x→) = 0, parametric in u→, which can yield an infinite number of concrete
invariants by assigning different values to u→ so that every trajectory of the
system can be overapproximated precisely by the intersection of a group of concrete
invariants. For semialgebraic systems, which involve ODEs with multivariate polynomial
right-hand sides, given a template multivariate polynomial g(u→, x→), an invariant
cluster can be obtained by first computing the remainder of the Lie derivative
of g(u→, x→) divided by g(u→, x→) and then solving the system of polynomial equations
obtained from the coefficients of the remainder. Based on invariant clusters and
sum-of-squares (SOS) programming, we present a new method for the safety verification
of hybrid systems. Experiments on nonlinear benchmark systems from biology and
control theory show that our approach is efficient. '
author:
- first_name: Hui
full_name: Kong, Hui
id: 3BDE25AA-F248-11E8-B48F-1D18A9856A87
last_name: Kong
orcid: 0000-0002-3066-6941
- first_name: Sergiy
full_name: Bogomolov, Sergiy
last_name: Bogomolov
orcid: 0000-0002-0686-0365
- first_name: Christian
full_name: Schilling, Christian
last_name: Schilling
- first_name: Yu
full_name: Jiang, Yu
last_name: Jiang
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Kong H, Bogomolov S, Schilling C, Jiang Y, Henzinger TA. Safety verification
of nonlinear hybrid systems based on invariant clusters. In: Proceedings of
the 20th International Conference on Hybrid Systems. ACM; 2017:163-172. doi:10.1145/3049797.3049814'
apa: 'Kong, H., Bogomolov, S., Schilling, C., Jiang, Y., & Henzinger, T. A.
(2017). Safety verification of nonlinear hybrid systems based on invariant clusters.
In Proceedings of the 20th International Conference on Hybrid Systems (pp.
163–172). Pittsburgh, PA, United States: ACM. https://doi.org/10.1145/3049797.3049814'
chicago: Kong, Hui, Sergiy Bogomolov, Christian Schilling, Yu Jiang, and Thomas
A Henzinger. “Safety Verification of Nonlinear Hybrid Systems Based on Invariant
Clusters.” In Proceedings of the 20th International Conference on Hybrid Systems,
163–72. ACM, 2017. https://doi.org/10.1145/3049797.3049814.
ieee: H. Kong, S. Bogomolov, C. Schilling, Y. Jiang, and T. A. Henzinger, “Safety
verification of nonlinear hybrid systems based on invariant clusters,” in Proceedings
of the 20th International Conference on Hybrid Systems, Pittsburgh, PA, United
States, 2017, pp. 163–172.
ista: 'Kong H, Bogomolov S, Schilling C, Jiang Y, Henzinger TA. 2017. Safety verification
of nonlinear hybrid systems based on invariant clusters. Proceedings of the 20th
International Conference on Hybrid Systems. HSCC: Hybrid Systems Computation and
Control , 163–172.'
mla: Kong, Hui, et al. “Safety Verification of Nonlinear Hybrid Systems Based on
Invariant Clusters.” Proceedings of the 20th International Conference on Hybrid
Systems, ACM, 2017, pp. 163–72, doi:10.1145/3049797.3049814.
short: H. Kong, S. Bogomolov, C. Schilling, Y. Jiang, T.A. Henzinger, in:, Proceedings
of the 20th International Conference on Hybrid Systems, ACM, 2017, pp. 163–172.
conference:
end_date: 2017-04-20
location: Pittsburgh, PA, United States
name: 'HSCC: Hybrid Systems Computation and Control '
start_date: 2017-04-18
date_created: 2018-12-11T11:47:47Z
date_published: 2017-04-01T00:00:00Z
date_updated: 2021-01-12T08:08:17Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1145/3049797.3049814
file:
- access_level: open_access
checksum: b7667434cbf5b5f0ade3bea1dbe5bf63
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:20Z
date_updated: 2020-07-14T12:47:34Z
file_id: '4873'
file_name: IST-2017-817-v1+1_p163-kong.pdf
file_size: 1650530
relation: main_file
file_date_updated: 2020-07-14T12:47:34Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Submitted Version
page: 163 - 172
publication: Proceedings of the 20th International Conference on Hybrid Systems
publication_identifier:
isbn:
- 978-145034590-3
publication_status: published
publisher: ACM
publist_id: '7067'
pubrep_id: '817'
quality_controlled: '1'
scopus_import: 1
status: public
title: Safety verification of nonlinear hybrid systems based on invariant clusters
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '668'
abstract:
- lang: eng
text: Macrophage filopodia, finger-like membrane protrusions, were first implicated
in phagocytosis more than 100 years ago, but little is still known about the involvement
of these actin-dependent structures in particle clearance. Using spinning disk
confocal microscopy to image filopodial dynamics in mouse resident Lifeact-EGFP
macrophages, we show that filopodia, or filopodia-like structures, support pathogen
clearance by multiple means. Filopodia supported the phagocytic uptake of bacterial
(Escherichia coli) particles by (i) capturing along the filopodial shaft and surfing
toward the cell body, the most common mode of capture; (ii) capturing via the
tip followed by retraction; (iii) combinations of surfing and retraction; or (iv)
sweeping actions. In addition, filopodia supported the uptake of zymosan (Saccharomyces
cerevisiae) particles by (i) providing fixation, (ii) capturing at the tip and
filopodia-guided actin anterograde flow with phagocytic cup formation, and (iii)
the rapid growth of new protrusions. To explore the role of filopodia-inducing
Cdc42, we generated myeloid-restricted Cdc42 knock-out mice. Cdc42-deficient macrophages
exhibited rapid phagocytic cup kinetics, but reduced particle clearance, which
could be explained by the marked rounded-up morphology of these cells. Macrophages
lacking Myo10, thought to act downstream of Cdc42, had normal morphology, motility,
and phagocytic cup formation, but displayed markedly reduced filopodia formation.
In conclusion, live-cell imaging revealed multiple mechanisms involving macrophage
filopodia in particle capture and engulfment. Cdc42 is not critical for filopodia
or phagocytic cup formation, but plays a key role in driving macrophage lamellipodial
spreading.
article_type: original
author:
- first_name: Markus
full_name: Horsthemke, Markus
last_name: Horsthemke
- first_name: Anne
full_name: Bachg, Anne
last_name: Bachg
- first_name: Katharina
full_name: Groll, Katharina
last_name: Groll
- first_name: Sven
full_name: Moyzio, Sven
last_name: Moyzio
- first_name: Barbara
full_name: Müther, Barbara
last_name: Müther
- first_name: Sandra
full_name: Hemkemeyer, Sandra
last_name: Hemkemeyer
- first_name: Roland
full_name: Wedlich Söldner, Roland
last_name: Wedlich Söldner
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
- first_name: Sebastian
full_name: Tacke, Sebastian
last_name: Tacke
- first_name: Martin
full_name: Bähler, Martin
last_name: Bähler
- first_name: Peter
full_name: Hanley, Peter
last_name: Hanley
citation:
ama: Horsthemke M, Bachg A, Groll K, et al. Multiple roles of filopodial dynamics
in particle capture and phagocytosis and phenotypes of Cdc42 and Myo10 deletion.
Journal of Biological Chemistry. 2017;292(17):7258-7273. doi:10.1074/jbc.M116.766923
apa: Horsthemke, M., Bachg, A., Groll, K., Moyzio, S., Müther, B., Hemkemeyer, S.,
… Hanley, P. (2017). Multiple roles of filopodial dynamics in particle capture
and phagocytosis and phenotypes of Cdc42 and Myo10 deletion. Journal of Biological
Chemistry. American Society for Biochemistry and Molecular Biology. https://doi.org/10.1074/jbc.M116.766923
chicago: Horsthemke, Markus, Anne Bachg, Katharina Groll, Sven Moyzio, Barbara Müther,
Sandra Hemkemeyer, Roland Wedlich Söldner, et al. “Multiple Roles of Filopodial
Dynamics in Particle Capture and Phagocytosis and Phenotypes of Cdc42 and Myo10
Deletion.” Journal of Biological Chemistry. American Society for Biochemistry
and Molecular Biology, 2017. https://doi.org/10.1074/jbc.M116.766923.
ieee: M. Horsthemke et al., “Multiple roles of filopodial dynamics in particle
capture and phagocytosis and phenotypes of Cdc42 and Myo10 deletion,” Journal
of Biological Chemistry, vol. 292, no. 17. American Society for Biochemistry
and Molecular Biology, pp. 7258–7273, 2017.
ista: Horsthemke M, Bachg A, Groll K, Moyzio S, Müther B, Hemkemeyer S, Wedlich
Söldner R, Sixt MK, Tacke S, Bähler M, Hanley P. 2017. Multiple roles of filopodial
dynamics in particle capture and phagocytosis and phenotypes of Cdc42 and Myo10
deletion. Journal of Biological Chemistry. 292(17), 7258–7273.
mla: Horsthemke, Markus, et al. “Multiple Roles of Filopodial Dynamics in Particle
Capture and Phagocytosis and Phenotypes of Cdc42 and Myo10 Deletion.” Journal
of Biological Chemistry, vol. 292, no. 17, American Society for Biochemistry
and Molecular Biology, 2017, pp. 7258–73, doi:10.1074/jbc.M116.766923.
short: M. Horsthemke, A. Bachg, K. Groll, S. Moyzio, B. Müther, S. Hemkemeyer, R.
Wedlich Söldner, M.K. Sixt, S. Tacke, M. Bähler, P. Hanley, Journal of Biological
Chemistry 292 (2017) 7258–7273.
date_created: 2018-12-11T11:47:49Z
date_published: 2017-04-28T00:00:00Z
date_updated: 2021-01-12T08:08:34Z
day: '28'
ddc:
- '570'
department:
- _id: MiSi
doi: 10.1074/jbc.M116.766923
file:
- access_level: open_access
checksum: d488162874326a4bb056065fa549dc4a
content_type: application/pdf
creator: dernst
date_created: 2019-10-24T15:25:42Z
date_updated: 2020-07-14T12:47:37Z
file_id: '6971'
file_name: 2017_JBC_Horsthemke.pdf
file_size: 5647880
relation: main_file
file_date_updated: 2020-07-14T12:47:37Z
has_accepted_license: '1'
intvolume: ' 292'
issue: '17'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 7258 - 7273
publication: Journal of Biological Chemistry
publication_identifier:
issn:
- '00219258'
publication_status: published
publisher: American Society for Biochemistry and Molecular Biology
publist_id: '7059'
quality_controlled: '1'
scopus_import: 1
status: public
title: Multiple roles of filopodial dynamics in particle capture and phagocytosis
and phenotypes of Cdc42 and Myo10 deletion
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 292
year: '2017'
...
---
_id: '669'
abstract:
- lang: eng
text: 'The exocyst, a eukaryotic tethering complex, coregulates targeted exocytosis
as an effector of small GTPases in polarized cell growth. In land plants, several
exocyst subunits are encoded by double or triple paralogs, culminating in tens
of EXO70 paralogs. Out of 23 Arabidopsis thaliana EXO70 isoforms, we analyzed
seven isoforms expressed in pollen. Genetic and microscopic analyses of single
mutants in EXO70A2, EXO70C1, EXO70C2, EXO70F1, EXO70H3, EXO70H5, and EXO70H6 genes
revealed that only a loss-of-function EXO70C2 allele resulted in a significant
male-specific transmission defect (segregation 40%:51%:9%) due to aberrant pollen
tube growth. Mutant pollen tubes grown in vitro exhibited an enhanced growth rate
and a decreased thickness of the tip cell wall, causing tip bursts. However, exo70C2
pollen tubes could frequently recover and restart their speedy elongation, resulting
in a repetitive stop-and-go growth dynamics. A pollenspecific depletion of the
closest paralog, EXO70C1, using artificial microRNA in the exo70C2 mutant background,
resulted in a complete pollen-specific transmission defect, suggesting redundant
functions of EXO70C1 and EXO70C2. Both EXO70C1 and EXO70C2, GFP tagged and expressed
under the control of their native promoters, localized in the cytoplasm of pollen
grains, pollen tubes, and also root trichoblast cells. The expression of EXO70C2-GFP
complemented the aberrant growth of exo70C2 pollen tubes. The absent EXO70C2 interactions
with core exocyst subunits in the yeast two-hybrid assay, cytoplasmic localization,
and genetic effect suggest an unconventional EXO70 function possibly as a regulator
of exocytosis outside the exocyst complex. In conclusion, EXO70C2 is a novel factor
contributing to the regulation of optimal tip growth of Arabidopsis pollen tubes. '
article_processing_charge: No
article_type: original
author:
- first_name: Lukáš
full_name: Synek, Lukáš
last_name: Synek
- first_name: Nemanja
full_name: Vukašinović, Nemanja
last_name: Vukašinović
- first_name: Ivan
full_name: Kulich, Ivan
last_name: Kulich
- first_name: Michal
full_name: Hála, Michal
last_name: Hála
- first_name: Klára
full_name: Aldorfová, Klára
last_name: Aldorfová
- first_name: Matyas
full_name: Fendrych, Matyas
id: 43905548-F248-11E8-B48F-1D18A9856A87
last_name: Fendrych
orcid: 0000-0002-9767-8699
- first_name: Viktor
full_name: Žárský, Viktor
last_name: Žárský
citation:
ama: Synek L, Vukašinović N, Kulich I, et al. EXO70C2 is a key regulatory factor
for optimal tip growth of pollen. Plant Physiology. 2017;174(1):223-240.
doi:10.1104/pp.16.01282
apa: Synek, L., Vukašinović, N., Kulich, I., Hála, M., Aldorfová, K., Fendrych,
M., & Žárský, V. (2017). EXO70C2 is a key regulatory factor for optimal tip
growth of pollen. Plant Physiology. American Society of Plant Biologists.
https://doi.org/10.1104/pp.16.01282
chicago: Synek, Lukáš, Nemanja Vukašinović, Ivan Kulich, Michal Hála, Klára Aldorfová,
Matyas Fendrych, and Viktor Žárský. “EXO70C2 Is a Key Regulatory Factor for Optimal
Tip Growth of Pollen.” Plant Physiology. American Society of Plant Biologists,
2017. https://doi.org/10.1104/pp.16.01282.
ieee: L. Synek et al., “EXO70C2 is a key regulatory factor for optimal tip
growth of pollen,” Plant Physiology, vol. 174, no. 1. American Society
of Plant Biologists, pp. 223–240, 2017.
ista: Synek L, Vukašinović N, Kulich I, Hála M, Aldorfová K, Fendrych M, Žárský
V. 2017. EXO70C2 is a key regulatory factor for optimal tip growth of pollen.
Plant Physiology. 174(1), 223–240.
mla: Synek, Lukáš, et al. “EXO70C2 Is a Key Regulatory Factor for Optimal Tip Growth
of Pollen.” Plant Physiology, vol. 174, no. 1, American Society of Plant
Biologists, 2017, pp. 223–40, doi:10.1104/pp.16.01282.
short: L. Synek, N. Vukašinović, I. Kulich, M. Hála, K. Aldorfová, M. Fendrych,
V. Žárský, Plant Physiology 174 (2017) 223–240.
date_created: 2018-12-11T11:47:49Z
date_published: 2017-05-01T00:00:00Z
date_updated: 2021-01-12T08:08:35Z
day: '01'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.1104/pp.16.01282
external_id:
pmid:
- '28356503'
file:
- access_level: open_access
checksum: 97155acc6aa5f0d0a78e0589a932fe02
content_type: application/pdf
creator: dernst
date_created: 2019-11-18T16:16:18Z
date_updated: 2020-07-14T12:47:37Z
file_id: '7041'
file_name: 2017_PlantPhysio_Synek.pdf
file_size: 2176903
relation: main_file
file_date_updated: 2020-07-14T12:47:37Z
has_accepted_license: '1'
intvolume: ' 174'
issue: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 223 - 240
pmid: 1
publication: Plant Physiology
publication_identifier:
issn:
- '00320889'
publication_status: published
publisher: American Society of Plant Biologists
publist_id: '7058'
quality_controlled: '1'
scopus_import: 1
status: public
title: EXO70C2 is a key regulatory factor for optimal tip growth of pollen
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 174
year: '2017'
...
---
_id: '6679'
abstract:
- lang: eng
text: 'Polar codes represent one of the major recent breakthroughs in coding theory
and, because of their attractive features, they have been selected for the incoming
5G standard. As such, a lot of attention has been devoted to the development of
decoding algorithms with good error performance and efficient hardware implementation.
One of the leading candidates in this regard is represented by successive-cancellation
list (SCL) decoding. However, its hardware implementation requires a large amount
of memory. Recently, a partitioned SCL (PSCL) decoder has been proposed to significantly
reduce the memory consumption [1]. In this paper, we examine the paradigm of PSCL
decoding from both theoretical and practical standpoints: (i) by changing the
construction of the code, we are able to improve the performance at no additional
computational, latency or memory cost, (ii) we present an optimal scheme to allocate
cyclic redundancy checks (CRCs), and (iii) we provide an upper bound on the list
size that allows MAP performance.'
author:
- first_name: Seyyed Ali
full_name: Hashemi, Seyyed Ali
last_name: Hashemi
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Hamed
full_name: Hassani, Hamed
last_name: Hassani
- first_name: Ruediger
full_name: Urbanke, Ruediger
last_name: Urbanke
- first_name: Warren
full_name: Gross, Warren
last_name: Gross
citation:
ama: 'Hashemi SA, Mondelli M, Hassani H, Urbanke R, Gross W. Partitioned list decoding
of polar codes: Analysis and improvement of finite length performance. In: 2017
IEEE Global Communications Conference. IEEE; 2017:1-7. doi:10.1109/glocom.2017.8254940'
apa: 'Hashemi, S. A., Mondelli, M., Hassani, H., Urbanke, R., & Gross, W. (2017).
Partitioned list decoding of polar codes: Analysis and improvement of finite length
performance. In 2017 IEEE Global Communications Conference (pp. 1–7). Singapore,
Singapore: IEEE. https://doi.org/10.1109/glocom.2017.8254940'
chicago: 'Hashemi, Seyyed Ali, Marco Mondelli, Hamed Hassani, Ruediger Urbanke,
and Warren Gross. “Partitioned List Decoding of Polar Codes: Analysis and Improvement
of Finite Length Performance.” In 2017 IEEE Global Communications Conference,
1–7. IEEE, 2017. https://doi.org/10.1109/glocom.2017.8254940.'
ieee: 'S. A. Hashemi, M. Mondelli, H. Hassani, R. Urbanke, and W. Gross, “Partitioned
list decoding of polar codes: Analysis and improvement of finite length performance,”
in 2017 IEEE Global Communications Conference, Singapore, Singapore, 2017,
pp. 1–7.'
ista: 'Hashemi SA, Mondelli M, Hassani H, Urbanke R, Gross W. 2017. Partitioned
list decoding of polar codes: Analysis and improvement of finite length performance.
2017 IEEE Global Communications Conference. GLOBECOM: Global Communications Conference,
1–7.'
mla: 'Hashemi, Seyyed Ali, et al. “Partitioned List Decoding of Polar Codes: Analysis
and Improvement of Finite Length Performance.” 2017 IEEE Global Communications
Conference, IEEE, 2017, pp. 1–7, doi:10.1109/glocom.2017.8254940.'
short: S.A. Hashemi, M. Mondelli, H. Hassani, R. Urbanke, W. Gross, in:, 2017 IEEE
Global Communications Conference, IEEE, 2017, pp. 1–7.
conference:
end_date: 2017-12-08
location: Singapore, Singapore
name: 'GLOBECOM: Global Communications Conference'
start_date: 2017-12-04
date_created: 2019-07-24T13:55:25Z
date_published: 2017-12-01T00:00:00Z
date_updated: 2021-01-12T08:08:34Z
day: '01'
doi: 10.1109/glocom.2017.8254940
extern: '1'
external_id:
arxiv:
- '1705.05497'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1705.05497
month: '12'
oa: 1
oa_version: Preprint
page: 1-7
publication: 2017 IEEE Global Communications Conference
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: 'Partitioned list decoding of polar codes: Analysis and improvement of finite
length performance'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '671'
abstract:
- lang: eng
text: Humans routinely use conditionally cooperative strategies when interacting
in repeated social dilemmas. They are more likely to cooperate if others cooperated
before, and are ready to retaliate if others defected. To capture the emergence
of reciprocity, most previous models consider subjects who can only choose from
a restricted set of representative strategies, or who react to the outcome of
the very last round only. As players memorize more rounds, the dimension of the
strategy space increases exponentially. This increasing computational complexity
renders simulations for individuals with higher cognitive abilities infeasible,
especially if multiplayer interactions are taken into account. Here, we take an
axiomatic approach instead. We propose several properties that a robust cooperative
strategy for a repeated multiplayer dilemma should have. These properties naturally
lead to a unique class of cooperative strategies, which contains the classical
Win-Stay Lose-Shift rule as a special case. A comprehensive numerical analysis
for the prisoner's dilemma and for the public goods game suggests that strategies
of this class readily evolve across various memory-n spaces. Our results reveal
that successful strategies depend not only on how cooperative others were in the
past but also on the respective context of cooperation.
article_processing_charge: Yes (in subscription journal)
author:
- first_name: Christian
full_name: Hilbe, Christian
id: 2FDF8F3C-F248-11E8-B48F-1D18A9856A87
last_name: Hilbe
orcid: 0000-0001-5116-955X
- first_name: Vaquero
full_name: Martinez, Vaquero
last_name: Martinez
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Hilbe C, Martinez V, Chatterjee K, Nowak M. Memory-n strategies of direct reciprocity.
PNAS. 2017;114(18):4715-4720. doi:10.1073/pnas.1621239114
apa: Hilbe, C., Martinez, V., Chatterjee, K., & Nowak, M. (2017). Memory-n strategies
of direct reciprocity. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1621239114
chicago: Hilbe, Christian, Vaquero Martinez, Krishnendu Chatterjee, and Martin Nowak.
“Memory-n Strategies of Direct Reciprocity.” PNAS. National Academy of
Sciences, 2017. https://doi.org/10.1073/pnas.1621239114.
ieee: C. Hilbe, V. Martinez, K. Chatterjee, and M. Nowak, “Memory-n strategies of
direct reciprocity,” PNAS, vol. 114, no. 18. National Academy of Sciences,
pp. 4715–4720, 2017.
ista: Hilbe C, Martinez V, Chatterjee K, Nowak M. 2017. Memory-n strategies of direct
reciprocity. PNAS. 114(18), 4715–4720.
mla: Hilbe, Christian, et al. “Memory-n Strategies of Direct Reciprocity.” PNAS,
vol. 114, no. 18, National Academy of Sciences, 2017, pp. 4715–20, doi:10.1073/pnas.1621239114.
short: C. Hilbe, V. Martinez, K. Chatterjee, M. Nowak, PNAS 114 (2017) 4715–4720.
date_created: 2018-12-11T11:47:50Z
date_published: 2017-05-02T00:00:00Z
date_updated: 2021-01-12T08:08:37Z
day: '02'
department:
- _id: KrCh
doi: 10.1073/pnas.1621239114
ec_funded: 1
external_id:
pmid:
- '28420786'
intvolume: ' 114'
issue: '18'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5422766/
month: '05'
oa: 1
oa_version: Published Version
page: 4715 - 4720
pmid: 1
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: PNAS
publication_identifier:
issn:
- '00278424'
publication_status: published
publisher: National Academy of Sciences
publist_id: '7053'
quality_controlled: '1'
scopus_import: 1
status: public
title: Memory-n strategies of direct reciprocity
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 114
year: '2017'
...
---
_id: '670'
abstract:
- lang: eng
text: We propose an efficient method to model paper tearing in the context of interactive
modeling. The method uses geometrical information to automatically detect potential
starting points of tears. We further introduce a new hybrid geometrical and physical-based
method to compute the trajectory of tears while procedurally synthesizing high
resolution details of the tearing path using a texture based approach. The results
obtained are compared with real paper and with previous studies on the expected
geometric paths of paper that tears.
article_processing_charge: No
article_type: original
author:
- first_name: Camille
full_name: Schreck, Camille
id: 2B14B676-F248-11E8-B48F-1D18A9856A87
last_name: Schreck
- first_name: Damien
full_name: Rohmer, Damien
last_name: Rohmer
- first_name: Stefanie
full_name: Hahmann, Stefanie
last_name: Hahmann
citation:
ama: Schreck C, Rohmer D, Hahmann S. Interactive paper tearing. Computer Graphics
Forum. 2017;36(2):95-106. doi:10.1111/cgf.13110
apa: Schreck, C., Rohmer, D., & Hahmann, S. (2017). Interactive paper tearing.
Computer Graphics Forum. Wiley. https://doi.org/10.1111/cgf.13110
chicago: Schreck, Camille, Damien Rohmer, and Stefanie Hahmann. “Interactive Paper
Tearing.” Computer Graphics Forum. Wiley, 2017. https://doi.org/10.1111/cgf.13110.
ieee: C. Schreck, D. Rohmer, and S. Hahmann, “Interactive paper tearing,” Computer
Graphics Forum, vol. 36, no. 2. Wiley, pp. 95–106, 2017.
ista: Schreck C, Rohmer D, Hahmann S. 2017. Interactive paper tearing. Computer
Graphics Forum. 36(2), 95–106.
mla: Schreck, Camille, et al. “Interactive Paper Tearing.” Computer Graphics
Forum, vol. 36, no. 2, Wiley, 2017, pp. 95–106, doi:10.1111/cgf.13110.
short: C. Schreck, D. Rohmer, S. Hahmann, Computer Graphics Forum 36 (2017) 95–106.
date_created: 2018-12-11T11:47:49Z
date_published: 2017-05-01T00:00:00Z
date_updated: 2021-01-12T08:08:37Z
day: '01'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1111/cgf.13110
intvolume: ' 36'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://hal.inria.fr/hal-01647113/file/eg_2017_schreck_paper_tearing.pdf
month: '05'
oa: 1
oa_version: Published Version
page: 95 - 106
project:
- _id: 25357BD2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 24352-N23
name: 'Deep Pictures: Creating Visual and Haptic Vector Images'
publication: Computer Graphics Forum
publication_identifier:
issn:
- '01677055'
publication_status: published
publisher: Wiley
publist_id: '7056'
quality_controlled: '1'
scopus_import: 1
status: public
title: Interactive paper tearing
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 36
year: '2017'
...
---
_id: '672'
abstract:
- lang: eng
text: Trafficking cells frequently transmigrate through epithelial and endothelial
monolayers. How monolayers cooperate with the penetrating cells to support their
transit is poorly understood. We studied dendritic cell (DC) entry into lymphatic
capillaries as a model system for transendothelial migration. We find that the
chemokine CCL21, which is the decisive guidance cue for intravasation, mainly
localizes in the trans-Golgi network and intracellular vesicles of lymphatic endothelial
cells. Upon DC transmigration, these Golgi deposits disperse and CCL21 becomes
extracellularly enriched at the sites of endothelial cell-cell junctions. When
we reconstitute the transmigration process in vitro, we find that secretion of
CCL21-positive vesicles is triggered by a DC contact-induced calcium signal, and
selective calcium chelation in lymphatic endothelium attenuates transmigration.
Altogether, our data demonstrate a chemokine-mediated feedback between DCs and
lymphatic endothelium, which facilitates transendothelial migration.
article_processing_charge: Yes
author:
- first_name: Kari
full_name: Vaahtomeri, Kari
id: 368EE576-F248-11E8-B48F-1D18A9856A87
last_name: Vaahtomeri
orcid: 0000-0001-7829-3518
- first_name: Markus
full_name: Brown, Markus
id: 3DAB9AFC-F248-11E8-B48F-1D18A9856A87
last_name: Brown
- first_name: Robert
full_name: Hauschild, Robert
id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
last_name: Hauschild
orcid: 0000-0001-9843-3522
- first_name: Ingrid
full_name: De Vries, Ingrid
id: 4C7D837E-F248-11E8-B48F-1D18A9856A87
last_name: De Vries
- first_name: Alexander F
full_name: Leithner, Alexander F
id: 3B1B77E4-F248-11E8-B48F-1D18A9856A87
last_name: Leithner
- first_name: Matthias
full_name: Mehling, Matthias
id: 3C23B994-F248-11E8-B48F-1D18A9856A87
last_name: Mehling
orcid: 0000-0001-8599-1226
- first_name: Walter
full_name: Kaufmann, Walter
id: 3F99E422-F248-11E8-B48F-1D18A9856A87
last_name: Kaufmann
orcid: 0000-0001-9735-5315
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
citation:
ama: Vaahtomeri K, Brown M, Hauschild R, et al. Locally triggered release of the
chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia.
Cell Reports. 2017;19(5):902-909. doi:10.1016/j.celrep.2017.04.027
apa: Vaahtomeri, K., Brown, M., Hauschild, R., de Vries, I., Leithner, A. F., Mehling,
M., … Sixt, M. K. (2017). Locally triggered release of the chemokine CCL21 promotes
dendritic cell transmigration across lymphatic endothelia. Cell Reports.
Cell Press. https://doi.org/10.1016/j.celrep.2017.04.027
chicago: Vaahtomeri, Kari, Markus Brown, Robert Hauschild, Ingrid de Vries, Alexander
F Leithner, Matthias Mehling, Walter Kaufmann, and Michael K Sixt. “Locally Triggered
Release of the Chemokine CCL21 Promotes Dendritic Cell Transmigration across Lymphatic
Endothelia.” Cell Reports. Cell Press, 2017. https://doi.org/10.1016/j.celrep.2017.04.027.
ieee: K. Vaahtomeri et al., “Locally triggered release of the chemokine CCL21
promotes dendritic cell transmigration across lymphatic endothelia,” Cell Reports,
vol. 19, no. 5. Cell Press, pp. 902–909, 2017.
ista: Vaahtomeri K, Brown M, Hauschild R, de Vries I, Leithner AF, Mehling M, Kaufmann
W, Sixt MK. 2017. Locally triggered release of the chemokine CCL21 promotes dendritic
cell transmigration across lymphatic endothelia. Cell Reports. 19(5), 902–909.
mla: Vaahtomeri, Kari, et al. “Locally Triggered Release of the Chemokine CCL21
Promotes Dendritic Cell Transmigration across Lymphatic Endothelia.” Cell Reports,
vol. 19, no. 5, Cell Press, 2017, pp. 902–09, doi:10.1016/j.celrep.2017.04.027.
short: K. Vaahtomeri, M. Brown, R. Hauschild, I. de Vries, A.F. Leithner, M. Mehling,
W. Kaufmann, M.K. Sixt, Cell Reports 19 (2017) 902–909.
date_created: 2018-12-11T11:47:50Z
date_published: 2017-05-02T00:00:00Z
date_updated: 2023-02-23T12:50:09Z
day: '02'
ddc:
- '570'
department:
- _id: MiSi
- _id: Bio
- _id: EM-Fac
doi: 10.1016/j.celrep.2017.04.027
ec_funded: 1
file:
- access_level: open_access
checksum: 8fdddaab1f1d76a6ec9ca94dcb6b07a2
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:54Z
date_updated: 2020-07-14T12:47:38Z
file_id: '5109'
file_name: IST-2017-900-v1+1_1-s2.0-S2211124717305211-main.pdf
file_size: 2248814
relation: main_file
file_date_updated: 2020-07-14T12:47:38Z
has_accepted_license: '1'
intvolume: ' 19'
issue: '5'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '05'
oa: 1
oa_version: Published Version
page: 902 - 909
project:
- _id: 25A603A2-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '281556'
name: Cytoskeletal force generation and force transduction of migrating leukocytes
(EU)
- _id: 25A8E5EA-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Y 564-B12
name: Cytoskeletal force generation and transduction of leukocytes (FWF)
publication: Cell Reports
publication_identifier:
issn:
- '22111247'
publication_status: published
publisher: Cell Press
publist_id: '7052'
pubrep_id: '900'
quality_controlled: '1'
scopus_import: 1
status: public
title: Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration
across lymphatic endothelia
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: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 19
year: '2017'
...
---
_id: '6729'
abstract:
- lang: eng
text: Consider the problem of constructing a polar code of block length N for the
transmission over a given channel W. Typically this requires to compute the reliability
of all the N synthetic channels and then to include those that are sufficiently
reliable. However, we know from [1], [2] that there is a partial order among the
synthetic channels. Hence, it is natural to ask whether we can exploit it to reduce
the computational burden of the construction problem. We show that, if we take
advantage of the partial order [1], [2], we can construct a polar code by computing
the reliability of roughly N/ log 3/2 N synthetic channels. Such a set of synthetic
channels is universal, in the sense that it allows one to construct polar codes
for any W, and it can be identified by solving a maximum matching problem on a
bipartite graph. Our proof technique consists in reducing the construction problem
to the problem of computing the maximum cardinality of an antichain for a suitable
partially ordered set. As such, this method is general and it can be used to further
improve the complexity of the construction problem in case a new partial order
on the synthetic channels of polar codes is discovered.
author:
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: S. Hamed
full_name: Hassani, S. Hamed
last_name: Hassani
- first_name: Rudiger
full_name: Urbanke, Rudiger
last_name: Urbanke
citation:
ama: 'Mondelli M, Hassani SH, Urbanke R. Construction of polar codes with sublinear
complexity. In: 2017 IEEE International Symposium on Information Theory .
IEEE; 2017:1853-1857. doi:10.1109/isit.2017.8006850'
apa: 'Mondelli, M., Hassani, S. H., & Urbanke, R. (2017). Construction of polar
codes with sublinear complexity. In 2017 IEEE International Symposium on Information
Theory (pp. 1853–1857). Aachen, Germany: IEEE. https://doi.org/10.1109/isit.2017.8006850'
chicago: Mondelli, Marco, S. Hamed Hassani, and Rudiger Urbanke. “Construction of
Polar Codes with Sublinear Complexity.” In 2017 IEEE International Symposium
on Information Theory , 1853–57. IEEE, 2017. https://doi.org/10.1109/isit.2017.8006850.
ieee: M. Mondelli, S. H. Hassani, and R. Urbanke, “Construction of polar codes with
sublinear complexity,” in 2017 IEEE International Symposium on Information
Theory , Aachen, Germany, 2017, pp. 1853–1857.
ista: 'Mondelli M, Hassani SH, Urbanke R. 2017. Construction of polar codes with
sublinear complexity. 2017 IEEE International Symposium on Information Theory
. ISIT: International Symposium on Information Theory, 1853–1857.'
mla: Mondelli, Marco, et al. “Construction of Polar Codes with Sublinear Complexity.”
2017 IEEE International Symposium on Information Theory , IEEE, 2017, pp.
1853–57, doi:10.1109/isit.2017.8006850.
short: M. Mondelli, S.H. Hassani, R. Urbanke, in:, 2017 IEEE International Symposium
on Information Theory , IEEE, 2017, pp. 1853–1857.
conference:
end_date: 2017-06-30
location: Aachen, Germany
name: 'ISIT: International Symposium on Information Theory'
start_date: 2017-06-25
date_created: 2019-07-30T07:14:18Z
date_published: 2017-06-15T00:00:00Z
date_updated: 2023-02-23T12:49:08Z
day: '15'
doi: 10.1109/isit.2017.8006850
extern: '1'
external_id:
arxiv:
- '1612.05295'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1612.05295
month: '06'
oa: 1
oa_version: Preprint
page: 1853-1857
publication: '2017 IEEE International Symposium on Information Theory '
publication_identifier:
eissn:
- 2157-8117
isbn:
- '9781509040964'
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '6663'
relation: later_version
status: public
status: public
title: Construction of polar codes with sublinear complexity
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '6730'
abstract:
- lang: eng
text: We introduce a new approach to proving that a sequence of deterministic linear
codes achieves capacity on an erasure channel under maximum a posteriori decoding.
Rather than relying on the precise structure of the codes, our method exploits
code symmetry. In particular, the technique applies to any sequence of linear
codes where the blocklengths are strictly increasing, the code rates converge,
and the permutation group of each code is doubly transitive. In other words, we
show that symmetry alone implies near-optimal performance. An important consequence
of this result is that a sequence of Reed-Muller codes with increasing block length
and converging rate achieves capacity. This possibility has been suggested previously
in the literature but it has only been proven for cases where the limiting code
rate is 0 or 1. Moreover, these results extend naturally to all affine-invariant
codes and, thus, to extended primitive narrow-sense BCH codes. This also resolves,
in the affirmative, the existence question for capacity-achieving sequences of
binary cyclic codes. The primary tools used in the proof are the sharp threshold
property for symmetric monotone Boolean functions and the area theorem for extrinsic
information transfer functions.
author:
- first_name: Shrinivas
full_name: Kudekar, Shrinivas
last_name: Kudekar
- first_name: Santhosh
full_name: Kumar, Santhosh
last_name: Kumar
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Henry D.
full_name: Pfister, Henry D.
last_name: Pfister
- first_name: Eren
full_name: Sasoglu, Eren
last_name: Sasoglu
- first_name: Ridiger L.
full_name: Urbanke, Ridiger L.
last_name: Urbanke
citation:
ama: Kudekar S, Kumar S, Mondelli M, Pfister HD, Sasoglu E, Urbanke RL. Reed–Muller
codes achieve capacity on erasure channels. IEEE Transactions on Information
Theory. 2017;63(7):4298-4316. doi:10.1109/tit.2017.2673829
apa: Kudekar, S., Kumar, S., Mondelli, M., Pfister, H. D., Sasoglu, E., & Urbanke,
R. L. (2017). Reed–Muller codes achieve capacity on erasure channels. IEEE
Transactions on Information Theory. IEEE. https://doi.org/10.1109/tit.2017.2673829
chicago: Kudekar, Shrinivas, Santhosh Kumar, Marco Mondelli, Henry D. Pfister, Eren
Sasoglu, and Ridiger L. Urbanke. “Reed–Muller Codes Achieve Capacity on Erasure
Channels.” IEEE Transactions on Information Theory. IEEE, 2017. https://doi.org/10.1109/tit.2017.2673829.
ieee: S. Kudekar, S. Kumar, M. Mondelli, H. D. Pfister, E. Sasoglu, and R. L. Urbanke,
“Reed–Muller codes achieve capacity on erasure channels,” IEEE Transactions
on Information Theory, vol. 63, no. 7. IEEE, pp. 4298–4316, 2017.
ista: Kudekar S, Kumar S, Mondelli M, Pfister HD, Sasoglu E, Urbanke RL. 2017. Reed–Muller
codes achieve capacity on erasure channels. IEEE Transactions on Information Theory.
63(7), 4298–4316.
mla: Kudekar, Shrinivas, et al. “Reed–Muller Codes Achieve Capacity on Erasure Channels.”
IEEE Transactions on Information Theory, vol. 63, no. 7, IEEE, 2017, pp.
4298–316, doi:10.1109/tit.2017.2673829.
short: S. Kudekar, S. Kumar, M. Mondelli, H.D. Pfister, E. Sasoglu, R.L. Urbanke,
IEEE Transactions on Information Theory 63 (2017) 4298–4316.
date_created: 2019-07-30T07:18:11Z
date_published: 2017-07-01T00:00:00Z
date_updated: 2021-01-12T08:08:43Z
day: '01'
doi: 10.1109/tit.2017.2673829
extern: '1'
external_id:
arxiv:
- '1601.04689'
intvolume: ' 63'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1601.04689
month: '07'
oa: 1
oa_version: Preprint
page: 4298-4316
publication: IEEE Transactions on Information Theory
publication_identifier:
eissn:
- 1557-9654
issn:
- 0018-9448
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: Reed–Muller codes achieve capacity on erasure channels
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 63
year: '2017'
...
---
_id: '6731'
abstract:
- lang: eng
text: 'We present a rate-compatible polar coding scheme that achieves the capacity
of any family of channels. Our solution generalizes the previous results [1],
[2] that provide capacity-achieving rate-compatible polar codes for a degraded
family of channels. The motivation for our extension comes from the fact that
in many practical scenarios, e.g., MIMO systems and non-Gaussian interference,
the channels cannot be ordered by degradation. The main technical contribution
of this paper consists in removing the degradation condition. To do so, we exploit
the ideas coming from the construction of universal polar codes. Our scheme possesses
the usual attractive features of polar codes: low complexity code construction,
encoding, and decoding; super-polynomial scaling of the error probability with
the block length; and absence of error floors. On the negative side, the scaling
of the gap to capacity with the block length is slower than in standard polar
codes, and we prove an upper bound on the scaling exponent.'
article_number: '7919107'
author:
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Hamed
full_name: Hassani, Hamed
last_name: Hassani
- first_name: Ivana
full_name: Maric, Ivana
last_name: Maric
- first_name: Dennis
full_name: Hui, Dennis
last_name: Hui
- first_name: Song-Nam
full_name: Hong, Song-Nam
last_name: Hong
citation:
ama: 'Mondelli M, Hassani H, Maric I, Hui D, Hong S-N. Capacity-achieving rate-compatible
polar codes for general channels. In: 2017 IEEE Wireless Communications and
Networking Conference Workshops . IEEE; 2017. doi:10.1109/wcncw.2017.7919107'
apa: 'Mondelli, M., Hassani, H., Maric, I., Hui, D., & Hong, S.-N. (2017). Capacity-achieving
rate-compatible polar codes for general channels. In 2017 IEEE Wireless Communications
and Networking Conference Workshops . San Francisco, CA, USA: IEEE. https://doi.org/10.1109/wcncw.2017.7919107'
chicago: Mondelli, Marco, Hamed Hassani, Ivana Maric, Dennis Hui, and Song-Nam Hong.
“Capacity-Achieving Rate-Compatible Polar Codes for General Channels.” In 2017
IEEE Wireless Communications and Networking Conference Workshops . IEEE, 2017.
https://doi.org/10.1109/wcncw.2017.7919107.
ieee: M. Mondelli, H. Hassani, I. Maric, D. Hui, and S.-N. Hong, “Capacity-achieving
rate-compatible polar codes for general channels,” in 2017 IEEE Wireless Communications
and Networking Conference Workshops , San Francisco, CA, USA, 2017.
ista: 'Mondelli M, Hassani H, Maric I, Hui D, Hong S-N. 2017. Capacity-achieving
rate-compatible polar codes for general channels. 2017 IEEE Wireless Communications
and Networking Conference Workshops . WCNCW: Wireless communications and networking
conference workshops, 7919107.'
mla: Mondelli, Marco, et al. “Capacity-Achieving Rate-Compatible Polar Codes for
General Channels.” 2017 IEEE Wireless Communications and Networking Conference
Workshops , 7919107, IEEE, 2017, doi:10.1109/wcncw.2017.7919107.
short: M. Mondelli, H. Hassani, I. Maric, D. Hui, S.-N. Hong, in:, 2017 IEEE Wireless
Communications and Networking Conference Workshops , IEEE, 2017.
conference:
end_date: 2017-03-22
location: San Francisco, CA, USA
name: 'WCNCW: Wireless communications and networking conference workshops'
start_date: 2017-03-19
date_created: 2019-07-31T05:56:58Z
date_published: 2017-05-04T00:00:00Z
date_updated: 2021-01-12T08:08:43Z
day: '04'
doi: 10.1109/wcncw.2017.7919107
extern: '1'
external_id:
arxiv:
- '1611.01199'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1611.01199
month: '05'
oa: 1
oa_version: Preprint
publication: '2017 IEEE Wireless Communications and Networking Conference Workshops '
publication_identifier:
isbn:
- '9781509059089'
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: Capacity-achieving rate-compatible polar codes for general channels
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '677'
abstract:
- lang: eng
text: The INO80 complex (INO80-C) is an evolutionarily conserved nucleosome remodeler
that acts in transcription, replication, and genome stability. It is required
for resistance against genotoxic agents and is involved in the repair of DNA double-strand
breaks (DSBs) by homologous recombination (HR). However, the causes of the HR
defect in INO80-C mutant cells are controversial. Here, we unite previous findings
using a system to study HR with high spatial resolution in budding yeast. We find
that INO80-C has at least two distinct functions during HR—DNA end resection and
presynaptic filament formation. Importantly, the second function is linked to
the histone variant H2A.Z. In the absence of H2A.Z, presynaptic filament formation
and HR are restored in INO80-C-deficient mutants, suggesting that presynaptic
filament formation is the crucial INO80-C function during HR.
author:
- first_name: Claudio
full_name: Lademann, Claudio
last_name: Lademann
- first_name: Jörg
full_name: Renkawitz, Jörg
id: 3F0587C8-F248-11E8-B48F-1D18A9856A87
last_name: Renkawitz
orcid: 0000-0003-2856-3369
- first_name: Boris
full_name: Pfander, Boris
last_name: Pfander
- first_name: Stefan
full_name: Jentsch, Stefan
last_name: Jentsch
citation:
ama: Lademann C, Renkawitz J, Pfander B, Jentsch S. The INO80 complex removes H2A.Z
to promote presynaptic filament formation during homologous recombination. Cell
Reports. 2017;19(7):1294-1303. doi:10.1016/j.celrep.2017.04.051
apa: Lademann, C., Renkawitz, J., Pfander, B., & Jentsch, S. (2017). The INO80
complex removes H2A.Z to promote presynaptic filament formation during homologous
recombination. Cell Reports. Cell Press. https://doi.org/10.1016/j.celrep.2017.04.051
chicago: Lademann, Claudio, Jörg Renkawitz, Boris Pfander, and Stefan Jentsch. “The
INO80 Complex Removes H2A.Z to Promote Presynaptic Filament Formation during Homologous
Recombination.” Cell Reports. Cell Press, 2017. https://doi.org/10.1016/j.celrep.2017.04.051.
ieee: C. Lademann, J. Renkawitz, B. Pfander, and S. Jentsch, “The INO80 complex
removes H2A.Z to promote presynaptic filament formation during homologous recombination,”
Cell Reports, vol. 19, no. 7. Cell Press, pp. 1294–1303, 2017.
ista: Lademann C, Renkawitz J, Pfander B, Jentsch S. 2017. The INO80 complex removes
H2A.Z to promote presynaptic filament formation during homologous recombination.
Cell Reports. 19(7), 1294–1303.
mla: Lademann, Claudio, et al. “The INO80 Complex Removes H2A.Z to Promote Presynaptic
Filament Formation during Homologous Recombination.” Cell Reports, vol.
19, no. 7, Cell Press, 2017, pp. 1294–303, doi:10.1016/j.celrep.2017.04.051.
short: C. Lademann, J. Renkawitz, B. Pfander, S. Jentsch, Cell Reports 19 (2017)
1294–1303.
date_created: 2018-12-11T11:47:52Z
date_published: 2017-05-16T00:00:00Z
date_updated: 2021-01-12T08:08:57Z
day: '16'
ddc:
- '570'
department:
- _id: MiSi
doi: 10.1016/j.celrep.2017.04.051
file:
- access_level: open_access
checksum: efc7287d9c6354983cb151880e9ad72a
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:48Z
date_updated: 2020-07-14T12:47:40Z
file_id: '5171'
file_name: IST-2017-899-v1+1_1-s2.0-S2211124717305454-main.pdf
file_size: 3005610
relation: main_file
file_date_updated: 2020-07-14T12:47:40Z
has_accepted_license: '1'
intvolume: ' 19'
issue: '7'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 1294 - 1303
publication: Cell Reports
publication_identifier:
issn:
- '22111247'
publication_status: published
publisher: Cell Press
publist_id: '7046'
pubrep_id: '899'
quality_controlled: '1'
scopus_import: 1
status: public
title: The INO80 complex removes H2A.Z to promote presynaptic filament formation during
homologous recombination
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: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 19
year: '2017'
...
---
_id: '681'
abstract:
- lang: eng
text: Two-player games on graphs provide the theoretical framework for many important
problems such as reactive synthesis. While the traditional study of two-player
zero-sum games has been extended to multi-player games with several notions of
equilibria, they are decidable only for perfect-information games, whereas several
applications require imperfect-information. In this paper we propose a new notion
of equilibria, called doomsday equilibria, which is a strategy profile where all
players satisfy their own objective, and if any coalition of players deviates
and violates even one of the players' objective, then the objective of every player
is violated. We present algorithms and complexity results for deciding the existence
of doomsday equilibria for various classes of ω-regular objectives, both for imperfect-information
games, and for perfect-information games. We provide optimal complexity bounds
for imperfect-information games, and in most cases for perfect-information games.
article_processing_charge: No
article_type: original
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Emmanuel
full_name: Filiot, Emmanuel
last_name: Filiot
- first_name: Jean
full_name: Raskin, Jean
last_name: Raskin
citation:
ama: Chatterjee K, Doyen L, Filiot E, Raskin J. Doomsday equilibria for omega-regular
games. Information and Computation. 2017;254:296-315. doi:10.1016/j.ic.2016.10.012
apa: Chatterjee, K., Doyen, L., Filiot, E., & Raskin, J. (2017). Doomsday equilibria
for omega-regular games. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2016.10.012
chicago: Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean Raskin.
“Doomsday Equilibria for Omega-Regular Games.” Information and Computation.
Elsevier, 2017. https://doi.org/10.1016/j.ic.2016.10.012.
ieee: K. Chatterjee, L. Doyen, E. Filiot, and J. Raskin, “Doomsday equilibria for
omega-regular games,” Information and Computation, vol. 254. Elsevier,
pp. 296–315, 2017.
ista: Chatterjee K, Doyen L, Filiot E, Raskin J. 2017. Doomsday equilibria for omega-regular
games. Information and Computation. 254, 296–315.
mla: Chatterjee, Krishnendu, et al. “Doomsday Equilibria for Omega-Regular Games.”
Information and Computation, vol. 254, Elsevier, 2017, pp. 296–315, doi:10.1016/j.ic.2016.10.012.
short: K. Chatterjee, L. Doyen, E. Filiot, J. Raskin, Information and Computation
254 (2017) 296–315.
date_created: 2018-12-11T11:47:53Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2023-02-21T16:06:02Z
day: '01'
department:
- _id: KrCh
doi: 10.1016/j.ic.2016.10.012
ec_funded: 1
external_id:
arxiv:
- '1311.3238'
intvolume: ' 254'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1311.3238
month: '06'
oa: 1
oa_version: Submitted Version
page: 296 - 315
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Information and Computation
publication_identifier:
issn:
- '08905401'
publication_status: published
publisher: Elsevier
publist_id: '7036'
quality_controlled: '1'
related_material:
record:
- id: '10885'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Doomsday equilibria for omega-regular games
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 254
year: '2017'
...
---
_id: '6841'
abstract:
- lang: eng
text: In classical machine learning, regression is treated as a black box process
of identifying a suitable function from a hypothesis set without attempting to
gain insight into the mechanism connecting inputs and outputs. In the natural
sciences, however, finding an interpretable function for a phenomenon is the prime
goal as it allows to understand and generalize results. This paper proposes a
novel type of function learning network, called equation learner (EQL), that can
learn analytical expressions and is able to extrapolate to unseen domains. It
is implemented as an end-to-end differentiable feed-forward network and allows
for efficient gradient based training. Due to sparsity regularization concise
interpretable expressions can be obtained. Often the true underlying source expression
is identified.
author:
- first_name: Georg S
full_name: Martius, Georg S
id: 3A276B68-F248-11E8-B48F-1D18A9856A87
last_name: Martius
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Martius GS, Lampert C. Extrapolation and learning equations. In: 5th International
Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings.
International Conference on Learning Representations; 2017.'
apa: 'Martius, G. S., & Lampert, C. (2017). Extrapolation and learning equations.
In 5th International Conference on Learning Representations, ICLR 2017 - Workshop
Track Proceedings. Toulon, France: International Conference on Learning Representations.'
chicago: Martius, Georg S, and Christoph Lampert. “Extrapolation and Learning Equations.”
In 5th International Conference on Learning Representations, ICLR 2017 - Workshop
Track Proceedings. International Conference on Learning Representations, 2017.
ieee: G. S. Martius and C. Lampert, “Extrapolation and learning equations,” in 5th
International Conference on Learning Representations, ICLR 2017 - Workshop Track
Proceedings, Toulon, France, 2017.
ista: 'Martius GS, Lampert C. 2017. Extrapolation and learning equations. 5th International
Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings.
ICLR: International Conference on Learning Representations.'
mla: Martius, Georg S., and Christoph Lampert. “Extrapolation and Learning Equations.”
5th International Conference on Learning Representations, ICLR 2017 - Workshop
Track Proceedings, International Conference on Learning Representations, 2017.
short: G.S. Martius, C. Lampert, in:, 5th International Conference on Learning Representations,
ICLR 2017 - Workshop Track Proceedings, International Conference on Learning Representations,
2017.
conference:
end_date: 2017-04-26
location: Toulon, France
name: 'ICLR: International Conference on Learning Representations'
start_date: 2017-04-24
date_created: 2019-09-01T22:01:00Z
date_published: 2017-02-21T00:00:00Z
date_updated: 2021-01-12T08:09:17Z
day: '21'
department:
- _id: ChLa
ec_funded: 1
external_id:
arxiv:
- '1610.02995'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1610.02995
month: '02'
oa: 1
oa_version: Preprint
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication: 5th International Conference on Learning Representations, ICLR 2017 -
Workshop Track Proceedings
publication_status: published
publisher: International Conference on Learning Representations
quality_controlled: '1'
scopus_import: 1
status: public
title: Extrapolation and learning equations
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '684'
abstract:
- lang: eng
text: We generalize winning conditions in two-player games by adding a structural
acceptance condition called obligations. Obligations are orthogonal to the linear
winning conditions that define whether a play is winning. Obligations are a declaration
that player 0 can achieve a certain value from a configuration. If the obligation
is met, the value of that configuration for player 0 is 1. We define the value
in such games and show that obligation games are determined. For Markov chains
with Borel objectives and obligations, and finite turn-based stochastic parity
games with obligations we give an alternative and simpler characterization of
the value function. Based on this simpler definition we show that the decision
problem of winning finite turn-based stochastic parity games with obligations
is in NP∩co-NP. We also show that obligation games provide a game framework for
reasoning about p-automata. © 2017 The Association for Symbolic Logic.
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Nir
full_name: Piterman, Nir
last_name: Piterman
citation:
ama: Chatterjee K, Piterman N. Obligation blackwell games and p-automata. Journal
of Symbolic Logic. 2017;82(2):420-452. doi:10.1017/jsl.2016.71
apa: Chatterjee, K., & Piterman, N. (2017). Obligation blackwell games and p-automata.
Journal of Symbolic Logic. Cambridge University Press. https://doi.org/10.1017/jsl.2016.71
chicago: Chatterjee, Krishnendu, and Nir Piterman. “Obligation Blackwell Games and
P-Automata.” Journal of Symbolic Logic. Cambridge University Press, 2017.
https://doi.org/10.1017/jsl.2016.71.
ieee: K. Chatterjee and N. Piterman, “Obligation blackwell games and p-automata,”
Journal of Symbolic Logic, vol. 82, no. 2. Cambridge University Press,
pp. 420–452, 2017.
ista: Chatterjee K, Piterman N. 2017. Obligation blackwell games and p-automata.
Journal of Symbolic Logic. 82(2), 420–452.
mla: Chatterjee, Krishnendu, and Nir Piterman. “Obligation Blackwell Games and P-Automata.”
Journal of Symbolic Logic, vol. 82, no. 2, Cambridge University Press,
2017, pp. 420–52, doi:10.1017/jsl.2016.71.
short: K. Chatterjee, N. Piterman, Journal of Symbolic Logic 82 (2017) 420–452.
date_created: 2018-12-11T11:47:54Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2021-04-16T12:10:53Z
day: '01'
department:
- _id: KrCh
doi: 10.1017/jsl.2016.71
intvolume: ' 82'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1206.5174
month: '06'
oa: 1
oa_version: Submitted Version
page: 420 - 452
publication: Journal of Symbolic Logic
publication_identifier:
eissn:
- 1943-5886
issn:
- 0022-4812
publication_status: published
publisher: Cambridge University Press
publist_id: '7026'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Obligation blackwell games and p-automata
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 82
year: '2017'
...
---
_id: '685'
abstract:
- lang: eng
text: By applying methods and principles from the physical sciences to biological
problems, D'Arcy Thompson's On Growth and Form demonstrated how mathematical reasoning
reveals elegant, simple explanations for seemingly complex processes. This has
had a profound influence on subsequent generations of developmental biologists.
We discuss how this influence can be traced through twentieth century morphologists,
embryologists and theoreticians to current research that explores the molecular
and cellular mechanisms of tissue growth and patterning, including our own studies
of the vertebrate neural tube.
author:
- first_name: James
full_name: Briscoe, James
last_name: Briscoe
- first_name: Anna
full_name: Kicheva, Anna
id: 3959A2A0-F248-11E8-B48F-1D18A9856A87
last_name: Kicheva
orcid: 0000-0003-4509-4998
citation:
ama: Briscoe J, Kicheva A. The physics of development 100 years after D’Arcy Thompson’s
“on growth and form.” Mechanisms of Development. 2017;145:26-31. doi:10.1016/j.mod.2017.03.005
apa: Briscoe, J., & Kicheva, A. (2017). The physics of development 100 years
after D’Arcy Thompson’s “on growth and form.” Mechanisms of Development.
Elsevier. https://doi.org/10.1016/j.mod.2017.03.005
chicago: Briscoe, James, and Anna Kicheva. “The Physics of Development 100 Years
after D’Arcy Thompson’s ‘on Growth and Form.’” Mechanisms of Development.
Elsevier, 2017. https://doi.org/10.1016/j.mod.2017.03.005.
ieee: J. Briscoe and A. Kicheva, “The physics of development 100 years after D’Arcy
Thompson’s ‘on growth and form,’” Mechanisms of Development, vol. 145.
Elsevier, pp. 26–31, 2017.
ista: Briscoe J, Kicheva A. 2017. The physics of development 100 years after D’Arcy
Thompson’s “on growth and form”. Mechanisms of Development. 145, 26–31.
mla: Briscoe, James, and Anna Kicheva. “The Physics of Development 100 Years after
D’Arcy Thompson’s ‘on Growth and Form.’” Mechanisms of Development, vol.
145, Elsevier, 2017, pp. 26–31, doi:10.1016/j.mod.2017.03.005.
short: J. Briscoe, A. Kicheva, Mechanisms of Development 145 (2017) 26–31.
date_created: 2018-12-11T11:47:55Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2021-01-12T08:09:20Z
day: '01'
ddc:
- '571'
department:
- _id: AnKi
doi: 10.1016/j.mod.2017.03.005
ec_funded: 1
external_id:
pmid:
- '28366718'
file:
- access_level: open_access
checksum: 727043d2e4199fbef6b3704e6d1ac105
content_type: application/pdf
creator: dernst
date_created: 2019-04-17T07:58:48Z
date_updated: 2020-07-14T12:47:42Z
file_id: '6335'
file_name: 2017_Briscoe_Kicheva_and_DArcy_accepted_version.pdf
file_size: 652313
relation: main_file
file_date_updated: 2020-07-14T12:47:42Z
has_accepted_license: '1'
intvolume: ' 145'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 26 - 31
pmid: 1
project:
- _id: B6FC0238-B512-11E9-945C-1524E6697425
call_identifier: H2020
grant_number: '680037'
name: Coordination of Patterning And Growth In the Spinal Cord
publication: Mechanisms of Development
publication_identifier:
issn:
- '09254773'
publication_status: published
publisher: Elsevier
publist_id: '7025'
pubrep_id: '985'
quality_controlled: '1'
scopus_import: 1
status: public
title: The physics of development 100 years after D'Arcy Thompson's “on growth and
form”
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 145
year: '2017'
...
---
_id: '688'
abstract:
- lang: eng
text: 'We show that the framework of topological data analysis can be extended from
metrics to general Bregman divergences, widening the scope of possible applications.
Examples are the Kullback - Leibler divergence, which is commonly used for comparing
text and images, and the Itakura - Saito divergence, popular for speech and sound.
In particular, we prove that appropriately generalized čech and Delaunay (alpha)
complexes capture the correct homotopy type, namely that of the corresponding
union of Bregman balls. Consequently, their filtrations give the correct persistence
diagram, namely the one generated by the uniformly growing Bregman balls. Moreover,
we show that unlike the metric setting, the filtration of Vietoris-Rips complexes
may fail to approximate the persistence diagram. We propose algorithms to compute
the thus generalized čech, Vietoris-Rips and Delaunay complexes and experimentally
test their efficiency. Lastly, we explain their surprisingly good performance
by making a connection with discrete Morse theory. '
alternative_title:
- LIPIcs
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Hubert
full_name: Wagner, Hubert
id: 379CA8B8-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
citation:
ama: 'Edelsbrunner H, Wagner H. Topological data analysis with Bregman divergences.
In: Vol 77. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017:391-3916.
doi:10.4230/LIPIcs.SoCG.2017.39'
apa: 'Edelsbrunner, H., & Wagner, H. (2017). Topological data analysis with
Bregman divergences (Vol. 77, pp. 391–3916). Presented at the Symposium on Computational
Geometry, SoCG, Brisbane, Australia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.SoCG.2017.39'
chicago: Edelsbrunner, Herbert, and Hubert Wagner. “Topological Data Analysis with
Bregman Divergences,” 77:391–3916. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2017. https://doi.org/10.4230/LIPIcs.SoCG.2017.39.
ieee: H. Edelsbrunner and H. Wagner, “Topological data analysis with Bregman divergences,”
presented at the Symposium on Computational Geometry, SoCG, Brisbane, Australia,
2017, vol. 77, pp. 391–3916.
ista: Edelsbrunner H, Wagner H. 2017. Topological data analysis with Bregman divergences.
Symposium on Computational Geometry, SoCG, LIPIcs, vol. 77, 391–3916.
mla: Edelsbrunner, Herbert, and Hubert Wagner. Topological Data Analysis with
Bregman Divergences. Vol. 77, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2017, pp. 391–3916, doi:10.4230/LIPIcs.SoCG.2017.39.
short: H. Edelsbrunner, H. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2017, pp. 391–3916.
conference:
end_date: 2017-07-07
location: Brisbane, Australia
name: Symposium on Computational Geometry, SoCG
start_date: 2017-07-04
date_created: 2018-12-11T11:47:56Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2021-01-12T08:09:26Z
day: '01'
ddc:
- '514'
- '516'
department:
- _id: HeEd
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2017.39
file:
- access_level: open_access
checksum: 067ab0cb3f962bae6c3af6bf0094e0f3
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:03Z
date_updated: 2020-07-14T12:47:42Z
file_id: '4856'
file_name: IST-2017-895-v1+1_LIPIcs-SoCG-2017-39.pdf
file_size: 990546
relation: main_file
file_date_updated: 2020-07-14T12:47:42Z
has_accepted_license: '1'
intvolume: ' 77'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 391-3916
publication_identifier:
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7021'
pubrep_id: '895'
quality_controlled: '1'
scopus_import: 1
status: public
title: Topological data analysis with Bregman divergences
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 77
year: '2017'
...
---
_id: '687'
abstract:
- lang: eng
text: Pursuing the similarity between the Kontsevich-Soibelman construction of the
cohomological Hall algebra (CoHA) of BPS states and Lusztig's construction of
canonical bases for quantum enveloping algebras, and the similarity between the
integrality conjecture for motivic Donaldson-Thomas invariants and the PBW theorem
for quantum enveloping algebras, we build a coproduct on the CoHA associated to
a quiver with potential. We also prove a cohomological dimensional reduction theorem,
further linking a special class of CoHAs with Yangians, and explaining how to
connect the study of character varieties with the study of CoHAs.
author:
- first_name: Ben
full_name: Davison, Ben
id: 4634AB1E-F248-11E8-B48F-1D18A9856A87
last_name: Davison
orcid: 0000-0002-8944-4390
citation:
ama: Davison B. The critical CoHA of a quiver with potential. Quarterly Journal
of Mathematics. 2017;68(2):635-703. doi:10.1093/qmath/haw053
apa: Davison, B. (2017). The critical CoHA of a quiver with potential. Quarterly
Journal of Mathematics. Oxford University Press. https://doi.org/10.1093/qmath/haw053
chicago: Davison, Ben. “The Critical CoHA of a Quiver with Potential.” Quarterly
Journal of Mathematics. Oxford University Press, 2017. https://doi.org/10.1093/qmath/haw053.
ieee: B. Davison, “The critical CoHA of a quiver with potential,” Quarterly Journal
of Mathematics, vol. 68, no. 2. Oxford University Press, pp. 635–703, 2017.
ista: Davison B. 2017. The critical CoHA of a quiver with potential. Quarterly Journal
of Mathematics. 68(2), 635–703.
mla: Davison, Ben. “The Critical CoHA of a Quiver with Potential.” Quarterly
Journal of Mathematics, vol. 68, no. 2, Oxford University Press, 2017, pp.
635–703, doi:10.1093/qmath/haw053.
short: B. Davison, Quarterly Journal of Mathematics 68 (2017) 635–703.
date_created: 2018-12-11T11:47:55Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2021-01-12T08:09:24Z
day: '01'
department:
- _id: TaHa
doi: 10.1093/qmath/haw053
ec_funded: 1
intvolume: ' 68'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1311.7172
month: '06'
oa: 1
oa_version: Submitted Version
page: 635 - 703
project:
- _id: 25E549F4-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '320593'
name: Arithmetic and physics of Higgs moduli spaces
publication: Quarterly Journal of Mathematics
publication_identifier:
issn:
- '00335606'
publication_status: published
publisher: Oxford University Press
publist_id: '7022'
quality_controlled: '1'
scopus_import: 1
status: public
title: The critical CoHA of a quiver with potential
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 68
year: '2017'
...
---
_id: '693'
abstract:
- lang: eng
text: 'Many central synapses contain a single presynaptic active zone and a single
postsynaptic density. Vesicular release statistics at such “simple synapses” indicate
that they contain a small complement of docking sites where vesicles repetitively
dock and fuse. In this work, we investigate functional and morphological aspects
of docking sites at simple synapses made between cerebellar parallel fibers and
molecular layer interneurons. Using immunogold labeling of SDS-treated freeze-fracture
replicas, we find that Cav2.1 channels form several clusters per active zone with
about nine channels per cluster. The mean value and range of intersynaptic variation
are similar for Cav2.1 cluster numbers and for functional estimates of docking-site
numbers obtained from the maximum numbers of released vesicles per action potential.
Both numbers grow in relation with synaptic size and decrease by a similar extent
with age between 2 wk and 4 wk postnatal. Thus, the mean docking-site numbers
were 3.15 at 2 wk (range: 1–10) and 2.03 at 4 wk (range: 1–4), whereas the mean
numbers of Cav2.1 clusters were 2.84 at 2 wk (range: 1–8) and 2.37 at 4 wk (range:
1–5). These changes were accompanied by decreases of miniature current amplitude
(from 93 pA to 56 pA), active-zone surface area (from 0.0427 μm2 to 0.0234 μm2),
and initial success rate (from 0.609 to 0.353), indicating a tightening of synaptic
transmission with development. Altogether, these results suggest a close correspondence
between the number of functionally defined vesicular docking sites and that of
clusters of voltage-gated calcium channels. '
article_processing_charge: Yes (in subscription journal)
author:
- first_name: Takafumi
full_name: Miki, Takafumi
last_name: Miki
- first_name: Walter
full_name: Kaufmann, Walter
id: 3F99E422-F248-11E8-B48F-1D18A9856A87
last_name: Kaufmann
orcid: 0000-0001-9735-5315
- first_name: Gerardo
full_name: Malagon, Gerardo
last_name: Malagon
- first_name: Laura
full_name: Gomez, Laura
last_name: Gomez
- first_name: Katsuhiko
full_name: Tabuchi, Katsuhiko
last_name: Tabuchi
- first_name: Masahiko
full_name: Watanabe, Masahiko
last_name: Watanabe
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Alain
full_name: Marty, Alain
last_name: Marty
citation:
ama: Miki T, Kaufmann W, Malagon G, et al. Numbers of presynaptic Ca2+ channel clusters
match those of functionally defined vesicular docking sites in single central
synapses. PNAS. 2017;114(26):E5246-E5255. doi:10.1073/pnas.1704470114
apa: Miki, T., Kaufmann, W., Malagon, G., Gomez, L., Tabuchi, K., Watanabe, M.,
… Marty, A. (2017). Numbers of presynaptic Ca2+ channel clusters match those of
functionally defined vesicular docking sites in single central synapses. PNAS.
National Academy of Sciences. https://doi.org/10.1073/pnas.1704470114
chicago: Miki, Takafumi, Walter Kaufmann, Gerardo Malagon, Laura Gomez, Katsuhiko
Tabuchi, Masahiko Watanabe, Ryuichi Shigemoto, and Alain Marty. “Numbers of Presynaptic
Ca2+ Channel Clusters Match Those of Functionally Defined Vesicular Docking Sites
in Single Central Synapses.” PNAS. National Academy of Sciences, 2017.
https://doi.org/10.1073/pnas.1704470114.
ieee: T. Miki et al., “Numbers of presynaptic Ca2+ channel clusters match
those of functionally defined vesicular docking sites in single central synapses,”
PNAS, vol. 114, no. 26. National Academy of Sciences, pp. E5246–E5255,
2017.
ista: Miki T, Kaufmann W, Malagon G, Gomez L, Tabuchi K, Watanabe M, Shigemoto R,
Marty A. 2017. Numbers of presynaptic Ca2+ channel clusters match those of functionally
defined vesicular docking sites in single central synapses. PNAS. 114(26), E5246–E5255.
mla: Miki, Takafumi, et al. “Numbers of Presynaptic Ca2+ Channel Clusters Match
Those of Functionally Defined Vesicular Docking Sites in Single Central Synapses.”
PNAS, vol. 114, no. 26, National Academy of Sciences, 2017, pp. E5246–55,
doi:10.1073/pnas.1704470114.
short: T. Miki, W. Kaufmann, G. Malagon, L. Gomez, K. Tabuchi, M. Watanabe, R. Shigemoto,
A. Marty, PNAS 114 (2017) E5246–E5255.
date_created: 2018-12-11T11:47:57Z
date_published: 2017-06-27T00:00:00Z
date_updated: 2023-02-23T12:54:57Z
day: '27'
ddc:
- '570'
department:
- _id: EM-Fac
- _id: RySh
doi: 10.1073/pnas.1704470114
external_id:
pmid:
- '28607047'
file:
- access_level: open_access
checksum: 2ab75d554f3df4a34d20fa8040589b7e
content_type: application/pdf
creator: kschuh
date_created: 2020-01-03T13:27:29Z
date_updated: 2020-07-14T12:47:44Z
file_id: '7223'
file_name: 2017_PNAS_Miki.pdf
file_size: 2721544
relation: main_file
file_date_updated: 2020-07-14T12:47:44Z
has_accepted_license: '1'
intvolume: ' 114'
issue: '26'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: E5246 - E5255
pmid: 1
publication: PNAS
publication_identifier:
issn:
- '00278424'
publication_status: published
publisher: National Academy of Sciences
publist_id: '7013'
quality_controlled: '1'
scopus_import: 1
status: public
title: Numbers of presynaptic Ca2+ channel clusters match those of functionally defined
vesicular docking sites in single central synapses
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 114
year: '2017'
...
---
_id: '694'
abstract:
- lang: eng
text: A change regarding the extent of adhesion - hereafter referred to as adhesion
plasticity - between adhesive and less-adhesive states of mammalian cells is important
for their behavior. To investigate adhesion plasticity, we have selected a stable
isogenic subpopulation of human MDA-MB-468 breast carcinoma cells growing in suspension.
These suspension cells are unable to re-adhere to various matrices or to contract
three-dimensional collagen lattices. By using transcriptome analysis, we identified
the focal adhesion protein tensin3 (Tns3) as a determinant of adhesion plasticity.
Tns3 is strongly reduced at mRNA and protein levels in suspension cells. Furthermore,
by transiently challenging breast cancer cells to grow under non-adherent conditions
markedly reduces Tns3 protein expression, which is regained upon re-adhesion.
Stable knockdown of Tns3 in parental MDA-MB-468 cells results in defective adhesion,
spreading and migration. Tns3-knockdown cells display impaired structure and dynamics
of focal adhesion complexes as determined by immunostaining. Restoration of Tns3
protein expression in suspension cells partially rescues adhesion and focal contact
composition. Our work identifies Tns3 as a crucial focal adhesion component regulated
by, and functionally contributing to, the switch between adhesive and non-adhesive
states in MDA-MB-468 cancer cells.
article_type: original
author:
- first_name: Astrid
full_name: Veß, Astrid
last_name: Veß
- first_name: Ulrich
full_name: Blache, Ulrich
last_name: Blache
- first_name: Laura
full_name: Leitner, Laura
last_name: Leitner
- first_name: Angela
full_name: Kurz, Angela
last_name: Kurz
- first_name: Anja
full_name: Ehrenpfordt, Anja
last_name: Ehrenpfordt
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
- first_name: Guido
full_name: Posern, Guido
last_name: Posern
citation:
ama: Veß A, Blache U, Leitner L, et al. A dual phenotype of MDA MB 468 cancer cells
reveals mutual regulation of tensin3 and adhesion plasticity. Journal of Cell
Science. 2017;130(13):2172-2184. doi:10.1242/jcs.200899
apa: Veß, A., Blache, U., Leitner, L., Kurz, A., Ehrenpfordt, A., Sixt, M. K., &
Posern, G. (2017). A dual phenotype of MDA MB 468 cancer cells reveals mutual
regulation of tensin3 and adhesion plasticity. Journal of Cell Science.
Company of Biologists. https://doi.org/10.1242/jcs.200899
chicago: Veß, Astrid, Ulrich Blache, Laura Leitner, Angela Kurz, Anja Ehrenpfordt,
Michael K Sixt, and Guido Posern. “A Dual Phenotype of MDA MB 468 Cancer Cells
Reveals Mutual Regulation of Tensin3 and Adhesion Plasticity.” Journal of Cell
Science. Company of Biologists, 2017. https://doi.org/10.1242/jcs.200899.
ieee: A. Veß et al., “A dual phenotype of MDA MB 468 cancer cells reveals
mutual regulation of tensin3 and adhesion plasticity,” Journal of Cell Science,
vol. 130, no. 13. Company of Biologists, pp. 2172–2184, 2017.
ista: Veß A, Blache U, Leitner L, Kurz A, Ehrenpfordt A, Sixt MK, Posern G. 2017.
A dual phenotype of MDA MB 468 cancer cells reveals mutual regulation of tensin3
and adhesion plasticity. Journal of Cell Science. 130(13), 2172–2184.
mla: Veß, Astrid, et al. “A Dual Phenotype of MDA MB 468 Cancer Cells Reveals Mutual
Regulation of Tensin3 and Adhesion Plasticity.” Journal of Cell Science,
vol. 130, no. 13, Company of Biologists, 2017, pp. 2172–84, doi:10.1242/jcs.200899.
short: A. Veß, U. Blache, L. Leitner, A. Kurz, A. Ehrenpfordt, M.K. Sixt, G. Posern,
Journal of Cell Science 130 (2017) 2172–2184.
date_created: 2018-12-11T11:47:58Z
date_published: 2017-07-01T00:00:00Z
date_updated: 2021-01-12T08:09:41Z
day: '01'
ddc:
- '570'
department:
- _id: MiSi
doi: 10.1242/jcs.200899
external_id:
pmid:
- '28515231'
file:
- access_level: open_access
checksum: 42c81a0a4fc3128883b391c3af3f74bc
content_type: application/pdf
creator: dernst
date_created: 2019-10-24T09:43:56Z
date_updated: 2020-07-14T12:47:45Z
file_id: '6966'
file_name: 2017_CellScience_Vess.pdf
file_size: 10847596
relation: main_file
file_date_updated: 2020-07-14T12:47:45Z
has_accepted_license: '1'
intvolume: ' 130'
issue: '13'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 2172 - 2184
pmid: 1
publication: Journal of Cell Science
publication_identifier:
issn:
- '00219533'
publication_status: published
publisher: Company of Biologists
publist_id: '7008'
quality_controlled: '1'
scopus_import: 1
status: public
title: A dual phenotype of MDA MB 468 cancer cells reveals mutual regulation of tensin3
and adhesion plasticity
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 130
year: '2017'
...
---
_id: '697'
abstract:
- lang: eng
text: 'De, Trevisan and Tulsiani [CRYPTO 2010] show that every distribution over
n-bit strings which has constant statistical distance to uniform (e.g., the output
of a pseudorandom generator mapping n-1 to n bit strings), can be distinguished
from the uniform distribution with advantage epsilon by a circuit of size O( 2^n
epsilon^2). We generalize this result, showing that a distribution which has less
than k bits of min-entropy, can be distinguished from any distribution with k
bits of delta-smooth min-entropy with advantage epsilon by a circuit of size O(2^k
epsilon^2/delta^2). As a special case, this implies that any distribution with
support at most 2^k (e.g., the output of a pseudoentropy generator mapping k to
n bit strings) can be distinguished from any given distribution with min-entropy
k+1 with advantage epsilon by a circuit of size O(2^k epsilon^2). Our result thus
shows that pseudoentropy distributions face basically the same non-uniform attacks
as pseudorandom distributions. '
alternative_title:
- LIPIcs
article_number: '39'
author:
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Maciej
full_name: Skórski, Maciej
id: EC09FA6A-02D0-11E9-8223-86B7C91467DD
last_name: Skórski
citation:
ama: 'Pietrzak KZ, Skórski M. Non uniform attacks against pseudoentropy. In: Vol
80. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.ICALP.2017.39'
apa: 'Pietrzak, K. Z., & Skórski, M. (2017). Non uniform attacks against pseudoentropy
(Vol. 80). Presented at the ICALP: International Colloquium on Automata, Languages,
and Programming, Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.ICALP.2017.39'
chicago: Pietrzak, Krzysztof Z, and Maciej Skórski. “Non Uniform Attacks against
Pseudoentropy,” Vol. 80. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
https://doi.org/10.4230/LIPIcs.ICALP.2017.39.
ieee: 'K. Z. Pietrzak and M. Skórski, “Non uniform attacks against pseudoentropy,”
presented at the ICALP: International Colloquium on Automata, Languages, and Programming,
Warsaw, Poland, 2017, vol. 80.'
ista: 'Pietrzak KZ, Skórski M. 2017. Non uniform attacks against pseudoentropy.
ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs,
vol. 80, 39.'
mla: Pietrzak, Krzysztof Z., and Maciej Skórski. Non Uniform Attacks against
Pseudoentropy. Vol. 80, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2017, doi:10.4230/LIPIcs.ICALP.2017.39.
short: K.Z. Pietrzak, M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2017.
conference:
end_date: 2017-07-14
location: Warsaw, Poland
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 2017-07-10
date_created: 2018-12-11T11:47:59Z
date_published: 2017-07-01T00:00:00Z
date_updated: 2021-01-12T08:11:15Z
day: '01'
ddc:
- '005'
department:
- _id: KrPi
doi: 10.4230/LIPIcs.ICALP.2017.39
ec_funded: 1
file:
- access_level: open_access
checksum: e95618a001692f1af2d68f5fde43bc1f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:40Z
date_updated: 2020-07-14T12:47:46Z
file_id: '4701'
file_name: IST-2017-893-v1+1_LIPIcs-ICALP-2017-39.pdf
file_size: 601004
relation: main_file
file_date_updated: 2020-07-14T12:47:46Z
has_accepted_license: '1'
intvolume: ' 80'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_identifier:
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7003'
pubrep_id: '893'
quality_controlled: '1'
scopus_import: 1
status: public
title: Non uniform attacks against pseudoentropy
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 80
year: '2017'
...
---
_id: '698'
abstract:
- lang: eng
text: 'Extracellular matrix signals from the microenvironment regulate gene expression
patterns and cell behavior. Using a combination of experiments and geometric models,
we demonstrate correlations between cell geometry, three-dimensional (3D) organization
of chromosome territories, and gene expression. Fluorescence in situ hybridization
experiments showed that micropatterned fibroblasts cultured on anisotropic versus
isotropic substrates resulted in repositioning of specific chromosomes, which
contained genes that were differentially regulated by cell geometries. Experiments
combined with ellipsoid packing models revealed that the mechanosensitivity of
chromosomes was correlated with their orientation in the nucleus. Transcription
inhibition experiments suggested that the intermingling degree was more sensitive
to global changes in transcription than to chromosome radial positioning and its
orientations. These results suggested that cell geometry modulated 3D chromosome
arrangement, and their neighborhoods correlated with gene expression patterns
in a predictable manner. This is central to understanding geometric control of
genetic programs involved in cellular homeostasis and the associated diseases. '
author:
- first_name: Yejun
full_name: Wang, Yejun
last_name: Wang
- first_name: Mallika
full_name: Nagarajan, Mallika
last_name: Nagarajan
- first_name: Caroline
full_name: Uhler, Caroline
id: 49ADD78E-F248-11E8-B48F-1D18A9856A87
last_name: Uhler
orcid: 0000-0002-7008-0216
- first_name: Gv
full_name: Shivashankar, Gv
last_name: Shivashankar
citation:
ama: Wang Y, Nagarajan M, Uhler C, Shivashankar G. Orientation and repositioning
of chromosomes correlate with cell geometry dependent gene expression. Molecular
Biology of the Cell. 2017;28(14):1997-2009. doi:10.1091/mbc.E16-12-0825
apa: Wang, Y., Nagarajan, M., Uhler, C., & Shivashankar, G. (2017). Orientation
and repositioning of chromosomes correlate with cell geometry dependent gene expression.
Molecular Biology of the Cell. American Society for Cell Biology. https://doi.org/10.1091/mbc.E16-12-0825
chicago: Wang, Yejun, Mallika Nagarajan, Caroline Uhler, and Gv Shivashankar. “Orientation
and Repositioning of Chromosomes Correlate with Cell Geometry Dependent Gene Expression.”
Molecular Biology of the Cell. American Society for Cell Biology, 2017.
https://doi.org/10.1091/mbc.E16-12-0825.
ieee: Y. Wang, M. Nagarajan, C. Uhler, and G. Shivashankar, “Orientation and repositioning
of chromosomes correlate with cell geometry dependent gene expression,” Molecular
Biology of the Cell, vol. 28, no. 14. American Society for Cell Biology, pp.
1997–2009, 2017.
ista: Wang Y, Nagarajan M, Uhler C, Shivashankar G. 2017. Orientation and repositioning
of chromosomes correlate with cell geometry dependent gene expression. Molecular
Biology of the Cell. 28(14), 1997–2009.
mla: Wang, Yejun, et al. “Orientation and Repositioning of Chromosomes Correlate
with Cell Geometry Dependent Gene Expression.” Molecular Biology of the Cell,
vol. 28, no. 14, American Society for Cell Biology, 2017, pp. 1997–2009, doi:10.1091/mbc.E16-12-0825.
short: Y. Wang, M. Nagarajan, C. Uhler, G. Shivashankar, Molecular Biology of the
Cell 28 (2017) 1997–2009.
date_created: 2018-12-11T11:47:59Z
date_published: 2017-07-07T00:00:00Z
date_updated: 2021-01-12T08:11:17Z
day: '07'
ddc:
- '519'
department:
- _id: CaUh
doi: 10.1091/mbc.E16-12-0825
file:
- access_level: open_access
checksum: de01dac9e30970cfa6ae902480a4e04d
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:53Z
date_updated: 2020-07-14T12:47:46Z
file_id: '4844'
file_name: IST-2017-892-v1+1_Mol._Biol._Cell-2017-Wang-1997-2009.pdf
file_size: 1086097
relation: main_file
file_date_updated: 2020-07-14T12:47:46Z
has_accepted_license: '1'
intvolume: ' 28'
issue: '14'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-sa/4.0/
month: '07'
oa: 1
oa_version: Published Version
page: 1997 - 2009
project:
- _id: 2530CA10-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Y 903-N35
name: 'Gaussian Graphical Models: Theory and Applications'
publication: Molecular Biology of the Cell
publication_identifier:
issn:
- '10591524'
publication_status: published
publisher: American Society for Cell Biology
publist_id: '7001'
pubrep_id: '892'
quality_controlled: '1'
scopus_import: 1
status: public
title: Orientation and repositioning of chromosomes correlate with cell geometry dependent
gene expression
tmp:
image: /images/cc_by_nc_sa.png
legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
BY-NC-SA 4.0)
short: CC BY-NC-SA (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 28
year: '2017'
...
---
_id: '699'
abstract:
- lang: eng
text: 'In antagonistic symbioses, such as host–parasite interactions, one population’s
success is the other’s loss. In mutualistic symbioses, such as division of labor,
both parties can gain, but they might have different preferences over the possible
mutualistic arrangements. The rates of evolution of the two populations in a symbiosis
are important determinants of which population will be more successful: Faster
evolution is thought to be favored in antagonistic symbioses (the “Red Queen effect”),
but disfavored in certain mutualistic symbioses (the “Red King effect”). However,
it remains unclear which biological parameters drive these effects. Here, we analyze
the effects of the various determinants of evolutionary rate: generation time,
mutation rate, population size, and the intensity of natural selection. Our main
results hold for the case where mutation is infrequent. Slower evolution causes
a long-term advantage in an important class of mutualistic interactions. Surprisingly,
less intense selection is the strongest driver of this Red King effect, whereas
relative mutation rates and generation times have little effect. In antagonistic
interactions, faster evolution by any means is beneficial. Our results provide
insight into the demographic evolution of symbionts. '
author:
- first_name: Carl
full_name: Veller, Carl
last_name: Veller
- first_name: Laura
full_name: Hayward, Laura
last_name: Hayward
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
- first_name: Christian
full_name: Hilbe, Christian
id: 2FDF8F3C-F248-11E8-B48F-1D18A9856A87
last_name: Hilbe
orcid: 0000-0001-5116-955X
citation:
ama: Veller C, Hayward L, Nowak M, Hilbe C. The red queen and king in finite populations.
PNAS. 2017;114(27):E5396-E5405. doi:10.1073/pnas.1702020114
apa: Veller, C., Hayward, L., Nowak, M., & Hilbe, C. (2017). The red queen and
king in finite populations. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1702020114
chicago: Veller, Carl, Laura Hayward, Martin Nowak, and Christian Hilbe. “The Red
Queen and King in Finite Populations.” PNAS. National Academy of Sciences,
2017. https://doi.org/10.1073/pnas.1702020114.
ieee: C. Veller, L. Hayward, M. Nowak, and C. Hilbe, “The red queen and king in
finite populations,” PNAS, vol. 114, no. 27. National Academy of Sciences,
pp. E5396–E5405, 2017.
ista: Veller C, Hayward L, Nowak M, Hilbe C. 2017. The red queen and king in finite
populations. PNAS. 114(27), E5396–E5405.
mla: Veller, Carl, et al. “The Red Queen and King in Finite Populations.” PNAS,
vol. 114, no. 27, National Academy of Sciences, 2017, pp. E5396–405, doi:10.1073/pnas.1702020114.
short: C. Veller, L. Hayward, M. Nowak, C. Hilbe, PNAS 114 (2017) E5396–E5405.
date_created: 2018-12-11T11:48:00Z
date_published: 2017-07-03T00:00:00Z
date_updated: 2021-01-12T08:11:21Z
day: '03'
department:
- _id: KrCh
doi: 10.1073/pnas.1702020114
external_id:
pmid:
- '28630336'
intvolume: ' 114'
issue: '27'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5502615/
month: '07'
oa: 1
oa_version: Submitted Version
page: E5396 - E5405
pmid: 1
publication: PNAS
publication_identifier:
issn:
- '00278424'
publication_status: published
publisher: National Academy of Sciences
publist_id: '7002'
quality_controlled: '1'
scopus_import: 1
status: public
title: The red queen and king in finite populations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 114
year: '2017'
...
---
_id: '700'
abstract:
- lang: eng
text: Microtubules provide the mechanical force required for chromosome separation
during mitosis. However, little is known about the dynamic (high-frequency) mechanical
properties of microtubules. Here, we theoretically propose to control the vibrations
of a doubly clamped microtubule by tip electrodes and to detect its motion via
the optomechanical coupling between the vibrational modes of the microtubule and
an optical cavity. In the presence of a red-detuned strong pump laser, this coupling
leads to optomechanical-induced transparency of an optical probe field, which
can be detected with state-of-the art technology. The center frequency and line
width of the transparency peak give the resonance frequency and damping rate of
the microtubule, respectively, while the height of the peak reveals information
about the microtubule-cavity field coupling. Our method opens the new possibilities
to gain information about the physical properties of microtubules, which will
enhance our capability to design physical cancer treatment protocols as alternatives
to chemotherapeutic drugs.
article_number: '012404'
author:
- first_name: Shabir
full_name: Barzanjeh, Shabir
id: 2D25E1F6-F248-11E8-B48F-1D18A9856A87
last_name: Barzanjeh
orcid: 0000-0003-0415-1423
- first_name: Vahid
full_name: Salari, Vahid
last_name: Salari
- first_name: Jack
full_name: Tuszynski, Jack
last_name: Tuszynski
- first_name: Michal
full_name: Cifra, Michal
last_name: Cifra
- first_name: Christoph
full_name: Simon, Christoph
last_name: Simon
citation:
ama: Barzanjeh S, Salari V, Tuszynski J, Cifra M, Simon C. Optomechanical proposal
for monitoring microtubule mechanical vibrations. Physical Review E Statistical
Nonlinear and Soft Matter Physics . 2017;96(1). doi:10.1103/PhysRevE.96.012404
apa: Barzanjeh, S., Salari, V., Tuszynski, J., Cifra, M., & Simon, C. (2017).
Optomechanical proposal for monitoring microtubule mechanical vibrations.
Physical Review E Statistical Nonlinear and Soft Matter Physics . American
Institute of Physics. https://doi.org/10.1103/PhysRevE.96.012404
chicago: Barzanjeh, Shabir, Vahid Salari, Jack Tuszynski, Michal Cifra, and Christoph
Simon. “Optomechanical Proposal for Monitoring Microtubule Mechanical Vibrations.”
Physical Review E Statistical Nonlinear and Soft Matter Physics . American
Institute of Physics, 2017. https://doi.org/10.1103/PhysRevE.96.012404.
ieee: S. Barzanjeh, V. Salari, J. Tuszynski, M. Cifra, and C. Simon, “Optomechanical
proposal for monitoring microtubule mechanical vibrations,” Physical Review
E Statistical Nonlinear and Soft Matter Physics , vol. 96, no. 1. American
Institute of Physics, 2017.
ista: Barzanjeh S, Salari V, Tuszynski J, Cifra M, Simon C. 2017. Optomechanical
proposal for monitoring microtubule mechanical vibrations. Physical Review E
Statistical Nonlinear and Soft Matter Physics . 96(1), 012404.
mla: Barzanjeh, Shabir, et al. “Optomechanical Proposal for Monitoring Microtubule
Mechanical Vibrations.” Physical Review E Statistical Nonlinear and Soft Matter
Physics , vol. 96, no. 1, 012404, American Institute of Physics, 2017, doi:10.1103/PhysRevE.96.012404.
short: S. Barzanjeh, V. Salari, J. Tuszynski, M. Cifra, C. Simon, Physical Review
E Statistical Nonlinear and Soft Matter Physics 96 (2017).
date_created: 2018-12-11T11:48:00Z
date_published: 2017-07-12T00:00:00Z
date_updated: 2023-02-23T12:56:35Z
day: '12'
department:
- _id: JoFi
doi: 10.1103/PhysRevE.96.012404
ec_funded: 1
intvolume: ' 96'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/pdf/1612.07061.pdf
month: '07'
oa: 1
oa_version: Submitted Version
project:
- _id: 258047B6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '707438'
name: 'Microwave-to-Optical Quantum Link: Quantum Teleportation and Quantum Illumination
with cavity Optomechanics'
publication: ' Physical Review E Statistical Nonlinear and Soft Matter Physics '
publication_identifier:
issn:
- '24700045'
publication_status: published
publisher: American Institute of Physics
publist_id: '6997'
quality_controlled: '1'
scopus_import: 1
status: public
title: Optomechanical proposal for monitoring microtubule mechanical vibrations
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 96
year: '2017'
...
---
_id: '701'
abstract:
- lang: eng
text: A d-dimensional simplex S is called a k-reptile (or a k-reptile simplex) if
it can be tiled by k simplices with disjoint interiors that are all mutually congruent
and similar to S. For d = 2, triangular k-reptiles exist for all k of the form
a^2, 3a^2 or a^2+b^2 and they have been completely characterized by Snover, Waiveris,
and Williams. On the other hand, the only k-reptile simplices that are known for
d ≥ 3, have k = m^d, where m is a positive integer. We substantially simplify
the proof by Matoušek and the second author that for d = 3, k-reptile tetrahedra
can exist only for k = m^3. We then prove a weaker analogue of this result for
d = 4 by showing that four-dimensional k-reptile simplices can exist only for
k = m^2.
author:
- first_name: Jan
full_name: Kynčl, Jan
last_name: Kynčl
- first_name: Zuzana
full_name: Patakova, Zuzana
id: 48B57058-F248-11E8-B48F-1D18A9856A87
last_name: Patakova
orcid: 0000-0002-3975-1683
citation:
ama: Kynčl J, Patakova Z. On the nonexistence of k reptile simplices in ℝ^3 and
ℝ^4. The Electronic Journal of Combinatorics. 2017;24(3):1-44.
apa: Kynčl, J., & Patakova, Z. (2017). On the nonexistence of k reptile simplices
in ℝ^3 and ℝ^4. The Electronic Journal of Combinatorics. International
Press.
chicago: Kynčl, Jan, and Zuzana Patakova. “On the Nonexistence of k Reptile Simplices
in ℝ^3 and ℝ^4.” The Electronic Journal of Combinatorics. International
Press, 2017.
ieee: J. Kynčl and Z. Patakova, “On the nonexistence of k reptile simplices in ℝ^3
and ℝ^4,” The Electronic Journal of Combinatorics, vol. 24, no. 3. International
Press, pp. 1–44, 2017.
ista: Kynčl J, Patakova Z. 2017. On the nonexistence of k reptile simplices in ℝ^3
and ℝ^4. The Electronic Journal of Combinatorics. 24(3), 1–44.
mla: Kynčl, Jan, and Zuzana Patakova. “On the Nonexistence of k Reptile Simplices
in ℝ^3 and ℝ^4.” The Electronic Journal of Combinatorics, vol. 24, no.
3, International Press, 2017, pp. 1–44.
short: J. Kynčl, Z. Patakova, The Electronic Journal of Combinatorics 24 (2017)
1–44.
date_created: 2018-12-11T11:48:00Z
date_published: 2017-07-14T00:00:00Z
date_updated: 2021-01-12T08:11:28Z
day: '14'
ddc:
- '500'
department:
- _id: UlWa
file:
- access_level: open_access
checksum: a431e573e31df13bc0f66de3061006ec
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:25Z
date_updated: 2020-07-14T12:47:47Z
file_id: '5077'
file_name: IST-2018-984-v1+1_Patakova_on_the_nonexistence_of_k-reptile_simplices_in_R_3_and_R_4_2017.pdf
file_size: 544042
relation: main_file
file_date_updated: 2020-07-14T12:47:47Z
has_accepted_license: '1'
intvolume: ' 24'
issue: '3'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 1-44
publication: The Electronic Journal of Combinatorics
publication_identifier:
issn:
- '10778926'
publication_status: published
publisher: International Press
publist_id: '6996'
pubrep_id: '984'
quality_controlled: '1'
status: public
title: On the nonexistence of k reptile simplices in ℝ^3 and ℝ^4
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 24
year: '2017'
...
---
_id: '7064'
abstract:
- lang: eng
text: 'The complex antiferromagnetic orders observed in the honeycomb iridates are
a double-edged sword in the search for a quantum spin-liquid: both attesting that
the magnetic interactions provide many of the necessary ingredients, while simultaneously
impeding access. Focus has naturally been drawn to the unusual magnetic orders
that hint at the underlying spin correlations. However, the study of any particular
broken symmetry state generally provides little clue about the possibility of
other nearby ground states. Here we use magnetic fields approaching 100 Tesla
to reveal the extent of the spin correlations in γ-lithium iridate. We find that
a small component of field along the magnetic easy-axis melts long-range order,
revealing a bistable, strongly correlated spin state. Far from the usual destruction
of antiferromagnetism via spin polarization, the high-field state possesses only
a small fraction of the total iridium moment, without evidence for long-range
order up to the highest attainable magnetic fields.'
article_number: '180'
article_processing_charge: No
article_type: original
author:
- first_name: Kimberly A
full_name: Modic, Kimberly A
id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425
last_name: Modic
orcid: 0000-0001-9760-3147
- first_name: B. J.
full_name: Ramshaw, B. J.
last_name: Ramshaw
- first_name: J. B.
full_name: Betts, J. B.
last_name: Betts
- first_name: Nicholas P.
full_name: Breznay, Nicholas P.
last_name: Breznay
- first_name: James G.
full_name: Analytis, James G.
last_name: Analytis
- first_name: Ross D.
full_name: McDonald, Ross D.
last_name: McDonald
- first_name: Arkady
full_name: Shekhter, Arkady
last_name: Shekhter
citation:
ama: Modic KA, Ramshaw BJ, Betts JB, et al. Robust spin correlations at high magnetic
fields in the harmonic honeycomb iridates. Nature Communications. 2017;8(1).
doi:10.1038/s41467-017-00264-6
apa: Modic, K. A., Ramshaw, B. J., Betts, J. B., Breznay, N. P., Analytis, J. G.,
McDonald, R. D., & Shekhter, A. (2017). Robust spin correlations at high magnetic
fields in the harmonic honeycomb iridates. Nature Communications. Springer
Nature. https://doi.org/10.1038/s41467-017-00264-6
chicago: Modic, Kimberly A, B. J. Ramshaw, J. B. Betts, Nicholas P. Breznay, James
G. Analytis, Ross D. McDonald, and Arkady Shekhter. “Robust Spin Correlations
at High Magnetic Fields in the Harmonic Honeycomb Iridates.” Nature Communications.
Springer Nature, 2017. https://doi.org/10.1038/s41467-017-00264-6.
ieee: K. A. Modic et al., “Robust spin correlations at high magnetic fields
in the harmonic honeycomb iridates,” Nature Communications, vol. 8, no.
1. Springer Nature, 2017.
ista: Modic KA, Ramshaw BJ, Betts JB, Breznay NP, Analytis JG, McDonald RD, Shekhter
A. 2017. Robust spin correlations at high magnetic fields in the harmonic honeycomb
iridates. Nature Communications. 8(1), 180.
mla: Modic, Kimberly A., et al. “Robust Spin Correlations at High Magnetic Fields
in the Harmonic Honeycomb Iridates.” Nature Communications, vol. 8, no.
1, 180, Springer Nature, 2017, doi:10.1038/s41467-017-00264-6.
short: K.A. Modic, B.J. Ramshaw, J.B. Betts, N.P. Breznay, J.G. Analytis, R.D. McDonald,
A. Shekhter, Nature Communications 8 (2017).
date_created: 2019-11-19T13:11:55Z
date_published: 2017-08-01T00:00:00Z
date_updated: 2021-01-12T08:11:39Z
day: '01'
ddc:
- '530'
doi: 10.1038/s41467-017-00264-6
extern: '1'
file:
- access_level: open_access
checksum: 57fcd59d2f274b6b16cc89ea03cfd440
content_type: application/pdf
creator: cziletti
date_created: 2019-11-20T14:12:54Z
date_updated: 2020-07-14T12:47:48Z
file_id: '7091'
file_name: 2017_NatureComm_Modic.pdf
file_size: 1242958
relation: main_file
file_date_updated: 2020-07-14T12:47:48Z
has_accepted_license: '1'
intvolume: ' 8'
issue: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
publication: Nature Communications
publication_identifier:
issn:
- 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Robust spin correlations at high magnetic fields in the harmonic honeycomb
iridates
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: 8
year: '2017'
...
---
_id: '7067'
abstract:
- lang: eng
text: Broken fourfold rotational (C4) symmetry is observed in the experimental properties
of several classes of unconventional superconductors. It has been proposed that
this symmetry breaking is important for superconducting pairing in these materials,
but in the high-Tc cuprates this broken symmetry has never been observed on the
Fermi surface. Here we report a pronounced anisotropy in the angle dependence
of the interlayer magnetoresistance of the underdoped high transition temperature
(high-Tc) superconductor YBa2Cu3O6.58, directly revealing broken C4 symmetry on
the Fermi surface. Moreover, we demonstrate that this Fermi surface has C2 symmetry
of the type produced by a uniaxial or anisotropic density-wave phase. This establishes
the central role of C4 symmetry breaking in the Fermi surface reconstruction of
YBa2Cu3O6+δ , and suggests a striking degree of universality among unconventional
superconductors.
article_number: '8'
article_processing_charge: No
article_type: original
author:
- first_name: B. J.
full_name: Ramshaw, B. J.
last_name: Ramshaw
- first_name: N.
full_name: Harrison, N.
last_name: Harrison
- first_name: S. E.
full_name: Sebastian, S. E.
last_name: Sebastian
- first_name: S.
full_name: Ghannadzadeh, S.
last_name: Ghannadzadeh
- first_name: Kimberly A
full_name: Modic, Kimberly A
id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425
last_name: Modic
orcid: 0000-0001-9760-3147
- first_name: D. A.
full_name: Bonn, D. A.
last_name: Bonn
- first_name: W. N.
full_name: Hardy, W. N.
last_name: Hardy
- first_name: Ruixing
full_name: Liang, Ruixing
last_name: Liang
- first_name: P. A.
full_name: Goddard, P. A.
last_name: Goddard
citation:
ama: Ramshaw BJ, Harrison N, Sebastian SE, et al. Broken rotational symmetry on
the Fermi surface of a high-Tc superconductor. npj Quantum Materials. 2017;2(1).
doi:10.1038/s41535-017-0013-z
apa: Ramshaw, B. J., Harrison, N., Sebastian, S. E., Ghannadzadeh, S., Modic, K.
A., Bonn, D. A., … Goddard, P. A. (2017). Broken rotational symmetry on the Fermi
surface of a high-Tc superconductor. Npj Quantum Materials. Springer Nature.
https://doi.org/10.1038/s41535-017-0013-z
chicago: Ramshaw, B. J., N. Harrison, S. E. Sebastian, S. Ghannadzadeh, Kimberly
A Modic, D. A. Bonn, W. N. Hardy, Ruixing Liang, and P. A. Goddard. “Broken Rotational
Symmetry on the Fermi Surface of a High-Tc Superconductor.” Npj Quantum Materials.
Springer Nature, 2017. https://doi.org/10.1038/s41535-017-0013-z.
ieee: B. J. Ramshaw et al., “Broken rotational symmetry on the Fermi surface
of a high-Tc superconductor,” npj Quantum Materials, vol. 2, no. 1. Springer
Nature, 2017.
ista: Ramshaw BJ, Harrison N, Sebastian SE, Ghannadzadeh S, Modic KA, Bonn DA, Hardy
WN, Liang R, Goddard PA. 2017. Broken rotational symmetry on the Fermi surface
of a high-Tc superconductor. npj Quantum Materials. 2(1), 8.
mla: Ramshaw, B. J., et al. “Broken Rotational Symmetry on the Fermi Surface of
a High-Tc Superconductor.” Npj Quantum Materials, vol. 2, no. 1, 8, Springer
Nature, 2017, doi:10.1038/s41535-017-0013-z.
short: B.J. Ramshaw, N. Harrison, S.E. Sebastian, S. Ghannadzadeh, K.A. Modic, D.A.
Bonn, W.N. Hardy, R. Liang, P.A. Goddard, Npj Quantum Materials 2 (2017).
date_created: 2019-11-19T13:18:30Z
date_published: 2017-02-13T00:00:00Z
date_updated: 2021-01-12T08:11:40Z
day: '13'
ddc:
- '530'
doi: 10.1038/s41535-017-0013-z
extern: '1'
file:
- access_level: open_access
checksum: 433a26a7e14206e139f3fec2c8ee8623
content_type: application/pdf
creator: dernst
date_created: 2019-11-26T12:57:11Z
date_updated: 2020-07-14T12:47:48Z
file_id: '7115'
file_name: 2017_NPJ_Ramshaw.pdf
file_size: 1383236
relation: main_file
file_date_updated: 2020-07-14T12:47:48Z
has_accepted_license: '1'
intvolume: ' 2'
issue: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
publication: npj Quantum Materials
publication_identifier:
issn:
- 2397-4648
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Broken rotational symmetry on the Fermi surface of a high-Tc superconductor
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2017'
...
---
_id: '7066'
abstract:
- lang: eng
text: The excitonic insulator phase has long been predicted to form in proximity
to a band gap opening in the underlying band structure. The character of the pairing
is conjectured to crossover from weak (BCS-like) to strong coupling (BEC-like)
as the underlying band structure is tuned from the metallic to the insulating
side of the gap opening. Here we report the high-magnetic field phase diagram
of graphite to exhibit just such a crossover. By way of comprehensive angle-resolved
magnetoresistance measurements, we demonstrate that the underlying band gap opening
occurs inside the magnetic field-induced phase, paving the way for a systematic
study of the BCS-BEC-like crossover by means of conventional condensed matter
probes.
article_number: '1733'
article_processing_charge: No
article_type: original
author:
- first_name: Z.
full_name: Zhu, Z.
last_name: Zhu
- first_name: R. D.
full_name: McDonald, R. D.
last_name: McDonald
- first_name: A.
full_name: Shekhter, A.
last_name: Shekhter
- first_name: B. J.
full_name: Ramshaw, B. J.
last_name: Ramshaw
- first_name: Kimberly A
full_name: Modic, Kimberly A
id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425
last_name: Modic
orcid: 0000-0001-9760-3147
- first_name: F. F.
full_name: Balakirev, F. F.
last_name: Balakirev
- first_name: N.
full_name: Harrison, N.
last_name: Harrison
citation:
ama: Zhu Z, McDonald RD, Shekhter A, et al. Magnetic field tuning of an excitonic
insulator between the weak and strong coupling regimes in quantum limit graphite.
Scientific Reports. 2017;7. doi:10.1038/s41598-017-01693-5
apa: Zhu, Z., McDonald, R. D., Shekhter, A., Ramshaw, B. J., Modic, K. A., Balakirev,
F. F., & Harrison, N. (2017). Magnetic field tuning of an excitonic insulator
between the weak and strong coupling regimes in quantum limit graphite. Scientific
Reports. Springer Nature. https://doi.org/10.1038/s41598-017-01693-5
chicago: Zhu, Z., R. D. McDonald, A. Shekhter, B. J. Ramshaw, Kimberly A Modic,
F. F. Balakirev, and N. Harrison. “Magnetic Field Tuning of an Excitonic Insulator
between the Weak and Strong Coupling Regimes in Quantum Limit Graphite.” Scientific
Reports. Springer Nature, 2017. https://doi.org/10.1038/s41598-017-01693-5.
ieee: Z. Zhu et al., “Magnetic field tuning of an excitonic insulator between
the weak and strong coupling regimes in quantum limit graphite,” Scientific
Reports, vol. 7. Springer Nature, 2017.
ista: Zhu Z, McDonald RD, Shekhter A, Ramshaw BJ, Modic KA, Balakirev FF, Harrison
N. 2017. Magnetic field tuning of an excitonic insulator between the weak and
strong coupling regimes in quantum limit graphite. Scientific Reports. 7, 1733.
mla: Zhu, Z., et al. “Magnetic Field Tuning of an Excitonic Insulator between the
Weak and Strong Coupling Regimes in Quantum Limit Graphite.” Scientific Reports,
vol. 7, 1733, Springer Nature, 2017, doi:10.1038/s41598-017-01693-5.
short: Z. Zhu, R.D. McDonald, A. Shekhter, B.J. Ramshaw, K.A. Modic, F.F. Balakirev,
N. Harrison, Scientific Reports 7 (2017).
date_created: 2019-11-19T13:17:46Z
date_published: 2017-05-04T00:00:00Z
date_updated: 2021-01-12T08:11:40Z
day: '04'
ddc:
- '530'
doi: 10.1038/s41598-017-01693-5
extern: '1'
file:
- access_level: open_access
checksum: 801f80b04ecd1ead95c8ab9827cbe067
content_type: application/pdf
creator: dernst
date_created: 2019-11-26T11:58:58Z
date_updated: 2020-07-14T12:47:48Z
file_id: '7111'
file_name: 2017_ScientificReports_Zhu.pdf
file_size: 1571567
relation: main_file
file_date_updated: 2020-07-14T12:47:48Z
has_accepted_license: '1'
intvolume: ' 7'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
publication: Scientific Reports
publication_identifier:
issn:
- 2045-2322
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Magnetic field tuning of an excitonic insulator between the weak and strong
coupling regimes in quantum limit graphite
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: 7
year: '2017'
...
---
_id: '707'
abstract:
- lang: eng
text: We answer a question of M. Gromov on the waist of the unit ball.
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Roman
full_name: Karasev, Roman
last_name: Karasev
citation:
ama: Akopyan A, Karasev R. A tight estimate for the waist of the ball . Bulletin
of the London Mathematical Society. 2017;49(4):690-693. doi:10.1112/blms.12062
apa: Akopyan, A., & Karasev, R. (2017). A tight estimate for the waist of the
ball . Bulletin of the London Mathematical Society. Wiley-Blackwell. https://doi.org/10.1112/blms.12062
chicago: Akopyan, Arseniy, and Roman Karasev. “A Tight Estimate for the Waist of
the Ball .” Bulletin of the London Mathematical Society. Wiley-Blackwell,
2017. https://doi.org/10.1112/blms.12062.
ieee: A. Akopyan and R. Karasev, “A tight estimate for the waist of the ball ,”
Bulletin of the London Mathematical Society, vol. 49, no. 4. Wiley-Blackwell,
pp. 690–693, 2017.
ista: Akopyan A, Karasev R. 2017. A tight estimate for the waist of the ball . Bulletin
of the London Mathematical Society. 49(4), 690–693.
mla: Akopyan, Arseniy, and Roman Karasev. “A Tight Estimate for the Waist of the
Ball .” Bulletin of the London Mathematical Society, vol. 49, no. 4, Wiley-Blackwell,
2017, pp. 690–93, doi:10.1112/blms.12062.
short: A. Akopyan, R. Karasev, Bulletin of the London Mathematical Society 49 (2017)
690–693.
date_created: 2018-12-11T11:48:02Z
date_published: 2017-08-01T00:00:00Z
date_updated: 2021-01-12T08:11:41Z
day: '01'
department:
- _id: HeEd
doi: 10.1112/blms.12062
ec_funded: 1
intvolume: ' 49'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1608.06279
month: '08'
oa: 1
oa_version: Preprint
page: 690 - 693
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Bulletin of the London Mathematical Society
publication_identifier:
issn:
- '00246093'
publication_status: published
publisher: Wiley-Blackwell
publist_id: '6982'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'A tight estimate for the waist of the ball '
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 49
year: '2017'
...
---
_id: '708'
abstract:
- lang: eng
text: 'In the developing and adult brain, oligodendrocyte precursor cells (OPCs)
are influenced by neuronal activity: they are involved in synaptic signaling with
neurons, and their proliferation and differentiation into myelinating glia can
be altered by transient changes in neuronal firing. An important question that
has been unanswered is whether OPCs can discriminate different patterns of neuronal
activity and respond to them in a distinct way. Here, we demonstrate in brain
slices that the pattern of neuronal activity determines the functional changes
triggered at synapses between axons and OPCs. Furthermore, we show that stimulation
of the corpus callosum at different frequencies in vivo affects proliferation
and differentiation of OPCs in a dissimilar way. Our findings suggest that neurons
do not influence OPCs in “all-or-none” fashion but use their firing pattern to
tune the response and behavior of these nonneuronal cells.'
article_number: e2001993
author:
- first_name: Balint
full_name: Nagy, Balint
id: 30F830CE-02D1-11E9-9BAA-DAF4881429F2
last_name: Nagy
orcid: 0000-0002-4002-4686
- first_name: Anahit
full_name: Hovhannisyan, Anahit
last_name: Hovhannisyan
- first_name: Ruxandra
full_name: Barzan, Ruxandra
last_name: Barzan
- first_name: Ting
full_name: Chen, Ting
last_name: Chen
- first_name: Maria
full_name: Kukley, Maria
last_name: Kukley
citation:
ama: Nagy B, Hovhannisyan A, Barzan R, Chen T, Kukley M. Different patterns of neuronal
activity trigger distinct responses of oligodendrocyte precursor cells in the
corpus callosum. PLoS Biology. 2017;15(8). doi:10.1371/journal.pbio.2001993
apa: Nagy, B., Hovhannisyan, A., Barzan, R., Chen, T., & Kukley, M. (2017).
Different patterns of neuronal activity trigger distinct responses of oligodendrocyte
precursor cells in the corpus callosum. PLoS Biology. Public Library of
Science. https://doi.org/10.1371/journal.pbio.2001993
chicago: Nagy, Balint, Anahit Hovhannisyan, Ruxandra Barzan, Ting Chen, and Maria
Kukley. “Different Patterns of Neuronal Activity Trigger Distinct Responses of
Oligodendrocyte Precursor Cells in the Corpus Callosum.” PLoS Biology.
Public Library of Science, 2017. https://doi.org/10.1371/journal.pbio.2001993.
ieee: B. Nagy, A. Hovhannisyan, R. Barzan, T. Chen, and M. Kukley, “Different patterns
of neuronal activity trigger distinct responses of oligodendrocyte precursor cells
in the corpus callosum,” PLoS Biology, vol. 15, no. 8. Public Library of
Science, 2017.
ista: Nagy B, Hovhannisyan A, Barzan R, Chen T, Kukley M. 2017. Different patterns
of neuronal activity trigger distinct responses of oligodendrocyte precursor cells
in the corpus callosum. PLoS Biology. 15(8), e2001993.
mla: Nagy, Balint, et al. “Different Patterns of Neuronal Activity Trigger Distinct
Responses of Oligodendrocyte Precursor Cells in the Corpus Callosum.” PLoS
Biology, vol. 15, no. 8, e2001993, Public Library of Science, 2017, doi:10.1371/journal.pbio.2001993.
short: B. Nagy, A. Hovhannisyan, R. Barzan, T. Chen, M. Kukley, PLoS Biology 15
(2017).
date_created: 2018-12-11T11:48:03Z
date_published: 2017-08-22T00:00:00Z
date_updated: 2021-01-12T08:11:45Z
day: '22'
ddc:
- '576'
- '610'
department:
- _id: SaSi
doi: 10.1371/journal.pbio.2001993
file:
- access_level: open_access
checksum: 0c974f430682dc832ea7b27ab5a93124
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:35Z
date_updated: 2020-07-14T12:47:49Z
file_id: '5156'
file_name: IST-2017-889-v1+1_journal.pbio.2001993.pdf
file_size: 18155365
relation: main_file
file_date_updated: 2020-07-14T12:47:49Z
has_accepted_license: '1'
intvolume: ' 15'
issue: '8'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
publication: PLoS Biology
publication_identifier:
issn:
- '15449173'
publication_status: published
publisher: Public Library of Science
publist_id: '6983'
pubrep_id: '889'
quality_controlled: '1'
scopus_import: 1
status: public
title: Different patterns of neuronal activity trigger distinct responses of oligodendrocyte
precursor cells in the corpus callosum
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: 15
year: '2017'
...
---
_id: '710'
abstract:
- lang: eng
text: 'We revisit the problem of estimating entropy of discrete distributions from
independent samples, studied recently by Acharya, Orlitsky, Suresh and Tyagi (SODA
2015), improving their upper and lower bounds on the necessary sample size n.
For estimating Renyi entropy of order alpha, up to constant accuracy and error
probability, we show the following * Upper bounds n = O(1) 2^{(1-1/alpha)H_alpha}
for integer alpha>1, as the worst case over distributions with Renyi entropy
equal to H_alpha. * Lower bounds n = Omega(1) K^{1-1/alpha} for any real alpha>1,
with the constant being an inverse polynomial of the accuracy, as the worst case
over all distributions on K elements. Our upper bounds essentially replace the
alphabet size by a factor exponential in the entropy, which offers improvements
especially in low or medium entropy regimes (interesting for example in anomaly
detection). As for the lower bounds, our proof explicitly shows how the complexity
depends on both alphabet and accuracy, partially solving the open problem posted
in previous works. The argument for upper bounds derives a clean identity for
the variance of falling-power sum of a multinomial distribution. Our approach
for lower bounds utilizes convex optimization to find a distribution with possibly
worse estimation performance, and may be of independent interest as a tool to
work with Le Cam’s two point method. '
alternative_title:
- LIPIcs
article_number: '20'
author:
- first_name: Maciej
full_name: Obremski, Maciej
last_name: Obremski
- first_name: Maciej
full_name: Skórski, Maciej
id: EC09FA6A-02D0-11E9-8223-86B7C91467DD
last_name: Skórski
citation:
ama: 'Obremski M, Skórski M. Renyi entropy estimation revisited. In: Vol 81. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.APPROX-RANDOM.2017.20'
apa: 'Obremski, M., & Skórski, M. (2017). Renyi entropy estimation revisited
(Vol. 81). Presented at the 20th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, APPROX, Berkeley, USA: Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.20'
chicago: Obremski, Maciej, and Maciej Skórski. “Renyi Entropy Estimation Revisited,”
Vol. 81. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.20.
ieee: M. Obremski and M. Skórski, “Renyi entropy estimation revisited,” presented
at the 20th International Workshop on Approximation Algorithms for Combinatorial
Optimization Problems, APPROX, Berkeley, USA, 2017, vol. 81.
ista: Obremski M, Skórski M. 2017. Renyi entropy estimation revisited. 20th International
Workshop on Approximation Algorithms for Combinatorial Optimization Problems,
APPROX, LIPIcs, vol. 81, 20.
mla: Obremski, Maciej, and Maciej Skórski. Renyi Entropy Estimation Revisited.
Vol. 81, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.APPROX-RANDOM.2017.20.
short: M. Obremski, M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2017.
conference:
end_date: 2017-08-18
location: Berkeley, USA
name: 20th International Workshop on Approximation Algorithms for Combinatorial
Optimization Problems, APPROX
start_date: 2017-08-18
date_created: 2018-12-11T11:48:04Z
date_published: 2017-08-01T00:00:00Z
date_updated: 2021-01-12T08:11:50Z
day: '01'
ddc:
- '005'
- '600'
department:
- _id: KrPi
doi: 10.4230/LIPIcs.APPROX-RANDOM.2017.20
ec_funded: 1
file:
- access_level: open_access
checksum: 89225c7dcec2c93838458c9102858985
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:10Z
date_updated: 2020-07-14T12:47:49Z
file_id: '4991'
file_name: IST-2017-888-v1+1_LIPIcs-APPROX-RANDOM-2017-20.pdf
file_size: 604813
relation: main_file
file_date_updated: 2020-07-14T12:47:49Z
has_accepted_license: '1'
intvolume: ' 81'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_identifier:
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '6979'
pubrep_id: '888'
quality_controlled: '1'
scopus_import: 1
status: public
title: Renyi entropy estimation revisited
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 81
year: '2017'
...