---
_id: '405'
abstract:
- lang: eng
text: We investigate the quantum Jensen divergences from the viewpoint of joint
convexity. It turns out that the set of the functions which generate jointly convex
quantum Jensen divergences on positive matrices coincides with the Matrix Entropy
Class which has been introduced by Chen and Tropp quite recently.
acknowledgement: The author was supported by the ISTFELLOW program of the Institute
of Science and Technology Austria (project code IC1027FELL01) and partially supported
by the Hungarian National Research, Development and Innovation Office – NKFIH (grant
no. K124152)
article_processing_charge: No
article_type: original
author:
- first_name: Daniel
full_name: Virosztek, Daniel
id: 48DB45DA-F248-11E8-B48F-1D18A9856A87
last_name: Virosztek
orcid: 0000-0003-1109-5511
citation:
ama: Virosztek D. Jointly convex quantum Jensen divergences. Linear Algebra and
Its Applications. 2019;576:67-78. doi:10.1016/j.laa.2018.03.002
apa: Virosztek, D. (2019). Jointly convex quantum Jensen divergences. Linear
Algebra and Its Applications. Elsevier. https://doi.org/10.1016/j.laa.2018.03.002
chicago: Virosztek, Daniel. “Jointly Convex Quantum Jensen Divergences.” Linear
Algebra and Its Applications. Elsevier, 2019. https://doi.org/10.1016/j.laa.2018.03.002.
ieee: D. Virosztek, “Jointly convex quantum Jensen divergences,” Linear Algebra
and Its Applications, vol. 576. Elsevier, pp. 67–78, 2019.
ista: Virosztek D. 2019. Jointly convex quantum Jensen divergences. Linear Algebra
and Its Applications. 576, 67–78.
mla: Virosztek, Daniel. “Jointly Convex Quantum Jensen Divergences.” Linear Algebra
and Its Applications, vol. 576, Elsevier, 2019, pp. 67–78, doi:10.1016/j.laa.2018.03.002.
short: D. Virosztek, Linear Algebra and Its Applications 576 (2019) 67–78.
date_created: 2018-12-11T11:46:17Z
date_published: 2019-09-01T00:00:00Z
date_updated: 2023-08-24T14:31:47Z
day: '01'
department:
- _id: LaEr
doi: 10.1016/j.laa.2018.03.002
ec_funded: 1
external_id:
arxiv:
- '1712.05324'
isi:
- '000470955300005'
intvolume: ' 576'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1712.05324
month: '09'
oa: 1
oa_version: Preprint
page: 67-78
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Linear Algebra and Its Applications
publication_status: published
publisher: Elsevier
publist_id: '7424'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Jointly convex quantum Jensen divergences
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 576
year: '2019'
...
---
_id: '175'
abstract:
- lang: eng
text: An upper bound sieve for rational points on suitable varieties isdeveloped,
together with applications tocounting rational points in thin sets,to local solubility
in families, and to the notion of “friable” rational pointswith respect to divisors.
In the special case of quadrics, sharper estimates areobtained by developing a
version of the Selberg sieve for rational points.
article_processing_charge: No
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
- first_name: Daniel
full_name: Loughran, Daniel
last_name: Loughran
citation:
ama: Browning TD, Loughran D. Sieving rational points on varieties. Transactions
of the American Mathematical Society. 2019;371(8):5757-5785. doi:10.1090/tran/7514
apa: Browning, T. D., & Loughran, D. (2019). Sieving rational points on varieties.
Transactions of the American Mathematical Society. American Mathematical
Society. https://doi.org/10.1090/tran/7514
chicago: Browning, Timothy D, and Daniel Loughran. “Sieving Rational Points on Varieties.”
Transactions of the American Mathematical Society. American Mathematical
Society, 2019. https://doi.org/10.1090/tran/7514.
ieee: T. D. Browning and D. Loughran, “Sieving rational points on varieties,” Transactions
of the American Mathematical Society, vol. 371, no. 8. American Mathematical
Society, pp. 5757–5785, 2019.
ista: Browning TD, Loughran D. 2019. Sieving rational points on varieties. Transactions
of the American Mathematical Society. 371(8), 5757–5785.
mla: Browning, Timothy D., and Daniel Loughran. “Sieving Rational Points on Varieties.”
Transactions of the American Mathematical Society, vol. 371, no. 8, American
Mathematical Society, 2019, pp. 5757–85, doi:10.1090/tran/7514.
short: T.D. Browning, D. Loughran, Transactions of the American Mathematical Society
371 (2019) 5757–5785.
date_created: 2018-12-11T11:45:01Z
date_published: 2019-04-15T00:00:00Z
date_updated: 2023-08-24T14:34:56Z
day: '15'
department:
- _id: TiBr
doi: 10.1090/tran/7514
external_id:
arxiv:
- '1705.01999'
isi:
- '000464034200019'
intvolume: ' 371'
isi: 1
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1705.01999
month: '04'
oa: 1
oa_version: Preprint
page: 5757-5785
publication: Transactions of the American Mathematical Society
publication_identifier:
eissn:
- '10886850'
issn:
- '00029947'
publication_status: published
publisher: American Mathematical Society
publist_id: '7746'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sieving rational points on varieties
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 371
year: '2019'
...
---
_id: '319'
abstract:
- lang: eng
text: We study spaces of modelled distributions with singular behaviour near the
boundary of a domain that, in the context of the theory of regularity structures,
allow one to give robust solution theories for singular stochastic PDEs with boundary
conditions. The calculus of modelled distributions established in Hairer (Invent
Math 198(2):269–504, 2014. https://doi.org/10.1007/s00222-014-0505-4) is extended
to this setting. We formulate and solve fixed point problems in these spaces with
a class of kernels that is sufficiently large to cover in particular the Dirichlet
and Neumann heat kernels. These results are then used to provide solution theories
for the KPZ equation with Dirichlet and Neumann boundary conditions and for the
2D generalised parabolic Anderson model with Dirichlet boundary conditions. In
the case of the KPZ equation with Neumann boundary conditions, we show that, depending
on the class of mollifiers one considers, a “boundary renormalisation” takes place.
In other words, there are situations in which a certain boundary condition is
applied to an approximation to the KPZ equation, but the limiting process is the
Hopf–Cole solution to the KPZ equation with a different boundary condition.
acknowledgement: "MG thanks the support of the LMS Postdoctoral Mobility Grant.\r\n\r\n"
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Mate
full_name: Gerencser, Mate
id: 44ECEDF2-F248-11E8-B48F-1D18A9856A87
last_name: Gerencser
- first_name: Martin
full_name: Hairer, Martin
last_name: Hairer
citation:
ama: Gerencser M, Hairer M. Singular SPDEs in domains with boundaries. Probability
Theory and Related Fields. 2019;173(3-4):697–758. doi:10.1007/s00440-018-0841-1
apa: Gerencser, M., & Hairer, M. (2019). Singular SPDEs in domains with boundaries.
Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-018-0841-1
chicago: Gerencser, Mate, and Martin Hairer. “Singular SPDEs in Domains with Boundaries.”
Probability Theory and Related Fields. Springer, 2019. https://doi.org/10.1007/s00440-018-0841-1.
ieee: M. Gerencser and M. Hairer, “Singular SPDEs in domains with boundaries,” Probability
Theory and Related Fields, vol. 173, no. 3–4. Springer, pp. 697–758, 2019.
ista: Gerencser M, Hairer M. 2019. Singular SPDEs in domains with boundaries. Probability
Theory and Related Fields. 173(3–4), 697–758.
mla: Gerencser, Mate, and Martin Hairer. “Singular SPDEs in Domains with Boundaries.”
Probability Theory and Related Fields, vol. 173, no. 3–4, Springer, 2019,
pp. 697–758, doi:10.1007/s00440-018-0841-1.
short: M. Gerencser, M. Hairer, Probability Theory and Related Fields 173 (2019)
697–758.
date_created: 2018-12-11T11:45:48Z
date_published: 2019-04-01T00:00:00Z
date_updated: 2023-08-24T14:38:32Z
day: '01'
ddc:
- '510'
department:
- _id: JaMa
doi: 10.1007/s00440-018-0841-1
external_id:
isi:
- '000463613800001'
file:
- access_level: open_access
checksum: 288d16ef7291242f485a9660979486e3
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T16:25:24Z
date_updated: 2020-07-14T12:46:03Z
file_id: '5722'
file_name: 2018_ProbTheory_Gerencser.pdf
file_size: 893182
relation: main_file
file_date_updated: 2020-07-14T12:46:03Z
has_accepted_license: '1'
intvolume: ' 173'
isi: 1
issue: 3-4
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 697–758
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Probability Theory and Related Fields
publication_identifier:
eissn:
- '14322064'
issn:
- '01788051'
publication_status: published
publisher: Springer
publist_id: '7546'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Singular SPDEs in domains with boundaries
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 173
year: '2019'
...
---
_id: '429'
abstract:
- lang: eng
text: We consider real symmetric or complex hermitian random matrices with correlated
entries. We prove local laws for the resolvent and universality of the local eigenvalue
statistics in the bulk of the spectrum. The correlations have fast decay but are
otherwise of general form. The key novelty is the detailed stability analysis
of the corresponding matrix valued Dyson equation whose solution is the deterministic
limit of the resolvent.
acknowledgement: "Open access funding provided by Institute of Science and Technology
(IST Austria).\r\n"
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Oskari H
full_name: Ajanki, Oskari H
id: 36F2FB7E-F248-11E8-B48F-1D18A9856A87
last_name: Ajanki
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Torben H
full_name: Krüger, Torben H
id: 3020C786-F248-11E8-B48F-1D18A9856A87
last_name: Krüger
orcid: 0000-0002-4821-3297
citation:
ama: Ajanki OH, Erdös L, Krüger TH. Stability of the matrix Dyson equation and random
matrices with correlations. Probability Theory and Related Fields. 2019;173(1-2):293–373.
doi:10.1007/s00440-018-0835-z
apa: Ajanki, O. H., Erdös, L., & Krüger, T. H. (2019). Stability of the matrix
Dyson equation and random matrices with correlations. Probability Theory and
Related Fields. Springer. https://doi.org/10.1007/s00440-018-0835-z
chicago: Ajanki, Oskari H, László Erdös, and Torben H Krüger. “Stability of the
Matrix Dyson Equation and Random Matrices with Correlations.” Probability Theory
and Related Fields. Springer, 2019. https://doi.org/10.1007/s00440-018-0835-z.
ieee: O. H. Ajanki, L. Erdös, and T. H. Krüger, “Stability of the matrix Dyson equation
and random matrices with correlations,” Probability Theory and Related Fields,
vol. 173, no. 1–2. Springer, pp. 293–373, 2019.
ista: Ajanki OH, Erdös L, Krüger TH. 2019. Stability of the matrix Dyson equation
and random matrices with correlations. Probability Theory and Related Fields.
173(1–2), 293–373.
mla: Ajanki, Oskari H., et al. “Stability of the Matrix Dyson Equation and Random
Matrices with Correlations.” Probability Theory and Related Fields, vol.
173, no. 1–2, Springer, 2019, pp. 293–373, doi:10.1007/s00440-018-0835-z.
short: O.H. Ajanki, L. Erdös, T.H. Krüger, Probability Theory and Related Fields
173 (2019) 293–373.
date_created: 2018-12-11T11:46:25Z
date_published: 2019-02-01T00:00:00Z
date_updated: 2023-08-24T14:39:00Z
day: '01'
ddc:
- '510'
department:
- _id: LaEr
doi: 10.1007/s00440-018-0835-z
ec_funded: 1
external_id:
isi:
- '000459396500007'
file:
- access_level: open_access
checksum: f9354fa5c71f9edd17132588f0dc7d01
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T16:12:08Z
date_updated: 2020-07-14T12:46:26Z
file_id: '5720'
file_name: 2018_ProbTheory_Ajanki.pdf
file_size: 1201840
relation: main_file
file_date_updated: 2020-07-14T12:46:26Z
has_accepted_license: '1'
intvolume: ' 173'
isi: 1
issue: 1-2
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 293–373
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Probability Theory and Related Fields
publication_identifier:
eissn:
- '14322064'
issn:
- '01788051'
publication_status: published
publisher: Springer
publist_id: '7394'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Stability of the matrix Dyson equation and random matrices with correlations
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 173
year: '2019'
...
---
_id: '5947'
abstract:
- lang: eng
text: Graph algorithms applied in many applications, including social networks,
communication networks, VLSI design, graphics, and several others, require dynamic
modifications - addition and removal of vertices and/or edges - in the graph.
This paper presents a novel concurrent non-blocking algorithm to implement a dynamic
unbounded directed graph in a shared-memory machine. The addition and removal
operations of vertices and edges are lock-free. For a finite sized graph, the
lookup operations are wait-free. Most significant component of the presented algorithm
is the reachability query in a concurrent graph. The reachability queries in our
algorithm are obstruction-free and thus impose minimal additional synchronization
cost over other operations. We prove that each of the data structure operations
are linearizable. We extensively evaluate a sample C/C++ implementation of the
algorithm through a number of micro-benchmarks. The experimental results show
that the proposed algorithm scales well with the number of threads and on an average
provides 5 to 7x performance improvement over a concurrent graph implementation
using coarse-grained locking.
article_processing_charge: No
author:
- first_name: Bapi
full_name: Chatterjee, Bapi
id: 3C41A08A-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-2742-4028
- first_name: Sathya
full_name: Peri, Sathya
last_name: Peri
- first_name: Muktikanta
full_name: Sa, Muktikanta
last_name: Sa
- first_name: Nandini
full_name: Singhal, Nandini
last_name: Singhal
citation:
ama: 'Chatterjee B, Peri S, Sa M, Singhal N. A simple and practical concurrent non-blocking
unbounded graph with linearizable reachability queries. In: ACM International
Conference Proceeding Series. ACM; 2019:168-177. doi:10.1145/3288599.3288617'
apa: 'Chatterjee, B., Peri, S., Sa, M., & Singhal, N. (2019). A simple and practical
concurrent non-blocking unbounded graph with linearizable reachability queries.
In ACM International Conference Proceeding Series (pp. 168–177). Bangalore,
India: ACM. https://doi.org/10.1145/3288599.3288617'
chicago: Chatterjee, Bapi, Sathya Peri, Muktikanta Sa, and Nandini Singhal. “A Simple
and Practical Concurrent Non-Blocking Unbounded Graph with Linearizable Reachability
Queries.” In ACM International Conference Proceeding Series, 168–77. ACM,
2019. https://doi.org/10.1145/3288599.3288617.
ieee: B. Chatterjee, S. Peri, M. Sa, and N. Singhal, “A simple and practical concurrent
non-blocking unbounded graph with linearizable reachability queries,” in ACM
International Conference Proceeding Series, Bangalore, India, 2019, pp. 168–177.
ista: 'Chatterjee B, Peri S, Sa M, Singhal N. 2019. A simple and practical concurrent
non-blocking unbounded graph with linearizable reachability queries. ACM International
Conference Proceeding Series. ICDCN: Conference on Distributed Computing and Networking,
168–177.'
mla: Chatterjee, Bapi, et al. “A Simple and Practical Concurrent Non-Blocking Unbounded
Graph with Linearizable Reachability Queries.” ACM International Conference
Proceeding Series, ACM, 2019, pp. 168–77, doi:10.1145/3288599.3288617.
short: B. Chatterjee, S. Peri, M. Sa, N. Singhal, in:, ACM International Conference
Proceeding Series, ACM, 2019, pp. 168–177.
conference:
end_date: 2019-01-07
location: Bangalore, India
name: 'ICDCN: Conference on Distributed Computing and Networking'
start_date: 2019-01-04
date_created: 2019-02-10T22:59:17Z
date_published: 2019-01-04T00:00:00Z
date_updated: 2023-08-24T14:41:53Z
day: '04'
department:
- _id: DaAl
doi: 10.1145/3288599.3288617
external_id:
arxiv:
- '1809.00896'
isi:
- '000484491600019'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1809.00896
month: '01'
oa: 1
oa_version: Preprint
page: 168-177
publication: ACM International Conference Proceeding Series
publication_identifier:
isbn:
- '978-1-4503-6094-4 '
publication_status: published
publisher: ACM
quality_controlled: '1'
scopus_import: '1'
status: public
title: A simple and practical concurrent non-blocking unbounded graph with linearizable
reachability queries
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2019'
...
---
_id: '5857'
abstract:
- lang: eng
text: 'A thrackle is a graph drawn in the plane so that every pair of its edges
meet exactly once: either at a common end vertex or in a proper crossing. We prove
that any thrackle of n vertices has at most 1.3984n edges. Quasi-thrackles are
defined similarly, except that every pair of edges that do not share a vertex
are allowed to cross an odd number of times. It is also shown that the maximum
number of edges of a quasi-thrackle on n vertices is [Formula presented](n−1),
and that this bound is best possible for infinitely many values of n.'
article_processing_charge: No
article_type: original
author:
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: János
full_name: Pach, János
last_name: Pach
citation:
ama: 'Fulek R, Pach J. Thrackles: An improved upper bound. Discrete Applied Mathematics.
2019;259(4):266-231. doi:10.1016/j.dam.2018.12.025'
apa: 'Fulek, R., & Pach, J. (2019). Thrackles: An improved upper bound. Discrete
Applied Mathematics. Elsevier. https://doi.org/10.1016/j.dam.2018.12.025'
chicago: 'Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound.”
Discrete Applied Mathematics. Elsevier, 2019. https://doi.org/10.1016/j.dam.2018.12.025.'
ieee: 'R. Fulek and J. Pach, “Thrackles: An improved upper bound,” Discrete Applied
Mathematics, vol. 259, no. 4. Elsevier, pp. 266–231, 2019.'
ista: 'Fulek R, Pach J. 2019. Thrackles: An improved upper bound. Discrete Applied
Mathematics. 259(4), 266–231.'
mla: 'Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound.” Discrete
Applied Mathematics, vol. 259, no. 4, Elsevier, 2019, pp. 266–231, doi:10.1016/j.dam.2018.12.025.'
short: R. Fulek, J. Pach, Discrete Applied Mathematics 259 (2019) 266–231.
date_created: 2019-01-20T22:59:17Z
date_published: 2019-04-30T00:00:00Z
date_updated: 2023-08-24T14:39:33Z
day: '30'
department:
- _id: UlWa
doi: 10.1016/j.dam.2018.12.025
external_id:
arxiv:
- '1708.08037'
isi:
- '000466061100020'
intvolume: ' 259'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1708.08037
month: '04'
oa: 1
oa_version: Preprint
page: 266-231
project:
- _id: 261FA626-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02281
name: Eliminating intersections in drawings of graphs
publication: Discrete Applied Mathematics
publication_identifier:
issn:
- 0166218X
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
record:
- id: '433'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: 'Thrackles: An improved upper bound'
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 259
year: '2019'
...
---
_id: '5944'
abstract:
- lang: eng
text: Understanding the thermodynamics of the duplication process is a fundamental
step towards a comprehensive physical theory of biological systems. However, the
immense complexity of real cells obscures the fundamental tensions between energy
gradients and entropic contributions that underlie duplication. The study of synthetic,
feasible systems reproducing part of the key ingredients of living entities but
overcoming major sources of biological complexity is of great relevance to deepen
the comprehension of the fundamental thermodynamic processes underlying life and
its prevalence. In this paper an abstract—yet realistic—synthetic system made
of small synthetic protocell aggregates is studied in detail. A fundamental relation
between free energy and entropic gradients is derived for a general, non-equilibrium
scenario, setting the thermodynamic conditions for the occurrence and prevalence
of duplication phenomena. This relation sets explicitly how the energy gradients
invested in creating and maintaining structural—and eventually, functional—elements
of the system must always compensate the entropic gradients, whose contributions
come from changes in the translational, configurational, and macrostate entropies,
as well as from dissipation due to irreversible transitions. Work/energy relations
are also derived, defining lower bounds on the energy required for the duplication
event to take place. A specific example including real ternary emulsions is provided
in order to grasp the orders of magnitude involved in the problem. It is found
that the minimal work invested over the system to trigger a duplication event
is around ~ 10−13J , which results, in the case of duplication of all the vesicles
contained in a liter of emulsion, in an amount of energy around ~ 1kJ . Without
aiming to describe a truly biological process of duplication, this theoretical
contribution seeks to explicitly define and identify the key actors that participate
in it.
article_number: '9'
article_processing_charge: No
author:
- first_name: Bernat
full_name: Corominas-Murtra, Bernat
id: 43BE2298-F248-11E8-B48F-1D18A9856A87
last_name: Corominas-Murtra
orcid: 0000-0001-9806-5643
citation:
ama: Corominas-Murtra B. Thermodynamics of duplication thresholds in synthetic protocell
systems. Life. 2019;9(1). doi:10.3390/life9010009
apa: Corominas-Murtra, B. (2019). Thermodynamics of duplication thresholds in synthetic
protocell systems. Life. MDPI. https://doi.org/10.3390/life9010009
chicago: Corominas-Murtra, Bernat. “Thermodynamics of Duplication Thresholds in
Synthetic Protocell Systems.” Life. MDPI, 2019. https://doi.org/10.3390/life9010009.
ieee: B. Corominas-Murtra, “Thermodynamics of duplication thresholds in synthetic
protocell systems,” Life, vol. 9, no. 1. MDPI, 2019.
ista: Corominas-Murtra B. 2019. Thermodynamics of duplication thresholds in synthetic
protocell systems. Life. 9(1), 9.
mla: Corominas-Murtra, Bernat. “Thermodynamics of Duplication Thresholds in Synthetic
Protocell Systems.” Life, vol. 9, no. 1, 9, MDPI, 2019, doi:10.3390/life9010009.
short: B. Corominas-Murtra, Life 9 (2019).
date_created: 2019-02-10T22:59:15Z
date_published: 2019-01-15T00:00:00Z
date_updated: 2023-08-24T14:43:41Z
day: '15'
ddc:
- '570'
department:
- _id: EdHa
doi: 10.3390/life9010009
external_id:
isi:
- '000464125500001'
file:
- access_level: open_access
checksum: 7d2322cd96ace41959909b66702d5cf4
content_type: application/pdf
creator: dernst
date_created: 2019-02-11T10:45:27Z
date_updated: 2020-07-14T12:47:13Z
file_id: '5951'
file_name: 2019_Life_Corominas.pdf
file_size: 963454
relation: main_file
file_date_updated: 2020-07-14T12:47:13Z
has_accepted_license: '1'
intvolume: ' 9'
isi: 1
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
publication: Life
publication_identifier:
eissn:
- '20751729'
publication_status: published
publisher: MDPI
quality_controlled: '1'
scopus_import: '1'
status: public
title: Thermodynamics of duplication thresholds in synthetic protocell systems
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 9
year: '2019'
...
---
_id: '6029'
abstract:
- lang: eng
text: Protein micropatterning has become an important tool for many biomedical applications
as well as in academic research. Current techniques that allow to reduce the feature
size of patterns below 1 μm are, however, often costly and require sophisticated
equipment. We present here a straightforward and convenient method to generate
highly condensed nanopatterns of proteins without the need for clean room facilities
or expensive equipment. Our approach is based on nanocontact printing and allows
for the fabrication of protein patterns with feature sizes of 80 nm and periodicities
down to 140 nm. This was made possible by the use of the material X-poly(dimethylsiloxane)
(X-PDMS) in a two-layer stamp layout for protein printing. In a proof of principle,
different proteins at various scales were printed and the pattern quality was
evaluated by atomic force microscopy (AFM) and super-resolution fluorescence microscopy.
article_number: '655'
article_processing_charge: No
author:
- first_name: Marco
full_name: Lindner, Marco
last_name: Lindner
- first_name: Aliz
full_name: Tresztenyak, Aliz
last_name: Tresztenyak
- first_name: Gergö
full_name: Fülöp, Gergö
last_name: Fülöp
- first_name: Wiebke
full_name: Jahr, Wiebke
id: 425C1CE8-F248-11E8-B48F-1D18A9856A87
last_name: Jahr
- first_name: Adrian
full_name: Prinz, Adrian
last_name: Prinz
- first_name: Iris
full_name: Prinz, Iris
last_name: Prinz
- first_name: Johann G
full_name: Danzl, Johann G
id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87
last_name: Danzl
orcid: 0000-0001-8559-3973
- first_name: Gerhard J.
full_name: Schütz, Gerhard J.
last_name: Schütz
- first_name: Eva
full_name: Sevcsik, Eva
last_name: Sevcsik
citation:
ama: Lindner M, Tresztenyak A, Fülöp G, et al. A fast and simple contact printing
approach to generate 2D protein nanopatterns. Frontiers in Chemistry. 2019;6.
doi:10.3389/fchem.2018.00655
apa: Lindner, M., Tresztenyak, A., Fülöp, G., Jahr, W., Prinz, A., Prinz, I., …
Sevcsik, E. (2019). A fast and simple contact printing approach to generate 2D
protein nanopatterns. Frontiers in Chemistry. Frontiers Media S.A. https://doi.org/10.3389/fchem.2018.00655
chicago: Lindner, Marco, Aliz Tresztenyak, Gergö Fülöp, Wiebke Jahr, Adrian Prinz,
Iris Prinz, Johann G Danzl, Gerhard J. Schütz, and Eva Sevcsik. “A Fast and Simple
Contact Printing Approach to Generate 2D Protein Nanopatterns.” Frontiers in
Chemistry. Frontiers Media S.A., 2019. https://doi.org/10.3389/fchem.2018.00655.
ieee: M. Lindner et al., “A fast and simple contact printing approach to
generate 2D protein nanopatterns,” Frontiers in Chemistry, vol. 6. Frontiers
Media S.A., 2019.
ista: Lindner M, Tresztenyak A, Fülöp G, Jahr W, Prinz A, Prinz I, Danzl JG, Schütz
GJ, Sevcsik E. 2019. A fast and simple contact printing approach to generate 2D
protein nanopatterns. Frontiers in Chemistry. 6, 655.
mla: Lindner, Marco, et al. “A Fast and Simple Contact Printing Approach to Generate
2D Protein Nanopatterns.” Frontiers in Chemistry, vol. 6, 655, Frontiers
Media S.A., 2019, doi:10.3389/fchem.2018.00655.
short: M. Lindner, A. Tresztenyak, G. Fülöp, W. Jahr, A. Prinz, I. Prinz, J.G. Danzl,
G.J. Schütz, E. Sevcsik, Frontiers in Chemistry 6 (2019).
date_created: 2019-02-17T22:59:24Z
date_published: 2019-01-24T00:00:00Z
date_updated: 2023-08-24T14:45:38Z
day: '24'
ddc:
- '540'
department:
- _id: JoDa
doi: 10.3389/fchem.2018.00655
external_id:
isi:
- '000456718000001'
file:
- access_level: open_access
checksum: 7841301d7c53b56ef873791b4b6f7b24
content_type: application/pdf
creator: dernst
date_created: 2019-02-18T15:10:34Z
date_updated: 2020-07-14T12:47:17Z
file_id: '6039'
file_name: 2019_frontiers_Lindner.pdf
file_size: 1766820
relation: main_file
file_date_updated: 2020-07-14T12:47:17Z
has_accepted_license: '1'
intvolume: ' 6'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
publication: Frontiers in Chemistry
publication_identifier:
eissn:
- '22962646'
publication_status: published
publisher: Frontiers Media S.A.
quality_controlled: '1'
scopus_import: '1'
status: public
title: A fast and simple contact printing approach to generate 2D protein nanopatterns
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 6
year: '2019'
...
---
_id: '6028'
abstract:
- lang: eng
text: We give a construction allowing us to build local renormalized solutions to
general quasilinear stochastic PDEs within the theory of regularity structures,
thus greatly generalizing the recent results of [1, 5, 11]. Loosely speaking,
our construction covers quasilinear variants of all classes of equations for which
the general construction of [3, 4, 7] applies, including in particular one‐dimensional
systems with KPZ‐type nonlinearities driven by space‐time white noise. In a less
singular and more specific case, we furthermore show that the counterterms introduced
by the renormalization procedure are given by local functionals of the solution.
The main feature of our construction is that it allows exploitation of a number
of existing results developed for the semilinear case, so that the number of additional
arguments it requires is relatively small.
article_processing_charge: Yes (via OA deal)
author:
- first_name: Mate
full_name: Gerencser, Mate
id: 44ECEDF2-F248-11E8-B48F-1D18A9856A87
last_name: Gerencser
- first_name: Martin
full_name: Hairer, Martin
last_name: Hairer
citation:
ama: Gerencser M, Hairer M. A solution theory for quasilinear singular SPDEs. Communications
on Pure and Applied Mathematics. 2019;72(9):1983-2005. doi:10.1002/cpa.21816
apa: Gerencser, M., & Hairer, M. (2019). A solution theory for quasilinear singular
SPDEs. Communications on Pure and Applied Mathematics. Wiley. https://doi.org/10.1002/cpa.21816
chicago: Gerencser, Mate, and Martin Hairer. “A Solution Theory for Quasilinear
Singular SPDEs.” Communications on Pure and Applied Mathematics. Wiley,
2019. https://doi.org/10.1002/cpa.21816.
ieee: M. Gerencser and M. Hairer, “A solution theory for quasilinear singular SPDEs,”
Communications on Pure and Applied Mathematics, vol. 72, no. 9. Wiley,
pp. 1983–2005, 2019.
ista: Gerencser M, Hairer M. 2019. A solution theory for quasilinear singular SPDEs.
Communications on Pure and Applied Mathematics. 72(9), 1983–2005.
mla: Gerencser, Mate, and Martin Hairer. “A Solution Theory for Quasilinear Singular
SPDEs.” Communications on Pure and Applied Mathematics, vol. 72, no. 9,
Wiley, 2019, pp. 1983–2005, doi:10.1002/cpa.21816.
short: M. Gerencser, M. Hairer, Communications on Pure and Applied Mathematics 72
(2019) 1983–2005.
date_created: 2019-02-17T22:59:24Z
date_published: 2019-02-08T00:00:00Z
date_updated: 2023-08-24T14:44:31Z
day: '08'
ddc:
- '500'
department:
- _id: JaMa
doi: 10.1002/cpa.21816
external_id:
isi:
- '000475465000003'
file:
- access_level: open_access
checksum: 09aec427eb48c0f96a1cce9ff53f013b
content_type: application/pdf
creator: kschuh
date_created: 2020-01-07T13:25:55Z
date_updated: 2020-07-14T12:47:17Z
file_id: '7237'
file_name: 2019_Wiley_Gerencser.pdf
file_size: 381350
relation: main_file
file_date_updated: 2020-07-14T12:47:17Z
has_accepted_license: '1'
intvolume: ' 72'
isi: 1
issue: '9'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 1983-2005
publication: Communications on Pure and Applied Mathematics
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: A solution theory for quasilinear singular SPDEs
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 72
year: '2019'
...
---
_id: '5948'
abstract:
- lang: eng
text: We study the termination problem for nondeterministic probabilistic programs.
We consider the bounded termination problem that asks whether the supremum of
the expected termination time over all schedulers is bounded. First, we show that
ranking supermartingales (RSMs) are both sound and complete for proving bounded
termination over nondeterministic probabilistic programs. For nondeterministic
probabilistic programs a previous result claimed that RSMs are not complete for
bounded termination, whereas our result corrects the previous flaw and establishes
completeness with a rigorous proof. Second, we present the first sound approach
to establish lower bounds on expected termination time through RSMs.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Hongfei
full_name: Fu, Hongfei
last_name: Fu
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
citation:
ama: 'Fu H, Chatterjee K. Termination of nondeterministic probabilistic programs.
In: International Conference on Verification, Model Checking, and Abstract
Interpretation. Vol 11388. Springer Nature; 2019:468-490. doi:10.1007/978-3-030-11245-5_22'
apa: 'Fu, H., & Chatterjee, K. (2019). Termination of nondeterministic probabilistic
programs. In International Conference on Verification, Model Checking, and
Abstract Interpretation (Vol. 11388, pp. 468–490). Cascais, Portugal: Springer
Nature. https://doi.org/10.1007/978-3-030-11245-5_22'
chicago: Fu, Hongfei, and Krishnendu Chatterjee. “Termination of Nondeterministic
Probabilistic Programs.” In International Conference on Verification, Model
Checking, and Abstract Interpretation, 11388:468–90. Springer Nature, 2019.
https://doi.org/10.1007/978-3-030-11245-5_22.
ieee: H. Fu and K. Chatterjee, “Termination of nondeterministic probabilistic programs,”
in International Conference on Verification, Model Checking, and Abstract Interpretation,
Cascais, Portugal, 2019, vol. 11388, pp. 468–490.
ista: 'Fu H, Chatterjee K. 2019. Termination of nondeterministic probabilistic programs.
International Conference on Verification, Model Checking, and Abstract Interpretation.
VMCAI: Verification, Model Checking, and Abstract Interpretation, LNCS, vol. 11388,
468–490.'
mla: Fu, Hongfei, and Krishnendu Chatterjee. “Termination of Nondeterministic Probabilistic
Programs.” International Conference on Verification, Model Checking, and Abstract
Interpretation, vol. 11388, Springer Nature, 2019, pp. 468–90, doi:10.1007/978-3-030-11245-5_22.
short: H. Fu, K. Chatterjee, in:, International Conference on Verification, Model
Checking, and Abstract Interpretation, Springer Nature, 2019, pp. 468–490.
conference:
end_date: 2019-01-15
location: Cascais, Portugal
name: 'VMCAI: Verification, Model Checking, and Abstract Interpretation'
start_date: 2019-01-13
date_created: 2019-02-10T22:59:17Z
date_published: 2019-01-11T00:00:00Z
date_updated: 2023-08-24T14:42:22Z
day: '11'
department:
- _id: KrCh
doi: 10.1007/978-3-030-11245-5_22
external_id:
arxiv:
- '1701.02944'
isi:
- '000931943000022'
intvolume: ' 11388'
isi: 1
language:
- iso: eng
main_file_link:
- url: https://arxiv.org/abs/1701.02944
month: '01'
oa_version: Preprint
page: 468-490
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: International Conference on Verification, Model Checking, and Abstract
Interpretation
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Termination of nondeterministic probabilistic programs
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 11388
year: '2019'
...